[gforth] / gforth / prim

gforth: gforth/prim

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

CVS Admin

gforth: gforth/prim

ViewCVS and CVS Help