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