X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=src%2Fruntime%2Fpurify.c;h=c7060857b4ccababb49be8e4328f49137c7e4184;hb=81cfdf526490d642c73602ebac9bcacb8af644e1;hp=d194d35ae0545927d4790cac7e395d49c6e059ae;hpb=a530bbe337109d898d5b4a001fc8f1afa3b5dc39;p=sbcl.git diff --git a/src/runtime/purify.c b/src/runtime/purify.c index d194d35..c706085 100644 --- a/src/runtime/purify.c +++ b/src/runtime/purify.c @@ -13,10 +13,6 @@ * files for more information. */ -/* - * $Header$ - */ - #include #include #include @@ -33,10 +29,13 @@ #include "gencgc.h" #endif -#undef PRINTNOISE +#define PRINTNOISE -#if defined(ibmrt) || defined(__i386__) -static lispobj *current_dynamic_space_free_pointer; +#if defined(__i386__) +/* again, what's so special about the x86 that this is differently + * visible there than on other platforms? -dan 20010125 + */ +static lispobj *dynamic_space_free_pointer; #endif #define gc_abort() \ @@ -63,7 +62,8 @@ static lispobj *pscav(lispobj *addr, int nwords, boolean constant); #define LATERBLOCKSIZE 1020 #define LATERMAXCOUNT 10 -static struct later { +static struct +later { struct later *next; union { lispobj *ptr; @@ -96,122 +96,25 @@ static boolean dynamic_pointer_p(lispobj ptr) { #ifndef __i386__ - return (ptr >= (lispobj)dynamic_0_space); + /* KLUDGE: This has an implicit dependence on the ordering of + * address spaces, and is therefore basically wrong. I'd fix it, + * but I don't have a non-386 port to test it on. Porters are + * encouraged to fix it. -- WHN 2000-10-17 */ + return (ptr >= (lispobj)DYNAMIC_SPACE_START); #else /* Be more conservative, and remember, this is a maybe. */ - return (ptr >= (lispobj)current_dynamic_space + return (ptr >= (lispobj)DYNAMIC_SPACE_START && - ptr < (lispobj)current_dynamic_space_free_pointer); + ptr < (lispobj)dynamic_space_free_pointer); #endif } #ifdef __i386__ -#ifdef WANT_CGC -/* original x86/CGC stack scavenging code by Paul Werkowski */ - -static int -maybe_can_move_p(lispobj thing) -{ - lispobj *thingp,header; - if (dynamic_pointer_p(thing)) { /* in dynamic space */ - thingp = (lispobj*)PTR(thing); - header = *thingp; - if(Pointerp(header) && forwarding_pointer_p(header)) - return -1; /* must change it */ - if(LowtagOf(thing) == type_ListPointer) - return type_ListPointer; /* can we check this somehow */ - else if (thing & 3) { /* not fixnum */ - int kind = TypeOf(header); - /* printf(" %x %x",header,kind); */ - switch (kind) { /* something with a header */ - case type_Bignum: - case type_SingleFloat: - case type_DoubleFloat: -#ifdef type_LongFloat - case type_LongFloat: -#endif - case type_Sap: - case type_SimpleVector: - case type_SimpleString: - case type_SimpleBitVector: - case type_SimpleArrayUnsignedByte2: - case type_SimpleArrayUnsignedByte4: - case type_SimpleArrayUnsignedByte8: - case type_SimpleArrayUnsignedByte16: - case type_SimpleArrayUnsignedByte32: -#ifdef type_SimpleArraySignedByte8 - case type_SimpleArraySignedByte8: -#endif -#ifdef type_SimpleArraySignedByte16 - case type_SimpleArraySignedByte16: -#endif -#ifdef type_SimpleArraySignedByte30 - case type_SimpleArraySignedByte30: -#endif -#ifdef type_SimpleArraySignedByte32 - case type_SimpleArraySignedByte32: -#endif - case type_SimpleArraySingleFloat: - case type_SimpleArrayDoubleFloat: -#ifdef type_SimpleArrayLongFloat - case type_SimpleArrayLongFloat: -#endif -#ifdef type_SimpleArrayComplexSingleFloat - case type_SimpleArrayComplexSingleFloat: -#endif -#ifdef type_SimpleArrayComplexDoubleFloat - case type_SimpleArrayComplexDoubleFloat: -#endif -#ifdef type_SimpleArrayComplexLongFloat - case type_SimpleArrayComplexLongFloat: -#endif - case type_CodeHeader: - case type_FunctionHeader: - case type_ClosureFunctionHeader: - case type_ReturnPcHeader: - case type_ClosureHeader: - case type_FuncallableInstanceHeader: - case type_InstanceHeader: - case type_ValueCellHeader: - case type_ByteCodeFunction: - case type_ByteCodeClosure: - case type_WeakPointer: - case type_Fdefn: - return kind; - break; - default: - return 0; - }}} - return 0; -} - -static int pverbose=0; -#define PVERBOSE pverbose -static void -carefully_pscav_stack(lispobj*lowaddr, lispobj*base) -{ - lispobj*sp = lowaddr; - while (sp < base) - { int k; - lispobj thing = *sp; - if((unsigned)thing & 0x3) /* may be pointer */ - { - /* need to check for valid float/double? */ - k = maybe_can_move_p(thing); - if(PVERBOSE)printf("%8x %8x %d\n",sp, thing, k); - if(k) - pscav(sp, 1, 0); - } - sp++; - } -} -#endif - #ifdef GENCGC /* - * Enhanced x86/GENCGC stack scavenging by Douglas Crosher. + * enhanced x86/GENCGC stack scavenging by Douglas Crosher * * Scavenging the stack on the i386 is problematic due to conservative * roots and raw return addresses. Here it is handled in two passes: @@ -222,197 +125,221 @@ carefully_pscav_stack(lispobj*lowaddr, lispobj*base) static unsigned pointer_filter_verbose = 0; +/* FIXME: This is substantially the same code as in gencgc.c. (There + * are some differences, at least (1) the gencgc.c code needs to worry + * about return addresses on the stack pinning code objects, (2) the + * gencgc.c code needs to worry about the GC maybe happening in an + * interrupt service routine when the main thread of control was + * interrupted just as it had allocated memory and before it + * initialized it, while PURIFY needn't worry about that, and (3) the + * gencgc.c code has mutated more under maintenance since the fork + * from CMU CL than the code here has.) The two versions should be + * made to explicitly share common code, instead of just two different + * cut-and-pasted versions. */ static int valid_dynamic_space_pointer(lispobj *pointer, lispobj *start_addr) { - /* If it's not a return address then it needs to be a valid Lisp - * pointer. */ - if (!Pointerp((lispobj)pointer)) - return 0; + /* If it's not a return address then it needs to be a valid Lisp + * pointer. */ + if (!is_lisp_pointer((lispobj)pointer)) + return 0; - /* Check that the object pointed to is consistent with the pointer - * low tag. */ - switch (LowtagOf((lispobj)pointer)) { - case type_FunctionPointer: - /* Start_addr should be the enclosing code object, or a closure - * header. */ - switch (TypeOf(*start_addr)) { - case type_CodeHeader: - /* This case is probably caught above. */ - break; - case type_ClosureHeader: - case type_FuncallableInstanceHeader: - case type_ByteCodeFunction: - case type_ByteCodeClosure: - if ((int)pointer != ((int)start_addr+type_FunctionPointer)) { - if (pointer_filter_verbose) { - fprintf(stderr,"*Wf2: %x %x %x\n", pointer, start_addr, *start_addr); + /* Check that the object pointed to is consistent with the pointer + * low tag. */ + switch (LowtagOf((lispobj)pointer)) { + case type_FunctionPointer: + /* Start_addr should be the enclosing code object, or a closure + * header. */ + switch (TypeOf(*start_addr)) { + case type_CodeHeader: + /* This case is probably caught above. */ + break; + case type_ClosureHeader: + case type_FuncallableInstanceHeader: + case type_ByteCodeFunction: + case type_ByteCodeClosure: + if ((int)pointer != ((int)start_addr+type_FunctionPointer)) { + if (pointer_filter_verbose) { + fprintf(stderr,"*Wf2: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + } + break; + default: + if (pointer_filter_verbose) { + fprintf(stderr,"*Wf3: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; } - return 0; - } - break; - default: - if (pointer_filter_verbose) { - fprintf(stderr,"*Wf3: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - } - break; - case type_ListPointer: - if ((int)pointer != ((int)start_addr+type_ListPointer)) { - if (pointer_filter_verbose) - fprintf(stderr,"*Wl1: %x %x %x\n", pointer, start_addr, *start_addr); - return 0; - } - /* Is it plausible cons? */ - if((Pointerp(start_addr[0]) - || ((start_addr[0] & 3) == 0) /* fixnum */ - || (TypeOf(start_addr[0]) == type_BaseChar) - || (TypeOf(start_addr[0]) == type_UnboundMarker)) - && (Pointerp(start_addr[1]) - || ((start_addr[1] & 3) == 0) /* fixnum */ - || (TypeOf(start_addr[1]) == type_BaseChar) - || (TypeOf(start_addr[1]) == type_UnboundMarker))) { - break; - } else { - if (pointer_filter_verbose) { - fprintf(stderr,"*Wl2: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - } - case type_InstancePointer: - if ((int)pointer != ((int)start_addr+type_InstancePointer)) { - if (pointer_filter_verbose) { - fprintf(stderr,"*Wi1: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - } - if (TypeOf(start_addr[0]) != type_InstanceHeader) { - if (pointer_filter_verbose) { - fprintf(stderr,"*Wi2: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - } - break; - case type_OtherPointer: - if ((int)pointer != ((int)start_addr+type_OtherPointer)) { - if (pointer_filter_verbose) { - fprintf(stderr,"*Wo1: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - } - /* Is it plausible? Not a cons. X should check the headers. */ - if(Pointerp(start_addr[0]) || ((start_addr[0] & 3) == 0)) { - if (pointer_filter_verbose) { - fprintf(stderr,"*Wo2: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - } - switch (TypeOf(start_addr[0])) { - case type_UnboundMarker: - case type_BaseChar: - if (pointer_filter_verbose) { - fprintf(stderr,"*Wo3: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - - /* only pointed to by function pointers? */ - case type_ClosureHeader: - case type_FuncallableInstanceHeader: - case type_ByteCodeFunction: - case type_ByteCodeClosure: - if (pointer_filter_verbose) { - fprintf(stderr,"*Wo4: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - - case type_InstanceHeader: - if (pointer_filter_verbose) { - fprintf(stderr,"*Wo5: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - - /* the valid other immediate pointer objects */ - case type_SimpleVector: - case type_Ratio: - case type_Complex: + break; + case type_ListPointer: + if ((int)pointer != ((int)start_addr+type_ListPointer)) { + if (pointer_filter_verbose) + fprintf(stderr,"*Wl1: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + return 0; + } + /* Is it plausible cons? */ + if((is_lisp_pointer(start_addr[0]) + || ((start_addr[0] & 3) == 0) /* fixnum */ + || (TypeOf(start_addr[0]) == type_BaseChar) + || (TypeOf(start_addr[0]) == type_UnboundMarker)) + && (is_lisp_pointer(start_addr[1]) + || ((start_addr[1] & 3) == 0) /* fixnum */ + || (TypeOf(start_addr[1]) == type_BaseChar) + || (TypeOf(start_addr[1]) == type_UnboundMarker))) { + break; + } else { + if (pointer_filter_verbose) { + fprintf(stderr,"*Wl2: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + } + case type_InstancePointer: + if ((int)pointer != ((int)start_addr+type_InstancePointer)) { + if (pointer_filter_verbose) { + fprintf(stderr,"*Wi1: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + } + if (TypeOf(start_addr[0]) != type_InstanceHeader) { + if (pointer_filter_verbose) { + fprintf(stderr,"*Wi2: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + } + break; + case type_OtherPointer: + if ((int)pointer != ((int)start_addr+type_OtherPointer)) { + if (pointer_filter_verbose) { + fprintf(stderr,"*Wo1: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + } + /* Is it plausible? Not a cons. X should check the headers. */ + if(is_lisp_pointer(start_addr[0]) || ((start_addr[0] & 3) == 0)) { + if (pointer_filter_verbose) { + fprintf(stderr,"*Wo2: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + } + switch (TypeOf(start_addr[0])) { + case type_UnboundMarker: + case type_BaseChar: + if (pointer_filter_verbose) { + fprintf(stderr,"*Wo3: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + + /* only pointed to by function pointers? */ + case type_ClosureHeader: + case type_FuncallableInstanceHeader: + case type_ByteCodeFunction: + case type_ByteCodeClosure: + if (pointer_filter_verbose) { + fprintf(stderr,"*Wo4: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + + case type_InstanceHeader: + if (pointer_filter_verbose) { + fprintf(stderr,"*Wo5: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + + /* the valid other immediate pointer objects */ + case type_SimpleVector: + case type_Ratio: + case type_Complex: #ifdef type_ComplexSingleFloat - case type_ComplexSingleFloat: + case type_ComplexSingleFloat: #endif #ifdef type_ComplexDoubleFloat - case type_ComplexDoubleFloat: + case type_ComplexDoubleFloat: #endif #ifdef type_ComplexLongFloat - case type_ComplexLongFloat: -#endif - case type_SimpleArray: - case type_ComplexString: - case type_ComplexBitVector: - case type_ComplexVector: - case type_ComplexArray: - case type_ValueCellHeader: - case type_SymbolHeader: - case type_Fdefn: - case type_CodeHeader: - case type_Bignum: - case type_SingleFloat: - case type_DoubleFloat: + case type_ComplexLongFloat: +#endif + case type_SimpleArray: + case type_ComplexString: + case type_ComplexBitVector: + case type_ComplexVector: + case type_ComplexArray: + case type_ValueCellHeader: + case type_SymbolHeader: + case type_Fdefn: + case type_CodeHeader: + case type_Bignum: + case type_SingleFloat: + case type_DoubleFloat: #ifdef type_LongFloat - case type_LongFloat: -#endif - case type_SimpleString: - case type_SimpleBitVector: - case type_SimpleArrayUnsignedByte2: - case type_SimpleArrayUnsignedByte4: - case type_SimpleArrayUnsignedByte8: - case type_SimpleArrayUnsignedByte16: - case type_SimpleArrayUnsignedByte32: + case type_LongFloat: +#endif + case type_SimpleString: + case type_SimpleBitVector: + case type_SimpleArrayUnsignedByte2: + case type_SimpleArrayUnsignedByte4: + case type_SimpleArrayUnsignedByte8: + case type_SimpleArrayUnsignedByte16: + case type_SimpleArrayUnsignedByte32: #ifdef type_SimpleArraySignedByte8 - case type_SimpleArraySignedByte8: + case type_SimpleArraySignedByte8: #endif #ifdef type_SimpleArraySignedByte16 - case type_SimpleArraySignedByte16: + case type_SimpleArraySignedByte16: #endif #ifdef type_SimpleArraySignedByte30 - case type_SimpleArraySignedByte30: + case type_SimpleArraySignedByte30: #endif #ifdef type_SimpleArraySignedByte32 - case type_SimpleArraySignedByte32: + case type_SimpleArraySignedByte32: #endif - case type_SimpleArraySingleFloat: - case type_SimpleArrayDoubleFloat: + case type_SimpleArraySingleFloat: + case type_SimpleArrayDoubleFloat: #ifdef type_SimpleArrayLongFloat - case type_SimpleArrayLongFloat: + case type_SimpleArrayLongFloat: #endif #ifdef type_SimpleArrayComplexSingleFloat - case type_SimpleArrayComplexSingleFloat: + case type_SimpleArrayComplexSingleFloat: #endif #ifdef type_SimpleArrayComplexDoubleFloat - case type_SimpleArrayComplexDoubleFloat: + case type_SimpleArrayComplexDoubleFloat: #endif #ifdef type_SimpleArrayComplexLongFloat - case type_SimpleArrayComplexLongFloat: -#endif - case type_Sap: - case type_WeakPointer: - break; - + case type_SimpleArrayComplexLongFloat: +#endif + case type_Sap: + case type_WeakPointer: + break; + + default: + if (pointer_filter_verbose) { + fprintf(stderr,"*Wo6: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; + } + break; default: - if (pointer_filter_verbose) { - fprintf(stderr,"*Wo6: %x %x %x\n", pointer, start_addr, *start_addr); - } - return 0; - } - break; - default: - if (pointer_filter_verbose) { - fprintf(stderr,"*W?: %x %x %x\n", pointer, start_addr, *start_addr); + if (pointer_filter_verbose) { + fprintf(stderr,"*W?: %x %x %x\n", (unsigned int) pointer, + (unsigned int) start_addr, *start_addr); + } + return 0; } - return 0; - } - /* looks good */ - return 1; + /* looks good */ + return 1; } #define MAX_STACK_POINTERS 256 @@ -428,60 +355,61 @@ unsigned int num_valid_stack_ra_locations; static void setup_i386_stack_scav(lispobj *lowaddr, lispobj *base) { - lispobj *sp = lowaddr; - num_valid_stack_locations = 0; - num_valid_stack_ra_locations = 0; - for (sp = lowaddr; sp < base; sp++) { - lispobj thing = *sp; - /* Find the object start address */ - lispobj *start_addr = search_dynamic_space((void *)thing); - if (start_addr) { - /* We need to allow raw pointers into Code objects for return - * addresses. This will also pick up pointers to functions in code - * objects. */ - if (TypeOf(*start_addr) == type_CodeHeader) { - gc_assert(num_valid_stack_ra_locations < MAX_STACK_RETURN_ADDRESSES); - valid_stack_ra_locations[num_valid_stack_ra_locations] = sp; - valid_stack_ra_code_objects[num_valid_stack_ra_locations++] = - (lispobj *)((int)start_addr + type_OtherPointer); - } else { - if (valid_dynamic_space_pointer((void *)thing, start_addr)) { - gc_assert(num_valid_stack_locations < MAX_STACK_POINTERS); - valid_stack_locations[num_valid_stack_locations++] = sp; + lispobj *sp = lowaddr; + num_valid_stack_locations = 0; + num_valid_stack_ra_locations = 0; + for (sp = lowaddr; sp < base; sp++) { + lispobj thing = *sp; + /* Find the object start address */ + lispobj *start_addr = search_dynamic_space((void *)thing); + if (start_addr) { + /* We need to allow raw pointers into Code objects for + * return addresses. This will also pick up pointers to + * functions in code objects. */ + if (TypeOf(*start_addr) == type_CodeHeader) { + gc_assert(num_valid_stack_ra_locations < + MAX_STACK_RETURN_ADDRESSES); + valid_stack_ra_locations[num_valid_stack_ra_locations] = sp; + valid_stack_ra_code_objects[num_valid_stack_ra_locations++] = + (lispobj *)((int)start_addr + type_OtherPointer); + } else { + if (valid_dynamic_space_pointer((void *)thing, start_addr)) { + gc_assert(num_valid_stack_locations < MAX_STACK_POINTERS); + valid_stack_locations[num_valid_stack_locations++] = sp; + } + } } - } } - } - if (pointer_filter_verbose) { - fprintf(stderr, "number of valid stack pointers = %d\n", - num_valid_stack_locations); - fprintf(stderr, "number of stack return addresses = %d\n", - num_valid_stack_ra_locations); - } + if (pointer_filter_verbose) { + fprintf(stderr, "number of valid stack pointers = %d\n", + num_valid_stack_locations); + fprintf(stderr, "number of stack return addresses = %d\n", + num_valid_stack_ra_locations); + } } static void pscav_i386_stack(void) { - int i; + int i; - for (i = 0; i < num_valid_stack_locations; i++) - pscav(valid_stack_locations[i], 1, 0); + for (i = 0; i < num_valid_stack_locations; i++) + pscav(valid_stack_locations[i], 1, 0); - for (i = 0; i < num_valid_stack_ra_locations; i++) { - lispobj code_obj = (lispobj)valid_stack_ra_code_objects[i]; - pscav(&code_obj, 1, 0); - if (pointer_filter_verbose) { - fprintf(stderr,"*C moved RA %x to %x; for code object %x to %x\n", - *valid_stack_ra_locations[i], - (int)(*valid_stack_ra_locations[i]) - - ((int)valid_stack_ra_code_objects[i] - (int)code_obj), - valid_stack_ra_code_objects[i], code_obj); + for (i = 0; i < num_valid_stack_ra_locations; i++) { + lispobj code_obj = (lispobj)valid_stack_ra_code_objects[i]; + pscav(&code_obj, 1, 0); + if (pointer_filter_verbose) { + fprintf(stderr,"*C moved RA %x to %x; for code object %x to %x\n", + *valid_stack_ra_locations[i], + (int)(*valid_stack_ra_locations[i]) + - ((int)valid_stack_ra_code_objects[i] - (int)code_obj), + (unsigned int) valid_stack_ra_code_objects[i], code_obj); + } + *valid_stack_ra_locations[i] = + ((int)(*valid_stack_ra_locations[i]) + - ((int)valid_stack_ra_code_objects[i] - (int)code_obj)); } - *valid_stack_ra_locations[i] = - ((int)(*valid_stack_ra_locations[i]) - - ((int)valid_stack_ra_code_objects[i] - (int)code_obj)); - } } #endif #endif @@ -516,7 +444,8 @@ pscav_later(lispobj *where, int count) } } -static lispobj ptrans_boxed(lispobj thing, lispobj header, boolean constant) +static lispobj +ptrans_boxed(lispobj thing, lispobj header, boolean constant) { int nwords; lispobj result, *new, *old; @@ -524,7 +453,7 @@ static lispobj ptrans_boxed(lispobj thing, lispobj header, boolean constant) nwords = 1 + HeaderValue(header); /* Allocate it */ - old = (lispobj *)PTR(thing); + old = (lispobj *)native_pointer(thing); if (constant) { new = read_only_free; read_only_free += CEILING(nwords, 2); @@ -548,12 +477,13 @@ static lispobj ptrans_boxed(lispobj thing, lispobj header, boolean constant) } /* We need to look at the layout to see whether it is a pure structure - * class, and only then can we transport as constant. If it is pure, we can - * ALWAYS transport as a constant. */ -static lispobj ptrans_instance(lispobj thing, lispobj header, boolean constant) + * class, and only then can we transport as constant. If it is pure, + * we can ALWAYS transport as a constant. */ +static lispobj +ptrans_instance(lispobj thing, lispobj header, boolean constant) { - lispobj layout = ((struct instance *)PTR(thing))->slots[0]; - lispobj pure = ((struct instance *)PTR(layout))->slots[15]; + lispobj layout = ((struct instance *)native_pointer(thing))->slots[0]; + lispobj pure = ((struct instance *)native_pointer(layout))->slots[15]; switch (pure) { case T: @@ -562,17 +492,18 @@ static lispobj ptrans_instance(lispobj thing, lispobj header, boolean constant) return (ptrans_boxed(thing, header, 0)); case 0: { - /* Substructure: special case for the compact-info-envs, where - * the instance may have a point to the dynamic space placed - * into it (e.g. the cache-name slot), but the lists and arrays - * at the time of a purify can be moved to the RO space. */ + /* Substructure: special case for the COMPACT-INFO-ENVs, + * where the instance may have a point to the dynamic + * space placed into it (e.g. the cache-name slot), but + * the lists and arrays at the time of a purify can be + * moved to the RO space. */ int nwords; lispobj result, *new, *old; nwords = 1 + HeaderValue(header); /* Allocate it */ - old = (lispobj *)PTR(thing); + old = (lispobj *)native_pointer(thing); new = static_free; static_free += CEILING(nwords, 2); @@ -590,10 +521,12 @@ static lispobj ptrans_instance(lispobj thing, lispobj header, boolean constant) } default: gc_abort(); + return NIL; /* dummy value: return something ... */ } } -static lispobj ptrans_fdefn(lispobj thing, lispobj header) +static lispobj +ptrans_fdefn(lispobj thing, lispobj header) { int nwords; lispobj result, *new, *old, oldfn; @@ -602,7 +535,7 @@ static lispobj ptrans_fdefn(lispobj thing, lispobj header) nwords = 1 + HeaderValue(header); /* Allocate it */ - old = (lispobj *)PTR(thing); + old = (lispobj *)native_pointer(thing); new = static_free; static_free += CEILING(nwords, 2); @@ -623,7 +556,8 @@ static lispobj ptrans_fdefn(lispobj thing, lispobj header) return result; } -static lispobj ptrans_unboxed(lispobj thing, lispobj header) +static lispobj +ptrans_unboxed(lispobj thing, lispobj header) { int nwords; lispobj result, *new, *old; @@ -631,7 +565,7 @@ static lispobj ptrans_unboxed(lispobj thing, lispobj header) nwords = 1 + HeaderValue(header); /* Allocate it */ - old = (lispobj *)PTR(thing); + old = (lispobj *)native_pointer(thing); new = read_only_free; read_only_free += CEILING(nwords, 2); @@ -645,14 +579,15 @@ static lispobj ptrans_unboxed(lispobj thing, lispobj header) return result; } -static lispobj ptrans_vector(lispobj thing, int bits, int extra, - boolean boxed, boolean constant) +static lispobj +ptrans_vector(lispobj thing, int bits, int extra, + boolean boxed, boolean constant) { struct vector *vector; int nwords; lispobj result, *new; - vector = (struct vector *)PTR(thing); + vector = (struct vector *)native_pointer(thing); nwords = 2 + (CEILING((fixnum_value(vector->length)+extra)*bits,32)>>5); if (boxed && !constant) { @@ -682,7 +617,6 @@ apply_code_fixups_during_purify(struct code *old_code, struct code *new_code) int nheader_words, ncode_words, nwords; void *constants_start_addr, *constants_end_addr; void *code_start_addr, *code_end_addr; - lispobj p; lispobj fixups = NIL; unsigned displacement = (unsigned)new_code - (unsigned)old_code; struct vector *fixups_vector; @@ -708,7 +642,9 @@ apply_code_fixups_during_purify(struct code *old_code, struct code *new_code) /* It will be 0 or the unbound-marker if there are no fixups, and * will be an other-pointer to a vector if it is valid. */ - if ((fixups==0) || (fixups==type_UnboundMarker) || !Pointerp(fixups)) { + if ((fixups==0) || + (fixups==type_UnboundMarker) || + !is_lisp_pointer(fixups)) { #ifdef GENCGC /* Check for a possible errors. */ sniff_code_object(new_code,displacement); @@ -716,13 +652,13 @@ apply_code_fixups_during_purify(struct code *old_code, struct code *new_code) return; } - fixups_vector = (struct vector *)PTR(fixups); + fixups_vector = (struct vector *)native_pointer(fixups); /* Could be pointing to a forwarding pointer. */ - if (Pointerp(fixups) && (dynamic_pointer_p(fixups)) + if (is_lisp_pointer(fixups) && (dynamic_pointer_p(fixups)) && forwarding_pointer_p(*(lispobj *)fixups_vector)) { /* If so then follow it. */ - fixups_vector = (struct vector *)PTR(*(lispobj *)fixups_vector); + fixups_vector = (struct vector *)native_pointer(*(lispobj *)fixups_vector); } if (TypeOf(fixups_vector->header) == type_SimpleArrayUnsignedByte32) { @@ -761,13 +697,14 @@ apply_code_fixups_during_purify(struct code *old_code, struct code *new_code) } #endif -static lispobj ptrans_code(lispobj thing) +static lispobj +ptrans_code(lispobj thing) { struct code *code, *new; int nwords; lispobj func, result; - code = (struct code *)PTR(thing); + code = (struct code *)native_pointer(thing); nwords = HeaderValue(code->header) + fixnum_value(code->code_size); new = (struct code *)read_only_free; @@ -787,11 +724,11 @@ static lispobj ptrans_code(lispobj thing) /* Put in forwarding pointers for all the functions. */ for (func = code->entry_points; func != NIL; - func = ((struct function *)PTR(func))->next) { + func = ((struct function *)native_pointer(func))->next) { gc_assert(LowtagOf(func) == type_FunctionPointer); - *(lispobj *)PTR(func) = result + (func - thing); + *(lispobj *)native_pointer(func) = result + (func - thing); } /* Arrange to scavenge the debug info later. */ @@ -811,26 +748,27 @@ static lispobj ptrans_code(lispobj thing) pscav(&new->entry_points, 1, 1); for (func = new->entry_points; func != NIL; - func = ((struct function *)PTR(func))->next) { + func = ((struct function *)native_pointer(func))->next) { gc_assert(LowtagOf(func) == type_FunctionPointer); gc_assert(!dynamic_pointer_p(func)); #ifdef __i386__ /* Temporarly convert the self pointer to a real function pointer. */ - ((struct function *)PTR(func))->self -= RAW_ADDR_OFFSET; + ((struct function *)native_pointer(func))->self -= RAW_ADDR_OFFSET; #endif - pscav(&((struct function *)PTR(func))->self, 2, 1); + pscav(&((struct function *)native_pointer(func))->self, 2, 1); #ifdef __i386__ - ((struct function *)PTR(func))->self += RAW_ADDR_OFFSET; + ((struct function *)native_pointer(func))->self += RAW_ADDR_OFFSET; #endif - pscav_later(&((struct function *)PTR(func))->name, 3); + pscav_later(&((struct function *)native_pointer(func))->name, 3); } return result; } -static lispobj ptrans_func(lispobj thing, lispobj header) +static lispobj +ptrans_func(lispobj thing, lispobj header) { int nwords; lispobj code, *new, *old, result; @@ -849,8 +787,10 @@ static lispobj ptrans_func(lispobj thing, lispobj header) * scavenged, because if it had been scavenged, forwarding pointers * would have been left behind for all the entry points. */ - function = (struct function *)PTR(thing); - code = (PTR(thing)-(HeaderValue(function->header)*sizeof(lispobj))) | + function = (struct function *)native_pointer(thing); + code = + (native_pointer(thing) - + (HeaderValue(function->header)*sizeof(lispobj))) | type_OtherPointer; /* This will cause the function's header to be replaced with a @@ -863,7 +803,7 @@ static lispobj ptrans_func(lispobj thing, lispobj header) else { /* It's some kind of closure-like thing. */ nwords = 1 + HeaderValue(header); - old = (lispobj *)PTR(thing); + old = (lispobj *)native_pointer(thing); /* Allocate the new one. */ if (TypeOf(header) == type_FuncallableInstanceHeader) { @@ -892,7 +832,8 @@ static lispobj ptrans_func(lispobj thing, lispobj header) } } -static lispobj ptrans_returnpc(lispobj thing, lispobj header) +static lispobj +ptrans_returnpc(lispobj thing, lispobj header) { lispobj code, new; @@ -900,7 +841,7 @@ static lispobj ptrans_returnpc(lispobj thing, lispobj header) code = thing - HeaderValue(header)*sizeof(lispobj); /* Make sure it's been transported. */ - new = *(lispobj *)PTR(code); + new = *(lispobj *)native_pointer(code); if (!forwarding_pointer_p(new)) new = ptrans_code(code); @@ -910,7 +851,8 @@ static lispobj ptrans_returnpc(lispobj thing, lispobj header) #define WORDS_PER_CONS CEILING(sizeof(struct cons) / sizeof(lispobj), 2) -static lispobj ptrans_list(lispobj thing, boolean constant) +static lispobj +ptrans_list(lispobj thing, boolean constant) { struct cons *old, *new, *orig; int length; @@ -923,7 +865,7 @@ static lispobj ptrans_list(lispobj thing, boolean constant) do { /* Allocate a new cons cell. */ - old = (struct cons *)PTR(thing); + old = (struct cons *)native_pointer(thing); if (constant) { new = (struct cons *)read_only_free; read_only_free += WORDS_PER_CONS; @@ -944,7 +886,7 @@ static lispobj ptrans_list(lispobj thing, boolean constant) length++; } while (LowtagOf(thing) == type_ListPointer && dynamic_pointer_p(thing) && - !(forwarding_pointer_p(*(lispobj *)PTR(thing)))); + !(forwarding_pointer_p(*(lispobj *)native_pointer(thing)))); /* Scavenge the list we just copied. */ pscav((lispobj *)orig, length * WORDS_PER_CONS, constant); @@ -952,7 +894,8 @@ static lispobj ptrans_list(lispobj thing, boolean constant) return ((lispobj)orig) | type_ListPointer; } -static lispobj ptrans_otherptr(lispobj thing, lispobj header, boolean constant) +static lispobj +ptrans_otherptr(lispobj thing, lispobj header, boolean constant) { switch (TypeOf(header)) { case type_Bignum: @@ -1076,7 +1019,8 @@ static lispobj ptrans_otherptr(lispobj thing, lispobj header, boolean constant) } } -static int pscav_fdefn(struct fdefn *fdefn) +static int +pscav_fdefn(struct fdefn *fdefn) { boolean fix_func; @@ -1120,41 +1064,42 @@ pscav_code(struct code*code) pscav(&code->entry_points, 1, 1); for (func = code->entry_points; func != NIL; - func = ((struct function *)PTR(func))->next) { + func = ((struct function *)native_pointer(func))->next) { gc_assert(LowtagOf(func) == type_FunctionPointer); gc_assert(!dynamic_pointer_p(func)); #ifdef __i386__ /* Temporarly convert the self pointer to a real function * pointer. */ - ((struct function *)PTR(func))->self -= RAW_ADDR_OFFSET; + ((struct function *)native_pointer(func))->self -= RAW_ADDR_OFFSET; #endif - pscav(&((struct function *)PTR(func))->self, 2, 1); + pscav(&((struct function *)native_pointer(func))->self, 2, 1); #ifdef __i386__ - ((struct function *)PTR(func))->self += RAW_ADDR_OFFSET; + ((struct function *)native_pointer(func))->self += RAW_ADDR_OFFSET; #endif - pscav_later(&((struct function *)PTR(func))->name, 3); + pscav_later(&((struct function *)native_pointer(func))->name, 3); } return CEILING(nwords,2); } #endif -static lispobj *pscav(lispobj *addr, int nwords, boolean constant) +static lispobj * +pscav(lispobj *addr, int nwords, boolean constant) { lispobj thing, *thingp, header; - int count; + int count = 0; /* (0 = dummy init value to stop GCC warning) */ struct vector *vector; while (nwords > 0) { thing = *addr; - if (Pointerp(thing)) { + if (is_lisp_pointer(thing)) { /* It's a pointer. Is it something we might have to move? */ if (dynamic_pointer_p(thing)) { /* Maybe. Have we already moved it? */ - thingp = (lispobj *)PTR(thing); + thingp = (lispobj *)native_pointer(thing); header = *thingp; - if (Pointerp(header) && forwarding_pointer_p(header)) + if (is_lisp_pointer(header) && forwarding_pointer_p(header)) /* Yep, so just copy the forwarding pointer. */ thing = header; else { @@ -1361,7 +1306,8 @@ static lispobj *pscav(lispobj *addr, int nwords, boolean constant) return addr; } -int purify(lispobj static_roots, lispobj read_only_roots) +int +purify(lispobj static_roots, lispobj read_only_roots) { lispobj *clean; int count, i; @@ -1381,8 +1327,8 @@ int purify(lispobj static_roots, lispobj read_only_roots) return 0; } -#if defined(ibmrt) || defined(__i386__) - current_dynamic_space_free_pointer = +#if defined(__i386__) + dynamic_space_free_pointer = (lispobj*)SymbolValue(ALLOCATION_POINTER); #endif @@ -1397,8 +1343,8 @@ int purify(lispobj static_roots, lispobj read_only_roots) #endif #ifdef GENCGC - gc_assert(control_stack_end > ((&read_only_roots)+1)); - setup_i386_stack_scav(((&static_roots)-2), control_stack_end); + gc_assert((lispobj *)CONTROL_STACK_END > ((&read_only_roots)+1)); + setup_i386_stack_scav(((&static_roots)-2), (lispobj *)CONTROL_STACK_END); #endif pscav(&static_roots, 1, 0); @@ -1417,36 +1363,47 @@ int purify(lispobj static_roots, lispobj read_only_roots) fflush(stdout); #endif #ifndef __i386__ - pscav(control_stack, current_control_stack_pointer - control_stack, 0); + pscav((lispobj *)CONTROL_STACK_START, + current_control_stack_pointer - (lispobj *)CONTROL_STACK_START, + 0); #else #ifdef GENCGC pscav_i386_stack(); #endif -#ifdef WANT_CGC - gc_assert(control_stack_end > ((&read_only_roots)+1)); - carefully_pscav_stack(((&read_only_roots)+1), control_stack_end); -#endif #endif #ifdef PRINTNOISE printf(" bindings"); fflush(stdout); #endif -#if !defined(ibmrt) && !defined(__i386__) - pscav(binding_stack, current_binding_stack_pointer - binding_stack, 0); +#if !defined(__i386__) + pscav( (lispobj *)BINDING_STACK_START, + (lispobj *)current_binding_stack_pointer - (lispobj *)BINDING_STACK_START, + 0); #else - pscav(binding_stack, (lispobj *)SymbolValue(BINDING_STACK_POINTER) - binding_stack, 0); -#endif - -#ifdef SCAVENGE_READ_ONLY_SPACE + pscav( (lispobj *)BINDING_STACK_START, + (lispobj *)SymbolValue(BINDING_STACK_POINTER) - + (lispobj *)BINDING_STACK_START, + 0); +#endif + + /* The original CMU CL code had scavenge-read-only-space code + * controlled by the Lisp-level variable + * *SCAVENGE-READ-ONLY-SPACE*. It was disabled by default, and it + * wasn't documented under what circumstances it was useful or + * safe to turn it on, so it's been turned off in SBCL. If you + * want/need this functionality, and can test and document it, + * please submit a patch. */ +#if 0 if (SymbolValue(SCAVENGE_READ_ONLY_SPACE) != type_UnboundMarker && SymbolValue(SCAVENGE_READ_ONLY_SPACE) != NIL) { unsigned read_only_space_size = - (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER) - read_only_space; + (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER) - + (lispobj *)READ_ONLY_SPACE_START; fprintf(stderr, "scavenging read only space: %d bytes\n", read_only_space_size * sizeof(lispobj)); - pscav(read_only_space, read_only_space_size, 0); + pscav( (lispobj *)READ_ONLY_SPACE_START, read_only_space_size, 0); } #endif @@ -1454,7 +1411,7 @@ int purify(lispobj static_roots, lispobj read_only_roots) printf(" static"); fflush(stdout); #endif - clean = static_space; + clean = (lispobj *)STATIC_SPACE_START; do { while (clean != static_free) clean = pscav(clean, static_free - clean, 0); @@ -1485,62 +1442,31 @@ int purify(lispobj static_roots, lispobj read_only_roots) fflush(stdout); #endif -#if defined(WANT_CGC) && defined(X86_CGC_ACTIVE_P) - if(SymbolValue(X86_CGC_ACTIVE_P) != T) - os_zero((os_vm_address_t) current_dynamic_space, - (os_vm_size_t) DYNAMIC_SPACE_SIZE); -#else os_zero((os_vm_address_t) current_dynamic_space, (os_vm_size_t) DYNAMIC_SPACE_SIZE); -#endif /* Zero the stack. Note that the stack is also zeroed by SUB-GC * calling SCRUB-CONTROL-STACK - this zeros the stack on the x86. */ #ifndef __i386__ os_zero((os_vm_address_t) current_control_stack_pointer, (os_vm_size_t) (CONTROL_STACK_SIZE - - ((current_control_stack_pointer - control_stack) * + ((current_control_stack_pointer - + (lispobj *)CONTROL_STACK_START) * sizeof(lispobj)))); #endif -#if defined(WANT_CGC) && defined(STATIC_BLUE_BAG) - { - lispobj bag = SymbolValue(STATIC_BLUE_BAG); - struct cons*cons = (struct cons*)static_free; - struct cons*pair = cons + 1; - static_free += 2*WORDS_PER_CONS; - if(bag == type_UnboundMarker) - bag = NIL; - cons->cdr = bag; - cons->car = (lispobj)pair | type_ListPointer; - pair->car = (lispobj)static_end; - pair->cdr = (lispobj)static_free; - bag = (lispobj)cons | type_ListPointer; - SetSymbolValue(STATIC_BLUE_BAG, bag); - } -#endif - /* It helps to update the heap free pointers so that free_heap can * verify after it's done. */ SetSymbolValue(READ_ONLY_SPACE_FREE_POINTER, (lispobj)read_only_free); SetSymbolValue(STATIC_SPACE_FREE_POINTER, (lispobj)static_free); -#if !defined(ibmrt) && !defined(__i386__) - current_dynamic_space_free_pointer = current_dynamic_space; -#else -#if defined(WANT_CGC) && defined(X86_CGC_ACTIVE_P) - /* X86 using CGC */ - if(SymbolValue(X86_CGC_ACTIVE_P) != T) - SetSymbolValue(ALLOCATION_POINTER, (lispobj)current_dynamic_space); - else - cgc_free_heap(); +#if !defined(__i386__) + dynamic_space_free_pointer = current_dynamic_space; #else #if defined GENCGC gc_free_heap(); #else - /* ibmrt using GC */ - SetSymbolValue(ALLOCATION_POINTER, (lispobj)current_dynamic_space); -#endif +#error unsupported case /* in CMU CL, was "ibmrt using GC" */ #endif #endif