[gforth] / gforth / engine / main.c

gforth: gforth/engine/main.c

1 :	anton	1.1	/* command line interpretation, image loading etc. for Gforth
2 :
3 :
4 :	anton	1.160	Copyright (C) 1995,1996,1997,1998,2000,2003,2004,2005 Free Software Foundation, Inc.
5 :	anton	1.1
6 :			This file is part of Gforth.
7 :
8 :			Gforth is free software; you can redistribute it and/or
9 :			modify it under the terms of the GNU General Public License
10 :			as published by the Free Software Foundation; either version 2
11 :			of the License, or (at your option) any later version.
12 :
13 :			This program is distributed in the hope that it will be useful,
14 :			but WITHOUT ANY WARRANTY; without even the implied warranty of
15 :			MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 :			GNU General Public License for more details.
17 :
18 :			You should have received a copy of the GNU General Public License
19 :			along with this program; if not, write to the Free Software
20 :	anton	1.40	Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
21 :	anton	1.1	*/
22 :
23 :			#include "config.h"
24 :	anton	1.82	#include "forth.h"
25 :	anton	1.1	#include <errno.h>
26 :			#include <ctype.h>
27 :			#include <stdio.h>
28 :	pazsan	1.2	#include <unistd.h>
29 :	anton	1.1	#include <string.h>
30 :			#include <math.h>
31 :			#include <sys/types.h>
32 :	pazsan	1.32	#ifndef STANDALONE
33 :	anton	1.1	#include <sys/stat.h>
34 :	pazsan	1.32	#endif
35 :	anton	1.1	#include <fcntl.h>
36 :			#include <assert.h>
37 :			#include <stdlib.h>
38 :	anton	1.102	#include <signal.h>
39 :	pazsan	1.11	#ifndef STANDALONE
40 :	anton	1.1	#if HAVE_SYS_MMAN_H
41 :			#include <sys/mman.h>
42 :			#endif
43 :	pazsan	1.11	#endif
44 :	anton	1.1	#include "io.h"
45 :			#include "getopt.h"
46 :	pazsan	1.11	#ifdef STANDALONE
47 :			#include <systypes.h>
48 :			#endif
49 :	anton	1.1
50 :	anton	1.121	typedef enum prim_num {
51 :	anton	1.119	/* definitions of N_execute etc. */
52 :	anton	1.126	#include PRIM_NUM_I
53 :	anton	1.119	N_START_SUPER
54 :	anton	1.121	} PrimNum;
55 :	anton	1.119
56 :	anton	1.79	/* global variables for engine.c
57 :			We put them here because engine.c is compiled several times in
58 :			different ways for the same engine. */
59 :	pazsan	1.161	Cell *gforth_SP;
60 :			Float *gforth_FP;
61 :			Address gforth_UP=NULL;
62 :	anton	1.79
63 :	pazsan	1.115	#ifdef HAS_FFCALL
64 :	pazsan	1.161	Cell *gforth_RP;
65 :			Address gforth_LP;
66 :	pazsan	1.115
67 :			#include <callback.h>
68 :
69 :	pazsan	1.161	va_alist gforth_clist;
70 :	pazsan	1.115
71 :	pazsan	1.161	void gforth_callback(Xt* fcall, void * alist)
72 :	pazsan	1.115	{
73 :	pazsan	1.140	/* save global valiables */
74 :	pazsan	1.161	Cell *rp = gforth_RP;
75 :			Cell *sp = gforth_SP;
76 :			Float *fp = gforth_FP;
77 :			Address lp = gforth_LP;
78 :	pazsan	1.140
79 :	pazsan	1.161	gforth_clist = (va_alist)alist;
80 :	pazsan	1.140
81 :	pazsan	1.161	gforth_engine(fcall, sp, rp, fp, lp);
82 :	pazsan	1.140
83 :			/* restore global variables */
84 :	pazsan	1.161	gforth_RP = rp;
85 :			gforth_SP = sp;
86 :			gforth_FP = fp;
87 :			gforth_LP = lp;
88 :	pazsan	1.115	}
89 :			#endif
90 :
91 :	pazsan	1.153	#ifdef HAS_LIBFFI
92 :	pazsan	1.161	Cell *gforth_RP;
93 :			Address gforth_LP;
94 :	pazsan	1.153
95 :			#include <ffi.h>
96 :
97 :	pazsan	1.164	void ** gforth_clist;
98 :			void * gforth_ritem;
99 :	pazsan	1.153
100 :	pazsan	1.162	void gforth_callback(ffi_cif * cif, void * resp, void ** args, void * ip)
101 :	pazsan	1.153	{
102 :	pazsan	1.161	Cell *rp = gforth_RP;
103 :			Cell *sp = gforth_SP;
104 :			Float *fp = gforth_FP;
105 :			Address lp = gforth_LP;
106 :	pazsan	1.153
107 :	pazsan	1.164	gforth_clist = args;
108 :			gforth_ritem = resp;
109 :	pazsan	1.153
110 :	pazsan	1.164	gforth_engine((Xt *)ip, sp, rp, fp, lp);
111 :	pazsan	1.153
112 :			/* restore global variables */
113 :	pazsan	1.161	gforth_RP = rp;
114 :			gforth_SP = sp;
115 :			gforth_FP = fp;
116 :			gforth_LP = lp;
117 :	pazsan	1.153	}
118 :			#endif
119 :
120 :	anton	1.79	#ifdef GFORTH_DEBUGGING
121 :			/* define some VM registers as global variables, so they survive exceptions;
122 :			global register variables are not up to the task (according to the
123 :			GNU C manual) */
124 :			Xt *saved_ip;
125 :			Cell *rp;
126 :			#endif
127 :
128 :			#ifdef NO_IP
129 :			Label next_code;
130 :			#endif
131 :
132 :			#ifdef HAS_FILE
133 :			char* fileattr[6]={"rb","rb","r+b","r+b","wb","wb"};
134 :			char* pfileattr[6]={"r","r","r+","r+","w","w"};
135 :
136 :			#ifndef O_BINARY
137 :			#define O_BINARY 0
138 :			#endif
139 :			#ifndef O_TEXT
140 :			#define O_TEXT 0
141 :			#endif
142 :
143 :			int ufileattr[6]= {
144 :			O_RDONLY\|O_BINARY, O_RDONLY\|O_BINARY,
145 :			O_RDWR \|O_BINARY, O_RDWR \|O_BINARY,
146 :			O_WRONLY\|O_BINARY, O_WRONLY\|O_BINARY };
147 :			#endif
148 :			/* end global vars for engine.c */
149 :
150 :	anton	1.1	#define PRIM_VERSION 1
151 :			/* increment this whenever the primitives change in an incompatible way */
152 :
153 :	pazsan	1.14	#ifndef DEFAULTPATH
154 :	anton	1.39	# define DEFAULTPATH "."
155 :	pazsan	1.14	#endif
156 :
157 :	anton	1.1	#ifdef MSDOS
158 :			jmp_buf throw_jmp_buf;
159 :			#endif
160 :
161 :	anton	1.56	#if defined(DOUBLY_INDIRECT)
162 :			# define CFA(n) ({Cell _n = (n); ((Cell)(((_n & 0x4000) ? symbols : xts)+(_n&~0x4000UL)));})
163 :	anton	1.1	#else
164 :	anton	1.56	# define CFA(n) ((Cell)(symbols+((n)&~0x4000UL)))
165 :	anton	1.1	#endif
166 :
167 :			#define maxaligned(n) (typeof(n))((((Cell)n)+sizeof(Float)-1)&-sizeof(Float))
168 :
169 :			static UCell dictsize=0;
170 :			static UCell dsize=0;
171 :			static UCell rsize=0;
172 :			static UCell fsize=0;
173 :			static UCell lsize=0;
174 :			int offset_image=0;
175 :	anton	1.4	int die_on_signal=0;
176 :	pazsan	1.13	#ifndef INCLUDE_IMAGE
177 :	anton	1.1	static int clear_dictionary=0;
178 :	anton	1.24	UCell pagesize=1;
179 :	pazsan	1.22	char *progname;
180 :			#else
181 :			char *progname = "gforth";
182 :			int optind = 1;
183 :	pazsan	1.13	#endif
184 :	pazsan	1.31
185 :	anton	1.131	#define CODE_BLOCK_SIZE (40961024) / !! overflow handling for -native */
186 :	anton	1.48	Address code_area=0;
187 :	anton	1.73	Cell code_area_size = CODE_BLOCK_SIZE;
188 :	anton	1.75	Address code_here=NULL+CODE_BLOCK_SIZE; /* does for code-area what HERE
189 :			does for the dictionary */
190 :	anton	1.100	Address start_flush=NULL; /* start of unflushed code */
191 :	anton	1.74	Cell last_jump=0; /* if the last prim was compiled without jump, this
192 :			is it's number, otherwise this contains 0 */
193 :	anton	1.48
194 :	anton	1.60	static int no_super=0; /* true if compile_prim should not fuse prims */
195 :	anton	1.81	static int no_dynamic=NO_DYNAMIC_DEFAULT; /* if true, no code is generated
196 :			dynamically */
197 :	anton	1.110	static int print_metrics=0; /* if true, print metrics on exit */
198 :	anton	1.157	static int static_super_number = 0; /10000000;/ /* number of ss used if available */
199 :	anton	1.152	#define MAX_STATE 9 /* maximum number of states */
200 :	anton	1.125	static int maxstates = MAX_STATE; /* number of states for stack caching */
201 :	anton	1.110	static int ss_greedy = 0; /* if true: use greedy, not optimal ss selection */
202 :	pazsan	1.144	static int diag = 0; /* if true: print diagnostic informations */
203 :	anton	1.158	static int tpa_noequiv = 0; /* if true: no state equivalence checking */
204 :			static int tpa_noautomaton = 0; /* if true: no tree parsing automaton */
205 :			static int tpa_trace = 0; /* if true: data for line graph of new states etc. */
206 :	pazsan	1.144	static int relocs = 0;
207 :			static int nonrelocs = 0;
208 :	anton	1.60
209 :	pazsan	1.30	#ifdef HAS_DEBUG
210 :	anton	1.68	int debug=0;
211 :	pazsan	1.144	# define debugp(x...) if (debug) fprintf(x);
212 :	pazsan	1.31	#else
213 :			# define perror(x...)
214 :			# define fprintf(x...)
215 :	pazsan	1.144	# define debugp(x...)
216 :	pazsan	1.30	#endif
217 :	pazsan	1.31
218 :	anton	1.24	ImageHeader *gforth_header;
219 :	anton	1.43	Label *vm_prims;
220 :	anton	1.53	#ifdef DOUBLY_INDIRECT
221 :			Label xts; / same content as vm_prims, but should only be used for xts */
222 :			#endif
223 :	anton	1.1
224 :	anton	1.125	#ifndef NO_DYNAMIC
225 :			#define MAX_IMMARGS 2
226 :
227 :			typedef struct {
228 :			Label start; /* NULL if not relocatable */
229 :			Cell length; /* only includes the jump iff superend is true*/
230 :			Cell restlength; /* length of the rest (i.e., the jump or (on superend) 0) */
231 :			char superend; /* true if primitive ends superinstruction, i.e.,
232 :			unconditional branch, execute, etc. */
233 :			Cell nimmargs;
234 :			struct immarg {
235 :			Cell offset; /* offset of immarg within prim */
236 :			char rel; /* true if immarg is relative */
237 :			} immargs[MAX_IMMARGS];
238 :			} PrimInfo;
239 :
240 :			PrimInfo *priminfos;
241 :			PrimInfo **decomp_prims;
242 :
243 :	anton	1.139	const char const* const prim_names[]={
244 :			#include PRIM_NAMES_I
245 :			};
246 :
247 :	anton	1.148	void init_ss_cost(void);
248 :
249 :	anton	1.125	static int is_relocatable(int p)
250 :			{
251 :			return !no_dynamic && priminfos[p].start != NULL;
252 :			}
253 :			#else /* defined(NO_DYNAMIC) */
254 :			static int is_relocatable(int p)
255 :			{
256 :			return 0;
257 :			}
258 :			#endif /* defined(NO_DYNAMIC) */
259 :
260 :	pazsan	1.30	#ifdef MEMCMP_AS_SUBROUTINE
261 :			int gforth_memcmp(const char * s1, const char * s2, size_t n)
262 :			{
263 :			return memcmp(s1, s2, n);
264 :			}
265 :			#endif
266 :
267 :	anton	1.125	static Cell max(Cell a, Cell b)
268 :			{
269 :			return a>b?a:b;
270 :			}
271 :
272 :			static Cell min(Cell a, Cell b)
273 :			{
274 :			return a<b?a:b;
275 :			}
276 :
277 :	anton	1.1	/* image file format:
278 :	pazsan	1.15	* "#! binary-path -i\n" (e.g., "#! /usr/local/bin/gforth-0.4.0 -i\n")
279 :	anton	1.1	* padding to a multiple of 8
280 :	anton	1.84	* magic: "Gforth3x" means format 0.6,
281 :	pazsan	1.15	* where x is a byte with
282 :			* bit 7: reserved = 0
283 :			* bit 6:5: address unit size 2^n octets
284 :			* bit 4:3: character size 2^n octets
285 :			* bit 2:1: cell size 2^n octets
286 :			* bit 0: endian, big=0, little=1.
287 :			* The magic are always 8 octets, no matter what the native AU/character size is
288 :	anton	1.1	* padding to max alignment (no padding necessary on current machines)
289 :	anton	1.24	* ImageHeader structure (see forth.h)
290 :	anton	1.1	* data (size in ImageHeader.image_size)
291 :			* tags ((if relocatable, 1 bit/data cell)
292 :			*
293 :			* tag==1 means that the corresponding word is an address;
294 :			* If the word is >=0, the address is within the image;
295 :			* addresses within the image are given relative to the start of the image.
296 :			* If the word =-1 (CF_NIL), the address is NIL,
297 :			* If the word is <CF_NIL and >CF(DODOES), it's a CFA (:, Create, ...)
298 :			* If the word =CF(DODOES), it's a DOES> CFA
299 :			* If the word =CF(DOESJUMP), it's a DOES JUMP (2 Cells after DOES>,
300 :			* possibly containing a jump to dodoes)
301 :	anton	1.51	* If the word is <CF(DOESJUMP) and bit 14 is set, it's the xt of a primitive
302 :			* If the word is <CF(DOESJUMP) and bit 14 is clear,
303 :			* it's the threaded code of a primitive
304 :	pazsan	1.85	* bits 13..9 of a primitive token state which group the primitive belongs to,
305 :			* bits 8..0 of a primitive token index into the group
306 :	anton	1.1	*/
307 :
308 :	pazsan	1.115	Cell groups[32] = {
309 :	pazsan	1.85	0,
310 :	anton	1.121	0
311 :	anton	1.90	#undef GROUP
312 :	pazsan	1.115	#undef GROUPADD
313 :			#define GROUPADD(n) +n
314 :			#define GROUP(x, n) , 0
315 :	anton	1.126	#include PRIM_GRP_I
316 :	anton	1.90	#undef GROUP
317 :	pazsan	1.115	#undef GROUPADD
318 :	pazsan	1.85	#define GROUP(x, n)
319 :	pazsan	1.115	#define GROUPADD(n)
320 :	pazsan	1.85	};
321 :
322 :	pazsan	1.161	static unsigned char branch_targets(Cell image, const unsigned char *bitstring,
323 :	anton	1.125	int size, Cell base)
324 :			/* produce a bitmask marking all the branch targets */
325 :			{
326 :	anton	1.130	int i=0, j, k, steps=(((size-1)/sizeof(Cell))/RELINFOBITS)+1;
327 :	anton	1.125	Cell token;
328 :			unsigned char bits;
329 :	anton	1.130	unsigned char *result=malloc(steps);
330 :
331 :			memset(result, 0, steps);
332 :			for(k=0; k<steps; k++) {
333 :	anton	1.125	for(j=0, bits=bitstring[k]; j<RELINFOBITS; j++, i++, bits<<=1) {
334 :	anton	1.130	if(bits & (1U << (RELINFOBITS-1))) {
335 :			assert(i*sizeof(Cell) < size);
336 :	anton	1.125	token=image[i];
337 :			if (token>=base) { /* relocatable address */
338 :			UCell bitnum=(token-base)/sizeof(Cell);
339 :	anton	1.154	if (bitnum/RELINFOBITS < (UCell)steps)
340 :			result[bitnum/RELINFOBITS] \|= 1U << ((~bitnum)&(RELINFOBITS-1));
341 :	anton	1.125	}
342 :			}
343 :			}
344 :			}
345 :			return result;
346 :			}
347 :
348 :	pazsan	1.162	void gforth_relocate(Cell image, const Char bitstring,
349 :			UCell size, Cell base, Label symbols[])
350 :	anton	1.1	{
351 :	anton	1.130	int i=0, j, k, steps=(((size-1)/sizeof(Cell))/RELINFOBITS)+1;
352 :	pazsan	1.11	Cell token;
353 :	anton	1.1	char bits;
354 :	anton	1.37	Cell max_symbols;
355 :	jwilke	1.46	/*
356 :	pazsan	1.85	* A virtual start address that's the real start address minus
357 :	jwilke	1.46	* the one in the image
358 :			*/
359 :	jwilke	1.45	Cell start = (Cell ) (((void ) image) - ((void ) base));
360 :	anton	1.125	unsigned char *targets = branch_targets(image, bitstring, size, base);
361 :	anton	1.1
362 :	pazsan	1.85	/* group index into table */
363 :	pazsan	1.115	if(groups[31]==0) {
364 :			int groupsum=0;
365 :			for(i=0; i<32; i++) {
366 :			groupsum += groups[i];
367 :			groups[i] = groupsum;
368 :			/* printf("group[%d]=%d\n",i,groupsum); */
369 :			}
370 :			i=0;
371 :			}
372 :	jwilke	1.46
373 :			/* printf("relocating to %x[%x] start=%x base=%x\n", image, size, start, base); */
374 :	anton	1.37
375 :	anton	1.121	for (max_symbols=0; symbols[max_symbols]!=0; max_symbols++)
376 :	anton	1.37	;
377 :	anton	1.47	max_symbols--;
378 :	pazsan	1.35
379 :	anton	1.130	for(k=0; k<steps; k++) {
380 :	pazsan	1.13	for(j=0, bits=bitstring[k]; j<RELINFOBITS; j++, i++, bits<<=1) {
381 :	anton	1.1	/* fprintf(stderr,"relocate: image[%d]\n", i);*/
382 :	anton	1.130	if(bits & (1U << (RELINFOBITS-1))) {
383 :			assert(i*sizeof(Cell) < size);
384 :	pazsan	1.35	/* fprintf(stderr,"relocate: image[%d]=%d of %d\n", i, image[i], size/sizeof(Cell)); */
385 :	jwilke	1.45	token=image[i];
386 :	pazsan	1.85	if(token<0) {
387 :			int group = (-token & 0x3E00) >> 9;
388 :			if(group == 0) {
389 :			switch(token\|0x4000) {
390 :	anton	1.1	case CF_NIL : image[i]=0; break;
391 :			#if !defined(DOUBLY_INDIRECT)
392 :			case CF(DOCOL) :
393 :			case CF(DOVAR) :
394 :			case CF(DOCON) :
395 :			case CF(DOUSER) :
396 :			case CF(DODEFER) :
397 :	pazsan	1.11	case CF(DOFIELD) : MAKE_CF(image+i,symbols[CF(token)]); break;
398 :	anton	1.92	case CF(DOESJUMP): image[i]=0; break;
399 :	anton	1.1	#endif /* !defined(DOUBLY_INDIRECT) */
400 :			case CF(DODOES) :
401 :	jwilke	1.45	MAKE_DOES_CF(image+i,(Xt *)(image[i+1]+((Cell)start)));
402 :	anton	1.1	break;
403 :	pazsan	1.85	default : /* backward compatibility */
404 :	anton	1.56	/* printf("Code field generation image[%x]:=CFA(%x)\n",
405 :	anton	1.1	i, CF(image[i])); */
406 :	anton	1.55	if (CF((token \| 0x4000))<max_symbols) {
407 :	anton	1.56	image[i]=(Cell)CFA(CF(token));
408 :			#ifdef DIRECT_THREADED
409 :	anton	1.125	if ((token & 0x4000) == 0) { /* threade code, no CFA */
410 :			if (targets[k] & (1U<<(RELINFOBITS-1-j)))
411 :			compile_prim1(0);
412 :	anton	1.70	compile_prim1(&image[i]);
413 :	anton	1.125	}
414 :	anton	1.56	#endif
415 :	anton	1.55	} else
416 :	pazsan	1.115	fprintf(stderr,"Primitive %ld used in this image at $%lx (offset $%x) is not implemented by this\n engine (%s); executing this code will crash.\n",(long)CF(token),(long)&image[i], i, PACKAGE_VERSION);
417 :	anton	1.1	}
418 :	pazsan	1.85	} else {
419 :			int tok = -token & 0x1FF;
420 :			if (tok < (groups[group+1]-groups[group])) {
421 :			#if defined(DOUBLY_INDIRECT)
422 :			image[i]=(Cell)CFA(((groups[group]+tok) \| (CF(token) & 0x4000)));
423 :			#else
424 :			image[i]=(Cell)CFA((groups[group]+tok));
425 :			#endif
426 :			#ifdef DIRECT_THREADED
427 :	anton	1.125	if ((token & 0x4000) == 0) { /* threade code, no CFA */
428 :			if (targets[k] & (1U<<(RELINFOBITS-1-j)))
429 :			compile_prim1(0);
430 :	pazsan	1.85	compile_prim1(&image[i]);
431 :	anton	1.125	}
432 :	pazsan	1.85	#endif
433 :			} else
434 :	pazsan	1.115	fprintf(stderr,"Primitive %lx, %d of group %d used in this image at $%lx (offset $%x) is not implemented by this\n engine (%s); executing this code will crash.\n", (long)-token, tok, group, (long)&image[i],i,PACKAGE_VERSION);
435 :	pazsan	1.85	}
436 :			} else {
437 :	anton	1.101	/* if base is > 0: 0 is a null reference so don't adjust*/
438 :	jwilke	1.45	if (token>=base) {
439 :			image[i]+=(Cell)start;
440 :			}
441 :	jwilke	1.46	}
442 :	anton	1.1	}
443 :			}
444 :	pazsan	1.31	}
445 :	anton	1.125	free(targets);
446 :	anton	1.70	finish_code();
447 :	jwilke	1.26	((ImageHeader*)(image))->base = (Address) image;
448 :	anton	1.1	}
449 :
450 :	pazsan	1.162	#ifndef DOUBLY_INDIRECT
451 :	pazsan	1.161	static UCell checksum(Label symbols[])
452 :	anton	1.1	{
453 :			UCell r=PRIM_VERSION;
454 :			Cell i;
455 :
456 :			for (i=DOCOL; i<=DOESJUMP; i++) {
457 :			r ^= (UCell)(symbols[i]);
458 :			r = (r << 5) \| (r >> (8*sizeof(Cell)-5));
459 :			}
460 :			#ifdef DIRECT_THREADED
461 :			/* we have to consider all the primitives */
462 :			for (; symbols[i]!=(Label)0; i++) {
463 :			r ^= (UCell)(symbols[i]);
464 :			r = (r << 5) \| (r >> (8*sizeof(Cell)-5));
465 :			}
466 :			#else
467 :			/* in indirect threaded code all primitives are accessed through the
468 :			symbols table, so we just have to put the base address of symbols
469 :			in the checksum */
470 :			r ^= (UCell)symbols;
471 :			#endif
472 :			return r;
473 :			}
474 :	pazsan	1.162	#endif
475 :	anton	1.1
476 :	pazsan	1.161	static Address verbose_malloc(Cell size)
477 :	anton	1.3	{
478 :			Address r;
479 :			/* leave a little room (64B) for stack underflows */
480 :			if ((r = malloc(size+64))==NULL) {
481 :			perror(progname);
482 :			exit(1);
483 :			}
484 :			r = (Address)((((Cell)r)+(sizeof(Float)-1))&(-sizeof(Float)));
485 :	pazsan	1.144	debugp(stderr, "malloc succeeds, address=$%lx\n", (long)r);
486 :	anton	1.3	return r;
487 :			}
488 :
489 :	anton	1.33	static Address next_address=0;
490 :	pazsan	1.161	static void after_alloc(Address r, Cell size)
491 :	anton	1.33	{
492 :			if (r != (Address)-1) {
493 :	pazsan	1.144	debugp(stderr, "success, address=$%lx\n", (long) r);
494 :	anton	1.33	if (pagesize != 1)
495 :			next_address = (Address)(((((Cell)r)+size-1)&-pagesize)+2pagesize); / leave one page unmapped */
496 :			} else {
497 :	pazsan	1.144	debugp(stderr, "failed: %s\n", strerror(errno));
498 :	anton	1.33	}
499 :			}
500 :
501 :	anton	1.34	#ifndef MAP_FAILED
502 :			#define MAP_FAILED ((Address) -1)
503 :			#endif
504 :			#ifndef MAP_FILE
505 :			# define MAP_FILE 0
506 :			#endif
507 :			#ifndef MAP_PRIVATE
508 :			# define MAP_PRIVATE 0
509 :			#endif
510 :	anton	1.91	#if !defined(MAP_ANON) && defined(MAP_ANONYMOUS)
511 :			# define MAP_ANON MAP_ANONYMOUS
512 :			#endif
513 :	anton	1.34
514 :			#if defined(HAVE_MMAP)
515 :			static Address alloc_mmap(Cell size)
516 :	anton	1.1	{
517 :			Address r;
518 :
519 :			#if defined(MAP_ANON)
520 :	pazsan	1.144	debugp(stderr,"try mmap($%lx, $%lx, ..., MAP_ANON, ...); ", (long)next_address, (long)size);
521 :	anton	1.34	r = mmap(next_address, size, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_ANON\|MAP_PRIVATE, -1, 0);
522 :	anton	1.1	#else /* !defined(MAP_ANON) */
523 :	anton	1.17	/* Ultrix (at least) does not define MAP_FILE and MAP_PRIVATE (both are
524 :			apparently defaults) */
525 :	anton	1.1	static int dev_zero=-1;
526 :
527 :			if (dev_zero == -1)
528 :			dev_zero = open("/dev/zero", O_RDONLY);
529 :			if (dev_zero == -1) {
530 :	anton	1.34	r = MAP_FAILED;
531 :	pazsan	1.144	debugp(stderr, "open(\"/dev/zero\"...) failed (%s), no mmap; ",
532 :	anton	1.1	strerror(errno));
533 :			} else {
534 :	pazsan	1.144	debugp(stderr,"try mmap($%lx, $%lx, ..., MAP_FILE, dev_zero, ...); ", (long)next_address, (long)size);
535 :	anton	1.1	r=mmap(next_address, size, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_FILE\|MAP_PRIVATE, dev_zero, 0);
536 :			}
537 :			#endif /* !defined(MAP_ANON) */
538 :	anton	1.34	after_alloc(r, size);
539 :			return r;
540 :			}
541 :			#endif
542 :
543 :	pazsan	1.161	Address gforth_alloc(Cell size)
544 :	anton	1.34	{
545 :			#if HAVE_MMAP
546 :			Address r;
547 :
548 :			r=alloc_mmap(size);
549 :	anton	1.117	if (r!=(Address)MAP_FAILED)
550 :	anton	1.1	return r;
551 :			#endif /* HAVE_MMAP */
552 :	anton	1.3	/* use malloc as fallback */
553 :			return verbose_malloc(size);
554 :	anton	1.1	}
555 :
556 :	pazsan	1.161	static Address dict_alloc_read(FILE *file, Cell imagesize, Cell dictsize, Cell offset)
557 :	anton	1.33	{
558 :	anton	1.34	Address image = MAP_FAILED;
559 :	anton	1.33
560 :	anton	1.56	#if defined(HAVE_MMAP)
561 :	anton	1.33	if (offset==0) {
562 :	anton	1.34	image=alloc_mmap(dictsize);
563 :	anton	1.150	if (image != (Address)MAP_FAILED) {
564 :			Address image1;
565 :			debugp(stderr,"try mmap($%lx, $%lx, ..., MAP_FIXED\|MAP_FILE, imagefile, 0); ", (long)image, (long)imagesize);
566 :			image1 = mmap(image, imagesize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_FIXED\|MAP_FILE\|MAP_PRIVATE, fileno(file), 0);
567 :			after_alloc(image1,dictsize);
568 :			if (image1 == (Address)MAP_FAILED)
569 :			goto read_image;
570 :			}
571 :	anton	1.33	}
572 :	anton	1.56	#endif /* defined(HAVE_MMAP) */
573 :	anton	1.117	if (image == (Address)MAP_FAILED) {
574 :	pazsan	1.161	image = gforth_alloc(dictsize+offset)+offset;
575 :	anton	1.149	read_image:
576 :	anton	1.33	rewind(file); /* fseek(imagefile,0L,SEEK_SET); */
577 :	anton	1.34	fread(image, 1, imagesize, file);
578 :	anton	1.33	}
579 :			return image;
580 :			}
581 :
582 :	pazsan	1.10	void set_stack_sizes(ImageHeader * header)
583 :			{
584 :			if (dictsize==0)
585 :			dictsize = header->dict_size;
586 :			if (dsize==0)
587 :			dsize = header->data_stack_size;
588 :			if (rsize==0)
589 :			rsize = header->return_stack_size;
590 :			if (fsize==0)
591 :			fsize = header->fp_stack_size;
592 :			if (lsize==0)
593 :			lsize = header->locals_stack_size;
594 :			dictsize=maxaligned(dictsize);
595 :			dsize=maxaligned(dsize);
596 :			rsize=maxaligned(rsize);
597 :			lsize=maxaligned(lsize);
598 :			fsize=maxaligned(fsize);
599 :			}
600 :
601 :			void alloc_stacks(ImageHeader * header)
602 :			{
603 :			header->dict_size=dictsize;
604 :			header->data_stack_size=dsize;
605 :			header->fp_stack_size=fsize;
606 :			header->return_stack_size=rsize;
607 :			header->locals_stack_size=lsize;
608 :
609 :	pazsan	1.161	header->data_stack_base=gforth_alloc(dsize);
610 :			header->fp_stack_base=gforth_alloc(fsize);
611 :			header->return_stack_base=gforth_alloc(rsize);
612 :			header->locals_stack_base=gforth_alloc(lsize);
613 :	pazsan	1.10	}
614 :
615 :	pazsan	1.161	#warning You can ignore the warnings about clobbered variables in gforth_go
616 :			int gforth_go(Address image, int stack, Cell *entries)
617 :	pazsan	1.11	{
618 :	anton	1.38	volatile ImageHeader image_header = (ImageHeader )image;
619 :	anton	1.18	Cell sp0=(Cell)(image_header->data_stack_base + dsize);
620 :	pazsan	1.44	Cell rp0=(Cell )(image_header->return_stack_base + rsize);
621 :	anton	1.18	Float fp0=(Float )(image_header->fp_stack_base + fsize);
622 :	pazsan	1.44	#ifdef GFORTH_DEBUGGING
623 :	anton	1.38	volatile Cell *orig_rp0=rp0;
624 :	pazsan	1.44	#endif
625 :	anton	1.18	Address lp0=image_header->locals_stack_base + lsize;
626 :			Xt ip0=(Xt )(image_header->boot_entry);
627 :	pazsan	1.13	#ifdef SYSSIGNALS
628 :	pazsan	1.11	int throw_code;
629 :	pazsan	1.13	#endif
630 :	pazsan	1.11
631 :			/* ensure that the cached elements (if any) are accessible */
632 :	anton	1.151	#if !(defined(GFORTH_DEBUGGING) \|\| defined(INDIRECT_THREADED) \|\| defined(DOUBLY_INDIRECT) \|\| defined(VM_PROFILING))
633 :			sp0 -= 8; /* make stuff below bottom accessible for stack caching */
634 :			#endif
635 :	anton	1.41	IF_fpTOS(fp0--);
636 :	pazsan	1.11
637 :			for(;stack>0;stack--)
638 :	anton	1.18	*--sp0=entries[stack-1];
639 :	pazsan	1.11
640 :	pazsan	1.30	#ifdef SYSSIGNALS
641 :	pazsan	1.11	get_winsize();
642 :
643 :			install_signal_handlers(); /* right place? */
644 :
645 :			if ((throw_code=setjmp(throw_jmp_buf))) {
646 :	anton	1.152	static Cell signal_data_stack[24];
647 :			static Cell signal_return_stack[16];
648 :	pazsan	1.11	static Float signal_fp_stack[1];
649 :	pazsan	1.13
650 :	anton	1.152	signal_data_stack[15]=throw_code;
651 :	anton	1.18
652 :			#ifdef GFORTH_DEBUGGING
653 :	pazsan	1.144	debugp(stderr,"\ncaught signal, throwing exception %d, ip=%p rp=%p\n",
654 :	anton	1.97	throw_code, saved_ip, rp);
655 :	anton	1.38	if (rp <= orig_rp0 && rp > (Cell *)(image_header->return_stack_base+5)) {
656 :	anton	1.18	/* no rstack overflow or underflow */
657 :			rp0 = rp;
658 :	anton	1.63	*--rp0 = (Cell)saved_ip;
659 :	anton	1.18	}
660 :			else /* I love non-syntactic ifdefs :-) */
661 :	anton	1.152	rp0 = signal_return_stack+16;
662 :	anton	1.97	#else /* !defined(GFORTH_DEBUGGING) */
663 :	pazsan	1.144	debugp(stderr,"\ncaught signal, throwing exception %d\n", throw_code);
664 :	anton	1.152	rp0 = signal_return_stack+16;
665 :	anton	1.97	#endif /* !defined(GFORTH_DEBUGGING) */
666 :	anton	1.25	/* fprintf(stderr, "rp=$%x\n",rp0);*/
667 :	pazsan	1.11
668 :	pazsan	1.164	return((int)(Cell)gforth_engine(image_header->throw_entry, signal_data_stack+15,
669 :	anton	1.18	rp0, signal_fp_stack, 0));
670 :	pazsan	1.11	}
671 :	pazsan	1.13	#endif
672 :	pazsan	1.11
673 :	pazsan	1.164	return((int)(Cell)gforth_engine(ip0,sp0,rp0,fp0,lp0));
674 :	pazsan	1.11	}
675 :
676 :	pazsan	1.30	#ifndef INCLUDE_IMAGE
677 :	pazsan	1.161	static void print_sizes(Cell sizebyte)
678 :	anton	1.21	/* print size information */
679 :			{
680 :			static char* endianstring[]= { " big","little" };
681 :
682 :			fprintf(stderr,"%s endian, cell=%d bytes, char=%d bytes, au=%d bytes\n",
683 :			endianstring[sizebyte & 1],
684 :			1 << ((sizebyte >> 1) & 3),
685 :			1 << ((sizebyte >> 3) & 3),
686 :			1 << ((sizebyte >> 5) & 3));
687 :			}
688 :
689 :	anton	1.106	/* static superinstruction stuff */
690 :
691 :	anton	1.141	struct cost { /* super_info might be a more accurate name */
692 :	anton	1.106	char loads; /* number of stack loads */
693 :			char stores; /* number of stack stores */
694 :			char updates; /* number of stack pointer updates */
695 :	anton	1.123	char branch; /* is it a branch (SET_IP) */
696 :	anton	1.125	unsigned char state_in; /* state on entry */
697 :			unsigned char state_out; /* state on exit */
698 :	anton	1.142	unsigned char imm_ops; /* number of immediate operands */
699 :	anton	1.123	short offset; /* offset into super2 table */
700 :	anton	1.125	unsigned char length; /* number of components */
701 :	anton	1.106	};
702 :
703 :	anton	1.121	PrimNum super2[] = {
704 :	anton	1.126	#include SUPER2_I
705 :	anton	1.106	};
706 :
707 :			struct cost super_costs[] = {
708 :	anton	1.126	#include COSTS_I
709 :	anton	1.106	};
710 :
711 :	anton	1.125	struct super_state {
712 :			struct super_state *next;
713 :			PrimNum super;
714 :			};
715 :
716 :	anton	1.106	#define HASH_SIZE 256
717 :
718 :			struct super_table_entry {
719 :			struct super_table_entry *next;
720 :	anton	1.121	PrimNum *start;
721 :	anton	1.106	short length;
722 :	anton	1.125	struct super_state ss_list; / list of supers */
723 :	anton	1.106	} *super_table[HASH_SIZE];
724 :			int max_super=2;
725 :
726 :	anton	1.125	struct super_state *state_transitions=NULL;
727 :
728 :	pazsan	1.161	static int hash_super(PrimNum *start, int length)
729 :	anton	1.106	{
730 :			int i, r;
731 :
732 :			for (i=0, r=0; i<length; i++) {
733 :			r <<= 1;
734 :			r += start[i];
735 :			}
736 :			return r & (HASH_SIZE-1);
737 :			}
738 :
739 :	pazsan	1.161	static struct super_state *lookup_super(PrimNum start, int length)
740 :	anton	1.106	{
741 :			int hash=hash_super(start,length);
742 :			struct super_table_entry *p = super_table[hash];
743 :
744 :	anton	1.125	/* assert(length >= 2); */
745 :	anton	1.106	for (; p!=NULL; p = p->next) {
746 :			if (length == p->length &&
747 :	anton	1.121	memcmp((char )p->start, (char )start, length*sizeof(PrimNum))==0)
748 :	anton	1.125	return &(p->ss_list);
749 :	anton	1.106	}
750 :	anton	1.125	return NULL;
751 :	anton	1.106	}
752 :
753 :	pazsan	1.161	static void prepare_super_table()
754 :	anton	1.106	{
755 :			int i;
756 :	anton	1.109	int nsupers = 0;
757 :	anton	1.106
758 :			for (i=0; i<sizeof(super_costs)/sizeof(super_costs[0]); i++) {
759 :			struct cost *c = &super_costs[i];
760 :	anton	1.125	if ((c->length < 2 \|\| nsupers < static_super_number) &&
761 :			c->state_in < maxstates && c->state_out < maxstates) {
762 :			struct super_state **ss_listp= lookup_super(super2+c->offset, c->length);
763 :			struct super_state *ss = malloc(sizeof(struct super_state));
764 :			ss->super= i;
765 :			if (c->offset==N_noop && i != N_noop) {
766 :			if (is_relocatable(i)) {
767 :			ss->next = state_transitions;
768 :			state_transitions = ss;
769 :			}
770 :			} else if (ss_listp != NULL) {
771 :			ss->next = *ss_listp;
772 :			*ss_listp = ss;
773 :			} else {
774 :			int hash = hash_super(super2+c->offset, c->length);
775 :			struct super_table_entry **p = &super_table[hash];
776 :			struct super_table_entry *e = malloc(sizeof(struct super_table_entry));
777 :			ss->next = NULL;
778 :			e->next = *p;
779 :			e->start = super2 + c->offset;
780 :			e->length = c->length;
781 :			e->ss_list = ss;
782 :			*p = e;
783 :			}
784 :	anton	1.106	if (c->length > max_super)
785 :			max_super = c->length;
786 :	anton	1.125	if (c->length >= 2)
787 :			nsupers++;
788 :	anton	1.106	}
789 :			}
790 :	pazsan	1.144	debugp(stderr, "Using %d static superinsts\n", nsupers);
791 :	anton	1.106	}
792 :
793 :			/* dynamic replication/superinstruction stuff */
794 :
795 :	anton	1.69	#ifndef NO_DYNAMIC
796 :	pazsan	1.161	static int compare_priminfo_length(const void _a, const void _b)
797 :	anton	1.76	{
798 :	anton	1.90	PrimInfo a = (PrimInfo )_a;
799 :			PrimInfo b = (PrimInfo )_b;
800 :	anton	1.77	Cell diff = (a)->length - (b)->length;
801 :			if (diff)
802 :			return diff;
803 :			else /* break ties by start address; thus the decompiler produces
804 :			the earliest primitive with the same code (e.g. noop instead
805 :			of (char) and @ instead of >code-address */
806 :			return (b)->start - (a)->start;
807 :	anton	1.76	}
808 :	anton	1.112	#endif /* !defined(NO_DYNAMIC) */
809 :	anton	1.76
810 :	anton	1.125	static char MAYBE_UNUSED superend[]={
811 :	anton	1.126	#include PRIM_SUPEREND_I
812 :	anton	1.106	};
813 :	anton	1.107
814 :			Cell npriminfos=0;
815 :	anton	1.76
816 :	anton	1.146	Label goto_start;
817 :			Cell goto_len;
818 :
819 :	pazsan	1.162	#ifndef NO_DYNAMIC
820 :	pazsan	1.161	static int compare_labels(const void pa, const void pb)
821 :	anton	1.113	{
822 :	anton	1.114	Label a = (Label )pa;
823 :			Label b = (Label )pb;
824 :			return a-b;
825 :			}
826 :	pazsan	1.162	#endif
827 :	anton	1.113
828 :	pazsan	1.161	static Label bsearch_next(Label key, Label *a, UCell n)
829 :	anton	1.114	/* a is sorted; return the label >=key that is the closest in a;
830 :			return NULL if there is no label in a >=key */
831 :			{
832 :			int mid = (n-1)/2;
833 :			if (n<1)
834 :			return NULL;
835 :			if (n == 1) {
836 :			if (a[0] < key)
837 :			return NULL;
838 :			else
839 :			return a[0];
840 :			}
841 :			if (a[mid] < key)
842 :			return bsearch_next(key, a+mid+1, n-mid-1);
843 :			else
844 :			return bsearch_next(key, a, mid+1);
845 :	anton	1.113	}
846 :
847 :	pazsan	1.161	static void check_prims(Label symbols1[])
848 :	anton	1.47	{
849 :			int i;
850 :	anton	1.90	#ifndef NO_DYNAMIC
851 :	anton	1.146	Label symbols2, symbols3, ends1, ends1j, ends1jsorted, goto_p;
852 :	anton	1.119	int nends1j;
853 :	anton	1.90	#endif
854 :	anton	1.47
855 :	anton	1.66	if (debug)
856 :			#ifdef __VERSION__
857 :			fprintf(stderr, "Compiled with gcc-" __VERSION__ "\n");
858 :			#else
859 :			#define xstr(s) str(s)
860 :			#define str(s) #s
861 :			fprintf(stderr, "Compiled with gcc-" xstr(__GNUC__) "." xstr(__GNUC_MINOR__) "\n");
862 :			#endif
863 :	anton	1.121	for (i=0; symbols1[i]!=0; i++)
864 :	anton	1.47	;
865 :	anton	1.55	npriminfos = i;
866 :	anton	1.70
867 :			#ifndef NO_DYNAMIC
868 :	anton	1.66	if (no_dynamic)
869 :			return;
870 :	pazsan	1.164	symbols2=gforth_engine2(0,0,0,0,0);
871 :	anton	1.70	#if NO_IP
872 :	pazsan	1.164	symbols3=gforth_engine3(0,0,0,0,0);
873 :	anton	1.70	#else
874 :			symbols3=symbols1;
875 :			#endif
876 :	anton	1.121	ends1 = symbols1+i+1;
877 :	anton	1.119	ends1j = ends1+i;
878 :	anton	1.146	goto_p = ends1j+i+1; /* goto_p[0]==before; ...[1]==after;*/
879 :	anton	1.121	nends1j = i+1;
880 :	anton	1.119	ends1jsorted = (Label )alloca(nends1jsizeof(Label));
881 :			memcpy(ends1jsorted,ends1j,nends1j*sizeof(Label));
882 :			qsort(ends1jsorted, nends1j, sizeof(Label), compare_labels);
883 :	anton	1.146
884 :			/* check whether the "goto " is relocatable /
885 :			goto_len = goto_p[1]-goto_p[0];
886 :			debugp(stderr, "goto * %p %p len=%ld\n",
887 :			goto_p[0],symbols2[goto_p-symbols1],goto_len);
888 :			if (memcmp(goto_p[0],symbols2[goto_p-symbols1],goto_len)!=0) { /* unequal */
889 :			no_dynamic=1;
890 :			debugp(stderr," not relocatable, disabling dynamic code generation\n");
891 :	anton	1.148	init_ss_cost();
892 :	anton	1.146	return;
893 :			}
894 :			goto_start = goto_p[0];
895 :	anton	1.113
896 :	anton	1.47	priminfos = calloc(i,sizeof(PrimInfo));
897 :	anton	1.121	for (i=0; symbols1[i]!=0; i++) {
898 :	anton	1.70	int prim_len = ends1[i]-symbols1[i];
899 :	anton	1.47	PrimInfo *pi=&priminfos[i];
900 :	anton	1.154	struct cost *sc=&super_costs[i];
901 :	anton	1.70	int j=0;
902 :			char s1 = (char )symbols1[i];
903 :			char s2 = (char )symbols2[i];
904 :			char s3 = (char )symbols3[i];
905 :	anton	1.119	Label endlabel = bsearch_next(symbols1[i]+1,ends1jsorted,nends1j);
906 :	anton	1.70
907 :			pi->start = s1;
908 :	anton	1.121	pi->superend = superend[i]\|no_super;
909 :	anton	1.147	pi->length = prim_len;
910 :	anton	1.113	pi->restlength = endlabel - symbols1[i] - pi->length;
911 :	anton	1.70	pi->nimmargs = 0;
912 :	pazsan	1.144	relocs++;
913 :	anton	1.154	debugp(stderr, "%-15s %d-%d %4d %p %p %p len=%3ld rest=%2ld send=%1d",
914 :			prim_names[i], sc->state_in, sc->state_out,
915 :			i, s1, s2, s3, (long)(pi->length), (long)(pi->restlength),
916 :			pi->superend);
917 :	anton	1.114	if (endlabel == NULL) {
918 :			pi->start = NULL; /* not relocatable */
919 :	anton	1.122	if (pi->length<0) pi->length=100;
920 :	pazsan	1.144	debugp(stderr,"\n non_reloc: no J label > start found\n");
921 :			relocs--;
922 :			nonrelocs++;
923 :	anton	1.114	continue;
924 :			}
925 :			if (ends1[i] > endlabel && !pi->superend) {
926 :	anton	1.113	pi->start = NULL; /* not relocatable */
927 :	anton	1.122	pi->length = endlabel-symbols1[i];
928 :	pazsan	1.144	debugp(stderr,"\n non_reloc: there is a J label before the K label (restlength<0)\n");
929 :			relocs--;
930 :			nonrelocs++;
931 :	anton	1.113	continue;
932 :			}
933 :	anton	1.114	if (ends1[i] < pi->start && !pi->superend) {
934 :	anton	1.113	pi->start = NULL; /* not relocatable */
935 :	anton	1.122	pi->length = endlabel-symbols1[i];
936 :	pazsan	1.144	debugp(stderr,"\n non_reloc: K label before I label (length<0)\n");
937 :			relocs--;
938 :			nonrelocs++;
939 :	anton	1.113	continue;
940 :			}
941 :	anton	1.138	assert(pi->length>=0);
942 :	anton	1.113	assert(pi->restlength >=0);
943 :	anton	1.74	while (j<(pi->length+pi->restlength)) {
944 :	anton	1.70	if (s1[j]==s3[j]) {
945 :			if (s1[j] != s2[j]) {
946 :			pi->start = NULL; /* not relocatable */
947 :	pazsan	1.144	debugp(stderr,"\n non_reloc: engine1!=engine2 offset %3d",j);
948 :	anton	1.74	/* assert(j<prim_len); */
949 :	pazsan	1.144	relocs--;
950 :			nonrelocs++;
951 :	anton	1.70	break;
952 :			}
953 :			j++;
954 :			} else {
955 :			struct immarg *ia=&pi->immargs[pi->nimmargs];
956 :
957 :			pi->nimmargs++;
958 :			ia->offset=j;
959 :			if ((~(Cell )&(s1[j]))==(Cell )&(s3[j])) {
960 :			ia->rel=0;
961 :	pazsan	1.144	debugp(stderr,"\n absolute immarg: offset %3d",j);
962 :	anton	1.70	} else if ((&(s1[j]))+((Cell )&(s1[j]))+4 ==
963 :			symbols1[DOESJUMP+1]) {
964 :			ia->rel=1;
965 :	pazsan	1.144	debugp(stderr,"\n relative immarg: offset %3d",j);
966 :	anton	1.70	} else {
967 :			pi->start = NULL; /* not relocatable */
968 :	pazsan	1.144	debugp(stderr,"\n non_reloc: engine1!=engine3 offset %3d",j);
969 :	anton	1.74	/* assert(j<prim_len);*/
970 :	pazsan	1.144	relocs--;
971 :			nonrelocs++;
972 :	anton	1.70	break;
973 :			}
974 :			j+=4;
975 :	anton	1.47	}
976 :			}
977 :	pazsan	1.144	debugp(stderr,"\n");
978 :	anton	1.70	}
979 :	anton	1.76	decomp_prims = calloc(i,sizeof(PrimInfo *));
980 :			for (i=DOESJUMP+1; i<npriminfos; i++)
981 :			decomp_prims[i] = &(priminfos[i]);
982 :			qsort(decomp_prims+DOESJUMP+1, npriminfos-DOESJUMP-1, sizeof(PrimInfo *),
983 :			compare_priminfo_length);
984 :	anton	1.70	#endif
985 :			}
986 :
987 :	pazsan	1.161	static void flush_to_here(void)
988 :	anton	1.74	{
989 :	anton	1.93	#ifndef NO_DYNAMIC
990 :	anton	1.100	if (start_flush)
991 :			FLUSH_ICACHE(start_flush, code_here-start_flush);
992 :	anton	1.74	start_flush=code_here;
993 :	anton	1.93	#endif
994 :	anton	1.74	}
995 :
996 :	anton	1.93	#ifndef NO_DYNAMIC
997 :	pazsan	1.161	static void append_jump(void)
998 :	anton	1.74	{
999 :			if (last_jump) {
1000 :			PrimInfo *pi = &priminfos[last_jump];
1001 :
1002 :			memcpy(code_here, pi->start+pi->length, pi->restlength);
1003 :			code_here += pi->restlength;
1004 :	anton	1.147	memcpy(code_here, goto_start, goto_len);
1005 :			code_here += goto_len;
1006 :	anton	1.74	last_jump=0;
1007 :			}
1008 :			}
1009 :
1010 :	anton	1.75	/* Gforth remembers all code blocks in this list. On forgetting (by
1011 :			executing a marker) the code blocks are not freed (because Gforth does
1012 :			not remember how they were allocated; hmm, remembering that might be
1013 :			easier and cleaner). Instead, code_here etc. are reset to the old
1014 :			value, and the "forgotten" code blocks are reused when they are
1015 :			needed. */
1016 :
1017 :			struct code_block_list {
1018 :			struct code_block_list *next;
1019 :			Address block;
1020 :			Cell size;
1021 :			} code_block_list=NULL, *next_code_blockp=&code_block_list;
1022 :
1023 :	pazsan	1.161	static Address append_prim(Cell p)
1024 :	anton	1.74	{
1025 :			PrimInfo *pi = &priminfos[p];
1026 :			Address old_code_here = code_here;
1027 :
1028 :	anton	1.159	if (code_area+code_area_size < code_here+pi->length+pi->restlength+goto_len) {
1029 :	anton	1.75	struct code_block_list *p;
1030 :	anton	1.74	append_jump();
1031 :	anton	1.93	flush_to_here();
1032 :	anton	1.75	if (*next_code_blockp == NULL) {
1033 :	pazsan	1.161	code_here = start_flush = code_area = gforth_alloc(code_area_size);
1034 :	anton	1.75	p = (struct code_block_list *)malloc(sizeof(struct code_block_list));
1035 :			*next_code_blockp = p;
1036 :			p->next = NULL;
1037 :			p->block = code_here;
1038 :			p->size = code_area_size;
1039 :			} else {
1040 :			p = *next_code_blockp;
1041 :			code_here = start_flush = code_area = p->block;
1042 :			}
1043 :	anton	1.74	old_code_here = code_here;
1044 :	anton	1.75	next_code_blockp = &(p->next);
1045 :	anton	1.74	}
1046 :			memcpy(code_here, pi->start, pi->length);
1047 :			code_here += pi->length;
1048 :			return old_code_here;
1049 :			}
1050 :			#endif
1051 :	anton	1.75
1052 :			int forget_dyncode(Address code)
1053 :			{
1054 :			#ifdef NO_DYNAMIC
1055 :			return -1;
1056 :			#else
1057 :			struct code_block_list p, *pp;
1058 :
1059 :			for (pp=&code_block_list, p=pp; p!=NULL; pp=&(p->next), p=pp) {
1060 :			if (code >= p->block && code < p->block+p->size) {
1061 :			next_code_blockp = &(p->next);
1062 :			code_here = start_flush = code;
1063 :			code_area = p->block;
1064 :			last_jump = 0;
1065 :			return -1;
1066 :			}
1067 :			}
1068 :	anton	1.78	return -no_dynamic;
1069 :	anton	1.75	#endif /* !defined(NO_DYNAMIC) */
1070 :			}
1071 :
1072 :	pazsan	1.161	static long dyncodesize(void)
1073 :	anton	1.104	{
1074 :			#ifndef NO_DYNAMIC
1075 :	anton	1.106	struct code_block_list *p;
1076 :	anton	1.104	long size=0;
1077 :			for (p=code_block_list; p!=NULL; p=p->next) {
1078 :			if (code_here >= p->block && code_here < p->block+p->size)
1079 :			return size + (code_here - p->block);
1080 :			else
1081 :			size += p->size;
1082 :			}
1083 :			#endif /* !defined(NO_DYNAMIC) */
1084 :			return 0;
1085 :			}
1086 :
1087 :	anton	1.90	Label decompile_code(Label _code)
1088 :	anton	1.75	{
1089 :	anton	1.76	#ifdef NO_DYNAMIC
1090 :	anton	1.90	return _code;
1091 :	anton	1.76	#else /* !defined(NO_DYNAMIC) */
1092 :			Cell i;
1093 :	anton	1.77	struct code_block_list *p;
1094 :	anton	1.90	Address code=_code;
1095 :	anton	1.76
1096 :	anton	1.77	/* first, check if we are in code at all */
1097 :			for (p = code_block_list;; p = p->next) {
1098 :			if (p == NULL)
1099 :			return code;
1100 :			if (code >= p->block && code < p->block+p->size)
1101 :			break;
1102 :			}
1103 :	anton	1.76	/* reverse order because NOOP might match other prims */
1104 :			for (i=npriminfos-1; i>DOESJUMP; i--) {
1105 :			PrimInfo *pi=decomp_prims[i];
1106 :			if (pi->start==code \|\| (pi->start && memcmp(code,pi->start,pi->length)==0))
1107 :	anton	1.121	return vm_prims[super2[super_costs[pi-priminfos].offset]];
1108 :	anton	1.118	/* return pi->start;*/
1109 :	anton	1.76	}
1110 :			return code;
1111 :			#endif /* !defined(NO_DYNAMIC) */
1112 :	anton	1.75	}
1113 :	anton	1.74
1114 :	anton	1.70	#ifdef NO_IP
1115 :			int nbranchinfos=0;
1116 :
1117 :			struct branchinfo {
1118 :	anton	1.136	Label *targetpp; / *(bi->targetpp) is the target /
1119 :	anton	1.70	Cell addressptr; / store the target here */
1120 :			} branchinfos[100000];
1121 :
1122 :			int ndoesexecinfos=0;
1123 :			struct doesexecinfo {
1124 :			int branchinfo; /* fix the targetptr of branchinfos[...->branchinfo] */
1125 :	anton	1.136	Label targetp; /target for branch (because this is not in threaded code)*/
1126 :	anton	1.70	Cell xt; / cfa of word whose does-code needs calling */
1127 :			} doesexecinfos[10000];
1128 :
1129 :	pazsan	1.161	static void set_rel_target(Cell *source, Label target)
1130 :	anton	1.70	{
1131 :			*source = ((Cell)target)-(((Cell)source)+4);
1132 :			}
1133 :
1134 :	pazsan	1.161	static void register_branchinfo(Label source, Cell *targetpp)
1135 :	anton	1.70	{
1136 :			struct branchinfo *bi = &(branchinfos[nbranchinfos]);
1137 :	anton	1.136	bi->targetpp = (Label **)targetpp;
1138 :	anton	1.70	bi->addressptr = (Cell *)source;
1139 :			nbranchinfos++;
1140 :			}
1141 :
1142 :	pazsan	1.161	static Address compile_prim1arg(PrimNum p, Cell **argp)
1143 :	anton	1.70	{
1144 :	anton	1.133	Address old_code_here=append_prim(p);
1145 :	anton	1.70
1146 :	anton	1.74	assert(vm_prims[p]==priminfos[p].start);
1147 :	anton	1.133	argp = (Cell)(old_code_here+priminfos[p].immargs[0].offset);
1148 :			return old_code_here;
1149 :	anton	1.70	}
1150 :
1151 :	pazsan	1.161	static Address compile_call2(Cell targetpp, Cell *next_code_targetp)
1152 :	anton	1.70	{
1153 :	anton	1.73	PrimInfo *pi = &priminfos[N_call2];
1154 :	anton	1.74	Address old_code_here = append_prim(N_call2);
1155 :	anton	1.70
1156 :	anton	1.134	next_code_targetp = (Cell )(old_code_here + pi->immargs[0].offset);
1157 :	anton	1.136	register_branchinfo(old_code_here + pi->immargs[1].offset, targetpp);
1158 :	anton	1.134	return old_code_here;
1159 :	anton	1.70	}
1160 :			#endif
1161 :
1162 :			void finish_code(void)
1163 :			{
1164 :			#ifdef NO_IP
1165 :			Cell i;
1166 :
1167 :			compile_prim1(NULL);
1168 :			for (i=0; i<ndoesexecinfos; i++) {
1169 :			struct doesexecinfo *dei = &doesexecinfos[i];
1170 :	anton	1.136	dei->targetp = (Label *)DOES_CODE1((dei->xt));
1171 :			branchinfos[dei->branchinfo].targetpp = &(dei->targetp);
1172 :	anton	1.70	}
1173 :			ndoesexecinfos = 0;
1174 :			for (i=0; i<nbranchinfos; i++) {
1175 :			struct branchinfo *bi=&branchinfos[i];
1176 :	anton	1.136	set_rel_target(bi->addressptr, **(bi->targetpp));
1177 :	anton	1.70	}
1178 :			nbranchinfos = 0;
1179 :	anton	1.128	#else
1180 :			compile_prim1(NULL);
1181 :	anton	1.48	#endif
1182 :	anton	1.93	flush_to_here();
1183 :	anton	1.48	}
1184 :
1185 :	pazsan	1.162	#if !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED))
1186 :	anton	1.128	#ifdef NO_IP
1187 :	pazsan	1.161	static Cell compile_prim_dyn(PrimNum p, Cell *tcp)
1188 :	anton	1.128	/* compile prim #p dynamically (mod flags etc.) and return start
1189 :			address of generated code for putting it into the threaded
1190 :			code. This function is only called if all the associated
1191 :			inline arguments of p are already in place (at tcp[1] etc.) */
1192 :			{
1193 :			PrimInfo *pi=&priminfos[p];
1194 :			Cell *next_code_target=NULL;
1195 :	anton	1.135	Address codeaddr;
1196 :			Address primstart;
1197 :	anton	1.128
1198 :			assert(p<npriminfos);
1199 :			if (p==N_execute \|\| p==N_perform \|\| p==N_lit_perform) {
1200 :	anton	1.134	codeaddr = compile_prim1arg(N_set_next_code, &next_code_target);
1201 :	anton	1.135	primstart = append_prim(p);
1202 :			goto other_prim;
1203 :			} else if (p==N_call) {
1204 :	anton	1.136	codeaddr = compile_call2(tcp+1, &next_code_target);
1205 :	anton	1.128	} else if (p==N_does_exec) {
1206 :			struct doesexecinfo *dei = &doesexecinfos[ndoesexecinfos++];
1207 :	anton	1.133	Cell *arg;
1208 :			codeaddr = compile_prim1arg(N_lit,&arg);
1209 :			*arg = (Cell)PFA(tcp[1]);
1210 :	anton	1.128	/* we cannot determine the callee now (last_start[1] may be a
1211 :			forward reference), so just register an arbitrary target, and
1212 :			register in dei that we need to fix this before resolving
1213 :			branches */
1214 :			dei->branchinfo = nbranchinfos;
1215 :			dei->xt = (Cell *)(tcp[1]);
1216 :	anton	1.134	compile_call2(0, &next_code_target);
1217 :	anton	1.128	} else if (!is_relocatable(p)) {
1218 :	anton	1.133	Cell *branch_target;
1219 :			codeaddr = compile_prim1arg(N_set_next_code, &next_code_target);
1220 :			compile_prim1arg(N_branch,&branch_target);
1221 :			set_rel_target(branch_target,vm_prims[p]);
1222 :	anton	1.128	} else {
1223 :			unsigned j;
1224 :	anton	1.135
1225 :			codeaddr = primstart = append_prim(p);
1226 :			other_prim:
1227 :	anton	1.128	for (j=0; j<pi->nimmargs; j++) {
1228 :			struct immarg *ia = &(pi->immargs[j]);
1229 :	anton	1.136	Cell *argp = tcp + pi->nimmargs - j;
1230 :			Cell argval = argp; / !! specific to prims */
1231 :	anton	1.128	if (ia->rel) { /* !! assumption: relative refs are branches */
1232 :	anton	1.136	register_branchinfo(primstart + ia->offset, argp);
1233 :	anton	1.128	} else /* plain argument */
1234 :	anton	1.135	(Cell )(primstart + ia->offset) = argval;
1235 :	anton	1.128	}
1236 :			}
1237 :			if (next_code_target!=NULL)
1238 :			*next_code_target = (Cell)code_here;
1239 :	anton	1.135	return (Cell)codeaddr;
1240 :	anton	1.128	}
1241 :			#else /* !defined(NO_IP) */
1242 :	pazsan	1.161	static Cell compile_prim_dyn(PrimNum p, Cell *tcp)
1243 :	anton	1.128	/* compile prim #p dynamically (mod flags etc.) and return start
1244 :			address of generated code for putting it into the threaded code */
1245 :	anton	1.108	{
1246 :	anton	1.121	Cell static_prim = (Cell)vm_prims[p];
1247 :	anton	1.108	#if defined(NO_DYNAMIC)
1248 :			return static_prim;
1249 :			#else /* !defined(NO_DYNAMIC) */
1250 :			Address old_code_here;
1251 :
1252 :			if (no_dynamic)
1253 :			return static_prim;
1254 :	anton	1.125	if (p>=npriminfos \|\| !is_relocatable(p)) {
1255 :	anton	1.108	append_jump();
1256 :			return static_prim;
1257 :			}
1258 :			old_code_here = append_prim(p);
1259 :	anton	1.147	last_jump = p;
1260 :			if (priminfos[p].superend)
1261 :			append_jump();
1262 :	anton	1.108	return (Cell)old_code_here;
1263 :			#endif /* !defined(NO_DYNAMIC) */
1264 :			}
1265 :	anton	1.128	#endif /* !defined(NO_IP) */
1266 :	pazsan	1.162	#endif
1267 :	anton	1.70
1268 :	anton	1.109	#ifndef NO_DYNAMIC
1269 :	pazsan	1.161	static int cost_codesize(int prim)
1270 :	anton	1.109	{
1271 :	anton	1.121	return priminfos[prim].length;
1272 :	anton	1.109	}
1273 :			#endif
1274 :
1275 :	pazsan	1.161	static int cost_ls(int prim)
1276 :	anton	1.109	{
1277 :			struct cost *c = super_costs+prim;
1278 :
1279 :			return c->loads + c->stores;
1280 :			}
1281 :
1282 :	pazsan	1.161	static int cost_lsu(int prim)
1283 :	anton	1.109	{
1284 :			struct cost *c = super_costs+prim;
1285 :
1286 :			return c->loads + c->stores + c->updates;
1287 :			}
1288 :
1289 :	pazsan	1.161	static int cost_nexts(int prim)
1290 :	anton	1.109	{
1291 :			return 1;
1292 :			}
1293 :
1294 :			typedef int Costfunc(int);
1295 :			Costfunc ss_cost = / cost function for optimize_bb */
1296 :			#ifdef NO_DYNAMIC
1297 :			cost_lsu;
1298 :			#else
1299 :			cost_codesize;
1300 :			#endif
1301 :
1302 :	anton	1.110	struct {
1303 :			Costfunc *costfunc;
1304 :			char *metricname;
1305 :			long sum;
1306 :			} cost_sums[] = {
1307 :			#ifndef NO_DYNAMIC
1308 :			{ cost_codesize, "codesize", 0 },
1309 :			#endif
1310 :			{ cost_ls, "ls", 0 },
1311 :			{ cost_lsu, "lsu", 0 },
1312 :			{ cost_nexts, "nexts", 0 }
1313 :			};
1314 :
1315 :	anton	1.148	#ifndef NO_DYNAMIC
1316 :			void init_ss_cost(void) {
1317 :			if (no_dynamic && ss_cost == cost_codesize) {
1318 :			ss_cost = cost_nexts;
1319 :			cost_sums[0] = cost_sums[1]; /* don't use cost_codesize for print-metrics */
1320 :			debugp(stderr, "--no-dynamic conflicts with --ss-min-codesize, reverting to --ss-min-nexts\n");
1321 :			}
1322 :			}
1323 :			#endif
1324 :
1325 :	anton	1.106	#define MAX_BB 128 /* maximum number of instructions in BB */
1326 :	anton	1.125	#define INF_COST 1000000 /* infinite cost */
1327 :			#define CANONICAL_STATE 0
1328 :
1329 :			struct waypoint {
1330 :			int cost; /* the cost from here to the end */
1331 :			PrimNum inst; /* the inst used from here to the next waypoint */
1332 :			char relocatable; /* the last non-transition was relocatable */
1333 :			char no_transition; /* don't use the next transition (relocatability)
1334 :			* or this transition (does not change state) */
1335 :			};
1336 :
1337 :	anton	1.156	struct tpa_state { /* tree parsing automaton (like) state */
1338 :	anton	1.155	/* labeling is back-to-front */
1339 :			struct waypoint inst; / in front of instruction */
1340 :			struct waypoint trans; / in front of instruction and transition */
1341 :			};
1342 :
1343 :	anton	1.156	struct tpa_state termstate = NULL; / initialized in loader() */
1344 :	anton	1.155
1345 :	anton	1.158	/* statistics about tree parsing (lazyburg) stuff */
1346 :			long lb_basic_blocks = 0;
1347 :			long lb_labeler_steps = 0;
1348 :			long lb_labeler_automaton = 0;
1349 :			long lb_labeler_dynprog = 0;
1350 :			long lb_newstate_equiv = 0;
1351 :			long lb_newstate_new = 0;
1352 :			long lb_applicable_base_rules = 0;
1353 :			long lb_applicable_chain_rules = 0;
1354 :
1355 :	pazsan	1.162	#if !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED))
1356 :	pazsan	1.161	static void init_waypoints(struct waypoint ws[])
1357 :	anton	1.125	{
1358 :			int k;
1359 :
1360 :			for (k=0; k<maxstates; k++)
1361 :			ws[k].cost=INF_COST;
1362 :			}
1363 :	anton	1.106
1364 :	pazsan	1.161	static struct tpa_state *empty_tpa_state()
1365 :	anton	1.155	{
1366 :	anton	1.156	struct tpa_state *s = malloc(sizeof(struct tpa_state));
1367 :	anton	1.155
1368 :	anton	1.157	s->inst = calloc(maxstates,sizeof(struct waypoint));
1369 :	anton	1.155	init_waypoints(s->inst);
1370 :	anton	1.157	s->trans = calloc(maxstates,sizeof(struct waypoint));
1371 :	anton	1.155	/* init_waypoints(s->trans);*/
1372 :			return s;
1373 :			}
1374 :
1375 :	pazsan	1.161	static void transitions(struct tpa_state *t)
1376 :	anton	1.107	{
1377 :	anton	1.125	int k;
1378 :			struct super_state *l;
1379 :
1380 :			for (k=0; k<maxstates; k++) {
1381 :	anton	1.155	t->trans[k] = t->inst[k];
1382 :			t->trans[k].no_transition = 1;
1383 :	anton	1.125	}
1384 :			for (l = state_transitions; l != NULL; l = l->next) {
1385 :			PrimNum s = l->super;
1386 :			int jcost;
1387 :			struct cost *c=super_costs+s;
1388 :	anton	1.155	struct waypoint *wi=&(t->trans[c->state_in]);
1389 :			struct waypoint *wo=&(t->inst[c->state_out]);
1390 :	anton	1.158	lb_applicable_chain_rules++;
1391 :	anton	1.125	if (wo->cost == INF_COST)
1392 :			continue;
1393 :			jcost = wo->cost + ss_cost(s);
1394 :			if (jcost <= wi->cost) {
1395 :			wi->cost = jcost;
1396 :			wi->inst = s;
1397 :			wi->relocatable = wo->relocatable;
1398 :			wi->no_transition = 0;
1399 :			/* if (ss_greedy) wi->cost = wo->cost ? */
1400 :			}
1401 :			}
1402 :			}
1403 :	anton	1.107
1404 :	pazsan	1.161	static struct tpa_state *make_termstate()
1405 :	anton	1.155	{
1406 :	anton	1.157	struct tpa_state *s = empty_tpa_state();
1407 :	anton	1.155
1408 :			s->inst[CANONICAL_STATE].cost = 0;
1409 :			transitions(s);
1410 :			return s;
1411 :			}
1412 :	pazsan	1.162	#endif
1413 :	anton	1.155
1414 :	anton	1.156	#define TPA_SIZE 16384
1415 :
1416 :			struct tpa_entry {
1417 :			struct tpa_entry *next;
1418 :			PrimNum inst;
1419 :			struct tpa_state state_behind; / note: brack-to-front labeling */
1420 :			struct tpa_state state_infront; / note: brack-to-front labeling */
1421 :			} *tpa_table[TPA_SIZE];
1422 :
1423 :	pazsan	1.162	#if !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED))
1424 :	pazsan	1.161	static Cell hash_tpa(PrimNum p, struct tpa_state *t)
1425 :	anton	1.156	{
1426 :			UCell it = (UCell )t;
1427 :			return (p+it+(it>>14))&(TPA_SIZE-1);
1428 :			}
1429 :
1430 :	pazsan	1.161	static struct tpa_state *lookup_tpa(PrimNum p, struct tpa_state t2)
1431 :	anton	1.156	{
1432 :			int hash=hash_tpa(p, t2);
1433 :			struct tpa_entry *te = tpa_table[hash];
1434 :
1435 :	anton	1.158	if (tpa_noautomaton) {
1436 :			static struct tpa_state *t;
1437 :			t = NULL;
1438 :			return &t;
1439 :			}
1440 :	anton	1.156	for (; te!=NULL; te = te->next) {
1441 :			if (p == te->inst && t2 == te->state_behind)
1442 :			return &(te->state_infront);
1443 :			}
1444 :			te = (struct tpa_entry *)malloc(sizeof(struct tpa_entry));
1445 :			te->next = tpa_table[hash];
1446 :			te->inst = p;
1447 :			te->state_behind = t2;
1448 :			te->state_infront = NULL;
1449 :			tpa_table[hash] = te;
1450 :			return &(te->state_infront);
1451 :			}
1452 :
1453 :	pazsan	1.161	static void tpa_state_normalize(struct tpa_state *t)
1454 :	anton	1.157	{
1455 :			/* normalize so cost of canonical state=0; this may result in
1456 :			negative states for some states */
1457 :			int d = t->inst[CANONICAL_STATE].cost;
1458 :			int i;
1459 :
1460 :			for (i=0; i<maxstates; i++) {
1461 :			if (t->inst[i].cost != INF_COST)
1462 :			t->inst[i].cost -= d;
1463 :			if (t->trans[i].cost != INF_COST)
1464 :			t->trans[i].cost -= d;
1465 :			}
1466 :			}
1467 :
1468 :	pazsan	1.161	static int tpa_state_equivalent(struct tpa_state t1, struct tpa_state t2)
1469 :	anton	1.157	{
1470 :			return (memcmp(t1->inst, t2->inst, maxstates*sizeof(struct waypoint)) == 0 &&
1471 :			memcmp(t1->trans,t2->trans,maxstates*sizeof(struct waypoint)) == 0);
1472 :			}
1473 :	pazsan	1.162	#endif
1474 :	anton	1.157
1475 :			struct tpa_state_entry {
1476 :			struct tpa_state_entry *next;
1477 :			struct tpa_state *state;
1478 :			} *tpa_state_table[TPA_SIZE];
1479 :
1480 :	pazsan	1.163	#if !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED))
1481 :	pazsan	1.161	static Cell hash_tpa_state(struct tpa_state *t)
1482 :	anton	1.157	{
1483 :			int ti = (int )(t->inst);
1484 :			int tt = (int )(t->trans);
1485 :			int r=0;
1486 :			int i;
1487 :
1488 :			for (i=0; ti+i < (int *)(t->inst+maxstates); i++)
1489 :			r += ti[i]+tt[i];
1490 :			return (r+(r>>14)+(r>>22)) & (TPA_SIZE-1);
1491 :			}
1492 :
1493 :	pazsan	1.161	static struct tpa_state lookup_tpa_state(struct tpa_state t)
1494 :	anton	1.157	{
1495 :			Cell hash = hash_tpa_state(t);
1496 :			struct tpa_state_entry *te = tpa_state_table[hash];
1497 :			struct tpa_state_entry *tn;
1498 :
1499 :	anton	1.158	if (!tpa_noequiv) {
1500 :			for (; te!=NULL; te = te->next) {
1501 :			if (tpa_state_equivalent(t, te->state)) {
1502 :			lb_newstate_equiv++;
1503 :			free(t->inst);
1504 :			free(t->trans);
1505 :			free(t);
1506 :			return te->state;
1507 :			}
1508 :	anton	1.157	}
1509 :	anton	1.158	tn = (struct tpa_state_entry *)malloc(sizeof(struct tpa_state_entry));
1510 :			tn->next = te;
1511 :			tn->state = t;
1512 :			tpa_state_table[hash] = tn;
1513 :			}
1514 :			lb_newstate_new++;
1515 :			if (tpa_trace)
1516 :			fprintf(stderr, "%ld %ld lb_states\n", lb_labeler_steps, lb_newstate_new);
1517 :	anton	1.157	return t;
1518 :			}
1519 :
1520 :	anton	1.125	/* use dynamic programming to find the shortest paths within the basic
1521 :			block origs[0..ninsts-1] and rewrite the instructions pointed to by
1522 :			instps to use it */
1523 :	pazsan	1.161	static void optimize_rewrite(Cell *instps[], PrimNum origs[], int ninsts)
1524 :	anton	1.125	{
1525 :			int i,j;
1526 :	anton	1.156	struct tpa_state *ts[ninsts+1];
1527 :	anton	1.125	int nextdyn, nextstate, no_transition;
1528 :
1529 :	anton	1.158	lb_basic_blocks++;
1530 :	anton	1.155	ts[ninsts] = termstate;
1531 :	anton	1.107	for (i=ninsts-1; i>=0; i--) {
1532 :	anton	1.156	struct tpa_state **tp = lookup_tpa(origs[i],ts[i+1]);
1533 :			struct tpa_state t = tp;
1534 :	anton	1.158	lb_labeler_steps++;
1535 :			if (t) {
1536 :	anton	1.156	ts[i] = t;
1537 :	anton	1.158	lb_labeler_automaton++;
1538 :			}
1539 :	anton	1.156	else {
1540 :	anton	1.158	lb_labeler_dynprog++;
1541 :	anton	1.156	ts[i] = empty_tpa_state();
1542 :			for (j=1; j<=max_super && i+j<=ninsts; j++) {
1543 :			struct super_state **superp = lookup_super(origs+i, j);
1544 :			if (superp!=NULL) {
1545 :			struct super_state supers = superp;
1546 :			for (; supers!=NULL; supers = supers->next) {
1547 :			PrimNum s = supers->super;
1548 :			int jcost;
1549 :			struct cost *c=super_costs+s;
1550 :			struct waypoint *wi=&(ts[i]->inst[c->state_in]);
1551 :			struct waypoint *wo=&(ts[i+j]->trans[c->state_out]);
1552 :			int no_transition = wo->no_transition;
1553 :	anton	1.158	lb_applicable_base_rules++;
1554 :	anton	1.156	if (!(is_relocatable(s)) && !wo->relocatable) {
1555 :			wo=&(ts[i+j]->inst[c->state_out]);
1556 :			no_transition=1;
1557 :			}
1558 :			if (wo->cost == INF_COST)
1559 :			continue;
1560 :			jcost = wo->cost + ss_cost(s);
1561 :			if (jcost <= wi->cost) {
1562 :			wi->cost = jcost;
1563 :			wi->inst = s;
1564 :			wi->relocatable = is_relocatable(s);
1565 :			wi->no_transition = no_transition;
1566 :			/* if (ss_greedy) wi->cost = wo->cost ? */
1567 :			}
1568 :	anton	1.125	}
1569 :	anton	1.107	}
1570 :			}
1571 :	anton	1.156	transitions(ts[i]);
1572 :	anton	1.157	tpa_state_normalize(ts[i]);
1573 :			*tp = ts[i] = lookup_tpa_state(ts[i]);
1574 :	anton	1.158	if (tpa_trace)
1575 :			fprintf(stderr, "%ld %ld lb_table_entries\n", lb_labeler_steps, lb_labeler_dynprog);
1576 :	anton	1.107	}
1577 :	anton	1.125	}
1578 :			/* now rewrite the instructions */
1579 :			nextdyn=0;
1580 :			nextstate=CANONICAL_STATE;
1581 :	anton	1.155	no_transition = ((!ts[0]->trans[nextstate].relocatable)
1582 :			\|\|ts[0]->trans[nextstate].no_transition);
1583 :	anton	1.125	for (i=0; i<ninsts; i++) {
1584 :			Cell tc=0, tc2;
1585 :			if (i==nextdyn) {
1586 :			if (!no_transition) {
1587 :			/* process trans */
1588 :	anton	1.155	PrimNum p = ts[i]->trans[nextstate].inst;
1589 :	anton	1.125	struct cost *c = super_costs+p;
1590 :	anton	1.155	assert(ts[i]->trans[nextstate].cost != INF_COST);
1591 :	anton	1.125	assert(c->state_in==nextstate);
1592 :	anton	1.128	tc = compile_prim_dyn(p,NULL);
1593 :	anton	1.125	nextstate = c->state_out;
1594 :			}
1595 :			{
1596 :			/* process inst */
1597 :	anton	1.155	PrimNum p = ts[i]->inst[nextstate].inst;
1598 :	anton	1.125	struct cost *c=super_costs+p;
1599 :			assert(c->state_in==nextstate);
1600 :	anton	1.155	assert(ts[i]->inst[nextstate].cost != INF_COST);
1601 :	anton	1.125	#if defined(GFORTH_DEBUGGING)
1602 :			assert(p == origs[i]);
1603 :			#endif
1604 :	anton	1.128	tc2 = compile_prim_dyn(p,instps[i]);
1605 :	anton	1.125	if (no_transition \|\| !is_relocatable(p))
1606 :			/* !! actually what we care about is if and where
1607 :			* compile_prim_dyn() puts NEXTs */
1608 :			tc=tc2;
1609 :	anton	1.155	no_transition = ts[i]->inst[nextstate].no_transition;
1610 :	anton	1.125	nextstate = c->state_out;
1611 :			nextdyn += c->length;
1612 :			}
1613 :			} else {
1614 :			#if defined(GFORTH_DEBUGGING)
1615 :			assert(0);
1616 :			#endif
1617 :			tc=0;
1618 :	anton	1.155	/* tc= (Cell)vm_prims[ts[i]->inst[CANONICAL_STATE].inst]; */
1619 :	anton	1.125	}
1620 :			*(instps[i]) = tc;
1621 :			}
1622 :			if (!no_transition) {
1623 :	anton	1.155	PrimNum p = ts[i]->trans[nextstate].inst;
1624 :	anton	1.125	struct cost *c = super_costs+p;
1625 :			assert(c->state_in==nextstate);
1626 :	anton	1.155	assert(ts[i]->trans[nextstate].cost != INF_COST);
1627 :	anton	1.125	assert(i==nextdyn);
1628 :	anton	1.128	(void)compile_prim_dyn(p,NULL);
1629 :	anton	1.125	nextstate = c->state_out;
1630 :	anton	1.107	}
1631 :	anton	1.125	assert(nextstate==CANONICAL_STATE);
1632 :	anton	1.107	}
1633 :	pazsan	1.162	#endif
1634 :	anton	1.107
1635 :	anton	1.105	/* compile *start, possibly rewriting it into a static and/or dynamic
1636 :			superinstruction */
1637 :			void compile_prim1(Cell *start)
1638 :	anton	1.70	{
1639 :	anton	1.108	#if defined(DOUBLY_INDIRECT)
1640 :	anton	1.125	Label prim;
1641 :
1642 :			if (start==NULL)
1643 :			return;
1644 :			prim = (Label)*start;
1645 :	anton	1.108	if (prim<((Label)(xts+DOESJUMP)) \|\| prim>((Label)(xts+npriminfos))) {
1646 :			fprintf(stderr,"compile_prim encountered xt %p\n", prim);
1647 :			*start=(Cell)prim;
1648 :			return;
1649 :			} else {
1650 :			*start = (Cell)(prim-((Label)xts)+((Label)vm_prims));
1651 :			return;
1652 :			}
1653 :			#elif defined(INDIRECT_THREADED)
1654 :			return;
1655 :	anton	1.112	#else /* !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED)) */
1656 :	anton	1.128	/* !! does not work, for unknown reasons; but something like this is
1657 :			probably needed to ensure that we don't call compile_prim_dyn
1658 :			before the inline arguments are there */
1659 :			static Cell *instps[MAX_BB];
1660 :			static PrimNum origs[MAX_BB];
1661 :			static int ninsts=0;
1662 :			PrimNum prim_num;
1663 :
1664 :			if (start==NULL \|\| ninsts >= MAX_BB \|\|
1665 :			(ninsts>0 && superend[origs[ninsts-1]])) {
1666 :			/* after bb, or at the start of the next bb */
1667 :			optimize_rewrite(instps,origs,ninsts);
1668 :			/* fprintf(stderr,"optimize_rewrite(...,%d)\n",ninsts); */
1669 :			ninsts=0;
1670 :			if (start==NULL)
1671 :			return;
1672 :			}
1673 :			prim_num = ((Xt)*start)-vm_prims;
1674 :			if(prim_num >= npriminfos) {
1675 :			optimize_rewrite(instps,origs,ninsts);
1676 :	anton	1.129	/* fprintf(stderr,"optimize_rewrite(...,%d)\n",ninsts);*/
1677 :	anton	1.128	ninsts=0;
1678 :			return;
1679 :			}
1680 :			assert(ninsts<MAX_BB);
1681 :			instps[ninsts] = start;
1682 :			origs[ninsts] = prim_num;
1683 :			ninsts++;
1684 :	anton	1.112	#endif /* !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED)) */
1685 :	anton	1.47	}
1686 :
1687 :	pazsan	1.161	Address gforth_loader(FILE imagefile, char filename)
1688 :	anton	1.1	/* returns the address of the image proper (after the preamble) */
1689 :			{
1690 :			ImageHeader header;
1691 :			Address image;
1692 :			Address imp; /* image+preamble */
1693 :	anton	1.17	Char magic[8];
1694 :			char magic7; /* size byte of magic number */
1695 :	anton	1.1	Cell preamblesize=0;
1696 :	pazsan	1.6	Cell data_offset = offset_image ? 56*sizeof(Cell) : 0;
1697 :	anton	1.1	UCell check_sum;
1698 :	pazsan	1.15	Cell ausize = ((RELINFOBITS == 8) ? 0 :
1699 :			(RELINFOBITS == 16) ? 1 :
1700 :			(RELINFOBITS == 32) ? 2 : 3);
1701 :			Cell charsize = ((sizeof(Char) == 1) ? 0 :
1702 :			(sizeof(Char) == 2) ? 1 :
1703 :			(sizeof(Char) == 4) ? 2 : 3) + ausize;
1704 :			Cell cellsize = ((sizeof(Cell) == 1) ? 0 :
1705 :			(sizeof(Cell) == 2) ? 1 :
1706 :			(sizeof(Cell) == 4) ? 2 : 3) + ausize;
1707 :	anton	1.21	Cell sizebyte = (ausize << 5) + (charsize << 3) + (cellsize << 1) +
1708 :			#ifdef WORDS_BIGENDIAN
1709 :			0
1710 :			#else
1711 :			1
1712 :			#endif
1713 :			;
1714 :	anton	1.1
1715 :	pazsan	1.164	vm_prims = gforth_engine(0,0,0,0,0);
1716 :	anton	1.47	check_prims(vm_prims);
1717 :	anton	1.106	prepare_super_table();
1718 :	anton	1.1	#ifndef DOUBLY_INDIRECT
1719 :	anton	1.59	#ifdef PRINT_SUPER_LENGTHS
1720 :			print_super_lengths();
1721 :			#endif
1722 :	anton	1.43	check_sum = checksum(vm_prims);
1723 :	anton	1.1	#else /* defined(DOUBLY_INDIRECT) */
1724 :	anton	1.43	check_sum = (UCell)vm_prims;
1725 :	anton	1.1	#endif /* defined(DOUBLY_INDIRECT) */
1726 :	anton	1.155	#if !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED))
1727 :			termstate = make_termstate();
1728 :			#endif /* !(defined(DOUBLY_INDIRECT) \|\| defined(INDIRECT_THREADED)) */
1729 :	pazsan	1.10
1730 :			do {
1731 :			if(fread(magic,sizeof(Char),8,imagefile) < 8) {
1732 :	anton	1.84	fprintf(stderr,"%s: image %s doesn't seem to be a Gforth (>=0.6) image.\n",
1733 :	pazsan	1.10	progname, filename);
1734 :			exit(1);
1735 :	anton	1.1	}
1736 :	pazsan	1.10	preamblesize+=8;
1737 :	anton	1.84	} while(memcmp(magic,"Gforth3",7));
1738 :	anton	1.17	magic7 = magic[7];
1739 :	anton	1.1	if (debug) {
1740 :	anton	1.17	magic[7]='\0';
1741 :	anton	1.21	fprintf(stderr,"Magic found: %s ", magic);
1742 :			print_sizes(magic7);
1743 :	anton	1.1	}
1744 :
1745 :	anton	1.21	if (magic7 != sizebyte)
1746 :			{
1747 :			fprintf(stderr,"This image is: ");
1748 :			print_sizes(magic7);
1749 :			fprintf(stderr,"whereas the machine is ");
1750 :			print_sizes(sizebyte);
1751 :	anton	1.1	exit(-2);
1752 :			};
1753 :
1754 :			fread((void *)&header,sizeof(ImageHeader),1,imagefile);
1755 :	pazsan	1.10
1756 :			set_stack_sizes(&header);
1757 :	anton	1.1
1758 :			#if HAVE_GETPAGESIZE
1759 :			pagesize=getpagesize(); /* Linux/GNU libc offers this */
1760 :			#elif HAVE_SYSCONF && defined(_SC_PAGESIZE)
1761 :			pagesize=sysconf(_SC_PAGESIZE); /* POSIX.4 */
1762 :			#elif PAGESIZE
1763 :			pagesize=PAGESIZE; /* in limits.h according to Gallmeister's POSIX.4 book */
1764 :			#endif
1765 :	pazsan	1.144	debugp(stderr,"pagesize=%ld\n",(unsigned long) pagesize);
1766 :	anton	1.1
1767 :	anton	1.34	image = dict_alloc_read(imagefile, preamblesize+header.image_size,
1768 :			preamblesize+dictsize, data_offset);
1769 :	anton	1.33	imp=image+preamblesize;
1770 :	anton	1.57	alloc_stacks((ImageHeader *)imp);
1771 :	anton	1.1	if (clear_dictionary)
1772 :	anton	1.33	memset(imp+header.image_size, 0, dictsize-header.image_size);
1773 :	anton	1.90	if(header.base==0 \|\| header.base == (Address)0x100) {
1774 :	anton	1.1	Cell reloc_size=((header.image_size-1)/sizeof(Cell))/8+1;
1775 :	pazsan	1.162	Char reloc_bits[reloc_size];
1776 :	anton	1.33	fseek(imagefile, preamblesize+header.image_size, SEEK_SET);
1777 :	pazsan	1.10	fread(reloc_bits, 1, reloc_size, imagefile);
1778 :	pazsan	1.161	gforth_relocate((Cell *)imp, reloc_bits, header.image_size, (Cell)header.base, vm_prims);
1779 :	anton	1.1	#if 0
1780 :			{ /* let's see what the relocator did */
1781 :			FILE *snapshot=fopen("snapshot.fi","wb");
1782 :			fwrite(image,1,imagesize,snapshot);
1783 :			fclose(snapshot);
1784 :			}
1785 :			#endif
1786 :	jwilke	1.46	}
1787 :			else if(header.base!=imp) {
1788 :			fprintf(stderr,"%s: Cannot load nonrelocatable image (compiled for address $%lx) at address $%lx\n",
1789 :			progname, (unsigned long)header.base, (unsigned long)imp);
1790 :			exit(1);
1791 :	anton	1.1	}
1792 :			if (header.checksum==0)
1793 :			((ImageHeader *)imp)->checksum=check_sum;
1794 :			else if (header.checksum != check_sum) {
1795 :			fprintf(stderr,"%s: Checksum of image ($%lx) does not match the executable ($%lx)\n",
1796 :			progname, (unsigned long)(header.checksum),(unsigned long)check_sum);
1797 :			exit(1);
1798 :			}
1799 :	anton	1.53	#ifdef DOUBLY_INDIRECT
1800 :			((ImageHeader *)imp)->xt_base = xts;
1801 :			#endif
1802 :	anton	1.1	fclose(imagefile);
1803 :
1804 :	anton	1.56	/* unnecessary, except maybe for CODE words */
1805 :			/* FLUSH_ICACHE(imp, header.image_size);*/
1806 :	anton	1.1
1807 :			return imp;
1808 :			}
1809 :
1810 :	anton	1.72	/* pointer to last '/' or '\' in file, 0 if there is none. */
1811 :	pazsan	1.161	static char onlypath(char filename)
1812 :	pazsan	1.10	{
1813 :	anton	1.72	return strrchr(filename, DIRSEP);
1814 :	anton	1.1	}
1815 :
1816 :	pazsan	1.161	static FILE openimage(char fullfilename)
1817 :	pazsan	1.10	{
1818 :			FILE *image_file;
1819 :	pazsan	1.162	char * expfilename = tilde_cstr((Char *)fullfilename, strlen(fullfilename), 1);
1820 :	pazsan	1.10
1821 :	anton	1.28	image_file=fopen(expfilename,"rb");
1822 :	anton	1.1	if (image_file!=NULL && debug)
1823 :	anton	1.28	fprintf(stderr, "Opened image file: %s\n", expfilename);
1824 :	pazsan	1.10	return image_file;
1825 :	anton	1.1	}
1826 :
1827 :	anton	1.28	/* try to open image file concat(path[0:len],imagename) */
1828 :	pazsan	1.161	static FILE checkimage(char path, int len, char *imagename)
1829 :	pazsan	1.10	{
1830 :			int dirlen=len;
1831 :	pazsan	1.162	char fullfilename[dirlen+strlen((char *)imagename)+2];
1832 :	pazsan	1.10
1833 :	anton	1.1	memcpy(fullfilename, path, dirlen);
1834 :	pazsan	1.71	if (fullfilename[dirlen-1]!=DIRSEP)
1835 :			fullfilename[dirlen++]=DIRSEP;
1836 :	anton	1.1	strcpy(fullfilename+dirlen,imagename);
1837 :	pazsan	1.10	return openimage(fullfilename);
1838 :	anton	1.1	}
1839 :
1840 :	pazsan	1.161	static FILE * open_image_file(char * imagename, char * path)
1841 :	anton	1.1	{
1842 :	pazsan	1.10	FILE * image_file=NULL;
1843 :	anton	1.28	char *origpath=path;
1844 :	pazsan	1.10
1845 :	pazsan	1.71	if(strchr(imagename, DIRSEP)==NULL) {
1846 :	pazsan	1.10	/* first check the directory where the exe file is in !! 01may97jaw */
1847 :			if (onlypath(progname))
1848 :	anton	1.72	image_file=checkimage(progname, onlypath(progname)-progname, imagename);
1849 :	pazsan	1.10	if (!image_file)
1850 :			do {
1851 :			char *pend=strchr(path, PATHSEP);
1852 :			if (pend==NULL)
1853 :			pend=path+strlen(path);
1854 :			if (strlen(path)==0) break;
1855 :			image_file=checkimage(path, pend-path, imagename);
1856 :			path=pend+(*pend==PATHSEP);
1857 :			} while (image_file==NULL);
1858 :			} else {
1859 :			image_file=openimage(imagename);
1860 :			}
1861 :	anton	1.1
1862 :	pazsan	1.10	if (!image_file) {
1863 :			fprintf(stderr,"%s: cannot open image file %s in path %s for reading\n",
1864 :	anton	1.28	progname, imagename, origpath);
1865 :	pazsan	1.10	exit(1);
1866 :	anton	1.7	}
1867 :
1868 :	pazsan	1.10	return image_file;
1869 :			}
1870 :	pazsan	1.11	#endif
1871 :
1872 :			#ifdef HAS_OS
1873 :	pazsan	1.161	static UCell convsize(char *s, UCell elemsize)
1874 :	pazsan	1.11	/* converts s of the format [0-9]+[bekMGT]? (e.g. 25k) into the number
1875 :			of bytes. the letter at the end indicates the unit, where e stands
1876 :			for the element size. default is e */
1877 :			{
1878 :			char *endp;
1879 :			UCell n,m;
1880 :
1881 :			m = elemsize;
1882 :			n = strtoul(s,&endp,0);
1883 :			if (endp!=NULL) {
1884 :			if (strcmp(endp,"b")==0)
1885 :			m=1;
1886 :			else if (strcmp(endp,"k")==0)
1887 :			m=1024;
1888 :			else if (strcmp(endp,"M")==0)
1889 :			m=1024*1024;
1890 :			else if (strcmp(endp,"G")==0)
1891 :			m=102410241024;
1892 :			else if (strcmp(endp,"T")==0) {
1893 :			#if (SIZEOF_CHAR_P > 4)
1894 :	anton	1.24	m=1024L10241024*1024;
1895 :	pazsan	1.11	#else
1896 :			fprintf(stderr,"%s: size specification \"%s\" too large for this machine\n", progname, endp);
1897 :			exit(1);
1898 :			#endif
1899 :			} else if (strcmp(endp,"e")!=0 && strcmp(endp,"")!=0) {
1900 :			fprintf(stderr,"%s: cannot grok size specification %s: invalid unit \"%s\"\n", progname, s, endp);
1901 :			exit(1);
1902 :			}
1903 :			}
1904 :			return n*m;
1905 :			}
1906 :	pazsan	1.10
1907 :	anton	1.109	enum {
1908 :			ss_number = 256,
1909 :	anton	1.125	ss_states,
1910 :	anton	1.109	ss_min_codesize,
1911 :			ss_min_ls,
1912 :			ss_min_lsu,
1913 :			ss_min_nexts,
1914 :			};
1915 :
1916 :	pazsan	1.10	void gforth_args(int argc, char argv, char path, char ** imagename)
1917 :			{
1918 :			int c;
1919 :
1920 :	anton	1.1	opterr=0;
1921 :			while (1) {
1922 :			int option_index=0;
1923 :			static struct option opts[] = {
1924 :	anton	1.29	{"appl-image", required_argument, NULL, 'a'},
1925 :	anton	1.1	{"image-file", required_argument, NULL, 'i'},
1926 :			{"dictionary-size", required_argument, NULL, 'm'},
1927 :			{"data-stack-size", required_argument, NULL, 'd'},
1928 :			{"return-stack-size", required_argument, NULL, 'r'},
1929 :			{"fp-stack-size", required_argument, NULL, 'f'},
1930 :			{"locals-stack-size", required_argument, NULL, 'l'},
1931 :			{"path", required_argument, NULL, 'p'},
1932 :			{"version", no_argument, NULL, 'v'},
1933 :			{"help", no_argument, NULL, 'h'},
1934 :			/* put something != 0 into offset_image */
1935 :			{"offset-image", no_argument, &offset_image, 1},
1936 :			{"no-offset-im", no_argument, &offset_image, 0},
1937 :			{"clear-dictionary", no_argument, &clear_dictionary, 1},
1938 :	anton	1.4	{"die-on-signal", no_argument, &die_on_signal, 1},
1939 :	anton	1.1	{"debug", no_argument, &debug, 1},
1940 :	pazsan	1.144	{"diag", no_argument, &diag, 1},
1941 :	anton	1.60	{"no-super", no_argument, &no_super, 1},
1942 :			{"no-dynamic", no_argument, &no_dynamic, 1},
1943 :	anton	1.66	{"dynamic", no_argument, &no_dynamic, 0},
1944 :	anton	1.110	{"print-metrics", no_argument, &print_metrics, 1},
1945 :	anton	1.109	{"ss-number", required_argument, NULL, ss_number},
1946 :	anton	1.125	{"ss-states", required_argument, NULL, ss_states},
1947 :	anton	1.109	#ifndef NO_DYNAMIC
1948 :			{"ss-min-codesize", no_argument, NULL, ss_min_codesize},
1949 :			#endif
1950 :			{"ss-min-ls", no_argument, NULL, ss_min_ls},
1951 :			{"ss-min-lsu", no_argument, NULL, ss_min_lsu},
1952 :			{"ss-min-nexts", no_argument, NULL, ss_min_nexts},
1953 :	anton	1.110	{"ss-greedy", no_argument, &ss_greedy, 1},
1954 :	anton	1.158	{"tpa-noequiv", no_argument, &tpa_noequiv, 1},
1955 :			{"tpa-noautomaton", no_argument, &tpa_noautomaton, 1},
1956 :			{"tpa-trace", no_argument, &tpa_trace, 1},
1957 :	anton	1.1	{0,0,0,0}
1958 :			/* no-init-file, no-rc? */
1959 :			};
1960 :
1961 :	pazsan	1.36	c = getopt_long(argc, argv, "+i:m:d:r:f:l:p:vhoncsx", opts, &option_index);
1962 :	anton	1.1
1963 :			switch (c) {
1964 :	anton	1.29	case EOF: return;
1965 :			case '?': optind--; return;
1966 :			case 'a': *imagename = optarg; return;
1967 :	pazsan	1.10	case 'i': *imagename = optarg; break;
1968 :	anton	1.1	case 'm': dictsize = convsize(optarg,sizeof(Cell)); break;
1969 :			case 'd': dsize = convsize(optarg,sizeof(Cell)); break;
1970 :			case 'r': rsize = convsize(optarg,sizeof(Cell)); break;
1971 :			case 'f': fsize = convsize(optarg,sizeof(Float)); break;
1972 :			case 'l': lsize = convsize(optarg,sizeof(Cell)); break;
1973 :	pazsan	1.10	case 'p': *path = optarg; break;
1974 :	pazsan	1.36	case 'o': offset_image = 1; break;
1975 :			case 'n': offset_image = 0; break;
1976 :			case 'c': clear_dictionary = 1; break;
1977 :			case 's': die_on_signal = 1; break;
1978 :			case 'x': debug = 1; break;
1979 :	anton	1.83	case 'v': fputs(PACKAGE_STRING"\n", stderr); exit(0);
1980 :	anton	1.109	case ss_number: static_super_number = atoi(optarg); break;
1981 :	anton	1.125	case ss_states: maxstates = max(min(atoi(optarg),MAX_STATE),1); break;
1982 :	anton	1.109	#ifndef NO_DYNAMIC
1983 :			case ss_min_codesize: ss_cost = cost_codesize; break;
1984 :			#endif
1985 :			case ss_min_ls: ss_cost = cost_ls; break;
1986 :			case ss_min_lsu: ss_cost = cost_lsu; break;
1987 :			case ss_min_nexts: ss_cost = cost_nexts; break;
1988 :	anton	1.1	case 'h':
1989 :	anton	1.29	fprintf(stderr, "Usage: %s [engine options] ['--'] [image arguments]\n\
1990 :	anton	1.1	Engine Options:\n\
1991 :	anton	1.29	--appl-image FILE equivalent to '--image-file=FILE --'\n\
1992 :	pazsan	1.10	--clear-dictionary Initialize the dictionary with 0 bytes\n\
1993 :			-d SIZE, --data-stack-size=SIZE Specify data stack size\n\
1994 :			--debug Print debugging information during startup\n\
1995 :	pazsan	1.144	--diag Print diagnostic information during startup\n\
1996 :	pazsan	1.10	--die-on-signal exit instead of CATCHing some signals\n\
1997 :	anton	1.66	--dynamic use dynamic native code\n\
1998 :	pazsan	1.10	-f SIZE, --fp-stack-size=SIZE Specify floating point stack size\n\
1999 :			-h, --help Print this message and exit\n\
2000 :			-i FILE, --image-file=FILE Use image FILE instead of `gforth.fi'\n\
2001 :			-l SIZE, --locals-stack-size=SIZE Specify locals stack size\n\
2002 :			-m SIZE, --dictionary-size=SIZE Specify Forth dictionary size\n\
2003 :	anton	1.60	--no-dynamic Use only statically compiled primitives\n\
2004 :	pazsan	1.10	--no-offset-im Load image at normal position\n\
2005 :	anton	1.60	--no-super No dynamically formed superinstructions\n\
2006 :	pazsan	1.10	--offset-image Load image at a different position\n\
2007 :			-p PATH, --path=PATH Search path for finding image and sources\n\
2008 :	anton	1.110	--print-metrics Print some code generation metrics on exit\n\
2009 :	pazsan	1.10	-r SIZE, --return-stack-size=SIZE Specify return stack size\n\
2010 :	anton	1.111	--ss-greedy greedy, not optimal superinst selection\n\
2011 :			--ss-min-codesize select superinsts for smallest native code\n\
2012 :			--ss-min-ls minimize loads and stores\n\
2013 :			--ss-min-lsu minimize loads, stores, and pointer updates\n\
2014 :			--ss-min-nexts minimize the number of static superinsts\n\
2015 :			--ss-number=N use N static superinsts (default max)\n\
2016 :	anton	1.125	--ss-states=N N states for stack caching (default max)\n\
2017 :	anton	1.158	--tpa-noequiv automaton without state equivalence\n\
2018 :			--tpa-noautomaton dynamic programming only\n\
2019 :			--tpa-trace report new states etc.\n\
2020 :	anton	1.66	-v, --version Print engine version and exit\n\
2021 :	anton	1.1	SIZE arguments consist of an integer followed by a unit. The unit can be\n\
2022 :	pazsan	1.10	`b' (byte), `e' (element; default), `k' (KB), `M' (MB), `G' (GB) or `T' (TB).\n",
2023 :			argv[0]);
2024 :			optind--;
2025 :			return;
2026 :	anton	1.1	}
2027 :			}
2028 :	pazsan	1.10	}
2029 :	pazsan	1.11	#endif
2030 :	pazsan	1.10
2031 :	pazsan	1.161	static void print_diag()
2032 :	pazsan	1.144	{
2033 :
2034 :	pazsan	1.153	#if !defined(HAVE_GETRUSAGE) \|\| (!defined(HAS_FFCALL) && !defined(HAS_LIBFFI))
2035 :	pazsan	1.145	fprintf(stderr, "* missing functionality *\n"
2036 :	pazsan	1.144	#ifndef HAVE_GETRUSAGE
2037 :			" no getrusage -> CPUTIME broken\n"
2038 :			#endif
2039 :	pazsan	1.153	#if !defined(HAS_FFCALL) && !defined(HAS_LIBFFI)
2040 :	pazsan	1.144	" no ffcall -> only old-style foreign function calls (no fflib.fs)\n"
2041 :			#endif
2042 :			);
2043 :			#endif
2044 :			if((relocs < nonrelocs) \|\|
2045 :			#if defined(BUGGY_LL_CMP) \|\| defined(BUGGY_LL_MUL) \|\| defined(BUGGY_LL_DIV) \|\| defined(BUGGY_LL_ADD) \|\| defined(BUGGY_LL_SHIFT) \|\| defined(BUGGY_LL_D2F) \|\| defined(BUGGY_LL_F2D)
2046 :			1
2047 :			#else
2048 :			0
2049 :			#endif
2050 :			)
2051 :			debugp(stderr, "relocs: %d:%d\n", relocs, nonrelocs);
2052 :	pazsan	1.165	fprintf(stderr, "* %sperformance problems *\n%s",
2053 :			#if defined(BUGGY_LL_CMP) \|\| defined(BUGGY_LL_MUL) \|\| defined(BUGGY_LL_DIV) \|\| defined(BUGGY_LL_ADD) \|\| defined(BUGGY_LL_SHIFT) \|\| defined(BUGGY_LL_D2F) \|\| defined(BUGGY_LL_F2D) \|\| !defined(FORCE_REG) \|\| defined(BUGGY_LONG_LONG)
2054 :			"",
2055 :			#else
2056 :			"no ",
2057 :			#endif
2058 :	pazsan	1.144	#if defined(BUGGY_LL_CMP) \|\| defined(BUGGY_LL_MUL) \|\| defined(BUGGY_LL_DIV) \|\| defined(BUGGY_LL_ADD) \|\| defined(BUGGY_LL_SHIFT) \|\| defined(BUGGY_LL_D2F) \|\| defined(BUGGY_LL_F2D)
2059 :			" double-cell integer type buggy ->\n "
2060 :			#ifdef BUGGY_LL_CMP
2061 :			"CMP, "
2062 :			#endif
2063 :			#ifdef BUGGY_LL_MUL
2064 :			"MUL, "
2065 :			#endif
2066 :			#ifdef BUGGY_LL_DIV
2067 :			"DIV, "
2068 :			#endif
2069 :			#ifdef BUGGY_LL_ADD
2070 :			"ADD, "
2071 :			#endif
2072 :			#ifdef BUGGY_LL_SHIFT
2073 :			"SHIFT, "
2074 :			#endif
2075 :			#ifdef BUGGY_LL_D2F
2076 :			"D2F, "
2077 :			#endif
2078 :			#ifdef BUGGY_LL_F2D
2079 :			"F2D, "
2080 :			#endif
2081 :			"\b\b slow\n"
2082 :	pazsan	1.145	#endif
2083 :			#ifndef FORCE_REG
2084 :			" automatic register allocation: performance degradation possible\n"
2085 :			#endif
2086 :			#if !defined(FORCE_REG) \|\| defined(BUGGY_LONG_LONG)
2087 :			"*** Suggested remedy: try ./configure"
2088 :			#ifndef FORCE_REG
2089 :			" --enable-force-reg"
2090 :			#endif
2091 :			#ifdef BUGGY_LONG_LONG
2092 :			" --enable-force-ll"
2093 :			#endif
2094 :			"\n"
2095 :	pazsan	1.144	#endif
2096 :			,
2097 :			(relocs < nonrelocs) ? " gcc PR 15242 -> no dynamic code generation (use gcc-2.95 instead)\n" : "");
2098 :			}
2099 :
2100 :	pazsan	1.10	#ifdef INCLUDE_IMAGE
2101 :			extern Cell image[];
2102 :			extern const char reloc_bits[];
2103 :			#endif
2104 :	pazsan	1.67
2105 :	pazsan	1.10	int main(int argc, char argv, char env)
2106 :			{
2107 :	pazsan	1.30	#ifdef HAS_OS
2108 :	pazsan	1.10	char *path = getenv("GFORTHPATH") ? : DEFAULTPATH;
2109 :	pazsan	1.30	#else
2110 :			char *path = DEFAULTPATH;
2111 :			#endif
2112 :	pazsan	1.13	#ifndef INCLUDE_IMAGE
2113 :	pazsan	1.10	char *imagename="gforth.fi";
2114 :			FILE *image_file;
2115 :			Address image;
2116 :			#endif
2117 :			int retvalue;
2118 :
2119 :	anton	1.56	#if defined(i386) && defined(ALIGNMENT_CHECK)
2120 :	pazsan	1.10	/* turn on alignment checks on the 486.
2121 :			* on the 386 this should have no effect. */
2122 :			__asm__("pushfl; popl %eax; orl $0x40000, %eax; pushl %eax; popfl;");
2123 :			/* this is unusable with Linux' libc.4.6.27, because this library is
2124 :			not alignment-clean; we would have to replace some library
2125 :			functions (e.g., memcpy) to make it work. Also GCC doesn't try to keep
2126 :			the stack FP-aligned. */
2127 :			#endif
2128 :
2129 :			/* buffering of the user output device */
2130 :	pazsan	1.11	#ifdef _IONBF
2131 :	pazsan	1.10	if (isatty(fileno(stdout))) {
2132 :			fflush(stdout);
2133 :			setvbuf(stdout,NULL,_IONBF,0);
2134 :	anton	1.1	}
2135 :	pazsan	1.11	#endif
2136 :	anton	1.1
2137 :	pazsan	1.10	progname = argv[0];
2138 :
2139 :	pazsan	1.11	#ifdef HAS_OS
2140 :	pazsan	1.10	gforth_args(argc, argv, &path, &imagename);
2141 :	anton	1.109	#ifndef NO_DYNAMIC
2142 :	anton	1.148	init_ss_cost();
2143 :	anton	1.109	#endif /* !defined(NO_DYNAMIC) */
2144 :			#endif /* defined(HAS_OS) */
2145 :	pazsan	1.10
2146 :			#ifdef INCLUDE_IMAGE
2147 :			set_stack_sizes((ImageHeader *)image);
2148 :	pazsan	1.22	if(((ImageHeader *)image)->base != image)
2149 :	pazsan	1.161	gforth_relocate(image, reloc_bits, ((ImageHeader *)image)->image_size,
2150 :	pazsan	1.164	(Label*)gforth_engine(0, 0, 0, 0, 0));
2151 :	pazsan	1.10	alloc_stacks((ImageHeader *)image);
2152 :			#else
2153 :			image_file = open_image_file(imagename, path);
2154 :	pazsan	1.161	image = gforth_loader(image_file, imagename);
2155 :	pazsan	1.10	#endif
2156 :	anton	1.24	gforth_header=(ImageHeader )image; / used in SIGSEGV handler */
2157 :	anton	1.1
2158 :	pazsan	1.144	if (diag)
2159 :			print_diag();
2160 :	anton	1.1	{
2161 :	pazsan	1.10	char path2[strlen(path)+1];
2162 :	anton	1.1	char p1, p2;
2163 :			Cell environ[]= {
2164 :			(Cell)argc-(optind-1),
2165 :			(Cell)(argv+(optind-1)),
2166 :	pazsan	1.10	(Cell)strlen(path),
2167 :	anton	1.1	(Cell)path2};
2168 :			argv[optind-1] = progname;
2169 :			/*
2170 :			for (i=0; i<environ[0]; i++)
2171 :			printf("%s\n", ((char **)(environ[1]))[i]);
2172 :			*/
2173 :			/* make path OS-independent by replacing path separators with NUL */
2174 :	pazsan	1.10	for (p1=path, p2=path2; *p1!='\0'; p1++, p2++)
2175 :	anton	1.1	if (*p1==PATHSEP)
2176 :			*p2 = '\0';
2177 :			else
2178 :			p2 = p1;
2179 :			*p2='\0';
2180 :	pazsan	1.161	retvalue = gforth_go(image, 4, environ);
2181 :	anton	1.102	#ifdef SIGPIPE
2182 :			bsd_signal(SIGPIPE, SIG_IGN);
2183 :			#endif
2184 :	anton	1.42	#ifdef VM_PROFILING
2185 :			vm_print_profile(stderr);
2186 :			#endif
2187 :	anton	1.1	deprep_terminal();
2188 :	anton	1.104	}
2189 :	anton	1.110	if (print_metrics) {
2190 :			int i;
2191 :			fprintf(stderr, "code size = %8ld\n", dyncodesize());
2192 :			for (i=0; i<sizeof(cost_sums)/sizeof(cost_sums[0]); i++)
2193 :			fprintf(stderr, "metric %8s: %8ld\n",
2194 :			cost_sums[i].metricname, cost_sums[i].sum);
2195 :	anton	1.158	fprintf(stderr,"lb_basic_blocks = %ld\n", lb_basic_blocks);
2196 :			fprintf(stderr,"lb_labeler_steps = %ld\n", lb_labeler_steps);
2197 :			fprintf(stderr,"lb_labeler_automaton = %ld\n", lb_labeler_automaton);
2198 :			fprintf(stderr,"lb_labeler_dynprog = %ld\n", lb_labeler_dynprog);
2199 :			fprintf(stderr,"lb_newstate_equiv = %ld\n", lb_newstate_equiv);
2200 :			fprintf(stderr,"lb_newstate_new = %ld\n", lb_newstate_new);
2201 :			fprintf(stderr,"lb_applicable_base_rules = %ld\n", lb_applicable_base_rules);
2202 :			fprintf(stderr,"lb_applicable_chain_rules = %ld\n", lb_applicable_chain_rules);
2203 :			}
2204 :			if (tpa_trace) {
2205 :			fprintf(stderr, "%ld %ld lb_states\n", lb_labeler_steps, lb_newstate_new);
2206 :			fprintf(stderr, "%ld %ld lb_table_entries\n", lb_labeler_steps, lb_labeler_dynprog);
2207 :	anton	1.1	}
2208 :	pazsan	1.13	return retvalue;
2209 :	anton	1.1	}

CVS Admin

gforth: gforth/engine/main.c

ViewCVS and CVS Help