boehm-gc/misc.c

   1 /*
   2  * Copyright 1988, 1989 Hans-J. Boehm, Alan J. Demers
   3  * Copyright (c) 1991-1994 by Xerox Corporation.  All rights reserved.
   4  *
   5  * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
   6  * OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.
   7  *
   8  * Permission is hereby granted to use or copy this program
   9  * for any purpose,  provided the above notices are retained on all copies.
  10  * Permission to modify the code and to distribute modified code is granted,
  11  * provided the above notices are retained, and a notice that the code was
  12  * modified is included with the above copyright notice.
  13  */
  14 /* Boehm, July 31, 1995 5:02 pm PDT */
  15
  16
  17 #include <stdio.h>
  18 #ifndef _WIN32_WCE
  19 #include <signal.h>
  20 #endif
  21
  22 #define I_HIDE_POINTERS /* To make GC_call_with_alloc_lock visible */
  23 #include "private/gc_pmark.h"
  24
  25 #ifdef SOLARIS_THREADS
  26 # include <sys/syscall.h>
  27 #endif
  28 #if defined(MSWIN32) || defined(MSWINCE)
  29 # define WIN32_LEAN_AND_MEAN
  30 # define NOSERVICE
  31 # include <windows.h>
  32 # include <tchar.h>
  33 #endif
  34
  35 # ifdef THREADS
  36 #   ifdef PCR
  37 #     include "il/PCR_IL.h"
  38       PCR_Th_ML GC_allocate_ml;
  39 #   else
  40 #     ifdef SRC_M3
  41         /* Critical section counter is defined in the M3 runtime        */
  42         /* That's all we use.                                           */
  43 #     else
  44 #       ifdef SOLARIS_THREADS
  45           mutex_t GC_allocate_ml;       /* Implicitly initialized.      */
  46 #       else
  47 #          ifdef WIN32_THREADS
  48 #             if defined(_DLL) || defined(GC_DLL)
  49                  __declspec(dllexport) CRITICAL_SECTION GC_allocate_ml;
  50 #             else
  51                  CRITICAL_SECTION GC_allocate_ml;
  52 #             endif
  53 #          else
  54 #             if defined(IRIX_THREADS) \
  55                  || (defined(LINUX_THREADS) && defined(USE_SPIN_LOCK))
  56                 pthread_t GC_lock_holder = NO_THREAD;
  57 #             else
  58 #               if defined(HPUX_THREADS) \
  59                    || defined(LINUX_THREADS) && !defined(USE_SPIN_LOCK)
  60                   pthread_mutex_t GC_allocate_ml = PTHREAD_MUTEX_INITIALIZER;
  61                   pthread_t GC_lock_holder = NO_THREAD;
  62                         /* Used only for assertions, and to prevent      */
  63                         /* recursive reentry in the system call wrapper. */
  64 #               else
  65                   --> declare allocator lock here
  66 #               endif
  67 #             endif
  68 #          endif
  69 #       endif
  70 #     endif
  71 #   endif
  72 # endif
  73
  74 #ifdef ECOS
  75 #undef STACKBASE
  76 #endif
  77
  78 GC_FAR struct _GC_arrays GC_arrays /* = { 0 } */;
  79
  80
  81 GC_bool GC_debugging_started = FALSE;
  82         /* defined here so we don't have to load debug_malloc.o */
  83
  84 void (*GC_check_heap) GC_PROTO((void)) = (void (*) GC_PROTO((void)))0;
  85
  86 void (*GC_start_call_back) GC_PROTO((void)) = (void (*) GC_PROTO((void)))0;
  87
  88 ptr_t GC_stackbottom = 0;
  89
  90 #ifdef IA64
  91   ptr_t GC_register_stackbottom = 0;
  92 #endif
  93
  94 GC_bool GC_dont_gc = 0;
  95
  96 GC_bool GC_dont_precollect = 0;
  97
  98 GC_bool GC_quiet = 0;
  99
 100 GC_bool GC_print_stats = 0;
 101
 102 #ifdef FIND_LEAK
 103   int GC_find_leak = 1;
 104 #else
 105   int GC_find_leak = 0;
 106 #endif
 107
 108 #ifdef ALL_INTERIOR_POINTERS
 109   int GC_all_interior_pointers = 1;
 110 #else
 111   int GC_all_interior_pointers = 0;
 112 #endif
 113
 114 /*ARGSUSED*/
 115 GC_PTR GC_default_oom_fn GC_PROTO((size_t bytes_requested))
 116 {
 117     return(0);
 118 }
 119
 120 GC_PTR (*GC_oom_fn) GC_PROTO((size_t bytes_requested)) = GC_default_oom_fn;
 121
 122 extern signed_word GC_mem_found;
 123
 124 # ifdef MERGE_SIZES
 125     /* Set things up so that GC_size_map[i] >= words(i),                */
 126     /* but not too much bigger                                          */
 127     /* and so that size_map contains relatively few distinct entries    */
 128     /* This is stolen from Russ Atkinson's Cedar quantization           */
 129     /* alogrithm (but we precompute it).                                */
 130
 131
 132     void GC_init_size_map()
 133     {
 134         register unsigned i;
 135
 136         /* Map size 0 to something bigger.                      */
 137         /* This avoids problems at lower levels.                */
 138         /* One word objects don't have to be 2 word aligned,    */
 139         /* unless we're using mark bytes.                       */
 140           for (i = 0; i < sizeof(word); i++) {
 141               GC_size_map[i] = MIN_WORDS;
 142           }
 143 #         if MIN_WORDS > 1
 144             GC_size_map[sizeof(word)] = MIN_WORDS;
 145 #         else
 146             GC_size_map[sizeof(word)] = ROUNDED_UP_WORDS(sizeof(word));
 147 #         endif
 148         for (i = sizeof(word) + 1; i <= 8 * sizeof(word); i++) {
 149             GC_size_map[i] = ALIGNED_WORDS(i);
 150         }
 151         for (i = 8*sizeof(word) + 1; i <= 16 * sizeof(word); i++) {
 152               GC_size_map[i] = (ROUNDED_UP_WORDS(i) + 1) & (~1);
 153         }
 154 #       ifdef GC_GCJ_SUPPORT
 155            /* Make all sizes up to 32 words predictable, so that a      */
 156            /* compiler can statically perform the same computation,     */
 157            /* or at least a computation that results in similar size    */
 158            /* classes.                                                  */
 159            for (i = 16*sizeof(word) + 1; i <= 32 * sizeof(word); i++) {
 160               GC_size_map[i] = (ROUNDED_UP_WORDS(i) + 3) & (~3);
 161            }
 162 #       endif
 163         /* We leave the rest of the array to be filled in on demand. */
 164     }
 165
 166     /* Fill in additional entries in GC_size_map, including the ith one */
 167     /* We assume the ith entry is currently 0.                          */
 168     /* Note that a filled in section of the array ending at n always    */
 169     /* has length at least n/4.                                         */
 170     void GC_extend_size_map(i)
 171     word i;
 172     {
 173         word orig_word_sz = ROUNDED_UP_WORDS(i);
 174         word word_sz = orig_word_sz;
 175         register word byte_sz = WORDS_TO_BYTES(word_sz);
 176                                 /* The size we try to preserve.         */
 177                                 /* Close to to i, unless this would     */
 178                                 /* introduce too many distinct sizes.   */
 179         word smaller_than_i = byte_sz - (byte_sz >> 3);
 180         word much_smaller_than_i = byte_sz - (byte_sz >> 2);
 181         register word low_limit;        /* The lowest indexed entry we  */
 182                                         /* initialize.                  */
 183         register word j;
 184
 185         if (GC_size_map[smaller_than_i] == 0) {
 186             low_limit = much_smaller_than_i;
 187             while (GC_size_map[low_limit] != 0) low_limit++;
 188         } else {
 189             low_limit = smaller_than_i + 1;
 190             while (GC_size_map[low_limit] != 0) low_limit++;
 191             word_sz = ROUNDED_UP_WORDS(low_limit);
 192             word_sz += word_sz >> 3;
 193             if (word_sz < orig_word_sz) word_sz = orig_word_sz;
 194         }
 195 #       ifdef ALIGN_DOUBLE
 196             word_sz += 1;
 197             word_sz &= ~1;
 198 #       endif
 199         if (word_sz > MAXOBJSZ) {
 200             word_sz = MAXOBJSZ;
 201         }
 202         /* If we can fit the same number of larger objects in a block,  */
 203         /* do so.                                                       */
 204         {
 205             size_t number_of_objs = BODY_SZ/word_sz;
 206             word_sz = BODY_SZ/number_of_objs;
 207 #           ifdef ALIGN_DOUBLE
 208                 word_sz &= ~1;
 209 #           endif
 210         }
 211         byte_sz = WORDS_TO_BYTES(word_sz);
 212         if (GC_all_interior_pointers) {
 213             /* We need one extra byte; don't fill in GC_size_map[byte_sz] */
 214             byte_sz--;
 215         }
 216
 217         for (j = low_limit; j <= byte_sz; j++) GC_size_map[j] = word_sz;
 218     }
 219 # endif
 220
 221
 222 /*
 223  * The following is a gross hack to deal with a problem that can occur
 224  * on machines that are sloppy about stack frame sizes, notably SPARC.
 225  * Bogus pointers may be written to the stack and not cleared for
 226  * a LONG time, because they always fall into holes in stack frames
 227  * that are not written.  We partially address this by clearing
 228  * sections of the stack whenever we get control.
 229  */
 230 word GC_stack_last_cleared = 0; /* GC_no when we last did this */
 231 # ifdef THREADS
 232 #   define BIG_CLEAR_SIZE 2048  /* Clear this much now and then.        */
 233 #   define SMALL_CLEAR_SIZE 256 /* Clear this much every time.          */
 234 # endif
 235 # define CLEAR_SIZE 213  /* Granularity for GC_clear_stack_inner */
 236 # define DEGRADE_RATE 50
 237
 238 word GC_min_sp;         /* Coolest stack pointer value from which we've */
 239                         /* already cleared the stack.                   */
 240
 241 word GC_high_water;
 242                         /* "hottest" stack pointer value we have seen   */
 243                         /* recently.  Degrades over time.               */
 244
 245 word GC_words_allocd_at_reset;
 246
 247 #if defined(ASM_CLEAR_CODE)
 248   extern ptr_t GC_clear_stack_inner();
 249 #else
 250 /* Clear the stack up to about limit.  Return arg. */
 251 /*ARGSUSED*/
 252 ptr_t GC_clear_stack_inner(arg, limit)
 253 ptr_t arg;
 254 word limit;
 255 {
 256     word dummy[CLEAR_SIZE];
 257
 258     BZERO(dummy, CLEAR_SIZE*sizeof(word));
 259     if ((word)(dummy) COOLER_THAN limit) {
 260         (void) GC_clear_stack_inner(arg, limit);
 261     }
 262     /* Make sure the recursive call is not a tail call, and the bzero   */
 263     /* call is not recognized as dead code.                             */
 264     GC_noop1((word)dummy);
 265     return(arg);
 266 }
 267 #endif
 268
 269 /* Clear some of the inaccessible part of the stack.  Returns its       */
 270 /* argument, so it can be used in a tail call position, hence clearing  */
 271 /* another frame.                                                       */
 272 ptr_t GC_clear_stack(arg)
 273 ptr_t arg;
 274 {
 275     register word sp = (word)GC_approx_sp();  /* Hotter than actual sp */
 276 #   ifdef THREADS
 277         word dummy[SMALL_CLEAR_SIZE];
 278         static unsigned random_no = 0;
 279                                  /* Should be more random than it is ... */
 280                                  /* Used to occasionally clear a bigger  */
 281                                  /* chunk.                               */
 282 #   endif
 283     register word limit;
 284
 285 #   define SLOP 400
 286         /* Extra bytes we clear every time.  This clears our own        */
 287         /* activation record, and should cause more frequent            */
 288         /* clearing near the cold end of the stack, a good thing.       */
 289 #   define GC_SLOP 4000
 290         /* We make GC_high_water this much hotter than we really saw    */
 291         /* saw it, to cover for GC noise etc. above our current frame.  */
 292 #   define CLEAR_THRESHOLD 100000
 293         /* We restart the clearing process after this many bytes of     */
 294         /* allocation.  Otherwise very heavily recursive programs       */
 295         /* with sparse stacks may result in heaps that grow almost      */
 296         /* without bounds.  As the heap gets larger, collection         */
 297         /* frequency decreases, thus clearing frequency would decrease, */
 298         /* thus more junk remains accessible, thus the heap gets        */
 299         /* larger ...                                                   */
 300 # ifdef THREADS
 301     if (++random_no % 13 == 0) {
 302         limit = sp;
 303         MAKE_HOTTER(limit, BIG_CLEAR_SIZE*sizeof(word));
 304         return GC_clear_stack_inner(arg, limit);
 305     } else {
 306         BZERO(dummy, SMALL_CLEAR_SIZE*sizeof(word));
 307         return arg;
 308     }
 309 # else
 310     if (GC_gc_no > GC_stack_last_cleared) {
 311         /* Start things over, so we clear the entire stack again */
 312         if (GC_stack_last_cleared == 0) GC_high_water = (word) GC_stackbottom;
 313         GC_min_sp = GC_high_water;
 314         GC_stack_last_cleared = GC_gc_no;
 315         GC_words_allocd_at_reset = GC_words_allocd;
 316     }
 317     /* Adjust GC_high_water */
 318         MAKE_COOLER(GC_high_water, WORDS_TO_BYTES(DEGRADE_RATE) + GC_SLOP);
 319         if (sp HOTTER_THAN GC_high_water) {
 320             GC_high_water = sp;
 321         }
 322         MAKE_HOTTER(GC_high_water, GC_SLOP);
 323     limit = GC_min_sp;
 324     MAKE_HOTTER(limit, SLOP);
 325     if (sp COOLER_THAN limit) {
 326         limit &= ~0xf;  /* Make it sufficiently aligned for assembly    */
 327                         /* implementations of GC_clear_stack_inner.     */
 328         GC_min_sp = sp;
 329         return(GC_clear_stack_inner(arg, limit));
 330     } else if (WORDS_TO_BYTES(GC_words_allocd - GC_words_allocd_at_reset)
 331                > CLEAR_THRESHOLD) {
 332         /* Restart clearing process, but limit how much clearing we do. */
 333         GC_min_sp = sp;
 334         MAKE_HOTTER(GC_min_sp, CLEAR_THRESHOLD/4);
 335         if (GC_min_sp HOTTER_THAN GC_high_water) GC_min_sp = GC_high_water;
 336         GC_words_allocd_at_reset = GC_words_allocd;
 337     }
 338     return(arg);
 339 # endif
 340 }
 341
 342
 343 /* Return a pointer to the base address of p, given a pointer to a      */
 344 /* an address within an object.  Return 0 o.w.                          */
 345 # ifdef __STDC__
 346     GC_PTR GC_base(GC_PTR p)
 347 # else
 348     GC_PTR GC_base(p)
 349     GC_PTR p;
 350 # endif
 351 {
 352     register word r;
 353     register struct hblk *h;
 354     register bottom_index *bi;
 355     register hdr *candidate_hdr;
 356     register word limit;
 357
 358     r = (word)p;
 359     if (!GC_is_initialized) return 0;
 360     h = HBLKPTR(r);
 361     GET_BI(r, bi);
 362     candidate_hdr = HDR_FROM_BI(bi, r);
 363     if (candidate_hdr == 0) return(0);
 364     /* If it's a pointer to the middle of a large object, move it       */
 365     /* to the beginning.                                                */
 366         while (IS_FORWARDING_ADDR_OR_NIL(candidate_hdr)) {
 367            h = FORWARDED_ADDR(h,candidate_hdr);
 368            r = (word)h;
 369            candidate_hdr = HDR(h);
 370         }
 371     if (candidate_hdr -> hb_map == GC_invalid_map) return(0);
 372     /* Make sure r points to the beginning of the object */
 373         r &= ~(WORDS_TO_BYTES(1) - 1);
 374         {
 375             register int offset = HBLKDISPL(r);
 376             register signed_word sz = candidate_hdr -> hb_sz;
 377             register signed_word map_entry;
 378
 379             map_entry = MAP_ENTRY((candidate_hdr -> hb_map), offset);
 380             if (map_entry > CPP_MAX_OFFSET) {
 381                 map_entry = (signed_word)(BYTES_TO_WORDS(offset)) % sz;
 382             }
 383             r -= WORDS_TO_BYTES(map_entry);
 384             limit = r + WORDS_TO_BYTES(sz);
 385             if (limit > (word)(h + 1)
 386                 && sz <= BYTES_TO_WORDS(HBLKSIZE)) {
 387                 return(0);
 388             }
 389             if ((word)p >= limit) return(0);
 390         }
 391     return((GC_PTR)r);
 392 }
 393
 394
 395 /* Return the size of an object, given a pointer to its base.           */
 396 /* (For small obects this also happens to work from interior pointers,  */
 397 /* but that shouldn't be relied upon.)                                  */
 398 # ifdef __STDC__
 399     size_t GC_size(GC_PTR p)
 400 # else
 401     size_t GC_size(p)
 402     GC_PTR p;
 403 # endif
 404 {
 405     register int sz;
 406     register hdr * hhdr = HDR(p);
 407
 408     sz = WORDS_TO_BYTES(hhdr -> hb_sz);
 409     return(sz);
 410 }
 411
 412 size_t GC_get_heap_size GC_PROTO(())
 413 {
 414     return ((size_t) GC_heapsize);
 415 }
 416
 417 size_t GC_get_free_bytes GC_PROTO(())
 418 {
 419     return ((size_t) GC_large_free_bytes);
 420 }
 421
 422 size_t GC_get_bytes_since_gc GC_PROTO(())
 423 {
 424     return ((size_t) WORDS_TO_BYTES(GC_words_allocd));
 425 }
 426
 427 size_t GC_get_total_bytes GC_PROTO(())
 428 {
 429     return ((size_t) WORDS_TO_BYTES(GC_words_allocd+GC_words_allocd_before_gc));
 430 }
 431
 432 GC_bool GC_is_initialized = FALSE;
 433
 434 void GC_init()
 435 {
 436     DCL_LOCK_STATE;
 437
 438     DISABLE_SIGNALS();
 439     LOCK();
 440     GC_init_inner();
 441     UNLOCK();
 442     ENABLE_SIGNALS();
 443
 444 }
 445
 446 #if defined(MSWIN32) || defined(MSWINCE)
 447     CRITICAL_SECTION GC_write_cs;
 448 #endif
 449
 450 #ifdef MSWIN32
 451     extern void GC_init_win32 GC_PROTO((void));
 452 #endif
 453
 454 extern void GC_setpagesize();
 455
 456 #ifdef UNIX_LIKE
 457
 458 extern void GC_set_and_save_fault_handler GC_PROTO((void (*handler)(int)));
 459
 460 static void looping_handler(sig)
 461 int sig;
 462 {
 463     GC_err_printf1("Caught signal %d: looping in handler\n", sig);
 464     for(;;);
 465 }
 466 #endif
 467
 468 void GC_init_inner()
 469 {
 470 #   if !defined(THREADS) && defined(GC_ASSERTIONS)
 471         word dummy;
 472 #   endif
 473     word initial_heap_sz = (word)MINHINCR;
 474
 475     if (GC_is_initialized) return;
 476 #   ifdef PRINTSTATS
 477       GC_print_stats = 1;
 478 #   endif
 479     if (0 != GETENV("GC_PRINT_STATS")) {
 480       GC_print_stats = 1;
 481     }
 482     if (0 != GETENV("GC_FIND_LEAK")) {
 483       GC_find_leak = 1;
 484     }
 485     if (0 != GETENV("GC_ALL_INTERIOR_POINTERS")) {
 486       GC_all_interior_pointers = 1;
 487     }
 488     if (0 != GETENV("GC_DONT_GC")) {
 489       GC_dont_gc = 1;
 490     }
 491 #   ifdef UNIX_LIKE
 492       if (0 != GETENV("GC_LOOP_ON_ABORT")) {
 493         GC_set_and_save_fault_handler(looping_handler);
 494       }
 495 #   endif
 496     /* Adjust normal object descriptor for extra allocation.    */
 497     if (ALIGNMENT > GC_DS_TAGS && EXTRA_BYTES != 0) {
 498       GC_obj_kinds[NORMAL].ok_descriptor = ((word)(-ALIGNMENT) | GC_DS_LENGTH);
 499     }
 500 #   if defined(MSWIN32) || defined(MSWINCE)
 501         InitializeCriticalSection(&GC_write_cs);
 502 #   endif
 503     GC_setpagesize();
 504     GC_exclude_static_roots(beginGC_arrays, endGC_arrays);
 505     GC_exclude_static_roots(beginGC_obj_kinds, endGC_obj_kinds);
 506 #   ifdef SEPARATE_GLOBALS
 507       GC_exclude_static_roots(beginGC_objfreelist, endGC_objfreelist);
 508       GC_exclude_static_roots(beginGC_aobjfreelist, endGC_aobjfreelist);
 509 #   endif
 510 #   ifdef MSWIN32
 511         GC_init_win32();
 512 #   endif
 513 #   if defined(SEARCH_FOR_DATA_START)
 514         GC_init_linux_data_start();
 515 #   endif
 516 #   if defined(NETBSD) && defined(__ELF__)
 517         GC_init_netbsd_elf();
 518 #   endif
 519 #   if defined(IRIX_THREADS) || defined(LINUX_THREADS) \
 520        || defined(HPUX_THREADS) || defined(SOLARIS_THREADS)
 521         GC_thr_init();
 522 #   endif
 523 #   ifdef SOLARIS_THREADS
 524         /* We need dirty bits in order to find live stack sections.     */
 525         GC_dirty_init();
 526 #   endif
 527 #   if !defined(THREADS) || defined(SOLARIS_THREADS) || defined(WIN32_THREADS) \
 528        || defined(IRIX_THREADS) || defined(LINUX_THREADS) \
 529        || defined(HPUX_THREADS)
 530       if (GC_stackbottom == 0) {
 531         GC_stackbottom = GC_get_stack_base();
 532 #       if defined(LINUX) && defined(IA64)
 533           GC_register_stackbottom = GC_get_register_stack_base();
 534 #       endif
 535       }
 536 #   endif
 537     GC_ASSERT(sizeof (ptr_t) == sizeof(word));
 538     GC_ASSERT(sizeof (signed_word) == sizeof(word));
 539     GC_ASSERT(sizeof (struct hblk) == HBLKSIZE);
 540 #   ifndef THREADS
 541 #     if defined(STACK_GROWS_UP) && defined(STACK_GROWS_DOWN)
 542         ABORT(
 543           "Only one of STACK_GROWS_UP and STACK_GROWS_DOWN should be defd\n");
 544 #     endif
 545 #     if !defined(STACK_GROWS_UP) && !defined(STACK_GROWS_DOWN)
 546         ABORT(
 547           "One of STACK_GROWS_UP and STACK_GROWS_DOWN should be defd\n");
 548 #     endif
 549 #     ifdef STACK_GROWS_DOWN
 550         GC_ASSERT((word)(&dummy) <= (word)GC_stackbottom);
 551 #     else
 552         GC_ASSERT((word)(&dummy) >= (word)GC_stackbottom);
 553 #     endif
 554 #   endif
 555 #   if !defined(_AUX_SOURCE) || defined(__GNUC__)
 556       GC_ASSERT((word)(-1) > (word)0);
 557       /* word should be unsigned */
 558 #   endif
 559     GC_ASSERT((signed_word)(-1) < (signed_word)0);
 560
 561     /* Add initial guess of root sets.  Do this first, since sbrk(0)    */
 562     /* might be used.                                                   */
 563       GC_register_data_segments();
 564     GC_init_headers();
 565     GC_bl_init();
 566     GC_mark_init();
 567     {
 568         char * sz_str = GETENV("GC_INITIAL_HEAP_SIZE");
 569         if (sz_str != NULL) {
 570           initial_heap_sz = atoi(sz_str);
 571           if (initial_heap_sz <= MINHINCR * HBLKSIZE) {
 572             WARN("Bad initial heap size %s - ignoring it.\n",
 573                  sz_str);
 574           }
 575           initial_heap_sz = divHBLKSZ(initial_heap_sz);
 576         }
 577     }
 578     if (!GC_expand_hp_inner(initial_heap_sz)) {
 579         GC_err_printf0("Can't start up: not enough memory\n");
 580         EXIT();
 581     }
 582     /* Preallocate large object map.  It's otherwise inconvenient to    */
 583     /* deal with failure.                                               */
 584       if (!GC_add_map_entry((word)0)) {
 585         GC_err_printf0("Can't start up: not enough memory\n");
 586         EXIT();
 587       }
 588     GC_register_displacement_inner(0L);
 589 #   ifdef MERGE_SIZES
 590       GC_init_size_map();
 591 #   endif
 592 #   ifdef PCR
 593       if (PCR_IL_Lock(PCR_Bool_false, PCR_allSigsBlocked, PCR_waitForever)
 594           != PCR_ERes_okay) {
 595           ABORT("Can't lock load state\n");
 596       } else if (PCR_IL_Unlock() != PCR_ERes_okay) {
 597           ABORT("Can't unlock load state\n");
 598       }
 599       PCR_IL_Unlock();
 600       GC_pcr_install();
 601 #   endif
 602     /* Get black list set up */
 603       if (!GC_dont_precollect) GC_gcollect_inner();
 604     GC_is_initialized = TRUE;
 605 #   ifdef STUBBORN_ALLOC
 606         GC_stubborn_init();
 607 #   endif
 608     /* Convince lint that some things are used */
 609 #   ifdef LINT
 610       {
 611           extern char * GC_copyright[];
 612           extern int GC_read();
 613           extern void GC_register_finalizer_no_order();
 614
 615           GC_noop(GC_copyright, GC_find_header,
 616                   GC_push_one, GC_call_with_alloc_lock, GC_read,
 617                   GC_dont_expand,
 618 #                 ifndef NO_DEBUGGING
 619                     GC_dump,
 620 #                 endif
 621                   GC_register_finalizer_no_order);
 622       }
 623 #   endif
 624 }
 625
 626 void GC_enable_incremental GC_PROTO(())
 627 {
 628 # if !defined(SMALL_CONFIG)
 629   if (!GC_find_leak) {
 630     DCL_LOCK_STATE;
 631
 632     DISABLE_SIGNALS();
 633     LOCK();
 634     if (GC_incremental) goto out;
 635     GC_setpagesize();
 636 #   ifdef MSWIN32
 637       {
 638         extern GC_bool GC_is_win32s();
 639
 640         /* VirtualProtect is not functional under win32s.       */
 641         if (GC_is_win32s()) goto out;
 642       }
 643 #   endif /* MSWIN32 */
 644 #   ifndef SOLARIS_THREADS
 645         GC_dirty_init();
 646 #   endif
 647     if (!GC_is_initialized) {
 648         GC_init_inner();
 649     }
 650     if (GC_dont_gc) {
 651         /* Can't easily do it. */
 652         UNLOCK();
 653         ENABLE_SIGNALS();
 654         return;
 655     }
 656     if (GC_words_allocd > 0) {
 657         /* There may be unmarked reachable objects      */
 658         GC_gcollect_inner();
 659     }   /* else we're OK in assuming everything's       */
 660         /* clean since nothing can point to an          */
 661         /* unmarked object.                             */
 662     GC_read_dirty();
 663     GC_incremental = TRUE;
 664 out:
 665     UNLOCK();
 666     ENABLE_SIGNALS();
 667   }
 668 # endif
 669 }
 670
 671
 672 #if defined(MSWIN32) || defined(MSWINCE)
 673 # define LOG_FILE _T("gc.log")
 674
 675   HANDLE GC_stdout = 0;
 676
 677   void GC_deinit()
 678   {
 679       if (GC_is_initialized) {
 680         DeleteCriticalSection(&GC_write_cs);
 681       }
 682   }
 683
 684   int GC_write(buf, len)
 685   char * buf;
 686   size_t len;
 687   {
 688       BOOL tmp;
 689       DWORD written;
 690       if (len == 0)
 691           return 0;
 692       EnterCriticalSection(&GC_write_cs);
 693       if (GC_stdout == INVALID_HANDLE_VALUE) {
 694           return -1;
 695       } else if (GC_stdout == 0) {
 696           GC_stdout = CreateFile(LOG_FILE, GENERIC_WRITE,
 697                                  FILE_SHARE_READ | FILE_SHARE_WRITE,
 698                                  NULL, CREATE_ALWAYS, FILE_FLAG_WRITE_THROUGH,
 699                                  NULL);
 700           if (GC_stdout == INVALID_HANDLE_VALUE) ABORT("Open of log file failed");
 701       }
 702       tmp = WriteFile(GC_stdout, buf, len, &written, NULL);
 703       if (!tmp)
 704           DebugBreak();
 705       LeaveCriticalSection(&GC_write_cs);
 706       return tmp ? (int)written : -1;
 707   }
 708
 709 #endif
 710
 711 #if defined(OS2) || defined(MACOS)
 712 FILE * GC_stdout = NULL;
 713 FILE * GC_stderr = NULL;
 714 int GC_tmp;  /* Should really be local ... */
 715
 716   void GC_set_files()
 717   {
 718       if (GC_stdout == NULL) {
 719         GC_stdout = stdout;
 720     }
 721     if (GC_stderr == NULL) {
 722         GC_stderr = stderr;
 723     }
 724   }
 725 #endif
 726
 727 #if !defined(OS2) && !defined(MACOS) && !defined(MSWIN32) && !defined(MSWINCE)
 728   int GC_stdout = 1;
 729   int GC_stderr = 2;
 730 # if !defined(AMIGA)
 731 #   include <unistd.h>
 732 # endif
 733 #endif
 734
 735 #if !defined(MSWIN32) && !defined(MSWINCE) && !defined(OS2) && !defined(MACOS)
 736 int GC_write(fd, buf, len)
 737 int fd;
 738 char *buf;
 739 size_t len;
 740 {
 741      register int bytes_written = 0;
 742      register int result;
 743
 744      while (bytes_written < len) {
 745 #       ifdef SOLARIS_THREADS
 746             result = syscall(SYS_write, fd, buf + bytes_written,
 747                                             len - bytes_written);
 748 #       else
 749             result = write(fd, buf + bytes_written, len - bytes_written);
 750 #       endif
 751         if (-1 == result) return(result);
 752         bytes_written += result;
 753     }
 754     return(bytes_written);
 755 }
 756 #endif /* UN*X */
 757
 758 #if defined(ECOS)
 759 int GC_write(fd, buf, len)
 760 {
 761   _Jv_diag_write (buf, len);
 762   return len;
 763 }
 764 #endif
 765
 766
 767 #if defined(MSWIN32) || defined(MSWINCE)
 768 #   define WRITE(f, buf, len) GC_write(buf, len)
 769 #else
 770 #   if defined(OS2) || defined(MACOS)
 771 #   define WRITE(f, buf, len) (GC_set_files(), \
 772                                GC_tmp = fwrite((buf), 1, (len), (f)), \
 773                                fflush(f), GC_tmp)
 774 #   else
 775 #     define WRITE(f, buf, len) GC_write((f), (buf), (len))
 776 #   endif
 777 #endif
 778
 779 /* A version of printf that is unlikely to call malloc, and is thus safer */
 780 /* to call from the collector in case malloc has been bound to GC_malloc. */
 781 /* Assumes that no more than 1023 characters are written at once.         */
 782 /* Assumes that all arguments have been converted to something of the     */
 783 /* same size as long, and that the format conversions expect something    */
 784 /* of that size.                                                          */
 785 void GC_printf(format, a, b, c, d, e, f)
 786 GC_CONST char * format;
 787 long a, b, c, d, e, f;
 788 {
 789     char buf[1025];
 790
 791     if (GC_quiet) return;
 792     buf[1024] = 0x15;
 793     (void) sprintf(buf, format, a, b, c, d, e, f);
 794     if (buf[1024] != 0x15) ABORT("GC_printf clobbered stack");
 795     if (WRITE(GC_stdout, buf, strlen(buf)) < 0) ABORT("write to stdout failed");
 796 }
 797
 798 void GC_err_printf(format, a, b, c, d, e, f)
 799 GC_CONST char * format;
 800 long a, b, c, d, e, f;
 801 {
 802     char buf[1025];
 803
 804     buf[1024] = 0x15;
 805     (void) sprintf(buf, format, a, b, c, d, e, f);
 806     if (buf[1024] != 0x15) ABORT("GC_err_printf clobbered stack");
 807     if (WRITE(GC_stderr, buf, strlen(buf)) < 0) ABORT("write to stderr failed");
 808 }
 809
 810 void GC_err_puts(s)
 811 GC_CONST char *s;
 812 {
 813     if (WRITE(GC_stderr, s, strlen(s)) < 0) ABORT("write to stderr failed");
 814 }
 815
 816 #if defined(LINUX) && !defined(SMALL_CONFIG)
 817 void GC_err_write(buf, len)
 818 GC_CONST char *buf;
 819 size_t len;
 820 {
 821     if (WRITE(GC_stderr, buf, len) < 0) ABORT("write to stderr failed");
 822 }
 823 #endif
 824
 825 # if defined(__STDC__) || defined(__cplusplus)
 826     void GC_default_warn_proc(char *msg, GC_word arg)
 827 # else
 828     void GC_default_warn_proc(msg, arg)
 829     char *msg;
 830     GC_word arg;
 831 # endif
 832 {
 833     GC_err_printf1(msg, (unsigned long)arg);
 834 }
 835
 836 GC_warn_proc GC_current_warn_proc = GC_default_warn_proc;
 837
 838 # if defined(__STDC__) || defined(__cplusplus)
 839     GC_warn_proc GC_set_warn_proc(GC_warn_proc p)
 840 # else
 841     GC_warn_proc GC_set_warn_proc(p)
 842     GC_warn_proc p;
 843 # endif
 844 {
 845     GC_warn_proc result;
 846
 847     LOCK();
 848     result = GC_current_warn_proc;
 849     GC_current_warn_proc = p;
 850     UNLOCK();
 851     return(result);
 852 }
 853
 854
 855 #ifndef PCR
 856 void GC_abort(msg)
 857 GC_CONST char * msg;
 858 {
 859 #   if defined(MSWIN32)
 860       (void) MessageBoxA(NULL, msg, "Fatal error in gc", MB_ICONERROR|MB_OK);
 861       DebugBreak();
 862 #   else
 863       GC_err_printf1("%s\n", msg);
 864 #   endif
 865     if (GETENV("GC_LOOP_ON_ABORT") != NULL) {
 866             /* In many cases it's easier to debug a running process.    */
 867             /* It's arguably nicer to sleep, but that makes it harder   */
 868             /* to look at the thread if the debugger doesn't know much  */
 869             /* about threads.                                           */
 870             for(;;);
 871     }
 872 #   ifdef MSWIN32
 873         DebugBreak();
 874 #   else
 875         (void) abort();
 876 #   endif
 877 }
 878 #endif
 879
 880 #ifdef NEED_CALLINFO
 881
 882 void GC_print_callers (info)
 883 struct callinfo info[NFRAMES];
 884 {
 885     register int i;
 886
 887 #   if NFRAMES == 1
 888       GC_err_printf0("\tCaller at allocation:\n");
 889 #   else
 890       GC_err_printf0("\tCall chain at allocation:\n");
 891 #   endif
 892     for (i = 0; i < NFRAMES; i++) {
 893         if (info[i].ci_pc == 0) break;
 894 #       if NARGS > 0
 895         {
 896           int j;
 897
 898           GC_err_printf0("\t\targs: ");
 899           for (j = 0; j < NARGS; j++) {
 900             if (j != 0) GC_err_printf0(", ");
 901             GC_err_printf2("%d (0x%X)", ~(info[i].ci_arg[j]),
 902                                         ~(info[i].ci_arg[j]));
 903           }
 904           GC_err_printf0("\n");
 905         }
 906 #       endif
 907         GC_err_printf1("\t\t##PC##= 0x%X\n", info[i].ci_pc);
 908     }
 909 }
 910
 911 #endif /* SAVE_CALL_CHAIN */
 912
 913 /* Needed by SRC_M3, gcj, and should perhaps be the official interface  */
 914 /* to GC_dont_gc.                                                       */
 915 void GC_enable()
 916 {
 917     GC_dont_gc--;
 918 }
 919
 920 void GC_disable()
 921 {
 922     GC_dont_gc++;
 923 }
 924
 925 #if !defined(NO_DEBUGGING)
 926
 927 void GC_dump()
 928 {
 929     GC_printf0("***Static roots:\n");
 930     GC_print_static_roots();
 931     GC_printf0("\n***Heap sections:\n");
 932     GC_print_heap_sects();
 933     GC_printf0("\n***Free blocks:\n");
 934     GC_print_hblkfreelist();
 935     GC_printf0("\n***Blocks in use:\n");
 936     GC_print_block_list();
 937 }
 938
 939 #endif /* NO_DEBUGGING */