File:  [gforth] / gforth / prim
Revision 1.155: download - view: text, annotated - select for diffs
Fri Aug 27 15:53:50 2004 UTC (14 years, 10 months ago) by anton
Branches: MAIN
CVS tags: HEAD
added and documented usage of $GFORTHSYSTEMPREFIX to SYSTEM
eliminated the now-unused (does>1)

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

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