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

CVS Admin

gforth: gforth/engine/main.c

ViewCVS and CVS Help