Annotation of gforth/engine/engine.c, revision 1.37
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:
1.36 pazsan 22: undefine(`symbols')
23:
1.1 anton 24: #include "config.h"
1.31 pazsan 25: #include "forth.h"
1.1 anton 26: #include <ctype.h>
27: #include <stdio.h>
28: #include <string.h>
29: #include <math.h>
1.4 pazsan 30: #include <assert.h>
31: #include <stdlib.h>
32: #include <errno.h>
33: #include "io.h"
34: #include "threaded.h"
35: #ifndef STANDALONE
1.1 anton 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>
1.17 pazsan 43: #include <dirent.h>
1.21 anton 44: #include <sys/resource.h>
1.19 anton 45: #ifdef HAVE_FNMATCH_H
1.18 anton 46: #include <fnmatch.h>
1.19 anton 47: #else
48: #include "fnmatch.h"
49: #endif
1.4 pazsan 50: #else
51: #include "systypes.h"
52: #endif
1.1 anton 53:
54: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) /* what else? */
55: #include <dlfcn.h>
56: #endif
1.8 pazsan 57: #if defined(_WIN32)
58: #include <windows.h>
59: #endif
1.1 anton 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:
1.4 pazsan 71: struct F83Name {
72: struct F83Name *next; /* the link field for old hands */
73: char countetc;
74: char name[0];
75: };
1.1 anton 76:
77: #define F83NAME_COUNT(np) ((np)->countetc & 0x1f)
1.25 anton 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))
1.1 anton 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:
1.14 pazsan 97: #ifdef MEMCMP_AS_SUBROUTINE
98: extern int gforth_memcmp(const char * s1, const char * s2, size_t n);
1.15 anton 99: #define memcmp(s1,s2,n) gforth_memcmp(s1,s2,n)
1.14 pazsan 100: #endif
101:
1.9 pazsan 102: #ifdef HAS_FILE
1.1 anton 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: ;
1.13 anton 154: if (i==2 && from[1]=='+') /* deal with "~+", i.e., the wd */
155: return cstr(from+3, size<3?0:size-3,clear);
1.1 anton 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: }
1.9 pazsan 178: #endif
1.21 anton 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: }
1.1 anton 192:
193: #define NEWLINE '\n'
194:
195: #ifndef HAVE_RINT
196: #define rint(x) floor((x)+0.5)
197: #endif
198:
1.9 pazsan 199: #ifdef HAS_FILE
1.16 anton 200: static char* fileattr[6]={"rb","rb","r+b","r+b","wb","wb"};
1.32 pazsan 201: static char* pfileattr[6]={"r","r","r+","r+","w","w"};
1.1 anton 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]= {
1.16 anton 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 };
1.9 pazsan 214: #endif
1.1 anton 215:
1.26 anton 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:
1.29 anton 250: #define vm_Cell2Cell(x) (x)
251:
1.1 anton 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: /* declare and compute cfa for certain threading variants */
286: /* warning: this is nonsyntactical; it will not work in place of a statement */
1.12 anton 287: #ifndef GETCFA
1.1 anton 288: #define DOCFA
289: #else
290: #define DOCFA Xt cfa; GETCFA(cfa)
291: #endif
292:
1.28 anton 293: /* instructions containing these must be the last instruction of a
294: super-instruction (e.g., branches, EXECUTE, and other instructions
295: ending the basic block). Instructions containing SET_IP get this
296: automatically, so you usually don't have to write it. If you have
297: to write it, write it after IP points to the next instruction.
298: Used for profiling. Don't write it in a word containing SET_IP, or
299: the following block will be counted twice. */
300: #ifdef VM_PROFILING
301: #define SUPER_END vm_count_block(IP)
302: #else
303: #define SUPER_END
304: #endif
1.35 anton 305: #define SUPER_CONTINUE
1.28 anton 306:
1.10 anton 307: #ifdef GFORTH_DEBUGGING
308: /* define some VM registers as global variables, so they survive exceptions;
309: global register variables are not up to the task (according to the
310: GNU C manual) */
311: Xt *ip;
312: Cell *rp;
313: #endif
314:
1.37 ! pazsan 315: #ifdef DEBUG
! 316: #define CFA_TO_NAME(__cfa) \
! 317: Cell len, i; \
! 318: char * name = __cfa; \
! 319: for(i=0; i<32; i+=sizeof(Cell)) { \
! 320: len = ((Cell*)name)[-1]; \
! 321: if(len < 0) { \
! 322: len &= 0x1F; \
! 323: if((len+sizeof(Cell)) > i) break; \
! 324: } len = 0; \
! 325: name -= sizeof(Cell); \
! 326: }
! 327: #endif
! 328:
1.30 anton 329: Xt *primtable(Label symbols[], Cell size)
330: {
331: #ifdef DIRECT_THREADED
332: return symbols;
333: #else /* !defined(DIRECT_THREADED) */
334: Xt *xts = (Xt *)malloc(size*sizeof(Xt));
335: Cell i;
336:
337: for (i=0; i<size; i++)
338: xts[i] = &symbols[i];
339: return xts;
340: #endif /* !defined(DIRECT_THREADED) */
341: }
342:
1.34 anton 343:
344: define(enginerest,
345: `(Xt *ip0, Cell *sp0, Cell *rp0, Float *fp0, Address lp0)
1.1 anton 346: /* executes code at ip, if ip!=NULL
347: returns array of machine code labels (for use in a loader), if ip==NULL
348: */
349: {
1.10 anton 350: #ifndef GFORTH_DEBUGGING
351: register Xt *ip IPREG;
352: register Cell *rp RPREG;
353: #endif
1.1 anton 354: register Cell *sp SPREG = sp0;
355: register Float *fp FPREG = fp0;
356: register Address lp LPREG = lp0;
357: #ifdef CFA_NEXT
358: register Xt cfa CFAREG;
359: #endif
1.11 anton 360: #ifdef MORE_VARS
361: MORE_VARS
362: #endif
1.1 anton 363: register Address up UPREG = UP;
1.24 anton 364: IF_spTOS(register Cell spTOS TOSREG;)
365: IF_fpTOS(register Float fpTOS FTOSREG;)
1.1 anton 366: #if defined(DOUBLY_INDIRECT)
367: static Label *symbols;
368: static void *routines[]= {
1.27 anton 369: #define MAX_SYMBOLS (sizeof(routines)/sizeof(routines[0]))
1.1 anton 370: #else /* !defined(DOUBLY_INDIRECT) */
371: static Label symbols[]= {
1.27 anton 372: #define MAX_SYMBOLS (sizeof(symbols)/sizeof(symbols[0]))
1.1 anton 373: #endif /* !defined(DOUBLY_INDIRECT) */
1.4 pazsan 374: (Label)&&docol,
375: (Label)&&docon,
376: (Label)&&dovar,
377: (Label)&&douser,
378: (Label)&&dodefer,
379: (Label)&&dofield,
380: (Label)&&dodoes,
1.1 anton 381: /* the following entry is normally unused;
1.34 anton 382: it is there because its index indicates a does-handler */
1.7 pazsan 383: CPU_DEP1,
1.34 anton 384: #define INST_ADDR(name) (Label)&&I_##name
385: #include "prim_lab.i"
386: #undef INST_ADDR
387: (Label)&&after_last,
388: (Label)0,
389: #ifdef IN_ENGINE2
390: #define INST_ADDR(name) (Label)&&J_##name
1.1 anton 391: #include "prim_lab.i"
1.34 anton 392: #undef INST_ADDR
393: #endif
1.1 anton 394: };
395: #ifdef CPU_DEP2
396: CPU_DEP2
397: #endif
398:
1.10 anton 399: ip = ip0;
400: rp = rp0;
1.1 anton 401: #ifdef DEBUG
402: fprintf(stderr,"ip=%x, sp=%x, rp=%x, fp=%x, lp=%x, up=%x\n",
403: (unsigned)ip,(unsigned)sp,(unsigned)rp,
404: (unsigned)fp,(unsigned)lp,(unsigned)up);
405: #endif
406:
407: if (ip == NULL) {
408: #if defined(DOUBLY_INDIRECT)
1.3 anton 409: #define CODE_OFFSET (22*sizeof(Cell))
1.1 anton 410: int i;
1.3 anton 411: Cell code_offset = offset_image? CODE_OFFSET : 0;
1.7 pazsan 412:
1.3 anton 413: symbols = (Label *)(malloc(MAX_SYMBOLS*sizeof(Cell)+CODE_OFFSET)+code_offset);
1.1 anton 414: for (i=0; i<DOESJUMP+1; i++)
1.7 pazsan 415: symbols[i] = (Label)routines[i];
1.1 anton 416: for (; routines[i]!=0; i++) {
417: if (i>=MAX_SYMBOLS) {
418: fprintf(stderr,"gforth-ditc: more than %d primitives\n",MAX_SYMBOLS);
419: exit(1);
1.20 anton 420: }
421: symbols[i] = &routines[i];
1.1 anton 422: }
1.20 anton 423: #endif /* defined(DOUBLY_INDIRECT) */
424: return symbols;
1.7 pazsan 425: }
1.1 anton 426:
1.24 anton 427: IF_spTOS(spTOS = sp[0]);
428: IF_fpTOS(fpTOS = fp[0]);
1.7 pazsan 429: /* prep_terminal(); */
1.11 anton 430: SET_IP(ip);
1.28 anton 431: SUPER_END; /* count the first block, too */
1.1 anton 432: NEXT;
433:
1.11 anton 434:
1.1 anton 435: #ifdef CPU_DEP3
436: CPU_DEP3
437: #endif
438:
439: docol:
440: {
441: DOCFA;
442: #ifdef DEBUG
1.37 ! pazsan 443: {
! 444: CFA_TO_NAME(cfa);
! 445: fprintf(stderr,"%08lx: col: %08lx %.*s\n",(Cell)ip,(Cell)PFA1(cfa),
! 446: len,name);
! 447: }
1.1 anton 448: #endif
449: #ifdef CISC_NEXT
450: /* this is the simple version */
451: *--rp = (Cell)ip;
1.11 anton 452: SET_IP((Xt *)PFA1(cfa));
1.28 anton 453: SUPER_END;
1.1 anton 454: NEXT;
455: #else
1.11 anton 456: /* this one is important, so we help the compiler optimizing */
1.1 anton 457: {
458: DEF_CA
1.11 anton 459: rp[-1] = (Cell)ip;
460: SET_IP((Xt *)PFA1(cfa));
1.28 anton 461: SUPER_END;
1.11 anton 462: NEXT_P1;
463: rp--;
464: NEXT_P2;
1.1 anton 465: }
466: #endif
467: }
468:
469: docon:
470: {
471: DOCFA;
472: #ifdef DEBUG
473: fprintf(stderr,"%08lx: con: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
474: #endif
475: #ifdef USE_TOS
1.24 anton 476: *sp-- = spTOS;
477: spTOS = *(Cell *)PFA1(cfa);
1.1 anton 478: #else
479: *--sp = *(Cell *)PFA1(cfa);
480: #endif
481: }
482: NEXT_P0;
483: NEXT;
484:
485: dovar:
486: {
487: DOCFA;
488: #ifdef DEBUG
489: fprintf(stderr,"%08lx: var: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
490: #endif
491: #ifdef USE_TOS
1.24 anton 492: *sp-- = spTOS;
493: spTOS = (Cell)PFA1(cfa);
1.1 anton 494: #else
495: *--sp = (Cell)PFA1(cfa);
496: #endif
497: }
498: NEXT_P0;
499: NEXT;
500:
501: douser:
502: {
503: DOCFA;
504: #ifdef DEBUG
505: fprintf(stderr,"%08lx: user: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
506: #endif
507: #ifdef USE_TOS
1.24 anton 508: *sp-- = spTOS;
509: spTOS = (Cell)(up+*(Cell*)PFA1(cfa));
1.1 anton 510: #else
511: *--sp = (Cell)(up+*(Cell*)PFA1(cfa));
512: #endif
513: }
514: NEXT_P0;
515: NEXT;
516:
517: dodefer:
518: {
519: DOCFA;
520: #ifdef DEBUG
521: fprintf(stderr,"%08lx: defer: %08lx\n",(Cell)ip,*(Cell*)PFA1(cfa));
522: #endif
1.28 anton 523: SUPER_END;
1.1 anton 524: EXEC(*(Xt *)PFA1(cfa));
525: }
526:
527: dofield:
528: {
529: DOCFA;
530: #ifdef DEBUG
531: fprintf(stderr,"%08lx: field: %08lx\n",(Cell)ip,(Cell)PFA1(cfa));
532: #endif
1.24 anton 533: spTOS += *(Cell*)PFA1(cfa);
1.1 anton 534: }
535: NEXT_P0;
536: NEXT;
537:
538: dodoes:
539: /* this assumes the following structure:
540: defining-word:
541:
542: ...
543: DOES>
544: (possible padding)
545: possibly handler: jmp dodoes
546: (possible branch delay slot(s))
547: Forth code after DOES>
548:
549: defined word:
550:
551: cfa: address of or jump to handler OR
552: address of or jump to dodoes, address of DOES-code
553: pfa:
554:
555: */
556: {
557: DOCFA;
558:
559: /* fprintf(stderr, "Got CFA %08lx at doescode %08lx/%08lx: does: %08lx\n",cfa,(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));*/
560: #ifdef DEBUG
561: fprintf(stderr,"%08lx/%08lx: does: %08lx\n",(Cell)ip,(Cell)PFA(cfa),(Cell)DOES_CODE1(cfa));
562: fflush(stderr);
563: #endif
564: *--rp = (Cell)ip;
565: /* PFA1 might collide with DOES_CODE1 here, so we use PFA */
566: #ifdef USE_TOS
1.24 anton 567: *sp-- = spTOS;
568: spTOS = (Cell)PFA(cfa);
1.1 anton 569: #else
570: *--sp = (Cell)PFA(cfa);
571: #endif
1.11 anton 572: SET_IP(DOES_CODE1(cfa));
1.28 anton 573: SUPER_END;
1.24 anton 574: /* fprintf(stderr,"TOS = %08lx, IP=%08lx\n", spTOS, IP);*/
1.1 anton 575: }
576: NEXT;
577:
1.34 anton 578: #ifndef IN_ENGINE2
1.33 anton 579: #define LABEL(name) I_##name
1.34 anton 580: #else
581: #define LABEL(name) J_##name: asm(".skip 16"); I_##name
582: #endif
1.1 anton 583: #include "prim.i"
1.34 anton 584: #undef LABEL
585: after_last: return (Label *)0;
586: /*needed only to get the length of the last primitive */
587: }'
588: )
589:
590: Label *engine enginerest
591:
592: #define IN_ENGINE2
593: Label *engine2 enginerest
594:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>