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