1 /* -----------------------------------------------------------------------------
2 * $Id: GC.c,v 1.135 2002/04/23 06:34:27 sof Exp $
4 * (c) The GHC Team 1998-1999
6 * Generational garbage collector
8 * ---------------------------------------------------------------------------*/
10 #include "PosixSource.h"
15 #include "StoragePriv.h"
18 #include "SchedAPI.h" // for ReverCAFs prototype
20 #include "BlockAlloc.h"
26 #include "StablePriv.h"
28 #include "ParTicky.h" // ToDo: move into Rts.h
29 #include "GCCompact.h"
30 #if defined(GRAN) || defined(PAR)
31 # include "GranSimRts.h"
32 # include "ParallelRts.h"
36 # include "ParallelDebug.h"
41 #if defined(RTS_GTK_FRONTPANEL)
42 #include "FrontPanel.h"
45 #include "RetainerProfile.h"
46 #include "LdvProfile.h"
48 /* STATIC OBJECT LIST.
51 * We maintain a linked list of static objects that are still live.
52 * The requirements for this list are:
54 * - we need to scan the list while adding to it, in order to
55 * scavenge all the static objects (in the same way that
56 * breadth-first scavenging works for dynamic objects).
58 * - we need to be able to tell whether an object is already on
59 * the list, to break loops.
61 * Each static object has a "static link field", which we use for
62 * linking objects on to the list. We use a stack-type list, consing
63 * objects on the front as they are added (this means that the
64 * scavenge phase is depth-first, not breadth-first, but that
67 * A separate list is kept for objects that have been scavenged
68 * already - this is so that we can zero all the marks afterwards.
70 * An object is on the list if its static link field is non-zero; this
71 * means that we have to mark the end of the list with '1', not NULL.
73 * Extra notes for generational GC:
75 * Each generation has a static object list associated with it. When
76 * collecting generations up to N, we treat the static object lists
77 * from generations > N as roots.
79 * We build up a static object list while collecting generations 0..N,
80 * which is then appended to the static object list of generation N+1.
82 StgClosure* static_objects; // live static objects
83 StgClosure* scavenged_static_objects; // static objects scavenged so far
85 /* N is the oldest generation being collected, where the generations
86 * are numbered starting at 0. A major GC (indicated by the major_gc
87 * flag) is when we're collecting all generations. We only attempt to
88 * deal with static objects and GC CAFs when doing a major GC.
91 static rtsBool major_gc;
93 /* Youngest generation that objects should be evacuated to in
94 * evacuate(). (Logically an argument to evacuate, but it's static
95 * a lot of the time so we optimise it into a global variable).
101 StgWeak *old_weak_ptr_list; // also pending finaliser list
103 /* Which stage of processing various kinds of weak pointer are we at?
104 * (see traverse_weak_ptr_list() below for discussion).
106 typedef enum { WeakPtrs, WeakThreads, WeakDone } WeakStage;
107 static WeakStage weak_stage;
109 /* List of all threads during GC
111 static StgTSO *old_all_threads;
112 StgTSO *resurrected_threads;
114 /* Flag indicating failure to evacuate an object to the desired
117 static rtsBool failed_to_evac;
119 /* Old to-space (used for two-space collector only)
121 bdescr *old_to_blocks;
123 /* Data used for allocation area sizing.
125 lnat new_blocks; // blocks allocated during this GC
126 lnat g0s0_pcnt_kept = 30; // percentage of g0s0 live at last minor GC
128 /* Used to avoid long recursion due to selector thunks
130 lnat thunk_selector_depth = 0;
131 #define MAX_THUNK_SELECTOR_DEPTH 256
133 /* -----------------------------------------------------------------------------
134 Static function declarations
135 -------------------------------------------------------------------------- */
137 static void mark_root ( StgClosure **root );
138 static StgClosure * evacuate ( StgClosure *q );
139 static void zero_static_object_list ( StgClosure* first_static );
140 static void zero_mutable_list ( StgMutClosure *first );
142 static rtsBool traverse_weak_ptr_list ( void );
143 static void mark_weak_ptr_list ( StgWeak **list );
145 static void scavenge ( step * );
146 static void scavenge_mark_stack ( void );
147 static void scavenge_stack ( StgPtr p, StgPtr stack_end );
148 static rtsBool scavenge_one ( StgPtr p );
149 static void scavenge_large ( step * );
150 static void scavenge_static ( void );
151 static void scavenge_mutable_list ( generation *g );
152 static void scavenge_mut_once_list ( generation *g );
154 #if 0 && defined(DEBUG)
155 static void gcCAFs ( void );
158 /* -----------------------------------------------------------------------------
159 inline functions etc. for dealing with the mark bitmap & stack.
160 -------------------------------------------------------------------------- */
162 #define MARK_STACK_BLOCKS 4
164 static bdescr *mark_stack_bdescr;
165 static StgPtr *mark_stack;
166 static StgPtr *mark_sp;
167 static StgPtr *mark_splim;
169 // Flag and pointers used for falling back to a linear scan when the
170 // mark stack overflows.
171 static rtsBool mark_stack_overflowed;
172 static bdescr *oldgen_scan_bd;
173 static StgPtr oldgen_scan;
175 static inline rtsBool
176 mark_stack_empty(void)
178 return mark_sp == mark_stack;
181 static inline rtsBool
182 mark_stack_full(void)
184 return mark_sp >= mark_splim;
188 reset_mark_stack(void)
190 mark_sp = mark_stack;
194 push_mark_stack(StgPtr p)
205 /* -----------------------------------------------------------------------------
208 For garbage collecting generation N (and all younger generations):
210 - follow all pointers in the root set. the root set includes all
211 mutable objects in all steps in all generations.
213 - for each pointer, evacuate the object it points to into either
214 + to-space in the next higher step in that generation, if one exists,
215 + if the object's generation == N, then evacuate it to the next
216 generation if one exists, or else to-space in the current
218 + if the object's generation < N, then evacuate it to to-space
219 in the next generation.
221 - repeatedly scavenge to-space from each step in each generation
222 being collected until no more objects can be evacuated.
224 - free from-space in each step, and set from-space = to-space.
226 Locks held: sched_mutex
228 -------------------------------------------------------------------------- */
231 GarbageCollect ( void (*get_roots)(evac_fn), rtsBool force_major_gc )
235 lnat live, allocated, collected = 0, copied = 0;
236 lnat oldgen_saved_blocks = 0;
240 CostCentreStack *prev_CCS;
243 #if defined(DEBUG) && defined(GRAN)
244 IF_DEBUG(gc, belch("@@ Starting garbage collection at %ld (%lx)\n",
248 // tell the stats department that we've started a GC
251 // Init stats and print par specific (timing) info
252 PAR_TICKY_PAR_START();
254 // attribute any costs to CCS_GC
260 /* Approximate how much we allocated.
261 * Todo: only when generating stats?
263 allocated = calcAllocated();
265 /* Figure out which generation to collect
267 if (force_major_gc) {
268 N = RtsFlags.GcFlags.generations - 1;
272 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
273 if (generations[g].steps[0].n_blocks +
274 generations[g].steps[0].n_large_blocks
275 >= generations[g].max_blocks) {
279 major_gc = (N == RtsFlags.GcFlags.generations-1);
282 #ifdef RTS_GTK_FRONTPANEL
283 if (RtsFlags.GcFlags.frontpanel) {
284 updateFrontPanelBeforeGC(N);
288 // check stack sanity *before* GC (ToDo: check all threads)
290 // ToDo!: check sanity IF_DEBUG(sanity, checkTSOsSanity());
292 IF_DEBUG(sanity, checkFreeListSanity());
294 /* Initialise the static object lists
296 static_objects = END_OF_STATIC_LIST;
297 scavenged_static_objects = END_OF_STATIC_LIST;
299 /* zero the mutable list for the oldest generation (see comment by
300 * zero_mutable_list below).
303 zero_mutable_list(generations[RtsFlags.GcFlags.generations-1].mut_once_list);
306 /* Save the old to-space if we're doing a two-space collection
308 if (RtsFlags.GcFlags.generations == 1) {
309 old_to_blocks = g0s0->to_blocks;
310 g0s0->to_blocks = NULL;
313 /* Keep a count of how many new blocks we allocated during this GC
314 * (used for resizing the allocation area, later).
318 /* Initialise to-space in all the generations/steps that we're
321 for (g = 0; g <= N; g++) {
322 generations[g].mut_once_list = END_MUT_LIST;
323 generations[g].mut_list = END_MUT_LIST;
325 for (s = 0; s < generations[g].n_steps; s++) {
327 // generation 0, step 0 doesn't need to-space
328 if (g == 0 && s == 0 && RtsFlags.GcFlags.generations > 1) {
332 /* Get a free block for to-space. Extra blocks will be chained on
336 stp = &generations[g].steps[s];
337 ASSERT(stp->gen_no == g);
338 ASSERT(stp->hp ? Bdescr(stp->hp)->step == stp : rtsTrue);
342 bd->flags = BF_EVACUATED; // it's a to-space block
344 stp->hpLim = stp->hp + BLOCK_SIZE_W;
347 stp->n_to_blocks = 1;
348 stp->scan = bd->start;
350 stp->new_large_objects = NULL;
351 stp->scavenged_large_objects = NULL;
352 stp->n_scavenged_large_blocks = 0;
354 // mark the large objects as not evacuated yet
355 for (bd = stp->large_objects; bd; bd = bd->link) {
356 bd->flags = BF_LARGE;
359 // for a compacted step, we need to allocate the bitmap
360 if (stp->is_compacted) {
361 nat bitmap_size; // in bytes
362 bdescr *bitmap_bdescr;
365 bitmap_size = stp->n_blocks * BLOCK_SIZE / (sizeof(W_)*BITS_PER_BYTE);
367 if (bitmap_size > 0) {
368 bitmap_bdescr = allocGroup((nat)BLOCK_ROUND_UP(bitmap_size)
370 stp->bitmap = bitmap_bdescr;
371 bitmap = bitmap_bdescr->start;
373 IF_DEBUG(gc, belch("bitmap_size: %d, bitmap: %p",
374 bitmap_size, bitmap););
376 // don't forget to fill it with zeros!
377 memset(bitmap, 0, bitmap_size);
379 // for each block in this step, point to its bitmap from the
381 for (bd=stp->blocks; bd != NULL; bd = bd->link) {
382 bd->u.bitmap = bitmap;
383 bitmap += BLOCK_SIZE_W / (sizeof(W_)*BITS_PER_BYTE);
390 /* make sure the older generations have at least one block to
391 * allocate into (this makes things easier for copy(), see below.
393 for (g = N+1; g < RtsFlags.GcFlags.generations; g++) {
394 for (s = 0; s < generations[g].n_steps; s++) {
395 stp = &generations[g].steps[s];
396 if (stp->hp_bd == NULL) {
397 ASSERT(stp->blocks == NULL);
402 bd->flags = 0; // *not* a to-space block or a large object
404 stp->hpLim = stp->hp + BLOCK_SIZE_W;
410 /* Set the scan pointer for older generations: remember we
411 * still have to scavenge objects that have been promoted. */
413 stp->scan_bd = stp->hp_bd;
414 stp->to_blocks = NULL;
415 stp->n_to_blocks = 0;
416 stp->new_large_objects = NULL;
417 stp->scavenged_large_objects = NULL;
418 stp->n_scavenged_large_blocks = 0;
422 /* Allocate a mark stack if we're doing a major collection.
425 mark_stack_bdescr = allocGroup(MARK_STACK_BLOCKS);
426 mark_stack = (StgPtr *)mark_stack_bdescr->start;
427 mark_sp = mark_stack;
428 mark_splim = mark_stack + (MARK_STACK_BLOCKS * BLOCK_SIZE_W);
430 mark_stack_bdescr = NULL;
433 /* -----------------------------------------------------------------------
434 * follow all the roots that we know about:
435 * - mutable lists from each generation > N
436 * we want to *scavenge* these roots, not evacuate them: they're not
437 * going to move in this GC.
438 * Also: do them in reverse generation order. This is because we
439 * often want to promote objects that are pointed to by older
440 * generations early, so we don't have to repeatedly copy them.
441 * Doing the generations in reverse order ensures that we don't end
442 * up in the situation where we want to evac an object to gen 3 and
443 * it has already been evaced to gen 2.
447 for (g = RtsFlags.GcFlags.generations-1; g > N; g--) {
448 generations[g].saved_mut_list = generations[g].mut_list;
449 generations[g].mut_list = END_MUT_LIST;
452 // Do the mut-once lists first
453 for (g = RtsFlags.GcFlags.generations-1; g > N; g--) {
454 IF_PAR_DEBUG(verbose,
455 printMutOnceList(&generations[g]));
456 scavenge_mut_once_list(&generations[g]);
458 for (st = generations[g].n_steps-1; st >= 0; st--) {
459 scavenge(&generations[g].steps[st]);
463 for (g = RtsFlags.GcFlags.generations-1; g > N; g--) {
464 IF_PAR_DEBUG(verbose,
465 printMutableList(&generations[g]));
466 scavenge_mutable_list(&generations[g]);
468 for (st = generations[g].n_steps-1; st >= 0; st--) {
469 scavenge(&generations[g].steps[st]);
474 /* follow roots from the CAF list (used by GHCi)
479 /* follow all the roots that the application knows about.
482 get_roots(mark_root);
485 /* And don't forget to mark the TSO if we got here direct from
487 /* Not needed in a seq version?
489 CurrentTSO = (StgTSO *)MarkRoot((StgClosure *)CurrentTSO);
493 // Mark the entries in the GALA table of the parallel system
494 markLocalGAs(major_gc);
495 // Mark all entries on the list of pending fetches
496 markPendingFetches(major_gc);
499 /* Mark the weak pointer list, and prepare to detect dead weak
502 mark_weak_ptr_list(&weak_ptr_list);
503 old_weak_ptr_list = weak_ptr_list;
504 weak_ptr_list = NULL;
505 weak_stage = WeakPtrs;
507 /* The all_threads list is like the weak_ptr_list.
508 * See traverse_weak_ptr_list() for the details.
510 old_all_threads = all_threads;
511 all_threads = END_TSO_QUEUE;
512 resurrected_threads = END_TSO_QUEUE;
514 /* Mark the stable pointer table.
516 markStablePtrTable(mark_root);
520 /* ToDo: To fix the caf leak, we need to make the commented out
521 * parts of this code do something sensible - as described in
524 extern void markHugsObjects(void);
529 /* -------------------------------------------------------------------------
530 * Repeatedly scavenge all the areas we know about until there's no
531 * more scavenging to be done.
538 // scavenge static objects
539 if (major_gc && static_objects != END_OF_STATIC_LIST) {
540 IF_DEBUG(sanity, checkStaticObjects(static_objects));
544 /* When scavenging the older generations: Objects may have been
545 * evacuated from generations <= N into older generations, and we
546 * need to scavenge these objects. We're going to try to ensure that
547 * any evacuations that occur move the objects into at least the
548 * same generation as the object being scavenged, otherwise we
549 * have to create new entries on the mutable list for the older
553 // scavenge each step in generations 0..maxgen
559 // scavenge objects in compacted generation
560 if (mark_stack_overflowed || oldgen_scan_bd != NULL ||
561 (mark_stack_bdescr != NULL && !mark_stack_empty())) {
562 scavenge_mark_stack();
566 for (gen = RtsFlags.GcFlags.generations; --gen >= 0; ) {
567 for (st = generations[gen].n_steps; --st >= 0; ) {
568 if (gen == 0 && st == 0 && RtsFlags.GcFlags.generations > 1) {
571 stp = &generations[gen].steps[st];
573 if (stp->hp_bd != stp->scan_bd || stp->scan < stp->hp) {
578 if (stp->new_large_objects != NULL) {
587 if (flag) { goto loop; }
589 // must be last... invariant is that everything is fully
590 // scavenged at this point.
591 if (traverse_weak_ptr_list()) { // returns rtsTrue if evaced something
596 /* Update the pointers from the "main thread" list - these are
597 * treated as weak pointers because we want to allow a main thread
598 * to get a BlockedOnDeadMVar exception in the same way as any other
599 * thread. Note that the threads should all have been retained by
600 * GC by virtue of being on the all_threads list, we're just
601 * updating pointers here.
606 for (m = main_threads; m != NULL; m = m->link) {
607 tso = (StgTSO *) isAlive((StgClosure *)m->tso);
609 barf("main thread has been GC'd");
616 // Reconstruct the Global Address tables used in GUM
617 rebuildGAtables(major_gc);
618 IF_DEBUG(sanity, checkLAGAtable(rtsTrue/*check closures, too*/));
621 // Now see which stable names are still alive.
624 // Tidy the end of the to-space chains
625 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
626 for (s = 0; s < generations[g].n_steps; s++) {
627 stp = &generations[g].steps[s];
628 if (!(g == 0 && s == 0 && RtsFlags.GcFlags.generations > 1)) {
629 stp->hp_bd->free = stp->hp;
630 stp->hp_bd->link = NULL;
636 // We call processHeapClosureForDead() on every closure destroyed during
637 // the current garbage collection, so we invoke LdvCensusForDead().
638 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV
639 || RtsFlags.ProfFlags.bioSelector != NULL)
643 // NO MORE EVACUATION AFTER THIS POINT!
644 // Finally: compaction of the oldest generation.
645 if (major_gc && oldest_gen->steps[0].is_compacted) {
646 // save number of blocks for stats
647 oldgen_saved_blocks = oldest_gen->steps[0].n_blocks;
651 IF_DEBUG(sanity, checkGlobalTSOList(rtsFalse));
653 /* run through all the generations/steps and tidy up
655 copied = new_blocks * BLOCK_SIZE_W;
656 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
659 generations[g].collections++; // for stats
662 for (s = 0; s < generations[g].n_steps; s++) {
664 stp = &generations[g].steps[s];
666 if (!(g == 0 && s == 0 && RtsFlags.GcFlags.generations > 1)) {
667 // stats information: how much we copied
669 copied -= stp->hp_bd->start + BLOCK_SIZE_W -
674 // for generations we collected...
677 // rough calculation of garbage collected, for stats output
678 if (stp->is_compacted) {
679 collected += (oldgen_saved_blocks - stp->n_blocks) * BLOCK_SIZE_W;
681 collected += stp->n_blocks * BLOCK_SIZE_W;
684 /* free old memory and shift to-space into from-space for all
685 * the collected steps (except the allocation area). These
686 * freed blocks will probaby be quickly recycled.
688 if (!(g == 0 && s == 0)) {
689 if (stp->is_compacted) {
690 // for a compacted step, just shift the new to-space
691 // onto the front of the now-compacted existing blocks.
692 for (bd = stp->to_blocks; bd != NULL; bd = bd->link) {
693 bd->flags &= ~BF_EVACUATED; // now from-space
695 // tack the new blocks on the end of the existing blocks
696 if (stp->blocks == NULL) {
697 stp->blocks = stp->to_blocks;
699 for (bd = stp->blocks; bd != NULL; bd = next) {
702 bd->link = stp->to_blocks;
706 // add the new blocks to the block tally
707 stp->n_blocks += stp->n_to_blocks;
709 freeChain(stp->blocks);
710 stp->blocks = stp->to_blocks;
711 stp->n_blocks = stp->n_to_blocks;
712 for (bd = stp->blocks; bd != NULL; bd = bd->link) {
713 bd->flags &= ~BF_EVACUATED; // now from-space
716 stp->to_blocks = NULL;
717 stp->n_to_blocks = 0;
720 /* LARGE OBJECTS. The current live large objects are chained on
721 * scavenged_large, having been moved during garbage
722 * collection from large_objects. Any objects left on
723 * large_objects list are therefore dead, so we free them here.
725 for (bd = stp->large_objects; bd != NULL; bd = next) {
731 // update the count of blocks used by large objects
732 for (bd = stp->scavenged_large_objects; bd != NULL; bd = bd->link) {
733 bd->flags &= ~BF_EVACUATED;
735 stp->large_objects = stp->scavenged_large_objects;
736 stp->n_large_blocks = stp->n_scavenged_large_blocks;
739 // for older generations...
741 /* For older generations, we need to append the
742 * scavenged_large_object list (i.e. large objects that have been
743 * promoted during this GC) to the large_object list for that step.
745 for (bd = stp->scavenged_large_objects; bd; bd = next) {
747 bd->flags &= ~BF_EVACUATED;
748 dbl_link_onto(bd, &stp->large_objects);
751 // add the new blocks we promoted during this GC
752 stp->n_blocks += stp->n_to_blocks;
753 stp->n_large_blocks += stp->n_scavenged_large_blocks;
758 /* Reset the sizes of the older generations when we do a major
761 * CURRENT STRATEGY: make all generations except zero the same size.
762 * We have to stay within the maximum heap size, and leave a certain
763 * percentage of the maximum heap size available to allocate into.
765 if (major_gc && RtsFlags.GcFlags.generations > 1) {
766 nat live, size, min_alloc;
767 nat max = RtsFlags.GcFlags.maxHeapSize;
768 nat gens = RtsFlags.GcFlags.generations;
770 // live in the oldest generations
771 live = oldest_gen->steps[0].n_blocks +
772 oldest_gen->steps[0].n_large_blocks;
774 // default max size for all generations except zero
775 size = stg_max(live * RtsFlags.GcFlags.oldGenFactor,
776 RtsFlags.GcFlags.minOldGenSize);
778 // minimum size for generation zero
779 min_alloc = stg_max((RtsFlags.GcFlags.pcFreeHeap * max) / 200,
780 RtsFlags.GcFlags.minAllocAreaSize);
782 // Auto-enable compaction when the residency reaches a
783 // certain percentage of the maximum heap size (default: 30%).
784 if (RtsFlags.GcFlags.generations > 1 &&
785 (RtsFlags.GcFlags.compact ||
787 oldest_gen->steps[0].n_blocks >
788 (RtsFlags.GcFlags.compactThreshold * max) / 100))) {
789 oldest_gen->steps[0].is_compacted = 1;
790 // fprintf(stderr,"compaction: on\n", live);
792 oldest_gen->steps[0].is_compacted = 0;
793 // fprintf(stderr,"compaction: off\n", live);
796 // if we're going to go over the maximum heap size, reduce the
797 // size of the generations accordingly. The calculation is
798 // different if compaction is turned on, because we don't need
799 // to double the space required to collect the old generation.
802 // this test is necessary to ensure that the calculations
803 // below don't have any negative results - we're working
804 // with unsigned values here.
805 if (max < min_alloc) {
809 if (oldest_gen->steps[0].is_compacted) {
810 if ( (size + (size - 1) * (gens - 2) * 2) + min_alloc > max ) {
811 size = (max - min_alloc) / ((gens - 1) * 2 - 1);
814 if ( (size * (gens - 1) * 2) + min_alloc > max ) {
815 size = (max - min_alloc) / ((gens - 1) * 2);
825 fprintf(stderr,"live: %d, min_alloc: %d, size : %d, max = %d\n", live,
826 min_alloc, size, max);
829 for (g = 0; g < gens; g++) {
830 generations[g].max_blocks = size;
834 // Guess the amount of live data for stats.
837 /* Free the small objects allocated via allocate(), since this will
838 * all have been copied into G0S1 now.
840 if (small_alloc_list != NULL) {
841 freeChain(small_alloc_list);
843 small_alloc_list = NULL;
847 alloc_blocks_lim = RtsFlags.GcFlags.minAllocAreaSize;
849 // Start a new pinned_object_block
850 pinned_object_block = NULL;
852 /* Free the mark stack.
854 if (mark_stack_bdescr != NULL) {
855 freeGroup(mark_stack_bdescr);
860 for (g = 0; g <= N; g++) {
861 for (s = 0; s < generations[g].n_steps; s++) {
862 stp = &generations[g].steps[s];
863 if (stp->is_compacted && stp->bitmap != NULL) {
864 freeGroup(stp->bitmap);
869 /* Two-space collector:
870 * Free the old to-space, and estimate the amount of live data.
872 if (RtsFlags.GcFlags.generations == 1) {
875 if (old_to_blocks != NULL) {
876 freeChain(old_to_blocks);
878 for (bd = g0s0->to_blocks; bd != NULL; bd = bd->link) {
879 bd->flags = 0; // now from-space
882 /* For a two-space collector, we need to resize the nursery. */
884 /* set up a new nursery. Allocate a nursery size based on a
885 * function of the amount of live data (by default a factor of 2)
886 * Use the blocks from the old nursery if possible, freeing up any
889 * If we get near the maximum heap size, then adjust our nursery
890 * size accordingly. If the nursery is the same size as the live
891 * data (L), then we need 3L bytes. We can reduce the size of the
892 * nursery to bring the required memory down near 2L bytes.
894 * A normal 2-space collector would need 4L bytes to give the same
895 * performance we get from 3L bytes, reducing to the same
896 * performance at 2L bytes.
898 blocks = g0s0->n_to_blocks;
900 if ( RtsFlags.GcFlags.maxHeapSize != 0 &&
901 blocks * RtsFlags.GcFlags.oldGenFactor * 2 >
902 RtsFlags.GcFlags.maxHeapSize ) {
903 long adjusted_blocks; // signed on purpose
906 adjusted_blocks = (RtsFlags.GcFlags.maxHeapSize - 2 * blocks);
907 IF_DEBUG(gc, belch("@@ Near maximum heap size of 0x%x blocks, blocks = %d, adjusted to %ld", RtsFlags.GcFlags.maxHeapSize, blocks, adjusted_blocks));
908 pc_free = adjusted_blocks * 100 / RtsFlags.GcFlags.maxHeapSize;
909 if (pc_free < RtsFlags.GcFlags.pcFreeHeap) /* might even be < 0 */ {
912 blocks = adjusted_blocks;
915 blocks *= RtsFlags.GcFlags.oldGenFactor;
916 if (blocks < RtsFlags.GcFlags.minAllocAreaSize) {
917 blocks = RtsFlags.GcFlags.minAllocAreaSize;
920 resizeNursery(blocks);
923 /* Generational collector:
924 * If the user has given us a suggested heap size, adjust our
925 * allocation area to make best use of the memory available.
928 if (RtsFlags.GcFlags.heapSizeSuggestion) {
930 nat needed = calcNeeded(); // approx blocks needed at next GC
932 /* Guess how much will be live in generation 0 step 0 next time.
933 * A good approximation is obtained by finding the
934 * percentage of g0s0 that was live at the last minor GC.
937 g0s0_pcnt_kept = (new_blocks * 100) / g0s0->n_blocks;
940 /* Estimate a size for the allocation area based on the
941 * information available. We might end up going slightly under
942 * or over the suggested heap size, but we should be pretty
945 * Formula: suggested - needed
946 * ----------------------------
947 * 1 + g0s0_pcnt_kept/100
949 * where 'needed' is the amount of memory needed at the next
950 * collection for collecting all steps except g0s0.
953 (((long)RtsFlags.GcFlags.heapSizeSuggestion - (long)needed) * 100) /
954 (100 + (long)g0s0_pcnt_kept);
956 if (blocks < (long)RtsFlags.GcFlags.minAllocAreaSize) {
957 blocks = RtsFlags.GcFlags.minAllocAreaSize;
960 resizeNursery((nat)blocks);
963 // we might have added extra large blocks to the nursery, so
964 // resize back to minAllocAreaSize again.
965 resizeNursery(RtsFlags.GcFlags.minAllocAreaSize);
969 // mark the garbage collected CAFs as dead
970 #if 0 && defined(DEBUG) // doesn't work at the moment
971 if (major_gc) { gcCAFs(); }
975 // resetStaticObjectForRetainerProfiling() must be called before
977 resetStaticObjectForRetainerProfiling();
980 // zero the scavenged static object list
982 zero_static_object_list(scavenged_static_objects);
988 RELEASE_LOCK(&sched_mutex);
990 // start any pending finalizers
991 scheduleFinalizers(old_weak_ptr_list);
993 // send exceptions to any threads which were about to die
994 resurrectThreads(resurrected_threads);
996 ACQUIRE_LOCK(&sched_mutex);
998 // Update the stable pointer hash table.
999 updateStablePtrTable(major_gc);
1001 // check sanity after GC
1002 IF_DEBUG(sanity, checkSanity());
1004 // extra GC trace info
1005 IF_DEBUG(gc, statDescribeGens());
1008 // symbol-table based profiling
1009 /* heapCensus(to_blocks); */ /* ToDo */
1012 // restore enclosing cost centre
1017 // check for memory leaks if sanity checking is on
1018 IF_DEBUG(sanity, memInventory());
1020 #ifdef RTS_GTK_FRONTPANEL
1021 if (RtsFlags.GcFlags.frontpanel) {
1022 updateFrontPanelAfterGC( N, live );
1026 // ok, GC over: tell the stats department what happened.
1027 stat_endGC(allocated, collected, live, copied, N);
1033 /* -----------------------------------------------------------------------------
1036 traverse_weak_ptr_list is called possibly many times during garbage
1037 collection. It returns a flag indicating whether it did any work
1038 (i.e. called evacuate on any live pointers).
1040 Invariant: traverse_weak_ptr_list is called when the heap is in an
1041 idempotent state. That means that there are no pending
1042 evacuate/scavenge operations. This invariant helps the weak
1043 pointer code decide which weak pointers are dead - if there are no
1044 new live weak pointers, then all the currently unreachable ones are
1047 For generational GC: we just don't try to finalize weak pointers in
1048 older generations than the one we're collecting. This could
1049 probably be optimised by keeping per-generation lists of weak
1050 pointers, but for a few weak pointers this scheme will work.
1052 There are three distinct stages to processing weak pointers:
1054 - weak_stage == WeakPtrs
1056 We process all the weak pointers whos keys are alive (evacuate
1057 their values and finalizers), and repeat until we can find no new
1058 live keys. If no live keys are found in this pass, then we
1059 evacuate the finalizers of all the dead weak pointers in order to
1062 - weak_stage == WeakThreads
1064 Now, we discover which *threads* are still alive. Pointers to
1065 threads from the all_threads and main thread lists are the
1066 weakest of all: a pointers from the finalizer of a dead weak
1067 pointer can keep a thread alive. Any threads found to be unreachable
1068 are evacuated and placed on the resurrected_threads list so we
1069 can send them a signal later.
1071 - weak_stage == WeakDone
1073 No more evacuation is done.
1075 -------------------------------------------------------------------------- */
1078 traverse_weak_ptr_list(void)
1080 StgWeak *w, **last_w, *next_w;
1082 rtsBool flag = rtsFalse;
1084 switch (weak_stage) {
1090 /* doesn't matter where we evacuate values/finalizers to, since
1091 * these pointers are treated as roots (iff the keys are alive).
1095 last_w = &old_weak_ptr_list;
1096 for (w = old_weak_ptr_list; w != NULL; w = next_w) {
1098 /* There might be a DEAD_WEAK on the list if finalizeWeak# was
1099 * called on a live weak pointer object. Just remove it.
1101 if (w->header.info == &stg_DEAD_WEAK_info) {
1102 next_w = ((StgDeadWeak *)w)->link;
1107 switch (get_itbl(w)->type) {
1110 next_w = (StgWeak *)((StgEvacuated *)w)->evacuee;
1115 /* Now, check whether the key is reachable.
1117 new = isAlive(w->key);
1120 // evacuate the value and finalizer
1121 w->value = evacuate(w->value);
1122 w->finalizer = evacuate(w->finalizer);
1123 // remove this weak ptr from the old_weak_ptr list
1125 // and put it on the new weak ptr list
1127 w->link = weak_ptr_list;
1130 IF_DEBUG(weak, belch("Weak pointer still alive at %p -> %p",
1135 last_w = &(w->link);
1141 barf("traverse_weak_ptr_list: not WEAK");
1145 /* If we didn't make any changes, then we can go round and kill all
1146 * the dead weak pointers. The old_weak_ptr list is used as a list
1147 * of pending finalizers later on.
1149 if (flag == rtsFalse) {
1150 for (w = old_weak_ptr_list; w; w = w->link) {
1151 w->finalizer = evacuate(w->finalizer);
1154 // Next, move to the WeakThreads stage after fully
1155 // scavenging the finalizers we've just evacuated.
1156 weak_stage = WeakThreads;
1162 /* Now deal with the all_threads list, which behaves somewhat like
1163 * the weak ptr list. If we discover any threads that are about to
1164 * become garbage, we wake them up and administer an exception.
1167 StgTSO *t, *tmp, *next, **prev;
1169 prev = &old_all_threads;
1170 for (t = old_all_threads; t != END_TSO_QUEUE; t = next) {
1172 (StgClosure *)tmp = isAlive((StgClosure *)t);
1178 ASSERT(get_itbl(t)->type == TSO);
1179 switch (t->what_next) {
1180 case ThreadRelocated:
1185 case ThreadComplete:
1186 // finshed or died. The thread might still be alive, but we
1187 // don't keep it on the all_threads list. Don't forget to
1188 // stub out its global_link field.
1189 next = t->global_link;
1190 t->global_link = END_TSO_QUEUE;
1198 // not alive (yet): leave this thread on the
1199 // old_all_threads list.
1200 prev = &(t->global_link);
1201 next = t->global_link;
1204 // alive: move this thread onto the all_threads list.
1205 next = t->global_link;
1206 t->global_link = all_threads;
1213 /* And resurrect any threads which were about to become garbage.
1216 StgTSO *t, *tmp, *next;
1217 for (t = old_all_threads; t != END_TSO_QUEUE; t = next) {
1218 next = t->global_link;
1219 (StgClosure *)tmp = evacuate((StgClosure *)t);
1220 tmp->global_link = resurrected_threads;
1221 resurrected_threads = tmp;
1225 weak_stage = WeakDone; // *now* we're done,
1226 return rtsTrue; // but one more round of scavenging, please
1229 barf("traverse_weak_ptr_list");
1234 /* -----------------------------------------------------------------------------
1235 After GC, the live weak pointer list may have forwarding pointers
1236 on it, because a weak pointer object was evacuated after being
1237 moved to the live weak pointer list. We remove those forwarding
1240 Also, we don't consider weak pointer objects to be reachable, but
1241 we must nevertheless consider them to be "live" and retain them.
1242 Therefore any weak pointer objects which haven't as yet been
1243 evacuated need to be evacuated now.
1244 -------------------------------------------------------------------------- */
1248 mark_weak_ptr_list ( StgWeak **list )
1250 StgWeak *w, **last_w;
1253 for (w = *list; w; w = w->link) {
1254 // w might be WEAK, EVACUATED, or DEAD_WEAK (actually CON_STATIC) here
1255 ASSERT(w->header.info == &stg_DEAD_WEAK_info
1256 || get_itbl(w)->type == WEAK || get_itbl(w)->type == EVACUATED);
1257 (StgClosure *)w = evacuate((StgClosure *)w);
1259 last_w = &(w->link);
1263 /* -----------------------------------------------------------------------------
1264 isAlive determines whether the given closure is still alive (after
1265 a garbage collection) or not. It returns the new address of the
1266 closure if it is alive, or NULL otherwise.
1268 NOTE: Use it before compaction only!
1269 -------------------------------------------------------------------------- */
1273 isAlive(StgClosure *p)
1275 const StgInfoTable *info;
1282 /* ToDo: for static closures, check the static link field.
1283 * Problem here is that we sometimes don't set the link field, eg.
1284 * for static closures with an empty SRT or CONSTR_STATIC_NOCAFs.
1289 // ignore closures in generations that we're not collecting.
1290 if (LOOKS_LIKE_STATIC(p) || bd->gen_no > N) {
1293 // large objects have an evacuated flag
1294 if (bd->flags & BF_LARGE) {
1295 if (bd->flags & BF_EVACUATED) {
1301 // check the mark bit for compacted steps
1302 if (bd->step->is_compacted && is_marked((P_)p,bd)) {
1306 switch (info->type) {
1311 case IND_OLDGEN: // rely on compatible layout with StgInd
1312 case IND_OLDGEN_PERM:
1313 // follow indirections
1314 p = ((StgInd *)p)->indirectee;
1319 return ((StgEvacuated *)p)->evacuee;
1322 if (((StgTSO *)p)->what_next == ThreadRelocated) {
1323 p = (StgClosure *)((StgTSO *)p)->link;
1335 mark_root(StgClosure **root)
1337 *root = evacuate(*root);
1343 bdescr *bd = allocBlock();
1344 bd->gen_no = stp->gen_no;
1347 if (stp->gen_no <= N) {
1348 bd->flags = BF_EVACUATED;
1353 stp->hp_bd->free = stp->hp;
1354 stp->hp_bd->link = bd;
1355 stp->hp = bd->start;
1356 stp->hpLim = stp->hp + BLOCK_SIZE_W;
1363 static __inline__ void
1364 upd_evacuee(StgClosure *p, StgClosure *dest)
1366 p->header.info = &stg_EVACUATED_info;
1367 ((StgEvacuated *)p)->evacuee = dest;
1371 static __inline__ StgClosure *
1372 copy(StgClosure *src, nat size, step *stp)
1377 nat size_org = size;
1380 TICK_GC_WORDS_COPIED(size);
1381 /* Find out where we're going, using the handy "to" pointer in
1382 * the step of the source object. If it turns out we need to
1383 * evacuate to an older generation, adjust it here (see comment
1386 if (stp->gen_no < evac_gen) {
1387 #ifdef NO_EAGER_PROMOTION
1388 failed_to_evac = rtsTrue;
1390 stp = &generations[evac_gen].steps[0];
1394 /* chain a new block onto the to-space for the destination step if
1397 if (stp->hp + size >= stp->hpLim) {
1401 for(to = stp->hp, from = (P_)src; size>0; --size) {
1407 upd_evacuee(src,(StgClosure *)dest);
1409 // We store the size of the just evacuated object in the LDV word so that
1410 // the profiler can guess the position of the next object later.
1411 SET_EVACUAEE_FOR_LDV(src, size_org);
1413 return (StgClosure *)dest;
1416 /* Special version of copy() for when we only want to copy the info
1417 * pointer of an object, but reserve some padding after it. This is
1418 * used to optimise evacuation of BLACKHOLEs.
1423 copyPart(StgClosure *src, nat size_to_reserve, nat size_to_copy, step *stp)
1428 nat size_to_copy_org = size_to_copy;
1431 TICK_GC_WORDS_COPIED(size_to_copy);
1432 if (stp->gen_no < evac_gen) {
1433 #ifdef NO_EAGER_PROMOTION
1434 failed_to_evac = rtsTrue;
1436 stp = &generations[evac_gen].steps[0];
1440 if (stp->hp + size_to_reserve >= stp->hpLim) {
1444 for(to = stp->hp, from = (P_)src; size_to_copy>0; --size_to_copy) {
1449 stp->hp += size_to_reserve;
1450 upd_evacuee(src,(StgClosure *)dest);
1452 // We store the size of the just evacuated object in the LDV word so that
1453 // the profiler can guess the position of the next object later.
1454 // size_to_copy_org is wrong because the closure already occupies size_to_reserve
1456 SET_EVACUAEE_FOR_LDV(src, size_to_reserve);
1458 if (size_to_reserve - size_to_copy_org > 0)
1459 FILL_SLOP(stp->hp - 1, (int)(size_to_reserve - size_to_copy_org));
1461 return (StgClosure *)dest;
1465 /* -----------------------------------------------------------------------------
1466 Evacuate a large object
1468 This just consists of removing the object from the (doubly-linked)
1469 large_alloc_list, and linking it on to the (singly-linked)
1470 new_large_objects list, from where it will be scavenged later.
1472 Convention: bd->flags has BF_EVACUATED set for a large object
1473 that has been evacuated, or unset otherwise.
1474 -------------------------------------------------------------------------- */
1478 evacuate_large(StgPtr p)
1480 bdescr *bd = Bdescr(p);
1483 // object must be at the beginning of the block (or be a ByteArray)
1484 ASSERT(get_itbl((StgClosure *)p)->type == ARR_WORDS ||
1485 (((W_)p & BLOCK_MASK) == 0));
1487 // already evacuated?
1488 if (bd->flags & BF_EVACUATED) {
1489 /* Don't forget to set the failed_to_evac flag if we didn't get
1490 * the desired destination (see comments in evacuate()).
1492 if (bd->gen_no < evac_gen) {
1493 failed_to_evac = rtsTrue;
1494 TICK_GC_FAILED_PROMOTION();
1500 // remove from large_object list
1502 bd->u.back->link = bd->link;
1503 } else { // first object in the list
1504 stp->large_objects = bd->link;
1507 bd->link->u.back = bd->u.back;
1510 /* link it on to the evacuated large object list of the destination step
1513 if (stp->gen_no < evac_gen) {
1514 #ifdef NO_EAGER_PROMOTION
1515 failed_to_evac = rtsTrue;
1517 stp = &generations[evac_gen].steps[0];
1522 bd->gen_no = stp->gen_no;
1523 bd->link = stp->new_large_objects;
1524 stp->new_large_objects = bd;
1525 bd->flags |= BF_EVACUATED;
1528 /* -----------------------------------------------------------------------------
1529 Adding a MUT_CONS to an older generation.
1531 This is necessary from time to time when we end up with an
1532 old-to-new generation pointer in a non-mutable object. We defer
1533 the promotion until the next GC.
1534 -------------------------------------------------------------------------- */
1538 mkMutCons(StgClosure *ptr, generation *gen)
1543 stp = &gen->steps[0];
1545 /* chain a new block onto the to-space for the destination step if
1548 if (stp->hp + sizeofW(StgIndOldGen) >= stp->hpLim) {
1552 q = (StgMutVar *)stp->hp;
1553 stp->hp += sizeofW(StgMutVar);
1555 SET_HDR(q,&stg_MUT_CONS_info,CCS_GC);
1557 recordOldToNewPtrs((StgMutClosure *)q);
1559 return (StgClosure *)q;
1562 /* -----------------------------------------------------------------------------
1565 This is called (eventually) for every live object in the system.
1567 The caller to evacuate specifies a desired generation in the
1568 evac_gen global variable. The following conditions apply to
1569 evacuating an object which resides in generation M when we're
1570 collecting up to generation N
1574 else evac to step->to
1576 if M < evac_gen evac to evac_gen, step 0
1578 if the object is already evacuated, then we check which generation
1581 if M >= evac_gen do nothing
1582 if M < evac_gen set failed_to_evac flag to indicate that we
1583 didn't manage to evacuate this object into evac_gen.
1585 -------------------------------------------------------------------------- */
1588 evacuate(StgClosure *q)
1593 const StgInfoTable *info;
1596 if (HEAP_ALLOCED(q)) {
1599 // not a group head: find the group head
1600 if (bd->blocks == 0) { bd = bd->link; }
1602 if (bd->gen_no > N) {
1603 /* Can't evacuate this object, because it's in a generation
1604 * older than the ones we're collecting. Let's hope that it's
1605 * in evac_gen or older, or we will have to arrange to track
1606 * this pointer using the mutable list.
1608 if (bd->gen_no < evac_gen) {
1610 failed_to_evac = rtsTrue;
1611 TICK_GC_FAILED_PROMOTION();
1616 /* evacuate large objects by re-linking them onto a different list.
1618 if (bd->flags & BF_LARGE) {
1620 if (info->type == TSO &&
1621 ((StgTSO *)q)->what_next == ThreadRelocated) {
1622 q = (StgClosure *)((StgTSO *)q)->link;
1625 evacuate_large((P_)q);
1629 /* If the object is in a step that we're compacting, then we
1630 * need to use an alternative evacuate procedure.
1632 if (bd->step->is_compacted) {
1633 if (!is_marked((P_)q,bd)) {
1635 if (mark_stack_full()) {
1636 mark_stack_overflowed = rtsTrue;
1639 push_mark_stack((P_)q);
1647 else stp = NULL; // make sure copy() will crash if HEAP_ALLOCED is wrong
1650 // make sure the info pointer is into text space
1651 ASSERT(q && (LOOKS_LIKE_GHC_INFO(GET_INFO(q))
1652 || IS_HUGS_CONSTR_INFO(GET_INFO(q))));
1655 switch (info -> type) {
1659 to = copy(q,sizeW_fromITBL(info),stp);
1664 StgWord w = (StgWord)q->payload[0];
1665 if (q->header.info == Czh_con_info &&
1666 // unsigned, so always true: (StgChar)w >= MIN_CHARLIKE &&
1667 (StgChar)w <= MAX_CHARLIKE) {
1668 return (StgClosure *)CHARLIKE_CLOSURE((StgChar)w);
1670 if (q->header.info == Izh_con_info &&
1671 (StgInt)w >= MIN_INTLIKE && (StgInt)w <= MAX_INTLIKE) {
1672 return (StgClosure *)INTLIKE_CLOSURE((StgInt)w);
1674 // else, fall through ...
1680 return copy(q,sizeofW(StgHeader)+1,stp);
1682 case THUNK_1_0: // here because of MIN_UPD_SIZE
1687 #ifdef NO_PROMOTE_THUNKS
1688 if (bd->gen_no == 0 &&
1689 bd->step->no != 0 &&
1690 bd->step->no == generations[bd->gen_no].n_steps-1) {
1694 return copy(q,sizeofW(StgHeader)+2,stp);
1702 return copy(q,sizeofW(StgHeader)+2,stp);
1708 case IND_OLDGEN_PERM:
1713 return copy(q,sizeW_fromITBL(info),stp);
1716 case SE_CAF_BLACKHOLE:
1719 return copyPart(q,BLACKHOLE_sizeW(),sizeofW(StgHeader),stp);
1722 to = copy(q,BLACKHOLE_sizeW(),stp);
1725 case THUNK_SELECTOR:
1727 const StgInfoTable* selectee_info;
1728 StgClosure* selectee = ((StgSelector*)q)->selectee;
1731 selectee_info = get_itbl(selectee);
1732 switch (selectee_info->type) {
1740 case CONSTR_NOCAF_STATIC:
1742 StgWord offset = info->layout.selector_offset;
1744 // check that the size is in range
1746 (StgWord32)(selectee_info->layout.payload.ptrs +
1747 selectee_info->layout.payload.nptrs));
1749 // perform the selection!
1750 q = selectee->payload[offset];
1751 if (major_gc==rtsTrue) {TICK_GC_SEL_MAJOR();} else {TICK_GC_SEL_MINOR();}
1753 /* if we're already in to-space, there's no need to continue
1754 * with the evacuation, just update the source address with
1755 * a pointer to the (evacuated) constructor field.
1757 if (HEAP_ALLOCED(q)) {
1758 bdescr *bd = Bdescr((P_)q);
1759 if (bd->flags & BF_EVACUATED) {
1760 if (bd->gen_no < evac_gen) {
1761 failed_to_evac = rtsTrue;
1762 TICK_GC_FAILED_PROMOTION();
1768 /* otherwise, carry on and evacuate this constructor field,
1769 * (but not the constructor itself)
1778 case IND_OLDGEN_PERM:
1779 selectee = ((StgInd *)selectee)->indirectee;
1783 selectee = ((StgEvacuated *)selectee)->evacuee;
1786 case THUNK_SELECTOR:
1788 /* Disabled 03 April 2001 by JRS; it seems to cause the GC (or
1789 something) to go into an infinite loop when the nightly
1790 stage2 compiles PrelTup.lhs. */
1792 /* we can't recurse indefinitely in evacuate(), so set a
1793 * limit on the number of times we can go around this
1796 if (thunk_selector_depth < MAX_THUNK_SELECTOR_DEPTH) {
1798 bd = Bdescr((P_)selectee);
1799 if (!bd->flags & BF_EVACUATED) {
1800 thunk_selector_depth++;
1801 selectee = evacuate(selectee);
1802 thunk_selector_depth--;
1806 TICK_GC_SEL_ABANDONED();
1807 // and fall through...
1820 case SE_CAF_BLACKHOLE:
1824 // not evaluated yet
1828 // a copy of the top-level cases below
1829 case RBH: // cf. BLACKHOLE_BQ
1831 //StgInfoTable *rip = get_closure_info(q, &size, &ptrs, &nonptrs, &vhs, str);
1832 to = copy(q,BLACKHOLE_sizeW(),stp);
1833 //ToDo: derive size etc from reverted IP
1834 //to = copy(q,size,stp);
1835 // recordMutable((StgMutClosure *)to);
1840 ASSERT(sizeofW(StgBlockedFetch) >= MIN_NONUPD_SIZE);
1841 to = copy(q,sizeofW(StgBlockedFetch),stp);
1848 ASSERT(sizeofW(StgBlockedFetch) >= MIN_UPD_SIZE);
1849 to = copy(q,sizeofW(StgFetchMe),stp);
1853 ASSERT(sizeofW(StgBlockedFetch) >= MIN_UPD_SIZE);
1854 to = copy(q,sizeofW(StgFetchMeBlockingQueue),stp);
1859 barf("evacuate: THUNK_SELECTOR: strange selectee %d",
1860 (int)(selectee_info->type));
1863 return copy(q,THUNK_SELECTOR_sizeW(),stp);
1867 // follow chains of indirections, don't evacuate them
1868 q = ((StgInd*)q)->indirectee;
1872 if (info->srt_len > 0 && major_gc &&
1873 THUNK_STATIC_LINK((StgClosure *)q) == NULL) {
1874 THUNK_STATIC_LINK((StgClosure *)q) = static_objects;
1875 static_objects = (StgClosure *)q;
1880 if (info->srt_len > 0 && major_gc &&
1881 FUN_STATIC_LINK((StgClosure *)q) == NULL) {
1882 FUN_STATIC_LINK((StgClosure *)q) = static_objects;
1883 static_objects = (StgClosure *)q;
1888 /* If q->saved_info != NULL, then it's a revertible CAF - it'll be
1889 * on the CAF list, so don't do anything with it here (we'll
1890 * scavenge it later).
1893 && ((StgIndStatic *)q)->saved_info == NULL
1894 && IND_STATIC_LINK((StgClosure *)q) == NULL) {
1895 IND_STATIC_LINK((StgClosure *)q) = static_objects;
1896 static_objects = (StgClosure *)q;
1901 if (major_gc && STATIC_LINK(info,(StgClosure *)q) == NULL) {
1902 STATIC_LINK(info,(StgClosure *)q) = static_objects;
1903 static_objects = (StgClosure *)q;
1907 case CONSTR_INTLIKE:
1908 case CONSTR_CHARLIKE:
1909 case CONSTR_NOCAF_STATIC:
1910 /* no need to put these on the static linked list, they don't need
1925 // shouldn't see these
1926 barf("evacuate: stack frame at %p\n", q);
1930 /* PAPs and AP_UPDs are special - the payload is a copy of a chunk
1931 * of stack, tagging and all.
1933 return copy(q,pap_sizeW((StgPAP*)q),stp);
1936 /* Already evacuated, just return the forwarding address.
1937 * HOWEVER: if the requested destination generation (evac_gen) is
1938 * older than the actual generation (because the object was
1939 * already evacuated to a younger generation) then we have to
1940 * set the failed_to_evac flag to indicate that we couldn't
1941 * manage to promote the object to the desired generation.
1943 if (evac_gen > 0) { // optimisation
1944 StgClosure *p = ((StgEvacuated*)q)->evacuee;
1945 if (Bdescr((P_)p)->gen_no < evac_gen) {
1946 failed_to_evac = rtsTrue;
1947 TICK_GC_FAILED_PROMOTION();
1950 return ((StgEvacuated*)q)->evacuee;
1953 // just copy the block
1954 return copy(q,arr_words_sizeW((StgArrWords *)q),stp);
1957 case MUT_ARR_PTRS_FROZEN:
1958 // just copy the block
1959 return copy(q,mut_arr_ptrs_sizeW((StgMutArrPtrs *)q),stp);
1963 StgTSO *tso = (StgTSO *)q;
1965 /* Deal with redirected TSOs (a TSO that's had its stack enlarged).
1967 if (tso->what_next == ThreadRelocated) {
1968 q = (StgClosure *)tso->link;
1972 /* To evacuate a small TSO, we need to relocate the update frame
1976 StgTSO *new_tso = (StgTSO *)copy((StgClosure *)tso,tso_sizeW(tso),stp);
1977 move_TSO(tso, new_tso);
1978 return (StgClosure *)new_tso;
1983 case RBH: // cf. BLACKHOLE_BQ
1985 //StgInfoTable *rip = get_closure_info(q, &size, &ptrs, &nonptrs, &vhs, str);
1986 to = copy(q,BLACKHOLE_sizeW(),stp);
1987 //ToDo: derive size etc from reverted IP
1988 //to = copy(q,size,stp);
1990 belch("@@ evacuate: RBH %p (%s) to %p (%s)",
1991 q, info_type(q), to, info_type(to)));
1996 ASSERT(sizeofW(StgBlockedFetch) >= MIN_NONUPD_SIZE);
1997 to = copy(q,sizeofW(StgBlockedFetch),stp);
1999 belch("@@ evacuate: %p (%s) to %p (%s)",
2000 q, info_type(q), to, info_type(to)));
2007 ASSERT(sizeofW(StgBlockedFetch) >= MIN_UPD_SIZE);
2008 to = copy(q,sizeofW(StgFetchMe),stp);
2010 belch("@@ evacuate: %p (%s) to %p (%s)",
2011 q, info_type(q), to, info_type(to)));
2015 ASSERT(sizeofW(StgBlockedFetch) >= MIN_UPD_SIZE);
2016 to = copy(q,sizeofW(StgFetchMeBlockingQueue),stp);
2018 belch("@@ evacuate: %p (%s) to %p (%s)",
2019 q, info_type(q), to, info_type(to)));
2024 barf("evacuate: strange closure type %d", (int)(info->type));
2030 /* -----------------------------------------------------------------------------
2031 move_TSO is called to update the TSO structure after it has been
2032 moved from one place to another.
2033 -------------------------------------------------------------------------- */
2036 move_TSO(StgTSO *src, StgTSO *dest)
2040 // relocate the stack pointers...
2041 diff = (StgPtr)dest - (StgPtr)src; // In *words*
2042 dest->sp = (StgPtr)dest->sp + diff;
2043 dest->su = (StgUpdateFrame *) ((P_)dest->su + diff);
2045 relocate_stack(dest, diff);
2048 /* -----------------------------------------------------------------------------
2049 relocate_stack is called to update the linkage between
2050 UPDATE_FRAMEs (and SEQ_FRAMEs etc.) when a stack is moved from one
2052 -------------------------------------------------------------------------- */
2055 relocate_stack(StgTSO *dest, ptrdiff_t diff)
2063 while ((P_)su < dest->stack + dest->stack_size) {
2064 switch (get_itbl(su)->type) {
2066 // GCC actually manages to common up these three cases!
2069 su->link = (StgUpdateFrame *) ((StgPtr)su->link + diff);
2074 cf = (StgCatchFrame *)su;
2075 cf->link = (StgUpdateFrame *) ((StgPtr)cf->link + diff);
2080 sf = (StgSeqFrame *)su;
2081 sf->link = (StgUpdateFrame *) ((StgPtr)sf->link + diff);
2090 barf("relocate_stack %d", (int)(get_itbl(su)->type));
2101 scavenge_srt(const StgInfoTable *info)
2103 StgClosure **srt, **srt_end;
2105 /* evacuate the SRT. If srt_len is zero, then there isn't an
2106 * srt field in the info table. That's ok, because we'll
2107 * never dereference it.
2109 srt = (StgClosure **)(info->srt);
2110 srt_end = srt + info->srt_len;
2111 for (; srt < srt_end; srt++) {
2112 /* Special-case to handle references to closures hiding out in DLLs, since
2113 double indirections required to get at those. The code generator knows
2114 which is which when generating the SRT, so it stores the (indirect)
2115 reference to the DLL closure in the table by first adding one to it.
2116 We check for this here, and undo the addition before evacuating it.
2118 If the SRT entry hasn't got bit 0 set, the SRT entry points to a
2119 closure that's fixed at link-time, and no extra magic is required.
2121 #ifdef ENABLE_WIN32_DLL_SUPPORT
2122 if ( (unsigned long)(*srt) & 0x1 ) {
2123 evacuate(*stgCast(StgClosure**,(stgCast(unsigned long, *srt) & ~0x1)));
2133 /* -----------------------------------------------------------------------------
2135 -------------------------------------------------------------------------- */
2138 scavengeTSO (StgTSO *tso)
2140 // chase the link field for any TSOs on the same queue
2141 (StgClosure *)tso->link = evacuate((StgClosure *)tso->link);
2142 if ( tso->why_blocked == BlockedOnMVar
2143 || tso->why_blocked == BlockedOnBlackHole
2144 || tso->why_blocked == BlockedOnException
2146 || tso->why_blocked == BlockedOnGA
2147 || tso->why_blocked == BlockedOnGA_NoSend
2150 tso->block_info.closure = evacuate(tso->block_info.closure);
2152 if ( tso->blocked_exceptions != NULL ) {
2153 tso->blocked_exceptions =
2154 (StgTSO *)evacuate((StgClosure *)tso->blocked_exceptions);
2156 // scavenge this thread's stack
2157 scavenge_stack(tso->sp, &(tso->stack[tso->stack_size]));
2160 /* -----------------------------------------------------------------------------
2161 Scavenge a given step until there are no more objects in this step
2164 evac_gen is set by the caller to be either zero (for a step in a
2165 generation < N) or G where G is the generation of the step being
2168 We sometimes temporarily change evac_gen back to zero if we're
2169 scavenging a mutable object where early promotion isn't such a good
2171 -------------------------------------------------------------------------- */
2179 nat saved_evac_gen = evac_gen;
2184 failed_to_evac = rtsFalse;
2186 /* scavenge phase - standard breadth-first scavenging of the
2190 while (bd != stp->hp_bd || p < stp->hp) {
2192 // If we're at the end of this block, move on to the next block
2193 if (bd != stp->hp_bd && p == bd->free) {
2199 info = get_itbl((StgClosure *)p);
2200 ASSERT(p && (LOOKS_LIKE_GHC_INFO(info) || IS_HUGS_CONSTR_INFO(info)));
2203 switch (info->type) {
2206 /* treat MVars specially, because we don't want to evacuate the
2207 * mut_link field in the middle of the closure.
2210 StgMVar *mvar = ((StgMVar *)p);
2212 (StgClosure *)mvar->head = evacuate((StgClosure *)mvar->head);
2213 (StgClosure *)mvar->tail = evacuate((StgClosure *)mvar->tail);
2214 (StgClosure *)mvar->value = evacuate((StgClosure *)mvar->value);
2215 evac_gen = saved_evac_gen;
2216 recordMutable((StgMutClosure *)mvar);
2217 failed_to_evac = rtsFalse; // mutable.
2218 p += sizeofW(StgMVar);
2226 ((StgClosure *)p)->payload[1] = evacuate(((StgClosure *)p)->payload[1]);
2227 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2228 p += sizeofW(StgHeader) + 2;
2233 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2234 p += sizeofW(StgHeader) + 2; // MIN_UPD_SIZE
2240 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2241 p += sizeofW(StgHeader) + 1;
2246 p += sizeofW(StgHeader) + 2; // MIN_UPD_SIZE
2252 p += sizeofW(StgHeader) + 1;
2259 p += sizeofW(StgHeader) + 2;
2266 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2267 p += sizeofW(StgHeader) + 2;
2283 end = (P_)((StgClosure *)p)->payload + info->layout.payload.ptrs;
2284 for (p = (P_)((StgClosure *)p)->payload; p < end; p++) {
2285 (StgClosure *)*p = evacuate((StgClosure *)*p);
2287 p += info->layout.payload.nptrs;
2292 if (stp->gen->no != 0) {
2295 // No need to call LDV_recordDead_FILL_SLOP_DYNAMIC() because an
2296 // IND_OLDGEN_PERM closure is larger than an IND_PERM closure.
2297 LDV_recordDead((StgClosure *)p, sizeofW(StgInd));
2300 // Todo: maybe use SET_HDR() and remove LDV_recordCreate()?
2302 SET_INFO(((StgClosure *)p), &stg_IND_OLDGEN_PERM_info);
2305 // We pretend that p has just been created.
2306 LDV_recordCreate((StgClosure *)p);
2310 case IND_OLDGEN_PERM:
2311 ((StgIndOldGen *)p)->indirectee =
2312 evacuate(((StgIndOldGen *)p)->indirectee);
2313 if (failed_to_evac) {
2314 failed_to_evac = rtsFalse;
2315 recordOldToNewPtrs((StgMutClosure *)p);
2317 p += sizeofW(StgIndOldGen);
2322 ((StgMutVar *)p)->var = evacuate(((StgMutVar *)p)->var);
2323 evac_gen = saved_evac_gen;
2324 recordMutable((StgMutClosure *)p);
2325 failed_to_evac = rtsFalse; // mutable anyhow
2326 p += sizeofW(StgMutVar);
2331 failed_to_evac = rtsFalse; // mutable anyhow
2332 p += sizeofW(StgMutVar);
2336 case SE_CAF_BLACKHOLE:
2339 p += BLACKHOLE_sizeW();
2344 StgBlockingQueue *bh = (StgBlockingQueue *)p;
2345 (StgClosure *)bh->blocking_queue =
2346 evacuate((StgClosure *)bh->blocking_queue);
2347 recordMutable((StgMutClosure *)bh);
2348 failed_to_evac = rtsFalse;
2349 p += BLACKHOLE_sizeW();
2353 case THUNK_SELECTOR:
2355 StgSelector *s = (StgSelector *)p;
2356 s->selectee = evacuate(s->selectee);
2357 p += THUNK_SELECTOR_sizeW();
2361 case AP_UPD: // same as PAPs
2363 /* Treat a PAP just like a section of stack, not forgetting to
2364 * evacuate the function pointer too...
2367 StgPAP* pap = (StgPAP *)p;
2369 pap->fun = evacuate(pap->fun);
2370 scavenge_stack((P_)pap->payload, (P_)pap->payload + pap->n_args);
2371 p += pap_sizeW(pap);
2376 // nothing to follow
2377 p += arr_words_sizeW((StgArrWords *)p);
2381 // follow everything
2385 evac_gen = 0; // repeatedly mutable
2386 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2387 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2388 (StgClosure *)*p = evacuate((StgClosure *)*p);
2390 evac_gen = saved_evac_gen;
2391 recordMutable((StgMutClosure *)q);
2392 failed_to_evac = rtsFalse; // mutable anyhow.
2396 case MUT_ARR_PTRS_FROZEN:
2397 // follow everything
2401 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2402 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2403 (StgClosure *)*p = evacuate((StgClosure *)*p);
2405 // it's tempting to recordMutable() if failed_to_evac is
2406 // false, but that breaks some assumptions (eg. every
2407 // closure on the mutable list is supposed to have the MUT
2408 // flag set, and MUT_ARR_PTRS_FROZEN doesn't).
2414 StgTSO *tso = (StgTSO *)p;
2417 evac_gen = saved_evac_gen;
2418 recordMutable((StgMutClosure *)tso);
2419 failed_to_evac = rtsFalse; // mutable anyhow.
2420 p += tso_sizeW(tso);
2425 case RBH: // cf. BLACKHOLE_BQ
2428 nat size, ptrs, nonptrs, vhs;
2430 StgInfoTable *rip = get_closure_info(p, &size, &ptrs, &nonptrs, &vhs, str);
2432 StgRBH *rbh = (StgRBH *)p;
2433 (StgClosure *)rbh->blocking_queue =
2434 evacuate((StgClosure *)rbh->blocking_queue);
2435 recordMutable((StgMutClosure *)to);
2436 failed_to_evac = rtsFalse; // mutable anyhow.
2438 belch("@@ scavenge: RBH %p (%s) (new blocking_queue link=%p)",
2439 p, info_type(p), (StgClosure *)rbh->blocking_queue));
2440 // ToDo: use size of reverted closure here!
2441 p += BLACKHOLE_sizeW();
2447 StgBlockedFetch *bf = (StgBlockedFetch *)p;
2448 // follow the pointer to the node which is being demanded
2449 (StgClosure *)bf->node =
2450 evacuate((StgClosure *)bf->node);
2451 // follow the link to the rest of the blocking queue
2452 (StgClosure *)bf->link =
2453 evacuate((StgClosure *)bf->link);
2454 if (failed_to_evac) {
2455 failed_to_evac = rtsFalse;
2456 recordMutable((StgMutClosure *)bf);
2459 belch("@@ scavenge: %p (%s); node is now %p; exciting, isn't it",
2460 bf, info_type((StgClosure *)bf),
2461 bf->node, info_type(bf->node)));
2462 p += sizeofW(StgBlockedFetch);
2470 p += sizeofW(StgFetchMe);
2471 break; // nothing to do in this case
2473 case FETCH_ME_BQ: // cf. BLACKHOLE_BQ
2475 StgFetchMeBlockingQueue *fmbq = (StgFetchMeBlockingQueue *)p;
2476 (StgClosure *)fmbq->blocking_queue =
2477 evacuate((StgClosure *)fmbq->blocking_queue);
2478 if (failed_to_evac) {
2479 failed_to_evac = rtsFalse;
2480 recordMutable((StgMutClosure *)fmbq);
2483 belch("@@ scavenge: %p (%s) exciting, isn't it",
2484 p, info_type((StgClosure *)p)));
2485 p += sizeofW(StgFetchMeBlockingQueue);
2491 barf("scavenge: unimplemented/strange closure type %d @ %p",
2495 /* If we didn't manage to promote all the objects pointed to by
2496 * the current object, then we have to designate this object as
2497 * mutable (because it contains old-to-new generation pointers).
2499 if (failed_to_evac) {
2500 failed_to_evac = rtsFalse;
2501 mkMutCons((StgClosure *)q, &generations[evac_gen]);
2509 /* -----------------------------------------------------------------------------
2510 Scavenge everything on the mark stack.
2512 This is slightly different from scavenge():
2513 - we don't walk linearly through the objects, so the scavenger
2514 doesn't need to advance the pointer on to the next object.
2515 -------------------------------------------------------------------------- */
2518 scavenge_mark_stack(void)
2524 evac_gen = oldest_gen->no;
2525 saved_evac_gen = evac_gen;
2528 while (!mark_stack_empty()) {
2529 p = pop_mark_stack();
2531 info = get_itbl((StgClosure *)p);
2532 ASSERT(p && (LOOKS_LIKE_GHC_INFO(info) || IS_HUGS_CONSTR_INFO(info)));
2535 switch (info->type) {
2538 /* treat MVars specially, because we don't want to evacuate the
2539 * mut_link field in the middle of the closure.
2542 StgMVar *mvar = ((StgMVar *)p);
2544 (StgClosure *)mvar->head = evacuate((StgClosure *)mvar->head);
2545 (StgClosure *)mvar->tail = evacuate((StgClosure *)mvar->tail);
2546 (StgClosure *)mvar->value = evacuate((StgClosure *)mvar->value);
2547 evac_gen = saved_evac_gen;
2548 failed_to_evac = rtsFalse; // mutable.
2556 ((StgClosure *)p)->payload[1] = evacuate(((StgClosure *)p)->payload[1]);
2557 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2567 ((StgClosure *)p)->payload[0] = evacuate(((StgClosure *)p)->payload[0]);
2592 end = (P_)((StgClosure *)p)->payload + info->layout.payload.ptrs;
2593 for (p = (P_)((StgClosure *)p)->payload; p < end; p++) {
2594 (StgClosure *)*p = evacuate((StgClosure *)*p);
2600 // don't need to do anything here: the only possible case
2601 // is that we're in a 1-space compacting collector, with
2602 // no "old" generation.
2606 case IND_OLDGEN_PERM:
2607 ((StgIndOldGen *)p)->indirectee =
2608 evacuate(((StgIndOldGen *)p)->indirectee);
2609 if (failed_to_evac) {
2610 recordOldToNewPtrs((StgMutClosure *)p);
2612 failed_to_evac = rtsFalse;
2617 ((StgMutVar *)p)->var = evacuate(((StgMutVar *)p)->var);
2618 evac_gen = saved_evac_gen;
2619 failed_to_evac = rtsFalse;
2624 failed_to_evac = rtsFalse;
2628 case SE_CAF_BLACKHOLE:
2636 StgBlockingQueue *bh = (StgBlockingQueue *)p;
2637 (StgClosure *)bh->blocking_queue =
2638 evacuate((StgClosure *)bh->blocking_queue);
2639 failed_to_evac = rtsFalse;
2643 case THUNK_SELECTOR:
2645 StgSelector *s = (StgSelector *)p;
2646 s->selectee = evacuate(s->selectee);
2650 case AP_UPD: // same as PAPs
2652 /* Treat a PAP just like a section of stack, not forgetting to
2653 * evacuate the function pointer too...
2656 StgPAP* pap = (StgPAP *)p;
2658 pap->fun = evacuate(pap->fun);
2659 scavenge_stack((P_)pap->payload, (P_)pap->payload + pap->n_args);
2664 // follow everything
2668 evac_gen = 0; // repeatedly mutable
2669 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2670 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2671 (StgClosure *)*p = evacuate((StgClosure *)*p);
2673 evac_gen = saved_evac_gen;
2674 failed_to_evac = rtsFalse; // mutable anyhow.
2678 case MUT_ARR_PTRS_FROZEN:
2679 // follow everything
2683 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2684 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2685 (StgClosure *)*p = evacuate((StgClosure *)*p);
2692 StgTSO *tso = (StgTSO *)p;
2695 evac_gen = saved_evac_gen;
2696 failed_to_evac = rtsFalse;
2701 case RBH: // cf. BLACKHOLE_BQ
2704 nat size, ptrs, nonptrs, vhs;
2706 StgInfoTable *rip = get_closure_info(p, &size, &ptrs, &nonptrs, &vhs, str);
2708 StgRBH *rbh = (StgRBH *)p;
2709 (StgClosure *)rbh->blocking_queue =
2710 evacuate((StgClosure *)rbh->blocking_queue);
2711 recordMutable((StgMutClosure *)rbh);
2712 failed_to_evac = rtsFalse; // mutable anyhow.
2714 belch("@@ scavenge: RBH %p (%s) (new blocking_queue link=%p)",
2715 p, info_type(p), (StgClosure *)rbh->blocking_queue));
2721 StgBlockedFetch *bf = (StgBlockedFetch *)p;
2722 // follow the pointer to the node which is being demanded
2723 (StgClosure *)bf->node =
2724 evacuate((StgClosure *)bf->node);
2725 // follow the link to the rest of the blocking queue
2726 (StgClosure *)bf->link =
2727 evacuate((StgClosure *)bf->link);
2728 if (failed_to_evac) {
2729 failed_to_evac = rtsFalse;
2730 recordMutable((StgMutClosure *)bf);
2733 belch("@@ scavenge: %p (%s); node is now %p; exciting, isn't it",
2734 bf, info_type((StgClosure *)bf),
2735 bf->node, info_type(bf->node)));
2743 break; // nothing to do in this case
2745 case FETCH_ME_BQ: // cf. BLACKHOLE_BQ
2747 StgFetchMeBlockingQueue *fmbq = (StgFetchMeBlockingQueue *)p;
2748 (StgClosure *)fmbq->blocking_queue =
2749 evacuate((StgClosure *)fmbq->blocking_queue);
2750 if (failed_to_evac) {
2751 failed_to_evac = rtsFalse;
2752 recordMutable((StgMutClosure *)fmbq);
2755 belch("@@ scavenge: %p (%s) exciting, isn't it",
2756 p, info_type((StgClosure *)p)));
2762 barf("scavenge_mark_stack: unimplemented/strange closure type %d @ %p",
2766 if (failed_to_evac) {
2767 failed_to_evac = rtsFalse;
2768 mkMutCons((StgClosure *)q, &generations[evac_gen]);
2771 // mark the next bit to indicate "scavenged"
2772 mark(q+1, Bdescr(q));
2774 } // while (!mark_stack_empty())
2776 // start a new linear scan if the mark stack overflowed at some point
2777 if (mark_stack_overflowed && oldgen_scan_bd == NULL) {
2778 IF_DEBUG(gc, belch("scavenge_mark_stack: starting linear scan"));
2779 mark_stack_overflowed = rtsFalse;
2780 oldgen_scan_bd = oldest_gen->steps[0].blocks;
2781 oldgen_scan = oldgen_scan_bd->start;
2784 if (oldgen_scan_bd) {
2785 // push a new thing on the mark stack
2787 // find a closure that is marked but not scavenged, and start
2789 while (oldgen_scan < oldgen_scan_bd->free
2790 && !is_marked(oldgen_scan,oldgen_scan_bd)) {
2794 if (oldgen_scan < oldgen_scan_bd->free) {
2796 // already scavenged?
2797 if (is_marked(oldgen_scan+1,oldgen_scan_bd)) {
2798 oldgen_scan += sizeofW(StgHeader) + MIN_NONUPD_SIZE;
2801 push_mark_stack(oldgen_scan);
2802 // ToDo: bump the linear scan by the actual size of the object
2803 oldgen_scan += sizeofW(StgHeader) + MIN_NONUPD_SIZE;
2807 oldgen_scan_bd = oldgen_scan_bd->link;
2808 if (oldgen_scan_bd != NULL) {
2809 oldgen_scan = oldgen_scan_bd->start;
2815 /* -----------------------------------------------------------------------------
2816 Scavenge one object.
2818 This is used for objects that are temporarily marked as mutable
2819 because they contain old-to-new generation pointers. Only certain
2820 objects can have this property.
2821 -------------------------------------------------------------------------- */
2824 scavenge_one(StgPtr p)
2826 const StgInfoTable *info;
2827 nat saved_evac_gen = evac_gen;
2830 ASSERT(p && (LOOKS_LIKE_GHC_INFO(GET_INFO((StgClosure *)p))
2831 || IS_HUGS_CONSTR_INFO(GET_INFO((StgClosure *)p))));
2833 info = get_itbl((StgClosure *)p);
2835 switch (info->type) {
2838 case FUN_1_0: // hardly worth specialising these guys
2858 case IND_OLDGEN_PERM:
2862 end = (StgPtr)((StgClosure *)p)->payload + info->layout.payload.ptrs;
2863 for (q = (StgPtr)((StgClosure *)p)->payload; q < end; q++) {
2864 (StgClosure *)*q = evacuate((StgClosure *)*q);
2870 case SE_CAF_BLACKHOLE:
2875 case THUNK_SELECTOR:
2877 StgSelector *s = (StgSelector *)p;
2878 s->selectee = evacuate(s->selectee);
2883 // nothing to follow
2888 // follow everything
2891 evac_gen = 0; // repeatedly mutable
2892 recordMutable((StgMutClosure *)p);
2893 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2894 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2895 (StgClosure *)*p = evacuate((StgClosure *)*p);
2897 evac_gen = saved_evac_gen;
2898 failed_to_evac = rtsFalse;
2902 case MUT_ARR_PTRS_FROZEN:
2904 // follow everything
2907 next = p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
2908 for (p = (P_)((StgMutArrPtrs *)p)->payload; p < next; p++) {
2909 (StgClosure *)*p = evacuate((StgClosure *)*p);
2916 StgTSO *tso = (StgTSO *)p;
2918 evac_gen = 0; // repeatedly mutable
2920 recordMutable((StgMutClosure *)tso);
2921 evac_gen = saved_evac_gen;
2922 failed_to_evac = rtsFalse;
2929 StgPAP* pap = (StgPAP *)p;
2930 pap->fun = evacuate(pap->fun);
2931 scavenge_stack((P_)pap->payload, (P_)pap->payload + pap->n_args);
2936 // This might happen if for instance a MUT_CONS was pointing to a
2937 // THUNK which has since been updated. The IND_OLDGEN will
2938 // be on the mutable list anyway, so we don't need to do anything
2943 barf("scavenge_one: strange object %d", (int)(info->type));
2946 no_luck = failed_to_evac;
2947 failed_to_evac = rtsFalse;
2951 /* -----------------------------------------------------------------------------
2952 Scavenging mutable lists.
2954 We treat the mutable list of each generation > N (i.e. all the
2955 generations older than the one being collected) as roots. We also
2956 remove non-mutable objects from the mutable list at this point.
2957 -------------------------------------------------------------------------- */
2960 scavenge_mut_once_list(generation *gen)
2962 const StgInfoTable *info;
2963 StgMutClosure *p, *next, *new_list;
2965 p = gen->mut_once_list;
2966 new_list = END_MUT_LIST;
2970 failed_to_evac = rtsFalse;
2972 for (; p != END_MUT_LIST; p = next, next = p->mut_link) {
2974 // make sure the info pointer is into text space
2975 ASSERT(p && (LOOKS_LIKE_GHC_INFO(GET_INFO(p))
2976 || IS_HUGS_CONSTR_INFO(GET_INFO(p))));
2980 if (info->type==RBH)
2981 info = REVERT_INFOPTR(info); // if it's an RBH, look at the orig closure
2983 switch(info->type) {
2986 case IND_OLDGEN_PERM:
2988 /* Try to pull the indirectee into this generation, so we can
2989 * remove the indirection from the mutable list.
2991 ((StgIndOldGen *)p)->indirectee =
2992 evacuate(((StgIndOldGen *)p)->indirectee);
2994 #if 0 && defined(DEBUG)
2995 if (RtsFlags.DebugFlags.gc)
2996 /* Debugging code to print out the size of the thing we just
3000 StgPtr start = gen->steps[0].scan;
3001 bdescr *start_bd = gen->steps[0].scan_bd;
3003 scavenge(&gen->steps[0]);
3004 if (start_bd != gen->steps[0].scan_bd) {
3005 size += (P_)BLOCK_ROUND_UP(start) - start;
3006 start_bd = start_bd->link;
3007 while (start_bd != gen->steps[0].scan_bd) {
3008 size += BLOCK_SIZE_W;
3009 start_bd = start_bd->link;
3011 size += gen->steps[0].scan -
3012 (P_)BLOCK_ROUND_DOWN(gen->steps[0].scan);
3014 size = gen->steps[0].scan - start;
3016 belch("evac IND_OLDGEN: %ld bytes", size * sizeof(W_));
3020 /* failed_to_evac might happen if we've got more than two
3021 * generations, we're collecting only generation 0, the
3022 * indirection resides in generation 2 and the indirectee is
3025 if (failed_to_evac) {
3026 failed_to_evac = rtsFalse;
3027 p->mut_link = new_list;
3030 /* the mut_link field of an IND_STATIC is overloaded as the
3031 * static link field too (it just so happens that we don't need
3032 * both at the same time), so we need to NULL it out when
3033 * removing this object from the mutable list because the static
3034 * link fields are all assumed to be NULL before doing a major
3042 /* MUT_CONS is a kind of MUT_VAR, except it that we try to remove
3043 * it from the mutable list if possible by promoting whatever it
3046 if (scavenge_one((StgPtr)((StgMutVar *)p)->var)) {
3047 /* didn't manage to promote everything, so put the
3048 * MUT_CONS back on the list.
3050 p->mut_link = new_list;
3056 // shouldn't have anything else on the mutables list
3057 barf("scavenge_mut_once_list: strange object? %d", (int)(info->type));
3061 gen->mut_once_list = new_list;
3066 scavenge_mutable_list(generation *gen)
3068 const StgInfoTable *info;
3069 StgMutClosure *p, *next;
3071 p = gen->saved_mut_list;
3075 failed_to_evac = rtsFalse;
3077 for (; p != END_MUT_LIST; p = next, next = p->mut_link) {
3079 // make sure the info pointer is into text space
3080 ASSERT(p && (LOOKS_LIKE_GHC_INFO(GET_INFO(p))
3081 || IS_HUGS_CONSTR_INFO(GET_INFO(p))));
3085 if (info->type==RBH)
3086 info = REVERT_INFOPTR(info); // if it's an RBH, look at the orig closure
3088 switch(info->type) {
3091 // follow everything
3092 p->mut_link = gen->mut_list;
3097 end = (P_)p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
3098 for (q = (P_)((StgMutArrPtrs *)p)->payload; q < end; q++) {
3099 (StgClosure *)*q = evacuate((StgClosure *)*q);
3104 // Happens if a MUT_ARR_PTRS in the old generation is frozen
3105 case MUT_ARR_PTRS_FROZEN:
3110 end = (P_)p + mut_arr_ptrs_sizeW((StgMutArrPtrs*)p);
3111 for (q = (P_)((StgMutArrPtrs *)p)->payload; q < end; q++) {
3112 (StgClosure *)*q = evacuate((StgClosure *)*q);
3116 if (failed_to_evac) {
3117 failed_to_evac = rtsFalse;
3118 mkMutCons((StgClosure *)p, gen);
3124 ((StgMutVar *)p)->var = evacuate(((StgMutVar *)p)->var);
3125 p->mut_link = gen->mut_list;
3131 StgMVar *mvar = (StgMVar *)p;
3132 (StgClosure *)mvar->head = evacuate((StgClosure *)mvar->head);
3133 (StgClosure *)mvar->tail = evacuate((StgClosure *)mvar->tail);
3134 (StgClosure *)mvar->value = evacuate((StgClosure *)mvar->value);
3135 p->mut_link = gen->mut_list;
3142 StgTSO *tso = (StgTSO *)p;
3146 /* Don't take this TSO off the mutable list - it might still
3147 * point to some younger objects (because we set evac_gen to 0
3150 tso->mut_link = gen->mut_list;
3151 gen->mut_list = (StgMutClosure *)tso;
3157 StgBlockingQueue *bh = (StgBlockingQueue *)p;
3158 (StgClosure *)bh->blocking_queue =
3159 evacuate((StgClosure *)bh->blocking_queue);
3160 p->mut_link = gen->mut_list;
3165 /* Happens if a BLACKHOLE_BQ in the old generation is updated:
3168 case IND_OLDGEN_PERM:
3169 /* Try to pull the indirectee into this generation, so we can
3170 * remove the indirection from the mutable list.
3173 ((StgIndOldGen *)p)->indirectee =
3174 evacuate(((StgIndOldGen *)p)->indirectee);
3177 if (failed_to_evac) {
3178 failed_to_evac = rtsFalse;
3179 p->mut_link = gen->mut_once_list;
3180 gen->mut_once_list = p;
3187 // HWL: check whether all of these are necessary
3189 case RBH: // cf. BLACKHOLE_BQ
3191 // nat size, ptrs, nonptrs, vhs;
3193 // StgInfoTable *rip = get_closure_info(p, &size, &ptrs, &nonptrs, &vhs, str);
3194 StgRBH *rbh = (StgRBH *)p;
3195 (StgClosure *)rbh->blocking_queue =
3196 evacuate((StgClosure *)rbh->blocking_queue);
3197 if (failed_to_evac) {
3198 failed_to_evac = rtsFalse;
3199 recordMutable((StgMutClosure *)rbh);
3201 // ToDo: use size of reverted closure here!
3202 p += BLACKHOLE_sizeW();
3208 StgBlockedFetch *bf = (StgBlockedFetch *)p;
3209 // follow the pointer to the node which is being demanded
3210 (StgClosure *)bf->node =
3211 evacuate((StgClosure *)bf->node);
3212 // follow the link to the rest of the blocking queue
3213 (StgClosure *)bf->link =
3214 evacuate((StgClosure *)bf->link);
3215 if (failed_to_evac) {
3216 failed_to_evac = rtsFalse;
3217 recordMutable((StgMutClosure *)bf);
3219 p += sizeofW(StgBlockedFetch);
3225 barf("scavenge_mutable_list: REMOTE_REF %d", (int)(info->type));
3228 p += sizeofW(StgFetchMe);
3229 break; // nothing to do in this case
3231 case FETCH_ME_BQ: // cf. BLACKHOLE_BQ
3233 StgFetchMeBlockingQueue *fmbq = (StgFetchMeBlockingQueue *)p;
3234 (StgClosure *)fmbq->blocking_queue =
3235 evacuate((StgClosure *)fmbq->blocking_queue);
3236 if (failed_to_evac) {
3237 failed_to_evac = rtsFalse;
3238 recordMutable((StgMutClosure *)fmbq);
3240 p += sizeofW(StgFetchMeBlockingQueue);
3246 // shouldn't have anything else on the mutables list
3247 barf("scavenge_mutable_list: strange object? %d", (int)(info->type));
3254 scavenge_static(void)
3256 StgClosure* p = static_objects;
3257 const StgInfoTable *info;
3259 /* Always evacuate straight to the oldest generation for static
3261 evac_gen = oldest_gen->no;
3263 /* keep going until we've scavenged all the objects on the linked
3265 while (p != END_OF_STATIC_LIST) {
3269 if (info->type==RBH)
3270 info = REVERT_INFOPTR(info); // if it's an RBH, look at the orig closure
3272 // make sure the info pointer is into text space
3273 ASSERT(p && (LOOKS_LIKE_GHC_INFO(GET_INFO(p))
3274 || IS_HUGS_CONSTR_INFO(GET_INFO(p))));
3276 /* Take this object *off* the static_objects list,
3277 * and put it on the scavenged_static_objects list.
3279 static_objects = STATIC_LINK(info,p);
3280 STATIC_LINK(info,p) = scavenged_static_objects;
3281 scavenged_static_objects = p;
3283 switch (info -> type) {
3287 StgInd *ind = (StgInd *)p;
3288 ind->indirectee = evacuate(ind->indirectee);
3290 /* might fail to evacuate it, in which case we have to pop it
3291 * back on the mutable list (and take it off the
3292 * scavenged_static list because the static link and mut link
3293 * pointers are one and the same).
3295 if (failed_to_evac) {
3296 failed_to_evac = rtsFalse;
3297 scavenged_static_objects = IND_STATIC_LINK(p);
3298 ((StgMutClosure *)ind)->mut_link = oldest_gen->mut_once_list;
3299 oldest_gen->mut_once_list = (StgMutClosure *)ind;
3313 next = (P_)p->payload + info->layout.payload.ptrs;
3314 // evacuate the pointers
3315 for (q = (P_)p->payload; q < next; q++) {
3316 (StgClosure *)*q = evacuate((StgClosure *)*q);
3322 barf("scavenge_static: strange closure %d", (int)(info->type));
3325 ASSERT(failed_to_evac == rtsFalse);
3327 /* get the next static object from the list. Remember, there might
3328 * be more stuff on this list now that we've done some evacuating!
3329 * (static_objects is a global)
3335 /* -----------------------------------------------------------------------------
3336 scavenge_stack walks over a section of stack and evacuates all the
3337 objects pointed to by it. We can use the same code for walking
3338 PAPs, since these are just sections of copied stack.
3339 -------------------------------------------------------------------------- */
3342 scavenge_stack(StgPtr p, StgPtr stack_end)
3345 const StgInfoTable* info;
3348 //IF_DEBUG(sanity, belch(" scavenging stack between %p and %p", p, stack_end));
3351 * Each time around this loop, we are looking at a chunk of stack
3352 * that starts with either a pending argument section or an
3353 * activation record.
3356 while (p < stack_end) {
3359 // If we've got a tag, skip over that many words on the stack
3360 if (IS_ARG_TAG((W_)q)) {
3365 /* Is q a pointer to a closure?
3367 if (! LOOKS_LIKE_GHC_INFO(q) ) {
3369 if ( 0 && LOOKS_LIKE_STATIC_CLOSURE(q) ) { // Is it a static closure?
3370 ASSERT(closure_STATIC((StgClosure *)q));
3372 // otherwise, must be a pointer into the allocation space.
3375 (StgClosure *)*p = evacuate((StgClosure *)q);
3381 * Otherwise, q must be the info pointer of an activation
3382 * record. All activation records have 'bitmap' style layout
3385 info = get_itbl((StgClosure *)p);
3387 switch (info->type) {
3389 // Dynamic bitmap: the mask is stored on the stack
3391 bitmap = ((StgRetDyn *)p)->liveness;
3392 p = (P_)&((StgRetDyn *)p)->payload[0];
3395 // probably a slow-entry point return address:
3403 belch("HWL: scavenge_stack: FUN(_STATIC) adjusting p from %p to %p (instead of %p)",
3404 old_p, p, old_p+1));
3406 p++; // what if FHS!=1 !? -- HWL
3411 /* Specialised code for update frames, since they're so common.
3412 * We *know* the updatee points to a BLACKHOLE, CAF_BLACKHOLE,
3413 * or BLACKHOLE_BQ, so just inline the code to evacuate it here.
3417 StgUpdateFrame *frame = (StgUpdateFrame *)p;
3419 p += sizeofW(StgUpdateFrame);
3422 frame->updatee = evacuate(frame->updatee);
3424 #else // specialised code for update frames, not sure if it's worth it.
3426 nat type = get_itbl(frame->updatee)->type;
3428 if (type == EVACUATED) {
3429 frame->updatee = evacuate(frame->updatee);
3432 bdescr *bd = Bdescr((P_)frame->updatee);
3434 if (bd->gen_no > N) {
3435 if (bd->gen_no < evac_gen) {
3436 failed_to_evac = rtsTrue;
3441 // Don't promote blackholes
3443 if (!(stp->gen_no == 0 &&
3445 stp->no == stp->gen->n_steps-1)) {
3452 to = copyPart(frame->updatee, BLACKHOLE_sizeW(),
3453 sizeofW(StgHeader), stp);
3454 frame->updatee = to;
3457 to = copy(frame->updatee, BLACKHOLE_sizeW(), stp);
3458 frame->updatee = to;
3459 recordMutable((StgMutClosure *)to);
3462 /* will never be SE_{,CAF_}BLACKHOLE, since we
3463 don't push an update frame for single-entry thunks. KSW 1999-01. */
3464 barf("scavenge_stack: UPDATE_FRAME updatee");
3470 // small bitmap (< 32 entries, or 64 on a 64-bit machine)
3477 bitmap = info->layout.bitmap;
3479 // this assumes that the payload starts immediately after the info-ptr
3481 while (bitmap != 0) {
3482 if ((bitmap & 1) == 0) {
3483 (StgClosure *)*p = evacuate((StgClosure *)*p);
3486 bitmap = bitmap >> 1;
3493 // large bitmap (> 32 entries, or > 64 on a 64-bit machine)
3498 StgLargeBitmap *large_bitmap;
3501 large_bitmap = info->layout.large_bitmap;
3504 for (i=0; i<large_bitmap->size; i++) {
3505 bitmap = large_bitmap->bitmap[i];
3506 q = p + BITS_IN(W_);
3507 while (bitmap != 0) {
3508 if ((bitmap & 1) == 0) {
3509 (StgClosure *)*p = evacuate((StgClosure *)*p);
3512 bitmap = bitmap >> 1;
3514 if (i+1 < large_bitmap->size) {
3516 (StgClosure *)*p = evacuate((StgClosure *)*p);
3522 // and don't forget to follow the SRT
3527 barf("scavenge_stack: weird activation record found on stack: %d", (int)(info->type));
3532 /*-----------------------------------------------------------------------------
3533 scavenge the large object list.
3535 evac_gen set by caller; similar games played with evac_gen as with
3536 scavenge() - see comment at the top of scavenge(). Most large
3537 objects are (repeatedly) mutable, so most of the time evac_gen will
3539 --------------------------------------------------------------------------- */
3542 scavenge_large(step *stp)
3547 bd = stp->new_large_objects;
3549 for (; bd != NULL; bd = stp->new_large_objects) {
3551 /* take this object *off* the large objects list and put it on
3552 * the scavenged large objects list. This is so that we can
3553 * treat new_large_objects as a stack and push new objects on
3554 * the front when evacuating.
3556 stp->new_large_objects = bd->link;
3557 dbl_link_onto(bd, &stp->scavenged_large_objects);
3559 // update the block count in this step.
3560 stp->n_scavenged_large_blocks += bd->blocks;
3563 if (scavenge_one(p)) {
3564 mkMutCons((StgClosure *)p, stp->gen);
3569 /* -----------------------------------------------------------------------------
3570 Initialising the static object & mutable lists
3571 -------------------------------------------------------------------------- */
3574 zero_static_object_list(StgClosure* first_static)
3578 const StgInfoTable *info;
3580 for (p = first_static; p != END_OF_STATIC_LIST; p = link) {
3582 link = STATIC_LINK(info, p);
3583 STATIC_LINK(info,p) = NULL;
3587 /* This function is only needed because we share the mutable link
3588 * field with the static link field in an IND_STATIC, so we have to
3589 * zero the mut_link field before doing a major GC, which needs the
3590 * static link field.
3592 * It doesn't do any harm to zero all the mutable link fields on the
3597 zero_mutable_list( StgMutClosure *first )
3599 StgMutClosure *next, *c;
3601 for (c = first; c != END_MUT_LIST; c = next) {
3607 /* -----------------------------------------------------------------------------
3609 -------------------------------------------------------------------------- */
3616 for (c = (StgIndStatic *)caf_list; c != NULL;
3617 c = (StgIndStatic *)c->static_link)
3619 c->header.info = c->saved_info;
3620 c->saved_info = NULL;
3621 // could, but not necessary: c->static_link = NULL;
3627 markCAFs( evac_fn evac )
3631 for (c = (StgIndStatic *)caf_list; c != NULL;
3632 c = (StgIndStatic *)c->static_link)
3634 evac(&c->indirectee);
3638 /* -----------------------------------------------------------------------------
3639 Sanity code for CAF garbage collection.
3641 With DEBUG turned on, we manage a CAF list in addition to the SRT
3642 mechanism. After GC, we run down the CAF list and blackhole any
3643 CAFs which have been garbage collected. This means we get an error
3644 whenever the program tries to enter a garbage collected CAF.
3646 Any garbage collected CAFs are taken off the CAF list at the same
3648 -------------------------------------------------------------------------- */
3650 #if 0 && defined(DEBUG)
3657 const StgInfoTable *info;
3668 ASSERT(info->type == IND_STATIC);
3670 if (STATIC_LINK(info,p) == NULL) {
3671 IF_DEBUG(gccafs, belch("CAF gc'd at 0x%04lx", (long)p));
3673 SET_INFO(p,&stg_BLACKHOLE_info);
3674 p = STATIC_LINK2(info,p);
3678 pp = &STATIC_LINK2(info,p);
3685 // belch("%d CAFs live", i);
3690 /* -----------------------------------------------------------------------------
3693 Whenever a thread returns to the scheduler after possibly doing
3694 some work, we have to run down the stack and black-hole all the
3695 closures referred to by update frames.
3696 -------------------------------------------------------------------------- */
3699 threadLazyBlackHole(StgTSO *tso)
3701 StgUpdateFrame *update_frame;
3702 StgBlockingQueue *bh;
3705 stack_end = &tso->stack[tso->stack_size];
3706 update_frame = tso->su;
3709 switch (get_itbl(update_frame)->type) {
3712 update_frame = ((StgCatchFrame *)update_frame)->link;
3716 bh = (StgBlockingQueue *)update_frame->updatee;
3718 /* if the thunk is already blackholed, it means we've also
3719 * already blackholed the rest of the thunks on this stack,
3720 * so we can stop early.
3722 * The blackhole made for a CAF is a CAF_BLACKHOLE, so they
3723 * don't interfere with this optimisation.
3725 if (bh->header.info == &stg_BLACKHOLE_info) {
3729 if (bh->header.info != &stg_BLACKHOLE_BQ_info &&
3730 bh->header.info != &stg_CAF_BLACKHOLE_info) {
3731 #if (!defined(LAZY_BLACKHOLING)) && defined(DEBUG)
3732 belch("Unexpected lazy BHing required at 0x%04x",(int)bh);
3736 // We pretend that bh is now dead.
3737 LDV_recordDead_FILL_SLOP_DYNAMIC((StgClosure *)bh);
3739 SET_INFO(bh,&stg_BLACKHOLE_info);
3742 // We pretend that bh has just been created.
3743 LDV_recordCreate(bh);
3747 update_frame = update_frame->link;
3751 update_frame = ((StgSeqFrame *)update_frame)->link;
3757 barf("threadPaused");
3763 /* -----------------------------------------------------------------------------
3766 * Code largely pinched from old RTS, then hacked to bits. We also do
3767 * lazy black holing here.
3769 * -------------------------------------------------------------------------- */
3772 threadSqueezeStack(StgTSO *tso)
3774 lnat displacement = 0;
3775 StgUpdateFrame *frame;
3776 StgUpdateFrame *next_frame; // Temporally next
3777 StgUpdateFrame *prev_frame; // Temporally previous
3779 rtsBool prev_was_update_frame;
3781 StgUpdateFrame *top_frame;
3782 nat upd_frames=0, stop_frames=0, catch_frames=0, seq_frames=0,
3784 void printObj( StgClosure *obj ); // from Printer.c
3786 top_frame = tso->su;
3789 bottom = &(tso->stack[tso->stack_size]);
3792 /* There must be at least one frame, namely the STOP_FRAME.
3794 ASSERT((P_)frame < bottom);
3796 /* Walk down the stack, reversing the links between frames so that
3797 * we can walk back up as we squeeze from the bottom. Note that
3798 * next_frame and prev_frame refer to next and previous as they were
3799 * added to the stack, rather than the way we see them in this
3800 * walk. (It makes the next loop less confusing.)
3802 * Stop if we find an update frame pointing to a black hole
3803 * (see comment in threadLazyBlackHole()).
3807 // bottom - sizeof(StgStopFrame) is the STOP_FRAME
3808 while ((P_)frame < bottom - sizeofW(StgStopFrame)) {
3809 prev_frame = frame->link;
3810 frame->link = next_frame;
3815 if (!(frame>=top_frame && frame<=(StgUpdateFrame *)bottom)) {
3816 printObj((StgClosure *)prev_frame);
3817 barf("threadSqueezeStack: current frame is rubbish %p; previous was %p\n",
3820 switch (get_itbl(frame)->type) {
3823 if (frame->updatee->header.info == &stg_BLACKHOLE_info)
3836 barf("Found non-frame during stack squeezing at %p (prev frame was %p)\n",
3838 printObj((StgClosure *)prev_frame);
3841 if (get_itbl(frame)->type == UPDATE_FRAME
3842 && frame->updatee->header.info == &stg_BLACKHOLE_info) {
3847 /* Now, we're at the bottom. Frame points to the lowest update
3848 * frame on the stack, and its link actually points to the frame
3849 * above. We have to walk back up the stack, squeezing out empty
3850 * update frames and turning the pointers back around on the way
3853 * The bottom-most frame (the STOP_FRAME) has not been altered, and
3854 * we never want to eliminate it anyway. Just walk one step up
3855 * before starting to squeeze. When you get to the topmost frame,
3856 * remember that there are still some words above it that might have
3863 prev_was_update_frame = (get_itbl(prev_frame)->type == UPDATE_FRAME);
3866 * Loop through all of the frames (everything except the very
3867 * bottom). Things are complicated by the fact that we have
3868 * CATCH_FRAMEs and SEQ_FRAMEs interspersed with the update frames.
3869 * We can only squeeze when there are two consecutive UPDATE_FRAMEs.
3871 while (frame != NULL) {
3873 StgPtr frame_bottom = (P_)frame + sizeofW(StgUpdateFrame);
3874 rtsBool is_update_frame;
3876 next_frame = frame->link;
3877 is_update_frame = (get_itbl(frame)->type == UPDATE_FRAME);
3880 * 1. both the previous and current frame are update frames
3881 * 2. the current frame is empty
3883 if (prev_was_update_frame && is_update_frame &&
3884 (P_)prev_frame == frame_bottom + displacement) {
3886 // Now squeeze out the current frame
3887 StgClosure *updatee_keep = prev_frame->updatee;
3888 StgClosure *updatee_bypass = frame->updatee;
3891 IF_DEBUG(gc, belch("@@ squeezing frame at %p", frame));
3895 /* Deal with blocking queues. If both updatees have blocked
3896 * threads, then we should merge the queues into the update
3897 * frame that we're keeping.
3899 * Alternatively, we could just wake them up: they'll just go
3900 * straight to sleep on the proper blackhole! This is less code
3901 * and probably less bug prone, although it's probably much
3904 #if 0 // do it properly...
3905 # if (!defined(LAZY_BLACKHOLING)) && defined(DEBUG)
3906 # error Unimplemented lazy BH warning. (KSW 1999-01)
3908 if (GET_INFO(updatee_bypass) == stg_BLACKHOLE_BQ_info
3909 || GET_INFO(updatee_bypass) == stg_CAF_BLACKHOLE_info
3911 // Sigh. It has one. Don't lose those threads!
3912 if (GET_INFO(updatee_keep) == stg_BLACKHOLE_BQ_info) {
3913 // Urgh. Two queues. Merge them.
3914 P_ keep_tso = ((StgBlockingQueue *)updatee_keep)->blocking_queue;
3916 while (keep_tso->link != END_TSO_QUEUE) {
3917 keep_tso = keep_tso->link;
3919 keep_tso->link = ((StgBlockingQueue *)updatee_bypass)->blocking_queue;
3922 // For simplicity, just swap the BQ for the BH
3923 P_ temp = updatee_keep;
3925 updatee_keep = updatee_bypass;
3926 updatee_bypass = temp;
3928 // Record the swap in the kept frame (below)
3929 prev_frame->updatee = updatee_keep;
3934 TICK_UPD_SQUEEZED();
3935 /* wasn't there something about update squeezing and ticky to be
3936 * sorted out? oh yes: we aren't counting each enter properly
3937 * in this case. See the log somewhere. KSW 1999-04-21
3939 * Check two things: that the two update frames don't point to
3940 * the same object, and that the updatee_bypass isn't already an
3941 * indirection. Both of these cases only happen when we're in a
3942 * block hole-style loop (and there are multiple update frames
3943 * on the stack pointing to the same closure), but they can both
3944 * screw us up if we don't check.
3946 if (updatee_bypass != updatee_keep && !closure_IND(updatee_bypass)) {
3947 // this wakes the threads up
3948 UPD_IND_NOLOCK(updatee_bypass, updatee_keep);
3951 sp = (P_)frame - 1; // sp = stuff to slide
3952 displacement += sizeofW(StgUpdateFrame);
3955 // No squeeze for this frame
3956 sp = frame_bottom - 1; // Keep the current frame
3958 /* Do lazy black-holing.
3960 if (is_update_frame) {
3961 StgBlockingQueue *bh = (StgBlockingQueue *)frame->updatee;
3962 if (bh->header.info != &stg_BLACKHOLE_info &&
3963 bh->header.info != &stg_BLACKHOLE_BQ_info &&
3964 bh->header.info != &stg_CAF_BLACKHOLE_info) {
3965 #if (!defined(LAZY_BLACKHOLING)) && defined(DEBUG)
3966 belch("Unexpected lazy BHing required at 0x%04x",(int)bh);
3969 /* zero out the slop so that the sanity checker can tell
3970 * where the next closure is.
3973 StgInfoTable *info = get_itbl(bh);
3974 nat np = info->layout.payload.ptrs, nw = info->layout.payload.nptrs, i;
3975 /* don't zero out slop for a THUNK_SELECTOR, because its layout
3976 * info is used for a different purpose, and it's exactly the
3977 * same size as a BLACKHOLE in any case.
3979 if (info->type != THUNK_SELECTOR) {
3980 for (i = np; i < np + nw; i++) {
3981 ((StgClosure *)bh)->payload[i] = 0;
3988 // We pretend that bh is now dead.
3989 LDV_recordDead_FILL_SLOP_DYNAMIC((StgClosure *)bh);
3992 // Todo: maybe use SET_HDR() and remove LDV_recordCreate()?
3994 SET_INFO(bh,&stg_BLACKHOLE_info);
3997 // We pretend that bh has just been created.
3998 LDV_recordCreate(bh);
4003 // Fix the link in the current frame (should point to the frame below)
4004 frame->link = prev_frame;
4005 prev_was_update_frame = is_update_frame;
4008 // Now slide all words from sp up to the next frame
4010 if (displacement > 0) {
4011 P_ next_frame_bottom;
4013 if (next_frame != NULL)
4014 next_frame_bottom = (P_)next_frame + sizeofW(StgUpdateFrame);
4016 next_frame_bottom = tso->sp - 1;
4020 belch("sliding [%p, %p] by %ld", sp, next_frame_bottom,
4024 while (sp >= next_frame_bottom) {
4025 sp[displacement] = *sp;
4029 (P_)prev_frame = (P_)frame + displacement;
4033 tso->sp += displacement;
4034 tso->su = prev_frame;
4037 belch("@@ threadSqueezeStack: squeezed %d update-frames; found %d BHs; found %d update-, %d stop-, %d catch, %d seq-frames",
4038 squeezes, bhs, upd_frames, stop_frames, catch_frames, seq_frames))
4043 /* -----------------------------------------------------------------------------
4046 * We have to prepare for GC - this means doing lazy black holing
4047 * here. We also take the opportunity to do stack squeezing if it's
4049 * -------------------------------------------------------------------------- */
4051 threadPaused(StgTSO *tso)
4053 if ( RtsFlags.GcFlags.squeezeUpdFrames == rtsTrue )
4054 threadSqueezeStack(tso); // does black holing too
4056 threadLazyBlackHole(tso);
4059 /* -----------------------------------------------------------------------------
4061 * -------------------------------------------------------------------------- */
4065 printMutOnceList(generation *gen)
4067 StgMutClosure *p, *next;
4069 p = gen->mut_once_list;
4072 fprintf(stderr, "@@ Mut once list %p: ", gen->mut_once_list);
4073 for (; p != END_MUT_LIST; p = next, next = p->mut_link) {
4074 fprintf(stderr, "%p (%s), ",
4075 p, info_type((StgClosure *)p));
4077 fputc('\n', stderr);
4081 printMutableList(generation *gen)
4083 StgMutClosure *p, *next;
4088 fprintf(stderr, "@@ Mutable list %p: ", gen->mut_list);
4089 for (; p != END_MUT_LIST; p = next, next = p->mut_link) {
4090 fprintf(stderr, "%p (%s), ",
4091 p, info_type((StgClosure *)p));
4093 fputc('\n', stderr);
4096 static inline rtsBool
4097 maybeLarge(StgClosure *closure)
4099 StgInfoTable *info = get_itbl(closure);
4101 /* closure types that may be found on the new_large_objects list;
4102 see scavenge_large */
4103 return (info->type == MUT_ARR_PTRS ||
4104 info->type == MUT_ARR_PTRS_FROZEN ||
4105 info->type == TSO ||
4106 info->type == ARR_WORDS);