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