File:  [gforth] / gforth / prim
Revision 1.144: download - view: text, annotated - select for diffs
Sun Sep 14 21:16:48 2003 UTC (15 years, 10 months ago) by pazsan
Branches: MAIN
CVS tags: HEAD
Fixed 8086 target

    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: : -text ( c_addr1 u c_addr2 -- n )
  642:  swap bounds
  643:  ?DO  dup c@ I c@ = WHILE  1+  LOOP  drop 0
  644:  ELSE  c@ I c@ - unloop  THEN  sgn ;
  645: : sgn ( n -- -1/0/1 )
  646:  dup 0= IF EXIT THEN  0< 2* 1+ ;
  647: 
  648: \ -text is only used by replaced primitives now; move it elsewhere
  649: \ -text	( c_addr1 u c_addr2 -- n )	new	dash_text
  650: \ n = memcmp(c_addr1, c_addr2, u);
  651: \ if (n<0)
  652: \   n = -1;
  653: \ else if (n>0)
  654: \   n = 1;
  655: \ :
  656: \  swap bounds
  657: \  ?DO  dup c@ I c@ = WHILE  1+  LOOP  drop 0
  658: \  ELSE  c@ I c@ - unloop  THEN  sgn ;
  659: \ : sgn ( n -- -1/0/1 )
  660: \  dup 0= IF EXIT THEN  0< 2* 1+ ;
  661: 
  662: toupper	( c1 -- c2 )	gforth
  663: ""If @i{c1} is a lower-case character (in the current locale), @i{c2}
  664: is the equivalent upper-case character. All other characters are unchanged.""
  665: c2 = toupper(c1);
  666: :
  667:  dup [char] a - [ char z char a - 1 + ] Literal u<  bl and - ;
  668: 
  669: /string	( c_addr1 u1 n -- c_addr2 u2 )	string	slash_string
  670: ""Adjust the string specified by @i{c-addr1, u1} to remove @i{n}
  671: characters from the start of the string.""
  672: c_addr2 = c_addr1+n;
  673: u2 = u1-n;
  674: :
  675:  tuck - >r + r> dup 0< IF  - 0  THEN ;
  676: 
  677: \g arith
  678: 
  679: lit	( #w -- w )		gforth
  680: :
  681:  r> dup @ swap cell+ >r ;
  682: 
  683: +	( n1 n2 -- n )		core	plus
  684: n = n1+n2;
  685: 
  686: \ lit+ / lit_plus = lit +
  687: 
  688: lit+	( n1 #n2 -- n )		new	lit_plus
  689: n=n1+n2;
  690: 
  691: \ PFE-0.9.14 has it differently, but the next release will have it as follows
  692: under+	( n1 n2 n3 -- n n2 )	gforth	under_plus
  693: ""add @i{n3} to @i{n1} (giving @i{n})""
  694: n = n1+n3;
  695: :
  696:  rot + swap ;
  697: 
  698: -	( n1 n2 -- n )		core	minus
  699: n = n1-n2;
  700: :
  701:  negate + ;
  702: 
  703: negate	( n1 -- n2 )		core
  704: /* use minus as alias */
  705: n2 = -n1;
  706: :
  707:  invert 1+ ;
  708: 
  709: 1+	( n1 -- n2 )		core		one_plus
  710: n2 = n1+1;
  711: :
  712:  1 + ;
  713: 
  714: 1-	( n1 -- n2 )		core		one_minus
  715: n2 = n1-1;
  716: :
  717:  1 - ;
  718: 
  719: max	( n1 n2 -- n )	core
  720: if (n1<n2)
  721:   n = n2;
  722: else
  723:   n = n1;
  724: :
  725:  2dup < IF swap THEN drop ;
  726: 
  727: min	( n1 n2 -- n )	core
  728: if (n1<n2)
  729:   n = n1;
  730: else
  731:   n = n2;
  732: :
  733:  2dup > IF swap THEN drop ;
  734: 
  735: abs	( n -- u )	core
  736: if (n<0)
  737:   u = -n;
  738: else
  739:   u = n;
  740: :
  741:  dup 0< IF negate THEN ;
  742: 
  743: *	( n1 n2 -- n )		core	star
  744: n = n1*n2;
  745: :
  746:  um* drop ;
  747: 
  748: /	( n1 n2 -- n )		core	slash
  749: n = n1/n2;
  750: :
  751:  /mod nip ;
  752: 
  753: mod	( n1 n2 -- n )		core
  754: n = n1%n2;
  755: :
  756:  /mod drop ;
  757: 
  758: /mod	( n1 n2 -- n3 n4 )		core		slash_mod
  759: n4 = n1/n2;
  760: n3 = n1%n2; /* !! is this correct? look into C standard! */
  761: :
  762:  >r s>d r> fm/mod ;
  763: 
  764: 2*	( n1 -- n2 )		core		two_star
  765: ""Shift left by 1; also works on unsigned numbers""
  766: n2 = 2*n1;
  767: :
  768:  dup + ;
  769: 
  770: 2/	( n1 -- n2 )		core		two_slash
  771: ""Arithmetic shift right by 1.  For signed numbers this is a floored
  772: division by 2 (note that @code{/} not necessarily floors).""
  773: n2 = n1>>1;
  774: :
  775:  dup MINI and IF 1 ELSE 0 THEN
  776:  [ bits/byte cell * 1- ] literal 
  777:  0 DO 2* swap dup 2* >r MINI and 
  778:      IF 1 ELSE 0 THEN or r> swap
  779:  LOOP nip ;
  780: 
  781: fm/mod	( d1 n1 -- n2 n3 )		core		f_m_slash_mod
  782: ""Floored division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}.""
  783: #ifdef BUGGY_LONG_LONG
  784: DCell r = fmdiv(d1,n1);
  785: n2=r.hi;
  786: n3=r.lo;
  787: #else
  788: /* assumes that the processor uses either floored or symmetric division */
  789: n3 = d1/n1;
  790: n2 = d1%n1;
  791: /* note that this 1%-3>0 is optimized by the compiler */
  792: if (1%-3>0 && (d1<0) != (n1<0) && n2!=0) {
  793:   n3--;
  794:   n2+=n1;
  795: }
  796: #endif
  797: :
  798:  dup >r dup 0< IF  negate >r dnegate r>  THEN
  799:  over       0< IF  tuck + swap  THEN
  800:  um/mod
  801:  r> 0< IF  swap negate swap  THEN ;
  802: 
  803: sm/rem	( d1 n1 -- n2 n3 )		core		s_m_slash_rem
  804: ""Symmetric division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0.""
  805: #ifdef BUGGY_LONG_LONG
  806: DCell r = smdiv(d1,n1);
  807: n2=r.hi;
  808: n3=r.lo;
  809: #else
  810: /* assumes that the processor uses either floored or symmetric division */
  811: n3 = d1/n1;
  812: n2 = d1%n1;
  813: /* note that this 1%-3<0 is optimized by the compiler */
  814: if (1%-3<0 && (d1<0) != (n1<0) && n2!=0) {
  815:   n3++;
  816:   n2-=n1;
  817: }
  818: #endif
  819: :
  820:  over >r dup >r abs -rot
  821:  dabs rot um/mod
  822:  r> r@ xor 0< IF       negate       THEN
  823:  r>        0< IF  swap negate swap  THEN ;
  824: 
  825: m*	( n1 n2 -- d )		core	m_star
  826: #ifdef BUGGY_LONG_LONG
  827: d = mmul(n1,n2);
  828: #else
  829: d = (DCell)n1 * (DCell)n2;
  830: #endif
  831: :
  832:  2dup      0< and >r
  833:  2dup swap 0< and >r
  834:  um* r> - r> - ;
  835: 
  836: um*	( u1 u2 -- ud )		core	u_m_star
  837: /* use u* as alias */
  838: #ifdef BUGGY_LONG_LONG
  839: ud = ummul(u1,u2);
  840: #else
  841: ud = (UDCell)u1 * (UDCell)u2;
  842: #endif
  843: :
  844:    0 -rot dup [ 8 cells ] literal -
  845:    DO
  846: 	dup 0< I' and d2*+ drop
  847:    LOOP ;
  848: : d2*+ ( ud n -- ud+n c )
  849:    over MINI
  850:    and >r >r 2dup d+ swap r> + swap r> ;
  851: 
  852: um/mod	( ud u1 -- u2 u3 )		core	u_m_slash_mod
  853: ""ud=u3*u1+u2, u1>u2>=0""
  854: #ifdef BUGGY_LONG_LONG
  855: UDCell r = umdiv(ud,u1);
  856: u2=r.hi;
  857: u3=r.lo;
  858: #else
  859: u3 = ud/u1;
  860: u2 = ud%u1;
  861: #endif
  862: :
  863:    0 swap [ 8 cells 1 + ] literal 0
  864:    ?DO /modstep
  865:    LOOP drop swap 1 rshift or swap ;
  866: : /modstep ( ud c R: u -- ud-?u c R: u )
  867:    >r over r@ u< 0= or IF r@ - 1 ELSE 0 THEN  d2*+ r> ;
  868: : d2*+ ( ud n -- ud+n c )
  869:    over MINI
  870:    and >r >r 2dup d+ swap r> + swap r> ;
  871: 
  872: m+	( d1 n -- d2 )		double		m_plus
  873: #ifdef BUGGY_LONG_LONG
  874: d2.lo = d1.lo+n;
  875: d2.hi = d1.hi - (n<0) + (d2.lo<d1.lo);
  876: #else
  877: d2 = d1+n;
  878: #endif
  879: :
  880:  s>d d+ ;
  881: 
  882: d+	( d1 d2 -- d )		double	d_plus
  883: #ifdef BUGGY_LONG_LONG
  884: d.lo = d1.lo+d2.lo;
  885: d.hi = d1.hi + d2.hi + (d.lo<d1.lo);
  886: #else
  887: d = d1+d2;
  888: #endif
  889: :
  890:  rot + >r tuck + swap over u> r> swap - ;
  891: 
  892: d-	( d1 d2 -- d )		double		d_minus
  893: #ifdef BUGGY_LONG_LONG
  894: d.lo = d1.lo - d2.lo;
  895: d.hi = d1.hi-d2.hi-(d1.lo<d2.lo);
  896: #else
  897: d = d1-d2;
  898: #endif
  899: :
  900:  dnegate d+ ;
  901: 
  902: dnegate	( d1 -- d2 )		double	d_negate
  903: /* use dminus as alias */
  904: #ifdef BUGGY_LONG_LONG
  905: d2 = dnegate(d1);
  906: #else
  907: d2 = -d1;
  908: #endif
  909: :
  910:  invert swap negate tuck 0= - ;
  911: 
  912: d2*	( d1 -- d2 )		double		d_two_star
  913: ""Shift left by 1; also works on unsigned numbers""
  914: #ifdef BUGGY_LONG_LONG
  915: d2.lo = d1.lo<<1;
  916: d2.hi = (d1.hi<<1) | (d1.lo>>(CELL_BITS-1));
  917: #else
  918: d2 = 2*d1;
  919: #endif
  920: :
  921:  2dup d+ ;
  922: 
  923: d2/	( d1 -- d2 )		double		d_two_slash
  924: ""Arithmetic shift right by 1.  For signed numbers this is a floored
  925: division by 2.""
  926: #ifdef BUGGY_LONG_LONG
  927: d2.hi = d1.hi>>1;
  928: d2.lo= (d1.lo>>1) | (d1.hi<<(CELL_BITS-1));
  929: #else
  930: d2 = d1>>1;
  931: #endif
  932: :
  933:  dup 1 and >r 2/ swap 2/ [ 1 8 cells 1- lshift 1- ] Literal and
  934:  r> IF  [ 1 8 cells 1- lshift ] Literal + THEN  swap ;
  935: 
  936: and	( w1 w2 -- w )		core
  937: w = w1&w2;
  938: 
  939: or	( w1 w2 -- w )		core
  940: w = w1|w2;
  941: :
  942:  invert swap invert and invert ;
  943: 
  944: xor	( w1 w2 -- w )		core	x_or
  945: w = w1^w2;
  946: 
  947: invert	( w1 -- w2 )		core
  948: w2 = ~w1;
  949: :
  950:  MAXU xor ;
  951: 
  952: rshift	( u1 n -- u2 )		core	r_shift
  953: ""Logical shift right by @i{n} bits.""
  954:   u2 = u1>>n;
  955: :
  956:     0 ?DO 2/ MAXI and LOOP ;
  957: 
  958: lshift	( u1 n -- u2 )		core	l_shift
  959:   u2 = u1<<n;
  960: :
  961:     0 ?DO 2* LOOP ;
  962: 
  963: \g compare
  964: 
  965: \ comparisons(prefix, args, prefix, arg1, arg2, wordsets...)
  966: define(comparisons,
  967: $1=	( $2 -- f )		$6	$3equals
  968: f = FLAG($4==$5);
  969: :
  970:     [ char $1x char 0 = [IF]
  971: 	] IF false ELSE true THEN [
  972:     [ELSE]
  973: 	] xor 0= [
  974:     [THEN] ] ;
  975: 
  976: $1<>	( $2 -- f )		$7	$3not_equals
  977: f = FLAG($4!=$5);
  978: :
  979:     [ char $1x char 0 = [IF]
  980: 	] IF true ELSE false THEN [
  981:     [ELSE]
  982: 	] xor 0<> [
  983:     [THEN] ] ;
  984: 
  985: $1<	( $2 -- f )		$8	$3less_than
  986: f = FLAG($4<$5);
  987: :
  988:     [ char $1x char 0 = [IF]
  989: 	] MINI and 0<> [
  990:     [ELSE] char $1x char u = [IF]
  991: 	]   2dup xor 0<  IF nip ELSE - THEN 0<  [
  992: 	[ELSE]
  993: 	    ] MINI xor >r MINI xor r> u< [
  994: 	[THEN]
  995:     [THEN] ] ;
  996: 
  997: $1>	( $2 -- f )		$9	$3greater_than
  998: f = FLAG($4>$5);
  999: :
 1000:     [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
 1001:     $1< ;
 1002: 
 1003: $1<=	( $2 -- f )		gforth	$3less_or_equal
 1004: f = FLAG($4<=$5);
 1005: :
 1006:     $1> 0= ;
 1007: 
 1008: $1>=	( $2 -- f )		gforth	$3greater_or_equal
 1009: f = FLAG($4>=$5);
 1010: :
 1011:     [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
 1012:     $1<= ;
 1013: 
 1014: )
 1015: 
 1016: comparisons(0, n, zero_, n, 0, core, core-ext, core, core-ext)
 1017: comparisons(, n1 n2, , n1, n2, core, core-ext, core, core)
 1018: comparisons(u, u1 u2, u_, u1, u2, gforth, gforth, core, core-ext)
 1019: 
 1020: \ dcomparisons(prefix, args, prefix, arg1, arg2, wordsets...)
 1021: define(dcomparisons,
 1022: $1=	( $2 -- f )		$6	$3equals
 1023: #ifdef BUGGY_LONG_LONG
 1024: f = FLAG($4.lo==$5.lo && $4.hi==$5.hi);
 1025: #else
 1026: f = FLAG($4==$5);
 1027: #endif
 1028: 
 1029: $1<>	( $2 -- f )		$7	$3not_equals
 1030: #ifdef BUGGY_LONG_LONG
 1031: f = FLAG($4.lo!=$5.lo || $4.hi!=$5.hi);
 1032: #else
 1033: f = FLAG($4!=$5);
 1034: #endif
 1035: 
 1036: $1<	( $2 -- f )		$8	$3less_than
 1037: #ifdef BUGGY_LONG_LONG
 1038: f = FLAG($4.hi==$5.hi ? $4.lo<$5.lo : $4.hi<$5.hi);
 1039: #else
 1040: f = FLAG($4<$5);
 1041: #endif
 1042: 
 1043: $1>	( $2 -- f )		$9	$3greater_than
 1044: #ifdef BUGGY_LONG_LONG
 1045: f = FLAG($4.hi==$5.hi ? $4.lo>$5.lo : $4.hi>$5.hi);
 1046: #else
 1047: f = FLAG($4>$5);
 1048: #endif
 1049: 
 1050: $1<=	( $2 -- f )		gforth	$3less_or_equal
 1051: #ifdef BUGGY_LONG_LONG
 1052: f = FLAG($4.hi==$5.hi ? $4.lo<=$5.lo : $4.hi<=$5.hi);
 1053: #else
 1054: f = FLAG($4<=$5);
 1055: #endif
 1056: 
 1057: $1>=	( $2 -- f )		gforth	$3greater_or_equal
 1058: #ifdef BUGGY_LONG_LONG
 1059: f = FLAG($4.hi==$5.hi ? $4.lo>=$5.lo : $4.hi>=$5.hi);
 1060: #else
 1061: f = FLAG($4>=$5);
 1062: #endif
 1063: 
 1064: )
 1065: 
 1066: \+dcomps
 1067: 
 1068: dcomparisons(d, d1 d2, d_, d1, d2, double, gforth, double, gforth)
 1069: dcomparisons(d0, d, d_zero_, d, DZERO, double, gforth, double, gforth)
 1070: dcomparisons(du, ud1 ud2, d_u_, ud1, ud2, gforth, gforth, double-ext, gforth)
 1071: 
 1072: \+
 1073: 
 1074: within	( u1 u2 u3 -- f )		core-ext
 1075: ""u2=<u1<u3 or: u3=<u2 and u1 is not in [u3,u2).  This works for
 1076: unsigned and signed numbers (but not a mixture).  Another way to think
 1077: about this word is to consider the numbers as a circle (wrapping
 1078: around from @code{max-u} to 0 for unsigned, and from @code{max-n} to
 1079: min-n for signed numbers); now consider the range from u2 towards
 1080: increasing numbers up to and excluding u3 (giving an empty range if
 1081: u2=u3); if u1 is in this range, @code{within} returns true.""
 1082: f = FLAG(u1-u2 < u3-u2);
 1083: :
 1084:  over - >r - r> u< ;
 1085: 
 1086: \g stack
 1087: 
 1088: useraddr	( #u -- a_addr )	new
 1089: a_addr = (Cell *)(up+u);
 1090: 
 1091: up!	( a_addr -- )	gforth	up_store
 1092: UP=up=(char *)a_addr;
 1093: :
 1094:  up ! ;
 1095: Variable UP
 1096: 
 1097: sp@	( -- a_addr )		gforth		sp_fetch
 1098: a_addr = sp+1;
 1099: 
 1100: sp!	( a_addr -- )		gforth		sp_store
 1101: sp = a_addr;
 1102: /* works with and without spTOS caching */
 1103: 
 1104: rp@	( -- a_addr )		gforth		rp_fetch
 1105: a_addr = rp;
 1106: 
 1107: rp!	( a_addr -- )		gforth		rp_store
 1108: rp = a_addr;
 1109: 
 1110: \+floating
 1111: 
 1112: fp@	( -- f_addr )	gforth	fp_fetch
 1113: f_addr = fp;
 1114: 
 1115: fp!	( f_addr -- )	gforth	fp_store
 1116: fp = f_addr;
 1117: 
 1118: \+
 1119: 
 1120: >r	( w -- R:w )		core	to_r
 1121: :
 1122:  (>r) ;
 1123: : (>r)  rp@ cell+ @ rp@ ! rp@ cell+ ! ;
 1124: 
 1125: r>	( R:w -- w )		core	r_from
 1126: :
 1127:  rp@ cell+ @ rp@ @ rp@ cell+ ! (rdrop) rp@ ! ;
 1128: Create (rdrop) ' ;s A,
 1129: 
 1130: rdrop	( R:w -- )		gforth
 1131: :
 1132:  r> r> drop >r ;
 1133: 
 1134: 2>r	( d -- R:d )	core-ext	two_to_r
 1135: :
 1136:  swap r> swap >r swap >r >r ;
 1137: 
 1138: 2r>	( R:d -- d )	core-ext	two_r_from
 1139: :
 1140:  r> r> swap r> swap >r swap ;
 1141: 
 1142: 2r@	( R:d -- R:d d )	core-ext	two_r_fetch
 1143: :
 1144:  i' j ;
 1145: 
 1146: 2rdrop	( R:d -- )		gforth	two_r_drop
 1147: :
 1148:  r> r> drop r> drop >r ;
 1149: 
 1150: over	( w1 w2 -- w1 w2 w1 )		core
 1151: :
 1152:  sp@ cell+ @ ;
 1153: 
 1154: drop	( w -- )		core
 1155: :
 1156:  IF THEN ;
 1157: 
 1158: swap	( w1 w2 -- w2 w1 )		core
 1159: :
 1160:  >r (swap) ! r> (swap) @ ;
 1161: Variable (swap)
 1162: 
 1163: dup	( w -- w w )		core	dupe
 1164: :
 1165:  sp@ @ ;
 1166: 
 1167: rot	( w1 w2 w3 -- w2 w3 w1 )	core	rote
 1168: :
 1169: [ defined? (swap) [IF] ]
 1170:     (swap) ! (rot) ! >r (rot) @ (swap) @ r> ;
 1171: Variable (rot)
 1172: [ELSE] ]
 1173:     >r swap r> swap ;
 1174: [THEN]
 1175: 
 1176: -rot	( w1 w2 w3 -- w3 w1 w2 )	gforth	not_rote
 1177: :
 1178:  rot rot ;
 1179: 
 1180: nip	( w1 w2 -- w2 )		core-ext
 1181: :
 1182:  swap drop ;
 1183: 
 1184: tuck	( w1 w2 -- w2 w1 w2 )	core-ext
 1185: :
 1186:  swap over ;
 1187: 
 1188: ?dup	( w -- w )			core	question_dupe
 1189: ""Actually the stack effect is: @code{( w -- 0 | w w )}.  It performs a
 1190: @code{dup} if w is nonzero.""
 1191: if (w!=0) {
 1192:   IF_spTOS(*sp-- = w;)
 1193: #ifndef USE_TOS
 1194:   *--sp = w;
 1195: #endif
 1196: }
 1197: :
 1198:  dup IF dup THEN ;
 1199: 
 1200: pick	( u -- w )			core-ext
 1201: ""Actually the stack effect is @code{ x0 ... xu u -- x0 ... xu x0 }.""
 1202: w = sp[u+1];
 1203: :
 1204:  1+ cells sp@ + @ ;
 1205: 
 1206: 2drop	( w1 w2 -- )		core	two_drop
 1207: :
 1208:  drop drop ;
 1209: 
 1210: 2dup	( w1 w2 -- w1 w2 w1 w2 )	core	two_dupe
 1211: :
 1212:  over over ;
 1213: 
 1214: 2over	( w1 w2 w3 w4 -- w1 w2 w3 w4 w1 w2 )	core	two_over
 1215: :
 1216:  3 pick 3 pick ;
 1217: 
 1218: 2swap	( w1 w2 w3 w4 -- w3 w4 w1 w2 )	core	two_swap
 1219: :
 1220:  rot >r rot r> ;
 1221: 
 1222: 2rot	( w1 w2 w3 w4 w5 w6 -- w3 w4 w5 w6 w1 w2 )	double-ext	two_rote
 1223: :
 1224:  >r >r 2swap r> r> 2swap ;
 1225: 
 1226: 2nip	( w1 w2 w3 w4 -- w3 w4 )	gforth	two_nip
 1227: :
 1228:  2swap 2drop ;
 1229: 
 1230: 2tuck	( w1 w2 w3 w4 -- w3 w4 w1 w2 w3 w4 )	gforth	two_tuck
 1231: :
 1232:  2swap 2over ;
 1233: 
 1234: \ toggle is high-level: 0.11/0.42%
 1235: 
 1236: \g memory
 1237: 
 1238: @	( a_addr -- w )		core	fetch
 1239: ""@i{w} is the cell stored at @i{a_addr}.""
 1240: w = *a_addr;
 1241: 
 1242: \ lit@ / lit_fetch = lit @
 1243: 
 1244: lit@		( #a_addr -- w ) new	lit_fetch
 1245: w = *a_addr;
 1246: 
 1247: !	( w a_addr -- )		core	store
 1248: ""Store @i{w} into the cell at @i{a-addr}.""
 1249: *a_addr = w;
 1250: 
 1251: +!	( n a_addr -- )		core	plus_store
 1252: ""Add @i{n} to the cell at @i{a-addr}.""
 1253: *a_addr += n;
 1254: :
 1255:  tuck @ + swap ! ;
 1256: 
 1257: c@	( c_addr -- c )		core	c_fetch
 1258: ""@i{c} is the char stored at @i{c_addr}.""
 1259: c = *c_addr;
 1260: :
 1261: [ bigendian [IF] ]
 1262:     [ cell>bit 4 = [IF] ]
 1263: 	dup [ 0 cell - ] Literal and @ swap 1 and
 1264: 	IF  $FF and  ELSE  8>>  THEN  ;
 1265:     [ [ELSE] ]
 1266: 	dup [ cell 1- ] literal and
 1267: 	tuck - @ swap [ cell 1- ] literal xor
 1268:  	0 ?DO 8>> LOOP $FF and
 1269:     [ [THEN] ]
 1270: [ [ELSE] ]
 1271:     [ cell>bit 4 = [IF] ]
 1272: 	dup [ 0 cell - ] Literal and @ swap 1 and
 1273: 	IF  8>>  ELSE  $FF and  THEN
 1274:     [ [ELSE] ]
 1275: 	dup [ cell  1- ] literal and 
 1276: 	tuck - @ swap
 1277: 	0 ?DO 8>> LOOP 255 and
 1278:     [ [THEN] ]
 1279: [ [THEN] ]
 1280: ;
 1281: : 8>> 2/ 2/ 2/ 2/  2/ 2/ 2/ 2/ ;
 1282: 
 1283: c!	( c c_addr -- )		core	c_store
 1284: ""Store @i{c} into the char at @i{c-addr}.""
 1285: *c_addr = c;
 1286: :
 1287: [ bigendian [IF] ]
 1288:     [ cell>bit 4 = [IF] ]
 1289: 	tuck 1 and IF  $FF and  ELSE  8<<  THEN >r
 1290: 	dup -2 and @ over 1 and cells masks + @ and
 1291: 	r> or swap -2 and ! ;
 1292: 	Create masks $00FF , $FF00 ,
 1293:     [ELSE] ]
 1294: 	dup [ cell 1- ] literal and dup 
 1295: 	[ cell 1- ] literal xor >r
 1296: 	- dup @ $FF r@ 0 ?DO 8<< LOOP invert and
 1297: 	rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
 1298:     [THEN]
 1299: [ELSE] ]
 1300:     [ cell>bit 4 = [IF] ]
 1301: 	tuck 1 and IF  8<<  ELSE  $FF and  THEN >r
 1302: 	dup -2 and @ over 1 and cells masks + @ and
 1303: 	r> or swap -2 and ! ;
 1304: 	Create masks $FF00 , $00FF ,
 1305:     [ELSE] ]
 1306: 	dup [ cell 1- ] literal and dup >r
 1307: 	- dup @ $FF r@ 0 ?DO 8<< LOOP invert and
 1308: 	rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
 1309:     [THEN]
 1310: [THEN]
 1311: : 8<< 2* 2* 2* 2*  2* 2* 2* 2* ;
 1312: 
 1313: 2!	( w1 w2 a_addr -- )		core	two_store
 1314: ""Store @i{w2} into the cell at @i{c-addr} and @i{w1} into the next cell.""
 1315: a_addr[0] = w2;
 1316: a_addr[1] = w1;
 1317: :
 1318:  tuck ! cell+ ! ;
 1319: 
 1320: 2@	( a_addr -- w1 w2 )		core	two_fetch
 1321: ""@i{w2} is the content of the cell stored at @i{a-addr}, @i{w1} is
 1322: the content of the next cell.""
 1323: w2 = a_addr[0];
 1324: w1 = a_addr[1];
 1325: :
 1326:  dup cell+ @ swap @ ;
 1327: 
 1328: cell+	( a_addr1 -- a_addr2 )	core	cell_plus
 1329: ""@code{1 cells +}""
 1330: a_addr2 = a_addr1+1;
 1331: :
 1332:  cell + ;
 1333: 
 1334: cells	( n1 -- n2 )		core
 1335: "" @i{n2} is the number of address units of @i{n1} cells.""
 1336: n2 = n1 * sizeof(Cell);
 1337: :
 1338:  [ cell
 1339:  2/ dup [IF] ] 2* [ [THEN]
 1340:  2/ dup [IF] ] 2* [ [THEN]
 1341:  2/ dup [IF] ] 2* [ [THEN]
 1342:  2/ dup [IF] ] 2* [ [THEN]
 1343:  drop ] ;
 1344: 
 1345: char+	( c_addr1 -- c_addr2 )	core	char_plus
 1346: ""@code{1 chars +}.""
 1347: c_addr2 = c_addr1 + 1;
 1348: :
 1349:  1+ ;
 1350: 
 1351: (chars)	( n1 -- n2 )	gforth	paren_chars
 1352: n2 = n1 * sizeof(Char);
 1353: :
 1354:  ;
 1355: 
 1356: count	( c_addr1 -- c_addr2 u )	core
 1357: ""@i{c-addr2} is the first character and @i{u} the length of the
 1358: counted string at @i{c-addr1}.""
 1359: u = *c_addr1;
 1360: c_addr2 = c_addr1+1;
 1361: :
 1362:  dup 1+ swap c@ ;
 1363: 
 1364: \g compiler
 1365: 
 1366: \+f83headerstring
 1367: 
 1368: (f83find)	( c_addr u f83name1 -- f83name2 )	new	paren_f83find
 1369: for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next))
 1370:   if ((UCell)F83NAME_COUNT(f83name1)==u &&
 1371:       memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */)
 1372:     break;
 1373: f83name2=f83name1;
 1374: :
 1375:     BEGIN  dup WHILE  (find-samelen)  dup  WHILE
 1376: 	>r 2dup r@ cell+ char+ capscomp  0=
 1377: 	IF  2drop r>  EXIT  THEN
 1378: 	r> @
 1379:     REPEAT  THEN  nip nip ;
 1380: : (find-samelen) ( u f83name1 -- u f83name2/0 )
 1381:     BEGIN  2dup cell+ c@ $1F and <> WHILE  @  dup 0= UNTIL  THEN ;
 1382: : capscomp ( c_addr1 u c_addr2 -- n )
 1383:  swap bounds
 1384:  ?DO  dup c@ I c@ <>
 1385:      IF  dup c@ toupper I c@ toupper =
 1386:      ELSE  true  THEN  WHILE  1+  LOOP  drop 0
 1387:  ELSE  c@ toupper I c@ toupper - unloop  THEN  sgn ;
 1388: : sgn ( n -- -1/0/1 )
 1389:  dup 0= IF EXIT THEN  0< 2* 1+ ;
 1390: 
 1391: \-
 1392: 
 1393: (listlfind)	( c_addr u longname1 -- longname2 )	new	paren_listlfind
 1394: longname2=listlfind(c_addr, u, longname1);
 1395: :
 1396:     BEGIN  dup WHILE  (findl-samelen)  dup  WHILE
 1397: 	>r 2dup r@ cell+ cell+ capscomp  0=
 1398: 	IF  2drop r>  EXIT  THEN
 1399: 	r> @
 1400:     REPEAT  THEN  nip nip ;
 1401: : (findl-samelen) ( u longname1 -- u longname2/0 )
 1402:     BEGIN  2dup cell+ @ lcount-mask and <> WHILE  @  dup 0= UNTIL  THEN ;
 1403: : capscomp ( c_addr1 u c_addr2 -- n )
 1404:  swap bounds
 1405:  ?DO  dup c@ I c@ <>
 1406:      IF  dup c@ toupper I c@ toupper =
 1407:      ELSE  true  THEN  WHILE  1+  LOOP  drop 0
 1408:  ELSE  c@ toupper I c@ toupper - unloop  THEN  sgn ;
 1409: : sgn ( n -- -1/0/1 )
 1410:  dup 0= IF EXIT THEN  0< 2* 1+ ;
 1411: 
 1412: \+hash
 1413: 
 1414: (hashlfind)	( c_addr u a_addr -- longname2 )	new	paren_hashlfind
 1415: longname2 = hashlfind(c_addr, u, a_addr);
 1416: :
 1417:  BEGIN  dup  WHILE
 1418:         2@ >r >r dup r@ cell+ @ lcount-mask and =
 1419:         IF  2dup r@ cell+ cell+ capscomp 0=
 1420: 	    IF  2drop r> rdrop  EXIT  THEN  THEN
 1421: 	rdrop r>
 1422:  REPEAT nip nip ;
 1423: 
 1424: (tablelfind)	( c_addr u a_addr -- longname2 )	new	paren_tablelfind
 1425: ""A case-sensitive variant of @code{(hashfind)}""
 1426: longname2 = tablelfind(c_addr, u, a_addr);
 1427: :
 1428:  BEGIN  dup  WHILE
 1429:         2@ >r >r dup r@ cell+ @ lcount-mask and =
 1430:         IF  2dup r@ cell+ cell+ -text 0=
 1431: 	    IF  2drop r> rdrop  EXIT  THEN  THEN
 1432: 	rdrop r>
 1433:  REPEAT nip nip ;
 1434: : -text ( c_addr1 u c_addr2 -- n )
 1435:  swap bounds
 1436:  ?DO  dup c@ I c@ = WHILE  1+  LOOP  drop 0
 1437:  ELSE  c@ I c@ - unloop  THEN  sgn ;
 1438: : sgn ( n -- -1/0/1 )
 1439:  dup 0= IF EXIT THEN  0< 2* 1+ ;
 1440: 
 1441: (hashkey1)	( c_addr u ubits -- ukey )		gforth	paren_hashkey1
 1442: ""ukey is the hash key for the string c_addr u fitting in ubits bits""
 1443: ukey = hashkey1(c_addr, u, ubits);
 1444: :
 1445:  dup rot-values + c@ over 1 swap lshift 1- >r
 1446:  tuck - 2swap r> 0 2swap bounds
 1447:  ?DO  dup 4 pick lshift swap 3 pick rshift or
 1448:       I c@ toupper xor
 1449:       over and  LOOP
 1450:  nip nip nip ;
 1451: Create rot-values
 1452:   5 c, 0 c, 1 c, 2 c, 3 c,  4 c, 5 c, 5 c, 5 c, 5 c,
 1453:   3 c, 5 c, 5 c, 5 c, 5 c,  7 c, 5 c, 5 c, 5 c, 5 c,
 1454:   7 c, 5 c, 5 c, 5 c, 5 c,  6 c, 5 c, 5 c, 5 c, 5 c,
 1455:   7 c, 5 c, 5 c,
 1456: 
 1457: \+
 1458: 
 1459: \+
 1460: 
 1461: (parse-white)	( c_addr1 u1 -- c_addr2 u2 )	gforth	paren_parse_white
 1462: struct Cellpair r=parse_white(c_addr1, u1);
 1463: c_addr2 = (Char *)(r.n1);
 1464: u2 = r.n2;
 1465: :
 1466:  BEGIN  dup  WHILE  over c@ bl <=  WHILE  1 /string
 1467:  REPEAT  THEN  2dup
 1468:  BEGIN  dup  WHILE  over c@ bl >   WHILE  1 /string
 1469:  REPEAT  THEN  nip - ;
 1470: 
 1471: aligned	( c_addr -- a_addr )	core
 1472: "" @i{a-addr} is the first aligned address greater than or equal to @i{c-addr}.""
 1473: a_addr = (Cell *)((((Cell)c_addr)+(sizeof(Cell)-1))&(-sizeof(Cell)));
 1474: :
 1475:  [ cell 1- ] Literal + [ -1 cells ] Literal and ;
 1476: 
 1477: faligned	( c_addr -- f_addr )	float	f_aligned
 1478: "" @i{f-addr} is the first float-aligned address greater than or equal to @i{c-addr}.""
 1479: f_addr = (Float *)((((Cell)c_addr)+(sizeof(Float)-1))&(-sizeof(Float)));
 1480: :
 1481:  [ 1 floats 1- ] Literal + [ -1 floats ] Literal and ;
 1482: 
 1483: \ threading stuff is currently only interesting if we have a compiler
 1484: \fhas? standardthreading has? compiler and [IF]
 1485: threading-method	( -- n )	gforth	threading_method
 1486: ""0 if the engine is direct threaded. Note that this may change during
 1487: the lifetime of an image.""
 1488: #if defined(DOUBLY_INDIRECT)
 1489: n=2;
 1490: #else
 1491: # if defined(DIRECT_THREADED)
 1492: n=0;
 1493: # else
 1494: n=1;
 1495: # endif
 1496: #endif
 1497: :
 1498:  1 ;
 1499: 
 1500: \f[THEN]
 1501: 
 1502: \g hostos
 1503: 
 1504: key-file	( wfileid -- n )		gforth	paren_key_file
 1505: #ifdef HAS_FILE
 1506: fflush(stdout);
 1507: n = key((FILE*)wfileid);
 1508: #else
 1509: n = key(stdin);
 1510: #endif
 1511: 
 1512: key?-file	( wfileid -- n )		facility	key_q_file
 1513: #ifdef HAS_FILE
 1514: fflush(stdout);
 1515: n = key_query((FILE*)wfileid);
 1516: #else
 1517: n = key_query(stdin);
 1518: #endif
 1519: 
 1520: \+os
 1521: 
 1522: stdin	( -- wfileid )	gforth
 1523: wfileid = (Cell)stdin;
 1524: 
 1525: stdout	( -- wfileid )	gforth
 1526: wfileid = (Cell)stdout;
 1527: 
 1528: stderr	( -- wfileid )	gforth
 1529: wfileid = (Cell)stderr;
 1530: 
 1531: form	( -- urows ucols )	gforth
 1532: ""The number of lines and columns in the terminal. These numbers may change
 1533: with the window size.""
 1534: /* we could block SIGWINCH here to get a consistent size, but I don't
 1535:  think this is necessary or always beneficial */
 1536: urows=rows;
 1537: ucols=cols;
 1538: 
 1539: flush-icache	( c_addr u -- )	gforth	flush_icache
 1540: ""Make sure that the instruction cache of the processor (if there is
 1541: one) does not contain stale data at @i{c-addr} and @i{u} bytes
 1542: afterwards. @code{END-CODE} performs a @code{flush-icache}
 1543: automatically. Caveat: @code{flush-icache} might not work on your
 1544: installation; this is usually the case if direct threading is not
 1545: supported on your machine (take a look at your @file{machine.h}) and
 1546: your machine has a separate instruction cache. In such cases,
 1547: @code{flush-icache} does nothing instead of flushing the instruction
 1548: cache.""
 1549: FLUSH_ICACHE(c_addr,u);
 1550: 
 1551: (bye)	( n -- )	gforth	paren_bye
 1552: SUPER_END;
 1553: return (Label *)n;
 1554: 
 1555: (system)	( c_addr u -- wretval wior )	gforth	paren_system
 1556: #ifndef MSDOS
 1557: int old_tp=terminal_prepped;
 1558: deprep_terminal();
 1559: #endif
 1560: wretval=system(cstr(c_addr,u,1)); /* ~ expansion on first part of string? */
 1561: wior = IOR(wretval==-1 || (wretval==127 && errno != 0));
 1562: #ifndef MSDOS
 1563: if (old_tp)
 1564:   prep_terminal();
 1565: #endif
 1566: 
 1567: getenv	( c_addr1 u1 -- c_addr2 u2 )	gforth
 1568: ""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2}
 1569: is the host operating system's expansion of that environment variable. If the
 1570: environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters
 1571: in length.""
 1572: /* close ' to keep fontify happy */
 1573: c_addr2 = getenv(cstr(c_addr1,u1,1));
 1574: u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2));
 1575: 
 1576: open-pipe	( c_addr u wfam -- wfileid wior )	gforth	open_pipe
 1577: wfileid=(Cell)popen(cstr(c_addr,u,1),pfileattr[wfam]); /* ~ expansion of 1st arg? */
 1578: wior = IOR(wfileid==0); /* !! the man page says that errno is not set reliably */
 1579: 
 1580: close-pipe	( wfileid -- wretval wior )		gforth	close_pipe
 1581: wretval = pclose((FILE *)wfileid);
 1582: wior = IOR(wretval==-1);
 1583: 
 1584: time&date	( -- nsec nmin nhour nday nmonth nyear )	facility-ext	time_and_date
 1585: ""Report the current time of day. Seconds, minutes and hours are numbered from 0.
 1586: Months are numbered from 1.""
 1587: #if 1
 1588: time_t now;
 1589: struct tm *ltime;
 1590: time(&now);
 1591: ltime=localtime(&now);
 1592: #else
 1593: struct timeval time1;
 1594: struct timezone zone1;
 1595: struct tm *ltime;
 1596: gettimeofday(&time1,&zone1);
 1597: /* !! Single Unix specification: 
 1598:    If tzp is not a null pointer, the behaviour is unspecified. */
 1599: ltime=localtime((time_t *)&time1.tv_sec);
 1600: #endif
 1601: nyear =ltime->tm_year+1900;
 1602: nmonth=ltime->tm_mon+1;
 1603: nday  =ltime->tm_mday;
 1604: nhour =ltime->tm_hour;
 1605: nmin  =ltime->tm_min;
 1606: nsec  =ltime->tm_sec;
 1607: 
 1608: ms	( n -- )	facility-ext
 1609: ""Wait at least @i{n} milli-second.""
 1610: struct timeval timeout;
 1611: timeout.tv_sec=n/1000;
 1612: timeout.tv_usec=1000*(n%1000);
 1613: (void)select(0,0,0,0,&timeout);
 1614: 
 1615: allocate	( u -- a_addr wior )	memory
 1616: ""Allocate @i{u} address units of contiguous data space. The initial
 1617: contents of the data space is undefined. If the allocation is successful,
 1618: @i{a-addr} is the start address of the allocated region and @i{wior}
 1619: is 0. If the allocation fails, @i{a-addr} is undefined and @i{wior}
 1620: is a non-zero I/O result code.""
 1621: a_addr = (Cell *)malloc(u?u:1);
 1622: wior = IOR(a_addr==NULL);
 1623: 
 1624: free	( a_addr -- wior )		memory
 1625: ""Return the region of data space starting at @i{a-addr} to the system.
 1626: The region must originally have been obtained using @code{allocate} or
 1627: @code{resize}. If the operational is successful, @i{wior} is 0.
 1628: If the operation fails, @i{wior} is a non-zero I/O result code.""
 1629: free(a_addr);
 1630: wior = 0;
 1631: 
 1632: resize	( a_addr1 u -- a_addr2 wior )	memory
 1633: ""Change the size of the allocated area at @i{a-addr1} to @i{u}
 1634: address units, possibly moving the contents to a different
 1635: area. @i{a-addr2} is the address of the resulting area.
 1636: If the operation is successful, @i{wior} is 0.
 1637: If the operation fails, @i{wior} is a non-zero
 1638: I/O result code. If @i{a-addr1} is 0, Gforth's (but not the Standard)
 1639: @code{resize} @code{allocate}s @i{u} address units.""
 1640: /* the following check is not necessary on most OSs, but it is needed
 1641:    on SunOS 4.1.2. */
 1642: /* close ' to keep fontify happy */
 1643: if (a_addr1==NULL)
 1644:   a_addr2 = (Cell *)malloc(u);
 1645: else
 1646:   a_addr2 = (Cell *)realloc(a_addr1, u);
 1647: wior = IOR(a_addr2==NULL);	/* !! Define a return code */
 1648: 
 1649: strerror	( n -- c_addr u )	gforth
 1650: c_addr = strerror(n);
 1651: u = strlen(c_addr);
 1652: 
 1653: strsignal	( n -- c_addr u )	gforth
 1654: c_addr = (Address)strsignal(n);
 1655: u = strlen(c_addr);
 1656: 
 1657: call-c	( w -- )	gforth	call_c
 1658: ""Call the C function pointed to by @i{w}. The C function has to
 1659: access the stack itself. The stack pointers are exported in the global
 1660: variables @code{SP} and @code{FP}.""
 1661: /* This is a first attempt at support for calls to C. This may change in
 1662:    the future */
 1663: IF_fpTOS(fp[0]=fpTOS);
 1664: FP=fp;
 1665: SP=sp;
 1666: ((void (*)())w)();
 1667: sp=SP;
 1668: fp=FP;
 1669: IF_spTOS(spTOS=sp[0]);
 1670: IF_fpTOS(fpTOS=fp[0]);
 1671: 
 1672: \+
 1673: \+file
 1674: 
 1675: close-file	( wfileid -- wior )		file	close_file
 1676: wior = IOR(fclose((FILE *)wfileid)==EOF);
 1677: 
 1678: open-file	( c_addr u wfam -- wfileid wior )	file	open_file
 1679: wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[wfam]);
 1680: wior =  IOR(wfileid == 0);
 1681: 
 1682: create-file	( c_addr u wfam -- wfileid wior )	file	create_file
 1683: Cell	fd;
 1684: fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[wfam], 0666);
 1685: if (fd != -1) {
 1686:   wfileid = (Cell)fdopen(fd, fileattr[wfam]);
 1687:   wior = IOR(wfileid == 0);
 1688: } else {
 1689:   wfileid = 0;
 1690:   wior = IOR(1);
 1691: }
 1692: 
 1693: delete-file	( c_addr u -- wior )		file	delete_file
 1694: wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1);
 1695: 
 1696: rename-file	( c_addr1 u1 c_addr2 u2 -- wior )	file-ext	rename_file
 1697: ""Rename file @i{c_addr1 u1} to new name @i{c_addr2 u2}""
 1698: wior = rename_file(c_addr1, u1, c_addr2, u2);
 1699: 
 1700: file-position	( wfileid -- ud wior )	file	file_position
 1701: /* !! use tell and lseek? */
 1702: ud = OFF2UD(ftello((FILE *)wfileid));
 1703: wior = IOR(UD2OFF(ud)==-1);
 1704: 
 1705: reposition-file	( ud wfileid -- wior )	file	reposition_file
 1706: wior = IOR(fseeko((FILE *)wfileid, UD2OFF(ud), SEEK_SET)==-1);
 1707: 
 1708: file-size	( wfileid -- ud wior )	file	file_size
 1709: struct stat buf;
 1710: wior = IOR(fstat(fileno((FILE *)wfileid), &buf)==-1);
 1711: ud = OFF2UD(buf.st_size);
 1712: 
 1713: resize-file	( ud wfileid -- wior )	file	resize_file
 1714: wior = IOR(ftruncate(fileno((FILE *)wfileid), UD2OFF(ud))==-1);
 1715: 
 1716: read-file	( c_addr u1 wfileid -- u2 wior )	file	read_file
 1717: /* !! fread does not guarantee enough */
 1718: u2 = fread(c_addr, sizeof(Char), u1, (FILE *)wfileid);
 1719: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
 1720: /* !! is the value of ferror errno-compatible? */
 1721: if (wior)
 1722:   clearerr((FILE *)wfileid);
 1723: 
 1724: (read-line)	( c_addr u1 wfileid -- u2 flag u3 wior ) file	paren_read_line
 1725: struct Cellquad r = read_line(c_addr, u1, wfileid);
 1726: u2   = r.n1;
 1727: flag = r.n2;
 1728: u3   = r.n3;
 1729: wior = r.n4;
 1730: 
 1731: \+
 1732: 
 1733: write-file	( c_addr u1 wfileid -- wior )	file	write_file
 1734: /* !! fwrite does not guarantee enough */
 1735: #ifdef HAS_FILE
 1736: {
 1737:   UCell u2 = fwrite(c_addr, sizeof(Char), u1, (FILE *)wfileid);
 1738:   wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
 1739:   if (wior)
 1740:     clearerr((FILE *)wfileid);
 1741: }
 1742: #else
 1743: TYPE(c_addr, u1);
 1744: #endif
 1745: 
 1746: emit-file	( c wfileid -- wior )	gforth	emit_file
 1747: #ifdef HAS_FILE
 1748: wior = FILEIO(putc(c, (FILE *)wfileid)==EOF);
 1749: if (wior)
 1750:   clearerr((FILE *)wfileid);
 1751: #else
 1752: PUTC(c);
 1753: #endif
 1754: 
 1755: \+file
 1756: 
 1757: flush-file	( wfileid -- wior )		file-ext	flush_file
 1758: wior = IOR(fflush((FILE *) wfileid)==EOF);
 1759: 
 1760: file-status	( c_addr u -- wfam wior )	file-ext	file_status
 1761: struct Cellpair r = file_status(c_addr, u);
 1762: wfam = r.n1;
 1763: wior = r.n2;
 1764: 
 1765: file-eof?	( wfileid -- flag )	gforth	file_eof_query
 1766: flag = FLAG(feof((FILE *) wfileid));
 1767: 
 1768: open-dir	( c_addr u -- wdirid wior )	gforth	open_dir
 1769: ""Open the directory specified by @i{c-addr, u}
 1770: and return @i{dir-id} for futher access to it.""
 1771: wdirid = (Cell)opendir(tilde_cstr(c_addr, u, 1));
 1772: wior =  IOR(wdirid == 0);
 1773: 
 1774: read-dir	( c_addr u1 wdirid -- u2 flag wior )	gforth	read_dir
 1775: ""Attempt to read the next entry from the directory specified
 1776: by @i{dir-id} to the buffer of length @i{u1} at address @i{c-addr}. 
 1777: If the attempt fails because there is no more entries,
 1778: @i{ior}=0, @i{flag}=0, @i{u2}=0, and the buffer is unmodified.
 1779: If the attempt to read the next entry fails because of any other reason, 
 1780: return @i{ior}<>0.
 1781: If the attempt succeeds, store file name to the buffer at @i{c-addr}
 1782: and return @i{ior}=0, @i{flag}=true and @i{u2} equal to the size of the file name.
 1783: If the length of the file name is greater than @i{u1}, 
 1784: store first @i{u1} characters from file name into the buffer and
 1785: indicate "name too long" with @i{ior}, @i{flag}=true, and @i{u2}=@i{u1}.""
 1786: struct dirent * dent;
 1787: dent = readdir((DIR *)wdirid);
 1788: wior = 0;
 1789: flag = -1;
 1790: if(dent == NULL) {
 1791:   u2 = 0;
 1792:   flag = 0;
 1793: } else {
 1794:   u2 = strlen(dent->d_name);
 1795:   if(u2 > u1) {
 1796:     u2 = u1;
 1797:     wior = -512-ENAMETOOLONG;
 1798:   }
 1799:   memmove(c_addr, dent->d_name, u2);
 1800: }
 1801: 
 1802: close-dir	( wdirid -- wior )	gforth	close_dir
 1803: ""Close the directory specified by @i{dir-id}.""
 1804: wior = IOR(closedir((DIR *)wdirid));
 1805: 
 1806: filename-match	( c_addr1 u1 c_addr2 u2 -- flag )	gforth	match_file
 1807: char * string = cstr(c_addr1, u1, 1);
 1808: char * pattern = cstr(c_addr2, u2, 0);
 1809: flag = FLAG(!fnmatch(pattern, string, 0));
 1810: 
 1811: \+
 1812: 
 1813: newline	( -- c_addr u )	gforth
 1814: ""String containing the newline sequence of the host OS""
 1815: char newline[] = {
 1816: #if DIRSEP=='/'
 1817: /* Unix */
 1818: '\n'
 1819: #else
 1820: /* DOS, Win, OS/2 */
 1821: '\r','\n'
 1822: #endif
 1823: };
 1824: c_addr=newline;
 1825: u=sizeof(newline);
 1826: :
 1827:  "newline count ;
 1828: Create "newline e? crlf [IF] 2 c, $0D c, [ELSE] 1 c, [THEN] $0A c,
 1829: 
 1830: \+os
 1831: 
 1832: utime	( -- dtime )	gforth
 1833: ""Report the current time in microseconds since some epoch.""
 1834: struct timeval time1;
 1835: gettimeofday(&time1,NULL);
 1836: dtime = timeval2us(&time1);
 1837: 
 1838: cputime ( -- duser dsystem ) gforth
 1839: ""duser and dsystem are the respective user- and system-level CPU
 1840: times used since the start of the Forth system (excluding child
 1841: processes), in microseconds (the granularity may be much larger,
 1842: however).  On platforms without the getrusage call, it reports elapsed
 1843: time (since some epoch) for duser and 0 for dsystem.""
 1844: #ifdef HAVE_GETRUSAGE
 1845: struct rusage usage;
 1846: getrusage(RUSAGE_SELF, &usage);
 1847: duser = timeval2us(&usage.ru_utime);
 1848: dsystem = timeval2us(&usage.ru_stime);
 1849: #else
 1850: struct timeval time1;
 1851: gettimeofday(&time1,NULL);
 1852: duser = timeval2us(&time1);
 1853: #ifndef BUGGY_LONG_LONG
 1854: dsystem = (DCell)0;
 1855: #else
 1856: dsystem=(DCell){0,0};
 1857: #endif
 1858: #endif
 1859: 
 1860: \+
 1861: 
 1862: \+floating
 1863: 
 1864: \g floating
 1865: 
 1866: comparisons(f, r1 r2, f_, r1, r2, gforth, gforth, float, gforth)
 1867: comparisons(f0, r, f_zero_, r, 0., float, gforth, float, gforth)
 1868: 
 1869: d>f	( d -- r )		float	d_to_f
 1870: #ifdef BUGGY_LONG_LONG
 1871: extern double ldexp(double x, int exp);
 1872: if (d.hi<0) {
 1873:   DCell d2=dnegate(d);
 1874:   r = -(ldexp((Float)d2.hi,CELL_BITS) + (Float)d2.lo);
 1875: } else
 1876:   r = ldexp((Float)d.hi,CELL_BITS) + (Float)d.lo;
 1877: #else
 1878: r = d;
 1879: #endif
 1880: 
 1881: f>d	( r -- d )		float	f_to_d
 1882: extern DCell double2ll(Float r);
 1883: d = double2ll(r);
 1884: 
 1885: f!	( r f_addr -- )	float	f_store
 1886: ""Store @i{r} into the float at address @i{f-addr}.""
 1887: *f_addr = r;
 1888: 
 1889: f@	( f_addr -- r )	float	f_fetch
 1890: ""@i{r} is the float at address @i{f-addr}.""
 1891: r = *f_addr;
 1892: 
 1893: df@	( df_addr -- r )	float-ext	d_f_fetch
 1894: ""Fetch the double-precision IEEE floating-point value @i{r} from the address @i{df-addr}.""
 1895: #ifdef IEEE_FP
 1896: r = *df_addr;
 1897: #else
 1898: !! df@
 1899: #endif
 1900: 
 1901: df!	( r df_addr -- )	float-ext	d_f_store
 1902: ""Store @i{r} as double-precision IEEE floating-point value to the
 1903: address @i{df-addr}.""
 1904: #ifdef IEEE_FP
 1905: *df_addr = r;
 1906: #else
 1907: !! df!
 1908: #endif
 1909: 
 1910: sf@	( sf_addr -- r )	float-ext	s_f_fetch
 1911: ""Fetch the single-precision IEEE floating-point value @i{r} from the address @i{sf-addr}.""
 1912: #ifdef IEEE_FP
 1913: r = *sf_addr;
 1914: #else
 1915: !! sf@
 1916: #endif
 1917: 
 1918: sf!	( r sf_addr -- )	float-ext	s_f_store
 1919: ""Store @i{r} as single-precision IEEE floating-point value to the
 1920: address @i{sf-addr}.""
 1921: #ifdef IEEE_FP
 1922: *sf_addr = r;
 1923: #else
 1924: !! sf!
 1925: #endif
 1926: 
 1927: f+	( r1 r2 -- r3 )	float	f_plus
 1928: r3 = r1+r2;
 1929: 
 1930: f-	( r1 r2 -- r3 )	float	f_minus
 1931: r3 = r1-r2;
 1932: 
 1933: f*	( r1 r2 -- r3 )	float	f_star
 1934: r3 = r1*r2;
 1935: 
 1936: f/	( r1 r2 -- r3 )	float	f_slash
 1937: r3 = r1/r2;
 1938: 
 1939: f**	( r1 r2 -- r3 )	float-ext	f_star_star
 1940: ""@i{r3} is @i{r1} raised to the @i{r2}th power.""
 1941: r3 = pow(r1,r2);
 1942: 
 1943: fnegate	( r1 -- r2 )	float	f_negate
 1944: r2 = - r1;
 1945: 
 1946: fdrop	( r -- )		float	f_drop
 1947: 
 1948: fdup	( r -- r r )	float	f_dupe
 1949: 
 1950: fswap	( r1 r2 -- r2 r1 )	float	f_swap
 1951: 
 1952: fover	( r1 r2 -- r1 r2 r1 )	float	f_over
 1953: 
 1954: frot	( r1 r2 r3 -- r2 r3 r1 )	float	f_rote
 1955: 
 1956: fnip	( r1 r2 -- r2 )	gforth	f_nip
 1957: 
 1958: ftuck	( r1 r2 -- r2 r1 r2 )	gforth	f_tuck
 1959: 
 1960: float+	( f_addr1 -- f_addr2 )	float	float_plus
 1961: ""@code{1 floats +}.""
 1962: f_addr2 = f_addr1+1;
 1963: 
 1964: floats	( n1 -- n2 )	float
 1965: ""@i{n2} is the number of address units of @i{n1} floats.""
 1966: n2 = n1*sizeof(Float);
 1967: 
 1968: floor	( r1 -- r2 )	float
 1969: ""Round towards the next smaller integral value, i.e., round toward negative infinity.""
 1970: /* !! unclear wording */
 1971: r2 = floor(r1);
 1972: 
 1973: fround	( r1 -- r2 )	gforth	f_round
 1974: ""Round to the nearest integral value.""
 1975: r2 = rint(r1);
 1976: 
 1977: fmax	( r1 r2 -- r3 )	float	f_max
 1978: if (r1<r2)
 1979:   r3 = r2;
 1980: else
 1981:   r3 = r1;
 1982: 
 1983: fmin	( r1 r2 -- r3 )	float	f_min
 1984: if (r1<r2)
 1985:   r3 = r1;
 1986: else
 1987:   r3 = r2;
 1988: 
 1989: represent	( r c_addr u -- n f1 f2 )	float
 1990: char *sig;
 1991: size_t siglen;
 1992: int flag;
 1993: int decpt;
 1994: sig=ecvt(r, u, &decpt, &flag);
 1995: n=(r==0. ? 1 : decpt);
 1996: f1=FLAG(flag!=0);
 1997: f2=FLAG(isdigit((unsigned)(sig[0]))!=0);
 1998: siglen=strlen(sig);
 1999: if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */
 2000:   siglen=u;
 2001: memcpy(c_addr,sig,siglen);
 2002: memset(c_addr+siglen,f2?'0':' ',u-siglen);
 2003: 
 2004: >float	( c_addr u -- flag )	float	to_float
 2005: ""Actual stack effect: ( c_addr u -- r t | f ).  Attempt to convert the
 2006: character string @i{c-addr u} to internal floating-point
 2007: representation. If the string represents a valid floating-point number
 2008: @i{r} is placed on the floating-point stack and @i{flag} is
 2009: true. Otherwise, @i{flag} is false. A string of blanks is a special
 2010: case and represents the floating-point number 0.""
 2011: Float r;
 2012: flag = to_float(c_addr, u, &r);
 2013: if (flag) {
 2014:   IF_fpTOS(fp[0] = fpTOS);
 2015:   fp += -1;
 2016:   fpTOS = r;
 2017: }
 2018: 
 2019: fabs	( r1 -- r2 )	float-ext	f_abs
 2020: r2 = fabs(r1);
 2021: 
 2022: facos	( r1 -- r2 )	float-ext	f_a_cos
 2023: r2 = acos(r1);
 2024: 
 2025: fasin	( r1 -- r2 )	float-ext	f_a_sine
 2026: r2 = asin(r1);
 2027: 
 2028: fatan	( r1 -- r2 )	float-ext	f_a_tan
 2029: r2 = atan(r1);
 2030: 
 2031: fatan2	( r1 r2 -- r3 )	float-ext	f_a_tan_two
 2032: ""@i{r1/r2}=tan(@i{r3}). ANS Forth does not require, but probably
 2033: intends this to be the inverse of @code{fsincos}. In gforth it is.""
 2034: r3 = atan2(r1,r2);
 2035: 
 2036: fcos	( r1 -- r2 )	float-ext	f_cos
 2037: r2 = cos(r1);
 2038: 
 2039: fexp	( r1 -- r2 )	float-ext	f_e_x_p
 2040: r2 = exp(r1);
 2041: 
 2042: fexpm1	( r1 -- r2 )	float-ext	f_e_x_p_m_one
 2043: ""@i{r2}=@i{e}**@i{r1}@minus{}1""
 2044: #ifdef HAVE_EXPM1
 2045: extern double
 2046: #ifdef NeXT
 2047:               const
 2048: #endif
 2049:                     expm1(double);
 2050: r2 = expm1(r1);
 2051: #else
 2052: r2 = exp(r1)-1.;
 2053: #endif
 2054: 
 2055: fln	( r1 -- r2 )	float-ext	f_l_n
 2056: r2 = log(r1);
 2057: 
 2058: flnp1	( r1 -- r2 )	float-ext	f_l_n_p_one
 2059: ""@i{r2}=ln(@i{r1}+1)""
 2060: #ifdef HAVE_LOG1P
 2061: extern double
 2062: #ifdef NeXT
 2063:               const
 2064: #endif
 2065:                     log1p(double);
 2066: r2 = log1p(r1);
 2067: #else
 2068: r2 = log(r1+1.);
 2069: #endif
 2070: 
 2071: flog	( r1 -- r2 )	float-ext	f_log
 2072: ""The decimal logarithm.""
 2073: r2 = log10(r1);
 2074: 
 2075: falog	( r1 -- r2 )	float-ext	f_a_log
 2076: ""@i{r2}=10**@i{r1}""
 2077: extern double pow10(double);
 2078: r2 = pow10(r1);
 2079: 
 2080: fsin	( r1 -- r2 )	float-ext	f_sine
 2081: r2 = sin(r1);
 2082: 
 2083: fsincos	( r1 -- r2 r3 )	float-ext	f_sine_cos
 2084: ""@i{r2}=sin(@i{r1}), @i{r3}=cos(@i{r1})""
 2085: r2 = sin(r1);
 2086: r3 = cos(r1);
 2087: 
 2088: fsqrt	( r1 -- r2 )	float-ext	f_square_root
 2089: r2 = sqrt(r1);
 2090: 
 2091: ftan	( r1 -- r2 )	float-ext	f_tan
 2092: r2 = tan(r1);
 2093: :
 2094:  fsincos f/ ;
 2095: 
 2096: fsinh	( r1 -- r2 )	float-ext	f_cinch
 2097: r2 = sinh(r1);
 2098: :
 2099:  fexpm1 fdup fdup 1. d>f f+ f/ f+ f2/ ;
 2100: 
 2101: fcosh	( r1 -- r2 )	float-ext	f_cosh
 2102: r2 = cosh(r1);
 2103: :
 2104:  fexp fdup 1/f f+ f2/ ;
 2105: 
 2106: ftanh	( r1 -- r2 )	float-ext	f_tan_h
 2107: r2 = tanh(r1);
 2108: :
 2109:  f2* fexpm1 fdup 2. d>f f+ f/ ;
 2110: 
 2111: fasinh	( r1 -- r2 )	float-ext	f_a_cinch
 2112: r2 = asinh(r1);
 2113: :
 2114:  fdup fdup f* 1. d>f f+ fsqrt f/ fatanh ;
 2115: 
 2116: facosh	( r1 -- r2 )	float-ext	f_a_cosh
 2117: r2 = acosh(r1);
 2118: :
 2119:  fdup fdup f* 1. d>f f- fsqrt f+ fln ;
 2120: 
 2121: fatanh	( r1 -- r2 )	float-ext	f_a_tan_h
 2122: r2 = atanh(r1);
 2123: :
 2124:  fdup f0< >r fabs 1. d>f fover f- f/  f2* flnp1 f2/
 2125:  r> IF  fnegate  THEN ;
 2126: 
 2127: sfloats	( n1 -- n2 )	float-ext	s_floats
 2128: ""@i{n2} is the number of address units of @i{n1}
 2129: single-precision IEEE floating-point numbers.""
 2130: n2 = n1*sizeof(SFloat);
 2131: 
 2132: dfloats	( n1 -- n2 )	float-ext	d_floats
 2133: ""@i{n2} is the number of address units of @i{n1}
 2134: double-precision IEEE floating-point numbers.""
 2135: n2 = n1*sizeof(DFloat);
 2136: 
 2137: sfaligned	( c_addr -- sf_addr )	float-ext	s_f_aligned
 2138: ""@i{sf-addr} is the first single-float-aligned address greater
 2139: than or equal to @i{c-addr}.""
 2140: sf_addr = (SFloat *)((((Cell)c_addr)+(sizeof(SFloat)-1))&(-sizeof(SFloat)));
 2141: :
 2142:  [ 1 sfloats 1- ] Literal + [ -1 sfloats ] Literal and ;
 2143: 
 2144: dfaligned	( c_addr -- df_addr )	float-ext	d_f_aligned
 2145: ""@i{df-addr} is the first double-float-aligned address greater
 2146: than or equal to @i{c-addr}.""
 2147: df_addr = (DFloat *)((((Cell)c_addr)+(sizeof(DFloat)-1))&(-sizeof(DFloat)));
 2148: :
 2149:  [ 1 dfloats 1- ] Literal + [ -1 dfloats ] Literal and ;
 2150: 
 2151: v*	( f_addr1 nstride1 f_addr2 nstride2 ucount -- r ) gforth v_star
 2152: ""dot-product: r=v1*v2.  The first element of v1 is at f_addr1, the
 2153: next at f_addr1+nstride1 and so on (similar for v2). Both vectors have
 2154: ucount elements.""
 2155: r = v_star(f_addr1, nstride1, f_addr2, nstride2, ucount);
 2156: :
 2157:  >r swap 2swap swap 0e r> 0 ?DO
 2158:      dup f@ over + 2swap dup f@ f* f+ over + 2swap
 2159:  LOOP 2drop 2drop ; 
 2160: 
 2161: faxpy	( ra f_x nstridex f_y nstridey ucount -- )	gforth
 2162: ""vy=ra*vx+vy""
 2163: faxpy(ra, f_x, nstridex, f_y, nstridey, ucount);
 2164: :
 2165:  >r swap 2swap swap r> 0 ?DO
 2166:      fdup dup f@ f* over + 2swap dup f@ f+ dup f! over + 2swap
 2167:  LOOP 2drop 2drop fdrop ;
 2168: 
 2169: \+
 2170: 
 2171: \ The following words access machine/OS/installation-dependent
 2172: \   Gforth internals
 2173: \ !! how about environmental queries DIRECT-THREADED,
 2174: \   INDIRECT-THREADED, TOS-CACHED, FTOS-CACHED, CODEFIELD-DOES */
 2175: 
 2176: \ local variable implementation primitives
 2177: 
 2178: \+glocals
 2179: 
 2180: \g locals
 2181: 
 2182: @local#	( #noffset -- w )	gforth	fetch_local_number
 2183: w = *(Cell *)(lp+noffset);
 2184: 
 2185: @local0	( -- w )	new	fetch_local_zero
 2186: w = ((Cell *)lp)[0];
 2187: 
 2188: @local1	( -- w )	new	fetch_local_four
 2189: w = ((Cell *)lp)[1];
 2190: 
 2191: @local2	( -- w )	new	fetch_local_eight
 2192: w = ((Cell *)lp)[2];
 2193: 
 2194: @local3	( -- w )	new	fetch_local_twelve
 2195: w = ((Cell *)lp)[3];
 2196: 
 2197: \+floating
 2198: 
 2199: f@local#	( #noffset -- r )	gforth	f_fetch_local_number
 2200: r = *(Float *)(lp+noffset);
 2201: 
 2202: f@local0	( -- r )	new	f_fetch_local_zero
 2203: r = ((Float *)lp)[0];
 2204: 
 2205: f@local1	( -- r )	new	f_fetch_local_eight
 2206: r = ((Float *)lp)[1];
 2207: 
 2208: \+
 2209: 
 2210: laddr#	( #noffset -- c_addr )	gforth	laddr_number
 2211: /* this can also be used to implement lp@ */
 2212: c_addr = (Char *)(lp+noffset);
 2213: 
 2214: lp+!#	( #noffset -- )	gforth	lp_plus_store_number
 2215: ""used with negative immediate values it allocates memory on the
 2216: local stack, a positive immediate argument drops memory from the local
 2217: stack""
 2218: lp += noffset;
 2219: 
 2220: lp-	( -- )	new	minus_four_lp_plus_store
 2221: lp += -sizeof(Cell);
 2222: 
 2223: lp+	( -- )	new	eight_lp_plus_store
 2224: lp += sizeof(Float);
 2225: 
 2226: lp+2	( -- )	new	sixteen_lp_plus_store
 2227: lp += 2*sizeof(Float);
 2228: 
 2229: lp!	( c_addr -- )	gforth	lp_store
 2230: lp = (Address)c_addr;
 2231: 
 2232: >l	( w -- )	gforth	to_l
 2233: lp -= sizeof(Cell);
 2234: *(Cell *)lp = w;
 2235: 
 2236: \+floating
 2237: 
 2238: f>l	( r -- )	gforth	f_to_l
 2239: lp -= sizeof(Float);
 2240: *(Float *)lp = r;
 2241: 
 2242: fpick	( u -- r )		gforth
 2243: ""Actually the stack effect is @code{ r0 ... ru u -- r0 ... ru r0 }.""
 2244: r = fp[u+1]; /* +1, because update of fp happens before this fragment */
 2245: :
 2246:  floats fp@ + f@ ;
 2247: 
 2248: \+
 2249: \+
 2250: 
 2251: \+OS
 2252: 
 2253: \g syslib
 2254: 
 2255: open-lib	( c_addr1 u1 -- u2 )	gforth	open_lib
 2256: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
 2257: #ifndef RTLD_GLOBAL
 2258: #define RTLD_GLOBAL 0
 2259: #endif
 2260: u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY);
 2261: #else
 2262: #  ifdef _WIN32
 2263: u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1));
 2264: #  else
 2265: #warning Define open-lib!
 2266: u2 = 0;
 2267: #  endif
 2268: #endif
 2269: 
 2270: lib-sym	( c_addr1 u1 u2 -- u3 )	gforth	lib_sym
 2271: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
 2272: u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1));
 2273: #else
 2274: #  ifdef _WIN32
 2275: u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1));
 2276: #  else
 2277: #warning Define lib-sym!
 2278: u3 = 0;
 2279: #  endif
 2280: #endif
 2281: 
 2282: wcall	( u -- )	gforth
 2283: IF_fpTOS(fp[0]=fpTOS);
 2284: FP=fp;
 2285: sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &FP);
 2286: fp=FP;
 2287: IF_spTOS(spTOS=sp[0];)
 2288: IF_fpTOS(fpTOS=fp[0]);
 2289: 
 2290: \+FFCALL
 2291: 
 2292: av-start-void	( c_addr -- )	gforth  av_start_void
 2293: av_start_void(alist, c_addr);
 2294: 
 2295: av-start-int	( c_addr -- )	gforth  av_start_int
 2296: av_start_int(alist, c_addr, &irv);
 2297: 
 2298: av-start-float	( c_addr -- )	gforth  av_start_float
 2299: av_start_float(alist, c_addr, &frv);
 2300: 
 2301: av-start-double	( c_addr -- )	gforth  av_start_double
 2302: av_start_double(alist, c_addr, &drv);
 2303: 
 2304: av-start-longlong	( c_addr -- )	gforth  av_start_longlong
 2305: av_start_longlong(alist, c_addr, &llrv);
 2306: 
 2307: av-start-ptr	( c_addr -- )	gforth  av_start_ptr
 2308: av_start_ptr(alist, c_addr, void*, &prv);
 2309: 
 2310: av-int  ( w -- )  gforth  av_int
 2311: av_int(alist, w);
 2312: 
 2313: av-float	( r -- )	gforth  av_float
 2314: av_float(alist, r);
 2315: 
 2316: av-double	( r -- )	gforth  av_double
 2317: av_double(alist, r);
 2318: 
 2319: av-longlong	( d -- )	gforth  av_longlong
 2320: av_longlong(alist, d);
 2321: 
 2322: av-ptr	( c_addr -- )	gforth  av_ptr
 2323: av_ptr(alist, void*, c_addr);
 2324: 
 2325: av-int-r  ( R:w -- )  gforth  av_int_r
 2326: av_int(alist, w);
 2327: 
 2328: av-float-r	( -- )	gforth  av_float_r
 2329: float r = *(Float*)lp;
 2330: lp += sizeof(Float);
 2331: av_float(alist, r);
 2332: 
 2333: av-double-r	( -- )	gforth  av_double_r
 2334: double r = *(Float*)lp;
 2335: lp += sizeof(Float);
 2336: av_double(alist, r);
 2337: 
 2338: av-longlong-r	( R:d -- )	gforth  av_longlong_r
 2339: av_longlong(alist, d);
 2340: 
 2341: av-ptr-r	( R:c_addr -- )	gforth  av_ptr_r
 2342: av_ptr(alist, void*, c_addr);
 2343: 
 2344: av-call-void	( -- )	gforth  av_call_void
 2345: SAVE_REGS
 2346: av_call(alist);
 2347: REST_REGS
 2348: 
 2349: av-call-int	( -- w )	gforth  av_call_int
 2350: SAVE_REGS
 2351: av_call(alist);
 2352: REST_REGS
 2353: w = irv;
 2354: 
 2355: av-call-float	( -- r )	gforth  av_call_float
 2356: SAVE_REGS
 2357: av_call(alist);
 2358: REST_REGS
 2359: r = frv;
 2360: 
 2361: av-call-double	( -- r )	gforth  av_call_double
 2362: SAVE_REGS
 2363: av_call(alist);
 2364: REST_REGS
 2365: r = drv;
 2366: 
 2367: av-call-longlong	( -- d )	gforth  av_call_longlong
 2368: SAVE_REGS
 2369: av_call(alist);
 2370: REST_REGS
 2371: d = llrv;
 2372: 
 2373: av-call-ptr	( -- c_addr )	gforth  av_call_ptr
 2374: SAVE_REGS
 2375: av_call(alist);
 2376: REST_REGS
 2377: c_addr = prv;
 2378: 
 2379: alloc-callback	( a_ip -- c_addr )	gforth	alloc_callback
 2380: c_addr = (char *)alloc_callback(engine_callback, (Xt *)a_ip);
 2381: 
 2382: va-start-void	( -- )	gforth	va_start_void
 2383: va_start_void(clist);
 2384: 
 2385: va-start-int	( -- )	gforth	va_start_int
 2386: va_start_int(clist);
 2387: 
 2388: va-start-longlong	( -- )	gforth	va_start_longlong
 2389: va_start_longlong(clist);
 2390: 
 2391: va-start-ptr	( -- )	gforth	va_start_ptr
 2392: va_start_ptr(clist, (char *));
 2393: 
 2394: va-start-float	( -- )	gforth	va_start_float
 2395: va_start_float(clist);
 2396: 
 2397: va-start-double	( -- )	gforth	va_start_double
 2398: va_start_double(clist);
 2399: 
 2400: va-arg-int	( -- w )	gforth	va_arg_int
 2401: w = va_arg_int(clist);
 2402: 
 2403: va-arg-longlong	( -- d )	gforth	va_arg_longlong
 2404: d = va_arg_longlong(clist);
 2405: 
 2406: va-arg-ptr	( -- c_addr )	gforth	va_arg_ptr
 2407: c_addr = (char *)va_arg_ptr(clist,char*);
 2408: 
 2409: va-arg-float	( -- r )	gforth	va_arg_float
 2410: r = va_arg_float(clist);
 2411: 
 2412: va-arg-double	( -- r )	gforth	va_arg_double
 2413: r = va_arg_double(clist);
 2414: 
 2415: va-return-void ( -- )	gforth va_return_void
 2416: va_return_void(clist);
 2417: return 0;
 2418: 
 2419: va-return-int ( w -- )	gforth va_return_int
 2420: va_return_int(clist, w);
 2421: return 0;
 2422: 
 2423: va-return-ptr ( c_addr -- )	gforth va_return_ptr
 2424: va_return_ptr(clist, void *, c_addr);
 2425: return 0;
 2426: 
 2427: va-return-longlong ( d -- )	gforth va_return_longlong
 2428: va_return_longlong(clist, d);
 2429: return 0;
 2430: 
 2431: va-return-float ( r -- )	gforth va_return_float
 2432: va_return_float(clist, r);
 2433: return 0;
 2434: 
 2435: va-return-double ( r -- )	gforth va_return_double
 2436: va_return_double(clist, r);
 2437: return 0;
 2438: 
 2439: \+
 2440: 
 2441: \+OLDCALL
 2442: 
 2443: define(`uploop',
 2444:        `pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')')
 2445: define(`_uploop',
 2446:        `ifelse($1, `$3', `$5',
 2447: 	       `$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')')
 2448: \ argflist(argnum): Forth argument list
 2449: define(argflist,
 2450:        `ifelse($1, 0, `',
 2451:                `uploop(`_i', 1, $1, `format(`u%d ', _i)', `format(`u%d ', _i)')')')
 2452: \ argdlist(argnum): declare C's arguments
 2453: define(argdlist,
 2454:        `ifelse($1, 0, `',
 2455:                `uploop(`_i', 1, $1, `Cell, ', `Cell')')')
 2456: \ argclist(argnum): pass C's arguments
 2457: define(argclist,
 2458:        `ifelse($1, 0, `',
 2459:                `uploop(`_i', 1, $1, `format(`u%d, ', _i)', `format(`u%d', _i)')')')
 2460: \ icall(argnum)
 2461: define(icall,
 2462: `icall$1	( argflist($1)u -- uret )	gforth
 2463: uret = (SYSCALL(Cell(*)(argdlist($1)))u)(argclist($1));
 2464: 
 2465: ')
 2466: define(fcall,
 2467: `fcall$1	( argflist($1)u -- rret )	gforth
 2468: rret = (SYSCALL(Float(*)(argdlist($1)))u)(argclist($1));
 2469: 
 2470: ')
 2471: 
 2472: \ close ' to keep fontify happy
 2473: 
 2474: uploop(i, 0, 7, `icall(i)')
 2475: icall(20)
 2476: uploop(i, 0, 7, `fcall(i)')
 2477: fcall(20)
 2478: 
 2479: \+
 2480: \+
 2481: 
 2482: \g peephole
 2483: 
 2484: \+peephole
 2485: 
 2486: compile-prim1 ( a_prim -- ) gforth compile_prim1
 2487: ""compile prim (incl. immargs) at @var{a_prim}""
 2488: compile_prim1(a_prim);
 2489: 
 2490: finish-code ( -- ) gforth finish_code
 2491: ""Perform delayed steps in code generation (branch resolution, I-cache
 2492: flushing).""
 2493: finish_code();
 2494: 
 2495: forget-dyncode ( c_code -- f ) gforth-internal forget_dyncode
 2496: f = forget_dyncode(c_code);
 2497: 
 2498: decompile-prim ( a_code -- a_prim ) gforth-internal decompile_prim
 2499: ""a_prim is the code address of the primitive that has been
 2500: compile_prim1ed to a_code""
 2501: a_prim = (Cell *)decompile_code((Label)a_code);
 2502: 
 2503: \ set-next-code and call2 do not appear in images and can be
 2504: \ renumbered arbitrarily
 2505: 
 2506: set-next-code ( #w -- ) gforth set_next_code
 2507: #ifdef NO_IP
 2508: next_code = (Label)w;
 2509: #endif
 2510: 
 2511: call2 ( #a_callee #a_ret_addr -- R:a_ret_addr ) gforth
 2512: /* call with explicit return address */
 2513: #ifdef NO_IP
 2514: INST_TAIL;
 2515: JUMP(a_callee);
 2516: #else
 2517: assert(0);
 2518: #endif
 2519: 
 2520: tag-offsets ( -- a_addr ) gforth tag_offsets
 2521: extern Cell groups[32];
 2522: a_addr = groups;
 2523: 
 2524: \+
 2525: 
 2526: \g static_super
 2527: 
 2528: \C #if !defined(GFORTH_DEBUGGING) && !defined(INDIRECT_THREADED) && !defined(DOUBLY_INDIRECT) && !defined(VM_PROFILING)
 2529: 
 2530: include(peeprules.vmg)
 2531: 
 2532: \C #endif
 2533: 
 2534: \g end

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