1: /* Gforth virtual machine (aka inner interpreter)
2:
3: Copyright (C) 1995,1996,1997,1998,2000 Free Software Foundation, Inc.
4:
5: This file is part of Gforth.
6:
7: Gforth is free software; you can redistribute it and/or
8: modify it under the terms of the GNU General Public License
9: as published by the Free Software Foundation; either version 2
10: of the License, or (at your option) any later version.
11:
12: This program is distributed in the hope that it will be useful,
13: but WITHOUT ANY WARRANTY; without even the implied warranty of
14: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15: GNU General Public License for more details.
16:
17: You should have received a copy of the GNU General Public License
18: along with this program; if not, write to the Free Software
19: Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
20: */
21:
22: undefine(`symbols')
23:
24: #include "config.h"
25: #include "forth.h"
26: #include <ctype.h>
27: #include <stdio.h>
28: #include <string.h>
29: #include <math.h>
30: #include <assert.h>
31: #include <stdlib.h>
32: #include <errno.h>
33: #include "io.h"
34: #include "threaded.h"
35: #ifndef STANDALONE
36: #include <sys/types.h>
37: #include <sys/stat.h>
38: #include <fcntl.h>
39: #include <time.h>
40: #include <sys/time.h>
41: #include <unistd.h>
42: #include <pwd.h>
43: #include <dirent.h>
44: #include <sys/resource.h>
45: #ifdef HAVE_FNMATCH_H
46: #include <fnmatch.h>
47: #else
48: #include "fnmatch.h"
49: #endif
50: #else
51: #include "systypes.h"
52: #endif
53:
54: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) /* what else? */
55: #include <dlfcn.h>
56: #endif
57: #if defined(_WIN32)
58: #include <windows.h>
59: #endif
60: #ifdef hpux
61: #include <dl.h>
62: #endif
63:
64: #ifndef SEEK_SET
65: /* should be defined in stdio.h, but some systems don't have it */
66: #define SEEK_SET 0
67: #endif
68:
69: #define IOR(flag) ((flag)? -512-errno : 0)
70:
71: struct F83Name {
72: struct F83Name *next; /* the link field for old hands */
73: char countetc;
74: char name[0];
75: };
76:
77: #define F83NAME_COUNT(np) ((np)->countetc & 0x1f)
78:
79: struct Longname {
80: struct Longname *next; /* the link field for old hands */
81: Cell countetc;
82: char name[0];
83: };
84:
85: #define LONGNAME_COUNT(np) ((np)->countetc & (((~((UCell)0))<<3)>>3))
86:
87: Cell *SP;
88: Float *FP;
89: Address UP=NULL;
90:
91: #if 0
92: /* not used currently */
93: int emitcounter;
94: #endif
95: #define NULLC '\0'
96:
97: #ifdef MEMCMP_AS_SUBROUTINE
98: extern int gforth_memcmp(const char * s1, const char * s2, size_t n);
99: #define memcmp(s1,s2,n) gforth_memcmp(s1,s2,n)
100: #endif
101:
102: #ifdef HAS_FILE
103: char *cstr(Char *from, UCell size, int clear)
104: /* return a C-string corresponding to the Forth string ( FROM SIZE ).
105: the C-string lives until the next call of cstr with CLEAR being true */
106: {
107: static struct cstr_buffer {
108: char *buffer;
109: size_t size;
110: } *buffers=NULL;
111: static int nbuffers=0;
112: static int used=0;
113: struct cstr_buffer *b;
114:
115: if (buffers==NULL)
116: buffers=malloc(0);
117: if (clear)
118: used=0;
119: if (used>=nbuffers) {
120: buffers=realloc(buffers,sizeof(struct cstr_buffer)*(used+1));
121: buffers[used]=(struct cstr_buffer){malloc(0),0};
122: nbuffers=used+1;
123: }
124: b=&buffers[used];
125: if (size+1 > b->size) {
126: b->buffer = realloc(b->buffer,size+1);
127: b->size = size+1;
128: }
129: memcpy(b->buffer,from,size);
130: b->buffer[size]='\0';
131: used++;
132: return b->buffer;
133: }
134:
135: char *tilde_cstr(Char *from, UCell size, int clear)
136: /* like cstr(), but perform tilde expansion on the string */
137: {
138: char *s1,*s2;
139: int s1_len, s2_len;
140: struct passwd *getpwnam (), *user_entry;
141:
142: if (size<1 || from[0]!='~')
143: return cstr(from, size, clear);
144: if (size<2 || from[1]=='/') {
145: s1 = (char *)getenv ("HOME");
146: if(s1 == NULL)
147: s1 = "";
148: s2 = from+1;
149: s2_len = size-1;
150: } else {
151: UCell i;
152: for (i=1; i<size && from[i]!='/'; i++)
153: ;
154: if (i==2 && from[1]=='+') /* deal with "~+", i.e., the wd */
155: return cstr(from+3, size<3?0:size-3,clear);
156: {
157: char user[i];
158: memcpy(user,from+1,i-1);
159: user[i-1]='\0';
160: user_entry=getpwnam(user);
161: }
162: if (user_entry==NULL)
163: return cstr(from, size, clear);
164: s1 = user_entry->pw_dir;
165: s2 = from+i;
166: s2_len = size-i;
167: }
168: s1_len = strlen(s1);
169: if (s1_len>1 && s1[s1_len-1]=='/')
170: s1_len--;
171: {
172: char path[s1_len+s2_len];
173: memcpy(path,s1,s1_len);
174: memcpy(path+s1_len,s2,s2_len);
175: return cstr(path,s1_len+s2_len,clear);
176: }
177: }
178: #endif
179:
180: DCell timeval2us(struct timeval *tvp)
181: {
182: #ifndef BUGGY_LONG_LONG
183: return (tvp->tv_sec*(DCell)1000000)+tvp->tv_usec;
184: #else
185: DCell d2;
186: DCell d1=mmul(tvp->tv_sec,1000000);
187: d2.lo = d1.lo+tvp->tv_usec;
188: d2.hi = d1.hi + (d2.lo<d1.lo);
189: return d2;
190: #endif
191: }
192:
193: #define NEWLINE '\n'
194:
195: #ifndef HAVE_RINT
196: #define rint(x) floor((x)+0.5)
197: #endif
198:
199: #ifdef HAS_FILE
200: static char* fileattr[6]={"rb","rb","r+b","r+b","wb","wb"};
201: static char* pfileattr[6]={"r","r","r+","r+","w","w"};
202:
203: #ifndef O_BINARY
204: #define O_BINARY 0
205: #endif
206: #ifndef O_TEXT
207: #define O_TEXT 0
208: #endif
209:
210: static int ufileattr[6]= {
211: O_RDONLY|O_BINARY, O_RDONLY|O_BINARY,
212: O_RDWR |O_BINARY, O_RDWR |O_BINARY,
213: O_WRONLY|O_BINARY, O_WRONLY|O_BINARY };
214: #endif
215:
216: /* conversion on fetch */
217:
218: #define vm_Cell2f(x) ((Bool)(x))
219: #define vm_Cell2c(x) ((Char)(x))
220: #define vm_Cell2n(x) ((Cell)x)
221: #define vm_Cell2w(x) ((Cell)x)
222: #define vm_Cell2u(x) ((UCell)(x))
223: #define vm_Cell2a_(x) ((Cell *)(x))
224: #define vm_Cell2c_(x) ((Char *)(x))
225: #define vm_Cell2f_(x) ((Float *)(x))
226: #define vm_Cell2df_(x) ((DFloat *)(x))
227: #define vm_Cell2sf_(x) ((SFloat *)(x))
228: #define vm_Cell2xt(x) ((Xt)(x))
229: #define vm_Cell2f83name(x) ((struct F83Name *)(x))
230: #define vm_Cell2longname(x) ((struct Longname *)(x))
231: #define vm_Float2r(x) (x)
232:
233: /* conversion on store */
234:
235: #define vm_f2Cell(x) ((Cell)(x))
236: #define vm_c2Cell(x) ((Cell)(x))
237: #define vm_n2Cell(x) ((Cell)(x))
238: #define vm_w2Cell(x) ((Cell)(x))
239: #define vm_u2Cell(x) ((Cell)(x))
240: #define vm_a_2Cell(x) ((Cell)(x))
241: #define vm_c_2Cell(x) ((Cell)(x))
242: #define vm_f_2Cell(x) ((Cell)(x))
243: #define vm_df_2Cell(x) ((Cell)(x))
244: #define vm_sf_2Cell(x) ((Cell)(x))
245: #define vm_xt2Cell(x) ((Cell)(x))
246: #define vm_f83name2Cell(x) ((Cell)(x))
247: #define vm_longname2Cell(x) ((Cell)(x))
248: #define vm_r2Float(x) (x)
249:
250: #define vm_Cell2Cell(x) (x)
251:
252: /* if machine.h has not defined explicit registers, define them as implicit */
253: #ifndef IPREG
254: #define IPREG
255: #endif
256: #ifndef SPREG
257: #define SPREG
258: #endif
259: #ifndef RPREG
260: #define RPREG
261: #endif
262: #ifndef FPREG
263: #define FPREG
264: #endif
265: #ifndef LPREG
266: #define LPREG
267: #endif
268: #ifndef CFAREG
269: #define CFAREG
270: #endif
271: #ifndef UPREG
272: #define UPREG
273: #endif
274: #ifndef TOSREG
275: #define TOSREG
276: #endif
277: #ifndef FTOSREG
278: #define FTOSREG
279: #endif
280:
281: #ifndef CPU_DEP1
282: # define CPU_DEP1 0
283: #endif
284:
285: /* instructions containing these must be the last instruction of a
286: super-instruction (e.g., branches, EXECUTE, and other instructions
287: ending the basic block). Instructions containing SET_IP get this
288: automatically, so you usually don't have to write it. If you have
289: to write it, write it after IP points to the next instruction.
290: Used for profiling. Don't write it in a word containing SET_IP, or
291: the following block will be counted twice. */
292: #ifdef VM_PROFILING
293: #define SUPER_END vm_count_block(IP)
294: #else
295: #define SUPER_END
296: #endif
297: #define SUPER_CONTINUE
298:
299: #ifdef GFORTH_DEBUGGING
300: /* define some VM registers as global variables, so they survive exceptions;
301: global register variables are not up to the task (according to the
302: GNU C manual) */
303: Xt *ip;
304: Cell *rp;
305: #endif
306:
307: #ifdef DEBUG
308: #define CFA_TO_NAME(__cfa) \
309: Cell len, i; \
310: char * name = __cfa; \
311: for(i=0; i<32; i+=sizeof(Cell)) { \
312: len = ((Cell*)name)[-1]; \
313: if(len < 0) { \
314: len &= 0x1F; \
315: if((len+sizeof(Cell)) > i) break; \
316: } len = 0; \
317: name -= sizeof(Cell); \
318: }
319: #endif
320:
321: Xt *primtable(Label symbols[], Cell size)
322: /* used in primitive primtable for peephole optimization */
323: {
324: #ifdef DIRECT_THREADED
325: return symbols;
326: #else /* !defined(DIRECT_THREADED) */
327: Xt *xts = (Xt *)malloc(size*sizeof(Xt));
328: Cell i;
329:
330: for (i=0; i<size; i++)
331: xts[i] = &symbols[i];
332: return xts;
333: #endif /* !defined(DIRECT_THREADED) */
334: }
335:
336:
337: define(enginerest,
338: `(Xt *ip0, Cell *sp0, Cell *rp0, Float *fp0, Address lp0)
339: /* executes code at ip, if ip!=NULL
340: returns array of machine code labels (for use in a loader), if ip==NULL
341: */
342: {
343: #ifndef GFORTH_DEBUGGING
344: register Xt *ip IPREG;
345: register Cell *rp RPREG;
346: #endif
347: register Cell *sp SPREG = sp0;
348: register Float *fp FPREG = fp0;
349: register Address lp LPREG = lp0;
350: register Xt cfa CFAREG;
351: #ifdef MORE_VARS
352: MORE_VARS
353: #endif
354: register Address up UPREG = UP;
355: IF_spTOS(register Cell spTOS TOSREG;)
356: IF_fpTOS(register Float fpTOS FTOSREG;)
357: #if defined(DOUBLY_INDIRECT)
358: static Label *symbols;
359: static void *routines[]= {
360: #define MAX_SYMBOLS (sizeof(routines)/sizeof(routines[0]))
361: #else /* !defined(DOUBLY_INDIRECT) */
362: static Label symbols[]= {
363: #define MAX_SYMBOLS (sizeof(symbols)/sizeof(symbols[0]))
364: #endif /* !defined(DOUBLY_INDIRECT) */
365: (Label)&&docol,
366: (Label)&&docon,
367: (Label)&&dovar,
368: (Label)&&douser,
369: (Label)&&dodefer,
370: (Label)&&dofield,
371: (Label)&&dodoes,
372: /* the following entry is normally unused;
373: it is there because its index indicates a does-handler */
374: CPU_DEP1,
375: #define INST_ADDR(name) (Label)&&I_##name
376: #include "prim_lab.i"
377: #undef INST_ADDR
378: (Label)&&after_last,
379: (Label)0,
380: #ifdef IN_ENGINE2
381: #define INST_ADDR(name) (Label)&&J_##name
382: #include "prim_lab.i"
383: #undef INST_ADDR
384: #endif
385: };
386: #ifdef CPU_DEP2
387: CPU_DEP2
388: #endif
389:
390: ip = ip0;
391: rp = rp0;
392: #ifdef DEBUG
393: fprintf(stderr,"ip=%x, sp=%x, rp=%x, fp=%x, lp=%x, up=%x\n",
394: (unsigned)ip,(unsigned)sp,(unsigned)rp,
395: (unsigned)fp,(unsigned)lp,(unsigned)up);
396: #endif
397:
398: if (ip == NULL) {
399: #if defined(DOUBLY_INDIRECT)
400: #define CODE_OFFSET (26*sizeof(Cell))
401: #define XT_OFFSET (22*sizeof(Cell))
402: int i;
403: Cell code_offset = offset_image? CODE_OFFSET : 0;
404: Cell xt_offset = offset_image? XT_OFFSET : 0;
405:
406: symbols = (Label *)(malloc(MAX_SYMBOLS*sizeof(Cell)+CODE_OFFSET)+code_offset);
407: xts = (Label *)(malloc(MAX_SYMBOLS*sizeof(Cell)+XT_OFFSET)+xt_offset);
408: for (i=0; i<DOESJUMP+1; i++)
409: xts[i] = symbols[i] = (Label)routines[i];
410: for (; routines[i]!=0; i++) {
411: if (i>=MAX_SYMBOLS) {
412: fprintf(stderr,"gforth-ditc: more than %d primitives\n",MAX_SYMBOLS);
413: exit(1);
414: }
415: xts[i] = symbols[i] = &routines[i];
416: }
417: #endif /* defined(DOUBLY_INDIRECT) */
418: return symbols;
419: }
420:
421: IF_spTOS(spTOS = sp[0]);
422: IF_fpTOS(fpTOS = fp[0]);
423: /* prep_terminal(); */
424: SET_IP(ip);
425: SUPER_END; /* count the first block, too */
426: NEXT;
427:
428:
429: #ifdef CPU_DEP3
430: CPU_DEP3
431: #endif
432:
433: docol:
434: {
435: #ifdef DEBUG
436: {
437: CFA_TO_NAME(cfa);
438: fprintf(stderr,"%08lx: col: %08lx %.*s\n",(Cell)ip,(Cell)PFA1(cfa),
439: len,name);
440: }
441: #endif
442: #ifdef CISC_NEXT
443: /* this is the simple version */
444: *--rp = (Cell)ip;
445: SET_IP((Xt *)PFA1(cfa));
446: SUPER_END;
447: NEXT;
448: #else
449: /* this one is important, so we help the compiler optimizing */
450: {
451: DEF_CA
452: rp[-1] = (Cell)ip;
453: SET_IP((Xt *)PFA1(cfa));
454: SUPER_END;
455: NEXT_P1;
456: rp--;
457: NEXT_P2;
458: }
459: #endif
460: }
461:
462: docon:
463: {
464: #ifdef DEBUG
465: fprintf(stderr,"%08lx: con: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
466: #endif
467: #ifdef USE_TOS
468: *sp-- = spTOS;
469: spTOS = *(Cell *)PFA1(cfa);
470: #else
471: *--sp = *(Cell *)PFA1(cfa);
472: #endif
473: }
474: NEXT_P0;
475: NEXT;
476:
477: dovar:
478: {
479: #ifdef DEBUG
480: fprintf(stderr,"%08lx: var: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
481: #endif
482: #ifdef USE_TOS
483: *sp-- = spTOS;
484: spTOS = (Cell)PFA1(cfa);
485: #else
486: *--sp = (Cell)PFA1(cfa);
487: #endif
488: }
489: NEXT_P0;
490: NEXT;
491:
492: douser:
493: {
494: #ifdef DEBUG
495: fprintf(stderr,"%08lx: user: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
496: #endif
497: #ifdef USE_TOS
498: *sp-- = spTOS;
499: spTOS = (Cell)(up+*(Cell*)PFA1(cfa));
500: #else
501: *--sp = (Cell)(up+*(Cell*)PFA1(cfa));
502: #endif
503: }
504: NEXT_P0;
505: NEXT;
506:
507: dodefer:
508: {
509: #ifdef DEBUG
510: fprintf(stderr,"%08lx: defer: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
511: #endif
512: SUPER_END;
513: EXEC(*(Xt *)PFA1(cfa));
514: }
515:
516: dofield:
517: {
518: #ifdef DEBUG
519: fprintf(stderr,"%08lx: field: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
520: #endif
521: spTOS += *(Cell*)PFA1(cfa);
522: }
523: NEXT_P0;
524: NEXT;
525:
526: dodoes:
527: /* this assumes the following structure:
528: defining-word:
529:
530: ...
531: DOES>
532: (possible padding)
533: possibly handler: jmp dodoes
534: (possible branch delay slot(s))
535: Forth code after DOES>
536:
537: defined word:
538:
539: cfa: address of or jump to handler OR
540: address of or jump to dodoes, address of DOES-code
541: pfa:
542:
543: */
544: {
545: /* fprintf(stderr, "Got CFA %08lx at doescode %08lx/%08lx: does: %08lx\n",cfa,(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));*/
546: #ifdef DEBUG
547: fprintf(stderr,"%08lx/%08lx: does: %08lx\n",(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));
548: fflush(stderr);
549: #endif
550: *--rp = (Cell)ip;
551: /* PFA1 might collide with DOES_CODE1 here, so we use PFA */
552: #ifdef USE_TOS
553: *sp-- = spTOS;
554: spTOS = (Cell)PFA(cfa);
555: #else
556: *--sp = (Cell)PFA(cfa);
557: #endif
558: SET_IP(DOES_CODE1(cfa));
559: SUPER_END;
560: /* fprintf(stderr,"TOS = %08lx, IP=%08lx\n", spTOS, IP);*/
561: }
562: NEXT;
563:
564: #ifndef IN_ENGINE2
565: #define LABEL(name) I_##name
566: #else
567: #define LABEL(name) J_##name: asm(".skip 16"); I_##name
568: #endif
569: #include "prim.i"
570: #undef LABEL
571: after_last: return (Label *)0;
572: /*needed only to get the length of the last primitive */
573: }'
574: )
575:
576: Label *engine enginerest
577:
578: #define IN_ENGINE2
579: Label *engine2 enginerest
580:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>