File:  [gforth] / gforth / engine / engine.c
Revision 1.81: download - view: text, annotated - select for diffs
Tue Aug 2 12:00:51 2005 UTC (14 years, 9 months ago) by anton
Branches: MAIN
CVS tags: HEAD
added STACK_CACHE_DEFAULT_FAST configuration variable
fixed some bugs
added some primitive/state combinations
changes to support up to 8 stack cache registers
Worked around an unresolved bug in kernel/toolsext.fs

    1: /* Gforth virtual machine (aka inner interpreter)
    2: 
    3:   Copyright (C) 1995,1996,1997,1998,2000,2003,2004 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: #if defined(GFORTH_DEBUGGING) || defined(INDIRECT_THREADED) || defined(DOUBLY_INDIRECT) || defined(VM_PROFILING)
   23: #define USE_NO_TOS
   24: #else
   25: #define USE_TOS
   26: #endif
   27: #define USE_NO_FTOS
   28: 
   29: #include "config.h"
   30: #include "forth.h"
   31: #include <ctype.h>
   32: #include <stdio.h>
   33: #include <string.h>
   34: #include <math.h>
   35: #include <assert.h>
   36: #include <stdlib.h>
   37: #include <errno.h>
   38: #include "io.h"
   39: #include "threaded.h"
   40: #ifndef STANDALONE
   41: #include <sys/types.h>
   42: #include <sys/stat.h>
   43: #include <fcntl.h>
   44: #include <time.h>
   45: #include <sys/time.h>
   46: #include <unistd.h>
   47: #include <pwd.h>
   48: #include <dirent.h>
   49: #include <sys/resource.h>
   50: #ifdef HAVE_FNMATCH_H
   51: #include <fnmatch.h>
   52: #else
   53: #include "fnmatch.h"
   54: #endif
   55: #else
   56: #include "systypes.h"
   57: #endif
   58: 
   59: #if defined(HAVE_LIBDL) || defined(HAVE_DLOPEN) /* what else? */
   60: #include <dlfcn.h>
   61: #endif
   62: #if defined(_WIN32)
   63: #include <windows.h>
   64: #endif
   65: #ifdef hpux
   66: #include <dl.h>
   67: #endif
   68: 
   69: #ifdef HAS_FFCALL
   70: #include <avcall.h>
   71: #include <callback.h>
   72: #endif
   73: 
   74: #ifndef SEEK_SET
   75: /* should be defined in stdio.h, but some systems don't have it */
   76: #define SEEK_SET 0
   77: #endif
   78: 
   79: #ifndef HAVE_FSEEKO
   80: #define fseeko fseek
   81: #endif
   82: 
   83: #ifndef HAVE_FTELLO
   84: #define ftello ftell
   85: #endif
   86: 
   87: #define NULLC '\0'
   88: 
   89: #ifdef MEMCMP_AS_SUBROUTINE
   90: extern int gforth_memcmp(const char * s1, const char * s2, size_t n);
   91: #define memcmp(s1,s2,n) gforth_memcmp(s1,s2,n)
   92: #endif
   93: 
   94: #define NEWLINE	'\n'
   95: 
   96: /* conversion on fetch */
   97: 
   98: #define vm_Cell2f(_cell,_x)		((_x)=(Bool)(_cell))
   99: #define vm_Cell2c(_cell,_x)		((_x)=(Char)(_cell))
  100: #define vm_Cell2n(_cell,_x)		((_x)=(Cell)(_cell))
  101: #define vm_Cell2w(_cell,_x)		((_x)=(Cell)(_cell))
  102: #define vm_Cell2u(_cell,_x)		((_x)=(UCell)(_cell))
  103: #define vm_Cell2a_(_cell,_x)		((_x)=(Cell *)(_cell))
  104: #define vm_Cell2c_(_cell,_x)		((_x)=(Char *)(_cell))
  105: #define vm_Cell2f_(_cell,_x)		((_x)=(Float *)(_cell))
  106: #define vm_Cell2df_(_cell,_x)		((_x)=(DFloat *)(_cell))
  107: #define vm_Cell2sf_(_cell,_x)		((_x)=(SFloat *)(_cell))
  108: #define vm_Cell2xt(_cell,_x)		((_x)=(Xt)(_cell))
  109: #define vm_Cell2f83name(_cell,_x)	((_x)=(struct F83Name *)(_cell))
  110: #define vm_Cell2longname(_cell,_x)	((_x)=(struct Longname *)(_cell))
  111: #define vm_Float2r(_float,_x)		(_x=_float)
  112: 
  113: /* conversion on store */
  114: 
  115: #define vm_f2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  116: #define vm_c2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  117: #define vm_n2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  118: #define vm_w2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  119: #define vm_u2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  120: #define vm_a_2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  121: #define vm_c_2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  122: #define vm_f_2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  123: #define vm_df_2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  124: #define vm_sf_2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  125: #define vm_xt2Cell(_x,_cell)		((_cell)=(Cell)(_x))
  126: #define vm_f83name2Cell(_x,_cell)	((_cell)=(Cell)(_x))
  127: #define vm_longname2Cell(_x,_cell)	((_cell)=(Cell)(_x))
  128: #define vm_r2Float(_x,_float)		(_float=_x)
  129: 
  130: #define vm_Cell2Cell(_x,_y)		(_y=_x)
  131: 
  132: #ifdef NO_IP
  133: #define IMM_ARG(access,value)		(VARIANT(value))
  134: #else
  135: #define IMM_ARG(access,value)		(access)
  136: #endif
  137: 
  138: /* if machine.h has not defined explicit registers, define them as implicit */
  139: #ifndef IPREG
  140: #define IPREG
  141: #endif
  142: #ifndef SPREG
  143: #define SPREG
  144: #endif
  145: #ifndef RPREG
  146: #define RPREG
  147: #endif
  148: #ifndef FPREG
  149: #define FPREG
  150: #endif
  151: #ifndef LPREG
  152: #define LPREG
  153: #endif
  154: #ifndef CAREG
  155: #define CAREG
  156: #endif
  157: #ifndef CFAREG
  158: #define CFAREG
  159: #endif
  160: #ifndef UPREG
  161: #define UPREG
  162: #endif
  163: #ifndef TOSREG
  164: #define TOSREG
  165: #endif
  166: #ifndef spbREG
  167: #define spbREG
  168: #endif
  169: #ifndef spcREG
  170: #define spcREG
  171: #endif
  172: #ifndef spdREG
  173: #define spdREG
  174: #endif
  175: #ifndef speREG
  176: #define speREG
  177: #endif
  178: #ifndef spfREG
  179: #define spfREG
  180: #endif
  181: #ifndef spgREG
  182: #define spgREG
  183: #endif
  184: #ifndef sphREG
  185: #define sphREG
  186: #endif
  187: #ifndef FTOSREG
  188: #define FTOSREG
  189: #endif
  190: 
  191: #ifndef CPU_DEP1
  192: # define CPU_DEP1 0
  193: #endif
  194: 
  195: /* instructions containing SUPER_END must be the last instruction of a
  196:    super-instruction (e.g., branches, EXECUTE, and other instructions
  197:    ending the basic block). Instructions containing SET_IP get this
  198:    automatically, so you usually don't have to write it.  If you have
  199:    to write it, write it after IP points to the next instruction.
  200:    Used for profiling.  Don't write it in a word containing SET_IP, or
  201:    the following block will be counted twice. */
  202: #ifdef VM_PROFILING
  203: #define SUPER_END  vm_count_block(IP)
  204: #else
  205: #define SUPER_END
  206: #endif
  207: #define SUPER_CONTINUE
  208: 
  209: #ifdef GFORTH_DEBUGGING
  210: #if DEBUG
  211: #define NAME(string) { saved_ip=ip; asm("# "string); fprintf(stderr,"%08lx depth=%3ld: "string"\n",(Cell)ip,sp0+3-sp);}
  212: #else /* !DEBUG */
  213: #define NAME(string) { saved_ip=ip; asm(""); }
  214: /* the asm here is to avoid reordering of following stuff above the
  215:    assignment; this is an old-style asm (no operands), and therefore
  216:    is treated like "asm volatile ..."; i.e., it prevents most
  217:    reorderings across itself.  We want the assignment above first,
  218:    because the stack loads may already cause a stack underflow. */
  219: #endif /* !DEBUG */
  220: #elif DEBUG
  221: #       define  NAME(string)    {Cell __depth=sp0+3-sp; int i; fprintf(stderr,"%08lx depth=%3ld: "string,(Cell)ip,sp0+3-sp); for (i=__depth-1; i>0; i--) fprintf(stderr, " $%lx",sp[i]); fprintf(stderr, " $%lx\n",spTOS); }
  222: #else
  223: #	define	NAME(string) asm("# "string);
  224: #endif
  225: 
  226: #ifdef DEBUG
  227: #define CFA_TO_NAME(__cfa) \
  228:       Cell len, i; \
  229:       char * name = __cfa; \
  230:       for(i=0; i<32; i+=sizeof(Cell)) { \
  231:         len = ((Cell*)name)[-1]; \
  232:         if(len < 0) { \
  233: 	  len &= 0x1F; \
  234:           if((len+sizeof(Cell)) > i) break; \
  235: 	} len = 0; \
  236: 	name -= sizeof(Cell); \
  237:       }
  238: #endif
  239: 
  240: #ifdef HAS_FFCALL
  241: #define SAVE_REGS IF_fpTOS(fp[0]=fpTOS); SP=sp; FP=fp; RP=rp; LP=lp;
  242: #define REST_REGS sp=SP; fp=FP; rp=RP; lp=LP; IF_fpTOS(fpTOS=fp[0]);
  243: #endif
  244: 
  245: #if !defined(ENGINE)
  246: /* normal engine */
  247: #define VARIANT(v)	(v)
  248: #define JUMP(target)	goto I_noop
  249: #define LABEL(name) H_##name: I_##name:
  250: 
  251: #elif ENGINE==2
  252: /* variant with padding between VM instructions for finding out
  253:    cross-inst jumps (for dynamic code) */
  254: #define engine engine2
  255: #define VARIANT(v)	(v)
  256: #define JUMP(target)	goto I_noop
  257: #define LABEL(name) H_##name: SKIP16; I_##name:
  258: #define IN_ENGINE2
  259: 
  260: #elif ENGINE==3
  261: /* variant with different immediate arguments for finding out
  262:    immediate arguments (for native code) */
  263: #define engine engine3
  264: #define VARIANT(v)	((v)^0xffffffff)
  265: #define JUMP(target)	goto K_lit
  266: #define LABEL(name) H_##name: I_##name:
  267: #else
  268: #error illegal ENGINE value
  269: #endif /* ENGINE */
  270: 
  271: /* the asm(""); is there to get a stop compiled on Itanium */
  272: #define LABEL2(name) K_##name: asm("");
  273: #define LABEL3(name) J_##name: asm("");
  274: 
  275: Label *engine(Xt *ip0, Cell *sp0, Cell *rp0, Float *fp0, Address lp0)
  276: /* executes code at ip, if ip!=NULL
  277:    returns array of machine code labels (for use in a loader), if ip==NULL
  278: */
  279: {
  280: #ifndef GFORTH_DEBUGGING
  281:   register Cell *rp RPREG;
  282: #endif
  283: #ifndef NO_IP
  284:   register Xt *ip IPREG = ip0;
  285: #endif
  286:   register Cell *sp SPREG = sp0;
  287:   register Float *fp FPREG = fp0;
  288:   register Address lp LPREG = lp0;
  289:   register Xt cfa CFAREG;
  290:   register Label real_ca CAREG;
  291: #ifdef MORE_VARS
  292:   MORE_VARS
  293: #endif
  294: #ifdef HAS_FFCALL
  295:   av_alist alist;
  296:   extern va_alist clist;
  297:   float frv;
  298:   int irv;
  299:   double drv;
  300:   long long llrv;
  301:   void * prv;
  302: #endif
  303:   register Address up UPREG = UP;
  304:   register Cell MAYBE_UNUSED spTOS TOSREG;
  305:   register Cell MAYBE_UNUSED spb spbREG;
  306:   register Cell MAYBE_UNUSED spc spcREG;
  307:   register Cell MAYBE_UNUSED spd spdREG;
  308:   register Cell MAYBE_UNUSED spe speREG;
  309:   register Cell MAYBE_UNUSED spf speREG;
  310:   register Cell MAYBE_UNUSED spg speREG;
  311:   register Cell MAYBE_UNUSED sph speREG;
  312:   IF_fpTOS(register Float fpTOS FTOSREG;)
  313: #if defined(DOUBLY_INDIRECT)
  314:   static Label *symbols;
  315:   static void *routines[]= {
  316: #define MAX_SYMBOLS (sizeof(routines)/sizeof(routines[0]))
  317: #else /* !defined(DOUBLY_INDIRECT) */
  318:   static Label symbols[]= {
  319: #define MAX_SYMBOLS (sizeof(symbols)/sizeof(symbols[0]))
  320: #endif /* !defined(DOUBLY_INDIRECT) */
  321: #define INST_ADDR(name) ((Label)&&I_##name)
  322: #include PRIM_LAB_I
  323: #undef INST_ADDR
  324:     (Label)0,
  325: #define INST_ADDR(name) ((Label)&&K_##name)
  326: #include PRIM_LAB_I
  327: #undef INST_ADDR
  328: #define INST_ADDR(name) ((Label)&&J_##name)
  329: #include PRIM_LAB_I
  330: #undef INST_ADDR
  331:     (Label)&&after_last,
  332:     (Label)&&before_goto,
  333:     (Label)&&after_goto,
  334: /* just mention the H_ labels, so the SKIP16s are not optimized away */
  335: #define INST_ADDR(name) ((Label)&&H_##name)
  336: #include PRIM_LAB_I
  337: #undef INST_ADDR
  338:   };
  339: #ifdef CPU_DEP2
  340:   CPU_DEP2
  341: #endif
  342: 
  343:   rp = rp0;
  344: #ifdef DEBUG
  345:   fprintf(stderr,"ip=%x, sp=%x, rp=%x, fp=%x, lp=%x, up=%x\n",
  346:           (unsigned)ip0,(unsigned)sp,(unsigned)rp,
  347: 	  (unsigned)fp,(unsigned)lp,(unsigned)up);
  348: #endif
  349: 
  350:   if (ip0 == NULL) {
  351: #if defined(DOUBLY_INDIRECT)
  352: #define CODE_OFFSET (26*sizeof(Cell))
  353: #define XT_OFFSET (22*sizeof(Cell))
  354:     int i;
  355:     Cell code_offset = offset_image? CODE_OFFSET : 0;
  356:     Cell xt_offset = offset_image? XT_OFFSET : 0;
  357: 
  358:     symbols = (Label *)(malloc(MAX_SYMBOLS*sizeof(Cell)+CODE_OFFSET)+code_offset);
  359:     xts = (Label *)(malloc(MAX_SYMBOLS*sizeof(Cell)+XT_OFFSET)+xt_offset);
  360:     for (i=0; i<DOESJUMP+1; i++)
  361:       xts[i] = symbols[i] = (Label)routines[i];
  362:     for (; routines[i]!=0; i++) {
  363:       if (i>=MAX_SYMBOLS) {
  364: 	fprintf(stderr,"gforth-ditc: more than %ld primitives\n",(long)MAX_SYMBOLS);
  365: 	exit(1);
  366:       }
  367:       xts[i] = symbols[i] = &routines[i];
  368:     }
  369: #endif /* defined(DOUBLY_INDIRECT) */
  370:     return symbols;
  371:   }
  372: 
  373: #if !(defined(GFORTH_DEBUGGING) || defined(INDIRECT_THREADED) || defined(DOUBLY_INDIRECT) || defined(VM_PROFILING))
  374:   sp += STACK_CACHE_DEFAULT-1;
  375:   /* some of those registers are dead, but its simpler to initialize them all */  spTOS = sp[0];
  376:   spb = sp[-1];
  377:   spc = sp[-2];
  378:   spd = sp[-3];
  379:   spe = sp[-4];
  380:   spf = sp[-5];
  381:   spg = sp[-6];
  382:   sph = sp[-7];
  383: #endif
  384: 
  385:   IF_fpTOS(fpTOS = fp[0]);
  386: /*  prep_terminal(); */
  387: #ifdef NO_IP
  388:   goto *(*(Label *)ip0);
  389:   before_goto:
  390:   goto *real_ca;
  391:   after_goto:;
  392: #else
  393:   SET_IP(ip);
  394:   SUPER_END; /* count the first block, too */
  395:   FIRST_NEXT;
  396: #endif
  397: 
  398: #ifdef CPU_DEP3
  399:   CPU_DEP3
  400: #endif
  401: 
  402: #include PRIM_I
  403:   after_last: return (Label *)0;
  404:   /*needed only to get the length of the last primitive */
  405: 
  406:   return (Label *)0;
  407: }

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>