2 * C-level stuff to implement Lisp-level PURIFY
6 * This software is part of the SBCL system. See the README file for
9 * This software is derived from the CMU CL system, which was
10 * written at Carnegie Mellon University and released into the
11 * public domain. The software is in the public domain and is
12 * provided with absolutely no warranty. See the COPYING and CREDITS
13 * files for more information.
17 #include <sys/types.h>
20 #if (defined(LISP_FEATURE_SB_THREAD) && defined(LISP_FEATURE_LINUX))
21 #include <sys/ptrace.h>
22 #include <linux/user.h>
31 #include "interrupt.h"
35 #include "gc-internal.h"
37 #include "genesis/primitive-objects.h"
38 #include "genesis/static-symbols.h"
43 /* again, what's so special about the x86 that this is differently
44 * visible there than on other platforms? -dan 20010125
46 static lispobj *dynamic_space_free_pointer;
48 extern unsigned long bytes_consed_between_gcs;
51 lose("GC invariant lost, file \"%s\", line %d", __FILE__, __LINE__)
54 #define gc_assert(ex) do { \
55 if (!(ex)) gc_abort(); \
62 /* These hold the original end of the read_only and static spaces so
63 * we can tell what are forwarding pointers. */
65 static lispobj *read_only_end, *static_end;
67 static lispobj *read_only_free, *static_free;
69 static lispobj *pscav(lispobj *addr, int nwords, boolean constant);
71 #define LATERBLOCKSIZE 1020
72 #define LATERMAXCOUNT 10
81 } *later_blocks = NULL;
82 static int later_count = 0;
84 #define CEILING(x,y) (((x) + ((y) - 1)) & (~((y) - 1)))
85 #define NWORDS(x,y) (CEILING((x),(y)) / (y))
87 /* FIXME: Shouldn't this be defined in sbcl.h? See also notes in
91 #define FUN_RAW_ADDR_OFFSET 0
93 #define FUN_RAW_ADDR_OFFSET (6*sizeof(lispobj) - FUN_POINTER_LOWTAG)
97 forwarding_pointer_p(lispobj obj)
99 lispobj *ptr = native_pointer(obj);
101 return ((static_end <= ptr && ptr <= static_free) ||
102 (read_only_end <= ptr && ptr <= read_only_free));
106 dynamic_pointer_p(lispobj ptr)
109 return (ptr >= (lispobj)current_dynamic_space
111 ptr < (lispobj)dynamic_space_free_pointer);
113 /* Be more conservative, and remember, this is a maybe. */
114 return (ptr >= (lispobj)DYNAMIC_SPACE_START
116 ptr < (lispobj)dynamic_space_free_pointer);
123 #ifdef LISP_FEATURE_GENCGC
125 * enhanced x86/GENCGC stack scavenging by Douglas Crosher
127 * Scavenging the stack on the i386 is problematic due to conservative
128 * roots and raw return addresses. Here it is handled in two passes:
129 * the first pass runs before any objects are moved and tries to
130 * identify valid pointers and return address on the stack, the second
131 * pass scavenges these.
134 static unsigned pointer_filter_verbose = 0;
136 /* FIXME: This is substantially the same code as
137 * possibly_valid_dynamic_space_pointer in gencgc.c. The only
138 * relevant difference seems to be that the gencgc code also checks
139 * for raw pointers into Code objects */
142 valid_dynamic_space_pointer(lispobj *pointer, lispobj *start_addr)
144 /* If it's not a return address then it needs to be a valid Lisp
146 if (!is_lisp_pointer((lispobj)pointer))
149 /* Check that the object pointed to is consistent with the pointer
151 switch (lowtag_of((lispobj)pointer)) {
152 case FUN_POINTER_LOWTAG:
153 /* Start_addr should be the enclosing code object, or a closure
155 switch (widetag_of(*start_addr)) {
156 case CODE_HEADER_WIDETAG:
157 /* This case is probably caught above. */
159 case CLOSURE_HEADER_WIDETAG:
160 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
161 if ((int)pointer != ((int)start_addr+FUN_POINTER_LOWTAG)) {
162 if (pointer_filter_verbose) {
163 fprintf(stderr,"*Wf2: %x %x %x\n", (unsigned int) pointer,
164 (unsigned int) start_addr, *start_addr);
170 if (pointer_filter_verbose) {
171 fprintf(stderr,"*Wf3: %x %x %x\n", (unsigned int) pointer,
172 (unsigned int) start_addr, *start_addr);
177 case LIST_POINTER_LOWTAG:
178 if ((int)pointer != ((int)start_addr+LIST_POINTER_LOWTAG)) {
179 if (pointer_filter_verbose)
180 fprintf(stderr,"*Wl1: %x %x %x\n", (unsigned int) pointer,
181 (unsigned int) start_addr, *start_addr);
184 /* Is it plausible cons? */
185 if ((is_lisp_pointer(start_addr[0])
186 || ((start_addr[0] & 3) == 0) /* fixnum */
187 || (widetag_of(start_addr[0]) == BASE_CHAR_WIDETAG)
188 || (widetag_of(start_addr[0]) == UNBOUND_MARKER_WIDETAG))
189 && (is_lisp_pointer(start_addr[1])
190 || ((start_addr[1] & 3) == 0) /* fixnum */
191 || (widetag_of(start_addr[1]) == BASE_CHAR_WIDETAG)
192 || (widetag_of(start_addr[1]) == UNBOUND_MARKER_WIDETAG))) {
195 if (pointer_filter_verbose) {
196 fprintf(stderr,"*Wl2: %x %x %x\n", (unsigned int) pointer,
197 (unsigned int) start_addr, *start_addr);
201 case INSTANCE_POINTER_LOWTAG:
202 if ((int)pointer != ((int)start_addr+INSTANCE_POINTER_LOWTAG)) {
203 if (pointer_filter_verbose) {
204 fprintf(stderr,"*Wi1: %x %x %x\n", (unsigned int) pointer,
205 (unsigned int) start_addr, *start_addr);
209 if (widetag_of(start_addr[0]) != INSTANCE_HEADER_WIDETAG) {
210 if (pointer_filter_verbose) {
211 fprintf(stderr,"*Wi2: %x %x %x\n", (unsigned int) pointer,
212 (unsigned int) start_addr, *start_addr);
217 case OTHER_POINTER_LOWTAG:
218 if ((int)pointer != ((int)start_addr+OTHER_POINTER_LOWTAG)) {
219 if (pointer_filter_verbose) {
220 fprintf(stderr,"*Wo1: %x %x %x\n", (unsigned int) pointer,
221 (unsigned int) start_addr, *start_addr);
225 /* Is it plausible? Not a cons. XXX should check the headers. */
226 if (is_lisp_pointer(start_addr[0]) || ((start_addr[0] & 3) == 0)) {
227 if (pointer_filter_verbose) {
228 fprintf(stderr,"*Wo2: %x %x %x\n", (unsigned int) pointer,
229 (unsigned int) start_addr, *start_addr);
233 switch (widetag_of(start_addr[0])) {
234 case UNBOUND_MARKER_WIDETAG:
235 case BASE_CHAR_WIDETAG:
236 if (pointer_filter_verbose) {
237 fprintf(stderr,"*Wo3: %x %x %x\n", (unsigned int) pointer,
238 (unsigned int) start_addr, *start_addr);
242 /* only pointed to by function pointers? */
243 case CLOSURE_HEADER_WIDETAG:
244 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
245 if (pointer_filter_verbose) {
246 fprintf(stderr,"*Wo4: %x %x %x\n", (unsigned int) pointer,
247 (unsigned int) start_addr, *start_addr);
251 case INSTANCE_HEADER_WIDETAG:
252 if (pointer_filter_verbose) {
253 fprintf(stderr,"*Wo5: %x %x %x\n", (unsigned int) pointer,
254 (unsigned int) start_addr, *start_addr);
258 /* the valid other immediate pointer objects */
259 case SIMPLE_VECTOR_WIDETAG:
261 case COMPLEX_WIDETAG:
262 #ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
263 case COMPLEX_SINGLE_FLOAT_WIDETAG:
265 #ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
266 case COMPLEX_DOUBLE_FLOAT_WIDETAG:
268 #ifdef COMPLEX_LONG_FLOAT_WIDETAG
269 case COMPLEX_LONG_FLOAT_WIDETAG:
271 case SIMPLE_ARRAY_WIDETAG:
272 case COMPLEX_BASE_STRING_WIDETAG:
273 case COMPLEX_VECTOR_NIL_WIDETAG:
274 case COMPLEX_BIT_VECTOR_WIDETAG:
275 case COMPLEX_VECTOR_WIDETAG:
276 case COMPLEX_ARRAY_WIDETAG:
277 case VALUE_CELL_HEADER_WIDETAG:
278 case SYMBOL_HEADER_WIDETAG:
280 case CODE_HEADER_WIDETAG:
282 case SINGLE_FLOAT_WIDETAG:
283 case DOUBLE_FLOAT_WIDETAG:
284 #ifdef LONG_FLOAT_WIDETAG
285 case LONG_FLOAT_WIDETAG:
287 case SIMPLE_BASE_STRING_WIDETAG:
288 case SIMPLE_BIT_VECTOR_WIDETAG:
289 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
290 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
291 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
292 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
293 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
294 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
295 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
297 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
298 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
300 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
301 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
303 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
304 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
306 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
307 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
308 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
309 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
311 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
312 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
314 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
315 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
317 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
318 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
321 case WEAK_POINTER_WIDETAG:
325 if (pointer_filter_verbose) {
326 fprintf(stderr,"*Wo6: %x %x %x\n", (unsigned int) pointer,
327 (unsigned int) start_addr, *start_addr);
333 if (pointer_filter_verbose) {
334 fprintf(stderr,"*W?: %x %x %x\n", (unsigned int) pointer,
335 (unsigned int) start_addr, *start_addr);
344 #define MAX_STACK_POINTERS 256
345 lispobj *valid_stack_locations[MAX_STACK_POINTERS];
346 unsigned int num_valid_stack_locations;
348 #define MAX_STACK_RETURN_ADDRESSES 128
349 lispobj *valid_stack_ra_locations[MAX_STACK_RETURN_ADDRESSES];
350 lispobj *valid_stack_ra_code_objects[MAX_STACK_RETURN_ADDRESSES];
351 unsigned int num_valid_stack_ra_locations;
353 /* Identify valid stack slots. */
355 setup_i386_stack_scav(lispobj *lowaddr, lispobj *base)
357 lispobj *sp = lowaddr;
358 num_valid_stack_locations = 0;
359 num_valid_stack_ra_locations = 0;
360 for (sp = lowaddr; sp < base; sp++) {
362 /* Find the object start address */
363 lispobj *start_addr = search_dynamic_space((void *)thing);
365 /* We need to allow raw pointers into Code objects for
366 * return addresses. This will also pick up pointers to
367 * functions in code objects. */
368 if (widetag_of(*start_addr) == CODE_HEADER_WIDETAG) {
369 /* FIXME asserting here is a really dumb thing to do.
370 * If we've overflowed some arbitrary static limit, we
371 * should just refuse to purify, instead of killing
372 * the whole lisp session
374 gc_assert(num_valid_stack_ra_locations <
375 MAX_STACK_RETURN_ADDRESSES);
376 valid_stack_ra_locations[num_valid_stack_ra_locations] = sp;
377 valid_stack_ra_code_objects[num_valid_stack_ra_locations++] =
378 (lispobj *)((int)start_addr + OTHER_POINTER_LOWTAG);
380 if (valid_dynamic_space_pointer((void *)thing, start_addr)) {
381 gc_assert(num_valid_stack_locations < MAX_STACK_POINTERS);
382 valid_stack_locations[num_valid_stack_locations++] = sp;
387 if (pointer_filter_verbose) {
388 fprintf(stderr, "number of valid stack pointers = %d\n",
389 num_valid_stack_locations);
390 fprintf(stderr, "number of stack return addresses = %d\n",
391 num_valid_stack_ra_locations);
396 pscav_i386_stack(void)
400 for (i = 0; i < num_valid_stack_locations; i++)
401 pscav(valid_stack_locations[i], 1, 0);
403 for (i = 0; i < num_valid_stack_ra_locations; i++) {
404 lispobj code_obj = (lispobj)valid_stack_ra_code_objects[i];
405 pscav(&code_obj, 1, 0);
406 if (pointer_filter_verbose) {
407 fprintf(stderr,"*C moved RA %x to %x; for code object %x to %x\n",
408 *valid_stack_ra_locations[i],
409 (int)(*valid_stack_ra_locations[i])
410 - ((int)valid_stack_ra_code_objects[i] - (int)code_obj),
411 (unsigned int) valid_stack_ra_code_objects[i], code_obj);
413 *valid_stack_ra_locations[i] =
414 ((int)(*valid_stack_ra_locations[i])
415 - ((int)valid_stack_ra_code_objects[i] - (int)code_obj));
423 pscav_later(lispobj *where, int count)
427 if (count > LATERMAXCOUNT) {
428 while (count > LATERMAXCOUNT) {
429 pscav_later(where, LATERMAXCOUNT);
430 count -= LATERMAXCOUNT;
431 where += LATERMAXCOUNT;
435 if (later_blocks == NULL || later_count == LATERBLOCKSIZE ||
436 (later_count == LATERBLOCKSIZE-1 && count > 1)) {
437 new = (struct later *)malloc(sizeof(struct later));
438 new->next = later_blocks;
439 if (later_blocks && later_count < LATERBLOCKSIZE)
440 later_blocks->u[later_count].ptr = NULL;
446 later_blocks->u[later_count++].count = count;
447 later_blocks->u[later_count++].ptr = where;
452 ptrans_boxed(lispobj thing, lispobj header, boolean constant)
455 lispobj result, *new, *old;
457 nwords = 1 + HeaderValue(header);
460 old = (lispobj *)native_pointer(thing);
462 new = read_only_free;
463 read_only_free += CEILING(nwords, 2);
467 static_free += CEILING(nwords, 2);
471 bcopy(old, new, nwords * sizeof(lispobj));
473 /* Deposit forwarding pointer. */
474 result = make_lispobj(new, lowtag_of(thing));
478 pscav(new, nwords, constant);
483 /* We need to look at the layout to see whether it is a pure structure
484 * class, and only then can we transport as constant. If it is pure,
485 * we can ALWAYS transport as a constant. */
487 ptrans_instance(lispobj thing, lispobj header, boolean constant)
489 lispobj layout = ((struct instance *)native_pointer(thing))->slots[0];
490 lispobj pure = ((struct instance *)native_pointer(layout))->slots[15];
494 return (ptrans_boxed(thing, header, 1));
496 return (ptrans_boxed(thing, header, 0));
499 /* Substructure: special case for the COMPACT-INFO-ENVs,
500 * where the instance may have a point to the dynamic
501 * space placed into it (e.g. the cache-name slot), but
502 * the lists and arrays at the time of a purify can be
503 * moved to the RO space. */
505 lispobj result, *new, *old;
507 nwords = 1 + HeaderValue(header);
510 old = (lispobj *)native_pointer(thing);
512 static_free += CEILING(nwords, 2);
515 bcopy(old, new, nwords * sizeof(lispobj));
517 /* Deposit forwarding pointer. */
518 result = make_lispobj(new, lowtag_of(thing));
522 pscav(new, nwords, 1);
528 return NIL; /* dummy value: return something ... */
533 ptrans_fdefn(lispobj thing, lispobj header)
536 lispobj result, *new, *old, oldfn;
539 nwords = 1 + HeaderValue(header);
542 old = (lispobj *)native_pointer(thing);
544 static_free += CEILING(nwords, 2);
547 bcopy(old, new, nwords * sizeof(lispobj));
549 /* Deposit forwarding pointer. */
550 result = make_lispobj(new, lowtag_of(thing));
553 /* Scavenge the function. */
554 fdefn = (struct fdefn *)new;
556 pscav(&fdefn->fun, 1, 0);
557 if ((char *)oldfn + FUN_RAW_ADDR_OFFSET == fdefn->raw_addr)
558 fdefn->raw_addr = (char *)fdefn->fun + FUN_RAW_ADDR_OFFSET;
564 ptrans_unboxed(lispobj thing, lispobj header)
567 lispobj result, *new, *old;
569 nwords = 1 + HeaderValue(header);
572 old = (lispobj *)native_pointer(thing);
573 new = read_only_free;
574 read_only_free += CEILING(nwords, 2);
577 bcopy(old, new, nwords * sizeof(lispobj));
579 /* Deposit forwarding pointer. */
580 result = make_lispobj(new , lowtag_of(thing));
587 ptrans_vector(lispobj thing, int bits, int extra,
588 boolean boxed, boolean constant)
590 struct vector *vector;
592 lispobj result, *new;
594 vector = (struct vector *)native_pointer(thing);
595 nwords = 2 + (CEILING((fixnum_value(vector->length)+extra)*bits,32)>>5);
597 if (boxed && !constant) {
599 static_free += CEILING(nwords, 2);
602 new = read_only_free;
603 read_only_free += CEILING(nwords, 2);
606 bcopy(vector, new, nwords * sizeof(lispobj));
608 result = make_lispobj(new, lowtag_of(thing));
609 vector->header = result;
612 pscav(new, nwords, constant);
619 apply_code_fixups_during_purify(struct code *old_code, struct code *new_code)
621 int nheader_words, ncode_words, nwords;
622 void *constants_start_addr, *constants_end_addr;
623 void *code_start_addr, *code_end_addr;
624 lispobj fixups = NIL;
625 unsigned displacement = (unsigned)new_code - (unsigned)old_code;
626 struct vector *fixups_vector;
628 ncode_words = fixnum_value(new_code->code_size);
629 nheader_words = HeaderValue(*(lispobj *)new_code);
630 nwords = ncode_words + nheader_words;
632 constants_start_addr = (void *)new_code + 5*4;
633 constants_end_addr = (void *)new_code + nheader_words*4;
634 code_start_addr = (void *)new_code + nheader_words*4;
635 code_end_addr = (void *)new_code + nwords*4;
637 /* The first constant should be a pointer to the fixups for this
638 * code objects. Check. */
639 fixups = new_code->constants[0];
641 /* It will be 0 or the unbound-marker if there are no fixups, and
642 * will be an other-pointer to a vector if it is valid. */
644 (fixups==UNBOUND_MARKER_WIDETAG) ||
645 !is_lisp_pointer(fixups)) {
646 #ifdef LISP_FEATURE_GENCGC
647 /* Check for a possible errors. */
648 sniff_code_object(new_code,displacement);
653 fixups_vector = (struct vector *)native_pointer(fixups);
655 /* Could be pointing to a forwarding pointer. */
656 if (is_lisp_pointer(fixups) && (dynamic_pointer_p(fixups))
657 && forwarding_pointer_p(*(lispobj *)fixups_vector)) {
658 /* If so then follow it. */
660 (struct vector *)native_pointer(*(lispobj *)fixups_vector);
663 if (widetag_of(fixups_vector->header) ==
664 SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG) {
665 /* We got the fixups for the code block. Now work through the
666 * vector, and apply a fixup at each address. */
667 int length = fixnum_value(fixups_vector->length);
669 for (i=0; i<length; i++) {
670 unsigned offset = fixups_vector->data[i];
671 /* Now check the current value of offset. */
673 *(unsigned *)((unsigned)code_start_addr + offset);
675 /* If it's within the old_code object then it must be an
676 * absolute fixup (relative ones are not saved) */
677 if ((old_value>=(unsigned)old_code)
678 && (old_value<((unsigned)old_code + nwords*4)))
679 /* So add the dispacement. */
680 *(unsigned *)((unsigned)code_start_addr + offset) = old_value
683 /* It is outside the old code object so it must be a relative
684 * fixup (absolute fixups are not saved). So subtract the
686 *(unsigned *)((unsigned)code_start_addr + offset) = old_value
691 /* No longer need the fixups. */
692 new_code->constants[0] = 0;
694 #ifdef LISP_FEATURE_GENCGC
695 /* Check for possible errors. */
696 sniff_code_object(new_code,displacement);
702 ptrans_code(lispobj thing)
704 struct code *code, *new;
706 lispobj func, result;
708 code = (struct code *)native_pointer(thing);
709 nwords = HeaderValue(code->header) + fixnum_value(code->code_size);
711 new = (struct code *)read_only_free;
712 read_only_free += CEILING(nwords, 2);
714 bcopy(code, new, nwords * sizeof(lispobj));
716 #ifdef LISP_FEATURE_X86
717 apply_code_fixups_during_purify(code,new);
720 result = make_lispobj(new, OTHER_POINTER_LOWTAG);
722 /* Stick in a forwarding pointer for the code object. */
723 *(lispobj *)code = result;
725 /* Put in forwarding pointers for all the functions. */
726 for (func = code->entry_points;
728 func = ((struct simple_fun *)native_pointer(func))->next) {
730 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
732 *(lispobj *)native_pointer(func) = result + (func - thing);
735 /* Arrange to scavenge the debug info later. */
736 pscav_later(&new->debug_info, 1);
738 if (new->trace_table_offset & 0x3)
740 pscav(&new->trace_table_offset, 1, 0);
742 new->trace_table_offset = NIL; /* limit lifetime */
745 /* Scavenge the constants. */
746 pscav(new->constants, HeaderValue(new->header)-5, 1);
748 /* Scavenge all the functions. */
749 pscav(&new->entry_points, 1, 1);
750 for (func = new->entry_points;
752 func = ((struct simple_fun *)native_pointer(func))->next) {
753 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
754 gc_assert(!dynamic_pointer_p(func));
757 /* Temporarly convert the self pointer to a real function pointer. */
758 ((struct simple_fun *)native_pointer(func))->self
759 -= FUN_RAW_ADDR_OFFSET;
761 pscav(&((struct simple_fun *)native_pointer(func))->self, 2, 1);
763 ((struct simple_fun *)native_pointer(func))->self
764 += FUN_RAW_ADDR_OFFSET;
766 pscav_later(&((struct simple_fun *)native_pointer(func))->name, 3);
773 ptrans_func(lispobj thing, lispobj header)
776 lispobj code, *new, *old, result;
777 struct simple_fun *function;
779 /* Thing can either be a function header, a closure function
780 * header, a closure, or a funcallable-instance. If it's a closure
781 * or a funcallable-instance, we do the same as ptrans_boxed.
782 * Otherwise we have to do something strange, 'cause it is buried
783 * inside a code object. */
785 if (widetag_of(header) == SIMPLE_FUN_HEADER_WIDETAG ||
786 widetag_of(header) == CLOSURE_FUN_HEADER_WIDETAG) {
788 /* We can only end up here if the code object has not been
789 * scavenged, because if it had been scavenged, forwarding pointers
790 * would have been left behind for all the entry points. */
792 function = (struct simple_fun *)native_pointer(thing);
795 ((native_pointer(thing) -
796 (HeaderValue(function->header))), OTHER_POINTER_LOWTAG);
798 /* This will cause the function's header to be replaced with a
799 * forwarding pointer. */
803 /* So we can just return that. */
804 return function->header;
807 /* It's some kind of closure-like thing. */
808 nwords = 1 + HeaderValue(header);
809 old = (lispobj *)native_pointer(thing);
811 /* Allocate the new one. */
812 if (widetag_of(header) == FUNCALLABLE_INSTANCE_HEADER_WIDETAG) {
813 /* FINs *must* not go in read_only space. */
815 static_free += CEILING(nwords, 2);
818 /* Closures can always go in read-only space, 'cause they
821 new = read_only_free;
822 read_only_free += CEILING(nwords, 2);
825 bcopy(old, new, nwords * sizeof(lispobj));
827 /* Deposit forwarding pointer. */
828 result = make_lispobj(new, lowtag_of(thing));
832 pscav(new, nwords, 0);
839 ptrans_returnpc(lispobj thing, lispobj header)
843 /* Find the corresponding code object. */
844 code = thing - HeaderValue(header)*sizeof(lispobj);
846 /* Make sure it's been transported. */
847 new = *(lispobj *)native_pointer(code);
848 if (!forwarding_pointer_p(new))
849 new = ptrans_code(code);
851 /* Maintain the offset: */
852 return new + (thing - code);
855 #define WORDS_PER_CONS CEILING(sizeof(struct cons) / sizeof(lispobj), 2)
858 ptrans_list(lispobj thing, boolean constant)
860 struct cons *old, *new, *orig;
864 orig = (struct cons *)read_only_free;
866 orig = (struct cons *)static_free;
870 /* Allocate a new cons cell. */
871 old = (struct cons *)native_pointer(thing);
873 new = (struct cons *)read_only_free;
874 read_only_free += WORDS_PER_CONS;
877 new = (struct cons *)static_free;
878 static_free += WORDS_PER_CONS;
881 /* Copy the cons cell and keep a pointer to the cdr. */
883 thing = new->cdr = old->cdr;
885 /* Set up the forwarding pointer. */
886 *(lispobj *)old = make_lispobj(new, LIST_POINTER_LOWTAG);
888 /* And count this cell. */
890 } while (lowtag_of(thing) == LIST_POINTER_LOWTAG &&
891 dynamic_pointer_p(thing) &&
892 !(forwarding_pointer_p(*(lispobj *)native_pointer(thing))));
894 /* Scavenge the list we just copied. */
895 pscav((lispobj *)orig, length * WORDS_PER_CONS, constant);
897 return make_lispobj(orig, LIST_POINTER_LOWTAG);
901 ptrans_otherptr(lispobj thing, lispobj header, boolean constant)
903 switch (widetag_of(header)) {
904 /* FIXME: this needs a reindent */
906 case SINGLE_FLOAT_WIDETAG:
907 case DOUBLE_FLOAT_WIDETAG:
908 #ifdef LONG_FLOAT_WIDETAG
909 case LONG_FLOAT_WIDETAG:
911 #ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
912 case COMPLEX_SINGLE_FLOAT_WIDETAG:
914 #ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
915 case COMPLEX_DOUBLE_FLOAT_WIDETAG:
917 #ifdef COMPLEX_LONG_FLOAT_WIDETAG
918 case COMPLEX_LONG_FLOAT_WIDETAG:
921 return ptrans_unboxed(thing, header);
924 case COMPLEX_WIDETAG:
925 case SIMPLE_ARRAY_WIDETAG:
926 case COMPLEX_BASE_STRING_WIDETAG:
927 case COMPLEX_VECTOR_NIL_WIDETAG:
928 case COMPLEX_VECTOR_WIDETAG:
929 case COMPLEX_ARRAY_WIDETAG:
930 return ptrans_boxed(thing, header, constant);
932 case VALUE_CELL_HEADER_WIDETAG:
933 case WEAK_POINTER_WIDETAG:
934 return ptrans_boxed(thing, header, 0);
936 case SYMBOL_HEADER_WIDETAG:
937 return ptrans_boxed(thing, header, 0);
939 case SIMPLE_BASE_STRING_WIDETAG:
940 return ptrans_vector(thing, 8, 1, 0, constant);
942 case SIMPLE_BIT_VECTOR_WIDETAG:
943 return ptrans_vector(thing, 1, 0, 0, constant);
945 case SIMPLE_VECTOR_WIDETAG:
946 return ptrans_vector(thing, 32, 0, 1, constant);
948 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
949 return ptrans_vector(thing, 2, 0, 0, constant);
951 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
952 return ptrans_vector(thing, 4, 0, 0, constant);
954 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
955 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
956 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
958 return ptrans_vector(thing, 8, 0, 0, constant);
960 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
961 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
962 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
964 return ptrans_vector(thing, 16, 0, 0, constant);
966 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
967 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
968 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
970 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
971 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
973 return ptrans_vector(thing, 32, 0, 0, constant);
975 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
976 return ptrans_vector(thing, 32, 0, 0, constant);
978 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
979 return ptrans_vector(thing, 64, 0, 0, constant);
981 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
982 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
984 return ptrans_vector(thing, 96, 0, 0, constant);
987 return ptrans_vector(thing, 128, 0, 0, constant);
991 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
992 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
993 return ptrans_vector(thing, 64, 0, 0, constant);
996 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
997 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
998 return ptrans_vector(thing, 128, 0, 0, constant);
1001 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
1002 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
1004 return ptrans_vector(thing, 192, 0, 0, constant);
1007 return ptrans_vector(thing, 256, 0, 0, constant);
1011 case CODE_HEADER_WIDETAG:
1012 return ptrans_code(thing);
1014 case RETURN_PC_HEADER_WIDETAG:
1015 return ptrans_returnpc(thing, header);
1018 return ptrans_fdefn(thing, header);
1021 /* Should only come across other pointers to the above stuff. */
1028 pscav_fdefn(struct fdefn *fdefn)
1032 fix_func = ((char *)(fdefn->fun+FUN_RAW_ADDR_OFFSET) == fdefn->raw_addr);
1033 pscav(&fdefn->name, 1, 1);
1034 pscav(&fdefn->fun, 1, 0);
1036 fdefn->raw_addr = (char *)(fdefn->fun + FUN_RAW_ADDR_OFFSET);
1037 return sizeof(struct fdefn) / sizeof(lispobj);
1041 /* now putting code objects in static space */
1043 pscav_code(struct code*code)
1047 nwords = HeaderValue(code->header) + fixnum_value(code->code_size);
1049 /* Arrange to scavenge the debug info later. */
1050 pscav_later(&code->debug_info, 1);
1052 /* Scavenge the constants. */
1053 pscav(code->constants, HeaderValue(code->header)-5, 1);
1055 /* Scavenge all the functions. */
1056 pscav(&code->entry_points, 1, 1);
1057 for (func = code->entry_points;
1059 func = ((struct simple_fun *)native_pointer(func))->next) {
1060 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
1061 gc_assert(!dynamic_pointer_p(func));
1064 /* Temporarily convert the self pointer to a real function
1066 ((struct simple_fun *)native_pointer(func))->self
1067 -= FUN_RAW_ADDR_OFFSET;
1069 pscav(&((struct simple_fun *)native_pointer(func))->self, 2, 1);
1071 ((struct simple_fun *)native_pointer(func))->self
1072 += FUN_RAW_ADDR_OFFSET;
1074 pscav_later(&((struct simple_fun *)native_pointer(func))->name, 3);
1077 return CEILING(nwords,2);
1082 pscav(lispobj *addr, int nwords, boolean constant)
1084 lispobj thing, *thingp, header;
1085 int count = 0; /* (0 = dummy init value to stop GCC warning) */
1086 struct vector *vector;
1088 while (nwords > 0) {
1090 if (is_lisp_pointer(thing)) {
1091 /* It's a pointer. Is it something we might have to move? */
1092 if (dynamic_pointer_p(thing)) {
1093 /* Maybe. Have we already moved it? */
1094 thingp = (lispobj *)native_pointer(thing);
1096 if (is_lisp_pointer(header) && forwarding_pointer_p(header))
1097 /* Yep, so just copy the forwarding pointer. */
1100 /* Nope, copy the object. */
1101 switch (lowtag_of(thing)) {
1102 case FUN_POINTER_LOWTAG:
1103 thing = ptrans_func(thing, header);
1106 case LIST_POINTER_LOWTAG:
1107 thing = ptrans_list(thing, constant);
1110 case INSTANCE_POINTER_LOWTAG:
1111 thing = ptrans_instance(thing, header, constant);
1114 case OTHER_POINTER_LOWTAG:
1115 thing = ptrans_otherptr(thing, header, constant);
1119 /* It was a pointer, but not one of them? */
1127 else if (thing & 3) {
1128 /* It's an other immediate. Maybe the header for an unboxed */
1130 switch (widetag_of(thing)) {
1131 case BIGNUM_WIDETAG:
1132 case SINGLE_FLOAT_WIDETAG:
1133 case DOUBLE_FLOAT_WIDETAG:
1134 #ifdef LONG_FLOAT_WIDETAG
1135 case LONG_FLOAT_WIDETAG:
1138 /* It's an unboxed simple object. */
1139 count = HeaderValue(thing)+1;
1142 case SIMPLE_VECTOR_WIDETAG:
1143 if (HeaderValue(thing) == subtype_VectorValidHashing) {
1144 *addr = (subtype_VectorMustRehash << N_WIDETAG_BITS) |
1145 SIMPLE_VECTOR_WIDETAG;
1150 case SIMPLE_BASE_STRING_WIDETAG:
1151 vector = (struct vector *)addr;
1152 count = CEILING(NWORDS(fixnum_value(vector->length)+1,4)+2,2);
1155 case SIMPLE_BIT_VECTOR_WIDETAG:
1156 vector = (struct vector *)addr;
1157 count = CEILING(NWORDS(fixnum_value(vector->length),32)+2,2);
1160 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
1161 vector = (struct vector *)addr;
1162 count = CEILING(NWORDS(fixnum_value(vector->length),16)+2,2);
1165 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
1166 vector = (struct vector *)addr;
1167 count = CEILING(NWORDS(fixnum_value(vector->length),8)+2,2);
1170 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
1171 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
1172 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
1174 vector = (struct vector *)addr;
1175 count = CEILING(NWORDS(fixnum_value(vector->length),4)+2,2);
1178 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
1179 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
1180 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
1182 vector = (struct vector *)addr;
1183 count = CEILING(NWORDS(fixnum_value(vector->length),2)+2,2);
1186 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
1187 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
1188 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
1190 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
1191 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
1193 vector = (struct vector *)addr;
1194 count = CEILING(fixnum_value(vector->length)+2,2);
1197 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
1198 vector = (struct vector *)addr;
1199 count = CEILING(fixnum_value(vector->length)+2,2);
1202 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
1203 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
1204 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
1206 vector = (struct vector *)addr;
1207 count = fixnum_value(vector->length)*2+2;
1210 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
1211 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
1212 vector = (struct vector *)addr;
1214 count = fixnum_value(vector->length)*3+2;
1217 count = fixnum_value(vector->length)*4+2;
1222 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
1223 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
1224 vector = (struct vector *)addr;
1225 count = fixnum_value(vector->length)*4+2;
1229 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
1230 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
1231 vector = (struct vector *)addr;
1233 count = fixnum_value(vector->length)*6+2;
1236 count = fixnum_value(vector->length)*8+2;
1241 case CODE_HEADER_WIDETAG:
1243 gc_abort(); /* no code headers in static space */
1245 count = pscav_code((struct code*)addr);
1249 case SIMPLE_FUN_HEADER_WIDETAG:
1250 case CLOSURE_FUN_HEADER_WIDETAG:
1251 case RETURN_PC_HEADER_WIDETAG:
1252 /* We should never hit any of these, 'cause they occur
1253 * buried in the middle of code objects. */
1258 case CLOSURE_HEADER_WIDETAG:
1259 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
1260 /* The function self pointer needs special care on the
1261 * x86 because it is the real entry point. */
1263 lispobj fun = ((struct closure *)addr)->fun
1264 - FUN_RAW_ADDR_OFFSET;
1265 pscav(&fun, 1, constant);
1266 ((struct closure *)addr)->fun = fun + FUN_RAW_ADDR_OFFSET;
1272 case WEAK_POINTER_WIDETAG:
1273 /* Weak pointers get preserved during purify, 'cause I
1274 * don't feel like figuring out how to break them. */
1275 pscav(addr+1, 2, constant);
1280 /* We have to handle fdefn objects specially, so we
1281 * can fix up the raw function address. */
1282 count = pscav_fdefn((struct fdefn *)addr);
1291 /* It's a fixnum. */
1303 purify(lispobj static_roots, lispobj read_only_roots)
1307 struct later *laters, *next;
1308 struct thread *thread;
1311 printf("[doing purification:");
1314 #ifdef LISP_FEATURE_GENCGC
1315 gc_alloc_update_all_page_tables();
1317 for_each_thread(thread)
1318 if (fixnum_value(SymbolValue(FREE_INTERRUPT_CONTEXT_INDEX,thread)) != 0) {
1319 /* FIXME: 1. What does this mean? 2. It shouldn't be reporting
1320 * its error simply by a. printing a string b. to stdout instead
1322 printf(" Ack! Can't purify interrupt contexts. ");
1327 #if defined(__i386__)
1328 dynamic_space_free_pointer =
1329 (lispobj*)SymbolValue(ALLOCATION_POINTER,0);
1332 read_only_end = read_only_free =
1333 (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER,0);
1334 static_end = static_free =
1335 (lispobj *)SymbolValue(STATIC_SPACE_FREE_POINTER,0);
1342 #if (defined(LISP_FEATURE_GENCGC) && defined(LISP_FEATURE_X86))
1344 /* This is what we should do, but can't unless the threads in
1345 * question are suspended with ptrace. That's right, purify is not
1348 for_each_thread(thread) {
1350 struct user_regs_struct regs;
1351 if(ptrace(PTRACE_GETREGS,thread->pid,0,®s)){
1352 fprintf(stderr,"child pid %d, %s\n",thread->pid,strerror(errno));
1353 lose("PTRACE_GETREGS");
1355 setup_i386_stack_scav(regs.ebp,
1356 ((void *)thread->control_stack_end));
1359 /* stopgap until we can set things up as in preceding comment */
1360 setup_i386_stack_scav(((&static_roots)-2),
1361 ((void *)all_threads->control_stack_end));
1364 pscav(&static_roots, 1, 0);
1365 pscav(&read_only_roots, 1, 1);
1368 printf(" handlers");
1371 pscav((lispobj *) all_threads->interrupt_data->interrupt_handlers,
1372 sizeof(all_threads->interrupt_data->interrupt_handlers)
1381 pscav((lispobj *)all_threads->control_stack_start,
1382 current_control_stack_pointer -
1383 all_threads->control_stack_start,
1386 #ifdef LISP_FEATURE_GENCGC
1392 printf(" bindings");
1395 #if !defined(__i386__)
1396 pscav( (lispobj *)all_threads->binding_stack_start,
1397 (lispobj *)current_binding_stack_pointer -
1398 all_threads->binding_stack_start,
1401 for_each_thread(thread) {
1402 pscav( (lispobj *)thread->binding_stack_start,
1403 (lispobj *)SymbolValue(BINDING_STACK_POINTER,thread) -
1404 (lispobj *)thread->binding_stack_start,
1406 pscav( (lispobj *) (thread+1),
1407 fixnum_value(SymbolValue(FREE_TLS_INDEX,0)) -
1408 (sizeof (struct thread))/(sizeof (lispobj)),
1415 /* The original CMU CL code had scavenge-read-only-space code
1416 * controlled by the Lisp-level variable
1417 * *SCAVENGE-READ-ONLY-SPACE*. It was disabled by default, and it
1418 * wasn't documented under what circumstances it was useful or
1419 * safe to turn it on, so it's been turned off in SBCL. If you
1420 * want/need this functionality, and can test and document it,
1421 * please submit a patch. */
1423 if (SymbolValue(SCAVENGE_READ_ONLY_SPACE) != UNBOUND_MARKER_WIDETAG
1424 && SymbolValue(SCAVENGE_READ_ONLY_SPACE) != NIL) {
1425 unsigned read_only_space_size =
1426 (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER) -
1427 (lispobj *)READ_ONLY_SPACE_START;
1429 "scavenging read only space: %d bytes\n",
1430 read_only_space_size * sizeof(lispobj));
1431 pscav( (lispobj *)READ_ONLY_SPACE_START, read_only_space_size, 0);
1439 clean = (lispobj *)STATIC_SPACE_START;
1441 while (clean != static_free)
1442 clean = pscav(clean, static_free - clean, 0);
1443 laters = later_blocks;
1444 count = later_count;
1445 later_blocks = NULL;
1447 while (laters != NULL) {
1448 for (i = 0; i < count; i++) {
1449 if (laters->u[i].count == 0) {
1451 } else if (laters->u[i].count <= LATERMAXCOUNT) {
1452 pscav(laters->u[i+1].ptr, laters->u[i].count, 1);
1455 pscav(laters->u[i].ptr, 1, 1);
1458 next = laters->next;
1461 count = LATERBLOCKSIZE;
1463 } while (clean != static_free || later_blocks != NULL);
1470 os_zero((os_vm_address_t) current_dynamic_space,
1471 (os_vm_size_t) DYNAMIC_SPACE_SIZE);
1473 /* Zero the stack. Note that the stack is also zeroed by SUB-GC
1474 * calling SCRUB-CONTROL-STACK - this zeros the stack on the x86. */
1476 os_zero((os_vm_address_t) current_control_stack_pointer,
1478 ((all_threads->control_stack_end -
1479 current_control_stack_pointer) * sizeof(lispobj)));
1482 /* It helps to update the heap free pointers so that free_heap can
1483 * verify after it's done. */
1484 SetSymbolValue(READ_ONLY_SPACE_FREE_POINTER, (lispobj)read_only_free,0);
1485 SetSymbolValue(STATIC_SPACE_FREE_POINTER, (lispobj)static_free,0);
1487 #if !defined(__i386__)
1488 dynamic_space_free_pointer = current_dynamic_space;
1489 set_auto_gc_trigger(bytes_consed_between_gcs);
1491 #if defined LISP_FEATURE_GENCGC
1494 #error unsupported case /* in CMU CL, was "ibmrt using GC" */