File:
[gforth] /
gforth /
engine /
main.c
Revision
1.121:
download - view:
text,
annotated -
select for diffs
Wed Aug 20 09:23:46 2003 UTC (20 years, 8 months ago) by
anton
Branches:
MAIN
CVS tags:
HEAD
Defined run-time routines (docol etc.) as primitives, eliminated some
special-casing and "+DOESJUMP+1" etc. in engine.c and main.c
Defined the enum type PrimNum and replaced many shorts with PrimNums
(gives nicer gdb output)
Workaround for the absence of the FPE_... macros in FreeBSD/Alpha 4_STABLE
1: /* command line interpretation, image loading etc. for Gforth
2:
3:
4: Copyright (C) 1995,1996,1997,1998,2000,2003 Free Software Foundation, Inc.
5:
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: Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
21: */
22:
23: #include "config.h"
24: #include "forth.h"
25: #include <errno.h>
26: #include <ctype.h>
27: #include <stdio.h>
28: #include <unistd.h>
29: #include <string.h>
30: #include <math.h>
31: #include <sys/types.h>
32: #ifndef STANDALONE
33: #include <sys/stat.h>
34: #endif
35: #include <fcntl.h>
36: #include <assert.h>
37: #include <stdlib.h>
38: #include <signal.h>
39: #ifndef STANDALONE
40: #if HAVE_SYS_MMAN_H
41: #include <sys/mman.h>
42: #endif
43: #endif
44: #include "io.h"
45: #include "getopt.h"
46: #ifdef STANDALONE
47: #include <systypes.h>
48: #endif
49:
50: typedef enum prim_num {
51: /* definitions of N_execute etc. */
52: #include "prim_num.i"
53: N_START_SUPER
54: } PrimNum;
55:
56: /* 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: #ifdef HAS_FFCALL
64: Cell *RP;
65: Address LP;
66:
67: #include <callback.h>
68:
69: va_alist clist;
70:
71: void engine_callback(Xt* fcall, void * alist)
72: {
73: clist = (va_alist)alist;
74: engine(fcall, SP, RP, FP, LP);
75: }
76: #endif
77:
78: #ifdef GFORTH_DEBUGGING
79: /* define some VM registers as global variables, so they survive exceptions;
80: global register variables are not up to the task (according to the
81: GNU C manual) */
82: Xt *saved_ip;
83: Cell *rp;
84: #endif
85:
86: #ifdef NO_IP
87: Label next_code;
88: #endif
89:
90: #ifdef HAS_FILE
91: char* fileattr[6]={"rb","rb","r+b","r+b","wb","wb"};
92: char* pfileattr[6]={"r","r","r+","r+","w","w"};
93:
94: #ifndef O_BINARY
95: #define O_BINARY 0
96: #endif
97: #ifndef O_TEXT
98: #define O_TEXT 0
99: #endif
100:
101: int ufileattr[6]= {
102: O_RDONLY|O_BINARY, O_RDONLY|O_BINARY,
103: O_RDWR |O_BINARY, O_RDWR |O_BINARY,
104: O_WRONLY|O_BINARY, O_WRONLY|O_BINARY };
105: #endif
106: /* end global vars for engine.c */
107:
108: #define PRIM_VERSION 1
109: /* increment this whenever the primitives change in an incompatible way */
110:
111: #ifndef DEFAULTPATH
112: # define DEFAULTPATH "."
113: #endif
114:
115: #ifdef MSDOS
116: jmp_buf throw_jmp_buf;
117: #endif
118:
119: #if defined(DOUBLY_INDIRECT)
120: # define CFA(n) ({Cell _n = (n); ((Cell)(((_n & 0x4000) ? symbols : xts)+(_n&~0x4000UL)));})
121: #else
122: # define CFA(n) ((Cell)(symbols+((n)&~0x4000UL)))
123: #endif
124:
125: #define maxaligned(n) (typeof(n))((((Cell)n)+sizeof(Float)-1)&-sizeof(Float))
126:
127: static UCell dictsize=0;
128: static UCell dsize=0;
129: static UCell rsize=0;
130: static UCell fsize=0;
131: static UCell lsize=0;
132: int offset_image=0;
133: int die_on_signal=0;
134: #ifndef INCLUDE_IMAGE
135: static int clear_dictionary=0;
136: UCell pagesize=1;
137: char *progname;
138: #else
139: char *progname = "gforth";
140: int optind = 1;
141: #endif
142:
143: #define CODE_BLOCK_SIZE (256*1024)
144: Address code_area=0;
145: Cell code_area_size = CODE_BLOCK_SIZE;
146: Address code_here=NULL+CODE_BLOCK_SIZE; /* does for code-area what HERE
147: does for the dictionary */
148: Address start_flush=NULL; /* start of unflushed code */
149: Cell last_jump=0; /* if the last prim was compiled without jump, this
150: is it's number, otherwise this contains 0 */
151:
152: static int no_super=0; /* true if compile_prim should not fuse prims */
153: static int no_dynamic=NO_DYNAMIC_DEFAULT; /* if true, no code is generated
154: dynamically */
155: static int print_metrics=0; /* if true, print metrics on exit */
156: static int static_super_number = 10000000; /* number of ss used if available */
157: static int ss_greedy = 0; /* if true: use greedy, not optimal ss selection */
158:
159: #ifdef HAS_DEBUG
160: int debug=0;
161: #else
162: # define perror(x...)
163: # define fprintf(x...)
164: #endif
165:
166: ImageHeader *gforth_header;
167: Label *vm_prims;
168: #ifdef DOUBLY_INDIRECT
169: Label *xts; /* same content as vm_prims, but should only be used for xts */
170: #endif
171:
172: #ifdef MEMCMP_AS_SUBROUTINE
173: int gforth_memcmp(const char * s1, const char * s2, size_t n)
174: {
175: return memcmp(s1, s2, n);
176: }
177: #endif
178:
179: /* image file format:
180: * "#! binary-path -i\n" (e.g., "#! /usr/local/bin/gforth-0.4.0 -i\n")
181: * padding to a multiple of 8
182: * magic: "Gforth3x" means format 0.6,
183: * where x is a byte with
184: * bit 7: reserved = 0
185: * bit 6:5: address unit size 2^n octets
186: * bit 4:3: character size 2^n octets
187: * bit 2:1: cell size 2^n octets
188: * bit 0: endian, big=0, little=1.
189: * The magic are always 8 octets, no matter what the native AU/character size is
190: * padding to max alignment (no padding necessary on current machines)
191: * ImageHeader structure (see forth.h)
192: * data (size in ImageHeader.image_size)
193: * tags ((if relocatable, 1 bit/data cell)
194: *
195: * tag==1 means that the corresponding word is an address;
196: * If the word is >=0, the address is within the image;
197: * addresses within the image are given relative to the start of the image.
198: * If the word =-1 (CF_NIL), the address is NIL,
199: * If the word is <CF_NIL and >CF(DODOES), it's a CFA (:, Create, ...)
200: * If the word =CF(DODOES), it's a DOES> CFA
201: * If the word =CF(DOESJUMP), it's a DOES JUMP (2 Cells after DOES>,
202: * possibly containing a jump to dodoes)
203: * If the word is <CF(DOESJUMP) and bit 14 is set, it's the xt of a primitive
204: * If the word is <CF(DOESJUMP) and bit 14 is clear,
205: * it's the threaded code of a primitive
206: * bits 13..9 of a primitive token state which group the primitive belongs to,
207: * bits 8..0 of a primitive token index into the group
208: */
209:
210: Cell groups[32] = {
211: 0,
212: 0
213: #undef GROUP
214: #undef GROUPADD
215: #define GROUPADD(n) +n
216: #define GROUP(x, n) , 0
217: #include "prim_grp.i"
218: #undef GROUP
219: #undef GROUPADD
220: #define GROUP(x, n)
221: #define GROUPADD(n)
222: };
223:
224: void relocate(Cell *image, const unsigned char *bitstring,
225: int size, Cell base, Label symbols[])
226: {
227: int i=0, j, k, steps=(size/sizeof(Cell))/RELINFOBITS;
228: Cell token;
229: char bits;
230: Cell max_symbols;
231: /*
232: * A virtual start address that's the real start address minus
233: * the one in the image
234: */
235: Cell *start = (Cell * ) (((void *) image) - ((void *) base));
236:
237: /* group index into table */
238: if(groups[31]==0) {
239: int groupsum=0;
240: for(i=0; i<32; i++) {
241: groupsum += groups[i];
242: groups[i] = groupsum;
243: /* printf("group[%d]=%d\n",i,groupsum); */
244: }
245: i=0;
246: }
247:
248: /* printf("relocating to %x[%x] start=%x base=%x\n", image, size, start, base); */
249:
250: for (max_symbols=0; symbols[max_symbols]!=0; max_symbols++)
251: ;
252: max_symbols--;
253: size/=sizeof(Cell);
254:
255: for(k=0; k<=steps; k++) {
256: for(j=0, bits=bitstring[k]; j<RELINFOBITS; j++, i++, bits<<=1) {
257: /* fprintf(stderr,"relocate: image[%d]\n", i);*/
258: if((i < size) && (bits & (1U << (RELINFOBITS-1)))) {
259: /* fprintf(stderr,"relocate: image[%d]=%d of %d\n", i, image[i], size/sizeof(Cell)); */
260: token=image[i];
261: if(token<0) {
262: int group = (-token & 0x3E00) >> 9;
263: if(group == 0) {
264: switch(token|0x4000) {
265: case CF_NIL : image[i]=0; break;
266: #if !defined(DOUBLY_INDIRECT)
267: case CF(DOCOL) :
268: case CF(DOVAR) :
269: case CF(DOCON) :
270: case CF(DOUSER) :
271: case CF(DODEFER) :
272: case CF(DOFIELD) : MAKE_CF(image+i,symbols[CF(token)]); break;
273: case CF(DOESJUMP): image[i]=0; break;
274: #endif /* !defined(DOUBLY_INDIRECT) */
275: case CF(DODOES) :
276: MAKE_DOES_CF(image+i,(Xt *)(image[i+1]+((Cell)start)));
277: break;
278: default : /* backward compatibility */
279: /* printf("Code field generation image[%x]:=CFA(%x)\n",
280: i, CF(image[i])); */
281: if (CF((token | 0x4000))<max_symbols) {
282: image[i]=(Cell)CFA(CF(token));
283: #ifdef DIRECT_THREADED
284: if ((token & 0x4000) == 0) /* threade code, no CFA */
285: compile_prim1(&image[i]);
286: #endif
287: } else
288: 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);
289: }
290: } else {
291: int tok = -token & 0x1FF;
292: if (tok < (groups[group+1]-groups[group])) {
293: #if defined(DOUBLY_INDIRECT)
294: image[i]=(Cell)CFA(((groups[group]+tok) | (CF(token) & 0x4000)));
295: #else
296: image[i]=(Cell)CFA((groups[group]+tok));
297: #endif
298: #ifdef DIRECT_THREADED
299: if ((token & 0x4000) == 0) /* threade code, no CFA */
300: compile_prim1(&image[i]);
301: #endif
302: } else
303: 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);
304: }
305: } else {
306: /* if base is > 0: 0 is a null reference so don't adjust*/
307: if (token>=base) {
308: image[i]+=(Cell)start;
309: }
310: }
311: }
312: }
313: }
314: finish_code();
315: ((ImageHeader*)(image))->base = (Address) image;
316: }
317:
318: UCell checksum(Label symbols[])
319: {
320: UCell r=PRIM_VERSION;
321: Cell i;
322:
323: for (i=DOCOL; i<=DOESJUMP; i++) {
324: r ^= (UCell)(symbols[i]);
325: r = (r << 5) | (r >> (8*sizeof(Cell)-5));
326: }
327: #ifdef DIRECT_THREADED
328: /* we have to consider all the primitives */
329: for (; symbols[i]!=(Label)0; i++) {
330: r ^= (UCell)(symbols[i]);
331: r = (r << 5) | (r >> (8*sizeof(Cell)-5));
332: }
333: #else
334: /* in indirect threaded code all primitives are accessed through the
335: symbols table, so we just have to put the base address of symbols
336: in the checksum */
337: r ^= (UCell)symbols;
338: #endif
339: return r;
340: }
341:
342: Address verbose_malloc(Cell size)
343: {
344: Address r;
345: /* leave a little room (64B) for stack underflows */
346: if ((r = malloc(size+64))==NULL) {
347: perror(progname);
348: exit(1);
349: }
350: r = (Address)((((Cell)r)+(sizeof(Float)-1))&(-sizeof(Float)));
351: if (debug)
352: fprintf(stderr, "malloc succeeds, address=$%lx\n", (long)r);
353: return r;
354: }
355:
356: static Address next_address=0;
357: void after_alloc(Address r, Cell size)
358: {
359: if (r != (Address)-1) {
360: if (debug)
361: fprintf(stderr, "success, address=$%lx\n", (long) r);
362: if (pagesize != 1)
363: next_address = (Address)(((((Cell)r)+size-1)&-pagesize)+2*pagesize); /* leave one page unmapped */
364: } else {
365: if (debug)
366: fprintf(stderr, "failed: %s\n", strerror(errno));
367: }
368: }
369:
370: #ifndef MAP_FAILED
371: #define MAP_FAILED ((Address) -1)
372: #endif
373: #ifndef MAP_FILE
374: # define MAP_FILE 0
375: #endif
376: #ifndef MAP_PRIVATE
377: # define MAP_PRIVATE 0
378: #endif
379: #if !defined(MAP_ANON) && defined(MAP_ANONYMOUS)
380: # define MAP_ANON MAP_ANONYMOUS
381: #endif
382:
383: #if defined(HAVE_MMAP)
384: static Address alloc_mmap(Cell size)
385: {
386: Address r;
387:
388: #if defined(MAP_ANON)
389: if (debug)
390: fprintf(stderr,"try mmap($%lx, $%lx, ..., MAP_ANON, ...); ", (long)next_address, (long)size);
391: r = mmap(next_address, size, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_ANON|MAP_PRIVATE, -1, 0);
392: #else /* !defined(MAP_ANON) */
393: /* Ultrix (at least) does not define MAP_FILE and MAP_PRIVATE (both are
394: apparently defaults) */
395: static int dev_zero=-1;
396:
397: if (dev_zero == -1)
398: dev_zero = open("/dev/zero", O_RDONLY);
399: if (dev_zero == -1) {
400: r = MAP_FAILED;
401: if (debug)
402: fprintf(stderr, "open(\"/dev/zero\"...) failed (%s), no mmap; ",
403: strerror(errno));
404: } else {
405: if (debug)
406: fprintf(stderr,"try mmap($%lx, $%lx, ..., MAP_FILE, dev_zero, ...); ", (long)next_address, (long)size);
407: r=mmap(next_address, size, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_FILE|MAP_PRIVATE, dev_zero, 0);
408: }
409: #endif /* !defined(MAP_ANON) */
410: after_alloc(r, size);
411: return r;
412: }
413: #endif
414:
415: Address my_alloc(Cell size)
416: {
417: #if HAVE_MMAP
418: Address r;
419:
420: r=alloc_mmap(size);
421: if (r!=(Address)MAP_FAILED)
422: return r;
423: #endif /* HAVE_MMAP */
424: /* use malloc as fallback */
425: return verbose_malloc(size);
426: }
427:
428: Address dict_alloc_read(FILE *file, Cell imagesize, Cell dictsize, Cell offset)
429: {
430: Address image = MAP_FAILED;
431:
432: #if defined(HAVE_MMAP)
433: if (offset==0) {
434: image=alloc_mmap(dictsize);
435: if (debug)
436: fprintf(stderr,"try mmap($%lx, $%lx, ..., MAP_FIXED|MAP_FILE, imagefile, 0); ", (long)image, (long)imagesize);
437: image = mmap(image, imagesize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_FIXED|MAP_FILE|MAP_PRIVATE, fileno(file), 0);
438: after_alloc(image,dictsize);
439: }
440: #endif /* defined(HAVE_MMAP) */
441: if (image == (Address)MAP_FAILED) {
442: image = my_alloc(dictsize+offset)+offset;
443: rewind(file); /* fseek(imagefile,0L,SEEK_SET); */
444: fread(image, 1, imagesize, file);
445: }
446: return image;
447: }
448:
449: void set_stack_sizes(ImageHeader * header)
450: {
451: if (dictsize==0)
452: dictsize = header->dict_size;
453: if (dsize==0)
454: dsize = header->data_stack_size;
455: if (rsize==0)
456: rsize = header->return_stack_size;
457: if (fsize==0)
458: fsize = header->fp_stack_size;
459: if (lsize==0)
460: lsize = header->locals_stack_size;
461: dictsize=maxaligned(dictsize);
462: dsize=maxaligned(dsize);
463: rsize=maxaligned(rsize);
464: lsize=maxaligned(lsize);
465: fsize=maxaligned(fsize);
466: }
467:
468: void alloc_stacks(ImageHeader * header)
469: {
470: header->dict_size=dictsize;
471: header->data_stack_size=dsize;
472: header->fp_stack_size=fsize;
473: header->return_stack_size=rsize;
474: header->locals_stack_size=lsize;
475:
476: header->data_stack_base=my_alloc(dsize);
477: header->fp_stack_base=my_alloc(fsize);
478: header->return_stack_base=my_alloc(rsize);
479: header->locals_stack_base=my_alloc(lsize);
480: }
481:
482: #warning You can ignore the warnings about clobbered variables in go_forth
483: int go_forth(Address image, int stack, Cell *entries)
484: {
485: volatile ImageHeader *image_header = (ImageHeader *)image;
486: Cell *sp0=(Cell*)(image_header->data_stack_base + dsize);
487: Cell *rp0=(Cell *)(image_header->return_stack_base + rsize);
488: Float *fp0=(Float *)(image_header->fp_stack_base + fsize);
489: #ifdef GFORTH_DEBUGGING
490: volatile Cell *orig_rp0=rp0;
491: #endif
492: Address lp0=image_header->locals_stack_base + lsize;
493: Xt *ip0=(Xt *)(image_header->boot_entry);
494: #ifdef SYSSIGNALS
495: int throw_code;
496: #endif
497:
498: /* ensure that the cached elements (if any) are accessible */
499: IF_spTOS(sp0--);
500: IF_fpTOS(fp0--);
501:
502: for(;stack>0;stack--)
503: *--sp0=entries[stack-1];
504:
505: #ifdef SYSSIGNALS
506: get_winsize();
507:
508: install_signal_handlers(); /* right place? */
509:
510: if ((throw_code=setjmp(throw_jmp_buf))) {
511: static Cell signal_data_stack[8];
512: static Cell signal_return_stack[8];
513: static Float signal_fp_stack[1];
514:
515: signal_data_stack[7]=throw_code;
516:
517: #ifdef GFORTH_DEBUGGING
518: if (debug)
519: fprintf(stderr,"\ncaught signal, throwing exception %d, ip=%p rp=%p\n",
520: throw_code, saved_ip, rp);
521: if (rp <= orig_rp0 && rp > (Cell *)(image_header->return_stack_base+5)) {
522: /* no rstack overflow or underflow */
523: rp0 = rp;
524: *--rp0 = (Cell)saved_ip;
525: }
526: else /* I love non-syntactic ifdefs :-) */
527: rp0 = signal_return_stack+8;
528: #else /* !defined(GFORTH_DEBUGGING) */
529: if (debug)
530: fprintf(stderr,"\ncaught signal, throwing exception %d\n", throw_code);
531: rp0 = signal_return_stack+8;
532: #endif /* !defined(GFORTH_DEBUGGING) */
533: /* fprintf(stderr, "rp=$%x\n",rp0);*/
534:
535: return((int)(Cell)engine(image_header->throw_entry, signal_data_stack+7,
536: rp0, signal_fp_stack, 0));
537: }
538: #endif
539:
540: return((int)(Cell)engine(ip0,sp0,rp0,fp0,lp0));
541: }
542:
543: #ifndef INCLUDE_IMAGE
544: void print_sizes(Cell sizebyte)
545: /* print size information */
546: {
547: static char* endianstring[]= { " big","little" };
548:
549: fprintf(stderr,"%s endian, cell=%d bytes, char=%d bytes, au=%d bytes\n",
550: endianstring[sizebyte & 1],
551: 1 << ((sizebyte >> 1) & 3),
552: 1 << ((sizebyte >> 3) & 3),
553: 1 << ((sizebyte >> 5) & 3));
554: }
555:
556: /* static superinstruction stuff */
557:
558: struct cost {
559: char loads; /* number of stack loads */
560: char stores; /* number of stack stores */
561: char updates; /* number of stack pointer updates */
562: short offset; /* offset into super2 table */
563: char length; /* number of components */
564: };
565:
566: PrimNum super2[] = {
567: #include "super2.i"
568: };
569:
570: struct cost super_costs[] = {
571: #include "costs.i"
572: };
573:
574: #define HASH_SIZE 256
575:
576: struct super_table_entry {
577: struct super_table_entry *next;
578: PrimNum *start;
579: short length;
580: PrimNum super;
581: } *super_table[HASH_SIZE];
582: int max_super=2;
583:
584: int hash_super(PrimNum *start, int length)
585: {
586: int i, r;
587:
588: for (i=0, r=0; i<length; i++) {
589: r <<= 1;
590: r += start[i];
591: }
592: return r & (HASH_SIZE-1);
593: }
594:
595: int lookup_super(PrimNum *start, int length)
596: {
597: int hash=hash_super(start,length);
598: struct super_table_entry *p = super_table[hash];
599:
600: assert(length >= 2);
601: for (; p!=NULL; p = p->next) {
602: if (length == p->length &&
603: memcmp((char *)p->start, (char *)start, length*sizeof(PrimNum))==0)
604: return p->super;
605: }
606: return -1;
607: }
608:
609: void prepare_super_table()
610: {
611: int i;
612: int nsupers = 0;
613:
614: for (i=0; i<sizeof(super_costs)/sizeof(super_costs[0]); i++) {
615: struct cost *c = &super_costs[i];
616: if (c->length > 1 && nsupers < static_super_number) {
617: int hash = hash_super(super2+c->offset, c->length);
618: struct super_table_entry **p = &super_table[hash];
619: struct super_table_entry *e = malloc(sizeof(struct super_table_entry));
620: e->next = *p;
621: e->start = super2 + c->offset;
622: e->length = c->length;
623: e->super = i;
624: *p = e;
625: if (c->length > max_super)
626: max_super = c->length;
627: nsupers++;
628: }
629: }
630: if (debug)
631: fprintf(stderr, "Using %d static superinsts\n", nsupers);
632: }
633:
634: /* dynamic replication/superinstruction stuff */
635:
636: #define MAX_IMMARGS 2
637:
638: #ifndef NO_DYNAMIC
639: typedef struct {
640: Label start;
641: Cell length; /* only includes the jump iff superend is true*/
642: Cell restlength; /* length of the rest (i.e., the jump or (on superend) 0) */
643: char superend; /* true if primitive ends superinstruction, i.e.,
644: unconditional branch, execute, etc. */
645: Cell nimmargs;
646: struct immarg {
647: Cell offset; /* offset of immarg within prim */
648: char rel; /* true if immarg is relative */
649: } immargs[MAX_IMMARGS];
650: } PrimInfo;
651:
652: PrimInfo *priminfos;
653: PrimInfo **decomp_prims;
654:
655: int compare_priminfo_length(const void *_a, const void *_b)
656: {
657: PrimInfo **a = (PrimInfo **)_a;
658: PrimInfo **b = (PrimInfo **)_b;
659: Cell diff = (*a)->length - (*b)->length;
660: if (diff)
661: return diff;
662: else /* break ties by start address; thus the decompiler produces
663: the earliest primitive with the same code (e.g. noop instead
664: of (char) and @ instead of >code-address */
665: return (*b)->start - (*a)->start;
666: }
667: #endif /* !defined(NO_DYNAMIC) */
668:
669: static char superend[]={
670: #include "prim_superend.i"
671: };
672:
673: Cell npriminfos=0;
674:
675: int compare_labels(const void *pa, const void *pb)
676: {
677: Label a = *(Label *)pa;
678: Label b = *(Label *)pb;
679: return a-b;
680: }
681:
682: Label bsearch_next(Label key, Label *a, UCell n)
683: /* a is sorted; return the label >=key that is the closest in a;
684: return NULL if there is no label in a >=key */
685: {
686: int mid = (n-1)/2;
687: if (n<1)
688: return NULL;
689: if (n == 1) {
690: if (a[0] < key)
691: return NULL;
692: else
693: return a[0];
694: }
695: if (a[mid] < key)
696: return bsearch_next(key, a+mid+1, n-mid-1);
697: else
698: return bsearch_next(key, a, mid+1);
699: }
700:
701: void check_prims(Label symbols1[])
702: {
703: int i;
704: #ifndef NO_DYNAMIC
705: Label *symbols2, *symbols3, *ends1, *ends1j, *ends1jsorted;
706: int nends1j;
707: #endif
708:
709: if (debug)
710: #ifdef __VERSION__
711: fprintf(stderr, "Compiled with gcc-" __VERSION__ "\n");
712: #else
713: #define xstr(s) str(s)
714: #define str(s) #s
715: fprintf(stderr, "Compiled with gcc-" xstr(__GNUC__) "." xstr(__GNUC_MINOR__) "\n");
716: #endif
717: for (i=0; symbols1[i]!=0; i++)
718: ;
719: npriminfos = i;
720:
721: #ifndef NO_DYNAMIC
722: if (no_dynamic)
723: return;
724: symbols2=engine2(0,0,0,0,0);
725: #if NO_IP
726: symbols3=engine3(0,0,0,0,0);
727: #else
728: symbols3=symbols1;
729: #endif
730: ends1 = symbols1+i+1;
731: ends1j = ends1+i;
732: nends1j = i+1;
733: ends1jsorted = (Label *)alloca(nends1j*sizeof(Label));
734: memcpy(ends1jsorted,ends1j,nends1j*sizeof(Label));
735: qsort(ends1jsorted, nends1j, sizeof(Label), compare_labels);
736:
737: priminfos = calloc(i,sizeof(PrimInfo));
738: for (i=0; symbols1[i]!=0; i++) {
739: int prim_len = ends1[i]-symbols1[i];
740: PrimInfo *pi=&priminfos[i];
741: int j=0;
742: char *s1 = (char *)symbols1[i];
743: char *s2 = (char *)symbols2[i];
744: char *s3 = (char *)symbols3[i];
745: Label endlabel = bsearch_next(symbols1[i]+1,ends1jsorted,nends1j);
746:
747: pi->start = s1;
748: pi->superend = superend[i]|no_super;
749: if (pi->superend)
750: pi->length = endlabel-symbols1[i];
751: else
752: pi->length = prim_len;
753: pi->restlength = endlabel - symbols1[i] - pi->length;
754: pi->nimmargs = 0;
755: if (debug)
756: fprintf(stderr, "Prim %3d @ %p %p %p, length=%3ld restlength=%2ld superend=%1d",
757: i, s1, s2, s3, (long)(pi->length), (long)(pi->restlength), pi->superend);
758: if (endlabel == NULL) {
759: pi->start = NULL; /* not relocatable */
760: if (debug)
761: fprintf(stderr,"\n non_reloc: no J label > start found\n");
762: continue;
763: }
764: if (ends1[i] > endlabel && !pi->superend) {
765: pi->start = NULL; /* not relocatable */
766: if (debug)
767: fprintf(stderr,"\n non_reloc: there is a J label before the K label (restlength<0)\n");
768: continue;
769: }
770: if (ends1[i] < pi->start && !pi->superend) {
771: pi->start = NULL; /* not relocatable */
772: if (debug)
773: fprintf(stderr,"\n non_reloc: K label before I label (length<0)\n");
774: continue;
775: }
776: assert(prim_len>=0);
777: assert(pi->restlength >=0);
778: while (j<(pi->length+pi->restlength)) {
779: if (s1[j]==s3[j]) {
780: if (s1[j] != s2[j]) {
781: pi->start = NULL; /* not relocatable */
782: if (debug)
783: fprintf(stderr,"\n non_reloc: engine1!=engine2 offset %3d",j);
784: /* assert(j<prim_len); */
785: break;
786: }
787: j++;
788: } else {
789: struct immarg *ia=&pi->immargs[pi->nimmargs];
790:
791: pi->nimmargs++;
792: ia->offset=j;
793: if ((~*(Cell *)&(s1[j]))==*(Cell *)&(s3[j])) {
794: ia->rel=0;
795: if (debug)
796: fprintf(stderr,"\n absolute immarg: offset %3d",j);
797: } else if ((&(s1[j]))+(*(Cell *)&(s1[j]))+4 ==
798: symbols1[DOESJUMP+1]) {
799: ia->rel=1;
800: if (debug)
801: fprintf(stderr,"\n relative immarg: offset %3d",j);
802: } else {
803: pi->start = NULL; /* not relocatable */
804: if (debug)
805: fprintf(stderr,"\n non_reloc: engine1!=engine3 offset %3d",j);
806: /* assert(j<prim_len);*/
807: break;
808: }
809: j+=4;
810: }
811: }
812: if (debug)
813: fprintf(stderr,"\n");
814: }
815: decomp_prims = calloc(i,sizeof(PrimInfo *));
816: for (i=DOESJUMP+1; i<npriminfos; i++)
817: decomp_prims[i] = &(priminfos[i]);
818: qsort(decomp_prims+DOESJUMP+1, npriminfos-DOESJUMP-1, sizeof(PrimInfo *),
819: compare_priminfo_length);
820: #endif
821: }
822:
823: void flush_to_here(void)
824: {
825: #ifndef NO_DYNAMIC
826: if (start_flush)
827: FLUSH_ICACHE(start_flush, code_here-start_flush);
828: start_flush=code_here;
829: #endif
830: }
831:
832: #ifndef NO_DYNAMIC
833: void append_jump(void)
834: {
835: if (last_jump) {
836: PrimInfo *pi = &priminfos[last_jump];
837:
838: memcpy(code_here, pi->start+pi->length, pi->restlength);
839: code_here += pi->restlength;
840: last_jump=0;
841: }
842: }
843:
844: /* Gforth remembers all code blocks in this list. On forgetting (by
845: executing a marker) the code blocks are not freed (because Gforth does
846: not remember how they were allocated; hmm, remembering that might be
847: easier and cleaner). Instead, code_here etc. are reset to the old
848: value, and the "forgotten" code blocks are reused when they are
849: needed. */
850:
851: struct code_block_list {
852: struct code_block_list *next;
853: Address block;
854: Cell size;
855: } *code_block_list=NULL, **next_code_blockp=&code_block_list;
856:
857: Address append_prim(Cell p)
858: {
859: PrimInfo *pi = &priminfos[p];
860: Address old_code_here = code_here;
861:
862: if (code_area+code_area_size < code_here+pi->length+pi->restlength) {
863: struct code_block_list *p;
864: append_jump();
865: flush_to_here();
866: if (*next_code_blockp == NULL) {
867: code_here = start_flush = code_area = my_alloc(code_area_size);
868: p = (struct code_block_list *)malloc(sizeof(struct code_block_list));
869: *next_code_blockp = p;
870: p->next = NULL;
871: p->block = code_here;
872: p->size = code_area_size;
873: } else {
874: p = *next_code_blockp;
875: code_here = start_flush = code_area = p->block;
876: }
877: old_code_here = code_here;
878: next_code_blockp = &(p->next);
879: }
880: memcpy(code_here, pi->start, pi->length);
881: code_here += pi->length;
882: return old_code_here;
883: }
884: #endif
885:
886: int forget_dyncode(Address code)
887: {
888: #ifdef NO_DYNAMIC
889: return -1;
890: #else
891: struct code_block_list *p, **pp;
892:
893: for (pp=&code_block_list, p=*pp; p!=NULL; pp=&(p->next), p=*pp) {
894: if (code >= p->block && code < p->block+p->size) {
895: next_code_blockp = &(p->next);
896: code_here = start_flush = code;
897: code_area = p->block;
898: last_jump = 0;
899: return -1;
900: }
901: }
902: return -no_dynamic;
903: #endif /* !defined(NO_DYNAMIC) */
904: }
905:
906: long dyncodesize(void)
907: {
908: #ifndef NO_DYNAMIC
909: struct code_block_list *p;
910: long size=0;
911: for (p=code_block_list; p!=NULL; p=p->next) {
912: if (code_here >= p->block && code_here < p->block+p->size)
913: return size + (code_here - p->block);
914: else
915: size += p->size;
916: }
917: #endif /* !defined(NO_DYNAMIC) */
918: return 0;
919: }
920:
921: Label decompile_code(Label _code)
922: {
923: #ifdef NO_DYNAMIC
924: return _code;
925: #else /* !defined(NO_DYNAMIC) */
926: Cell i;
927: struct code_block_list *p;
928: Address code=_code;
929:
930: /* first, check if we are in code at all */
931: for (p = code_block_list;; p = p->next) {
932: if (p == NULL)
933: return code;
934: if (code >= p->block && code < p->block+p->size)
935: break;
936: }
937: /* reverse order because NOOP might match other prims */
938: for (i=npriminfos-1; i>DOESJUMP; i--) {
939: PrimInfo *pi=decomp_prims[i];
940: if (pi->start==code || (pi->start && memcmp(code,pi->start,pi->length)==0))
941: return vm_prims[super2[super_costs[pi-priminfos].offset]];
942: /* return pi->start;*/
943: }
944: return code;
945: #endif /* !defined(NO_DYNAMIC) */
946: }
947:
948: #ifdef NO_IP
949: int nbranchinfos=0;
950:
951: struct branchinfo {
952: Label *targetptr; /* *(bi->targetptr) is the target */
953: Cell *addressptr; /* store the target here */
954: } branchinfos[100000];
955:
956: int ndoesexecinfos=0;
957: struct doesexecinfo {
958: int branchinfo; /* fix the targetptr of branchinfos[...->branchinfo] */
959: Cell *xt; /* cfa of word whose does-code needs calling */
960: } doesexecinfos[10000];
961:
962: void set_rel_target(Cell *source, Label target)
963: {
964: *source = ((Cell)target)-(((Cell)source)+4);
965: }
966:
967: void register_branchinfo(Label source, Cell targetptr)
968: {
969: struct branchinfo *bi = &(branchinfos[nbranchinfos]);
970: bi->targetptr = (Label *)targetptr;
971: bi->addressptr = (Cell *)source;
972: nbranchinfos++;
973: }
974:
975: Cell *compile_prim1arg(Cell p)
976: {
977: int l = priminfos[p].length;
978: Address old_code_here=code_here;
979:
980: assert(vm_prims[p]==priminfos[p].start);
981: append_prim(p);
982: return (Cell*)(old_code_here+priminfos[p].immargs[0].offset);
983: }
984:
985: Cell *compile_call2(Cell targetptr)
986: {
987: Cell *next_code_target;
988: PrimInfo *pi = &priminfos[N_call2];
989: Address old_code_here = append_prim(N_call2);
990:
991: next_code_target = (Cell *)(old_code_here + pi->immargs[0].offset);
992: register_branchinfo(old_code_here + pi->immargs[1].offset, targetptr);
993: return next_code_target;
994: }
995: #endif
996:
997: void finish_code(void)
998: {
999: #ifdef NO_IP
1000: Cell i;
1001:
1002: compile_prim1(NULL);
1003: for (i=0; i<ndoesexecinfos; i++) {
1004: struct doesexecinfo *dei = &doesexecinfos[i];
1005: branchinfos[dei->branchinfo].targetptr = DOES_CODE1((dei->xt));
1006: }
1007: ndoesexecinfos = 0;
1008: for (i=0; i<nbranchinfos; i++) {
1009: struct branchinfo *bi=&branchinfos[i];
1010: set_rel_target(bi->addressptr, *(bi->targetptr));
1011: }
1012: nbranchinfos = 0;
1013: #endif
1014: flush_to_here();
1015: }
1016:
1017: #if 0
1018: /* compile *start into a dynamic superinstruction, updating *start */
1019: void compile_prim_dyn(Cell *start)
1020: {
1021: #if defined(NO_IP)
1022: static Cell *last_start=NULL;
1023: static Xt last_prim=NULL;
1024: /* delay work by one call in order to get relocated immargs */
1025:
1026: if (last_start) {
1027: unsigned i = last_prim-vm_prims;
1028: PrimInfo *pi=&priminfos[i];
1029: Cell *next_code_target=NULL;
1030:
1031: assert(i<npriminfos);
1032: if (i==N_execute||i==N_perform||i==N_lit_perform) {
1033: next_code_target = compile_prim1arg(N_set_next_code);
1034: }
1035: if (i==N_call) {
1036: next_code_target = compile_call2(last_start[1]);
1037: } else if (i==N_does_exec) {
1038: struct doesexecinfo *dei = &doesexecinfos[ndoesexecinfos++];
1039: *compile_prim1arg(N_lit) = (Cell)PFA(last_start[1]);
1040: /* we cannot determine the callee now (last_start[1] may be a
1041: forward reference), so just register an arbitrary target, and
1042: register in dei that we need to fix this before resolving
1043: branches */
1044: dei->branchinfo = nbranchinfos;
1045: dei->xt = (Cell *)(last_start[1]);
1046: next_code_target = compile_call2(NULL);
1047: } else if (pi->start == NULL) { /* non-reloc */
1048: next_code_target = compile_prim1arg(N_set_next_code);
1049: set_rel_target(compile_prim1arg(N_abranch),*(Xt)last_prim);
1050: } else {
1051: unsigned j;
1052: Address old_code_here = append_prim(i);
1053:
1054: for (j=0; j<pi->nimmargs; j++) {
1055: struct immarg *ia = &(pi->immargs[j]);
1056: Cell argval = last_start[pi->nimmargs - j]; /* !! specific to prims */
1057: if (ia->rel) { /* !! assumption: relative refs are branches */
1058: register_branchinfo(old_code_here + ia->offset, argval);
1059: } else /* plain argument */
1060: *(Cell *)(old_code_here + ia->offset) = argval;
1061: }
1062: }
1063: if (next_code_target!=NULL)
1064: *next_code_target = (Cell)code_here;
1065: }
1066: if (start) {
1067: last_prim = (Xt)*start;
1068: *start = (Cell)code_here;
1069: }
1070: last_start = start;
1071: return;
1072: #elif !defined(NO_DYNAMIC)
1073: Label prim=(Label)*start;
1074: unsigned i;
1075: Address old_code_here;
1076:
1077: i = ((Xt)prim)-vm_prims;
1078: prim = *(Xt)prim;
1079: if (no_dynamic) {
1080: *start = (Cell)prim;
1081: return;
1082: }
1083: if (i>=npriminfos || priminfos[i].start == 0) { /* not a relocatable prim */
1084: append_jump();
1085: *start = (Cell)prim;
1086: return;
1087: }
1088: assert(priminfos[i].start = prim);
1089: #ifdef ALIGN_CODE
1090: /* ALIGN_CODE;*/
1091: #endif
1092: assert(prim==priminfos[i].start);
1093: old_code_here = append_prim(i);
1094: last_jump = (priminfos[i].superend) ? 0 : i;
1095: *start = (Cell)old_code_here;
1096: return;
1097: #else /* !defined(DOUBLY_INDIRECT), no code replication */
1098: Label prim=(Label)*start;
1099: #if !defined(INDIRECT_THREADED)
1100: prim = *(Xt)prim;
1101: #endif
1102: *start = (Cell)prim;
1103: return;
1104: #endif /* !defined(DOUBLY_INDIRECT) */
1105: }
1106: #endif /* 0 */
1107:
1108: Cell compile_prim_dyn(unsigned p)
1109: {
1110: Cell static_prim = (Cell)vm_prims[p];
1111: #if defined(NO_DYNAMIC)
1112: return static_prim;
1113: #else /* !defined(NO_DYNAMIC) */
1114: Address old_code_here;
1115:
1116: if (no_dynamic)
1117: return static_prim;
1118: if (p>=npriminfos || priminfos[p].start == 0) { /* not a relocatable prim */
1119: append_jump();
1120: return static_prim;
1121: }
1122: old_code_here = append_prim(p);
1123: last_jump = (priminfos[p].superend) ? 0 : p;
1124: return (Cell)old_code_here;
1125: #endif /* !defined(NO_DYNAMIC) */
1126: }
1127:
1128: #ifndef NO_DYNAMIC
1129: int cost_codesize(int prim)
1130: {
1131: return priminfos[prim].length;
1132: }
1133: #endif
1134:
1135: int cost_ls(int prim)
1136: {
1137: struct cost *c = super_costs+prim;
1138:
1139: return c->loads + c->stores;
1140: }
1141:
1142: int cost_lsu(int prim)
1143: {
1144: struct cost *c = super_costs+prim;
1145:
1146: return c->loads + c->stores + c->updates;
1147: }
1148:
1149: int cost_nexts(int prim)
1150: {
1151: return 1;
1152: }
1153:
1154: typedef int Costfunc(int);
1155: Costfunc *ss_cost = /* cost function for optimize_bb */
1156: #ifdef NO_DYNAMIC
1157: cost_lsu;
1158: #else
1159: cost_codesize;
1160: #endif
1161:
1162: struct {
1163: Costfunc *costfunc;
1164: char *metricname;
1165: long sum;
1166: } cost_sums[] = {
1167: #ifndef NO_DYNAMIC
1168: { cost_codesize, "codesize", 0 },
1169: #endif
1170: { cost_ls, "ls", 0 },
1171: { cost_lsu, "lsu", 0 },
1172: { cost_nexts, "nexts", 0 }
1173: };
1174:
1175: #define MAX_BB 128 /* maximum number of instructions in BB */
1176:
1177: /* use dynamic programming to find the shortest paths within the basic
1178: block origs[0..ninsts-1]; optimals[i] contains the superinstruction
1179: on the shortest path to the end of the BB */
1180: void optimize_bb(PrimNum origs[], PrimNum optimals[], int ninsts)
1181: {
1182: int i,j, mincost;
1183: static int costs[MAX_BB+1];
1184:
1185: assert(ninsts<MAX_BB);
1186: costs[ninsts]=0;
1187: for (i=ninsts-1; i>=0; i--) {
1188: optimals[i] = origs[i];
1189: costs[i] = mincost = costs[i+1] + ss_cost(optimals[i]);
1190: for (j=2; j<=max_super && i+j<=ninsts ; j++) {
1191: int super, jcost;
1192:
1193: super = lookup_super(origs+i,j);
1194: if (super >= 0) {
1195: jcost = costs[i+j] + ss_cost(super);
1196: if (jcost <= mincost) {
1197: optimals[i] = super;
1198: mincost = jcost;
1199: if (!ss_greedy)
1200: costs[i] = jcost;
1201: }
1202: }
1203: }
1204: }
1205: }
1206:
1207: /* rewrite the instructions pointed to by instps to use the
1208: superinstructions in optimals */
1209: void rewrite_bb(Cell *instps[], PrimNum *optimals, int ninsts)
1210: {
1211: int i,j, nextdyn;
1212: Cell inst;
1213:
1214: for (i=0, nextdyn=0; i<ninsts; i++) {
1215: if (i==nextdyn) { /* compile dynamically */
1216: nextdyn += super_costs[optimals[i]].length;
1217: inst = compile_prim_dyn(optimals[i]);
1218: for (j=0; j<sizeof(cost_sums)/sizeof(cost_sums[0]); j++)
1219: cost_sums[j].sum += cost_sums[j].costfunc(optimals[i]);
1220: } else { /* compile statically */
1221: inst = (Cell)vm_prims[optimals[i]];
1222: }
1223: *(instps[i]) = inst;
1224: }
1225: }
1226:
1227: /* compile *start, possibly rewriting it into a static and/or dynamic
1228: superinstruction */
1229: void compile_prim1(Cell *start)
1230: {
1231: #if defined(DOUBLY_INDIRECT)
1232: Label prim=(Label)*start;
1233: if (prim<((Label)(xts+DOESJUMP)) || prim>((Label)(xts+npriminfos))) {
1234: fprintf(stderr,"compile_prim encountered xt %p\n", prim);
1235: *start=(Cell)prim;
1236: return;
1237: } else {
1238: *start = (Cell)(prim-((Label)xts)+((Label)vm_prims));
1239: return;
1240: }
1241: #elif defined(INDIRECT_THREADED)
1242: return;
1243: #else /* !(defined(DOUBLY_INDIRECT) || defined(INDIRECT_THREADED)) */
1244: static Cell *instps[MAX_BB];
1245: static PrimNum origs[MAX_BB];
1246: static PrimNum optimals[MAX_BB];
1247: static int ninsts=0;
1248: PrimNum prim_num;
1249:
1250: if (start==NULL)
1251: goto end_bb;
1252: prim_num = ((Xt)*start)-vm_prims;
1253: if (prim_num >= npriminfos)
1254: goto end_bb;
1255: assert(ninsts<MAX_BB);
1256: instps[ninsts] = start;
1257: origs[ninsts] = prim_num;
1258: ninsts++;
1259: if (ninsts >= MAX_BB || superend[prim_num]) {
1260: end_bb:
1261: optimize_bb(origs,optimals,ninsts);
1262: rewrite_bb(instps,optimals,ninsts);
1263: ninsts=0;
1264: }
1265: #endif /* !(defined(DOUBLY_INDIRECT) || defined(INDIRECT_THREADED)) */
1266: }
1267:
1268: #if defined(PRINT_SUPER_LENGTHS) && !defined(NO_DYNAMIC)
1269: Cell prim_length(Cell prim)
1270: {
1271: return priminfos[prim].length;
1272: }
1273: #endif
1274:
1275: Address loader(FILE *imagefile, char* filename)
1276: /* returns the address of the image proper (after the preamble) */
1277: {
1278: ImageHeader header;
1279: Address image;
1280: Address imp; /* image+preamble */
1281: Char magic[8];
1282: char magic7; /* size byte of magic number */
1283: Cell preamblesize=0;
1284: Cell data_offset = offset_image ? 56*sizeof(Cell) : 0;
1285: UCell check_sum;
1286: Cell ausize = ((RELINFOBITS == 8) ? 0 :
1287: (RELINFOBITS == 16) ? 1 :
1288: (RELINFOBITS == 32) ? 2 : 3);
1289: Cell charsize = ((sizeof(Char) == 1) ? 0 :
1290: (sizeof(Char) == 2) ? 1 :
1291: (sizeof(Char) == 4) ? 2 : 3) + ausize;
1292: Cell cellsize = ((sizeof(Cell) == 1) ? 0 :
1293: (sizeof(Cell) == 2) ? 1 :
1294: (sizeof(Cell) == 4) ? 2 : 3) + ausize;
1295: Cell sizebyte = (ausize << 5) + (charsize << 3) + (cellsize << 1) +
1296: #ifdef WORDS_BIGENDIAN
1297: 0
1298: #else
1299: 1
1300: #endif
1301: ;
1302:
1303: vm_prims = engine(0,0,0,0,0);
1304: check_prims(vm_prims);
1305: prepare_super_table();
1306: #ifndef DOUBLY_INDIRECT
1307: #ifdef PRINT_SUPER_LENGTHS
1308: print_super_lengths();
1309: #endif
1310: check_sum = checksum(vm_prims);
1311: #else /* defined(DOUBLY_INDIRECT) */
1312: check_sum = (UCell)vm_prims;
1313: #endif /* defined(DOUBLY_INDIRECT) */
1314:
1315: do {
1316: if(fread(magic,sizeof(Char),8,imagefile) < 8) {
1317: fprintf(stderr,"%s: image %s doesn't seem to be a Gforth (>=0.6) image.\n",
1318: progname, filename);
1319: exit(1);
1320: }
1321: preamblesize+=8;
1322: } while(memcmp(magic,"Gforth3",7));
1323: magic7 = magic[7];
1324: if (debug) {
1325: magic[7]='\0';
1326: fprintf(stderr,"Magic found: %s ", magic);
1327: print_sizes(magic7);
1328: }
1329:
1330: if (magic7 != sizebyte)
1331: {
1332: fprintf(stderr,"This image is: ");
1333: print_sizes(magic7);
1334: fprintf(stderr,"whereas the machine is ");
1335: print_sizes(sizebyte);
1336: exit(-2);
1337: };
1338:
1339: fread((void *)&header,sizeof(ImageHeader),1,imagefile);
1340:
1341: set_stack_sizes(&header);
1342:
1343: #if HAVE_GETPAGESIZE
1344: pagesize=getpagesize(); /* Linux/GNU libc offers this */
1345: #elif HAVE_SYSCONF && defined(_SC_PAGESIZE)
1346: pagesize=sysconf(_SC_PAGESIZE); /* POSIX.4 */
1347: #elif PAGESIZE
1348: pagesize=PAGESIZE; /* in limits.h according to Gallmeister's POSIX.4 book */
1349: #endif
1350: if (debug)
1351: fprintf(stderr,"pagesize=%ld\n",(unsigned long) pagesize);
1352:
1353: image = dict_alloc_read(imagefile, preamblesize+header.image_size,
1354: preamblesize+dictsize, data_offset);
1355: imp=image+preamblesize;
1356: alloc_stacks((ImageHeader *)imp);
1357: if (clear_dictionary)
1358: memset(imp+header.image_size, 0, dictsize-header.image_size);
1359: if(header.base==0 || header.base == (Address)0x100) {
1360: Cell reloc_size=((header.image_size-1)/sizeof(Cell))/8+1;
1361: char reloc_bits[reloc_size];
1362: fseek(imagefile, preamblesize+header.image_size, SEEK_SET);
1363: fread(reloc_bits, 1, reloc_size, imagefile);
1364: relocate((Cell *)imp, reloc_bits, header.image_size, (Cell)header.base, vm_prims);
1365: #if 0
1366: { /* let's see what the relocator did */
1367: FILE *snapshot=fopen("snapshot.fi","wb");
1368: fwrite(image,1,imagesize,snapshot);
1369: fclose(snapshot);
1370: }
1371: #endif
1372: }
1373: else if(header.base!=imp) {
1374: fprintf(stderr,"%s: Cannot load nonrelocatable image (compiled for address $%lx) at address $%lx\n",
1375: progname, (unsigned long)header.base, (unsigned long)imp);
1376: exit(1);
1377: }
1378: if (header.checksum==0)
1379: ((ImageHeader *)imp)->checksum=check_sum;
1380: else if (header.checksum != check_sum) {
1381: fprintf(stderr,"%s: Checksum of image ($%lx) does not match the executable ($%lx)\n",
1382: progname, (unsigned long)(header.checksum),(unsigned long)check_sum);
1383: exit(1);
1384: }
1385: #ifdef DOUBLY_INDIRECT
1386: ((ImageHeader *)imp)->xt_base = xts;
1387: #endif
1388: fclose(imagefile);
1389:
1390: /* unnecessary, except maybe for CODE words */
1391: /* FLUSH_ICACHE(imp, header.image_size);*/
1392:
1393: return imp;
1394: }
1395:
1396: /* pointer to last '/' or '\' in file, 0 if there is none. */
1397: char *onlypath(char *filename)
1398: {
1399: return strrchr(filename, DIRSEP);
1400: }
1401:
1402: FILE *openimage(char *fullfilename)
1403: {
1404: FILE *image_file;
1405: char * expfilename = tilde_cstr(fullfilename, strlen(fullfilename), 1);
1406:
1407: image_file=fopen(expfilename,"rb");
1408: if (image_file!=NULL && debug)
1409: fprintf(stderr, "Opened image file: %s\n", expfilename);
1410: return image_file;
1411: }
1412:
1413: /* try to open image file concat(path[0:len],imagename) */
1414: FILE *checkimage(char *path, int len, char *imagename)
1415: {
1416: int dirlen=len;
1417: char fullfilename[dirlen+strlen(imagename)+2];
1418:
1419: memcpy(fullfilename, path, dirlen);
1420: if (fullfilename[dirlen-1]!=DIRSEP)
1421: fullfilename[dirlen++]=DIRSEP;
1422: strcpy(fullfilename+dirlen,imagename);
1423: return openimage(fullfilename);
1424: }
1425:
1426: FILE * open_image_file(char * imagename, char * path)
1427: {
1428: FILE * image_file=NULL;
1429: char *origpath=path;
1430:
1431: if(strchr(imagename, DIRSEP)==NULL) {
1432: /* first check the directory where the exe file is in !! 01may97jaw */
1433: if (onlypath(progname))
1434: image_file=checkimage(progname, onlypath(progname)-progname, imagename);
1435: if (!image_file)
1436: do {
1437: char *pend=strchr(path, PATHSEP);
1438: if (pend==NULL)
1439: pend=path+strlen(path);
1440: if (strlen(path)==0) break;
1441: image_file=checkimage(path, pend-path, imagename);
1442: path=pend+(*pend==PATHSEP);
1443: } while (image_file==NULL);
1444: } else {
1445: image_file=openimage(imagename);
1446: }
1447:
1448: if (!image_file) {
1449: fprintf(stderr,"%s: cannot open image file %s in path %s for reading\n",
1450: progname, imagename, origpath);
1451: exit(1);
1452: }
1453:
1454: return image_file;
1455: }
1456: #endif
1457:
1458: #ifdef HAS_OS
1459: UCell convsize(char *s, UCell elemsize)
1460: /* converts s of the format [0-9]+[bekMGT]? (e.g. 25k) into the number
1461: of bytes. the letter at the end indicates the unit, where e stands
1462: for the element size. default is e */
1463: {
1464: char *endp;
1465: UCell n,m;
1466:
1467: m = elemsize;
1468: n = strtoul(s,&endp,0);
1469: if (endp!=NULL) {
1470: if (strcmp(endp,"b")==0)
1471: m=1;
1472: else if (strcmp(endp,"k")==0)
1473: m=1024;
1474: else if (strcmp(endp,"M")==0)
1475: m=1024*1024;
1476: else if (strcmp(endp,"G")==0)
1477: m=1024*1024*1024;
1478: else if (strcmp(endp,"T")==0) {
1479: #if (SIZEOF_CHAR_P > 4)
1480: m=1024L*1024*1024*1024;
1481: #else
1482: fprintf(stderr,"%s: size specification \"%s\" too large for this machine\n", progname, endp);
1483: exit(1);
1484: #endif
1485: } else if (strcmp(endp,"e")!=0 && strcmp(endp,"")!=0) {
1486: fprintf(stderr,"%s: cannot grok size specification %s: invalid unit \"%s\"\n", progname, s, endp);
1487: exit(1);
1488: }
1489: }
1490: return n*m;
1491: }
1492:
1493: enum {
1494: ss_number = 256,
1495: ss_min_codesize,
1496: ss_min_ls,
1497: ss_min_lsu,
1498: ss_min_nexts,
1499: };
1500:
1501: void gforth_args(int argc, char ** argv, char ** path, char ** imagename)
1502: {
1503: int c;
1504:
1505: opterr=0;
1506: while (1) {
1507: int option_index=0;
1508: static struct option opts[] = {
1509: {"appl-image", required_argument, NULL, 'a'},
1510: {"image-file", required_argument, NULL, 'i'},
1511: {"dictionary-size", required_argument, NULL, 'm'},
1512: {"data-stack-size", required_argument, NULL, 'd'},
1513: {"return-stack-size", required_argument, NULL, 'r'},
1514: {"fp-stack-size", required_argument, NULL, 'f'},
1515: {"locals-stack-size", required_argument, NULL, 'l'},
1516: {"path", required_argument, NULL, 'p'},
1517: {"version", no_argument, NULL, 'v'},
1518: {"help", no_argument, NULL, 'h'},
1519: /* put something != 0 into offset_image */
1520: {"offset-image", no_argument, &offset_image, 1},
1521: {"no-offset-im", no_argument, &offset_image, 0},
1522: {"clear-dictionary", no_argument, &clear_dictionary, 1},
1523: {"die-on-signal", no_argument, &die_on_signal, 1},
1524: {"debug", no_argument, &debug, 1},
1525: {"no-super", no_argument, &no_super, 1},
1526: {"no-dynamic", no_argument, &no_dynamic, 1},
1527: {"dynamic", no_argument, &no_dynamic, 0},
1528: {"print-metrics", no_argument, &print_metrics, 1},
1529: {"ss-number", required_argument, NULL, ss_number},
1530: #ifndef NO_DYNAMIC
1531: {"ss-min-codesize", no_argument, NULL, ss_min_codesize},
1532: #endif
1533: {"ss-min-ls", no_argument, NULL, ss_min_ls},
1534: {"ss-min-lsu", no_argument, NULL, ss_min_lsu},
1535: {"ss-min-nexts", no_argument, NULL, ss_min_nexts},
1536: {"ss-greedy", no_argument, &ss_greedy, 1},
1537: {0,0,0,0}
1538: /* no-init-file, no-rc? */
1539: };
1540:
1541: c = getopt_long(argc, argv, "+i:m:d:r:f:l:p:vhoncsx", opts, &option_index);
1542:
1543: switch (c) {
1544: case EOF: return;
1545: case '?': optind--; return;
1546: case 'a': *imagename = optarg; return;
1547: case 'i': *imagename = optarg; break;
1548: case 'm': dictsize = convsize(optarg,sizeof(Cell)); break;
1549: case 'd': dsize = convsize(optarg,sizeof(Cell)); break;
1550: case 'r': rsize = convsize(optarg,sizeof(Cell)); break;
1551: case 'f': fsize = convsize(optarg,sizeof(Float)); break;
1552: case 'l': lsize = convsize(optarg,sizeof(Cell)); break;
1553: case 'p': *path = optarg; break;
1554: case 'o': offset_image = 1; break;
1555: case 'n': offset_image = 0; break;
1556: case 'c': clear_dictionary = 1; break;
1557: case 's': die_on_signal = 1; break;
1558: case 'x': debug = 1; break;
1559: case 'v': fputs(PACKAGE_STRING"\n", stderr); exit(0);
1560: case ss_number: static_super_number = atoi(optarg); break;
1561: #ifndef NO_DYNAMIC
1562: case ss_min_codesize: ss_cost = cost_codesize; break;
1563: #endif
1564: case ss_min_ls: ss_cost = cost_ls; break;
1565: case ss_min_lsu: ss_cost = cost_lsu; break;
1566: case ss_min_nexts: ss_cost = cost_nexts; break;
1567: case 'h':
1568: fprintf(stderr, "Usage: %s [engine options] ['--'] [image arguments]\n\
1569: Engine Options:\n\
1570: --appl-image FILE equivalent to '--image-file=FILE --'\n\
1571: --clear-dictionary Initialize the dictionary with 0 bytes\n\
1572: -d SIZE, --data-stack-size=SIZE Specify data stack size\n\
1573: --debug Print debugging information during startup\n\
1574: --die-on-signal exit instead of CATCHing some signals\n\
1575: --dynamic use dynamic native code\n\
1576: -f SIZE, --fp-stack-size=SIZE Specify floating point stack size\n\
1577: -h, --help Print this message and exit\n\
1578: -i FILE, --image-file=FILE Use image FILE instead of `gforth.fi'\n\
1579: -l SIZE, --locals-stack-size=SIZE Specify locals stack size\n\
1580: -m SIZE, --dictionary-size=SIZE Specify Forth dictionary size\n\
1581: --no-dynamic Use only statically compiled primitives\n\
1582: --no-offset-im Load image at normal position\n\
1583: --no-super No dynamically formed superinstructions\n\
1584: --offset-image Load image at a different position\n\
1585: -p PATH, --path=PATH Search path for finding image and sources\n\
1586: --print-metrics Print some code generation metrics on exit\n\
1587: -r SIZE, --return-stack-size=SIZE Specify return stack size\n\
1588: --ss-greedy greedy, not optimal superinst selection\n\
1589: --ss-min-codesize select superinsts for smallest native code\n\
1590: --ss-min-ls minimize loads and stores\n\
1591: --ss-min-lsu minimize loads, stores, and pointer updates\n\
1592: --ss-min-nexts minimize the number of static superinsts\n\
1593: --ss-number=N use N static superinsts (default max)\n\
1594: -v, --version Print engine version and exit\n\
1595: SIZE arguments consist of an integer followed by a unit. The unit can be\n\
1596: `b' (byte), `e' (element; default), `k' (KB), `M' (MB), `G' (GB) or `T' (TB).\n",
1597: argv[0]);
1598: optind--;
1599: return;
1600: }
1601: }
1602: }
1603: #endif
1604:
1605: #ifdef INCLUDE_IMAGE
1606: extern Cell image[];
1607: extern const char reloc_bits[];
1608: #endif
1609:
1610: int main(int argc, char **argv, char **env)
1611: {
1612: #ifdef HAS_OS
1613: char *path = getenv("GFORTHPATH") ? : DEFAULTPATH;
1614: #else
1615: char *path = DEFAULTPATH;
1616: #endif
1617: #ifndef INCLUDE_IMAGE
1618: char *imagename="gforth.fi";
1619: FILE *image_file;
1620: Address image;
1621: #endif
1622: int retvalue;
1623:
1624: #if defined(i386) && defined(ALIGNMENT_CHECK)
1625: /* turn on alignment checks on the 486.
1626: * on the 386 this should have no effect. */
1627: __asm__("pushfl; popl %eax; orl $0x40000, %eax; pushl %eax; popfl;");
1628: /* this is unusable with Linux' libc.4.6.27, because this library is
1629: not alignment-clean; we would have to replace some library
1630: functions (e.g., memcpy) to make it work. Also GCC doesn't try to keep
1631: the stack FP-aligned. */
1632: #endif
1633:
1634: /* buffering of the user output device */
1635: #ifdef _IONBF
1636: if (isatty(fileno(stdout))) {
1637: fflush(stdout);
1638: setvbuf(stdout,NULL,_IONBF,0);
1639: }
1640: #endif
1641:
1642: progname = argv[0];
1643:
1644: #ifdef HAS_OS
1645: gforth_args(argc, argv, &path, &imagename);
1646: #ifndef NO_DYNAMIC
1647: if (no_dynamic && ss_cost == cost_codesize) {
1648: ss_cost = cost_lsu;
1649: cost_sums[0] = cost_sums[1];
1650: if (debug)
1651: fprintf(stderr, "--no-dynamic conflicts with --ss-min-codesize, reverting to --ss-min-lsu\n");
1652: }
1653: #endif /* !defined(NO_DYNAMIC) */
1654: #endif /* defined(HAS_OS) */
1655:
1656: #ifdef INCLUDE_IMAGE
1657: set_stack_sizes((ImageHeader *)image);
1658: if(((ImageHeader *)image)->base != image)
1659: relocate(image, reloc_bits, ((ImageHeader *)image)->image_size,
1660: (Label*)engine(0, 0, 0, 0, 0));
1661: alloc_stacks((ImageHeader *)image);
1662: #else
1663: image_file = open_image_file(imagename, path);
1664: image = loader(image_file, imagename);
1665: #endif
1666: gforth_header=(ImageHeader *)image; /* used in SIGSEGV handler */
1667:
1668: {
1669: char path2[strlen(path)+1];
1670: char *p1, *p2;
1671: Cell environ[]= {
1672: (Cell)argc-(optind-1),
1673: (Cell)(argv+(optind-1)),
1674: (Cell)strlen(path),
1675: (Cell)path2};
1676: argv[optind-1] = progname;
1677: /*
1678: for (i=0; i<environ[0]; i++)
1679: printf("%s\n", ((char **)(environ[1]))[i]);
1680: */
1681: /* make path OS-independent by replacing path separators with NUL */
1682: for (p1=path, p2=path2; *p1!='\0'; p1++, p2++)
1683: if (*p1==PATHSEP)
1684: *p2 = '\0';
1685: else
1686: *p2 = *p1;
1687: *p2='\0';
1688: retvalue = go_forth(image, 4, environ);
1689: #ifdef SIGPIPE
1690: bsd_signal(SIGPIPE, SIG_IGN);
1691: #endif
1692: #ifdef VM_PROFILING
1693: vm_print_profile(stderr);
1694: #endif
1695: deprep_terminal();
1696: }
1697: if (print_metrics) {
1698: int i;
1699: fprintf(stderr, "code size = %8ld\n", dyncodesize());
1700: for (i=0; i<sizeof(cost_sums)/sizeof(cost_sums[0]); i++)
1701: fprintf(stderr, "metric %8s: %8ld\n",
1702: cost_sums[i].metricname, cost_sums[i].sum);
1703: }
1704: return retvalue;
1705: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to main.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [gforth] / gforth / engine