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 #if defined(LISP_FEATURE_GENCGC)
41 /* this is another artifact of the poor integration between gencgc and
42 * the rest of the runtime: on cheney gc there is a global
43 * dynamic_space_free_pointer which is valid whenever foreign function
44 * call is active, but in gencgc there's no such variable and we have
47 static lispobj *dynamic_space_free_pointer;
50 extern unsigned long bytes_consed_between_gcs;
53 /* These hold the original end of the read_only and static spaces so
54 * we can tell what are forwarding pointers. */
56 static lispobj *read_only_end, *static_end;
58 static lispobj *read_only_free, *static_free;
60 static lispobj *pscav(lispobj *addr, long nwords, boolean constant);
62 #define LATERBLOCKSIZE 1020
63 #define LATERMAXCOUNT 10
72 } *later_blocks = NULL;
73 static long later_count = 0;
76 #define SIMPLE_ARRAY_WORD_WIDETAG SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG
77 #elif N_WORD_BITS == 64
78 #define SIMPLE_ARRAY_WORD_WIDETAG SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
81 /* FIXME: Shouldn't this be defined in sbcl.h? See also notes in
84 #ifdef LISP_FEATURE_SPARC
85 #define FUN_RAW_ADDR_OFFSET 0
87 #define FUN_RAW_ADDR_OFFSET (6*sizeof(lispobj) - FUN_POINTER_LOWTAG)
91 forwarding_pointer_p(lispobj obj)
93 lispobj *ptr = native_pointer(obj);
95 return ((static_end <= ptr && ptr <= static_free) ||
96 (read_only_end <= ptr && ptr <= read_only_free));
100 dynamic_pointer_p(lispobj ptr)
102 #ifndef LISP_FEATURE_GENCGC
103 return (ptr >= (lispobj)current_dynamic_space
105 ptr < (lispobj)dynamic_space_free_pointer);
107 /* Be more conservative, and remember, this is a maybe. */
108 return (ptr >= (lispobj)DYNAMIC_SPACE_START
110 ptr < (lispobj)dynamic_space_free_pointer);
114 static inline lispobj *
115 newspace_alloc(long nwords, int constantp)
118 nwords=CEILING(nwords,2);
120 if(read_only_free + nwords >= (lispobj *)READ_ONLY_SPACE_END) {
121 lose("Ran out of read-only space while purifying!\n");
124 read_only_free+=nwords;
126 if(static_free + nwords >= (lispobj *)STATIC_SPACE_END) {
127 lose("Ran out of static space while purifying!\n");
137 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
139 #ifdef LISP_FEATURE_GENCGC
141 * enhanced x86/GENCGC stack scavenging by Douglas Crosher
143 * Scavenging the stack on the i386 is problematic due to conservative
144 * roots and raw return addresses. Here it is handled in two passes:
145 * the first pass runs before any objects are moved and tries to
146 * identify valid pointers and return address on the stack, the second
147 * pass scavenges these.
150 static unsigned pointer_filter_verbose = 0;
152 /* FIXME: This is substantially the same code as
153 * possibly_valid_dynamic_space_pointer in gencgc.c. The only
154 * relevant difference seems to be that the gencgc code also checks
155 * for raw pointers into Code objects, whereas in purify these are
156 * checked separately in setup_i386_stack_scav - they go onto
157 * valid_stack_ra_locations instead of just valid_stack_locations */
160 valid_dynamic_space_pointer(lispobj *pointer, lispobj *start_addr)
162 /* If it's not a return address then it needs to be a valid Lisp
164 if (!is_lisp_pointer((lispobj)pointer))
167 /* Check that the object pointed to is consistent with the pointer
169 switch (lowtag_of((lispobj)pointer)) {
170 case FUN_POINTER_LOWTAG:
171 /* Start_addr should be the enclosing code object, or a closure
173 switch (widetag_of(*start_addr)) {
174 case CODE_HEADER_WIDETAG:
175 /* This case is probably caught above. */
177 case CLOSURE_HEADER_WIDETAG:
178 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
179 if ((long)pointer != ((long)start_addr+FUN_POINTER_LOWTAG)) {
180 if (pointer_filter_verbose) {
181 fprintf(stderr,"*Wf2: %p %p %p\n",
182 pointer, start_addr, (void *)*start_addr);
188 if (pointer_filter_verbose) {
189 fprintf(stderr,"*Wf3: %p %p %p\n",
190 pointer, start_addr, (void *)*start_addr);
195 case LIST_POINTER_LOWTAG:
196 if ((long)pointer != ((long)start_addr+LIST_POINTER_LOWTAG)) {
197 if (pointer_filter_verbose)
198 fprintf(stderr,"*Wl1: %p %p %p\n",
199 pointer, start_addr, (void *)*start_addr);
202 /* Is it plausible cons? */
203 if ((is_lisp_pointer(start_addr[0])
204 || ((start_addr[0] & FIXNUM_TAG_MASK) == 0) /* fixnum */
205 || (widetag_of(start_addr[0]) == CHARACTER_WIDETAG)
206 #if N_WORD_BITS == 64
207 || (widetag_of(start_addr[0]) == SINGLE_FLOAT_WIDETAG)
209 || (widetag_of(start_addr[0]) == UNBOUND_MARKER_WIDETAG))
210 && (is_lisp_pointer(start_addr[1])
211 || ((start_addr[1] & FIXNUM_TAG_MASK) == 0) /* fixnum */
212 || (widetag_of(start_addr[1]) == CHARACTER_WIDETAG)
213 #if N_WORD_BITS == 64
214 || (widetag_of(start_addr[1]) == SINGLE_FLOAT_WIDETAG)
216 || (widetag_of(start_addr[1]) == UNBOUND_MARKER_WIDETAG))) {
219 if (pointer_filter_verbose) {
220 fprintf(stderr,"*Wl2: %p %p %p\n",
221 pointer, start_addr, (void *)*start_addr);
225 case INSTANCE_POINTER_LOWTAG:
226 if ((long)pointer != ((long)start_addr+INSTANCE_POINTER_LOWTAG)) {
227 if (pointer_filter_verbose) {
228 fprintf(stderr,"*Wi1: %p %p %p\n",
229 pointer, start_addr, (void *)*start_addr);
233 if (widetag_of(start_addr[0]) != INSTANCE_HEADER_WIDETAG) {
234 if (pointer_filter_verbose) {
235 fprintf(stderr,"*Wi2: %p %p %p\n",
236 pointer, start_addr, (void *)*start_addr);
241 case OTHER_POINTER_LOWTAG:
242 if ((long)pointer != ((long)start_addr+OTHER_POINTER_LOWTAG)) {
243 if (pointer_filter_verbose) {
244 fprintf(stderr,"*Wo1: %p %p %p\n",
245 pointer, start_addr, (void *)*start_addr);
249 /* Is it plausible? Not a cons. XXX should check the headers. */
250 if (is_lisp_pointer(start_addr[0]) || ((start_addr[0] & FIXNUM_TAG_MASK) == 0)) {
251 if (pointer_filter_verbose) {
252 fprintf(stderr,"*Wo2: %p %p %p\n",
253 pointer, start_addr, (void *)*start_addr);
257 switch (widetag_of(start_addr[0])) {
258 case UNBOUND_MARKER_WIDETAG:
259 case CHARACTER_WIDETAG:
260 #if N_WORD_BITS == 64
261 case SINGLE_FLOAT_WIDETAG:
263 if (pointer_filter_verbose) {
264 fprintf(stderr,"*Wo3: %p %p %p\n",
265 pointer, start_addr, (void *)*start_addr);
269 /* only pointed to by function pointers? */
270 case CLOSURE_HEADER_WIDETAG:
271 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
272 if (pointer_filter_verbose) {
273 fprintf(stderr,"*Wo4: %p %p %p\n",
274 pointer, start_addr, (void *)*start_addr);
278 case INSTANCE_HEADER_WIDETAG:
279 if (pointer_filter_verbose) {
280 fprintf(stderr,"*Wo5: %p %p %p\n",
281 pointer, start_addr, (void *)*start_addr);
285 /* the valid other immediate pointer objects */
286 case SIMPLE_VECTOR_WIDETAG:
288 case COMPLEX_WIDETAG:
289 #ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
290 case COMPLEX_SINGLE_FLOAT_WIDETAG:
292 #ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
293 case COMPLEX_DOUBLE_FLOAT_WIDETAG:
295 #ifdef COMPLEX_LONG_FLOAT_WIDETAG
296 case COMPLEX_LONG_FLOAT_WIDETAG:
298 case SIMPLE_ARRAY_WIDETAG:
299 case COMPLEX_BASE_STRING_WIDETAG:
300 #ifdef COMPLEX_CHARACTER_STRING_WIDETAG
301 case COMPLEX_CHARACTER_STRING_WIDETAG:
303 case COMPLEX_VECTOR_NIL_WIDETAG:
304 case COMPLEX_BIT_VECTOR_WIDETAG:
305 case COMPLEX_VECTOR_WIDETAG:
306 case COMPLEX_ARRAY_WIDETAG:
307 case VALUE_CELL_HEADER_WIDETAG:
308 case SYMBOL_HEADER_WIDETAG:
310 case CODE_HEADER_WIDETAG:
312 #if N_WORD_BITS != 64
313 case SINGLE_FLOAT_WIDETAG:
315 case DOUBLE_FLOAT_WIDETAG:
316 #ifdef LONG_FLOAT_WIDETAG
317 case LONG_FLOAT_WIDETAG:
319 case SIMPLE_ARRAY_NIL_WIDETAG:
320 case SIMPLE_BASE_STRING_WIDETAG:
321 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
322 case SIMPLE_CHARACTER_STRING_WIDETAG:
324 case SIMPLE_BIT_VECTOR_WIDETAG:
325 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
326 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
327 case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
328 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
329 case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
330 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
331 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG
332 case SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG:
334 case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
335 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
336 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG
337 case SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG:
339 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
340 case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
342 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
343 case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
345 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
346 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
348 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
349 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
351 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
352 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
354 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
355 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
357 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG
358 case SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG:
360 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
361 case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
363 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
364 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
365 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
366 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
368 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
369 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
371 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
372 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
374 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
375 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
378 case WEAK_POINTER_WIDETAG:
382 if (pointer_filter_verbose) {
383 fprintf(stderr,"*Wo6: %p %p %p\n",
384 pointer, start_addr, (void *)*start_addr);
390 if (pointer_filter_verbose) {
391 fprintf(stderr,"*W?: %p %p %p\n",
392 pointer, start_addr, (void *)*start_addr);
401 #define MAX_STACK_POINTERS 256
402 lispobj *valid_stack_locations[MAX_STACK_POINTERS];
403 unsigned long num_valid_stack_locations;
405 #define MAX_STACK_RETURN_ADDRESSES 128
406 lispobj *valid_stack_ra_locations[MAX_STACK_RETURN_ADDRESSES];
407 lispobj *valid_stack_ra_code_objects[MAX_STACK_RETURN_ADDRESSES];
408 unsigned long num_valid_stack_ra_locations;
410 /* Identify valid stack slots. */
412 setup_i386_stack_scav(lispobj *lowaddr, lispobj *base)
414 lispobj *sp = lowaddr;
415 num_valid_stack_locations = 0;
416 num_valid_stack_ra_locations = 0;
417 for (sp = lowaddr; sp < base; sp++) {
419 /* Find the object start address */
420 lispobj *start_addr = search_dynamic_space((void *)thing);
422 /* We need to allow raw pointers into Code objects for
423 * return addresses. This will also pick up pointers to
424 * functions in code objects. */
425 if (widetag_of(*start_addr) == CODE_HEADER_WIDETAG) {
426 /* FIXME asserting here is a really dumb thing to do.
427 * If we've overflowed some arbitrary static limit, we
428 * should just refuse to purify, instead of killing
429 * the whole lisp session
431 gc_assert(num_valid_stack_ra_locations <
432 MAX_STACK_RETURN_ADDRESSES);
433 valid_stack_ra_locations[num_valid_stack_ra_locations] = sp;
434 valid_stack_ra_code_objects[num_valid_stack_ra_locations++] =
435 (lispobj *)((long)start_addr + OTHER_POINTER_LOWTAG);
437 if (valid_dynamic_space_pointer((void *)thing, start_addr)) {
438 gc_assert(num_valid_stack_locations < MAX_STACK_POINTERS);
439 valid_stack_locations[num_valid_stack_locations++] = sp;
444 if (pointer_filter_verbose) {
445 fprintf(stderr, "number of valid stack pointers = %ld\n",
446 num_valid_stack_locations);
447 fprintf(stderr, "number of stack return addresses = %ld\n",
448 num_valid_stack_ra_locations);
453 pscav_i386_stack(void)
457 for (i = 0; i < num_valid_stack_locations; i++)
458 pscav(valid_stack_locations[i], 1, 0);
460 for (i = 0; i < num_valid_stack_ra_locations; i++) {
461 lispobj code_obj = (lispobj)valid_stack_ra_code_objects[i];
462 pscav(&code_obj, 1, 0);
463 if (pointer_filter_verbose) {
464 fprintf(stderr,"*C moved RA %p to %p; for code object %p to %p\n",
465 (void *)*valid_stack_ra_locations[i],
466 (void *)(*valid_stack_ra_locations[i]) -
467 ((void *)valid_stack_ra_code_objects[i] -
469 valid_stack_ra_code_objects[i], (void *)code_obj);
471 *valid_stack_ra_locations[i] =
472 ((long)(*valid_stack_ra_locations[i])
473 - ((long)valid_stack_ra_code_objects[i] - (long)code_obj));
481 pscav_later(lispobj *where, long count)
485 if (count > LATERMAXCOUNT) {
486 while (count > LATERMAXCOUNT) {
487 pscav_later(where, LATERMAXCOUNT);
488 count -= LATERMAXCOUNT;
489 where += LATERMAXCOUNT;
493 if (later_blocks == NULL || later_count == LATERBLOCKSIZE ||
494 (later_count == LATERBLOCKSIZE-1 && count > 1)) {
495 new = (struct later *)malloc(sizeof(struct later));
496 new->next = later_blocks;
497 if (later_blocks && later_count < LATERBLOCKSIZE)
498 later_blocks->u[later_count].ptr = NULL;
504 later_blocks->u[later_count++].count = count;
505 later_blocks->u[later_count++].ptr = where;
510 ptrans_boxed(lispobj thing, lispobj header, boolean constant)
513 lispobj result, *new, *old;
515 nwords = CEILING(1 + HeaderValue(header), 2);
518 old = (lispobj *)native_pointer(thing);
519 new = newspace_alloc(nwords,constant);
522 bcopy(old, new, nwords * sizeof(lispobj));
524 /* Deposit forwarding pointer. */
525 result = make_lispobj(new, lowtag_of(thing));
529 pscav(new, nwords, constant);
534 /* We need to look at the layout to see whether it is a pure structure
535 * class, and only then can we transport as constant. If it is pure,
536 * we can ALWAYS transport as a constant. */
538 ptrans_instance(lispobj thing, lispobj header, boolean /* ignored */ constant)
540 struct layout *layout =
541 (struct layout *) native_pointer(((struct instance *)native_pointer(thing))->slots[0]);
542 lispobj pure = layout->pure;
546 return (ptrans_boxed(thing, header, 1));
548 return (ptrans_boxed(thing, header, 0));
551 /* Substructure: special case for the COMPACT-INFO-ENVs,
552 * where the instance may have a point to the dynamic
553 * space placed into it (e.g. the cache-name slot), but
554 * the lists and arrays at the time of a purify can be
555 * moved to the RO space. */
557 lispobj result, *new, *old;
559 nwords = CEILING(1 + HeaderValue(header), 2);
562 old = (lispobj *)native_pointer(thing);
563 new = newspace_alloc(nwords, 0); /* inconstant */
566 bcopy(old, new, nwords * sizeof(lispobj));
568 /* Deposit forwarding pointer. */
569 result = make_lispobj(new, lowtag_of(thing));
573 pscav(new, nwords, 1);
579 return NIL; /* dummy value: return something ... */
584 ptrans_fdefn(lispobj thing, lispobj header)
587 lispobj result, *new, *old, oldfn;
590 nwords = CEILING(1 + HeaderValue(header), 2);
593 old = (lispobj *)native_pointer(thing);
594 new = newspace_alloc(nwords, 0); /* inconstant */
597 bcopy(old, new, nwords * sizeof(lispobj));
599 /* Deposit forwarding pointer. */
600 result = make_lispobj(new, lowtag_of(thing));
603 /* Scavenge the function. */
604 fdefn = (struct fdefn *)new;
606 pscav(&fdefn->fun, 1, 0);
607 if ((char *)oldfn + FUN_RAW_ADDR_OFFSET == fdefn->raw_addr)
608 fdefn->raw_addr = (char *)fdefn->fun + FUN_RAW_ADDR_OFFSET;
614 ptrans_unboxed(lispobj thing, lispobj header)
617 lispobj result, *new, *old;
619 nwords = CEILING(1 + HeaderValue(header), 2);
622 old = (lispobj *)native_pointer(thing);
623 new = newspace_alloc(nwords,1); /* always constant */
626 bcopy(old, new, nwords * sizeof(lispobj));
628 /* Deposit forwarding pointer. */
629 result = make_lispobj(new , lowtag_of(thing));
636 ptrans_vector(lispobj thing, long bits, long extra,
637 boolean boxed, boolean constant)
639 struct vector *vector;
641 lispobj result, *new;
644 vector = (struct vector *)native_pointer(thing);
645 length = fixnum_value(vector->length)+extra;
646 // Argh, handle simple-vector-nil separately.
650 nwords = CEILING(NWORDS(length, bits) + 2, 2);
653 new=newspace_alloc(nwords, (constant || !boxed));
654 bcopy(vector, new, nwords * sizeof(lispobj));
656 result = make_lispobj(new, lowtag_of(thing));
657 vector->header = result;
660 pscav(new, nwords, constant);
665 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
667 apply_code_fixups_during_purify(struct code *old_code, struct code *new_code)
669 long nheader_words, ncode_words, nwords;
670 void *constants_start_addr, *constants_end_addr;
671 void *code_start_addr, *code_end_addr;
672 lispobj fixups = NIL;
673 unsigned displacement = (unsigned)new_code - (unsigned)old_code;
674 struct vector *fixups_vector;
676 ncode_words = fixnum_value(new_code->code_size);
677 nheader_words = HeaderValue(*(lispobj *)new_code);
678 nwords = ncode_words + nheader_words;
680 constants_start_addr = (void *)new_code + 5 * N_WORD_BYTES;
681 constants_end_addr = (void *)new_code + nheader_words*N_WORD_BYTES;
682 code_start_addr = (void *)new_code + nheader_words*N_WORD_BYTES;
683 code_end_addr = (void *)new_code + nwords*N_WORD_BYTES;
685 /* The first constant should be a pointer to the fixups for this
686 * code objects. Check. */
687 fixups = new_code->constants[0];
689 /* It will be 0 or the unbound-marker if there are no fixups, and
690 * will be an other-pointer to a vector if it is valid. */
692 (fixups==UNBOUND_MARKER_WIDETAG) ||
693 !is_lisp_pointer(fixups)) {
694 #ifdef LISP_FEATURE_GENCGC
695 /* Check for a possible errors. */
696 sniff_code_object(new_code,displacement);
701 fixups_vector = (struct vector *)native_pointer(fixups);
703 /* Could be pointing to a forwarding pointer. */
704 if (is_lisp_pointer(fixups) && (dynamic_pointer_p(fixups))
705 && forwarding_pointer_p(*(lispobj *)fixups_vector)) {
706 /* If so then follow it. */
708 (struct vector *)native_pointer(*(lispobj *)fixups_vector);
711 if (widetag_of(fixups_vector->header) == SIMPLE_ARRAY_WORD_WIDETAG) {
712 /* We got the fixups for the code block. Now work through the
713 * vector, and apply a fixup at each address. */
714 long length = fixnum_value(fixups_vector->length);
716 for (i=0; i<length; i++) {
717 unsigned offset = fixups_vector->data[i];
718 /* Now check the current value of offset. */
720 *(unsigned *)((unsigned)code_start_addr + offset);
722 /* If it's within the old_code object then it must be an
723 * absolute fixup (relative ones are not saved) */
724 if ((old_value>=(unsigned)old_code)
725 && (old_value<((unsigned)old_code + nwords * N_WORD_BYTES)))
726 /* So add the dispacement. */
727 *(unsigned *)((unsigned)code_start_addr + offset) = old_value
730 /* It is outside the old code object so it must be a relative
731 * fixup (absolute fixups are not saved). So subtract the
733 *(unsigned *)((unsigned)code_start_addr + offset) = old_value
738 /* No longer need the fixups. */
739 new_code->constants[0] = 0;
741 #ifdef LISP_FEATURE_GENCGC
742 /* Check for possible errors. */
743 sniff_code_object(new_code,displacement);
749 ptrans_code(lispobj thing)
751 struct code *code, *new;
753 lispobj func, result;
755 code = (struct code *)native_pointer(thing);
756 nwords = CEILING(HeaderValue(code->header) + fixnum_value(code->code_size),
759 new = (struct code *)newspace_alloc(nwords,1); /* constant */
761 bcopy(code, new, nwords * sizeof(lispobj));
763 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
764 apply_code_fixups_during_purify(code,new);
767 result = make_lispobj(new, OTHER_POINTER_LOWTAG);
769 /* Stick in a forwarding pointer for the code object. */
770 *(lispobj *)code = result;
772 /* Put in forwarding pointers for all the functions. */
773 for (func = code->entry_points;
775 func = ((struct simple_fun *)native_pointer(func))->next) {
777 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
779 *(lispobj *)native_pointer(func) = result + (func - thing);
782 /* Arrange to scavenge the debug info later. */
783 pscav_later(&new->debug_info, 1);
785 /* FIXME: why would this be a fixnum? */
786 /* "why" is a hard word, but apparently for compiled functions the
787 trace_table_offset contains the length of the instructions, as
788 a fixnum. See CODE-INST-AREA-LENGTH in
789 src/compiler/target-disassem.lisp. -- CSR, 2004-01-08 */
790 if (!(fixnump(new->trace_table_offset)))
792 pscav(&new->trace_table_offset, 1, 0);
794 new->trace_table_offset = NIL; /* limit lifetime */
797 /* Scavenge the constants. */
798 pscav(new->constants, HeaderValue(new->header)-5, 1);
800 /* Scavenge all the functions. */
801 pscav(&new->entry_points, 1, 1);
802 for (func = new->entry_points;
804 func = ((struct simple_fun *)native_pointer(func))->next) {
805 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
806 gc_assert(!dynamic_pointer_p(func));
808 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
809 /* Temporarily convert the self pointer to a real function pointer. */
810 ((struct simple_fun *)native_pointer(func))->self
811 -= FUN_RAW_ADDR_OFFSET;
813 pscav(&((struct simple_fun *)native_pointer(func))->self, 2, 1);
814 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
815 ((struct simple_fun *)native_pointer(func))->self
816 += FUN_RAW_ADDR_OFFSET;
818 pscav_later(&((struct simple_fun *)native_pointer(func))->name, 3);
825 ptrans_func(lispobj thing, lispobj header)
828 lispobj code, *new, *old, result;
829 struct simple_fun *function;
831 /* Thing can either be a function header, a closure function
832 * header, a closure, or a funcallable-instance. If it's a closure
833 * or a funcallable-instance, we do the same as ptrans_boxed.
834 * Otherwise we have to do something strange, 'cause it is buried
835 * inside a code object. */
837 if (widetag_of(header) == SIMPLE_FUN_HEADER_WIDETAG) {
839 /* We can only end up here if the code object has not been
840 * scavenged, because if it had been scavenged, forwarding pointers
841 * would have been left behind for all the entry points. */
843 function = (struct simple_fun *)native_pointer(thing);
846 ((native_pointer(thing) -
847 (HeaderValue(function->header))), OTHER_POINTER_LOWTAG);
849 /* This will cause the function's header to be replaced with a
850 * forwarding pointer. */
854 /* So we can just return that. */
855 return function->header;
858 /* It's some kind of closure-like thing. */
859 nwords = CEILING(1 + HeaderValue(header), 2);
860 old = (lispobj *)native_pointer(thing);
862 /* Allocate the new one. FINs *must* not go in read_only
863 * space. Closures can; they never change */
866 (nwords,(widetag_of(header)!=FUNCALLABLE_INSTANCE_HEADER_WIDETAG));
869 bcopy(old, new, nwords * sizeof(lispobj));
871 /* Deposit forwarding pointer. */
872 result = make_lispobj(new, lowtag_of(thing));
876 pscav(new, nwords, 0);
883 ptrans_returnpc(lispobj thing, lispobj header)
887 /* Find the corresponding code object. */
888 code = thing - HeaderValue(header)*sizeof(lispobj);
890 /* Make sure it's been transported. */
891 new = *(lispobj *)native_pointer(code);
892 if (!forwarding_pointer_p(new))
893 new = ptrans_code(code);
895 /* Maintain the offset: */
896 return new + (thing - code);
899 #define WORDS_PER_CONS CEILING(sizeof(struct cons) / sizeof(lispobj), 2)
902 ptrans_list(lispobj thing, boolean constant)
904 struct cons *old, *new, *orig;
907 orig = (struct cons *) newspace_alloc(0,constant);
911 /* Allocate a new cons cell. */
912 old = (struct cons *)native_pointer(thing);
913 new = (struct cons *) newspace_alloc(WORDS_PER_CONS,constant);
915 /* Copy the cons cell and keep a pointer to the cdr. */
917 thing = new->cdr = old->cdr;
919 /* Set up the forwarding pointer. */
920 *(lispobj *)old = make_lispobj(new, LIST_POINTER_LOWTAG);
922 /* And count this cell. */
924 } while (lowtag_of(thing) == LIST_POINTER_LOWTAG &&
925 dynamic_pointer_p(thing) &&
926 !(forwarding_pointer_p(*(lispobj *)native_pointer(thing))));
928 /* Scavenge the list we just copied. */
929 pscav((lispobj *)orig, length * WORDS_PER_CONS, constant);
931 return make_lispobj(orig, LIST_POINTER_LOWTAG);
935 ptrans_otherptr(lispobj thing, lispobj header, boolean constant)
937 switch (widetag_of(header)) {
938 /* FIXME: this needs a reindent */
940 case SINGLE_FLOAT_WIDETAG:
941 case DOUBLE_FLOAT_WIDETAG:
942 #ifdef LONG_FLOAT_WIDETAG
943 case LONG_FLOAT_WIDETAG:
945 #ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
946 case COMPLEX_SINGLE_FLOAT_WIDETAG:
948 #ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
949 case COMPLEX_DOUBLE_FLOAT_WIDETAG:
951 #ifdef COMPLEX_LONG_FLOAT_WIDETAG
952 case COMPLEX_LONG_FLOAT_WIDETAG:
955 return ptrans_unboxed(thing, header);
958 case COMPLEX_WIDETAG:
959 case SIMPLE_ARRAY_WIDETAG:
960 case COMPLEX_BASE_STRING_WIDETAG:
961 #ifdef COMPLEX_CHARACTER_STRING_WIDETAG
962 case COMPLEX_CHARACTER_STRING_WIDETAG:
964 case COMPLEX_BIT_VECTOR_WIDETAG:
965 case COMPLEX_VECTOR_NIL_WIDETAG:
966 case COMPLEX_VECTOR_WIDETAG:
967 case COMPLEX_ARRAY_WIDETAG:
968 return ptrans_boxed(thing, header, constant);
970 case VALUE_CELL_HEADER_WIDETAG:
971 case WEAK_POINTER_WIDETAG:
972 return ptrans_boxed(thing, header, 0);
974 case SYMBOL_HEADER_WIDETAG:
975 return ptrans_boxed(thing, header, 0);
977 case SIMPLE_ARRAY_NIL_WIDETAG:
978 return ptrans_vector(thing, 0, 0, 0, constant);
980 case SIMPLE_BASE_STRING_WIDETAG:
981 return ptrans_vector(thing, 8, 1, 0, constant);
983 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
984 case SIMPLE_CHARACTER_STRING_WIDETAG:
985 return ptrans_vector(thing, 32, 1, 0, constant);
988 case SIMPLE_BIT_VECTOR_WIDETAG:
989 return ptrans_vector(thing, 1, 0, 0, constant);
991 case SIMPLE_VECTOR_WIDETAG:
992 return ptrans_vector(thing, N_WORD_BITS, 0, 1, constant);
994 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
995 return ptrans_vector(thing, 2, 0, 0, constant);
997 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
998 return ptrans_vector(thing, 4, 0, 0, constant);
1000 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
1001 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
1002 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
1003 case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
1005 return ptrans_vector(thing, 8, 0, 0, constant);
1007 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
1008 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
1009 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
1010 case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
1012 return ptrans_vector(thing, 16, 0, 0, constant);
1014 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
1015 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
1016 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
1017 case SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG:
1019 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
1020 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
1021 case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
1023 return ptrans_vector(thing, 32, 0, 0, constant);
1025 #if N_WORD_BITS == 64
1026 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG
1027 case SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG:
1029 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
1030 case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
1032 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
1033 case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
1035 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG
1036 case SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG:
1038 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
1039 case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
1041 return ptrans_vector(thing, 64, 0, 0, constant);
1044 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
1045 return ptrans_vector(thing, 32, 0, 0, constant);
1047 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
1048 return ptrans_vector(thing, 64, 0, 0, constant);
1050 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
1051 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
1052 #ifdef LISP_FEATURE_X86
1053 return ptrans_vector(thing, 96, 0, 0, constant);
1055 #ifdef LISP_FEATURE_SPARC
1056 return ptrans_vector(thing, 128, 0, 0, constant);
1060 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
1061 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
1062 return ptrans_vector(thing, 64, 0, 0, constant);
1065 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
1066 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
1067 return ptrans_vector(thing, 128, 0, 0, constant);
1070 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
1071 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
1072 #ifdef LISP_FEATURE_X86
1073 return ptrans_vector(thing, 192, 0, 0, constant);
1075 #ifdef LISP_FEATURE_SPARC
1076 return ptrans_vector(thing, 256, 0, 0, constant);
1080 case CODE_HEADER_WIDETAG:
1081 return ptrans_code(thing);
1083 case RETURN_PC_HEADER_WIDETAG:
1084 return ptrans_returnpc(thing, header);
1087 return ptrans_fdefn(thing, header);
1090 fprintf(stderr, "Invalid widetag: %d\n", widetag_of(header));
1091 /* Should only come across other pointers to the above stuff. */
1098 pscav_fdefn(struct fdefn *fdefn)
1102 fix_func = ((char *)(fdefn->fun+FUN_RAW_ADDR_OFFSET) == fdefn->raw_addr);
1103 pscav(&fdefn->name, 1, 1);
1104 pscav(&fdefn->fun, 1, 0);
1106 fdefn->raw_addr = (char *)(fdefn->fun + FUN_RAW_ADDR_OFFSET);
1107 return sizeof(struct fdefn) / sizeof(lispobj);
1110 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1111 /* now putting code objects in static space */
1113 pscav_code(struct code*code)
1117 nwords = CEILING(HeaderValue(code->header) + fixnum_value(code->code_size),
1120 /* Arrange to scavenge the debug info later. */
1121 pscav_later(&code->debug_info, 1);
1123 /* Scavenge the constants. */
1124 pscav(code->constants, HeaderValue(code->header)-5, 1);
1126 /* Scavenge all the functions. */
1127 pscav(&code->entry_points, 1, 1);
1128 for (func = code->entry_points;
1130 func = ((struct simple_fun *)native_pointer(func))->next) {
1131 gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
1132 gc_assert(!dynamic_pointer_p(func));
1134 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1135 /* Temporarily convert the self pointer to a real function
1137 ((struct simple_fun *)native_pointer(func))->self
1138 -= FUN_RAW_ADDR_OFFSET;
1140 pscav(&((struct simple_fun *)native_pointer(func))->self, 2, 1);
1141 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1142 ((struct simple_fun *)native_pointer(func))->self
1143 += FUN_RAW_ADDR_OFFSET;
1145 pscav_later(&((struct simple_fun *)native_pointer(func))->name, 3);
1148 return CEILING(nwords,2);
1153 pscav(lispobj *addr, long nwords, boolean constant)
1155 lispobj thing, *thingp, header;
1156 long count = 0; /* (0 = dummy init value to stop GCC warning) */
1157 struct vector *vector;
1159 while (nwords > 0) {
1161 if (is_lisp_pointer(thing)) {
1162 /* It's a pointer. Is it something we might have to move? */
1163 if (dynamic_pointer_p(thing)) {
1164 /* Maybe. Have we already moved it? */
1165 thingp = (lispobj *)native_pointer(thing);
1167 if (is_lisp_pointer(header) && forwarding_pointer_p(header))
1168 /* Yep, so just copy the forwarding pointer. */
1171 /* Nope, copy the object. */
1172 switch (lowtag_of(thing)) {
1173 case FUN_POINTER_LOWTAG:
1174 thing = ptrans_func(thing, header);
1177 case LIST_POINTER_LOWTAG:
1178 thing = ptrans_list(thing, constant);
1181 case INSTANCE_POINTER_LOWTAG:
1182 thing = ptrans_instance(thing, header, constant);
1185 case OTHER_POINTER_LOWTAG:
1186 thing = ptrans_otherptr(thing, header, constant);
1190 /* It was a pointer, but not one of them? */
1198 #if N_WORD_BITS == 64
1199 else if (widetag_of(thing) == SINGLE_FLOAT_WIDETAG) {
1203 else if (thing & FIXNUM_TAG_MASK) {
1204 /* It's an other immediate. Maybe the header for an unboxed */
1206 switch (widetag_of(thing)) {
1207 case BIGNUM_WIDETAG:
1208 case SINGLE_FLOAT_WIDETAG:
1209 case DOUBLE_FLOAT_WIDETAG:
1210 #ifdef LONG_FLOAT_WIDETAG
1211 case LONG_FLOAT_WIDETAG:
1214 /* It's an unboxed simple object. */
1215 count = CEILING(HeaderValue(thing)+1, 2);
1218 case SIMPLE_VECTOR_WIDETAG:
1219 if (HeaderValue(thing) == subtype_VectorValidHashing) {
1220 *addr = (subtype_VectorMustRehash << N_WIDETAG_BITS) |
1221 SIMPLE_VECTOR_WIDETAG;
1226 case SIMPLE_ARRAY_NIL_WIDETAG:
1230 case SIMPLE_BASE_STRING_WIDETAG:
1231 vector = (struct vector *)addr;
1232 count = CEILING(NWORDS(fixnum_value(vector->length)+1,8)+2,2);
1235 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
1236 case SIMPLE_CHARACTER_STRING_WIDETAG:
1237 vector = (struct vector *)addr;
1238 count = CEILING(NWORDS(fixnum_value(vector->length)+1,32)+2,2);
1242 case SIMPLE_BIT_VECTOR_WIDETAG:
1243 vector = (struct vector *)addr;
1244 count = CEILING(NWORDS(fixnum_value(vector->length),1)+2,2);
1247 case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
1248 vector = (struct vector *)addr;
1249 count = CEILING(NWORDS(fixnum_value(vector->length),2)+2,2);
1252 case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
1253 vector = (struct vector *)addr;
1254 count = CEILING(NWORDS(fixnum_value(vector->length),4)+2,2);
1257 case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
1258 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
1259 case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
1260 case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
1262 vector = (struct vector *)addr;
1263 count = CEILING(NWORDS(fixnum_value(vector->length),8)+2,2);
1266 case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
1267 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
1268 case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
1269 case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
1271 vector = (struct vector *)addr;
1272 count = CEILING(NWORDS(fixnum_value(vector->length),16)+2,2);
1275 case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
1276 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG
1277 case SIMPLE_ARRAY_SIGNED_BYTE_30_WIDETAG:
1278 case SIMPLE_ARRAY_UNSIGNED_BYTE_29_WIDETAG:
1280 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
1281 case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
1282 case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
1284 vector = (struct vector *)addr;
1285 count = CEILING(NWORDS(fixnum_value(vector->length),32)+2,2);
1288 #if N_WORD_BITS == 64
1289 case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
1290 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG
1291 case SIMPLE_ARRAY_SIGNED_BYTE_61_WIDETAG:
1292 case SIMPLE_ARRAY_UNSIGNED_BYTE_60_WIDETAG:
1294 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
1295 case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
1296 case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
1298 vector = (struct vector *)addr;
1299 count = CEILING(NWORDS(fixnum_value(vector->length),64)+2,2);
1303 case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
1304 vector = (struct vector *)addr;
1305 count = CEILING(NWORDS(fixnum_value(vector->length), 32) + 2,
1309 case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
1310 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
1311 case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
1313 vector = (struct vector *)addr;
1314 count = CEILING(NWORDS(fixnum_value(vector->length), 64) + 2,
1318 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
1319 case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
1320 vector = (struct vector *)addr;
1321 #ifdef LISP_FEATURE_X86
1322 count = fixnum_value(vector->length)*3+2;
1324 #ifdef LISP_FEATURE_SPARC
1325 count = fixnum_value(vector->length)*4+2;
1330 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
1331 case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
1332 vector = (struct vector *)addr;
1333 count = CEILING(NWORDS(fixnum_value(vector->length), 128) + 2,
1338 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
1339 case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
1340 vector = (struct vector *)addr;
1341 #ifdef LISP_FEATURE_X86
1342 count = fixnum_value(vector->length)*6+2;
1344 #ifdef LISP_FEATURE_SPARC
1345 count = fixnum_value(vector->length)*8+2;
1350 case CODE_HEADER_WIDETAG:
1351 #if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
1352 gc_abort(); /* no code headers in static space */
1354 count = pscav_code((struct code*)addr);
1358 case SIMPLE_FUN_HEADER_WIDETAG:
1359 case RETURN_PC_HEADER_WIDETAG:
1360 /* We should never hit any of these, 'cause they occur
1361 * buried in the middle of code objects. */
1365 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1366 case CLOSURE_HEADER_WIDETAG:
1367 case FUNCALLABLE_INSTANCE_HEADER_WIDETAG:
1368 /* The function self pointer needs special care on the
1369 * x86 because it is the real entry point. */
1371 lispobj fun = ((struct closure *)addr)->fun
1372 - FUN_RAW_ADDR_OFFSET;
1373 pscav(&fun, 1, constant);
1374 ((struct closure *)addr)->fun = fun + FUN_RAW_ADDR_OFFSET;
1380 case WEAK_POINTER_WIDETAG:
1381 /* Weak pointers get preserved during purify, 'cause I
1382 * don't feel like figuring out how to break them. */
1383 pscav(addr+1, 2, constant);
1388 /* We have to handle fdefn objects specially, so we
1389 * can fix up the raw function address. */
1390 count = pscav_fdefn((struct fdefn *)addr);
1393 case INSTANCE_HEADER_WIDETAG:
1395 struct instance *instance = (struct instance *) addr;
1396 struct layout *layout
1397 = (struct layout *) native_pointer(instance->slots[0]);
1398 long nuntagged = fixnum_value(layout->n_untagged_slots);
1399 long nslots = HeaderValue(*addr);
1400 pscav(addr + 1, nslots - nuntagged, constant);
1401 count = CEILING(1 + nslots, 2);
1411 /* It's a fixnum. */
1423 purify(lispobj static_roots, lispobj read_only_roots)
1427 struct later *laters, *next;
1428 struct thread *thread;
1430 if(all_threads->next) {
1431 /* FIXME: there should be _some_ sensible error reporting
1432 * convention. See following comment too */
1433 fprintf(stderr,"Can't purify when more than one thread exists\n");
1439 printf("[doing purification:");
1442 #ifdef LISP_FEATURE_GENCGC
1443 gc_alloc_update_all_page_tables();
1445 for_each_thread(thread)
1446 if (fixnum_value(SymbolValue(FREE_INTERRUPT_CONTEXT_INDEX,thread)) != 0) {
1447 /* FIXME: 1. What does this mean? 2. It shouldn't be reporting
1448 * its error simply by a. printing a string b. to stdout instead
1450 printf(" Ack! Can't purify interrupt contexts. ");
1455 #if defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64)
1456 dynamic_space_free_pointer =
1457 (lispobj*)SymbolValue(ALLOCATION_POINTER,0);
1460 read_only_end = read_only_free =
1461 (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER,0);
1462 static_end = static_free =
1463 (lispobj *)SymbolValue(STATIC_SPACE_FREE_POINTER,0);
1470 #if defined(LISP_FEATURE_GENCGC) && (defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64))
1471 /* note this expects only one thread to be active. We'd have to
1472 * stop all the others in the same way as GC does if we wanted
1473 * PURIFY to work when >1 thread exists */
1474 setup_i386_stack_scav(((&static_roots)-2),
1475 ((void *)all_threads->control_stack_end));
1478 pscav(&static_roots, 1, 0);
1479 pscav(&read_only_roots, 1, 1);
1482 printf(" handlers");
1485 pscav((lispobj *) interrupt_handlers,
1486 sizeof(interrupt_handlers) / sizeof(lispobj),
1493 #if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
1494 pscav((lispobj *)all_threads->control_stack_start,
1495 current_control_stack_pointer -
1496 all_threads->control_stack_start,
1499 #ifdef LISP_FEATURE_GENCGC
1505 printf(" bindings");
1508 #if !(defined(LISP_FEATURE_X86) || defined(LISP_FEATURE_X86_64))
1509 pscav( (lispobj *)all_threads->binding_stack_start,
1510 (lispobj *)current_binding_stack_pointer -
1511 all_threads->binding_stack_start,
1514 for_each_thread(thread) {
1515 pscav( (lispobj *)thread->binding_stack_start,
1516 (lispobj *)SymbolValue(BINDING_STACK_POINTER,thread) -
1517 (lispobj *)thread->binding_stack_start,
1519 pscav( (lispobj *) (thread+1),
1520 fixnum_value(SymbolValue(FREE_TLS_INDEX,0)) -
1521 (sizeof (struct thread))/(sizeof (lispobj)),
1528 /* The original CMU CL code had scavenge-read-only-space code
1529 * controlled by the Lisp-level variable
1530 * *SCAVENGE-READ-ONLY-SPACE*. It was disabled by default, and it
1531 * wasn't documented under what circumstances it was useful or
1532 * safe to turn it on, so it's been turned off in SBCL. If you
1533 * want/need this functionality, and can test and document it,
1534 * please submit a patch. */
1536 if (SymbolValue(SCAVENGE_READ_ONLY_SPACE) != UNBOUND_MARKER_WIDETAG
1537 && SymbolValue(SCAVENGE_READ_ONLY_SPACE) != NIL) {
1538 unsigned read_only_space_size =
1539 (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER) -
1540 (lispobj *)READ_ONLY_SPACE_START;
1542 "scavenging read only space: %d bytes\n",
1543 read_only_space_size * sizeof(lispobj));
1544 pscav( (lispobj *)READ_ONLY_SPACE_START, read_only_space_size, 0);
1552 clean = (lispobj *)STATIC_SPACE_START;
1554 while (clean != static_free)
1555 clean = pscav(clean, static_free - clean, 0);
1556 laters = later_blocks;
1557 count = later_count;
1558 later_blocks = NULL;
1560 while (laters != NULL) {
1561 for (i = 0; i < count; i++) {
1562 if (laters->u[i].count == 0) {
1564 } else if (laters->u[i].count <= LATERMAXCOUNT) {
1565 pscav(laters->u[i+1].ptr, laters->u[i].count, 1);
1568 pscav(laters->u[i].ptr, 1, 1);
1571 next = laters->next;
1574 count = LATERBLOCKSIZE;
1576 } while (clean != static_free || later_blocks != NULL);
1583 os_zero((os_vm_address_t) current_dynamic_space,
1584 (os_vm_size_t) DYNAMIC_SPACE_SIZE);
1586 /* Zero the stack. Note that the stack is also zeroed by SUB-GC
1587 * calling SCRUB-CONTROL-STACK - this zeros the stack on the x86. */
1588 #if !defined(LISP_FEATURE_X86) && !defined(LISP_FEATURE_X86_64)
1589 os_zero((os_vm_address_t) current_control_stack_pointer,
1591 ((all_threads->control_stack_end -
1592 current_control_stack_pointer) * sizeof(lispobj)));
1595 /* It helps to update the heap free pointers so that free_heap can
1596 * verify after it's done. */
1597 SetSymbolValue(READ_ONLY_SPACE_FREE_POINTER, (lispobj)read_only_free,0);
1598 SetSymbolValue(STATIC_SPACE_FREE_POINTER, (lispobj)static_free,0);
1600 #if !defined(ALLOCATION_POINTER)
1601 dynamic_space_free_pointer = current_dynamic_space;
1602 set_auto_gc_trigger(bytes_consed_between_gcs);
1604 #if defined LISP_FEATURE_GENCGC
1607 #error unsupported case /* in CMU CL, was "ibmrt using GC" */
1611 /* Blast away instruction cache */
1612 os_flush_icache((os_vm_address_t)READ_ONLY_SPACE_START, READ_ONLY_SPACE_SIZE);
1613 os_flush_icache((os_vm_address_t)STATIC_SPACE_START, STATIC_SPACE_SIZE);