/* Copyright (C) 2001, 2009-2012, 2014 Free Software Foundation, Inc. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation; either version 3 of * the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA * 02110-1301 USA */ /* This file is included in vm_engine.c */ /* * Registers */ /* Register optimization. [ stolen from librep/src/lispmach.h,v 1.3 ] Some compilers underestimate the use of the local variables representing the abstract machine registers, and don't put them in hardware registers, which slows down the interpreter considerably. For GCC, I have hand-assigned hardware registers for several architectures. */ #ifdef __GNUC__ #ifdef __mips__ #define IP_REG asm("$16") #define SP_REG asm("$17") #define FP_REG asm("$18") #endif #ifdef __sparc__ #define IP_REG asm("%l0") #define SP_REG asm("%l1") #define FP_REG asm("%l2") #endif #ifdef __alpha__ #ifdef __CRAY__ #define IP_REG asm("r9") #define SP_REG asm("r10") #define FP_REG asm("r11") #else #define IP_REG asm("$9") #define SP_REG asm("$10") #define FP_REG asm("$11") #endif #endif #ifdef __i386__ /* too few registers! because of register allocation errors with various gcs, just punt on explicit assignments on i386, hoping that the "register" declaration will be sufficient. */ #elif defined __x86_64__ /* GCC 4.6 chooses %rbp for IP_REG and %rbx for SP_REG, which works well. Tell it to keep the jump table in a r12, which is callee-saved. */ #define JT_REG asm ("r12") #endif #if defined(PPC) || defined(_POWER) || defined(_IBMR2) #define IP_REG asm("26") #define SP_REG asm("27") #define FP_REG asm("28") #endif #ifdef __hppa__ #define IP_REG asm("%r18") #define SP_REG asm("%r17") #define FP_REG asm("%r16") #endif #ifdef __mc68000__ #define IP_REG asm("a3") #define SP_REG asm("a4") #define FP_REG #endif #ifdef __arm__ #define IP_REG asm("r9") #define SP_REG asm("r8") #define FP_REG #endif #endif #ifndef IP_REG #define IP_REG #endif #ifndef SP_REG #define SP_REG #endif #ifndef FP_REG #define FP_REG #endif #ifndef JT_REG #define JT_REG #endif /* * Cache/Sync */ #define VM_ASSERT(condition, handler) \ do { if (SCM_UNLIKELY (!(condition))) { SYNC_ALL(); handler; } } while (0) #ifdef VM_ENABLE_ASSERTIONS # define ASSERT(condition) VM_ASSERT (condition, abort()) #else # define ASSERT(condition) #endif /* Cache the VM's instruction, stack, and frame pointer in local variables. */ #define CACHE_REGISTER() \ { \ ip = vp->ip; \ sp = vp->sp; \ fp = vp->fp; \ } /* Update the registers in VP, a pointer to the current VM. This must be done at least before any GC invocation so that `vp->sp' is up-to-date and the whole stack gets marked. */ #define SYNC_REGISTER() \ { \ vp->ip = ip; \ vp->sp = sp; \ vp->fp = fp; \ } /* FIXME */ #define ASSERT_VARIABLE(x) \ do { if (!SCM_VARIABLEP (x)) { SYNC_REGISTER (); abort(); } \ } while (0) #define ASSERT_BOUND_VARIABLE(x) \ do { ASSERT_VARIABLE (x); \ if (scm_is_eq (SCM_VARIABLE_REF (x), SCM_UNDEFINED)) \ { SYNC_REGISTER (); abort(); } \ } while (0) #ifdef VM_ENABLE_PARANOID_ASSERTIONS #define CHECK_IP() \ do { if (ip < bp->base || ip - bp->base > bp->len) abort (); } while (0) #define ASSERT_ALIGNED_PROCEDURE() \ do { if ((scm_t_bits)bp % 8) abort (); } while (0) #define ASSERT_BOUND(x) \ do { if (scm_is_eq ((x), SCM_UNDEFINED)) { SYNC_REGISTER (); abort(); } \ } while (0) #else #define CHECK_IP() #define ASSERT_ALIGNED_PROCEDURE() #define ASSERT_BOUND(x) #endif #if VM_CHECK_OBJECT #define SET_OBJECT_COUNT(n) object_count = n #else #define SET_OBJECT_COUNT(n) /* nop */ #endif /* Cache the object table and free variables. */ #define CACHE_PROGRAM() \ { \ if (bp != SCM_PROGRAM_DATA (program)) { \ bp = SCM_PROGRAM_DATA (program); \ ASSERT_ALIGNED_PROCEDURE (); \ if (SCM_I_IS_VECTOR (SCM_PROGRAM_OBJTABLE (program))) { \ objects = SCM_I_VECTOR_WELTS (SCM_PROGRAM_OBJTABLE (program)); \ SET_OBJECT_COUNT (SCM_I_VECTOR_LENGTH (SCM_PROGRAM_OBJTABLE (program))); \ } else { \ objects = NULL; \ SET_OBJECT_COUNT (0); \ } \ } \ } #define SYNC_BEFORE_GC() \ { \ SYNC_REGISTER (); \ } #define SYNC_ALL() \ { \ SYNC_REGISTER (); \ } /* * Error check */ /* Accesses to a program's object table. */ #if VM_CHECK_OBJECT #define CHECK_OBJECT(_num) \ VM_ASSERT ((_num) < object_count, vm_error_object ()) #else #define CHECK_OBJECT(_num) #endif #if VM_CHECK_FREE_VARIABLES #define CHECK_FREE_VARIABLE(_num) \ VM_ASSERT ((_num) < SCM_PROGRAM_NUM_FREE_VARIABLES (program), \ vm_error_free_variable ()) #else #define CHECK_FREE_VARIABLE(_num) #endif /* * Hooks */ #undef RUN_HOOK #undef RUN_HOOK1 #if VM_USE_HOOKS #define RUN_HOOK(h) \ { \ if (SCM_UNLIKELY (vp->trace_level > 0)) \ { \ SYNC_REGISTER (); \ vm_dispatch_hook (vm, h); \ } \ } #define RUN_HOOK1(h, x) \ { \ if (SCM_UNLIKELY (vp->trace_level > 0)) \ { \ PUSH (x); \ SYNC_REGISTER (); \ vm_dispatch_hook (vm, h); \ DROP(); \ } \ } #else #define RUN_HOOK(h) #define RUN_HOOK1(h, x) #endif #define APPLY_HOOK() \ RUN_HOOK (SCM_VM_APPLY_HOOK) #define PUSH_CONTINUATION_HOOK() \ RUN_HOOK (SCM_VM_PUSH_CONTINUATION_HOOK) #define POP_CONTINUATION_HOOK(n) \ RUN_HOOK1 (SCM_VM_POP_CONTINUATION_HOOK, SCM_I_MAKINUM (n)) #define NEXT_HOOK() \ RUN_HOOK (SCM_VM_NEXT_HOOK) #define ABORT_CONTINUATION_HOOK() \ RUN_HOOK (SCM_VM_ABORT_CONTINUATION_HOOK) #define RESTORE_CONTINUATION_HOOK() \ RUN_HOOK (SCM_VM_RESTORE_CONTINUATION_HOOK) #define VM_HANDLE_INTERRUPTS \ SCM_ASYNC_TICK_WITH_CODE (current_thread, SYNC_REGISTER ()) /* * Stack operation */ #ifdef VM_ENABLE_STACK_NULLING # define CHECK_STACK_LEAKN(_n) ASSERT (!sp[_n]); # define CHECK_STACK_LEAK() CHECK_STACK_LEAKN(1) # define NULLSTACK(_n) { int __x = _n; CHECK_STACK_LEAKN (_n+1); while (__x > 0) sp[__x--] = NULL; } /* If you have a nonlocal exit in a pre-wind proc while invoking a continuation inside a dynwind (phew!), the stack is fully rewound but vm_reset_stack for that continuation doesn't have a chance to run. It's not important on a semantic level, but it does mess up our stack nulling -- so this macro is to fix that. */ # define NULLSTACK_FOR_NONLOCAL_EXIT() if (vp->sp > sp) NULLSTACK (vp->sp - sp); #else # define CHECK_STACK_LEAKN(_n) # define CHECK_STACK_LEAK() # define NULLSTACK(_n) # define NULLSTACK_FOR_NONLOCAL_EXIT() #endif /* For this check, we don't use VM_ASSERT, because that leads to a per-site SYNC_ALL, which is too much code growth. The real problem of course is having to check for overflow all the time... */ #define CHECK_OVERFLOW() \ do { if (SCM_UNLIKELY (sp >= stack_limit)) goto handle_overflow; } while (0) #ifdef VM_CHECK_UNDERFLOW #define PRE_CHECK_UNDERFLOW(N) \ VM_ASSERT (sp - (N) > SCM_FRAME_UPPER_ADDRESS (fp), vm_error_stack_underflow ()) #define CHECK_UNDERFLOW() PRE_CHECK_UNDERFLOW (0) #else #define PRE_CHECK_UNDERFLOW(N) /* nop */ #define CHECK_UNDERFLOW() /* nop */ #endif #define PUSH(x) do { sp++; CHECK_OVERFLOW (); *sp = x; } while (0) #define DROP() do { sp--; CHECK_UNDERFLOW (); NULLSTACK (1); } while (0) #define DROPN(_n) do { sp -= (_n); CHECK_UNDERFLOW (); NULLSTACK (_n); } while (0) #define POP(x) do { PRE_CHECK_UNDERFLOW (1); x = *sp--; NULLSTACK (1); } while (0) #define POP2(x,y) do { PRE_CHECK_UNDERFLOW (2); x = *sp--; y = *sp--; NULLSTACK (2); } while (0) #define POP3(x,y,z) do { PRE_CHECK_UNDERFLOW (3); x = *sp--; y = *sp--; z = *sp--; NULLSTACK (3); } while (0) /* A fast CONS. This has to be fast since its used, for instance, by POP_LIST when fetching a function's argument list. Note: `scm_cell' is an inlined function in Guile 1.7. Unfortunately, it calls `scm_gc_for_newcell ()' which is _not_ inlined and allocated cells on the heap. XXX */ #define CONS(x,y,z) \ { \ SYNC_BEFORE_GC (); \ x = scm_cell (SCM_UNPACK (y), SCM_UNPACK (z)); \ } /* Pop the N objects on top of the stack and push a list that contains them. */ #define POP_LIST(n) \ do \ { \ int i; \ SCM l = SCM_EOL, x; \ for (i = n; i; i--) \ { \ POP (x); \ CONS (l, x, l); \ } \ PUSH (l); \ } while (0) /* The opposite: push all of the elements in L onto the list. */ #define PUSH_LIST(l, NILP) \ do \ { \ for (; scm_is_pair (l); l = SCM_CDR (l)) \ PUSH (SCM_CAR (l)); \ VM_ASSERT (NILP (l), vm_error_improper_list (l)); \ } while (0) #define POP_LIST_MARK() \ do { \ SCM o; \ SCM l = SCM_EOL; \ POP (o); \ while (!SCM_UNBNDP (o)) \ { \ CONS (l, o, l); \ POP (o); \ } \ PUSH (l); \ } while (0) #define POP_CONS_MARK() \ do { \ SCM o, l; \ POP (l); \ POP (o); \ while (!SCM_UNBNDP (o)) \ { \ CONS (l, o, l); \ POP (o); \ } \ PUSH (l); \ } while (0) /* * Instruction operation */ #define FETCH() (*ip++) #define FETCH_LENGTH(len) do { len=*ip++; len<<=8; len+=*ip++; len<<=8; len+=*ip++; } while (0) #undef NEXT_JUMP #ifdef HAVE_LABELS_AS_VALUES #define NEXT_JUMP() goto *jump_table[FETCH () & SCM_VM_INSTRUCTION_MASK] #else #define NEXT_JUMP() goto vm_start #endif #define NEXT \ { \ NEXT_HOOK (); \ CHECK_STACK_LEAK (); \ NEXT_JUMP (); \ } /* See frames.h for the layout of stack frames */ /* When this is called, bp points to the new program data, and the arguments are already on the stack */ #define DROP_FRAME() \ { \ sp -= 3; \ NULLSTACK (3); \ CHECK_UNDERFLOW (); \ } /* Local Variables: c-file-style: "gnu" End: */