File:  [gforth] / gforth / prim
Revision 1.240: download - view: text, annotated - select for diffs
Mon Apr 20 19:11:11 2009 UTC (10 years, 5 months ago) by pazsan
Branches: MAIN
CVS tags: HEAD
Added workaround for Mac OS X broken ecvt

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

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