1 /* Copyright (C) 2001, 2009, 2010 Free Software Foundation, Inc.
3 * This library is free software; you can redistribute it and/or
4 * modify it under the terms of the GNU Lesser General Public License
5 * as published by the Free Software Foundation; either version 3 of
6 * the License, or (at your option) any later version.
8 * This library is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * Lesser General Public License for more details.
13 * You should have received a copy of the GNU Lesser General Public
14 * License along with this library; if not, write to the Free Software
15 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
19 /* This file is included in vm_engine.c */
26 /* Register optimization. [ stolen from librep/src/lispmach.h,v 1.3 ]
28 Some compilers underestimate the use of the local variables representing
29 the abstract machine registers, and don't put them in hardware registers,
30 which slows down the interpreter considerably.
31 For GCC, I have hand-assigned hardware registers for several architectures.
36 #define IP_REG asm("$16")
37 #define SP_REG asm("$17")
38 #define FP_REG asm("$18")
41 #define IP_REG asm("%l0")
42 #define SP_REG asm("%l1")
43 #define FP_REG asm("%l2")
47 #define IP_REG asm("r9")
48 #define SP_REG asm("r10")
49 #define FP_REG asm("r11")
51 #define IP_REG asm("$9")
52 #define SP_REG asm("$10")
53 #define FP_REG asm("$11")
57 /* too few registers! because of register allocation errors with various gcs,
58 just punt on explicit assignments on i386, hoping that the "register"
59 declaration will be sufficient. */
61 #if defined(PPC) || defined(_POWER) || defined(_IBMR2)
62 #define IP_REG asm("26")
63 #define SP_REG asm("27")
64 #define FP_REG asm("28")
67 #define IP_REG asm("%r18")
68 #define SP_REG asm("%r17")
69 #define FP_REG asm("%r16")
72 #define IP_REG asm("a5")
73 #define SP_REG asm("a4")
77 #define IP_REG asm("r9")
78 #define SP_REG asm("r8")
79 #define FP_REG asm("r7")
98 #ifdef VM_ENABLE_ASSERTIONS
99 # define ASSERT(condition) if (SCM_UNLIKELY (!(condition))) abort()
101 # define ASSERT(condition)
105 /* Cache the VM's instruction, stack, and frame pointer in local variables. */
106 #define CACHE_REGISTER() \
113 /* Update the registers in VP, a pointer to the current VM. This must be done
114 at least before any GC invocation so that `vp->sp' is up-to-date and the
115 whole stack gets marked. */
116 #define SYNC_REGISTER() \
124 #define ASSERT_VARIABLE(x) \
125 do { if (!SCM_VARIABLEP (x)) { SYNC_REGISTER (); abort(); } \
127 #define ASSERT_BOUND_VARIABLE(x) \
128 do { ASSERT_VARIABLE (x); \
129 if (SCM_VARIABLE_REF (x) == SCM_UNDEFINED) \
130 { SYNC_REGISTER (); abort(); } \
133 #ifdef VM_ENABLE_PARANOID_ASSERTIONS
135 do { if (ip < bp->base || ip - bp->base > bp->len) abort (); } while (0)
136 #define ASSERT_ALIGNED_PROCEDURE() \
137 do { if ((scm_t_bits)bp % 8) abort (); } while (0)
138 #define ASSERT_BOUND(x) \
139 do { if ((x) == SCM_UNDEFINED) { SYNC_REGISTER (); abort(); } \
143 #define ASSERT_ALIGNED_PROCEDURE()
144 #define ASSERT_BOUND(x)
147 /* Cache the object table and free variables. */
148 #define CACHE_PROGRAM() \
150 if (bp != SCM_PROGRAM_DATA (program)) { \
151 bp = SCM_PROGRAM_DATA (program); \
152 ASSERT_ALIGNED_PROCEDURE (); \
153 if (SCM_I_IS_VECTOR (SCM_PROGRAM_OBJTABLE (program))) { \
154 objects = SCM_I_VECTOR_WELTS (SCM_PROGRAM_OBJTABLE (program)); \
155 object_count = SCM_I_VECTOR_LENGTH (SCM_PROGRAM_OBJTABLE (program)); \
163 #define SYNC_BEFORE_GC() \
178 /* Accesses to a program's object table. */
180 #define CHECK_OBJECT(_num) \
181 do { if (SCM_UNLIKELY ((_num) >= object_count)) goto vm_error_object; } while (0)
183 #define CHECK_OBJECT(_num)
186 #if VM_CHECK_FREE_VARIABLES
187 #define CHECK_FREE_VARIABLE(_num) \
189 if (SCM_UNLIKELY ((_num) >= SCM_PROGRAM_NUM_FREE_VARIABLES (program))) \
190 goto vm_error_free_variable; \
193 #define CHECK_FREE_VARIABLE(_num)
204 #define RUN_HOOK(h) \
206 if (SCM_UNLIKELY (vp->trace_level > 0)) \
209 vm_dispatch_hook (vm, h); \
212 #define RUN_HOOK1(h, x) \
214 if (SCM_UNLIKELY (vp->trace_level > 0)) \
218 vm_dispatch_hook (vm, h); \
224 #define RUN_HOOK1(h, x)
227 #define BOOT_HOOK() RUN_HOOK (SCM_VM_BOOT_HOOK)
228 #define HALT_HOOK() RUN_HOOK (SCM_VM_HALT_HOOK)
229 #define NEXT_HOOK() RUN_HOOK (SCM_VM_NEXT_HOOK)
230 #define BREAK_HOOK() RUN_HOOK (SCM_VM_BREAK_HOOK)
231 #define ENTER_HOOK() RUN_HOOK (SCM_VM_ENTER_HOOK)
232 #define APPLY_HOOK() RUN_HOOK (SCM_VM_APPLY_HOOK)
233 #define EXIT_HOOK() RUN_HOOK (SCM_VM_EXIT_HOOK)
234 #define RETURN_HOOK(n) RUN_HOOK1 (SCM_VM_RETURN_HOOK, SCM_I_MAKINUM (n))
236 #define VM_HANDLE_INTERRUPTS \
237 SCM_ASYNC_TICK_WITH_CODE (SYNC_REGISTER ())
244 #ifdef VM_ENABLE_STACK_NULLING
245 # define CHECK_STACK_LEAKN(_n) ASSERT (!sp[_n]);
246 # define CHECK_STACK_LEAK() CHECK_STACK_LEAKN(1)
247 # define NULLSTACK(_n) { int __x = _n; CHECK_STACK_LEAKN (_n+1); while (__x > 0) sp[__x--] = NULL; }
248 /* If you have a nonlocal exit in a pre-wind proc while invoking a continuation
249 inside a dynwind (phew!), the stack is fully rewound but vm_reset_stack for
250 that continuation doesn't have a chance to run. It's not important on a
251 semantic level, but it does mess up our stack nulling -- so this macro is to
253 # define NULLSTACK_FOR_NONLOCAL_EXIT() if (vp->sp > sp) NULLSTACK (vp->sp - sp);
255 # define CHECK_STACK_LEAKN(_n)
256 # define CHECK_STACK_LEAK()
257 # define NULLSTACK(_n)
258 # define NULLSTACK_FOR_NONLOCAL_EXIT()
261 #define CHECK_OVERFLOW() \
262 if (SCM_UNLIKELY (sp >= stack_limit)) \
263 goto vm_error_stack_overflow
265 #define CHECK_UNDERFLOW() \
266 if (SCM_UNLIKELY (sp <= SCM_FRAME_UPPER_ADDRESS (fp))) \
267 goto vm_error_stack_underflow;
269 #define PRE_CHECK_UNDERFLOW(N) \
270 if (SCM_UNLIKELY (sp - N <= SCM_FRAME_UPPER_ADDRESS (fp))) \
271 goto vm_error_stack_underflow;
273 #define PUSH(x) do { sp++; CHECK_OVERFLOW (); *sp = x; } while (0)
274 #define DROP() do { sp--; CHECK_UNDERFLOW (); NULLSTACK (1); } while (0)
275 #define DROPN(_n) do { sp -= (_n); CHECK_UNDERFLOW (); NULLSTACK (_n); } while (0)
276 #define POP(x) do { PRE_CHECK_UNDERFLOW (1); x = *sp--; NULLSTACK (1); } while (0)
278 /* A fast CONS. This has to be fast since its used, for instance, by
279 POP_LIST when fetching a function's argument list. Note: `scm_cell' is an
280 inlined function in Guile 1.7. Unfortunately, it calls
281 `scm_gc_for_newcell ()' which is _not_ inlined and allocated cells on the
283 #define CONS(x,y,z) \
286 x = scm_cell (SCM_UNPACK (y), SCM_UNPACK (z)); \
289 /* Pop the N objects on top of the stack and push a list that contains
291 #define POP_LIST(n) \
295 SCM l = SCM_EOL, x; \
296 for (i = n; i; i--) \
304 /* The opposite: push all of the elements in L onto the list. */
305 #define PUSH_LIST(l, NILP) \
308 for (; scm_is_pair (l); l = SCM_CDR (l)) \
309 PUSH (SCM_CAR (l)); \
310 if (SCM_UNLIKELY (!NILP (l))) { \
311 finish_args = scm_list_1 (l); \
312 goto vm_error_improper_list; \
317 #define POP_LIST_MARK() \
322 while (!SCM_UNBNDP (o)) \
330 #define POP_CONS_MARK() \
335 while (!SCM_UNBNDP (o)) \
345 * Instruction operation
348 #define FETCH() (*ip++)
349 #define FETCH_LENGTH(len) do { len=*ip++; len<<=8; len+=*ip++; len<<=8; len+=*ip++; } while (0)
352 #ifdef HAVE_LABELS_AS_VALUES
353 #define NEXT_JUMP() goto *jump_table[FETCH () & SCM_VM_INSTRUCTION_MASK]
355 #define NEXT_JUMP() goto vm_start
361 CHECK_STACK_LEAK (); \
366 /* See frames.h for the layout of stack frames */
367 /* When this is called, bp points to the new program data,
368 and the arguments are already on the stack */
369 #define DROP_FRAME() \
373 CHECK_UNDERFLOW (); \