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