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