src/runtime/purify.c

   1 /*
   2  * C-level stuff to implement Lisp-level PURIFY
   3  */
   4
   5 /*
   6  * This software is part of the SBCL system. See the README file for
   7  * more information.
   8  *
   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.
  14  */
  15
  16 #include <stdio.h>
  17 #include <sys/types.h>
  18 #include <stdlib.h>
  19 #include <strings.h>
  20 #include <errno.h>
  21
  22 #include "sbcl.h"
  23 #include "runtime.h"
  24 #include "os.h"
  25 #include "globals.h"
  26 #include "validate.h"
  27 #include "interrupt.h"
  28 #include "purify.h"
  29 #include "interr.h"
  30 #include "gc.h"
  31 #include "gc-internal.h"
  32 #include "thread.h"
  33 #include "genesis/primitive-objects.h"
  34 #include "genesis/static-symbols.h"
  35 #include "genesis/layout.h"
  36 #include "genesis/hash-table.h"
  37 #include "gencgc.h"
  38
  39 /* We don't ever do purification with GENCGC as of 1.0.5.*. There was
  40  * a lot of hairy and fragile ifdeffage in here to support purify on
  41  * x86oids, which has now been removed. So this code can't even be
  42  * compiled with GENCGC any more.  -- JES, 2007-04-30.
  43  */
  44 #ifndef LISP_FEATURE_GENCGC
  45
  46 #define PRINTNOISE
  47
  48 static lispobj *dynamic_space_purify_pointer;
  49
  50 \f
  51 /* These hold the original end of the read_only and static spaces so
  52  * we can tell what are forwarding pointers. */
  53
  54 static lispobj *read_only_end, *static_end;
  55
  56 static lispobj *read_only_free, *static_free;
  57
  58 static lispobj *pscav(lispobj *addr, long nwords, boolean constant);
  59
  60 #define LATERBLOCKSIZE 1020
  61 #define LATERMAXCOUNT 10
  62
  63 static struct
  64 later {
  65     struct later *next;
  66     union {
  67         lispobj *ptr;
  68         long count;
  69     } u[LATERBLOCKSIZE];
  70 } *later_blocks = NULL;
  71 static long later_count = 0;
  72
  73 #if N_WORD_BITS == 32
  74  #define SIMPLE_ARRAY_WORD_WIDETAG SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG
  75 #elif N_WORD_BITS == 64
  76  #define SIMPLE_ARRAY_WORD_WIDETAG SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
  77 #endif
  78
  79 \f
  80 static boolean
  81 forwarding_pointer_p(lispobj obj)
  82 {
  83     lispobj *ptr = native_pointer(obj);
  84
  85     return ((static_end <= ptr && ptr <= static_free) ||
  86             (read_only_end <= ptr && ptr <= read_only_free));
  87 }
  88
  89 static boolean
  90 dynamic_pointer_p(lispobj ptr)
  91 {
  92     return (ptr >= (lispobj)current_dynamic_space
  93             &&
  94             ptr < (lispobj)dynamic_space_purify_pointer);
  95 }
  96
  97 static inline lispobj *
  98 newspace_alloc(long nwords, int constantp)
  99 {
 100     lispobj *ret;
 101     nwords=CEILING(nwords,2);
 102     if(constantp) {
 103         if(read_only_free + nwords >= (lispobj *)READ_ONLY_SPACE_END) {
 104             lose("Ran out of read-only space while purifying!\n");
 105         }
 106         ret=read_only_free;
 107         read_only_free+=nwords;
 108     } else {
 109         if(static_free + nwords >= (lispobj *)STATIC_SPACE_END) {
 110             lose("Ran out of static space while purifying!\n");
 111         }
 112         ret=static_free;
 113         static_free+=nwords;
 114     }
 115     return ret;
 116 }
 117
 118 \f
 119 static void
 120 pscav_later(lispobj *where, long count)
 121 {
 122     struct later *new;
 123
 124     if (count > LATERMAXCOUNT) {
 125         while (count > LATERMAXCOUNT) {
 126             pscav_later(where, LATERMAXCOUNT);
 127             count -= LATERMAXCOUNT;
 128             where += LATERMAXCOUNT;
 129         }
 130     }
 131     else {
 132         if (later_blocks == NULL || later_count == LATERBLOCKSIZE ||
 133             (later_count == LATERBLOCKSIZE-1 && count > 1)) {
 134             new  = (struct later *)malloc(sizeof(struct later));
 135             new->next = later_blocks;
 136             if (later_blocks && later_count < LATERBLOCKSIZE)
 137                 later_blocks->u[later_count].ptr = NULL;
 138             later_blocks = new;
 139             later_count = 0;
 140         }
 141
 142         if (count != 1)
 143             later_blocks->u[later_count++].count = count;
 144         later_blocks->u[later_count++].ptr = where;
 145     }
 146 }
 147
 148 static lispobj
 149 ptrans_boxed(lispobj thing, lispobj header, boolean constant)
 150 {
 151     long nwords;
 152     lispobj result, *new, *old;
 153
 154     nwords = CEILING(1 + HeaderValue(header), 2);
 155
 156     /* Allocate it */
 157     old = (lispobj *)native_pointer(thing);
 158     new = newspace_alloc(nwords,constant);
 159
 160     /* Copy it. */
 161     bcopy(old, new, nwords * sizeof(lispobj));
 162
 163     /* Deposit forwarding pointer. */
 164     result = make_lispobj(new, lowtag_of(thing));
 165     *old = result;
 166
 167     /* Scavenge it. */
 168     pscav(new, nwords, constant);
 169
 170     return result;
 171 }
 172
 173 /* We need to look at the layout to see whether it is a pure structure
 174  * class, and only then can we transport as constant. If it is pure,
 175  * we can ALWAYS transport as a constant. */
 176 static lispobj
 177 ptrans_instance(lispobj thing, lispobj header, boolean /* ignored */ constant)
 178 {
 179     struct layout *layout =
 180       (struct layout *) native_pointer(((struct instance *)native_pointer(thing))->slots[0]);
 181     lispobj pure = layout->pure;
 182
 183     switch (pure) {
 184     case T:
 185         return (ptrans_boxed(thing, header, 1));
 186     case NIL:
 187         return (ptrans_boxed(thing, header, 0));
 188     case 0:
 189         {
 190             /* Substructure: special case for the COMPACT-INFO-ENVs,
 191              * where the instance may have a point to the dynamic
 192              * space placed into it (e.g. the cache-name slot), but
 193              * the lists and arrays at the time of a purify can be
 194              * moved to the RO space. */
 195             long nwords;
 196             lispobj result, *new, *old;
 197
 198             nwords = CEILING(1 + HeaderValue(header), 2);
 199
 200             /* Allocate it */
 201             old = (lispobj *)native_pointer(thing);
 202             new = newspace_alloc(nwords, 0); /*  inconstant */
 203
 204             /* Copy it. */
 205             bcopy(old, new, nwords * sizeof(lispobj));
 206
 207             /* Deposit forwarding pointer. */
 208             result = make_lispobj(new, lowtag_of(thing));
 209             *old = result;
 210
 211             /* Scavenge it. */
 212             pscav(new, nwords, 1);
 213
 214             return result;
 215         }
 216     default:
 217         gc_abort();
 218         return NIL; /* dummy value: return something ... */
 219     }
 220 }
 221
 222 static lispobj
 223 ptrans_fdefn(lispobj thing, lispobj header)
 224 {
 225     long nwords;
 226     lispobj result, *new, *old, oldfn;
 227     struct fdefn *fdefn;
 228
 229     nwords = CEILING(1 + HeaderValue(header), 2);
 230
 231     /* Allocate it */
 232     old = (lispobj *)native_pointer(thing);
 233     new = newspace_alloc(nwords, 0);    /* inconstant */
 234
 235     /* Copy it. */
 236     bcopy(old, new, nwords * sizeof(lispobj));
 237
 238     /* Deposit forwarding pointer. */
 239     result = make_lispobj(new, lowtag_of(thing));
 240     *old = result;
 241
 242     /* Scavenge the function. */
 243     fdefn = (struct fdefn *)new;
 244     oldfn = fdefn->fun;
 245     pscav(&fdefn->fun, 1, 0);
 246     if ((char *)oldfn + FUN_RAW_ADDR_OFFSET == fdefn->raw_addr)
 247         fdefn->raw_addr = (char *)fdefn->fun + FUN_RAW_ADDR_OFFSET;
 248
 249     return result;
 250 }
 251
 252 static lispobj
 253 ptrans_unboxed(lispobj thing, lispobj header)
 254 {
 255     long nwords;
 256     lispobj result, *new, *old;
 257
 258     nwords = CEILING(1 + HeaderValue(header), 2);
 259
 260     /* Allocate it */
 261     old = (lispobj *)native_pointer(thing);
 262     new = newspace_alloc(nwords,1);     /* always constant */
 263
 264     /* copy it. */
 265     bcopy(old, new, nwords * sizeof(lispobj));
 266
 267     /* Deposit forwarding pointer. */
 268     result = make_lispobj(new , lowtag_of(thing));
 269     *old = result;
 270
 271     return result;
 272 }
 273
 274 static lispobj
 275 ptrans_vector(lispobj thing, long bits, long extra,
 276               boolean boxed, boolean constant)
 277 {
 278     struct vector *vector;
 279     long nwords;
 280     lispobj result, *new;
 281     long length;
 282
 283     vector = (struct vector *)native_pointer(thing);
 284     length = fixnum_value(vector->length)+extra;
 285     // Argh, handle simple-vector-nil separately.
 286     if (bits == 0) {
 287       nwords = 2;
 288     } else {
 289       nwords = CEILING(NWORDS(length, bits) + 2, 2);
 290     }
 291
 292     new=newspace_alloc(nwords, (constant || !boxed));
 293     bcopy(vector, new, nwords * sizeof(lispobj));
 294
 295     result = make_lispobj(new, lowtag_of(thing));
 296     vector->header = result;
 297
 298     if (boxed)
 299         pscav(new, nwords, constant);
 300
 301     return result;
 302 }
 303
 304 static lispobj
 305 ptrans_code(lispobj thing)
 306 {
 307     struct code *code, *new;
 308     long nwords;
 309     lispobj func, result;
 310
 311     code = (struct code *)native_pointer(thing);
 312     nwords = CEILING(HeaderValue(code->header) + fixnum_value(code->code_size),
 313                      2);
 314
 315     new = (struct code *)newspace_alloc(nwords,1); /* constant */
 316
 317     bcopy(code, new, nwords * sizeof(lispobj));
 318
 319     result = make_lispobj(new, OTHER_POINTER_LOWTAG);
 320
 321     /* Stick in a forwarding pointer for the code object. */
 322     *(lispobj *)code = result;
 323
 324     /* Put in forwarding pointers for all the functions. */
 325     for (func = code->entry_points;
 326          func != NIL;
 327          func = ((struct simple_fun *)native_pointer(func))->next) {
 328
 329         gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
 330
 331         *(lispobj *)native_pointer(func) = result + (func - thing);
 332     }
 333
 334     /* Arrange to scavenge the debug info later. */
 335     pscav_later(&new->debug_info, 1);
 336
 337     /* FIXME: why would this be a fixnum? */
 338     /* "why" is a hard word, but apparently for compiled functions the
 339        trace_table_offset contains the length of the instructions, as
 340        a fixnum.  See CODE-INST-AREA-LENGTH in
 341        src/compiler/target-disassem.lisp.  -- CSR, 2004-01-08 */
 342     if (!(fixnump(new->trace_table_offset)))
 343 #if 0
 344         pscav(&new->trace_table_offset, 1, 0);
 345 #else
 346         new->trace_table_offset = NIL; /* limit lifetime */
 347 #endif
 348
 349     /* Scavenge the constants. */
 350     pscav(new->constants, HeaderValue(new->header)-5, 1);
 351
 352     /* Scavenge all the functions. */
 353     pscav(&new->entry_points, 1, 1);
 354     for (func = new->entry_points;
 355          func != NIL;
 356          func = ((struct simple_fun *)native_pointer(func))->next) {
 357         gc_assert(lowtag_of(func) == FUN_POINTER_LOWTAG);
 358         gc_assert(!dynamic_pointer_p(func));
 359
 360         pscav(&((struct simple_fun *)native_pointer(func))->self, 2, 1);
 361         pscav_later(&((struct simple_fun *)native_pointer(func))->name, 4);
 362     }
 363
 364     return result;
 365 }
 366
 367 static lispobj
 368 ptrans_func(lispobj thing, lispobj header)
 369 {
 370     long nwords;
 371     lispobj code, *new, *old, result;
 372     struct simple_fun *function;
 373
 374     /* Thing can either be a function header, a closure function
 375      * header, a closure, or a funcallable-instance. If it's a closure
 376      * or a funcallable-instance, we do the same as ptrans_boxed.
 377      * Otherwise we have to do something strange, 'cause it is buried
 378      * inside a code object. */
 379
 380     if (widetag_of(header) == SIMPLE_FUN_HEADER_WIDETAG) {
 381
 382         /* We can only end up here if the code object has not been
 383          * scavenged, because if it had been scavenged, forwarding pointers
 384          * would have been left behind for all the entry points. */
 385
 386         function = (struct simple_fun *)native_pointer(thing);
 387         code =
 388             make_lispobj
 389             ((native_pointer(thing) -
 390               (HeaderValue(function->header))), OTHER_POINTER_LOWTAG);
 391
 392         /* This will cause the function's header to be replaced with a
 393          * forwarding pointer. */
 394
 395         ptrans_code(code);
 396
 397         /* So we can just return that. */
 398         return function->header;
 399     }
 400     else {
 401         /* It's some kind of closure-like thing. */
 402         nwords = CEILING(1 + HeaderValue(header), 2);
 403         old = (lispobj *)native_pointer(thing);
 404
 405         /* Allocate the new one.  FINs *must* not go in read_only
 406          * space.  Closures can; they never change */
 407
 408         new = newspace_alloc
 409             (nwords,(widetag_of(header)!=FUNCALLABLE_INSTANCE_HEADER_WIDETAG));
 410
 411         /* Copy it. */
 412         bcopy(old, new, nwords * sizeof(lispobj));
 413
 414         /* Deposit forwarding pointer. */
 415         result = make_lispobj(new, lowtag_of(thing));
 416         *old = result;
 417
 418         /* Scavenge it. */
 419         pscav(new, nwords, 0);
 420
 421         return result;
 422     }
 423 }
 424
 425 static lispobj
 426 ptrans_returnpc(lispobj thing, lispobj header)
 427 {
 428     lispobj code, new;
 429
 430     /* Find the corresponding code object. */
 431     code = thing - HeaderValue(header)*sizeof(lispobj);
 432
 433     /* Make sure it's been transported. */
 434     new = *(lispobj *)native_pointer(code);
 435     if (!forwarding_pointer_p(new))
 436         new = ptrans_code(code);
 437
 438     /* Maintain the offset: */
 439     return new + (thing - code);
 440 }
 441
 442 #define WORDS_PER_CONS CEILING(sizeof(struct cons) / sizeof(lispobj), 2)
 443
 444 static lispobj
 445 ptrans_list(lispobj thing, boolean constant)
 446 {
 447     struct cons *old, *new, *orig;
 448     long length;
 449
 450     orig = (struct cons *) newspace_alloc(0,constant);
 451     length = 0;
 452
 453     do {
 454         /* Allocate a new cons cell. */
 455         old = (struct cons *)native_pointer(thing);
 456         new = (struct cons *) newspace_alloc(WORDS_PER_CONS,constant);
 457
 458         /* Copy the cons cell and keep a pointer to the cdr. */
 459         new->car = old->car;
 460         thing = new->cdr = old->cdr;
 461
 462         /* Set up the forwarding pointer. */
 463         *(lispobj *)old = make_lispobj(new, LIST_POINTER_LOWTAG);
 464
 465         /* And count this cell. */
 466         length++;
 467     } while (lowtag_of(thing) == LIST_POINTER_LOWTAG &&
 468              dynamic_pointer_p(thing) &&
 469              !(forwarding_pointer_p(*(lispobj *)native_pointer(thing))));
 470
 471     /* Scavenge the list we just copied. */
 472     pscav((lispobj *)orig, length * WORDS_PER_CONS, constant);
 473
 474     return make_lispobj(orig, LIST_POINTER_LOWTAG);
 475 }
 476
 477 static lispobj
 478 ptrans_otherptr(lispobj thing, lispobj header, boolean constant)
 479 {
 480     switch (widetag_of(header)) {
 481         /* FIXME: this needs a reindent */
 482       case BIGNUM_WIDETAG:
 483       case SINGLE_FLOAT_WIDETAG:
 484       case DOUBLE_FLOAT_WIDETAG:
 485 #ifdef LONG_FLOAT_WIDETAG
 486       case LONG_FLOAT_WIDETAG:
 487 #endif
 488 #ifdef COMPLEX_SINGLE_FLOAT_WIDETAG
 489       case COMPLEX_SINGLE_FLOAT_WIDETAG:
 490 #endif
 491 #ifdef COMPLEX_DOUBLE_FLOAT_WIDETAG
 492       case COMPLEX_DOUBLE_FLOAT_WIDETAG:
 493 #endif
 494 #ifdef COMPLEX_LONG_FLOAT_WIDETAG
 495       case COMPLEX_LONG_FLOAT_WIDETAG:
 496 #endif
 497       case SAP_WIDETAG:
 498           return ptrans_unboxed(thing, header);
 499       case RATIO_WIDETAG:
 500       case COMPLEX_WIDETAG:
 501       case SIMPLE_ARRAY_WIDETAG:
 502       case COMPLEX_BASE_STRING_WIDETAG:
 503 #ifdef COMPLEX_CHARACTER_STRING_WIDETAG
 504     case COMPLEX_CHARACTER_STRING_WIDETAG:
 505 #endif
 506       case COMPLEX_BIT_VECTOR_WIDETAG:
 507       case COMPLEX_VECTOR_NIL_WIDETAG:
 508       case COMPLEX_VECTOR_WIDETAG:
 509       case COMPLEX_ARRAY_WIDETAG:
 510         return ptrans_boxed(thing, header, constant);
 511
 512       case VALUE_CELL_HEADER_WIDETAG:
 513       case WEAK_POINTER_WIDETAG:
 514         return ptrans_boxed(thing, header, 0);
 515
 516       case SYMBOL_HEADER_WIDETAG:
 517         return ptrans_boxed(thing, header, 0);
 518
 519       case SIMPLE_ARRAY_NIL_WIDETAG:
 520         return ptrans_vector(thing, 0, 0, 0, constant);
 521
 522       case SIMPLE_BASE_STRING_WIDETAG:
 523         return ptrans_vector(thing, 8, 1, 0, constant);
 524
 525 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
 526     case SIMPLE_CHARACTER_STRING_WIDETAG:
 527         return ptrans_vector(thing, 32, 1, 0, constant);
 528 #endif
 529
 530       case SIMPLE_BIT_VECTOR_WIDETAG:
 531         return ptrans_vector(thing, 1, 0, 0, constant);
 532
 533       case SIMPLE_VECTOR_WIDETAG:
 534         return ptrans_vector(thing, N_WORD_BITS, 0, 1, constant);
 535
 536       case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
 537         return ptrans_vector(thing, 2, 0, 0, constant);
 538
 539       case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
 540         return ptrans_vector(thing, 4, 0, 0, constant);
 541
 542       case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
 543 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
 544       case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
 545       case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
 546 #endif
 547         return ptrans_vector(thing, 8, 0, 0, constant);
 548
 549       case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
 550 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
 551       case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
 552       case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
 553 #endif
 554         return ptrans_vector(thing, 16, 0, 0, constant);
 555
 556       case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
 557       case SIMPLE_ARRAY_FIXNUM_WIDETAG:
 558       case SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG:
 559 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
 560       case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
 561       case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
 562 #endif
 563         return ptrans_vector(thing, 32, 0, 0, constant);
 564
 565 #if N_WORD_BITS == 64
 566 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG
 567       case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
 568 #endif
 569 #ifdef SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG
 570       case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
 571 #endif
 572 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
 573       case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
 574 #endif
 575         return ptrans_vector(thing, 64, 0, 0, constant);
 576 #endif
 577
 578       case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
 579         return ptrans_vector(thing, 32, 0, 0, constant);
 580
 581       case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
 582         return ptrans_vector(thing, 64, 0, 0, constant);
 583
 584 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
 585       case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
 586 #ifdef LISP_FEATURE_SPARC
 587         return ptrans_vector(thing, 128, 0, 0, constant);
 588 #endif
 589 #endif
 590
 591 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
 592       case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
 593         return ptrans_vector(thing, 64, 0, 0, constant);
 594 #endif
 595
 596 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
 597       case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
 598         return ptrans_vector(thing, 128, 0, 0, constant);
 599 #endif
 600
 601 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
 602       case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
 603 #ifdef LISP_FEATURE_SPARC
 604         return ptrans_vector(thing, 256, 0, 0, constant);
 605 #endif
 606 #endif
 607
 608       case CODE_HEADER_WIDETAG:
 609         return ptrans_code(thing);
 610
 611       case RETURN_PC_HEADER_WIDETAG:
 612         return ptrans_returnpc(thing, header);
 613
 614       case FDEFN_WIDETAG:
 615         return ptrans_fdefn(thing, header);
 616
 617       default:
 618         fprintf(stderr, "Invalid widetag: %d\n", widetag_of(header));
 619         /* Should only come across other pointers to the above stuff. */
 620         gc_abort();
 621         return NIL;
 622     }
 623 }
 624
 625 static long
 626 pscav_fdefn(struct fdefn *fdefn)
 627 {
 628     boolean fix_func;
 629
 630     fix_func = ((char *)(fdefn->fun+FUN_RAW_ADDR_OFFSET) == fdefn->raw_addr);
 631     pscav(&fdefn->name, 1, 1);
 632     pscav(&fdefn->fun, 1, 0);
 633     if (fix_func)
 634         fdefn->raw_addr = (char *)(fdefn->fun + FUN_RAW_ADDR_OFFSET);
 635     return sizeof(struct fdefn) / sizeof(lispobj);
 636 }
 637
 638 static lispobj *
 639 pscav(lispobj *addr, long nwords, boolean constant)
 640 {
 641     lispobj thing, *thingp, header;
 642     long count = 0; /* (0 = dummy init value to stop GCC warning) */
 643     struct vector *vector;
 644
 645     while (nwords > 0) {
 646         thing = *addr;
 647         if (is_lisp_pointer(thing)) {
 648             /* It's a pointer. Is it something we might have to move? */
 649             if (dynamic_pointer_p(thing)) {
 650                 /* Maybe. Have we already moved it? */
 651                 thingp = (lispobj *)native_pointer(thing);
 652                 header = *thingp;
 653                 if (is_lisp_pointer(header) && forwarding_pointer_p(header))
 654                     /* Yep, so just copy the forwarding pointer. */
 655                     thing = header;
 656                 else {
 657                     /* Nope, copy the object. */
 658                     switch (lowtag_of(thing)) {
 659                       case FUN_POINTER_LOWTAG:
 660                         thing = ptrans_func(thing, header);
 661                         break;
 662
 663                       case LIST_POINTER_LOWTAG:
 664                         thing = ptrans_list(thing, constant);
 665                         break;
 666
 667                       case INSTANCE_POINTER_LOWTAG:
 668                         thing = ptrans_instance(thing, header, constant);
 669                         break;
 670
 671                       case OTHER_POINTER_LOWTAG:
 672                         thing = ptrans_otherptr(thing, header, constant);
 673                         break;
 674
 675                       default:
 676                         /* It was a pointer, but not one of them? */
 677                         gc_abort();
 678                     }
 679                 }
 680                 *addr = thing;
 681             }
 682             count = 1;
 683         }
 684 #if N_WORD_BITS == 64
 685         else if (widetag_of(thing) == SINGLE_FLOAT_WIDETAG) {
 686             count = 1;
 687         }
 688 #endif
 689         else if (thing & FIXNUM_TAG_MASK) {
 690             /* It's an other immediate. Maybe the header for an unboxed */
 691             /* object. */
 692             switch (widetag_of(thing)) {
 693               case BIGNUM_WIDETAG:
 694               case SINGLE_FLOAT_WIDETAG:
 695               case DOUBLE_FLOAT_WIDETAG:
 696 #ifdef LONG_FLOAT_WIDETAG
 697               case LONG_FLOAT_WIDETAG:
 698 #endif
 699               case SAP_WIDETAG:
 700                 /* It's an unboxed simple object. */
 701                 count = CEILING(HeaderValue(thing)+1, 2);
 702                 break;
 703
 704               case SIMPLE_VECTOR_WIDETAG:
 705                   if (HeaderValue(thing) == subtype_VectorValidHashing) {
 706                     struct hash_table *hash_table =
 707                         (struct hash_table *)native_pointer(addr[2]);
 708                     hash_table->needs_rehash_p = T;
 709                   }
 710                 count = 2;
 711                 break;
 712
 713               case SIMPLE_ARRAY_NIL_WIDETAG:
 714                 count = 2;
 715                 break;
 716
 717               case SIMPLE_BASE_STRING_WIDETAG:
 718                 vector = (struct vector *)addr;
 719                 count = CEILING(NWORDS(fixnum_value(vector->length)+1,8)+2,2);
 720                 break;
 721
 722 #ifdef SIMPLE_CHARACTER_STRING_WIDETAG
 723             case SIMPLE_CHARACTER_STRING_WIDETAG:
 724                 vector = (struct vector *)addr;
 725                 count = CEILING(NWORDS(fixnum_value(vector->length)+1,32)+2,2);
 726                 break;
 727 #endif
 728
 729               case SIMPLE_BIT_VECTOR_WIDETAG:
 730                 vector = (struct vector *)addr;
 731                 count = CEILING(NWORDS(fixnum_value(vector->length),1)+2,2);
 732                 break;
 733
 734               case SIMPLE_ARRAY_UNSIGNED_BYTE_2_WIDETAG:
 735                 vector = (struct vector *)addr;
 736                 count = CEILING(NWORDS(fixnum_value(vector->length),2)+2,2);
 737                 break;
 738
 739               case SIMPLE_ARRAY_UNSIGNED_BYTE_4_WIDETAG:
 740                 vector = (struct vector *)addr;
 741                 count = CEILING(NWORDS(fixnum_value(vector->length),4)+2,2);
 742                 break;
 743
 744               case SIMPLE_ARRAY_UNSIGNED_BYTE_8_WIDETAG:
 745 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG
 746               case SIMPLE_ARRAY_SIGNED_BYTE_8_WIDETAG:
 747               case SIMPLE_ARRAY_UNSIGNED_BYTE_7_WIDETAG:
 748 #endif
 749                 vector = (struct vector *)addr;
 750                 count = CEILING(NWORDS(fixnum_value(vector->length),8)+2,2);
 751                 break;
 752
 753               case SIMPLE_ARRAY_UNSIGNED_BYTE_16_WIDETAG:
 754 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG
 755               case SIMPLE_ARRAY_SIGNED_BYTE_16_WIDETAG:
 756               case SIMPLE_ARRAY_UNSIGNED_BYTE_15_WIDETAG:
 757 #endif
 758                 vector = (struct vector *)addr;
 759                 count = CEILING(NWORDS(fixnum_value(vector->length),16)+2,2);
 760                 break;
 761
 762               case SIMPLE_ARRAY_UNSIGNED_BYTE_32_WIDETAG:
 763
 764               case SIMPLE_ARRAY_FIXNUM_WIDETAG:
 765               case SIMPLE_ARRAY_UNSIGNED_FIXNUM_WIDETAG:
 766
 767 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG
 768               case SIMPLE_ARRAY_SIGNED_BYTE_32_WIDETAG:
 769               case SIMPLE_ARRAY_UNSIGNED_BYTE_31_WIDETAG:
 770 #endif
 771                 vector = (struct vector *)addr;
 772                 count = CEILING(NWORDS(fixnum_value(vector->length),32)+2,2);
 773                 break;
 774
 775 #if N_WORD_BITS == 64
 776               case SIMPLE_ARRAY_UNSIGNED_BYTE_64_WIDETAG:
 777 #ifdef SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG
 778               case SIMPLE_ARRAY_SIGNED_BYTE_64_WIDETAG:
 779               case SIMPLE_ARRAY_UNSIGNED_BYTE_63_WIDETAG:
 780 #endif
 781                 vector = (struct vector *)addr;
 782                 count = CEILING(NWORDS(fixnum_value(vector->length),64)+2,2);
 783                 break;
 784 #endif
 785
 786               case SIMPLE_ARRAY_SINGLE_FLOAT_WIDETAG:
 787                 vector = (struct vector *)addr;
 788                 count = CEILING(NWORDS(fixnum_value(vector->length), 32) + 2,
 789                                 2);
 790                 break;
 791
 792               case SIMPLE_ARRAY_DOUBLE_FLOAT_WIDETAG:
 793 #ifdef SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG
 794               case SIMPLE_ARRAY_COMPLEX_SINGLE_FLOAT_WIDETAG:
 795 #endif
 796                 vector = (struct vector *)addr;
 797                 count = CEILING(NWORDS(fixnum_value(vector->length), 64) + 2,
 798                                 2);
 799                 break;
 800
 801 #ifdef SIMPLE_ARRAY_LONG_FLOAT_WIDETAG
 802               case SIMPLE_ARRAY_LONG_FLOAT_WIDETAG:
 803                 vector = (struct vector *)addr;
 804 #ifdef LISP_FEATURE_SPARC
 805                 count = fixnum_value(vector->length)*4+2;
 806 #endif
 807                 break;
 808 #endif
 809
 810 #ifdef SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG
 811               case SIMPLE_ARRAY_COMPLEX_DOUBLE_FLOAT_WIDETAG:
 812                 vector = (struct vector *)addr;
 813                 count = CEILING(NWORDS(fixnum_value(vector->length), 128) + 2,
 814                                 2);
 815                 break;
 816 #endif
 817
 818 #ifdef SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG
 819               case SIMPLE_ARRAY_COMPLEX_LONG_FLOAT_WIDETAG:
 820                 vector = (struct vector *)addr;
 821 #ifdef LISP_FEATURE_SPARC
 822                 count = fixnum_value(vector->length)*8+2;
 823 #endif
 824                 break;
 825 #endif
 826
 827               case CODE_HEADER_WIDETAG:
 828                 gc_abort(); /* no code headers in static space */
 829                 break;
 830
 831               case SIMPLE_FUN_HEADER_WIDETAG:
 832               case RETURN_PC_HEADER_WIDETAG:
 833                 /* We should never hit any of these, 'cause they occur
 834                  * buried in the middle of code objects. */
 835                 gc_abort();
 836                 break;
 837
 838               case WEAK_POINTER_WIDETAG:
 839                 /* Weak pointers get preserved during purify, 'cause I
 840                  * don't feel like figuring out how to break them. */
 841                 pscav(addr+1, 2, constant);
 842                 count = 4;
 843                 break;
 844
 845               case FDEFN_WIDETAG:
 846                 /* We have to handle fdefn objects specially, so we
 847                  * can fix up the raw function address. */
 848                 count = pscav_fdefn((struct fdefn *)addr);
 849                 break;
 850
 851               case INSTANCE_HEADER_WIDETAG:
 852                 {
 853                     struct instance *instance = (struct instance *) addr;
 854                     struct layout *layout
 855                         = (struct layout *) native_pointer(instance->slots[0]);
 856                     long nuntagged = fixnum_value(layout->n_untagged_slots);
 857                     long nslots = HeaderValue(*addr);
 858                     pscav(addr + 1, nslots - nuntagged, constant);
 859                     count = CEILING(1 + nslots, 2);
 860                 }
 861                 break;
 862
 863               default:
 864                 count = 1;
 865                 break;
 866             }
 867         }
 868         else {
 869             /* It's a fixnum. */
 870             count = 1;
 871         }
 872
 873         addr += count;
 874         nwords -= count;
 875     }
 876
 877     return addr;
 878 }
 879
 880 int
 881 purify(lispobj static_roots, lispobj read_only_roots)
 882 {
 883     lispobj *clean;
 884     long count, i;
 885     struct later *laters, *next;
 886     struct thread *thread;
 887
 888     if(all_threads->next) {
 889         /* FIXME: there should be _some_ sensible error reporting
 890          * convention.  See following comment too */
 891         fprintf(stderr,"Can't purify when more than one thread exists\n");
 892         fflush(stderr);
 893         return 0;
 894     }
 895
 896 #ifdef PRINTNOISE
 897     printf("[doing purification:");
 898     fflush(stdout);
 899 #endif
 900
 901     for_each_thread(thread)
 902         if (fixnum_value(SymbolValue(FREE_INTERRUPT_CONTEXT_INDEX,thread)) != 0) {
 903         /* FIXME: 1. What does this mean? 2. It shouldn't be reporting
 904          * its error simply by a. printing a string b. to stdout instead
 905          * of stderr. */
 906         printf(" Ack! Can't purify interrupt contexts. ");
 907         fflush(stdout);
 908         return 0;
 909     }
 910
 911     dynamic_space_purify_pointer = dynamic_space_free_pointer;
 912
 913     read_only_end = read_only_free =
 914         (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER,0);
 915     static_end = static_free =
 916         (lispobj *)SymbolValue(STATIC_SPACE_FREE_POINTER,0);
 917
 918 #ifdef PRINTNOISE
 919     printf(" roots");
 920     fflush(stdout);
 921 #endif
 922
 923     pscav(&static_roots, 1, 0);
 924     pscav(&read_only_roots, 1, 1);
 925
 926 #ifdef PRINTNOISE
 927     printf(" handlers");
 928     fflush(stdout);
 929 #endif
 930     pscav((lispobj *) interrupt_handlers,
 931           sizeof(interrupt_handlers) / sizeof(lispobj),
 932           0);
 933
 934 #ifdef PRINTNOISE
 935     printf(" stack");
 936     fflush(stdout);
 937 #endif
 938     pscav((lispobj *)all_threads->control_stack_start,
 939           access_control_stack_pointer(all_threads) -
 940           all_threads->control_stack_start,
 941           0);
 942
 943 #ifdef PRINTNOISE
 944     printf(" bindings");
 945     fflush(stdout);
 946 #endif
 947
 948     pscav( (lispobj *)all_threads->binding_stack_start,
 949            (lispobj *)get_binding_stack_pointer(all_threads) -
 950            all_threads->binding_stack_start,
 951           0);
 952
 953     /* The original CMU CL code had scavenge-read-only-space code
 954      * controlled by the Lisp-level variable
 955      * *SCAVENGE-READ-ONLY-SPACE*. It was disabled by default, and it
 956      * wasn't documented under what circumstances it was useful or
 957      * safe to turn it on, so it's been turned off in SBCL. If you
 958      * want/need this functionality, and can test and document it,
 959      * please submit a patch. */
 960 #if 0
 961     if (SymbolValue(SCAVENGE_READ_ONLY_SPACE) != UNBOUND_MARKER_WIDETAG
 962         && SymbolValue(SCAVENGE_READ_ONLY_SPACE) != NIL) {
 963       unsigned  read_only_space_size =
 964           (lispobj *)SymbolValue(READ_ONLY_SPACE_FREE_POINTER) -
 965           (lispobj *)READ_ONLY_SPACE_START;
 966       fprintf(stderr,
 967               "scavenging read only space: %d bytes\n",
 968               read_only_space_size * sizeof(lispobj));
 969       pscav( (lispobj *)READ_ONLY_SPACE_START, read_only_space_size, 0);
 970     }
 971 #endif
 972
 973 #ifdef PRINTNOISE
 974     printf(" static");
 975     fflush(stdout);
 976 #endif
 977     clean = (lispobj *)STATIC_SPACE_START;
 978     do {
 979         while (clean != static_free)
 980             clean = pscav(clean, static_free - clean, 0);
 981         laters = later_blocks;
 982         count = later_count;
 983         later_blocks = NULL;
 984         later_count = 0;
 985         while (laters != NULL) {
 986             for (i = 0; i < count; i++) {
 987                 if (laters->u[i].count == 0) {
 988                     ;
 989                 } else if (laters->u[i].count <= LATERMAXCOUNT) {
 990                     pscav(laters->u[i+1].ptr, laters->u[i].count, 1);
 991                     i++;
 992                 } else {
 993                     pscav(laters->u[i].ptr, 1, 1);
 994                 }
 995             }
 996             next = laters->next;
 997             free(laters);
 998             laters = next;
 999             count = LATERBLOCKSIZE;
1000         }
1001     } while (clean != static_free || later_blocks != NULL);
1002
1003 #ifdef PRINTNOISE
1004     printf(" cleanup");
1005     fflush(stdout);
1006 #endif
1007 #ifdef LISP_FEATURE_HPUX
1008     clear_auto_gc_trigger(); /* restore mmap as it was given by os */
1009 #endif
1010
1011     os_zero((os_vm_address_t) current_dynamic_space, dynamic_space_size);
1012
1013     /* Zero the stack. */
1014     os_zero((os_vm_address_t) access_control_stack_pointer(all_threads),
1015             (os_vm_size_t)
1016             ((all_threads->control_stack_end -
1017               access_control_stack_pointer(all_threads)) * sizeof(lispobj)));
1018
1019     /* It helps to update the heap free pointers so that free_heap can
1020      * verify after it's done. */
1021     SetSymbolValue(READ_ONLY_SPACE_FREE_POINTER, (lispobj)read_only_free,0);
1022     SetSymbolValue(STATIC_SPACE_FREE_POINTER, (lispobj)static_free,0);
1023
1024     dynamic_space_free_pointer = current_dynamic_space;
1025     set_auto_gc_trigger(bytes_consed_between_gcs);
1026
1027     /* Blast away instruction cache */
1028     os_flush_icache((os_vm_address_t)READ_ONLY_SPACE_START, READ_ONLY_SPACE_SIZE);
1029     os_flush_icache((os_vm_address_t)STATIC_SPACE_START, STATIC_SPACE_SIZE);
1030
1031 #ifdef PRINTNOISE
1032     printf(" done]\n");
1033     fflush(stdout);
1034 #endif
1035     return 0;
1036 }
1037 #else /* LISP_FEATURE_GENCGC */
1038 int
1039 purify(lispobj static_roots, lispobj read_only_roots)
1040 {
1041     lose("purify called for GENCGC. This should not happen.");
1042 }
1043 #endif /* LISP_FEATURE_GENCGC */