File:  [gforth] / gforth / prim
Revision 1.172: download - view: text, annotated - select for diffs
Thu Jul 28 19:15:00 2005 UTC (14 years, 1 month ago) by anton
Branches: MAIN
CVS tags: HEAD
fixed a few bugs in "..." handling in prims2x.fs
changed direct uses of sp and fp in prim to use "..."

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

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