Annotation of gforth/prim, revision 1.95

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

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