[gforth] / gforth / prim

gforth: gforth/prim

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

CVS Admin

gforth: gforth/prim

ViewCVS and CVS Help