Annotation of gforth/prim, revision 1.50

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

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