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