1: /* command line interpretation, image loading etc. for Gforth
2:
3:
4: Copyright (C) 1995,1996,1997,1998,2000 Free Software Foundation, Inc.
5:
6: This file is part of Gforth.
7:
8: Gforth is free software; you can redistribute it and/or
9: modify it under the terms of the GNU General Public License
10: as published by the Free Software Foundation; either version 2
11: of the License, or (at your option) any later version.
12:
13: This program is distributed in the hope that it will be useful,
14: but WITHOUT ANY WARRANTY; without even the implied warranty of
15: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16: GNU General Public License for more details.
17:
18: You should have received a copy of the GNU General Public License
19: along with this program; if not, write to the Free Software
20: Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
21: */
22:
23: #include "config.h"
24: #include "forth.h"
25: #include <errno.h>
26: #include <ctype.h>
27: #include <stdio.h>
28: #include <unistd.h>
29: #include <string.h>
30: #include <math.h>
31: #include <sys/types.h>
32: #ifndef STANDALONE
33: #include <sys/stat.h>
34: #endif
35: #include <fcntl.h>
36: #include <assert.h>
37: #include <stdlib.h>
38: #ifndef STANDALONE
39: #if HAVE_SYS_MMAN_H
40: #include <sys/mman.h>
41: #endif
42: #endif
43: #include "io.h"
44: #include "getopt.h"
45: #ifdef STANDALONE
46: #include <systypes.h>
47: #endif
48:
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:
86: #define PRIM_VERSION 1
87: /* increment this whenever the primitives change in an incompatible way */
88:
89: #ifndef DEFAULTPATH
90: # define DEFAULTPATH "."
91: #endif
92:
93: #ifdef MSDOS
94: jmp_buf throw_jmp_buf;
95: #endif
96:
97: #if defined(DOUBLY_INDIRECT)
98: # define CFA(n) ({Cell _n = (n); ((Cell)(((_n & 0x4000) ? symbols : xts)+(_n&~0x4000UL)));})
99: #else
100: # define CFA(n) ((Cell)(symbols+((n)&~0x4000UL)))
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;
111: int die_on_signal=0;
112: #ifndef INCLUDE_IMAGE
113: static int clear_dictionary=0;
114: UCell pagesize=1;
115: char *progname;
116: #else
117: char *progname = "gforth";
118: int optind = 1;
119: #endif
120:
121: #define CODE_BLOCK_SIZE (64*1024)
122: Address code_area=0;
123: Cell code_area_size = CODE_BLOCK_SIZE;
124: Address code_here=NULL+CODE_BLOCK_SIZE; /* does for code-area what HERE
125: does for the dictionary */
126: Address start_flush=0; /* start of unflushed code */
127: Cell last_jump=0; /* if the last prim was compiled without jump, this
128: is it's number, otherwise this contains 0 */
129:
130: static int no_super=0; /* true if compile_prim should not fuse prims */
131: static int no_dynamic=NO_DYNAMIC_DEFAULT; /* if true, no code is generated
132: dynamically */
133:
134: #ifdef HAS_DEBUG
135: int debug=0;
136: #else
137: # define perror(x...)
138: # define fprintf(x...)
139: #endif
140:
141: ImageHeader *gforth_header;
142: Label *vm_prims;
143: #ifdef DOUBLY_INDIRECT
144: Label *xts; /* same content as vm_prims, but should only be used for xts */
145: #endif
146:
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:
154: /* image file format:
155: * "#! binary-path -i\n" (e.g., "#! /usr/local/bin/gforth-0.4.0 -i\n")
156: * padding to a multiple of 8
157: * magic: "Gforth3x" means format 0.6,
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
165: * padding to max alignment (no padding necessary on current machines)
166: * ImageHeader structure (see forth.h)
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)
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
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
183: */
184:
185: static Cell groups[32] = {
186: 0,
187: #undef GROUP
188: #define GROUP(x, n) DOESJUMP+1+n,
189: #include "prim_grp.i"
190: #undef GROUP
191: #define GROUP(x, n)
192: };
193:
194: void relocate(Cell *image, const char *bitstring,
195: int size, Cell base, Label symbols[])
196: {
197: int i=0, j, k, steps=(size/sizeof(Cell))/RELINFOBITS;
198: Cell token;
199: char bits;
200: Cell max_symbols;
201: /*
202: * A virtual start address that's the real start address minus
203: * the one in the image
204: */
205: Cell *start = (Cell * ) (((void *) image) - ((void *) base));
206:
207: /* group index into table */
208:
209: /* printf("relocating to %x[%x] start=%x base=%x\n", image, size, start, base); */
210:
211: for (max_symbols=DOESJUMP+1; symbols[max_symbols]!=0; max_symbols++)
212: ;
213: max_symbols--;
214: size/=sizeof(Cell);
215:
216: for(k=0; k<=steps; k++) {
217: for(j=0, bits=bitstring[k]; j<RELINFOBITS; j++, i++, bits<<=1) {
218: /* fprintf(stderr,"relocate: image[%d]\n", i);*/
219: if((i < size) && (bits & (1U << (RELINFOBITS-1)))) {
220: /* fprintf(stderr,"relocate: image[%d]=%d of %d\n", i, image[i], size/sizeof(Cell)); */
221: token=image[i];
222: if(token<0) {
223: int group = (-token & 0x3E00) >> 9;
224: if(group == 0) {
225: switch(token|0x4000) {
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) :
233: case CF(DOFIELD) : MAKE_CF(image+i,symbols[CF(token)]); break;
234: case CF(DOESJUMP): image[i]=0; break;
235: #endif /* !defined(DOUBLY_INDIRECT) */
236: case CF(DODOES) :
237: MAKE_DOES_CF(image+i,(Xt *)(image[i+1]+((Cell)start)));
238: break;
239: default : /* backward compatibility */
240: /* printf("Code field generation image[%x]:=CFA(%x)\n",
241: i, CF(image[i])); */
242: if (CF((token | 0x4000))<max_symbols) {
243: image[i]=(Cell)CFA(CF(token));
244: #ifdef DIRECT_THREADED
245: if ((token & 0x4000) == 0) /* threade code, no CFA */
246: compile_prim1(&image[i]);
247: #endif
248: } else
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);
250: }
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 {
267: // if base is > 0: 0 is a null reference so don't adjust
268: if (token>=base) {
269: image[i]+=(Cell)start;
270: }
271: }
272: }
273: }
274: }
275: finish_code();
276: ((ImageHeader*)(image))->base = (Address) image;
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:
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:
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:
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
340: #if !defined(MAP_ANON) && defined(MAP_ANONYMOUS)
341: # define MAP_ANON MAP_ANONYMOUS
342: #endif
343:
344: #if defined(HAVE_MMAP)
345: static Address alloc_mmap(Cell size)
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);
352: r = mmap(next_address, size, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_ANON|MAP_PRIVATE, -1, 0);
353: #else /* !defined(MAP_ANON) */
354: /* Ultrix (at least) does not define MAP_FILE and MAP_PRIVATE (both are
355: apparently defaults) */
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) {
361: r = MAP_FAILED;
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) */
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)
383: return r;
384: #endif /* HAVE_MMAP */
385: /* use malloc as fallback */
386: return verbose_malloc(size);
387: }
388:
389: Address dict_alloc_read(FILE *file, Cell imagesize, Cell dictsize, Cell offset)
390: {
391: Address image = MAP_FAILED;
392:
393: #if defined(HAVE_MMAP)
394: if (offset==0) {
395: image=alloc_mmap(dictsize);
396: if (debug)
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);
400: }
401: #endif /* defined(HAVE_MMAP) */
402: if (image == MAP_FAILED) {
403: image = my_alloc(dictsize+offset)+offset;
404: rewind(file); /* fseek(imagefile,0L,SEEK_SET); */
405: fread(image, 1, imagesize, file);
406: }
407: return image;
408: }
409:
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:
443: #warning You can ignore the warnings about clobbered variables in go_forth
444: int go_forth(Address image, int stack, Cell *entries)
445: {
446: volatile ImageHeader *image_header = (ImageHeader *)image;
447: Cell *sp0=(Cell*)(image_header->data_stack_base + dsize);
448: Cell *rp0=(Cell *)(image_header->return_stack_base + rsize);
449: Float *fp0=(Float *)(image_header->fp_stack_base + fsize);
450: #ifdef GFORTH_DEBUGGING
451: volatile Cell *orig_rp0=rp0;
452: #endif
453: Address lp0=image_header->locals_stack_base + lsize;
454: Xt *ip0=(Xt *)(image_header->boot_entry);
455: #ifdef SYSSIGNALS
456: int throw_code;
457: #endif
458:
459: /* ensure that the cached elements (if any) are accessible */
460: IF_spTOS(sp0--);
461: IF_fpTOS(fp0--);
462:
463: for(;stack>0;stack--)
464: *--sp0=entries[stack-1];
465:
466: #ifdef SYSSIGNALS
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];
475:
476: signal_data_stack[7]=throw_code;
477:
478: #ifdef GFORTH_DEBUGGING
479: /* fprintf(stderr,"\nrp=%ld\n",(long)rp); */
480: if (rp <= orig_rp0 && rp > (Cell *)(image_header->return_stack_base+5)) {
481: /* no rstack overflow or underflow */
482: rp0 = rp;
483: *--rp0 = (Cell)saved_ip;
484: }
485: else /* I love non-syntactic ifdefs :-) */
486: #endif
487: rp0 = signal_return_stack+8;
488: /* fprintf(stderr, "rp=$%x\n",rp0);*/
489:
490: return((int)(Cell)engine(image_header->throw_entry, signal_data_stack+7,
491: rp0, signal_fp_stack, 0));
492: }
493: #endif
494:
495: return((int)(Cell)engine(ip0,sp0,rp0,fp0,lp0));
496: }
497:
498: #ifndef INCLUDE_IMAGE
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:
511: #define MAX_IMMARGS 2
512:
513: #ifndef NO_DYNAMIC
514: typedef struct {
515: Label start;
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) */
518: char superend; /* true if primitive ends superinstruction, i.e.,
519: unconditional branch, execute, etc. */
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];
525: } PrimInfo;
526:
527: PrimInfo *priminfos;
528: PrimInfo **decomp_prims;
529:
530: int compare_priminfo_length(const void *_a, const void *_b)
531: {
532: PrimInfo **a = (PrimInfo **)_a;
533: PrimInfo **b = (PrimInfo **)_b;
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;
541: }
542:
543: #endif /* defined(NO_DYNAMIC) */
544: Cell npriminfos=0;
545:
546:
547: void check_prims(Label symbols1[])
548: {
549: int i;
550: #ifndef NO_DYNAMIC
551: Label *symbols2, *symbols3, *ends1;
552: static char superend[]={
553: #include "prim_superend.i"
554: };
555: #endif
556:
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
565: for (i=DOESJUMP+1; symbols1[i+1]!=0; i++)
566: ;
567: npriminfos = i;
568:
569: #ifndef NO_DYNAMIC
570: if (no_dynamic)
571: return;
572: symbols2=engine2(0,0,0,0,0);
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;
579: priminfos = calloc(i,sizeof(PrimInfo));
580: for (i=DOESJUMP+1; symbols1[i+1]!=0; i++) {
581: int prim_len = ends1[i]-symbols1[i];
582: PrimInfo *pi=&priminfos[i];
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;
594: pi->restlength = symbols1[i+1] - symbols1[i] - pi->length;
595: pi->nimmargs = 0;
596: if (debug)
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);
599: assert(prim_len>=0);
600: while (j<(pi->length+pi->restlength)) {
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);
606: /* assert(j<prim_len); */
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);
628: /* assert(j<prim_len);*/
629: break;
630: }
631: j+=4;
632: }
633: }
634: if (debug)
635: fprintf(stderr,"\n");
636: }
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);
642: #endif
643: }
644:
645: void flush_to_here(void)
646: {
647: #ifndef NO_DYNAMIC
648: FLUSH_ICACHE(start_flush, code_here-start_flush);
649: start_flush=code_here;
650: #endif
651: }
652:
653: #ifndef NO_DYNAMIC
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:
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:
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) {
684: struct code_block_list *p;
685: append_jump();
686: flush_to_here();
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: }
698: old_code_here = code_here;
699: next_code_blockp = &(p->next);
700: }
701: memcpy(code_here, pi->start, pi->length);
702: code_here += pi->length;
703: return old_code_here;
704: }
705: #endif
706:
707: int forget_dyncode(Address code)
708: {
709: #ifdef NO_DYNAMIC
710: return -1;
711: #else
712: struct code_block_list *p, **pp;
713:
714: for (pp=&code_block_list, p=*pp; p!=NULL; pp=&(p->next), p=*pp) {
715: if (code >= p->block && code < p->block+p->size) {
716: next_code_blockp = &(p->next);
717: code_here = start_flush = code;
718: code_area = p->block;
719: last_jump = 0;
720: return -1;
721: }
722: }
723: return -no_dynamic;
724: #endif /* !defined(NO_DYNAMIC) */
725: }
726:
727: Label decompile_code(Label _code)
728: {
729: #ifdef NO_DYNAMIC
730: return _code;
731: #else /* !defined(NO_DYNAMIC) */
732: Cell i;
733: struct code_block_list *p;
734: Address code=_code;
735:
736: /* first, check if we are in code at all */
737: for (p = code_block_list;; p = p->next) {
738: if (p == NULL)
739: return code;
740: if (code >= p->block && code < p->block+p->size)
741: break;
742: }
743: /* reverse order because NOOP might match other prims */
744: for (i=npriminfos-1; i>DOESJUMP; i--) {
745: PrimInfo *pi=decomp_prims[i];
746: if (pi->start==code || (pi->start && memcmp(code,pi->start,pi->length)==0))
747: return pi->start;
748: }
749: return code;
750: #endif /* !defined(NO_DYNAMIC) */
751: }
752:
753: #ifdef NO_IP
754: int nbranchinfos=0;
755:
756: struct branchinfo {
757: Label *targetptr; /* *(bi->targetptr) is the target */
758: Cell *addressptr; /* store the target here */
759: } branchinfos[100000];
760:
761: int ndoesexecinfos=0;
762: struct doesexecinfo {
763: int branchinfo; /* fix the targetptr of branchinfos[...->branchinfo] */
764: Cell *xt; /* cfa of word whose does-code needs calling */
765: } doesexecinfos[10000];
766:
767: /* definitions of N_execute etc. */
768: #include "prim_num.i"
769:
770: void set_rel_target(Cell *source, Label target)
771: {
772: *source = ((Cell)target)-(((Cell)source)+4);
773: }
774:
775: void register_branchinfo(Label source, Cell targetptr)
776: {
777: struct branchinfo *bi = &(branchinfos[nbranchinfos]);
778: bi->targetptr = (Label *)targetptr;
779: bi->addressptr = (Cell *)source;
780: nbranchinfos++;
781: }
782:
783: Cell *compile_prim1arg(Cell p)
784: {
785: int l = priminfos[p].length;
786: Address old_code_here=code_here;
787:
788: assert(vm_prims[p]==priminfos[p].start);
789: append_prim(p);
790: return (Cell*)(old_code_here+priminfos[p].immargs[0].offset);
791: }
792:
793: Cell *compile_call2(Cell targetptr)
794: {
795: Cell *next_code_target;
796: PrimInfo *pi = &priminfos[N_call2];
797: Address old_code_here = append_prim(N_call2);
798:
799: next_code_target = (Cell *)(old_code_here + pi->immargs[0].offset);
800: register_branchinfo(old_code_here + pi->immargs[1].offset, targetptr);
801: return next_code_target;
802: }
803: #endif
804:
805: void finish_code(void)
806: {
807: #ifdef NO_IP
808: Cell i;
809:
810: compile_prim1(NULL);
811: for (i=0; i<ndoesexecinfos; i++) {
812: struct doesexecinfo *dei = &doesexecinfos[i];
813: branchinfos[dei->branchinfo].targetptr = DOES_CODE1((dei->xt));
814: }
815: ndoesexecinfos = 0;
816: for (i=0; i<nbranchinfos; i++) {
817: struct branchinfo *bi=&branchinfos[i];
818: set_rel_target(bi->addressptr, *(bi->targetptr));
819: }
820: nbranchinfos = 0;
821: #endif
822: flush_to_here();
823: }
824:
825: void compile_prim1(Cell *start)
826: {
827: #if defined(DOUBLY_INDIRECT)
828: Label prim=(Label)*start;
829: if (prim<((Label)(xts+DOESJUMP)) || prim>((Label)(xts+npriminfos))) {
830: fprintf(stderr,"compile_prim encountered xt %p\n", prim);
831: *start=(Cell)prim;
832: return;
833: } else {
834: *start = (Cell)(prim-((Label)xts)+((Label)vm_prims));
835: return;
836: }
837: #elif defined(NO_IP)
838: static Cell *last_start=NULL;
839: static Xt last_prim=NULL;
840: /* delay work by one call in order to get relocated immargs */
841:
842: if (last_start) {
843: unsigned i = last_prim-vm_prims;
844: PrimInfo *pi=&priminfos[i];
845: Cell *next_code_target=NULL;
846:
847: assert(i<npriminfos);
848: if (i==N_execute||i==N_perform||i==N_lit_perform) {
849: next_code_target = compile_prim1arg(N_set_next_code);
850: }
851: if (i==N_call) {
852: next_code_target = compile_call2(last_start[1]);
853: } else if (i==N_does_exec) {
854: struct doesexecinfo *dei = &doesexecinfos[ndoesexecinfos++];
855: *compile_prim1arg(N_lit) = (Cell)PFA(last_start[1]);
856: /* we cannot determine the callee now (last_start[1] may be a
857: forward reference), so just register an arbitrary target, and
858: register in dei that we need to fix this before resolving
859: branches */
860: dei->branchinfo = nbranchinfos;
861: dei->xt = (Cell *)(last_start[1]);
862: next_code_target = compile_call2(NULL);
863: } else if (pi->start == NULL) { /* non-reloc */
864: next_code_target = compile_prim1arg(N_set_next_code);
865: set_rel_target(compile_prim1arg(N_abranch),*(Xt)last_prim);
866: } else {
867: unsigned j;
868: Address old_code_here = append_prim(i);
869:
870: for (j=0; j<pi->nimmargs; j++) {
871: struct immarg *ia = &(pi->immargs[j]);
872: Cell argval = last_start[pi->nimmargs - j]; /* !! specific to prims */
873: if (ia->rel) { /* !! assumption: relative refs are branches */
874: register_branchinfo(old_code_here + ia->offset, argval);
875: } else /* plain argument */
876: *(Cell *)(old_code_here + ia->offset) = argval;
877: }
878: }
879: if (next_code_target!=NULL)
880: *next_code_target = (Cell)code_here;
881: }
882: if (start) {
883: last_prim = (Xt)*start;
884: *start = (Cell)code_here;
885: }
886: last_start = start;
887: return;
888: #elif !defined(NO_DYNAMIC)
889: Label prim=(Label)*start;
890: unsigned i;
891: Address old_code_here;
892:
893: i = ((Xt)prim)-vm_prims;
894: prim = *(Xt)prim;
895: if (no_dynamic) {
896: *start = (Cell)prim;
897: return;
898: }
899: if (i>=npriminfos || priminfos[i].start == 0) { /* not a relocatable prim */
900: append_jump();
901: *start = (Cell)prim;
902: return;
903: }
904: assert(priminfos[i].start = prim);
905: #ifdef ALIGN_CODE
906: /* ALIGN_CODE;*/
907: #endif
908: assert(prim==priminfos[i].start);
909: old_code_here = append_prim(i);
910: last_jump = (priminfos[i].superend) ? 0 : i;
911: *start = (Cell)old_code_here;
912: return;
913: #else /* !defined(DOUBLY_INDIRECT), no code replication */
914: Label prim=(Label)*start;
915: #if !defined(INDIRECT_THREADED)
916: prim = *(Xt)prim;
917: #endif
918: *start = (Cell)prim;
919: return;
920: #endif /* !defined(DOUBLY_INDIRECT) */
921: }
922:
923: Label compile_prim(Label prim)
924: {
925: Cell x=(Cell)prim;
926: assert(0);
927: compile_prim1(&x);
928: return (Label)x;
929: }
930:
931: #if defined(PRINT_SUPER_LENGTHS) && !defined(NO_DYNAMIC)
932: Cell prim_length(Cell prim)
933: {
934: return priminfos[prim+DOESJUMP+1].length;
935: }
936: #endif
937:
938: Address loader(FILE *imagefile, char* filename)
939: /* returns the address of the image proper (after the preamble) */
940: {
941: ImageHeader header;
942: Address image;
943: Address imp; /* image+preamble */
944: Char magic[8];
945: char magic7; /* size byte of magic number */
946: Cell preamblesize=0;
947: Cell data_offset = offset_image ? 56*sizeof(Cell) : 0;
948: UCell check_sum;
949: Cell ausize = ((RELINFOBITS == 8) ? 0 :
950: (RELINFOBITS == 16) ? 1 :
951: (RELINFOBITS == 32) ? 2 : 3);
952: Cell charsize = ((sizeof(Char) == 1) ? 0 :
953: (sizeof(Char) == 2) ? 1 :
954: (sizeof(Char) == 4) ? 2 : 3) + ausize;
955: Cell cellsize = ((sizeof(Cell) == 1) ? 0 :
956: (sizeof(Cell) == 2) ? 1 :
957: (sizeof(Cell) == 4) ? 2 : 3) + ausize;
958: Cell sizebyte = (ausize << 5) + (charsize << 3) + (cellsize << 1) +
959: #ifdef WORDS_BIGENDIAN
960: 0
961: #else
962: 1
963: #endif
964: ;
965:
966: vm_prims = engine(0,0,0,0,0);
967: check_prims(vm_prims);
968: #ifndef DOUBLY_INDIRECT
969: #ifdef PRINT_SUPER_LENGTHS
970: print_super_lengths();
971: #endif
972: check_sum = checksum(vm_prims);
973: #else /* defined(DOUBLY_INDIRECT) */
974: check_sum = (UCell)vm_prims;
975: #endif /* defined(DOUBLY_INDIRECT) */
976:
977: do {
978: if(fread(magic,sizeof(Char),8,imagefile) < 8) {
979: fprintf(stderr,"%s: image %s doesn't seem to be a Gforth (>=0.6) image.\n",
980: progname, filename);
981: exit(1);
982: }
983: preamblesize+=8;
984: } while(memcmp(magic,"Gforth3",7));
985: magic7 = magic[7];
986: if (debug) {
987: magic[7]='\0';
988: fprintf(stderr,"Magic found: %s ", magic);
989: print_sizes(magic7);
990: }
991:
992: if (magic7 != sizebyte)
993: {
994: fprintf(stderr,"This image is: ");
995: print_sizes(magic7);
996: fprintf(stderr,"whereas the machine is ");
997: print_sizes(sizebyte);
998: exit(-2);
999: };
1000:
1001: fread((void *)&header,sizeof(ImageHeader),1,imagefile);
1002:
1003: set_stack_sizes(&header);
1004:
1005: #if HAVE_GETPAGESIZE
1006: pagesize=getpagesize(); /* Linux/GNU libc offers this */
1007: #elif HAVE_SYSCONF && defined(_SC_PAGESIZE)
1008: pagesize=sysconf(_SC_PAGESIZE); /* POSIX.4 */
1009: #elif PAGESIZE
1010: pagesize=PAGESIZE; /* in limits.h according to Gallmeister's POSIX.4 book */
1011: #endif
1012: if (debug)
1013: fprintf(stderr,"pagesize=%ld\n",(unsigned long) pagesize);
1014:
1015: image = dict_alloc_read(imagefile, preamblesize+header.image_size,
1016: preamblesize+dictsize, data_offset);
1017: imp=image+preamblesize;
1018: alloc_stacks((ImageHeader *)imp);
1019: if (clear_dictionary)
1020: memset(imp+header.image_size, 0, dictsize-header.image_size);
1021: if(header.base==0 || header.base == (Address)0x100) {
1022: Cell reloc_size=((header.image_size-1)/sizeof(Cell))/8+1;
1023: char reloc_bits[reloc_size];
1024: fseek(imagefile, preamblesize+header.image_size, SEEK_SET);
1025: fread(reloc_bits, 1, reloc_size, imagefile);
1026: relocate((Cell *)imp, reloc_bits, header.image_size, (Cell)header.base, vm_prims);
1027: #if 0
1028: { /* let's see what the relocator did */
1029: FILE *snapshot=fopen("snapshot.fi","wb");
1030: fwrite(image,1,imagesize,snapshot);
1031: fclose(snapshot);
1032: }
1033: #endif
1034: }
1035: else if(header.base!=imp) {
1036: fprintf(stderr,"%s: Cannot load nonrelocatable image (compiled for address $%lx) at address $%lx\n",
1037: progname, (unsigned long)header.base, (unsigned long)imp);
1038: exit(1);
1039: }
1040: if (header.checksum==0)
1041: ((ImageHeader *)imp)->checksum=check_sum;
1042: else if (header.checksum != check_sum) {
1043: fprintf(stderr,"%s: Checksum of image ($%lx) does not match the executable ($%lx)\n",
1044: progname, (unsigned long)(header.checksum),(unsigned long)check_sum);
1045: exit(1);
1046: }
1047: #ifdef DOUBLY_INDIRECT
1048: ((ImageHeader *)imp)->xt_base = xts;
1049: #endif
1050: fclose(imagefile);
1051:
1052: /* unnecessary, except maybe for CODE words */
1053: /* FLUSH_ICACHE(imp, header.image_size);*/
1054:
1055: return imp;
1056: }
1057:
1058: /* pointer to last '/' or '\' in file, 0 if there is none. */
1059: char *onlypath(char *filename)
1060: {
1061: return strrchr(filename, DIRSEP);
1062: }
1063:
1064: FILE *openimage(char *fullfilename)
1065: {
1066: FILE *image_file;
1067: char * expfilename = tilde_cstr(fullfilename, strlen(fullfilename), 1);
1068:
1069: image_file=fopen(expfilename,"rb");
1070: if (image_file!=NULL && debug)
1071: fprintf(stderr, "Opened image file: %s\n", expfilename);
1072: return image_file;
1073: }
1074:
1075: /* try to open image file concat(path[0:len],imagename) */
1076: FILE *checkimage(char *path, int len, char *imagename)
1077: {
1078: int dirlen=len;
1079: char fullfilename[dirlen+strlen(imagename)+2];
1080:
1081: memcpy(fullfilename, path, dirlen);
1082: if (fullfilename[dirlen-1]!=DIRSEP)
1083: fullfilename[dirlen++]=DIRSEP;
1084: strcpy(fullfilename+dirlen,imagename);
1085: return openimage(fullfilename);
1086: }
1087:
1088: FILE * open_image_file(char * imagename, char * path)
1089: {
1090: FILE * image_file=NULL;
1091: char *origpath=path;
1092:
1093: if(strchr(imagename, DIRSEP)==NULL) {
1094: /* first check the directory where the exe file is in !! 01may97jaw */
1095: if (onlypath(progname))
1096: image_file=checkimage(progname, onlypath(progname)-progname, imagename);
1097: if (!image_file)
1098: do {
1099: char *pend=strchr(path, PATHSEP);
1100: if (pend==NULL)
1101: pend=path+strlen(path);
1102: if (strlen(path)==0) break;
1103: image_file=checkimage(path, pend-path, imagename);
1104: path=pend+(*pend==PATHSEP);
1105: } while (image_file==NULL);
1106: } else {
1107: image_file=openimage(imagename);
1108: }
1109:
1110: if (!image_file) {
1111: fprintf(stderr,"%s: cannot open image file %s in path %s for reading\n",
1112: progname, imagename, origpath);
1113: exit(1);
1114: }
1115:
1116: return image_file;
1117: }
1118: #endif
1119:
1120: #ifdef HAS_OS
1121: UCell convsize(char *s, UCell elemsize)
1122: /* converts s of the format [0-9]+[bekMGT]? (e.g. 25k) into the number
1123: of bytes. the letter at the end indicates the unit, where e stands
1124: for the element size. default is e */
1125: {
1126: char *endp;
1127: UCell n,m;
1128:
1129: m = elemsize;
1130: n = strtoul(s,&endp,0);
1131: if (endp!=NULL) {
1132: if (strcmp(endp,"b")==0)
1133: m=1;
1134: else if (strcmp(endp,"k")==0)
1135: m=1024;
1136: else if (strcmp(endp,"M")==0)
1137: m=1024*1024;
1138: else if (strcmp(endp,"G")==0)
1139: m=1024*1024*1024;
1140: else if (strcmp(endp,"T")==0) {
1141: #if (SIZEOF_CHAR_P > 4)
1142: m=1024L*1024*1024*1024;
1143: #else
1144: fprintf(stderr,"%s: size specification \"%s\" too large for this machine\n", progname, endp);
1145: exit(1);
1146: #endif
1147: } else if (strcmp(endp,"e")!=0 && strcmp(endp,"")!=0) {
1148: fprintf(stderr,"%s: cannot grok size specification %s: invalid unit \"%s\"\n", progname, s, endp);
1149: exit(1);
1150: }
1151: }
1152: return n*m;
1153: }
1154:
1155: void gforth_args(int argc, char ** argv, char ** path, char ** imagename)
1156: {
1157: int c;
1158:
1159: opterr=0;
1160: while (1) {
1161: int option_index=0;
1162: static struct option opts[] = {
1163: {"appl-image", required_argument, NULL, 'a'},
1164: {"image-file", required_argument, NULL, 'i'},
1165: {"dictionary-size", required_argument, NULL, 'm'},
1166: {"data-stack-size", required_argument, NULL, 'd'},
1167: {"return-stack-size", required_argument, NULL, 'r'},
1168: {"fp-stack-size", required_argument, NULL, 'f'},
1169: {"locals-stack-size", required_argument, NULL, 'l'},
1170: {"path", required_argument, NULL, 'p'},
1171: {"version", no_argument, NULL, 'v'},
1172: {"help", no_argument, NULL, 'h'},
1173: /* put something != 0 into offset_image */
1174: {"offset-image", no_argument, &offset_image, 1},
1175: {"no-offset-im", no_argument, &offset_image, 0},
1176: {"clear-dictionary", no_argument, &clear_dictionary, 1},
1177: {"die-on-signal", no_argument, &die_on_signal, 1},
1178: {"debug", no_argument, &debug, 1},
1179: {"no-super", no_argument, &no_super, 1},
1180: {"no-dynamic", no_argument, &no_dynamic, 1},
1181: {"dynamic", no_argument, &no_dynamic, 0},
1182: {0,0,0,0}
1183: /* no-init-file, no-rc? */
1184: };
1185:
1186: c = getopt_long(argc, argv, "+i:m:d:r:f:l:p:vhoncsx", opts, &option_index);
1187:
1188: switch (c) {
1189: case EOF: return;
1190: case '?': optind--; return;
1191: case 'a': *imagename = optarg; return;
1192: case 'i': *imagename = optarg; break;
1193: case 'm': dictsize = convsize(optarg,sizeof(Cell)); break;
1194: case 'd': dsize = convsize(optarg,sizeof(Cell)); break;
1195: case 'r': rsize = convsize(optarg,sizeof(Cell)); break;
1196: case 'f': fsize = convsize(optarg,sizeof(Float)); break;
1197: case 'l': lsize = convsize(optarg,sizeof(Cell)); break;
1198: case 'p': *path = optarg; break;
1199: case 'o': offset_image = 1; break;
1200: case 'n': offset_image = 0; break;
1201: case 'c': clear_dictionary = 1; break;
1202: case 's': die_on_signal = 1; break;
1203: case 'x': debug = 1; break;
1204: case 'v': fputs(PACKAGE_STRING"\n", stderr); exit(0);
1205: case 'h':
1206: fprintf(stderr, "Usage: %s [engine options] ['--'] [image arguments]\n\
1207: Engine Options:\n\
1208: --appl-image FILE equivalent to '--image-file=FILE --'\n\
1209: --clear-dictionary Initialize the dictionary with 0 bytes\n\
1210: -d SIZE, --data-stack-size=SIZE Specify data stack size\n\
1211: --debug Print debugging information during startup\n\
1212: --die-on-signal exit instead of CATCHing some signals\n\
1213: --dynamic use dynamic native code\n\
1214: -f SIZE, --fp-stack-size=SIZE Specify floating point stack size\n\
1215: -h, --help Print this message and exit\n\
1216: -i FILE, --image-file=FILE Use image FILE instead of `gforth.fi'\n\
1217: -l SIZE, --locals-stack-size=SIZE Specify locals stack size\n\
1218: -m SIZE, --dictionary-size=SIZE Specify Forth dictionary size\n\
1219: --no-dynamic Use only statically compiled primitives\n\
1220: --no-offset-im Load image at normal position\n\
1221: --no-super No dynamically formed superinstructions\n\
1222: --offset-image Load image at a different position\n\
1223: -p PATH, --path=PATH Search path for finding image and sources\n\
1224: -r SIZE, --return-stack-size=SIZE Specify return stack size\n\
1225: -v, --version Print engine version and exit\n\
1226: SIZE arguments consist of an integer followed by a unit. The unit can be\n\
1227: `b' (byte), `e' (element; default), `k' (KB), `M' (MB), `G' (GB) or `T' (TB).\n",
1228: argv[0]);
1229: optind--;
1230: return;
1231: }
1232: }
1233: }
1234: #endif
1235:
1236: #ifdef INCLUDE_IMAGE
1237: extern Cell image[];
1238: extern const char reloc_bits[];
1239: #endif
1240:
1241: int main(int argc, char **argv, char **env)
1242: {
1243: #ifdef HAS_OS
1244: char *path = getenv("GFORTHPATH") ? : DEFAULTPATH;
1245: #else
1246: char *path = DEFAULTPATH;
1247: #endif
1248: #ifndef INCLUDE_IMAGE
1249: char *imagename="gforth.fi";
1250: FILE *image_file;
1251: Address image;
1252: #endif
1253: int retvalue;
1254:
1255: #if defined(i386) && defined(ALIGNMENT_CHECK)
1256: /* turn on alignment checks on the 486.
1257: * on the 386 this should have no effect. */
1258: __asm__("pushfl; popl %eax; orl $0x40000, %eax; pushl %eax; popfl;");
1259: /* this is unusable with Linux' libc.4.6.27, because this library is
1260: not alignment-clean; we would have to replace some library
1261: functions (e.g., memcpy) to make it work. Also GCC doesn't try to keep
1262: the stack FP-aligned. */
1263: #endif
1264:
1265: /* buffering of the user output device */
1266: #ifdef _IONBF
1267: if (isatty(fileno(stdout))) {
1268: fflush(stdout);
1269: setvbuf(stdout,NULL,_IONBF,0);
1270: }
1271: #endif
1272:
1273: progname = argv[0];
1274:
1275: #ifdef HAS_OS
1276: gforth_args(argc, argv, &path, &imagename);
1277: #endif
1278:
1279: #ifdef INCLUDE_IMAGE
1280: set_stack_sizes((ImageHeader *)image);
1281: if(((ImageHeader *)image)->base != image)
1282: relocate(image, reloc_bits, ((ImageHeader *)image)->image_size,
1283: (Label*)engine(0, 0, 0, 0, 0));
1284: alloc_stacks((ImageHeader *)image);
1285: #else
1286: image_file = open_image_file(imagename, path);
1287: image = loader(image_file, imagename);
1288: #endif
1289: gforth_header=(ImageHeader *)image; /* used in SIGSEGV handler */
1290:
1291: {
1292: char path2[strlen(path)+1];
1293: char *p1, *p2;
1294: Cell environ[]= {
1295: (Cell)argc-(optind-1),
1296: (Cell)(argv+(optind-1)),
1297: (Cell)strlen(path),
1298: (Cell)path2};
1299: argv[optind-1] = progname;
1300: /*
1301: for (i=0; i<environ[0]; i++)
1302: printf("%s\n", ((char **)(environ[1]))[i]);
1303: */
1304: /* make path OS-independent by replacing path separators with NUL */
1305: for (p1=path, p2=path2; *p1!='\0'; p1++, p2++)
1306: if (*p1==PATHSEP)
1307: *p2 = '\0';
1308: else
1309: *p2 = *p1;
1310: *p2='\0';
1311: retvalue = go_forth(image, 4, environ);
1312: #ifdef VM_PROFILING
1313: vm_print_profile(stderr);
1314: #endif
1315: deprep_terminal();
1316: }
1317: return retvalue;
1318: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to main.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [gforth] / gforth / engine