File:  [gforth] / gforth / prim
Revision 1.183: download - view: text, annotated - select for diffs
Sun Dec 11 20:08:09 2005 UTC (13 years, 11 months ago) by pazsan
Branches: MAIN
CVS tags: HEAD
Finally made libffi callbacks work

    1: \ Gforth primitives
    2: 
    3: \ Copyright (C) 1995,1996,1997,1998,2000,2003,2004 Free Software Foundation, Inc.
    4: 
    5: \ This file is part of Gforth.
    6: 
    7: \ Gforth is free software; you can redistribute it and/or
    8: \ modify it under the terms of the GNU General Public License
    9: \ as published by the Free Software Foundation; either version 2
   10: \ of the License, or (at your option) any later version.
   11: 
   12: \ This program is distributed in the hope that it will be useful,
   13: \ but WITHOUT ANY WARRANTY; without even the implied warranty of
   14: \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   15: \ GNU General Public License for more details.
   16: 
   17: \ You should have received a copy of the GNU General Public License
   18: \ along with this program; if not, write to the Free Software
   19: \ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
   20: 
   21: 
   22: \ WARNING: This file is processed by m4. Make sure your identifiers
   23: \ don't collide with m4's (e.g. by undefining them).
   24: \ 
   25: \ 
   26: \ 
   27: \ This file contains primitive specifications in the following format:
   28: \ 
   29: \ forth name	( stack effect )	category	[pronunciation]
   30: \ [""glossary entry""]
   31: \ C code
   32: \ [:
   33: \ Forth code]
   34: \ 
   35: \ Note: Fields in brackets are optional.  Word specifications have to
   36: \ be separated by at least one empty line
   37: \
   38: \ Both pronounciation and stack items (in the stack effect) must
   39: \ conform to the C identifier syntax or the C compiler will complain.
   40: \ If you don't have a pronounciation field, the Forth name is used,
   41: \ and has to conform to the C identifier syntax.
   42: \ 
   43: \ These specifications are automatically translated into C-code for the
   44: \ interpreter and into some other files. I hope that your C compiler has
   45: \ decent optimization, otherwise the automatically generated code will
   46: \ be somewhat slow. The Forth version of the code is included for manual
   47: \ compilers, so they will need to compile only the important words.
   48: \ 
   49: \ Note that stack pointer adjustment is performed according to stack
   50: \ effect by automatically generated code and NEXT is automatically
   51: \ appended to the C code. Also, you can use the names in the stack
   52: \ effect in the C code. Stack access is automatic. One exception: if
   53: \ your code does not fall through, the results are not stored into the
   54: \ stack. Use different names on both sides of the '--', if you change a
   55: \ value (some stores to the stack are optimized away).
   56: \
   57: \ For superinstructions the syntax is:
   58: \
   59: \ forth-name [/ c-name] = forth-name forth-name ...
   60: \
   61: \ 
   62: \ The stack variables have the following types:
   63: \ 
   64: \ name matches	type
   65: \ f.*		Bool
   66: \ c.*		Char
   67: \ [nw].*	Cell
   68: \ u.*		UCell
   69: \ d.*		DCell
   70: \ ud.*		UDCell
   71: \ r.*		Float
   72: \ a_.*		Cell *
   73: \ c_.*		Char *
   74: \ f_.*		Float *
   75: \ df_.*		DFloat *
   76: \ sf_.*		SFloat *
   77: \ xt.*		XT
   78: \ f83name.*	F83Name *
   79: 
   80: \E stack data-stack   sp Cell
   81: \E stack fp-stack     fp Float
   82: \E stack return-stack rp Cell
   83: \E
   84: \E get-current prefixes set-current
   85: \E 
   86: \E s" Bool"		single data-stack type-prefix f
   87: \E s" Char"		single data-stack type-prefix c
   88: \E s" Cell"		single data-stack type-prefix n
   89: \E s" Cell"		single data-stack type-prefix w
   90: \E s" UCell"		single data-stack type-prefix u
   91: \E s" DCell"		double data-stack type-prefix d
   92: \E s" UDCell"		double data-stack type-prefix ud
   93: \E s" Float"		single fp-stack   type-prefix r
   94: \E s" Cell *"		single data-stack type-prefix a_
   95: \E s" Char *"		single data-stack type-prefix c_
   96: \E s" Float *"		single data-stack type-prefix f_
   97: \E s" DFloat *"		single data-stack type-prefix df_
   98: \E s" SFloat *"		single data-stack type-prefix sf_
   99: \E s" Xt"		single data-stack type-prefix xt
  100: \E s" struct F83Name *"	single data-stack type-prefix f83name
  101: \E s" struct Longname *" single data-stack type-prefix longname
  102: \E 
  103: \E data-stack   stack-prefix S:
  104: \E fp-stack     stack-prefix F:
  105: \E return-stack stack-prefix R:
  106: \E inst-stream  stack-prefix #
  107: \E 
  108: \E set-current
  109: \E store-optimization on
  110: \E ' noop tail-nextp2 ! \ now INST_TAIL just stores, but does not jump
  111: \E
  112: \E include-skipped-insts on \ static superinsts include cells for components
  113: \E                          \ useful for dynamic programming and
  114: \E                          \ superinsts across entry points
  115: 
  116: \ 
  117: \ 
  118: \ 
  119: \ In addition the following names can be used:
  120: \ ip	the instruction pointer
  121: \ sp	the data stack pointer
  122: \ rp	the parameter stack pointer
  123: \ lp	the locals stack pointer
  124: \ NEXT	executes NEXT
  125: \ cfa	
  126: \ NEXT1	executes NEXT1
  127: \ FLAG(x)	makes a Forth flag from a C flag
  128: \ 
  129: \ 
  130: \ 
  131: \ Percentages in comments are from Koopmans book: average/maximum use
  132: \ (taken from four, not very representative benchmarks)
  133: \ 
  134: \ 
  135: \ 
  136: \ To do:
  137: \ 
  138: \ throw execute, cfa and NEXT1 out?
  139: \ macroize *ip, ip++, *ip++ (pipelining)?
  140: 
  141: \ Stack caching setup
  142: 
  143: ifdef(`STACK_CACHE_FILE', `include(STACK_CACHE_FILE)', `include(cache0.vmg)')
  144: 
  145: \ these m4 macros would collide with identifiers
  146: undefine(`index')
  147: undefine(`shift')
  148: undefine(`symbols')
  149: 
  150: \F 0 [if]
  151: 
  152: \ run-time routines for non-primitives.  They are defined as
  153: \ primitives, because that simplifies things.
  154: 
  155: (docol)	( -- R:a_retaddr )	gforth-internal	paren_docol
  156: ""run-time routine for colon definitions""
  157: #ifdef NO_IP
  158: a_retaddr = next_code;
  159: INST_TAIL;
  160: goto **(Label *)PFA(CFA);
  161: #else /* !defined(NO_IP) */
  162: a_retaddr = (Cell *)IP;
  163: SET_IP((Xt *)PFA(CFA));
  164: #endif /* !defined(NO_IP) */
  165: 
  166: (docon) ( -- w )	gforth-internal	paren_docon
  167: ""run-time routine for constants""
  168: w = *(Cell *)PFA(CFA);
  169: #ifdef NO_IP
  170: INST_TAIL;
  171: goto *next_code;
  172: #endif /* defined(NO_IP) */
  173: 
  174: (dovar) ( -- a_body )	gforth-internal	paren_dovar
  175: ""run-time routine for variables and CREATEd words""
  176: a_body = PFA(CFA);
  177: #ifdef NO_IP
  178: INST_TAIL;
  179: goto *next_code;
  180: #endif /* defined(NO_IP) */
  181: 
  182: (douser) ( -- a_user )	gforth-internal	paren_douser
  183: ""run-time routine for constants""
  184: a_user = (Cell *)(up+*(Cell *)PFA(CFA));
  185: #ifdef NO_IP
  186: INST_TAIL;
  187: goto *next_code;
  188: #endif /* defined(NO_IP) */
  189: 
  190: (dodefer) ( -- )	gforth-internal	paren_dodefer
  191: ""run-time routine for deferred words""
  192: #ifndef NO_IP
  193: ip=IP; /* undo any ip updating that may have been performed by NEXT_P0 */
  194: #endif /* !defined(NO_IP) */
  195: SUPER_END; /* !! probably unnecessary and may lead to measurement errors */
  196: VM_JUMP(EXEC1(*(Xt *)PFA(CFA)));
  197: 
  198: (dofield) ( n1 -- n2 )	gforth-internal	paren_field
  199: ""run-time routine for fields""
  200: n2 = n1 + *(Cell *)PFA(CFA);
  201: #ifdef NO_IP
  202: INST_TAIL;
  203: goto *next_code;
  204: #endif /* defined(NO_IP) */
  205: 
  206: (dodoes) ( -- a_body R:a_retaddr )	gforth-internal	paren_dodoes
  207: ""run-time routine for @code{does>}-defined words""
  208: #ifdef NO_IP
  209: a_retaddr = next_code;
  210: a_body = PFA(CFA);
  211: INST_TAIL;
  212: goto **(Label *)DOES_CODE1(CFA);
  213: #else /* !defined(NO_IP) */
  214: a_retaddr = (Cell *)IP;
  215: a_body = PFA(CFA);
  216: SET_IP(DOES_CODE1(CFA));
  217: #endif /* !defined(NO_IP) */
  218: 
  219: (does-handler) ( -- )	gforth-internal	paren_does_handler
  220: ""just a slot to have an encoding for the DOESJUMP, 
  221: which is no longer used anyway (!! eliminate this)""
  222: 
  223: \F [endif]
  224: 
  225: \g control
  226: 
  227: noop	( -- )		gforth
  228: :
  229:  ;
  230: 
  231: call	( #a_callee -- R:a_retaddr )	new
  232: ""Call callee (a variant of docol with inline argument).""
  233: #ifdef NO_IP
  234: assert(0);
  235: INST_TAIL;
  236: JUMP(a_callee);
  237: #else
  238: #ifdef DEBUG
  239:     {
  240:       CFA_TO_NAME((((Cell *)a_callee)-2));
  241:       fprintf(stderr,"%08lx: call %08lx %.*s\n",(Cell)ip,(Cell)a_callee,
  242: 	      len,name);
  243:     }
  244: #endif
  245: a_retaddr = (Cell *)IP;
  246: SET_IP((Xt *)a_callee);
  247: #endif
  248: 
  249: execute	( xt -- )		core
  250: ""Perform the semantics represented by the execution token, @i{xt}.""
  251: #ifndef NO_IP
  252: ip=IP;
  253: #endif
  254: SUPER_END;
  255: VM_JUMP(EXEC1(xt));
  256: 
  257: perform	( a_addr -- )	gforth
  258: ""@code{@@ execute}.""
  259: /* and pfe */
  260: #ifndef NO_IP
  261: ip=IP;
  262: #endif
  263: SUPER_END;
  264: VM_JUMP(EXEC1(*(Xt *)a_addr));
  265: :
  266:  @ execute ;
  267: 
  268: ;s	( R:w -- )		gforth	semis
  269: ""The primitive compiled by @code{EXIT}.""
  270: #ifdef NO_IP
  271: INST_TAIL;
  272: goto *(void *)w;
  273: #else
  274: SET_IP((Xt *)w);
  275: #endif
  276: 
  277: unloop	( R:w1 R:w2 -- )	core
  278: /* !! alias for 2rdrop */
  279: :
  280:  r> rdrop rdrop >r ;
  281: 
  282: lit-perform	( #a_addr -- )	new	lit_perform
  283: #ifndef NO_IP
  284: ip=IP;
  285: #endif
  286: SUPER_END;
  287: VM_JUMP(EXEC1(*(Xt *)a_addr));
  288: 
  289: does-exec ( #a_cfa -- R:nest a_pfa )	new	does_exec
  290: #ifdef NO_IP
  291: /* compiled to LIT CALL by compile_prim */
  292: assert(0);
  293: #else
  294: a_pfa = PFA(a_cfa);
  295: nest = (Cell)IP;
  296: #ifdef DEBUG
  297:     {
  298:       CFA_TO_NAME(a_cfa);
  299:       fprintf(stderr,"%08lx: does %08lx %.*s\n",
  300: 	      (Cell)ip,(Cell)a_cfa,len,name);
  301:     }
  302: #endif
  303: SET_IP(DOES_CODE1(a_cfa));
  304: #endif
  305: 
  306: \+glocals
  307: 
  308: branch-lp+!# ( #a_target #nlocals -- )	gforth	branch_lp_plus_store_number
  309: /* this will probably not be used */
  310: lp += nlocals;
  311: #ifdef NO_IP
  312: INST_TAIL;
  313: JUMP(a_target);
  314: #else
  315: SET_IP((Xt *)a_target);
  316: #endif
  317: 
  318: \+
  319: 
  320: branch	( #a_target -- )	gforth
  321: #ifdef NO_IP
  322: INST_TAIL;
  323: JUMP(a_target);
  324: #else
  325: SET_IP((Xt *)a_target);
  326: #endif
  327: :
  328:  r> @ >r ;
  329: 
  330: \ condbranch(forthname,stackeffect,restline,code1,code2,forthcode)
  331: \ this is non-syntactical: code must open a brace that is closed by the macro
  332: \ condbranch(forthname,stackeffect,restline,code1,code2,forthcode)
  333: \ this is non-syntactical: code must open a brace that is closed by the macro
  334: define(condbranch,
  335: $1 ( `#'a_target $2 ) $3
  336: $4	#ifdef NO_IP
  337: INST_TAIL;
  338: #endif
  339: $5	#ifdef NO_IP
  340: JUMP(a_target);
  341: #else
  342: SET_IP((Xt *)a_target);
  343: #endif
  344: }
  345: $6
  346: 
  347: \+glocals
  348: 
  349: $1-lp+!`#' ( `#'a_target `#'nlocals $2 ) $3_lp_plus_store_number
  350: $4	#ifdef NO_IP
  351: INST_TAIL;
  352: #endif
  353: $5	lp += nlocals;
  354: #ifdef NO_IP
  355: JUMP(a_target);
  356: #else
  357: SET_IP((Xt *)a_target);
  358: #endif
  359: }
  360: 
  361: \+
  362: )
  363: 
  364: \ version that generates two jumps (not good for PR 15242 workaround)
  365: define(condbranch_twojump,
  366: $1 ( `#'a_target $2 ) $3
  367: $4	#ifdef NO_IP
  368: INST_TAIL;
  369: #endif
  370: $5	#ifdef NO_IP
  371: JUMP(a_target);
  372: #else
  373: SET_IP((Xt *)a_target);
  374: INST_TAIL; NEXT_P2;
  375: #endif
  376: }
  377: SUPER_CONTINUE;
  378: $6
  379: 
  380: \+glocals
  381: 
  382: $1-lp+!`#' ( `#'a_target `#'nlocals $2 ) $3_lp_plus_store_number
  383: $4	#ifdef NO_IP
  384: INST_TAIL;
  385: #endif
  386: $5	lp += nlocals;
  387: #ifdef NO_IP
  388: JUMP(a_target);
  389: #else
  390: SET_IP((Xt *)a_target);
  391: INST_TAIL; NEXT_P2;
  392: #endif
  393: }
  394: SUPER_CONTINUE;
  395: 
  396: \+
  397: )
  398: 
  399: condbranch(?branch,f --,f83	question_branch,
  400: ,if (f==0) {
  401: ,:
  402:  0= dup 0=          \ !f f
  403:  r> tuck cell+      \ !f branchoffset f IP+
  404:  and -rot @ and or  \ f&IP+|!f&branch
  405:  >r ;)
  406: 
  407: \ we don't need an lp_plus_store version of the ?dup-stuff, because it
  408: \ is only used in if's (yet)
  409: 
  410: \+xconds
  411: 
  412: ?dup-?branch	( #a_target f -- S:... )	new	question_dupe_question_branch
  413: ""The run-time procedure compiled by @code{?DUP-IF}.""
  414: if (f==0) {
  415: #ifdef NO_IP
  416: INST_TAIL;
  417: JUMP(a_target);
  418: #else
  419: SET_IP((Xt *)a_target);
  420: #endif
  421: } else {
  422: sp--;
  423: sp[0]=f;
  424: }
  425: 
  426: ?dup-0=-?branch ( #a_target f -- S:... ) new	question_dupe_zero_equals_question_branch
  427: ""The run-time procedure compiled by @code{?DUP-0=-IF}.""
  428: if (f!=0) {
  429:   sp--;
  430:   sp[0]=f;
  431: #ifdef NO_IP
  432:   JUMP(a_target);
  433: #else
  434:   SET_IP((Xt *)a_target);
  435: #endif
  436: }
  437: 
  438: \+
  439: \fhas? skiploopprims 0= [IF]
  440: 
  441: condbranch((next),R:n1 -- R:n2,cmFORTH	paren_next,
  442: n2=n1-1;
  443: ,if (n1) {
  444: ,:
  445:  r> r> dup 1- >r
  446:  IF @ >r ELSE cell+ >r THEN ;)
  447: 
  448: condbranch((loop),R:nlimit R:n1 -- R:nlimit R:n2,gforth	paren_loop,
  449: n2=n1+1;
  450: ,if (n2 != nlimit) {
  451: ,:
  452:  r> r> 1+ r> 2dup =
  453:  IF >r 1- >r cell+ >r
  454:  ELSE >r >r @ >r THEN ;)
  455: 
  456: condbranch((+loop),n R:nlimit R:n1 -- R:nlimit R:n2,gforth paren_plus_loop,
  457: /* !! check this thoroughly */
  458: /* sign bit manipulation and test: (x^y)<0 is equivalent to (x<0) != (y<0) */
  459: /* dependent upon two's complement arithmetic */
  460: Cell olddiff = n1-nlimit;
  461: n2=n1+n;	
  462: ,if (((olddiff^(olddiff+n))    /* the limit is not crossed */
  463:      &(olddiff^n))	       /* OR it is a wrap-around effect */
  464:     >=0) { /* & is used to avoid having two branches for gforth-native */
  465: ,:
  466:  r> swap
  467:  r> r> 2dup - >r
  468:  2 pick r@ + r@ xor 0< 0=
  469:  3 pick r> xor 0< 0= or
  470:  IF    >r + >r @ >r
  471:  ELSE  >r >r drop cell+ >r THEN ;)
  472: 
  473: \+xconds
  474: 
  475: condbranch((-loop),u R:nlimit R:n1 -- R:nlimit R:n2,gforth paren_minus_loop,
  476: UCell olddiff = n1-nlimit;
  477: n2=n1-u;
  478: ,if (olddiff>u) {
  479: ,)
  480: 
  481: condbranch((s+loop),n R:nlimit R:n1 -- R:nlimit R:n2,gforth	paren_symmetric_plus_loop,
  482: ""The run-time procedure compiled by S+LOOP. It loops until the index
  483: crosses the boundary between limit and limit-sign(n). I.e. a symmetric
  484: version of (+LOOP).""
  485: /* !! check this thoroughly */
  486: Cell diff = n1-nlimit;
  487: Cell newdiff = diff+n;
  488: if (n<0) {
  489:     diff = -diff;
  490:     newdiff = -newdiff;
  491: }
  492: n2=n1+n;
  493: ,if (((~diff)|newdiff)<0) { /* use | to avoid two branches for gforth-native */
  494: ,)
  495: 
  496: \+
  497: 
  498: (for)   ( ncount -- R:nlimit R:ncount )         cmFORTH         paren_for
  499: /* or (for) = >r -- collides with unloop! */
  500: nlimit=0;
  501: :
  502:  r> swap 0 >r >r >r ;
  503: 
  504: (do)    ( nlimit nstart -- R:nlimit R:nstart )  gforth          paren_do
  505: :
  506:  r> swap rot >r >r >r ;
  507: 
  508: (?do) ( #a_target nlimit nstart -- R:nlimit R:nstart ) gforth	paren_question_do
  509: #ifdef NO_IP
  510:     INST_TAIL;
  511: #endif
  512: if (nstart == nlimit) {
  513: #ifdef NO_IP
  514:     JUMP(a_target);
  515: #else
  516:     SET_IP((Xt *)a_target);
  517: #endif
  518: }
  519: :
  520:   2dup =
  521:   IF   r> swap rot >r >r
  522:        @ >r
  523:   ELSE r> swap rot >r >r
  524:        cell+ >r
  525:   THEN ;				\ --> CORE-EXT
  526: 
  527: \+xconds
  528: 
  529: (+do)	( #a_target nlimit nstart -- R:nlimit R:nstart ) gforth	paren_plus_do
  530: #ifdef NO_IP
  531:     INST_TAIL;
  532: #endif
  533: if (nstart >= nlimit) {
  534: #ifdef NO_IP
  535:     JUMP(a_target);
  536: #else
  537:     SET_IP((Xt *)a_target);
  538: #endif
  539: }
  540: :
  541:  swap 2dup
  542:  r> swap >r swap >r
  543:  >=
  544:  IF
  545:      @
  546:  ELSE
  547:      cell+
  548:  THEN  >r ;
  549: 
  550: (u+do)	( #a_target ulimit ustart -- R:ulimit R:ustart ) gforth	paren_u_plus_do
  551: #ifdef NO_IP
  552:     INST_TAIL;
  553: #endif
  554: if (ustart >= ulimit) {
  555: #ifdef NO_IP
  556: JUMP(a_target);
  557: #else
  558: SET_IP((Xt *)a_target);
  559: #endif
  560: }
  561: :
  562:  swap 2dup
  563:  r> swap >r swap >r
  564:  u>=
  565:  IF
  566:      @
  567:  ELSE
  568:      cell+
  569:  THEN  >r ;
  570: 
  571: (-do)	( #a_target nlimit nstart -- R:nlimit R:nstart ) gforth	paren_minus_do
  572: #ifdef NO_IP
  573:     INST_TAIL;
  574: #endif
  575: if (nstart <= nlimit) {
  576: #ifdef NO_IP
  577: JUMP(a_target);
  578: #else
  579: SET_IP((Xt *)a_target);
  580: #endif
  581: }
  582: :
  583:  swap 2dup
  584:  r> swap >r swap >r
  585:  <=
  586:  IF
  587:      @
  588:  ELSE
  589:      cell+
  590:  THEN  >r ;
  591: 
  592: (u-do)	( #a_target ulimit ustart -- R:ulimit R:ustart ) gforth	paren_u_minus_do
  593: #ifdef NO_IP
  594:     INST_TAIL;
  595: #endif
  596: if (ustart <= ulimit) {
  597: #ifdef NO_IP
  598: JUMP(a_target);
  599: #else
  600: SET_IP((Xt *)a_target);
  601: #endif
  602: }
  603: :
  604:  swap 2dup
  605:  r> swap >r swap >r
  606:  u<=
  607:  IF
  608:      @
  609:  ELSE
  610:      cell+
  611:  THEN  >r ;
  612: 
  613: \+
  614: 
  615: \ don't make any assumptions where the return stack is!!
  616: \ implement this in machine code if it should run quickly!
  617: 
  618: i	( R:n -- R:n n )		core
  619: :
  620: \ rp@ cell+ @ ;
  621:   r> r> tuck >r >r ;
  622: 
  623: i'	( R:w R:w2 -- R:w R:w2 w )		gforth		i_tick
  624: :
  625: \ rp@ cell+ cell+ @ ;
  626:   r> r> r> dup itmp ! >r >r >r itmp @ ;
  627: variable itmp
  628: 
  629: j	( R:n R:d1 -- n R:n R:d1 )		core
  630: :
  631: \ rp@ cell+ cell+ cell+ @ ;
  632:   r> r> r> r> dup itmp ! >r >r >r >r itmp @ ;
  633: [IFUNDEF] itmp variable itmp [THEN]
  634: 
  635: k	( R:n R:d1 R:d2 -- n R:n R:d1 R:d2 )		gforth
  636: :
  637: \ rp@ [ 5 cells ] Literal + @ ;
  638:   r> r> r> r> r> r> dup itmp ! >r >r >r >r >r >r itmp @ ;
  639: [IFUNDEF] itmp variable itmp [THEN]
  640: 
  641: \f[THEN]
  642: 
  643: \ digit is high-level: 0/0%
  644: 
  645: \g strings
  646: 
  647: move	( c_from c_to ucount -- )		core
  648: ""Copy the contents of @i{ucount} aus at @i{c-from} to
  649: @i{c-to}. @code{move} works correctly even if the two areas overlap.""
  650: /* !! note that the standard specifies addr, not c-addr */
  651: memmove(c_to,c_from,ucount);
  652: /* make an Ifdef for bsd and others? */
  653: :
  654:  >r 2dup u< IF r> cmove> ELSE r> cmove THEN ;
  655: 
  656: cmove	( c_from c_to u -- )	string	c_move
  657: ""Copy the contents of @i{ucount} characters from data space at
  658: @i{c-from} to @i{c-to}. The copy proceeds @code{char}-by-@code{char}
  659: from low address to high address; i.e., for overlapping areas it is
  660: safe if @i{c-to}=<@i{c-from}.""
  661: cmove(c_from,c_to,u);
  662: :
  663:  bounds ?DO  dup c@ I c! 1+  LOOP  drop ;
  664: 
  665: cmove>	( c_from c_to u -- )	string	c_move_up
  666: ""Copy the contents of @i{ucount} characters from data space at
  667: @i{c-from} to @i{c-to}. The copy proceeds @code{char}-by-@code{char}
  668: from high address to low address; i.e., for overlapping areas it is
  669: safe if @i{c-to}>=@i{c-from}.""
  670: cmove_up(c_from,c_to,u);
  671: :
  672:  dup 0= IF  drop 2drop exit  THEN
  673:  rot over + -rot bounds swap 1-
  674:  DO  1- dup c@ I c!  -1 +LOOP  drop ;
  675: 
  676: fill	( c_addr u c -- )	core
  677: ""Store @i{c} in @i{u} chars starting at @i{c-addr}.""
  678: memset(c_addr,c,u);
  679: :
  680:  -rot bounds
  681:  ?DO  dup I c!  LOOP  drop ;
  682: 
  683: compare	( c_addr1 u1 c_addr2 u2 -- n )	string
  684: ""Compare two strings lexicographically. If they are equal, @i{n} is 0; if
  685: the first string is smaller, @i{n} is -1; if the first string is larger, @i{n}
  686: is 1. Currently this is based on the machine's character
  687: comparison. In the future, this may change to consider the current
  688: locale and its collation order.""
  689: /* close ' to keep fontify happy */ 
  690: n = compare(c_addr1, u1, c_addr2, u2);
  691: :
  692:  rot 2dup swap - >r min swap -text dup
  693:  IF  rdrop  ELSE  drop r> sgn  THEN ;
  694: : -text ( c_addr1 u c_addr2 -- n )
  695:  swap bounds
  696:  ?DO  dup c@ I c@ = WHILE  1+  LOOP  drop 0
  697:  ELSE  c@ I c@ - unloop  THEN  sgn ;
  698: : sgn ( n -- -1/0/1 )
  699:  dup 0= IF EXIT THEN  0< 2* 1+ ;
  700: 
  701: \ -text is only used by replaced primitives now; move it elsewhere
  702: \ -text	( c_addr1 u c_addr2 -- n )	new	dash_text
  703: \ n = memcmp(c_addr1, c_addr2, u);
  704: \ if (n<0)
  705: \   n = -1;
  706: \ else if (n>0)
  707: \   n = 1;
  708: \ :
  709: \  swap bounds
  710: \  ?DO  dup c@ I c@ = WHILE  1+  LOOP  drop 0
  711: \  ELSE  c@ I c@ - unloop  THEN  sgn ;
  712: \ : sgn ( n -- -1/0/1 )
  713: \  dup 0= IF EXIT THEN  0< 2* 1+ ;
  714: 
  715: toupper	( c1 -- c2 )	gforth
  716: ""If @i{c1} is a lower-case character (in the current locale), @i{c2}
  717: is the equivalent upper-case character. All other characters are unchanged.""
  718: c2 = toupper(c1);
  719: :
  720:  dup [char] a - [ char z char a - 1 + ] Literal u<  bl and - ;
  721: 
  722: /string	( c_addr1 u1 n -- c_addr2 u2 )	string	slash_string
  723: ""Adjust the string specified by @i{c-addr1, u1} to remove @i{n}
  724: characters from the start of the string.""
  725: c_addr2 = c_addr1+n;
  726: u2 = u1-n;
  727: :
  728:  tuck - >r + r> dup 0< IF  - 0  THEN ;
  729: 
  730: \g arith
  731: 
  732: lit	( #w -- w )		gforth
  733: :
  734:  r> dup @ swap cell+ >r ;
  735: 
  736: +	( n1 n2 -- n )		core	plus
  737: n = n1+n2;
  738: 
  739: \ lit+ / lit_plus = lit +
  740: 
  741: lit+	( n1 #n2 -- n )		new	lit_plus
  742: n=n1+n2;
  743: 
  744: \ PFE-0.9.14 has it differently, but the next release will have it as follows
  745: under+	( n1 n2 n3 -- n n2 )	gforth	under_plus
  746: ""add @i{n3} to @i{n1} (giving @i{n})""
  747: n = n1+n3;
  748: :
  749:  rot + swap ;
  750: 
  751: -	( n1 n2 -- n )		core	minus
  752: n = n1-n2;
  753: :
  754:  negate + ;
  755: 
  756: negate	( n1 -- n2 )		core
  757: /* use minus as alias */
  758: n2 = -n1;
  759: :
  760:  invert 1+ ;
  761: 
  762: 1+	( n1 -- n2 )		core		one_plus
  763: n2 = n1+1;
  764: :
  765:  1 + ;
  766: 
  767: 1-	( n1 -- n2 )		core		one_minus
  768: n2 = n1-1;
  769: :
  770:  1 - ;
  771: 
  772: max	( n1 n2 -- n )	core
  773: if (n1<n2)
  774:   n = n2;
  775: else
  776:   n = n1;
  777: :
  778:  2dup < IF swap THEN drop ;
  779: 
  780: min	( n1 n2 -- n )	core
  781: if (n1<n2)
  782:   n = n1;
  783: else
  784:   n = n2;
  785: :
  786:  2dup > IF swap THEN drop ;
  787: 
  788: abs	( n -- u )	core
  789: if (n<0)
  790:   u = -n;
  791: else
  792:   u = n;
  793: :
  794:  dup 0< IF negate THEN ;
  795: 
  796: *	( n1 n2 -- n )		core	star
  797: n = n1*n2;
  798: :
  799:  um* drop ;
  800: 
  801: /	( n1 n2 -- n )		core	slash
  802: n = n1/n2;
  803: if(FLOORED_DIV && ((n1^n2) < 0) && (n1%n2 != 0)) n--;
  804: :
  805:  /mod nip ;
  806: 
  807: mod	( n1 n2 -- n )		core
  808: n = n1%n2;
  809: if(FLOORED_DIV && ((n1^n2) < 0) && n!=0) n += n2;
  810: :
  811:  /mod drop ;
  812: 
  813: /mod	( n1 n2 -- n3 n4 )		core		slash_mod
  814: n4 = n1/n2;
  815: n3 = n1%n2; /* !! is this correct? look into C standard! */
  816: if (FLOORED_DIV && ((n1^n2) < 0) && n3!=0) {
  817:   n4--;
  818:   n3+=n2;
  819: }
  820: :
  821:  >r s>d r> fm/mod ;
  822: 
  823: */mod	( n1 n2 n3 -- n4 n5 )	core	star_slash_mod
  824: ""n1*n2=n3*n5+n4, with the intermediate result (n1*n2) being double.""
  825: #ifdef BUGGY_LL_MUL
  826: DCell d = mmul(n1,n2);
  827: #else
  828: DCell d = (DCell)n1 * (DCell)n2;
  829: #endif
  830: #ifdef BUGGY_LL_DIV
  831: DCell r = fmdiv(d,n3);
  832: n4=DHI(r);
  833: n5=DLO(r);
  834: #else
  835: /* assumes that the processor uses either floored or symmetric division */
  836: n5 = d/n3;
  837: n4 = d%n3;
  838: if (FLOORED_DIV && ((DHI(d)^n3)<0) && n4!=0) {
  839:   n5--;
  840:   n4+=n3;
  841: }
  842: #endif
  843: :
  844:  >r m* r> fm/mod ;
  845: 
  846: */	( n1 n2 n3 -- n4 )	core	star_slash
  847: ""n4=(n1*n2)/n3, with the intermediate result being double.""
  848: #ifdef BUGGY_LL_MUL
  849: DCell d = mmul(n1,n2);
  850: #else
  851: DCell d = (DCell)n1 * (DCell)n2;
  852: #endif
  853: #ifdef BUGGY_LL_DIV
  854: DCell r = fmdiv(d,n3);
  855: n4=DLO(r);
  856: #else
  857: /* assumes that the processor uses either floored or symmetric division */
  858: n4 = d/n3;
  859: if (FLOORED_DIV && ((DHI(d)^n3)<0) && (d%n3)!=0) n4--;
  860: #endif
  861: :
  862:  */mod nip ;
  863: 
  864: 2*	( n1 -- n2 )		core		two_star
  865: ""Shift left by 1; also works on unsigned numbers""
  866: n2 = 2*n1;
  867: :
  868:  dup + ;
  869: 
  870: 2/	( n1 -- n2 )		core		two_slash
  871: ""Arithmetic shift right by 1.  For signed numbers this is a floored
  872: division by 2 (note that @code{/} not necessarily floors).""
  873: n2 = n1>>1;
  874: :
  875:  dup MINI and IF 1 ELSE 0 THEN
  876:  [ bits/byte cell * 1- ] literal 
  877:  0 DO 2* swap dup 2* >r MINI and 
  878:      IF 1 ELSE 0 THEN or r> swap
  879:  LOOP nip ;
  880: 
  881: fm/mod	( d1 n1 -- n2 n3 )		core		f_m_slash_mod
  882: ""Floored division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}.""
  883: #ifdef BUGGY_LL_DIV
  884: #ifdef ASM_SM_SLASH_REM
  885: ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3);
  886: if (((DHI(d1)^n1)<0) && n2!=0) {
  887:   n3--;
  888:   n2+=n1;
  889: }
  890: #else /* !defined(ASM_SM_SLASH_REM) */
  891: DCell r = fmdiv(d1,n1);
  892: n2=DHI(r);
  893: n3=DLO(r);
  894: #endif /* !defined(ASM_SM_SLASH_REM) */
  895: #else
  896: #ifdef ASM_SM_SLASH_REM4
  897: ASM_SM_SLASH_REM4(d1, n1, n2, n3);
  898: if (((DHI(d1)^n1)<0) && n2!=0) {
  899:   n3--;
  900:   n2+=n1;
  901: }
  902: #else /* !defined(ASM_SM_SLASH_REM4) */
  903: /* assumes that the processor uses either floored or symmetric division */
  904: n3 = d1/n1;
  905: n2 = d1%n1;
  906: /* note that this 1%-3>0 is optimized by the compiler */
  907: if (1%-3>0 && ((DHI(d1)^n1)<0) && n2!=0) {
  908:   n3--;
  909:   n2+=n1;
  910: }
  911: #endif /* !defined(ASM_SM_SLASH_REM4) */
  912: #endif
  913: :
  914:  dup >r dup 0< IF  negate >r dnegate r>  THEN
  915:  over       0< IF  tuck + swap  THEN
  916:  um/mod
  917:  r> 0< IF  swap negate swap  THEN ;
  918: 
  919: sm/rem	( d1 n1 -- n2 n3 )		core		s_m_slash_rem
  920: ""Symmetric division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0.""
  921: #ifdef BUGGY_LL_DIV
  922: #ifdef ASM_SM_SLASH_REM
  923: ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3);
  924: #else /* !defined(ASM_SM_SLASH_REM) */
  925: DCell r = smdiv(d1,n1);
  926: n2=DHI(r);
  927: n3=DLO(r);
  928: #endif /* !defined(ASM_SM_SLASH_REM) */
  929: #else
  930: #ifdef ASM_SM_SLASH_REM4
  931: ASM_SM_SLASH_REM4(d1, n1, n2, n3);
  932: #else /* !defined(ASM_SM_SLASH_REM4) */
  933: /* assumes that the processor uses either floored or symmetric division */
  934: n3 = d1/n1;
  935: n2 = d1%n1;
  936: /* note that this 1%-3<0 is optimized by the compiler */
  937: if (1%-3<0 && ((DHI(d1)^n1)<0) && n2!=0) {
  938:   n3++;
  939:   n2-=n1;
  940: }
  941: #endif /* !defined(ASM_SM_SLASH_REM4) */
  942: #endif
  943: :
  944:  over >r dup >r abs -rot
  945:  dabs rot um/mod
  946:  r> r@ xor 0< IF       negate       THEN
  947:  r>        0< IF  swap negate swap  THEN ;
  948: 
  949: m*	( n1 n2 -- d )		core	m_star
  950: #ifdef BUGGY_LL_MUL
  951: d = mmul(n1,n2);
  952: #else
  953: d = (DCell)n1 * (DCell)n2;
  954: #endif
  955: :
  956:  2dup      0< and >r
  957:  2dup swap 0< and >r
  958:  um* r> - r> - ;
  959: 
  960: um*	( u1 u2 -- ud )		core	u_m_star
  961: /* use u* as alias */
  962: #ifdef BUGGY_LL_MUL
  963: ud = ummul(u1,u2);
  964: #else
  965: ud = (UDCell)u1 * (UDCell)u2;
  966: #endif
  967: :
  968:    0 -rot dup [ 8 cells ] literal -
  969:    DO
  970: 	dup 0< I' and d2*+ drop
  971:    LOOP ;
  972: : d2*+ ( ud n -- ud+n c )
  973:    over MINI
  974:    and >r >r 2dup d+ swap r> + swap r> ;
  975: 
  976: um/mod	( ud u1 -- u2 u3 )		core	u_m_slash_mod
  977: ""ud=u3*u1+u2, u1>u2>=0""
  978: #ifdef BUGGY_LL_DIV
  979: #ifdef ASM_UM_SLASH_MOD
  980: ASM_UM_SLASH_MOD(ud.lo, ud.hi, u1, u2, u3);
  981: #else /* !defined(ASM_UM_SLASH_MOD) */
  982: UDCell r = umdiv(ud,u1);
  983: u2=DHI(r);
  984: u3=DLO(r);
  985: #endif /* !defined(ASM_UM_SLASH_MOD) */
  986: #else
  987: #ifdef ASM_UM_SLASH_MOD4
  988: ASM_UM_SLASH_MOD4(ud, u1, u2, u3);
  989: #else /* !defined(ASM_UM_SLASH_MOD4) */
  990: u3 = ud/u1;
  991: u2 = ud%u1;
  992: #endif /* !defined(ASM_UM_SLASH_MOD4) */
  993: #endif
  994: :
  995:    0 swap [ 8 cells 1 + ] literal 0
  996:    ?DO /modstep
  997:    LOOP drop swap 1 rshift or swap ;
  998: : /modstep ( ud c R: u -- ud-?u c R: u )
  999:    >r over r@ u< 0= or IF r@ - 1 ELSE 0 THEN  d2*+ r> ;
 1000: : d2*+ ( ud n -- ud+n c )
 1001:    over MINI
 1002:    and >r >r 2dup d+ swap r> + swap r> ;
 1003: 
 1004: m+	( d1 n -- d2 )		double		m_plus
 1005: #ifdef BUGGY_LL_ADD
 1006: DLO_IS(d2, DLO(d1)+n);
 1007: DHI_IS(d2, DHI(d1) - (n<0) + (DLO(d2)<DLO(d1)));
 1008: #else
 1009: d2 = d1+n;
 1010: #endif
 1011: :
 1012:  s>d d+ ;
 1013: 
 1014: d+	( d1 d2 -- d )		double	d_plus
 1015: #ifdef BUGGY_LL_ADD
 1016: DLO_IS(d, DLO(d1) + DLO(d2));
 1017: DHI_IS(d, DHI(d1) + DHI(d2) + (d.lo<DLO(d1)));
 1018: #else
 1019: d = d1+d2;
 1020: #endif
 1021: :
 1022:  rot + >r tuck + swap over u> r> swap - ;
 1023: 
 1024: d-	( d1 d2 -- d )		double		d_minus
 1025: #ifdef BUGGY_LL_ADD
 1026: DLO_IS(d, DLO(d1) - DLO(d2));
 1027: DHI_IS(d, DHI(d1)-DHI(d2)-(DLO(d1)<DLO(d2)));
 1028: #else
 1029: d = d1-d2;
 1030: #endif
 1031: :
 1032:  dnegate d+ ;
 1033: 
 1034: dnegate	( d1 -- d2 )		double	d_negate
 1035: /* use dminus as alias */
 1036: #ifdef BUGGY_LL_ADD
 1037: d2 = dnegate(d1);
 1038: #else
 1039: d2 = -d1;
 1040: #endif
 1041: :
 1042:  invert swap negate tuck 0= - ;
 1043: 
 1044: d2*	( d1 -- d2 )		double		d_two_star
 1045: ""Shift left by 1; also works on unsigned numbers""
 1046: #ifdef BUGGY_LL_SHIFT
 1047: DLO_IS(d2, DLO(d1)<<1);
 1048: DHI_IS(d2, (DHI(d1)<<1) | (DLO(d1)>>(CELL_BITS-1)));
 1049: #else
 1050: d2 = 2*d1;
 1051: #endif
 1052: :
 1053:  2dup d+ ;
 1054: 
 1055: d2/	( d1 -- d2 )		double		d_two_slash
 1056: ""Arithmetic shift right by 1.  For signed numbers this is a floored
 1057: division by 2.""
 1058: #ifdef BUGGY_LL_SHIFT
 1059: DHI_IS(d2, DHI(d1)>>1);
 1060: DLO_IS(d2, (DLO(d1)>>1) | (DHI(d1)<<(CELL_BITS-1)));
 1061: #else
 1062: d2 = d1>>1;
 1063: #endif
 1064: :
 1065:  dup 1 and >r 2/ swap 2/ [ 1 8 cells 1- lshift 1- ] Literal and
 1066:  r> IF  [ 1 8 cells 1- lshift ] Literal + THEN  swap ;
 1067: 
 1068: and	( w1 w2 -- w )		core
 1069: w = w1&w2;
 1070: 
 1071: or	( w1 w2 -- w )		core
 1072: w = w1|w2;
 1073: :
 1074:  invert swap invert and invert ;
 1075: 
 1076: xor	( w1 w2 -- w )		core	x_or
 1077: w = w1^w2;
 1078: 
 1079: invert	( w1 -- w2 )		core
 1080: w2 = ~w1;
 1081: :
 1082:  MAXU xor ;
 1083: 
 1084: rshift	( u1 n -- u2 )		core	r_shift
 1085: ""Logical shift right by @i{n} bits.""
 1086: #ifdef BROKEN_SHIFT
 1087:   u2 = rshift(u1, n);
 1088: #else
 1089:   u2 = u1 >> n;
 1090: #endif
 1091: :
 1092:     0 ?DO 2/ MAXI and LOOP ;
 1093: 
 1094: lshift	( u1 n -- u2 )		core	l_shift
 1095: #ifdef BROKEN_SHIFT
 1096:   u2 = lshift(u1, n);
 1097: #else
 1098:   u2 = u1 << n;
 1099: #endif
 1100: :
 1101:     0 ?DO 2* LOOP ;
 1102: 
 1103: \g compare
 1104: 
 1105: \ comparisons(prefix, args, prefix, arg1, arg2, wordsets...)
 1106: define(comparisons,
 1107: $1=	( $2 -- f )		$6	$3equals
 1108: f = FLAG($4==$5);
 1109: :
 1110:     [ char $1x char 0 = [IF]
 1111: 	] IF false ELSE true THEN [
 1112:     [ELSE]
 1113: 	] xor 0= [
 1114:     [THEN] ] ;
 1115: 
 1116: $1<>	( $2 -- f )		$7	$3not_equals
 1117: f = FLAG($4!=$5);
 1118: :
 1119:     [ char $1x char 0 = [IF]
 1120: 	] IF true ELSE false THEN [
 1121:     [ELSE]
 1122: 	] xor 0<> [
 1123:     [THEN] ] ;
 1124: 
 1125: $1<	( $2 -- f )		$8	$3less_than
 1126: f = FLAG($4<$5);
 1127: :
 1128:     [ char $1x char 0 = [IF]
 1129: 	] MINI and 0<> [
 1130:     [ELSE] char $1x char u = [IF]
 1131: 	]   2dup xor 0<  IF nip ELSE - THEN 0<  [
 1132: 	[ELSE]
 1133: 	    ] MINI xor >r MINI xor r> u< [
 1134: 	[THEN]
 1135:     [THEN] ] ;
 1136: 
 1137: $1>	( $2 -- f )		$9	$3greater_than
 1138: f = FLAG($4>$5);
 1139: :
 1140:     [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
 1141:     $1< ;
 1142: 
 1143: $1<=	( $2 -- f )		gforth	$3less_or_equal
 1144: f = FLAG($4<=$5);
 1145: :
 1146:     $1> 0= ;
 1147: 
 1148: $1>=	( $2 -- f )		gforth	$3greater_or_equal
 1149: f = FLAG($4>=$5);
 1150: :
 1151:     [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
 1152:     $1<= ;
 1153: 
 1154: )
 1155: 
 1156: comparisons(0, n, zero_, n, 0, core, core-ext, core, core-ext)
 1157: comparisons(, n1 n2, , n1, n2, core, core-ext, core, core)
 1158: comparisons(u, u1 u2, u_, u1, u2, gforth, gforth, core, core-ext)
 1159: 
 1160: \ dcomparisons(prefix, args, prefix, arg1, arg2, wordsets...)
 1161: define(dcomparisons,
 1162: $1=	( $2 -- f )		$6	$3equals
 1163: #ifdef BUGGY_LL_CMP
 1164: f = FLAG($4.lo==$5.lo && $4.hi==$5.hi);
 1165: #else
 1166: f = FLAG($4==$5);
 1167: #endif
 1168: 
 1169: $1<>	( $2 -- f )		$7	$3not_equals
 1170: #ifdef BUGGY_LL_CMP
 1171: f = FLAG($4.lo!=$5.lo || $4.hi!=$5.hi);
 1172: #else
 1173: f = FLAG($4!=$5);
 1174: #endif
 1175: 
 1176: $1<	( $2 -- f )		$8	$3less_than
 1177: #ifdef BUGGY_LL_CMP
 1178: f = FLAG($4.hi==$5.hi ? $4.lo<$5.lo : $4.hi<$5.hi);
 1179: #else
 1180: f = FLAG($4<$5);
 1181: #endif
 1182: 
 1183: $1>	( $2 -- f )		$9	$3greater_than
 1184: #ifdef BUGGY_LL_CMP
 1185: f = FLAG($4.hi==$5.hi ? $4.lo>$5.lo : $4.hi>$5.hi);
 1186: #else
 1187: f = FLAG($4>$5);
 1188: #endif
 1189: 
 1190: $1<=	( $2 -- f )		gforth	$3less_or_equal
 1191: #ifdef BUGGY_LL_CMP
 1192: f = FLAG($4.hi==$5.hi ? $4.lo<=$5.lo : $4.hi<=$5.hi);
 1193: #else
 1194: f = FLAG($4<=$5);
 1195: #endif
 1196: 
 1197: $1>=	( $2 -- f )		gforth	$3greater_or_equal
 1198: #ifdef BUGGY_LL_CMP
 1199: f = FLAG($4.hi==$5.hi ? $4.lo>=$5.lo : $4.hi>=$5.hi);
 1200: #else
 1201: f = FLAG($4>=$5);
 1202: #endif
 1203: 
 1204: )
 1205: 
 1206: \+dcomps
 1207: 
 1208: dcomparisons(d, d1 d2, d_, d1, d2, double, gforth, double, gforth)
 1209: dcomparisons(d0, d, d_zero_, d, DZERO, double, gforth, double, gforth)
 1210: dcomparisons(du, ud1 ud2, d_u_, ud1, ud2, gforth, gforth, double-ext, gforth)
 1211: 
 1212: \+
 1213: 
 1214: within	( u1 u2 u3 -- f )		core-ext
 1215: ""u2=<u1<u3 or: u3=<u2 and u1 is not in [u3,u2).  This works for
 1216: unsigned and signed numbers (but not a mixture).  Another way to think
 1217: about this word is to consider the numbers as a circle (wrapping
 1218: around from @code{max-u} to 0 for unsigned, and from @code{max-n} to
 1219: min-n for signed numbers); now consider the range from u2 towards
 1220: increasing numbers up to and excluding u3 (giving an empty range if
 1221: u2=u3); if u1 is in this range, @code{within} returns true.""
 1222: f = FLAG(u1-u2 < u3-u2);
 1223: :
 1224:  over - >r - r> u< ;
 1225: 
 1226: \g stack
 1227: 
 1228: useraddr	( #u -- a_addr )	new
 1229: a_addr = (Cell *)(up+u);
 1230: 
 1231: up!	( a_addr -- )	gforth	up_store
 1232: UP=up=(char *)a_addr;
 1233: :
 1234:  up ! ;
 1235: Variable UP
 1236: 
 1237: sp@	( S:... -- a_addr )		gforth		sp_fetch
 1238: a_addr = sp;
 1239: 
 1240: sp!	( a_addr -- S:... )		gforth		sp_store
 1241: sp = a_addr;
 1242: 
 1243: rp@	( -- a_addr )		gforth		rp_fetch
 1244: a_addr = rp;
 1245: 
 1246: rp!	( a_addr -- )		gforth		rp_store
 1247: rp = a_addr;
 1248: 
 1249: \+floating
 1250: 
 1251: fp@	( f:... -- f_addr )	gforth	fp_fetch
 1252: f_addr = fp;
 1253: 
 1254: fp!	( f_addr -- f:... )	gforth	fp_store
 1255: fp = f_addr;
 1256: 
 1257: \+
 1258: 
 1259: >r	( w -- R:w )		core	to_r
 1260: :
 1261:  (>r) ;
 1262: : (>r)  rp@ cell+ @ rp@ ! rp@ cell+ ! ;
 1263: 
 1264: r>	( R:w -- w )		core	r_from
 1265: :
 1266:  rp@ cell+ @ rp@ @ rp@ cell+ ! (rdrop) rp@ ! ;
 1267: Create (rdrop) ' ;s A,
 1268: 
 1269: rdrop	( R:w -- )		gforth
 1270: :
 1271:  r> r> drop >r ;
 1272: 
 1273: 2>r	( d -- R:d )	core-ext	two_to_r
 1274: :
 1275:  swap r> swap >r swap >r >r ;
 1276: 
 1277: 2r>	( R:d -- d )	core-ext	two_r_from
 1278: :
 1279:  r> r> swap r> swap >r swap ;
 1280: 
 1281: 2r@	( R:d -- R:d d )	core-ext	two_r_fetch
 1282: :
 1283:  i' j ;
 1284: 
 1285: 2rdrop	( R:d -- )		gforth	two_r_drop
 1286: :
 1287:  r> r> drop r> drop >r ;
 1288: 
 1289: over	( w1 w2 -- w1 w2 w1 )		core
 1290: :
 1291:  sp@ cell+ @ ;
 1292: 
 1293: drop	( w -- )		core
 1294: :
 1295:  IF THEN ;
 1296: 
 1297: swap	( w1 w2 -- w2 w1 )		core
 1298: :
 1299:  >r (swap) ! r> (swap) @ ;
 1300: Variable (swap)
 1301: 
 1302: dup	( w -- w w )		core	dupe
 1303: :
 1304:  sp@ @ ;
 1305: 
 1306: rot	( w1 w2 w3 -- w2 w3 w1 )	core	rote
 1307: :
 1308: [ defined? (swap) [IF] ]
 1309:     (swap) ! (rot) ! >r (rot) @ (swap) @ r> ;
 1310: Variable (rot)
 1311: [ELSE] ]
 1312:     >r swap r> swap ;
 1313: [THEN]
 1314: 
 1315: -rot	( w1 w2 w3 -- w3 w1 w2 )	gforth	not_rote
 1316: :
 1317:  rot rot ;
 1318: 
 1319: nip	( w1 w2 -- w2 )		core-ext
 1320: :
 1321:  swap drop ;
 1322: 
 1323: tuck	( w1 w2 -- w2 w1 w2 )	core-ext
 1324: :
 1325:  swap over ;
 1326: 
 1327: ?dup	( w -- S:... w )	core	question_dupe
 1328: ""Actually the stack effect is: @code{( w -- 0 | w w )}.  It performs a
 1329: @code{dup} if w is nonzero.""
 1330: if (w!=0) {
 1331:   *--sp = w;
 1332: }
 1333: :
 1334:  dup IF dup THEN ;
 1335: 
 1336: pick	( S:... u -- S:... w )		core-ext
 1337: ""Actually the stack effect is @code{ x0 ... xu u -- x0 ... xu x0 }.""
 1338: w = sp[u];
 1339: :
 1340:  1+ cells sp@ + @ ;
 1341: 
 1342: 2drop	( w1 w2 -- )		core	two_drop
 1343: :
 1344:  drop drop ;
 1345: 
 1346: 2dup	( w1 w2 -- w1 w2 w1 w2 )	core	two_dupe
 1347: :
 1348:  over over ;
 1349: 
 1350: 2over	( w1 w2 w3 w4 -- w1 w2 w3 w4 w1 w2 )	core	two_over
 1351: :
 1352:  3 pick 3 pick ;
 1353: 
 1354: 2swap	( w1 w2 w3 w4 -- w3 w4 w1 w2 )	core	two_swap
 1355: :
 1356:  rot >r rot r> ;
 1357: 
 1358: 2rot	( w1 w2 w3 w4 w5 w6 -- w3 w4 w5 w6 w1 w2 )	double-ext	two_rote
 1359: :
 1360:  >r >r 2swap r> r> 2swap ;
 1361: 
 1362: 2nip	( w1 w2 w3 w4 -- w3 w4 )	gforth	two_nip
 1363: :
 1364:  2swap 2drop ;
 1365: 
 1366: 2tuck	( w1 w2 w3 w4 -- w3 w4 w1 w2 w3 w4 )	gforth	two_tuck
 1367: :
 1368:  2swap 2over ;
 1369: 
 1370: \ toggle is high-level: 0.11/0.42%
 1371: 
 1372: \g memory
 1373: 
 1374: @	( a_addr -- w )		core	fetch
 1375: ""@i{w} is the cell stored at @i{a_addr}.""
 1376: w = *a_addr;
 1377: 
 1378: \ lit@ / lit_fetch = lit @
 1379: 
 1380: lit@		( #a_addr -- w ) new	lit_fetch
 1381: w = *a_addr;
 1382: 
 1383: !	( w a_addr -- )		core	store
 1384: ""Store @i{w} into the cell at @i{a-addr}.""
 1385: *a_addr = w;
 1386: 
 1387: +!	( n a_addr -- )		core	plus_store
 1388: ""Add @i{n} to the cell at @i{a-addr}.""
 1389: *a_addr += n;
 1390: :
 1391:  tuck @ + swap ! ;
 1392: 
 1393: c@	( c_addr -- c )		core	c_fetch
 1394: ""@i{c} is the char stored at @i{c_addr}.""
 1395: c = *c_addr;
 1396: :
 1397: [ bigendian [IF] ]
 1398:     [ cell>bit 4 = [IF] ]
 1399: 	dup [ 0 cell - ] Literal and @ swap 1 and
 1400: 	IF  $FF and  ELSE  8>>  THEN  ;
 1401:     [ [ELSE] ]
 1402: 	dup [ cell 1- ] literal and
 1403: 	tuck - @ swap [ cell 1- ] literal xor
 1404:  	0 ?DO 8>> LOOP $FF and
 1405:     [ [THEN] ]
 1406: [ [ELSE] ]
 1407:     [ cell>bit 4 = [IF] ]
 1408: 	dup [ 0 cell - ] Literal and @ swap 1 and
 1409: 	IF  8>>  ELSE  $FF and  THEN
 1410:     [ [ELSE] ]
 1411: 	dup [ cell  1- ] literal and 
 1412: 	tuck - @ swap
 1413: 	0 ?DO 8>> LOOP 255 and
 1414:     [ [THEN] ]
 1415: [ [THEN] ]
 1416: ;
 1417: : 8>> 2/ 2/ 2/ 2/  2/ 2/ 2/ 2/ ;
 1418: 
 1419: c!	( c c_addr -- )		core	c_store
 1420: ""Store @i{c} into the char at @i{c-addr}.""
 1421: *c_addr = c;
 1422: :
 1423: [ bigendian [IF] ]
 1424:     [ cell>bit 4 = [IF] ]
 1425: 	tuck 1 and IF  $FF and  ELSE  8<<  THEN >r
 1426: 	dup -2 and @ over 1 and cells masks + @ and
 1427: 	r> or swap -2 and ! ;
 1428: 	Create masks $00FF , $FF00 ,
 1429:     [ELSE] ]
 1430: 	dup [ cell 1- ] literal and dup 
 1431: 	[ cell 1- ] literal xor >r
 1432: 	- dup @ $FF r@ 0 ?DO 8<< LOOP invert and
 1433: 	rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
 1434:     [THEN]
 1435: [ELSE] ]
 1436:     [ cell>bit 4 = [IF] ]
 1437: 	tuck 1 and IF  8<<  ELSE  $FF and  THEN >r
 1438: 	dup -2 and @ over 1 and cells masks + @ and
 1439: 	r> or swap -2 and ! ;
 1440: 	Create masks $FF00 , $00FF ,
 1441:     [ELSE] ]
 1442: 	dup [ cell 1- ] literal and dup >r
 1443: 	- dup @ $FF r@ 0 ?DO 8<< LOOP invert and
 1444: 	rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
 1445:     [THEN]
 1446: [THEN]
 1447: : 8<< 2* 2* 2* 2*  2* 2* 2* 2* ;
 1448: 
 1449: 2!	( w1 w2 a_addr -- )		core	two_store
 1450: ""Store @i{w2} into the cell at @i{c-addr} and @i{w1} into the next cell.""
 1451: a_addr[0] = w2;
 1452: a_addr[1] = w1;
 1453: :
 1454:  tuck ! cell+ ! ;
 1455: 
 1456: 2@	( a_addr -- w1 w2 )		core	two_fetch
 1457: ""@i{w2} is the content of the cell stored at @i{a-addr}, @i{w1} is
 1458: the content of the next cell.""
 1459: w2 = a_addr[0];
 1460: w1 = a_addr[1];
 1461: :
 1462:  dup cell+ @ swap @ ;
 1463: 
 1464: cell+	( a_addr1 -- a_addr2 )	core	cell_plus
 1465: ""@code{1 cells +}""
 1466: a_addr2 = a_addr1+1;
 1467: :
 1468:  cell + ;
 1469: 
 1470: cells	( n1 -- n2 )		core
 1471: "" @i{n2} is the number of address units of @i{n1} cells.""
 1472: n2 = n1 * sizeof(Cell);
 1473: :
 1474:  [ cell
 1475:  2/ dup [IF] ] 2* [ [THEN]
 1476:  2/ dup [IF] ] 2* [ [THEN]
 1477:  2/ dup [IF] ] 2* [ [THEN]
 1478:  2/ dup [IF] ] 2* [ [THEN]
 1479:  drop ] ;
 1480: 
 1481: char+	( c_addr1 -- c_addr2 )	core	char_plus
 1482: ""@code{1 chars +}.""
 1483: c_addr2 = c_addr1 + 1;
 1484: :
 1485:  1+ ;
 1486: 
 1487: (chars)	( n1 -- n2 )	gforth	paren_chars
 1488: n2 = n1 * sizeof(Char);
 1489: :
 1490:  ;
 1491: 
 1492: count	( c_addr1 -- c_addr2 u )	core
 1493: ""@i{c-addr2} is the first character and @i{u} the length of the
 1494: counted string at @i{c-addr1}.""
 1495: u = *c_addr1;
 1496: c_addr2 = c_addr1+1;
 1497: :
 1498:  dup 1+ swap c@ ;
 1499: 
 1500: \g compiler
 1501: 
 1502: \+f83headerstring
 1503: 
 1504: (f83find)	( c_addr u f83name1 -- f83name2 )	new	paren_f83find
 1505: for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next))
 1506:   if ((UCell)F83NAME_COUNT(f83name1)==u &&
 1507:       memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */)
 1508:     break;
 1509: f83name2=f83name1;
 1510: :
 1511:     BEGIN  dup WHILE  (find-samelen)  dup  WHILE
 1512: 	>r 2dup r@ cell+ char+ capscomp  0=
 1513: 	IF  2drop r>  EXIT  THEN
 1514: 	r> @
 1515:     REPEAT  THEN  nip nip ;
 1516: : (find-samelen) ( u f83name1 -- u f83name2/0 )
 1517:     BEGIN  2dup cell+ c@ $1F and <> WHILE  @  dup 0= UNTIL  THEN ;
 1518: : capscomp ( c_addr1 u c_addr2 -- n )
 1519:  swap bounds
 1520:  ?DO  dup c@ I c@ <>
 1521:      IF  dup c@ toupper I c@ toupper =
 1522:      ELSE  true  THEN  WHILE  1+  LOOP  drop 0
 1523:  ELSE  c@ toupper I c@ toupper - unloop  THEN  sgn ;
 1524: : sgn ( n -- -1/0/1 )
 1525:  dup 0= IF EXIT THEN  0< 2* 1+ ;
 1526: 
 1527: \-
 1528: 
 1529: (listlfind)	( c_addr u longname1 -- longname2 )	new	paren_listlfind
 1530: longname2=listlfind(c_addr, u, longname1);
 1531: :
 1532:     BEGIN  dup WHILE  (findl-samelen)  dup  WHILE
 1533: 	>r 2dup r@ cell+ cell+ capscomp  0=
 1534: 	IF  2drop r>  EXIT  THEN
 1535: 	r> @
 1536:     REPEAT  THEN  nip nip ;
 1537: : (findl-samelen) ( u longname1 -- u longname2/0 )
 1538:     BEGIN  2dup cell+ @ lcount-mask and <> WHILE  @  dup 0= UNTIL  THEN ;
 1539: : capscomp ( c_addr1 u c_addr2 -- n )
 1540:  swap bounds
 1541:  ?DO  dup c@ I c@ <>
 1542:      IF  dup c@ toupper I c@ toupper =
 1543:      ELSE  true  THEN  WHILE  1+  LOOP  drop 0
 1544:  ELSE  c@ toupper I c@ toupper - unloop  THEN  sgn ;
 1545: : sgn ( n -- -1/0/1 )
 1546:  dup 0= IF EXIT THEN  0< 2* 1+ ;
 1547: 
 1548: \+hash
 1549: 
 1550: (hashlfind)	( c_addr u a_addr -- longname2 )	new	paren_hashlfind
 1551: longname2 = hashlfind(c_addr, u, a_addr);
 1552: :
 1553:  BEGIN  dup  WHILE
 1554:         2@ >r >r dup r@ cell+ @ lcount-mask and =
 1555:         IF  2dup r@ cell+ cell+ capscomp 0=
 1556: 	    IF  2drop r> rdrop  EXIT  THEN  THEN
 1557: 	rdrop r>
 1558:  REPEAT nip nip ;
 1559: 
 1560: (tablelfind)	( c_addr u a_addr -- longname2 )	new	paren_tablelfind
 1561: ""A case-sensitive variant of @code{(hashfind)}""
 1562: longname2 = tablelfind(c_addr, u, a_addr);
 1563: :
 1564:  BEGIN  dup  WHILE
 1565:         2@ >r >r dup r@ cell+ @ lcount-mask and =
 1566:         IF  2dup r@ cell+ cell+ -text 0=
 1567: 	    IF  2drop r> rdrop  EXIT  THEN  THEN
 1568: 	rdrop r>
 1569:  REPEAT nip nip ;
 1570: : -text ( c_addr1 u c_addr2 -- n )
 1571:  swap bounds
 1572:  ?DO  dup c@ I c@ = WHILE  1+  LOOP  drop 0
 1573:  ELSE  c@ I c@ - unloop  THEN  sgn ;
 1574: : sgn ( n -- -1/0/1 )
 1575:  dup 0= IF EXIT THEN  0< 2* 1+ ;
 1576: 
 1577: (hashkey1)	( c_addr u ubits -- ukey )		gforth	paren_hashkey1
 1578: ""ukey is the hash key for the string c_addr u fitting in ubits bits""
 1579: ukey = hashkey1(c_addr, u, ubits);
 1580: :
 1581:  dup rot-values + c@ over 1 swap lshift 1- >r
 1582:  tuck - 2swap r> 0 2swap bounds
 1583:  ?DO  dup 4 pick lshift swap 3 pick rshift or
 1584:       I c@ toupper xor
 1585:       over and  LOOP
 1586:  nip nip nip ;
 1587: Create rot-values
 1588:   5 c, 0 c, 1 c, 2 c, 3 c,  4 c, 5 c, 5 c, 5 c, 5 c,
 1589:   3 c, 5 c, 5 c, 5 c, 5 c,  7 c, 5 c, 5 c, 5 c, 5 c,
 1590:   7 c, 5 c, 5 c, 5 c, 5 c,  6 c, 5 c, 5 c, 5 c, 5 c,
 1591:   7 c, 5 c, 5 c,
 1592: 
 1593: \+
 1594: 
 1595: \+
 1596: 
 1597: (parse-white)	( c_addr1 u1 -- c_addr2 u2 )	gforth	paren_parse_white
 1598: struct Cellpair r=parse_white(c_addr1, u1);
 1599: c_addr2 = (Char *)(r.n1);
 1600: u2 = r.n2;
 1601: :
 1602:  BEGIN  dup  WHILE  over c@ bl <=  WHILE  1 /string
 1603:  REPEAT  THEN  2dup
 1604:  BEGIN  dup  WHILE  over c@ bl >   WHILE  1 /string
 1605:  REPEAT  THEN  nip - ;
 1606: 
 1607: aligned	( c_addr -- a_addr )	core
 1608: "" @i{a-addr} is the first aligned address greater than or equal to @i{c-addr}.""
 1609: a_addr = (Cell *)((((Cell)c_addr)+(sizeof(Cell)-1))&(-sizeof(Cell)));
 1610: :
 1611:  [ cell 1- ] Literal + [ -1 cells ] Literal and ;
 1612: 
 1613: faligned	( c_addr -- f_addr )	float	f_aligned
 1614: "" @i{f-addr} is the first float-aligned address greater than or equal to @i{c-addr}.""
 1615: f_addr = (Float *)((((Cell)c_addr)+(sizeof(Float)-1))&(-sizeof(Float)));
 1616: :
 1617:  [ 1 floats 1- ] Literal + [ -1 floats ] Literal and ;
 1618: 
 1619: \ threading stuff is currently only interesting if we have a compiler
 1620: \fhas? standardthreading has? compiler and [IF]
 1621: threading-method	( -- n )	gforth	threading_method
 1622: ""0 if the engine is direct threaded. Note that this may change during
 1623: the lifetime of an image.""
 1624: #if defined(DOUBLY_INDIRECT)
 1625: n=2;
 1626: #else
 1627: # if defined(DIRECT_THREADED)
 1628: n=0;
 1629: # else
 1630: n=1;
 1631: # endif
 1632: #endif
 1633: :
 1634:  1 ;
 1635: 
 1636: \f[THEN]
 1637: 
 1638: \g hostos
 1639: 
 1640: key-file	( wfileid -- n )		gforth	paren_key_file
 1641: #ifdef HAS_FILE
 1642: fflush(stdout);
 1643: n = key((FILE*)wfileid);
 1644: #else
 1645: n = key(stdin);
 1646: #endif
 1647: 
 1648: key?-file	( wfileid -- n )	        gforth	key_q_file
 1649: #ifdef HAS_FILE
 1650: fflush(stdout);
 1651: n = key_query((FILE*)wfileid);
 1652: #else
 1653: n = key_query(stdin);
 1654: #endif
 1655: 
 1656: \+os
 1657: 
 1658: stdin	( -- wfileid )	gforth
 1659: wfileid = (Cell)stdin;
 1660: 
 1661: stdout	( -- wfileid )	gforth
 1662: wfileid = (Cell)stdout;
 1663: 
 1664: stderr	( -- wfileid )	gforth
 1665: wfileid = (Cell)stderr;
 1666: 
 1667: form	( -- urows ucols )	gforth
 1668: ""The number of lines and columns in the terminal. These numbers may change
 1669: with the window size.""
 1670: /* we could block SIGWINCH here to get a consistent size, but I don't
 1671:  think this is necessary or always beneficial */
 1672: urows=rows;
 1673: ucols=cols;
 1674: 
 1675: flush-icache	( c_addr u -- )	gforth	flush_icache
 1676: ""Make sure that the instruction cache of the processor (if there is
 1677: one) does not contain stale data at @i{c-addr} and @i{u} bytes
 1678: afterwards. @code{END-CODE} performs a @code{flush-icache}
 1679: automatically. Caveat: @code{flush-icache} might not work on your
 1680: installation; this is usually the case if direct threading is not
 1681: supported on your machine (take a look at your @file{machine.h}) and
 1682: your machine has a separate instruction cache. In such cases,
 1683: @code{flush-icache} does nothing instead of flushing the instruction
 1684: cache.""
 1685: FLUSH_ICACHE(c_addr,u);
 1686: 
 1687: (bye)	( n -- )	gforth	paren_bye
 1688: SUPER_END;
 1689: return (Label *)n;
 1690: 
 1691: (system)	( c_addr u -- wretval wior )	gforth	paren_system
 1692: wretval = gforth_system(c_addr, u);  
 1693: wior = IOR(wretval==-1 || (wretval==127 && errno != 0));
 1694: 
 1695: getenv	( c_addr1 u1 -- c_addr2 u2 )	gforth
 1696: ""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2}
 1697: is the host operating system's expansion of that environment variable. If the
 1698: environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters
 1699: in length.""
 1700: /* close ' to keep fontify happy */
 1701: c_addr2 = getenv(cstr(c_addr1,u1,1));
 1702: u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2));
 1703: 
 1704: open-pipe	( c_addr u wfam -- wfileid wior )	gforth	open_pipe
 1705: wfileid=(Cell)popen(cstr(c_addr,u,1),pfileattr[wfam]); /* ~ expansion of 1st arg? */
 1706: wior = IOR(wfileid==0); /* !! the man page says that errno is not set reliably */
 1707: 
 1708: close-pipe	( wfileid -- wretval wior )		gforth	close_pipe
 1709: wretval = pclose((FILE *)wfileid);
 1710: wior = IOR(wretval==-1);
 1711: 
 1712: time&date	( -- nsec nmin nhour nday nmonth nyear )	facility-ext	time_and_date
 1713: ""Report the current time of day. Seconds, minutes and hours are numbered from 0.
 1714: Months are numbered from 1.""
 1715: #if 1
 1716: time_t now;
 1717: struct tm *ltime;
 1718: time(&now);
 1719: ltime=localtime(&now);
 1720: #else
 1721: struct timeval time1;
 1722: struct timezone zone1;
 1723: struct tm *ltime;
 1724: gettimeofday(&time1,&zone1);
 1725: /* !! Single Unix specification: 
 1726:    If tzp is not a null pointer, the behaviour is unspecified. */
 1727: ltime=localtime((time_t *)&time1.tv_sec);
 1728: #endif
 1729: nyear =ltime->tm_year+1900;
 1730: nmonth=ltime->tm_mon+1;
 1731: nday  =ltime->tm_mday;
 1732: nhour =ltime->tm_hour;
 1733: nmin  =ltime->tm_min;
 1734: nsec  =ltime->tm_sec;
 1735: 
 1736: ms	( n -- )	facility-ext
 1737: ""Wait at least @i{n} milli-second.""
 1738: struct timeval timeout;
 1739: timeout.tv_sec=n/1000;
 1740: timeout.tv_usec=1000*(n%1000);
 1741: (void)select(0,0,0,0,&timeout);
 1742: 
 1743: allocate	( u -- a_addr wior )	memory
 1744: ""Allocate @i{u} address units of contiguous data space. The initial
 1745: contents of the data space is undefined. If the allocation is successful,
 1746: @i{a-addr} is the start address of the allocated region and @i{wior}
 1747: is 0. If the allocation fails, @i{a-addr} is undefined and @i{wior}
 1748: is a non-zero I/O result code.""
 1749: a_addr = (Cell *)malloc(u?u:1);
 1750: wior = IOR(a_addr==NULL);
 1751: 
 1752: free	( a_addr -- wior )		memory
 1753: ""Return the region of data space starting at @i{a-addr} to the system.
 1754: The region must originally have been obtained using @code{allocate} or
 1755: @code{resize}. If the operational is successful, @i{wior} is 0.
 1756: If the operation fails, @i{wior} is a non-zero I/O result code.""
 1757: free(a_addr);
 1758: wior = 0;
 1759: 
 1760: resize	( a_addr1 u -- a_addr2 wior )	memory
 1761: ""Change the size of the allocated area at @i{a-addr1} to @i{u}
 1762: address units, possibly moving the contents to a different
 1763: area. @i{a-addr2} is the address of the resulting area.
 1764: If the operation is successful, @i{wior} is 0.
 1765: If the operation fails, @i{wior} is a non-zero
 1766: I/O result code. If @i{a-addr1} is 0, Gforth's (but not the Standard)
 1767: @code{resize} @code{allocate}s @i{u} address units.""
 1768: /* the following check is not necessary on most OSs, but it is needed
 1769:    on SunOS 4.1.2. */
 1770: /* close ' to keep fontify happy */
 1771: if (a_addr1==NULL)
 1772:   a_addr2 = (Cell *)malloc(u);
 1773: else
 1774:   a_addr2 = (Cell *)realloc(a_addr1, u);
 1775: wior = IOR(a_addr2==NULL);	/* !! Define a return code */
 1776: 
 1777: strerror	( n -- c_addr u )	gforth
 1778: c_addr = strerror(n);
 1779: u = strlen(c_addr);
 1780: 
 1781: strsignal	( n -- c_addr u )	gforth
 1782: c_addr = (Address)strsignal(n);
 1783: u = strlen(c_addr);
 1784: 
 1785: call-c	( ... w -- ... )	gforth	call_c
 1786: ""Call the C function pointed to by @i{w}. The C function has to
 1787: access the stack itself. The stack pointers are exported in the global
 1788: variables @code{SP} and @code{FP}.""
 1789: /* This is a first attempt at support for calls to C. This may change in
 1790:    the future */
 1791: FP=fp;
 1792: SP=sp;
 1793: ((void (*)())w)();
 1794: sp=SP;
 1795: fp=FP;
 1796: 
 1797: \+
 1798: \+file
 1799: 
 1800: close-file	( wfileid -- wior )		file	close_file
 1801: wior = IOR(fclose((FILE *)wfileid)==EOF);
 1802: 
 1803: open-file	( c_addr u wfam -- wfileid wior )	file	open_file
 1804: wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[wfam]);
 1805: wior =  IOR(wfileid == 0);
 1806: 
 1807: create-file	( c_addr u wfam -- wfileid wior )	file	create_file
 1808: Cell	fd;
 1809: fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[wfam], 0666);
 1810: if (fd != -1) {
 1811:   wfileid = (Cell)fdopen(fd, fileattr[wfam]);
 1812:   wior = IOR(wfileid == 0);
 1813: } else {
 1814:   wfileid = 0;
 1815:   wior = IOR(1);
 1816: }
 1817: 
 1818: delete-file	( c_addr u -- wior )		file	delete_file
 1819: wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1);
 1820: 
 1821: rename-file	( c_addr1 u1 c_addr2 u2 -- wior )	file-ext	rename_file
 1822: ""Rename file @i{c_addr1 u1} to new name @i{c_addr2 u2}""
 1823: wior = rename_file(c_addr1, u1, c_addr2, u2);
 1824: 
 1825: file-position	( wfileid -- ud wior )	file	file_position
 1826: /* !! use tell and lseek? */
 1827: ud = OFF2UD(ftello((FILE *)wfileid));
 1828: wior = IOR(UD2OFF(ud)==-1);
 1829: 
 1830: reposition-file	( ud wfileid -- wior )	file	reposition_file
 1831: wior = IOR(fseeko((FILE *)wfileid, UD2OFF(ud), SEEK_SET)==-1);
 1832: 
 1833: file-size	( wfileid -- ud wior )	file	file_size
 1834: struct stat buf;
 1835: wior = IOR(fstat(fileno((FILE *)wfileid), &buf)==-1);
 1836: ud = OFF2UD(buf.st_size);
 1837: 
 1838: resize-file	( ud wfileid -- wior )	file	resize_file
 1839: wior = IOR(ftruncate(fileno((FILE *)wfileid), UD2OFF(ud))==-1);
 1840: 
 1841: read-file	( c_addr u1 wfileid -- u2 wior )	file	read_file
 1842: /* !! fread does not guarantee enough */
 1843: u2 = fread(c_addr, sizeof(Char), u1, (FILE *)wfileid);
 1844: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
 1845: /* !! is the value of ferror errno-compatible? */
 1846: if (wior)
 1847:   clearerr((FILE *)wfileid);
 1848: 
 1849: (read-line)	( c_addr u1 wfileid -- u2 flag u3 wior ) file	paren_read_line
 1850: struct Cellquad r = read_line(c_addr, u1, wfileid);
 1851: u2   = r.n1;
 1852: flag = r.n2;
 1853: u3   = r.n3;
 1854: wior = r.n4;
 1855: 
 1856: \+
 1857: 
 1858: write-file	( c_addr u1 wfileid -- wior )	file	write_file
 1859: /* !! fwrite does not guarantee enough */
 1860: #ifdef HAS_FILE
 1861: {
 1862:   UCell u2 = fwrite(c_addr, sizeof(Char), u1, (FILE *)wfileid);
 1863:   wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
 1864:   if (wior)
 1865:     clearerr((FILE *)wfileid);
 1866: }
 1867: #else
 1868: TYPE(c_addr, u1);
 1869: #endif
 1870: 
 1871: emit-file	( c wfileid -- wior )	gforth	emit_file
 1872: #ifdef HAS_FILE
 1873: wior = FILEIO(putc(c, (FILE *)wfileid)==EOF);
 1874: if (wior)
 1875:   clearerr((FILE *)wfileid);
 1876: #else
 1877: PUTC(c);
 1878: #endif
 1879: 
 1880: \+file
 1881: 
 1882: flush-file	( wfileid -- wior )		file-ext	flush_file
 1883: wior = IOR(fflush((FILE *) wfileid)==EOF);
 1884: 
 1885: file-status	( c_addr u -- wfam wior )	file-ext	file_status
 1886: struct Cellpair r = file_status(c_addr, u);
 1887: wfam = r.n1;
 1888: wior = r.n2;
 1889: 
 1890: file-eof?	( wfileid -- flag )	gforth	file_eof_query
 1891: flag = FLAG(feof((FILE *) wfileid));
 1892: 
 1893: open-dir	( c_addr u -- wdirid wior )	gforth	open_dir
 1894: ""Open the directory specified by @i{c-addr, u}
 1895: and return @i{dir-id} for futher access to it.""
 1896: wdirid = (Cell)opendir(tilde_cstr(c_addr, u, 1));
 1897: wior =  IOR(wdirid == 0);
 1898: 
 1899: read-dir	( c_addr u1 wdirid -- u2 flag wior )	gforth	read_dir
 1900: ""Attempt to read the next entry from the directory specified
 1901: by @i{dir-id} to the buffer of length @i{u1} at address @i{c-addr}. 
 1902: If the attempt fails because there is no more entries,
 1903: @i{ior}=0, @i{flag}=0, @i{u2}=0, and the buffer is unmodified.
 1904: If the attempt to read the next entry fails because of any other reason, 
 1905: return @i{ior}<>0.
 1906: If the attempt succeeds, store file name to the buffer at @i{c-addr}
 1907: and return @i{ior}=0, @i{flag}=true and @i{u2} equal to the size of the file name.
 1908: If the length of the file name is greater than @i{u1}, 
 1909: store first @i{u1} characters from file name into the buffer and
 1910: indicate "name too long" with @i{ior}, @i{flag}=true, and @i{u2}=@i{u1}.""
 1911: struct dirent * dent;
 1912: dent = readdir((DIR *)wdirid);
 1913: wior = 0;
 1914: flag = -1;
 1915: if(dent == NULL) {
 1916:   u2 = 0;
 1917:   flag = 0;
 1918: } else {
 1919:   u2 = strlen(dent->d_name);
 1920:   if(u2 > u1) {
 1921:     u2 = u1;
 1922:     wior = -512-ENAMETOOLONG;
 1923:   }
 1924:   memmove(c_addr, dent->d_name, u2);
 1925: }
 1926: 
 1927: close-dir	( wdirid -- wior )	gforth	close_dir
 1928: ""Close the directory specified by @i{dir-id}.""
 1929: wior = IOR(closedir((DIR *)wdirid));
 1930: 
 1931: filename-match	( c_addr1 u1 c_addr2 u2 -- flag )	gforth	match_file
 1932: char * string = cstr(c_addr1, u1, 1);
 1933: char * pattern = cstr(c_addr2, u2, 0);
 1934: flag = FLAG(!fnmatch(pattern, string, 0));
 1935: 
 1936: set-dir	( c_addr u -- wior )	gforth set_dir
 1937: ""Change the current directory to @i{c-addr, u}.
 1938: Return an error if this is not possible""
 1939: wior = IOR(chdir(tilde_cstr(c_addr, u, 1)));
 1940: 
 1941: get-dir	( c_addr1 u1 -- c_addr2 u2 )	gforth get_dir
 1942: ""Store the current directory in the buffer specified by @{c-addr1, u1}.
 1943: If the buffer size is not sufficient, return 0 0""
 1944: c_addr2 = getcwd(c_addr1, u1);
 1945: if(c_addr2 != NULL) {
 1946:   u2 = strlen(c_addr2);
 1947: } else {
 1948:   u2 = 0;
 1949: }
 1950: 
 1951: \+
 1952: 
 1953: newline	( -- c_addr u )	gforth
 1954: ""String containing the newline sequence of the host OS""
 1955: char newline[] = {
 1956: #if DIRSEP=='/'
 1957: /* Unix */
 1958: '\n'
 1959: #else
 1960: /* DOS, Win, OS/2 */
 1961: '\r','\n'
 1962: #endif
 1963: };
 1964: c_addr=newline;
 1965: u=sizeof(newline);
 1966: :
 1967:  "newline count ;
 1968: Create "newline e? crlf [IF] 2 c, $0D c, [ELSE] 1 c, [THEN] $0A c,
 1969: 
 1970: \+os
 1971: 
 1972: utime	( -- dtime )	gforth
 1973: ""Report the current time in microseconds since some epoch.""
 1974: struct timeval time1;
 1975: gettimeofday(&time1,NULL);
 1976: dtime = timeval2us(&time1);
 1977: 
 1978: cputime ( -- duser dsystem ) gforth
 1979: ""duser and dsystem are the respective user- and system-level CPU
 1980: times used since the start of the Forth system (excluding child
 1981: processes), in microseconds (the granularity may be much larger,
 1982: however).  On platforms without the getrusage call, it reports elapsed
 1983: time (since some epoch) for duser and 0 for dsystem.""
 1984: #ifdef HAVE_GETRUSAGE
 1985: struct rusage usage;
 1986: getrusage(RUSAGE_SELF, &usage);
 1987: duser = timeval2us(&usage.ru_utime);
 1988: dsystem = timeval2us(&usage.ru_stime);
 1989: #else
 1990: struct timeval time1;
 1991: gettimeofday(&time1,NULL);
 1992: duser = timeval2us(&time1);
 1993: dsystem = DZERO;
 1994: #endif
 1995: 
 1996: \+
 1997: 
 1998: \+floating
 1999: 
 2000: \g floating
 2001: 
 2002: comparisons(f, r1 r2, f_, r1, r2, gforth, gforth, float, gforth)
 2003: comparisons(f0, r, f_zero_, r, 0., float, gforth, float, gforth)
 2004: 
 2005: s>f	( n -- r )		float	s_to_f
 2006: r = n;
 2007: 
 2008: d>f	( d -- r )		float	d_to_f
 2009: #ifdef BUGGY_LL_D2F
 2010: extern double ldexp(double x, int exp);
 2011: if (DHI(d)<0) {
 2012: #ifdef BUGGY_LL_ADD
 2013:   DCell d2=dnegate(d);
 2014: #else
 2015:   DCell d2=-d;
 2016: #endif
 2017:   r = -(ldexp((Float)DHI(d2),CELL_BITS) + (Float)DLO(d2));
 2018: } else
 2019:   r = ldexp((Float)DHI(d),CELL_BITS) + (Float)DLO(d);
 2020: #else
 2021: r = d;
 2022: #endif
 2023: 
 2024: f>d	( r -- d )		float	f_to_d
 2025: extern DCell double2ll(Float r);
 2026: d = double2ll(r);
 2027: 
 2028: f>s	( r -- n )		float	f_to_s
 2029: n = (Cell)r;
 2030: 
 2031: f!	( r f_addr -- )	float	f_store
 2032: ""Store @i{r} into the float at address @i{f-addr}.""
 2033: *f_addr = r;
 2034: 
 2035: f@	( f_addr -- r )	float	f_fetch
 2036: ""@i{r} is the float at address @i{f-addr}.""
 2037: r = *f_addr;
 2038: 
 2039: df@	( df_addr -- r )	float-ext	d_f_fetch
 2040: ""Fetch the double-precision IEEE floating-point value @i{r} from the address @i{df-addr}.""
 2041: #ifdef IEEE_FP
 2042: r = *df_addr;
 2043: #else
 2044: !! df@
 2045: #endif
 2046: 
 2047: df!	( r df_addr -- )	float-ext	d_f_store
 2048: ""Store @i{r} as double-precision IEEE floating-point value to the
 2049: address @i{df-addr}.""
 2050: #ifdef IEEE_FP
 2051: *df_addr = r;
 2052: #else
 2053: !! df!
 2054: #endif
 2055: 
 2056: sf@	( sf_addr -- r )	float-ext	s_f_fetch
 2057: ""Fetch the single-precision IEEE floating-point value @i{r} from the address @i{sf-addr}.""
 2058: #ifdef IEEE_FP
 2059: r = *sf_addr;
 2060: #else
 2061: !! sf@
 2062: #endif
 2063: 
 2064: sf!	( r sf_addr -- )	float-ext	s_f_store
 2065: ""Store @i{r} as single-precision IEEE floating-point value to the
 2066: address @i{sf-addr}.""
 2067: #ifdef IEEE_FP
 2068: *sf_addr = r;
 2069: #else
 2070: !! sf!
 2071: #endif
 2072: 
 2073: f+	( r1 r2 -- r3 )	float	f_plus
 2074: r3 = r1+r2;
 2075: 
 2076: f-	( r1 r2 -- r3 )	float	f_minus
 2077: r3 = r1-r2;
 2078: 
 2079: f*	( r1 r2 -- r3 )	float	f_star
 2080: r3 = r1*r2;
 2081: 
 2082: f/	( r1 r2 -- r3 )	float	f_slash
 2083: r3 = r1/r2;
 2084: 
 2085: f**	( r1 r2 -- r3 )	float-ext	f_star_star
 2086: ""@i{r3} is @i{r1} raised to the @i{r2}th power.""
 2087: r3 = pow(r1,r2);
 2088: 
 2089: fm*	( r1 n -- r2 )	gforth	fm_star
 2090: r2 = r1*n;
 2091: 
 2092: fm/	( r1 n -- r2 )	gforth	fm_slash
 2093: r2 = r1/n;
 2094: 
 2095: fm*/	( r1 n1 n2 -- r2 )	gforth	fm_star_slash
 2096: r2 = (r1*n1)/n2;
 2097: 
 2098: f**2	( r1 -- r2 )	gforth	fm_square
 2099: r2 = r1*r1;
 2100: 
 2101: fnegate	( r1 -- r2 )	float	f_negate
 2102: r2 = - r1;
 2103: 
 2104: fdrop	( r -- )		float	f_drop
 2105: 
 2106: fdup	( r -- r r )	float	f_dupe
 2107: 
 2108: fswap	( r1 r2 -- r2 r1 )	float	f_swap
 2109: 
 2110: fover	( r1 r2 -- r1 r2 r1 )	float	f_over
 2111: 
 2112: frot	( r1 r2 r3 -- r2 r3 r1 )	float	f_rote
 2113: 
 2114: fnip	( r1 r2 -- r2 )	gforth	f_nip
 2115: 
 2116: ftuck	( r1 r2 -- r2 r1 r2 )	gforth	f_tuck
 2117: 
 2118: float+	( f_addr1 -- f_addr2 )	float	float_plus
 2119: ""@code{1 floats +}.""
 2120: f_addr2 = f_addr1+1;
 2121: 
 2122: floats	( n1 -- n2 )	float
 2123: ""@i{n2} is the number of address units of @i{n1} floats.""
 2124: n2 = n1*sizeof(Float);
 2125: 
 2126: floor	( r1 -- r2 )	float
 2127: ""Round towards the next smaller integral value, i.e., round toward negative infinity.""
 2128: /* !! unclear wording */
 2129: r2 = floor(r1);
 2130: 
 2131: fround	( r1 -- r2 )	gforth	f_round
 2132: ""Round to the nearest integral value.""
 2133: r2 = rint(r1);
 2134: 
 2135: fmax	( r1 r2 -- r3 )	float	f_max
 2136: if (r1<r2)
 2137:   r3 = r2;
 2138: else
 2139:   r3 = r1;
 2140: 
 2141: fmin	( r1 r2 -- r3 )	float	f_min
 2142: if (r1<r2)
 2143:   r3 = r1;
 2144: else
 2145:   r3 = r2;
 2146: 
 2147: represent	( r c_addr u -- n f1 f2 )	float
 2148: char *sig;
 2149: size_t siglen;
 2150: int flag;
 2151: int decpt;
 2152: sig=ecvt(r, u, &decpt, &flag);
 2153: n=(r==0. ? 1 : decpt);
 2154: f1=FLAG(flag!=0);
 2155: f2=FLAG(isdigit((unsigned)(sig[0]))!=0);
 2156: siglen=strlen(sig);
 2157: if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */
 2158:   siglen=u;
 2159: if (!f2) /* workaround Cygwin trailing 0s for Inf and Nan */
 2160:   for (; sig[siglen-1]=='0'; siglen--);
 2161:     ;
 2162: memcpy(c_addr,sig,siglen);
 2163: memset(c_addr+siglen,f2?'0':' ',u-siglen);
 2164: 
 2165: >float	( c_addr u -- f:... flag )	float	to_float
 2166: ""Actual stack effect: ( c_addr u -- r t | f ).  Attempt to convert the
 2167: character string @i{c-addr u} to internal floating-point
 2168: representation. If the string represents a valid floating-point number
 2169: @i{r} is placed on the floating-point stack and @i{flag} is
 2170: true. Otherwise, @i{flag} is false. A string of blanks is a special
 2171: case and represents the floating-point number 0.""
 2172: Float r;
 2173: flag = to_float(c_addr, u, &r);
 2174: if (flag) {
 2175:   fp--;
 2176:   fp[0]=r;
 2177: }
 2178: 
 2179: fabs	( r1 -- r2 )	float-ext	f_abs
 2180: r2 = fabs(r1);
 2181: 
 2182: facos	( r1 -- r2 )	float-ext	f_a_cos
 2183: r2 = acos(r1);
 2184: 
 2185: fasin	( r1 -- r2 )	float-ext	f_a_sine
 2186: r2 = asin(r1);
 2187: 
 2188: fatan	( r1 -- r2 )	float-ext	f_a_tan
 2189: r2 = atan(r1);
 2190: 
 2191: fatan2	( r1 r2 -- r3 )	float-ext	f_a_tan_two
 2192: ""@i{r1/r2}=tan(@i{r3}). ANS Forth does not require, but probably
 2193: intends this to be the inverse of @code{fsincos}. In gforth it is.""
 2194: r3 = atan2(r1,r2);
 2195: 
 2196: fcos	( r1 -- r2 )	float-ext	f_cos
 2197: r2 = cos(r1);
 2198: 
 2199: fexp	( r1 -- r2 )	float-ext	f_e_x_p
 2200: r2 = exp(r1);
 2201: 
 2202: fexpm1	( r1 -- r2 )	float-ext	f_e_x_p_m_one
 2203: ""@i{r2}=@i{e}**@i{r1}@minus{}1""
 2204: #ifdef HAVE_EXPM1
 2205: extern double
 2206: #ifdef NeXT
 2207:               const
 2208: #endif
 2209:                     expm1(double);
 2210: r2 = expm1(r1);
 2211: #else
 2212: r2 = exp(r1)-1.;
 2213: #endif
 2214: 
 2215: fln	( r1 -- r2 )	float-ext	f_l_n
 2216: r2 = log(r1);
 2217: 
 2218: flnp1	( r1 -- r2 )	float-ext	f_l_n_p_one
 2219: ""@i{r2}=ln(@i{r1}+1)""
 2220: #ifdef HAVE_LOG1P
 2221: extern double
 2222: #ifdef NeXT
 2223:               const
 2224: #endif
 2225:                     log1p(double);
 2226: r2 = log1p(r1);
 2227: #else
 2228: r2 = log(r1+1.);
 2229: #endif
 2230: 
 2231: flog	( r1 -- r2 )	float-ext	f_log
 2232: ""The decimal logarithm.""
 2233: r2 = log10(r1);
 2234: 
 2235: falog	( r1 -- r2 )	float-ext	f_a_log
 2236: ""@i{r2}=10**@i{r1}""
 2237: extern double pow10(double);
 2238: r2 = pow10(r1);
 2239: 
 2240: fsin	( r1 -- r2 )	float-ext	f_sine
 2241: r2 = sin(r1);
 2242: 
 2243: fsincos	( r1 -- r2 r3 )	float-ext	f_sine_cos
 2244: ""@i{r2}=sin(@i{r1}), @i{r3}=cos(@i{r1})""
 2245: r2 = sin(r1);
 2246: r3 = cos(r1);
 2247: 
 2248: fsqrt	( r1 -- r2 )	float-ext	f_square_root
 2249: r2 = sqrt(r1);
 2250: 
 2251: ftan	( r1 -- r2 )	float-ext	f_tan
 2252: r2 = tan(r1);
 2253: :
 2254:  fsincos f/ ;
 2255: 
 2256: fsinh	( r1 -- r2 )	float-ext	f_cinch
 2257: r2 = sinh(r1);
 2258: :
 2259:  fexpm1 fdup fdup 1. d>f f+ f/ f+ f2/ ;
 2260: 
 2261: fcosh	( r1 -- r2 )	float-ext	f_cosh
 2262: r2 = cosh(r1);
 2263: :
 2264:  fexp fdup 1/f f+ f2/ ;
 2265: 
 2266: ftanh	( r1 -- r2 )	float-ext	f_tan_h
 2267: r2 = tanh(r1);
 2268: :
 2269:  f2* fexpm1 fdup 2. d>f f+ f/ ;
 2270: 
 2271: fasinh	( r1 -- r2 )	float-ext	f_a_cinch
 2272: r2 = asinh(r1);
 2273: :
 2274:  fdup fdup f* 1. d>f f+ fsqrt f/ fatanh ;
 2275: 
 2276: facosh	( r1 -- r2 )	float-ext	f_a_cosh
 2277: r2 = acosh(r1);
 2278: :
 2279:  fdup fdup f* 1. d>f f- fsqrt f+ fln ;
 2280: 
 2281: fatanh	( r1 -- r2 )	float-ext	f_a_tan_h
 2282: r2 = atanh(r1);
 2283: :
 2284:  fdup f0< >r fabs 1. d>f fover f- f/  f2* flnp1 f2/
 2285:  r> IF  fnegate  THEN ;
 2286: 
 2287: sfloats	( n1 -- n2 )	float-ext	s_floats
 2288: ""@i{n2} is the number of address units of @i{n1}
 2289: single-precision IEEE floating-point numbers.""
 2290: n2 = n1*sizeof(SFloat);
 2291: 
 2292: dfloats	( n1 -- n2 )	float-ext	d_floats
 2293: ""@i{n2} is the number of address units of @i{n1}
 2294: double-precision IEEE floating-point numbers.""
 2295: n2 = n1*sizeof(DFloat);
 2296: 
 2297: sfaligned	( c_addr -- sf_addr )	float-ext	s_f_aligned
 2298: ""@i{sf-addr} is the first single-float-aligned address greater
 2299: than or equal to @i{c-addr}.""
 2300: sf_addr = (SFloat *)((((Cell)c_addr)+(sizeof(SFloat)-1))&(-sizeof(SFloat)));
 2301: :
 2302:  [ 1 sfloats 1- ] Literal + [ -1 sfloats ] Literal and ;
 2303: 
 2304: dfaligned	( c_addr -- df_addr )	float-ext	d_f_aligned
 2305: ""@i{df-addr} is the first double-float-aligned address greater
 2306: than or equal to @i{c-addr}.""
 2307: df_addr = (DFloat *)((((Cell)c_addr)+(sizeof(DFloat)-1))&(-sizeof(DFloat)));
 2308: :
 2309:  [ 1 dfloats 1- ] Literal + [ -1 dfloats ] Literal and ;
 2310: 
 2311: v*	( f_addr1 nstride1 f_addr2 nstride2 ucount -- r ) gforth v_star
 2312: ""dot-product: r=v1*v2.  The first element of v1 is at f_addr1, the
 2313: next at f_addr1+nstride1 and so on (similar for v2). Both vectors have
 2314: ucount elements.""
 2315: r = v_star(f_addr1, nstride1, f_addr2, nstride2, ucount);
 2316: :
 2317:  >r swap 2swap swap 0e r> 0 ?DO
 2318:      dup f@ over + 2swap dup f@ f* f+ over + 2swap
 2319:  LOOP 2drop 2drop ; 
 2320: 
 2321: faxpy	( ra f_x nstridex f_y nstridey ucount -- )	gforth
 2322: ""vy=ra*vx+vy""
 2323: faxpy(ra, f_x, nstridex, f_y, nstridey, ucount);
 2324: :
 2325:  >r swap 2swap swap r> 0 ?DO
 2326:      fdup dup f@ f* over + 2swap dup f@ f+ dup f! over + 2swap
 2327:  LOOP 2drop 2drop fdrop ;
 2328: 
 2329: \+
 2330: 
 2331: \ The following words access machine/OS/installation-dependent
 2332: \   Gforth internals
 2333: \ !! how about environmental queries DIRECT-THREADED,
 2334: \   INDIRECT-THREADED, TOS-CACHED, FTOS-CACHED, CODEFIELD-DOES */
 2335: 
 2336: \ local variable implementation primitives
 2337: 
 2338: \+glocals
 2339: 
 2340: \g locals
 2341: 
 2342: @local#	( #noffset -- w )	gforth	fetch_local_number
 2343: w = *(Cell *)(lp+noffset);
 2344: 
 2345: @local0	( -- w )	new	fetch_local_zero
 2346: w = ((Cell *)lp)[0];
 2347: 
 2348: @local1	( -- w )	new	fetch_local_four
 2349: w = ((Cell *)lp)[1];
 2350: 
 2351: @local2	( -- w )	new	fetch_local_eight
 2352: w = ((Cell *)lp)[2];
 2353: 
 2354: @local3	( -- w )	new	fetch_local_twelve
 2355: w = ((Cell *)lp)[3];
 2356: 
 2357: \+floating
 2358: 
 2359: f@local#	( #noffset -- r )	gforth	f_fetch_local_number
 2360: r = *(Float *)(lp+noffset);
 2361: 
 2362: f@local0	( -- r )	new	f_fetch_local_zero
 2363: r = ((Float *)lp)[0];
 2364: 
 2365: f@local1	( -- r )	new	f_fetch_local_eight
 2366: r = ((Float *)lp)[1];
 2367: 
 2368: \+
 2369: 
 2370: laddr#	( #noffset -- c_addr )	gforth	laddr_number
 2371: /* this can also be used to implement lp@ */
 2372: c_addr = (Char *)(lp+noffset);
 2373: 
 2374: lp+!#	( #noffset -- )	gforth	lp_plus_store_number
 2375: ""used with negative immediate values it allocates memory on the
 2376: local stack, a positive immediate argument drops memory from the local
 2377: stack""
 2378: lp += noffset;
 2379: 
 2380: lp-	( -- )	new	minus_four_lp_plus_store
 2381: lp += -sizeof(Cell);
 2382: 
 2383: lp+	( -- )	new	eight_lp_plus_store
 2384: lp += sizeof(Float);
 2385: 
 2386: lp+2	( -- )	new	sixteen_lp_plus_store
 2387: lp += 2*sizeof(Float);
 2388: 
 2389: lp!	( c_addr -- )	gforth	lp_store
 2390: lp = (Address)c_addr;
 2391: 
 2392: >l	( w -- )	gforth	to_l
 2393: lp -= sizeof(Cell);
 2394: *(Cell *)lp = w;
 2395: 
 2396: \+floating
 2397: 
 2398: f>l	( r -- )	gforth	f_to_l
 2399: lp -= sizeof(Float);
 2400: *(Float *)lp = r;
 2401: 
 2402: fpick	( f:... u -- f:... r )		gforth
 2403: ""Actually the stack effect is @code{ r0 ... ru u -- r0 ... ru r0 }.""
 2404: r = fp[u];
 2405: :
 2406:  floats fp@ + f@ ;
 2407: 
 2408: \+
 2409: \+
 2410: 
 2411: \+OS
 2412: 
 2413: \g syslib
 2414: 
 2415: open-lib	( c_addr1 u1 -- u2 )	gforth	open_lib
 2416: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
 2417: #ifndef RTLD_GLOBAL
 2418: #define RTLD_GLOBAL 0
 2419: #endif
 2420: u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY);
 2421: #else
 2422: #  ifdef _WIN32
 2423: u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1));
 2424: #  else
 2425: #warning Define open-lib!
 2426: u2 = 0;
 2427: #  endif
 2428: #endif
 2429: 
 2430: lib-sym	( c_addr1 u1 u2 -- u3 )	gforth	lib_sym
 2431: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
 2432: u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1));
 2433: #else
 2434: #  ifdef _WIN32
 2435: u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1));
 2436: #  else
 2437: #warning Define lib-sym!
 2438: u3 = 0;
 2439: #  endif
 2440: #endif
 2441: 
 2442: wcall	( ... u -- ... )	gforth
 2443: FP=fp;
 2444: sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &FP);
 2445: fp=FP;
 2446: 
 2447: w@ ( a_addr -- u )	gforth wfetch
 2448: u = *(UWyde*)(a_addr);
 2449: 
 2450: sw@ ( a_addr -- u )	gforth swfetch
 2451: u = *(Wyde*)(a_addr);
 2452: 
 2453: w! ( u a_addr -- )	gforth wstore
 2454: *(Wyde*)(a_addr) = u;
 2455: 
 2456: l@ ( a_addr -- u )	gforth lfetch
 2457: u = *(UTetrabyte*)(a_addr);
 2458: 
 2459: sl@ ( a_addr -- u )	gforth slfetch
 2460: u = *(Tetrabyte*)(a_addr);
 2461: 
 2462: l! ( u a_addr -- )	gforth lstore
 2463: *(Tetrabyte*)(a_addr) = u;
 2464: 
 2465: \+FFCALL
 2466: 
 2467: av-start-void	( c_addr -- )	gforth  av_start_void
 2468: av_start_void(alist, c_addr);
 2469: 
 2470: av-start-int	( c_addr -- )	gforth  av_start_int
 2471: av_start_int(alist, c_addr, &irv);
 2472: 
 2473: av-start-float	( c_addr -- )	gforth  av_start_float
 2474: av_start_float(alist, c_addr, &frv);
 2475: 
 2476: av-start-double	( c_addr -- )	gforth  av_start_double
 2477: av_start_double(alist, c_addr, &drv);
 2478: 
 2479: av-start-longlong	( c_addr -- )	gforth  av_start_longlong
 2480: av_start_longlong(alist, c_addr, &llrv);
 2481: 
 2482: av-start-ptr	( c_addr -- )	gforth  av_start_ptr
 2483: av_start_ptr(alist, c_addr, void*, &prv);
 2484: 
 2485: av-int  ( w -- )  gforth  av_int
 2486: av_int(alist, w);
 2487: 
 2488: av-float	( r -- )	gforth  av_float
 2489: av_float(alist, r);
 2490: 
 2491: av-double	( r -- )	gforth  av_double
 2492: av_double(alist, r);
 2493: 
 2494: av-longlong	( d -- )	gforth  av_longlong
 2495: #ifdef BUGGY_LL_SIZE
 2496: av_longlong(alist, DLO(d));
 2497: #else
 2498: av_longlong(alist, d);
 2499: #endif
 2500: 
 2501: av-ptr	( c_addr -- )	gforth  av_ptr
 2502: av_ptr(alist, void*, c_addr);
 2503: 
 2504: av-int-r  ( R:w -- )  gforth  av_int_r
 2505: av_int(alist, w);
 2506: 
 2507: av-float-r	( -- )	gforth  av_float_r
 2508: float r = *(Float*)lp;
 2509: lp += sizeof(Float);
 2510: av_float(alist, r);
 2511: 
 2512: av-double-r	( -- )	gforth  av_double_r
 2513: double r = *(Float*)lp;
 2514: lp += sizeof(Float);
 2515: av_double(alist, r);
 2516: 
 2517: av-longlong-r	( R:d -- )	gforth  av_longlong_r
 2518: #ifdef BUGGY_LL_SIZE
 2519: av_longlong(alist, DLO(d));
 2520: #else
 2521: av_longlong(alist, d);
 2522: #endif
 2523: 
 2524: av-ptr-r	( R:c_addr -- )	gforth  av_ptr_r
 2525: av_ptr(alist, void*, c_addr);
 2526: 
 2527: av-call-void	( ... -- ... )	gforth  av_call_void
 2528: SAVE_REGS
 2529: av_call(alist);
 2530: REST_REGS
 2531: 
 2532: av-call-int	( ... -- ... w )	gforth  av_call_int
 2533: SAVE_REGS
 2534: av_call(alist);
 2535: REST_REGS
 2536: w = irv;
 2537: 
 2538: av-call-float	( ... -- ... r )	gforth  av_call_float
 2539: SAVE_REGS
 2540: av_call(alist);
 2541: REST_REGS
 2542: r = frv;
 2543: 
 2544: av-call-double	( ... -- ... r )	gforth  av_call_double
 2545: SAVE_REGS
 2546: av_call(alist);
 2547: REST_REGS
 2548: r = drv;
 2549: 
 2550: av-call-longlong	( ... -- ... d )	gforth  av_call_longlong
 2551: SAVE_REGS
 2552: av_call(alist);
 2553: REST_REGS
 2554: #ifdef BUGGY_LONG_LONG
 2555: DLO_IS(d, llrv);
 2556: DHI_IS(d, 0);
 2557: #else
 2558: d = llrv;
 2559: #endif
 2560: 
 2561: av-call-ptr	( ... -- ... c_addr )	gforth  av_call_ptr
 2562: SAVE_REGS
 2563: av_call(alist);
 2564: REST_REGS
 2565: c_addr = prv;
 2566: 
 2567: alloc-callback	( a_ip -- c_addr )	gforth	alloc_callback
 2568: c_addr = (char *)alloc_callback(engine_callback, (Xt *)a_ip);
 2569: 
 2570: va-start-void	( -- )	gforth	va_start_void
 2571: va_start_void(clist);
 2572: 
 2573: va-start-int	( -- )	gforth	va_start_int
 2574: va_start_int(clist);
 2575: 
 2576: va-start-longlong	( -- )	gforth	va_start_longlong
 2577: va_start_longlong(clist);
 2578: 
 2579: va-start-ptr	( -- )	gforth	va_start_ptr
 2580: va_start_ptr(clist, (char *));
 2581: 
 2582: va-start-float	( -- )	gforth	va_start_float
 2583: va_start_float(clist);
 2584: 
 2585: va-start-double	( -- )	gforth	va_start_double
 2586: va_start_double(clist);
 2587: 
 2588: va-arg-int	( -- w )	gforth	va_arg_int
 2589: w = va_arg_int(clist);
 2590: 
 2591: va-arg-longlong	( -- d )	gforth	va_arg_longlong
 2592: #ifdef BUGGY_LONG_LONG
 2593: DLO_IS(d, va_arg_longlong(clist));
 2594: DHI_IS(d, 0);
 2595: #else
 2596: d = va_arg_longlong(clist);
 2597: #endif
 2598: 
 2599: va-arg-ptr	( -- c_addr )	gforth	va_arg_ptr
 2600: c_addr = (char *)va_arg_ptr(clist,char*);
 2601: 
 2602: va-arg-float	( -- r )	gforth	va_arg_float
 2603: r = va_arg_float(clist);
 2604: 
 2605: va-arg-double	( -- r )	gforth	va_arg_double
 2606: r = va_arg_double(clist);
 2607: 
 2608: va-return-void ( -- )	gforth va_return_void
 2609: va_return_void(clist);
 2610: return 0;
 2611: 
 2612: va-return-int ( w -- )	gforth va_return_int
 2613: va_return_int(clist, w);
 2614: return 0;
 2615: 
 2616: va-return-ptr ( c_addr -- )	gforth va_return_ptr
 2617: va_return_ptr(clist, void *, c_addr);
 2618: return 0;
 2619: 
 2620: va-return-longlong ( d -- )	gforth va_return_longlong
 2621: #ifdef BUGGY_LONG_LONG
 2622: va_return_longlong(clist, d.lo);
 2623: #else
 2624: va_return_longlong(clist, d);
 2625: #endif
 2626: return 0;
 2627: 
 2628: va-return-float ( r -- )	gforth va_return_float
 2629: va_return_float(clist, r);
 2630: return 0;
 2631: 
 2632: va-return-double ( r -- )	gforth va_return_double
 2633: va_return_double(clist, r);
 2634: return 0;
 2635: 
 2636: \+
 2637: 
 2638: \+LIBFFI
 2639: 
 2640: ffi-type ( n -- a_type )	gforth ffi_type
 2641: static void* ffi_types[] =
 2642:     { &ffi_type_void,
 2643:       &ffi_type_uint8, &ffi_type_sint8,
 2644:       &ffi_type_uint16, &ffi_type_sint16,
 2645:       &ffi_type_uint32, &ffi_type_sint32,
 2646:       &ffi_type_uint64, &ffi_type_sint64,
 2647:       &ffi_type_float, &ffi_type_double, &ffi_type_longdouble,
 2648:       &ffi_type_pointer };
 2649: a_type = ffi_types[n];
 2650: 
 2651: ffi-size ( n1 -- n2 )	gforth ffi_size
 2652: static int ffi_sizes[] =
 2653:     { sizeof(ffi_cif), sizeof(ffi_closure) };
 2654: n2 = ffi_sizes[n1];
 2655: 
 2656: ffi-prep-cif ( a_atypes n a_rtype a_cif -- w )	gforth ffi_prep_cif
 2657: w = ffi_prep_cif(a_cif, FFI_DEFAULT_ABI, n, a_rtype, a_atypes);
 2658: 
 2659: ffi-call ( a_avalues a_rvalue a_ip a_cif -- )	gforth ffi_call
 2660: SAVE_REGS
 2661: ffi_call(a_cif, a_ip, a_rvalue, a_avalues);
 2662: REST_REGS
 2663: 
 2664: ffi-prep-closure ( a_ip a_cif a_closure -- w )	gforth ffi_prep_closure
 2665: w = ffi_prep_closure(a_closure, a_cif, ffi_callback, a_ip);
 2666: 
 2667: ffi-2@ ( a_addr -- d )	gforth ffi_2fetch
 2668: #ifdef BUGGY_LONG_LONG
 2669: DLO_IS(d, (Cell*)(*a_addr));
 2670: DHI_IS(d, 0);
 2671: #else
 2672: d = *(DCell*)(a_addr);
 2673: #endif
 2674: 
 2675: ffi-2! ( d a_addr -- )	gforth ffi_2store
 2676: #ifdef BUGGY_LONG_LONG
 2677: *(Cell*)(a_addr) = DLO(d);
 2678: #else
 2679: *(DCell*)(a_addr) = d;
 2680: #endif
 2681: 
 2682: ffi-arg-int ( -- w )	gforth ffi_arg_int
 2683: w = *(int *)(*clist++);
 2684: 
 2685: ffi-arg-longlong ( -- d )	gforth ffi_arg_longlong
 2686: #ifdef BUGGY_LONG_LONG
 2687: DLO_IS(d, (Cell*)(*clist++));
 2688: DHI_IS(d, 0);
 2689: #else
 2690: d = *(DCell*)(*clist++);
 2691: #endif
 2692: 
 2693: ffi-arg-ptr ( -- c_addr )	gforth ffi_arg_ptr
 2694: c_addr = *(char **)(*clist++);
 2695: 
 2696: ffi-arg-float ( -- r )	gforth ffi_arg_float
 2697: r = *(float*)(*clist++);
 2698: 
 2699: ffi-arg-double ( -- r )	gforth ffi_arg_double
 2700: r = *(double*)(*clist++);
 2701: 
 2702: ffi-ret-void ( -- )	gforth ffi_ret_void
 2703: return 0;
 2704: 
 2705: ffi-ret-int ( w -- )	gforth ffi_ret_int
 2706: *(int*)(ritem) = w;
 2707: return 0;
 2708: 
 2709: ffi-ret-longlong ( d -- )	gforth ffi_ret_longlong
 2710: #ifdef BUGGY_LONG_LONG
 2711: *(Cell*)(ritem) = DLO(d);
 2712: #else
 2713: *(DCell*)(ritem) = d;
 2714: #endif
 2715: return 0;
 2716: 
 2717: ffi-ret-ptr ( c_addr -- )	gforth ffi_ret_ptr
 2718: *(char **)(ritem) = c_addr;
 2719: return 0;
 2720: 
 2721: ffi-ret-float ( r -- )	gforth ffi_ret_float
 2722: *(float*)(ritem) = r;
 2723: return 0;
 2724: 
 2725: ffi-ret-double ( r -- )	gforth ffi_ret_double
 2726: *(double*)(ritem) = r;
 2727: return 0;
 2728: 
 2729: \+
 2730: 
 2731: \+OLDCALL
 2732: 
 2733: define(`uploop',
 2734:        `pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')')
 2735: define(`_uploop',
 2736:        `ifelse($1, `$3', `$5',
 2737: 	       `$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')')
 2738: \ argflist(argnum): Forth argument list
 2739: define(argflist,
 2740:        `ifelse($1, 0, `',
 2741:                `uploop(`_i', 1, $1, `format(`u%d ', _i)', `format(`u%d ', _i)')')')
 2742: \ argdlist(argnum): declare C's arguments
 2743: define(argdlist,
 2744:        `ifelse($1, 0, `',
 2745:                `uploop(`_i', 1, $1, `Cell, ', `Cell')')')
 2746: \ argclist(argnum): pass C's arguments
 2747: define(argclist,
 2748:        `ifelse($1, 0, `',
 2749:                `uploop(`_i', 1, $1, `format(`u%d, ', _i)', `format(`u%d', _i)')')')
 2750: \ icall(argnum)
 2751: define(icall,
 2752: `icall$1	( argflist($1)u -- uret )	gforth
 2753: uret = (SYSCALL(Cell(*)(argdlist($1)))u)(argclist($1));
 2754: 
 2755: ')
 2756: define(fcall,
 2757: `fcall$1	( argflist($1)u -- rret )	gforth
 2758: rret = (SYSCALL(Float(*)(argdlist($1)))u)(argclist($1));
 2759: 
 2760: ')
 2761: 
 2762: \ close ' to keep fontify happy
 2763: 
 2764: uploop(i, 0, 7, `icall(i)')
 2765: icall(20)
 2766: uploop(i, 0, 7, `fcall(i)')
 2767: fcall(20)
 2768: 
 2769: \+
 2770: \+
 2771: 
 2772: \g peephole
 2773: 
 2774: \+peephole
 2775: 
 2776: compile-prim1 ( a_prim -- ) gforth compile_prim1
 2777: ""compile prim (incl. immargs) at @var{a_prim}""
 2778: compile_prim1(a_prim);
 2779: 
 2780: finish-code ( ... -- ... ) gforth finish_code
 2781: ""Perform delayed steps in code generation (branch resolution, I-cache
 2782: flushing).""
 2783: /* The ... above are a workaround for a bug in gcc-2.95, which fails
 2784:    to save spTOS (gforth-fast --enable-force-reg) */
 2785: finish_code();
 2786: 
 2787: forget-dyncode ( c_code -- f ) gforth-internal forget_dyncode
 2788: f = forget_dyncode(c_code);
 2789: 
 2790: decompile-prim ( a_code -- a_prim ) gforth-internal decompile_prim
 2791: ""a_prim is the code address of the primitive that has been
 2792: compile_prim1ed to a_code""
 2793: a_prim = (Cell *)decompile_code((Label)a_code);
 2794: 
 2795: \ set-next-code and call2 do not appear in images and can be
 2796: \ renumbered arbitrarily
 2797: 
 2798: set-next-code ( #w -- ) gforth set_next_code
 2799: #ifdef NO_IP
 2800: next_code = (Label)w;
 2801: #endif
 2802: 
 2803: call2 ( #a_callee #a_ret_addr -- R:a_ret_addr ) gforth
 2804: /* call with explicit return address */
 2805: #ifdef NO_IP
 2806: INST_TAIL;
 2807: JUMP(a_callee);
 2808: #else
 2809: assert(0);
 2810: #endif
 2811: 
 2812: tag-offsets ( -- a_addr ) gforth tag_offsets
 2813: extern Cell groups[32];
 2814: a_addr = groups;
 2815: 
 2816: \+
 2817: 
 2818: \g static_super
 2819: 
 2820: ifdef(`STACK_CACHE_FILE',
 2821: `include(peeprules.vmg)')
 2822: 
 2823: \g end

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>