1 /* Copyright (C) 2001 Free Software Foundation, Inc.
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
42 /* This file is included in vm_engine.c */
48 #define VM_USE_HOOKS 1 /* Various hooks */
49 #define VM_USE_CLOCK 1 /* Bogoclock */
50 #define VM_CHECK_EXTERNAL 1 /* Check external link */
57 /* Register optimization. [ stolen from librep/src/lispmach.h,v 1.3 ]
59 Some compilers underestimate the use of the local variables representing
60 the abstract machine registers, and don't put them in hardware registers,
61 which slows down the interpreter considerably.
62 For GCC, I have hand-assigned hardware registers for several architectures.
67 #define IP_REG asm("$16")
68 #define SP_REG asm("$17")
69 #define FP_REG asm("$18")
72 #define IP_REG asm("%l0")
73 #define SP_REG asm("%l1")
74 #define FP_REG asm("%l2")
78 #define IP_REG asm("r9")
79 #define SP_REG asm("r10")
80 #define FP_REG asm("r11")
82 #define IP_REG asm("$9")
83 #define SP_REG asm("$10")
84 #define FP_REG asm("$11")
88 #define IP_REG asm("%esi")
89 #define SP_REG asm("%edi")
92 #if defined(PPC) || defined(_POWER) || defined(_IBMR2)
93 #define IP_REG asm("26")
94 #define SP_REG asm("27")
95 #define FP_REG asm("28")
98 #define IP_REG asm("%r18")
99 #define SP_REG asm("%r17")
100 #define FP_REG asm("%r16")
103 #define IP_REG asm("a5")
104 #define SP_REG asm("a4")
108 #define IP_REG asm("r9")
109 #define SP_REG asm("r8")
110 #define FP_REG asm("r7")
119 #define CACHE_REGISTER() \
126 #define SYNC_REGISTER() \
133 #define CACHE_PROGRAM() \
135 bp = SCM_PROGRAM_DATA (program); \
136 objects = SCM_VELTS (bp->objs); \
139 #define SYNC_BEFORE_GC() \
154 #undef CHECK_EXTERNAL
155 #if VM_CHECK_EXTERNAL
156 #define CHECK_EXTERNAL(e) \
157 do { if (!SCM_CONSP (e)) goto vm_error_external; } while (0)
159 #define CHECK_EXTERNAL(e)
169 #define RUN_HOOK(h) \
171 if (!SCM_FALSEP (vp->hooks[h])) \
174 vm_heapify_frames (vm); \
175 scm_c_run_hook (vp->hooks[h], hook_args); \
183 #define BOOT_HOOK() RUN_HOOK (SCM_VM_BOOT_HOOK)
184 #define HALT_HOOK() RUN_HOOK (SCM_VM_HALT_HOOK)
185 #define NEXT_HOOK() RUN_HOOK (SCM_VM_NEXT_HOOK)
186 #define ENTER_HOOK() RUN_HOOK (SCM_VM_ENTER_HOOK)
187 #define APPLY_HOOK() RUN_HOOK (SCM_VM_APPLY_HOOK)
188 #define EXIT_HOOK() RUN_HOOK (SCM_VM_EXIT_HOOK)
189 #define RETURN_HOOK() RUN_HOOK (SCM_VM_RETURN_HOOK)
196 #define CHECK_OVERFLOW() \
197 if (sp > stack_limit) \
198 goto vm_error_stack_overflow
200 #define CHECK_UNDERFLOW() \
201 if (sp < stack_base) \
202 goto vm_error_stack_underflow
204 #define PUSH(x) do { sp++; CHECK_OVERFLOW (); *sp = x; } while (0)
205 #define DROP() do { CHECK_UNDERFLOW (); sp--; } while (0)
206 #define POP(x) do { x = *sp; DROP (); } while (0)
208 #define CONS(x,y,z) \
212 SCM_NEWCELL (cell); \
213 SCM_SET_CELL_OBJECT_0 (cell, y); \
214 SCM_SET_CELL_OBJECT_1 (cell, z); \
218 #define POP_LIST(n) \
223 for (i = n; i; i--) \
224 CONS (l, sp[i], l); \
228 #define POP_LIST_MARK() \
233 while (!SCM_UNBNDP (o)) \
243 * Instruction operation
246 #define FETCH() (*ip++)
247 #define FETCH_LENGTH(len) do { ip = vm_fetch_length (ip, &len); } while (0)
251 #define CLOCK(n) vp->clock += n
257 #ifdef HAVE_LABELS_AS_VALUES
258 #define NEXT_JUMP() goto *jump_table[FETCH ()]
260 #define NEXT_JUMP() goto vm_start
275 #define INIT_ARGS() \
279 int n = nargs - (bp->nargs - 1); \
281 goto vm_error_wrong_num_args; \
286 if (nargs != bp->nargs) \
287 goto vm_error_wrong_num_args; \
291 /* See frames.h for the layout of stack frames */
293 #define NEW_FRAME() \
296 SCM ra = SCM_PACK (ip); \
297 SCM dl = SCM_PACK (fp); \
299 SCM *q = p + bp->nlocs; \
303 fp = p - bp->nargs; \
307 /* Init local variables */ \
309 *p = SCM_UNDEFINED; \
311 /* Create external variables */ \
312 external = bp->external; \
313 for (i = 0; i < bp->nexts; i++) \
314 CONS (external, SCM_UNDEFINED, external); \
316 /* Set frame data */ \
323 #define FREE_FRAME() \
327 SCM *p = fp + bp->nargs + bp->nlocs; \
329 /* Restore pointers */ \
330 ip = SCM_FRAME_BYTE_CAST (p[3]); \
331 fp = SCM_FRAME_STACK_CAST (p[2]); \
333 if (!SCM_FALSEP (p[1])) \
335 /* Unlink the heap stack */ \
336 vp->this_frame = p[1]; \
340 /* Move stack items */ \
342 sp = SCM_FRAME_LOWER_ADDRESS (last_fp); \
343 while (p <= last_sp) \
349 #define CACHE_EXTERNAL() external = fp[bp->nargs + bp->nlocs]
356 #define ARGS1(a1) SCM a1 = sp[0];
357 #define ARGS2(a1,a2) SCM a1 = sp[-1], a2 = sp[0]; sp--;
358 #define ARGS3(a1,a2,a3) SCM a1 = sp[-2], a2 = sp[-1], a3 = sp[0]; sp -= 2;
360 #define RETURN(x) do { *sp = x; NEXT; } while (0)