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