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: char branch; /* is it a branch (SET_IP) */
563: short offset; /* offset into super2 table */
564: char length; /* number of components */
565: };
566:
567: PrimNum super2[] = {
568: #include "super2.i"
569: };
570:
571: struct cost super_costs[] = {
572: #include "costs.i"
573: };
574:
575: #define HASH_SIZE 256
576:
577: struct super_table_entry {
578: struct super_table_entry *next;
579: PrimNum *start;
580: short length;
581: PrimNum super;
582: } *super_table[HASH_SIZE];
583: int max_super=2;
584:
585: int hash_super(PrimNum *start, int length)
586: {
587: int i, r;
588:
589: for (i=0, r=0; i<length; i++) {
590: r <<= 1;
591: r += start[i];
592: }
593: return r & (HASH_SIZE-1);
594: }
595:
596: int lookup_super(PrimNum *start, int length)
597: {
598: int hash=hash_super(start,length);
599: struct super_table_entry *p = super_table[hash];
600:
601: assert(length >= 2);
602: for (; p!=NULL; p = p->next) {
603: if (length == p->length &&
604: memcmp((char *)p->start, (char *)start, length*sizeof(PrimNum))==0)
605: return p->super;
606: }
607: return -1;
608: }
609:
610: void prepare_super_table()
611: {
612: int i;
613: int nsupers = 0;
614:
615: for (i=0; i<sizeof(super_costs)/sizeof(super_costs[0]); i++) {
616: struct cost *c = &super_costs[i];
617: if (c->length > 1 && nsupers < static_super_number) {
618: int hash = hash_super(super2+c->offset, c->length);
619: struct super_table_entry **p = &super_table[hash];
620: struct super_table_entry *e = malloc(sizeof(struct super_table_entry));
621: e->next = *p;
622: e->start = super2 + c->offset;
623: e->length = c->length;
624: e->super = i;
625: *p = e;
626: if (c->length > max_super)
627: max_super = c->length;
628: nsupers++;
629: }
630: }
631: if (debug)
632: fprintf(stderr, "Using %d static superinsts\n", nsupers);
633: }
634:
635: /* dynamic replication/superinstruction stuff */
636:
637: #define MAX_IMMARGS 2
638:
639: #ifndef NO_DYNAMIC
640: typedef struct {
641: Label start;
642: Cell length; /* only includes the jump iff superend is true*/
643: Cell restlength; /* length of the rest (i.e., the jump or (on superend) 0) */
644: char superend; /* true if primitive ends superinstruction, i.e.,
645: unconditional branch, execute, etc. */
646: Cell nimmargs;
647: struct immarg {
648: Cell offset; /* offset of immarg within prim */
649: char rel; /* true if immarg is relative */
650: } immargs[MAX_IMMARGS];
651: } PrimInfo;
652:
653: PrimInfo *priminfos;
654: PrimInfo **decomp_prims;
655:
656: int compare_priminfo_length(const void *_a, const void *_b)
657: {
658: PrimInfo **a = (PrimInfo **)_a;
659: PrimInfo **b = (PrimInfo **)_b;
660: Cell diff = (*a)->length - (*b)->length;
661: if (diff)
662: return diff;
663: else /* break ties by start address; thus the decompiler produces
664: the earliest primitive with the same code (e.g. noop instead
665: of (char) and @ instead of >code-address */
666: return (*b)->start - (*a)->start;
667: }
668: #endif /* !defined(NO_DYNAMIC) */
669:
670: static char superend[]={
671: #include "prim_superend.i"
672: };
673:
674: Cell npriminfos=0;
675:
676: int compare_labels(const void *pa, const void *pb)
677: {
678: Label a = *(Label *)pa;
679: Label b = *(Label *)pb;
680: return a-b;
681: }
682:
683: Label bsearch_next(Label key, Label *a, UCell n)
684: /* a is sorted; return the label >=key that is the closest in a;
685: return NULL if there is no label in a >=key */
686: {
687: int mid = (n-1)/2;
688: if (n<1)
689: return NULL;
690: if (n == 1) {
691: if (a[0] < key)
692: return NULL;
693: else
694: return a[0];
695: }
696: if (a[mid] < key)
697: return bsearch_next(key, a+mid+1, n-mid-1);
698: else
699: return bsearch_next(key, a, mid+1);
700: }
701:
702: void check_prims(Label symbols1[])
703: {
704: int i;
705: #ifndef NO_DYNAMIC
706: Label *symbols2, *symbols3, *ends1, *ends1j, *ends1jsorted;
707: int nends1j;
708: #endif
709:
710: if (debug)
711: #ifdef __VERSION__
712: fprintf(stderr, "Compiled with gcc-" __VERSION__ "\n");
713: #else
714: #define xstr(s) str(s)
715: #define str(s) #s
716: fprintf(stderr, "Compiled with gcc-" xstr(__GNUC__) "." xstr(__GNUC_MINOR__) "\n");
717: #endif
718: for (i=0; symbols1[i]!=0; i++)
719: ;
720: npriminfos = i;
721:
722: #ifndef NO_DYNAMIC
723: if (no_dynamic)
724: return;
725: symbols2=engine2(0,0,0,0,0);
726: #if NO_IP
727: symbols3=engine3(0,0,0,0,0);
728: #else
729: symbols3=symbols1;
730: #endif
731: ends1 = symbols1+i+1;
732: ends1j = ends1+i;
733: nends1j = i+1;
734: ends1jsorted = (Label *)alloca(nends1j*sizeof(Label));
735: memcpy(ends1jsorted,ends1j,nends1j*sizeof(Label));
736: qsort(ends1jsorted, nends1j, sizeof(Label), compare_labels);
737:
738: priminfos = calloc(i,sizeof(PrimInfo));
739: for (i=0; symbols1[i]!=0; i++) {
740: int prim_len = ends1[i]-symbols1[i];
741: PrimInfo *pi=&priminfos[i];
742: int j=0;
743: char *s1 = (char *)symbols1[i];
744: char *s2 = (char *)symbols2[i];
745: char *s3 = (char *)symbols3[i];
746: Label endlabel = bsearch_next(symbols1[i]+1,ends1jsorted,nends1j);
747:
748: pi->start = s1;
749: pi->superend = superend[i]|no_super;
750: if (pi->superend)
751: pi->length = endlabel-symbols1[i];
752: else
753: pi->length = prim_len;
754: pi->restlength = endlabel - symbols1[i] - pi->length;
755: pi->nimmargs = 0;
756: if (debug)
757: fprintf(stderr, "Prim %3d @ %p %p %p, length=%3ld restlength=%2ld superend=%1d",
758: i, s1, s2, s3, (long)(pi->length), (long)(pi->restlength), pi->superend);
759: if (endlabel == NULL) {
760: pi->start = NULL; /* not relocatable */
761: if (pi->length<0) pi->length=100;
762: if (debug)
763: fprintf(stderr,"\n non_reloc: no J label > start found\n");
764: continue;
765: }
766: if (ends1[i] > endlabel && !pi->superend) {
767: pi->start = NULL; /* not relocatable */
768: pi->length = endlabel-symbols1[i];
769: if (debug)
770: fprintf(stderr,"\n non_reloc: there is a J label before the K label (restlength<0)\n");
771: continue;
772: }
773: if (ends1[i] < pi->start && !pi->superend) {
774: pi->start = NULL; /* not relocatable */
775: pi->length = endlabel-symbols1[i];
776: if (debug)
777: fprintf(stderr,"\n non_reloc: K label before I label (length<0)\n");
778: continue;
779: }
780: assert(prim_len>=0);
781: assert(pi->restlength >=0);
782: while (j<(pi->length+pi->restlength)) {
783: if (s1[j]==s3[j]) {
784: if (s1[j] != s2[j]) {
785: pi->start = NULL; /* not relocatable */
786: if (debug)
787: fprintf(stderr,"\n non_reloc: engine1!=engine2 offset %3d",j);
788: /* assert(j<prim_len); */
789: break;
790: }
791: j++;
792: } else {
793: struct immarg *ia=&pi->immargs[pi->nimmargs];
794:
795: pi->nimmargs++;
796: ia->offset=j;
797: if ((~*(Cell *)&(s1[j]))==*(Cell *)&(s3[j])) {
798: ia->rel=0;
799: if (debug)
800: fprintf(stderr,"\n absolute immarg: offset %3d",j);
801: } else if ((&(s1[j]))+(*(Cell *)&(s1[j]))+4 ==
802: symbols1[DOESJUMP+1]) {
803: ia->rel=1;
804: if (debug)
805: fprintf(stderr,"\n relative immarg: offset %3d",j);
806: } else {
807: pi->start = NULL; /* not relocatable */
808: if (debug)
809: fprintf(stderr,"\n non_reloc: engine1!=engine3 offset %3d",j);
810: /* assert(j<prim_len);*/
811: break;
812: }
813: j+=4;
814: }
815: }
816: if (debug)
817: fprintf(stderr,"\n");
818: }
819: decomp_prims = calloc(i,sizeof(PrimInfo *));
820: for (i=DOESJUMP+1; i<npriminfos; i++)
821: decomp_prims[i] = &(priminfos[i]);
822: qsort(decomp_prims+DOESJUMP+1, npriminfos-DOESJUMP-1, sizeof(PrimInfo *),
823: compare_priminfo_length);
824: #endif
825: }
826:
827: void flush_to_here(void)
828: {
829: #ifndef NO_DYNAMIC
830: if (start_flush)
831: FLUSH_ICACHE(start_flush, code_here-start_flush);
832: start_flush=code_here;
833: #endif
834: }
835:
836: #ifndef NO_DYNAMIC
837: void append_jump(void)
838: {
839: if (last_jump) {
840: PrimInfo *pi = &priminfos[last_jump];
841:
842: memcpy(code_here, pi->start+pi->length, pi->restlength);
843: code_here += pi->restlength;
844: last_jump=0;
845: }
846: }
847:
848: /* Gforth remembers all code blocks in this list. On forgetting (by
849: executing a marker) the code blocks are not freed (because Gforth does
850: not remember how they were allocated; hmm, remembering that might be
851: easier and cleaner). Instead, code_here etc. are reset to the old
852: value, and the "forgotten" code blocks are reused when they are
853: needed. */
854:
855: struct code_block_list {
856: struct code_block_list *next;
857: Address block;
858: Cell size;
859: } *code_block_list=NULL, **next_code_blockp=&code_block_list;
860:
861: Address append_prim(Cell p)
862: {
863: PrimInfo *pi = &priminfos[p];
864: Address old_code_here = code_here;
865:
866: if (code_area+code_area_size < code_here+pi->length+pi->restlength) {
867: struct code_block_list *p;
868: append_jump();
869: flush_to_here();
870: if (*next_code_blockp == NULL) {
871: code_here = start_flush = code_area = my_alloc(code_area_size);
872: p = (struct code_block_list *)malloc(sizeof(struct code_block_list));
873: *next_code_blockp = p;
874: p->next = NULL;
875: p->block = code_here;
876: p->size = code_area_size;
877: } else {
878: p = *next_code_blockp;
879: code_here = start_flush = code_area = p->block;
880: }
881: old_code_here = code_here;
882: next_code_blockp = &(p->next);
883: }
884: memcpy(code_here, pi->start, pi->length);
885: code_here += pi->length;
886: return old_code_here;
887: }
888: #endif
889:
890: int forget_dyncode(Address code)
891: {
892: #ifdef NO_DYNAMIC
893: return -1;
894: #else
895: struct code_block_list *p, **pp;
896:
897: for (pp=&code_block_list, p=*pp; p!=NULL; pp=&(p->next), p=*pp) {
898: if (code >= p->block && code < p->block+p->size) {
899: next_code_blockp = &(p->next);
900: code_here = start_flush = code;
901: code_area = p->block;
902: last_jump = 0;
903: return -1;
904: }
905: }
906: return -no_dynamic;
907: #endif /* !defined(NO_DYNAMIC) */
908: }
909:
910: long dyncodesize(void)
911: {
912: #ifndef NO_DYNAMIC
913: struct code_block_list *p;
914: long size=0;
915: for (p=code_block_list; p!=NULL; p=p->next) {
916: if (code_here >= p->block && code_here < p->block+p->size)
917: return size + (code_here - p->block);
918: else
919: size += p->size;
920: }
921: #endif /* !defined(NO_DYNAMIC) */
922: return 0;
923: }
924:
925: Label decompile_code(Label _code)
926: {
927: #ifdef NO_DYNAMIC
928: return _code;
929: #else /* !defined(NO_DYNAMIC) */
930: Cell i;
931: struct code_block_list *p;
932: Address code=_code;
933:
934: /* first, check if we are in code at all */
935: for (p = code_block_list;; p = p->next) {
936: if (p == NULL)
937: return code;
938: if (code >= p->block && code < p->block+p->size)
939: break;
940: }
941: /* reverse order because NOOP might match other prims */
942: for (i=npriminfos-1; i>DOESJUMP; i--) {
943: PrimInfo *pi=decomp_prims[i];
944: if (pi->start==code || (pi->start && memcmp(code,pi->start,pi->length)==0))
945: return vm_prims[super2[super_costs[pi-priminfos].offset]];
946: /* return pi->start;*/
947: }
948: return code;
949: #endif /* !defined(NO_DYNAMIC) */
950: }
951:
952: #ifdef NO_IP
953: int nbranchinfos=0;
954:
955: struct branchinfo {
956: Label *targetptr; /* *(bi->targetptr) is the target */
957: Cell *addressptr; /* store the target here */
958: } branchinfos[100000];
959:
960: int ndoesexecinfos=0;
961: struct doesexecinfo {
962: int branchinfo; /* fix the targetptr of branchinfos[...->branchinfo] */
963: Cell *xt; /* cfa of word whose does-code needs calling */
964: } doesexecinfos[10000];
965:
966: void set_rel_target(Cell *source, Label target)
967: {
968: *source = ((Cell)target)-(((Cell)source)+4);
969: }
970:
971: void register_branchinfo(Label source, Cell targetptr)
972: {
973: struct branchinfo *bi = &(branchinfos[nbranchinfos]);
974: bi->targetptr = (Label *)targetptr;
975: bi->addressptr = (Cell *)source;
976: nbranchinfos++;
977: }
978:
979: Cell *compile_prim1arg(Cell p)
980: {
981: int l = priminfos[p].length;
982: Address old_code_here=code_here;
983:
984: assert(vm_prims[p]==priminfos[p].start);
985: append_prim(p);
986: return (Cell*)(old_code_here+priminfos[p].immargs[0].offset);
987: }
988:
989: Cell *compile_call2(Cell targetptr)
990: {
991: Cell *next_code_target;
992: PrimInfo *pi = &priminfos[N_call2];
993: Address old_code_here = append_prim(N_call2);
994:
995: next_code_target = (Cell *)(old_code_here + pi->immargs[0].offset);
996: register_branchinfo(old_code_here + pi->immargs[1].offset, targetptr);
997: return next_code_target;
998: }
999: #endif
1000:
1001: void finish_code(void)
1002: {
1003: #ifdef NO_IP
1004: Cell i;
1005:
1006: compile_prim1(NULL);
1007: for (i=0; i<ndoesexecinfos; i++) {
1008: struct doesexecinfo *dei = &doesexecinfos[i];
1009: branchinfos[dei->branchinfo].targetptr = DOES_CODE1((dei->xt));
1010: }
1011: ndoesexecinfos = 0;
1012: for (i=0; i<nbranchinfos; i++) {
1013: struct branchinfo *bi=&branchinfos[i];
1014: set_rel_target(bi->addressptr, *(bi->targetptr));
1015: }
1016: nbranchinfos = 0;
1017: #endif
1018: flush_to_here();
1019: }
1020:
1021: #if 0
1022: /* compile *start into a dynamic superinstruction, updating *start */
1023: void compile_prim_dyn(Cell *start)
1024: {
1025: #if defined(NO_IP)
1026: static Cell *last_start=NULL;
1027: static Xt last_prim=NULL;
1028: /* delay work by one call in order to get relocated immargs */
1029:
1030: if (last_start) {
1031: unsigned i = last_prim-vm_prims;
1032: PrimInfo *pi=&priminfos[i];
1033: Cell *next_code_target=NULL;
1034:
1035: assert(i<npriminfos);
1036: if (i==N_execute||i==N_perform||i==N_lit_perform) {
1037: next_code_target = compile_prim1arg(N_set_next_code);
1038: }
1039: if (i==N_call) {
1040: next_code_target = compile_call2(last_start[1]);
1041: } else if (i==N_does_exec) {
1042: struct doesexecinfo *dei = &doesexecinfos[ndoesexecinfos++];
1043: *compile_prim1arg(N_lit) = (Cell)PFA(last_start[1]);
1044: /* we cannot determine the callee now (last_start[1] may be a
1045: forward reference), so just register an arbitrary target, and
1046: register in dei that we need to fix this before resolving
1047: branches */
1048: dei->branchinfo = nbranchinfos;
1049: dei->xt = (Cell *)(last_start[1]);
1050: next_code_target = compile_call2(NULL);
1051: } else if (pi->start == NULL) { /* non-reloc */
1052: next_code_target = compile_prim1arg(N_set_next_code);
1053: set_rel_target(compile_prim1arg(N_abranch),*(Xt)last_prim);
1054: } else {
1055: unsigned j;
1056: Address old_code_here = append_prim(i);
1057:
1058: for (j=0; j<pi->nimmargs; j++) {
1059: struct immarg *ia = &(pi->immargs[j]);
1060: Cell argval = last_start[pi->nimmargs - j]; /* !! specific to prims */
1061: if (ia->rel) { /* !! assumption: relative refs are branches */
1062: register_branchinfo(old_code_here + ia->offset, argval);
1063: } else /* plain argument */
1064: *(Cell *)(old_code_here + ia->offset) = argval;
1065: }
1066: }
1067: if (next_code_target!=NULL)
1068: *next_code_target = (Cell)code_here;
1069: }
1070: if (start) {
1071: last_prim = (Xt)*start;
1072: *start = (Cell)code_here;
1073: }
1074: last_start = start;
1075: return;
1076: #elif !defined(NO_DYNAMIC)
1077: Label prim=(Label)*start;
1078: unsigned i;
1079: Address old_code_here;
1080:
1081: i = ((Xt)prim)-vm_prims;
1082: prim = *(Xt)prim;
1083: if (no_dynamic) {
1084: *start = (Cell)prim;
1085: return;
1086: }
1087: if (i>=npriminfos || priminfos[i].start == 0) { /* not a relocatable prim */
1088: append_jump();
1089: *start = (Cell)prim;
1090: return;
1091: }
1092: assert(priminfos[i].start = prim);
1093: #ifdef ALIGN_CODE
1094: /* ALIGN_CODE;*/
1095: #endif
1096: assert(prim==priminfos[i].start);
1097: old_code_here = append_prim(i);
1098: last_jump = (priminfos[i].superend) ? 0 : i;
1099: *start = (Cell)old_code_here;
1100: return;
1101: #else /* !defined(DOUBLY_INDIRECT), no code replication */
1102: Label prim=(Label)*start;
1103: #if !defined(INDIRECT_THREADED)
1104: prim = *(Xt)prim;
1105: #endif
1106: *start = (Cell)prim;
1107: return;
1108: #endif /* !defined(DOUBLY_INDIRECT) */
1109: }
1110: #endif /* 0 */
1111:
1112: Cell compile_prim_dyn(unsigned p)
1113: {
1114: Cell static_prim = (Cell)vm_prims[p];
1115: #if defined(NO_DYNAMIC)
1116: return static_prim;
1117: #else /* !defined(NO_DYNAMIC) */
1118: Address old_code_here;
1119:
1120: if (no_dynamic)
1121: return static_prim;
1122: if (p>=npriminfos || priminfos[p].start == 0) { /* not a relocatable prim */
1123: append_jump();
1124: return static_prim;
1125: }
1126: old_code_here = append_prim(p);
1127: last_jump = (priminfos[p].superend) ? 0 : p;
1128: return (Cell)old_code_here;
1129: #endif /* !defined(NO_DYNAMIC) */
1130: }
1131:
1132: #ifndef NO_DYNAMIC
1133: int cost_codesize(int prim)
1134: {
1135: return priminfos[prim].length;
1136: }
1137: #endif
1138:
1139: int cost_ls(int prim)
1140: {
1141: struct cost *c = super_costs+prim;
1142:
1143: return c->loads + c->stores;
1144: }
1145:
1146: int cost_lsu(int prim)
1147: {
1148: struct cost *c = super_costs+prim;
1149:
1150: return c->loads + c->stores + c->updates;
1151: }
1152:
1153: int cost_nexts(int prim)
1154: {
1155: return 1;
1156: }
1157:
1158: typedef int Costfunc(int);
1159: Costfunc *ss_cost = /* cost function for optimize_bb */
1160: #ifdef NO_DYNAMIC
1161: cost_lsu;
1162: #else
1163: cost_codesize;
1164: #endif
1165:
1166: struct {
1167: Costfunc *costfunc;
1168: char *metricname;
1169: long sum;
1170: } cost_sums[] = {
1171: #ifndef NO_DYNAMIC
1172: { cost_codesize, "codesize", 0 },
1173: #endif
1174: { cost_ls, "ls", 0 },
1175: { cost_lsu, "lsu", 0 },
1176: { cost_nexts, "nexts", 0 }
1177: };
1178:
1179: #define MAX_BB 128 /* maximum number of instructions in BB */
1180:
1181: /* use dynamic programming to find the shortest paths within the basic
1182: block origs[0..ninsts-1]; optimals[i] contains the superinstruction
1183: on the shortest path to the end of the BB */
1184: void optimize_bb(PrimNum origs[], PrimNum optimals[], int ninsts)
1185: {
1186: int i,j, mincost;
1187: static int costs[MAX_BB+1];
1188:
1189: assert(ninsts<MAX_BB);
1190: costs[ninsts]=0;
1191: for (i=ninsts-1; i>=0; i--) {
1192: optimals[i] = origs[i];
1193: costs[i] = mincost = costs[i+1] + ss_cost(optimals[i]);
1194: for (j=2; j<=max_super && i+j<=ninsts ; j++) {
1195: int super, jcost;
1196:
1197: super = lookup_super(origs+i,j);
1198: if (super >= 0) {
1199: jcost = costs[i+j] + ss_cost(super);
1200: if (jcost <= mincost) {
1201: optimals[i] = super;
1202: mincost = jcost;
1203: if (!ss_greedy)
1204: costs[i] = jcost;
1205: }
1206: }
1207: }
1208: }
1209: }
1210:
1211: /* rewrite the instructions pointed to by instps to use the
1212: superinstructions in optimals */
1213: void rewrite_bb(Cell *instps[], PrimNum *optimals, int ninsts)
1214: {
1215: int i,j, nextdyn;
1216: Cell inst;
1217:
1218: for (i=0, nextdyn=0; i<ninsts; i++) {
1219: if (i==nextdyn) { /* compile dynamically */
1220: nextdyn += super_costs[optimals[i]].length;
1221: inst = compile_prim_dyn(optimals[i]);
1222: for (j=0; j<sizeof(cost_sums)/sizeof(cost_sums[0]); j++)
1223: cost_sums[j].sum += cost_sums[j].costfunc(optimals[i]);
1224: } else { /* compile statically */
1225: inst = (Cell)vm_prims[optimals[i]];
1226: }
1227: *(instps[i]) = inst;
1228: }
1229: }
1230:
1231: /* compile *start, possibly rewriting it into a static and/or dynamic
1232: superinstruction */
1233: void compile_prim1(Cell *start)
1234: {
1235: #if defined(DOUBLY_INDIRECT)
1236: Label prim=(Label)*start;
1237: if (prim<((Label)(xts+DOESJUMP)) || prim>((Label)(xts+npriminfos))) {
1238: fprintf(stderr,"compile_prim encountered xt %p\n", prim);
1239: *start=(Cell)prim;
1240: return;
1241: } else {
1242: *start = (Cell)(prim-((Label)xts)+((Label)vm_prims));
1243: return;
1244: }
1245: #elif defined(INDIRECT_THREADED)
1246: return;
1247: #else /* !(defined(DOUBLY_INDIRECT) || defined(INDIRECT_THREADED)) */
1248: static Cell *instps[MAX_BB];
1249: static PrimNum origs[MAX_BB];
1250: static PrimNum optimals[MAX_BB];
1251: static int ninsts=0;
1252: PrimNum prim_num;
1253:
1254: if (start==NULL)
1255: goto end_bb;
1256: prim_num = ((Xt)*start)-vm_prims;
1257: if (prim_num >= npriminfos)
1258: goto end_bb;
1259: assert(ninsts<MAX_BB);
1260: instps[ninsts] = start;
1261: origs[ninsts] = prim_num;
1262: ninsts++;
1263: if (ninsts >= MAX_BB || superend[prim_num]) {
1264: end_bb:
1265: optimize_bb(origs,optimals,ninsts);
1266: rewrite_bb(instps,optimals,ninsts);
1267: ninsts=0;
1268: }
1269: #endif /* !(defined(DOUBLY_INDIRECT) || defined(INDIRECT_THREADED)) */
1270: }
1271:
1272: Address loader(FILE *imagefile, char* filename)
1273: /* returns the address of the image proper (after the preamble) */
1274: {
1275: ImageHeader header;
1276: Address image;
1277: Address imp; /* image+preamble */
1278: Char magic[8];
1279: char magic7; /* size byte of magic number */
1280: Cell preamblesize=0;
1281: Cell data_offset = offset_image ? 56*sizeof(Cell) : 0;
1282: UCell check_sum;
1283: Cell ausize = ((RELINFOBITS == 8) ? 0 :
1284: (RELINFOBITS == 16) ? 1 :
1285: (RELINFOBITS == 32) ? 2 : 3);
1286: Cell charsize = ((sizeof(Char) == 1) ? 0 :
1287: (sizeof(Char) == 2) ? 1 :
1288: (sizeof(Char) == 4) ? 2 : 3) + ausize;
1289: Cell cellsize = ((sizeof(Cell) == 1) ? 0 :
1290: (sizeof(Cell) == 2) ? 1 :
1291: (sizeof(Cell) == 4) ? 2 : 3) + ausize;
1292: Cell sizebyte = (ausize << 5) + (charsize << 3) + (cellsize << 1) +
1293: #ifdef WORDS_BIGENDIAN
1294: 0
1295: #else
1296: 1
1297: #endif
1298: ;
1299:
1300: vm_prims = engine(0,0,0,0,0);
1301: check_prims(vm_prims);
1302: prepare_super_table();
1303: #ifndef DOUBLY_INDIRECT
1304: #ifdef PRINT_SUPER_LENGTHS
1305: print_super_lengths();
1306: #endif
1307: check_sum = checksum(vm_prims);
1308: #else /* defined(DOUBLY_INDIRECT) */
1309: check_sum = (UCell)vm_prims;
1310: #endif /* defined(DOUBLY_INDIRECT) */
1311:
1312: do {
1313: if(fread(magic,sizeof(Char),8,imagefile) < 8) {
1314: fprintf(stderr,"%s: image %s doesn't seem to be a Gforth (>=0.6) image.\n",
1315: progname, filename);
1316: exit(1);
1317: }
1318: preamblesize+=8;
1319: } while(memcmp(magic,"Gforth3",7));
1320: magic7 = magic[7];
1321: if (debug) {
1322: magic[7]='\0';
1323: fprintf(stderr,"Magic found: %s ", magic);
1324: print_sizes(magic7);
1325: }
1326:
1327: if (magic7 != sizebyte)
1328: {
1329: fprintf(stderr,"This image is: ");
1330: print_sizes(magic7);
1331: fprintf(stderr,"whereas the machine is ");
1332: print_sizes(sizebyte);
1333: exit(-2);
1334: };
1335:
1336: fread((void *)&header,sizeof(ImageHeader),1,imagefile);
1337:
1338: set_stack_sizes(&header);
1339:
1340: #if HAVE_GETPAGESIZE
1341: pagesize=getpagesize(); /* Linux/GNU libc offers this */
1342: #elif HAVE_SYSCONF && defined(_SC_PAGESIZE)
1343: pagesize=sysconf(_SC_PAGESIZE); /* POSIX.4 */
1344: #elif PAGESIZE
1345: pagesize=PAGESIZE; /* in limits.h according to Gallmeister's POSIX.4 book */
1346: #endif
1347: if (debug)
1348: fprintf(stderr,"pagesize=%ld\n",(unsigned long) pagesize);
1349:
1350: image = dict_alloc_read(imagefile, preamblesize+header.image_size,
1351: preamblesize+dictsize, data_offset);
1352: imp=image+preamblesize;
1353: alloc_stacks((ImageHeader *)imp);
1354: if (clear_dictionary)
1355: memset(imp+header.image_size, 0, dictsize-header.image_size);
1356: if(header.base==0 || header.base == (Address)0x100) {
1357: Cell reloc_size=((header.image_size-1)/sizeof(Cell))/8+1;
1358: char reloc_bits[reloc_size];
1359: fseek(imagefile, preamblesize+header.image_size, SEEK_SET);
1360: fread(reloc_bits, 1, reloc_size, imagefile);
1361: relocate((Cell *)imp, reloc_bits, header.image_size, (Cell)header.base, vm_prims);
1362: #if 0
1363: { /* let's see what the relocator did */
1364: FILE *snapshot=fopen("snapshot.fi","wb");
1365: fwrite(image,1,imagesize,snapshot);
1366: fclose(snapshot);
1367: }
1368: #endif
1369: }
1370: else if(header.base!=imp) {
1371: fprintf(stderr,"%s: Cannot load nonrelocatable image (compiled for address $%lx) at address $%lx\n",
1372: progname, (unsigned long)header.base, (unsigned long)imp);
1373: exit(1);
1374: }
1375: if (header.checksum==0)
1376: ((ImageHeader *)imp)->checksum=check_sum;
1377: else if (header.checksum != check_sum) {
1378: fprintf(stderr,"%s: Checksum of image ($%lx) does not match the executable ($%lx)\n",
1379: progname, (unsigned long)(header.checksum),(unsigned long)check_sum);
1380: exit(1);
1381: }
1382: #ifdef DOUBLY_INDIRECT
1383: ((ImageHeader *)imp)->xt_base = xts;
1384: #endif
1385: fclose(imagefile);
1386:
1387: /* unnecessary, except maybe for CODE words */
1388: /* FLUSH_ICACHE(imp, header.image_size);*/
1389:
1390: return imp;
1391: }
1392:
1393: /* pointer to last '/' or '\' in file, 0 if there is none. */
1394: char *onlypath(char *filename)
1395: {
1396: return strrchr(filename, DIRSEP);
1397: }
1398:
1399: FILE *openimage(char *fullfilename)
1400: {
1401: FILE *image_file;
1402: char * expfilename = tilde_cstr(fullfilename, strlen(fullfilename), 1);
1403:
1404: image_file=fopen(expfilename,"rb");
1405: if (image_file!=NULL && debug)
1406: fprintf(stderr, "Opened image file: %s\n", expfilename);
1407: return image_file;
1408: }
1409:
1410: /* try to open image file concat(path[0:len],imagename) */
1411: FILE *checkimage(char *path, int len, char *imagename)
1412: {
1413: int dirlen=len;
1414: char fullfilename[dirlen+strlen(imagename)+2];
1415:
1416: memcpy(fullfilename, path, dirlen);
1417: if (fullfilename[dirlen-1]!=DIRSEP)
1418: fullfilename[dirlen++]=DIRSEP;
1419: strcpy(fullfilename+dirlen,imagename);
1420: return openimage(fullfilename);
1421: }
1422:
1423: FILE * open_image_file(char * imagename, char * path)
1424: {
1425: FILE * image_file=NULL;
1426: char *origpath=path;
1427:
1428: if(strchr(imagename, DIRSEP)==NULL) {
1429: /* first check the directory where the exe file is in !! 01may97jaw */
1430: if (onlypath(progname))
1431: image_file=checkimage(progname, onlypath(progname)-progname, imagename);
1432: if (!image_file)
1433: do {
1434: char *pend=strchr(path, PATHSEP);
1435: if (pend==NULL)
1436: pend=path+strlen(path);
1437: if (strlen(path)==0) break;
1438: image_file=checkimage(path, pend-path, imagename);
1439: path=pend+(*pend==PATHSEP);
1440: } while (image_file==NULL);
1441: } else {
1442: image_file=openimage(imagename);
1443: }
1444:
1445: if (!image_file) {
1446: fprintf(stderr,"%s: cannot open image file %s in path %s for reading\n",
1447: progname, imagename, origpath);
1448: exit(1);
1449: }
1450:
1451: return image_file;
1452: }
1453: #endif
1454:
1455: #ifdef HAS_OS
1456: UCell convsize(char *s, UCell elemsize)
1457: /* converts s of the format [0-9]+[bekMGT]? (e.g. 25k) into the number
1458: of bytes. the letter at the end indicates the unit, where e stands
1459: for the element size. default is e */
1460: {
1461: char *endp;
1462: UCell n,m;
1463:
1464: m = elemsize;
1465: n = strtoul(s,&endp,0);
1466: if (endp!=NULL) {
1467: if (strcmp(endp,"b")==0)
1468: m=1;
1469: else if (strcmp(endp,"k")==0)
1470: m=1024;
1471: else if (strcmp(endp,"M")==0)
1472: m=1024*1024;
1473: else if (strcmp(endp,"G")==0)
1474: m=1024*1024*1024;
1475: else if (strcmp(endp,"T")==0) {
1476: #if (SIZEOF_CHAR_P > 4)
1477: m=1024L*1024*1024*1024;
1478: #else
1479: fprintf(stderr,"%s: size specification \"%s\" too large for this machine\n", progname, endp);
1480: exit(1);
1481: #endif
1482: } else if (strcmp(endp,"e")!=0 && strcmp(endp,"")!=0) {
1483: fprintf(stderr,"%s: cannot grok size specification %s: invalid unit \"%s\"\n", progname, s, endp);
1484: exit(1);
1485: }
1486: }
1487: return n*m;
1488: }
1489:
1490: enum {
1491: ss_number = 256,
1492: ss_min_codesize,
1493: ss_min_ls,
1494: ss_min_lsu,
1495: ss_min_nexts,
1496: };
1497:
1498: void gforth_args(int argc, char ** argv, char ** path, char ** imagename)
1499: {
1500: int c;
1501:
1502: opterr=0;
1503: while (1) {
1504: int option_index=0;
1505: static struct option opts[] = {
1506: {"appl-image", required_argument, NULL, 'a'},
1507: {"image-file", required_argument, NULL, 'i'},
1508: {"dictionary-size", required_argument, NULL, 'm'},
1509: {"data-stack-size", required_argument, NULL, 'd'},
1510: {"return-stack-size", required_argument, NULL, 'r'},
1511: {"fp-stack-size", required_argument, NULL, 'f'},
1512: {"locals-stack-size", required_argument, NULL, 'l'},
1513: {"path", required_argument, NULL, 'p'},
1514: {"version", no_argument, NULL, 'v'},
1515: {"help", no_argument, NULL, 'h'},
1516: /* put something != 0 into offset_image */
1517: {"offset-image", no_argument, &offset_image, 1},
1518: {"no-offset-im", no_argument, &offset_image, 0},
1519: {"clear-dictionary", no_argument, &clear_dictionary, 1},
1520: {"die-on-signal", no_argument, &die_on_signal, 1},
1521: {"debug", no_argument, &debug, 1},
1522: {"no-super", no_argument, &no_super, 1},
1523: {"no-dynamic", no_argument, &no_dynamic, 1},
1524: {"dynamic", no_argument, &no_dynamic, 0},
1525: {"print-metrics", no_argument, &print_metrics, 1},
1526: {"ss-number", required_argument, NULL, ss_number},
1527: #ifndef NO_DYNAMIC
1528: {"ss-min-codesize", no_argument, NULL, ss_min_codesize},
1529: #endif
1530: {"ss-min-ls", no_argument, NULL, ss_min_ls},
1531: {"ss-min-lsu", no_argument, NULL, ss_min_lsu},
1532: {"ss-min-nexts", no_argument, NULL, ss_min_nexts},
1533: {"ss-greedy", no_argument, &ss_greedy, 1},
1534: {0,0,0,0}
1535: /* no-init-file, no-rc? */
1536: };
1537:
1538: c = getopt_long(argc, argv, "+i:m:d:r:f:l:p:vhoncsx", opts, &option_index);
1539:
1540: switch (c) {
1541: case EOF: return;
1542: case '?': optind--; return;
1543: case 'a': *imagename = optarg; return;
1544: case 'i': *imagename = optarg; break;
1545: case 'm': dictsize = convsize(optarg,sizeof(Cell)); break;
1546: case 'd': dsize = convsize(optarg,sizeof(Cell)); break;
1547: case 'r': rsize = convsize(optarg,sizeof(Cell)); break;
1548: case 'f': fsize = convsize(optarg,sizeof(Float)); break;
1549: case 'l': lsize = convsize(optarg,sizeof(Cell)); break;
1550: case 'p': *path = optarg; break;
1551: case 'o': offset_image = 1; break;
1552: case 'n': offset_image = 0; break;
1553: case 'c': clear_dictionary = 1; break;
1554: case 's': die_on_signal = 1; break;
1555: case 'x': debug = 1; break;
1556: case 'v': fputs(PACKAGE_STRING"\n", stderr); exit(0);
1557: case ss_number: static_super_number = atoi(optarg); break;
1558: #ifndef NO_DYNAMIC
1559: case ss_min_codesize: ss_cost = cost_codesize; break;
1560: #endif
1561: case ss_min_ls: ss_cost = cost_ls; break;
1562: case ss_min_lsu: ss_cost = cost_lsu; break;
1563: case ss_min_nexts: ss_cost = cost_nexts; break;
1564: case 'h':
1565: fprintf(stderr, "Usage: %s [engine options] ['--'] [image arguments]\n\
1566: Engine Options:\n\
1567: --appl-image FILE equivalent to '--image-file=FILE --'\n\
1568: --clear-dictionary Initialize the dictionary with 0 bytes\n\
1569: -d SIZE, --data-stack-size=SIZE Specify data stack size\n\
1570: --debug Print debugging information during startup\n\
1571: --die-on-signal exit instead of CATCHing some signals\n\
1572: --dynamic use dynamic native code\n\
1573: -f SIZE, --fp-stack-size=SIZE Specify floating point stack size\n\
1574: -h, --help Print this message and exit\n\
1575: -i FILE, --image-file=FILE Use image FILE instead of `gforth.fi'\n\
1576: -l SIZE, --locals-stack-size=SIZE Specify locals stack size\n\
1577: -m SIZE, --dictionary-size=SIZE Specify Forth dictionary size\n\
1578: --no-dynamic Use only statically compiled primitives\n\
1579: --no-offset-im Load image at normal position\n\
1580: --no-super No dynamically formed superinstructions\n\
1581: --offset-image Load image at a different position\n\
1582: -p PATH, --path=PATH Search path for finding image and sources\n\
1583: --print-metrics Print some code generation metrics on exit\n\
1584: -r SIZE, --return-stack-size=SIZE Specify return stack size\n\
1585: --ss-greedy greedy, not optimal superinst selection\n\
1586: --ss-min-codesize select superinsts for smallest native code\n\
1587: --ss-min-ls minimize loads and stores\n\
1588: --ss-min-lsu minimize loads, stores, and pointer updates\n\
1589: --ss-min-nexts minimize the number of static superinsts\n\
1590: --ss-number=N use N static superinsts (default max)\n\
1591: -v, --version Print engine version and exit\n\
1592: SIZE arguments consist of an integer followed by a unit. The unit can be\n\
1593: `b' (byte), `e' (element; default), `k' (KB), `M' (MB), `G' (GB) or `T' (TB).\n",
1594: argv[0]);
1595: optind--;
1596: return;
1597: }
1598: }
1599: }
1600: #endif
1601:
1602: #ifdef INCLUDE_IMAGE
1603: extern Cell image[];
1604: extern const char reloc_bits[];
1605: #endif
1606:
1607: int main(int argc, char **argv, char **env)
1608: {
1609: #ifdef HAS_OS
1610: char *path = getenv("GFORTHPATH") ? : DEFAULTPATH;
1611: #else
1612: char *path = DEFAULTPATH;
1613: #endif
1614: #ifndef INCLUDE_IMAGE
1615: char *imagename="gforth.fi";
1616: FILE *image_file;
1617: Address image;
1618: #endif
1619: int retvalue;
1620:
1621: #if defined(i386) && defined(ALIGNMENT_CHECK)
1622: /* turn on alignment checks on the 486.
1623: * on the 386 this should have no effect. */
1624: __asm__("pushfl; popl %eax; orl $0x40000, %eax; pushl %eax; popfl;");
1625: /* this is unusable with Linux' libc.4.6.27, because this library is
1626: not alignment-clean; we would have to replace some library
1627: functions (e.g., memcpy) to make it work. Also GCC doesn't try to keep
1628: the stack FP-aligned. */
1629: #endif
1630:
1631: /* buffering of the user output device */
1632: #ifdef _IONBF
1633: if (isatty(fileno(stdout))) {
1634: fflush(stdout);
1635: setvbuf(stdout,NULL,_IONBF,0);
1636: }
1637: #endif
1638:
1639: progname = argv[0];
1640:
1641: #ifdef HAS_OS
1642: gforth_args(argc, argv, &path, &imagename);
1643: #ifndef NO_DYNAMIC
1644: if (no_dynamic && ss_cost == cost_codesize) {
1645: ss_cost = cost_nexts;
1646: cost_sums[0] = cost_sums[1]; /* don't use cost_codesize for print-metrics */
1647: if (debug)
1648: fprintf(stderr, "--no-dynamic conflicts with --ss-min-codesize, reverting to --ss-min-nexts\n");
1649: }
1650: #endif /* !defined(NO_DYNAMIC) */
1651: #endif /* defined(HAS_OS) */
1652:
1653: #ifdef INCLUDE_IMAGE
1654: set_stack_sizes((ImageHeader *)image);
1655: if(((ImageHeader *)image)->base != image)
1656: relocate(image, reloc_bits, ((ImageHeader *)image)->image_size,
1657: (Label*)engine(0, 0, 0, 0, 0));
1658: alloc_stacks((ImageHeader *)image);
1659: #else
1660: image_file = open_image_file(imagename, path);
1661: image = loader(image_file, imagename);
1662: #endif
1663: gforth_header=(ImageHeader *)image; /* used in SIGSEGV handler */
1664:
1665: {
1666: char path2[strlen(path)+1];
1667: char *p1, *p2;
1668: Cell environ[]= {
1669: (Cell)argc-(optind-1),
1670: (Cell)(argv+(optind-1)),
1671: (Cell)strlen(path),
1672: (Cell)path2};
1673: argv[optind-1] = progname;
1674: /*
1675: for (i=0; i<environ[0]; i++)
1676: printf("%s\n", ((char **)(environ[1]))[i]);
1677: */
1678: /* make path OS-independent by replacing path separators with NUL */
1679: for (p1=path, p2=path2; *p1!='\0'; p1++, p2++)
1680: if (*p1==PATHSEP)
1681: *p2 = '\0';
1682: else
1683: *p2 = *p1;
1684: *p2='\0';
1685: retvalue = go_forth(image, 4, environ);
1686: #ifdef SIGPIPE
1687: bsd_signal(SIGPIPE, SIG_IGN);
1688: #endif
1689: #ifdef VM_PROFILING
1690: vm_print_profile(stderr);
1691: #endif
1692: deprep_terminal();
1693: }
1694: if (print_metrics) {
1695: int i;
1696: fprintf(stderr, "code size = %8ld\n", dyncodesize());
1697: for (i=0; i<sizeof(cost_sums)/sizeof(cost_sums[0]); i++)
1698: fprintf(stderr, "metric %8s: %8ld\n",
1699: cost_sums[i].metricname, cost_sums[i].sum);
1700: }
1701: return retvalue;
1702: }
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