File:  [gforth] / gforth / prim
Revision 1.141: download - view: text, annotated - select for diffs
Fri Aug 22 08:08:45 2003 UTC (15 years, 10 months ago) by anton
Branches: MAIN
CVS tags: HEAD
fixed bugs in doer routines (showed up with threadng scheme 1)
testdist portability improvements

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

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