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