File:  [gforth] / gforth / prim
Revision 1.159: download - view: text, annotated - select for diffs
Sun Jan 23 22:09:29 2005 UTC (14 years, 9 months ago) by anton
Branches: MAIN
CVS tags: HEAD
back to single-dispatch conditional branches (better with PR 15242 workaround)

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

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