File:  [gforth] / gforth / Attic / mips.h
Revision 1.7: download - view: text, annotated - select for diffs
Fri Jul 26 15:28:29 1996 UTC (22 years, 11 months ago) by anton
Branches: MAIN
CVS tags: v0-2-1, v0-2-0, HEAD
adapted DOES_CODE in alpha.h m68k.h mips.h power.h and sparc.h
worked around a bug in SunOS4 in prims2x.fs
fixed typo in main.c

    1: /* This is the machine-specific part for MIPS R[2346810]000 processors
    2: 
    3:   Copyright (C) 1995 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., 675 Mass Ave, Cambridge, MA 02139, USA.
   20: */
   21: 
   22: #if !defined(USE_TOS) && !defined(USE_NO_TOS)
   23: /* on the mips this is a mixed blessing, since defining this spills
   24:    the rp with some gcc versions. This machine has 31 regs, yet that's
   25:    not enough for gcc-2.4.5 :-( */
   26: #define USE_TOS
   27: #endif
   28: 
   29: /* cache flush stuff */
   30: 
   31: #ifndef INDIRECT_THREADED
   32: #ifndef DIRECT_THREADED
   33: #define DIRECT_THREADED
   34: /* direct threading saves 2 cycles per primitive on an R3000, 4 on an R4000 */
   35: #endif
   36: #endif
   37: 
   38: #ifdef ultrix
   39: #include <mips/cachectl.h>
   40: #else
   41: /* works on Irix */
   42: #include <sys/cachectl.h>
   43: #endif
   44: 
   45: #define FLUSH_ICACHE(addr,size) \
   46: 			cacheflush((char *)(addr), (int)(size), BCACHE)
   47: 
   48: #include "32bit.h"
   49: 
   50: #ifdef DIRECT_THREADED
   51: /* some definitions for composing opcodes */
   52: #define JUMP_MASK	0x03ffffff
   53: #define J_PATTERN	0x08000000
   54: #define JAL_PATTERN	0x0c000000
   55: /* this provides the first 4 bits of a jump address, i.e. it must be <16 */
   56: #define SEGMENT_NUM	1
   57: 
   58: #define JUMP(addr)	(J_PATTERN|((((unsigned)(addr))&JUMP_MASK)>>2))
   59: #define CALL(addr)	(JAL_PATTERN|((((unsigned)(addr))&JUMP_MASK)>>2))
   60: 
   61: 	/* PFA gives the parameter field address corresponding to a cfa */
   62: #	define PFA(cfa)	(((Cell *)cfa)+2)
   63: 	/* PFA1 is a special version for use just after a NEXT1 */
   64: #	define PFA1(cfa)	PFA(cfa)
   65: 	/* CODE_ADDRESS is the address of the code jumped to through the code field */
   66: #	define CODE_ADDRESS(cfa)	((Label)(((*(unsigned *)(cfa))^J_PATTERN^(SEGMENT_NUM<<26))<<2))
   67: 	/* MAKE_CF creates an appropriate code field at the cfa; ca is the code address */
   68: #	define MAKE_CF(cfa,ca)	({long * _cfa = (long *)(cfa); \
   69: 					  _cfa[0] = JUMP(ca); \
   70: 					  _cfa[1] = 0; /* nop */})
   71: #	ifdef undefined
   72: 		/* the following version uses JAL to make PFA1 faster */
   73: #		define PFA1(label)	({register Cell *pfa asm("$31"); \
   74: 						pfa; })
   75: 		/* CODE_ADDRESS is the address of the code jumped to through the code field */
   76: #		define CODE_ADDRESS(cfa)	((Label)(((*(unsigned *)(cfa))^JAL_PATTERN^(SEGMENT_NUM<<26))<<2))
   77: #		define MAKE_CF(cfa,ca)	({long *_cfa = (long *)(cfa); \
   78: 					  long _ca = (long)(ca); \
   79: 						  _cfa[0] = CALL(_ca); \
   80: 						  _cfa[1] = 0; /* *(long *)_ca; delay slot */})
   81: #	endif /* undefined */
   82: 
   83: /* this is the point where the does code starts if cfa points to a
   84:    code field of a does>-defined word */
   85: #define DOES_CODE(cfa)	\
   86:      ({ Xt _cfa=(Xt)(cfa); \
   87: 	Label _ca=CODE_ADDRESS(_cfa); \
   88: 	((*(unsigned *)_cfa)&(~JUMP_MASK)) == J_PATTERN && \
   89: 	(*(unsigned *)_ca) == JUMP(symbols[DODOES]) \
   90: 	? _ca+DOES_HANDLER_SIZE : 0; })
   91: 
   92: 
   93: /* this is a special version of DOES_CODE for use in dodoes */
   94: #define DOES_CODE1(cfa)	((Xt *)(((char *)CODE_ADDRESS(cfa))+DOES_HANDLER_SIZE))
   95: 
   96: 
   97: #	define DOES_HANDLER_SIZE	8
   98: #	define MAKE_DOES_CF(cfa,does_code) \
   99: 			({long does_handlerp=((long)(does_code))-DOES_HANDLER_SIZE; \
  100: 			  long *_cfa = (long*)(cfa); \
  101: 			  _cfa[0] = JUMP(does_handlerp); \
  102: 			  _cfa[1] = 0; /* nop */})
  103: /*
  104: #	define MAKE_DOES_CF(cfa, does_code)	({char *does_handlerp=((char *)does_code)-DOES_HANDLER_SIZE;	\
  105: 						  MAKE_CF(cfa,does_handlerp);	\
  106: 						  MAKE_DOES_HANDLER(does_handlerp) ;})
  107: */
  108: 	/* this stores a jump dodoes at addr */
  109: #	define MAKE_DOES_HANDLER(addr)	MAKE_CF(addr,symbols[DODOES])
  110: 
  111: #endif
  112: #ifdef undefined
  113: /* and here are some more efficient versions that can be tried later */
  114: 
  115: /* the first version saves one cycle by doing something useful in the
  116:    delay slot. !! check that the instruction in the delay slot is legal
  117: */
  118: 
  119: #define MAKE_DOESJUMP(addr)	({long * _addr = (long *)addr; \
  120: 				  _addr[0] = JUMP(((unsigned)symbols[DODOES])+4); \
  121: 				  _addr[1] = *(long *)symbols[DODOES]; /* delay */})
  122: 
  123: /* the following version uses JAL to make DOES_CODE1 faster */
  124: /* !! does the declaration clear the register ? */
  125: /* it's ok to use the same reg as in PFA1:
  126:    dodoes is the only potential problem and I have taken care of it */
  127: 
  128: #define DOES_CODE1(cfa)	({register Code *_does_code asm("$31"); \
  129: 				    _does_code; })
  130: #define MAKE_DOESJUMP(addr)	({long * _addr = (long *)addr; \
  131: 				  _addr[0] = CALL(((long)symbols[DODOES])+4);
  132: 				  _addr[1] = *(long *)symbols[DODOES]; /* delay */})
  133: 
  134: #endif
  135: 
  136: #ifdef FORCE_REG
  137: #define IPREG asm("$16")
  138: #define SPREG asm("$17")
  139: #define RPREG asm("$18")
  140: #define LPREG asm("$19")
  141: #define CFAREG asm("$20")
  142: #define TOSREG asm("$21")
  143: #endif /* FORCE_REG */

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