2 * allocation routines for C code. For allocation done by Lisp look
3 * instead at src/compiler/target/alloc.lisp and .../macros.lisp
7 * This software is part of the SBCL system. See the README file for
10 * This software is derived from the CMU CL system, which was
11 * written at Carnegie Mellon University and released into the
12 * public domain. The software is in the public domain and is
13 * provided with absolutely no warranty. See the COPYING and CREDITS
14 * files for more information.
27 #include "genesis/vector.h"
28 #include "genesis/cons.h"
29 #include "genesis/bignum.h"
30 #include "genesis/sap.h"
31 #include "genesis/code.h"
33 #define ALIGNED_SIZE(n) ((n) + LOWTAG_MASK) & ~LOWTAG_MASK
35 #ifdef LISP_FEATURE_GENCGC
36 extern lispobj
*alloc(long bytes
);
43 #ifdef LISP_FEATURE_GENCGC
44 struct thread
*th
= arch_os_get_current_thread();
46 /* FIXME: OOAO violation: see arch_pseudo_* */
47 clear_pseudo_atomic_interrupted(th
);
48 set_pseudo_atomic_atomic(th
);
49 result
= alloc(bytes
);
50 clear_pseudo_atomic_atomic(th
);
52 if (get_pseudo_atomic_interrupted(th
)) {
53 /* WARNING KLUDGE FIXME: pa_alloc() is not pseudo-atomic on
54 * anything but x86[-64]. maybe_defer_handler doesn't defer
55 * interrupts if foreign_function_call_active
57 * If the C stack is not scavenged during GC, result needs to
58 * be protected against not being referred to by any roots, so
59 * we push it onto the lisp control stack, and read it back
60 * off after any potential GC has finished */
61 #ifndef LISP_FEATURE_C_STACK_IS_CONTROL_STACK
62 #ifdef LISP_FEATURE_STACK_GROWS_DOWNWARD_NOT_UPWARD
63 #error "!C_STACK_IS_CONTROL_STACK and STACK_GROWS_DOWNWARD_NOT_UPWARD is not supported"
65 *current_control_stack_pointer
= (lispobj
) result
;
66 current_control_stack_pointer
+= 1;
68 do_pending_interrupt();
69 #ifndef LISP_FEATURE_C_STACK_IS_CONTROL_STACK
70 current_control_stack_pointer
-= 1;
71 result
= (lispobj
*) *current_control_stack_pointer
;
75 /* FIXME: this is not pseudo atomic at all, but is called only from
76 * interrupt safe places like interrupt handlers. MG - 2005-08-09 */
77 result
= dynamic_space_free_pointer
;
79 /* Align up to next dual word boundary. */
80 bytes
= ALIGNED_SIZE(bytes
);
82 dynamic_space_free_pointer
= (lispobj
*)((char *)result
+ bytes
);
84 if (current_auto_gc_trigger
85 && dynamic_space_free_pointer
> current_auto_gc_trigger
) {
86 clear_auto_gc_trigger();
87 set_auto_gc_trigger((char *)dynamic_space_free_pointer
88 - (char *)current_dynamic_space
);
96 alloc_unboxed(int type
, int words
)
100 result
= pa_alloc(ALIGNED_SIZE((1 + words
) * sizeof(lispobj
)));
101 *result
= (lispobj
) (words
<< N_WIDETAG_BITS
) | type
;
106 alloc_vector(int type
, int length
, int size
)
108 struct vector
*result
;
110 result
= (struct vector
*)
111 pa_alloc(ALIGNED_SIZE((2 + (length
*size
+ 31) / 32) * sizeof(lispobj
)));
113 result
->header
= type
;
114 result
->length
= make_fixnum(length
);
116 return make_lispobj(result
,OTHER_POINTER_LOWTAG
);
120 alloc_cons(lispobj car
, lispobj cdr
)
123 (struct cons
*)pa_alloc(ALIGNED_SIZE(sizeof(struct cons
)));
128 return make_lispobj(ptr
, LIST_POINTER_LOWTAG
);
136 if (-0x20000000 < n
&& n
< 0x20000000)
137 return make_fixnum(n
);
139 ptr
= (struct bignum
*)alloc_unboxed(BIGNUM_WIDETAG
, 1);
143 return make_lispobj(ptr
, OTHER_POINTER_LOWTAG
);
148 alloc_base_string(char *str
)
150 int len
= strlen(str
);
151 lispobj result
= alloc_vector(SIMPLE_BASE_STRING_WIDETAG
, len
+1, 8);
152 struct vector
*vec
= (struct vector
*)native_pointer(result
);
154 vec
->length
= make_fixnum(len
);
155 strcpy((char *)vec
->data
, str
);
165 alloc_unboxed((int)SAP_WIDETAG
, sizeof(struct sap
)/sizeof(lispobj
) -1);
167 return make_lispobj(sap
,OTHER_POINTER_LOWTAG
);
171 alloc_code_object (unsigned boxed
, unsigned unboxed
) {
174 boxed
= make_fixnum(boxed
+ 1 + 4); /* 4 == trace_table_offset offset in words */
175 boxed
&= ~LOWTAG_MASK
;
177 unboxed
+= LOWTAG_MASK
;
178 unboxed
&= ~LOWTAG_MASK
;
180 code
= (struct code
*) pa_alloc(ALIGNED_SIZE((boxed
+ unboxed
) * sizeof(lispobj
)));
182 boxed
= boxed
<< (N_WIDETAG_BITS
- WORD_SHIFT
);
183 code
->header
= boxed
| CODE_HEADER_WIDETAG
;
184 code
->code_size
= unboxed
;
185 code
->entry_points
= NIL
;
186 code
->debug_info
= NIL
;
187 return make_lispobj(code
, OTHER_POINTER_LOWTAG
);