Annotation of gforth/prim, revision 1.114

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

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