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