1 /* -----------------------------------------------------------------------------
3 * (c) The GHC Team 1998-2003
5 * Generational garbage collector
7 * ---------------------------------------------------------------------------*/
9 #include "PosixSource.h"
14 #include "OSThreads.h"
16 #include "LdvProfile.h"
21 #include "BlockAlloc.h"
27 #include "ParTicky.h" // ToDo: move into Rts.h
28 #include "GCCompact.h"
31 #if defined(GRAN) || defined(PAR)
32 # include "GranSimRts.h"
33 # include "ParallelRts.h"
37 # include "ParallelDebug.h"
42 #if defined(RTS_GTK_FRONTPANEL)
43 #include "FrontPanel.h"
46 #include "RetainerProfile.h"
50 // Turn off inlining when debugging - it obfuscates things
53 # define STATIC_INLINE static
56 /* STATIC OBJECT LIST.
59 * We maintain a linked list of static objects that are still live.
60 * The requirements for this list are:
62 * - we need to scan the list while adding to it, in order to
63 * scavenge all the static objects (in the same way that
64 * breadth-first scavenging works for dynamic objects).
66 * - we need to be able to tell whether an object is already on
67 * the list, to break loops.
69 * Each static object has a "static link field", which we use for
70 * linking objects on to the list. We use a stack-type list, consing
71 * objects on the front as they are added (this means that the
72 * scavenge phase is depth-first, not breadth-first, but that
75 * A separate list is kept for objects that have been scavenged
76 * already - this is so that we can zero all the marks afterwards.
78 * An object is on the list if its static link field is non-zero; this
79 * means that we have to mark the end of the list with '1', not NULL.
81 * Extra notes for generational GC:
83 * Each generation has a static object list associated with it. When
84 * collecting generations up to N, we treat the static object lists
85 * from generations > N as roots.
87 * We build up a static object list while collecting generations 0..N,
88 * which is then appended to the static object list of generation N+1.
90 static StgClosure* static_objects; // live static objects
91 StgClosure* scavenged_static_objects; // static objects scavenged so far
93 /* N is the oldest generation being collected, where the generations
94 * are numbered starting at 0. A major GC (indicated by the major_gc
95 * flag) is when we're collecting all generations. We only attempt to
96 * deal with static objects and GC CAFs when doing a major GC.
99 static rtsBool major_gc;
101 /* Youngest generation that objects should be evacuated to in
102 * evacuate(). (Logically an argument to evacuate, but it's static
103 * a lot of the time so we optimise it into a global variable).
109 StgWeak *old_weak_ptr_list; // also pending finaliser list
111 /* Which stage of processing various kinds of weak pointer are we at?
112 * (see traverse_weak_ptr_list() below for discussion).
114 typedef enum { WeakPtrs, WeakThreads, WeakDone } WeakStage;
115 static WeakStage weak_stage;
117 /* List of all threads during GC
119 static StgTSO *old_all_threads;
120 StgTSO *resurrected_threads;
122 /* Flag indicating failure to evacuate an object to the desired
125 static rtsBool failed_to_evac;
127 /* Saved nursery (used for 2-space collector only)
129 static bdescr *saved_nursery;
130 static nat saved_n_blocks;
132 /* Data used for allocation area sizing.
134 static lnat new_blocks; // blocks allocated during this GC
135 static lnat new_scavd_blocks; // ditto, but depth-first blocks
136 static lnat g0s0_pcnt_kept = 30; // percentage of g0s0 live at last minor GC
138 /* Used to avoid long recursion due to selector thunks
140 static lnat thunk_selector_depth = 0;
141 #define MAX_THUNK_SELECTOR_DEPTH 8
143 /* -----------------------------------------------------------------------------
144 Static function declarations
145 -------------------------------------------------------------------------- */
147 static bdescr * gc_alloc_block ( step *stp );
148 static void mark_root ( StgClosure **root );
150 // Use a register argument for evacuate, if available.
152 #define REGPARM1 __attribute__((regparm(1)))
157 REGPARM1 static StgClosure * evacuate (StgClosure *q);
159 static void zero_static_object_list ( StgClosure* first_static );
161 static rtsBool traverse_weak_ptr_list ( void );
162 static void mark_weak_ptr_list ( StgWeak **list );
164 static StgClosure * eval_thunk_selector ( nat field, StgSelector * p );
167 static void scavenge ( step * );
168 static void scavenge_mark_stack ( void );
169 static void scavenge_stack ( StgPtr p, StgPtr stack_end );
170 static rtsBool scavenge_one ( StgPtr p );
171 static void scavenge_large ( step * );
172 static void scavenge_static ( void );
173 static void scavenge_mutable_list ( generation *g );
175 static void scavenge_large_bitmap ( StgPtr p,
176 StgLargeBitmap *large_bitmap,
179 #if 0 && defined(DEBUG)
180 static void gcCAFs ( void );
183 /* -----------------------------------------------------------------------------
184 inline functions etc. for dealing with the mark bitmap & stack.
185 -------------------------------------------------------------------------- */
187 #define MARK_STACK_BLOCKS 4
189 static bdescr *mark_stack_bdescr;
190 static StgPtr *mark_stack;
191 static StgPtr *mark_sp;
192 static StgPtr *mark_splim;
194 // Flag and pointers used for falling back to a linear scan when the
195 // mark stack overflows.
196 static rtsBool mark_stack_overflowed;
197 static bdescr *oldgen_scan_bd;
198 static StgPtr oldgen_scan;
200 STATIC_INLINE rtsBool
201 mark_stack_empty(void)
203 return mark_sp == mark_stack;
206 STATIC_INLINE rtsBool
207 mark_stack_full(void)
209 return mark_sp >= mark_splim;
213 reset_mark_stack(void)
215 mark_sp = mark_stack;
219 push_mark_stack(StgPtr p)
230 /* -----------------------------------------------------------------------------
231 Allocate a new to-space block in the given step.
232 -------------------------------------------------------------------------- */
235 gc_alloc_block(step *stp)
237 bdescr *bd = allocBlock();
238 bd->gen_no = stp->gen_no;
242 // blocks in to-space in generations up to and including N
243 // get the BF_EVACUATED flag.
244 if (stp->gen_no <= N) {
245 bd->flags = BF_EVACUATED;
250 // Start a new to-space block, chain it on after the previous one.
251 if (stp->hp_bd != NULL) {
252 stp->hp_bd->free = stp->hp;
253 stp->hp_bd->link = bd;
258 stp->hpLim = stp->hp + BLOCK_SIZE_W;
267 gc_alloc_scavd_block(step *stp)
269 bdescr *bd = allocBlock();
270 bd->gen_no = stp->gen_no;
273 // blocks in to-space in generations up to and including N
274 // get the BF_EVACUATED flag.
275 if (stp->gen_no <= N) {
276 bd->flags = BF_EVACUATED;
281 bd->link = stp->blocks;
284 if (stp->scavd_hp != NULL) {
285 Bdescr(stp->scavd_hp)->free = stp->scavd_hp;
287 stp->scavd_hp = bd->start;
288 stp->scavd_hpLim = stp->scavd_hp + BLOCK_SIZE_W;
296 /* -----------------------------------------------------------------------------
299 Rough outline of the algorithm: for garbage collecting generation N
300 (and all younger generations):
302 - follow all pointers in the root set. the root set includes all
303 mutable objects in all generations (mutable_list).
305 - for each pointer, evacuate the object it points to into either
307 + to-space of the step given by step->to, which is the next
308 highest step in this generation or the first step in the next
309 generation if this is the last step.
311 + to-space of generations[evac_gen]->steps[0], if evac_gen != 0.
312 When we evacuate an object we attempt to evacuate
313 everything it points to into the same generation - this is
314 achieved by setting evac_gen to the desired generation. If
315 we can't do this, then an entry in the mut list has to
316 be made for the cross-generation pointer.
318 + if the object is already in a generation > N, then leave
321 - repeatedly scavenge to-space from each step in each generation
322 being collected until no more objects can be evacuated.
324 - free from-space in each step, and set from-space = to-space.
326 Locks held: sched_mutex
328 -------------------------------------------------------------------------- */
331 GarbageCollect ( void (*get_roots)(evac_fn), rtsBool force_major_gc )
335 lnat live, allocated, collected = 0, copied = 0, scavd_copied = 0;
336 lnat oldgen_saved_blocks = 0;
340 CostCentreStack *prev_CCS;
343 #if defined(DEBUG) && defined(GRAN)
344 IF_DEBUG(gc, debugBelch("@@ Starting garbage collection at %ld (%lx)\n",
348 #if defined(RTS_USER_SIGNALS)
353 // tell the STM to discard any cached closures its hoping to re-use
356 // tell the stats department that we've started a GC
359 // Init stats and print par specific (timing) info
360 PAR_TICKY_PAR_START();
362 // attribute any costs to CCS_GC
368 /* Approximate how much we allocated.
369 * Todo: only when generating stats?
371 allocated = calcAllocated();
373 /* Figure out which generation to collect
375 if (force_major_gc) {
376 N = RtsFlags.GcFlags.generations - 1;
380 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
381 if (generations[g].steps[0].n_blocks +
382 generations[g].steps[0].n_large_blocks
383 >= generations[g].max_blocks) {
387 major_gc = (N == RtsFlags.GcFlags.generations-1);
390 #ifdef RTS_GTK_FRONTPANEL
391 if (RtsFlags.GcFlags.frontpanel) {
392 updateFrontPanelBeforeGC(N);
396 // check stack sanity *before* GC (ToDo: check all threads)
398 // ToDo!: check sanity IF_DEBUG(sanity, checkTSOsSanity());
400 IF_DEBUG(sanity, checkFreeListSanity());
402 /* Initialise the static object lists
404 static_objects = END_OF_STATIC_LIST;
405 scavenged_static_objects = END_OF_STATIC_LIST;
407 /* Save the nursery if we're doing a two-space collection.
408 * g0s0->blocks will be used for to-space, so we need to get the
409 * nursery out of the way.
411 if (RtsFlags.GcFlags.generations == 1) {
412 saved_nursery = g0s0->blocks;
413 saved_n_blocks = g0s0->n_blocks;
418 /* Keep a count of how many new blocks we allocated during this GC
419 * (used for resizing the allocation area, later).
422 new_scavd_blocks = 0;
424 // Initialise to-space in all the generations/steps that we're
427 for (g = 0; g <= N; g++) {
429 // throw away the mutable list. Invariant: the mutable list
430 // always has at least one block; this means we can avoid a check for
431 // NULL in recordMutable().
433 freeChain(generations[g].mut_list);
434 generations[g].mut_list = allocBlock();
437 for (s = 0; s < generations[g].n_steps; s++) {
439 // generation 0, step 0 doesn't need to-space
440 if (g == 0 && s == 0 && RtsFlags.GcFlags.generations > 1) {
444 stp = &generations[g].steps[s];
445 ASSERT(stp->gen_no == g);
447 // start a new to-space for this step.
448 stp->old_blocks = stp->blocks;
449 stp->n_old_blocks = stp->n_blocks;
451 // allocate the first to-space block; extra blocks will be
452 // chained on as necessary.
454 bd = gc_alloc_block(stp);
457 stp->scan = bd->start;
460 // allocate a block for "already scavenged" objects. This goes
461 // on the front of the stp->blocks list, so it won't be
462 // traversed by the scavenging sweep.
463 gc_alloc_scavd_block(stp);
465 // initialise the large object queues.
466 stp->new_large_objects = NULL;
467 stp->scavenged_large_objects = NULL;
468 stp->n_scavenged_large_blocks = 0;
470 // mark the large objects as not evacuated yet
471 for (bd = stp->large_objects; bd; bd = bd->link) {
472 bd->flags &= ~BF_EVACUATED;
475 // for a compacted step, we need to allocate the bitmap
476 if (stp->is_compacted) {
477 nat bitmap_size; // in bytes
478 bdescr *bitmap_bdescr;
481 bitmap_size = stp->n_old_blocks * BLOCK_SIZE / (sizeof(W_)*BITS_PER_BYTE);
483 if (bitmap_size > 0) {
484 bitmap_bdescr = allocGroup((lnat)BLOCK_ROUND_UP(bitmap_size)
486 stp->bitmap = bitmap_bdescr;
487 bitmap = bitmap_bdescr->start;
489 IF_DEBUG(gc, debugBelch("bitmap_size: %d, bitmap: %p",
490 bitmap_size, bitmap););
492 // don't forget to fill it with zeros!
493 memset(bitmap, 0, bitmap_size);
495 // For each block in this step, point to its bitmap from the
497 for (bd=stp->old_blocks; bd != NULL; bd = bd->link) {
498 bd->u.bitmap = bitmap;
499 bitmap += BLOCK_SIZE_W / (sizeof(W_)*BITS_PER_BYTE);
501 // Also at this point we set the BF_COMPACTED flag
502 // for this block. The invariant is that
503 // BF_COMPACTED is always unset, except during GC
504 // when it is set on those blocks which will be
506 bd->flags |= BF_COMPACTED;
513 /* make sure the older generations have at least one block to
514 * allocate into (this makes things easier for copy(), see below).
516 for (g = N+1; g < RtsFlags.GcFlags.generations; g++) {
517 for (s = 0; s < generations[g].n_steps; s++) {
518 stp = &generations[g].steps[s];
519 if (stp->hp_bd == NULL) {
520 ASSERT(stp->blocks == NULL);
521 bd = gc_alloc_block(stp);
525 if (stp->scavd_hp == NULL) {
526 gc_alloc_scavd_block(stp);
529 /* Set the scan pointer for older generations: remember we
530 * still have to scavenge objects that have been promoted. */
532 stp->scan_bd = stp->hp_bd;
533 stp->new_large_objects = NULL;
534 stp->scavenged_large_objects = NULL;
535 stp->n_scavenged_large_blocks = 0;
539 /* Allocate a mark stack if we're doing a major collection.
542 mark_stack_bdescr = allocGroup(MARK_STACK_BLOCKS);
543 mark_stack = (StgPtr *)mark_stack_bdescr->start;
544 mark_sp = mark_stack;
545 mark_splim = mark_stack + (MARK_STACK_BLOCKS * BLOCK_SIZE_W);
547 mark_stack_bdescr = NULL;
550 /* -----------------------------------------------------------------------
551 * follow all the roots that we know about:
552 * - mutable lists from each generation > N
553 * we want to *scavenge* these roots, not evacuate them: they're not
554 * going to move in this GC.
555 * Also: do them in reverse generation order. This is because we
556 * often want to promote objects that are pointed to by older
557 * generations early, so we don't have to repeatedly copy them.
558 * Doing the generations in reverse order ensures that we don't end
559 * up in the situation where we want to evac an object to gen 3 and
560 * it has already been evaced to gen 2.
564 for (g = RtsFlags.GcFlags.generations-1; g > N; g--) {
565 generations[g].saved_mut_list = generations[g].mut_list;
566 generations[g].mut_list = allocBlock();
567 // mut_list always has at least one block.
570 for (g = RtsFlags.GcFlags.generations-1; g > N; g--) {
571 IF_PAR_DEBUG(verbose, printMutableList(&generations[g]));
572 scavenge_mutable_list(&generations[g]);
574 for (st = generations[g].n_steps-1; st >= 0; st--) {
575 scavenge(&generations[g].steps[st]);
580 /* follow roots from the CAF list (used by GHCi)
585 /* follow all the roots that the application knows about.
588 get_roots(mark_root);
591 /* And don't forget to mark the TSO if we got here direct from
593 /* Not needed in a seq version?
595 CurrentTSO = (StgTSO *)MarkRoot((StgClosure *)CurrentTSO);
599 // Mark the entries in the GALA table of the parallel system
600 markLocalGAs(major_gc);
601 // Mark all entries on the list of pending fetches
602 markPendingFetches(major_gc);
605 /* Mark the weak pointer list, and prepare to detect dead weak
608 mark_weak_ptr_list(&weak_ptr_list);
609 old_weak_ptr_list = weak_ptr_list;
610 weak_ptr_list = NULL;
611 weak_stage = WeakPtrs;
613 /* The all_threads list is like the weak_ptr_list.
614 * See traverse_weak_ptr_list() for the details.
616 old_all_threads = all_threads;
617 all_threads = END_TSO_QUEUE;
618 resurrected_threads = END_TSO_QUEUE;
620 /* Mark the stable pointer table.
622 markStablePtrTable(mark_root);
624 /* -------------------------------------------------------------------------
625 * Repeatedly scavenge all the areas we know about until there's no
626 * more scavenging to be done.
633 // scavenge static objects
634 if (major_gc && static_objects != END_OF_STATIC_LIST) {
635 IF_DEBUG(sanity, checkStaticObjects(static_objects));
639 /* When scavenging the older generations: Objects may have been
640 * evacuated from generations <= N into older generations, and we
641 * need to scavenge these objects. We're going to try to ensure that
642 * any evacuations that occur move the objects into at least the
643 * same generation as the object being scavenged, otherwise we
644 * have to create new entries on the mutable list for the older
648 // scavenge each step in generations 0..maxgen
654 // scavenge objects in compacted generation
655 if (mark_stack_overflowed || oldgen_scan_bd != NULL ||
656 (mark_stack_bdescr != NULL && !mark_stack_empty())) {
657 scavenge_mark_stack();
661 for (gen = RtsFlags.GcFlags.generations; --gen >= 0; ) {
662 for (st = generations[gen].n_steps; --st >= 0; ) {
663 if (gen == 0 && st == 0 && RtsFlags.GcFlags.generations > 1) {
666 stp = &generations[gen].steps[st];
668 if (stp->hp_bd != stp->scan_bd || stp->scan < stp->hp) {
673 if (stp->new_large_objects != NULL) {
682 if (flag) { goto loop; }
684 // must be last... invariant is that everything is fully
685 // scavenged at this point.
686 if (traverse_weak_ptr_list()) { // returns rtsTrue if evaced something
691 /* Update the pointers from the "main thread" list - these are
692 * treated as weak pointers because we want to allow a main thread
693 * to get a BlockedOnDeadMVar exception in the same way as any other
694 * thread. Note that the threads should all have been retained by
695 * GC by virtue of being on the all_threads list, we're just
696 * updating pointers here.
701 for (m = main_threads; m != NULL; m = m->link) {
702 tso = (StgTSO *) isAlive((StgClosure *)m->tso);
704 barf("main thread has been GC'd");
711 // Reconstruct the Global Address tables used in GUM
712 rebuildGAtables(major_gc);
713 IF_DEBUG(sanity, checkLAGAtable(rtsTrue/*check closures, too*/));
716 // Now see which stable names are still alive.
719 // Tidy the end of the to-space chains
720 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
721 for (s = 0; s < generations[g].n_steps; s++) {
722 stp = &generations[g].steps[s];
723 if (!(g == 0 && s == 0 && RtsFlags.GcFlags.generations > 1)) {
724 ASSERT(Bdescr(stp->hp) == stp->hp_bd);
725 stp->hp_bd->free = stp->hp;
726 Bdescr(stp->scavd_hp)->free = stp->scavd_hp;
732 // We call processHeapClosureForDead() on every closure destroyed during
733 // the current garbage collection, so we invoke LdvCensusForDead().
734 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV
735 || RtsFlags.ProfFlags.bioSelector != NULL)
739 // NO MORE EVACUATION AFTER THIS POINT!
740 // Finally: compaction of the oldest generation.
741 if (major_gc && oldest_gen->steps[0].is_compacted) {
742 // save number of blocks for stats
743 oldgen_saved_blocks = oldest_gen->steps[0].n_old_blocks;
747 IF_DEBUG(sanity, checkGlobalTSOList(rtsFalse));
749 /* run through all the generations/steps and tidy up
751 copied = new_blocks * BLOCK_SIZE_W;
752 scavd_copied = new_scavd_blocks * BLOCK_SIZE_W;
753 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
756 generations[g].collections++; // for stats
759 // Count the mutable list as bytes "copied" for the purposes of
760 // stats. Every mutable list is copied during every GC.
762 for (bd = generations[g].mut_list; bd != NULL; bd = bd->link) {
763 copied += (bd->free - bd->start) * sizeof(StgWord);
767 for (s = 0; s < generations[g].n_steps; s++) {
769 stp = &generations[g].steps[s];
771 if (!(g == 0 && s == 0 && RtsFlags.GcFlags.generations > 1)) {
772 // stats information: how much we copied
774 copied -= stp->hp_bd->start + BLOCK_SIZE_W -
776 scavd_copied -= (P_)(BLOCK_ROUND_UP(stp->scavd_hp)) - stp->scavd_hp;
780 // for generations we collected...
783 // rough calculation of garbage collected, for stats output
784 if (stp->is_compacted) {
785 collected += (oldgen_saved_blocks - stp->n_old_blocks) * BLOCK_SIZE_W;
787 if (g == 0 && s == 0) {
788 collected += countNurseryBlocks() * BLOCK_SIZE_W;
789 collected += alloc_blocks;
791 collected += stp->n_old_blocks * BLOCK_SIZE_W;
795 /* free old memory and shift to-space into from-space for all
796 * the collected steps (except the allocation area). These
797 * freed blocks will probaby be quickly recycled.
799 if (!(g == 0 && s == 0)) {
800 if (stp->is_compacted) {
801 // for a compacted step, just shift the new to-space
802 // onto the front of the now-compacted existing blocks.
803 for (bd = stp->blocks; bd != NULL; bd = bd->link) {
804 bd->flags &= ~BF_EVACUATED; // now from-space
806 // tack the new blocks on the end of the existing blocks
807 if (stp->old_blocks != NULL) {
808 for (bd = stp->old_blocks; bd != NULL; bd = next) {
811 bd->link = stp->blocks;
813 // NB. this step might not be compacted next
814 // time, so reset the BF_COMPACTED flags.
815 // They are set before GC if we're going to
816 // compact. (search for BF_COMPACTED above).
817 bd->flags &= ~BF_COMPACTED;
819 stp->blocks = stp->old_blocks;
821 // add the new blocks to the block tally
822 stp->n_blocks += stp->n_old_blocks;
824 freeChain(stp->old_blocks);
825 for (bd = stp->blocks; bd != NULL; bd = bd->link) {
826 bd->flags &= ~BF_EVACUATED; // now from-space
829 stp->old_blocks = NULL;
830 stp->n_old_blocks = 0;
833 /* LARGE OBJECTS. The current live large objects are chained on
834 * scavenged_large, having been moved during garbage
835 * collection from large_objects. Any objects left on
836 * large_objects list are therefore dead, so we free them here.
838 for (bd = stp->large_objects; bd != NULL; bd = next) {
844 // update the count of blocks used by large objects
845 for (bd = stp->scavenged_large_objects; bd != NULL; bd = bd->link) {
846 bd->flags &= ~BF_EVACUATED;
848 stp->large_objects = stp->scavenged_large_objects;
849 stp->n_large_blocks = stp->n_scavenged_large_blocks;
852 // for older generations...
854 /* For older generations, we need to append the
855 * scavenged_large_object list (i.e. large objects that have been
856 * promoted during this GC) to the large_object list for that step.
858 for (bd = stp->scavenged_large_objects; bd; bd = next) {
860 bd->flags &= ~BF_EVACUATED;
861 dbl_link_onto(bd, &stp->large_objects);
864 // add the new blocks we promoted during this GC
865 stp->n_large_blocks += stp->n_scavenged_large_blocks;
870 /* Reset the sizes of the older generations when we do a major
873 * CURRENT STRATEGY: make all generations except zero the same size.
874 * We have to stay within the maximum heap size, and leave a certain
875 * percentage of the maximum heap size available to allocate into.
877 if (major_gc && RtsFlags.GcFlags.generations > 1) {
878 nat live, size, min_alloc;
879 nat max = RtsFlags.GcFlags.maxHeapSize;
880 nat gens = RtsFlags.GcFlags.generations;
882 // live in the oldest generations
883 live = oldest_gen->steps[0].n_blocks +
884 oldest_gen->steps[0].n_large_blocks;
886 // default max size for all generations except zero
887 size = stg_max(live * RtsFlags.GcFlags.oldGenFactor,
888 RtsFlags.GcFlags.minOldGenSize);
890 // minimum size for generation zero
891 min_alloc = stg_max((RtsFlags.GcFlags.pcFreeHeap * max) / 200,
892 RtsFlags.GcFlags.minAllocAreaSize);
894 // Auto-enable compaction when the residency reaches a
895 // certain percentage of the maximum heap size (default: 30%).
896 if (RtsFlags.GcFlags.generations > 1 &&
897 (RtsFlags.GcFlags.compact ||
899 oldest_gen->steps[0].n_blocks >
900 (RtsFlags.GcFlags.compactThreshold * max) / 100))) {
901 oldest_gen->steps[0].is_compacted = 1;
902 // debugBelch("compaction: on\n", live);
904 oldest_gen->steps[0].is_compacted = 0;
905 // debugBelch("compaction: off\n", live);
908 // if we're going to go over the maximum heap size, reduce the
909 // size of the generations accordingly. The calculation is
910 // different if compaction is turned on, because we don't need
911 // to double the space required to collect the old generation.
914 // this test is necessary to ensure that the calculations
915 // below don't have any negative results - we're working
916 // with unsigned values here.
917 if (max < min_alloc) {
921 if (oldest_gen->steps[0].is_compacted) {
922 if ( (size + (size - 1) * (gens - 2) * 2) + min_alloc > max ) {
923 size = (max - min_alloc) / ((gens - 1) * 2 - 1);
926 if ( (size * (gens - 1) * 2) + min_alloc > max ) {
927 size = (max - min_alloc) / ((gens - 1) * 2);
937 debugBelch("live: %d, min_alloc: %d, size : %d, max = %d\n", live,
938 min_alloc, size, max);
941 for (g = 0; g < gens; g++) {
942 generations[g].max_blocks = size;
946 // Guess the amount of live data for stats.
949 /* Free the small objects allocated via allocate(), since this will
950 * all have been copied into G0S1 now.
952 if (small_alloc_list != NULL) {
953 freeChain(small_alloc_list);
955 small_alloc_list = NULL;
959 alloc_blocks_lim = RtsFlags.GcFlags.minAllocAreaSize;
961 // Start a new pinned_object_block
962 pinned_object_block = NULL;
964 /* Free the mark stack.
966 if (mark_stack_bdescr != NULL) {
967 freeGroup(mark_stack_bdescr);
972 for (g = 0; g <= N; g++) {
973 for (s = 0; s < generations[g].n_steps; s++) {
974 stp = &generations[g].steps[s];
975 if (stp->is_compacted && stp->bitmap != NULL) {
976 freeGroup(stp->bitmap);
981 /* Two-space collector:
982 * Free the old to-space, and estimate the amount of live data.
984 if (RtsFlags.GcFlags.generations == 1) {
987 if (g0s0->old_blocks != NULL) {
988 freeChain(g0s0->old_blocks);
990 for (bd = g0s0->blocks; bd != NULL; bd = bd->link) {
991 bd->flags = 0; // now from-space
993 g0s0->old_blocks = g0s0->blocks;
994 g0s0->n_old_blocks = g0s0->n_blocks;
995 g0s0->blocks = saved_nursery;
996 g0s0->n_blocks = saved_n_blocks;
998 /* For a two-space collector, we need to resize the nursery. */
1000 /* set up a new nursery. Allocate a nursery size based on a
1001 * function of the amount of live data (by default a factor of 2)
1002 * Use the blocks from the old nursery if possible, freeing up any
1005 * If we get near the maximum heap size, then adjust our nursery
1006 * size accordingly. If the nursery is the same size as the live
1007 * data (L), then we need 3L bytes. We can reduce the size of the
1008 * nursery to bring the required memory down near 2L bytes.
1010 * A normal 2-space collector would need 4L bytes to give the same
1011 * performance we get from 3L bytes, reducing to the same
1012 * performance at 2L bytes.
1014 blocks = g0s0->n_old_blocks;
1016 if ( RtsFlags.GcFlags.maxHeapSize != 0 &&
1017 blocks * RtsFlags.GcFlags.oldGenFactor * 2 >
1018 RtsFlags.GcFlags.maxHeapSize ) {
1019 long adjusted_blocks; // signed on purpose
1022 adjusted_blocks = (RtsFlags.GcFlags.maxHeapSize - 2 * blocks);
1023 IF_DEBUG(gc, debugBelch("@@ Near maximum heap size of 0x%x blocks, blocks = %d, adjusted to %ld", RtsFlags.GcFlags.maxHeapSize, blocks, adjusted_blocks));
1024 pc_free = adjusted_blocks * 100 / RtsFlags.GcFlags.maxHeapSize;
1025 if (pc_free < RtsFlags.GcFlags.pcFreeHeap) /* might even be < 0 */ {
1028 blocks = adjusted_blocks;
1031 blocks *= RtsFlags.GcFlags.oldGenFactor;
1032 if (blocks < RtsFlags.GcFlags.minAllocAreaSize) {
1033 blocks = RtsFlags.GcFlags.minAllocAreaSize;
1036 resizeNurseries(blocks);
1039 /* Generational collector:
1040 * If the user has given us a suggested heap size, adjust our
1041 * allocation area to make best use of the memory available.
1044 if (RtsFlags.GcFlags.heapSizeSuggestion) {
1046 nat needed = calcNeeded(); // approx blocks needed at next GC
1048 /* Guess how much will be live in generation 0 step 0 next time.
1049 * A good approximation is obtained by finding the
1050 * percentage of g0s0 that was live at the last minor GC.
1053 g0s0_pcnt_kept = (new_blocks * 100) / countNurseryBlocks();
1056 /* Estimate a size for the allocation area based on the
1057 * information available. We might end up going slightly under
1058 * or over the suggested heap size, but we should be pretty
1061 * Formula: suggested - needed
1062 * ----------------------------
1063 * 1 + g0s0_pcnt_kept/100
1065 * where 'needed' is the amount of memory needed at the next
1066 * collection for collecting all steps except g0s0.
1069 (((long)RtsFlags.GcFlags.heapSizeSuggestion - (long)needed) * 100) /
1070 (100 + (long)g0s0_pcnt_kept);
1072 if (blocks < (long)RtsFlags.GcFlags.minAllocAreaSize) {
1073 blocks = RtsFlags.GcFlags.minAllocAreaSize;
1076 resizeNurseries((nat)blocks);
1079 // we might have added extra large blocks to the nursery, so
1080 // resize back to minAllocAreaSize again.
1081 resizeNurseriesFixed(RtsFlags.GcFlags.minAllocAreaSize);
1085 // mark the garbage collected CAFs as dead
1086 #if 0 && defined(DEBUG) // doesn't work at the moment
1087 if (major_gc) { gcCAFs(); }
1091 // resetStaticObjectForRetainerProfiling() must be called before
1093 resetStaticObjectForRetainerProfiling();
1096 // zero the scavenged static object list
1098 zero_static_object_list(scavenged_static_objects);
1101 // Reset the nursery
1104 RELEASE_LOCK(&sched_mutex);
1106 // start any pending finalizers
1107 scheduleFinalizers(old_weak_ptr_list);
1109 // send exceptions to any threads which were about to die
1110 resurrectThreads(resurrected_threads);
1112 ACQUIRE_LOCK(&sched_mutex);
1114 // Update the stable pointer hash table.
1115 updateStablePtrTable(major_gc);
1117 // check sanity after GC
1118 IF_DEBUG(sanity, checkSanity());
1120 // extra GC trace info
1121 IF_DEBUG(gc, statDescribeGens());
1124 // symbol-table based profiling
1125 /* heapCensus(to_blocks); */ /* ToDo */
1128 // restore enclosing cost centre
1133 // check for memory leaks if sanity checking is on
1134 IF_DEBUG(sanity, memInventory());
1136 #ifdef RTS_GTK_FRONTPANEL
1137 if (RtsFlags.GcFlags.frontpanel) {
1138 updateFrontPanelAfterGC( N, live );
1142 // ok, GC over: tell the stats department what happened.
1143 stat_endGC(allocated, collected, live, copied, scavd_copied, N);
1145 #if defined(RTS_USER_SIGNALS)
1146 // unblock signals again
1147 unblockUserSignals();
1154 /* -----------------------------------------------------------------------------
1157 traverse_weak_ptr_list is called possibly many times during garbage
1158 collection. It returns a flag indicating whether it did any work
1159 (i.e. called evacuate on any live pointers).
1161 Invariant: traverse_weak_ptr_list is called when the heap is in an
1162 idempotent state. That means that there are no pending
1163 evacuate/scavenge operations. This invariant helps the weak
1164 pointer code decide which weak pointers are dead - if there are no
1165 new live weak pointers, then all the currently unreachable ones are
1168 For generational GC: we just don't try to finalize weak pointers in
1169 older generations than the one we're collecting. This could
1170 probably be optimised by keeping per-generation lists of weak
1171 pointers, but for a few weak pointers this scheme will work.
1173 There are three distinct stages to processing weak pointers:
1175 - weak_stage == WeakPtrs
1177 We process all the weak pointers whos keys are alive (evacuate
1178 their values and finalizers), and repeat until we can find no new
1179 live keys. If no live keys are found in this pass, then we
1180 evacuate the finalizers of all the dead weak pointers in order to
1183 - weak_stage == WeakThreads
1185 Now, we discover which *threads* are still alive. Pointers to
1186 threads from the all_threads and main thread lists are the
1187 weakest of all: a pointers from the finalizer of a dead weak
1188 pointer can keep a thread alive. Any threads found to be unreachable
1189 are evacuated and placed on the resurrected_threads list so we
1190 can send them a signal later.
1192 - weak_stage == WeakDone
1194 No more evacuation is done.
1196 -------------------------------------------------------------------------- */
1199 traverse_weak_ptr_list(void)
1201 StgWeak *w, **last_w, *next_w;
1203 rtsBool flag = rtsFalse;
1205 switch (weak_stage) {
1211 /* doesn't matter where we evacuate values/finalizers to, since
1212 * these pointers are treated as roots (iff the keys are alive).
1216 last_w = &old_weak_ptr_list;
1217 for (w = old_weak_ptr_list; w != NULL; w = next_w) {
1219 /* There might be a DEAD_WEAK on the list if finalizeWeak# was
1220 * called on a live weak pointer object. Just remove it.
1222 if (w->header.info == &stg_DEAD_WEAK_info) {
1223 next_w = ((StgDeadWeak *)w)->link;
1228 switch (get_itbl(w)->type) {
1231 next_w = (StgWeak *)((StgEvacuated *)w)->evacuee;
1236 /* Now, check whether the key is reachable.
1238 new = isAlive(w->key);
1241 // evacuate the value and finalizer
1242 w->value = evacuate(w->value);
1243 w->finalizer = evacuate(w->finalizer);
1244 // remove this weak ptr from the old_weak_ptr list
1246 // and put it on the new weak ptr list
1248 w->link = weak_ptr_list;
1251 IF_DEBUG(weak, debugBelch("Weak pointer still alive at %p -> %p",
1256 last_w = &(w->link);
1262 barf("traverse_weak_ptr_list: not WEAK");
1266 /* If we didn't make any changes, then we can go round and kill all
1267 * the dead weak pointers. The old_weak_ptr list is used as a list
1268 * of pending finalizers later on.
1270 if (flag == rtsFalse) {
1271 for (w = old_weak_ptr_list; w; w = w->link) {
1272 w->finalizer = evacuate(w->finalizer);
1275 // Next, move to the WeakThreads stage after fully
1276 // scavenging the finalizers we've just evacuated.
1277 weak_stage = WeakThreads;
1283 /* Now deal with the all_threads list, which behaves somewhat like
1284 * the weak ptr list. If we discover any threads that are about to
1285 * become garbage, we wake them up and administer an exception.
1288 StgTSO *t, *tmp, *next, **prev;
1290 prev = &old_all_threads;
1291 for (t = old_all_threads; t != END_TSO_QUEUE; t = next) {
1293 tmp = (StgTSO *)isAlive((StgClosure *)t);
1299 ASSERT(get_itbl(t)->type == TSO);
1300 switch (t->what_next) {
1301 case ThreadRelocated:
1306 case ThreadComplete:
1307 // finshed or died. The thread might still be alive, but we
1308 // don't keep it on the all_threads list. Don't forget to
1309 // stub out its global_link field.
1310 next = t->global_link;
1311 t->global_link = END_TSO_QUEUE;
1318 // Threads blocked on black holes: if the black hole
1319 // is alive, then the thread is alive too.
1320 if (tmp == NULL && t->why_blocked == BlockedOnBlackHole) {
1321 if (isAlive(t->block_info.closure)) {
1322 t = (StgTSO *)evacuate((StgClosure *)t);
1329 // not alive (yet): leave this thread on the
1330 // old_all_threads list.
1331 prev = &(t->global_link);
1332 next = t->global_link;
1335 // alive: move this thread onto the all_threads list.
1336 next = t->global_link;
1337 t->global_link = all_threads;
1344 /* If we evacuated any threads, we need to go back to the scavenger.
1346 if (flag) return rtsTrue;
1348 /* And resurrect any threads which were about to become garbage.
1351 StgTSO *t, *tmp, *next;
1352 for (t = old_all_threads; t != END_TSO_QUEUE; t = next) {
1353 next = t->global_link;
1354 tmp = (StgTSO *)evacuate((StgClosure *)t);
1355 tmp->global_link = resurrected_threads;
1356 resurrected_threads = tmp;
1360 /* Finally, we can update the blackhole_queue. This queue
1361 * simply strings together TSOs blocked on black holes, it is
1362 * not intended to keep anything alive. Hence, we do not follow
1363 * pointers on the blackhole_queue until now, when we have
1364 * determined which TSOs are otherwise reachable. We know at
1365 * this point that all TSOs have been evacuated, however.
1369 for (pt = &blackhole_queue; *pt != END_TSO_QUEUE; pt = &((*pt)->link)) {
1370 *pt = (StgTSO *)isAlive((StgClosure *)*pt);
1371 ASSERT(*pt != NULL);
1375 weak_stage = WeakDone; // *now* we're done,
1376 return rtsTrue; // but one more round of scavenging, please
1379 barf("traverse_weak_ptr_list");
1385 /* -----------------------------------------------------------------------------
1386 After GC, the live weak pointer list may have forwarding pointers
1387 on it, because a weak pointer object was evacuated after being
1388 moved to the live weak pointer list. We remove those forwarding
1391 Also, we don't consider weak pointer objects to be reachable, but
1392 we must nevertheless consider them to be "live" and retain them.
1393 Therefore any weak pointer objects which haven't as yet been
1394 evacuated need to be evacuated now.
1395 -------------------------------------------------------------------------- */
1399 mark_weak_ptr_list ( StgWeak **list )
1401 StgWeak *w, **last_w;
1404 for (w = *list; w; w = w->link) {
1405 // w might be WEAK, EVACUATED, or DEAD_WEAK (actually CON_STATIC) here
1406 ASSERT(w->header.info == &stg_DEAD_WEAK_info
1407 || get_itbl(w)->type == WEAK || get_itbl(w)->type == EVACUATED);
1408 w = (StgWeak *)evacuate((StgClosure *)w);
1410 last_w = &(w->link);
1414 /* -----------------------------------------------------------------------------
1415 isAlive determines whether the given closure is still alive (after
1416 a garbage collection) or not. It returns the new address of the
1417 closure if it is alive, or NULL otherwise.
1419 NOTE: Use it before compaction only!
1420 -------------------------------------------------------------------------- */
1424 isAlive(StgClosure *p)
1426 const StgInfoTable *info;
1431 ASSERT(LOOKS_LIKE_CLOSURE_PTR(p));
1434 // ignore static closures
1436 // ToDo: for static closures, check the static link field.
1437 // Problem here is that we sometimes don't set the link field, eg.
1438 // for static closures with an empty SRT or CONSTR_STATIC_NOCAFs.
1440 if (!HEAP_ALLOCED(p)) {
1444 // ignore closures in generations that we're not collecting.
1446 if (bd->gen_no > N) {
1450 // if it's a pointer into to-space, then we're done
1451 if (bd->flags & BF_EVACUATED) {
1455 // large objects use the evacuated flag
1456 if (bd->flags & BF_LARGE) {
1460 // check the mark bit for compacted steps
1461 if ((bd->flags & BF_COMPACTED) && is_marked((P_)p,bd)) {
1465 switch (info->type) {
1470 case IND_OLDGEN: // rely on compatible layout with StgInd
1471 case IND_OLDGEN_PERM:
1472 // follow indirections
1473 p = ((StgInd *)p)->indirectee;
1478 return ((StgEvacuated *)p)->evacuee;
1481 if (((StgTSO *)p)->what_next == ThreadRelocated) {
1482 p = (StgClosure *)((StgTSO *)p)->link;
1495 mark_root(StgClosure **root)
1497 *root = evacuate(*root);
1501 upd_evacuee(StgClosure *p, StgClosure *dest)
1503 // not true: (ToDo: perhaps it should be)
1504 // ASSERT(Bdescr((P_)dest)->flags & BF_EVACUATED);
1505 SET_INFO(p, &stg_EVACUATED_info);
1506 ((StgEvacuated *)p)->evacuee = dest;
1510 STATIC_INLINE StgClosure *
1511 copy(StgClosure *src, nat size, step *stp)
1517 nat size_org = size;
1520 TICK_GC_WORDS_COPIED(size);
1521 /* Find out where we're going, using the handy "to" pointer in
1522 * the step of the source object. If it turns out we need to
1523 * evacuate to an older generation, adjust it here (see comment
1526 if (stp->gen_no < evac_gen) {
1527 #ifdef NO_EAGER_PROMOTION
1528 failed_to_evac = rtsTrue;
1530 stp = &generations[evac_gen].steps[0];
1534 /* chain a new block onto the to-space for the destination step if
1537 if (stp->hp + size >= stp->hpLim) {
1538 gc_alloc_block(stp);
1543 stp->hp = to + size;
1544 for (i = 0; i < size; i++) { // unroll for small i
1547 upd_evacuee((StgClosure *)from,(StgClosure *)to);
1550 // We store the size of the just evacuated object in the LDV word so that
1551 // the profiler can guess the position of the next object later.
1552 SET_EVACUAEE_FOR_LDV(from, size_org);
1554 return (StgClosure *)to;
1557 // Same as copy() above, except the object will be allocated in memory
1558 // that will not be scavenged. Used for object that have no pointer
1560 STATIC_INLINE StgClosure *
1561 copy_noscav(StgClosure *src, nat size, step *stp)
1567 nat size_org = size;
1570 TICK_GC_WORDS_COPIED(size);
1571 /* Find out where we're going, using the handy "to" pointer in
1572 * the step of the source object. If it turns out we need to
1573 * evacuate to an older generation, adjust it here (see comment
1576 if (stp->gen_no < evac_gen) {
1577 #ifdef NO_EAGER_PROMOTION
1578 failed_to_evac = rtsTrue;
1580 stp = &generations[evac_gen].steps[0];
1584 /* chain a new block onto the to-space for the destination step if
1587 if (stp->scavd_hp + size >= stp->scavd_hpLim) {
1588 gc_alloc_scavd_block(stp);
1593 stp->scavd_hp = to + size;
1594 for (i = 0; i < size; i++) { // unroll for small i
1597 upd_evacuee((StgClosure *)from,(StgClosure *)to);
1600 // We store the size of the just evacuated object in the LDV word so that
1601 // the profiler can guess the position of the next object later.
1602 SET_EVACUAEE_FOR_LDV(from, size_org);
1604 return (StgClosure *)to;
1607 /* Special version of copy() for when we only want to copy the info
1608 * pointer of an object, but reserve some padding after it. This is
1609 * used to optimise evacuation of BLACKHOLEs.
1614 copyPart(StgClosure *src, nat size_to_reserve, nat size_to_copy, step *stp)
1619 nat size_to_copy_org = size_to_copy;
1622 TICK_GC_WORDS_COPIED(size_to_copy);
1623 if (stp->gen_no < evac_gen) {
1624 #ifdef NO_EAGER_PROMOTION
1625 failed_to_evac = rtsTrue;
1627 stp = &generations[evac_gen].steps[0];
1631 if (stp->hp + size_to_reserve >= stp->hpLim) {
1632 gc_alloc_block(stp);
1635 for(to = stp->hp, from = (P_)src; size_to_copy>0; --size_to_copy) {
1640 stp->hp += size_to_reserve;
1641 upd_evacuee(src,(StgClosure *)dest);
1643 // We store the size of the just evacuated object in the LDV word so that
1644 // the profiler can guess the position of the next object later.
1645 // size_to_copy_org is wrong because the closure already occupies size_to_reserve
1647 SET_EVACUAEE_FOR_LDV(src, size_to_reserve);
1649 if (size_to_reserve - size_to_copy_org > 0)
1650 FILL_SLOP(stp->hp - 1, (int)(size_to_reserve - size_to_copy_org));
1652 return (StgClosure *)dest;
1656 /* -----------------------------------------------------------------------------
1657 Evacuate a large object
1659 This just consists of removing the object from the (doubly-linked)
1660 step->large_objects list, and linking it on to the (singly-linked)
1661 step->new_large_objects list, from where it will be scavenged later.
1663 Convention: bd->flags has BF_EVACUATED set for a large object
1664 that has been evacuated, or unset otherwise.
1665 -------------------------------------------------------------------------- */
1669 evacuate_large(StgPtr p)
1671 bdescr *bd = Bdescr(p);
1674 // object must be at the beginning of the block (or be a ByteArray)
1675 ASSERT(get_itbl((StgClosure *)p)->type == ARR_WORDS ||
1676 (((W_)p & BLOCK_MASK) == 0));
1678 // already evacuated?
1679 if (bd->flags & BF_EVACUATED) {
1680 /* Don't forget to set the failed_to_evac flag if we didn't get
1681 * the desired destination (see comments in evacuate()).
1683 if (bd->gen_no < evac_gen) {
1684 failed_to_evac = rtsTrue;
1685 TICK_GC_FAILED_PROMOTION();
1691 // remove from large_object list
1693 bd->u.back->link = bd->link;
1694 } else { // first object in the list
1695 stp->large_objects = bd->link;
1698 bd->link->u.back = bd->u.back;
1701 /* link it on to the evacuated large object list of the destination step
1704 if (stp->gen_no < evac_gen) {
1705 #ifdef NO_EAGER_PROMOTION
1706 failed_to_evac = rtsTrue;
1708 stp = &generations[evac_gen].steps[0];
1713 bd->gen_no = stp->gen_no;
1714 bd->link = stp->new_large_objects;
1715 stp->new_large_objects = bd;
1716 bd->flags |= BF_EVACUATED;
1719 /* -----------------------------------------------------------------------------
1722 This is called (eventually) for every live object in the system.
1724 The caller to evacuate specifies a desired generation in the
1725 evac_gen global variable. The following conditions apply to
1726 evacuating an object which resides in generation M when we're
1727 collecting up to generation N
1731 else evac to step->to
1733 if M < evac_gen evac to evac_gen, step 0
1735 if the object is already evacuated, then we check which generation
1738 if M >= evac_gen do nothing
1739 if M < evac_gen set failed_to_evac flag to indicate that we
1740 didn't manage to evacuate this object into evac_gen.
1745 evacuate() is the single most important function performance-wise
1746 in the GC. Various things have been tried to speed it up, but as
1747 far as I can tell the code generated by gcc 3.2 with -O2 is about
1748 as good as it's going to get. We pass the argument to evacuate()
1749 in a register using the 'regparm' attribute (see the prototype for
1750 evacuate() near the top of this file).
1752 Changing evacuate() to take an (StgClosure **) rather than
1753 returning the new pointer seems attractive, because we can avoid
1754 writing back the pointer when it hasn't changed (eg. for a static
1755 object, or an object in a generation > N). However, I tried it and
1756 it doesn't help. One reason is that the (StgClosure **) pointer
1757 gets spilled to the stack inside evacuate(), resulting in far more
1758 extra reads/writes than we save.
1759 -------------------------------------------------------------------------- */
1761 REGPARM1 static StgClosure *
1762 evacuate(StgClosure *q)
1769 const StgInfoTable *info;
1772 ASSERT(LOOKS_LIKE_CLOSURE_PTR(q));
1774 if (!HEAP_ALLOCED(q)) {
1776 if (!major_gc) return q;
1779 switch (info->type) {
1782 if (info->srt_bitmap != 0 &&
1783 *THUNK_STATIC_LINK((StgClosure *)q) == NULL) {
1784 *THUNK_STATIC_LINK((StgClosure *)q) = static_objects;
1785 static_objects = (StgClosure *)q;
1790 if (info->srt_bitmap != 0 &&
1791 *FUN_STATIC_LINK((StgClosure *)q) == NULL) {
1792 *FUN_STATIC_LINK((StgClosure *)q) = static_objects;
1793 static_objects = (StgClosure *)q;
1798 /* If q->saved_info != NULL, then it's a revertible CAF - it'll be
1799 * on the CAF list, so don't do anything with it here (we'll
1800 * scavenge it later).
1802 if (((StgIndStatic *)q)->saved_info == NULL
1803 && *IND_STATIC_LINK((StgClosure *)q) == NULL) {
1804 *IND_STATIC_LINK((StgClosure *)q) = static_objects;
1805 static_objects = (StgClosure *)q;
1810 if (*STATIC_LINK(info,(StgClosure *)q) == NULL) {
1811 *STATIC_LINK(info,(StgClosure *)q) = static_objects;
1812 static_objects = (StgClosure *)q;
1816 case CONSTR_INTLIKE:
1817 case CONSTR_CHARLIKE:
1818 case CONSTR_NOCAF_STATIC:
1819 /* no need to put these on the static linked list, they don't need
1825 barf("evacuate(static): strange closure type %d", (int)(info->type));
1831 if (bd->gen_no > N) {
1832 /* Can't evacuate this object, because it's in a generation
1833 * older than the ones we're collecting. Let's hope that it's
1834 * in evac_gen or older, or we will have to arrange to track
1835 * this pointer using the mutable list.
1837 if (bd->gen_no < evac_gen) {
1839 failed_to_evac = rtsTrue;
1840 TICK_GC_FAILED_PROMOTION();
1845 if ((bd->flags & (BF_LARGE | BF_COMPACTED | BF_EVACUATED)) != 0) {
1847 /* pointer into to-space: just return it. This normally
1848 * shouldn't happen, but alllowing it makes certain things
1849 * slightly easier (eg. the mutable list can contain the same
1850 * object twice, for example).
1852 if (bd->flags & BF_EVACUATED) {
1853 if (bd->gen_no < evac_gen) {
1854 failed_to_evac = rtsTrue;
1855 TICK_GC_FAILED_PROMOTION();
1860 /* evacuate large objects by re-linking them onto a different list.
1862 if (bd->flags & BF_LARGE) {
1864 if (info->type == TSO &&
1865 ((StgTSO *)q)->what_next == ThreadRelocated) {
1866 q = (StgClosure *)((StgTSO *)q)->link;
1869 evacuate_large((P_)q);
1873 /* If the object is in a step that we're compacting, then we
1874 * need to use an alternative evacuate procedure.
1876 if (bd->flags & BF_COMPACTED) {
1877 if (!is_marked((P_)q,bd)) {
1879 if (mark_stack_full()) {
1880 mark_stack_overflowed = rtsTrue;
1883 push_mark_stack((P_)q);
1893 switch (info->type) {
1897 return copy(q,sizeW_fromITBL(info),stp);
1901 StgWord w = (StgWord)q->payload[0];
1902 if (q->header.info == Czh_con_info &&
1903 // unsigned, so always true: (StgChar)w >= MIN_CHARLIKE &&
1904 (StgChar)w <= MAX_CHARLIKE) {
1905 return (StgClosure *)CHARLIKE_CLOSURE((StgChar)w);
1907 if (q->header.info == Izh_con_info &&
1908 (StgInt)w >= MIN_INTLIKE && (StgInt)w <= MAX_INTLIKE) {
1909 return (StgClosure *)INTLIKE_CLOSURE((StgInt)w);
1912 return copy_noscav(q,sizeofW(StgHeader)+1,stp);
1918 return copy(q,sizeofW(StgHeader)+1,stp);
1922 return copy(q,sizeofW(StgThunk)+1,stp);
1927 #ifdef NO_PROMOTE_THUNKS
1928 if (bd->gen_no == 0 &&
1929 bd->step->no != 0 &&
1930 bd->step->no == generations[bd->gen_no].n_steps-1) {
1934 return copy(q,sizeofW(StgThunk)+2,stp);
1941 return copy(q,sizeofW(StgHeader)+2,stp);
1944 return copy_noscav(q,sizeofW(StgHeader)+2,stp);
1947 return copy(q,thunk_sizeW_fromITBL(info),stp);
1952 case IND_OLDGEN_PERM:
1955 return copy(q,sizeW_fromITBL(info),stp);
1958 return copy(q,bco_sizeW((StgBCO *)q),stp);
1961 case SE_CAF_BLACKHOLE:
1964 return copyPart(q,BLACKHOLE_sizeW(),sizeofW(StgHeader),stp);
1966 case THUNK_SELECTOR:
1970 if (thunk_selector_depth > MAX_THUNK_SELECTOR_DEPTH) {
1971 return copy(q,THUNK_SELECTOR_sizeW(),stp);
1974 p = eval_thunk_selector(info->layout.selector_offset,
1978 return copy(q,THUNK_SELECTOR_sizeW(),stp);
1981 // q is still BLACKHOLE'd.
1982 thunk_selector_depth++;
1984 thunk_selector_depth--;
1986 // Update the THUNK_SELECTOR with an indirection to the
1987 // EVACUATED closure now at p. Why do this rather than
1988 // upd_evacuee(q,p)? Because we have an invariant that an
1989 // EVACUATED closure always points to an object in the
1990 // same or an older generation (required by the short-cut
1991 // test in the EVACUATED case, below).
1992 SET_INFO(q, &stg_IND_info);
1993 ((StgInd *)q)->indirectee = p;
1996 // We store the size of the just evacuated object in the
1997 // LDV word so that the profiler can guess the position of
1998 // the next object later.
1999 SET_EVACUAEE_FOR_LDV(q, THUNK_SELECTOR_sizeW());
2007 // follow chains of indirections, don't evacuate them
2008 q = ((StgInd*)q)->indirectee;
2020 case CATCH_STM_FRAME:
2021 case CATCH_RETRY_FRAME:
2022 case ATOMICALLY_FRAME:
2023 // shouldn't see these
2024 barf("evacuate: stack frame at %p\n", q);
2027 return copy(q,pap_sizeW((StgPAP*)q),stp);
2030 return copy(q,ap_sizeW((StgAP*)q),stp);
2033 return copy(q,ap_stack_sizeW((StgAP_STACK*)q),stp);
2036 /* Already evacuated, just return the forwarding address.
2037 * HOWEVER: if the requested destination generation (evac_gen) is
2038 * older than the actual generation (because the object was
2039 * already evacuated to a younger generation) then we have to
2040 * set the failed_to_evac flag to indicate that we couldn't
2041 * manage to promote the object to the desired generation.
2044 * Optimisation: the check is fairly expensive, but we can often
2045 * shortcut it if either the required generation is 0, or the
2046 * current object (the EVACUATED) is in a high enough generation.
2047 * We know that an EVACUATED always points to an object in the
2048 * same or an older generation. stp is the lowest step that the
2049 * current object would be evacuated to, so we only do the full
2050 * check if stp is too low.
2052 if (evac_gen > 0 && stp->gen_no < evac_gen) { // optimisation
2053 StgClosure *p = ((StgEvacuated*)q)->evacuee;
2054 if (HEAP_ALLOCED(p) && Bdescr((P_)p)->gen_no < evac_gen) {
2055 failed_to_evac = rtsTrue;
2056 TICK_GC_FAILED_PROMOTION();
2059 return ((StgEvacuated*)q)->evacuee;
2062 // just copy the block
2063 return copy_noscav(q,arr_words_sizeW((StgArrWords *)q),stp);
2066 case MUT_ARR_PTRS_FROZEN:
2067 case MUT_ARR_PTRS_FROZEN0:
2068 // just copy the block
2069 return copy(q,mut_arr_ptrs_sizeW((StgMutArrPtrs *)q),stp);
2073 StgTSO *tso = (StgTSO *)q;
2075 /* Deal with redirected TSOs (a TSO that's had its stack enlarged).
2077 if (tso->what_next == ThreadRelocated) {
2078 q = (StgClosure *)tso->link;
2082 /* To evacuate a small TSO, we need to relocate the update frame
2089 new_tso = (StgTSO *)copyPart((StgClosure *)tso,
2091 sizeofW(StgTSO), stp);
2092 move_TSO(tso, new_tso);
2093 for (p = tso->sp, q = new_tso->sp;
2094 p < tso->stack+tso->stack_size;) {
2098 return (StgClosure *)new_tso;
2105 //StgInfoTable *rip = get_closure_info(q, &size, &ptrs, &nonptrs, &vhs, str);
2106 to = copy(q,BLACKHOLE_sizeW(),stp);
2107 //ToDo: derive size etc from reverted IP
2108 //to = copy(q,size,stp);
2110 debugBelch("@@ evacuate: RBH %p (%s) to %p (%s)",
2111 q, info_type(q), to, info_type(to)));
2116 ASSERT(sizeofW(StgBlockedFetch) >= MIN_NONUPD_SIZE);
2117 to = copy(q,sizeofW(StgBlockedFetch),stp);
2119 debugBelch("@@ evacuate: %p (%s) to %p (%s)",
2120 q, info_type(q), to, info_type(to)));
2127 ASSERT(sizeofW(StgBlockedFetch) >= MIN_UPD_SIZE);
2128 to = copy(q,sizeofW(StgFetchMe),stp);
2130 debugBelch("@@ evacuate: %p (%s) to %p (%s)",
2131 q, info_type(q), to, info_type(to)));
2135 ASSERT(sizeofW(StgBlockedFetch) >= MIN_UPD_SIZE);
2136 to = copy(q,sizeofW(StgFetchMeBlockingQueue),stp);
2138 debugBelch("@@ evacuate: %p (%s) to %p (%s)",
2139 q, info_type(q), to, info_type(to)));
2144 return copy(q,sizeofW(StgTRecHeader),stp);
2146 case TVAR_WAIT_QUEUE:
2147 return copy(q,sizeofW(StgTVarWaitQueue),stp);
2150 return copy(q,sizeofW(StgTVar),stp);
2153 return copy(q,sizeofW(StgTRecChunk),stp);
2156 barf("evacuate: strange closure type %d", (int)(info->type));
2162 /* -----------------------------------------------------------------------------
2163 Evaluate a THUNK_SELECTOR if possible.
2165 returns: NULL if we couldn't evaluate this THUNK_SELECTOR, or
2166 a closure pointer if we evaluated it and this is the result. Note
2167 that "evaluating" the THUNK_SELECTOR doesn't necessarily mean
2168 reducing it to HNF, just that we have eliminated the selection.
2169 The result might be another thunk, or even another THUNK_SELECTOR.
2171 If the return value is non-NULL, the original selector thunk has
2172 been BLACKHOLE'd, and should be updated with an indirection or a
2173 forwarding pointer. If the return value is NULL, then the selector
2177 ToDo: the treatment of THUNK_SELECTORS could be improved in the
2178 following way (from a suggestion by Ian Lynagh):
2180 We can have a chain like this:
2184 |-----> sel_0 --> (a,b)
2186 |-----> sel_0 --> ...
2188 and the depth limit means we don't go all the way to the end of the
2189 chain, which results in a space leak. This affects the recursive
2190 call to evacuate() in the THUNK_SELECTOR case in evacuate(): *not*
2191 the recursive call to eval_thunk_selector() in
2192 eval_thunk_selector().
2194 We could eliminate the depth bound in this case, in the following
2197 - traverse the chain once to discover the *value* of the
2198 THUNK_SELECTOR. Mark all THUNK_SELECTORS that we
2199 visit on the way as having been visited already (somehow).
2201 - in a second pass, traverse the chain again updating all
2202 THUNK_SEELCTORS that we find on the way with indirections to
2205 - if we encounter a "marked" THUNK_SELECTOR in a normal
2206 evacuate(), we konw it can't be updated so just evac it.
2208 Program that illustrates the problem:
2211 foo (x:xs) = let (ys, zs) = foo xs
2212 in if x >= 0 then (x:ys, zs) else (ys, x:zs)
2214 main = bar [1..(100000000::Int)]
2215 bar xs = (\(ys, zs) -> print ys >> print zs) (foo xs)
2217 -------------------------------------------------------------------------- */
2219 static inline rtsBool
2220 is_to_space ( StgClosure *p )
2224 bd = Bdescr((StgPtr)p);
2225 if (HEAP_ALLOCED(p) &&
2226 ((bd->flags & BF_EVACUATED)
2227 || ((bd->flags & BF_COMPACTED) &&
2228 is_marked((P_)p,bd)))) {
2236 eval_thunk_selector( nat field, StgSelector * p )
2239 const StgInfoTable *info_ptr;
2240 StgClosure *selectee;
2242 selectee = p->selectee;
2244 // Save the real info pointer (NOTE: not the same as get_itbl()).
2245 info_ptr = p->header.info;
2247 // If the THUNK_SELECTOR is in a generation that we are not
2248 // collecting, then bail out early. We won't be able to save any
2249 // space in any case, and updating with an indirection is trickier
2251 if (Bdescr((StgPtr)p)->gen_no > N) {
2255 // BLACKHOLE the selector thunk, since it is now under evaluation.
2256 // This is important to stop us going into an infinite loop if
2257 // this selector thunk eventually refers to itself.
2258 SET_INFO(p,&stg_BLACKHOLE_info);
2262 // We don't want to end up in to-space, because this causes
2263 // problems when the GC later tries to evacuate the result of
2264 // eval_thunk_selector(). There are various ways this could
2267 // 1. following an IND_STATIC
2269 // 2. when the old generation is compacted, the mark phase updates
2270 // from-space pointers to be to-space pointers, and we can't
2271 // reliably tell which we're following (eg. from an IND_STATIC).
2273 // 3. compacting GC again: if we're looking at a constructor in
2274 // the compacted generation, it might point directly to objects
2275 // in to-space. We must bale out here, otherwise doing the selection
2276 // will result in a to-space pointer being returned.
2278 // (1) is dealt with using a BF_EVACUATED test on the
2279 // selectee. (2) and (3): we can tell if we're looking at an
2280 // object in the compacted generation that might point to
2281 // to-space objects by testing that (a) it is BF_COMPACTED, (b)
2282 // the compacted generation is being collected, and (c) the
2283 // object is marked. Only a marked object may have pointers that
2284 // point to to-space objects, because that happens when
2287 // The to-space test is now embodied in the in_to_space() inline
2288 // function, as it is re-used below.
2290 if (is_to_space(selectee)) {
2294 info = get_itbl(selectee);
2295 switch (info->type) {
2303 case CONSTR_NOCAF_STATIC:
2304 // check that the size is in range
2305 ASSERT(field < (StgWord32)(info->layout.payload.ptrs +
2306 info->layout.payload.nptrs));
2308 // Select the right field from the constructor, and check
2309 // that the result isn't in to-space. It might be in
2310 // to-space if, for example, this constructor contains
2311 // pointers to younger-gen objects (and is on the mut-once
2316 q = selectee->payload[field];
2317 if (is_to_space(q)) {
2327 case IND_OLDGEN_PERM:
2329 selectee = ((StgInd *)selectee)->indirectee;
2333 // We don't follow pointers into to-space; the constructor
2334 // has already been evacuated, so we won't save any space
2335 // leaks by evaluating this selector thunk anyhow.
2338 case THUNK_SELECTOR:
2342 // check that we don't recurse too much, re-using the
2343 // depth bound also used in evacuate().
2344 if (thunk_selector_depth >= MAX_THUNK_SELECTOR_DEPTH) {
2347 thunk_selector_depth++;
2349 val = eval_thunk_selector(info->layout.selector_offset,
2350 (StgSelector *)selectee);
2352 thunk_selector_depth--;
2357 // We evaluated this selector thunk, so update it with
2358 // an indirection. NOTE: we don't use UPD_IND here,
2359 // because we are guaranteed that p is in a generation
2360 // that we are collecting, and we never want to put the
2361 // indirection on a mutable list.
2363 // For the purposes of LDV profiling, we have destroyed
2364 // the original selector thunk.
2365 SET_INFO(p, info_ptr);
2366 LDV_RECORD_DEAD_FILL_SLOP_DYNAMIC(selectee);
2368 ((StgInd *)selectee)->indirectee = val;
2369 SET_INFO(selectee,&stg_IND_info);
2371 // For the purposes of LDV profiling, we have created an
2373 LDV_RECORD_CREATE(selectee);
2390 case SE_CAF_BLACKHOLE:
2402 // not evaluated yet
2406 barf("eval_thunk_selector: strange selectee %d",
2411 // We didn't manage to evaluate this thunk; restore the old info pointer
2412 SET_INFO(p, info_ptr);
2416 /* -----------------------------------------------------------------------------
2417 move_TSO is called to update the TSO structure after it has been
2418 moved from one place to another.
2419 -------------------------------------------------------------------------- */
2422 move_TSO (StgTSO *src, StgTSO *dest)
2426 // relocate the stack pointer...
2427 diff = (StgPtr)dest - (StgPtr)src; // In *words*
2428 dest->sp = (StgPtr)dest->sp + diff;
2431 /* Similar to scavenge_large_bitmap(), but we don't write back the
2432 * pointers we get back from evacuate().
2435 scavenge_large_srt_bitmap( StgLargeSRT *large_srt )
2442 bitmap = large_srt->l.bitmap[b];
2443 size = (nat)large_srt->l.size;
2444 p = (StgClosure **)large_srt->srt;
2445 for (i = 0; i < size; ) {
2446 if ((bitmap & 1) != 0) {
2451 if (i % BITS_IN(W_) == 0) {
2453 bitmap = large_srt->l.bitmap[b];
2455 bitmap = bitmap >> 1;
2460 /* evacuate the SRT. If srt_bitmap is zero, then there isn't an
2461 * srt field in the info table. That's ok, because we'll
2462 * never dereference it.
2465 scavenge_srt (StgClosure **srt, nat srt_bitmap)
2470 bitmap = srt_bitmap;
2473 if (bitmap == (StgHalfWord)(-1)) {
2474 scavenge_large_srt_bitmap( (StgLargeSRT *)srt );
2478 while (bitmap != 0) {
2479 if ((bitmap & 1) != 0) {
2480 #ifdef ENABLE_WIN32_DLL_SUPPORT
2481 // Special-case to handle references to closures hiding out in DLLs, since
2482 // double indirections required to get at those. The code generator knows
2483 // which is which when generating the SRT, so it stores the (indirect)
2484 // reference to the DLL closure in the table by first adding one to it.
2485 // We check for this here, and undo the addition before evacuating it.
2487 // If the SRT entry hasn't got bit 0 set, the SRT entry points to a
2488 // closure that's fixed at link-time, and no extra magic is required.
2489 if ( (unsigned long)(*srt) & 0x1 ) {
2490 evacuate(*stgCast(StgClosure**,(stgCast(unsigned long, *srt) & ~0x1)));
2499 bitmap = bitmap >> 1;
2505 scavenge_thunk_srt(const StgInfoTable *info)
2507 StgThunkInfoTable *thunk_info;
2509 if (!major_gc) return;
2511 thunk_info = itbl_to_thunk_itbl(info);
2512 scavenge_srt((StgClosure **)GET_SRT(thunk_info), thunk_info->i.srt_bitmap);
2516 scavenge_fun_srt(const StgInfoTable *info)
2518 StgFunInfoTable *fun_info;
2520 if (!major_gc) return;
2522 fun_info = itbl_to_fun_itbl(info);
2523 scavenge_srt((StgClosure **)GET_FUN_SRT(fun_info), fun_info->i.srt_bitmap);
2526 /* -----------------------------------------------------------------------------
2528 -------------------------------------------------------------------------- */
2531 scavengeTSO (StgTSO *tso)
2533 if ( tso->why_blocked == BlockedOnMVar
2534 || tso->why_blocked == BlockedOnBlackHole
2535 || tso->why_blocked == BlockedOnException
2537 || tso->why_blocked == BlockedOnGA
2538 || tso->why_blocked == BlockedOnGA_NoSend
2541 tso->block_info.closure = evacuate(tso->block_info.closure);
2543 if ( tso->blocked_exceptions != NULL ) {
2544 tso->blocked_exceptions =
2545 (StgTSO *)evacuate((StgClosure *)tso->blocked_exceptions);
2548 // We don't always chase the link field: TSOs on the blackhole
2549 // queue are not automatically alive, so the link field is a
2550 // "weak" pointer in that case.
2551 if (tso->why_blocked != BlockedOnBlackHole) {
2552 tso->link = (StgTSO *)evacuate((StgClosure *)tso->link);
2555 // scavange current transaction record
2556 tso->trec = (StgTRecHeader *)evacuate((StgClosure *)tso->trec);
2558 // scavenge this thread's stack
2559 scavenge_stack(tso->sp, &(tso->stack[tso->stack_size]));
2562 /* -----------------------------------------------------------------------------
2563 Blocks of function args occur on the stack (at the top) and
2565 -------------------------------------------------------------------------- */
2567 STATIC_INLINE StgPtr
2568 scavenge_arg_block (StgFunInfoTable *fun_info, StgClosure **args)
2575 switch (fun_info->f.fun_type) {
2577 bitmap = BITMAP_BITS(fun_info->f.b.bitmap);
2578 size = BITMAP_SIZE(fun_info->f.b.bitmap);
2581 size = GET_FUN_LARGE_BITMAP(fun_info)->size;
2582 scavenge_large_bitmap(p, GET_FUN_LARGE_BITMAP(fun_info), size);
2586 bitmap = BITMAP_BITS(stg_arg_bitmaps[fun_info->f.fun_type]);
2587 size = BITMAP_SIZE(stg_arg_bitmaps[fun_info->f.fun_type]);
2590 if ((bitmap & 1) == 0) {
2591 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
2594 bitmap = bitmap >> 1;
2602 STATIC_INLINE StgPtr
2603 scavenge_PAP_payload (StgClosure *fun, StgClosure **payload, StgWord size)
2607 StgFunInfoTable *fun_info;
2609 fun_info = get_fun_itbl(fun);
2610 ASSERT(fun_info->i.type != PAP);
2611 p = (StgPtr)payload;
2613 switch (fun_info->f.fun_type) {
2615 bitmap = BITMAP_BITS(fun_info->f.b.bitmap);
2618 scavenge_large_bitmap(p, GET_FUN_LARGE_BITMAP(fun_info), size);
2622 scavenge_large_bitmap((StgPtr)payload, BCO_BITMAP(fun), size);
2626 bitmap = BITMAP_BITS(stg_arg_bitmaps[fun_info->f.fun_type]);
2629 if ((bitmap & 1) == 0) {
2630 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
2633 bitmap = bitmap >> 1;
2641 STATIC_INLINE StgPtr
2642 scavenge_PAP (StgPAP *pap)
2644 pap->fun = evacuate(pap->fun);
2645 return scavenge_PAP_payload (pap->fun, pap->payload, pap->n_args);
2648 STATIC_INLINE StgPtr
2649 scavenge_AP (StgAP *ap)
2651 ap->fun = evacuate(ap->fun);
2652 return scavenge_PAP_payload (ap->fun, ap->payload, ap->n_args);
2655 /* -----------------------------------------------------------------------------
2656 Scavenge a given step until there are no more objects in this step
2659 evac_gen is set by the caller to be either zero (for a step in a
2660 generation < N) or G where G is the generation of the step being
2663 We sometimes temporarily change evac_gen back to zero if we're
2664 scavenging a mutable object where early promotion isn't such a good
2666 -------------------------------------------------------------------------- */
2674 nat saved_evac_gen = evac_gen;
2679 failed_to_evac = rtsFalse;
2681 /* scavenge phase - standard breadth-first scavenging of the
2685 while (bd != stp->hp_bd || p < stp->hp) {
2687 // If we're at the end of this block, move on to the next block
2688 if (bd != stp->hp_bd && p == bd->free) {
2694 ASSERT(LOOKS_LIKE_CLOSURE_PTR(p));
2695 info = get_itbl((StgClosure *)p);
2697 ASSERT(thunk_selector_depth == 0);
2700 switch (info->type) {
2704 StgMVar *mvar = ((StgMVar *)p);
2706 mvar->head = (StgTSO *)evacuate((StgClosure *)mvar->head);
2707 mvar->tail = (StgTSO *)evacuate((StgClosure *)mvar->tail);
2708 mvar->value = evacuate((StgClosure *)mvar->value);
2709 evac_gen = saved_evac_gen;
2710 failed_to_evac = rtsTrue; // mutable.
2711 p += sizeofW(StgMVar);
2716 scavenge_fun_srt(info);
2717 ((StgClosure *)p)->payload[1] = evacuate(((StgClosure *)p)->payload[1]);
2718 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2719 p += sizeofW(StgHeader) + 2;
2723 scavenge_thunk_srt(info);
2724 ((StgThunk *)p)->payload[1] = evacuate(((StgThunk *)p)->payload[1]);
2725 ((StgThunk *)p)->payload[0] = evacuate(((StgThunk *)p)->payload[0]);
2726 p += sizeofW(StgThunk) + 2;
2730 ((StgClosure *)p)->payload[1] = evacuate(((StgClosure *)p)->payload[1]);
2731 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2732 p += sizeofW(StgHeader) + 2;
2736 scavenge_thunk_srt(info);
2737 ((StgThunk *)p)->payload[0] = evacuate(((StgThunk *)p)->payload[0]);
2738 p += sizeofW(StgThunk) + 1;
2742 scavenge_fun_srt(info);
2744 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2745 p += sizeofW(StgHeader) + 1;
2749 scavenge_thunk_srt(info);
2750 p += sizeofW(StgThunk) + 1;
2754 scavenge_fun_srt(info);
2756 p += sizeofW(StgHeader) + 1;
2760 scavenge_thunk_srt(info);
2761 p += sizeofW(StgThunk) + 2;
2765 scavenge_fun_srt(info);
2767 p += sizeofW(StgHeader) + 2;
2771 scavenge_thunk_srt(info);
2772 ((StgThunk *)p)->payload[0] = evacuate(((StgThunk *)p)->payload[0]);
2773 p += sizeofW(StgThunk) + 2;
2777 scavenge_fun_srt(info);
2779 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2780 p += sizeofW(StgHeader) + 2;
2784 scavenge_fun_srt(info);
2791 scavenge_thunk_srt(info);
2792 end = (P_)((StgThunk *)p)->payload + info->layout.payload.ptrs;
2793 for (p = (P_)((StgThunk *)p)->payload; p < end; p++) {
2794 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
2796 p += info->layout.payload.nptrs;
2807 end = (P_)((StgClosure *)p)->payload + info->layout.payload.ptrs;
2808 for (p = (P_)((StgClosure *)p)->payload; p < end; p++) {
2809 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
2811 p += info->layout.payload.nptrs;
2816 StgBCO *bco = (StgBCO *)p;
2817 bco->instrs = (StgArrWords *)evacuate((StgClosure *)bco->instrs);
2818 bco->literals = (StgArrWords *)evacuate((StgClosure *)bco->literals);
2819 bco->ptrs = (StgMutArrPtrs *)evacuate((StgClosure *)bco->ptrs);
2820 bco->itbls = (StgArrWords *)evacuate((StgClosure *)bco->itbls);
2821 p += bco_sizeW(bco);
2826 if (stp->gen->no != 0) {
2829 // No need to call LDV_recordDead_FILL_SLOP_DYNAMIC() because an
2830 // IND_OLDGEN_PERM closure is larger than an IND_PERM closure.
2831 LDV_recordDead((StgClosure *)p, sizeofW(StgInd));
2834 // Todo: maybe use SET_HDR() and remove LDV_RECORD_CREATE()?
2836 SET_INFO(((StgClosure *)p), &stg_IND_OLDGEN_PERM_info);
2838 // We pretend that p has just been created.
2839 LDV_RECORD_CREATE((StgClosure *)p);
2842 case IND_OLDGEN_PERM:
2843 ((StgInd *)p)->indirectee = evacuate(((StgInd *)p)->indirectee);
2844 p += sizeofW(StgInd);
2849 ((StgMutVar *)p)->var = evacuate(((StgMutVar *)p)->var);
2850 evac_gen = saved_evac_gen;
2851 failed_to_evac = rtsTrue; // mutable anyhow
2852 p += sizeofW(StgMutVar);
2856 case SE_CAF_BLACKHOLE:
2859 p += BLACKHOLE_sizeW();
2862 case THUNK_SELECTOR:
2864 StgSelector *s = (StgSelector *)p;
2865 s->selectee = evacuate(s->selectee);
2866 p += THUNK_SELECTOR_sizeW();
2870 // A chunk of stack saved in a heap object
2873 StgAP_STACK *ap = (StgAP_STACK *)p;
2875 ap->fun = evacuate(ap->fun);
2876 scavenge_stack((StgPtr)ap->payload, (StgPtr)ap->payload + ap->size);
2877 p = (StgPtr)ap->payload + ap->size;
2882 p = scavenge_PAP((StgPAP *)p);
2886 p = scavenge_AP((StgAP *)p);
2890 // nothing to follow
2891 p += arr_words_sizeW((StgArrWords *)p);
2895 // follow everything
2899 evac_gen = 0; // repeatedly mutable
2900 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2901 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2902 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
2904 evac_gen = saved_evac_gen;
2905 failed_to_evac = rtsTrue; // mutable anyhow.
2909 case MUT_ARR_PTRS_FROZEN:
2910 case MUT_ARR_PTRS_FROZEN0:
2911 // follow everything
2915 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2916 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2917 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
2919 // it's tempting to recordMutable() if failed_to_evac is
2920 // false, but that breaks some assumptions (eg. every
2921 // closure on the mutable list is supposed to have the MUT
2922 // flag set, and MUT_ARR_PTRS_FROZEN doesn't).
2928 StgTSO *tso = (StgTSO *)p;
2931 evac_gen = saved_evac_gen;
2932 failed_to_evac = rtsTrue; // mutable anyhow.
2933 p += tso_sizeW(tso);
2941 nat size, ptrs, nonptrs, vhs;
2943 StgInfoTable *rip = get_closure_info(p, &size, &ptrs, &nonptrs, &vhs, str);
2945 StgRBH *rbh = (StgRBH *)p;
2946 (StgClosure *)rbh->blocking_queue =
2947 evacuate((StgClosure *)rbh->blocking_queue);
2948 failed_to_evac = rtsTrue; // mutable anyhow.
2950 debugBelch("@@ scavenge: RBH %p (%s) (new blocking_queue link=%p)",
2951 p, info_type(p), (StgClosure *)rbh->blocking_queue));
2952 // ToDo: use size of reverted closure here!
2953 p += BLACKHOLE_sizeW();
2959 StgBlockedFetch *bf = (StgBlockedFetch *)p;
2960 // follow the pointer to the node which is being demanded
2961 (StgClosure *)bf->node =
2962 evacuate((StgClosure *)bf->node);
2963 // follow the link to the rest of the blocking queue
2964 (StgClosure *)bf->link =
2965 evacuate((StgClosure *)bf->link);
2967 debugBelch("@@ scavenge: %p (%s); node is now %p; exciting, isn't it",
2968 bf, info_type((StgClosure *)bf),
2969 bf->node, info_type(bf->node)));
2970 p += sizeofW(StgBlockedFetch);
2978 p += sizeofW(StgFetchMe);
2979 break; // nothing to do in this case
2983 StgFetchMeBlockingQueue *fmbq = (StgFetchMeBlockingQueue *)p;
2984 (StgClosure *)fmbq->blocking_queue =
2985 evacuate((StgClosure *)fmbq->blocking_queue);
2987 debugBelch("@@ scavenge: %p (%s) exciting, isn't it",
2988 p, info_type((StgClosure *)p)));
2989 p += sizeofW(StgFetchMeBlockingQueue);
2994 case TVAR_WAIT_QUEUE:
2996 StgTVarWaitQueue *wq = ((StgTVarWaitQueue *) p);
2998 wq->waiting_tso = (StgTSO *)evacuate((StgClosure*)wq->waiting_tso);
2999 wq->next_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)wq->next_queue_entry);
3000 wq->prev_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)wq->prev_queue_entry);
3001 evac_gen = saved_evac_gen;
3002 failed_to_evac = rtsTrue; // mutable
3003 p += sizeofW(StgTVarWaitQueue);
3009 StgTVar *tvar = ((StgTVar *) p);
3011 tvar->current_value = evacuate((StgClosure*)tvar->current_value);
3012 tvar->first_wait_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)tvar->first_wait_queue_entry);
3014 tvar->last_update_by = (StgTRecHeader *)evacuate((StgClosure*)tvar->last_update_by);
3016 evac_gen = saved_evac_gen;
3017 failed_to_evac = rtsTrue; // mutable
3018 p += sizeofW(StgTVar);
3024 StgTRecHeader *trec = ((StgTRecHeader *) p);
3026 trec->enclosing_trec = (StgTRecHeader *)evacuate((StgClosure*)trec->enclosing_trec);
3027 trec->current_chunk = (StgTRecChunk *)evacuate((StgClosure*)trec->current_chunk);
3028 evac_gen = saved_evac_gen;
3029 failed_to_evac = rtsTrue; // mutable
3030 p += sizeofW(StgTRecHeader);
3037 StgTRecChunk *tc = ((StgTRecChunk *) p);
3038 TRecEntry *e = &(tc -> entries[0]);
3040 tc->prev_chunk = (StgTRecChunk *)evacuate((StgClosure*)tc->prev_chunk);
3041 for (i = 0; i < tc -> next_entry_idx; i ++, e++ ) {
3042 e->tvar = (StgTVar *)evacuate((StgClosure*)e->tvar);
3043 e->expected_value = evacuate((StgClosure*)e->expected_value);
3044 e->new_value = evacuate((StgClosure*)e->new_value);
3046 evac_gen = saved_evac_gen;
3047 failed_to_evac = rtsTrue; // mutable
3048 p += sizeofW(StgTRecChunk);
3053 barf("scavenge: unimplemented/strange closure type %d @ %p",
3058 * We need to record the current object on the mutable list if
3059 * (a) It is actually mutable, or
3060 * (b) It contains pointers to a younger generation.
3061 * Case (b) arises if we didn't manage to promote everything that
3062 * the current object points to into the current generation.
3064 if (failed_to_evac) {
3065 failed_to_evac = rtsFalse;
3066 recordMutableGen((StgClosure *)q, stp->gen);
3074 /* -----------------------------------------------------------------------------
3075 Scavenge everything on the mark stack.
3077 This is slightly different from scavenge():
3078 - we don't walk linearly through the objects, so the scavenger
3079 doesn't need to advance the pointer on to the next object.
3080 -------------------------------------------------------------------------- */
3083 scavenge_mark_stack(void)
3089 evac_gen = oldest_gen->no;
3090 saved_evac_gen = evac_gen;
3093 while (!mark_stack_empty()) {
3094 p = pop_mark_stack();
3096 ASSERT(LOOKS_LIKE_CLOSURE_PTR(p));
3097 info = get_itbl((StgClosure *)p);
3100 switch (info->type) {
3104 StgMVar *mvar = ((StgMVar *)p);
3106 mvar->head = (StgTSO *)evacuate((StgClosure *)mvar->head);
3107 mvar->tail = (StgTSO *)evacuate((StgClosure *)mvar->tail);
3108 mvar->value = evacuate((StgClosure *)mvar->value);
3109 evac_gen = saved_evac_gen;
3110 failed_to_evac = rtsTrue; // mutable.
3115 scavenge_fun_srt(info);
3116 ((StgClosure *)p)->payload[1] = evacuate(((StgClosure *)p)->payload[1]);
3117 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
3121 scavenge_thunk_srt(info);
3122 ((StgThunk *)p)->payload[1] = evacuate(((StgThunk *)p)->payload[1]);
3123 ((StgThunk *)p)->payload[0] = evacuate(((StgThunk *)p)->payload[0]);
3127 ((StgClosure *)p)->payload[1] = evacuate(((StgClosure *)p)->payload[1]);
3128 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
3133 scavenge_fun_srt(info);
3134 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
3139 scavenge_thunk_srt(info);
3140 ((StgThunk *)p)->payload[0] = evacuate(((StgThunk *)p)->payload[0]);
3145 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
3150 scavenge_fun_srt(info);
3155 scavenge_thunk_srt(info);
3163 scavenge_fun_srt(info);
3170 scavenge_thunk_srt(info);
3171 end = (P_)((StgThunk *)p)->payload + info->layout.payload.ptrs;
3172 for (p = (P_)((StgThunk *)p)->payload; p < end; p++) {
3173 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3185 end = (P_)((StgClosure *)p)->payload + info->layout.payload.ptrs;
3186 for (p = (P_)((StgClosure *)p)->payload; p < end; p++) {
3187 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3193 StgBCO *bco = (StgBCO *)p;
3194 bco->instrs = (StgArrWords *)evacuate((StgClosure *)bco->instrs);
3195 bco->literals = (StgArrWords *)evacuate((StgClosure *)bco->literals);
3196 bco->ptrs = (StgMutArrPtrs *)evacuate((StgClosure *)bco->ptrs);
3197 bco->itbls = (StgArrWords *)evacuate((StgClosure *)bco->itbls);
3202 // don't need to do anything here: the only possible case
3203 // is that we're in a 1-space compacting collector, with
3204 // no "old" generation.
3208 case IND_OLDGEN_PERM:
3209 ((StgInd *)p)->indirectee =
3210 evacuate(((StgInd *)p)->indirectee);
3215 ((StgMutVar *)p)->var = evacuate(((StgMutVar *)p)->var);
3216 evac_gen = saved_evac_gen;
3217 failed_to_evac = rtsTrue;
3221 case SE_CAF_BLACKHOLE:
3227 case THUNK_SELECTOR:
3229 StgSelector *s = (StgSelector *)p;
3230 s->selectee = evacuate(s->selectee);
3234 // A chunk of stack saved in a heap object
3237 StgAP_STACK *ap = (StgAP_STACK *)p;
3239 ap->fun = evacuate(ap->fun);
3240 scavenge_stack((StgPtr)ap->payload, (StgPtr)ap->payload + ap->size);
3245 scavenge_PAP((StgPAP *)p);
3249 scavenge_AP((StgAP *)p);
3253 // follow everything
3257 evac_gen = 0; // repeatedly mutable
3258 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
3259 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
3260 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3262 evac_gen = saved_evac_gen;
3263 failed_to_evac = rtsTrue; // mutable anyhow.
3267 case MUT_ARR_PTRS_FROZEN:
3268 case MUT_ARR_PTRS_FROZEN0:
3269 // follow everything
3273 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
3274 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
3275 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3282 StgTSO *tso = (StgTSO *)p;
3285 evac_gen = saved_evac_gen;
3286 failed_to_evac = rtsTrue;
3294 nat size, ptrs, nonptrs, vhs;
3296 StgInfoTable *rip = get_closure_info(p, &size, &ptrs, &nonptrs, &vhs, str);
3298 StgRBH *rbh = (StgRBH *)p;
3299 bh->blocking_queue =
3300 (StgTSO *)evacuate((StgClosure *)bh->blocking_queue);
3301 failed_to_evac = rtsTrue; // mutable anyhow.
3303 debugBelch("@@ scavenge: RBH %p (%s) (new blocking_queue link=%p)",
3304 p, info_type(p), (StgClosure *)rbh->blocking_queue));
3310 StgBlockedFetch *bf = (StgBlockedFetch *)p;
3311 // follow the pointer to the node which is being demanded
3312 (StgClosure *)bf->node =
3313 evacuate((StgClosure *)bf->node);
3314 // follow the link to the rest of the blocking queue
3315 (StgClosure *)bf->link =
3316 evacuate((StgClosure *)bf->link);
3318 debugBelch("@@ scavenge: %p (%s); node is now %p; exciting, isn't it",
3319 bf, info_type((StgClosure *)bf),
3320 bf->node, info_type(bf->node)));
3328 break; // nothing to do in this case
3332 StgFetchMeBlockingQueue *fmbq = (StgFetchMeBlockingQueue *)p;
3333 (StgClosure *)fmbq->blocking_queue =
3334 evacuate((StgClosure *)fmbq->blocking_queue);
3336 debugBelch("@@ scavenge: %p (%s) exciting, isn't it",
3337 p, info_type((StgClosure *)p)));
3342 case TVAR_WAIT_QUEUE:
3344 StgTVarWaitQueue *wq = ((StgTVarWaitQueue *) p);
3346 wq->waiting_tso = (StgTSO *)evacuate((StgClosure*)wq->waiting_tso);
3347 wq->next_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)wq->next_queue_entry);
3348 wq->prev_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)wq->prev_queue_entry);
3349 evac_gen = saved_evac_gen;
3350 failed_to_evac = rtsTrue; // mutable
3356 StgTVar *tvar = ((StgTVar *) p);
3358 tvar->current_value = evacuate((StgClosure*)tvar->current_value);
3359 tvar->first_wait_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)tvar->first_wait_queue_entry);
3361 tvar->last_update_by = (StgTRecHeader *)evacuate((StgClosure*)tvar->last_update_by);
3363 evac_gen = saved_evac_gen;
3364 failed_to_evac = rtsTrue; // mutable
3371 StgTRecChunk *tc = ((StgTRecChunk *) p);
3372 TRecEntry *e = &(tc -> entries[0]);
3374 tc->prev_chunk = (StgTRecChunk *)evacuate((StgClosure*)tc->prev_chunk);
3375 for (i = 0; i < tc -> next_entry_idx; i ++, e++ ) {
3376 e->tvar = (StgTVar *)evacuate((StgClosure*)e->tvar);
3377 e->expected_value = evacuate((StgClosure*)e->expected_value);
3378 e->new_value = evacuate((StgClosure*)e->new_value);
3380 evac_gen = saved_evac_gen;
3381 failed_to_evac = rtsTrue; // mutable
3387 StgTRecHeader *trec = ((StgTRecHeader *) p);
3389 trec->enclosing_trec = (StgTRecHeader *)evacuate((StgClosure*)trec->enclosing_trec);
3390 trec->current_chunk = (StgTRecChunk *)evacuate((StgClosure*)trec->current_chunk);
3391 evac_gen = saved_evac_gen;
3392 failed_to_evac = rtsTrue; // mutable
3397 barf("scavenge_mark_stack: unimplemented/strange closure type %d @ %p",
3401 if (failed_to_evac) {
3402 failed_to_evac = rtsFalse;
3403 recordMutableGen((StgClosure *)q, &generations[evac_gen]);
3406 // mark the next bit to indicate "scavenged"
3407 mark(q+1, Bdescr(q));
3409 } // while (!mark_stack_empty())
3411 // start a new linear scan if the mark stack overflowed at some point
3412 if (mark_stack_overflowed && oldgen_scan_bd == NULL) {
3413 IF_DEBUG(gc, debugBelch("scavenge_mark_stack: starting linear scan"));
3414 mark_stack_overflowed = rtsFalse;
3415 oldgen_scan_bd = oldest_gen->steps[0].blocks;
3416 oldgen_scan = oldgen_scan_bd->start;
3419 if (oldgen_scan_bd) {
3420 // push a new thing on the mark stack
3422 // find a closure that is marked but not scavenged, and start
3424 while (oldgen_scan < oldgen_scan_bd->free
3425 && !is_marked(oldgen_scan,oldgen_scan_bd)) {
3429 if (oldgen_scan < oldgen_scan_bd->free) {
3431 // already scavenged?
3432 if (is_marked(oldgen_scan+1,oldgen_scan_bd)) {
3433 oldgen_scan += sizeofW(StgHeader) + MIN_NONUPD_SIZE;
3436 push_mark_stack(oldgen_scan);
3437 // ToDo: bump the linear scan by the actual size of the object
3438 oldgen_scan += sizeofW(StgHeader) + MIN_NONUPD_SIZE;
3442 oldgen_scan_bd = oldgen_scan_bd->link;
3443 if (oldgen_scan_bd != NULL) {
3444 oldgen_scan = oldgen_scan_bd->start;
3450 /* -----------------------------------------------------------------------------
3451 Scavenge one object.
3453 This is used for objects that are temporarily marked as mutable
3454 because they contain old-to-new generation pointers. Only certain
3455 objects can have this property.
3456 -------------------------------------------------------------------------- */
3459 scavenge_one(StgPtr p)
3461 const StgInfoTable *info;
3462 nat saved_evac_gen = evac_gen;
3465 ASSERT(LOOKS_LIKE_CLOSURE_PTR(p));
3466 info = get_itbl((StgClosure *)p);
3468 switch (info->type) {
3472 StgMVar *mvar = ((StgMVar *)p);
3474 mvar->head = (StgTSO *)evacuate((StgClosure *)mvar->head);
3475 mvar->tail = (StgTSO *)evacuate((StgClosure *)mvar->tail);
3476 mvar->value = evacuate((StgClosure *)mvar->value);
3477 evac_gen = saved_evac_gen;
3478 failed_to_evac = rtsTrue; // mutable.
3491 end = (StgPtr)((StgThunk *)p)->payload + info->layout.payload.ptrs;
3492 for (q = (StgPtr)((StgThunk *)p)->payload; q < end; q++) {
3493 *q = (StgWord)(StgPtr)evacuate((StgClosure *)*q);
3499 case FUN_1_0: // hardly worth specialising these guys
3515 end = (StgPtr)((StgClosure *)p)->payload + info->layout.payload.ptrs;
3516 for (q = (StgPtr)((StgClosure *)p)->payload; q < end; q++) {
3517 *q = (StgWord)(StgPtr)evacuate((StgClosure *)*q);
3524 ((StgMutVar *)p)->var = evacuate(((StgMutVar *)p)->var);
3525 evac_gen = saved_evac_gen;
3526 failed_to_evac = rtsTrue; // mutable anyhow
3530 case SE_CAF_BLACKHOLE:
3535 case THUNK_SELECTOR:
3537 StgSelector *s = (StgSelector *)p;
3538 s->selectee = evacuate(s->selectee);
3544 StgAP_STACK *ap = (StgAP_STACK *)p;
3546 ap->fun = evacuate(ap->fun);
3547 scavenge_stack((StgPtr)ap->payload, (StgPtr)ap->payload + ap->size);
3548 p = (StgPtr)ap->payload + ap->size;
3553 p = scavenge_PAP((StgPAP *)p);
3557 p = scavenge_AP((StgAP *)p);
3561 // nothing to follow
3566 // follow everything
3569 evac_gen = 0; // repeatedly mutable
3570 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
3571 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
3572 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3574 evac_gen = saved_evac_gen;
3575 failed_to_evac = rtsTrue;
3579 case MUT_ARR_PTRS_FROZEN:
3580 case MUT_ARR_PTRS_FROZEN0:
3582 // follow everything
3585 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
3586 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
3587 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3594 StgTSO *tso = (StgTSO *)p;
3596 evac_gen = 0; // repeatedly mutable
3598 evac_gen = saved_evac_gen;
3599 failed_to_evac = rtsTrue;
3607 nat size, ptrs, nonptrs, vhs;
3609 StgInfoTable *rip = get_closure_info(p, &size, &ptrs, &nonptrs, &vhs, str);
3611 StgRBH *rbh = (StgRBH *)p;
3612 (StgClosure *)rbh->blocking_queue =
3613 evacuate((StgClosure *)rbh->blocking_queue);
3614 failed_to_evac = rtsTrue; // mutable anyhow.
3616 debugBelch("@@ scavenge: RBH %p (%s) (new blocking_queue link=%p)",
3617 p, info_type(p), (StgClosure *)rbh->blocking_queue));
3618 // ToDo: use size of reverted closure here!
3624 StgBlockedFetch *bf = (StgBlockedFetch *)p;
3625 // follow the pointer to the node which is being demanded
3626 (StgClosure *)bf->node =
3627 evacuate((StgClosure *)bf->node);
3628 // follow the link to the rest of the blocking queue
3629 (StgClosure *)bf->link =
3630 evacuate((StgClosure *)bf->link);
3632 debugBelch("@@ scavenge: %p (%s); node is now %p; exciting, isn't it",
3633 bf, info_type((StgClosure *)bf),
3634 bf->node, info_type(bf->node)));
3642 break; // nothing to do in this case
3646 StgFetchMeBlockingQueue *fmbq = (StgFetchMeBlockingQueue *)p;
3647 (StgClosure *)fmbq->blocking_queue =
3648 evacuate((StgClosure *)fmbq->blocking_queue);
3650 debugBelch("@@ scavenge: %p (%s) exciting, isn't it",
3651 p, info_type((StgClosure *)p)));
3656 case TVAR_WAIT_QUEUE:
3658 StgTVarWaitQueue *wq = ((StgTVarWaitQueue *) p);
3660 wq->waiting_tso = (StgTSO *)evacuate((StgClosure*)wq->waiting_tso);
3661 wq->next_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)wq->next_queue_entry);
3662 wq->prev_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)wq->prev_queue_entry);
3663 evac_gen = saved_evac_gen;
3664 failed_to_evac = rtsTrue; // mutable
3670 StgTVar *tvar = ((StgTVar *) p);
3672 tvar->current_value = evacuate((StgClosure*)tvar->current_value);
3673 tvar->first_wait_queue_entry = (StgTVarWaitQueue *)evacuate((StgClosure*)tvar->first_wait_queue_entry);
3675 tvar->last_update_by = (StgTRecHeader *)evacuate((StgClosure*)tvar->last_update_by);
3677 evac_gen = saved_evac_gen;
3678 failed_to_evac = rtsTrue; // mutable
3684 StgTRecHeader *trec = ((StgTRecHeader *) p);
3686 trec->enclosing_trec = (StgTRecHeader *)evacuate((StgClosure*)trec->enclosing_trec);
3687 trec->current_chunk = (StgTRecChunk *)evacuate((StgClosure*)trec->current_chunk);
3688 evac_gen = saved_evac_gen;
3689 failed_to_evac = rtsTrue; // mutable
3696 StgTRecChunk *tc = ((StgTRecChunk *) p);
3697 TRecEntry *e = &(tc -> entries[0]);
3699 tc->prev_chunk = (StgTRecChunk *)evacuate((StgClosure*)tc->prev_chunk);
3700 for (i = 0; i < tc -> next_entry_idx; i ++, e++ ) {
3701 e->tvar = (StgTVar *)evacuate((StgClosure*)e->tvar);
3702 e->expected_value = evacuate((StgClosure*)e->expected_value);
3703 e->new_value = evacuate((StgClosure*)e->new_value);
3705 evac_gen = saved_evac_gen;
3706 failed_to_evac = rtsTrue; // mutable
3711 case IND_OLDGEN_PERM:
3714 /* Careful here: a THUNK can be on the mutable list because
3715 * it contains pointers to young gen objects. If such a thunk
3716 * is updated, the IND_OLDGEN will be added to the mutable
3717 * list again, and we'll scavenge it twice. evacuate()
3718 * doesn't check whether the object has already been
3719 * evacuated, so we perform that check here.
3721 StgClosure *q = ((StgInd *)p)->indirectee;
3722 if (HEAP_ALLOCED(q) && Bdescr((StgPtr)q)->flags & BF_EVACUATED) {
3725 ((StgInd *)p)->indirectee = evacuate(q);
3728 #if 0 && defined(DEBUG)
3729 if (RtsFlags.DebugFlags.gc)
3730 /* Debugging code to print out the size of the thing we just
3734 StgPtr start = gen->steps[0].scan;
3735 bdescr *start_bd = gen->steps[0].scan_bd;
3737 scavenge(&gen->steps[0]);
3738 if (start_bd != gen->steps[0].scan_bd) {
3739 size += (P_)BLOCK_ROUND_UP(start) - start;
3740 start_bd = start_bd->link;
3741 while (start_bd != gen->steps[0].scan_bd) {
3742 size += BLOCK_SIZE_W;
3743 start_bd = start_bd->link;
3745 size += gen->steps[0].scan -
3746 (P_)BLOCK_ROUND_DOWN(gen->steps[0].scan);
3748 size = gen->steps[0].scan - start;
3750 debugBelch("evac IND_OLDGEN: %ld bytes", size * sizeof(W_));
3756 barf("scavenge_one: strange object %d", (int)(info->type));
3759 no_luck = failed_to_evac;
3760 failed_to_evac = rtsFalse;
3764 /* -----------------------------------------------------------------------------
3765 Scavenging mutable lists.
3767 We treat the mutable list of each generation > N (i.e. all the
3768 generations older than the one being collected) as roots. We also
3769 remove non-mutable objects from the mutable list at this point.
3770 -------------------------------------------------------------------------- */
3773 scavenge_mutable_list(generation *gen)
3778 bd = gen->saved_mut_list;
3781 for (; bd != NULL; bd = bd->link) {
3782 for (q = bd->start; q < bd->free; q++) {
3784 ASSERT(LOOKS_LIKE_CLOSURE_PTR(p));
3785 if (scavenge_one(p)) {
3786 /* didn't manage to promote everything, so put the
3787 * object back on the list.
3789 recordMutableGen((StgClosure *)p,gen);
3794 // free the old mut_list
3795 freeChain(gen->saved_mut_list);
3796 gen->saved_mut_list = NULL;
3801 scavenge_static(void)
3803 StgClosure* p = static_objects;
3804 const StgInfoTable *info;
3806 /* Always evacuate straight to the oldest generation for static
3808 evac_gen = oldest_gen->no;
3810 /* keep going until we've scavenged all the objects on the linked
3812 while (p != END_OF_STATIC_LIST) {
3814 ASSERT(LOOKS_LIKE_CLOSURE_PTR(p));
3817 if (info->type==RBH)
3818 info = REVERT_INFOPTR(info); // if it's an RBH, look at the orig closure
3820 // make sure the info pointer is into text space
3822 /* Take this object *off* the static_objects list,
3823 * and put it on the scavenged_static_objects list.
3825 static_objects = *STATIC_LINK(info,p);
3826 *STATIC_LINK(info,p) = scavenged_static_objects;
3827 scavenged_static_objects = p;
3829 switch (info -> type) {
3833 StgInd *ind = (StgInd *)p;
3834 ind->indirectee = evacuate(ind->indirectee);
3836 /* might fail to evacuate it, in which case we have to pop it
3837 * back on the mutable list of the oldest generation. We
3838 * leave it *on* the scavenged_static_objects list, though,
3839 * in case we visit this object again.
3841 if (failed_to_evac) {
3842 failed_to_evac = rtsFalse;
3843 recordMutableGen((StgClosure *)p,oldest_gen);
3849 scavenge_thunk_srt(info);
3853 scavenge_fun_srt(info);
3860 next = (P_)p->payload + info->layout.payload.ptrs;
3861 // evacuate the pointers
3862 for (q = (P_)p->payload; q < next; q++) {
3863 *q = (StgWord)(StgPtr)evacuate((StgClosure *)*q);
3869 barf("scavenge_static: strange closure %d", (int)(info->type));
3872 ASSERT(failed_to_evac == rtsFalse);
3874 /* get the next static object from the list. Remember, there might
3875 * be more stuff on this list now that we've done some evacuating!
3876 * (static_objects is a global)
3882 /* -----------------------------------------------------------------------------
3883 scavenge a chunk of memory described by a bitmap
3884 -------------------------------------------------------------------------- */
3887 scavenge_large_bitmap( StgPtr p, StgLargeBitmap *large_bitmap, nat size )
3893 bitmap = large_bitmap->bitmap[b];
3894 for (i = 0; i < size; ) {
3895 if ((bitmap & 1) == 0) {
3896 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3900 if (i % BITS_IN(W_) == 0) {
3902 bitmap = large_bitmap->bitmap[b];
3904 bitmap = bitmap >> 1;
3909 STATIC_INLINE StgPtr
3910 scavenge_small_bitmap (StgPtr p, nat size, StgWord bitmap)
3913 if ((bitmap & 1) == 0) {
3914 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3917 bitmap = bitmap >> 1;
3923 /* -----------------------------------------------------------------------------
3924 scavenge_stack walks over a section of stack and evacuates all the
3925 objects pointed to by it. We can use the same code for walking
3926 AP_STACK_UPDs, since these are just sections of copied stack.
3927 -------------------------------------------------------------------------- */
3931 scavenge_stack(StgPtr p, StgPtr stack_end)
3933 const StgRetInfoTable* info;
3937 //IF_DEBUG(sanity, debugBelch(" scavenging stack between %p and %p", p, stack_end));
3940 * Each time around this loop, we are looking at a chunk of stack
3941 * that starts with an activation record.
3944 while (p < stack_end) {
3945 info = get_ret_itbl((StgClosure *)p);
3947 switch (info->i.type) {
3950 ((StgUpdateFrame *)p)->updatee
3951 = evacuate(((StgUpdateFrame *)p)->updatee);
3952 p += sizeofW(StgUpdateFrame);
3955 // small bitmap (< 32 entries, or 64 on a 64-bit machine)
3956 case CATCH_STM_FRAME:
3957 case CATCH_RETRY_FRAME:
3958 case ATOMICALLY_FRAME:
3963 bitmap = BITMAP_BITS(info->i.layout.bitmap);
3964 size = BITMAP_SIZE(info->i.layout.bitmap);
3965 // NOTE: the payload starts immediately after the info-ptr, we
3966 // don't have an StgHeader in the same sense as a heap closure.
3968 p = scavenge_small_bitmap(p, size, bitmap);
3972 scavenge_srt((StgClosure **)GET_SRT(info), info->i.srt_bitmap);
3980 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
3983 size = BCO_BITMAP_SIZE(bco);
3984 scavenge_large_bitmap(p, BCO_BITMAP(bco), size);
3989 // large bitmap (> 32 entries, or > 64 on a 64-bit machine)
3995 size = GET_LARGE_BITMAP(&info->i)->size;
3997 scavenge_large_bitmap(p, GET_LARGE_BITMAP(&info->i), size);
3999 // and don't forget to follow the SRT
4003 // Dynamic bitmap: the mask is stored on the stack, and
4004 // there are a number of non-pointers followed by a number
4005 // of pointers above the bitmapped area. (see StgMacros.h,
4010 dyn = ((StgRetDyn *)p)->liveness;
4012 // traverse the bitmap first
4013 bitmap = RET_DYN_LIVENESS(dyn);
4014 p = (P_)&((StgRetDyn *)p)->payload[0];
4015 size = RET_DYN_BITMAP_SIZE;
4016 p = scavenge_small_bitmap(p, size, bitmap);
4018 // skip over the non-ptr words
4019 p += RET_DYN_NONPTRS(dyn) + RET_DYN_NONPTR_REGS_SIZE;
4021 // follow the ptr words
4022 for (size = RET_DYN_PTRS(dyn); size > 0; size--) {
4023 *p = (StgWord)(StgPtr)evacuate((StgClosure *)*p);
4031 StgRetFun *ret_fun = (StgRetFun *)p;
4032 StgFunInfoTable *fun_info;
4034 ret_fun->fun = evacuate(ret_fun->fun);
4035 fun_info = get_fun_itbl(ret_fun->fun);
4036 p = scavenge_arg_block(fun_info, ret_fun->payload);
4041 barf("scavenge_stack: weird activation record found on stack: %d", (int)(info->i.type));
4046 /*-----------------------------------------------------------------------------
4047 scavenge the large object list.
4049 evac_gen set by caller; similar games played with evac_gen as with
4050 scavenge() - see comment at the top of scavenge(). Most large
4051 objects are (repeatedly) mutable, so most of the time evac_gen will
4053 --------------------------------------------------------------------------- */
4056 scavenge_large(step *stp)
4061 bd = stp->new_large_objects;
4063 for (; bd != NULL; bd = stp->new_large_objects) {
4065 /* take this object *off* the large objects list and put it on
4066 * the scavenged large objects list. This is so that we can
4067 * treat new_large_objects as a stack and push new objects on
4068 * the front when evacuating.
4070 stp->new_large_objects = bd->link;
4071 dbl_link_onto(bd, &stp->scavenged_large_objects);
4073 // update the block count in this step.
4074 stp->n_scavenged_large_blocks += bd->blocks;
4077 if (scavenge_one(p)) {
4078 recordMutableGen((StgClosure *)p, stp->gen);
4083 /* -----------------------------------------------------------------------------
4084 Initialising the static object & mutable lists
4085 -------------------------------------------------------------------------- */
4088 zero_static_object_list(StgClosure* first_static)
4092 const StgInfoTable *info;
4094 for (p = first_static; p != END_OF_STATIC_LIST; p = link) {
4096 link = *STATIC_LINK(info, p);
4097 *STATIC_LINK(info,p) = NULL;
4101 /* -----------------------------------------------------------------------------
4103 -------------------------------------------------------------------------- */
4110 for (c = (StgIndStatic *)revertible_caf_list; c != NULL;
4111 c = (StgIndStatic *)c->static_link)
4113 SET_INFO(c, c->saved_info);
4114 c->saved_info = NULL;
4115 // could, but not necessary: c->static_link = NULL;
4117 revertible_caf_list = NULL;
4121 markCAFs( evac_fn evac )
4125 for (c = (StgIndStatic *)caf_list; c != NULL;
4126 c = (StgIndStatic *)c->static_link)
4128 evac(&c->indirectee);
4130 for (c = (StgIndStatic *)revertible_caf_list; c != NULL;
4131 c = (StgIndStatic *)c->static_link)
4133 evac(&c->indirectee);
4137 /* -----------------------------------------------------------------------------
4138 Sanity code for CAF garbage collection.
4140 With DEBUG turned on, we manage a CAF list in addition to the SRT
4141 mechanism. After GC, we run down the CAF list and blackhole any
4142 CAFs which have been garbage collected. This means we get an error
4143 whenever the program tries to enter a garbage collected CAF.
4145 Any garbage collected CAFs are taken off the CAF list at the same
4147 -------------------------------------------------------------------------- */
4149 #if 0 && defined(DEBUG)
4156 const StgInfoTable *info;
4167 ASSERT(info->type == IND_STATIC);
4169 if (STATIC_LINK(info,p) == NULL) {
4170 IF_DEBUG(gccafs, debugBelch("CAF gc'd at 0x%04lx", (long)p));
4172 SET_INFO(p,&stg_BLACKHOLE_info);
4173 p = STATIC_LINK2(info,p);
4177 pp = &STATIC_LINK2(info,p);
4184 // debugBelch("%d CAFs live", i);
4189 /* -----------------------------------------------------------------------------
4192 Whenever a thread returns to the scheduler after possibly doing
4193 some work, we have to run down the stack and black-hole all the
4194 closures referred to by update frames.
4195 -------------------------------------------------------------------------- */
4198 threadLazyBlackHole(StgTSO *tso)
4201 StgRetInfoTable *info;
4205 stack_end = &tso->stack[tso->stack_size];
4207 frame = (StgClosure *)tso->sp;
4210 info = get_ret_itbl(frame);
4212 switch (info->i.type) {
4215 bh = ((StgUpdateFrame *)frame)->updatee;
4217 /* if the thunk is already blackholed, it means we've also
4218 * already blackholed the rest of the thunks on this stack,
4219 * so we can stop early.
4221 * The blackhole made for a CAF is a CAF_BLACKHOLE, so they
4222 * don't interfere with this optimisation.
4224 if (bh->header.info == &stg_BLACKHOLE_info) {
4228 if (bh->header.info != &stg_CAF_BLACKHOLE_info) {
4229 #if (!defined(LAZY_BLACKHOLING)) && defined(DEBUG)
4230 debugBelch("Unexpected lazy BHing required at 0x%04x\n",(int)bh);
4234 // We pretend that bh is now dead.
4235 LDV_recordDead_FILL_SLOP_DYNAMIC((StgClosure *)bh);
4237 SET_INFO(bh,&stg_BLACKHOLE_info);
4239 // We pretend that bh has just been created.
4240 LDV_RECORD_CREATE(bh);
4243 frame = (StgClosure *) ((StgUpdateFrame *)frame + 1);
4249 // normal stack frames; do nothing except advance the pointer
4251 frame = (StgClosure *)((StgPtr)frame + stack_frame_sizeW(frame));
4257 /* -----------------------------------------------------------------------------
4260 * Code largely pinched from old RTS, then hacked to bits. We also do
4261 * lazy black holing here.
4263 * -------------------------------------------------------------------------- */
4265 struct stack_gap { StgWord gap_size; struct stack_gap *next_gap; };
4268 threadSqueezeStack(StgTSO *tso)
4271 rtsBool prev_was_update_frame;
4272 StgClosure *updatee = NULL;
4274 StgRetInfoTable *info;
4275 StgWord current_gap_size;
4276 struct stack_gap *gap;
4279 // Traverse the stack upwards, replacing adjacent update frames
4280 // with a single update frame and a "stack gap". A stack gap
4281 // contains two values: the size of the gap, and the distance
4282 // to the next gap (or the stack top).
4284 bottom = &(tso->stack[tso->stack_size]);
4288 ASSERT(frame < bottom);
4290 prev_was_update_frame = rtsFalse;
4291 current_gap_size = 0;
4292 gap = (struct stack_gap *) (tso->sp - sizeofW(StgUpdateFrame));
4294 while (frame < bottom) {
4296 info = get_ret_itbl((StgClosure *)frame);
4297 switch (info->i.type) {
4301 StgUpdateFrame *upd = (StgUpdateFrame *)frame;
4303 if (upd->updatee->header.info == &stg_BLACKHOLE_info) {
4305 // found a BLACKHOLE'd update frame; we've been here
4306 // before, in a previous GC, so just break out.
4308 // Mark the end of the gap, if we're in one.
4309 if (current_gap_size != 0) {
4310 gap = (struct stack_gap *)(frame-sizeofW(StgUpdateFrame));
4313 frame += sizeofW(StgUpdateFrame);
4314 goto done_traversing;
4317 if (prev_was_update_frame) {
4319 TICK_UPD_SQUEEZED();
4320 /* wasn't there something about update squeezing and ticky to be
4321 * sorted out? oh yes: we aren't counting each enter properly
4322 * in this case. See the log somewhere. KSW 1999-04-21
4324 * Check two things: that the two update frames don't point to
4325 * the same object, and that the updatee_bypass isn't already an
4326 * indirection. Both of these cases only happen when we're in a
4327 * block hole-style loop (and there are multiple update frames
4328 * on the stack pointing to the same closure), but they can both
4329 * screw us up if we don't check.
4331 if (upd->updatee != updatee && !closure_IND(upd->updatee)) {
4332 UPD_IND_NOLOCK(upd->updatee, updatee);
4335 // now mark this update frame as a stack gap. The gap
4336 // marker resides in the bottom-most update frame of
4337 // the series of adjacent frames, and covers all the
4338 // frames in this series.
4339 current_gap_size += sizeofW(StgUpdateFrame);
4340 ((struct stack_gap *)frame)->gap_size = current_gap_size;
4341 ((struct stack_gap *)frame)->next_gap = gap;
4343 frame += sizeofW(StgUpdateFrame);
4347 // single update frame, or the topmost update frame in a series
4349 StgClosure *bh = upd->updatee;
4351 // Do lazy black-holing
4352 if (bh->header.info != &stg_BLACKHOLE_info &&
4353 bh->header.info != &stg_CAF_BLACKHOLE_info) {
4354 #if (!defined(LAZY_BLACKHOLING)) && defined(DEBUG)
4355 debugBelch("Unexpected lazy BHing required at 0x%04x",(int)bh);
4358 // zero out the slop so that the sanity checker can tell
4359 // where the next closure is.
4360 DEBUG_FILL_SLOP(bh);
4363 // We pretend that bh is now dead.
4364 // ToDo: is the slop filling the same as DEBUG_FILL_SLOP?
4365 LDV_recordDead_FILL_SLOP_DYNAMIC((StgClosure *)bh);
4367 // Todo: maybe use SET_HDR() and remove LDV_RECORD_CREATE()?
4368 SET_INFO(bh,&stg_BLACKHOLE_info);
4370 // We pretend that bh has just been created.
4371 LDV_RECORD_CREATE(bh);
4374 prev_was_update_frame = rtsTrue;
4375 updatee = upd->updatee;
4376 frame += sizeofW(StgUpdateFrame);
4382 prev_was_update_frame = rtsFalse;
4384 // we're not in a gap... check whether this is the end of a gap
4385 // (an update frame can't be the end of a gap).
4386 if (current_gap_size != 0) {
4387 gap = (struct stack_gap *) (frame - sizeofW(StgUpdateFrame));
4389 current_gap_size = 0;
4391 frame += stack_frame_sizeW((StgClosure *)frame);
4398 // Now we have a stack with gaps in it, and we have to walk down
4399 // shoving the stack up to fill in the gaps. A diagram might
4403 // | ********* | <- sp
4407 // | stack_gap | <- gap | chunk_size
4409 // | ......... | <- gap_end v
4415 // 'sp' points the the current top-of-stack
4416 // 'gap' points to the stack_gap structure inside the gap
4417 // ***** indicates real stack data
4418 // ..... indicates gap
4419 // <empty> indicates unused
4423 void *gap_start, *next_gap_start, *gap_end;
4426 next_gap_start = (void *)((unsigned char*)gap + sizeof(StgUpdateFrame));
4427 sp = next_gap_start;
4429 while ((StgPtr)gap > tso->sp) {
4431 // we're working in *bytes* now...
4432 gap_start = next_gap_start;
4433 gap_end = (void*) ((unsigned char*)gap_start - gap->gap_size * sizeof(W_));
4435 gap = gap->next_gap;
4436 next_gap_start = (void *)((unsigned char*)gap + sizeof(StgUpdateFrame));
4438 chunk_size = (unsigned char*)gap_end - (unsigned char*)next_gap_start;
4440 memmove(sp, next_gap_start, chunk_size);
4443 tso->sp = (StgPtr)sp;
4447 /* -----------------------------------------------------------------------------
4450 * We have to prepare for GC - this means doing lazy black holing
4451 * here. We also take the opportunity to do stack squeezing if it's
4453 * -------------------------------------------------------------------------- */
4455 threadPaused(StgTSO *tso)
4457 if ( RtsFlags.GcFlags.squeezeUpdFrames == rtsTrue )
4458 threadSqueezeStack(tso); // does black holing too
4460 threadLazyBlackHole(tso);
4463 /* -----------------------------------------------------------------------------
4465 * -------------------------------------------------------------------------- */
4469 printMutableList(generation *gen)
4474 debugBelch("@@ Mutable list %p: ", gen->mut_list);
4476 for (bd = gen->mut_list; bd != NULL; bd = bd->link) {
4477 for (p = bd->start; p < bd->free; p++) {
4478 debugBelch("%p (%s), ", (void *)*p, info_type((StgClosure *)*p));