File:  [gforth] / gforth / prim
Revision 1.148: download - view: text, annotated - select for diffs
Thu Nov 6 09:47:49 2003 UTC (15 years, 11 months ago) by anton
Branches: MAIN
CVS tags: HEAD
activated gforth-native again
some gforth-native bugfixes and changes

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

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