+/*
+ * very-low-level utilities for runtime support
+ */
+
+/*
+ * This software is part of the SBCL system. See the README file for
+ * more information.
+ *
+ * This software is derived from the CMU CL system, which was
+ * written at Carnegie Mellon University and released into the
+ * public domain. The software is in the public domain and is
+ * provided with absolutely no warranty. See the COPYING and CREDITS
+ * files for more information.
+ */
+\f
#include "sbcl.h"
#include "lispregs.h"
#include "globals.h"
#include "genesis/fdefn.h"
#include "genesis/closure.h"
+#include "genesis/funcallable-instance.h"
#include "genesis/return-pc.h"
#include "genesis/simple-fun.h"
#include "genesis/static-symbols.h"
li reg_ALLOC, 1
.set reorder
- /* Mark us as in Lisp land. */
- sw zero, foreign_function_call_active
-
/* Load the allocation pointer, preserving the low-bit of alloc */
lw reg_BSP, dynamic_space_free_pointer
addu reg_ALLOC, reg_BSP
.set noreorder
bgez reg_NL4, 1f
subu reg_ALLOC, 1
- break 0x10
+ break 0x0, 0x10
1: .set reorder
/* Pass in args */
/* Indirect closure */
lw reg_CODE, CLOSURE_FUN_OFFSET(reg_LEXENV)
- /* Jump into lisp land. */
addu reg_LIP, reg_CODE, SIMPLE_FUN_CODE_OFFSET
+
+ /* Mark us as in Lisp land. */
+ sw zero, foreign_function_call_active
+
+ /* Jump into lisp land. */
jr reg_LIP
- .align 2
+ .align 3
.set noreorder
lra: .word RETURN_PC_HEADER_WIDETAG
addu reg_ALLOC, 1
.set reorder
+ /* Mark us as in C land. */
+ sw reg_CSP, foreign_function_call_active
+
/* Save LISP state. */
subu reg_NL0, reg_ALLOC, 1
sw reg_NL0, dynamic_space_free_pointer
sw reg_CSP, current_control_stack_pointer
sw reg_CFP, current_control_frame_pointer
- /* Mark us as in C land. */
- sw reg_CSP, foreign_function_call_active
-
/* Check for interrupt */
.set noreorder
bgez reg_NL4, 1f
subu reg_ALLOC, 1
- break 0x10
+ break 0x0, 0x10
1: .set reorder
/* Pass one return value back to C land. For a 64bit value, we may
addu reg_ALLOC, 1
.set reorder
+ /* Mark us as in C land. */
+ sw reg_CSP, foreign_function_call_active
+
/* Convert the return address to an offset and save it on the stack. */
subu reg_NFP, reg_LIP, reg_CODE
addu reg_NFP, OTHER_POINTER_LOWTAG
sw reg_CSP, current_control_stack_pointer
sw reg_CFP, current_control_frame_pointer
- /* Mark us as in C land. */
- sw reg_CSP, foreign_function_call_active
-
/* Check for interrupt */
.set noreorder
bgez reg_NL4, 1f
subu reg_ALLOC, 1
- break 0x10
+ break 0x0, 0x10
1: .set reorder
/* Into C land we go. */
li reg_ALLOC, 1
.set reorder
- /* Mark us as in Lisp land. */
- sw zero, foreign_function_call_active
-
/* Load the allocation pointer, preserving the low-bit of alloc */
lw reg_BSP, dynamic_space_free_pointer
addu reg_ALLOC, reg_BSP
.set noreorder
bgez reg_NL4, 1f
subu reg_ALLOC, 1
- break 0x10
+ break 0x0, 0x10
1: .set reorder
/* Reset the lisp stack. */
move reg_CSP, reg_CFP
move reg_CFP, reg_OCFP
+ /* Mark us as in Lisp land. */
+ sw zero, foreign_function_call_active
+
/* Return to LISP. */
jr reg_LIP
END(call_into_c)
*
* The undefined-function trampoline.
*/
- .align 2
+ .align 3 /* minimum alignment for a lisp object */
.word SIMPLE_FUN_HEADER_WIDETAG /* header */
.word undefined_tramp - SIMPLE_FUN_CODE_OFFSET /* self */
.word NIL /* next */
.word NIL /* arglist */
.word NIL /* type */
LEAF(undefined_tramp)
- break trap_Error
- .byte 4
- .byte UNDEFINED_FUN_ERROR
- .byte 254
- .byte (0xc0 + sc_DescriptorReg)
- .byte 1
+ /* Point reg_CODE to the header and tag it as function, since
+ the debugger regards a function pointer in reg_CODE which
+ doesn't point to a code object as undefined function. */
+ lui reg_CODE, %hi(undefined_tramp)
+ addiu reg_CODE, %lo(undefined_tramp)
+ addiu reg_CODE, - 24 + FUN_POINTER_LOWTAG
+ .set noreorder
+ b 1f
+ break 0x0, trap_Cerror
+ /* Error data length. */
+ .byte 4
+ /* Error number. */
+ .byte UNDEFINED_FUN_ERROR
+ /* Magic value 254 means a 16bit little endian value follows.
+ See debug-var-io.lisp. */
+ .byte 254
+ /* reg_FDEFN is #14. */
+ .byte ((14 << 5) + sc_DescriptorReg) % 0x100
+ .byte ((14 << 5) + sc_DescriptorReg) / 0x100
.align 2
+ .set reorder
+1: lw reg_CODE, FDEFN_FUN_OFFSET(reg_FDEFN)
+ lw reg_LIP, SIMPLE_FUN_CODE_OFFSET(reg_CODE)
+ jr reg_LIP
END(undefined_tramp)
/*
* The closure trampoline.
*/
- .align 2
+ .align 5 /* common MIPS cacheline size */
+ .word 0 /* pad 1 */
+ .word 0 /* pad 2 */
.word SIMPLE_FUN_HEADER_WIDETAG /* header */
.word closure_tramp - SIMPLE_FUN_CODE_OFFSET /* self */
.word NIL /* next */
END(closure_tramp)
/*
- * Function-end breakpoint magic.
+ * The trampoline for funcallable instances
*/
+ .globl funcallable_instance_tramp
.align 3
- LEAF(fun_end_breakpoint_guts)
- .set noreorder
- .word RETURN_PC_HEADER_WIDETAG
+ .word SIMPLE_FUN_HEADER_WIDETAG
+funcallable_instance_tramp = . + 1
+ .word funcallable_instance_tramp
+ .word NIL
+ .word NIL
+ .word NIL
+ .word NIL
+
+ lw reg_LEXENV, FUNCALLABLE_INSTANCE_FUNCTION_OFFSET(reg_LEXENV)
+ lw reg_CODE, CLOSURE_FUN_OFFSET(reg_LEXENV)
+ addu reg_LIP, reg_CODE, SIMPLE_FUN_CODE_OFFSET
+ jr reg_LIP
+ nop
- b multiple_value_return
+/*
+ * Function-end breakpoint magic. This is truely magic, the code is
+ * copied and has to be relocatable. It also needs a properly aligned
+ * header tag after the fun_end_breakpoint_guts symbol.
+ */
+ .align 3 /* minimum alignment for a lisp object */
+ LEAF(fun_end_breakpoint_guts)
+ .set noreorder
+ .word RETURN_PC_HEADER_WIDETAG
+ b multiple_value_return
nop
- .set reorder
+ .set reorder
+
+ /* single value return */
move reg_OCFP, reg_CSP
addu reg_CSP, 4
multiple_value_return:
FEXPORT(fun_end_breakpoint_trap)
- break trap_FunEndBreakpoint
+ break 0x0, trap_FunEndBreakpoint
b multiple_value_return
EXPORT(fun_end_breakpoint_end)
END(fun_end_breakpoint_guts)
projects / sbcl.git / blobdiff