Annotation of gforth/mips.h, revision 1.8
1.5 anton 1: /* This is the machine-specific part for MIPS R[2346810]000 processors
1.1 anton 2:
1.5 anton 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.
1.1 anton 20: */
1.2 anton 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:
1.1 anton 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:
1.3 anton 38: #ifdef ultrix
1.1 anton 39: #include <mips/cachectl.h>
1.3 anton 40: #else
41: /* works on Irix */
42: #include <sys/cachectl.h>
43: #endif
1.1 anton 44:
1.4 anton 45: #define FLUSH_ICACHE(addr,size) \
1.1 anton 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:
1.7 anton 58: #define JUMP(addr) (J_PATTERN|((((unsigned)(addr))&JUMP_MASK)>>2))
59: #define CALL(addr) (JAL_PATTERN|((((unsigned)(addr))&JUMP_MASK)>>2))
1.1 anton 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); \
1.7 anton 69: _cfa[0] = JUMP(ca); \
1.1 anton 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); \
1.7 anton 79: _cfa[0] = CALL(_ca); \
1.1 anton 80: _cfa[1] = 0; /* *(long *)_ca; delay slot */})
81: # endif /* undefined */
82:
1.7 anton 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))
1.1 anton 95:
96:
97: # define MAKE_DOES_CF(cfa,does_code) \
98: ({long does_handlerp=((long)(does_code))-DOES_HANDLER_SIZE; \
99: long *_cfa = (long*)(cfa); \
1.7 anton 100: _cfa[0] = JUMP(does_handlerp); \
1.1 anton 101: _cfa[1] = 0; /* nop */})
102: /*
103: # define MAKE_DOES_CF(cfa, does_code) ({char *does_handlerp=((char *)does_code)-DOES_HANDLER_SIZE; \
104: MAKE_CF(cfa,does_handlerp); \
105: MAKE_DOES_HANDLER(does_handlerp) ;})
106: */
107: /* this stores a jump dodoes at addr */
108: # define MAKE_DOES_HANDLER(addr) MAKE_CF(addr,symbols[DODOES])
109:
110: #endif
111: #ifdef undefined
112: /* and here are some more efficient versions that can be tried later */
113:
114: /* the first version saves one cycle by doing something useful in the
115: delay slot. !! check that the instruction in the delay slot is legal
116: */
117:
118: #define MAKE_DOESJUMP(addr) ({long * _addr = (long *)addr; \
1.7 anton 119: _addr[0] = JUMP(((unsigned)symbols[DODOES])+4); \
1.1 anton 120: _addr[1] = *(long *)symbols[DODOES]; /* delay */})
121:
122: /* the following version uses JAL to make DOES_CODE1 faster */
123: /* !! does the declaration clear the register ? */
124: /* it's ok to use the same reg as in PFA1:
125: dodoes is the only potential problem and I have taken care of it */
126:
127: #define DOES_CODE1(cfa) ({register Code *_does_code asm("$31"); \
128: _does_code; })
129: #define MAKE_DOESJUMP(addr) ({long * _addr = (long *)addr; \
1.7 anton 130: _addr[0] = CALL(((long)symbols[DODOES])+4);
1.1 anton 131: _addr[1] = *(long *)symbols[DODOES]; /* delay */})
132:
133: #endif
134:
135: #ifdef FORCE_REG
136: #define IPREG asm("$16")
137: #define SPREG asm("$17")
138: #define RPREG asm("$18")
139: #define LPREG asm("$19")
140: #define CFAREG asm("$20")
141: #define TOSREG asm("$21")
142: #endif /* FORCE_REG */
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to mips.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [gforth] / gforth