1 /* -----------------------------------------------------------------------------
3 * (c) The GHC Team, 1998-2004
5 * Storage manager front end
7 * ---------------------------------------------------------------------------*/
9 #include "PosixSource.h"
15 #include "BlockAlloc.h"
20 #include "OSThreads.h"
21 #include "Capability.h"
24 #include "RetainerProfile.h" // for counting memory blocks (memInventory)
29 StgClosure *caf_list = NULL;
30 StgClosure *revertible_caf_list = NULL;
33 bdescr *small_alloc_list; /* allocate()d small objects */
34 bdescr *pinned_object_block; /* allocate pinned objects into this block */
35 nat alloc_blocks; /* number of allocate()d blocks since GC */
36 nat alloc_blocks_lim; /* approximate limit on alloc_blocks */
38 StgPtr alloc_Hp = NULL; /* next free byte in small_alloc_list */
39 StgPtr alloc_HpLim = NULL; /* end of block at small_alloc_list */
41 generation *generations = NULL; /* all the generations */
42 generation *g0 = NULL; /* generation 0, for convenience */
43 generation *oldest_gen = NULL; /* oldest generation, for convenience */
44 step *g0s0 = NULL; /* generation 0, step 0, for convenience */
46 ullong total_allocated = 0; /* total memory allocated during run */
48 nat n_nurseries = 0; /* == RtsFlags.ParFlags.nNodes, convenience */
49 step *nurseries = NULL; /* array of nurseries, >1 only if SMP */
52 * Storage manager mutex: protects all the above state from
53 * simultaneous access by two STG threads.
56 Mutex sm_mutex = INIT_MUTEX_VAR;
62 static void *stgAllocForGMP (size_t size_in_bytes);
63 static void *stgReallocForGMP (void *ptr, size_t old_size, size_t new_size);
64 static void stgDeallocForGMP (void *ptr, size_t size);
67 initStep (step *stp, int g, int s)
73 stp->gen = &generations[g];
80 stp->large_objects = NULL;
81 stp->n_large_blocks = 0;
82 stp->new_large_objects = NULL;
83 stp->scavenged_large_objects = NULL;
84 stp->n_scavenged_large_blocks = 0;
85 stp->is_compacted = 0;
95 if (generations != NULL) {
96 // multi-init protection
100 /* Sanity check to make sure the LOOKS_LIKE_ macros appear to be
101 * doing something reasonable.
103 ASSERT(LOOKS_LIKE_INFO_PTR(&stg_BLACKHOLE_info));
104 ASSERT(LOOKS_LIKE_CLOSURE_PTR(&stg_dummy_ret_closure));
105 ASSERT(!HEAP_ALLOCED(&stg_dummy_ret_closure));
107 if (RtsFlags.GcFlags.maxHeapSize != 0 &&
108 RtsFlags.GcFlags.heapSizeSuggestion >
109 RtsFlags.GcFlags.maxHeapSize) {
110 RtsFlags.GcFlags.maxHeapSize = RtsFlags.GcFlags.heapSizeSuggestion;
113 if (RtsFlags.GcFlags.maxHeapSize != 0 &&
114 RtsFlags.GcFlags.minAllocAreaSize >
115 RtsFlags.GcFlags.maxHeapSize) {
116 errorBelch("maximum heap size (-M) is smaller than minimum alloc area size (-A)");
120 initBlockAllocator();
123 initMutex(&sm_mutex);
126 /* allocate generation info array */
127 generations = (generation *)stgMallocBytes(RtsFlags.GcFlags.generations
128 * sizeof(struct generation_),
129 "initStorage: gens");
131 /* Initialise all generations */
132 for(g = 0; g < RtsFlags.GcFlags.generations; g++) {
133 gen = &generations[g];
135 gen->mut_list = allocBlock();
136 gen->collections = 0;
137 gen->failed_promotions = 0;
141 /* A couple of convenience pointers */
142 g0 = &generations[0];
143 oldest_gen = &generations[RtsFlags.GcFlags.generations-1];
145 /* Allocate step structures in each generation */
146 if (RtsFlags.GcFlags.generations > 1) {
147 /* Only for multiple-generations */
149 /* Oldest generation: one step */
150 oldest_gen->n_steps = 1;
152 stgMallocBytes(1 * sizeof(struct step_), "initStorage: last step");
154 /* set up all except the oldest generation with 2 steps */
155 for(g = 0; g < RtsFlags.GcFlags.generations-1; g++) {
156 generations[g].n_steps = RtsFlags.GcFlags.steps;
157 generations[g].steps =
158 stgMallocBytes (RtsFlags.GcFlags.steps * sizeof(struct step_),
159 "initStorage: steps");
163 /* single generation, i.e. a two-space collector */
165 g0->steps = stgMallocBytes (sizeof(struct step_), "initStorage: steps");
169 n_nurseries = RtsFlags.ParFlags.nNodes;
170 nurseries = stgMallocBytes (n_nurseries * sizeof(struct step_),
171 "initStorage: nurseries");
174 nurseries = g0->steps; // just share nurseries[0] with g0s0
177 /* Initialise all steps */
178 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
179 for (s = 0; s < generations[g].n_steps; s++) {
180 initStep(&generations[g].steps[s], g, s);
185 for (s = 0; s < n_nurseries; s++) {
186 initStep(&nurseries[s], 0, s);
190 /* Set up the destination pointers in each younger gen. step */
191 for (g = 0; g < RtsFlags.GcFlags.generations-1; g++) {
192 for (s = 0; s < generations[g].n_steps-1; s++) {
193 generations[g].steps[s].to = &generations[g].steps[s+1];
195 generations[g].steps[s].to = &generations[g+1].steps[0];
197 oldest_gen->steps[0].to = &oldest_gen->steps[0];
200 for (s = 0; s < n_nurseries; s++) {
201 nurseries[s].to = generations[0].steps[0].to;
205 /* The oldest generation has one step. */
206 if (RtsFlags.GcFlags.compact) {
207 if (RtsFlags.GcFlags.generations == 1) {
208 errorBelch("WARNING: compaction is incompatible with -G1; disabled");
210 oldest_gen->steps[0].is_compacted = 1;
215 if (RtsFlags.GcFlags.generations == 1) {
216 errorBelch("-G1 is incompatible with SMP");
220 if (RtsFlags.GcFlags.heapSizeSuggestion > 0) {
221 errorBelch("-H<size> is incompatible with SMP");
226 /* generation 0 is special: that's the nursery */
227 generations[0].max_blocks = 0;
229 /* G0S0: the allocation area. Policy: keep the allocation area
230 * small to begin with, even if we have a large suggested heap
231 * size. Reason: we're going to do a major collection first, and we
232 * don't want it to be a big one. This vague idea is borne out by
233 * rigorous experimental evidence.
235 g0s0 = &generations[0].steps[0];
239 weak_ptr_list = NULL;
241 revertible_caf_list = NULL;
243 /* initialise the allocate() interface */
244 small_alloc_list = NULL;
246 alloc_blocks_lim = RtsFlags.GcFlags.minAllocAreaSize;
248 /* Tell GNU multi-precision pkg about our custom alloc functions */
249 mp_set_memory_functions(stgAllocForGMP, stgReallocForGMP, stgDeallocForGMP);
251 IF_DEBUG(gc, statDescribeGens());
257 stat_exit(calcAllocated());
260 /* -----------------------------------------------------------------------------
263 The entry code for every CAF does the following:
265 - builds a CAF_BLACKHOLE in the heap
266 - pushes an update frame pointing to the CAF_BLACKHOLE
267 - invokes UPD_CAF(), which:
268 - calls newCaf, below
269 - updates the CAF with a static indirection to the CAF_BLACKHOLE
271 Why do we build a BLACKHOLE in the heap rather than just updating
272 the thunk directly? It's so that we only need one kind of update
273 frame - otherwise we'd need a static version of the update frame too.
275 newCaf() does the following:
277 - it puts the CAF on the oldest generation's mut-once list.
278 This is so that we can treat the CAF as a root when collecting
281 For GHCI, we have additional requirements when dealing with CAFs:
283 - we must *retain* all dynamically-loaded CAFs ever entered,
284 just in case we need them again.
285 - we must be able to *revert* CAFs that have been evaluated, to
286 their pre-evaluated form.
288 To do this, we use an additional CAF list. When newCaf() is
289 called on a dynamically-loaded CAF, we add it to the CAF list
290 instead of the old-generation mutable list, and save away its
291 old info pointer (in caf->saved_info) for later reversion.
293 To revert all the CAFs, we traverse the CAF list and reset the
294 info pointer to caf->saved_info, then throw away the CAF list.
295 (see GC.c:revertCAFs()).
299 -------------------------------------------------------------------------- */
302 newCAF(StgClosure* caf)
309 // If we are in GHCi _and_ we are using dynamic libraries,
310 // then we can't redirect newCAF calls to newDynCAF (see below),
311 // so we make newCAF behave almost like newDynCAF.
312 // The dynamic libraries might be used by both the interpreted
313 // program and GHCi itself, so they must not be reverted.
314 // This also means that in GHCi with dynamic libraries, CAFs are not
315 // garbage collected. If this turns out to be a problem, we could
316 // do another hack here and do an address range test on caf to figure
317 // out whether it is from a dynamic library.
318 ((StgIndStatic *)caf)->saved_info = (StgInfoTable *)caf->header.info;
319 ((StgIndStatic *)caf)->static_link = caf_list;
324 /* Put this CAF on the mutable list for the old generation.
325 * This is a HACK - the IND_STATIC closure doesn't really have
326 * a mut_link field, but we pretend it has - in fact we re-use
327 * the STATIC_LINK field for the time being, because when we
328 * come to do a major GC we won't need the mut_link field
329 * any more and can use it as a STATIC_LINK.
331 ((StgIndStatic *)caf)->saved_info = NULL;
332 recordMutableGen(caf, oldest_gen);
338 /* If we are PAR or DIST then we never forget a CAF */
340 //debugBelch("<##> Globalising CAF %08x %s",caf,info_type(caf));
341 newGA=makeGlobal(caf,rtsTrue); /*given full weight*/
347 // An alternate version of newCaf which is used for dynamically loaded
348 // object code in GHCi. In this case we want to retain *all* CAFs in
349 // the object code, because they might be demanded at any time from an
350 // expression evaluated on the command line.
351 // Also, GHCi might want to revert CAFs, so we add these to the
352 // revertible_caf_list.
354 // The linker hackily arranges that references to newCaf from dynamic
355 // code end up pointing to newDynCAF.
357 newDynCAF(StgClosure *caf)
361 ((StgIndStatic *)caf)->saved_info = (StgInfoTable *)caf->header.info;
362 ((StgIndStatic *)caf)->static_link = revertible_caf_list;
363 revertible_caf_list = caf;
368 /* -----------------------------------------------------------------------------
370 -------------------------------------------------------------------------- */
373 allocNursery (step *stp, bdescr *tail, nat blocks)
378 // Allocate a nursery: we allocate fresh blocks one at a time and
379 // cons them on to the front of the list, not forgetting to update
380 // the back pointer on the tail of the list to point to the new block.
381 for (i=0; i < blocks; i++) {
384 processNursery() in LdvProfile.c assumes that every block group in
385 the nursery contains only a single block. So, if a block group is
386 given multiple blocks, change processNursery() accordingly.
390 // double-link the nursery: we might need to insert blocks
397 bd->free = bd->start;
405 assignNurseriesToCapabilities (void)
410 for (i = 0; i < n_nurseries; i++) {
411 capabilities[i].r.rNursery = &nurseries[i];
412 capabilities[i].r.rCurrentNursery = nurseries[i].blocks;
415 MainCapability.r.rNursery = &nurseries[0];
416 MainCapability.r.rCurrentNursery = nurseries[0].blocks;
421 allocNurseries( void )
425 for (i = 0; i < n_nurseries; i++) {
426 nurseries[i].blocks =
427 allocNursery(&nurseries[i], NULL,
428 RtsFlags.GcFlags.minAllocAreaSize);
429 nurseries[i].n_blocks = RtsFlags.GcFlags.minAllocAreaSize;
430 nurseries[i].to_blocks = NULL;
431 nurseries[i].n_to_blocks = 0;
432 /* hp, hpLim, hp_bd, to_space etc. aren't used in the nursery */
434 assignNurseriesToCapabilities();
438 resetNurseries( void )
444 for (i = 0; i < n_nurseries; i++) {
446 for (bd = stp->blocks; bd; bd = bd->link) {
447 bd->free = bd->start;
448 ASSERT(bd->gen_no == 0);
449 ASSERT(bd->step == stp);
450 IF_DEBUG(sanity,memset(bd->start, 0xaa, BLOCK_SIZE));
453 assignNurseriesToCapabilities();
457 countNurseryBlocks (void)
462 for (i = 0; i < n_nurseries; i++) {
463 blocks += nurseries[i].n_blocks;
469 resizeNursery ( step *stp, nat blocks )
474 nursery_blocks = stp->n_blocks;
475 if (nursery_blocks == blocks) return;
477 if (nursery_blocks < blocks) {
478 IF_DEBUG(gc, debugBelch("Increasing size of nursery to %d blocks\n",
480 stp->blocks = allocNursery(stp, stp->blocks, blocks-nursery_blocks);
485 IF_DEBUG(gc, debugBelch("Decreasing size of nursery to %d blocks\n",
489 while (nursery_blocks > blocks) {
491 next_bd->u.back = NULL;
492 nursery_blocks -= bd->blocks; // might be a large block
497 // might have gone just under, by freeing a large block, so make
498 // up the difference.
499 if (nursery_blocks < blocks) {
500 stp->blocks = allocNursery(stp, stp->blocks, blocks-nursery_blocks);
504 stp->n_blocks = blocks;
505 ASSERT(countBlocks(stp->blocks) == stp->n_blocks);
509 // Resize each of the nurseries to the specified size.
512 resizeNurseries (nat blocks)
515 for (i = 0; i < n_nurseries; i++) {
516 resizeNursery(&nurseries[i], blocks);
520 /* -----------------------------------------------------------------------------
521 The allocate() interface
523 allocate(n) always succeeds, and returns a chunk of memory n words
524 long. n can be larger than the size of a block if necessary, in
525 which case a contiguous block group will be allocated.
526 -------------------------------------------------------------------------- */
536 TICK_ALLOC_HEAP_NOCTR(n);
539 /* big allocation (>LARGE_OBJECT_THRESHOLD) */
540 /* ToDo: allocate directly into generation 1 */
541 if (n >= LARGE_OBJECT_THRESHOLD/sizeof(W_)) {
542 nat req_blocks = (lnat)BLOCK_ROUND_UP(n*sizeof(W_)) / BLOCK_SIZE;
543 bd = allocGroup(req_blocks);
544 dbl_link_onto(bd, &g0s0->large_objects);
545 g0s0->n_large_blocks += req_blocks;
548 bd->flags = BF_LARGE;
549 bd->free = bd->start + n;
550 alloc_blocks += req_blocks;
554 /* small allocation (<LARGE_OBJECT_THRESHOLD) */
555 } else if (small_alloc_list == NULL || alloc_Hp + n > alloc_HpLim) {
556 if (small_alloc_list) {
557 small_alloc_list->free = alloc_Hp;
560 bd->link = small_alloc_list;
561 small_alloc_list = bd;
565 alloc_Hp = bd->start;
566 alloc_HpLim = bd->start + BLOCK_SIZE_W;
577 allocated_bytes( void )
581 allocated = alloc_blocks * BLOCK_SIZE_W - (alloc_HpLim - alloc_Hp);
582 if (pinned_object_block != NULL) {
583 allocated -= (pinned_object_block->start + BLOCK_SIZE_W) -
584 pinned_object_block->free;
591 tidyAllocateLists (void)
593 if (small_alloc_list != NULL) {
594 ASSERT(alloc_Hp >= small_alloc_list->start &&
595 alloc_Hp <= small_alloc_list->start + BLOCK_SIZE);
596 small_alloc_list->free = alloc_Hp;
600 /* ---------------------------------------------------------------------------
601 Allocate a fixed/pinned object.
603 We allocate small pinned objects into a single block, allocating a
604 new block when the current one overflows. The block is chained
605 onto the large_object_list of generation 0 step 0.
607 NOTE: The GC can't in general handle pinned objects. This
608 interface is only safe to use for ByteArrays, which have no
609 pointers and don't require scavenging. It works because the
610 block's descriptor has the BF_LARGE flag set, so the block is
611 treated as a large object and chained onto various lists, rather
612 than the individual objects being copied. However, when it comes
613 to scavenge the block, the GC will only scavenge the first object.
614 The reason is that the GC can't linearly scan a block of pinned
615 objects at the moment (doing so would require using the
616 mostly-copying techniques). But since we're restricting ourselves
617 to pinned ByteArrays, not scavenging is ok.
619 This function is called by newPinnedByteArray# which immediately
620 fills the allocated memory with a MutableByteArray#.
621 ------------------------------------------------------------------------- */
624 allocatePinned( nat n )
627 bdescr *bd = pinned_object_block;
629 // If the request is for a large object, then allocate()
630 // will give us a pinned object anyway.
631 if (n >= LARGE_OBJECT_THRESHOLD/sizeof(W_)) {
637 TICK_ALLOC_HEAP_NOCTR(n);
640 // we always return 8-byte aligned memory. bd->free must be
641 // 8-byte aligned to begin with, so we just round up n to
642 // the nearest multiple of 8 bytes.
643 if (sizeof(StgWord) == 4) {
647 // If we don't have a block of pinned objects yet, or the current
648 // one isn't large enough to hold the new object, allocate a new one.
649 if (bd == NULL || (bd->free + n) > (bd->start + BLOCK_SIZE_W)) {
650 pinned_object_block = bd = allocBlock();
651 dbl_link_onto(bd, &g0s0->large_objects);
654 bd->flags = BF_PINNED | BF_LARGE;
655 bd->free = bd->start;
665 /* -----------------------------------------------------------------------------
666 Allocation functions for GMP.
668 These all use the allocate() interface - we can't have any garbage
669 collection going on during a gmp operation, so we use allocate()
670 which always succeeds. The gmp operations which might need to
671 allocate will ask the storage manager (via doYouWantToGC()) whether
672 a garbage collection is required, in case we get into a loop doing
673 only allocate() style allocation.
674 -------------------------------------------------------------------------- */
677 stgAllocForGMP (size_t size_in_bytes)
680 nat data_size_in_words, total_size_in_words;
682 /* round up to a whole number of words */
683 data_size_in_words = (size_in_bytes + sizeof(W_) + 1) / sizeof(W_);
684 total_size_in_words = sizeofW(StgArrWords) + data_size_in_words;
686 /* allocate and fill it in. */
687 arr = (StgArrWords *)allocate(total_size_in_words);
688 SET_ARR_HDR(arr, &stg_ARR_WORDS_info, CCCS, data_size_in_words);
690 /* and return a ptr to the goods inside the array */
695 stgReallocForGMP (void *ptr, size_t old_size, size_t new_size)
697 void *new_stuff_ptr = stgAllocForGMP(new_size);
699 char *p = (char *) ptr;
700 char *q = (char *) new_stuff_ptr;
702 for (; i < old_size; i++, p++, q++) {
706 return(new_stuff_ptr);
710 stgDeallocForGMP (void *ptr STG_UNUSED,
711 size_t size STG_UNUSED)
713 /* easy for us: the garbage collector does the dealloc'n */
716 /* -----------------------------------------------------------------------------
718 * -------------------------------------------------------------------------- */
720 /* -----------------------------------------------------------------------------
723 * Approximate how much we've allocated: number of blocks in the
724 * nursery + blocks allocated via allocate() - unused nusery blocks.
725 * This leaves a little slop at the end of each block, and doesn't
726 * take into account large objects (ToDo).
727 * -------------------------------------------------------------------------- */
730 calcAllocated( void )
736 allocated = allocated_bytes();
737 for (i = 0; i < n_nurseries; i++) {
738 allocated += nurseries[i].n_blocks * BLOCK_SIZE_W;
742 for (i = 0; i < n_nurseries; i++) {
744 for ( bd = capabilities[i].r.rCurrentNursery;
745 bd != NULL; bd = bd->link ) {
746 allocated -= BLOCK_SIZE_W;
748 cap = &capabilities[i];
749 if (cap->r.rCurrentNursery->free <
750 cap->r.rCurrentNursery->start + BLOCK_SIZE_W) {
751 allocated -= (cap->r.rCurrentNursery->start + BLOCK_SIZE_W)
752 - cap->r.rCurrentNursery->free;
756 bdescr *current_nursery = MainCapability.r.rCurrentNursery;
758 for ( bd = current_nursery->link; bd != NULL; bd = bd->link ) {
759 allocated -= BLOCK_SIZE_W;
761 if (current_nursery->free < current_nursery->start + BLOCK_SIZE_W) {
762 allocated -= (current_nursery->start + BLOCK_SIZE_W)
763 - current_nursery->free;
767 total_allocated += allocated;
771 /* Approximate the amount of live data in the heap. To be called just
772 * after garbage collection (see GarbageCollect()).
781 if (RtsFlags.GcFlags.generations == 1) {
782 live = (g0s0->n_to_blocks - 1) * BLOCK_SIZE_W +
783 ((lnat)g0s0->hp_bd->free - (lnat)g0s0->hp_bd->start) / sizeof(W_);
787 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
788 for (s = 0; s < generations[g].n_steps; s++) {
789 /* approximate amount of live data (doesn't take into account slop
790 * at end of each block).
792 if (g == 0 && s == 0) {
795 stp = &generations[g].steps[s];
796 live += (stp->n_large_blocks + stp->n_blocks - 1) * BLOCK_SIZE_W;
797 if (stp->hp_bd != NULL) {
798 live += ((lnat)stp->hp_bd->free - (lnat)stp->hp_bd->start)
806 /* Approximate the number of blocks that will be needed at the next
807 * garbage collection.
809 * Assume: all data currently live will remain live. Steps that will
810 * be collected next time will therefore need twice as many blocks
811 * since all the data will be copied.
820 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
821 for (s = 0; s < generations[g].n_steps; s++) {
822 if (g == 0 && s == 0) { continue; }
823 stp = &generations[g].steps[s];
824 if (generations[g].steps[0].n_blocks +
825 generations[g].steps[0].n_large_blocks
826 > generations[g].max_blocks
827 && stp->is_compacted == 0) {
828 needed += 2 * stp->n_blocks;
830 needed += stp->n_blocks;
837 /* -----------------------------------------------------------------------------
840 memInventory() checks for memory leaks by counting up all the
841 blocks we know about and comparing that to the number of blocks
842 allegedly floating around in the system.
843 -------------------------------------------------------------------------- */
848 stepBlocks (step *stp)
853 total_blocks = stp->n_blocks;
854 for (bd = stp->large_objects; bd; bd = bd->link) {
855 total_blocks += bd->blocks;
856 /* hack for megablock groups: they have an extra block or two in
857 the second and subsequent megablocks where the block
858 descriptors would normally go.
860 if (bd->blocks > BLOCKS_PER_MBLOCK) {
861 total_blocks -= (MBLOCK_SIZE / BLOCK_SIZE - BLOCKS_PER_MBLOCK)
862 * (bd->blocks/(MBLOCK_SIZE/BLOCK_SIZE));
874 lnat total_blocks = 0, free_blocks = 0;
876 /* count the blocks we current have */
878 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
879 for (bd = generations[g].mut_list; bd != NULL; bd = bd->link) {
880 total_blocks += bd->blocks;
882 for (s = 0; s < generations[g].n_steps; s++) {
883 if (g==0 && s==0) continue;
884 stp = &generations[g].steps[s];
885 total_blocks += stepBlocks(stp);
889 for (i = 0; i < n_nurseries; i++) {
890 total_blocks += stepBlocks(&nurseries[i]);
893 if (RtsFlags.GcFlags.generations == 1) {
894 /* two-space collector has a to-space too :-) */
895 total_blocks += g0s0->n_to_blocks;
898 /* any blocks held by allocate() */
899 for (bd = small_alloc_list; bd; bd = bd->link) {
900 total_blocks += bd->blocks;
904 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_RETAINER) {
905 total_blocks += retainerStackBlocks();
909 // count the blocks allocated by the arena allocator
910 total_blocks += arenaBlocks();
912 /* count the blocks on the free list */
913 free_blocks = countFreeList();
915 if (total_blocks + free_blocks != mblocks_allocated *
917 debugBelch("Blocks: %ld live + %ld free = %ld total (%ld around)\n",
918 total_blocks, free_blocks, total_blocks + free_blocks,
919 mblocks_allocated * BLOCKS_PER_MBLOCK);
922 ASSERT(total_blocks + free_blocks == mblocks_allocated * BLOCKS_PER_MBLOCK);
927 countBlocks(bdescr *bd)
930 for (n=0; bd != NULL; bd=bd->link) {
936 /* Full heap sanity check. */
942 if (RtsFlags.GcFlags.generations == 1) {
943 checkHeap(g0s0->to_blocks);
944 checkChain(g0s0->large_objects);
947 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
948 for (s = 0; s < generations[g].n_steps; s++) {
949 if (g == 0 && s == 0) { continue; }
950 ASSERT(countBlocks(generations[g].steps[s].blocks)
951 == generations[g].steps[s].n_blocks);
952 ASSERT(countBlocks(generations[g].steps[s].large_objects)
953 == generations[g].steps[s].n_large_blocks);
954 checkHeap(generations[g].steps[s].blocks);
955 checkChain(generations[g].steps[s].large_objects);
957 checkMutableList(generations[g].mut_list, g);
962 for (s = 0; s < n_nurseries; s++) {
963 ASSERT(countBlocks(nurseries[s].blocks)
964 == nurseries[s].n_blocks);
965 ASSERT(countBlocks(nurseries[s].large_objects)
966 == nurseries[s].n_large_blocks);
969 checkFreeListSanity();
973 // handy function for use in gdb, because Bdescr() is inlined.
974 extern bdescr *_bdescr( StgPtr p );