Return to 386.h CVS log

Up to [gforth] / gforth

Now gforth.fi is a nonrelocatable image containing all of startup.fs etc.
savesystem now saves `included-files', too (so require does not start from
 scratch)
added/fixed stack effect and wordset documentation for many words in kernal.fs
some reformatting in kernal.fs
fixed some wordset info in primitives
added strsignal

    1: /*
    2:   Copyright 1992 by the ANSI figForth Development Group
    3: 
    4:   This is the machine-specific part for Intel 386 compatible processors
    5: */
    6: 
    7: #include "32bit.h"
    8: 
    9: /* indirect threading is faster on the 486, on the 386 direct
   10:    threading is probably faster. Therefore we leave defining
   11:    DIRECT_THREADED to configure */
   12: 
   13: /* define this if the processor cannot exploit instruction-level
   14:    parallelism (no pipelining or too few registers) */
   15: #define CISC_NEXT
   16: 
   17: /* 386 and below have no cache, 486 has a shared cache, and the
   18:    Pentium probably employs hardware cache consistency, so
   19:    flush-icache is a noop */
   20: #define FLUSH_ICACHE(addr,size) 0
   21: 
   22: #ifdef DIRECT_THREADED
   23: /* PFA gives the parameter field address corresponding to a cfa */
   24: #define PFA(cfa)	(((Cell *)cfa)+2)
   25: /* PFA1 is a special version for use just after a NEXT1 */
   26: #define PFA1(cfa)	PFA(cfa)
   27: /* CODE_ADDRESS is the address of the code jumped to through the code field */
   28: #define CODE_ADDRESS(cfa) \
   29:     ({long _cfa = (long)(cfa); (Label)(_cfa+*((long *)(_cfa+1))+5);})
   30: /* MAKE_CF creates an appropriate code field at the cfa; ca is the code address */
   31: #define MAKE_CF(cfa,ca)	({long _cfa = (long)(cfa); \
   32:                           long _ca  = (long)(ca); \
   33: 			  *(char *)_cfa = 0xe9; /* jmp */ \
   34: 			  *(long *)(_cfa+1) = _ca-(_cfa+5);})
   35: 
   36: /* this is the point where the does code starts if label points to the
   37:  * jump dodoes */
   38: #define DOES_HANDLER_SIZE       8
   39: #define DOES_CODE(label)	((Xt *)(CODE_ADDRESS(label)+DOES_HANDLER_SIZE))
   40: 
   41: /* this is a special version of DOES_CODE for use in dodoes */
   42: #define DOES_CODE1(label)	DOES_CODE(label)
   43: 
   44: /* this stores a jump dodoes at addr */
   45: #define MAKE_DOES_HANDLER(addr) MAKE_CF(addr,symbols[DODOES])
   46: 
   47: #define MAKE_DOES_CF(addr,doesp) MAKE_CF(addr,((int)(doesp)-8))
   48: #endif
   49: 
   50: #ifdef FORCE_REG
   51: #if (__GNUC__==2 && defined(__GNUC_MINOR__) && __GNUC_MINOR__==5)
   52: /* i.e. gcc-2.5.x */
   53: /* this works with 2.5.7; nothing works with 2.5.8 */
   54: #define IPREG asm("%esi")
   55: #define SPREG asm("%edi")
   56: #ifdef USE_TOS
   57: #define CFAREG asm("%ecx")
   58: #else
   59: #define CFAREG asm("%edx")
   60: #endif
   61: #else /* gcc-version */
   62: /* this works with 2.6.3 (and quite well, too) */
   63: /* since this is not very demanding, it's the default for other gcc versions */
   64: #define SPREG asm("%ebx")
   65: #endif /* gcc-version */
   66: #endif /* FORCE_REG */