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