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");
221 /* generation 0 is special: that's the nursery */
222 generations[0].max_blocks = 0;
224 /* G0S0: the allocation area. Policy: keep the allocation area
225 * small to begin with, even if we have a large suggested heap
226 * size. Reason: we're going to do a major collection first, and we
227 * don't want it to be a big one. This vague idea is borne out by
228 * rigorous experimental evidence.
230 g0s0 = &generations[0].steps[0];
234 weak_ptr_list = NULL;
236 revertible_caf_list = NULL;
238 /* initialise the allocate() interface */
239 small_alloc_list = NULL;
241 alloc_blocks_lim = RtsFlags.GcFlags.minAllocAreaSize;
243 /* Tell GNU multi-precision pkg about our custom alloc functions */
244 mp_set_memory_functions(stgAllocForGMP, stgReallocForGMP, stgDeallocForGMP);
246 IF_DEBUG(gc, statDescribeGens());
252 stat_exit(calcAllocated());
255 /* -----------------------------------------------------------------------------
258 The entry code for every CAF does the following:
260 - builds a CAF_BLACKHOLE in the heap
261 - pushes an update frame pointing to the CAF_BLACKHOLE
262 - invokes UPD_CAF(), which:
263 - calls newCaf, below
264 - updates the CAF with a static indirection to the CAF_BLACKHOLE
266 Why do we build a BLACKHOLE in the heap rather than just updating
267 the thunk directly? It's so that we only need one kind of update
268 frame - otherwise we'd need a static version of the update frame too.
270 newCaf() does the following:
272 - it puts the CAF on the oldest generation's mut-once list.
273 This is so that we can treat the CAF as a root when collecting
276 For GHCI, we have additional requirements when dealing with CAFs:
278 - we must *retain* all dynamically-loaded CAFs ever entered,
279 just in case we need them again.
280 - we must be able to *revert* CAFs that have been evaluated, to
281 their pre-evaluated form.
283 To do this, we use an additional CAF list. When newCaf() is
284 called on a dynamically-loaded CAF, we add it to the CAF list
285 instead of the old-generation mutable list, and save away its
286 old info pointer (in caf->saved_info) for later reversion.
288 To revert all the CAFs, we traverse the CAF list and reset the
289 info pointer to caf->saved_info, then throw away the CAF list.
290 (see GC.c:revertCAFs()).
294 -------------------------------------------------------------------------- */
297 newCAF(StgClosure* caf)
304 // If we are in GHCi _and_ we are using dynamic libraries,
305 // then we can't redirect newCAF calls to newDynCAF (see below),
306 // so we make newCAF behave almost like newDynCAF.
307 // The dynamic libraries might be used by both the interpreted
308 // program and GHCi itself, so they must not be reverted.
309 // This also means that in GHCi with dynamic libraries, CAFs are not
310 // garbage collected. If this turns out to be a problem, we could
311 // do another hack here and do an address range test on caf to figure
312 // out whether it is from a dynamic library.
313 ((StgIndStatic *)caf)->saved_info = (StgInfoTable *)caf->header.info;
314 ((StgIndStatic *)caf)->static_link = caf_list;
319 /* Put this CAF on the mutable list for the old generation.
320 * This is a HACK - the IND_STATIC closure doesn't really have
321 * a mut_link field, but we pretend it has - in fact we re-use
322 * the STATIC_LINK field for the time being, because when we
323 * come to do a major GC we won't need the mut_link field
324 * any more and can use it as a STATIC_LINK.
326 ((StgIndStatic *)caf)->saved_info = NULL;
327 recordMutableGen(caf, oldest_gen);
333 /* If we are PAR or DIST then we never forget a CAF */
335 //debugBelch("<##> Globalising CAF %08x %s",caf,info_type(caf));
336 newGA=makeGlobal(caf,rtsTrue); /*given full weight*/
342 // An alternate version of newCaf which is used for dynamically loaded
343 // object code in GHCi. In this case we want to retain *all* CAFs in
344 // the object code, because they might be demanded at any time from an
345 // expression evaluated on the command line.
346 // Also, GHCi might want to revert CAFs, so we add these to the
347 // revertible_caf_list.
349 // The linker hackily arranges that references to newCaf from dynamic
350 // code end up pointing to newDynCAF.
352 newDynCAF(StgClosure *caf)
356 ((StgIndStatic *)caf)->saved_info = (StgInfoTable *)caf->header.info;
357 ((StgIndStatic *)caf)->static_link = revertible_caf_list;
358 revertible_caf_list = caf;
363 /* -----------------------------------------------------------------------------
365 -------------------------------------------------------------------------- */
368 allocNursery (step *stp, bdescr *tail, nat blocks)
373 // Allocate a nursery: we allocate fresh blocks one at a time and
374 // cons them on to the front of the list, not forgetting to update
375 // the back pointer on the tail of the list to point to the new block.
376 for (i=0; i < blocks; i++) {
379 processNursery() in LdvProfile.c assumes that every block group in
380 the nursery contains only a single block. So, if a block group is
381 given multiple blocks, change processNursery() accordingly.
385 // double-link the nursery: we might need to insert blocks
392 bd->free = bd->start;
400 assignNurseriesToCapabilities (void)
405 for (i = 0; i < n_nurseries; i++) {
406 capabilities[i].r.rNursery = &nurseries[i];
407 capabilities[i].r.rCurrentNursery = nurseries[i].blocks;
410 MainCapability.r.rNursery = &nurseries[0];
411 MainCapability.r.rCurrentNursery = nurseries[0].blocks;
416 allocNurseries( void )
420 for (i = 0; i < n_nurseries; i++) {
421 nurseries[i].blocks =
422 allocNursery(&nurseries[i], NULL,
423 RtsFlags.GcFlags.minAllocAreaSize);
424 nurseries[i].n_blocks = RtsFlags.GcFlags.minAllocAreaSize;
425 nurseries[i].to_blocks = NULL;
426 nurseries[i].n_to_blocks = 0;
427 /* hp, hpLim, hp_bd, to_space etc. aren't used in the nursery */
429 assignNurseriesToCapabilities();
433 resetNurseries( void )
439 for (i = 0; i < n_nurseries; i++) {
441 for (bd = stp->blocks; bd; bd = bd->link) {
442 bd->free = bd->start;
443 ASSERT(bd->gen_no == 0);
444 ASSERT(bd->step == stp);
445 IF_DEBUG(sanity,memset(bd->start, 0xaa, BLOCK_SIZE));
448 assignNurseriesToCapabilities();
452 countNurseryBlocks (void)
457 for (i = 0; i < n_nurseries; i++) {
458 blocks += nurseries[i].n_blocks;
464 resizeNursery ( step *stp, nat blocks )
469 nursery_blocks = stp->n_blocks;
470 if (nursery_blocks == blocks) return;
472 if (nursery_blocks < blocks) {
473 IF_DEBUG(gc, debugBelch("Increasing size of nursery to %d blocks\n",
475 stp->blocks = allocNursery(stp, stp->blocks, blocks-nursery_blocks);
480 IF_DEBUG(gc, debugBelch("Decreasing size of nursery to %d blocks\n",
484 while (nursery_blocks > blocks) {
486 next_bd->u.back = NULL;
487 nursery_blocks -= bd->blocks; // might be a large block
492 // might have gone just under, by freeing a large block, so make
493 // up the difference.
494 if (nursery_blocks < blocks) {
495 stp->blocks = allocNursery(stp, stp->blocks, blocks-nursery_blocks);
499 stp->n_blocks = blocks;
500 ASSERT(countBlocks(stp->blocks) == stp->n_blocks);
504 // Resize each of the nurseries to the specified size.
507 resizeNurseriesFixed (nat blocks)
510 for (i = 0; i < n_nurseries; i++) {
511 resizeNursery(&nurseries[i], blocks);
516 // Resize the nurseries to the total specified size.
519 resizeNurseries (nat blocks)
521 // If there are multiple nurseries, then we just divide the number
522 // of available blocks between them.
523 resizeNurseriesFixed(blocks / n_nurseries);
526 /* -----------------------------------------------------------------------------
527 The allocate() interface
529 allocate(n) always succeeds, and returns a chunk of memory n words
530 long. n can be larger than the size of a block if necessary, in
531 which case a contiguous block group will be allocated.
532 -------------------------------------------------------------------------- */
542 TICK_ALLOC_HEAP_NOCTR(n);
545 /* big allocation (>LARGE_OBJECT_THRESHOLD) */
546 /* ToDo: allocate directly into generation 1 */
547 if (n >= LARGE_OBJECT_THRESHOLD/sizeof(W_)) {
548 nat req_blocks = (lnat)BLOCK_ROUND_UP(n*sizeof(W_)) / BLOCK_SIZE;
549 bd = allocGroup(req_blocks);
550 dbl_link_onto(bd, &g0s0->large_objects);
551 g0s0->n_large_blocks += req_blocks;
554 bd->flags = BF_LARGE;
555 bd->free = bd->start + n;
556 alloc_blocks += req_blocks;
560 /* small allocation (<LARGE_OBJECT_THRESHOLD) */
561 } else if (small_alloc_list == NULL || alloc_Hp + n > alloc_HpLim) {
562 if (small_alloc_list) {
563 small_alloc_list->free = alloc_Hp;
566 bd->link = small_alloc_list;
567 small_alloc_list = bd;
571 alloc_Hp = bd->start;
572 alloc_HpLim = bd->start + BLOCK_SIZE_W;
583 allocated_bytes( void )
587 allocated = alloc_blocks * BLOCK_SIZE_W - (alloc_HpLim - alloc_Hp);
588 if (pinned_object_block != NULL) {
589 allocated -= (pinned_object_block->start + BLOCK_SIZE_W) -
590 pinned_object_block->free;
597 tidyAllocateLists (void)
599 if (small_alloc_list != NULL) {
600 ASSERT(alloc_Hp >= small_alloc_list->start &&
601 alloc_Hp <= small_alloc_list->start + BLOCK_SIZE);
602 small_alloc_list->free = alloc_Hp;
606 /* ---------------------------------------------------------------------------
607 Allocate a fixed/pinned object.
609 We allocate small pinned objects into a single block, allocating a
610 new block when the current one overflows. The block is chained
611 onto the large_object_list of generation 0 step 0.
613 NOTE: The GC can't in general handle pinned objects. This
614 interface is only safe to use for ByteArrays, which have no
615 pointers and don't require scavenging. It works because the
616 block's descriptor has the BF_LARGE flag set, so the block is
617 treated as a large object and chained onto various lists, rather
618 than the individual objects being copied. However, when it comes
619 to scavenge the block, the GC will only scavenge the first object.
620 The reason is that the GC can't linearly scan a block of pinned
621 objects at the moment (doing so would require using the
622 mostly-copying techniques). But since we're restricting ourselves
623 to pinned ByteArrays, not scavenging is ok.
625 This function is called by newPinnedByteArray# which immediately
626 fills the allocated memory with a MutableByteArray#.
627 ------------------------------------------------------------------------- */
630 allocatePinned( nat n )
633 bdescr *bd = pinned_object_block;
635 // If the request is for a large object, then allocate()
636 // will give us a pinned object anyway.
637 if (n >= LARGE_OBJECT_THRESHOLD/sizeof(W_)) {
643 TICK_ALLOC_HEAP_NOCTR(n);
646 // we always return 8-byte aligned memory. bd->free must be
647 // 8-byte aligned to begin with, so we just round up n to
648 // the nearest multiple of 8 bytes.
649 if (sizeof(StgWord) == 4) {
653 // If we don't have a block of pinned objects yet, or the current
654 // one isn't large enough to hold the new object, allocate a new one.
655 if (bd == NULL || (bd->free + n) > (bd->start + BLOCK_SIZE_W)) {
656 pinned_object_block = bd = allocBlock();
657 dbl_link_onto(bd, &g0s0->large_objects);
660 bd->flags = BF_PINNED | BF_LARGE;
661 bd->free = bd->start;
671 /* -----------------------------------------------------------------------------
672 Allocation functions for GMP.
674 These all use the allocate() interface - we can't have any garbage
675 collection going on during a gmp operation, so we use allocate()
676 which always succeeds. The gmp operations which might need to
677 allocate will ask the storage manager (via doYouWantToGC()) whether
678 a garbage collection is required, in case we get into a loop doing
679 only allocate() style allocation.
680 -------------------------------------------------------------------------- */
683 stgAllocForGMP (size_t size_in_bytes)
686 nat data_size_in_words, total_size_in_words;
688 /* round up to a whole number of words */
689 data_size_in_words = (size_in_bytes + sizeof(W_) + 1) / sizeof(W_);
690 total_size_in_words = sizeofW(StgArrWords) + data_size_in_words;
692 /* allocate and fill it in. */
693 arr = (StgArrWords *)allocate(total_size_in_words);
694 SET_ARR_HDR(arr, &stg_ARR_WORDS_info, CCCS, data_size_in_words);
696 /* and return a ptr to the goods inside the array */
701 stgReallocForGMP (void *ptr, size_t old_size, size_t new_size)
703 void *new_stuff_ptr = stgAllocForGMP(new_size);
705 char *p = (char *) ptr;
706 char *q = (char *) new_stuff_ptr;
708 for (; i < old_size; i++, p++, q++) {
712 return(new_stuff_ptr);
716 stgDeallocForGMP (void *ptr STG_UNUSED,
717 size_t size STG_UNUSED)
719 /* easy for us: the garbage collector does the dealloc'n */
722 /* -----------------------------------------------------------------------------
724 * -------------------------------------------------------------------------- */
726 /* -----------------------------------------------------------------------------
729 * Approximate how much we've allocated: number of blocks in the
730 * nursery + blocks allocated via allocate() - unused nusery blocks.
731 * This leaves a little slop at the end of each block, and doesn't
732 * take into account large objects (ToDo).
733 * -------------------------------------------------------------------------- */
736 calcAllocated( void )
742 allocated = allocated_bytes();
743 for (i = 0; i < n_nurseries; i++) {
744 allocated += nurseries[i].n_blocks * BLOCK_SIZE_W;
748 for (i = 0; i < n_nurseries; i++) {
750 for ( bd = capabilities[i].r.rCurrentNursery->link;
751 bd != NULL; bd = bd->link ) {
752 allocated -= BLOCK_SIZE_W;
754 cap = &capabilities[i];
755 if (cap->r.rCurrentNursery->free <
756 cap->r.rCurrentNursery->start + BLOCK_SIZE_W) {
757 allocated -= (cap->r.rCurrentNursery->start + BLOCK_SIZE_W)
758 - cap->r.rCurrentNursery->free;
762 bdescr *current_nursery = MainCapability.r.rCurrentNursery;
764 for ( bd = current_nursery->link; bd != NULL; bd = bd->link ) {
765 allocated -= BLOCK_SIZE_W;
767 if (current_nursery->free < current_nursery->start + BLOCK_SIZE_W) {
768 allocated -= (current_nursery->start + BLOCK_SIZE_W)
769 - current_nursery->free;
773 total_allocated += allocated;
777 /* Approximate the amount of live data in the heap. To be called just
778 * after garbage collection (see GarbageCollect()).
787 if (RtsFlags.GcFlags.generations == 1) {
788 live = (g0s0->n_to_blocks - 1) * BLOCK_SIZE_W +
789 ((lnat)g0s0->hp_bd->free - (lnat)g0s0->hp_bd->start) / sizeof(W_);
793 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
794 for (s = 0; s < generations[g].n_steps; s++) {
795 /* approximate amount of live data (doesn't take into account slop
796 * at end of each block).
798 if (g == 0 && s == 0) {
801 stp = &generations[g].steps[s];
802 live += (stp->n_large_blocks + stp->n_blocks - 1) * BLOCK_SIZE_W;
803 if (stp->hp_bd != NULL) {
804 live += ((lnat)stp->hp_bd->free - (lnat)stp->hp_bd->start)
812 /* Approximate the number of blocks that will be needed at the next
813 * garbage collection.
815 * Assume: all data currently live will remain live. Steps that will
816 * be collected next time will therefore need twice as many blocks
817 * since all the data will be copied.
826 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
827 for (s = 0; s < generations[g].n_steps; s++) {
828 if (g == 0 && s == 0) { continue; }
829 stp = &generations[g].steps[s];
830 if (generations[g].steps[0].n_blocks +
831 generations[g].steps[0].n_large_blocks
832 > generations[g].max_blocks
833 && stp->is_compacted == 0) {
834 needed += 2 * stp->n_blocks;
836 needed += stp->n_blocks;
843 /* -----------------------------------------------------------------------------
846 memInventory() checks for memory leaks by counting up all the
847 blocks we know about and comparing that to the number of blocks
848 allegedly floating around in the system.
849 -------------------------------------------------------------------------- */
854 stepBlocks (step *stp)
859 total_blocks = stp->n_blocks;
860 for (bd = stp->large_objects; bd; bd = bd->link) {
861 total_blocks += bd->blocks;
862 /* hack for megablock groups: they have an extra block or two in
863 the second and subsequent megablocks where the block
864 descriptors would normally go.
866 if (bd->blocks > BLOCKS_PER_MBLOCK) {
867 total_blocks -= (MBLOCK_SIZE / BLOCK_SIZE - BLOCKS_PER_MBLOCK)
868 * (bd->blocks/(MBLOCK_SIZE/BLOCK_SIZE));
880 lnat total_blocks = 0, free_blocks = 0;
882 /* count the blocks we current have */
884 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
885 for (bd = generations[g].mut_list; bd != NULL; bd = bd->link) {
886 total_blocks += bd->blocks;
888 for (s = 0; s < generations[g].n_steps; s++) {
889 if (g==0 && s==0) continue;
890 stp = &generations[g].steps[s];
891 total_blocks += stepBlocks(stp);
895 for (i = 0; i < n_nurseries; i++) {
896 total_blocks += stepBlocks(&nurseries[i]);
899 if (RtsFlags.GcFlags.generations == 1) {
900 /* two-space collector has a to-space too :-) */
901 total_blocks += g0s0->n_to_blocks;
904 /* any blocks held by allocate() */
905 for (bd = small_alloc_list; bd; bd = bd->link) {
906 total_blocks += bd->blocks;
910 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_RETAINER) {
911 total_blocks += retainerStackBlocks();
915 // count the blocks allocated by the arena allocator
916 total_blocks += arenaBlocks();
918 /* count the blocks on the free list */
919 free_blocks = countFreeList();
921 if (total_blocks + free_blocks != mblocks_allocated *
923 debugBelch("Blocks: %ld live + %ld free = %ld total (%ld around)\n",
924 total_blocks, free_blocks, total_blocks + free_blocks,
925 mblocks_allocated * BLOCKS_PER_MBLOCK);
928 ASSERT(total_blocks + free_blocks == mblocks_allocated * BLOCKS_PER_MBLOCK);
933 countBlocks(bdescr *bd)
936 for (n=0; bd != NULL; bd=bd->link) {
942 /* Full heap sanity check. */
948 if (RtsFlags.GcFlags.generations == 1) {
949 checkHeap(g0s0->to_blocks);
950 checkChain(g0s0->large_objects);
953 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
954 for (s = 0; s < generations[g].n_steps; s++) {
955 if (g == 0 && s == 0) { continue; }
956 ASSERT(countBlocks(generations[g].steps[s].blocks)
957 == generations[g].steps[s].n_blocks);
958 ASSERT(countBlocks(generations[g].steps[s].large_objects)
959 == generations[g].steps[s].n_large_blocks);
960 checkHeap(generations[g].steps[s].blocks);
961 checkChain(generations[g].steps[s].large_objects);
963 checkMutableList(generations[g].mut_list, g);
968 for (s = 0; s < n_nurseries; s++) {
969 ASSERT(countBlocks(nurseries[s].blocks)
970 == nurseries[s].n_blocks);
971 ASSERT(countBlocks(nurseries[s].large_objects)
972 == nurseries[s].n_large_blocks);
975 checkFreeListSanity();
979 // handy function for use in gdb, because Bdescr() is inlined.
980 extern bdescr *_bdescr( StgPtr p );