Annotation of gforth/engine/main.c, revision 1.93
1.1 anton 1: /* command line interpretation, image loading etc. for Gforth
2:
3:
1.39 anton 4: Copyright (C) 1995,1996,1997,1998,2000 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.11 pazsan 38: #ifndef STANDALONE
1.1 anton 39: #if HAVE_SYS_MMAN_H
40: #include <sys/mman.h>
41: #endif
1.11 pazsan 42: #endif
1.1 anton 43: #include "io.h"
44: #include "getopt.h"
1.11 pazsan 45: #ifdef STANDALONE
46: #include <systypes.h>
47: #endif
1.1 anton 48:
1.79 anton 49: /* global variables for engine.c
50: We put them here because engine.c is compiled several times in
51: different ways for the same engine. */
52: Cell *SP;
53: Float *FP;
54: Address UP=NULL;
55:
56: #ifdef GFORTH_DEBUGGING
57: /* define some VM registers as global variables, so they survive exceptions;
58: global register variables are not up to the task (according to the
59: GNU C manual) */
60: Xt *saved_ip;
61: Cell *rp;
62: #endif
63:
64: #ifdef NO_IP
65: Label next_code;
66: #endif
67:
68: #ifdef HAS_FILE
69: char* fileattr[6]={"rb","rb","r+b","r+b","wb","wb"};
70: char* pfileattr[6]={"r","r","r+","r+","w","w"};
71:
72: #ifndef O_BINARY
73: #define O_BINARY 0
74: #endif
75: #ifndef O_TEXT
76: #define O_TEXT 0
77: #endif
78:
79: int ufileattr[6]= {
80: O_RDONLY|O_BINARY, O_RDONLY|O_BINARY,
81: O_RDWR |O_BINARY, O_RDWR |O_BINARY,
82: O_WRONLY|O_BINARY, O_WRONLY|O_BINARY };
83: #endif
84: /* end global vars for engine.c */
85:
1.1 anton 86: #define PRIM_VERSION 1
87: /* increment this whenever the primitives change in an incompatible way */
88:
1.14 pazsan 89: #ifndef DEFAULTPATH
1.39 anton 90: # define DEFAULTPATH "."
1.14 pazsan 91: #endif
92:
1.1 anton 93: #ifdef MSDOS
94: jmp_buf throw_jmp_buf;
95: #endif
96:
1.56 anton 97: #if defined(DOUBLY_INDIRECT)
98: # define CFA(n) ({Cell _n = (n); ((Cell)(((_n & 0x4000) ? symbols : xts)+(_n&~0x4000UL)));})
1.1 anton 99: #else
1.56 anton 100: # define CFA(n) ((Cell)(symbols+((n)&~0x4000UL)))
1.1 anton 101: #endif
102:
103: #define maxaligned(n) (typeof(n))((((Cell)n)+sizeof(Float)-1)&-sizeof(Float))
104:
105: static UCell dictsize=0;
106: static UCell dsize=0;
107: static UCell rsize=0;
108: static UCell fsize=0;
109: static UCell lsize=0;
110: int offset_image=0;
1.4 anton 111: int die_on_signal=0;
1.13 pazsan 112: #ifndef INCLUDE_IMAGE
1.1 anton 113: static int clear_dictionary=0;
1.24 anton 114: UCell pagesize=1;
1.22 pazsan 115: char *progname;
116: #else
117: char *progname = "gforth";
118: int optind = 1;
1.13 pazsan 119: #endif
1.31 pazsan 120:
1.75 anton 121: #define CODE_BLOCK_SIZE (64*1024)
1.48 anton 122: Address code_area=0;
1.73 anton 123: Cell code_area_size = CODE_BLOCK_SIZE;
1.75 anton 124: Address code_here=NULL+CODE_BLOCK_SIZE; /* does for code-area what HERE
125: does for the dictionary */
1.65 anton 126: Address start_flush=0; /* start of unflushed code */
1.74 anton 127: Cell last_jump=0; /* if the last prim was compiled without jump, this
128: is it's number, otherwise this contains 0 */
1.48 anton 129:
1.60 anton 130: static int no_super=0; /* true if compile_prim should not fuse prims */
1.81 anton 131: static int no_dynamic=NO_DYNAMIC_DEFAULT; /* if true, no code is generated
132: dynamically */
1.60 anton 133:
1.30 pazsan 134: #ifdef HAS_DEBUG
1.68 anton 135: int debug=0;
1.31 pazsan 136: #else
137: # define perror(x...)
138: # define fprintf(x...)
1.30 pazsan 139: #endif
1.31 pazsan 140:
1.24 anton 141: ImageHeader *gforth_header;
1.43 anton 142: Label *vm_prims;
1.53 anton 143: #ifdef DOUBLY_INDIRECT
144: Label *xts; /* same content as vm_prims, but should only be used for xts */
145: #endif
1.1 anton 146:
1.30 pazsan 147: #ifdef MEMCMP_AS_SUBROUTINE
148: int gforth_memcmp(const char * s1, const char * s2, size_t n)
149: {
150: return memcmp(s1, s2, n);
151: }
152: #endif
153:
1.1 anton 154: /* image file format:
1.15 pazsan 155: * "#! binary-path -i\n" (e.g., "#! /usr/local/bin/gforth-0.4.0 -i\n")
1.1 anton 156: * padding to a multiple of 8
1.84 anton 157: * magic: "Gforth3x" means format 0.6,
1.15 pazsan 158: * where x is a byte with
159: * bit 7: reserved = 0
160: * bit 6:5: address unit size 2^n octets
161: * bit 4:3: character size 2^n octets
162: * bit 2:1: cell size 2^n octets
163: * bit 0: endian, big=0, little=1.
164: * The magic are always 8 octets, no matter what the native AU/character size is
1.1 anton 165: * padding to max alignment (no padding necessary on current machines)
1.24 anton 166: * ImageHeader structure (see forth.h)
1.1 anton 167: * data (size in ImageHeader.image_size)
168: * tags ((if relocatable, 1 bit/data cell)
169: *
170: * tag==1 means that the corresponding word is an address;
171: * If the word is >=0, the address is within the image;
172: * addresses within the image are given relative to the start of the image.
173: * If the word =-1 (CF_NIL), the address is NIL,
174: * If the word is <CF_NIL and >CF(DODOES), it's a CFA (:, Create, ...)
175: * If the word =CF(DODOES), it's a DOES> CFA
176: * If the word =CF(DOESJUMP), it's a DOES JUMP (2 Cells after DOES>,
177: * possibly containing a jump to dodoes)
1.51 anton 178: * If the word is <CF(DOESJUMP) and bit 14 is set, it's the xt of a primitive
179: * If the word is <CF(DOESJUMP) and bit 14 is clear,
180: * it's the threaded code of a primitive
1.85 pazsan 181: * bits 13..9 of a primitive token state which group the primitive belongs to,
182: * bits 8..0 of a primitive token index into the group
1.1 anton 183: */
184:
1.85 pazsan 185: static Cell groups[32] = {
186: 0,
1.90 anton 187: #undef GROUP
1.85 pazsan 188: #define GROUP(x, n) DOESJUMP+1+n,
1.86 anton 189: #include "prim_grp.i"
1.90 anton 190: #undef GROUP
1.85 pazsan 191: #define GROUP(x, n)
192: };
193:
1.46 jwilke 194: void relocate(Cell *image, const char *bitstring,
1.90 anton 195: int size, Cell base, Label symbols[])
1.1 anton 196: {
1.16 pazsan 197: int i=0, j, k, steps=(size/sizeof(Cell))/RELINFOBITS;
1.11 pazsan 198: Cell token;
1.1 anton 199: char bits;
1.37 anton 200: Cell max_symbols;
1.46 jwilke 201: /*
1.85 pazsan 202: * A virtual start address that's the real start address minus
1.46 jwilke 203: * the one in the image
204: */
1.45 jwilke 205: Cell *start = (Cell * ) (((void *) image) - ((void *) base));
1.1 anton 206:
1.85 pazsan 207: /* group index into table */
1.46 jwilke 208:
209: /* printf("relocating to %x[%x] start=%x base=%x\n", image, size, start, base); */
1.37 anton 210:
211: for (max_symbols=DOESJUMP+1; symbols[max_symbols]!=0; max_symbols++)
212: ;
1.47 anton 213: max_symbols--;
1.35 pazsan 214: size/=sizeof(Cell);
215:
1.31 pazsan 216: for(k=0; k<=steps; k++) {
1.13 pazsan 217: for(j=0, bits=bitstring[k]; j<RELINFOBITS; j++, i++, bits<<=1) {
1.1 anton 218: /* fprintf(stderr,"relocate: image[%d]\n", i);*/
1.35 pazsan 219: if((i < size) && (bits & (1U << (RELINFOBITS-1)))) {
220: /* fprintf(stderr,"relocate: image[%d]=%d of %d\n", i, image[i], size/sizeof(Cell)); */
1.45 jwilke 221: token=image[i];
1.85 pazsan 222: if(token<0) {
223: int group = (-token & 0x3E00) >> 9;
224: if(group == 0) {
225: switch(token|0x4000) {
1.1 anton 226: case CF_NIL : image[i]=0; break;
227: #if !defined(DOUBLY_INDIRECT)
228: case CF(DOCOL) :
229: case CF(DOVAR) :
230: case CF(DOCON) :
231: case CF(DOUSER) :
232: case CF(DODEFER) :
1.11 pazsan 233: case CF(DOFIELD) : MAKE_CF(image+i,symbols[CF(token)]); break;
1.92 anton 234: case CF(DOESJUMP): image[i]=0; break;
1.1 anton 235: #endif /* !defined(DOUBLY_INDIRECT) */
236: case CF(DODOES) :
1.45 jwilke 237: MAKE_DOES_CF(image+i,(Xt *)(image[i+1]+((Cell)start)));
1.1 anton 238: break;
1.85 pazsan 239: default : /* backward compatibility */
1.56 anton 240: /* printf("Code field generation image[%x]:=CFA(%x)\n",
1.1 anton 241: i, CF(image[i])); */
1.55 anton 242: if (CF((token | 0x4000))<max_symbols) {
1.56 anton 243: image[i]=(Cell)CFA(CF(token));
244: #ifdef DIRECT_THREADED
245: if ((token & 0x4000) == 0) /* threade code, no CFA */
1.70 anton 246: compile_prim1(&image[i]);
1.56 anton 247: #endif
1.55 anton 248: } else
1.83 anton 249: fprintf(stderr,"Primitive %d used in this image at $%lx is not implemented by this\n engine (%s); executing this code will crash.\n",CF(token),(long)&image[i],PACKAGE_VERSION);
1.1 anton 250: }
1.85 pazsan 251: } else {
252: int tok = -token & 0x1FF;
253: if (tok < (groups[group+1]-groups[group])) {
254: #if defined(DOUBLY_INDIRECT)
255: image[i]=(Cell)CFA(((groups[group]+tok) | (CF(token) & 0x4000)));
256: #else
257: image[i]=(Cell)CFA((groups[group]+tok));
258: #endif
259: #ifdef DIRECT_THREADED
260: if ((token & 0x4000) == 0) /* threade code, no CFA */
261: compile_prim1(&image[i]);
262: #endif
263: } else
264: fprintf(stderr,"Primitive %x, %d of group %d used in this image at $%lx is not implemented by this\n engine (%s); executing this code will crash.\n", -token, tok, group, (long)&image[i],PACKAGE_VERSION);
265: }
266: } else {
1.45 jwilke 267: // if base is > 0: 0 is a null reference so don't adjust
268: if (token>=base) {
269: image[i]+=(Cell)start;
270: }
1.46 jwilke 271: }
1.1 anton 272: }
273: }
1.31 pazsan 274: }
1.70 anton 275: finish_code();
1.26 jwilke 276: ((ImageHeader*)(image))->base = (Address) image;
1.1 anton 277: }
278:
279: UCell checksum(Label symbols[])
280: {
281: UCell r=PRIM_VERSION;
282: Cell i;
283:
284: for (i=DOCOL; i<=DOESJUMP; i++) {
285: r ^= (UCell)(symbols[i]);
286: r = (r << 5) | (r >> (8*sizeof(Cell)-5));
287: }
288: #ifdef DIRECT_THREADED
289: /* we have to consider all the primitives */
290: for (; symbols[i]!=(Label)0; i++) {
291: r ^= (UCell)(symbols[i]);
292: r = (r << 5) | (r >> (8*sizeof(Cell)-5));
293: }
294: #else
295: /* in indirect threaded code all primitives are accessed through the
296: symbols table, so we just have to put the base address of symbols
297: in the checksum */
298: r ^= (UCell)symbols;
299: #endif
300: return r;
301: }
302:
1.3 anton 303: Address verbose_malloc(Cell size)
304: {
305: Address r;
306: /* leave a little room (64B) for stack underflows */
307: if ((r = malloc(size+64))==NULL) {
308: perror(progname);
309: exit(1);
310: }
311: r = (Address)((((Cell)r)+(sizeof(Float)-1))&(-sizeof(Float)));
312: if (debug)
313: fprintf(stderr, "malloc succeeds, address=$%lx\n", (long)r);
314: return r;
315: }
316:
1.33 anton 317: static Address next_address=0;
318: void after_alloc(Address r, Cell size)
319: {
320: if (r != (Address)-1) {
321: if (debug)
322: fprintf(stderr, "success, address=$%lx\n", (long) r);
323: if (pagesize != 1)
324: next_address = (Address)(((((Cell)r)+size-1)&-pagesize)+2*pagesize); /* leave one page unmapped */
325: } else {
326: if (debug)
327: fprintf(stderr, "failed: %s\n", strerror(errno));
328: }
329: }
330:
1.34 anton 331: #ifndef MAP_FAILED
332: #define MAP_FAILED ((Address) -1)
333: #endif
334: #ifndef MAP_FILE
335: # define MAP_FILE 0
336: #endif
337: #ifndef MAP_PRIVATE
338: # define MAP_PRIVATE 0
339: #endif
1.91 anton 340: #if !defined(MAP_ANON) && defined(MAP_ANONYMOUS)
341: # define MAP_ANON MAP_ANONYMOUS
342: #endif
1.34 anton 343:
344: #if defined(HAVE_MMAP)
345: static Address alloc_mmap(Cell size)
1.1 anton 346: {
347: Address r;
348:
349: #if defined(MAP_ANON)
350: if (debug)
351: fprintf(stderr,"try mmap($%lx, $%lx, ..., MAP_ANON, ...); ", (long)next_address, (long)size);
1.34 anton 352: r = mmap(next_address, size, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_ANON|MAP_PRIVATE, -1, 0);
1.1 anton 353: #else /* !defined(MAP_ANON) */
1.17 anton 354: /* Ultrix (at least) does not define MAP_FILE and MAP_PRIVATE (both are
355: apparently defaults) */
1.1 anton 356: static int dev_zero=-1;
357:
358: if (dev_zero == -1)
359: dev_zero = open("/dev/zero", O_RDONLY);
360: if (dev_zero == -1) {
1.34 anton 361: r = MAP_FAILED;
1.1 anton 362: if (debug)
363: fprintf(stderr, "open(\"/dev/zero\"...) failed (%s), no mmap; ",
364: strerror(errno));
365: } else {
366: if (debug)
367: fprintf(stderr,"try mmap($%lx, $%lx, ..., MAP_FILE, dev_zero, ...); ", (long)next_address, (long)size);
368: r=mmap(next_address, size, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_FILE|MAP_PRIVATE, dev_zero, 0);
369: }
370: #endif /* !defined(MAP_ANON) */
1.34 anton 371: after_alloc(r, size);
372: return r;
373: }
374: #endif
375:
376: Address my_alloc(Cell size)
377: {
378: #if HAVE_MMAP
379: Address r;
380:
381: r=alloc_mmap(size);
382: if (r!=MAP_FAILED)
1.1 anton 383: return r;
384: #endif /* HAVE_MMAP */
1.3 anton 385: /* use malloc as fallback */
386: return verbose_malloc(size);
1.1 anton 387: }
388:
1.34 anton 389: Address dict_alloc_read(FILE *file, Cell imagesize, Cell dictsize, Cell offset)
1.33 anton 390: {
1.34 anton 391: Address image = MAP_FAILED;
1.33 anton 392:
1.56 anton 393: #if defined(HAVE_MMAP)
1.33 anton 394: if (offset==0) {
1.34 anton 395: image=alloc_mmap(dictsize);
1.33 anton 396: if (debug)
1.34 anton 397: fprintf(stderr,"try mmap($%lx, $%lx, ..., MAP_FIXED|MAP_FILE, imagefile, 0); ", (long)image, (long)imagesize);
398: image = mmap(image, imagesize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_FIXED|MAP_FILE|MAP_PRIVATE, fileno(file), 0);
399: after_alloc(image,dictsize);
1.33 anton 400: }
1.56 anton 401: #endif /* defined(HAVE_MMAP) */
1.34 anton 402: if (image == MAP_FAILED) {
1.56 anton 403: image = my_alloc(dictsize+offset)+offset;
1.33 anton 404: rewind(file); /* fseek(imagefile,0L,SEEK_SET); */
1.34 anton 405: fread(image, 1, imagesize, file);
1.33 anton 406: }
407: return image;
408: }
409:
1.10 pazsan 410: void set_stack_sizes(ImageHeader * header)
411: {
412: if (dictsize==0)
413: dictsize = header->dict_size;
414: if (dsize==0)
415: dsize = header->data_stack_size;
416: if (rsize==0)
417: rsize = header->return_stack_size;
418: if (fsize==0)
419: fsize = header->fp_stack_size;
420: if (lsize==0)
421: lsize = header->locals_stack_size;
422: dictsize=maxaligned(dictsize);
423: dsize=maxaligned(dsize);
424: rsize=maxaligned(rsize);
425: lsize=maxaligned(lsize);
426: fsize=maxaligned(fsize);
427: }
428:
429: void alloc_stacks(ImageHeader * header)
430: {
431: header->dict_size=dictsize;
432: header->data_stack_size=dsize;
433: header->fp_stack_size=fsize;
434: header->return_stack_size=rsize;
435: header->locals_stack_size=lsize;
436:
437: header->data_stack_base=my_alloc(dsize);
438: header->fp_stack_base=my_alloc(fsize);
439: header->return_stack_base=my_alloc(rsize);
440: header->locals_stack_base=my_alloc(lsize);
441: }
442:
1.44 pazsan 443: #warning You can ignore the warnings about clobbered variables in go_forth
1.11 pazsan 444: int go_forth(Address image, int stack, Cell *entries)
445: {
1.38 anton 446: volatile ImageHeader *image_header = (ImageHeader *)image;
1.18 anton 447: Cell *sp0=(Cell*)(image_header->data_stack_base + dsize);
1.44 pazsan 448: Cell *rp0=(Cell *)(image_header->return_stack_base + rsize);
1.18 anton 449: Float *fp0=(Float *)(image_header->fp_stack_base + fsize);
1.44 pazsan 450: #ifdef GFORTH_DEBUGGING
1.38 anton 451: volatile Cell *orig_rp0=rp0;
1.44 pazsan 452: #endif
1.18 anton 453: Address lp0=image_header->locals_stack_base + lsize;
454: Xt *ip0=(Xt *)(image_header->boot_entry);
1.13 pazsan 455: #ifdef SYSSIGNALS
1.11 pazsan 456: int throw_code;
1.13 pazsan 457: #endif
1.11 pazsan 458:
459: /* ensure that the cached elements (if any) are accessible */
1.41 anton 460: IF_spTOS(sp0--);
461: IF_fpTOS(fp0--);
1.11 pazsan 462:
463: for(;stack>0;stack--)
1.18 anton 464: *--sp0=entries[stack-1];
1.11 pazsan 465:
1.30 pazsan 466: #ifdef SYSSIGNALS
1.11 pazsan 467: get_winsize();
468:
469: install_signal_handlers(); /* right place? */
470:
471: if ((throw_code=setjmp(throw_jmp_buf))) {
472: static Cell signal_data_stack[8];
473: static Cell signal_return_stack[8];
474: static Float signal_fp_stack[1];
1.13 pazsan 475:
1.11 pazsan 476: signal_data_stack[7]=throw_code;
1.18 anton 477:
478: #ifdef GFORTH_DEBUGGING
1.38 anton 479: /* fprintf(stderr,"\nrp=%ld\n",(long)rp); */
480: if (rp <= orig_rp0 && rp > (Cell *)(image_header->return_stack_base+5)) {
1.18 anton 481: /* no rstack overflow or underflow */
482: rp0 = rp;
1.63 anton 483: *--rp0 = (Cell)saved_ip;
1.18 anton 484: }
485: else /* I love non-syntactic ifdefs :-) */
486: #endif
487: rp0 = signal_return_stack+8;
1.25 anton 488: /* fprintf(stderr, "rp=$%x\n",rp0);*/
1.11 pazsan 489:
1.33 anton 490: return((int)(Cell)engine(image_header->throw_entry, signal_data_stack+7,
1.18 anton 491: rp0, signal_fp_stack, 0));
1.11 pazsan 492: }
1.13 pazsan 493: #endif
1.11 pazsan 494:
1.33 anton 495: return((int)(Cell)engine(ip0,sp0,rp0,fp0,lp0));
1.11 pazsan 496: }
497:
1.30 pazsan 498: #ifndef INCLUDE_IMAGE
1.21 anton 499: void print_sizes(Cell sizebyte)
500: /* print size information */
501: {
502: static char* endianstring[]= { " big","little" };
503:
504: fprintf(stderr,"%s endian, cell=%d bytes, char=%d bytes, au=%d bytes\n",
505: endianstring[sizebyte & 1],
506: 1 << ((sizebyte >> 1) & 3),
507: 1 << ((sizebyte >> 3) & 3),
508: 1 << ((sizebyte >> 5) & 3));
509: }
510:
1.70 anton 511: #define MAX_IMMARGS 2
512:
1.69 anton 513: #ifndef NO_DYNAMIC
1.47 anton 514: typedef struct {
515: Label start;
1.74 anton 516: Cell length; /* only includes the jump iff superend is true*/
517: Cell restlength; /* length of the rest (i.e., the jump or (on superend) 0) */
1.70 anton 518: char superend; /* true if primitive ends superinstruction, i.e.,
1.47 anton 519: unconditional branch, execute, etc. */
1.70 anton 520: Cell nimmargs;
521: struct immarg {
522: Cell offset; /* offset of immarg within prim */
523: char rel; /* true if immarg is relative */
524: } immargs[MAX_IMMARGS];
1.47 anton 525: } PrimInfo;
526:
527: PrimInfo *priminfos;
1.76 anton 528: PrimInfo **decomp_prims;
529:
1.90 anton 530: int compare_priminfo_length(const void *_a, const void *_b)
1.76 anton 531: {
1.90 anton 532: PrimInfo **a = (PrimInfo **)_a;
533: PrimInfo **b = (PrimInfo **)_b;
1.77 anton 534: Cell diff = (*a)->length - (*b)->length;
535: if (diff)
536: return diff;
537: else /* break ties by start address; thus the decompiler produces
538: the earliest primitive with the same code (e.g. noop instead
539: of (char) and @ instead of >code-address */
540: return (*b)->start - (*a)->start;
1.76 anton 541: }
542:
1.69 anton 543: #endif /* defined(NO_DYNAMIC) */
1.48 anton 544: Cell npriminfos=0;
1.47 anton 545:
1.76 anton 546:
1.47 anton 547: void check_prims(Label symbols1[])
548: {
549: int i;
1.90 anton 550: #ifndef NO_DYNAMIC
1.70 anton 551: Label *symbols2, *symbols3, *ends1;
1.49 anton 552: static char superend[]={
1.48 anton 553: #include "prim_superend.i"
554: };
1.90 anton 555: #endif
1.47 anton 556:
1.66 anton 557: if (debug)
558: #ifdef __VERSION__
559: fprintf(stderr, "Compiled with gcc-" __VERSION__ "\n");
560: #else
561: #define xstr(s) str(s)
562: #define str(s) #s
563: fprintf(stderr, "Compiled with gcc-" xstr(__GNUC__) "." xstr(__GNUC_MINOR__) "\n");
564: #endif
1.47 anton 565: for (i=DOESJUMP+1; symbols1[i+1]!=0; i++)
566: ;
1.55 anton 567: npriminfos = i;
1.70 anton 568:
569: #ifndef NO_DYNAMIC
1.66 anton 570: if (no_dynamic)
571: return;
1.55 anton 572: symbols2=engine2(0,0,0,0,0);
1.70 anton 573: #if NO_IP
574: symbols3=engine3(0,0,0,0,0);
575: #else
576: symbols3=symbols1;
577: #endif
578: ends1 = symbols1+i+1-DOESJUMP;
1.47 anton 579: priminfos = calloc(i,sizeof(PrimInfo));
580: for (i=DOESJUMP+1; symbols1[i+1]!=0; i++) {
1.70 anton 581: int prim_len = ends1[i]-symbols1[i];
1.47 anton 582: PrimInfo *pi=&priminfos[i];
1.70 anton 583: int j=0;
584: char *s1 = (char *)symbols1[i];
585: char *s2 = (char *)symbols2[i];
586: char *s3 = (char *)symbols3[i];
587:
588: pi->start = s1;
589: pi->superend = superend[i-DOESJUMP-1]|no_super;
590: if (pi->superend)
591: pi->length = symbols1[i+1]-symbols1[i];
592: else
593: pi->length = prim_len;
1.74 anton 594: pi->restlength = symbols1[i+1] - symbols1[i] - pi->length;
1.70 anton 595: pi->nimmargs = 0;
596: if (debug)
1.74 anton 597: fprintf(stderr, "Prim %3d @ %p %p %p, length=%3d restlength=%2d superend=%1d",
598: i, s1, s2, s3, pi->length, pi->restlength, pi->superend);
1.70 anton 599: assert(prim_len>=0);
1.74 anton 600: while (j<(pi->length+pi->restlength)) {
1.70 anton 601: if (s1[j]==s3[j]) {
602: if (s1[j] != s2[j]) {
603: pi->start = NULL; /* not relocatable */
604: if (debug)
605: fprintf(stderr,"\n non_reloc: engine1!=engine2 offset %3d",j);
1.74 anton 606: /* assert(j<prim_len); */
1.70 anton 607: break;
608: }
609: j++;
610: } else {
611: struct immarg *ia=&pi->immargs[pi->nimmargs];
612:
613: pi->nimmargs++;
614: ia->offset=j;
615: if ((~*(Cell *)&(s1[j]))==*(Cell *)&(s3[j])) {
616: ia->rel=0;
617: if (debug)
618: fprintf(stderr,"\n absolute immarg: offset %3d",j);
619: } else if ((&(s1[j]))+(*(Cell *)&(s1[j]))+4 ==
620: symbols1[DOESJUMP+1]) {
621: ia->rel=1;
622: if (debug)
623: fprintf(stderr,"\n relative immarg: offset %3d",j);
624: } else {
625: pi->start = NULL; /* not relocatable */
626: if (debug)
627: fprintf(stderr,"\n non_reloc: engine1!=engine3 offset %3d",j);
1.74 anton 628: /* assert(j<prim_len);*/
1.70 anton 629: break;
630: }
631: j+=4;
1.47 anton 632: }
633: }
1.70 anton 634: if (debug)
635: fprintf(stderr,"\n");
636: }
1.76 anton 637: decomp_prims = calloc(i,sizeof(PrimInfo *));
638: for (i=DOESJUMP+1; i<npriminfos; i++)
639: decomp_prims[i] = &(priminfos[i]);
640: qsort(decomp_prims+DOESJUMP+1, npriminfos-DOESJUMP-1, sizeof(PrimInfo *),
641: compare_priminfo_length);
1.70 anton 642: #endif
643: }
644:
1.74 anton 645: void flush_to_here(void)
646: {
1.93 ! anton 647: #ifndef NO_DYNAMIC
1.74 anton 648: FLUSH_ICACHE(start_flush, code_here-start_flush);
649: start_flush=code_here;
1.93 ! anton 650: #endif
1.74 anton 651: }
652:
1.93 ! anton 653: #ifndef NO_DYNAMIC
1.74 anton 654: void append_jump(void)
655: {
656: if (last_jump) {
657: PrimInfo *pi = &priminfos[last_jump];
658:
659: memcpy(code_here, pi->start+pi->length, pi->restlength);
660: code_here += pi->restlength;
661: last_jump=0;
662: }
663: }
664:
1.75 anton 665: /* Gforth remembers all code blocks in this list. On forgetting (by
666: executing a marker) the code blocks are not freed (because Gforth does
667: not remember how they were allocated; hmm, remembering that might be
668: easier and cleaner). Instead, code_here etc. are reset to the old
669: value, and the "forgotten" code blocks are reused when they are
670: needed. */
671:
672: struct code_block_list {
673: struct code_block_list *next;
674: Address block;
675: Cell size;
676: } *code_block_list=NULL, **next_code_blockp=&code_block_list;
677:
1.74 anton 678: Address append_prim(Cell p)
679: {
680: PrimInfo *pi = &priminfos[p];
681: Address old_code_here = code_here;
682:
683: if (code_area+code_area_size < code_here+pi->length+pi->restlength) {
1.75 anton 684: struct code_block_list *p;
1.74 anton 685: append_jump();
1.93 ! anton 686: flush_to_here();
1.75 anton 687: if (*next_code_blockp == NULL) {
688: code_here = start_flush = code_area = my_alloc(code_area_size);
689: p = (struct code_block_list *)malloc(sizeof(struct code_block_list));
690: *next_code_blockp = p;
691: p->next = NULL;
692: p->block = code_here;
693: p->size = code_area_size;
694: } else {
695: p = *next_code_blockp;
696: code_here = start_flush = code_area = p->block;
697: }
1.74 anton 698: old_code_here = code_here;
1.75 anton 699: next_code_blockp = &(p->next);
1.74 anton 700: }
701: memcpy(code_here, pi->start, pi->length);
702: code_here += pi->length;
703: if (pi->superend)
704: flush_to_here();
705: return old_code_here;
706: }
707: #endif
1.75 anton 708:
709: int forget_dyncode(Address code)
710: {
711: #ifdef NO_DYNAMIC
712: return -1;
713: #else
714: struct code_block_list *p, **pp;
715:
716: for (pp=&code_block_list, p=*pp; p!=NULL; pp=&(p->next), p=*pp) {
717: if (code >= p->block && code < p->block+p->size) {
718: next_code_blockp = &(p->next);
719: code_here = start_flush = code;
720: code_area = p->block;
721: last_jump = 0;
722: return -1;
723: }
724: }
1.78 anton 725: return -no_dynamic;
1.75 anton 726: #endif /* !defined(NO_DYNAMIC) */
727: }
728:
1.90 anton 729: Label decompile_code(Label _code)
1.75 anton 730: {
1.76 anton 731: #ifdef NO_DYNAMIC
1.90 anton 732: return _code;
1.76 anton 733: #else /* !defined(NO_DYNAMIC) */
734: Cell i;
1.77 anton 735: struct code_block_list *p;
1.90 anton 736: Address code=_code;
1.76 anton 737:
1.77 anton 738: /* first, check if we are in code at all */
739: for (p = code_block_list;; p = p->next) {
740: if (p == NULL)
741: return code;
742: if (code >= p->block && code < p->block+p->size)
743: break;
744: }
1.76 anton 745: /* reverse order because NOOP might match other prims */
746: for (i=npriminfos-1; i>DOESJUMP; i--) {
747: PrimInfo *pi=decomp_prims[i];
748: if (pi->start==code || (pi->start && memcmp(code,pi->start,pi->length)==0))
749: return pi->start;
750: }
751: return code;
752: #endif /* !defined(NO_DYNAMIC) */
1.75 anton 753: }
1.74 anton 754:
1.70 anton 755: #ifdef NO_IP
756: int nbranchinfos=0;
757:
758: struct branchinfo {
759: Label *targetptr; /* *(bi->targetptr) is the target */
760: Cell *addressptr; /* store the target here */
761: } branchinfos[100000];
762:
763: int ndoesexecinfos=0;
764: struct doesexecinfo {
765: int branchinfo; /* fix the targetptr of branchinfos[...->branchinfo] */
766: Cell *xt; /* cfa of word whose does-code needs calling */
767: } doesexecinfos[10000];
768:
1.73 anton 769: /* definitions of N_execute etc. */
770: #include "prim_num.i"
1.70 anton 771:
772: void set_rel_target(Cell *source, Label target)
773: {
774: *source = ((Cell)target)-(((Cell)source)+4);
775: }
776:
777: void register_branchinfo(Label source, Cell targetptr)
778: {
779: struct branchinfo *bi = &(branchinfos[nbranchinfos]);
780: bi->targetptr = (Label *)targetptr;
781: bi->addressptr = (Cell *)source;
782: nbranchinfos++;
783: }
784:
785: Cell *compile_prim1arg(Cell p)
786: {
787: int l = priminfos[p].length;
788: Address old_code_here=code_here;
789:
1.74 anton 790: assert(vm_prims[p]==priminfos[p].start);
791: append_prim(p);
1.70 anton 792: return (Cell*)(old_code_here+priminfos[p].immargs[0].offset);
793: }
794:
795: Cell *compile_call2(Cell targetptr)
796: {
797: Cell *next_code_target;
1.73 anton 798: PrimInfo *pi = &priminfos[N_call2];
1.74 anton 799: Address old_code_here = append_prim(N_call2);
1.70 anton 800:
1.74 anton 801: next_code_target = (Cell *)(old_code_here + pi->immargs[0].offset);
802: register_branchinfo(old_code_here + pi->immargs[1].offset, targetptr);
1.70 anton 803: return next_code_target;
804: }
805: #endif
806:
807: void finish_code(void)
808: {
809: #ifdef NO_IP
810: Cell i;
811:
812: compile_prim1(NULL);
813: for (i=0; i<ndoesexecinfos; i++) {
814: struct doesexecinfo *dei = &doesexecinfos[i];
815: branchinfos[dei->branchinfo].targetptr = DOES_CODE1((dei->xt));
816: }
817: ndoesexecinfos = 0;
818: for (i=0; i<nbranchinfos; i++) {
819: struct branchinfo *bi=&branchinfos[i];
820: set_rel_target(bi->addressptr, *(bi->targetptr));
821: }
822: nbranchinfos = 0;
1.48 anton 823: #endif
1.93 ! anton 824: flush_to_here();
1.48 anton 825: }
826:
1.70 anton 827: void compile_prim1(Cell *start)
1.48 anton 828: {
1.61 anton 829: #if defined(DOUBLY_INDIRECT)
1.70 anton 830: Label prim=(Label)*start;
1.54 anton 831: if (prim<((Label)(xts+DOESJUMP)) || prim>((Label)(xts+npriminfos))) {
832: fprintf(stderr,"compile_prim encountered xt %p\n", prim);
1.70 anton 833: *start=(Cell)prim;
834: return;
835: } else {
1.90 anton 836: *start = (Cell)(prim-((Label)xts)+((Label)vm_prims));
1.70 anton 837: return;
838: }
839: #elif defined(NO_IP)
840: static Cell *last_start=NULL;
841: static Xt last_prim=NULL;
842: /* delay work by one call in order to get relocated immargs */
843:
844: if (last_start) {
845: unsigned i = last_prim-vm_prims;
846: PrimInfo *pi=&priminfos[i];
847: Cell *next_code_target=NULL;
848:
849: assert(i<npriminfos);
1.73 anton 850: if (i==N_execute||i==N_perform||i==N_lit_perform) {
851: next_code_target = compile_prim1arg(N_set_next_code);
1.70 anton 852: }
1.73 anton 853: if (i==N_call) {
1.70 anton 854: next_code_target = compile_call2(last_start[1]);
1.73 anton 855: } else if (i==N_does_exec) {
1.70 anton 856: struct doesexecinfo *dei = &doesexecinfos[ndoesexecinfos++];
1.73 anton 857: *compile_prim1arg(N_lit) = (Cell)PFA(last_start[1]);
1.70 anton 858: /* we cannot determine the callee now (last_start[1] may be a
859: forward reference), so just register an arbitrary target, and
860: register in dei that we need to fix this before resolving
861: branches */
862: dei->branchinfo = nbranchinfos;
863: dei->xt = (Cell *)(last_start[1]);
864: next_code_target = compile_call2(NULL);
865: } else if (pi->start == NULL) { /* non-reloc */
1.73 anton 866: next_code_target = compile_prim1arg(N_set_next_code);
867: set_rel_target(compile_prim1arg(N_abranch),*(Xt)last_prim);
1.70 anton 868: } else {
869: unsigned j;
1.74 anton 870: Address old_code_here = append_prim(i);
1.70 anton 871:
872: for (j=0; j<pi->nimmargs; j++) {
873: struct immarg *ia = &(pi->immargs[j]);
874: Cell argval = last_start[pi->nimmargs - j]; /* !! specific to prims */
875: if (ia->rel) { /* !! assumption: relative refs are branches */
1.74 anton 876: register_branchinfo(old_code_here + ia->offset, argval);
1.70 anton 877: } else /* plain argument */
1.74 anton 878: *(Cell *)(old_code_here + ia->offset) = argval;
1.70 anton 879: }
880: }
881: if (next_code_target!=NULL)
882: *next_code_target = (Cell)code_here;
883: }
884: if (start) {
885: last_prim = (Xt)*start;
886: *start = (Cell)code_here;
887: }
888: last_start = start;
889: return;
890: #elif !defined(NO_DYNAMIC)
891: Label prim=(Label)*start;
1.58 anton 892: unsigned i;
1.74 anton 893: Address old_code_here;
1.48 anton 894:
1.58 anton 895: i = ((Xt)prim)-vm_prims;
1.56 anton 896: prim = *(Xt)prim;
1.70 anton 897: if (no_dynamic) {
898: *start = (Cell)prim;
899: return;
900: }
1.58 anton 901: if (i>=npriminfos || priminfos[i].start == 0) { /* not a relocatable prim */
1.74 anton 902: append_jump();
1.70 anton 903: *start = (Cell)prim;
904: return;
1.47 anton 905: }
1.58 anton 906: assert(priminfos[i].start = prim);
1.50 anton 907: #ifdef ALIGN_CODE
1.87 anton 908: /* ALIGN_CODE;*/
1.50 anton 909: #endif
1.74 anton 910: assert(prim==priminfos[i].start);
911: old_code_here = append_prim(i);
912: last_jump = (priminfos[i].superend) ? 0 : i;
1.70 anton 913: *start = (Cell)old_code_here;
914: return;
1.61 anton 915: #else /* !defined(DOUBLY_INDIRECT), no code replication */
1.70 anton 916: Label prim=(Label)*start;
1.61 anton 917: #if !defined(INDIRECT_THREADED)
1.56 anton 918: prim = *(Xt)prim;
1.61 anton 919: #endif
1.70 anton 920: *start = (Cell)prim;
921: return;
1.54 anton 922: #endif /* !defined(DOUBLY_INDIRECT) */
1.70 anton 923: }
924:
925: Label compile_prim(Label prim)
926: {
927: Cell x=(Cell)prim;
1.80 anton 928: assert(0);
1.70 anton 929: compile_prim1(&x);
930: return (Label)x;
1.47 anton 931: }
932:
1.69 anton 933: #if defined(PRINT_SUPER_LENGTHS) && !defined(NO_DYNAMIC)
1.59 anton 934: Cell prim_length(Cell prim)
935: {
936: return priminfos[prim+DOESJUMP+1].length;
937: }
938: #endif
939:
1.1 anton 940: Address loader(FILE *imagefile, char* filename)
941: /* returns the address of the image proper (after the preamble) */
942: {
943: ImageHeader header;
944: Address image;
945: Address imp; /* image+preamble */
1.17 anton 946: Char magic[8];
947: char magic7; /* size byte of magic number */
1.1 anton 948: Cell preamblesize=0;
1.6 pazsan 949: Cell data_offset = offset_image ? 56*sizeof(Cell) : 0;
1.1 anton 950: UCell check_sum;
1.15 pazsan 951: Cell ausize = ((RELINFOBITS == 8) ? 0 :
952: (RELINFOBITS == 16) ? 1 :
953: (RELINFOBITS == 32) ? 2 : 3);
954: Cell charsize = ((sizeof(Char) == 1) ? 0 :
955: (sizeof(Char) == 2) ? 1 :
956: (sizeof(Char) == 4) ? 2 : 3) + ausize;
957: Cell cellsize = ((sizeof(Cell) == 1) ? 0 :
958: (sizeof(Cell) == 2) ? 1 :
959: (sizeof(Cell) == 4) ? 2 : 3) + ausize;
1.21 anton 960: Cell sizebyte = (ausize << 5) + (charsize << 3) + (cellsize << 1) +
961: #ifdef WORDS_BIGENDIAN
962: 0
963: #else
964: 1
965: #endif
966: ;
1.1 anton 967:
1.43 anton 968: vm_prims = engine(0,0,0,0,0);
1.47 anton 969: check_prims(vm_prims);
1.1 anton 970: #ifndef DOUBLY_INDIRECT
1.59 anton 971: #ifdef PRINT_SUPER_LENGTHS
972: print_super_lengths();
973: #endif
1.43 anton 974: check_sum = checksum(vm_prims);
1.1 anton 975: #else /* defined(DOUBLY_INDIRECT) */
1.43 anton 976: check_sum = (UCell)vm_prims;
1.1 anton 977: #endif /* defined(DOUBLY_INDIRECT) */
1.10 pazsan 978:
979: do {
980: if(fread(magic,sizeof(Char),8,imagefile) < 8) {
1.84 anton 981: fprintf(stderr,"%s: image %s doesn't seem to be a Gforth (>=0.6) image.\n",
1.10 pazsan 982: progname, filename);
983: exit(1);
1.1 anton 984: }
1.10 pazsan 985: preamblesize+=8;
1.84 anton 986: } while(memcmp(magic,"Gforth3",7));
1.17 anton 987: magic7 = magic[7];
1.1 anton 988: if (debug) {
1.17 anton 989: magic[7]='\0';
1.21 anton 990: fprintf(stderr,"Magic found: %s ", magic);
991: print_sizes(magic7);
1.1 anton 992: }
993:
1.21 anton 994: if (magic7 != sizebyte)
995: {
996: fprintf(stderr,"This image is: ");
997: print_sizes(magic7);
998: fprintf(stderr,"whereas the machine is ");
999: print_sizes(sizebyte);
1.1 anton 1000: exit(-2);
1001: };
1002:
1003: fread((void *)&header,sizeof(ImageHeader),1,imagefile);
1.10 pazsan 1004:
1005: set_stack_sizes(&header);
1.1 anton 1006:
1007: #if HAVE_GETPAGESIZE
1008: pagesize=getpagesize(); /* Linux/GNU libc offers this */
1009: #elif HAVE_SYSCONF && defined(_SC_PAGESIZE)
1010: pagesize=sysconf(_SC_PAGESIZE); /* POSIX.4 */
1011: #elif PAGESIZE
1012: pagesize=PAGESIZE; /* in limits.h according to Gallmeister's POSIX.4 book */
1013: #endif
1014: if (debug)
1.5 jwilke 1015: fprintf(stderr,"pagesize=%ld\n",(unsigned long) pagesize);
1.1 anton 1016:
1.34 anton 1017: image = dict_alloc_read(imagefile, preamblesize+header.image_size,
1018: preamblesize+dictsize, data_offset);
1.33 anton 1019: imp=image+preamblesize;
1.57 anton 1020: alloc_stacks((ImageHeader *)imp);
1.1 anton 1021: if (clear_dictionary)
1.33 anton 1022: memset(imp+header.image_size, 0, dictsize-header.image_size);
1.90 anton 1023: if(header.base==0 || header.base == (Address)0x100) {
1.1 anton 1024: Cell reloc_size=((header.image_size-1)/sizeof(Cell))/8+1;
1025: char reloc_bits[reloc_size];
1.33 anton 1026: fseek(imagefile, preamblesize+header.image_size, SEEK_SET);
1.10 pazsan 1027: fread(reloc_bits, 1, reloc_size, imagefile);
1.90 anton 1028: relocate((Cell *)imp, reloc_bits, header.image_size, (Cell)header.base, vm_prims);
1.1 anton 1029: #if 0
1030: { /* let's see what the relocator did */
1031: FILE *snapshot=fopen("snapshot.fi","wb");
1032: fwrite(image,1,imagesize,snapshot);
1033: fclose(snapshot);
1034: }
1035: #endif
1.46 jwilke 1036: }
1037: else if(header.base!=imp) {
1038: fprintf(stderr,"%s: Cannot load nonrelocatable image (compiled for address $%lx) at address $%lx\n",
1039: progname, (unsigned long)header.base, (unsigned long)imp);
1040: exit(1);
1.1 anton 1041: }
1042: if (header.checksum==0)
1043: ((ImageHeader *)imp)->checksum=check_sum;
1044: else if (header.checksum != check_sum) {
1045: fprintf(stderr,"%s: Checksum of image ($%lx) does not match the executable ($%lx)\n",
1046: progname, (unsigned long)(header.checksum),(unsigned long)check_sum);
1047: exit(1);
1048: }
1.53 anton 1049: #ifdef DOUBLY_INDIRECT
1050: ((ImageHeader *)imp)->xt_base = xts;
1051: #endif
1.1 anton 1052: fclose(imagefile);
1053:
1.56 anton 1054: /* unnecessary, except maybe for CODE words */
1055: /* FLUSH_ICACHE(imp, header.image_size);*/
1.1 anton 1056:
1057: return imp;
1058: }
1059:
1.72 anton 1060: /* pointer to last '/' or '\' in file, 0 if there is none. */
1061: char *onlypath(char *filename)
1.10 pazsan 1062: {
1.72 anton 1063: return strrchr(filename, DIRSEP);
1.1 anton 1064: }
1065:
1066: FILE *openimage(char *fullfilename)
1.10 pazsan 1067: {
1068: FILE *image_file;
1.28 anton 1069: char * expfilename = tilde_cstr(fullfilename, strlen(fullfilename), 1);
1.10 pazsan 1070:
1.28 anton 1071: image_file=fopen(expfilename,"rb");
1.1 anton 1072: if (image_file!=NULL && debug)
1.28 anton 1073: fprintf(stderr, "Opened image file: %s\n", expfilename);
1.10 pazsan 1074: return image_file;
1.1 anton 1075: }
1076:
1.28 anton 1077: /* try to open image file concat(path[0:len],imagename) */
1.1 anton 1078: FILE *checkimage(char *path, int len, char *imagename)
1.10 pazsan 1079: {
1080: int dirlen=len;
1.1 anton 1081: char fullfilename[dirlen+strlen(imagename)+2];
1.10 pazsan 1082:
1.1 anton 1083: memcpy(fullfilename, path, dirlen);
1.71 pazsan 1084: if (fullfilename[dirlen-1]!=DIRSEP)
1085: fullfilename[dirlen++]=DIRSEP;
1.1 anton 1086: strcpy(fullfilename+dirlen,imagename);
1.10 pazsan 1087: return openimage(fullfilename);
1.1 anton 1088: }
1089:
1.10 pazsan 1090: FILE * open_image_file(char * imagename, char * path)
1.1 anton 1091: {
1.10 pazsan 1092: FILE * image_file=NULL;
1.28 anton 1093: char *origpath=path;
1.10 pazsan 1094:
1.71 pazsan 1095: if(strchr(imagename, DIRSEP)==NULL) {
1.10 pazsan 1096: /* first check the directory where the exe file is in !! 01may97jaw */
1097: if (onlypath(progname))
1.72 anton 1098: image_file=checkimage(progname, onlypath(progname)-progname, imagename);
1.10 pazsan 1099: if (!image_file)
1100: do {
1101: char *pend=strchr(path, PATHSEP);
1102: if (pend==NULL)
1103: pend=path+strlen(path);
1104: if (strlen(path)==0) break;
1105: image_file=checkimage(path, pend-path, imagename);
1106: path=pend+(*pend==PATHSEP);
1107: } while (image_file==NULL);
1108: } else {
1109: image_file=openimage(imagename);
1110: }
1.1 anton 1111:
1.10 pazsan 1112: if (!image_file) {
1113: fprintf(stderr,"%s: cannot open image file %s in path %s for reading\n",
1.28 anton 1114: progname, imagename, origpath);
1.10 pazsan 1115: exit(1);
1.7 anton 1116: }
1117:
1.10 pazsan 1118: return image_file;
1119: }
1.11 pazsan 1120: #endif
1121:
1122: #ifdef HAS_OS
1123: UCell convsize(char *s, UCell elemsize)
1124: /* converts s of the format [0-9]+[bekMGT]? (e.g. 25k) into the number
1125: of bytes. the letter at the end indicates the unit, where e stands
1126: for the element size. default is e */
1127: {
1128: char *endp;
1129: UCell n,m;
1130:
1131: m = elemsize;
1132: n = strtoul(s,&endp,0);
1133: if (endp!=NULL) {
1134: if (strcmp(endp,"b")==0)
1135: m=1;
1136: else if (strcmp(endp,"k")==0)
1137: m=1024;
1138: else if (strcmp(endp,"M")==0)
1139: m=1024*1024;
1140: else if (strcmp(endp,"G")==0)
1141: m=1024*1024*1024;
1142: else if (strcmp(endp,"T")==0) {
1143: #if (SIZEOF_CHAR_P > 4)
1.24 anton 1144: m=1024L*1024*1024*1024;
1.11 pazsan 1145: #else
1146: fprintf(stderr,"%s: size specification \"%s\" too large for this machine\n", progname, endp);
1147: exit(1);
1148: #endif
1149: } else if (strcmp(endp,"e")!=0 && strcmp(endp,"")!=0) {
1150: fprintf(stderr,"%s: cannot grok size specification %s: invalid unit \"%s\"\n", progname, s, endp);
1151: exit(1);
1152: }
1153: }
1154: return n*m;
1155: }
1.10 pazsan 1156:
1157: void gforth_args(int argc, char ** argv, char ** path, char ** imagename)
1158: {
1159: int c;
1160:
1.1 anton 1161: opterr=0;
1162: while (1) {
1163: int option_index=0;
1164: static struct option opts[] = {
1.29 anton 1165: {"appl-image", required_argument, NULL, 'a'},
1.1 anton 1166: {"image-file", required_argument, NULL, 'i'},
1167: {"dictionary-size", required_argument, NULL, 'm'},
1168: {"data-stack-size", required_argument, NULL, 'd'},
1169: {"return-stack-size", required_argument, NULL, 'r'},
1170: {"fp-stack-size", required_argument, NULL, 'f'},
1171: {"locals-stack-size", required_argument, NULL, 'l'},
1172: {"path", required_argument, NULL, 'p'},
1173: {"version", no_argument, NULL, 'v'},
1174: {"help", no_argument, NULL, 'h'},
1175: /* put something != 0 into offset_image */
1176: {"offset-image", no_argument, &offset_image, 1},
1177: {"no-offset-im", no_argument, &offset_image, 0},
1178: {"clear-dictionary", no_argument, &clear_dictionary, 1},
1.4 anton 1179: {"die-on-signal", no_argument, &die_on_signal, 1},
1.1 anton 1180: {"debug", no_argument, &debug, 1},
1.60 anton 1181: {"no-super", no_argument, &no_super, 1},
1182: {"no-dynamic", no_argument, &no_dynamic, 1},
1.66 anton 1183: {"dynamic", no_argument, &no_dynamic, 0},
1.1 anton 1184: {0,0,0,0}
1185: /* no-init-file, no-rc? */
1186: };
1187:
1.36 pazsan 1188: c = getopt_long(argc, argv, "+i:m:d:r:f:l:p:vhoncsx", opts, &option_index);
1.1 anton 1189:
1190: switch (c) {
1.29 anton 1191: case EOF: return;
1192: case '?': optind--; return;
1193: case 'a': *imagename = optarg; return;
1.10 pazsan 1194: case 'i': *imagename = optarg; break;
1.1 anton 1195: case 'm': dictsize = convsize(optarg,sizeof(Cell)); break;
1196: case 'd': dsize = convsize(optarg,sizeof(Cell)); break;
1197: case 'r': rsize = convsize(optarg,sizeof(Cell)); break;
1198: case 'f': fsize = convsize(optarg,sizeof(Float)); break;
1199: case 'l': lsize = convsize(optarg,sizeof(Cell)); break;
1.10 pazsan 1200: case 'p': *path = optarg; break;
1.36 pazsan 1201: case 'o': offset_image = 1; break;
1202: case 'n': offset_image = 0; break;
1203: case 'c': clear_dictionary = 1; break;
1204: case 's': die_on_signal = 1; break;
1205: case 'x': debug = 1; break;
1.83 anton 1206: case 'v': fputs(PACKAGE_STRING"\n", stderr); exit(0);
1.1 anton 1207: case 'h':
1.29 anton 1208: fprintf(stderr, "Usage: %s [engine options] ['--'] [image arguments]\n\
1.1 anton 1209: Engine Options:\n\
1.29 anton 1210: --appl-image FILE equivalent to '--image-file=FILE --'\n\
1.10 pazsan 1211: --clear-dictionary Initialize the dictionary with 0 bytes\n\
1212: -d SIZE, --data-stack-size=SIZE Specify data stack size\n\
1213: --debug Print debugging information during startup\n\
1214: --die-on-signal exit instead of CATCHing some signals\n\
1.66 anton 1215: --dynamic use dynamic native code\n\
1.10 pazsan 1216: -f SIZE, --fp-stack-size=SIZE Specify floating point stack size\n\
1217: -h, --help Print this message and exit\n\
1218: -i FILE, --image-file=FILE Use image FILE instead of `gforth.fi'\n\
1219: -l SIZE, --locals-stack-size=SIZE Specify locals stack size\n\
1220: -m SIZE, --dictionary-size=SIZE Specify Forth dictionary size\n\
1.60 anton 1221: --no-dynamic Use only statically compiled primitives\n\
1.10 pazsan 1222: --no-offset-im Load image at normal position\n\
1.60 anton 1223: --no-super No dynamically formed superinstructions\n\
1.10 pazsan 1224: --offset-image Load image at a different position\n\
1225: -p PATH, --path=PATH Search path for finding image and sources\n\
1226: -r SIZE, --return-stack-size=SIZE Specify return stack size\n\
1.66 anton 1227: -v, --version Print engine version and exit\n\
1.1 anton 1228: SIZE arguments consist of an integer followed by a unit. The unit can be\n\
1.10 pazsan 1229: `b' (byte), `e' (element; default), `k' (KB), `M' (MB), `G' (GB) or `T' (TB).\n",
1230: argv[0]);
1231: optind--;
1232: return;
1.1 anton 1233: }
1234: }
1.10 pazsan 1235: }
1.11 pazsan 1236: #endif
1.10 pazsan 1237:
1238: #ifdef INCLUDE_IMAGE
1239: extern Cell image[];
1240: extern const char reloc_bits[];
1241: #endif
1.67 pazsan 1242:
1.10 pazsan 1243: int main(int argc, char **argv, char **env)
1244: {
1.30 pazsan 1245: #ifdef HAS_OS
1.10 pazsan 1246: char *path = getenv("GFORTHPATH") ? : DEFAULTPATH;
1.30 pazsan 1247: #else
1248: char *path = DEFAULTPATH;
1249: #endif
1.13 pazsan 1250: #ifndef INCLUDE_IMAGE
1.10 pazsan 1251: char *imagename="gforth.fi";
1252: FILE *image_file;
1253: Address image;
1254: #endif
1255: int retvalue;
1256:
1.56 anton 1257: #if defined(i386) && defined(ALIGNMENT_CHECK)
1.10 pazsan 1258: /* turn on alignment checks on the 486.
1259: * on the 386 this should have no effect. */
1260: __asm__("pushfl; popl %eax; orl $0x40000, %eax; pushl %eax; popfl;");
1261: /* this is unusable with Linux' libc.4.6.27, because this library is
1262: not alignment-clean; we would have to replace some library
1263: functions (e.g., memcpy) to make it work. Also GCC doesn't try to keep
1264: the stack FP-aligned. */
1265: #endif
1266:
1267: /* buffering of the user output device */
1.11 pazsan 1268: #ifdef _IONBF
1.10 pazsan 1269: if (isatty(fileno(stdout))) {
1270: fflush(stdout);
1271: setvbuf(stdout,NULL,_IONBF,0);
1.1 anton 1272: }
1.11 pazsan 1273: #endif
1.1 anton 1274:
1.10 pazsan 1275: progname = argv[0];
1276:
1.11 pazsan 1277: #ifdef HAS_OS
1.10 pazsan 1278: gforth_args(argc, argv, &path, &imagename);
1.11 pazsan 1279: #endif
1.10 pazsan 1280:
1281: #ifdef INCLUDE_IMAGE
1282: set_stack_sizes((ImageHeader *)image);
1.22 pazsan 1283: if(((ImageHeader *)image)->base != image)
1284: relocate(image, reloc_bits, ((ImageHeader *)image)->image_size,
1285: (Label*)engine(0, 0, 0, 0, 0));
1.10 pazsan 1286: alloc_stacks((ImageHeader *)image);
1287: #else
1288: image_file = open_image_file(imagename, path);
1289: image = loader(image_file, imagename);
1290: #endif
1.24 anton 1291: gforth_header=(ImageHeader *)image; /* used in SIGSEGV handler */
1.1 anton 1292:
1293: {
1.10 pazsan 1294: char path2[strlen(path)+1];
1.1 anton 1295: char *p1, *p2;
1296: Cell environ[]= {
1297: (Cell)argc-(optind-1),
1298: (Cell)(argv+(optind-1)),
1.10 pazsan 1299: (Cell)strlen(path),
1.1 anton 1300: (Cell)path2};
1301: argv[optind-1] = progname;
1302: /*
1303: for (i=0; i<environ[0]; i++)
1304: printf("%s\n", ((char **)(environ[1]))[i]);
1305: */
1306: /* make path OS-independent by replacing path separators with NUL */
1.10 pazsan 1307: for (p1=path, p2=path2; *p1!='\0'; p1++, p2++)
1.1 anton 1308: if (*p1==PATHSEP)
1309: *p2 = '\0';
1310: else
1311: *p2 = *p1;
1312: *p2='\0';
1.10 pazsan 1313: retvalue = go_forth(image, 4, environ);
1.42 anton 1314: #ifdef VM_PROFILING
1315: vm_print_profile(stderr);
1316: #endif
1.1 anton 1317: deprep_terminal();
1318: }
1.13 pazsan 1319: return retvalue;
1.1 anton 1320: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>