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: n = memcmp(c_addr1, c_addr2, u1<u2 ? u1 : u2);
492: if (n==0)
493: n = u1-u2;
494: if (n<0)
495: n = -1;
496: else if (n>0)
497: n = 1;
498: :
499: rot 2dup swap - >r min swap -text dup
500: IF rdrop ELSE drop r> sgn THEN ;
501: : sgn ( n -- -1/0/1 )
502: dup 0= IF EXIT THEN 0< 2* 1+ ;
503:
504: -text c_addr1 u c_addr2 -- n new dash_text
505: n = memcmp(c_addr1, c_addr2, u);
506: if (n<0)
507: n = -1;
508: else if (n>0)
509: n = 1;
510: :
511: swap bounds
512: ?DO dup c@ I c@ = WHILE 1+ LOOP drop 0
513: ELSE c@ I c@ - unloop THEN -text-flag ;
514: : sgn ( n -- -1/0/1 )
515: dup 0= IF EXIT THEN 0< 2* 1+ ;
516:
517: toupper c1 -- c2 gforth
518: ""If @i{c1} is a lower-case character (in the current locale), @i{c2}
519: is the equivalent upper-case character. All other characters are unchanged.""
520: c2 = toupper(c1);
521: :
522: dup [char] a - [ char z char a - 1 + ] Literal u< bl and - ;
523:
524: capscomp c_addr1 u c_addr2 -- n new
525: n = memcasecmp(c_addr1, c_addr2, u); /* !! use something that works in all locales */
526: if (n<0)
527: n = -1;
528: else if (n>0)
529: n = 1;
530: :
531: swap bounds
532: ?DO dup c@ I c@ <>
533: IF dup c@ toupper I c@ toupper =
534: ELSE true THEN WHILE 1+ LOOP drop 0
535: ELSE c@ toupper I c@ toupper - unloop THEN -text-flag ;
536:
537: -trailing c_addr u1 -- c_addr u2 string dash_trailing
538: ""Adjust the string specified by @i{c-addr, u1} to remove all trailing
539: spaces. @i{u2} is the length of the modified string.""
540: u2 = u1;
541: while (u2>0 && c_addr[u2-1] == ' ')
542: u2--;
543: :
544: BEGIN 1- 2dup + c@ bl = WHILE
545: dup 0= UNTIL ELSE 1+ THEN ;
546:
547: /string c_addr1 u1 n -- c_addr2 u2 string slash_string
548: ""Adjust the string specified by @i{c-addr1, u1} to remove @i{n}
549: characters from the start of the string.""
550: c_addr2 = c_addr1+n;
551: u2 = u1-n;
552: :
553: tuck - >r + r> dup 0< IF - 0 THEN ;
554:
555: + n1 n2 -- n core plus
556: n = n1+n2;
557:
558: \ PFE-0.9.14 has it differently, but the next release will have it as follows
559: under+ n1 n2 n3 -- n n2 gforth under_plus
560: ""add @i{n3} to @i{n1} (giving @i{n})""
561: n = n1+n3;
562: :
563: rot + swap ;
564:
565: - n1 n2 -- n core minus
566: n = n1-n2;
567: :
568: negate + ;
569:
570: negate n1 -- n2 core
571: /* use minus as alias */
572: n2 = -n1;
573: :
574: invert 1+ ;
575:
576: 1+ n1 -- n2 core one_plus
577: n2 = n1+1;
578: :
579: 1 + ;
580:
581: 1- n1 -- n2 core one_minus
582: n2 = n1-1;
583: :
584: 1 - ;
585:
586: max n1 n2 -- n core
587: if (n1<n2)
588: n = n2;
589: else
590: n = n1;
591: :
592: 2dup < IF swap THEN drop ;
593:
594: min n1 n2 -- n core
595: if (n1<n2)
596: n = n1;
597: else
598: n = n2;
599: :
600: 2dup > IF swap THEN drop ;
601:
602: abs n1 -- n2 core
603: if (n1<0)
604: n2 = -n1;
605: else
606: n2 = n1;
607: :
608: dup 0< IF negate THEN ;
609:
610: * n1 n2 -- n core star
611: n = n1*n2;
612: :
613: um* drop ;
614:
615: / n1 n2 -- n core slash
616: n = n1/n2;
617: :
618: /mod nip ;
619:
620: mod n1 n2 -- n core
621: n = n1%n2;
622: :
623: /mod drop ;
624:
625: /mod n1 n2 -- n3 n4 core slash_mod
626: n4 = n1/n2;
627: n3 = n1%n2; /* !! is this correct? look into C standard! */
628: :
629: >r s>d r> fm/mod ;
630:
631: 2* n1 -- n2 core two_star
632: n2 = 2*n1;
633: :
634: dup + ;
635:
636: 2/ n1 -- n2 core two_slash
637: /* !! is this still correct? */
638: n2 = n1>>1;
639: :
640: dup MINI and IF 1 ELSE 0 THEN
641: [ bits/byte cell * 1- ] literal
642: 0 DO 2* swap dup 2* >r MINI and
643: IF 1 ELSE 0 THEN or r> swap
644: LOOP nip ;
645:
646: fm/mod d1 n1 -- n2 n3 core f_m_slash_mod
647: ""Floored division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}.""
648: #ifdef BUGGY_LONG_LONG
649: DCell r = fmdiv(d1,n1);
650: n2=r.hi;
651: n3=r.lo;
652: #else
653: /* assumes that the processor uses either floored or symmetric division */
654: n3 = d1/n1;
655: n2 = d1%n1;
656: /* note that this 1%-3>0 is optimized by the compiler */
657: if (1%-3>0 && (d1<0) != (n1<0) && n2!=0) {
658: n3--;
659: n2+=n1;
660: }
661: #endif
662: :
663: dup >r dup 0< IF negate >r dnegate r> THEN
664: over 0< IF tuck + swap THEN
665: um/mod
666: r> 0< IF swap negate swap THEN ;
667:
668: sm/rem d1 n1 -- n2 n3 core s_m_slash_rem
669: ""Symmetric division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0.""
670: #ifdef BUGGY_LONG_LONG
671: DCell r = smdiv(d1,n1);
672: n2=r.hi;
673: n3=r.lo;
674: #else
675: /* assumes that the processor uses either floored or symmetric division */
676: n3 = d1/n1;
677: n2 = d1%n1;
678: /* note that this 1%-3<0 is optimized by the compiler */
679: if (1%-3<0 && (d1<0) != (n1<0) && n2!=0) {
680: n3++;
681: n2-=n1;
682: }
683: #endif
684: :
685: over >r dup >r abs -rot
686: dabs rot um/mod
687: r> r@ xor 0< IF negate THEN
688: r> 0< IF swap negate swap THEN ;
689:
690: m* n1 n2 -- d core m_star
691: #ifdef BUGGY_LONG_LONG
692: d = mmul(n1,n2);
693: #else
694: d = (DCell)n1 * (DCell)n2;
695: #endif
696: :
697: 2dup 0< and >r
698: 2dup swap 0< and >r
699: um* r> - r> - ;
700:
701: um* u1 u2 -- ud core u_m_star
702: /* use u* as alias */
703: #ifdef BUGGY_LONG_LONG
704: ud = ummul(u1,u2);
705: #else
706: ud = (UDCell)u1 * (UDCell)u2;
707: #endif
708: :
709: >r >r 0 0 r> r> [ 8 cells ] literal 0
710: DO
711: over >r dup >r 0< and d2*+ drop
712: r> 2* r> swap
713: LOOP 2drop ;
714: : d2*+ ( ud n -- ud+n c )
715: over MINI
716: and >r >r 2dup d+ swap r> + swap r> ;
717:
718: um/mod ud u1 -- u2 u3 core u_m_slash_mod
719: ""ud=u3*u1+u2, u1>u2>=0""
720: #ifdef BUGGY_LONG_LONG
721: UDCell r = umdiv(ud,u1);
722: u2=r.hi;
723: u3=r.lo;
724: #else
725: u3 = ud/u1;
726: u2 = ud%u1;
727: #endif
728: :
729: 0 swap [ 8 cells 1 + ] literal 0
730: ?DO /modstep
731: LOOP drop swap 1 rshift or swap ;
732: : /modstep ( ud c R: u -- ud-?u c R: u )
733: >r over r@ u< 0= or IF r@ - 1 ELSE 0 THEN d2*+ r> ;
734: : d2*+ ( ud n -- ud+n c )
735: over MINI
736: and >r >r 2dup d+ swap r> + swap r> ;
737:
738: m+ d1 n -- d2 double m_plus
739: #ifdef BUGGY_LONG_LONG
740: d2.lo = d1.lo+n;
741: d2.hi = d1.hi - (n<0) + (d2.lo<d1.lo);
742: #else
743: d2 = d1+n;
744: #endif
745: :
746: s>d d+ ;
747:
748: d+ d1 d2 -- d double d_plus
749: #ifdef BUGGY_LONG_LONG
750: d.lo = d1.lo+d2.lo;
751: d.hi = d1.hi + d2.hi + (d.lo<d1.lo);
752: #else
753: d = d1+d2;
754: #endif
755: :
756: rot + >r tuck + swap over u> r> swap - ;
757:
758: d- d1 d2 -- d double d_minus
759: #ifdef BUGGY_LONG_LONG
760: d.lo = d1.lo - d2.lo;
761: d.hi = d1.hi-d2.hi-(d1.lo<d2.lo);
762: #else
763: d = d1-d2;
764: #endif
765: :
766: dnegate d+ ;
767:
768: dnegate d1 -- d2 double d_negate
769: /* use dminus as alias */
770: #ifdef BUGGY_LONG_LONG
771: d2 = dnegate(d1);
772: #else
773: d2 = -d1;
774: #endif
775: :
776: invert swap negate tuck 0= - ;
777:
778: d2* d1 -- d2 double d_two_star
779: #ifdef BUGGY_LONG_LONG
780: d2.lo = d1.lo<<1;
781: d2.hi = (d1.hi<<1) | (d1.lo>>(CELL_BITS-1));
782: #else
783: d2 = 2*d1;
784: #endif
785: :
786: 2dup d+ ;
787:
788: d2/ d1 -- d2 double d_two_slash
789: #ifdef BUGGY_LONG_LONG
790: d2.hi = d1.hi>>1;
791: d2.lo= (d1.lo>>1) | (d1.hi<<(CELL_BITS-1));
792: #else
793: d2 = d1>>1;
794: #endif
795: :
796: dup 1 and >r 2/ swap 2/ [ 1 8 cells 1- lshift 1- ] Literal and
797: r> IF [ 1 8 cells 1- lshift ] Literal + THEN swap ;
798:
799: and w1 w2 -- w core
800: w = w1&w2;
801:
802: or w1 w2 -- w core
803: w = w1|w2;
804: :
805: invert swap invert and invert ;
806:
807: xor w1 w2 -- w core x_or
808: w = w1^w2;
809:
810: invert w1 -- w2 core
811: w2 = ~w1;
812: :
813: MAXU xor ;
814:
815: rshift u1 n -- u2 core r_shift
816: u2 = u1>>n;
817: :
818: 0 ?DO 2/ MAXI and LOOP ;
819:
820: lshift u1 n -- u2 core l_shift
821: u2 = u1<<n;
822: :
823: 0 ?DO 2* LOOP ;
824:
825: \ comparisons(prefix, args, prefix, arg1, arg2, wordsets...)
826: define(comparisons,
827: $1= $2 -- f $6 $3equals
828: f = FLAG($4==$5);
829: :
830: [ char $1x char 0 = [IF]
831: ] IF false ELSE true THEN [
832: [ELSE]
833: ] xor 0= [
834: [THEN] ] ;
835:
836: $1<> $2 -- f $7 $3not_equals
837: f = FLAG($4!=$5);
838: :
839: [ char $1x char 0 = [IF]
840: ] IF true ELSE false THEN [
841: [ELSE]
842: ] xor 0<> [
843: [THEN] ] ;
844:
845: $1< $2 -- f $8 $3less_than
846: f = FLAG($4<$5);
847: :
848: [ char $1x char 0 = [IF]
849: ] MINI and 0<> [
850: [ELSE] char $1x char u = [IF]
851: ] 2dup xor 0< IF nip ELSE - THEN 0< [
852: [ELSE]
853: ] MINI xor >r MINI xor r> u< [
854: [THEN]
855: [THEN] ] ;
856:
857: $1> $2 -- f $9 $3greater_than
858: f = FLAG($4>$5);
859: :
860: [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
861: $1< ;
862:
863: $1<= $2 -- f gforth $3less_or_equal
864: f = FLAG($4<=$5);
865: :
866: $1> 0= ;
867:
868: $1>= $2 -- f gforth $3greater_or_equal
869: f = FLAG($4>=$5);
870: :
871: [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
872: $1<= ;
873:
874: )
875:
876: comparisons(0, n, zero_, n, 0, core, core-ext, core, core-ext)
877: comparisons(, n1 n2, , n1, n2, core, core-ext, core, core)
878: comparisons(u, u1 u2, u_, u1, u2, gforth, gforth, core, core-ext)
879:
880: \ dcomparisons(prefix, args, prefix, arg1, arg2, wordsets...)
881: define(dcomparisons,
882: $1= $2 -- f $6 $3equals
883: #ifdef BUGGY_LONG_LONG
884: f = FLAG($4.lo==$5.lo && $4.hi==$5.hi);
885: #else
886: f = FLAG($4==$5);
887: #endif
888:
889: $1<> $2 -- f $7 $3not_equals
890: #ifdef BUGGY_LONG_LONG
891: f = FLAG($4.lo!=$5.lo || $4.hi!=$5.hi);
892: #else
893: f = FLAG($4!=$5);
894: #endif
895:
896: $1< $2 -- f $8 $3less_than
897: #ifdef BUGGY_LONG_LONG
898: f = FLAG($4.hi==$5.hi ? $4.lo<$5.lo : $4.hi<$5.hi);
899: #else
900: f = FLAG($4<$5);
901: #endif
902:
903: $1> $2 -- f $9 $3greater_than
904: #ifdef BUGGY_LONG_LONG
905: f = FLAG($4.hi==$5.hi ? $4.lo>$5.lo : $4.hi>$5.hi);
906: #else
907: f = FLAG($4>$5);
908: #endif
909:
910: $1<= $2 -- f gforth $3less_or_equal
911: #ifdef BUGGY_LONG_LONG
912: f = FLAG($4.hi==$5.hi ? $4.lo<=$5.lo : $4.hi<=$5.hi);
913: #else
914: f = FLAG($4<=$5);
915: #endif
916:
917: $1>= $2 -- f gforth $3greater_or_equal
918: #ifdef BUGGY_LONG_LONG
919: f = FLAG($4.hi==$5.hi ? $4.lo>=$5.lo : $4.hi>=$5.hi);
920: #else
921: f = FLAG($4>=$5);
922: #endif
923:
924: )
925:
926: \+dcomps
927:
928: dcomparisons(d, d1 d2, d_, d1, d2, double, gforth, double, gforth)
929: dcomparisons(d0, d, d_zero_, d, DZERO, double, gforth, double, gforth)
930: dcomparisons(du, ud1 ud2, d_u_, ud1, ud2, gforth, gforth, double-ext, gforth)
931:
932: \+
933:
934: within u1 u2 u3 -- f core-ext
935: ""u2=<u1<u3 or: u3=<u2 and u1 is not in [u3,u2). This works for
936: unsigned and signed numbers (but not a mixture). Another way to think
937: about this word is to consider the numbers as a circle (wrapping
938: around from @code{max-u} to 0 for unsigned, and from @code{max-n} to
939: min-n for signed numbers); now consider the range from u2 towards
940: increasing numbers up to and excluding u3 (giving an empty range if
941: u2=u3; if u1 is in this range, @code{within} returns true.""
942: f = FLAG(u1-u2 < u3-u2);
943: :
944: over - >r - r> u< ;
945:
946: sp@ -- a_addr gforth sp_fetch
947: a_addr = sp+1;
948:
949: sp! a_addr -- gforth sp_store
950: sp = a_addr;
951: /* works with and without TOS caching */
952:
953: rp@ -- a_addr gforth rp_fetch
954: a_addr = rp;
955:
956: rp! a_addr -- gforth rp_store
957: rp = a_addr;
958:
959: \+floating
960:
961: fp@ -- f_addr gforth fp_fetch
962: f_addr = fp;
963:
964: fp! f_addr -- gforth fp_store
965: fp = f_addr;
966:
967: \+
968:
969: ;s -- gforth semis
970: ""The primitive compiled by @code{EXIT}.""
971: SET_IP((Xt *)(*rp++));
972:
973: >r w -- core to_r
974: *--rp = w;
975: :
976: (>r) ;
977: : (>r) rp@ cell+ @ rp@ ! rp@ cell+ ! ;
978:
979: r> -- w core r_from
980: w = *rp++;
981: :
982: rp@ cell+ @ rp@ @ rp@ cell+ ! (rdrop) rp@ ! ;
983: Create (rdrop) ' ;s A,
984:
985: rdrop -- gforth
986: rp++;
987: :
988: r> r> drop >r ;
989:
990: 2>r w1 w2 -- core-ext two_to_r
991: *--rp = w1;
992: *--rp = w2;
993: :
994: swap r> swap >r swap >r >r ;
995:
996: 2r> -- w1 w2 core-ext two_r_from
997: w2 = *rp++;
998: w1 = *rp++;
999: :
1000: r> r> swap r> swap >r swap ;
1001:
1002: 2r@ -- w1 w2 core-ext two_r_fetch
1003: w2 = rp[0];
1004: w1 = rp[1];
1005: :
1006: i' j ;
1007:
1008: 2rdrop -- gforth two_r_drop
1009: rp+=2;
1010: :
1011: r> r> drop r> drop >r ;
1012:
1013: over w1 w2 -- w1 w2 w1 core
1014: :
1015: sp@ cell+ @ ;
1016:
1017: drop w -- core
1018: :
1019: IF THEN ;
1020:
1021: swap w1 w2 -- w2 w1 core
1022: :
1023: >r (swap) ! r> (swap) @ ;
1024: Variable (swap)
1025:
1026: dup w -- w w core dupe
1027: :
1028: sp@ @ ;
1029:
1030: rot w1 w2 w3 -- w2 w3 w1 core rote
1031: :
1032: [ defined? (swap) [IF] ]
1033: (swap) ! (rot) ! >r (rot) @ (swap) @ r> ;
1034: Variable (rot)
1035: [ELSE] ]
1036: >r swap r> swap ;
1037: [THEN]
1038:
1039: -rot w1 w2 w3 -- w3 w1 w2 gforth not_rote
1040: :
1041: rot rot ;
1042:
1043: nip w1 w2 -- w2 core-ext
1044: :
1045: swap drop ;
1046:
1047: tuck w1 w2 -- w2 w1 w2 core-ext
1048: :
1049: swap over ;
1050:
1051: ?dup w -- w core question_dupe
1052: if (w!=0) {
1053: IF_TOS(*sp-- = w;)
1054: #ifndef USE_TOS
1055: *--sp = w;
1056: #endif
1057: }
1058: :
1059: dup IF dup THEN ;
1060:
1061: pick u -- w core-ext
1062: w = sp[u+1];
1063: :
1064: 1+ cells sp@ + @ ;
1065:
1066: 2drop w1 w2 -- core two_drop
1067: :
1068: drop drop ;
1069:
1070: 2dup w1 w2 -- w1 w2 w1 w2 core two_dupe
1071: :
1072: over over ;
1073:
1074: 2over w1 w2 w3 w4 -- w1 w2 w3 w4 w1 w2 core two_over
1075: :
1076: 3 pick 3 pick ;
1077:
1078: 2swap w1 w2 w3 w4 -- w3 w4 w1 w2 core two_swap
1079: :
1080: rot >r rot r> ;
1081:
1082: 2rot w1 w2 w3 w4 w5 w6 -- w3 w4 w5 w6 w1 w2 double-ext two_rote
1083: :
1084: >r >r 2swap r> r> 2swap ;
1085:
1086: 2nip w1 w2 w3 w4 -- w3 w4 gforth two_nip
1087: :
1088: 2swap 2drop ;
1089:
1090: 2tuck w1 w2 w3 w4 -- w3 w4 w1 w2 w3 w4 gforth two_tuck
1091: :
1092: 2swap 2over ;
1093:
1094: \ toggle is high-level: 0.11/0.42%
1095:
1096: @ a_addr -- w core fetch
1097: "" Read from the cell at address @i{a-addr}, and return its contents, @i{w}.""
1098: w = *a_addr;
1099:
1100: ! w a_addr -- core store
1101: "" Write the value @i{w} to the cell at address @i{a-addr}.""
1102: *a_addr = w;
1103:
1104: +! n a_addr -- core plus_store
1105: "" Add @i{n} to the value stored in the cell at address @i{a-addr}.""
1106: *a_addr += n;
1107: :
1108: tuck @ + swap ! ;
1109:
1110: c@ c_addr -- c core c_fetch
1111: "" Read from the char at address @i{c-addr}, and return its contents, @i{c}.""
1112: c = *c_addr;
1113: :
1114: [ bigendian [IF] ]
1115: [ cell>bit 4 = [IF] ]
1116: dup [ 0 cell - ] Literal and @ swap 1 and
1117: IF $FF and ELSE 8>> THEN ;
1118: [ [ELSE] ]
1119: dup [ cell 1- ] literal and
1120: tuck - @ swap [ cell 1- ] literal xor
1121: 0 ?DO 8>> LOOP $FF and
1122: [ [THEN] ]
1123: [ [ELSE] ]
1124: [ cell>bit 4 = [IF] ]
1125: dup [ 0 cell - ] Literal and @ swap 1 and
1126: IF 8>> ELSE $FF and THEN
1127: [ [ELSE] ]
1128: dup [ cell 1- ] literal and
1129: tuck - @ swap
1130: 0 ?DO 8>> LOOP 255 and
1131: [ [THEN] ]
1132: [ [THEN] ]
1133: ;
1134: : 8>> 2/ 2/ 2/ 2/ 2/ 2/ 2/ 2/ ;
1135:
1136: c! c c_addr -- core c_store
1137: "" Write the value @i{c} to the char at address @i{c-addr}.""
1138: *c_addr = c;
1139: :
1140: [ bigendian [IF] ]
1141: [ cell>bit 4 = [IF] ]
1142: tuck 1 and IF $FF and ELSE 8<< THEN >r
1143: dup -2 and @ over 1 and cells masks + @ and
1144: r> or swap -2 and ! ;
1145: Create masks $00FF , $FF00 ,
1146: [ELSE] ]
1147: dup [ cell 1- ] literal and dup
1148: [ cell 1- ] literal xor >r
1149: - dup @ $FF r@ 0 ?DO 8<< LOOP invert and
1150: rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
1151: [THEN]
1152: [ELSE] ]
1153: [ cell>bit 4 = [IF] ]
1154: tuck 1 and IF 8<< ELSE $FF and THEN >r
1155: dup -2 and @ over 1 and cells masks + @ and
1156: r> or swap -2 and ! ;
1157: Create masks $FF00 , $00FF ,
1158: [ELSE] ]
1159: dup [ cell 1- ] literal and dup >r
1160: - dup @ $FF r@ 0 ?DO 8<< LOOP invert and
1161: rot $FF and r> 0 ?DO 8<< LOOP or swap ! ;
1162: [THEN]
1163: [THEN]
1164: : 8<< 2* 2* 2* 2* 2* 2* 2* 2* ;
1165:
1166: 2! w1 w2 a_addr -- core two_store
1167: "" Write the value @i{w1, w2} to the double at address @i{a-addr}.""
1168: a_addr[0] = w2;
1169: a_addr[1] = w1;
1170: :
1171: tuck ! cell+ ! ;
1172:
1173: 2@ a_addr -- w1 w2 core two_fetch
1174: "" Read from the double at address @i{a-addr}, and return its contents, @i{w1, w2}.""
1175: w2 = a_addr[0];
1176: w1 = a_addr[1];
1177: :
1178: dup cell+ @ swap @ ;
1179:
1180: cell+ a_addr1 -- a_addr2 core cell_plus
1181: "" Increment @i{a-addr1} by the number of address units corresponding to the size of
1182: one cell, to give @i{a-addr2}.""
1183: a_addr2 = a_addr1+1;
1184: :
1185: cell + ;
1186:
1187: cells n1 -- n2 core
1188: "" @i{n2} is the number of address units corresponding to @i{n1} cells.""
1189: n2 = n1 * sizeof(Cell);
1190: :
1191: [ cell
1192: 2/ dup [IF] ] 2* [ [THEN]
1193: 2/ dup [IF] ] 2* [ [THEN]
1194: 2/ dup [IF] ] 2* [ [THEN]
1195: 2/ dup [IF] ] 2* [ [THEN]
1196: drop ] ;
1197:
1198: char+ c_addr1 -- c_addr2 core char_plus
1199: "" Increment @i{c-addr1} by the number of address units corresponding to the size of
1200: one char, to give @i{c-addr2}.""
1201: c_addr2 = c_addr1 + 1;
1202: :
1203: 1+ ;
1204:
1205: (chars) n1 -- n2 gforth paren_chars
1206: n2 = n1 * sizeof(Char);
1207: :
1208: ;
1209:
1210: count c_addr1 -- c_addr2 u core
1211: "" If @i{c-add1} is the address of a counted string return the length of
1212: the string, @i{u}, and the address of its first character, @i{c-addr2}.""
1213: u = *c_addr1;
1214: c_addr2 = c_addr1+1;
1215: :
1216: dup 1+ swap c@ ;
1217:
1218: (f83find) c_addr u f83name1 -- f83name2 new paren_f83find
1219: for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next))
1220: if ((UCell)F83NAME_COUNT(f83name1)==u &&
1221: memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */)
1222: break;
1223: f83name2=f83name1;
1224: :
1225: BEGIN dup WHILE (find-samelen) dup WHILE
1226: >r 2dup r@ cell+ char+ capscomp 0=
1227: IF 2drop r> EXIT THEN
1228: r> @
1229: REPEAT THEN nip nip ;
1230: : (find-samelen) ( u f83name1 -- u f83name2/0 )
1231: BEGIN 2dup cell+ c@ $1F and <> WHILE @ dup 0= UNTIL THEN ;
1232:
1233: \+hash
1234:
1235: (hashfind) c_addr u a_addr -- f83name2 new paren_hashfind
1236: struct F83Name *f83name1;
1237: f83name2=NULL;
1238: while(a_addr != NULL)
1239: {
1240: f83name1=(struct F83Name *)(a_addr[1]);
1241: a_addr=(Cell *)(a_addr[0]);
1242: if ((UCell)F83NAME_COUNT(f83name1)==u &&
1243: memcasecmp(c_addr, f83name1->name, u)== 0 /* or inline? */)
1244: {
1245: f83name2=f83name1;
1246: break;
1247: }
1248: }
1249: :
1250: BEGIN dup WHILE
1251: 2@ >r >r dup r@ cell+ c@ $1F and =
1252: IF 2dup r@ cell+ char+ capscomp 0=
1253: IF 2drop r> rdrop EXIT THEN THEN
1254: rdrop r>
1255: REPEAT nip nip ;
1256:
1257: (tablefind) c_addr u a_addr -- f83name2 new paren_tablefind
1258: ""A case-sensitive variant of @code{(hashfind)}""
1259: struct F83Name *f83name1;
1260: f83name2=NULL;
1261: while(a_addr != NULL)
1262: {
1263: f83name1=(struct F83Name *)(a_addr[1]);
1264: a_addr=(Cell *)(a_addr[0]);
1265: if ((UCell)F83NAME_COUNT(f83name1)==u &&
1266: memcmp(c_addr, f83name1->name, u)== 0 /* or inline? */)
1267: {
1268: f83name2=f83name1;
1269: break;
1270: }
1271: }
1272: :
1273: BEGIN dup WHILE
1274: 2@ >r >r dup r@ cell+ c@ $1F and =
1275: IF 2dup r@ cell+ char+ -text 0=
1276: IF 2drop r> rdrop EXIT THEN THEN
1277: rdrop r>
1278: REPEAT nip nip ;
1279:
1280: (hashkey) c_addr u1 -- u2 gforth paren_hashkey
1281: u2=0;
1282: while(u1--)
1283: u2+=(Cell)toupper(*c_addr++);
1284: :
1285: 0 -rot bounds ?DO I c@ toupper + LOOP ;
1286:
1287: (hashkey1) c_addr u ubits -- ukey gforth paren_hashkey1
1288: ""ukey is the hash key for the string c_addr u fitting in ubits bits""
1289: /* this hash function rotates the key at every step by rot bits within
1290: ubits bits and xors it with the character. This function does ok in
1291: the chi-sqare-test. Rot should be <=7 (preferably <=5) for
1292: ASCII strings (larger if ubits is large), and should share no
1293: divisors with ubits.
1294: */
1295: 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];
1296: Char *cp = c_addr;
1297: for (ukey=0; cp<c_addr+u; cp++)
1298: ukey = ((((ukey<<rot) | (ukey>>(ubits-rot)))
1299: ^ toupper(*cp))
1300: & ((1<<ubits)-1));
1301: :
1302: dup rot-values + c@ over 1 swap lshift 1- >r
1303: tuck - 2swap r> 0 2swap bounds
1304: ?DO dup 4 pick lshift swap 3 pick rshift or
1305: I c@ toupper xor
1306: over and LOOP
1307: nip nip nip ;
1308: Create rot-values
1309: 5 c, 0 c, 1 c, 2 c, 3 c, 4 c, 5 c, 5 c, 5 c, 5 c,
1310: 3 c, 5 c, 5 c, 5 c, 5 c, 7 c, 5 c, 5 c, 5 c, 5 c,
1311: 7 c, 5 c, 5 c, 5 c, 5 c, 6 c, 5 c, 5 c, 5 c, 5 c,
1312: 7 c, 5 c, 5 c,
1313:
1314: \+
1315:
1316: (parse-white) c_addr1 u1 -- c_addr2 u2 gforth paren_parse_white
1317: /* use !isgraph instead of isspace? */
1318: Char *endp = c_addr1+u1;
1319: while (c_addr1<endp && isspace(*c_addr1))
1320: c_addr1++;
1321: if (c_addr1<endp) {
1322: for (c_addr2 = c_addr1; c_addr1<endp && !isspace(*c_addr1); c_addr1++)
1323: ;
1324: u2 = c_addr1-c_addr2;
1325: }
1326: else {
1327: c_addr2 = c_addr1;
1328: u2 = 0;
1329: }
1330: :
1331: BEGIN dup WHILE over c@ bl <= WHILE 1 /string
1332: REPEAT THEN 2dup
1333: BEGIN dup WHILE over c@ bl > WHILE 1 /string
1334: REPEAT THEN nip - ;
1335:
1336: aligned c_addr -- a_addr core
1337: "" @i{a-addr} is the first aligned address greater than or equal to @i{c-addr}.""
1338: a_addr = (Cell *)((((Cell)c_addr)+(sizeof(Cell)-1))&(-sizeof(Cell)));
1339: :
1340: [ cell 1- ] Literal + [ -1 cells ] Literal and ;
1341:
1342: faligned c_addr -- f_addr float f_aligned
1343: "" @i{f-addr} is the first float-aligned address greater than or equal to @i{c-addr}.""
1344: f_addr = (Float *)((((Cell)c_addr)+(sizeof(Float)-1))&(-sizeof(Float)));
1345: :
1346: [ 1 floats 1- ] Literal + [ -1 floats ] Literal and ;
1347:
1348: >body xt -- a_addr core to_body
1349: "" Get the address of the body of the word represented by @i{xt} (the address
1350: of the word's data field).""
1351: a_addr = PFA(xt);
1352: :
1353: 2 cells + ;
1354:
1355: \ threading stuff is currently only interesting if we have a compiler
1356: \fhas? standardthreading has? compiler and [IF]
1357:
1358: >code-address xt -- c_addr gforth to_code_address
1359: ""@i{c-addr} is the code address of the word @i{xt}.""
1360: /* !! This behaves installation-dependently for DOES-words */
1361: c_addr = (Address)CODE_ADDRESS(xt);
1362: :
1363: @ ;
1364:
1365: >does-code xt -- a_addr gforth to_does_code
1366: ""If @i{xt} is the execution token of a defining-word-defined word,
1367: @i{a-addr} is the start of the Forth code after the @code{DOES>};
1368: Otherwise @i{a-addr} is 0.""
1369: a_addr = (Cell *)DOES_CODE(xt);
1370: :
1371: cell+ @ ;
1372:
1373: code-address! c_addr xt -- gforth code_address_store
1374: ""Create a code field with code address @i{c-addr} at @i{xt}.""
1375: MAKE_CF(xt, c_addr);
1376: CACHE_FLUSH(xt,(size_t)PFA(0));
1377: :
1378: ! ;
1379:
1380: does-code! a_addr xt -- gforth does_code_store
1381: ""Create a code field at @i{xt} for a defining-word-defined word; @i{a-addr}
1382: is the start of the Forth code after @code{DOES>}.""
1383: MAKE_DOES_CF(xt, a_addr);
1384: CACHE_FLUSH(xt,(size_t)PFA(0));
1385: :
1386: dodoes: over ! cell+ ! ;
1387:
1388: does-handler! a_addr -- gforth does_handler_store
1389: ""Create a @code{DOES>}-handler at address @i{a-addr}. Usually, @i{a-addr} points
1390: just behind a @code{DOES>}.""
1391: MAKE_DOES_HANDLER(a_addr);
1392: CACHE_FLUSH((caddr_t)a_addr,DOES_HANDLER_SIZE);
1393: :
1394: drop ;
1395:
1396: /does-handler -- n gforth slash_does_handler
1397: ""The size of a @code{DOES>}-handler (includes possible padding).""
1398: /* !! a constant or environmental query might be better */
1399: n = DOES_HANDLER_SIZE;
1400: :
1401: 2 cells ;
1402:
1403: threading-method -- n gforth threading_method
1404: ""0 if the engine is direct threaded. Note that this may change during
1405: the lifetime of an image.""
1406: #if defined(DOUBLY_INDIRECT)
1407: n=2;
1408: #else
1409: # if defined(DIRECT_THREADED)
1410: n=0;
1411: # else
1412: n=1;
1413: # endif
1414: #endif
1415: :
1416: 1 ;
1417:
1418: \f[THEN]
1419:
1420: key-file wfileid -- n gforth paren_key_file
1421: #ifdef HAS_FILE
1422: fflush(stdout);
1423: n = key((FILE*)wfileid);
1424: #else
1425: n = key(stdin);
1426: #endif
1427:
1428: key?-file wfileid -- n facility key_q_file
1429: #ifdef HAS_FILE
1430: fflush(stdout);
1431: n = key_query((FILE*)wfileid);
1432: #else
1433: n = key_query(stdin);
1434: #endif
1435:
1436: \+os
1437:
1438: stdin -- wfileid gforth
1439: wfileid = (Cell)stdin;
1440:
1441: stdout -- wfileid gforth
1442: wfileid = (Cell)stdout;
1443:
1444: stderr -- wfileid gforth
1445: wfileid = (Cell)stderr;
1446:
1447: form -- urows ucols gforth
1448: ""The number of lines and columns in the terminal. These numbers may change
1449: with the window size.""
1450: /* we could block SIGWINCH here to get a consistent size, but I don't
1451: think this is necessary or always beneficial */
1452: urows=rows;
1453: ucols=cols;
1454:
1455: flush-icache c_addr u -- gforth flush_icache
1456: ""Make sure that the instruction cache of the processor (if there is
1457: one) does not contain stale data at @i{c-addr} and @i{u} bytes
1458: afterwards. @code{END-CODE} performs a @code{flush-icache}
1459: automatically. Caveat: @code{flush-icache} might not work on your
1460: installation; this is usually the case if direct threading is not
1461: supported on your machine (take a look at your @file{machine.h}) and
1462: your machine has a separate instruction cache. In such cases,
1463: @code{flush-icache} does nothing instead of flushing the instruction
1464: cache.""
1465: FLUSH_ICACHE(c_addr,u);
1466:
1467: (bye) n -- gforth paren_bye
1468: return (Label *)n;
1469:
1470: (system) c_addr u -- wretval wior gforth peren_system
1471: #ifndef MSDOS
1472: int old_tp=terminal_prepped;
1473: deprep_terminal();
1474: #endif
1475: wretval=system(cstr(c_addr,u,1)); /* ~ expansion on first part of string? */
1476: wior = IOR(wretval==-1 || (wretval==127 && errno != 0));
1477: #ifndef MSDOS
1478: if (old_tp)
1479: prep_terminal();
1480: #endif
1481:
1482: getenv c_addr1 u1 -- c_addr2 u2 gforth
1483: ""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2}
1484: is the host operating system's expansion of that environment variable. If the
1485: environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters
1486: in length.""
1487: c_addr2 = getenv(cstr(c_addr1,u1,1));
1488: u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2));
1489:
1490: open-pipe c_addr u ntype -- wfileid wior gforth open_pipe
1491: wfileid=(Cell)popen(cstr(c_addr,u,1),fileattr[ntype]); /* ~ expansion of 1st arg? */
1492: wior = IOR(wfileid==0); /* !! the man page says that errno is not set reliably */
1493:
1494: close-pipe wfileid -- wretval wior gforth close_pipe
1495: wretval = pclose((FILE *)wfileid);
1496: wior = IOR(wretval==-1);
1497:
1498: time&date -- nsec nmin nhour nday nmonth nyear facility-ext time_and_date
1499: struct timeval time1;
1500: struct timezone zone1;
1501: struct tm *ltime;
1502: gettimeofday(&time1,&zone1);
1503: ltime=localtime((time_t *)&time1.tv_sec);
1504: nyear =ltime->tm_year+1900;
1505: nmonth=ltime->tm_mon+1;
1506: nday =ltime->tm_mday;
1507: nhour =ltime->tm_hour;
1508: nmin =ltime->tm_min;
1509: nsec =ltime->tm_sec;
1510:
1511: ms n -- facility-ext
1512: struct timeval timeout;
1513: timeout.tv_sec=n/1000;
1514: timeout.tv_usec=1000*(n%1000);
1515: (void)select(0,0,0,0,&timeout);
1516:
1517: allocate u -- a_addr wior memory
1518: ""Allocate @i{u} address units of contiguous data space. The initial
1519: contents of the data space is undefined. If the allocation is successful,
1520: @i{a-addr} is the start address of the allocated region and @i{wior}
1521: is 0. If the allocation fails, @i{a-addr} is undefined and @i{wior}
1522: is an implementation-defined I/O result code.""
1523: a_addr = (Cell *)malloc(u?u:1);
1524: wior = IOR(a_addr==NULL);
1525:
1526: free a_addr -- wior memory
1527: ""Return the region of data space starting at @i{a-addr} to the system.
1528: The regon must originally have been obtained using @code{allocate} or
1529: @code{resize}. If the operational is successful, @i{wior} is 0.
1530: If the operation fails, @i{wior} is an implementation-defined
1531: I/O result code.""
1532: free(a_addr);
1533: wior = 0;
1534:
1535: resize a_addr1 u -- a_addr2 wior memory
1536: ""Change the size of the allocated area at @i{a-addr1} to @i{u}
1537: address units, possibly moving the contents to a different
1538: area. @i{a-addr2} is the address of the resulting area.
1539: If the operational is successful, @i{wior} is 0.
1540: If the operation fails, @i{wior} is an implementation-defined
1541: I/O result code. If @i{a-addr1} is 0, Gforth's (but not the Standard)
1542: @code{resize} @code{allocate}s @i{u} address units.""
1543: /* the following check is not necessary on most OSs, but it is needed
1544: on SunOS 4.1.2. */
1545: if (a_addr1==NULL)
1546: a_addr2 = (Cell *)malloc(u);
1547: else
1548: a_addr2 = (Cell *)realloc(a_addr1, u);
1549: wior = IOR(a_addr2==NULL); /* !! Define a return code */
1550:
1551: strerror n -- c_addr u gforth
1552: c_addr = strerror(n);
1553: u = strlen(c_addr);
1554:
1555: strsignal n -- c_addr u gforth
1556: c_addr = strsignal(n);
1557: u = strlen(c_addr);
1558:
1559: call-c w -- gforth call_c
1560: ""Call the C function pointed to by @i{w}. The C function has to
1561: access the stack itself. The stack pointers are exported in the global
1562: variables @code{SP} and @code{FP}.""
1563: /* This is a first attempt at support for calls to C. This may change in
1564: the future */
1565: IF_FTOS(fp[0]=FTOS);
1566: FP=fp;
1567: SP=sp;
1568: ((void (*)())w)();
1569: sp=SP;
1570: fp=FP;
1571: IF_TOS(TOS=sp[0]);
1572: IF_FTOS(FTOS=fp[0]);
1573:
1574: \+
1575: \+file
1576:
1577: close-file wfileid -- wior file close_file
1578: wior = IOR(fclose((FILE *)wfileid)==EOF);
1579:
1580: open-file c_addr u ntype -- wfileid wior file open_file
1581: wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[ntype]);
1582: #if defined(GO32) && defined(MSDOS)
1583: if(wfileid && !(ntype & 1))
1584: setbuf((FILE*)wfileid, NULL);
1585: #endif
1586: wior = IOR(wfileid == 0);
1587:
1588: create-file c_addr u ntype -- wfileid wior file create_file
1589: Cell fd;
1590: fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[ntype], 0666);
1591: if (fd != -1) {
1592: wfileid = (Cell)fdopen(fd, fileattr[ntype]);
1593: #if defined(GO32) && defined(MSDOS)
1594: if(wfileid && !(ntype & 1))
1595: setbuf((FILE*)wfileid, NULL);
1596: #endif
1597: wior = IOR(wfileid == 0);
1598: } else {
1599: wfileid = 0;
1600: wior = IOR(1);
1601: }
1602:
1603: delete-file c_addr u -- wior file delete_file
1604: wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1);
1605:
1606: rename-file c_addr1 u1 c_addr2 u2 -- wior file-ext rename_file
1607: ""Rename file @i{c_addr1 u1} to new name @i{c_addr2 u2}""
1608: char *s1=tilde_cstr(c_addr2, u2, 1);
1609: wior = IOR(rename(tilde_cstr(c_addr1, u1, 0), s1)==-1);
1610:
1611: file-position wfileid -- ud wior file file_position
1612: /* !! use tell and lseek? */
1613: ud = LONG2UD(ftell((FILE *)wfileid));
1614: wior = IOR(UD2LONG(ud)==-1);
1615:
1616: reposition-file ud wfileid -- wior file reposition_file
1617: wior = IOR(fseek((FILE *)wfileid, UD2LONG(ud), SEEK_SET)==-1);
1618:
1619: file-size wfileid -- ud wior file file_size
1620: struct stat buf;
1621: wior = IOR(fstat(fileno((FILE *)wfileid), &buf)==-1);
1622: ud = LONG2UD(buf.st_size);
1623:
1624: resize-file ud wfileid -- wior file resize_file
1625: wior = IOR(ftruncate(fileno((FILE *)wfileid), UD2LONG(ud))==-1);
1626:
1627: read-file c_addr u1 wfileid -- u2 wior file read_file
1628: /* !! fread does not guarantee enough */
1629: u2 = fread(c_addr, sizeof(Char), u1, (FILE *)wfileid);
1630: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
1631: /* !! is the value of ferror errno-compatible? */
1632: if (wior)
1633: clearerr((FILE *)wfileid);
1634:
1635: read-line c_addr u1 wfileid -- u2 flag wior file read_line
1636: /*
1637: Cell c;
1638: flag=-1;
1639: for(u2=0; u2<u1; u2++)
1640: {
1641: *c_addr++ = (Char)(c = getc((FILE *)wfileid));
1642: if(c=='\n') break;
1643: if(c==EOF)
1644: {
1645: flag=FLAG(u2!=0);
1646: break;
1647: }
1648: }
1649: wior=FILEIO(ferror((FILE *)wfileid));
1650: */
1651: if ((flag=FLAG(!feof((FILE *)wfileid) &&
1652: fgets(c_addr,u1+1,(FILE *)wfileid) != NULL))) {
1653: wior=FILEIO(ferror((FILE *)wfileid)!=0); /* !! ior? */
1654: if (wior)
1655: clearerr((FILE *)wfileid);
1656: u2 = strlen(c_addr);
1657: u2-=((u2>0) && (c_addr[u2-1]==NEWLINE));
1658: }
1659: else {
1660: wior=0;
1661: u2=0;
1662: }
1663:
1664: \+
1665:
1666: write-file c_addr u1 wfileid -- wior file write_file
1667: /* !! fwrite does not guarantee enough */
1668: #ifdef HAS_FILE
1669: {
1670: UCell u2 = fwrite(c_addr, sizeof(Char), u1, (FILE *)wfileid);
1671: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
1672: if (wior)
1673: clearerr((FILE *)wfileid);
1674: }
1675: #else
1676: TYPE(c_addr, u1);
1677: #endif
1678:
1679: emit-file c wfileid -- wior gforth emit_file
1680: #ifdef HAS_FILE
1681: wior = FILEIO(putc(c, (FILE *)wfileid)==EOF);
1682: if (wior)
1683: clearerr((FILE *)wfileid);
1684: #else
1685: PUTC(c);
1686: #endif
1687:
1688: \+file
1689:
1690: flush-file wfileid -- wior file-ext flush_file
1691: wior = IOR(fflush((FILE *) wfileid)==EOF);
1692:
1693: file-status c_addr u -- ntype wior file-ext file_status
1694: char *filename=tilde_cstr(c_addr, u, 1);
1695: if (access (filename, F_OK) != 0) {
1696: ntype=0;
1697: wior=IOR(1);
1698: }
1699: else if (access (filename, R_OK | W_OK) == 0) {
1700: ntype=2; /* r/w */
1701: wior=0;
1702: }
1703: else if (access (filename, R_OK) == 0) {
1704: ntype=0; /* r/o */
1705: wior=0;
1706: }
1707: else if (access (filename, W_OK) == 0) {
1708: ntype=4; /* w/o */
1709: wior=0;
1710: }
1711: else {
1712: ntype=1; /* well, we cannot access the file, but better deliver a legal
1713: access mode (r/o bin), so we get a decent error later upon open. */
1714: wior=0;
1715: }
1716:
1717: \+
1718: \+floating
1719:
1720: comparisons(f, r1 r2, f_, r1, r2, gforth, gforth, float, gforth)
1721: comparisons(f0, r, f_zero_, r, 0., float, gforth, float, gforth)
1722:
1723: d>f d -- r float d_to_f
1724: #ifdef BUGGY_LONG_LONG
1725: extern double ldexp(double x, int exp);
1726: r = ldexp((Float)d.hi,CELL_BITS) + (Float)d.lo;
1727: #else
1728: r = d;
1729: #endif
1730:
1731: f>d r -- d float f_to_d
1732: #ifdef BUGGY_LONG_LONG
1733: d.hi = ldexp(r,-(int)(CELL_BITS)) - (r<0);
1734: d.lo = r-ldexp((Float)d.hi,CELL_BITS);
1735: #else
1736: d = r;
1737: #endif
1738:
1739: f! r f_addr -- float f_store
1740: "" Store the floating-point value @i{r} to address @i{f-addr}.""
1741: *f_addr = r;
1742:
1743: f@ f_addr -- r float f_fetch
1744: "" Fetch floating-point value @i{r} from address @i{f-addr}.""
1745: r = *f_addr;
1746:
1747: df@ df_addr -- r float-ext d_f_fetch
1748: "" Fetch the double-precision IEEE floating-point value @i{r} from the address @i{df-addr}.""
1749: #ifdef IEEE_FP
1750: r = *df_addr;
1751: #else
1752: !! df@
1753: #endif
1754:
1755: df! r df_addr -- float-ext d_f_store
1756: "" Store the double-precision IEEE floating-point value @i{r} to the address @i{df-addr}.""
1757: #ifdef IEEE_FP
1758: *df_addr = r;
1759: #else
1760: !! df!
1761: #endif
1762:
1763: sf@ sf_addr -- r float-ext s_f_fetch
1764: "" Fetch the single-precision IEEE floating-point value @i{r} from the address @i{sf-addr}.""
1765: #ifdef IEEE_FP
1766: r = *sf_addr;
1767: #else
1768: !! sf@
1769: #endif
1770:
1771: sf! r sf_addr -- float-ext s_f_store
1772: "" Store the single-precision IEEE floating-point value @i{r} to the address @i{sf-addr}.""
1773: #ifdef IEEE_FP
1774: *sf_addr = r;
1775: #else
1776: !! sf!
1777: #endif
1778:
1779: f+ r1 r2 -- r3 float f_plus
1780: r3 = r1+r2;
1781:
1782: f- r1 r2 -- r3 float f_minus
1783: r3 = r1-r2;
1784:
1785: f* r1 r2 -- r3 float f_star
1786: r3 = r1*r2;
1787:
1788: f/ r1 r2 -- r3 float f_slash
1789: r3 = r1/r2;
1790:
1791: f** r1 r2 -- r3 float-ext f_star_star
1792: ""@i{r3} is @i{r1} raised to the @i{r2}th power.""
1793: r3 = pow(r1,r2);
1794:
1795: fnegate r1 -- r2 float f_negate
1796: r2 = - r1;
1797:
1798: fdrop r -- float f_drop
1799:
1800: fdup r -- r r float f_dupe
1801:
1802: fswap r1 r2 -- r2 r1 float f_swap
1803:
1804: fover r1 r2 -- r1 r2 r1 float f_over
1805:
1806: frot r1 r2 r3 -- r2 r3 r1 float f_rote
1807:
1808: fnip r1 r2 -- r2 gforth f_nip
1809:
1810: ftuck r1 r2 -- r2 r1 r2 gforth f_tuck
1811:
1812: float+ f_addr1 -- f_addr2 float float_plus
1813: "" Increment @i{f-addr1} by the number of address units corresponding to the size of
1814: one floating-point number, to give @i{f-addr2}.""
1815: f_addr2 = f_addr1+1;
1816:
1817: floats n1 -- n2 float
1818: ""@i{n2} is the number of address units corresponding to @i{n1} floating-point numbers.""
1819: n2 = n1*sizeof(Float);
1820:
1821: floor r1 -- r2 float
1822: ""Round towards the next smaller integral value, i.e., round toward negative infinity.""
1823: /* !! unclear wording */
1824: r2 = floor(r1);
1825:
1826: fround r1 -- r2 float f_round
1827: ""Round to the nearest integral value.""
1828: /* !! unclear wording */
1829: #ifdef HAVE_RINT
1830: r2 = rint(r1);
1831: #else
1832: r2 = floor(r1+0.5);
1833: /* !! This is not quite true to the rounding rules given in the standard */
1834: #endif
1835:
1836: fmax r1 r2 -- r3 float f_max
1837: if (r1<r2)
1838: r3 = r2;
1839: else
1840: r3 = r1;
1841:
1842: fmin r1 r2 -- r3 float f_min
1843: if (r1<r2)
1844: r3 = r1;
1845: else
1846: r3 = r2;
1847:
1848: represent r c_addr u -- n f1 f2 float
1849: char *sig;
1850: int flag;
1851: int decpt;
1852: sig=ecvt(r, u, &decpt, &flag);
1853: n=(r==0 ? 1 : decpt);
1854: f1=FLAG(flag!=0);
1855: f2=FLAG(isdigit((unsigned)(sig[0]))!=0);
1856: memmove(c_addr,sig,u);
1857:
1858: >float c_addr u -- flag float to_float
1859: ""Attempt to convert the character string @i{c-addr u} to
1860: internal floating-point representation. If the string
1861: represents a valid floating-point number @i{r} is placed
1862: on the floating-point stack and @i{flag} is true. Otherwise,
1863: @i{flag} is false. A string of blanks is a special case
1864: and represents the floating-point number 0.""
1865: /* real signature: c_addr u -- r t / f */
1866: Float r;
1867: char *number=cstr(c_addr, u, 1);
1868: char *endconv;
1869: int sign = 0;
1870: if(number[0]=='-') {
1871: sign = 1;
1872: number++;
1873: u--;
1874: }
1875: while(isspace((unsigned)(number[--u])) && u>0);
1876: switch(number[u])
1877: {
1878: case 'd':
1879: case 'D':
1880: case 'e':
1881: case 'E': break;
1882: default : u++; break;
1883: }
1884: number[u]='\0';
1885: r=strtod(number,&endconv);
1886: if((flag=FLAG(!(Cell)*endconv)))
1887: {
1888: IF_FTOS(fp[0] = FTOS);
1889: fp += -1;
1890: FTOS = sign ? -r : r;
1891: }
1892: else if(*endconv=='d' || *endconv=='D')
1893: {
1894: *endconv='E';
1895: r=strtod(number,&endconv);
1896: if((flag=FLAG(!(Cell)*endconv)))
1897: {
1898: IF_FTOS(fp[0] = FTOS);
1899: fp += -1;
1900: FTOS = sign ? -r : r;
1901: }
1902: }
1903:
1904: fabs r1 -- r2 float-ext f_abs
1905: r2 = fabs(r1);
1906:
1907: facos r1 -- r2 float-ext f_a_cos
1908: r2 = acos(r1);
1909:
1910: fasin r1 -- r2 float-ext f_a_sine
1911: r2 = asin(r1);
1912:
1913: fatan r1 -- r2 float-ext f_a_tan
1914: r2 = atan(r1);
1915:
1916: fatan2 r1 r2 -- r3 float-ext f_a_tan_two
1917: ""@i{r1/r2}=tan(@i{r3}). ANS Forth does not require, but probably
1918: intends this to be the inverse of @code{fsincos}. In gforth it is.""
1919: r3 = atan2(r1,r2);
1920:
1921: fcos r1 -- r2 float-ext f_cos
1922: r2 = cos(r1);
1923:
1924: fexp r1 -- r2 float-ext f_e_x_p
1925: r2 = exp(r1);
1926:
1927: fexpm1 r1 -- r2 float-ext f_e_x_p_m_one
1928: ""@i{r2}=@i{e}**@i{r1}@minus{}1""
1929: #ifdef HAVE_EXPM1
1930: extern double
1931: #ifdef NeXT
1932: const
1933: #endif
1934: expm1(double);
1935: r2 = expm1(r1);
1936: #else
1937: r2 = exp(r1)-1.;
1938: #endif
1939:
1940: fln r1 -- r2 float-ext f_l_n
1941: r2 = log(r1);
1942:
1943: flnp1 r1 -- r2 float-ext f_l_n_p_one
1944: ""@i{r2}=ln(@i{r1}+1)""
1945: #ifdef HAVE_LOG1P
1946: extern double
1947: #ifdef NeXT
1948: const
1949: #endif
1950: log1p(double);
1951: r2 = log1p(r1);
1952: #else
1953: r2 = log(r1+1.);
1954: #endif
1955:
1956: flog r1 -- r2 float-ext f_log
1957: ""The decimal logarithm.""
1958: r2 = log10(r1);
1959:
1960: falog r1 -- r2 float-ext f_a_log
1961: ""@i{r2}=10**@i{r1}""
1962: extern double pow10(double);
1963: r2 = pow10(r1);
1964:
1965: fsin r1 -- r2 float-ext f_sine
1966: r2 = sin(r1);
1967:
1968: fsincos r1 -- r2 r3 float-ext f_sine_cos
1969: ""@i{r2}=sin(@i{r1}), @i{r3}=cos(@i{r1})""
1970: r2 = sin(r1);
1971: r3 = cos(r1);
1972:
1973: fsqrt r1 -- r2 float-ext f_square_root
1974: r2 = sqrt(r1);
1975:
1976: ftan r1 -- r2 float-ext f_tan
1977: r2 = tan(r1);
1978: :
1979: fsincos f/ ;
1980:
1981: fsinh r1 -- r2 float-ext f_cinch
1982: r2 = sinh(r1);
1983: :
1984: fexpm1 fdup fdup 1. d>f f+ f/ f+ f2/ ;
1985:
1986: fcosh r1 -- r2 float-ext f_cosh
1987: r2 = cosh(r1);
1988: :
1989: fexp fdup 1/f f+ f2/ ;
1990:
1991: ftanh r1 -- r2 float-ext f_tan_h
1992: r2 = tanh(r1);
1993: :
1994: f2* fexpm1 fdup 2. d>f f+ f/ ;
1995:
1996: fasinh r1 -- r2 float-ext f_a_cinch
1997: r2 = asinh(r1);
1998: :
1999: fdup fdup f* 1. d>f f+ fsqrt f/ fatanh ;
2000:
2001: facosh r1 -- r2 float-ext f_a_cosh
2002: r2 = acosh(r1);
2003: :
2004: fdup fdup f* 1. d>f f- fsqrt f+ fln ;
2005:
2006: fatanh r1 -- r2 float-ext f_a_tan_h
2007: r2 = atanh(r1);
2008: :
2009: fdup f0< >r fabs 1. d>f fover f- f/ f2* flnp1 f2/
2010: r> IF fnegate THEN ;
2011:
2012: sfloats n1 -- n2 float-ext s_floats
2013: ""@i{n2} is the number of address units corresponding to @i{n1}
2014: single-precision IEEE floating-point numbers.""
2015: n2 = n1*sizeof(SFloat);
2016:
2017: dfloats n1 -- n2 float-ext d_floats
2018: ""@i{n2} is the number of address units corresponding to @i{n1}
2019: double-precision IEEE floating-point numbers.""
2020: n2 = n1*sizeof(DFloat);
2021:
2022: sfaligned c_addr -- sf_addr float-ext s_f_aligned
2023: "" @i{sf-addr} is the first single-float-aligned address greater
2024: than or equal to @i{c-addr}.""
2025: sf_addr = (SFloat *)((((Cell)c_addr)+(sizeof(SFloat)-1))&(-sizeof(SFloat)));
2026: :
2027: [ 1 sfloats 1- ] Literal + [ -1 sfloats ] Literal and ;
2028:
2029: dfaligned c_addr -- df_addr float-ext d_f_aligned
2030: "" @i{df-addr} is the first double-float-aligned address greater
2031: than or equal to @i{c-addr}.""
2032: df_addr = (DFloat *)((((Cell)c_addr)+(sizeof(DFloat)-1))&(-sizeof(DFloat)));
2033: :
2034: [ 1 dfloats 1- ] Literal + [ -1 dfloats ] Literal and ;
2035:
2036: \ The following words access machine/OS/installation-dependent
2037: \ Gforth internals
2038: \ !! how about environmental queries DIRECT-THREADED,
2039: \ INDIRECT-THREADED, TOS-CACHED, FTOS-CACHED, CODEFIELD-DOES */
2040:
2041: \ local variable implementation primitives
2042: \+
2043: \+glocals
2044:
2045: @local# -- w gforth fetch_local_number
2046: w = *(Cell *)(lp+(Cell)NEXT_INST);
2047: INC_IP(1);
2048:
2049: @local0 -- w new fetch_local_zero
2050: w = *(Cell *)(lp+0*sizeof(Cell));
2051:
2052: @local1 -- w new fetch_local_four
2053: w = *(Cell *)(lp+1*sizeof(Cell));
2054:
2055: @local2 -- w new fetch_local_eight
2056: w = *(Cell *)(lp+2*sizeof(Cell));
2057:
2058: @local3 -- w new fetch_local_twelve
2059: w = *(Cell *)(lp+3*sizeof(Cell));
2060:
2061: \+floating
2062:
2063: f@local# -- r gforth f_fetch_local_number
2064: r = *(Float *)(lp+(Cell)NEXT_INST);
2065: INC_IP(1);
2066:
2067: f@local0 -- r new f_fetch_local_zero
2068: r = *(Float *)(lp+0*sizeof(Float));
2069:
2070: f@local1 -- r new f_fetch_local_eight
2071: r = *(Float *)(lp+1*sizeof(Float));
2072:
2073: \+
2074:
2075: laddr# -- c_addr gforth laddr_number
2076: /* this can also be used to implement lp@ */
2077: c_addr = (Char *)(lp+(Cell)NEXT_INST);
2078: INC_IP(1);
2079:
2080: lp+!# -- gforth lp_plus_store_number
2081: ""used with negative immediate values it allocates memory on the
2082: local stack, a positive immediate argument drops memory from the local
2083: stack""
2084: lp += (Cell)NEXT_INST;
2085: INC_IP(1);
2086:
2087: lp- -- new minus_four_lp_plus_store
2088: lp += -sizeof(Cell);
2089:
2090: lp+ -- new eight_lp_plus_store
2091: lp += sizeof(Float);
2092:
2093: lp+2 -- new sixteen_lp_plus_store
2094: lp += 2*sizeof(Float);
2095:
2096: lp! c_addr -- gforth lp_store
2097: lp = (Address)c_addr;
2098:
2099: >l w -- gforth to_l
2100: lp -= sizeof(Cell);
2101: *(Cell *)lp = w;
2102:
2103: \+floating
2104:
2105: f>l r -- gforth f_to_l
2106: lp -= sizeof(Float);
2107: *(Float *)lp = r;
2108:
2109: fpick u -- r gforth
2110: r = fp[u+1]; /* +1, because update of fp happens before this fragment */
2111: :
2112: floats fp@ + f@ ;
2113:
2114: \+
2115: \+
2116:
2117: \+OS
2118:
2119: define(`uploop',
2120: `pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')')
2121: define(`_uploop',
2122: `ifelse($1, `$3', `$5',
2123: `$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')')
2124: \ argflist(argnum): Forth argument list
2125: define(argflist,
2126: `ifelse($1, 0, `',
2127: `uploop(`_i', 1, $1, `format(`u%d ', _i)', `format(`u%d ', _i)')')')
2128: \ argdlist(argnum): declare C's arguments
2129: define(argdlist,
2130: `ifelse($1, 0, `',
2131: `uploop(`_i', 1, $1, `Cell, ', `Cell')')')
2132: \ argclist(argnum): pass C's arguments
2133: define(argclist,
2134: `ifelse($1, 0, `',
2135: `uploop(`_i', 1, $1, `format(`u%d, ', _i)', `format(`u%d', _i)')')')
2136: \ icall(argnum)
2137: define(icall,
2138: `icall$1 argflist($1)u -- uret gforth
2139: uret = (SYSCALL(Cell(*)(argdlist($1)))u)(argclist($1));
2140:
2141: ')
2142: define(fcall,
2143: `fcall$1 argflist($1)u -- rret gforth
2144: rret = (SYSCALL(Float(*)(argdlist($1)))u)(argclist($1));
2145:
2146: ')
2147:
2148:
2149: open-lib c_addr1 u1 -- u2 gforth open_lib
2150: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
2151: #ifndef RTLD_GLOBAL
2152: #define RTLD_GLOBAL 0
2153: #endif
2154: u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY);
2155: #else
2156: # ifdef _WIN32
2157: u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1));
2158: # else
2159: #warning Define open-lib!
2160: u2 = 0;
2161: # endif
2162: #endif
2163:
2164: lib-sym c_addr1 u1 u2 -- u3 gforth lib_sym
2165: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
2166: u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1));
2167: #else
2168: # ifdef _WIN32
2169: u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1));
2170: # else
2171: #warning Define lib-sym!
2172: u3 = 0;
2173: # endif
2174: #endif
2175:
2176: uploop(i, 0, 7, `icall(i)')
2177: icall(20)
2178: uploop(i, 0, 7, `fcall(i)')
2179: fcall(20)
2180:
2181: \+
2182:
2183: up! a_addr -- gforth up_store
2184: UP=up=(char *)a_addr;
2185: :
2186: up ! ;
2187: Variable UP
2188:
2189: wcall u -- gforth
2190: IF_FTOS(fp[0]=FTOS);
2191: FP=fp;
2192: sp=(SYSCALL(Cell(*)(Cell *, void *))u)(sp, &FP);
2193: fp=FP;
2194: IF_TOS(TOS=sp[0];)
2195: IF_FTOS(FTOS=fp[0]);
2196:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>