1: /* common header file
2:
3: Copyright (C) 1995,1996,1997,1998,2000,2003,2004,2005,2006,2007,2008 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 3
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, see http://www.gnu.org/licenses/.
19: */
20:
21: #include "config.h"
22: #include "128bit.h"
23: #include <stdio.h>
24: #include <sys/time.h>
25: #include <unistd.h>
26: #ifndef STANDALONE
27: #if defined(HAVE_LIBLTDL)
28: #include <ltdl.h>
29: #endif
30: #endif
31:
32: #if !defined(FORCE_LL) && !defined(BUGGY_LONG_LONG)
33: #define BUGGY_LONG_LONG
34: #endif
35:
36: #if defined(DOUBLY_INDIRECT)||defined(INDIRECT_THREADED)||defined(VM_PROFILING)
37: #define NO_DYNAMIC
38: #endif
39:
40: #if defined(DOUBLY_INDIRECT)
41: # undef DIRECT_THREADED
42: # undef INDIRECT_THREADED
43: # define INDIRECT_THREADED
44: #endif
45:
46: #if defined(GFORTH_DEBUGGING) || defined(INDIRECT_THREADED) || defined(DOUBLY_INDIRECT) || defined(VM_PROFILING)
47: # undef USE_TOS
48: # undef USE_FTOS
49: # undef USE_NO_TOS
50: # undef USE_NO_FTOS
51: # define USE_NO_TOS
52: # define USE_NO_FTOS
53:
54: #define PRIM_I "prim.i"
55: #define PRIM_LAB_I "prim_lab.i"
56: #define PRIM_NAMES_I "prim_names.i"
57: #define PRIM_SUPEREND_I "prim_superend.i"
58: #define PRIM_NUM_I "prim_num.i"
59: #define PRIM_GRP_I "prim_grp.i"
60: #define COSTS_I "costs.i"
61: #define SUPER2_I "super2.i"
62: /* #define PROFILE_I "profile.i" */
63:
64: #else
65: /* gforth-fast or gforth-native */
66: # undef USE_TOS
67: # undef USE_FTOS
68: # undef USE_NO_TOS
69: # undef USE_NO_FTOS
70: # define USE_TOS
71:
72: #define PRIM_I "prim-fast.i"
73: #define PRIM_LAB_I "prim_lab-fast.i"
74: #define PRIM_NAMES_I "prim_names-fast.i"
75: #define PRIM_SUPEREND_I "prim_superend-fast.i"
76: #define PRIM_NUM_I "prim_num-fast.i"
77: #define PRIM_GRP_I "prim_grp-fast.i"
78: #define COSTS_I "costs-fast.i"
79: #define SUPER2_I "super2-fast.i"
80: /* profile.c uses profile.i but does not define VM_PROFILING */
81: /* #define PROFILE_I "profile-fast.i" */
82:
83: #endif
84:
85:
86:
87: #include <limits.h>
88:
89: #if defined(NeXT)
90: # include <libc.h>
91: #endif /* NeXT */
92:
93: /* symbol indexed constants */
94:
95: #define DOCOL 0
96: #define DOCON 1
97: #define DOVAR 2
98: #define DOUSER 3
99: #define DODEFER 4
100: #define DOFIELD 5
101: #define DOVAL 6
102: #define DODOES 7
103: #define DOESJUMP 8
104:
105: /* the size of the DOESJUMP, which resides between DOES> and the does-code */
106: #define DOES_HANDLER_SIZE (2*sizeof(Cell))
107:
108: #include "machine.h"
109:
110: /* C interface data types */
111:
112: typedef WYDE_TYPE Wyde;
113: typedef TETRABYTE_TYPE Tetrabyte;
114: typedef unsigned WYDE_TYPE UWyde;
115: typedef unsigned TETRABYTE_TYPE UTetrabyte;
116:
117: /* Forth data types */
118: /* Cell and UCell must be the same size as a pointer */
119: #define CELL_BITS (sizeof(Cell) * CHAR_BIT)
120: #define CELL_MIN (((Cell)1)<<(sizeof(Cell)*CHAR_BIT-1))
121:
122: #define HALFCELL_BITS (CELL_BITS/2)
123: #define HALFCELL_MASK ((~(UCell)0)>>HALFCELL_BITS)
124: #define UH(x) (((UCell)(x))>>HALFCELL_BITS)
125: #define LH(x) ((x)&HALFCELL_MASK)
126: #define L2U(x) (((UCell)(x))<<HALFCELL_BITS)
127: #define HIGHBIT(x) (((UCell)(x))>>(CELL_BITS-1))
128:
129: #define FLAG(b) (-(b))
130: #define FILEIO(error) (FLAG(error) & -37)
131: #define FILEEXIST(error) (FLAG(error) & -38)
132:
133: #define F_TRUE (FLAG(0==0))
134: #define F_FALSE (FLAG(0!=0))
135:
136: /* define this false if you want native division */
137: #ifdef FORCE_CDIV
138: #define FLOORED_DIV 0
139: #else
140: #define FLOORED_DIV ((1%-3)>0)
141: #endif
142:
143: #if defined(BUGGY_LONG_LONG)
144:
145: #define BUGGY_LL_CMP /* compares not possible */
146: #define BUGGY_LL_MUL /* multiplication not possible */
147: #define BUGGY_LL_DIV /* division not possible */
148: #define BUGGY_LL_ADD /* addition not possible */
149: #define BUGGY_LL_SHIFT /* shift not possible */
150: #define BUGGY_LL_D2F /* to float not possible */
151: #define BUGGY_LL_F2D /* from float not possible */
152: #define BUGGY_LL_SIZE /* long long "too short", so we use something else */
153:
154: typedef struct {
155: Cell hi;
156: UCell lo;
157: } DCell;
158:
159: typedef struct {
160: UCell hi;
161: UCell lo;
162: } UDCell;
163:
164: #define DHI(x) (x).hi
165: #define DLO(x) (x).lo
166: #define DHI_IS(x,y) (x).hi=(y)
167: #define DLO_IS(x,y) (x).lo=(y)
168:
169: #define UD2D(ud) ({UDCell _ud=(ud); (DCell){_ud.hi,_ud.lo};})
170: #define D2UD(d) ({DCell _d1=(d); (UDCell){_d1.hi,_d1.lo};})
171:
172: /* shifts by less than CELL_BITS */
173: #define DLSHIFT(d,u) ({DCell _d=(d); UCell _u=(u); \
174: (DCell){(_d.hi<<_u)|(_d.lo>>(CELL_BITS-_u)),_d.lo<<_u};})
175: #define UDLSHIFT(ud,u) D2UD(DLSHIFT(UD2D(ud),u))
176:
177: #if SMALL_OFF_T
178: #define OFF2UD(o) ({UDCell _ud; _ud.hi=0; _ud.lo=(Cell)(o); _ud;})
179: #define UD2OFF(ud) ((ud).lo)
180: #else /* !SMALL_OFF_T */
181: #define OFF2UD(o) ({UDCell _ud; off_t _o=(o); _ud.hi=_o>>CELL_BITS; _ud.lo=(Cell)_o; _ud;})
182: #define UD2OFF(ud) ({UDCell _ud=(ud); (((off_t)_ud.hi)<<CELL_BITS)+_ud.lo;})
183: #endif /* !SMALL_OFF_T */
184: #define DZERO ((DCell){0,0})
185:
186: #else /* !defined(BUGGY_LONG_LONG) */
187:
188: /* DCell and UDCell must be twice as large as Cell */
189: typedef DOUBLE_CELL_TYPE DCell;
190: typedef DOUBLE_UCELL_TYPE UDCell;
191:
192: #define DHI(x) ({ Double_Store _d; _d.d=(x); _d.cells.high; })
193: #define DLO(x) ({ Double_Store _d; _d.d=(x); _d.cells.low; })
194:
195: /* beware with the assignment: x is referenced twice! */
196: #define DHI_IS(x,y) ({ Double_Store _d; _d.d=(x); _d.cells.high=(y); (x)=_d.d; })
197: #define DLO_IS(x,y) ({ Double_Store _d; _d.d=(x); _d.cells.low =(y); (x)=_d.d; })
198:
199: #define UD2D(ud) ((DCell)(ud))
200: #define D2UD(d) ((UDCell)(d))
201: #define OFF2UD(o) ((UDCell)(o))
202: #define UD2OFF(ud) ((off_t)(ud))
203: #define DZERO ((DCell)0)
204: /* shifts by less than CELL_BITS */
205: #define DLSHIFT(d,u) ((d)<<(u))
206: #define UDLSHIFT(d,u) ((d)<<(u))
207:
208: #endif /* !defined(BUGGY_LONG_LONG) */
209:
210: typedef union {
211: struct {
212: #if defined(WORDS_BIGENDIAN)||defined(BUGGY_LONG_LONG)
213: Cell high;
214: UCell low;
215: #else
216: UCell low;
217: Cell high;
218: #endif
219: } cells;
220: DCell d;
221: UDCell ud;
222: } Double_Store;
223:
224: #define FETCH_DCELL_T(d_,lo,hi,t_) ({ \
225: Double_Store _d; \
226: _d.cells.low = (lo); \
227: _d.cells.high = (hi); \
228: (d_) = _d.t_; \
229: })
230:
231: #define STORE_DCELL_T(d_,lo,hi,t_) ({ \
232: Double_Store _d; \
233: _d.t_ = (d_); \
234: (lo) = _d.cells.low; \
235: (hi) = _d.cells.high; \
236: })
237:
238: #define vm_twoCell2d(lo,hi,d_) FETCH_DCELL_T(d_,lo,hi,d);
239: #define vm_twoCell2ud(lo,hi,d_) FETCH_DCELL_T(d_,lo,hi,ud);
240:
241: #define vm_d2twoCell(d_,lo,hi) STORE_DCELL_T(d_,lo,hi,d);
242: #define vm_ud2twoCell(d_,lo,hi) STORE_DCELL_T(d_,lo,hi,ud);
243:
244: typedef Label *Xt;
245:
246: /* PFA gives the parameter field address corresponding to a cfa */
247: #define PFA(cfa) (((Cell *)cfa)+2)
248: /* PFA1 is a special version for use just after a NEXT1 */
249: #define PFA1(cfa) PFA(cfa)
250: /* CODE_ADDRESS is the address of the code jumped to through the code field */
251: #define CODE_ADDRESS(cfa) (*(Xt)(cfa))
252:
253: /* DOES_CODE is the Forth code does jumps to */
254: #if !defined(DOUBLY_INDIRECT)
255: # define DOES_CA (symbols[DODOES])
256: #else /* defined(DOUBLY_INDIRECT) */
257: # define DOES_CA ((Label)&xts[DODOES])
258: #endif /* defined(DOUBLY_INDIRECT) */
259:
260:
261:
262: #define DOES_CODE1(cfa) ((Xt *)(cfa[1]))
263: /* MAKE_CF creates an appropriate code field at the cfa;
264: ca is the code address */
265: #define MAKE_CF(cfa,ca) ((*(Label *)(cfa)) = ((Label)ca))
266: /* make a code field for a defining-word-defined word */
267: #define MAKE_DOES_CF(cfa,does_code) ({MAKE_CF(cfa,DOES_CA); \
268: ((Cell *)cfa)[1] = (Cell)(does_code);})
269:
270: #define CF(const) (-const-2)
271:
272: #define CF_NIL -1
273:
274: #ifndef FLUSH_ICACHE
275: #warning flush-icache probably will not work (see manual)
276: # define FLUSH_ICACHE(addr,size)
277: #warning no FLUSH_ICACHE, turning off dynamic native code by default
278: #undef NO_DYNAMIC_DEFAULT
279: #define NO_DYNAMIC_DEFAULT 1
280: #endif
281:
282: #if defined(GFORTH_DEBUGGING) || defined(INDIRECT_THREADED) || defined(DOUBLY_INDIRECT) || defined(VM_PROFILING)
283: #define STACK_CACHE_DEFAULT 0
284: #else
285: #define STACK_CACHE_DEFAULT STACK_CACHE_DEFAULT_FAST
286: #endif
287:
288: #ifdef USE_FTOS
289: #define IF_fpTOS(x) x
290: #else
291: #define IF_fpTOS(x)
292: #define fpTOS (fp[0])
293: #endif
294:
295: #define IF_rpTOS(x)
296: #define rpTOS (rp[0])
297:
298: typedef struct {
299: Address base; /* base address of image (0 if relocatable) */
300: UCell checksum; /* checksum of ca's to protect against some
301: incompatible binary/executable combinations
302: (0 if relocatable) */
303: UCell image_size; /* all sizes in bytes */
304: UCell dict_size;
305: UCell data_stack_size;
306: UCell fp_stack_size;
307: UCell return_stack_size;
308: UCell locals_stack_size;
309: Xt *boot_entry; /* initial ip for booting (in BOOT) */
310: Xt *throw_entry; /* ip after signal (in THROW) */
311: Cell unused1; /* possibly tib stack size */
312: Label *xt_base; /* base of DOUBLE_INDIRECT xts[], for comp-i.fs */
313: Address data_stack_base; /* this and the following fields are initialized by the loader */
314: Address fp_stack_base;
315: Address return_stack_base;
316: Address locals_stack_base;
317: } ImageHeader;
318: /* the image-header is created in main.fs */
319:
320: #ifdef HAS_F83HEADERSTRING
321: struct F83Name {
322: struct F83Name *next; /* the link field for old hands */
323: char countetc;
324: char name[0];
325: };
326:
327: #define F83NAME_COUNT(np) ((np)->countetc & 0x1f)
328: #endif
329: struct Longname {
330: struct Longname *next; /* the link field for old hands */
331: Cell countetc;
332: char name[0];
333: };
334:
335: #define LONGNAME_COUNT(np) ((np)->countetc & (((~((UCell)0))<<3)>>3))
336:
337: struct Cellpair {
338: Cell n1;
339: Cell n2;
340: };
341:
342: struct Cellquad {
343: Cell n1;
344: Cell n2;
345: Cell n3;
346: Cell n4;
347: };
348:
349: #define IOR(flag) ((flag)? -512-errno : 0)
350:
351: #ifdef GFORTH_DEBUGGING
352: #if defined(GLOBALS_NONRELOC)
353: /* if globals cause non-relocatable primitives, keep saved_ip and rp
354: in a structure and access it through locals */
355: typedef struct saved_regs {
356: Xt *sr_saved_ip;
357: Cell *sr_rp;
358: } saved_regs;
359: extern saved_regs saved_regs_v, *saved_regs_p;
360: #define saved_ip (saved_regs_p->sr_saved_ip)
361: #define rp (saved_regs_p->sr_rp)
362: /* for use in gforth_engine header */
363: #error sr_proto not passed in fflib.fs callbacks (solution: disable GLOBALS_NONRELOC)
364: #define sr_proto , struct saved_regs *saved_regs_p0
365: #define sr_call , saved_regs_p
366: #else /* !defined(GLOBALS_NONRELOC) */
367: extern Xt *saved_ip;
368: extern Cell *rp;
369: #define sr_proto
370: #define sr_call
371: #endif /* !defined(GLOBALS_NONRELOC) */
372: #else /* !defined(GFORTH_DEBUGGING) */
373: #define sr_proto
374: #define sr_call
375: #endif /* !defined(GFORTH_DEBUGGING) */
376:
377: Label *gforth_engine(Xt *ip, Cell *sp, Cell *rp0, Float *fp, Address lp sr_proto);
378: Label *gforth_engine2(Xt *ip, Cell *sp, Cell *rp0, Float *fp, Address lp sr_proto);
379: Label *gforth_engine3(Xt *ip, Cell *sp, Cell *rp0, Float *fp, Address lp sr_proto);
380:
381: /* engine/prim support routines */
382: Address gforth_alloc(Cell size);
383: char *cstr(Char *from, UCell size, int clear);
384: char *tilde_cstr(Char *from, UCell size, int clear);
385: Cell opencreate_file(char *s, Cell wfam, int flags, Cell *wiorp);
386: DCell timeval2us(struct timeval *tvp);
387: void cmove(Char *c_from, Char *c_to, UCell u);
388: void cmove_up(Char *c_from, Char *c_to, UCell u);
389: Cell compare(Char *c_addr1, UCell u1, Char *c_addr2, UCell u2);
390: struct Longname *listlfind(Char *c_addr, UCell u, struct Longname *longname1);
391: struct Longname *hashlfind(Char *c_addr, UCell u, Cell *a_addr);
392: struct Longname *tablelfind(Char *c_addr, UCell u, Cell *a_addr);
393: UCell hashkey1(Char *c_addr, UCell u, UCell ubits);
394: struct Cellpair parse_white(Char *c_addr1, UCell u1);
395: Cell rename_file(Char *c_addr1, UCell u1, Char *c_addr2, UCell u2);
396: struct Cellquad read_line(Char *c_addr, UCell u1, Cell wfileid);
397: struct Cellpair file_status(Char *c_addr, UCell u);
398: Cell to_float(Char *c_addr, UCell u, Float *r_p);
399: Float v_star(Float *f_addr1, Cell nstride1, Float *f_addr2, Cell nstride2, UCell ucount);
400: void faxpy(Float ra, Float *f_x, Cell nstridex, Float *f_y, Cell nstridey, UCell ucount);
401: UCell lshift(UCell u1, UCell n);
402: UCell rshift(UCell u1, UCell n);
403: int gforth_system(Char *c_addr, UCell u);
404: void gforth_ms(UCell u);
405: UCell gforth_dlopen(Char *c_addr, UCell u);
406: Cell capscompare(Char *c_addr1, UCell u1, Char *c_addr2, UCell u2);
407:
408: /* signal handler stuff */
409: void install_signal_handlers(void);
410: void throw(int code);
411: /* throw codes */
412: #define BALL_DIVZERO -10
413: #define BALL_RESULTRANGE -11
414:
415: typedef void Sigfunc(int);
416: Sigfunc *bsd_signal(int signo, Sigfunc *func);
417:
418: /* dblsub routines */
419: DCell dnegate(DCell d1);
420: UDCell ummul (UCell a, UCell b);
421: DCell mmul (Cell a, Cell b);
422: UDCell umdiv (UDCell u, UCell v);
423: DCell smdiv (DCell num, Cell denom);
424: DCell fmdiv (DCell num, Cell denom);
425:
426: Cell memcasecmp(const Char *s1, const Char *s2, Cell n);
427:
428: void vm_print_profile(FILE *file);
429: void vm_count_block(Xt *ip);
430:
431: /* dynamic superinstruction stuff */
432: void compile_prim1(Cell *start);
433: void finish_code(void);
434: int forget_dyncode(Address code);
435: Label decompile_code(Label prim);
436:
437: extern int offset_image;
438: extern int die_on_signal;
439: extern int ignore_async_signals;
440: extern UCell pagesize;
441: extern ImageHeader *gforth_header;
442: extern Label *vm_prims;
443: extern Label *xts;
444: extern Cell npriminfos;
445:
446: #ifdef HAS_DEBUG
447: extern int debug;
448: #else
449: # define debug 0
450: #endif
451:
452: extern Cell *gforth_SP;
453: extern Cell *gforth_RP;
454: extern Address gforth_LP;
455: extern Float *gforth_FP;
456: extern Address gforth_UP;
457: #ifndef HAS_LINKBACK
458: extern void * gforth_pointers[];
459: #endif
460:
461: #ifdef HAS_FFCALL
462: extern Cell *gforth_RP;
463: extern Address gforth_LP;
464: extern void gforth_callback(Xt* fcall, void * alist);
465: #endif
466:
467: #ifdef NO_IP
468: extern Label next_code;
469: #endif
470:
471: #ifdef HAS_FILE
472: extern char* fileattr[6];
473: extern char* pfileattr[6];
474: extern int ufileattr[6];
475: #endif
476:
477: #ifdef PRINT_SUPER_LENGTHS
478: Cell prim_length(Cell prim);
479: void print_super_lengths();
480: #endif
481:
482: /* declare all the functions that are missing */
483: #ifndef HAVE_ATANH
484: extern double atanh(double r1);
485: extern double asinh(double r1);
486: extern double acosh(double r1);
487: #endif
488: #ifndef HAVE_ECVT
489: /* extern char* ecvt(double x, int len, int* exp, int* sign);*/
490: #endif
491: #ifndef HAVE_MEMMOVE
492: /* extern char *memmove(char *dest, const char *src, long n); */
493: #endif
494: #ifndef HAVE_POW10
495: extern double pow10(double x);
496: #endif
497: #ifndef HAVE_STRERROR
498: extern char *strerror(int err);
499: #endif
500: #ifndef HAVE_STRSIGNAL
501: extern char *strsignal(int sig);
502: #endif
503: #ifndef HAVE_STRTOUL
504: extern unsigned long int strtoul(const char *nptr, char **endptr, int base);
505: #endif
506:
507: #define GROUP(x, n)
508: #define GROUPADD(n)
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>