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"
32 #define ALIGNED_SIZE(n) ((n) + LOWTAG_MASK) & ~LOWTAG_MASK
34 #ifdef LISP_FEATURE_GENCGC
35 extern lispobj
*alloc(long bytes
);
42 #ifdef LISP_FEATURE_GENCGC
43 struct thread
*th
= arch_os_get_current_thread();
45 /* FIXME: OOAO violation: see arch_pseudo_* */
46 clear_pseudo_atomic_interrupted(th
);
47 set_pseudo_atomic_atomic(th
);
48 result
= alloc(bytes
);
49 clear_pseudo_atomic_atomic(th
);
51 if (get_pseudo_atomic_interrupted(th
)) {
52 /* WARNING KLUDGE FIXME: pa_alloc() is not pseudo-atomic on
53 * anything but x86[-64]. maybe_defer_handler doesn't defer
54 * interrupts if foreign_function_call_active
56 * If the C stack is not scavenged during GC, result needs to
57 * be protected against not being referred to by any roots, so
58 * we push it onto the lisp control stack, and read it back
59 * off after any potential GC has finished */
60 #ifndef LISP_FEATURE_C_STACK_IS_CONTROL_STACK
61 #ifdef LISP_FEATURE_STACK_GROWS_DOWNWARD_NOT_UPWARD
62 #error "!C_STACK_IS_CONTROL_STACK and STACK_GROWS_DOWNWARD_NOT_UPWARD is not supported"
64 *current_control_stack_pointer
= (lispobj
) result
;
65 current_control_stack_pointer
+= 1;
67 do_pending_interrupt();
68 #ifndef LISP_FEATURE_C_STACK_IS_CONTROL_STACK
69 current_control_stack_pointer
-= 1;
70 result
= (lispobj
*) *current_control_stack_pointer
;
74 /* FIXME: this is not pseudo atomic at all, but is called only from
75 * interrupt safe places like interrupt handlers. MG - 2005-08-09 */
76 result
= dynamic_space_free_pointer
;
78 /* Align up to next dual word boundary. */
79 bytes
= ALIGNED_SIZE(bytes
);
81 dynamic_space_free_pointer
= (lispobj
*)((char *)result
+ bytes
);
83 if (current_auto_gc_trigger
84 && dynamic_space_free_pointer
> current_auto_gc_trigger
) {
85 clear_auto_gc_trigger();
86 set_auto_gc_trigger((char *)dynamic_space_free_pointer
87 - (char *)current_dynamic_space
);
95 alloc_unboxed(int type
, int words
)
99 result
= pa_alloc(ALIGNED_SIZE((1 + words
) * sizeof(lispobj
)));
100 *result
= (lispobj
) (words
<< N_WIDETAG_BITS
) | type
;
105 alloc_vector(int type
, int length
, int size
)
107 struct vector
*result
;
109 result
= (struct vector
*)
110 pa_alloc(ALIGNED_SIZE((2 + (length
*size
+ 31) / 32) * sizeof(lispobj
)));
112 result
->header
= type
;
113 result
->length
= make_fixnum(length
);
115 return make_lispobj(result
,OTHER_POINTER_LOWTAG
);
119 alloc_cons(lispobj car
, lispobj cdr
)
121 struct cons
*ptr
= (struct cons
*)pa_alloc(ALIGNED_SIZE(sizeof(struct cons
)));
126 return make_lispobj(ptr
, LIST_POINTER_LOWTAG
);
134 if (-0x20000000 < n
&& n
< 0x20000000)
135 return make_fixnum(n
);
137 ptr
= (struct bignum
*)alloc_unboxed(BIGNUM_WIDETAG
, 1);
141 return make_lispobj(ptr
, OTHER_POINTER_LOWTAG
);
146 alloc_base_string(char *str
)
148 int len
= strlen(str
);
149 lispobj result
= alloc_vector(SIMPLE_BASE_STRING_WIDETAG
, len
+1, 8);
150 struct vector
*vec
= (struct vector
*)native_pointer(result
);
152 vec
->length
= make_fixnum(len
);
153 strcpy((char *)vec
->data
, str
);
163 alloc_unboxed((int)SAP_WIDETAG
, sizeof(struct sap
)/sizeof(lispobj
) -1);
165 return make_lispobj(sap
,OTHER_POINTER_LOWTAG
);