📄 jit.h
字号:
/* * m68k/jit.h * Common M68000 JIT configuration information. * * Copyright (c) 1996, 1997 * Transvirtual Technologies, Inc. All rights reserved. * * Copyright (c) 2003 * Kaffe.org contributors, see ChangeLogs for details. All rights reserved. * * See the file "license.terms" for information on usage and redistribution * of this file. * * Modified by Kiyo Inaba <k-inaba@mxb.mesh.ne.jp>, 1999; * to support the trampoline mechanism. */#ifndef __m68k_jit_h#define __m68k_jit_h/**//* Exception handling information. *//**//* Structure of exception frame on stack */typedef struct _exceptionFrame { uintp retfp; uintp retpc;} exceptionFrame;/* Get the next frame in the chain */#define NEXTFRAME(f) \ (((exceptionFrame*)(f))->retfp)/* Extract the PC from the given frame */#define PCFRAME(f) ((f)->retpc)#define FPFRAME(f) ((f)->retfp)/* Get the first exception frame from a subroutine call */#define FIRSTFRAME(f, o) \ ((f) = *(exceptionFrame*)__builtin_frame_address(0))/* Extract the object argument from given frame */#define FRAMEOBJECT(obj, f, einfo) \ (obj) = *(Hjava_lang_Object**)((f) + 8)/**//* Method dispatch. *//**/#define HAVE_TRAMPOLINEtypedef struct _methodTrampoline { unsigned short call; int fixup PACKED; struct _jmethodID* meth PACKED; void** where PACKED;} methodTrampoline;extern void m68k_do_fixup_trampoline(void);#define FILL_IN_TRAMPOLINE(t,m,w) \ do { \ (t)->call = 0x4eb9; /* jsr abs.l */ \ (t)->fixup = (int)m68k_do_fixup_trampoline; \ (t)->meth = (m); \ (t)->where = (w); \ } while (0)#define FIXUP_TRAMPOLINE_DECL void** _data#define FIXUP_TRAMPOLINE_INIT (meth = (Method*)_data[0], \ where = (void**)_data[1])/**//* Register management information. *//**/#define _GL_ (Rglobal|Rnosaveoncall)/* Define the register set *//* Until we have some method of determining in the prologue which Rnosaveoncall registers are used by a method, it is not a win to have any at all. */#define REGISTER_SET \ { /* d0 */ 0, 0, Rint, 0, 0, 0 }, \ { /* d1 */ 0, 0, Rint, 0, 0, 1 }, \ { /* d2 */ 0, 0, Rint, Rnosaveoncall, 0, 2 }, \ { /* d3 */ 0, 0, Rint, Rnosaveoncall, 0, 3 }, \ { /* d4 */ 0, 0, Rint, _GL_, 0, 4 }, \ { /* d5 */ 0, 0, Rint, _GL_, 0, 5 }, \ { /* d6 */ 0, 0, Rint, _GL_, 0, 6 }, \ { /* d7 */ 0, 0, Rint, _GL_, 0, 7 }, \ { /* a0 */ 0, 0, Rref, 0, 0, 8 }, \ { /* a1 */ 0, 0, Rref, 0, 0, 9 }, \ { /* a2 */ 0, 0, Rref, _GL_, 0, 10 }, \ { /* a3 */ 0, 0, Rref, _GL_, 0, 11 }, \ { /* a4 */ 0, 0, Rref, _GL_, 0, 12 }, \ { /* a5 */ 0, 0, Rref, _GL_, 0, 13 }, \ { /* fp */ 0, 0, Reserved, 0, 0, 14 }, \ { /* sp */ 0, 0, Reserved, 0, 0, 15 }, \ { /* fp0 */ 0, 0, Rfloat|Rdouble, 0, 0, 16 }, \ { /* fp1 */ 0, 0, Rfloat|Rdouble, 0, 0, 17 }, \ { /* fp2 */ 0, 0, Rfloat|Rdouble, 0, 0, 18 }, \ { /* fp3 */ 0, 0, Rfloat|Rdouble, 0, 0, 19 }, \ { /* fp4 */ 0, 0, Rfloat|Rdouble, 0, 0, 20 }, \ { /* fp5 */ 0, 0, Rfloat|Rdouble, 0, 0, 21 }, \ { /* fp6 */ 0, 0, Rfloat|Rdouble, 0, 0, 22 }, \ { /* fp7 */ 0, 0, Rfloat|Rdouble, 0, 0, 23 }, /* Number of registers in the register set */#define NR_REGISTERS 24/* Number of function globals in register set */#define NR_GLOBALS 8/* Number of arguments passed in registers - we don't have any */#undef NR_ARGUMENTS/* Define the registers to be saved and restore in the prologue/epilogue */#define SRNR 10#define SAVEMASK 0x3F3C#define RESTOREMASK 0x3CFC/* Define the size of the frame */#define FRAMESIZE \ ((maxLocal - maxArgs + maxStack + maxTemp) * SLOTSIZE)#define Llong16 (Larchdepend+0) /* Label is 16 bits long */#define Llnegframe (Larchdepend+1)#define LABEL_Lnegframe(P,D,L) *(int16*)(P) = -FRAMESIZE#define LABEL_Llnegframe(P,D,L) *(int32*)(P) = -FRAMESIZE#define LABEL_Llong16(P,V,L) *(int16*)(P) = (V)#define EXTRA_LABELS(P,D,L) \ case Llong16: LABEL_Llong16(P,D,L); break; \ case Lnegframe: LABEL_Lnegframe(P,D,L); break; \ case Llnegframe: LABEL_Llnegframe(P,D,L); break;/* Define if generated code uses two operands rather than one */#define TWO_OPERAND/**//* Slot management information. *//**//* Size of each slot */#define SLOTSIZE 4/* * A stack frame looks like: * * | | * | Arguments | * |-------------------------------| * | Return address | * |-------------------------------| * | Saved fp | * fp-> |-------------------------------| * | Temporaries | * sp-> |-------------------------------| *//* Generate slot offset for an argument (relative to fp) */#define SLOT2ARGOFFSET(_n) (8 + SLOTSIZE * (_n))/* Generate slot offset for a local (non-argument) (relative to fp) */#if !defined(JIT3)#define SLOT2LOCALOFFSET(_n) (-SLOTSIZE * (maxTemp+maxLocal+maxStack - (_n)))#else#define SLOT2LOCALOFFSET(N) (-SLOTSIZE * ((N) - maxArgs + 1))#endif/* Generate the slot offset to the stack limit */#define STACK_LIMIT() SLOT2ARGOFFSET(maxArgs)/* Wrap up a native call for the JIT */#define KAFFEJIT_TO_NATIVE(_m)/* On the 68040 (and 060 I presume) we need to flush the instruction cache before running new code. Stupidly, Motorola made cpush a privledged instruction, so we have to get operating system help for this. Naturally, there is no standard there. We are partially rescued by gcc, which must be taught how to do this in order to build bound-function trampolines. This works at least for A/UX, Linux and NeXT. The rest of you with 040's should consider fixing gcc, as you are broken there too. For those with 020's and 030's, this is effectively a no-op. */#define FLUSH_DCACHE(beg,end) __clear_cache((beg), (end))#endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -