File:  [gforth] / gforth / Attic / 386.h
Revision 1.14: download - view: text, annotated - select for diffs
Wed Aug 21 14:58:37 1996 UTC (27 years, 7 months ago) by anton
Branches: MAIN
CVS tags: v0-2-1, v0-2-0, HEAD
a little cleanup in 386.h
renamed special: to interpret/compile:
renamed save-string to save-mem
added extend-mem
replaced (name>) with ((name>))
replaced name> with name>int and name>comp
renamed compile-only to compile-only-error
replaced xt>i with name>int
replaced xt>c with name>comp
removed xt>s
removed found
search-wordlist now delivers interpretation-xt
replaced (sfind) with find-name
replaced C' with COMP' and [C'] with [COMP']
removed S' and [S']
added hex.
added some helper words
adapted other words to the changes
started documenting the intergration of Gforth in applications

    1: /*
    2:   This is the machine-specific part for Intel 386 compatible processors
    3: 
    4:   Copyright (C) 1995 Free Software Foundation, Inc.
    5: 
    6:   This file is part of Gforth.
    7: 
    8:   Gforth is free software; you can redistribute it and/or
    9:   modify it under the terms of the GNU General Public License
   10:   as published by the Free Software Foundation; either version 2
   11:   of the License, or (at your option) any later version.
   12: 
   13:   This program is distributed in the hope that it will be useful,
   14:   but WITHOUT ANY WARRANTY; without even the implied warranty of
   15:   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   16:   GNU General Public License for more details.
   17: 
   18:   You should have received a copy of the GNU General Public License
   19:   along with this program; if not, write to the Free Software
   20:   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
   21: */
   22: 
   23: #include "32bit.h"
   24: 
   25: /* indirect threading is faster on the 486, on the 386 direct
   26:    threading is probably faster. Therefore we leave defining
   27:    DIRECT_THREADED to configure */
   28: 
   29: /* define this if the processor cannot exploit instruction-level
   30:    parallelism (no pipelining or too few registers) */
   31: #define CISC_NEXT
   32: 
   33: /* 386 and below have no cache, 486 has a shared cache, and the
   34:    Pentium probably employs hardware cache consistency, so
   35:    flush-icache is a noop */
   36: #define FLUSH_ICACHE(addr,size)
   37: 
   38: #ifdef DIRECT_THREADED
   39: 
   40: #define CALL 0xe8 /* call */
   41: #define JMP  0xe9 /* jmp  */
   42: #define GETCFA(reg)  ({ asm("popl %0" : "=r" (reg)); (int)reg -= 5;});
   43: 
   44: /* PFA gives the parameter field address corresponding to a cfa */
   45: #define PFA(cfa)	(((Cell *)cfa)+2)
   46: /* PFA1 is a special version for use just after a NEXT1 */
   47: #define PFA1(cfa)	PFA(cfa)
   48: /* CODE_ADDRESS is the address of the code jumped to through the code field */
   49: #define CODE_ADDRESS(cfa) \
   50:     ({long _cfa = (long)(cfa); (Label)(_cfa+*((long *)(_cfa+1))+5);})
   51: /* MAKE_CF creates an appropriate code field at the cfa; ca is the code address */
   52: #define MAKE_CF(cfa,ca)	({long _cfa = (long)(cfa); \
   53:                           long _ca  = (long)(ca); \
   54: 			  *(char *)_cfa = CALL; \
   55: 			  *(long *)(_cfa+1) = _ca-(_cfa+5);})
   56: 
   57: /* this is the point where the does code starts if label points to the
   58:  * jump dodoes */
   59: #define DOES_HANDLER_SIZE       8
   60: #define DOES_CODE(xt) \
   61: ({ long _xt = (long)(xt); \
   62:    long _ca = (long)(CODE_ADDRESS(_xt)); \
   63:    ((((*(unsigned char *)_xt) == CALL) \
   64:      && ((*(unsigned char *)_ca) == JMP) \
   65:      && ((long)(CODE_ADDRESS(_ca)) == (long)&&dodoes)) \
   66:     ? _ca+DOES_HANDLER_SIZE : 0L); })
   67: 
   68: /* this is a special version of DOES_CODE for use in dodoes */
   69: #define DOES_CODE1(label)      (CODE_ADDRESS(label)+DOES_HANDLER_SIZE)
   70: 
   71: /* this stores a jump dodoes at addr */
   72: #define MAKE_DOES_CF(addr,doesp)	({long _addr = (long)(addr); \
   73:                           long _doesp  = (long)(doesp)-8; \
   74: 			  *(char *)_addr = CALL; \
   75: 			  *(long *)(_addr+1) = _doesp-(_addr+5);})
   76: 
   77: #define MAKE_DOES_HANDLER(addr)	({long _addr = (long)(addr); \
   78:                           long _dodo  = (long)symbols[DODOES]; \
   79: 			  *(char *)_addr = JMP; \
   80: 			  *(long *)(_addr+1) = _dodo-(_addr+5);})
   81: #endif
   82: 
   83: #ifdef FORCE_REG
   84: #if (__GNUC__==2 && defined(__GNUC_MINOR__) && __GNUC_MINOR__==5)
   85: /* i.e. gcc-2.5.x */
   86: /* this works with 2.5.7; nothing works with 2.5.8 */
   87: #define IPREG asm("%esi")
   88: #define SPREG asm("%edi")
   89: #ifdef USE_TOS
   90: #define CFAREG asm("%ecx")
   91: #else
   92: #define CFAREG asm("%edx")
   93: #endif
   94: #else /* gcc-version */
   95: /* this works with 2.6.3 (and quite well, too) */
   96: /* since this is not very demanding, it's the default for other gcc versions */
   97: #if defined(USE_TOS) && !defined(CFA_NEXT)
   98: #define IPREG asm("%ebx")
   99: #else
  100: #define SPREG asm("%ebx")
  101: #endif /* USE_TOS && !CFA_NEXT */
  102: #endif /* gcc-version */
  103: #endif /* FORCE_REG */

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