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