[gforth] / gforth / prim

gforth: gforth/prim

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

CVS Admin

gforth: gforth/prim

ViewCVS and CVS Help