File:  [gforth] / gforth / prim
Revision 1.199: download - view: text, annotated - select for diffs
Sun Oct 22 20:45:34 2006 UTC (12 years, 11 months ago) by anton
Branches: MAIN
CVS tags: HEAD
fixes to make the division checking work with dblsub.c

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

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