Annotation of gforth/engine/engine.c, revision 1.26
1.1 anton 1: /* Gforth virtual machine (aka inner interpreter)
2:
1.22 anton 3: Copyright (C) 1995,1996,1997,1998,2000 Free Software Foundation, Inc.
1.1 anton 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
1.23 anton 19: Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
1.1 anton 20: */
21:
22: #include "config.h"
23: #include <ctype.h>
24: #include <stdio.h>
25: #include <string.h>
26: #include <math.h>
1.4 pazsan 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
1.1 anton 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>
1.17 pazsan 41: #include <dirent.h>
1.21 anton 42: #include <sys/resource.h>
1.19 anton 43: #ifdef HAVE_FNMATCH_H
1.18 anton 44: #include <fnmatch.h>
1.19 anton 45: #else
46: #include "fnmatch.h"
47: #endif
1.4 pazsan 48: #else
49: #include "systypes.h"
50: #endif
1.1 anton 51:
52: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) /* what else? */
53: #include <dlfcn.h>
54: #endif
1.8 pazsan 55: #if defined(_WIN32)
56: #include <windows.h>
57: #endif
1.1 anton 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:
1.4 pazsan 69: struct F83Name {
70: struct F83Name *next; /* the link field for old hands */
71: char countetc;
72: char name[0];
73: };
1.1 anton 74:
75: #define F83NAME_COUNT(np) ((np)->countetc & 0x1f)
1.25 anton 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))
1.1 anton 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:
1.14 pazsan 95: #ifdef MEMCMP_AS_SUBROUTINE
96: extern int gforth_memcmp(const char * s1, const char * s2, size_t n);
1.15 anton 97: #define memcmp(s1,s2,n) gforth_memcmp(s1,s2,n)
1.14 pazsan 98: #endif
99:
1.9 pazsan 100: #ifdef HAS_FILE
1.1 anton 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: ;
1.13 anton 152: if (i==2 && from[1]=='+') /* deal with "~+", i.e., the wd */
153: return cstr(from+3, size<3?0:size-3,clear);
1.1 anton 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: }
1.9 pazsan 176: #endif
1.21 anton 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: }
1.1 anton 190:
191: #define NEWLINE '\n'
192:
193: #ifndef HAVE_RINT
194: #define rint(x) floor((x)+0.5)
195: #endif
196:
1.9 pazsan 197: #ifdef HAS_FILE
1.16 anton 198: static char* fileattr[6]={"rb","rb","r+b","r+b","wb","wb"};
1.1 anton 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]= {
1.16 anton 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 };
1.9 pazsan 211: #endif
1.1 anton 212:
1.26 ! anton 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:
1.1 anton 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 */
1.12 anton 282: #ifndef GETCFA
1.1 anton 283: #define DOCFA
284: #else
285: #define DOCFA Xt cfa; GETCFA(cfa)
286: #endif
287:
1.10 anton 288: #ifdef GFORTH_DEBUGGING
289: /* define some VM registers as global variables, so they survive exceptions;
290: global register variables are not up to the task (according to the
291: GNU C manual) */
292: Xt *ip;
293: Cell *rp;
294: #endif
295:
1.1 anton 296: Label *engine(Xt *ip0, Cell *sp0, Cell *rp0, Float *fp0, Address lp0)
297: /* executes code at ip, if ip!=NULL
298: returns array of machine code labels (for use in a loader), if ip==NULL
299: */
300: {
1.10 anton 301: #ifndef GFORTH_DEBUGGING
302: register Xt *ip IPREG;
303: register Cell *rp RPREG;
304: #endif
1.1 anton 305: register Cell *sp SPREG = sp0;
306: register Float *fp FPREG = fp0;
307: register Address lp LPREG = lp0;
308: #ifdef CFA_NEXT
309: register Xt cfa CFAREG;
310: #endif
1.11 anton 311: #ifdef MORE_VARS
312: MORE_VARS
313: #endif
1.1 anton 314: register Address up UPREG = UP;
1.24 anton 315: IF_spTOS(register Cell spTOS TOSREG;)
316: IF_fpTOS(register Float fpTOS FTOSREG;)
1.1 anton 317: #if defined(DOUBLY_INDIRECT)
318: static Label *symbols;
319: static void *routines[]= {
320: #else /* !defined(DOUBLY_INDIRECT) */
321: static Label symbols[]= {
322: #endif /* !defined(DOUBLY_INDIRECT) */
1.4 pazsan 323: (Label)&&docol,
324: (Label)&&docon,
325: (Label)&&dovar,
326: (Label)&&douser,
327: (Label)&&dodefer,
328: (Label)&&dofield,
329: (Label)&&dodoes,
1.1 anton 330: /* the following entry is normally unused;
331: it's there because its index indicates a does-handler */
1.7 pazsan 332: CPU_DEP1,
1.1 anton 333: #include "prim_lab.i"
1.4 pazsan 334: (Label)0
1.1 anton 335: };
336: #ifdef CPU_DEP2
337: CPU_DEP2
338: #endif
339:
1.10 anton 340: ip = ip0;
341: rp = rp0;
1.1 anton 342: #ifdef DEBUG
343: fprintf(stderr,"ip=%x, sp=%x, rp=%x, fp=%x, lp=%x, up=%x\n",
344: (unsigned)ip,(unsigned)sp,(unsigned)rp,
345: (unsigned)fp,(unsigned)lp,(unsigned)up);
346: #endif
347:
348: if (ip == NULL) {
349: #if defined(DOUBLY_INDIRECT)
1.3 anton 350: #define MAX_SYMBOLS (sizeof(routines)/sizeof(routines[0]))
351: #define CODE_OFFSET (22*sizeof(Cell))
1.1 anton 352: int i;
1.3 anton 353: Cell code_offset = offset_image? CODE_OFFSET : 0;
1.7 pazsan 354:
1.3 anton 355: symbols = (Label *)(malloc(MAX_SYMBOLS*sizeof(Cell)+CODE_OFFSET)+code_offset);
1.1 anton 356: for (i=0; i<DOESJUMP+1; i++)
1.7 pazsan 357: symbols[i] = (Label)routines[i];
1.1 anton 358: for (; routines[i]!=0; i++) {
359: if (i>=MAX_SYMBOLS) {
360: fprintf(stderr,"gforth-ditc: more than %d primitives\n",MAX_SYMBOLS);
361: exit(1);
1.20 anton 362: }
363: symbols[i] = &routines[i];
1.1 anton 364: }
1.20 anton 365: #endif /* defined(DOUBLY_INDIRECT) */
366: return symbols;
1.7 pazsan 367: }
1.1 anton 368:
1.24 anton 369: IF_spTOS(spTOS = sp[0]);
370: IF_fpTOS(fpTOS = fp[0]);
1.7 pazsan 371: /* prep_terminal(); */
1.11 anton 372: SET_IP(ip);
1.1 anton 373: NEXT;
374:
1.11 anton 375:
1.1 anton 376: #ifdef CPU_DEP3
377: CPU_DEP3
378: #endif
379:
380: docol:
381: {
382: DOCFA;
383: #ifdef DEBUG
384: fprintf(stderr,"%08lx: col: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
385: #endif
386: #ifdef CISC_NEXT
387: /* this is the simple version */
388: *--rp = (Cell)ip;
1.11 anton 389: SET_IP((Xt *)PFA1(cfa));
1.1 anton 390: NEXT;
391: #else
1.11 anton 392: /* this one is important, so we help the compiler optimizing */
1.1 anton 393: {
394: DEF_CA
1.11 anton 395: rp[-1] = (Cell)ip;
396: SET_IP((Xt *)PFA1(cfa));
397: NEXT_P1;
398: rp--;
399: NEXT_P2;
1.1 anton 400: }
401: #endif
402: }
403:
404: docon:
405: {
406: DOCFA;
407: #ifdef DEBUG
408: fprintf(stderr,"%08lx: con: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
409: #endif
410: #ifdef USE_TOS
1.24 anton 411: *sp-- = spTOS;
412: spTOS = *(Cell *)PFA1(cfa);
1.1 anton 413: #else
414: *--sp = *(Cell *)PFA1(cfa);
415: #endif
416: }
417: NEXT_P0;
418: NEXT;
419:
420: dovar:
421: {
422: DOCFA;
423: #ifdef DEBUG
424: fprintf(stderr,"%08lx: var: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
425: #endif
426: #ifdef USE_TOS
1.24 anton 427: *sp-- = spTOS;
428: spTOS = (Cell)PFA1(cfa);
1.1 anton 429: #else
430: *--sp = (Cell)PFA1(cfa);
431: #endif
432: }
433: NEXT_P0;
434: NEXT;
435:
436: douser:
437: {
438: DOCFA;
439: #ifdef DEBUG
440: fprintf(stderr,"%08lx: user: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
441: #endif
442: #ifdef USE_TOS
1.24 anton 443: *sp-- = spTOS;
444: spTOS = (Cell)(up+*(Cell*)PFA1(cfa));
1.1 anton 445: #else
446: *--sp = (Cell)(up+*(Cell*)PFA1(cfa));
447: #endif
448: }
449: NEXT_P0;
450: NEXT;
451:
452: dodefer:
453: {
454: DOCFA;
455: #ifdef DEBUG
456: fprintf(stderr,"%08lx: defer: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
457: #endif
458: EXEC(*(Xt *)PFA1(cfa));
459: }
460:
461: dofield:
462: {
463: DOCFA;
464: #ifdef DEBUG
465: fprintf(stderr,"%08lx: field: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
466: #endif
1.24 anton 467: spTOS += *(Cell*)PFA1(cfa);
1.1 anton 468: }
469: NEXT_P0;
470: NEXT;
471:
472: dodoes:
473: /* this assumes the following structure:
474: defining-word:
475:
476: ...
477: DOES>
478: (possible padding)
479: possibly handler: jmp dodoes
480: (possible branch delay slot(s))
481: Forth code after DOES>
482:
483: defined word:
484:
485: cfa: address of or jump to handler OR
486: address of or jump to dodoes, address of DOES-code
487: pfa:
488:
489: */
490: {
491: DOCFA;
492:
493: /* fprintf(stderr, "Got CFA %08lx at doescode %08lx/%08lx: does: %08lx\n",cfa,(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));*/
494: #ifdef DEBUG
495: fprintf(stderr,"%08lx/%08lx: does: %08lx\n",(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));
496: fflush(stderr);
497: #endif
498: *--rp = (Cell)ip;
499: /* PFA1 might collide with DOES_CODE1 here, so we use PFA */
500: #ifdef USE_TOS
1.24 anton 501: *sp-- = spTOS;
502: spTOS = (Cell)PFA(cfa);
1.1 anton 503: #else
504: *--sp = (Cell)PFA(cfa);
505: #endif
1.11 anton 506: SET_IP(DOES_CODE1(cfa));
1.24 anton 507: /* fprintf(stderr,"TOS = %08lx, IP=%08lx\n", spTOS, IP);*/
1.1 anton 508: }
509: NEXT;
510:
511: #include "prim.i"
512: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>