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