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>
27 #include "interrupt.h"
32 #include "gc-internal.h"
34 #include "genesis/primitive-objects.h"
35 #include "genesis/static-symbols.h"
36 #include "genesis/layout.h"
40 extern unsigned long bytes_consed_between_gcs;
42 static lispobj *dynamic_space_purify_pointer;
45 /* These hold the original end of the read_only and static spaces so
46 * we can tell what are forwarding pointers. */
48 static lispobj *read_only_end, *static_end;
50 static lispobj *read_only_free, *static_free;
52 static lispobj *pscav(lispobj *addr, long nwords, boolean constant);
54 #define LATERBLOCKSIZE 1020
55 #define LATERMAXCOUNT 10
64 } *later_blocks = NULL;
65 static long later_count = 0;
68 #define SIMPLE_ARRAY_WORD_WIDETAG SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG
69 #elif N_WORD_BITS == 64
70 #define SIMPLE_ARRAY_WORD_WIDETAG SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
75 forwarding_pointer_p(lispobj obj)
77 lispobj *ptr = native_pointer(obj);
79 return ((static_end <= ptr && ptr <= static_free) ||
80 (read_only_end <= ptr && ptr <= read_only_free));
84 dynamic_pointer_p(lispobj ptr)
86 #ifndef LISP_FEATURE_GENCGC
87 return (ptr >= (lispobj)current_dynamic_space
89 ptr < (lispobj)dynamic_space_purify_pointer);
91 /* Be more conservative, and remember, this is a maybe. */
92 return (ptr >= (lispobj)DYNAMIC_SPACE_START
94 ptr < (lispobj)dynamic_space_purify_pointer);
98 static inline lispobj *
99 newspace_alloc(long nwords, int constantp)
102 nwords=CEILING(nwords,2);
104 if(read_only_free + nwords >= (lispobj *)READ_ONLY_SPACE_END) {
105 lose("Ran out of read-only space while purifying!\n");
108 read_only_free+=nwords;
110 if(static_free + nwords >= (lispobj *)STATIC_SPACE_END) {
111 lose("Ran out of static space while purifying!\n");
121 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
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, whereas in purify these are
140 * checked separately in setup_i386_stack_scav - they go onto
141 * valid_stack_ra_locations instead of just valid_stack_locations */
144 valid_dynamic_space_pointer(lispobj *pointer, lispobj *start_addr)
146 /* If it's not a return address then it needs to be a valid Lisp
148 if (!is_lisp_pointer((lispobj)pointer))
151 /* Check that the object pointed to is consistent with the pointer
153 switch (lowtag_of((lispobj)pointer)) {
154 case FUN_POINTER_LOWTAG:
155 /* Start_addr should be the enclosing code object, or a closure
157 switch (widetag_of(*start_addr)) {
158 case CODE_HEADER_WIDETAG:
159 /* This case is probably caught above. */
161 case CLOSURE_HEADER_WIDETAG:
162 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
163 if ((long)pointer != ((long)start_addr+FUN_POINTER_LOWTAG)) {
164 if (pointer_filter_verbose) {
165 fprintf(stderr,"*Wf2: %p %p %p\n",
166 pointer, start_addr, (void *)*start_addr);
172 if (pointer_filter_verbose) {
173 fprintf(stderr,"*Wf3: %p %p %p\n",
174 pointer, start_addr, (void *)*start_addr);
179 case LIST_POINTER_LOWTAG:
180 if ((long)pointer != ((long)start_addr+LIST_POINTER_LOWTAG)) {
181 if (pointer_filter_verbose)
182 fprintf(stderr,"*Wl1: %p %p %p\n",
183 pointer, start_addr, (void *)*start_addr);
186 /* Is it plausible cons? */
187 if ((is_lisp_pointer(start_addr[0])
188 || ((start_addr[0] & FIXNUM_TAG_MASK) == 0) /* fixnum */
189 || (widetag_of(start_addr[0]) == CHARACTER_WIDETAG)
190 #if N_WORD_BITS == 64
191 || (widetag_of(start_addr[0]) == SINGLE_FLOAT_WIDETAG)
193 || (widetag_of(start_addr[0]) == UNBOUND_MARKER_WIDETAG))
194 && (is_lisp_pointer(start_addr[1])
195 || ((start_addr[1] & FIXNUM_TAG_MASK) == 0) /* fixnum */
196 || (widetag_of(start_addr[1]) == CHARACTER_WIDETAG)
197 #if N_WORD_BITS == 64
198 || (widetag_of(start_addr[1]) == SINGLE_FLOAT_WIDETAG)
200 || (widetag_of(start_addr[1]) == UNBOUND_MARKER_WIDETAG))) {
203 if (pointer_filter_verbose) {
204 fprintf(stderr,"*Wl2: %p %p %p\n",
205 pointer, start_addr, (void *)*start_addr);
209 case INSTANCE_POINTER_LOWTAG:
210 if ((long)pointer != ((long)start_addr+INSTANCE_POINTER_LOWTAG)) {
211 if (pointer_filter_verbose) {
212 fprintf(stderr,"*Wi1: %p %p %p\n",
213 pointer, start_addr, (void *)*start_addr);
217 if (widetag_of(start_addr[0]) != INSTANCE_HEADER_WIDETAG) {
218 if (pointer_filter_verbose) {
219 fprintf(stderr,"*Wi2: %p %p %p\n",
220 pointer, start_addr, (void *)*start_addr);
225 case OTHER_POINTER_LOWTAG:
226 if ((long)pointer != ((long)start_addr+OTHER_POINTER_LOWTAG)) {
227 if (pointer_filter_verbose) {
228 fprintf(stderr,"*Wo1: %p %p %p\n",
229 pointer, start_addr, (void *)*start_addr);
233 /* Is it plausible? Not a cons. XXX should check the headers. */
234 if (is_lisp_pointer(start_addr[0]) || ((start_addr[0] & FIXNUM_TAG_MASK) == 0)) {
235 if (pointer_filter_verbose) {
236 fprintf(stderr,"*Wo2: %p %p %p\n",
237 pointer, start_addr, (void *)*start_addr);
241 switch (widetag_of(start_addr[0])) {
242 case UNBOUND_MARKER_WIDETAG:
243 case CHARACTER_WIDETAG:
244 #if N_WORD_BITS == 64
245 case SINGLE_FLOAT_WIDETAG:
247 if (pointer_filter_verbose) {
248 fprintf(stderr,"*Wo3: %p %p %p\n",
249 pointer, start_addr, (void *)*start_addr);
253 /* only pointed to by function pointers? */
254 case CLOSURE_HEADER_WIDETAG:
255 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
256 if (pointer_filter_verbose) {
257 fprintf(stderr,"*Wo4: %p %p %p\n",
258 pointer, start_addr, (void *)*start_addr);
262 case INSTANCE_HEADER_WIDETAG:
263 if (pointer_filter_verbose) {
264 fprintf(stderr,"*Wo5: %p %p %p\n",
265 pointer, start_addr, (void *)*start_addr);
269 /* the valid other immediate pointer objects */
270 case SIMPLE_VECTOR_WIDETAG:
272 case COMPLEX_WIDETAG:
273 #ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
274 case COMPLEX_SINGLE_FLOAT_WIDETAG:
276 #ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
277 case COMPLEX_DOUBLE_FLOAT_WIDETAG:
279 #ifdef COMPLEX_LONG_FLOAT_WIDETAG
280 case COMPLEX_LONG_FLOAT_WIDETAG:
282 case SIMPLE_ARRAY_WIDETAG:
283 case COMPLEX_BASE_STRING_WIDETAG:
284 #ifdef COMPLEX_CHARACTER_STRING_WIDETAG
285 case COMPLEX_CHARACTER_STRING_WIDETAG:
287 case COMPLEX_VECTOR_NIL_WIDETAG:
288 case COMPLEX_BIT_VECTOR_WIDETAG:
289 case COMPLEX_VECTOR_WIDETAG:
290 case COMPLEX_ARRAY_WIDETAG:
291 case VALUE_CELL_HEADER_WIDETAG:
292 case SYMBOL_HEADER_WIDETAG:
294 case CODE_HEADER_WIDETAG:
296 #if N_WORD_BITS != 64
297 case SINGLE_FLOAT_WIDETAG:
299 case DOUBLE_FLOAT_WIDETAG:
300 #ifdef LONG_FLOAT_WIDETAG
301 case LONG_FLOAT_WIDETAG:
303 case SIMPLE_ARRAY_NIL_WIDETAG:
304 case SIMPLE_BASE_STRING_WIDETAG:
305 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
306 case SIMPLE_CHARACTER_STRING_WIDETAG:
308 case SIMPLE_BIT_VECTOR_WIDETAG:
309 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
310 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
311 case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
312 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
313 case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
314 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
315 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG
316 case SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG:
318 case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
319 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
320 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG
321 case SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG:
323 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
324 case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
326 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
327 case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
329 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
330 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
332 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
333 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
335 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
336 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
338 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
339 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
341 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG
342 case SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG:
344 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
345 case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
347 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
348 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
349 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
350 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
352 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
353 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
355 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
356 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
358 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
359 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
362 case WEAK_POINTER_WIDETAG:
369 if (pointer_filter_verbose) {
370 fprintf(stderr,"*Wo6: %p %p %p\n",
371 pointer, start_addr, (void *)*start_addr);
377 if (pointer_filter_verbose) {
378 fprintf(stderr,"*W?: %p %p %p\n",
379 pointer, start_addr, (void *)*start_addr);
388 #define MAX_STACK_POINTERS 256
389 lispobj *valid_stack_locations[MAX_STACK_POINTERS];
390 unsigned long num_valid_stack_locations;
392 #define MAX_STACK_RETURN_ADDRESSES 128
393 lispobj *valid_stack_ra_locations[MAX_STACK_RETURN_ADDRESSES];
394 lispobj *valid_stack_ra_code_objects[MAX_STACK_RETURN_ADDRESSES];
395 unsigned long num_valid_stack_ra_locations;
397 /* Identify valid stack slots. */
399 setup_i386_stack_scav(lispobj *lowaddr, lispobj *base)
401 lispobj *sp = lowaddr;
402 num_valid_stack_locations = 0;
403 num_valid_stack_ra_locations = 0;
404 for (sp = lowaddr; sp < base; sp++) {
406 /* Find the object start address */
407 lispobj *start_addr = search_dynamic_space((void *)thing);
409 /* We need to allow raw pointers into Code objects for
410 * return addresses. This will also pick up pointers to
411 * functions in code objects. */
412 if (widetag_of(*start_addr) == CODE_HEADER_WIDETAG) {
413 /* FIXME asserting here is a really dumb thing to do.
414 * If we've overflowed some arbitrary static limit, we
415 * should just refuse to purify, instead of killing
416 * the whole lisp session
418 gc_assert(num_valid_stack_ra_locations <
419 MAX_STACK_RETURN_ADDRESSES);
420 valid_stack_ra_locations[num_valid_stack_ra_locations] = sp;
421 valid_stack_ra_code_objects[num_valid_stack_ra_locations++] =
422 (lispobj *)((long)start_addr + OTHER_POINTER_LOWTAG);
424 if (valid_dynamic_space_pointer((void *)thing, start_addr)) {
425 gc_assert(num_valid_stack_locations < MAX_STACK_POINTERS);
426 valid_stack_locations[num_valid_stack_locations++] = sp;
431 if (pointer_filter_verbose) {
432 fprintf(stderr, "number of valid stack pointers = %ld\n",
433 num_valid_stack_locations);
434 fprintf(stderr, "number of stack return addresses = %ld\n",
435 num_valid_stack_ra_locations);
440 pscav_i386_stack(void)
444 for (i = 0; i < num_valid_stack_locations; i++)
445 pscav(valid_stack_locations[i], 1, 0);
447 for (i = 0; i < num_valid_stack_ra_locations; i++) {
448 lispobj code_obj = (lispobj)valid_stack_ra_code_objects[i];
449 pscav(&code_obj, 1, 0);
450 if (pointer_filter_verbose) {
451 fprintf(stderr,"*C moved RA %p to %p; for code object %p to %p\n",
452 (void *)*valid_stack_ra_locations[i],
453 (void *)(*valid_stack_ra_locations[i]) -
454 ((void *)valid_stack_ra_code_objects[i] -
456 valid_stack_ra_code_objects[i], (void *)code_obj);
458 *valid_stack_ra_locations[i] =
459 ((long)(*valid_stack_ra_locations[i])
460 - ((long)valid_stack_ra_code_objects[i] - (long)code_obj));
468 pscav_later(lispobj *where, long count)
472 if (count > LATERMAXCOUNT) {
473 while (count > LATERMAXCOUNT) {
474 pscav_later(where, LATERMAXCOUNT);
475 count -= LATERMAXCOUNT;
476 where += LATERMAXCOUNT;
480 if (later_blocks == NULL || later_count == LATERBLOCKSIZE ||
481 (later_count == LATERBLOCKSIZE-1 && count > 1)) {
482 new = (struct later *)malloc(sizeof(struct later));
483 new->next = later_blocks;
484 if (later_blocks && later_count < LATERBLOCKSIZE)
485 later_blocks->u[later_count].ptr = NULL;
491 later_blocks->u[later_count++].count = count;
492 later_blocks->u[later_count++].ptr = where;
497 ptrans_boxed(lispobj thing, lispobj header, boolean constant)
500 lispobj result, *new, *old;
502 nwords = CEILING(1 + HeaderValue(header), 2);
505 old = (lispobj *)native_pointer(thing);
506 new = newspace_alloc(nwords,constant);
509 bcopy(old, new, nwords * sizeof(lispobj));
511 /* Deposit forwarding pointer. */
512 result = make_lispobj(new, lowtag_of(thing));
516 pscav(new, nwords, constant);
521 /* We need to look at the layout to see whether it is a pure structure
522 * class, and only then can we transport as constant. If it is pure,
523 * we can ALWAYS transport as a constant. */
525 ptrans_instance(lispobj thing, lispobj header, boolean /* ignored */ constant)
527 struct layout *layout =
528 (struct layout *) native_pointer(((struct instance *)native_pointer(thing))->slots[0]);
529 lispobj pure = layout->pure;
533 return (ptrans_boxed(thing, header, 1));
535 return (ptrans_boxed(thing, header, 0));
538 /* Substructure: special case for the COMPACT-INFO-ENVs,
539 * where the instance may have a point to the dynamic
540 * space placed into it (e.g. the cache-name slot), but
541 * the lists and arrays at the time of a purify can be
542 * moved to the RO space. */
544 lispobj result, *new, *old;
546 nwords = CEILING(1 + HeaderValue(header), 2);
549 old = (lispobj *)native_pointer(thing);
550 new = newspace_alloc(nwords, 0); /* inconstant */
553 bcopy(old, new, nwords * sizeof(lispobj));
555 /* Deposit forwarding pointer. */
556 result = make_lispobj(new, lowtag_of(thing));
560 pscav(new, nwords, 1);
566 return NIL; /* dummy value: return something ... */
571 ptrans_fdefn(lispobj thing, lispobj header)
574 lispobj result, *new, *old, oldfn;
577 nwords = CEILING(1 + HeaderValue(header), 2);
580 old = (lispobj *)native_pointer(thing);
581 new = newspace_alloc(nwords, 0); /* inconstant */
584 bcopy(old, new, nwords * sizeof(lispobj));
586 /* Deposit forwarding pointer. */
587 result = make_lispobj(new, lowtag_of(thing));
590 /* Scavenge the function. */
591 fdefn = (struct fdefn *)new;
593 pscav(&fdefn->fun, 1, 0);
594 if ((char *)oldfn + FUN_RAW_ADDR_OFFSET == fdefn->raw_addr)
595 fdefn->raw_addr = (char *)fdefn->fun + FUN_RAW_ADDR_OFFSET;
601 ptrans_unboxed(lispobj thing, lispobj header)
604 lispobj result, *new, *old;
606 nwords = CEILING(1 + HeaderValue(header), 2);
609 old = (lispobj *)native_pointer(thing);
610 new = newspace_alloc(nwords,1); /* always constant */
613 bcopy(old, new, nwords * sizeof(lispobj));
615 /* Deposit forwarding pointer. */
616 result = make_lispobj(new , lowtag_of(thing));
623 ptrans_vector(lispobj thing, long bits, long extra,
624 boolean boxed, boolean constant)
626 struct vector *vector;
628 lispobj result, *new;
631 vector = (struct vector *)native_pointer(thing);
632 length = fixnum_value(vector->length)+extra;
633 // Argh, handle simple-vector-nil separately.
637 nwords = CEILING(NWORDS(length, bits) + 2, 2);
640 new=newspace_alloc(nwords, (constant || !boxed));
641 bcopy(vector, new, nwords * sizeof(lispobj));
643 result = make_lispobj(new, lowtag_of(thing));
644 vector->header = result;
647 pscav(new, nwords, constant);
652 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
654 apply_code_fixups_during_purify(struct code *old_code, struct code *new_code)
656 long nheader_words, ncode_words, nwords;
657 void *constants_start_addr, *constants_end_addr;
658 void *code_start_addr, *code_end_addr;
659 lispobj fixups = NIL;
660 unsigned displacement = (unsigned)new_code - (unsigned)old_code;
661 struct vector *fixups_vector;
663 ncode_words = fixnum_value(new_code->code_size);
664 nheader_words = HeaderValue(*(lispobj *)new_code);
665 nwords = ncode_words + nheader_words;
667 constants_start_addr = (void *)new_code + 5 * N_WORD_BYTES;
668 constants_end_addr = (void *)new_code + nheader_words*N_WORD_BYTES;
669 code_start_addr = (void *)new_code + nheader_words*N_WORD_BYTES;
670 code_end_addr = (void *)new_code + nwords*N_WORD_BYTES;
672 /* The first constant should be a pointer to the fixups for this
673 * code objects. Check. */
674 fixups = new_code->constants[0];
676 /* It will be 0 or the unbound-marker if there are no fixups, and
677 * will be an other-pointer to a vector if it is valid. */
679 (fixups==UNBOUND_MARKER_WIDETAG) ||
680 !is_lisp_pointer(fixups)) {
681 #ifdef LISP_FEATURE_GENCGC
682 /* Check for a possible errors. */
683 sniff_code_object(new_code,displacement);
688 fixups_vector = (struct vector *)native_pointer(fixups);
690 /* Could be pointing to a forwarding pointer. */
691 if (is_lisp_pointer(fixups) && (dynamic_pointer_p(fixups))
692 && forwarding_pointer_p(*(lispobj *)fixups_vector)) {
693 /* If so then follow it. */
695 (struct vector *)native_pointer(*(lispobj *)fixups_vector);
698 if (widetag_of(fixups_vector->header) == SIMPLE_ARRAY_WORD_WIDETAG) {
699 /* We got the fixups for the code block. Now work through the
700 * vector, and apply a fixup at each address. */
701 long length = fixnum_value(fixups_vector->length);
703 for (i=0; i<length; i++) {
704 unsigned offset = fixups_vector->data[i];
705 /* Now check the current value of offset. */
707 *(unsigned *)((unsigned)code_start_addr + offset);
709 /* If it's within the old_code object then it must be an
710 * absolute fixup (relative ones are not saved) */
711 if ((old_value>=(unsigned)old_code)
712 && (old_value<((unsigned)old_code + nwords * N_WORD_BYTES)))
713 /* So add the dispacement. */
714 *(unsigned *)((unsigned)code_start_addr + offset) = old_value
717 /* It is outside the old code object so it must be a relative
718 * fixup (absolute fixups are not saved). So subtract the
720 *(unsigned *)((unsigned)code_start_addr + offset) = old_value
725 /* No longer need the fixups. */
726 new_code->constants[0] = 0;
728 #ifdef LISP_FEATURE_GENCGC
729 /* Check for possible errors. */
730 sniff_code_object(new_code,displacement);
736 ptrans_code(lispobj thing)
738 struct code *code, *new;
740 lispobj func, result;
742 code = (struct code *)native_pointer(thing);
743 nwords = CEILING(HeaderValue(code->header) + fixnum_value(code->code_size),
746 new = (struct code *)newspace_alloc(nwords,1); /* constant */
748 bcopy(code, new, nwords * sizeof(lispobj));
750 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
751 apply_code_fixups_during_purify(code,new);
754 result = make_lispobj(new, OTHER_POINTER_LOWTAG);
756 /* Stick in a forwarding pointer for the code object. */
757 *(lispobj *)code = result;
759 /* Put in forwarding pointers for all the functions. */
760 for (func = code->entry_points;
762 func = ((struct simple_fun *)native_pointer(func))->next) {
764 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
766 *(lispobj *)native_pointer(func) = result + (func - thing);
769 /* Arrange to scavenge the debug info later. */
770 pscav_later(&new->debug_info, 1);
772 /* FIXME: why would this be a fixnum? */
773 /* "why" is a hard word, but apparently for compiled functions the
774 trace_table_offset contains the length of the instructions, as
775 a fixnum. See CODE-INST-AREA-LENGTH in
776 src/compiler/target-disassem.lisp. -- CSR, 2004-01-08 */
777 if (!(fixnump(new->trace_table_offset)))
779 pscav(&new->trace_table_offset, 1, 0);
781 new->trace_table_offset = NIL; /* limit lifetime */
784 /* Scavenge the constants. */
785 pscav(new->constants, HeaderValue(new->header)-5, 1);
787 /* Scavenge all the functions. */
788 pscav(&new->entry_points, 1, 1);
789 for (func = new->entry_points;
791 func = ((struct simple_fun *)native_pointer(func))->next) {
792 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
793 gc_assert(!dynamic_pointer_p(func));
795 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
796 /* Temporarily convert the self pointer to a real function pointer. */
797 ((struct simple_fun *)native_pointer(func))->self
798 -= FUN_RAW_ADDR_OFFSET;
800 pscav(&((struct simple_fun *)native_pointer(func))->self, 2, 1);
801 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
802 ((struct simple_fun *)native_pointer(func))->self
803 += FUN_RAW_ADDR_OFFSET;
805 pscav_later(&((struct simple_fun *)native_pointer(func))->name, 4);
812 ptrans_func(lispobj thing, lispobj header)
815 lispobj code, *new, *old, result;
816 struct simple_fun *function;
818 /* Thing can either be a function header, a closure function
819 * header, a closure, or a funcallable-instance. If it's a closure
820 * or a funcallable-instance, we do the same as ptrans_boxed.
821 * Otherwise we have to do something strange, 'cause it is buried
822 * inside a code object. */
824 if (widetag_of(header) == SIMPLE_FUN_HEADER_WIDETAG) {
826 /* We can only end up here if the code object has not been
827 * scavenged, because if it had been scavenged, forwarding pointers
828 * would have been left behind for all the entry points. */
830 function = (struct simple_fun *)native_pointer(thing);
833 ((native_pointer(thing) -
834 (HeaderValue(function->header))), OTHER_POINTER_LOWTAG);
836 /* This will cause the function's header to be replaced with a
837 * forwarding pointer. */
841 /* So we can just return that. */
842 return function->header;
845 /* It's some kind of closure-like thing. */
846 nwords = CEILING(1 + HeaderValue(header), 2);
847 old = (lispobj *)native_pointer(thing);
849 /* Allocate the new one. FINs *must* not go in read_only
850 * space. Closures can; they never change */
853 (nwords,(widetag_of(header)!=FUNCALLABLE_INSTANCE_HEADER_WIDETAG));
856 bcopy(old, new, nwords * sizeof(lispobj));
858 /* Deposit forwarding pointer. */
859 result = make_lispobj(new, lowtag_of(thing));
863 pscav(new, nwords, 0);
870 ptrans_returnpc(lispobj thing, lispobj header)
874 /* Find the corresponding code object. */
875 code = thing - HeaderValue(header)*sizeof(lispobj);
877 /* Make sure it's been transported. */
878 new = *(lispobj *)native_pointer(code);
879 if (!forwarding_pointer_p(new))
880 new = ptrans_code(code);
882 /* Maintain the offset: */
883 return new + (thing - code);
886 #define WORDS_PER_CONS CEILING(sizeof(struct cons) / sizeof(lispobj), 2)
889 ptrans_list(lispobj thing, boolean constant)
891 struct cons *old, *new, *orig;
894 orig = (struct cons *) newspace_alloc(0,constant);
898 /* Allocate a new cons cell. */
899 old = (struct cons *)native_pointer(thing);
900 new = (struct cons *) newspace_alloc(WORDS_PER_CONS,constant);
902 /* Copy the cons cell and keep a pointer to the cdr. */
904 thing = new->cdr = old->cdr;
906 /* Set up the forwarding pointer. */
907 *(lispobj *)old = make_lispobj(new, LIST_POINTER_LOWTAG);
909 /* And count this cell. */
911 } while (lowtag_of(thing) == LIST_POINTER_LOWTAG &&
912 dynamic_pointer_p(thing) &&
913 !(forwarding_pointer_p(*(lispobj *)native_pointer(thing))));
915 /* Scavenge the list we just copied. */
916 pscav((lispobj *)orig, length * WORDS_PER_CONS, constant);
918 return make_lispobj(orig, LIST_POINTER_LOWTAG);
922 ptrans_otherptr(lispobj thing, lispobj header, boolean constant)
924 switch (widetag_of(header)) {
925 /* FIXME: this needs a reindent */
927 case SINGLE_FLOAT_WIDETAG:
928 case DOUBLE_FLOAT_WIDETAG:
929 #ifdef LONG_FLOAT_WIDETAG
930 case LONG_FLOAT_WIDETAG:
932 #ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
933 case COMPLEX_SINGLE_FLOAT_WIDETAG:
935 #ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
936 case COMPLEX_DOUBLE_FLOAT_WIDETAG:
938 #ifdef COMPLEX_LONG_FLOAT_WIDETAG
939 case COMPLEX_LONG_FLOAT_WIDETAG:
942 return ptrans_unboxed(thing, header);
945 gencgc_unregister_lutex(native_pointer(thing));
946 return ptrans_unboxed(thing, header);
950 case COMPLEX_WIDETAG:
951 case SIMPLE_ARRAY_WIDETAG:
952 case COMPLEX_BASE_STRING_WIDETAG:
953 #ifdef COMPLEX_CHARACTER_STRING_WIDETAG
954 case COMPLEX_CHARACTER_STRING_WIDETAG:
956 case COMPLEX_BIT_VECTOR_WIDETAG:
957 case COMPLEX_VECTOR_NIL_WIDETAG:
958 case COMPLEX_VECTOR_WIDETAG:
959 case COMPLEX_ARRAY_WIDETAG:
960 return ptrans_boxed(thing, header, constant);
962 case VALUE_CELL_HEADER_WIDETAG:
963 case WEAK_POINTER_WIDETAG:
964 return ptrans_boxed(thing, header, 0);
966 case SYMBOL_HEADER_WIDETAG:
967 return ptrans_boxed(thing, header, 0);
969 case SIMPLE_ARRAY_NIL_WIDETAG:
970 return ptrans_vector(thing, 0, 0, 0, constant);
972 case SIMPLE_BASE_STRING_WIDETAG:
973 return ptrans_vector(thing, 8, 1, 0, constant);
975 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
976 case SIMPLE_CHARACTER_STRING_WIDETAG:
977 return ptrans_vector(thing, 32, 1, 0, constant);
980 case SIMPLE_BIT_VECTOR_WIDETAG:
981 return ptrans_vector(thing, 1, 0, 0, constant);
983 case SIMPLE_VECTOR_WIDETAG:
984 return ptrans_vector(thing, N_WORD_BITS, 0, 1, constant);
986 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
987 return ptrans_vector(thing, 2, 0, 0, constant);
989 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
990 return ptrans_vector(thing, 4, 0, 0, constant);
992 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
993 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
994 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
995 case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
997 return ptrans_vector(thing, 8, 0, 0, constant);
999 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
1000 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
1001 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
1002 case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
1004 return ptrans_vector(thing, 16, 0, 0, constant);
1006 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
1007 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
1008 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
1009 case SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG:
1011 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
1012 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
1013 case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
1015 return ptrans_vector(thing, 32, 0, 0, constant);
1017 #if N_WORD_BITS == 64
1018 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG
1019 case SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG:
1021 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
1022 case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
1024 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
1025 case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
1027 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG
1028 case SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG:
1030 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
1031 case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
1033 return ptrans_vector(thing, 64, 0, 0, constant);
1036 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
1037 return ptrans_vector(thing, 32, 0, 0, constant);
1039 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
1040 return ptrans_vector(thing, 64, 0, 0, constant);
1042 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
1043 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
1044 #ifdef LISP_FEATURE_X86
1045 return ptrans_vector(thing, 96, 0, 0, constant);
1047 #ifdef LISP_FEATURE_SPARC
1048 return ptrans_vector(thing, 128, 0, 0, constant);
1052 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
1053 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
1054 return ptrans_vector(thing, 64, 0, 0, constant);
1057 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
1058 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
1059 return ptrans_vector(thing, 128, 0, 0, constant);
1062 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
1063 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
1064 #ifdef LISP_FEATURE_X86
1065 return ptrans_vector(thing, 192, 0, 0, constant);
1067 #ifdef LISP_FEATURE_SPARC
1068 return ptrans_vector(thing, 256, 0, 0, constant);
1072 case CODE_HEADER_WIDETAG:
1073 return ptrans_code(thing);
1075 case RETURN_PC_HEADER_WIDETAG:
1076 return ptrans_returnpc(thing, header);
1079 return ptrans_fdefn(thing, header);
1082 fprintf(stderr, "Invalid widetag: %d\n", widetag_of(header));
1083 /* Should only come across other pointers to the above stuff. */
1090 pscav_fdefn(struct fdefn *fdefn)
1094 fix_func = ((char *)(fdefn->fun+FUN_RAW_ADDR_OFFSET) == fdefn->raw_addr);
1095 pscav(&fdefn->name, 1, 1);
1096 pscav(&fdefn->fun, 1, 0);
1098 fdefn->raw_addr = (char *)(fdefn->fun + FUN_RAW_ADDR_OFFSET);
1099 return sizeof(struct fdefn) / sizeof(lispobj);
1102 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1103 /* now putting code objects in static space */
1105 pscav_code(struct code*code)
1109 nwords = CEILING(HeaderValue(code->header) + fixnum_value(code->code_size),
1112 /* Arrange to scavenge the debug info later. */
1113 pscav_later(&code->debug_info, 1);
1115 /* Scavenge the constants. */
1116 pscav(code->constants, HeaderValue(code->header)-5, 1);
1118 /* Scavenge all the functions. */
1119 pscav(&code->entry_points, 1, 1);
1120 for (func = code->entry_points;
1122 func = ((struct simple_fun *)native_pointer(func))->next) {
1123 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
1124 gc_assert(!dynamic_pointer_p(func));
1126 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1127 /* Temporarily convert the self pointer to a real function
1129 ((struct simple_fun *)native_pointer(func))->self
1130 -= FUN_RAW_ADDR_OFFSET;
1132 pscav(&((struct simple_fun *)native_pointer(func))->self, 2, 1);
1133 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1134 ((struct simple_fun *)native_pointer(func))->self
1135 += FUN_RAW_ADDR_OFFSET;
1137 pscav_later(&((struct simple_fun *)native_pointer(func))->name, 4);
1140 return CEILING(nwords,2);
1145 pscav(lispobj *addr, long nwords, boolean constant)
1147 lispobj thing, *thingp, header;
1148 long count = 0; /* (0 = dummy init value to stop GCC warning) */
1149 struct vector *vector;
1151 while (nwords > 0) {
1153 if (is_lisp_pointer(thing)) {
1154 /* It's a pointer. Is it something we might have to move? */
1155 if (dynamic_pointer_p(thing)) {
1156 /* Maybe. Have we already moved it? */
1157 thingp = (lispobj *)native_pointer(thing);
1159 if (is_lisp_pointer(header) && forwarding_pointer_p(header))
1160 /* Yep, so just copy the forwarding pointer. */
1163 /* Nope, copy the object. */
1164 switch (lowtag_of(thing)) {
1165 case FUN_POINTER_LOWTAG:
1166 thing = ptrans_func(thing, header);
1169 case LIST_POINTER_LOWTAG:
1170 thing = ptrans_list(thing, constant);
1173 case INSTANCE_POINTER_LOWTAG:
1174 thing = ptrans_instance(thing, header, constant);
1177 case OTHER_POINTER_LOWTAG:
1178 thing = ptrans_otherptr(thing, header, constant);
1182 /* It was a pointer, but not one of them? */
1190 #if N_WORD_BITS == 64
1191 else if (widetag_of(thing) == SINGLE_FLOAT_WIDETAG) {
1195 else if (thing & FIXNUM_TAG_MASK) {
1196 /* It's an other immediate. Maybe the header for an unboxed */
1198 switch (widetag_of(thing)) {
1199 case BIGNUM_WIDETAG:
1200 case SINGLE_FLOAT_WIDETAG:
1201 case DOUBLE_FLOAT_WIDETAG:
1202 #ifdef LONG_FLOAT_WIDETAG
1203 case LONG_FLOAT_WIDETAG:
1206 /* It's an unboxed simple object. */
1207 count = CEILING(HeaderValue(thing)+1, 2);
1210 case SIMPLE_VECTOR_WIDETAG:
1211 if (HeaderValue(thing) == subtype_VectorValidHashing) {
1212 *addr = (subtype_VectorMustRehash << N_WIDETAG_BITS) |
1213 SIMPLE_VECTOR_WIDETAG;
1218 case SIMPLE_ARRAY_NIL_WIDETAG:
1222 case SIMPLE_BASE_STRING_WIDETAG:
1223 vector = (struct vector *)addr;
1224 count = CEILING(NWORDS(fixnum_value(vector->length)+1,8)+2,2);
1227 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
1228 case SIMPLE_CHARACTER_STRING_WIDETAG:
1229 vector = (struct vector *)addr;
1230 count = CEILING(NWORDS(fixnum_value(vector->length)+1,32)+2,2);
1234 case SIMPLE_BIT_VECTOR_WIDETAG:
1235 vector = (struct vector *)addr;
1236 count = CEILING(NWORDS(fixnum_value(vector->length),1)+2,2);
1239 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
1240 vector = (struct vector *)addr;
1241 count = CEILING(NWORDS(fixnum_value(vector->length),2)+2,2);
1244 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
1245 vector = (struct vector *)addr;
1246 count = CEILING(NWORDS(fixnum_value(vector->length),4)+2,2);
1249 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
1250 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
1251 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
1252 case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
1254 vector = (struct vector *)addr;
1255 count = CEILING(NWORDS(fixnum_value(vector->length),8)+2,2);
1258 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
1259 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
1260 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
1261 case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
1263 vector = (struct vector *)addr;
1264 count = CEILING(NWORDS(fixnum_value(vector->length),16)+2,2);
1267 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
1268 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
1269 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
1270 case SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG:
1272 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
1273 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
1274 case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
1276 vector = (struct vector *)addr;
1277 count = CEILING(NWORDS(fixnum_value(vector->length),32)+2,2);
1280 #if N_WORD_BITS == 64
1281 case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
1282 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG
1283 case SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG:
1284 case SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG:
1286 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
1287 case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
1288 case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
1290 vector = (struct vector *)addr;
1291 count = CEILING(NWORDS(fixnum_value(vector->length),64)+2,2);
1295 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
1296 vector = (struct vector *)addr;
1297 count = CEILING(NWORDS(fixnum_value(vector->length), 32) + 2,
1301 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
1302 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
1303 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
1305 vector = (struct vector *)addr;
1306 count = CEILING(NWORDS(fixnum_value(vector->length), 64) + 2,
1310 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
1311 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
1312 vector = (struct vector *)addr;
1313 #ifdef LISP_FEATURE_X86
1314 count = fixnum_value(vector->length)*3+2;
1316 #ifdef LISP_FEATURE_SPARC
1317 count = fixnum_value(vector->length)*4+2;
1322 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
1323 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
1324 vector = (struct vector *)addr;
1325 count = CEILING(NWORDS(fixnum_value(vector->length), 128) + 2,
1330 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
1331 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
1332 vector = (struct vector *)addr;
1333 #ifdef LISP_FEATURE_X86
1334 count = fixnum_value(vector->length)*6+2;
1336 #ifdef LISP_FEATURE_SPARC
1337 count = fixnum_value(vector->length)*8+2;
1342 case CODE_HEADER_WIDETAG:
1343 #if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
1344 gc_abort(); /* no code headers in static space */
1346 count = pscav_code((struct code*)addr);
1350 case SIMPLE_FUN_HEADER_WIDETAG:
1351 case RETURN_PC_HEADER_WIDETAG:
1352 /* We should never hit any of these, 'cause they occur
1353 * buried in the middle of code objects. */
1357 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1358 case CLOSURE_HEADER_WIDETAG:
1359 /* The function self pointer needs special care on the
1360 * x86 because it is the real entry point. */
1362 lispobj fun = ((struct closure *)addr)->fun
1363 - FUN_RAW_ADDR_OFFSET;
1364 pscav(&fun, 1, constant);
1365 ((struct closure *)addr)->fun = fun + FUN_RAW_ADDR_OFFSET;
1371 case WEAK_POINTER_WIDETAG:
1372 /* Weak pointers get preserved during purify, 'cause I
1373 * don't feel like figuring out how to break them. */
1374 pscav(addr+1, 2, constant);
1379 /* We have to handle fdefn objects specially, so we
1380 * can fix up the raw function address. */
1381 count = pscav_fdefn((struct fdefn *)addr);
1384 case INSTANCE_HEADER_WIDETAG:
1386 struct instance *instance = (struct instance *) addr;
1387 struct layout *layout
1388 = (struct layout *) native_pointer(instance->slots[0]);
1389 long nuntagged = fixnum_value(layout->n_untagged_slots);
1390 long nslots = HeaderValue(*addr);
1391 pscav(addr + 1, nslots - nuntagged, constant);
1392 count = CEILING(1 + nslots, 2);
1402 /* It's a fixnum. */
1414 purify(lispobj static_roots, lispobj read_only_roots)
1418 struct later *laters, *next;
1419 struct thread *thread;
1421 if(all_threads->next) {
1422 /* FIXME: there should be _some_ sensible error reporting
1423 * convention. See following comment too */
1424 fprintf(stderr,"Can't purify when more than one thread exists\n");
1430 printf("[doing purification:");
1433 #ifdef LISP_FEATURE_GENCGC
1434 gc_alloc_update_all_page_tables();
1436 for_each_thread(thread)
1437 if (fixnum_value(SymbolValue(FREE_INTERRUPT_CONTEXT_INDEX,thread)) != 0) {
1438 /* FIXME: 1. What does this mean? 2. It shouldn't be reporting
1439 * its error simply by a. printing a string b. to stdout instead
1441 printf(" Ack! Can't purify interrupt contexts. ");
1446 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1447 dynamic_space_purify_pointer =
1448 (lispobj*)SymbolValue(ALLOCATION_POINTER,0);
1450 #if defined(LISP_FEATURE_GENCGC)
1451 dynamic_space_purify_pointer = get_alloc_pointer();
1453 dynamic_space_purify_pointer = dynamic_space_free_pointer;
1457 read_only_end = read_only_free =
1458 (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER,0);
1459 static_end = static_free =
1460 (lispobj *)SymbolValue(STATIC_SPACE_FREE_POINTER,0);
1467 #if defined(LISP_FEATURE_GENCGC) && (defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64))
1468 /* note this expects only one thread to be active. We'd have to
1469 * stop all the others in the same way as GC does if we wanted
1470 * PURIFY to work when >1 thread exists */
1471 setup_i386_stack_scav(((&static_roots)-2),
1472 ((void *)all_threads->control_stack_end));
1475 pscav(&static_roots, 1, 0);
1476 pscav(&read_only_roots, 1, 1);
1479 printf(" handlers");
1482 pscav((lispobj *) interrupt_handlers,
1483 sizeof(interrupt_handlers) / sizeof(lispobj),
1490 #if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
1491 pscav((lispobj *)all_threads->control_stack_start,
1492 current_control_stack_pointer -
1493 all_threads->control_stack_start,
1496 #ifdef LISP_FEATURE_GENCGC
1502 printf(" bindings");
1505 #if !(defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64))
1506 pscav( (lispobj *)all_threads->binding_stack_start,
1507 (lispobj *)current_binding_stack_pointer -
1508 all_threads->binding_stack_start,
1511 for_each_thread(thread) {
1512 pscav( (lispobj *)thread->binding_stack_start,
1513 (lispobj *)SymbolValue(BINDING_STACK_POINTER,thread) -
1514 (lispobj *)thread->binding_stack_start,
1516 #ifdef LISP_FEATURE_SB_THREAD
1517 pscav( (lispobj *) (thread+1),
1518 fixnum_value(SymbolValue(FREE_TLS_INDEX,0)) -
1519 (sizeof (struct thread))/(sizeof (lispobj)),
1527 /* The original CMU CL code had scavenge-read-only-space code
1528 * controlled by the Lisp-level variable
1529 * *SCAVENGE-READ-ONLY-SPACE*. It was disabled by default, and it
1530 * wasn't documented under what circumstances it was useful or
1531 * safe to turn it on, so it's been turned off in SBCL. If you
1532 * want/need this functionality, and can test and document it,
1533 * please submit a patch. */
1535 if (SymbolValue(SCAVENGE_READ_ONLY_SPACE) != UNBOUND_MARKER_WIDETAG
1536 && SymbolValue(SCAVENGE_READ_ONLY_SPACE) != NIL) {
1537 unsigned read_only_space_size =
1538 (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER) -
1539 (lispobj *)READ_ONLY_SPACE_START;
1541 "scavenging read only space: %d bytes\n",
1542 read_only_space_size * sizeof(lispobj));
1543 pscav( (lispobj *)READ_ONLY_SPACE_START, read_only_space_size, 0);
1551 clean = (lispobj *)STATIC_SPACE_START;
1553 while (clean != static_free)
1554 clean = pscav(clean, static_free - clean, 0);
1555 laters = later_blocks;
1556 count = later_count;
1557 later_blocks = NULL;
1559 while (laters != NULL) {
1560 for (i = 0; i < count; i++) {
1561 if (laters->u[i].count == 0) {
1563 } else if (laters->u[i].count <= LATERMAXCOUNT) {
1564 pscav(laters->u[i+1].ptr, laters->u[i].count, 1);
1567 pscav(laters->u[i].ptr, 1, 1);
1570 next = laters->next;
1573 count = LATERBLOCKSIZE;
1575 } while (clean != static_free || later_blocks != NULL);
1582 os_zero((os_vm_address_t) current_dynamic_space,
1583 (os_vm_size_t) dynamic_space_size);
1585 /* Zero the stack. Note that the stack is also zeroed by SUB-GC
1586 * calling SCRUB-CONTROL-STACK - this zeros the stack on the x86. */
1587 #if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
1588 os_zero((os_vm_address_t) current_control_stack_pointer,
1590 ((all_threads->control_stack_end -
1591 current_control_stack_pointer) * sizeof(lispobj)));
1594 /* It helps to update the heap free pointers so that free_heap can
1595 * verify after it's done. */
1596 SetSymbolValue(READ_ONLY_SPACE_FREE_POINTER, (lispobj)read_only_free,0);
1597 SetSymbolValue(STATIC_SPACE_FREE_POINTER, (lispobj)static_free,0);
1599 #if defined LISP_FEATURE_GENCGC
1602 dynamic_space_free_pointer = current_dynamic_space;
1603 set_auto_gc_trigger(bytes_consed_between_gcs);
1606 /* Blast away instruction cache */
1607 os_flush_icache((os_vm_address_t)READ_ONLY_SPACE_START, READ_ONLY_SPACE_SIZE);
1608 os_flush_icache((os_vm_address_t)STATIC_SPACE_START, STATIC_SPACE_SIZE);