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: /* if machine.h has not defined explicit registers, define them as implicit */
248: #ifndef IPREG
249: #define IPREG
250: #endif
251: #ifndef SPREG
252: #define SPREG
253: #endif
254: #ifndef RPREG
255: #define RPREG
256: #endif
257: #ifndef FPREG
258: #define FPREG
259: #endif
260: #ifndef LPREG
261: #define LPREG
262: #endif
263: #ifndef CFAREG
264: #define CFAREG
265: #endif
266: #ifndef UPREG
267: #define UPREG
268: #endif
269: #ifndef TOSREG
270: #define TOSREG
271: #endif
272: #ifndef FTOSREG
273: #define FTOSREG
274: #endif
275:
276: #ifndef CPU_DEP1
277: # define CPU_DEP1 0
278: #endif
279:
280: /* declare and compute cfa for certain threading variants */
281: /* warning: this is nonsyntactical; it will not work in place of a statement */
282: #ifndef GETCFA
283: #define DOCFA
284: #else
285: #define DOCFA Xt cfa; GETCFA(cfa)
286: #endif
287:
288: /* instructions containing these must be the last instruction of a
289: super-instruction (e.g., branches, EXECUTE, and other instructions
290: ending the basic block). Instructions containing SET_IP get this
291: automatically, so you usually don't have to write it. If you have
292: to write it, write it after IP points to the next instruction.
293: Used for profiling. Don't write it in a word containing SET_IP, or
294: the following block will be counted twice. */
295: #ifdef VM_PROFILING
296: #define SUPER_END vm_count_block(IP)
297: #else
298: #define SUPER_END
299: #endif
300:
301: #ifdef GFORTH_DEBUGGING
302: /* define some VM registers as global variables, so they survive exceptions;
303: global register variables are not up to the task (according to the
304: GNU C manual) */
305: Xt *ip;
306: Cell *rp;
307: #endif
308:
309: Label *engine(Xt *ip0, Cell *sp0, Cell *rp0, Float *fp0, Address lp0)
310: /* executes code at ip, if ip!=NULL
311: returns array of machine code labels (for use in a loader), if ip==NULL
312: */
313: {
314: #ifndef GFORTH_DEBUGGING
315: register Xt *ip IPREG;
316: register Cell *rp RPREG;
317: #endif
318: register Cell *sp SPREG = sp0;
319: register Float *fp FPREG = fp0;
320: register Address lp LPREG = lp0;
321: #ifdef CFA_NEXT
322: register Xt cfa CFAREG;
323: #endif
324: #ifdef MORE_VARS
325: MORE_VARS
326: #endif
327: register Address up UPREG = UP;
328: IF_spTOS(register Cell spTOS TOSREG;)
329: IF_fpTOS(register Float fpTOS FTOSREG;)
330: #if defined(DOUBLY_INDIRECT)
331: static Label *symbols;
332: static void *routines[]= {
333: #define MAX_SYMBOLS (sizeof(routines)/sizeof(routines[0]))
334: #else /* !defined(DOUBLY_INDIRECT) */
335: static Label symbols[]= {
336: #define MAX_SYMBOLS (sizeof(symbols)/sizeof(symbols[0]))
337: #endif /* !defined(DOUBLY_INDIRECT) */
338: (Label)&&docol,
339: (Label)&&docon,
340: (Label)&&dovar,
341: (Label)&&douser,
342: (Label)&&dodefer,
343: (Label)&&dofield,
344: (Label)&&dodoes,
345: /* the following entry is normally unused;
346: it's there because its index indicates a does-handler */
347: CPU_DEP1,
348: #include "prim_lab.i"
349: (Label)0
350: };
351: #ifdef CPU_DEP2
352: CPU_DEP2
353: #endif
354:
355: ip = ip0;
356: rp = rp0;
357: #ifdef DEBUG
358: fprintf(stderr,"ip=%x, sp=%x, rp=%x, fp=%x, lp=%x, up=%x\n",
359: (unsigned)ip,(unsigned)sp,(unsigned)rp,
360: (unsigned)fp,(unsigned)lp,(unsigned)up);
361: #endif
362:
363: if (ip == NULL) {
364: #if defined(DOUBLY_INDIRECT)
365: #define CODE_OFFSET (22*sizeof(Cell))
366: int i;
367: Cell code_offset = offset_image? CODE_OFFSET : 0;
368:
369: symbols = (Label *)(malloc(MAX_SYMBOLS*sizeof(Cell)+CODE_OFFSET)+code_offset);
370: for (i=0; i<DOESJUMP+1; i++)
371: symbols[i] = (Label)routines[i];
372: for (; routines[i]!=0; i++) {
373: if (i>=MAX_SYMBOLS) {
374: fprintf(stderr,"gforth-ditc: more than %d primitives\n",MAX_SYMBOLS);
375: exit(1);
376: }
377: symbols[i] = &routines[i];
378: }
379: #endif /* defined(DOUBLY_INDIRECT) */
380: return symbols;
381: }
382:
383: IF_spTOS(spTOS = sp[0]);
384: IF_fpTOS(fpTOS = fp[0]);
385: /* prep_terminal(); */
386: SET_IP(ip);
387: SUPER_END; /* count the first block, too */
388: NEXT;
389:
390:
391: #ifdef CPU_DEP3
392: CPU_DEP3
393: #endif
394:
395: docol:
396: {
397: DOCFA;
398: #ifdef DEBUG
399: fprintf(stderr,"%08lx: col: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
400: #endif
401: #ifdef CISC_NEXT
402: /* this is the simple version */
403: *--rp = (Cell)ip;
404: SET_IP((Xt *)PFA1(cfa));
405: SUPER_END;
406: NEXT;
407: #else
408: /* this one is important, so we help the compiler optimizing */
409: {
410: DEF_CA
411: rp[-1] = (Cell)ip;
412: SET_IP((Xt *)PFA1(cfa));
413: SUPER_END;
414: NEXT_P1;
415: rp--;
416: NEXT_P2;
417: }
418: #endif
419: }
420:
421: docon:
422: {
423: DOCFA;
424: #ifdef DEBUG
425: fprintf(stderr,"%08lx: con: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
426: #endif
427: #ifdef USE_TOS
428: *sp-- = spTOS;
429: spTOS = *(Cell *)PFA1(cfa);
430: #else
431: *--sp = *(Cell *)PFA1(cfa);
432: #endif
433: }
434: NEXT_P0;
435: NEXT;
436:
437: dovar:
438: {
439: DOCFA;
440: #ifdef DEBUG
441: fprintf(stderr,"%08lx: var: %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: douser:
454: {
455: DOCFA;
456: #ifdef DEBUG
457: fprintf(stderr,"%08lx: user: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
458: #endif
459: #ifdef USE_TOS
460: *sp-- = spTOS;
461: spTOS = (Cell)(up+*(Cell*)PFA1(cfa));
462: #else
463: *--sp = (Cell)(up+*(Cell*)PFA1(cfa));
464: #endif
465: }
466: NEXT_P0;
467: NEXT;
468:
469: dodefer:
470: {
471: DOCFA;
472: #ifdef DEBUG
473: fprintf(stderr,"%08lx: defer: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
474: #endif
475: SUPER_END;
476: EXEC(*(Xt *)PFA1(cfa));
477: }
478:
479: dofield:
480: {
481: DOCFA;
482: #ifdef DEBUG
483: fprintf(stderr,"%08lx: field: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
484: #endif
485: spTOS += *(Cell*)PFA1(cfa);
486: }
487: NEXT_P0;
488: NEXT;
489:
490: dodoes:
491: /* this assumes the following structure:
492: defining-word:
493:
494: ...
495: DOES>
496: (possible padding)
497: possibly handler: jmp dodoes
498: (possible branch delay slot(s))
499: Forth code after DOES>
500:
501: defined word:
502:
503: cfa: address of or jump to handler OR
504: address of or jump to dodoes, address of DOES-code
505: pfa:
506:
507: */
508: {
509: DOCFA;
510:
511: /* fprintf(stderr, "Got CFA %08lx at doescode %08lx/%08lx: does: %08lx\n",cfa,(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));*/
512: #ifdef DEBUG
513: fprintf(stderr,"%08lx/%08lx: does: %08lx\n",(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));
514: fflush(stderr);
515: #endif
516: *--rp = (Cell)ip;
517: /* PFA1 might collide with DOES_CODE1 here, so we use PFA */
518: #ifdef USE_TOS
519: *sp-- = spTOS;
520: spTOS = (Cell)PFA(cfa);
521: #else
522: *--sp = (Cell)PFA(cfa);
523: #endif
524: SET_IP(DOES_CODE1(cfa));
525: SUPER_END;
526: /* fprintf(stderr,"TOS = %08lx, IP=%08lx\n", spTOS, IP);*/
527: }
528: NEXT;
529:
530: #include "prim.i"
531: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>