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