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