Annotation of gforth/prim, revision 1.47
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: \
1.47 ! anton 29: \ forth name ( stack effect ) category [pronunciation]
1.1 anton 30: \ [""glossary entry""]
31: \ C code
32: \ [:
33: \ Forth code]
34: \
1.47 ! anton 35: \ Note: Fields in brackets are optional. Word specifications have to
! 36: \ be separated by at least one empty line
1.1 anton 37: \
38: \ Both pronounciation and stack items (in the stack effect) must
39: \ conform to the C name syntax or the C compiler will complain.
40: \
41: \
42: \ These specifications are automatically translated into C-code for the
43: \ interpreter and into some other files. I hope that your C compiler has
44: \ decent optimization, otherwise the automatically generated code will
45: \ be somewhat slow. The Forth version of the code is included for manual
46: \ compilers, so they will need to compile only the important words.
47: \
48: \ Note that stack pointer adjustment is performed according to stack
49: \ effect by automatically generated code and NEXT is automatically
50: \ appended to the C code. Also, you can use the names in the stack
51: \ effect in the C code. Stack access is automatic. One exception: if
52: \ your code does not fall through, the results are not stored into the
53: \ stack. Use different names on both sides of the '--', if you change a
54: \ value (some stores to the stack are optimized away).
55: \
56: \
57: \
58: \ The stack variables have the following types:
59: \
60: \ name matches type
61: \ f.* Bool
62: \ c.* Char
63: \ [nw].* Cell
64: \ u.* UCell
65: \ d.* DCell
66: \ ud.* UDCell
67: \ r.* Float
68: \ a_.* Cell *
69: \ c_.* Char *
70: \ f_.* Float *
71: \ df_.* DFloat *
72: \ sf_.* SFloat *
73: \ xt.* XT
74: \ wid.* WID
75: \ f83name.* F83Name *
76: \
77: \
78: \
79: \ In addition the following names can be used:
80: \ ip the instruction pointer
81: \ sp the data stack pointer
82: \ rp the parameter stack pointer
83: \ lp the locals stack pointer
84: \ NEXT executes NEXT
85: \ cfa
86: \ NEXT1 executes NEXT1
87: \ FLAG(x) makes a Forth flag from a C flag
88: \
89: \
90: \
91: \ Percentages in comments are from Koopmans book: average/maximum use
92: \ (taken from four, not very representative benchmarks)
93: \
94: \
95: \
96: \ To do:
97: \
98: \ throw execute, cfa and NEXT1 out?
99: \ macroize *ip, ip++, *ip++ (pipelining)?
100:
101: \ these m4 macros would collide with identifiers
102: undefine(`index')
103: undefine(`shift')
104:
1.47 ! anton 105: noop ( -- ) gforth
1.1 anton 106: ;
107: :
108: ;
109:
1.47 ! anton 110: lit ( -- w ) gforth
1.1 anton 111: w = (Cell)NEXT_INST;
112: INC_IP(1);
113: :
114: r> dup @ swap cell+ >r ;
115:
1.47 ! anton 116: execute ( xt -- ) core
1.29 crook 117: ""Perform the semantics represented by the execution token, @i{xt}.""
1.1 anton 118: ip=IP;
119: IF_TOS(TOS = sp[0]);
120: EXEC(xt);
121:
1.47 ! anton 122: perform ( a_addr -- ) gforth
1.22 crook 123: ""Equivalent to @code{@ execute}.""
1.1 anton 124: /* and pfe */
125: ip=IP;
126: IF_TOS(TOS = sp[0]);
127: EXEC(*(Xt *)a_addr);
128: :
129: @ execute ;
130:
1.31 jwilke 131: \fhas? skipbranchprims 0= [IF]
1.15 pazsan 132: \+glocals
1.1 anton 133:
1.47 ! anton 134: branch-lp+!# ( -- ) gforth branch_lp_plus_store_number
1.1 anton 135: /* this will probably not be used */
136: branch_adjust_lp:
137: lp += (Cell)(IP[1]);
138: goto branch;
139:
1.15 pazsan 140: \+
1.1 anton 141:
1.47 ! anton 142: branch ( -- ) gforth
1.1 anton 143: branch:
1.23 anton 144: SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST));
1.1 anton 145: :
146: r> dup @ + >r ;
147:
148: \ condbranch(forthname,restline,code,forthcode)
149: \ this is non-syntactical: code must open a brace that is closed by the macro
150: define(condbranch,
151: $1 $2
1.23 anton 152: $3 SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST));
1.1 anton 153: NEXT;
154: }
155: else
156: INC_IP(1);
157: $4
158:
1.15 pazsan 159: \+glocals
1.1 anton 160:
161: $1-lp+!# $2_lp_plus_store_number
162: $3 goto branch_adjust_lp;
163: }
164: else
165: INC_IP(2);
166:
1.15 pazsan 167: \+
1.1 anton 168: )
169:
1.47 ! anton 170: condbranch(?branch,( f -- ) f83 question_branch,
1.1 anton 171: if (f==0) {
172: IF_TOS(TOS = sp[0]);
1.5 jwilke 173: ,:
174: 0= dup \ !f !f
175: r> dup @ \ !f !f IP branchoffset
176: rot and + \ !f IP|IP+branchoffset
177: swap 0= cell and + \ IP''
178: >r ;)
1.1 anton 179:
180: \ we don't need an lp_plus_store version of the ?dup-stuff, because it
181: \ is only used in if's (yet)
182:
1.15 pazsan 183: \+xconds
1.1 anton 184:
1.47 ! anton 185: ?dup-?branch ( f -- f ) new question_dupe_question_branch
1.1 anton 186: ""The run-time procedure compiled by @code{?DUP-IF}.""
187: if (f==0) {
188: sp++;
189: IF_TOS(TOS = sp[0]);
1.23 anton 190: SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST));
1.1 anton 191: NEXT;
192: }
193: else
194: INC_IP(1);
195:
1.47 ! anton 196: ?dup-0=-?branch ( f -- ) new question_dupe_zero_equals_question_branch
1.1 anton 197: ""The run-time procedure compiled by @code{?DUP-0=-IF}.""
198: /* the approach taken here of declaring the word as having the stack
199: effect ( f -- ) and correcting for it in the branch-taken case costs a
200: few cycles in that case, but is easy to convert to a CONDBRANCH
201: invocation */
202: if (f!=0) {
203: sp--;
1.23 anton 204: SET_IP((Xt *)(((Cell)IP)+(Cell)NEXT_INST));
1.1 anton 205: NEXT;
206: }
207: else
208: INC_IP(1);
209:
1.15 pazsan 210: \+
1.31 jwilke 211: \f[THEN]
212: \fhas? skiploopprims 0= [IF]
1.1 anton 213:
1.47 ! anton 214: condbranch((next),( -- ) cmFORTH paren_next,
1.1 anton 215: if ((*rp)--) {
216: ,:
217: r> r> dup 1- >r
218: IF dup @ + >r ELSE cell+ >r THEN ;)
219:
1.47 ! anton 220: condbranch((loop),( -- ) gforth paren_loop,
1.1 anton 221: Cell index = *rp+1;
222: Cell limit = rp[1];
223: if (index != limit) {
224: *rp = index;
225: ,:
226: r> r> 1+ r> 2dup =
227: IF >r 1- >r cell+ >r
228: ELSE >r >r dup @ + >r THEN ;)
229:
1.47 ! anton 230: condbranch((+loop),( n -- ) gforth paren_plus_loop,
1.1 anton 231: /* !! check this thoroughly */
232: Cell index = *rp;
233: /* sign bit manipulation and test: (x^y)<0 is equivalent to (x<0) != (y<0) */
234: /* dependent upon two's complement arithmetic */
235: Cell olddiff = index-rp[1];
236: if ((olddiff^(olddiff+n))>=0 /* the limit is not crossed */
237: || (olddiff^n)>=0 /* it is a wrap-around effect */) {
238: #ifdef i386
239: *rp += n;
240: #else
241: *rp = index + n;
242: #endif
243: IF_TOS(TOS = sp[0]);
244: ,:
245: r> swap
246: r> r> 2dup - >r
247: 2 pick r@ + r@ xor 0< 0=
248: 3 pick r> xor 0< 0= or
249: IF >r + >r dup @ + >r
250: ELSE >r >r drop cell+ >r THEN ;)
251:
1.15 pazsan 252: \+xconds
1.1 anton 253:
1.47 ! anton 254: condbranch((-loop),( u -- ) gforth paren_minus_loop,
1.1 anton 255: /* !! check this thoroughly */
256: Cell index = *rp;
257: UCell olddiff = index-rp[1];
258: if (olddiff>u) {
259: #ifdef i386
260: *rp -= u;
261: #else
262: *rp = index - u;
263: #endif
264: IF_TOS(TOS = sp[0]);
265: ,)
266:
1.47 ! anton 267: condbranch((s+loop),( n -- ) gforth paren_symmetric_plus_loop,
1.1 anton 268: ""The run-time procedure compiled by S+LOOP. It loops until the index
269: crosses the boundary between limit and limit-sign(n). I.e. a symmetric
270: version of (+LOOP).""
271: /* !! check this thoroughly */
272: Cell index = *rp;
273: Cell diff = index-rp[1];
274: Cell newdiff = diff+n;
275: if (n<0) {
276: diff = -diff;
277: newdiff = -newdiff;
278: }
279: if (diff>=0 || newdiff<0) {
280: #ifdef i386
281: *rp += n;
282: #else
283: *rp = index + n;
284: #endif
285: IF_TOS(TOS = sp[0]);
286: ,)
287:
1.15 pazsan 288: \+
1.1 anton 289:
1.47 ! anton 290: unloop ( -- ) core
1.1 anton 291: rp += 2;
292: :
293: r> rdrop rdrop >r ;
294:
1.47 ! anton 295: (for) ( ncount -- ) cmFORTH paren_for
1.1 anton 296: /* or (for) = >r -- collides with unloop! */
297: *--rp = 0;
298: *--rp = ncount;
299: :
300: r> swap 0 >r >r >r ;
301:
1.47 ! anton 302: (do) ( nlimit nstart -- ) gforth paren_do
1.1 anton 303: /* or do it in high-level? 0.09/0.23% */
304: *--rp = nlimit;
305: *--rp = nstart;
306: :
307: r> swap rot >r >r >r ;
308:
1.47 ! anton 309: (?do) ( nlimit nstart -- ) gforth paren_question_do
1.1 anton 310: *--rp = nlimit;
311: *--rp = nstart;
312: if (nstart == nlimit) {
313: IF_TOS(TOS = sp[0]);
314: goto branch;
315: }
316: else {
317: INC_IP(1);
318: }
319: :
320: 2dup =
321: IF r> swap rot >r >r
322: dup @ + >r
323: ELSE r> swap rot >r >r
324: cell+ >r
325: THEN ; \ --> CORE-EXT
326:
1.15 pazsan 327: \+xconds
1.1 anton 328:
1.47 ! anton 329: (+do) ( nlimit nstart -- ) gforth paren_plus_do
1.1 anton 330: *--rp = nlimit;
331: *--rp = nstart;
332: if (nstart >= nlimit) {
333: IF_TOS(TOS = sp[0]);
334: goto branch;
335: }
336: else {
337: INC_IP(1);
338: }
339: :
340: swap 2dup
341: r> swap >r swap >r
342: >=
343: IF
344: dup @ +
345: ELSE
346: cell+
347: THEN >r ;
348:
1.47 ! anton 349: (u+do) ( ulimit ustart -- ) gforth paren_u_plus_do
1.1 anton 350: *--rp = ulimit;
351: *--rp = ustart;
352: if (ustart >= ulimit) {
353: IF_TOS(TOS = sp[0]);
354: goto branch;
355: }
356: else {
357: INC_IP(1);
358: }
359: :
360: swap 2dup
361: r> swap >r swap >r
362: u>=
363: IF
364: dup @ +
365: ELSE
366: cell+
367: THEN >r ;
368:
1.47 ! anton 369: (-do) ( nlimit nstart -- ) gforth paren_minus_do
1.1 anton 370: *--rp = nlimit;
371: *--rp = nstart;
372: if (nstart <= nlimit) {
373: IF_TOS(TOS = sp[0]);
374: goto branch;
375: }
376: else {
377: INC_IP(1);
378: }
379: :
380: swap 2dup
381: r> swap >r swap >r
382: <=
383: IF
384: dup @ +
385: ELSE
386: cell+
387: THEN >r ;
388:
1.47 ! anton 389: (u-do) ( ulimit ustart -- ) gforth paren_u_minus_do
1.1 anton 390: *--rp = ulimit;
391: *--rp = ustart;
392: if (ustart <= ulimit) {
393: IF_TOS(TOS = sp[0]);
394: goto branch;
395: }
396: else {
397: INC_IP(1);
398: }
399: :
400: swap 2dup
401: r> swap >r swap >r
402: u<=
403: IF
404: dup @ +
405: ELSE
406: cell+
407: THEN >r ;
408:
1.15 pazsan 409: \+
1.1 anton 410:
1.5 jwilke 411: \ don't make any assumptions where the return stack is!!
412: \ implement this in machine code if it should run quickly!
413:
1.47 ! anton 414: i ( -- n ) core
1.1 anton 415: n = *rp;
416: :
1.5 jwilke 417: \ rp@ cell+ @ ;
418: r> r> tuck >r >r ;
1.1 anton 419:
1.47 ! anton 420: i' ( -- w ) gforth i_tick
1.1 anton 421: ""loop end value""
422: w = rp[1];
423: :
1.5 jwilke 424: \ rp@ cell+ cell+ @ ;
425: r> r> r> dup itmp ! >r >r >r itmp @ ;
426: variable itmp
1.1 anton 427:
1.47 ! anton 428: j ( -- n ) core
1.1 anton 429: n = rp[2];
430: :
1.5 jwilke 431: \ rp@ cell+ cell+ cell+ @ ;
432: r> r> r> r> dup itmp ! >r >r >r >r itmp @ ;
433: [IFUNDEF] itmp variable itmp [THEN]
1.1 anton 434:
1.47 ! anton 435: k ( -- n ) gforth
1.1 anton 436: n = rp[4];
437: :
1.5 jwilke 438: \ rp@ [ 5 cells ] Literal + @ ;
439: r> r> r> r> r> r> dup itmp ! >r >r >r >r >r >r itmp @ ;
440: [IFUNDEF] itmp variable itmp [THEN]
1.31 jwilke 441:
442: \f[THEN]
1.1 anton 443:
444: \ digit is high-level: 0/0%
445:
1.47 ! anton 446: move ( c_from c_to ucount -- ) core
1.33 anton 447: ""Copy the contents of @i{ucount} address units at @i{c-from} to
448: @i{c-to}. @code{move} works correctly even if the two areas overlap.""
1.1 anton 449: memmove(c_to,c_from,ucount);
450: /* make an Ifdef for bsd and others? */
451: :
452: >r 2dup u< IF r> cmove> ELSE r> cmove THEN ;
453:
1.47 ! anton 454: cmove ( c_from c_to u -- ) string c_move
1.33 anton 455: ""Copy the contents of @i{ucount} characters from data space at
456: @i{c-from} to @i{c-to}. The copy proceeds @code{char}-by-@code{char}
457: from low address to high address; i.e., for overlapping areas it is
458: safe if @i{c-to}=<@i{c-from}.""
1.1 anton 459: while (u-- > 0)
460: *c_to++ = *c_from++;
461: :
462: bounds ?DO dup c@ I c! 1+ LOOP drop ;
463:
1.47 ! anton 464: cmove> ( c_from c_to u -- ) string c_move_up
1.33 anton 465: ""Copy the contents of @i{ucount} characters from data space at
466: @i{c-from} to @i{c-to}. The copy proceeds @code{char}-by-@code{char}
467: from high address to low address; i.e., for overlapping areas it is
468: safe if @i{c-to}>=@i{c-from}.""
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:
1.47 ! anton 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:
1.47 ! anton 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.""
1.46 pazsan 490: /* close ' to keep fontify happy */
1.1 anton 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: :
1.43 pazsan 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+ ;
1.1 anton 503:
1.47 ! anton 504: -text ( c_addr1 u c_addr2 -- n ) new dash_text
1.1 anton 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 ;
1.43 pazsan 514: : sgn ( n -- -1/0/1 )
515: dup 0= IF EXIT THEN 0< 2* 1+ ;
1.1 anton 516:
1.47 ! anton 517: toupper ( c1 -- c2 ) gforth
1.29 crook 518: ""If @i{c1} is a lower-case character (in the current locale), @i{c2}
1.25 anton 519: is the equivalent upper-case character. All other characters are unchanged.""
1.1 anton 520: c2 = toupper(c1);
521: :
522: dup [char] a - [ char z char a - 1 + ] Literal u< bl and - ;
523:
1.47 ! anton 524: capscomp ( c_addr1 u c_addr2 -- n ) new
1.1 anton 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:
1.47 ! anton 537: -trailing ( c_addr u1 -- c_addr u2 ) string dash_trailing
1.29 crook 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.""
1.1 anton 540: u2 = u1;
1.4 anton 541: while (u2>0 && c_addr[u2-1] == ' ')
1.1 anton 542: u2--;
543: :
544: BEGIN 1- 2dup + c@ bl = WHILE
545: dup 0= UNTIL ELSE 1+ THEN ;
546:
1.47 ! anton 547: /string ( c_addr1 u1 n -- c_addr2 u2 ) string slash_string
1.29 crook 548: ""Adjust the string specified by @i{c-addr1, u1} to remove @i{n}
1.27 crook 549: characters from the start of the string.""
1.1 anton 550: c_addr2 = c_addr1+n;
551: u2 = u1-n;
552: :
553: tuck - >r + r> dup 0< IF - 0 THEN ;
554:
1.47 ! anton 555: + ( n1 n2 -- n ) core plus
1.1 anton 556: n = n1+n2;
557:
558: \ PFE-0.9.14 has it differently, but the next release will have it as follows
1.47 ! anton 559: under+ ( n1 n2 n3 -- n n2 ) gforth under_plus
1.29 crook 560: ""add @i{n3} to @i{n1} (giving @i{n})""
1.1 anton 561: n = n1+n3;
562: :
563: rot + swap ;
564:
1.47 ! anton 565: - ( n1 n2 -- n ) core minus
1.1 anton 566: n = n1-n2;
567: :
568: negate + ;
569:
1.47 ! anton 570: negate ( n1 -- n2 ) core
1.1 anton 571: /* use minus as alias */
572: n2 = -n1;
573: :
574: invert 1+ ;
575:
1.47 ! anton 576: 1+ ( n1 -- n2 ) core one_plus
1.1 anton 577: n2 = n1+1;
578: :
579: 1 + ;
580:
1.47 ! anton 581: 1- ( n1 -- n2 ) core one_minus
1.1 anton 582: n2 = n1-1;
583: :
584: 1 - ;
585:
1.47 ! anton 586: max ( n1 n2 -- n ) core
1.1 anton 587: if (n1<n2)
588: n = n2;
589: else
590: n = n1;
591: :
592: 2dup < IF swap THEN drop ;
593:
1.47 ! anton 594: min ( n1 n2 -- n ) core
1.1 anton 595: if (n1<n2)
596: n = n1;
597: else
598: n = n2;
599: :
600: 2dup > IF swap THEN drop ;
601:
1.47 ! anton 602: abs ( n1 -- n2 ) core
1.1 anton 603: if (n1<0)
604: n2 = -n1;
605: else
606: n2 = n1;
607: :
608: dup 0< IF negate THEN ;
609:
1.47 ! anton 610: * ( n1 n2 -- n ) core star
1.1 anton 611: n = n1*n2;
612: :
613: um* drop ;
614:
1.47 ! anton 615: / ( n1 n2 -- n ) core slash
1.1 anton 616: n = n1/n2;
617: :
618: /mod nip ;
619:
1.47 ! anton 620: mod ( n1 n2 -- n ) core
1.1 anton 621: n = n1%n2;
622: :
623: /mod drop ;
624:
1.47 ! anton 625: /mod ( n1 n2 -- n3 n4 ) core slash_mod
1.1 anton 626: n4 = n1/n2;
627: n3 = n1%n2; /* !! is this correct? look into C standard! */
628: :
629: >r s>d r> fm/mod ;
630:
1.47 ! anton 631: 2* ( n1 -- n2 ) core two_star
1.1 anton 632: n2 = 2*n1;
633: :
634: dup + ;
635:
1.47 ! anton 636: 2/ ( n1 -- n2 ) core two_slash
1.1 anton 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
1.5 jwilke 642: 0 DO 2* swap dup 2* >r MINI and
1.1 anton 643: IF 1 ELSE 0 THEN or r> swap
644: LOOP nip ;
645:
1.47 ! anton 646: fm/mod ( d1 n1 -- n2 n3 ) core f_m_slash_mod
1.29 crook 647: ""Floored division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, @i{n1}>@i{n2}>=0 or 0>=@i{n2}>@i{n1}.""
1.1 anton 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:
1.47 ! anton 668: sm/rem ( d1 n1 -- n2 n3 ) core s_m_slash_rem
1.29 crook 669: ""Symmetric division: @i{d1} = @i{n3}*@i{n1}+@i{n2}, sign(@i{n2})=sign(@i{d1}) or 0.""
1.1 anton 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:
1.47 ! anton 690: m* ( n1 n2 -- d ) core m_star
1.1 anton 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:
1.47 ! anton 701: um* ( u1 u2 -- ud ) core u_m_star
1.1 anton 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:
1.47 ! anton 718: um/mod ( ud u1 -- u2 u3 ) core u_m_slash_mod
1.32 anton 719: ""ud=u3*u1+u2, u1>u2>=0""
1.1 anton 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
1.5 jwilke 730: ?DO /modstep
1.1 anton 731: LOOP drop swap 1 rshift or swap ;
732: : /modstep ( ud c R: u -- ud-?u c R: u )
1.5 jwilke 733: >r over r@ u< 0= or IF r@ - 1 ELSE 0 THEN d2*+ r> ;
1.1 anton 734: : d2*+ ( ud n -- ud+n c )
735: over MINI
736: and >r >r 2dup d+ swap r> + swap r> ;
737:
1.47 ! anton 738: m+ ( d1 n -- d2 ) double m_plus
1.1 anton 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:
1.47 ! anton 748: d+ ( d1 d2 -- d ) double d_plus
1.1 anton 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:
1.47 ! anton 758: d- ( d1 d2 -- d ) double d_minus
1.1 anton 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:
1.47 ! anton 768: dnegate ( d1 -- d2 ) double d_negate
1.1 anton 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:
1.47 ! anton 778: d2* ( d1 -- d2 ) double d_two_star
1.1 anton 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:
1.47 ! anton 788: d2/ ( d1 -- d2 ) double d_two_slash
1.1 anton 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:
1.47 ! anton 799: and ( w1 w2 -- w ) core
1.1 anton 800: w = w1&w2;
801:
1.47 ! anton 802: or ( w1 w2 -- w ) core
1.1 anton 803: w = w1|w2;
804: :
805: invert swap invert and invert ;
806:
1.47 ! anton 807: xor ( w1 w2 -- w ) core x_or
1.1 anton 808: w = w1^w2;
809:
1.47 ! anton 810: invert ( w1 -- w2 ) core
1.1 anton 811: w2 = ~w1;
812: :
813: MAXU xor ;
814:
1.47 ! anton 815: rshift ( u1 n -- u2 ) core r_shift
1.1 anton 816: u2 = u1>>n;
817: :
818: 0 ?DO 2/ MAXI and LOOP ;
819:
1.47 ! anton 820: lshift ( u1 n -- u2 ) core l_shift
1.1 anton 821: u2 = u1<<n;
822: :
823: 0 ?DO 2* LOOP ;
824:
825: \ comparisons(prefix, args, prefix, arg1, arg2, wordsets...)
826: define(comparisons,
1.47 ! anton 827: $1= ( $2 -- f ) $6 $3equals
1.1 anton 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:
1.47 ! anton 836: $1<> ( $2 -- f ) $7 $3not_equals
1.1 anton 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:
1.47 ! anton 845: $1< ( $2 -- f ) $8 $3less_than
1.1 anton 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:
1.47 ! anton 857: $1> ( $2 -- f ) $9 $3greater_than
1.1 anton 858: f = FLAG($4>$5);
859: :
860: [ char $1x char 0 = [IF] ] negate [ [ELSE] ] swap [ [THEN] ]
861: $1< ;
862:
1.47 ! anton 863: $1<= ( $2 -- f ) gforth $3less_or_equal
1.1 anton 864: f = FLAG($4<=$5);
865: :
866: $1> 0= ;
867:
1.47 ! anton 868: $1>= ( $2 -- f ) gforth $3greater_or_equal
1.1 anton 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,
1.47 ! anton 882: $1= ( $2 -- f ) $6 $3equals
1.1 anton 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:
1.47 ! anton 889: $1<> ( $2 -- f ) $7 $3not_equals
1.1 anton 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:
1.47 ! anton 896: $1< ( $2 -- f ) $8 $3less_than
1.1 anton 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:
1.47 ! anton 903: $1> ( $2 -- f ) $9 $3greater_than
1.1 anton 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:
1.47 ! anton 910: $1<= ( $2 -- f ) gforth $3less_or_equal
1.1 anton 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:
1.47 ! anton 917: $1>= ( $2 -- f ) gforth $3greater_or_equal
1.1 anton 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:
1.15 pazsan 926: \+dcomps
1.1 anton 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:
1.15 pazsan 932: \+
1.1 anton 933:
1.47 ! anton 934: within ( u1 u2 u3 -- f ) core-ext
1.32 anton 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.""
1.1 anton 942: f = FLAG(u1-u2 < u3-u2);
943: :
944: over - >r - r> u< ;
945:
1.47 ! anton 946: sp@ ( -- a_addr ) gforth sp_fetch
1.1 anton 947: a_addr = sp+1;
948:
1.47 ! anton 949: sp! ( a_addr -- ) gforth sp_store
1.1 anton 950: sp = a_addr;
951: /* works with and without TOS caching */
952:
1.47 ! anton 953: rp@ ( -- a_addr ) gforth rp_fetch
1.1 anton 954: a_addr = rp;
955:
1.47 ! anton 956: rp! ( a_addr -- ) gforth rp_store
1.1 anton 957: rp = a_addr;
958:
1.15 pazsan 959: \+floating
1.1 anton 960:
1.47 ! anton 961: fp@ ( -- f_addr ) gforth fp_fetch
1.1 anton 962: f_addr = fp;
963:
1.47 ! anton 964: fp! ( f_addr -- ) gforth fp_store
1.1 anton 965: fp = f_addr;
966:
1.15 pazsan 967: \+
1.1 anton 968:
1.47 ! anton 969: ;s ( -- ) gforth semis
1.22 crook 970: ""The primitive compiled by @code{EXIT}.""
1.23 anton 971: SET_IP((Xt *)(*rp++));
1.1 anton 972:
1.47 ! anton 973: >r ( w -- ) core to_r
1.1 anton 974: *--rp = w;
975: :
976: (>r) ;
977: : (>r) rp@ cell+ @ rp@ ! rp@ cell+ ! ;
978:
1.47 ! anton 979: r> ( -- w ) core r_from
1.1 anton 980: w = *rp++;
981: :
982: rp@ cell+ @ rp@ @ rp@ cell+ ! (rdrop) rp@ ! ;
983: Create (rdrop) ' ;s A,
984:
1.47 ! anton 985: rdrop ( -- ) gforth
1.1 anton 986: rp++;
987: :
988: r> r> drop >r ;
989:
1.47 ! anton 990: 2>r ( w1 w2 -- ) core-ext two_to_r
1.1 anton 991: *--rp = w1;
992: *--rp = w2;
993: :
994: swap r> swap >r swap >r >r ;
995:
1.47 ! anton 996: 2r> ( -- w1 w2 ) core-ext two_r_from
1.1 anton 997: w2 = *rp++;
998: w1 = *rp++;
999: :
1000: r> r> swap r> swap >r swap ;
1001:
1.47 ! anton 1002: 2r@ ( -- w1 w2 ) core-ext two_r_fetch
1.1 anton 1003: w2 = rp[0];
1004: w1 = rp[1];
1005: :
1006: i' j ;
1007:
1.47 ! anton 1008: 2rdrop ( -- ) gforth two_r_drop
1.1 anton 1009: rp+=2;
1010: :
1011: r> r> drop r> drop >r ;
1012:
1.47 ! anton 1013: over ( w1 w2 -- w1 w2 w1 ) core
1.1 anton 1014: :
1015: sp@ cell+ @ ;
1016:
1.47 ! anton 1017: drop ( w -- ) core
1.1 anton 1018: :
1019: IF THEN ;
1020:
1.47 ! anton 1021: swap ( w1 w2 -- w2 w1 ) core
1.1 anton 1022: :
1023: >r (swap) ! r> (swap) @ ;
1024: Variable (swap)
1025:
1.47 ! anton 1026: dup ( w -- w w ) core dupe
1.1 anton 1027: :
1028: sp@ @ ;
1029:
1.47 ! anton 1030: rot ( w1 w2 w3 -- w2 w3 w1 ) core rote
1.1 anton 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:
1.47 ! anton 1039: -rot ( w1 w2 w3 -- w3 w1 w2 ) gforth not_rote
1.1 anton 1040: :
1041: rot rot ;
1042:
1.47 ! anton 1043: nip ( w1 w2 -- w2 ) core-ext
1.1 anton 1044: :
1.6 jwilke 1045: swap drop ;
1.1 anton 1046:
1.47 ! anton 1047: tuck ( w1 w2 -- w2 w1 w2 ) core-ext
1.1 anton 1048: :
1049: swap over ;
1050:
1.47 ! anton 1051: ?dup ( w -- w ) core question_dupe
1.1 anton 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:
1.47 ! anton 1061: pick ( u -- w ) core-ext
1.1 anton 1062: w = sp[u+1];
1063: :
1064: 1+ cells sp@ + @ ;
1065:
1.47 ! anton 1066: 2drop ( w1 w2 -- ) core two_drop
1.1 anton 1067: :
1068: drop drop ;
1069:
1.47 ! anton 1070: 2dup ( w1 w2 -- w1 w2 w1 w2 ) core two_dupe
1.1 anton 1071: :
1072: over over ;
1073:
1.47 ! anton 1074: 2over ( w1 w2 w3 w4 -- w1 w2 w3 w4 w1 w2 ) core two_over
1.1 anton 1075: :
1076: 3 pick 3 pick ;
1077:
1.47 ! anton 1078: 2swap ( w1 w2 w3 w4 -- w3 w4 w1 w2 ) core two_swap
1.1 anton 1079: :
1080: rot >r rot r> ;
1081:
1.47 ! anton 1082: 2rot ( w1 w2 w3 w4 w5 w6 -- w3 w4 w5 w6 w1 w2 ) double-ext two_rote
1.1 anton 1083: :
1084: >r >r 2swap r> r> 2swap ;
1085:
1.47 ! anton 1086: 2nip ( w1 w2 w3 w4 -- w3 w4 ) gforth two_nip
1.1 anton 1087: :
1088: 2swap 2drop ;
1089:
1.47 ! anton 1090: 2tuck ( w1 w2 w3 w4 -- w3 w4 w1 w2 w3 w4 ) gforth two_tuck
1.1 anton 1091: :
1092: 2swap 2over ;
1093:
1094: \ toggle is high-level: 0.11/0.42%
1095:
1.47 ! anton 1096: @ ( a_addr -- w ) core fetch
1.29 crook 1097: "" Read from the cell at address @i{a-addr}, and return its contents, @i{w}.""
1.1 anton 1098: w = *a_addr;
1099:
1.47 ! anton 1100: ! ( w a_addr -- ) core store
1.29 crook 1101: "" Write the value @i{w} to the cell at address @i{a-addr}.""
1.1 anton 1102: *a_addr = w;
1103:
1.47 ! anton 1104: +! ( n a_addr -- ) core plus_store
1.29 crook 1105: "" Add @i{n} to the value stored in the cell at address @i{a-addr}.""
1.1 anton 1106: *a_addr += n;
1107: :
1108: tuck @ + swap ! ;
1109:
1.47 ! anton 1110: c@ ( c_addr -- c ) core c_fetch
1.29 crook 1111: "" Read from the char at address @i{c-addr}, and return its contents, @i{c}.""
1.1 anton 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:
1.47 ! anton 1136: c! ( c c_addr -- ) core c_store
1.29 crook 1137: "" Write the value @i{c} to the char at address @i{c-addr}.""
1.1 anton 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:
1.47 ! anton 1166: 2! ( w1 w2 a_addr -- ) core two_store
1.29 crook 1167: "" Write the value @i{w1, w2} to the double at address @i{a-addr}.""
1.1 anton 1168: a_addr[0] = w2;
1169: a_addr[1] = w1;
1170: :
1171: tuck ! cell+ ! ;
1172:
1.47 ! anton 1173: 2@ ( a_addr -- w1 w2 ) core two_fetch
1.29 crook 1174: "" Read from the double at address @i{a-addr}, and return its contents, @i{w1, w2}.""
1.1 anton 1175: w2 = a_addr[0];
1176: w1 = a_addr[1];
1177: :
1178: dup cell+ @ swap @ ;
1179:
1.47 ! anton 1180: cell+ ( a_addr1 -- a_addr2 ) core cell_plus
1.29 crook 1181: "" Increment @i{a-addr1} by the number of address units corresponding to the size of
1182: one cell, to give @i{a-addr2}.""
1.1 anton 1183: a_addr2 = a_addr1+1;
1184: :
1185: cell + ;
1186:
1.47 ! anton 1187: cells ( n1 -- n2 ) core
1.29 crook 1188: "" @i{n2} is the number of address units corresponding to @i{n1} cells.""
1.1 anton 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:
1.47 ! anton 1198: char+ ( c_addr1 -- c_addr2 ) core char_plus
1.29 crook 1199: "" Increment @i{c-addr1} by the number of address units corresponding to the size of
1200: one char, to give @i{c-addr2}.""
1.1 anton 1201: c_addr2 = c_addr1 + 1;
1202: :
1203: 1+ ;
1204:
1.47 ! anton 1205: (chars) ( n1 -- n2 ) gforth paren_chars
1.1 anton 1206: n2 = n1 * sizeof(Char);
1207: :
1208: ;
1209:
1.47 ! anton 1210: count ( c_addr1 -- c_addr2 u ) core
1.29 crook 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}.""
1.1 anton 1213: u = *c_addr1;
1214: c_addr2 = c_addr1+1;
1215: :
1216: dup 1+ swap c@ ;
1217:
1.47 ! anton 1218: (f83find) ( c_addr u f83name1 -- f83name2 ) new paren_f83find
1.13 pazsan 1219: for (; f83name1 != NULL; f83name1 = (struct F83Name *)(f83name1->next))
1.1 anton 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:
1.15 pazsan 1233: \+hash
1.1 anton 1234:
1.47 ! anton 1235: (hashfind) ( c_addr u a_addr -- f83name2 ) new paren_hashfind
1.13 pazsan 1236: struct F83Name *f83name1;
1.1 anton 1237: f83name2=NULL;
1238: while(a_addr != NULL)
1239: {
1.13 pazsan 1240: f83name1=(struct F83Name *)(a_addr[1]);
1.1 anton 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:
1.47 ! anton 1257: (tablefind) ( c_addr u a_addr -- f83name2 ) new paren_tablefind
1.1 anton 1258: ""A case-sensitive variant of @code{(hashfind)}""
1.13 pazsan 1259: struct F83Name *f83name1;
1.1 anton 1260: f83name2=NULL;
1261: while(a_addr != NULL)
1262: {
1.13 pazsan 1263: f83name1=(struct F83Name *)(a_addr[1]);
1.1 anton 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:
1.47 ! anton 1280: (hashkey) ( c_addr u1 -- u2 ) gforth paren_hashkey
1.1 anton 1281: u2=0;
1282: while(u1--)
1283: u2+=(Cell)toupper(*c_addr++);
1284: :
1285: 0 -rot bounds ?DO I c@ toupper + LOOP ;
1286:
1.47 ! anton 1287: (hashkey1) ( c_addr u ubits -- ukey ) gforth paren_hashkey1
1.1 anton 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:
1.15 pazsan 1314: \+
1.1 anton 1315:
1.47 ! anton 1316: (parse-white) ( c_addr1 u1 -- c_addr2 u2 ) gforth paren_parse_white
1.1 anton 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:
1.47 ! anton 1336: aligned ( c_addr -- a_addr ) core
1.29 crook 1337: "" @i{a-addr} is the first aligned address greater than or equal to @i{c-addr}.""
1.1 anton 1338: a_addr = (Cell *)((((Cell)c_addr)+(sizeof(Cell)-1))&(-sizeof(Cell)));
1339: :
1340: [ cell 1- ] Literal + [ -1 cells ] Literal and ;
1341:
1.47 ! anton 1342: faligned ( c_addr -- f_addr ) float f_aligned
1.29 crook 1343: "" @i{f-addr} is the first float-aligned address greater than or equal to @i{c-addr}.""
1.1 anton 1344: f_addr = (Float *)((((Cell)c_addr)+(sizeof(Float)-1))&(-sizeof(Float)));
1345: :
1346: [ 1 floats 1- ] Literal + [ -1 floats ] Literal and ;
1347:
1.47 ! anton 1348: >body ( xt -- a_addr ) core to_body
1.40 crook 1349: "" Get the address of the body of the word represented by @i{xt} (the address
1350: of the word's data field).""
1.1 anton 1351: a_addr = PFA(xt);
1352: :
1353: 2 cells + ;
1354:
1.35 jwilke 1355: \ threading stuff is currently only interesting if we have a compiler
1356: \fhas? standardthreading has? compiler and [IF]
1.28 jwilke 1357:
1.47 ! anton 1358: >code-address ( xt -- c_addr ) gforth to_code_address
1.29 crook 1359: ""@i{c-addr} is the code address of the word @i{xt}.""
1.1 anton 1360: /* !! This behaves installation-dependently for DOES-words */
1361: c_addr = (Address)CODE_ADDRESS(xt);
1362: :
1363: @ ;
1364:
1.47 ! anton 1365: >does-code ( xt -- a_addr ) gforth to_does_code
1.29 crook 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.""
1.1 anton 1369: a_addr = (Cell *)DOES_CODE(xt);
1370: :
1371: cell+ @ ;
1372:
1.47 ! anton 1373: code-address! ( c_addr xt -- ) gforth code_address_store
1.29 crook 1374: ""Create a code field with code address @i{c-addr} at @i{xt}.""
1.1 anton 1375: MAKE_CF(xt, c_addr);
1.10 anton 1376: CACHE_FLUSH(xt,(size_t)PFA(0));
1.1 anton 1377: :
1378: ! ;
1379:
1.47 ! anton 1380: does-code! ( a_addr xt -- ) gforth does_code_store
1.29 crook 1381: ""Create a code field at @i{xt} for a defining-word-defined word; @i{a-addr}
1.26 crook 1382: is the start of the Forth code after @code{DOES>}.""
1.1 anton 1383: MAKE_DOES_CF(xt, a_addr);
1.10 anton 1384: CACHE_FLUSH(xt,(size_t)PFA(0));
1.1 anton 1385: :
1386: dodoes: over ! cell+ ! ;
1387:
1.47 ! anton 1388: does-handler! ( a_addr -- ) gforth does_handler_store
1.29 crook 1389: ""Create a @code{DOES>}-handler at address @i{a-addr}. Usually, @i{a-addr} points
1.26 crook 1390: just behind a @code{DOES>}.""
1.1 anton 1391: MAKE_DOES_HANDLER(a_addr);
1.10 anton 1392: CACHE_FLUSH((caddr_t)a_addr,DOES_HANDLER_SIZE);
1.1 anton 1393: :
1394: drop ;
1395:
1.47 ! anton 1396: /does-handler ( -- n ) gforth slash_does_handler
1.26 crook 1397: ""The size of a @code{DOES>}-handler (includes possible padding).""
1.1 anton 1398: /* !! a constant or environmental query might be better */
1399: n = DOES_HANDLER_SIZE;
1400: :
1401: 2 cells ;
1402:
1.47 ! anton 1403: threading-method ( -- n ) gforth threading_method
1.1 anton 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 ;
1.28 jwilke 1417:
1.35 jwilke 1418: \f[THEN]
1.1 anton 1419:
1.47 ! anton 1420: key-file ( wfileid -- n ) gforth paren_key_file
1.17 pazsan 1421: #ifdef HAS_FILE
1.1 anton 1422: fflush(stdout);
1.12 pazsan 1423: n = key((FILE*)wfileid);
1.17 pazsan 1424: #else
1425: n = key(stdin);
1426: #endif
1.1 anton 1427:
1.47 ! anton 1428: key?-file ( wfileid -- n ) facility key_q_file
1.17 pazsan 1429: #ifdef HAS_FILE
1.1 anton 1430: fflush(stdout);
1.12 pazsan 1431: n = key_query((FILE*)wfileid);
1.17 pazsan 1432: #else
1433: n = key_query(stdin);
1434: #endif
1435:
1436: \+os
1.12 pazsan 1437:
1.47 ! anton 1438: stdin ( -- wfileid ) gforth
1.12 pazsan 1439: wfileid = (Cell)stdin;
1.1 anton 1440:
1.47 ! anton 1441: stdout ( -- wfileid ) gforth
1.1 anton 1442: wfileid = (Cell)stdout;
1443:
1.47 ! anton 1444: stderr ( -- wfileid ) gforth
1.1 anton 1445: wfileid = (Cell)stderr;
1446:
1.47 ! anton 1447: form ( -- urows ucols ) gforth
1.1 anton 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:
1.47 ! anton 1455: flush-icache ( c_addr u -- ) gforth flush_icache
1.1 anton 1456: ""Make sure that the instruction cache of the processor (if there is
1.29 crook 1457: one) does not contain stale data at @i{c-addr} and @i{u} bytes
1.1 anton 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:
1.47 ! anton 1467: (bye) ( n -- ) gforth paren_bye
1.1 anton 1468: return (Label *)n;
1469:
1.47 ! anton 1470: (system) ( c_addr u -- wretval wior ) gforth peren_system
1.20 pazsan 1471: #ifndef MSDOS
1.1 anton 1472: int old_tp=terminal_prepped;
1473: deprep_terminal();
1.20 pazsan 1474: #endif
1.1 anton 1475: wretval=system(cstr(c_addr,u,1)); /* ~ expansion on first part of string? */
1476: wior = IOR(wretval==-1 || (wretval==127 && errno != 0));
1.20 pazsan 1477: #ifndef MSDOS
1.1 anton 1478: if (old_tp)
1479: prep_terminal();
1.20 pazsan 1480: #endif
1.1 anton 1481:
1.47 ! anton 1482: getenv ( c_addr1 u1 -- c_addr2 u2 ) gforth
1.29 crook 1483: ""The string @i{c-addr1 u1} specifies an environment variable. The string @i{c-addr2 u2}
1.24 crook 1484: is the host operating system's expansion of that environment variable. If the
1.29 crook 1485: environment variable does not exist, @i{c-addr2 u2} specifies a string 0 characters
1.24 crook 1486: in length.""
1.46 pazsan 1487: /* close ' to keep fontify happy */
1.1 anton 1488: c_addr2 = getenv(cstr(c_addr1,u1,1));
1489: u2 = (c_addr2 == NULL ? 0 : strlen(c_addr2));
1490:
1.47 ! anton 1491: open-pipe ( c_addr u ntype -- wfileid wior ) gforth open_pipe
1.1 anton 1492: wfileid=(Cell)popen(cstr(c_addr,u,1),fileattr[ntype]); /* ~ expansion of 1st arg? */
1493: wior = IOR(wfileid==0); /* !! the man page says that errno is not set reliably */
1494:
1.47 ! anton 1495: close-pipe ( wfileid -- wretval wior ) gforth close_pipe
1.1 anton 1496: wretval = pclose((FILE *)wfileid);
1497: wior = IOR(wretval==-1);
1498:
1.47 ! anton 1499: time&date ( -- nsec nmin nhour nday nmonth nyear ) facility-ext time_and_date
1.44 crook 1500: ""Report the current time of day. Seconds, minutes and hours are numbered from 0.
1501: Months are numbered from 1.""
1.1 anton 1502: struct timeval time1;
1503: struct timezone zone1;
1504: struct tm *ltime;
1505: gettimeofday(&time1,&zone1);
1506: ltime=localtime((time_t *)&time1.tv_sec);
1507: nyear =ltime->tm_year+1900;
1508: nmonth=ltime->tm_mon+1;
1509: nday =ltime->tm_mday;
1510: nhour =ltime->tm_hour;
1511: nmin =ltime->tm_min;
1512: nsec =ltime->tm_sec;
1513:
1.47 ! anton 1514: ms ( n -- ) facility-ext
1.44 crook 1515: ""Wait at least @i{n} milli-second.""
1.1 anton 1516: struct timeval timeout;
1517: timeout.tv_sec=n/1000;
1518: timeout.tv_usec=1000*(n%1000);
1519: (void)select(0,0,0,0,&timeout);
1520:
1.47 ! anton 1521: allocate ( u -- a_addr wior ) memory
1.29 crook 1522: ""Allocate @i{u} address units of contiguous data space. The initial
1.27 crook 1523: contents of the data space is undefined. If the allocation is successful,
1.29 crook 1524: @i{a-addr} is the start address of the allocated region and @i{wior}
1525: is 0. If the allocation fails, @i{a-addr} is undefined and @i{wior}
1.27 crook 1526: is an implementation-defined I/O result code.""
1.1 anton 1527: a_addr = (Cell *)malloc(u?u:1);
1528: wior = IOR(a_addr==NULL);
1529:
1.47 ! anton 1530: free ( a_addr -- wior ) memory
1.29 crook 1531: ""Return the region of data space starting at @i{a-addr} to the system.
1.27 crook 1532: The regon must originally have been obtained using @code{allocate} or
1.29 crook 1533: @code{resize}. If the operational is successful, @i{wior} is 0.
1534: If the operation fails, @i{wior} is an implementation-defined
1.27 crook 1535: I/O result code.""
1.1 anton 1536: free(a_addr);
1537: wior = 0;
1538:
1.47 ! anton 1539: resize ( a_addr1 u -- a_addr2 wior ) memory
1.26 crook 1540: ""Change the size of the allocated area at @i{a-addr1} to @i{u}
1.1 anton 1541: address units, possibly moving the contents to a different
1.27 crook 1542: area. @i{a-addr2} is the address of the resulting area.
1.29 crook 1543: If the operational is successful, @i{wior} is 0.
1544: If the operation fails, @i{wior} is an implementation-defined
1545: I/O result code. If @i{a-addr1} is 0, Gforth's (but not the Standard)
1.27 crook 1546: @code{resize} @code{allocate}s @i{u} address units.""
1.1 anton 1547: /* the following check is not necessary on most OSs, but it is needed
1548: on SunOS 4.1.2. */
1.46 pazsan 1549: /* close ' to keep fontify happy */
1.1 anton 1550: if (a_addr1==NULL)
1551: a_addr2 = (Cell *)malloc(u);
1552: else
1553: a_addr2 = (Cell *)realloc(a_addr1, u);
1554: wior = IOR(a_addr2==NULL); /* !! Define a return code */
1555:
1.47 ! anton 1556: strerror ( n -- c_addr u ) gforth
1.1 anton 1557: c_addr = strerror(n);
1558: u = strlen(c_addr);
1559:
1.47 ! anton 1560: strsignal ( n -- c_addr u ) gforth
1.1 anton 1561: c_addr = strsignal(n);
1562: u = strlen(c_addr);
1563:
1.47 ! anton 1564: call-c ( w -- ) gforth call_c
1.1 anton 1565: ""Call the C function pointed to by @i{w}. The C function has to
1566: access the stack itself. The stack pointers are exported in the global
1567: variables @code{SP} and @code{FP}.""
1568: /* This is a first attempt at support for calls to C. This may change in
1569: the future */
1570: IF_FTOS(fp[0]=FTOS);
1571: FP=fp;
1572: SP=sp;
1573: ((void (*)())w)();
1574: sp=SP;
1575: fp=FP;
1576: IF_TOS(TOS=sp[0]);
1577: IF_FTOS(FTOS=fp[0]);
1578:
1.15 pazsan 1579: \+
1580: \+file
1.1 anton 1581:
1.47 ! anton 1582: close-file ( wfileid -- wior ) file close_file
1.1 anton 1583: wior = IOR(fclose((FILE *)wfileid)==EOF);
1584:
1.47 ! anton 1585: open-file ( c_addr u ntype -- wfileid wior ) file open_file
1.22 crook 1586: wfileid = (Cell)fopen(tilde_cstr(c_addr, u, 1), fileattr[ntype]);
1.14 pazsan 1587: #if defined(GO32) && defined(MSDOS)
1.22 crook 1588: if(wfileid && !(ntype & 1))
1589: setbuf((FILE*)wfileid, NULL);
1.14 pazsan 1590: #endif
1.22 crook 1591: wior = IOR(wfileid == 0);
1.1 anton 1592:
1.47 ! anton 1593: create-file ( c_addr u ntype -- wfileid wior ) file create_file
1.1 anton 1594: Cell fd;
1595: fd = open(tilde_cstr(c_addr, u, 1), O_CREAT|O_TRUNC|ufileattr[ntype], 0666);
1596: if (fd != -1) {
1.22 crook 1597: wfileid = (Cell)fdopen(fd, fileattr[ntype]);
1.14 pazsan 1598: #if defined(GO32) && defined(MSDOS)
1.22 crook 1599: if(wfileid && !(ntype & 1))
1600: setbuf((FILE*)wfileid, NULL);
1.14 pazsan 1601: #endif
1.22 crook 1602: wior = IOR(wfileid == 0);
1.1 anton 1603: } else {
1.22 crook 1604: wfileid = 0;
1.1 anton 1605: wior = IOR(1);
1606: }
1607:
1.47 ! anton 1608: delete-file ( c_addr u -- wior ) file delete_file
1.1 anton 1609: wior = IOR(unlink(tilde_cstr(c_addr, u, 1))==-1);
1610:
1.47 ! anton 1611: rename-file ( c_addr1 u1 c_addr2 u2 -- wior ) file-ext rename_file
1.29 crook 1612: ""Rename file @i{c_addr1 u1} to new name @i{c_addr2 u2}""
1.1 anton 1613: char *s1=tilde_cstr(c_addr2, u2, 1);
1614: wior = IOR(rename(tilde_cstr(c_addr1, u1, 0), s1)==-1);
1615:
1.47 ! anton 1616: file-position ( wfileid -- ud wior ) file file_position
1.1 anton 1617: /* !! use tell and lseek? */
1618: ud = LONG2UD(ftell((FILE *)wfileid));
1619: wior = IOR(UD2LONG(ud)==-1);
1620:
1.47 ! anton 1621: reposition-file ( ud wfileid -- wior ) file reposition_file
1.1 anton 1622: wior = IOR(fseek((FILE *)wfileid, UD2LONG(ud), SEEK_SET)==-1);
1623:
1.47 ! anton 1624: file-size ( wfileid -- ud wior ) file file_size
1.1 anton 1625: struct stat buf;
1626: wior = IOR(fstat(fileno((FILE *)wfileid), &buf)==-1);
1627: ud = LONG2UD(buf.st_size);
1628:
1.47 ! anton 1629: resize-file ( ud wfileid -- wior ) file resize_file
1.1 anton 1630: wior = IOR(ftruncate(fileno((FILE *)wfileid), UD2LONG(ud))==-1);
1631:
1.47 ! anton 1632: read-file ( c_addr u1 wfileid -- u2 wior ) file read_file
1.1 anton 1633: /* !! fread does not guarantee enough */
1634: u2 = fread(c_addr, sizeof(Char), u1, (FILE *)wfileid);
1635: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
1636: /* !! is the value of ferror errno-compatible? */
1637: if (wior)
1638: clearerr((FILE *)wfileid);
1639:
1.47 ! anton 1640: read-line ( c_addr u1 wfileid -- u2 flag wior ) file read_line
1.45 anton 1641: #if 1
1.1 anton 1642: Cell c;
1643: flag=-1;
1644: for(u2=0; u2<u1; u2++)
1645: {
1.45 anton 1646: c = getc((FILE *)wfileid);
1647: if (c=='\n') break;
1648: if (c=='\r') {
1649: if ((c = getc((FILE *)wfileid))!='\n')
1650: ungetc(c,(FILE *)wfileid);
1651: break;
1652: }
1653: if (c==EOF) {
1.1 anton 1654: flag=FLAG(u2!=0);
1655: break;
1656: }
1.45 anton 1657: c_addr[u2] = (Char)c;
1.1 anton 1658: }
1659: wior=FILEIO(ferror((FILE *)wfileid));
1.45 anton 1660: #else
1.1 anton 1661: if ((flag=FLAG(!feof((FILE *)wfileid) &&
1662: fgets(c_addr,u1+1,(FILE *)wfileid) != NULL))) {
1.30 anton 1663: wior=FILEIO(ferror((FILE *)wfileid)!=0); /* !! ior? */
1.1 anton 1664: if (wior)
1665: clearerr((FILE *)wfileid);
1666: u2 = strlen(c_addr);
1667: u2-=((u2>0) && (c_addr[u2-1]==NEWLINE));
1668: }
1669: else {
1670: wior=0;
1671: u2=0;
1672: }
1.45 anton 1673: #endif
1.1 anton 1674:
1.15 pazsan 1675: \+
1.1 anton 1676:
1.47 ! anton 1677: write-file ( c_addr u1 wfileid -- wior ) file write_file
1.1 anton 1678: /* !! fwrite does not guarantee enough */
1.39 pazsan 1679: #ifdef HAS_FILE
1.1 anton 1680: {
1681: UCell u2 = fwrite(c_addr, sizeof(Char), u1, (FILE *)wfileid);
1682: wior = FILEIO(u2<u1 && ferror((FILE *)wfileid));
1683: if (wior)
1684: clearerr((FILE *)wfileid);
1685: }
1.39 pazsan 1686: #else
1687: TYPE(c_addr, u1);
1688: #endif
1.17 pazsan 1689:
1.47 ! anton 1690: emit-file ( c wfileid -- wior ) gforth emit_file
1.17 pazsan 1691: #ifdef HAS_FILE
1.1 anton 1692: wior = FILEIO(putc(c, (FILE *)wfileid)==EOF);
1693: if (wior)
1694: clearerr((FILE *)wfileid);
1.17 pazsan 1695: #else
1.36 pazsan 1696: PUTC(c);
1.17 pazsan 1697: #endif
1.1 anton 1698:
1.15 pazsan 1699: \+file
1.1 anton 1700:
1.47 ! anton 1701: flush-file ( wfileid -- wior ) file-ext flush_file
1.1 anton 1702: wior = IOR(fflush((FILE *) wfileid)==EOF);
1703:
1.47 ! anton 1704: file-status ( c_addr u -- ntype wior ) file-ext file_status
1.1 anton 1705: char *filename=tilde_cstr(c_addr, u, 1);
1706: if (access (filename, F_OK) != 0) {
1707: ntype=0;
1708: wior=IOR(1);
1709: }
1710: else if (access (filename, R_OK | W_OK) == 0) {
1711: ntype=2; /* r/w */
1712: wior=0;
1713: }
1714: else if (access (filename, R_OK) == 0) {
1715: ntype=0; /* r/o */
1716: wior=0;
1717: }
1718: else if (access (filename, W_OK) == 0) {
1719: ntype=4; /* w/o */
1720: wior=0;
1721: }
1722: else {
1723: ntype=1; /* well, we cannot access the file, but better deliver a legal
1724: access mode (r/o bin), so we get a decent error later upon open. */
1725: wior=0;
1726: }
1727:
1.15 pazsan 1728: \+
1729: \+floating
1.1 anton 1730:
1731: comparisons(f, r1 r2, f_, r1, r2, gforth, gforth, float, gforth)
1732: comparisons(f0, r, f_zero_, r, 0., float, gforth, float, gforth)
1733:
1.47 ! anton 1734: d>f ( d -- r ) float d_to_f
1.1 anton 1735: #ifdef BUGGY_LONG_LONG
1736: extern double ldexp(double x, int exp);
1737: r = ldexp((Float)d.hi,CELL_BITS) + (Float)d.lo;
1738: #else
1739: r = d;
1740: #endif
1741:
1.47 ! anton 1742: f>d ( r -- d ) float f_to_d
1.1 anton 1743: #ifdef BUGGY_LONG_LONG
1.21 anton 1744: d.hi = ldexp(r,-(int)(CELL_BITS)) - (r<0);
1.1 anton 1745: d.lo = r-ldexp((Float)d.hi,CELL_BITS);
1746: #else
1747: d = r;
1748: #endif
1749:
1.47 ! anton 1750: f! ( r f_addr -- ) float f_store
1.29 crook 1751: "" Store the floating-point value @i{r} to address @i{f-addr}.""
1.1 anton 1752: *f_addr = r;
1753:
1.47 ! anton 1754: f@ ( f_addr -- r ) float f_fetch
1.29 crook 1755: "" Fetch floating-point value @i{r} from address @i{f-addr}.""
1.1 anton 1756: r = *f_addr;
1757:
1.47 ! anton 1758: df@ ( df_addr -- r ) float-ext d_f_fetch
1.29 crook 1759: "" Fetch the double-precision IEEE floating-point value @i{r} from the address @i{df-addr}.""
1.1 anton 1760: #ifdef IEEE_FP
1761: r = *df_addr;
1762: #else
1763: !! df@
1764: #endif
1765:
1.47 ! anton 1766: df! ( r df_addr -- ) float-ext d_f_store
1.29 crook 1767: "" Store the double-precision IEEE floating-point value @i{r} to the address @i{df-addr}.""
1.1 anton 1768: #ifdef IEEE_FP
1769: *df_addr = r;
1770: #else
1771: !! df!
1772: #endif
1773:
1.47 ! anton 1774: sf@ ( sf_addr -- r ) float-ext s_f_fetch
1.29 crook 1775: "" Fetch the single-precision IEEE floating-point value @i{r} from the address @i{sf-addr}.""
1.1 anton 1776: #ifdef IEEE_FP
1777: r = *sf_addr;
1778: #else
1779: !! sf@
1780: #endif
1781:
1.47 ! anton 1782: sf! ( r sf_addr -- ) float-ext s_f_store
1.29 crook 1783: "" Store the single-precision IEEE floating-point value @i{r} to the address @i{sf-addr}.""
1.1 anton 1784: #ifdef IEEE_FP
1785: *sf_addr = r;
1786: #else
1787: !! sf!
1788: #endif
1789:
1.47 ! anton 1790: f+ ( r1 r2 -- r3 ) float f_plus
1.1 anton 1791: r3 = r1+r2;
1792:
1.47 ! anton 1793: f- ( r1 r2 -- r3 ) float f_minus
1.1 anton 1794: r3 = r1-r2;
1795:
1.47 ! anton 1796: f* ( r1 r2 -- r3 ) float f_star
1.1 anton 1797: r3 = r1*r2;
1798:
1.47 ! anton 1799: f/ ( r1 r2 -- r3 ) float f_slash
1.1 anton 1800: r3 = r1/r2;
1801:
1.47 ! anton 1802: f** ( r1 r2 -- r3 ) float-ext f_star_star
1.26 crook 1803: ""@i{r3} is @i{r1} raised to the @i{r2}th power.""
1.1 anton 1804: r3 = pow(r1,r2);
1805:
1.47 ! anton 1806: fnegate ( r1 -- r2 ) float f_negate
1.1 anton 1807: r2 = - r1;
1808:
1.47 ! anton 1809: fdrop ( r -- ) float f_drop
1.1 anton 1810:
1.47 ! anton 1811: fdup ( r -- r r ) float f_dupe
1.1 anton 1812:
1.47 ! anton 1813: fswap ( r1 r2 -- r2 r1 ) float f_swap
1.1 anton 1814:
1.47 ! anton 1815: fover ( r1 r2 -- r1 r2 r1 ) float f_over
1.1 anton 1816:
1.47 ! anton 1817: frot ( r1 r2 r3 -- r2 r3 r1 ) float f_rote
1.1 anton 1818:
1.47 ! anton 1819: fnip ( r1 r2 -- r2 ) gforth f_nip
1.1 anton 1820:
1.47 ! anton 1821: ftuck ( r1 r2 -- r2 r1 r2 ) gforth f_tuck
1.1 anton 1822:
1.47 ! anton 1823: float+ ( f_addr1 -- f_addr2 ) float float_plus
1.29 crook 1824: "" Increment @i{f-addr1} by the number of address units corresponding to the size of
1825: one floating-point number, to give @i{f-addr2}.""
1.1 anton 1826: f_addr2 = f_addr1+1;
1827:
1.47 ! anton 1828: floats ( n1 -- n2 ) float
1.29 crook 1829: ""@i{n2} is the number of address units corresponding to @i{n1} floating-point numbers.""
1.1 anton 1830: n2 = n1*sizeof(Float);
1831:
1.47 ! anton 1832: floor ( r1 -- r2 ) float
1.26 crook 1833: ""Round towards the next smaller integral value, i.e., round toward negative infinity.""
1.1 anton 1834: /* !! unclear wording */
1835: r2 = floor(r1);
1836:
1.47 ! anton 1837: fround ( r1 -- r2 ) float f_round
1.26 crook 1838: ""Round to the nearest integral value.""
1.1 anton 1839: /* !! unclear wording */
1840: #ifdef HAVE_RINT
1841: r2 = rint(r1);
1842: #else
1843: r2 = floor(r1+0.5);
1844: /* !! This is not quite true to the rounding rules given in the standard */
1845: #endif
1846:
1.47 ! anton 1847: fmax ( r1 r2 -- r3 ) float f_max
1.1 anton 1848: if (r1<r2)
1849: r3 = r2;
1850: else
1851: r3 = r1;
1852:
1.47 ! anton 1853: fmin ( r1 r2 -- r3 ) float f_min
1.1 anton 1854: if (r1<r2)
1855: r3 = r1;
1856: else
1857: r3 = r2;
1858:
1.47 ! anton 1859: represent ( r c_addr u -- n f1 f2 ) float
1.1 anton 1860: char *sig;
1861: int flag;
1862: int decpt;
1863: sig=ecvt(r, u, &decpt, &flag);
1864: n=(r==0 ? 1 : decpt);
1865: f1=FLAG(flag!=0);
1.21 anton 1866: f2=FLAG(isdigit((unsigned)(sig[0]))!=0);
1.1 anton 1867: memmove(c_addr,sig,u);
1868:
1.47 ! anton 1869: >float ( c_addr u -- flag ) float to_float
1.29 crook 1870: ""Attempt to convert the character string @i{c-addr u} to
1.27 crook 1871: internal floating-point representation. If the string
1.29 crook 1872: represents a valid floating-point number @i{r} is placed
1873: on the floating-point stack and @i{flag} is true. Otherwise,
1874: @i{flag} is false. A string of blanks is a special case
1.40 crook 1875: and represents the floating-point number 0.""
1.1 anton 1876: /* real signature: c_addr u -- r t / f */
1877: Float r;
1878: char *number=cstr(c_addr, u, 1);
1879: char *endconv;
1.42 pazsan 1880: int sign = 0;
1881: if(number[0]=='-') {
1882: sign = 1;
1883: number++;
1884: u--;
1885: }
1.21 anton 1886: while(isspace((unsigned)(number[--u])) && u>0);
1.1 anton 1887: switch(number[u])
1888: {
1889: case 'd':
1890: case 'D':
1891: case 'e':
1892: case 'E': break;
1893: default : u++; break;
1894: }
1895: number[u]='\0';
1896: r=strtod(number,&endconv);
1897: if((flag=FLAG(!(Cell)*endconv)))
1898: {
1899: IF_FTOS(fp[0] = FTOS);
1900: fp += -1;
1.42 pazsan 1901: FTOS = sign ? -r : r;
1.1 anton 1902: }
1903: else if(*endconv=='d' || *endconv=='D')
1904: {
1905: *endconv='E';
1906: r=strtod(number,&endconv);
1907: if((flag=FLAG(!(Cell)*endconv)))
1908: {
1909: IF_FTOS(fp[0] = FTOS);
1910: fp += -1;
1.42 pazsan 1911: FTOS = sign ? -r : r;
1.1 anton 1912: }
1913: }
1914:
1.47 ! anton 1915: fabs ( r1 -- r2 ) float-ext f_abs
1.1 anton 1916: r2 = fabs(r1);
1917:
1.47 ! anton 1918: facos ( r1 -- r2 ) float-ext f_a_cos
1.1 anton 1919: r2 = acos(r1);
1920:
1.47 ! anton 1921: fasin ( r1 -- r2 ) float-ext f_a_sine
1.1 anton 1922: r2 = asin(r1);
1923:
1.47 ! anton 1924: fatan ( r1 -- r2 ) float-ext f_a_tan
1.1 anton 1925: r2 = atan(r1);
1926:
1.47 ! anton 1927: fatan2 ( r1 r2 -- r3 ) float-ext f_a_tan_two
1.26 crook 1928: ""@i{r1/r2}=tan(@i{r3}). ANS Forth does not require, but probably
1.1 anton 1929: intends this to be the inverse of @code{fsincos}. In gforth it is.""
1930: r3 = atan2(r1,r2);
1931:
1.47 ! anton 1932: fcos ( r1 -- r2 ) float-ext f_cos
1.1 anton 1933: r2 = cos(r1);
1934:
1.47 ! anton 1935: fexp ( r1 -- r2 ) float-ext f_e_x_p
1.1 anton 1936: r2 = exp(r1);
1937:
1.47 ! anton 1938: fexpm1 ( r1 -- r2 ) float-ext f_e_x_p_m_one
1.1 anton 1939: ""@i{r2}=@i{e}**@i{r1}@minus{}1""
1940: #ifdef HAVE_EXPM1
1.3 pazsan 1941: extern double
1942: #ifdef NeXT
1943: const
1944: #endif
1945: expm1(double);
1.1 anton 1946: r2 = expm1(r1);
1947: #else
1948: r2 = exp(r1)-1.;
1949: #endif
1950:
1.47 ! anton 1951: fln ( r1 -- r2 ) float-ext f_l_n
1.1 anton 1952: r2 = log(r1);
1953:
1.47 ! anton 1954: flnp1 ( r1 -- r2 ) float-ext f_l_n_p_one
1.1 anton 1955: ""@i{r2}=ln(@i{r1}+1)""
1956: #ifdef HAVE_LOG1P
1.3 pazsan 1957: extern double
1958: #ifdef NeXT
1959: const
1960: #endif
1961: log1p(double);
1.1 anton 1962: r2 = log1p(r1);
1963: #else
1964: r2 = log(r1+1.);
1965: #endif
1966:
1.47 ! anton 1967: flog ( r1 -- r2 ) float-ext f_log
1.26 crook 1968: ""The decimal logarithm.""
1.1 anton 1969: r2 = log10(r1);
1970:
1.47 ! anton 1971: falog ( r1 -- r2 ) float-ext f_a_log
1.1 anton 1972: ""@i{r2}=10**@i{r1}""
1973: extern double pow10(double);
1974: r2 = pow10(r1);
1975:
1.47 ! anton 1976: fsin ( r1 -- r2 ) float-ext f_sine
1.1 anton 1977: r2 = sin(r1);
1978:
1.47 ! anton 1979: fsincos ( r1 -- r2 r3 ) float-ext f_sine_cos
1.1 anton 1980: ""@i{r2}=sin(@i{r1}), @i{r3}=cos(@i{r1})""
1981: r2 = sin(r1);
1982: r3 = cos(r1);
1983:
1.47 ! anton 1984: fsqrt ( r1 -- r2 ) float-ext f_square_root
1.1 anton 1985: r2 = sqrt(r1);
1986:
1.47 ! anton 1987: ftan ( r1 -- r2 ) float-ext f_tan
1.1 anton 1988: r2 = tan(r1);
1989: :
1990: fsincos f/ ;
1991:
1.47 ! anton 1992: fsinh ( r1 -- r2 ) float-ext f_cinch
1.1 anton 1993: r2 = sinh(r1);
1994: :
1995: fexpm1 fdup fdup 1. d>f f+ f/ f+ f2/ ;
1996:
1.47 ! anton 1997: fcosh ( r1 -- r2 ) float-ext f_cosh
1.1 anton 1998: r2 = cosh(r1);
1999: :
2000: fexp fdup 1/f f+ f2/ ;
2001:
1.47 ! anton 2002: ftanh ( r1 -- r2 ) float-ext f_tan_h
1.1 anton 2003: r2 = tanh(r1);
2004: :
2005: f2* fexpm1 fdup 2. d>f f+ f/ ;
2006:
1.47 ! anton 2007: fasinh ( r1 -- r2 ) float-ext f_a_cinch
1.1 anton 2008: r2 = asinh(r1);
2009: :
2010: fdup fdup f* 1. d>f f+ fsqrt f/ fatanh ;
2011:
1.47 ! anton 2012: facosh ( r1 -- r2 ) float-ext f_a_cosh
1.1 anton 2013: r2 = acosh(r1);
2014: :
2015: fdup fdup f* 1. d>f f- fsqrt f+ fln ;
2016:
1.47 ! anton 2017: fatanh ( r1 -- r2 ) float-ext f_a_tan_h
1.1 anton 2018: r2 = atanh(r1);
2019: :
2020: fdup f0< >r fabs 1. d>f fover f- f/ f2* flnp1 f2/
2021: r> IF fnegate THEN ;
2022:
1.47 ! anton 2023: sfloats ( n1 -- n2 ) float-ext s_floats
1.29 crook 2024: ""@i{n2} is the number of address units corresponding to @i{n1}
2025: single-precision IEEE floating-point numbers.""
1.1 anton 2026: n2 = n1*sizeof(SFloat);
2027:
1.47 ! anton 2028: dfloats ( n1 -- n2 ) float-ext d_floats
1.29 crook 2029: ""@i{n2} is the number of address units corresponding to @i{n1}
2030: double-precision IEEE floating-point numbers.""
1.1 anton 2031: n2 = n1*sizeof(DFloat);
2032:
1.47 ! anton 2033: sfaligned ( c_addr -- sf_addr ) float-ext s_f_aligned
1.29 crook 2034: "" @i{sf-addr} is the first single-float-aligned address greater
2035: than or equal to @i{c-addr}.""
1.1 anton 2036: sf_addr = (SFloat *)((((Cell)c_addr)+(sizeof(SFloat)-1))&(-sizeof(SFloat)));
2037: :
2038: [ 1 sfloats 1- ] Literal + [ -1 sfloats ] Literal and ;
2039:
1.47 ! anton 2040: dfaligned ( c_addr -- df_addr ) float-ext d_f_aligned
1.29 crook 2041: "" @i{df-addr} is the first double-float-aligned address greater
2042: than or equal to @i{c-addr}.""
1.1 anton 2043: df_addr = (DFloat *)((((Cell)c_addr)+(sizeof(DFloat)-1))&(-sizeof(DFloat)));
2044: :
2045: [ 1 dfloats 1- ] Literal + [ -1 dfloats ] Literal and ;
2046:
2047: \ The following words access machine/OS/installation-dependent
2048: \ Gforth internals
2049: \ !! how about environmental queries DIRECT-THREADED,
2050: \ INDIRECT-THREADED, TOS-CACHED, FTOS-CACHED, CODEFIELD-DOES */
2051:
2052: \ local variable implementation primitives
1.15 pazsan 2053: \+
2054: \+glocals
1.1 anton 2055:
1.47 ! anton 2056: @local# ( -- w ) gforth fetch_local_number
1.1 anton 2057: w = *(Cell *)(lp+(Cell)NEXT_INST);
2058: INC_IP(1);
2059:
1.47 ! anton 2060: @local0 ( -- w ) new fetch_local_zero
1.1 anton 2061: w = *(Cell *)(lp+0*sizeof(Cell));
2062:
1.47 ! anton 2063: @local1 ( -- w ) new fetch_local_four
1.1 anton 2064: w = *(Cell *)(lp+1*sizeof(Cell));
2065:
1.47 ! anton 2066: @local2 ( -- w ) new fetch_local_eight
1.1 anton 2067: w = *(Cell *)(lp+2*sizeof(Cell));
2068:
1.47 ! anton 2069: @local3 ( -- w ) new fetch_local_twelve
1.1 anton 2070: w = *(Cell *)(lp+3*sizeof(Cell));
2071:
1.15 pazsan 2072: \+floating
1.1 anton 2073:
1.47 ! anton 2074: f@local# ( -- r ) gforth f_fetch_local_number
1.1 anton 2075: r = *(Float *)(lp+(Cell)NEXT_INST);
2076: INC_IP(1);
2077:
1.47 ! anton 2078: f@local0 ( -- r ) new f_fetch_local_zero
1.1 anton 2079: r = *(Float *)(lp+0*sizeof(Float));
2080:
1.47 ! anton 2081: f@local1 ( -- r ) new f_fetch_local_eight
1.1 anton 2082: r = *(Float *)(lp+1*sizeof(Float));
2083:
1.15 pazsan 2084: \+
1.1 anton 2085:
1.47 ! anton 2086: laddr# ( -- c_addr ) gforth laddr_number
1.1 anton 2087: /* this can also be used to implement lp@ */
2088: c_addr = (Char *)(lp+(Cell)NEXT_INST);
2089: INC_IP(1);
2090:
1.47 ! anton 2091: lp+!# ( -- ) gforth lp_plus_store_number
1.1 anton 2092: ""used with negative immediate values it allocates memory on the
2093: local stack, a positive immediate argument drops memory from the local
2094: stack""
2095: lp += (Cell)NEXT_INST;
2096: INC_IP(1);
2097:
1.47 ! anton 2098: lp- ( -- ) new minus_four_lp_plus_store
1.1 anton 2099: lp += -sizeof(Cell);
2100:
1.47 ! anton 2101: lp+ ( -- ) new eight_lp_plus_store
1.1 anton 2102: lp += sizeof(Float);
2103:
1.47 ! anton 2104: lp+2 ( -- ) new sixteen_lp_plus_store
1.1 anton 2105: lp += 2*sizeof(Float);
2106:
1.47 ! anton 2107: lp! ( c_addr -- ) gforth lp_store
1.1 anton 2108: lp = (Address)c_addr;
2109:
1.47 ! anton 2110: >l ( w -- ) gforth to_l
1.1 anton 2111: lp -= sizeof(Cell);
2112: *(Cell *)lp = w;
2113:
1.15 pazsan 2114: \+floating
1.1 anton 2115:
1.47 ! anton 2116: f>l ( r -- ) gforth f_to_l
1.1 anton 2117: lp -= sizeof(Float);
2118: *(Float *)lp = r;
2119:
1.47 ! anton 2120: fpick ( u -- r ) gforth
1.11 anton 2121: r = fp[u+1]; /* +1, because update of fp happens before this fragment */
2122: :
2123: floats fp@ + f@ ;
2124:
1.15 pazsan 2125: \+
2126: \+
1.1 anton 2127:
1.15 pazsan 2128: \+OS
1.1 anton 2129:
2130: define(`uploop',
2131: `pushdef(`$1', `$2')_uploop(`$1', `$2', `$3', `$4', `$5')`'popdef(`$1')')
2132: define(`_uploop',
2133: `ifelse($1, `$3', `$5',
2134: `$4`'define(`$1', incr($1))_uploop(`$1', `$2', `$3', `$4', `$5')')')
2135: \ argflist(argnum): Forth argument list
2136: define(argflist,
2137: `ifelse($1, 0, `',
2138: `uploop(`_i', 1, $1, `format(`u%d ', _i)', `format(`u%d ', _i)')')')
2139: \ argdlist(argnum): declare C's arguments
2140: define(argdlist,
2141: `ifelse($1, 0, `',
2142: `uploop(`_i', 1, $1, `Cell, ', `Cell')')')
2143: \ argclist(argnum): pass C's arguments
2144: define(argclist,
2145: `ifelse($1, 0, `',
2146: `uploop(`_i', 1, $1, `format(`u%d, ', _i)', `format(`u%d', _i)')')')
2147: \ icall(argnum)
2148: define(icall,
1.47 ! anton 2149: `icall$1 ( argflist($1)u -- uret ) gforth
1.9 pazsan 2150: uret = (SYSCALL(Cell(*)(argdlist($1)))u)(argclist($1));
1.1 anton 2151:
2152: ')
2153: define(fcall,
1.47 ! anton 2154: `fcall$1 ( argflist($1)u -- rret ) gforth
1.9 pazsan 2155: rret = (SYSCALL(Float(*)(argdlist($1)))u)(argclist($1));
1.1 anton 2156:
2157: ')
2158:
1.46 pazsan 2159: \ close ' to keep fontify happy
1.1 anton 2160:
1.47 ! anton 2161: open-lib ( c_addr1 u1 -- u2 ) gforth open_lib
1.1 anton 2162: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
1.8 anton 2163: #ifndef RTLD_GLOBAL
2164: #define RTLD_GLOBAL 0
2165: #endif
1.7 pazsan 2166: u2=(UCell) dlopen(cstr(c_addr1, u1, 1), RTLD_GLOBAL | RTLD_LAZY);
1.1 anton 2167: #else
1.18 pazsan 2168: # ifdef _WIN32
1.1 anton 2169: u2 = (Cell) GetModuleHandle(cstr(c_addr1, u1, 1));
2170: # else
2171: #warning Define open-lib!
2172: u2 = 0;
2173: # endif
2174: #endif
2175:
1.47 ! anton 2176: lib-sym ( c_addr1 u1 u2 -- u3 ) gforth lib_sym
1.1 anton 2177: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN)
2178: u3 = (UCell) dlsym((void*)u2,cstr(c_addr1, u1, 1));
2179: #else
1.18 pazsan 2180: # ifdef _WIN32
1.1 anton 2181: u3 = (Cell) GetProcAddress((HMODULE)u2, cstr(c_addr1, u1, 1));
2182: # else
2183: #warning Define lib-sym!
2184: u3 = 0;
2185: # endif
2186: #endif
2187:
2188: uploop(i, 0, 7, `icall(i)')
2189: icall(20)
2190: uploop(i, 0, 7, `fcall(i)')
2191: fcall(20)
2192:
1.15 pazsan 2193: \+
1.1 anton 2194:
1.47 ! anton 2195: up! ( a_addr -- ) gforth up_store
1.1 anton 2196: UP=up=(char *)a_addr;
2197: :
2198: up ! ;
2199: Variable UP
1.34 jwilke 2200:
1.47 ! anton 2201: wcall ( u -- ) gforth
1.34 jwilke 2202: IF_FTOS(fp[0]=FTOS);
2203: FP=fp;
2204: sp=(SYSCALL(Cell(*)(Cell *, void *))u)(sp, &FP);
2205: fp=FP;
2206: IF_TOS(TOS=sp[0];)
2207: IF_FTOS(FTOS=fp[0]);
1.46 pazsan 2208:
2209: \+file
2210:
1.47 ! anton 2211: open-dir ( c_addr u -- wdirid wior ) gforth open_dir
1.46 pazsan 2212: wdirid = (Cell)opendir(tilde_cstr(c_addr, u, 1));
2213: wior = IOR(wdirid == 0);
2214:
1.47 ! anton 2215: read-dir ( c_addr u1 wdirid -- u2 flag wior ) gforth read_dir
1.46 pazsan 2216: struct dirent * dent;
2217: dent = readdir((DIR *)wdirid);
2218: wior = 0;
2219: flag = -1;
2220: if(dent == NULL) {
2221: u2 = 0;
2222: flag = 0;
2223: } else {
2224: u2 = strlen(dent->d_name);
2225: if(u2 > u1)
2226: u2 = u1;
2227: memmove(c_addr, dent->d_name, u2);
2228: }
2229:
1.47 ! anton 2230: close-dir ( wdirid -- wior ) gforth close_dir
1.46 pazsan 2231: wior = IOR(closedir((DIR *)wdirid));
2232:
1.47 ! anton 2233: filename-match ( c_addr1 u1 c_addr2 u2 -- flag ) gforth match_file
1.46 pazsan 2234: char * string = cstr(c_addr1, u1, 1);
2235: char * pattern = cstr(c_addr2, u2, 0);
2236: flag = FLAG(!fnmatch(pattern, string, 0));
2237:
2238: \+
1.34 jwilke 2239:
1.47 ! anton 2240: newline ( -- c_addr u ) gforth
1.45 anton 2241: ""String containing the newline sequence of the host OS""
2242: char newline[] = {
2243: #ifdef unix
2244: '\n'
2245: #else
2246: '\r','\n'
2247: #endif
2248: };
2249: c_addr=newline;
2250: u=sizeof(newline);
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>