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