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