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