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