File:
[gforth] /
gforth /
prim
Revision
1.201:
download - view:
text,
annotated -
select for diffs
Mon Oct 30 15:29:48 2006 UTC (17 years, 4 months ago) by
anton
Branches:
MAIN
CVS tags:
HEAD
new double-by-single division code
rewrote double-by-single-division code to work with long longs
started using the double-by-single-division code instead of C long long division (fm/mod)
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_SW && n2 == 0)
813: throw(BALL_DIVZERO);
814: if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN)
815: throw(BALL_RESULTRANGE);
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_SW && n2 == 0)
824: throw(BALL_DIVZERO);
825: if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN)
826: throw(BALL_RESULTRANGE);
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_SW && n2 == 0)
835: throw(BALL_DIVZERO);
836: if (CHECK_DIVISION_SW && n2 == -1 && n1 == CELL_MIN)
837: throw(BALL_RESULTRANGE);
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: DCell d5 = d/n3;
859: n4 = d%n3;
860: if (CHECK_DIVISION_SW && n3 == 0)
861: throw(BALL_DIVZERO);
862: if (FLOORED_DIV && ((DHI(d)^n3)<0) && n4!=0) {
863: d5--;
864: n4+=n3;
865: }
866: n5 = d5;
867: if (CHECK_DIVISION && d5 != n5)
868: throw(BALL_RESULTRANGE);
869: #endif
870: :
871: >r m* r> fm/mod ;
872:
873: */ ( n1 n2 n3 -- n4 ) core star_slash
874: ""n4=(n1*n2)/n3, with the intermediate result being double.""
875: #ifdef BUGGY_LL_MUL
876: DCell d = mmul(n1,n2);
877: #else
878: DCell d = (DCell)n1 * (DCell)n2;
879: #endif
880: #ifdef BUGGY_LL_DIV
881: DCell r = fmdiv(d,n3);
882: n4=DLO(r);
883: #else
884: /* assumes that the processor uses either floored or symmetric division */
885: DCell d4 = d/n3;
886: if (CHECK_DIVISION_SW && n3 == 0)
887: throw(BALL_DIVZERO);
888: if (FLOORED_DIV && ((DHI(d)^n3)<0) && (d%n3)!=0)
889: d4--;
890: n4 = d4;
891: if (CHECK_DIVISION && d4 != n4)
892: throw(BALL_RESULTRANGE);
893: #endif
894: :
895: */mod nip ;
896:
897: 2* ( n1 -- n2 ) core two_star
898: ""Shift left by 1; also works on unsigned numbers""
899: n2 = 2*n1;
900: :
901: dup + ;
902:
903: 2/ ( n1 -- n2 ) core two_slash
904: ""Arithmetic shift right by 1. For signed numbers this is a floored
905: division by 2 (note that @code{/} not necessarily floors).""
906: n2 = n1>>1;
907: :
908: dup MINI and IF 1 ELSE 0 THEN
909: [ bits/char cell * 1- ] literal
910: 0 DO 2* swap dup 2* >r MINI and
911: IF 1 ELSE 0 THEN or r> swap
912: LOOP nip ;
913:
914: fm/mod ( d1 n1 -- n2 n3 ) core f_m_slash_mod
915: ""Floored division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}.""
916: #ifdef ASM_SM_SLASH_REM
917: #ifdef BUGGY_LL_DIV
918: ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3);
919: if (((DHI(d1)^n1)<0) && n2!=0) {
920: if (CHECK_DIVISION && n3 == CELL_MIN)
921: throw(BALL_RESULTRANGE);
922: n3--;
923: n2+=n1;
924: }
925: #else
926: ASM_SM_SLASH_REM4(d1, n1, n2, n3);
927: if (((DHI(d1)^n1)<0) && n2!=0) {
928: if (CHECK_DIVISION && n3 == CELL_MIN)
929: throw(BALL_RESULTRANGE);
930: n3--;
931: n2+=n1;
932: }
933: #endif
934: #else /* !defined(ASM_SM_SLASH_REM) */
935: DCell r = fmdiv(d1,n1);
936: n2=DHI(r);
937: n3=DLO(r);
938: #endif /* !defined(ADM_SM_SLASH_REM) */
939: :
940: dup >r dup 0< IF negate >r dnegate r> THEN
941: over 0< IF tuck + swap THEN
942: um/mod
943: r> 0< IF swap negate swap THEN ;
944:
945: sm/rem ( d1 n1 -- n2 n3 ) core s_m_slash_rem
946: ""Symmetric division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0.""
947: #ifdef BUGGY_LL_DIV
948: #ifdef ASM_SM_SLASH_REM
949: ASM_SM_SLASH_REM(d1.lo, d1.hi, n1, n2, n3);
950: #else /* !defined(ASM_SM_SLASH_REM) */
951: DCell r = smdiv(d1,n1);
952: n2=DHI(r);
953: n3=DLO(r);
954: #endif /* !defined(ASM_SM_SLASH_REM) */
955: #else
956: #ifdef ASM_SM_SLASH_REM4
957: ASM_SM_SLASH_REM4(d1, n1, n2, n3);
958: #else /* !defined(ASM_SM_SLASH_REM4) */
959: /* assumes that the processor uses either floored or symmetric division */
960: DCell d3 = d1/n1;
961: n2 = d1%n1;
962: if (CHECK_DIVISION_SW && n1 == 0)
963: throw(BALL_DIVZERO);
964: /* note that this 1%-3<0 is optimized by the compiler */
965: if (1%-3<0 && ((DHI(d1)^n1)<0) && n2!=0) {
966: d3++;
967: n2-=n1;
968: }
969: n3 = d3;
970: if (CHECK_DIVISION && d3 != n3)
971: throw(BALL_RESULTRANGE);
972: #endif /* !defined(ASM_SM_SLASH_REM4) */
973: #endif
974: :
975: over >r dup >r abs -rot
976: dabs rot um/mod
977: r> r@ xor 0< IF negate THEN
978: r> 0< IF swap negate swap THEN ;
979:
980: m* ( n1 n2 -- d ) core m_star
981: #ifdef BUGGY_LL_MUL
982: d = mmul(n1,n2);
983: #else
984: d = (DCell)n1 * (DCell)n2;
985: #endif
986: :
987: 2dup 0< and >r
988: 2dup swap 0< and >r
989: um* r> - r> - ;
990:
991: um* ( u1 u2 -- ud ) core u_m_star
992: /* use u* as alias */
993: #ifdef BUGGY_LL_MUL
994: ud = ummul(u1,u2);
995: #else
996: ud = (UDCell)u1 * (UDCell)u2;
997: #endif
998: :
999: 0 -rot dup [ 8 cells ] literal -
1000: DO
1001: dup 0< I' and d2*+ drop
1002: LOOP ;
1003: : d2*+ ( ud n -- ud+n c )
1004: over MINI
1005: and >r >r 2dup d+ swap r> + swap r> ;
1006:
1007: um/mod ( ud u1 -- u2 u3 ) core u_m_slash_mod
1008: ""ud=u3*u1+u2, u1>u2>=0""
1009: #ifdef BUGGY_LL_DIV
1010: #ifdef ASM_UM_SLASH_MOD
1011: ASM_UM_SLASH_MOD(ud.lo, ud.hi, u1, u2, u3);
1012: #else /* !defined(ASM_UM_SLASH_MOD) */
1013: UDCell r = umdiv(ud,u1);
1014: u2=DHI(r);
1015: u3=DLO(r);
1016: #endif /* !defined(ASM_UM_SLASH_MOD) */
1017: #else
1018: #ifdef ASM_UM_SLASH_MOD4
1019: ASM_UM_SLASH_MOD4(ud, u1, u2, u3);
1020: #else /* !defined(ASM_UM_SLASH_MOD4) */
1021: UDCell ud3 = ud/u1;
1022: u2 = ud%u1;
1023: if (CHECK_DIVISION_SW && u1 == 0)
1024: throw(BALL_DIVZERO);
1025: u3 = ud3;
1026: if (CHECK_DIVISION && ud3 != u3)
1027: throw(BALL_RESULTRANGE);
1028: #endif /* !defined(ASM_UM_SLASH_MOD4) */
1029: #endif
1030: :
1031: 0 swap [ 8 cells 1 + ] literal 0
1032: ?DO /modstep
1033: LOOP drop swap 1 rshift or swap ;
1034: : /modstep ( ud c R: u -- ud-?u c R: u )
1035: >r over r@ u< 0= or IF r@ - 1 ELSE 0 THEN d2*+ r> ;
1036: : d2*+ ( ud n -- ud+n c )
1037: over MINI
1038: and >r >r 2dup d+ swap r> + swap r> ;
1039:
1040: m+ ( d1 n -- d2 ) double m_plus
1041: #ifdef BUGGY_LL_ADD
1042: DLO_IS(d2, DLO(d1)+n);
1043: DHI_IS(d2, DHI(d1) - (n<0) + (DLO(d2)<DLO(d1)));
1044: #else
1045: d2 = d1+n;
1046: #endif
1047: :
1048: s>d d+ ;
1049:
1050: d+ ( d1 d2 -- d ) double d_plus
1051: #ifdef BUGGY_LL_ADD
1052: DLO_IS(d, DLO(d1) + DLO(d2));
1053: DHI_IS(d, DHI(d1) + DHI(d2) + (d.lo<DLO(d1)));
1054: #else
1055: d = d1+d2;
1056: #endif
1057: :
1058: rot + >r tuck + swap over u> r> swap - ;
1059:
1060: d- ( d1 d2 -- d ) double d_minus
1061: #ifdef BUGGY_LL_ADD
1062: DLO_IS(d, DLO(d1) - DLO(d2));
1063: DHI_IS(d, DHI(d1)-DHI(d2)-(DLO(d1)<DLO(d2)));
1064: #else
1065: d = d1-d2;
1066: #endif
1067: :
1068: dnegate d+ ;
1069:
1070: dnegate ( d1 -- d2 ) double d_negate
1071: /* use dminus as alias */
1072: #ifdef BUGGY_LL_ADD
1073: d2 = dnegate(d1);
1074: #else
1075: d2 = -d1;
1076: #endif
1077: :
1078: invert swap negate tuck 0= - ;
1079:
1080: d2* ( d1 -- d2 ) double d_two_star
1081: ""Shift left by 1; also works on unsigned numbers""
1082: #ifdef BUGGY_LL_SHIFT
1083: DLO_IS(d2, DLO(d1)<<1);
1084: DHI_IS(d2, (DHI(d1)<<1) | (DLO(d1)>>(CELL_BITS-1)));
1085: #else
1086: d2 = 2*d1;
1087: #endif
1088: :
1089: 2dup d+ ;
1090:
1091: d2/ ( d1 -- d2 ) double d_two_slash
1092: ""Arithmetic shift right by 1. For signed numbers this is a floored
1093: division by 2.""
1094: #ifdef BUGGY_LL_SHIFT
1095: DHI_IS(d2, DHI(d1)>>1);
1096: DLO_IS(d2, (DLO(d1)>>1) | (DHI(d1)<<(CELL_BITS-1)));
1097: #else
1098: d2 = d1>>1;
1099: #endif
1100: :
1101: dup 1 and >r 2/ swap 2/ [ 1 8 cells 1- lshift 1- ] Literal and
1102: r> IF [ 1 8 cells 1- lshift ] Literal + THEN swap ;
1103:
1104: and ( w1 w2 -- w ) core
1105: w = w1&w2;
1106:
1107: or ( w1 w2 -- w ) core
1108: w = w1|w2;
1109: :
1110: invert swap invert and invert ;
1111:
1112: xor ( w1 w2 -- w ) core x_or
1113: w = w1^w2;
1114:
1115: invert ( w1 -- w2 ) core
1116: w2 = ~w1;
1117: :
1118: MAXU xor ;
1119:
1120: rshift ( u1 n -- u2 ) core r_shift
1121: ""Logical shift right by @i{n} bits.""
1122: #ifdef BROKEN_SHIFT
1123: u2 = rshift(u1, n);
1124: #else
1125: u2 = u1 >> n;
1126: #endif
1127: :
1128: 0 ?DO 2/ MAXI and LOOP ;
1129:
1130: lshift ( u1 n -- u2 ) core l_shift
1131: #ifdef BROKEN_SHIFT
1132: u2 = lshift(u1, n);
1133: #else
1134: u2 = u1 << n;
1135: #endif
1136: :
1137: 0 ?DO 2* LOOP ;
1138:
1139: \g compare
1140:
1141: \ comparisons(prefix, args, prefix, arg1, arg2, wordsets...)
1142: define(comparisons,
1143: $1= ( $2 -- f ) $6 $3equals
1144: f = FLAG($4==$5);
1145: :
1146: [ char $1x char 0 = [IF]
1147: ] IF false ELSE true THEN [
1148: [ELSE]
1149: ] xor 0= [
1150: [THEN] ] ;
1151:
1152: $1<> ( $2 -- f ) $7 $3not_equals
1153: f = FLAG($4!=$5);
1154: :
1155: [ char $1x char 0 = [IF]
1156: ] IF true ELSE false THEN [
1157: [ELSE]
1158: ] xor 0<> [
1159: [THEN] ] ;
1160:
1161: $1< ( $2 -- f ) $8 $3less_than
1162: f = FLAG($4<$5);
1163: :
1164: [ char $1x char 0 = [IF]
1165: ] MINI and 0<> [
1166: [ELSE] char $1x char u = [IF]
1167: ] 2dup xor 0< IF nip ELSE - THEN 0< [
1168: [ELSE]
1169: ] MINI xor >r MINI xor r> u< [
1170: [THEN]
1171: [THEN] ] ;
1172:
1173: $1> ( $2 -- f ) $9 $3greater_than
1174: f = FLAG($4>$5);
1175: :
1176: [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
1177: $1< ;
1178:
1179: $1<= ( $2 -- f ) gforth $3less_or_equal
1180: f = FLAG($4<=$5);
1181: :
1182: $1> 0= ;
1183:
1184: $1>= ( $2 -- f ) gforth $3greater_or_equal
1185: f = FLAG($4>=$5);
1186: :
1187: [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
1188: $1<= ;
1189:
1190: )
1191:
1192: comparisons(0, n, zero_, n, 0, core, core-ext, core, core-ext)
1193: comparisons(, n1 n2, , n1, n2, core, core-ext, core, core)
1194: comparisons(u, u1 u2, u_, u1, u2, gforth, gforth, core, core-ext)
1195:
1196: \ dcomparisons(prefix, args, prefix, arg1, arg2, wordsets...)
1197: define(dcomparisons,
1198: $1= ( $2 -- f ) $6 $3equals
1199: #ifdef BUGGY_LL_CMP
1200: f = FLAG($4.lo==$5.lo && $4.hi==$5.hi);
1201: #else
1202: f = FLAG($4==$5);
1203: #endif
1204:
1205: $1<> ( $2 -- f ) $7 $3not_equals
1206: #ifdef BUGGY_LL_CMP
1207: f = FLAG($4.lo!=$5.lo || $4.hi!=$5.hi);
1208: #else
1209: f = FLAG($4!=$5);
1210: #endif
1211:
1212: $1< ( $2 -- f ) $8 $3less_than
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 ) $9 $3greater_than
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: $1<= ( $2 -- f ) gforth $3less_or_equal
1227: #ifdef BUGGY_LL_CMP
1228: f = FLAG($4.hi==$5.hi ? $4.lo<=$5.lo : $4.hi<=$5.hi);
1229: #else
1230: f = FLAG($4<=$5);
1231: #endif
1232:
1233: $1>= ( $2 -- f ) gforth $3greater_or_equal
1234: #ifdef BUGGY_LL_CMP
1235: f = FLAG($4.hi==$5.hi ? $4.lo>=$5.lo : $4.hi>=$5.hi);
1236: #else
1237: f = FLAG($4>=$5);
1238: #endif
1239:
1240: )
1241:
1242: \+dcomps
1243:
1244: dcomparisons(d, d1 d2, d_, d1, d2, double, gforth, double, gforth)
1245: dcomparisons(d0, d, d_zero_, d, DZERO, double, gforth, double, gforth)
1246: dcomparisons(du, ud1 ud2, d_u_, ud1, ud2, gforth, gforth, double-ext, gforth)
1247:
1248: \+
1249:
1250: within ( u1 u2 u3 -- f ) core-ext
1251: ""u2=<u1<u3 or: u3=<u2 and u1 is not in [u3,u2). This works for
1252: unsigned and signed numbers (but not a mixture). Another way to think
1253: about this word is to consider the numbers as a circle (wrapping
1254: around from @code{max-u} to 0 for unsigned, and from @code{max-n} to
1255: min-n for signed numbers); now consider the range from u2 towards
1256: increasing numbers up to and excluding u3 (giving an empty range if
1257: u2=u3); if u1 is in this range, @code{within} returns true.""
1258: f = FLAG(u1-u2 < u3-u2);
1259: :
1260: over - >r - r> u< ;
1261:
1262: \g stack
1263:
1264: useraddr ( #u -- a_addr ) new
1265: a_addr = (Cell *)(up+u);
1266:
1267: up! ( a_addr -- ) gforth up_store
1268: gforth_UP=up=(Address)a_addr;
1269: :
1270: up ! ;
1271: Variable UP
1272:
1273: sp@ ( S:... -- a_addr ) gforth sp_fetch
1274: a_addr = sp;
1275:
1276: sp! ( a_addr -- S:... ) gforth sp_store
1277: sp = a_addr;
1278:
1279: rp@ ( -- a_addr ) gforth rp_fetch
1280: a_addr = rp;
1281:
1282: rp! ( a_addr -- ) gforth rp_store
1283: rp = a_addr;
1284:
1285: \+floating
1286:
1287: fp@ ( f:... -- f_addr ) gforth fp_fetch
1288: f_addr = fp;
1289:
1290: fp! ( f_addr -- f:... ) gforth fp_store
1291: fp = f_addr;
1292:
1293: \+
1294:
1295: >r ( w -- R:w ) core to_r
1296: :
1297: (>r) ;
1298: : (>r) rp@ cell+ @ rp@ ! rp@ cell+ ! ;
1299:
1300: r> ( R:w -- w ) core r_from
1301: :
1302: rp@ cell+ @ rp@ @ rp@ cell+ ! (rdrop) rp@ ! ;
1303: Create (rdrop) ' ;s A,
1304:
1305: rdrop ( R:w -- ) gforth
1306: :
1307: r> r> drop >r ;
1308:
1309: 2>r ( d -- R:d ) core-ext two_to_r
1310: :
1311: swap r> swap >r swap >r >r ;
1312:
1313: 2r> ( R:d -- d ) core-ext two_r_from
1314: :
1315: r> r> swap r> swap >r swap ;
1316:
1317: 2r@ ( R:d -- R:d d ) core-ext two_r_fetch
1318: :
1319: i' j ;
1320:
1321: 2rdrop ( R:d -- ) gforth two_r_drop
1322: :
1323: r> r> drop r> drop >r ;
1324:
1325: over ( w1 w2 -- w1 w2 w1 ) core
1326: :
1327: sp@ cell+ @ ;
1328:
1329: drop ( w -- ) core
1330: :
1331: IF THEN ;
1332:
1333: swap ( w1 w2 -- w2 w1 ) core
1334: :
1335: >r (swap) ! r> (swap) @ ;
1336: Variable (swap)
1337:
1338: dup ( w -- w w ) core dupe
1339: :
1340: sp@ @ ;
1341:
1342: rot ( w1 w2 w3 -- w2 w3 w1 ) core rote
1343: :
1344: [ defined? (swap) [IF] ]
1345: (swap) ! (rot) ! >r (rot) @ (swap) @ r> ;
1346: Variable (rot)
1347: [ELSE] ]
1348: >r swap r> swap ;
1349: [THEN]
1350:
1351: -rot ( w1 w2 w3 -- w3 w1 w2 ) gforth not_rote
1352: :
1353: rot rot ;
1354:
1355: nip ( w1 w2 -- w2 ) core-ext
1356: :
1357: swap drop ;
1358:
1359: tuck ( w1 w2 -- w2 w1 w2 ) core-ext
1360: :
1361: swap over ;
1362:
1363: ?dup ( w -- S:... w ) core question_dupe
1364: ""Actually the stack effect is: @code{( w -- 0 | w w )}. It performs a
1365: @code{dup} if w is nonzero.""
1366: if (w!=0) {
1367: *--sp = w;
1368: }
1369: :
1370: dup IF dup THEN ;
1371:
1372: pick ( S:... u -- S:... w ) core-ext
1373: ""Actually the stack effect is @code{ x0 ... xu u -- x0 ... xu x0 }.""
1374: w = sp[u];
1375: :
1376: 1+ cells sp@ + @ ;
1377:
1378: 2drop ( w1 w2 -- ) core two_drop
1379: :
1380: drop drop ;
1381:
1382: 2dup ( w1 w2 -- w1 w2 w1 w2 ) core two_dupe
1383: :
1384: over over ;
1385:
1386: 2over ( w1 w2 w3 w4 -- w1 w2 w3 w4 w1 w2 ) core two_over
1387: :
1388: 3 pick 3 pick ;
1389:
1390: 2swap ( w1 w2 w3 w4 -- w3 w4 w1 w2 ) core two_swap
1391: :
1392: rot >r rot r> ;
1393:
1394: 2rot ( w1 w2 w3 w4 w5 w6 -- w3 w4 w5 w6 w1 w2 ) double-ext two_rote
1395: :
1396: >r >r 2swap r> r> 2swap ;
1397:
1398: 2nip ( w1 w2 w3 w4 -- w3 w4 ) gforth two_nip
1399: :
1400: 2swap 2drop ;
1401:
1402: 2tuck ( w1 w2 w3 w4 -- w3 w4 w1 w2 w3 w4 ) gforth two_tuck
1403: :
1404: 2swap 2over ;
1405:
1406: \ toggle is high-level: 0.11/0.42%
1407:
1408: \g memory
1409:
1410: @ ( a_addr -- w ) core fetch
1411: ""@i{w} is the cell stored at @i{a_addr}.""
1412: w = *a_addr;
1413:
1414: \ lit@ / lit_fetch = lit @
1415:
1416: lit@ ( #a_addr -- w ) new lit_fetch
1417: w = *a_addr;
1418:
1419: ! ( w a_addr -- ) core store
1420: ""Store @i{w} into the cell at @i{a-addr}.""
1421: *a_addr = w;
1422:
1423: +! ( n a_addr -- ) core plus_store
1424: ""Add @i{n} to the cell at @i{a-addr}.""
1425: *a_addr += n;
1426: :
1427: tuck @ + swap ! ;
1428:
1429: c@ ( c_addr -- c ) core c_fetch
1430: ""@i{c} is the char stored at @i{c_addr}.""
1431: c = *c_addr;
1432: :
1433: [ bigendian [IF] ]
1434: [ cell>bit 4 = [IF] ]
1435: dup [ 0 cell - ] Literal and @ swap 1 and
1436: IF $FF and ELSE 8>> THEN ;
1437: [ [ELSE] ]
1438: dup [ cell 1- ] literal and
1439: tuck - @ swap [ cell 1- ] literal xor
1440: 0 ?DO 8>> LOOP $FF and
1441: [ [THEN] ]
1442: [ [ELSE] ]
1443: [ cell>bit 4 = [IF] ]
1444: dup [ 0 cell - ] Literal and @ swap 1 and
1445: IF 8>> ELSE $FF and THEN
1446: [ [ELSE] ]
1447: dup [ cell 1- ] literal and
1448: tuck - @ swap
1449: 0 ?DO 8>> LOOP 255 and
1450: [ [THEN] ]
1451: [ [THEN] ]
1452: ;
1453: : 8>> 2/ 2/ 2/ 2/ 2/ 2/ 2/ 2/ ;
1454:
1455: c! ( c c_addr -- ) core c_store
1456: ""Store @i{c} into the char at @i{c-addr}.""
1457: *c_addr = c;
1458: :
1459: [ bigendian [IF] ]
1460: [ cell>bit 4 = [IF] ]
1461: tuck 1 and IF $FF and ELSE 8<< THEN >r
1462: dup -2 and @ over 1 and cells masks + @ and
1463: r> or swap -2 and ! ;
1464: Create masks $00FF , $FF00 ,
1465: [ELSE] ]
1466: dup [ cell 1- ] literal and dup
1467: [ cell 1- ] literal xor >r
1468: - dup @ $FF r@ 0 ?DO 8<< LOOP invert and
1469: rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
1470: [THEN]
1471: [ELSE] ]
1472: [ cell>bit 4 = [IF] ]
1473: tuck 1 and IF 8<< ELSE $FF and THEN >r
1474: dup -2 and @ over 1 and cells masks + @ and
1475: r> or swap -2 and ! ;
1476: Create masks $FF00 , $00FF ,
1477: [ELSE] ]
1478: dup [ cell 1- ] literal and dup >r
1479: - dup @ $FF r@ 0 ?DO 8<< LOOP invert and
1480: rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
1481: [THEN]
1482: [THEN]
1483: : 8<< 2* 2* 2* 2* 2* 2* 2* 2* ;
1484:
1485: 2! ( w1 w2 a_addr -- ) core two_store
1486: ""Store @i{w2} into the cell at @i{c-addr} and @i{w1} into the next cell.""
1487: a_addr[0] = w2;
1488: a_addr[1] = w1;
1489: :
1490: tuck ! cell+ ! ;
1491:
1492: 2@ ( a_addr -- w1 w2 ) core two_fetch
1493: ""@i{w2} is the content of the cell stored at @i{a-addr}, @i{w1} is
1494: the content of the next cell.""
1495: w2 = a_addr[0];
1496: w1 = a_addr[1];
1497: :
1498: dup cell+ @ swap @ ;
1499:
1500: cell+ ( a_addr1 -- a_addr2 ) core cell_plus
1501: ""@code{1 cells +}""
1502: a_addr2 = a_addr1+1;
1503: :
1504: cell + ;
1505:
1506: cells ( n1 -- n2 ) core
1507: "" @i{n2} is the number of address units of @i{n1} cells.""
1508: n2 = n1 * sizeof(Cell);
1509: :
1510: [ cell
1511: 2/ dup [IF] ] 2* [ [THEN]
1512: 2/ dup [IF] ] 2* [ [THEN]
1513: 2/ dup [IF] ] 2* [ [THEN]
1514: 2/ dup [IF] ] 2* [ [THEN]
1515: drop ] ;
1516:
1517: char+ ( c_addr1 -- c_addr2 ) core char_plus
1518: ""@code{1 chars +}.""
1519: c_addr2 = c_addr1 + 1;
1520: :
1521: 1+ ;
1522:
1523: (chars) ( n1 -- n2 ) gforth paren_chars
1524: n2 = n1 * sizeof(Char);
1525: :
1526: ;
1527:
1528: count ( c_addr1 -- c_addr2 u ) core
1529: ""@i{c-addr2} is the first character and @i{u} the length of the
1530: counted string at @i{c-addr1}.""
1531: u = *c_addr1;
1532: c_addr2 = c_addr1+1;
1533: :
1534: dup 1+ swap c@ ;
1535:
1536: \g compiler
1537:
1538: \+f83headerstring
1539:
1540: (f83find) ( c_addr u f83name1 -- f83name2 ) new paren_f83find
1541: for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next))
1542: if ((UCell)F83NAME_COUNT(f83name1)==u &&
1543: memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */)
1544: break;
1545: f83name2=f83name1;
1546: :
1547: BEGIN dup WHILE (find-samelen) dup WHILE
1548: >r 2dup r@ cell+ char+ capscomp 0=
1549: IF 2drop r> EXIT THEN
1550: r> @
1551: REPEAT THEN nip nip ;
1552: : (find-samelen) ( u f83name1 -- u f83name2/0 )
1553: BEGIN 2dup cell+ c@ $1F and <> WHILE @ dup 0= UNTIL THEN ;
1554: : capscomp ( c_addr1 u c_addr2 -- n )
1555: swap bounds
1556: ?DO dup c@ I c@ <>
1557: IF dup c@ toupper I c@ toupper =
1558: ELSE true THEN WHILE 1+ LOOP drop 0
1559: ELSE c@ toupper I c@ toupper - unloop THEN sgn ;
1560: : sgn ( n -- -1/0/1 )
1561: dup 0= IF EXIT THEN 0< 2* 1+ ;
1562:
1563: \-
1564:
1565: (listlfind) ( c_addr u longname1 -- longname2 ) new paren_listlfind
1566: longname2=listlfind(c_addr, u, longname1);
1567: :
1568: BEGIN dup WHILE (findl-samelen) dup WHILE
1569: >r 2dup r@ cell+ cell+ capscomp 0=
1570: IF 2drop r> EXIT THEN
1571: r> @
1572: REPEAT THEN nip nip ;
1573: : (findl-samelen) ( u longname1 -- u longname2/0 )
1574: BEGIN 2dup cell+ @ lcount-mask and <> WHILE @ dup 0= UNTIL THEN ;
1575: : capscomp ( c_addr1 u c_addr2 -- n )
1576: swap bounds
1577: ?DO dup c@ I c@ <>
1578: IF dup c@ toupper I c@ toupper =
1579: ELSE true THEN WHILE 1+ LOOP drop 0
1580: ELSE c@ toupper I c@ toupper - unloop THEN sgn ;
1581: : sgn ( n -- -1/0/1 )
1582: dup 0= IF EXIT THEN 0< 2* 1+ ;
1583:
1584: \+hash
1585:
1586: (hashlfind) ( c_addr u a_addr -- longname2 ) new paren_hashlfind
1587: longname2 = hashlfind(c_addr, u, a_addr);
1588: :
1589: BEGIN dup WHILE
1590: 2@ >r >r dup r@ cell+ @ lcount-mask and =
1591: IF 2dup r@ cell+ cell+ capscomp 0=
1592: IF 2drop r> rdrop EXIT THEN THEN
1593: rdrop r>
1594: REPEAT nip nip ;
1595:
1596: (tablelfind) ( c_addr u a_addr -- longname2 ) new paren_tablelfind
1597: ""A case-sensitive variant of @code{(hashfind)}""
1598: longname2 = tablelfind(c_addr, u, a_addr);
1599: :
1600: BEGIN dup WHILE
1601: 2@ >r >r dup r@ cell+ @ lcount-mask and =
1602: IF 2dup r@ cell+ cell+ -text 0=
1603: IF 2drop r> rdrop EXIT THEN THEN
1604: rdrop r>
1605: REPEAT nip nip ;
1606: : -text ( c_addr1 u c_addr2 -- n )
1607: swap bounds
1608: ?DO dup c@ I c@ = WHILE 1+ LOOP drop 0
1609: ELSE c@ I c@ - unloop THEN sgn ;
1610: : sgn ( n -- -1/0/1 )
1611: dup 0= IF EXIT THEN 0< 2* 1+ ;
1612:
1613: (hashkey1) ( c_addr u ubits -- ukey ) gforth paren_hashkey1
1614: ""ukey is the hash key for the string c_addr u fitting in ubits bits""
1615: ukey = hashkey1(c_addr, u, ubits);
1616: :
1617: dup rot-values + c@ over 1 swap lshift 1- >r
1618: tuck - 2swap r> 0 2swap bounds
1619: ?DO dup 4 pick lshift swap 3 pick rshift or
1620: I c@ toupper xor
1621: over and LOOP
1622: nip nip nip ;
1623: Create rot-values
1624: 5 c, 0 c, 1 c, 2 c, 3 c, 4 c, 5 c, 5 c, 5 c, 5 c,
1625: 3 c, 5 c, 5 c, 5 c, 5 c, 7 c, 5 c, 5 c, 5 c, 5 c,
1626: 7 c, 5 c, 5 c, 5 c, 5 c, 6 c, 5 c, 5 c, 5 c, 5 c,
1627: 7 c, 5 c, 5 c,
1628:
1629: \+
1630:
1631: \+
1632:
1633: (parse-white) ( c_addr1 u1 -- c_addr2 u2 ) gforth paren_parse_white
1634: struct Cellpair r=parse_white(c_addr1, u1);
1635: c_addr2 = (Char *)(r.n1);
1636: u2 = r.n2;
1637: :
1638: BEGIN dup WHILE over c@ bl <= WHILE 1 /string
1639: REPEAT THEN 2dup
1640: BEGIN dup WHILE over c@ bl > WHILE 1 /string
1641: REPEAT THEN nip - ;
1642:
1643: aligned ( c_addr -- a_addr ) core
1644: "" @i{a-addr} is the first aligned address greater than or equal to @i{c-addr}.""
1645: a_addr = (Cell *)((((Cell)c_addr)+(sizeof(Cell)-1))&(-sizeof(Cell)));
1646: :
1647: [ cell 1- ] Literal + [ -1 cells ] Literal and ;
1648:
1649: faligned ( c_addr -- f_addr ) float f_aligned
1650: "" @i{f-addr} is the first float-aligned address greater than or equal to @i{c-addr}.""
1651: f_addr = (Float *)((((Cell)c_addr)+(sizeof(Float)-1))&(-sizeof(Float)));
1652: :
1653: [ 1 floats 1- ] Literal + [ -1 floats ] Literal and ;
1654:
1655: \ threading stuff is currently only interesting if we have a compiler
1656: \fhas? standardthreading has? compiler and [IF]
1657: threading-method ( -- n ) gforth threading_method
1658: ""0 if the engine is direct threaded. Note that this may change during
1659: the lifetime of an image.""
1660: #if defined(DOUBLY_INDIRECT)
1661: n=2;
1662: #else
1663: # if defined(DIRECT_THREADED)
1664: n=0;
1665: # else
1666: n=1;
1667: # endif
1668: #endif
1669: :
1670: 1 ;
1671:
1672: \f[THEN]
1673:
1674: \g hostos
1675:
1676: key-file ( wfileid -- c ) gforth paren_key_file
1677: ""Read one character @i{c} from @i{wfileid}. This word disables
1678: buffering for @i{wfileid}. If you want to read characters from a
1679: terminal in non-canonical (raw) mode, you have to put the terminal in
1680: non-canonical mode yourself (using the C interface); the exception is
1681: @code{stdin}: Gforth automatically puts it into non-canonical mode.""
1682: #ifdef HAS_FILE
1683: fflush(stdout);
1684: c = key((FILE*)wfileid);
1685: #else
1686: c = key(stdin);
1687: #endif
1688:
1689: key?-file ( wfileid -- f ) gforth key_q_file
1690: ""@i{f} is true if at least one character can be read from @i{wfileid}
1691: without blocking. If you also want to use @code{read-file} or
1692: @code{read-line} on the file, you have to call @code{key?-file} or
1693: @code{key-file} first (these two words disable buffering).""
1694: #ifdef HAS_FILE
1695: fflush(stdout);
1696: f = key_query((FILE*)wfileid);
1697: #else
1698: f = key_query(stdin);
1699: #endif
1700:
1701: \+os
1702:
1703: stdin ( -- wfileid ) gforth
1704: ""The standard input file of the Gforth process.""
1705: wfileid = (Cell)stdin;
1706:
1707: stdout ( -- wfileid ) gforth
1708: ""The standard output file of the Gforth process.""
1709: wfileid = (Cell)stdout;
1710:
1711: stderr ( -- wfileid ) gforth
1712: ""The standard error output file of the Gforth process.""
1713: wfileid = (Cell)stderr;
1714:
1715: form ( -- urows ucols ) gforth
1716: ""The number of lines and columns in the terminal. These numbers may change
1717: with the window size.""
1718: /* we could block SIGWINCH here to get a consistent size, but I don't
1719: think this is necessary or always beneficial */
1720: urows=rows;
1721: ucols=cols;
1722:
1723: wcwidth ( u -- n ) gforth
1724: ""The number of fixed-width characters per unicode character u""
1725: n = wcwidth(u);
1726:
1727: flush-icache ( c_addr u -- ) gforth flush_icache
1728: ""Make sure that the instruction cache of the processor (if there is
1729: one) does not contain stale data at @i{c-addr} and @i{u} bytes
1730: afterwards. @code{END-CODE} performs a @code{flush-icache}
1731: automatically. Caveat: @code{flush-icache} might not work on your
1732: installation; this is usually the case if direct threading is not
1733: supported on your machine (take a look at your @file{machine.h}) and
1734: your machine has a separate instruction cache. In such cases,
1735: @code{flush-icache} does nothing instead of flushing the instruction
1736: cache.""
1737: FLUSH_ICACHE(c_addr,u);
1738:
1739: (bye) ( n -- ) gforth paren_bye
1740: SUPER_END;
1741: return (Label *)n;
1742:
1743: (system) ( c_addr u -- wretval wior ) gforth paren_system
1744: wretval = gforth_system(c_addr, u);
1745: wior = IOR(wretval==-1 || (wretval==127 && errno != 0));
1746:
1747: getenv ( c_addr1 u1 -- c_addr2 u2 ) gforth
1748: ""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2}
1749: is the host operating system's expansion of that environment variable. If the
1750: environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters
1751: in length.""
1752: /* close ' to keep fontify happy */
1753: c_addr2 = (Char *)getenv(cstr(c_addr1,u1,1));
1754: u2 = (c_addr2 == NULL ? 0 : strlen((char *)c_addr2));
1755:
1756: open-pipe ( c_addr u wfam -- wfileid wior ) gforth open_pipe
1757: wfileid=(Cell)popen(cstr(c_addr,u,1),pfileattr[wfam]); /* ~ expansion of 1st arg? */
1758: wior = IOR(wfileid==0); /* !! the man page says that errno is not set reliably */
1759:
1760: close-pipe ( wfileid -- wretval wior ) gforth close_pipe
1761: wretval = pclose((FILE *)wfileid);
1762: wior = IOR(wretval==-1);
1763:
1764: time&date ( -- nsec nmin nhour nday nmonth nyear ) facility-ext time_and_date
1765: ""Report the current time of day. Seconds, minutes and hours are numbered from 0.
1766: Months are numbered from 1.""
1767: #if 1
1768: time_t now;
1769: struct tm *ltime;
1770: time(&now);
1771: ltime=localtime(&now);
1772: #else
1773: struct timeval time1;
1774: struct timezone zone1;
1775: struct tm *ltime;
1776: gettimeofday(&time1,&zone1);
1777: /* !! Single Unix specification:
1778: If tzp is not a null pointer, the behaviour is unspecified. */
1779: ltime=localtime((time_t *)&time1.tv_sec);
1780: #endif
1781: nyear =ltime->tm_year+1900;
1782: nmonth=ltime->tm_mon+1;
1783: nday =ltime->tm_mday;
1784: nhour =ltime->tm_hour;
1785: nmin =ltime->tm_min;
1786: nsec =ltime->tm_sec;
1787:
1788: ms ( n -- ) facility-ext
1789: ""Wait at least @i{n} milli-second.""
1790: struct timeval timeout;
1791: timeout.tv_sec=n/1000;
1792: timeout.tv_usec=1000*(n%1000);
1793: (void)select(0,0,0,0,&timeout);
1794:
1795: allocate ( u -- a_addr wior ) memory
1796: ""Allocate @i{u} address units of contiguous data space. The initial
1797: contents of the data space is undefined. If the allocation is successful,
1798: @i{a-addr} is the start address of the allocated region and @i{wior}
1799: is 0. If the allocation fails, @i{a-addr} is undefined and @i{wior}
1800: is a non-zero I/O result code.""
1801: a_addr = (Cell *)malloc(u?u:1);
1802: wior = IOR(a_addr==NULL);
1803:
1804: free ( a_addr -- wior ) memory
1805: ""Return the region of data space starting at @i{a-addr} to the system.
1806: The region must originally have been obtained using @code{allocate} or
1807: @code{resize}. If the operational is successful, @i{wior} is 0.
1808: If the operation fails, @i{wior} is a non-zero I/O result code.""
1809: free(a_addr);
1810: wior = 0;
1811:
1812: resize ( a_addr1 u -- a_addr2 wior ) memory
1813: ""Change the size of the allocated area at @i{a-addr1} to @i{u}
1814: address units, possibly moving the contents to a different
1815: area. @i{a-addr2} is the address of the resulting area.
1816: If the operation is successful, @i{wior} is 0.
1817: If the operation fails, @i{wior} is a non-zero
1818: I/O result code. If @i{a-addr1} is 0, Gforth's (but not the Standard)
1819: @code{resize} @code{allocate}s @i{u} address units.""
1820: /* the following check is not necessary on most OSs, but it is needed
1821: on SunOS 4.1.2. */
1822: /* close ' to keep fontify happy */
1823: if (a_addr1==NULL)
1824: a_addr2 = (Cell *)malloc(u);
1825: else
1826: a_addr2 = (Cell *)realloc(a_addr1, u);
1827: wior = IOR(a_addr2==NULL); /* !! Define a return code */
1828:
1829: strerror ( n -- c_addr u ) gforth
1830: c_addr = (Char *)strerror(n);
1831: u = strlen((char *)c_addr);
1832:
1833: strsignal ( n -- c_addr u ) gforth
1834: c_addr = (Char *)strsignal(n);
1835: u = strlen((char *)c_addr);
1836:
1837: call-c ( ... w -- ... ) gforth call_c
1838: ""Call the C function pointed to by @i{w}. The C function has to
1839: access the stack itself. The stack pointers are exported in the global
1840: variables @code{SP} and @code{FP}.""
1841: /* This is a first attempt at support for calls to C. This may change in
1842: the future */
1843: gforth_FP=fp;
1844: gforth_SP=sp;
1845: ((void (*)())w)();
1846: sp=gforth_SP;
1847: fp=gforth_FP;
1848:
1849: \+
1850: \+file
1851:
1852: close-file ( wfileid -- wior ) file close_file
1853: wior = IOR(fclose((FILE *)wfileid)==EOF);
1854:
1855: open-file ( c_addr u wfam -- wfileid wior ) file open_file
1856: wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[wfam]);
1857: wior = IOR(wfileid == 0);
1858:
1859: create-file ( c_addr u wfam -- wfileid wior ) file create_file
1860: Cell fd;
1861: fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[wfam], 0666);
1862: if (fd != -1) {
1863: wfileid = (Cell)fdopen(fd, fileattr[wfam]);
1864: wior = IOR(wfileid == 0);
1865: } else {
1866: wfileid = 0;
1867: wior = IOR(1);
1868: }
1869:
1870: delete-file ( c_addr u -- wior ) file delete_file
1871: wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1);
1872:
1873: rename-file ( c_addr1 u1 c_addr2 u2 -- wior ) file-ext rename_file
1874: ""Rename file @i{c_addr1 u1} to new name @i{c_addr2 u2}""
1875: wior = rename_file(c_addr1, u1, c_addr2, u2);
1876:
1877: file-position ( wfileid -- ud wior ) file file_position
1878: /* !! use tell and lseek? */
1879: ud = OFF2UD(ftello((FILE *)wfileid));
1880: wior = IOR(UD2OFF(ud)==-1);
1881:
1882: reposition-file ( ud wfileid -- wior ) file reposition_file
1883: wior = IOR(fseeko((FILE *)wfileid, UD2OFF(ud), SEEK_SET)==-1);
1884:
1885: file-size ( wfileid -- ud wior ) file file_size
1886: struct stat buf;
1887: wior = IOR(fstat(fileno((FILE *)wfileid), &buf)==-1);
1888: ud = OFF2UD(buf.st_size);
1889:
1890: resize-file ( ud wfileid -- wior ) file resize_file
1891: wior = IOR(ftruncate(fileno((FILE *)wfileid), UD2OFF(ud))==-1);
1892:
1893: read-file ( c_addr u1 wfileid -- u2 wior ) file read_file
1894: /* !! fread does not guarantee enough */
1895: u2 = fread(c_addr, sizeof(Char), u1, (FILE *)wfileid);
1896: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
1897: /* !! is the value of ferror errno-compatible? */
1898: if (wior)
1899: clearerr((FILE *)wfileid);
1900:
1901: (read-line) ( c_addr u1 wfileid -- u2 flag u3 wior ) file paren_read_line
1902: struct Cellquad r = read_line(c_addr, u1, wfileid);
1903: u2 = r.n1;
1904: flag = r.n2;
1905: u3 = r.n3;
1906: wior = r.n4;
1907:
1908: \+
1909:
1910: write-file ( c_addr u1 wfileid -- wior ) file write_file
1911: /* !! fwrite does not guarantee enough */
1912: #ifdef HAS_FILE
1913: {
1914: UCell u2 = fwrite(c_addr, sizeof(Char), u1, (FILE *)wfileid);
1915: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
1916: if (wior)
1917: clearerr((FILE *)wfileid);
1918: }
1919: #else
1920: TYPE(c_addr, u1);
1921: #endif
1922:
1923: emit-file ( c wfileid -- wior ) gforth emit_file
1924: #ifdef HAS_FILE
1925: wior = FILEIO(putc(c, (FILE *)wfileid)==EOF);
1926: if (wior)
1927: clearerr((FILE *)wfileid);
1928: #else
1929: PUTC(c);
1930: #endif
1931:
1932: \+file
1933:
1934: flush-file ( wfileid -- wior ) file-ext flush_file
1935: wior = IOR(fflush((FILE *) wfileid)==EOF);
1936:
1937: file-status ( c_addr u -- wfam wior ) file-ext file_status
1938: struct Cellpair r = file_status(c_addr, u);
1939: wfam = r.n1;
1940: wior = r.n2;
1941:
1942: file-eof? ( wfileid -- flag ) gforth file_eof_query
1943: flag = FLAG(feof((FILE *) wfileid));
1944:
1945: open-dir ( c_addr u -- wdirid wior ) gforth open_dir
1946: ""Open the directory specified by @i{c-addr, u}
1947: and return @i{dir-id} for futher access to it.""
1948: wdirid = (Cell)opendir(tilde_cstr(c_addr, u, 1));
1949: wior = IOR(wdirid == 0);
1950:
1951: read-dir ( c_addr u1 wdirid -- u2 flag wior ) gforth read_dir
1952: ""Attempt to read the next entry from the directory specified
1953: by @i{dir-id} to the buffer of length @i{u1} at address @i{c-addr}.
1954: If the attempt fails because there is no more entries,
1955: @i{ior}=0, @i{flag}=0, @i{u2}=0, and the buffer is unmodified.
1956: If the attempt to read the next entry fails because of any other reason,
1957: return @i{ior}<>0.
1958: If the attempt succeeds, store file name to the buffer at @i{c-addr}
1959: and return @i{ior}=0, @i{flag}=true and @i{u2} equal to the size of the file name.
1960: If the length of the file name is greater than @i{u1},
1961: store first @i{u1} characters from file name into the buffer and
1962: indicate "name too long" with @i{ior}, @i{flag}=true, and @i{u2}=@i{u1}.""
1963: struct dirent * dent;
1964: dent = readdir((DIR *)wdirid);
1965: wior = 0;
1966: flag = -1;
1967: if(dent == NULL) {
1968: u2 = 0;
1969: flag = 0;
1970: } else {
1971: u2 = strlen((char *)dent->d_name);
1972: if(u2 > u1) {
1973: u2 = u1;
1974: wior = -512-ENAMETOOLONG;
1975: }
1976: memmove(c_addr, dent->d_name, u2);
1977: }
1978:
1979: close-dir ( wdirid -- wior ) gforth close_dir
1980: ""Close the directory specified by @i{dir-id}.""
1981: wior = IOR(closedir((DIR *)wdirid));
1982:
1983: filename-match ( c_addr1 u1 c_addr2 u2 -- flag ) gforth match_file
1984: char * string = cstr(c_addr1, u1, 1);
1985: char * pattern = cstr(c_addr2, u2, 0);
1986: flag = FLAG(!fnmatch(pattern, string, 0));
1987:
1988: set-dir ( c_addr u -- wior ) gforth set_dir
1989: ""Change the current directory to @i{c-addr, u}.
1990: Return an error if this is not possible""
1991: wior = IOR(chdir(tilde_cstr(c_addr, u, 1)));
1992:
1993: get-dir ( c_addr1 u1 -- c_addr2 u2 ) gforth get_dir
1994: ""Store the current directory in the buffer specified by @{c-addr1, u1}.
1995: If the buffer size is not sufficient, return 0 0""
1996: c_addr2 = (Char *)getcwd((char *)c_addr1, u1);
1997: if(c_addr2 != NULL) {
1998: u2 = strlen((char *)c_addr2);
1999: } else {
2000: u2 = 0;
2001: }
2002:
2003: \+
2004:
2005: newline ( -- c_addr u ) gforth
2006: ""String containing the newline sequence of the host OS""
2007: char newline[] = {
2008: #if DIRSEP=='/'
2009: /* Unix */
2010: '\n'
2011: #else
2012: /* DOS, Win, OS/2 */
2013: '\r','\n'
2014: #endif
2015: };
2016: c_addr=(Char *)newline;
2017: u=sizeof(newline);
2018: :
2019: "newline count ;
2020: Create "newline e? crlf [IF] 2 c, $0D c, [ELSE] 1 c, [THEN] $0A c,
2021:
2022: \+os
2023:
2024: utime ( -- dtime ) gforth
2025: ""Report the current time in microseconds since some epoch.""
2026: struct timeval time1;
2027: gettimeofday(&time1,NULL);
2028: dtime = timeval2us(&time1);
2029:
2030: cputime ( -- duser dsystem ) gforth
2031: ""duser and dsystem are the respective user- and system-level CPU
2032: times used since the start of the Forth system (excluding child
2033: processes), in microseconds (the granularity may be much larger,
2034: however). On platforms without the getrusage call, it reports elapsed
2035: time (since some epoch) for duser and 0 for dsystem.""
2036: #ifdef HAVE_GETRUSAGE
2037: struct rusage usage;
2038: getrusage(RUSAGE_SELF, &usage);
2039: duser = timeval2us(&usage.ru_utime);
2040: dsystem = timeval2us(&usage.ru_stime);
2041: #else
2042: struct timeval time1;
2043: gettimeofday(&time1,NULL);
2044: duser = timeval2us(&time1);
2045: dsystem = DZERO;
2046: #endif
2047:
2048: \+
2049:
2050: \+floating
2051:
2052: \g floating
2053:
2054: comparisons(f, r1 r2, f_, r1, r2, gforth, gforth, float, gforth)
2055: comparisons(f0, r, f_zero_, r, 0., float, gforth, float, gforth)
2056:
2057: s>f ( n -- r ) float s_to_f
2058: r = n;
2059:
2060: d>f ( d -- r ) float d_to_f
2061: #ifdef BUGGY_LL_D2F
2062: extern double ldexp(double x, int exp);
2063: if (DHI(d)<0) {
2064: #ifdef BUGGY_LL_ADD
2065: DCell d2=dnegate(d);
2066: #else
2067: DCell d2=-d;
2068: #endif
2069: r = -(ldexp((Float)DHI(d2),CELL_BITS) + (Float)DLO(d2));
2070: } else
2071: r = ldexp((Float)DHI(d),CELL_BITS) + (Float)DLO(d);
2072: #else
2073: r = d;
2074: #endif
2075:
2076: f>d ( r -- d ) float f_to_d
2077: extern DCell double2ll(Float r);
2078: d = double2ll(r);
2079:
2080: f>s ( r -- n ) float f_to_s
2081: n = (Cell)r;
2082:
2083: f! ( r f_addr -- ) float f_store
2084: ""Store @i{r} into the float at address @i{f-addr}.""
2085: *f_addr = r;
2086:
2087: f@ ( f_addr -- r ) float f_fetch
2088: ""@i{r} is the float at address @i{f-addr}.""
2089: r = *f_addr;
2090:
2091: df@ ( df_addr -- r ) float-ext d_f_fetch
2092: ""Fetch the double-precision IEEE floating-point value @i{r} from the address @i{df-addr}.""
2093: #ifdef IEEE_FP
2094: r = *df_addr;
2095: #else
2096: !! df@
2097: #endif
2098:
2099: df! ( r df_addr -- ) float-ext d_f_store
2100: ""Store @i{r} as double-precision IEEE floating-point value to the
2101: address @i{df-addr}.""
2102: #ifdef IEEE_FP
2103: *df_addr = r;
2104: #else
2105: !! df!
2106: #endif
2107:
2108: sf@ ( sf_addr -- r ) float-ext s_f_fetch
2109: ""Fetch the single-precision IEEE floating-point value @i{r} from the address @i{sf-addr}.""
2110: #ifdef IEEE_FP
2111: r = *sf_addr;
2112: #else
2113: !! sf@
2114: #endif
2115:
2116: sf! ( r sf_addr -- ) float-ext s_f_store
2117: ""Store @i{r} as single-precision IEEE floating-point value to the
2118: address @i{sf-addr}.""
2119: #ifdef IEEE_FP
2120: *sf_addr = r;
2121: #else
2122: !! sf!
2123: #endif
2124:
2125: f+ ( r1 r2 -- r3 ) float f_plus
2126: r3 = r1+r2;
2127:
2128: f- ( r1 r2 -- r3 ) float f_minus
2129: r3 = r1-r2;
2130:
2131: f* ( r1 r2 -- r3 ) float f_star
2132: r3 = r1*r2;
2133:
2134: f/ ( r1 r2 -- r3 ) float f_slash
2135: r3 = r1/r2;
2136:
2137: f** ( r1 r2 -- r3 ) float-ext f_star_star
2138: ""@i{r3} is @i{r1} raised to the @i{r2}th power.""
2139: r3 = pow(r1,r2);
2140:
2141: fm* ( r1 n -- r2 ) gforth fm_star
2142: r2 = r1*n;
2143:
2144: fm/ ( r1 n -- r2 ) gforth fm_slash
2145: r2 = r1/n;
2146:
2147: fm*/ ( r1 n1 n2 -- r2 ) gforth fm_star_slash
2148: r2 = (r1*n1)/n2;
2149:
2150: f**2 ( r1 -- r2 ) gforth fm_square
2151: r2 = r1*r1;
2152:
2153: fnegate ( r1 -- r2 ) float f_negate
2154: r2 = - r1;
2155:
2156: fdrop ( r -- ) float f_drop
2157:
2158: fdup ( r -- r r ) float f_dupe
2159:
2160: fswap ( r1 r2 -- r2 r1 ) float f_swap
2161:
2162: fover ( r1 r2 -- r1 r2 r1 ) float f_over
2163:
2164: frot ( r1 r2 r3 -- r2 r3 r1 ) float f_rote
2165:
2166: fnip ( r1 r2 -- r2 ) gforth f_nip
2167:
2168: ftuck ( r1 r2 -- r2 r1 r2 ) gforth f_tuck
2169:
2170: float+ ( f_addr1 -- f_addr2 ) float float_plus
2171: ""@code{1 floats +}.""
2172: f_addr2 = f_addr1+1;
2173:
2174: floats ( n1 -- n2 ) float
2175: ""@i{n2} is the number of address units of @i{n1} floats.""
2176: n2 = n1*sizeof(Float);
2177:
2178: floor ( r1 -- r2 ) float
2179: ""Round towards the next smaller integral value, i.e., round toward negative infinity.""
2180: /* !! unclear wording */
2181: r2 = floor(r1);
2182:
2183: fround ( r1 -- r2 ) gforth f_round
2184: ""Round to the nearest integral value.""
2185: r2 = rint(r1);
2186:
2187: fmax ( r1 r2 -- r3 ) float f_max
2188: if (r1<r2)
2189: r3 = r2;
2190: else
2191: r3 = r1;
2192:
2193: fmin ( r1 r2 -- r3 ) float f_min
2194: if (r1<r2)
2195: r3 = r1;
2196: else
2197: r3 = r2;
2198:
2199: represent ( r c_addr u -- n f1 f2 ) float
2200: char *sig;
2201: size_t siglen;
2202: int flag;
2203: int decpt;
2204: sig=ecvt(r, u, &decpt, &flag);
2205: n=(r==0. ? 1 : decpt);
2206: f1=FLAG(flag!=0);
2207: f2=FLAG(isdigit((unsigned)(sig[0]))!=0);
2208: siglen=strlen((char *)sig);
2209: if (siglen>u) /* happens in glibc-2.1.3 if 999.. is rounded up */
2210: siglen=u;
2211: if (!f2) /* workaround Cygwin trailing 0s for Inf and Nan */
2212: for (; sig[siglen-1]=='0'; siglen--);
2213: ;
2214: memcpy(c_addr,sig,siglen);
2215: memset(c_addr+siglen,f2?'0':' ',u-siglen);
2216:
2217: >float ( c_addr u -- f:... flag ) float to_float
2218: ""Actual stack effect: ( c_addr u -- r t | f ). Attempt to convert the
2219: character string @i{c-addr u} to internal floating-point
2220: representation. If the string represents a valid floating-point number
2221: @i{r} is placed on the floating-point stack and @i{flag} is
2222: true. Otherwise, @i{flag} is false. A string of blanks is a special
2223: case and represents the floating-point number 0.""
2224: Float r;
2225: flag = to_float(c_addr, u, &r);
2226: if (flag) {
2227: fp--;
2228: fp[0]=r;
2229: }
2230:
2231: fabs ( r1 -- r2 ) float-ext f_abs
2232: r2 = fabs(r1);
2233:
2234: facos ( r1 -- r2 ) float-ext f_a_cos
2235: r2 = acos(r1);
2236:
2237: fasin ( r1 -- r2 ) float-ext f_a_sine
2238: r2 = asin(r1);
2239:
2240: fatan ( r1 -- r2 ) float-ext f_a_tan
2241: r2 = atan(r1);
2242:
2243: fatan2 ( r1 r2 -- r3 ) float-ext f_a_tan_two
2244: ""@i{r1/r2}=tan(@i{r3}). ANS Forth does not require, but probably
2245: intends this to be the inverse of @code{fsincos}. In gforth it is.""
2246: r3 = atan2(r1,r2);
2247:
2248: fcos ( r1 -- r2 ) float-ext f_cos
2249: r2 = cos(r1);
2250:
2251: fexp ( r1 -- r2 ) float-ext f_e_x_p
2252: r2 = exp(r1);
2253:
2254: fexpm1 ( r1 -- r2 ) float-ext f_e_x_p_m_one
2255: ""@i{r2}=@i{e}**@i{r1}@minus{}1""
2256: #ifdef HAVE_EXPM1
2257: extern double
2258: #ifdef NeXT
2259: const
2260: #endif
2261: expm1(double);
2262: r2 = expm1(r1);
2263: #else
2264: r2 = exp(r1)-1.;
2265: #endif
2266:
2267: fln ( r1 -- r2 ) float-ext f_l_n
2268: r2 = log(r1);
2269:
2270: flnp1 ( r1 -- r2 ) float-ext f_l_n_p_one
2271: ""@i{r2}=ln(@i{r1}+1)""
2272: #ifdef HAVE_LOG1P
2273: extern double
2274: #ifdef NeXT
2275: const
2276: #endif
2277: log1p(double);
2278: r2 = log1p(r1);
2279: #else
2280: r2 = log(r1+1.);
2281: #endif
2282:
2283: flog ( r1 -- r2 ) float-ext f_log
2284: ""The decimal logarithm.""
2285: r2 = log10(r1);
2286:
2287: falog ( r1 -- r2 ) float-ext f_a_log
2288: ""@i{r2}=10**@i{r1}""
2289: extern double pow10(double);
2290: r2 = pow10(r1);
2291:
2292: fsin ( r1 -- r2 ) float-ext f_sine
2293: r2 = sin(r1);
2294:
2295: fsincos ( r1 -- r2 r3 ) float-ext f_sine_cos
2296: ""@i{r2}=sin(@i{r1}), @i{r3}=cos(@i{r1})""
2297: r2 = sin(r1);
2298: r3 = cos(r1);
2299:
2300: fsqrt ( r1 -- r2 ) float-ext f_square_root
2301: r2 = sqrt(r1);
2302:
2303: ftan ( r1 -- r2 ) float-ext f_tan
2304: r2 = tan(r1);
2305: :
2306: fsincos f/ ;
2307:
2308: fsinh ( r1 -- r2 ) float-ext f_cinch
2309: r2 = sinh(r1);
2310: :
2311: fexpm1 fdup fdup 1. d>f f+ f/ f+ f2/ ;
2312:
2313: fcosh ( r1 -- r2 ) float-ext f_cosh
2314: r2 = cosh(r1);
2315: :
2316: fexp fdup 1/f f+ f2/ ;
2317:
2318: ftanh ( r1 -- r2 ) float-ext f_tan_h
2319: r2 = tanh(r1);
2320: :
2321: f2* fexpm1 fdup 2. d>f f+ f/ ;
2322:
2323: fasinh ( r1 -- r2 ) float-ext f_a_cinch
2324: r2 = asinh(r1);
2325: :
2326: fdup fdup f* 1. d>f f+ fsqrt f/ fatanh ;
2327:
2328: facosh ( r1 -- r2 ) float-ext f_a_cosh
2329: r2 = acosh(r1);
2330: :
2331: fdup fdup f* 1. d>f f- fsqrt f+ fln ;
2332:
2333: fatanh ( r1 -- r2 ) float-ext f_a_tan_h
2334: r2 = atanh(r1);
2335: :
2336: fdup f0< >r fabs 1. d>f fover f- f/ f2* flnp1 f2/
2337: r> IF fnegate THEN ;
2338:
2339: sfloats ( n1 -- n2 ) float-ext s_floats
2340: ""@i{n2} is the number of address units of @i{n1}
2341: single-precision IEEE floating-point numbers.""
2342: n2 = n1*sizeof(SFloat);
2343:
2344: dfloats ( n1 -- n2 ) float-ext d_floats
2345: ""@i{n2} is the number of address units of @i{n1}
2346: double-precision IEEE floating-point numbers.""
2347: n2 = n1*sizeof(DFloat);
2348:
2349: sfaligned ( c_addr -- sf_addr ) float-ext s_f_aligned
2350: ""@i{sf-addr} is the first single-float-aligned address greater
2351: than or equal to @i{c-addr}.""
2352: sf_addr = (SFloat *)((((Cell)c_addr)+(sizeof(SFloat)-1))&(-sizeof(SFloat)));
2353: :
2354: [ 1 sfloats 1- ] Literal + [ -1 sfloats ] Literal and ;
2355:
2356: dfaligned ( c_addr -- df_addr ) float-ext d_f_aligned
2357: ""@i{df-addr} is the first double-float-aligned address greater
2358: than or equal to @i{c-addr}.""
2359: df_addr = (DFloat *)((((Cell)c_addr)+(sizeof(DFloat)-1))&(-sizeof(DFloat)));
2360: :
2361: [ 1 dfloats 1- ] Literal + [ -1 dfloats ] Literal and ;
2362:
2363: v* ( f_addr1 nstride1 f_addr2 nstride2 ucount -- r ) gforth v_star
2364: ""dot-product: r=v1*v2. The first element of v1 is at f_addr1, the
2365: next at f_addr1+nstride1 and so on (similar for v2). Both vectors have
2366: ucount elements.""
2367: r = v_star(f_addr1, nstride1, f_addr2, nstride2, ucount);
2368: :
2369: >r swap 2swap swap 0e r> 0 ?DO
2370: dup f@ over + 2swap dup f@ f* f+ over + 2swap
2371: LOOP 2drop 2drop ;
2372:
2373: faxpy ( ra f_x nstridex f_y nstridey ucount -- ) gforth
2374: ""vy=ra*vx+vy""
2375: faxpy(ra, f_x, nstridex, f_y, nstridey, ucount);
2376: :
2377: >r swap 2swap swap r> 0 ?DO
2378: fdup dup f@ f* over + 2swap dup f@ f+ dup f! over + 2swap
2379: LOOP 2drop 2drop fdrop ;
2380:
2381: \+
2382:
2383: \ The following words access machine/OS/installation-dependent
2384: \ Gforth internals
2385: \ !! how about environmental queries DIRECT-THREADED,
2386: \ INDIRECT-THREADED, TOS-CACHED, FTOS-CACHED, CODEFIELD-DOES */
2387:
2388: \ local variable implementation primitives
2389:
2390: \+glocals
2391:
2392: \g locals
2393:
2394: @local# ( #noffset -- w ) gforth fetch_local_number
2395: w = *(Cell *)(lp+noffset);
2396:
2397: @local0 ( -- w ) new fetch_local_zero
2398: w = ((Cell *)lp)[0];
2399:
2400: @local1 ( -- w ) new fetch_local_four
2401: w = ((Cell *)lp)[1];
2402:
2403: @local2 ( -- w ) new fetch_local_eight
2404: w = ((Cell *)lp)[2];
2405:
2406: @local3 ( -- w ) new fetch_local_twelve
2407: w = ((Cell *)lp)[3];
2408:
2409: \+floating
2410:
2411: f@local# ( #noffset -- r ) gforth f_fetch_local_number
2412: r = *(Float *)(lp+noffset);
2413:
2414: f@local0 ( -- r ) new f_fetch_local_zero
2415: r = ((Float *)lp)[0];
2416:
2417: f@local1 ( -- r ) new f_fetch_local_eight
2418: r = ((Float *)lp)[1];
2419:
2420: \+
2421:
2422: laddr# ( #noffset -- c_addr ) gforth laddr_number
2423: /* this can also be used to implement lp@ */
2424: c_addr = (Char *)(lp+noffset);
2425:
2426: lp+!# ( #noffset -- ) gforth lp_plus_store_number
2427: ""used with negative immediate values it allocates memory on the
2428: local stack, a positive immediate argument drops memory from the local
2429: stack""
2430: lp += noffset;
2431:
2432: lp- ( -- ) new minus_four_lp_plus_store
2433: lp += -sizeof(Cell);
2434:
2435: lp+ ( -- ) new eight_lp_plus_store
2436: lp += sizeof(Float);
2437:
2438: lp+2 ( -- ) new sixteen_lp_plus_store
2439: lp += 2*sizeof(Float);
2440:
2441: lp! ( c_addr -- ) gforth lp_store
2442: lp = (Address)c_addr;
2443:
2444: >l ( w -- ) gforth to_l
2445: lp -= sizeof(Cell);
2446: *(Cell *)lp = w;
2447:
2448: \+floating
2449:
2450: f>l ( r -- ) gforth f_to_l
2451: lp -= sizeof(Float);
2452: *(Float *)lp = r;
2453:
2454: fpick ( f:... u -- f:... r ) gforth
2455: ""Actually the stack effect is @code{ r0 ... ru u -- r0 ... ru r0 }.""
2456: r = fp[u];
2457: :
2458: floats fp@ + f@ ;
2459:
2460: \+
2461: \+
2462:
2463: \+OS
2464:
2465: \g syslib
2466:
2467: open-lib ( c_addr1 u1 -- u2 ) gforth open_lib
2468: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
2469: #ifndef RTLD_GLOBAL
2470: #define RTLD_GLOBAL 0
2471: #endif
2472: u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY);
2473: #else
2474: # ifdef _WIN32
2475: u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1));
2476: # else
2477: #warning Define open-lib!
2478: u2 = 0;
2479: # endif
2480: #endif
2481:
2482: lib-sym ( c_addr1 u1 u2 -- u3 ) gforth lib_sym
2483: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
2484: u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1));
2485: #else
2486: # ifdef _WIN32
2487: u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1));
2488: # else
2489: #warning Define lib-sym!
2490: u3 = 0;
2491: # endif
2492: #endif
2493:
2494: wcall ( ... u -- ... ) gforth
2495: gforth_FP=fp;
2496: sp=(Cell*)(SYSCALL(Cell*(*)(Cell *, void *))u)(sp, &gforth_FP);
2497: fp=gforth_FP;
2498:
2499: uw@ ( c_addr -- u ) gforth u_w_fetch
2500: ""@i{u} is the zero-extended 16-bit value stored at @i{c_addr}.""
2501: u = *(UWyde*)(c_addr);
2502:
2503: sw@ ( c_addr -- n ) gforth s_w_fetch
2504: ""@i{n} is the sign-extended 16-bit value stored at @i{c_addr}.""
2505: n = *(Wyde*)(c_addr);
2506:
2507: w! ( w c_addr -- ) gforth w_store
2508: ""Store the bottom 16 bits of @i{w} at @i{c_addr}.""
2509: *(Wyde*)(c_addr) = w;
2510:
2511: ul@ ( c_addr -- u ) gforth u_l_fetch
2512: ""@i{u} is the zero-extended 32-bit value stored at @i{c_addr}.""
2513: u = *(UTetrabyte*)(c_addr);
2514:
2515: sl@ ( c_addr -- n ) gforth s_l_fetch
2516: ""@i{n} is the sign-extended 32-bit value stored at @i{c_addr}.""
2517: n = *(Tetrabyte*)(c_addr);
2518:
2519: l! ( w c_addr -- ) gforth l_store
2520: ""Store the bottom 32 bits of @i{w} at @i{c_addr}.""
2521: *(Tetrabyte*)(c_addr) = w;
2522:
2523: \+FFCALL
2524:
2525: av-start-void ( c_addr -- ) gforth av_start_void
2526: av_start_void(alist, c_addr);
2527:
2528: av-start-int ( c_addr -- ) gforth av_start_int
2529: av_start_int(alist, c_addr, &irv);
2530:
2531: av-start-float ( c_addr -- ) gforth av_start_float
2532: av_start_float(alist, c_addr, &frv);
2533:
2534: av-start-double ( c_addr -- ) gforth av_start_double
2535: av_start_double(alist, c_addr, &drv);
2536:
2537: av-start-longlong ( c_addr -- ) gforth av_start_longlong
2538: av_start_longlong(alist, c_addr, &llrv);
2539:
2540: av-start-ptr ( c_addr -- ) gforth av_start_ptr
2541: av_start_ptr(alist, c_addr, void*, &prv);
2542:
2543: av-int ( w -- ) gforth av_int
2544: av_int(alist, w);
2545:
2546: av-float ( r -- ) gforth av_float
2547: av_float(alist, r);
2548:
2549: av-double ( r -- ) gforth av_double
2550: av_double(alist, r);
2551:
2552: av-longlong ( d -- ) gforth av_longlong
2553: #ifdef BUGGY_LL_SIZE
2554: av_longlong(alist, DLO(d));
2555: #else
2556: av_longlong(alist, d);
2557: #endif
2558:
2559: av-ptr ( c_addr -- ) gforth av_ptr
2560: av_ptr(alist, void*, c_addr);
2561:
2562: av-int-r ( R:w -- ) gforth av_int_r
2563: av_int(alist, w);
2564:
2565: av-float-r ( -- ) gforth av_float_r
2566: float r = *(Float*)lp;
2567: lp += sizeof(Float);
2568: av_float(alist, r);
2569:
2570: av-double-r ( -- ) gforth av_double_r
2571: double r = *(Float*)lp;
2572: lp += sizeof(Float);
2573: av_double(alist, r);
2574:
2575: av-longlong-r ( R:d -- ) gforth av_longlong_r
2576: #ifdef BUGGY_LL_SIZE
2577: av_longlong(alist, DLO(d));
2578: #else
2579: av_longlong(alist, d);
2580: #endif
2581:
2582: av-ptr-r ( R:c_addr -- ) gforth av_ptr_r
2583: av_ptr(alist, void*, c_addr);
2584:
2585: av-call-void ( ... -- ... ) gforth av_call_void
2586: SAVE_REGS
2587: av_call(alist);
2588: REST_REGS
2589:
2590: av-call-int ( ... -- ... w ) gforth av_call_int
2591: SAVE_REGS
2592: av_call(alist);
2593: REST_REGS
2594: w = irv;
2595:
2596: av-call-float ( ... -- ... r ) gforth av_call_float
2597: SAVE_REGS
2598: av_call(alist);
2599: REST_REGS
2600: r = frv;
2601:
2602: av-call-double ( ... -- ... r ) gforth av_call_double
2603: SAVE_REGS
2604: av_call(alist);
2605: REST_REGS
2606: r = drv;
2607:
2608: av-call-longlong ( ... -- ... d ) gforth av_call_longlong
2609: SAVE_REGS
2610: av_call(alist);
2611: REST_REGS
2612: #ifdef BUGGY_LONG_LONG
2613: DLO_IS(d, llrv);
2614: DHI_IS(d, 0);
2615: #else
2616: d = llrv;
2617: #endif
2618:
2619: av-call-ptr ( ... -- ... c_addr ) gforth av_call_ptr
2620: SAVE_REGS
2621: av_call(alist);
2622: REST_REGS
2623: c_addr = prv;
2624:
2625: alloc-callback ( a_ip -- c_addr ) gforth alloc_callback
2626: c_addr = (char *)alloc_callback(gforth_callback, (Xt *)a_ip);
2627:
2628: va-start-void ( -- ) gforth va_start_void
2629: va_start_void(gforth_clist);
2630:
2631: va-start-int ( -- ) gforth va_start_int
2632: va_start_int(gforth_clist);
2633:
2634: va-start-longlong ( -- ) gforth va_start_longlong
2635: va_start_longlong(gforth_clist);
2636:
2637: va-start-ptr ( -- ) gforth va_start_ptr
2638: va_start_ptr(gforth_clist, (char *));
2639:
2640: va-start-float ( -- ) gforth va_start_float
2641: va_start_float(gforth_clist);
2642:
2643: va-start-double ( -- ) gforth va_start_double
2644: va_start_double(gforth_clist);
2645:
2646: va-arg-int ( -- w ) gforth va_arg_int
2647: w = va_arg_int(gforth_clist);
2648:
2649: va-arg-longlong ( -- d ) gforth va_arg_longlong
2650: #ifdef BUGGY_LONG_LONG
2651: DLO_IS(d, va_arg_longlong(gforth_clist));
2652: DHI_IS(d, 0);
2653: #else
2654: d = va_arg_longlong(gforth_clist);
2655: #endif
2656:
2657: va-arg-ptr ( -- c_addr ) gforth va_arg_ptr
2658: c_addr = (char *)va_arg_ptr(gforth_clist,char*);
2659:
2660: va-arg-float ( -- r ) gforth va_arg_float
2661: r = va_arg_float(gforth_clist);
2662:
2663: va-arg-double ( -- r ) gforth va_arg_double
2664: r = va_arg_double(gforth_clist);
2665:
2666: va-return-void ( -- ) gforth va_return_void
2667: va_return_void(gforth_clist);
2668: return 0;
2669:
2670: va-return-int ( w -- ) gforth va_return_int
2671: va_return_int(gforth_clist, w);
2672: return 0;
2673:
2674: va-return-ptr ( c_addr -- ) gforth va_return_ptr
2675: va_return_ptr(gforth_clist, void *, c_addr);
2676: return 0;
2677:
2678: va-return-longlong ( d -- ) gforth va_return_longlong
2679: #ifdef BUGGY_LONG_LONG
2680: va_return_longlong(gforth_clist, d.lo);
2681: #else
2682: va_return_longlong(gforth_clist, d);
2683: #endif
2684: return 0;
2685:
2686: va-return-float ( r -- ) gforth va_return_float
2687: va_return_float(gforth_clist, r);
2688: return 0;
2689:
2690: va-return-double ( r -- ) gforth va_return_double
2691: va_return_double(gforth_clist, r);
2692: return 0;
2693:
2694: \+
2695:
2696: \+LIBFFI
2697:
2698: ffi-type ( n -- a_type ) gforth ffi_type
2699: static void* ffi_types[] =
2700: { &ffi_type_void,
2701: &ffi_type_uint8, &ffi_type_sint8,
2702: &ffi_type_uint16, &ffi_type_sint16,
2703: &ffi_type_uint32, &ffi_type_sint32,
2704: &ffi_type_uint64, &ffi_type_sint64,
2705: &ffi_type_float, &ffi_type_double, &ffi_type_longdouble,
2706: &ffi_type_pointer };
2707: a_type = ffi_types[n];
2708:
2709: ffi-size ( n1 -- n2 ) gforth ffi_size
2710: static int ffi_sizes[] =
2711: { sizeof(ffi_cif), sizeof(ffi_closure) };
2712: n2 = ffi_sizes[n1];
2713:
2714: ffi-prep-cif ( a_atypes n a_rtype a_cif -- w ) gforth ffi_prep_cif
2715: w = ffi_prep_cif((ffi_cif *)a_cif, FFI_DEFAULT_ABI, n,
2716: (ffi_type *)a_rtype, (ffi_type **)a_atypes);
2717:
2718: ffi-call ( a_avalues a_rvalue a_ip a_cif -- ) gforth ffi_call
2719: SAVE_REGS
2720: ffi_call((ffi_cif *)a_cif, (void(*)())a_ip, (void *)a_rvalue, (void **)a_avalues);
2721: REST_REGS
2722:
2723: ffi-prep-closure ( a_ip a_cif a_closure -- w ) gforth ffi_prep_closure
2724: w = ffi_prep_closure((ffi_closure *)a_closure, (ffi_cif *)a_cif, gforth_callback, (void *)a_ip);
2725:
2726: ffi-2@ ( a_addr -- d ) gforth ffi_2fetch
2727: #ifdef BUGGY_LONG_LONG
2728: DLO_IS(d, *(Cell*)(*a_addr));
2729: DHI_IS(d, 0);
2730: #else
2731: d = *(DCell*)(a_addr);
2732: #endif
2733:
2734: ffi-2! ( d a_addr -- ) gforth ffi_2store
2735: #ifdef BUGGY_LONG_LONG
2736: *(Cell*)(a_addr) = DLO(d);
2737: #else
2738: *(DCell*)(a_addr) = d;
2739: #endif
2740:
2741: ffi-arg-int ( -- w ) gforth ffi_arg_int
2742: w = *(int *)(*gforth_clist++);
2743:
2744: ffi-arg-long ( -- w ) gforth ffi_arg_long
2745: w = *(long *)(*gforth_clist++);
2746:
2747: ffi-arg-longlong ( -- d ) gforth ffi_arg_longlong
2748: #ifdef BUGGY_LONG_LONG
2749: DLO_IS(d, *(Cell*)(*gforth_clist++));
2750: DHI_IS(d, -(*(Cell*)(*gforth_clist++)<0));
2751: #else
2752: d = *(DCell*)(*gforth_clist++);
2753: #endif
2754:
2755: ffi-arg-dlong ( -- d ) gforth ffi_arg_dlong
2756: #ifdef BUGGY_LONG_LONG
2757: DLO_IS(d, *(Cell*)(*gforth_clist++));
2758: DHI_IS(d, -(*(Cell*)(*gforth_clist++)<0));
2759: #else
2760: d = *(Cell*)(*gforth_clist++);
2761: #endif
2762:
2763: ffi-arg-ptr ( -- c_addr ) gforth ffi_arg_ptr
2764: c_addr = *(Char **)(*gforth_clist++);
2765:
2766: ffi-arg-float ( -- r ) gforth ffi_arg_float
2767: r = *(float*)(*gforth_clist++);
2768:
2769: ffi-arg-double ( -- r ) gforth ffi_arg_double
2770: r = *(double*)(*gforth_clist++);
2771:
2772: ffi-ret-void ( -- ) gforth ffi_ret_void
2773: return 0;
2774:
2775: ffi-ret-int ( w -- ) gforth ffi_ret_int
2776: *(int*)(gforth_ritem) = w;
2777: return 0;
2778:
2779: ffi-ret-longlong ( d -- ) gforth ffi_ret_longlong
2780: #ifdef BUGGY_LONG_LONG
2781: *(Cell*)(gforth_ritem) = DLO(d);
2782: #else
2783: *(DCell*)(gforth_ritem) = d;
2784: #endif
2785: return 0;
2786:
2787: ffi-ret-dlong ( d -- ) gforth ffi_ret_dlong
2788: #ifdef BUGGY_LONG_LONG
2789: *(Cell*)(gforth_ritem) = DLO(d);
2790: #else
2791: *(Cell*)(gforth_ritem) = d;
2792: #endif
2793: return 0;
2794:
2795: ffi-ret-long ( n -- ) gforth ffi_ret_long
2796: *(Cell*)(gforth_ritem) = n;
2797: return 0;
2798:
2799: ffi-ret-ptr ( c_addr -- ) gforth ffi_ret_ptr
2800: *(Char **)(gforth_ritem) = c_addr;
2801: return 0;
2802:
2803: ffi-ret-float ( r -- ) gforth ffi_ret_float
2804: *(float*)(gforth_ritem) = r;
2805: return 0;
2806:
2807: ffi-ret-double ( r -- ) gforth ffi_ret_double
2808: *(double*)(gforth_ritem) = r;
2809: return 0;
2810:
2811: \+
2812:
2813: \+OLDCALL
2814:
2815: define(`uploop',
2816: `pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')')
2817: define(`_uploop',
2818: `ifelse($1, `$3', `$5',
2819: `$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')')
2820: \ argflist(argnum): Forth argument list
2821: define(argflist,
2822: `ifelse($1, 0, `',
2823: `uploop(`_i', 1, $1, `format(`u%d ', _i)', `format(`u%d ', _i)')')')
2824: \ argdlist(argnum): declare C's arguments
2825: define(argdlist,
2826: `ifelse($1, 0, `',
2827: `uploop(`_i', 1, $1, `Cell, ', `Cell')')')
2828: \ argclist(argnum): pass C's arguments
2829: define(argclist,
2830: `ifelse($1, 0, `',
2831: `uploop(`_i', 1, $1, `format(`u%d, ', _i)', `format(`u%d', _i)')')')
2832: \ icall(argnum)
2833: define(icall,
2834: `icall$1 ( argflist($1)u -- uret ) gforth
2835: uret = (SYSCALL(Cell(*)(argdlist($1)))u)(argclist($1));
2836:
2837: ')
2838: define(fcall,
2839: `fcall$1 ( argflist($1)u -- rret ) gforth
2840: rret = (SYSCALL(Float(*)(argdlist($1)))u)(argclist($1));
2841:
2842: ')
2843:
2844: \ close ' to keep fontify happy
2845:
2846: uploop(i, 0, 7, `icall(i)')
2847: icall(20)
2848: uploop(i, 0, 7, `fcall(i)')
2849: fcall(20)
2850:
2851: \+
2852: \+
2853:
2854: \g peephole
2855:
2856: \+peephole
2857:
2858: compile-prim1 ( a_prim -- ) gforth compile_prim1
2859: ""compile prim (incl. immargs) at @var{a_prim}""
2860: compile_prim1(a_prim);
2861:
2862: finish-code ( ... -- ... ) gforth finish_code
2863: ""Perform delayed steps in code generation (branch resolution, I-cache
2864: flushing).""
2865: /* The ... above are a workaround for a bug in gcc-2.95, which fails
2866: to save spTOS (gforth-fast --enable-force-reg) */
2867: finish_code();
2868:
2869: forget-dyncode ( c_code -- f ) gforth-internal forget_dyncode
2870: f = forget_dyncode(c_code);
2871:
2872: decompile-prim ( a_code -- a_prim ) gforth-internal decompile_prim
2873: ""a_prim is the code address of the primitive that has been
2874: compile_prim1ed to a_code""
2875: a_prim = (Cell *)decompile_code((Label)a_code);
2876:
2877: \ set-next-code and call2 do not appear in images and can be
2878: \ renumbered arbitrarily
2879:
2880: set-next-code ( #w -- ) gforth set_next_code
2881: #ifdef NO_IP
2882: next_code = (Label)w;
2883: #endif
2884:
2885: call2 ( #a_callee #a_ret_addr -- R:a_ret_addr ) gforth
2886: /* call with explicit return address */
2887: #ifdef NO_IP
2888: INST_TAIL;
2889: JUMP(a_callee);
2890: #else
2891: assert(0);
2892: #endif
2893:
2894: tag-offsets ( -- a_addr ) gforth tag_offsets
2895: extern Cell groups[32];
2896: a_addr = groups;
2897:
2898: \+
2899:
2900: \g static_super
2901:
2902: ifdef(`STACK_CACHE_FILE',
2903: `include(peeprules.vmg)')
2904:
2905: \g end
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>