1 /* -----------------------------------------------------------------------------
2 * $Id: Storage.c,v 1.60 2002/03/21 11:23:59 sebc Exp $
4 * (c) The GHC Team, 1998-1999
6 * Storage manager front end
8 * ---------------------------------------------------------------------------*/
10 #include "PosixSource.h"
16 #include "BlockAlloc.h"
24 #include "OSThreads.h"
25 #include "StoragePriv.h"
27 #include "RetainerProfile.h" // for counting memory blocks (memInventory)
29 #ifdef darwin_TARGET_OS
30 #include <mach/mach.h>
31 #include <mach/task.h>
32 #include <mach/message.h>
33 #include <mach/vm_prot.h>
34 #include <mach/vm_region.h>
35 #include <mach-o/getsect.h>
36 unsigned long macho_etext = 0;
37 unsigned long macho_edata = 0;
38 #define IN_RANGE(base,size,x) (((P_)base) <= ((P_)x) && ((P_)x) < ((P_)((unsigned long)base + size)))
39 static void macosx_get_memory_layout(void)
43 struct vm_region_basic_info info;
44 mach_msg_type_number_t info_count;
45 mach_port_t object_name;
46 task_t task = mach_task_self();
47 P_ in_text = ((P_*)(&stg_BLACKHOLE_info))[0];
48 P_ in_data = (P_)&stg_dummy_ret_closure;
50 address = 0; /* VM_MIN_ADDRESS */
52 info_count = VM_REGION_BASIC_INFO_COUNT;
53 if (vm_region(task, &address, &size, VM_REGION_BASIC_INFO,
54 (vm_region_info_t)&info, &info_count, &object_name)
57 if (IN_RANGE(address, size, in_text))
58 macho_etext = address + size;
59 if (IN_RANGE(address, size, in_data))
60 macho_edata = address + size;
66 StgClosure *caf_list = NULL;
68 bdescr *small_alloc_list; /* allocate()d small objects */
69 bdescr *large_alloc_list; /* allocate()d large objects */
70 bdescr *pinned_object_block; /* allocate pinned objects into this block */
71 nat alloc_blocks; /* number of allocate()d blocks since GC */
72 nat alloc_blocks_lim; /* approximate limit on alloc_blocks */
74 StgPtr alloc_Hp = NULL; /* next free byte in small_alloc_list */
75 StgPtr alloc_HpLim = NULL; /* end of block at small_alloc_list */
77 generation *generations; /* all the generations */
78 generation *g0; /* generation 0, for convenience */
79 generation *oldest_gen; /* oldest generation, for convenience */
80 step *g0s0; /* generation 0, step 0, for convenience */
82 lnat total_allocated = 0; /* total memory allocated during run */
85 * Storage manager mutex: protects all the above state from
86 * simultaneous access by two STG threads.
89 Mutex sm_mutex = INIT_MUTEX_VAR;
95 static void *stgAllocForGMP (size_t size_in_bytes);
96 static void *stgReallocForGMP (void *ptr, size_t old_size, size_t new_size);
97 static void stgDeallocForGMP (void *ptr, size_t size);
106 #if defined(darwin_TARGET_OS)
107 macosx_get_memory_layout();
110 /* Sanity check to make sure we are able to make the distinction
111 * between closures and infotables
113 if (!LOOKS_LIKE_GHC_INFO(&stg_BLACKHOLE_info)) {
114 barf("LOOKS_LIKE_GHC_INFO+ is incorrectly defined");
117 if (LOOKS_LIKE_GHC_INFO(&stg_dummy_ret_closure)) {
118 barf("LOOKS_LIKE_GHC_INFO- is incorrectly defined");
121 if (LOOKS_LIKE_STATIC_CLOSURE(&stg_BLACKHOLE_info)) {
122 barf("LOOKS_LIKE_STATIC_CLOSURE- is incorrectly defined");
125 if (!LOOKS_LIKE_STATIC_CLOSURE(&stg_dummy_ret_closure)) {
126 barf("LOOKS_LIKE_STATIC_CLOSURE+ is incorrectly defined");
130 if (RtsFlags.GcFlags.maxHeapSize != 0 &&
131 RtsFlags.GcFlags.heapSizeSuggestion >
132 RtsFlags.GcFlags.maxHeapSize) {
133 RtsFlags.GcFlags.maxHeapSize = RtsFlags.GcFlags.heapSizeSuggestion;
136 if (RtsFlags.GcFlags.maxHeapSize != 0 &&
137 RtsFlags.GcFlags.minAllocAreaSize >
138 RtsFlags.GcFlags.maxHeapSize) {
139 prog_belch("maximum heap size (-M) is smaller than minimum alloc area size (-A)");
143 initBlockAllocator();
146 initCondition(&sm_mutex);
149 /* allocate generation info array */
150 generations = (generation *)stgMallocBytes(RtsFlags.GcFlags.generations
151 * sizeof(struct _generation),
152 "initStorage: gens");
154 /* Initialise all generations */
155 for(g = 0; g < RtsFlags.GcFlags.generations; g++) {
156 gen = &generations[g];
158 gen->mut_list = END_MUT_LIST;
159 gen->mut_once_list = END_MUT_LIST;
160 gen->collections = 0;
161 gen->failed_promotions = 0;
165 /* A couple of convenience pointers */
166 g0 = &generations[0];
167 oldest_gen = &generations[RtsFlags.GcFlags.generations-1];
169 /* Allocate step structures in each generation */
170 if (RtsFlags.GcFlags.generations > 1) {
171 /* Only for multiple-generations */
173 /* Oldest generation: one step */
174 oldest_gen->n_steps = 1;
176 stgMallocBytes(1 * sizeof(struct _step), "initStorage: last step");
178 /* set up all except the oldest generation with 2 steps */
179 for(g = 0; g < RtsFlags.GcFlags.generations-1; g++) {
180 generations[g].n_steps = RtsFlags.GcFlags.steps;
181 generations[g].steps =
182 stgMallocBytes (RtsFlags.GcFlags.steps * sizeof(struct _step),
183 "initStorage: steps");
187 /* single generation, i.e. a two-space collector */
189 g0->steps = stgMallocBytes (sizeof(struct _step), "initStorage: steps");
192 /* Initialise all steps */
193 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
194 for (s = 0; s < generations[g].n_steps; s++) {
195 stp = &generations[g].steps[s];
199 stp->gen = &generations[g];
206 stp->large_objects = NULL;
207 stp->n_large_blocks = 0;
208 stp->new_large_objects = NULL;
209 stp->scavenged_large_objects = NULL;
210 stp->n_scavenged_large_blocks = 0;
211 stp->is_compacted = 0;
216 /* Set up the destination pointers in each younger gen. step */
217 for (g = 0; g < RtsFlags.GcFlags.generations-1; g++) {
218 for (s = 0; s < generations[g].n_steps-1; s++) {
219 generations[g].steps[s].to = &generations[g].steps[s+1];
221 generations[g].steps[s].to = &generations[g+1].steps[0];
224 /* The oldest generation has one step and it is compacted. */
225 if (RtsFlags.GcFlags.compact) {
226 if (RtsFlags.GcFlags.generations == 1) {
227 belch("WARNING: compaction is incompatible with -G1; disabled");
229 oldest_gen->steps[0].is_compacted = 1;
232 oldest_gen->steps[0].to = &oldest_gen->steps[0];
234 /* generation 0 is special: that's the nursery */
235 generations[0].max_blocks = 0;
237 /* G0S0: the allocation area. Policy: keep the allocation area
238 * small to begin with, even if we have a large suggested heap
239 * size. Reason: we're going to do a major collection first, and we
240 * don't want it to be a big one. This vague idea is borne out by
241 * rigorous experimental evidence.
243 g0s0 = &generations[0].steps[0];
247 weak_ptr_list = NULL;
250 /* initialise the allocate() interface */
251 small_alloc_list = NULL;
252 large_alloc_list = NULL;
254 alloc_blocks_lim = RtsFlags.GcFlags.minAllocAreaSize;
256 /* Tell GNU multi-precision pkg about our custom alloc functions */
257 mp_set_memory_functions(stgAllocForGMP, stgReallocForGMP, stgDeallocForGMP);
260 initMutex(&sm_mutex);
263 IF_DEBUG(gc, statDescribeGens());
269 stat_exit(calcAllocated());
272 /* -----------------------------------------------------------------------------
275 The entry code for every CAF does the following:
277 - builds a CAF_BLACKHOLE in the heap
278 - pushes an update frame pointing to the CAF_BLACKHOLE
279 - invokes UPD_CAF(), which:
280 - calls newCaf, below
281 - updates the CAF with a static indirection to the CAF_BLACKHOLE
283 Why do we build a BLACKHOLE in the heap rather than just updating
284 the thunk directly? It's so that we only need one kind of update
285 frame - otherwise we'd need a static version of the update frame too.
287 newCaf() does the following:
289 - it puts the CAF on the oldest generation's mut-once list.
290 This is so that we can treat the CAF as a root when collecting
293 For GHCI, we have additional requirements when dealing with CAFs:
295 - we must *retain* all dynamically-loaded CAFs ever entered,
296 just in case we need them again.
297 - we must be able to *revert* CAFs that have been evaluated, to
298 their pre-evaluated form.
300 To do this, we use an additional CAF list. When newCaf() is
301 called on a dynamically-loaded CAF, we add it to the CAF list
302 instead of the old-generation mutable list, and save away its
303 old info pointer (in caf->saved_info) for later reversion.
305 To revert all the CAFs, we traverse the CAF list and reset the
306 info pointer to caf->saved_info, then throw away the CAF list.
307 (see GC.c:revertCAFs()).
311 -------------------------------------------------------------------------- */
314 newCAF(StgClosure* caf)
316 /* Put this CAF on the mutable list for the old generation.
317 * This is a HACK - the IND_STATIC closure doesn't really have
318 * a mut_link field, but we pretend it has - in fact we re-use
319 * the STATIC_LINK field for the time being, because when we
320 * come to do a major GC we won't need the mut_link field
321 * any more and can use it as a STATIC_LINK.
325 if (is_dynamically_loaded_rwdata_ptr((StgPtr)caf)) {
326 ((StgIndStatic *)caf)->saved_info = (StgInfoTable *)caf->header.info;
327 ((StgIndStatic *)caf)->static_link = caf_list;
330 ((StgIndStatic *)caf)->saved_info = NULL;
331 ((StgMutClosure *)caf)->mut_link = oldest_gen->mut_once_list;
332 oldest_gen->mut_once_list = (StgMutClosure *)caf;
338 /* If we are PAR or DIST then we never forget a CAF */
340 //belch("<##> Globalising CAF %08x %s",caf,info_type(caf));
341 newGA=makeGlobal(caf,rtsTrue); /*given full weight*/
347 /* -----------------------------------------------------------------------------
349 -------------------------------------------------------------------------- */
352 allocNurseries( void )
361 for (cap = free_capabilities; cap != NULL; cap = cap->link) {
362 cap->r.rNursery = allocNursery(NULL, RtsFlags.GcFlags.minAllocAreaSize);
363 cap->r.rCurrentNursery = cap->r.rNursery;
364 for (bd = cap->r.rNursery; bd != NULL; bd = bd->link) {
365 bd->u.back = (bdescr *)cap;
368 /* Set the back links to be equal to the Capability,
369 * so we can do slightly better informed locking.
373 g0s0->blocks = allocNursery(NULL, RtsFlags.GcFlags.minAllocAreaSize);
374 g0s0->n_blocks = RtsFlags.GcFlags.minAllocAreaSize;
375 g0s0->to_blocks = NULL;
376 g0s0->n_to_blocks = 0;
377 MainCapability.r.rNursery = g0s0->blocks;
378 MainCapability.r.rCurrentNursery = g0s0->blocks;
379 /* hp, hpLim, hp_bd, to_space etc. aren't used in G0S0 */
384 resetNurseries( void )
390 /* All tasks must be stopped */
391 ASSERT(n_free_capabilities == RtsFlags.ParFlags.nNodes);
393 for (cap = free_capabilities; cap != NULL; cap = cap->link) {
394 for (bd = cap->r.rNursery; bd; bd = bd->link) {
395 bd->free = bd->start;
396 ASSERT(bd->gen_no == 0);
397 ASSERT(bd->step == g0s0);
398 IF_DEBUG(sanity,memset(bd->start, 0xaa, BLOCK_SIZE));
400 cap->r.rCurrentNursery = cap->r.rNursery;
403 for (bd = g0s0->blocks; bd; bd = bd->link) {
404 bd->free = bd->start;
405 ASSERT(bd->gen_no == 0);
406 ASSERT(bd->step == g0s0);
407 IF_DEBUG(sanity,memset(bd->start, 0xaa, BLOCK_SIZE));
409 MainCapability.r.rNursery = g0s0->blocks;
410 MainCapability.r.rCurrentNursery = g0s0->blocks;
415 allocNursery (bdescr *tail, nat blocks)
420 // Allocate a nursery: we allocate fresh blocks one at a time and
421 // cons them on to the front of the list, not forgetting to update
422 // the back pointer on the tail of the list to point to the new block.
423 for (i=0; i < blocks; i++) {
426 processNursery() in LdvProfile.c assumes that every block group in
427 the nursery contains only a single block. So, if a block group is
428 given multiple blocks, change processNursery() accordingly.
432 // double-link the nursery: we might need to insert blocks
439 bd->free = bd->start;
447 resizeNursery ( nat blocks )
453 barf("resizeNursery: can't resize in SMP mode");
456 nursery_blocks = g0s0->n_blocks;
457 if (nursery_blocks == blocks) {
461 else if (nursery_blocks < blocks) {
462 IF_DEBUG(gc, fprintf(stderr, "Increasing size of nursery to %d blocks\n",
464 g0s0->blocks = allocNursery(g0s0->blocks, blocks-nursery_blocks);
470 IF_DEBUG(gc, fprintf(stderr, "Decreasing size of nursery to %d blocks\n",
474 while (nursery_blocks > blocks) {
476 next_bd->u.back = NULL;
477 nursery_blocks -= bd->blocks; // might be a large block
482 // might have gone just under, by freeing a large block, so make
483 // up the difference.
484 if (nursery_blocks < blocks) {
485 g0s0->blocks = allocNursery(g0s0->blocks, blocks-nursery_blocks);
489 g0s0->n_blocks = blocks;
490 ASSERT(countBlocks(g0s0->blocks) == g0s0->n_blocks);
493 /* -----------------------------------------------------------------------------
494 The allocate() interface
496 allocate(n) always succeeds, and returns a chunk of memory n words
497 long. n can be larger than the size of a block if necessary, in
498 which case a contiguous block group will be allocated.
499 -------------------------------------------------------------------------- */
509 TICK_ALLOC_HEAP_NOCTR(n);
512 /* big allocation (>LARGE_OBJECT_THRESHOLD) */
513 /* ToDo: allocate directly into generation 1 */
514 if (n >= LARGE_OBJECT_THRESHOLD/sizeof(W_)) {
515 nat req_blocks = (lnat)BLOCK_ROUND_UP(n*sizeof(W_)) / BLOCK_SIZE;
516 bd = allocGroup(req_blocks);
517 dbl_link_onto(bd, &g0s0->large_objects);
520 bd->flags = BF_LARGE;
521 bd->free = bd->start;
522 /* don't add these blocks to alloc_blocks, since we're assuming
523 * that large objects are likely to remain live for quite a while
524 * (eg. running threads), so garbage collecting early won't make
527 alloc_blocks += req_blocks;
531 /* small allocation (<LARGE_OBJECT_THRESHOLD) */
532 } else if (small_alloc_list == NULL || alloc_Hp + n > alloc_HpLim) {
533 if (small_alloc_list) {
534 small_alloc_list->free = alloc_Hp;
537 bd->link = small_alloc_list;
538 small_alloc_list = bd;
542 alloc_Hp = bd->start;
543 alloc_HpLim = bd->start + BLOCK_SIZE_W;
554 allocated_bytes( void )
556 return (alloc_blocks * BLOCK_SIZE_W - (alloc_HpLim - alloc_Hp));
559 /* ---------------------------------------------------------------------------
560 Allocate a fixed/pinned object.
562 We allocate small pinned objects into a single block, allocating a
563 new block when the current one overflows. The block is chained
564 onto the large_object_list of generation 0 step 0.
566 NOTE: The GC can't in general handle pinned objects. This
567 interface is only safe to use for ByteArrays, which have no
568 pointers and don't require scavenging. It works because the
569 block's descriptor has the BF_LARGE flag set, so the block is
570 treated as a large object and chained onto various lists, rather
571 than the individual objects being copied. However, when it comes
572 to scavenge the block, the GC will only scavenge the first object.
573 The reason is that the GC can't linearly scan a block of pinned
574 objects at the moment (doing so would require using the
575 mostly-copying techniques). But since we're restricting ourselves
576 to pinned ByteArrays, not scavenging is ok.
578 This function is called by newPinnedByteArray# which immediately
579 fills the allocated memory with a MutableByteArray#.
580 ------------------------------------------------------------------------- */
583 allocatePinned( nat n )
586 bdescr *bd = pinned_object_block;
590 TICK_ALLOC_HEAP_NOCTR(n);
593 // If the request is for a large object, then allocate()
594 // will give us a pinned object anyway.
595 if (n >= LARGE_OBJECT_THRESHOLD/sizeof(W_)) {
600 // If we don't have a block of pinned objects yet, or the current
601 // one isn't large enough to hold the new object, allocate a new one.
602 if (bd == NULL || (bd->free + n) > (bd->start + BLOCK_SIZE_W)) {
603 pinned_object_block = bd = allocBlock();
604 dbl_link_onto(bd, &g0s0->large_objects);
607 bd->flags = BF_LARGE;
608 bd->free = bd->start;
618 /* -----------------------------------------------------------------------------
619 Allocation functions for GMP.
621 These all use the allocate() interface - we can't have any garbage
622 collection going on during a gmp operation, so we use allocate()
623 which always succeeds. The gmp operations which might need to
624 allocate will ask the storage manager (via doYouWantToGC()) whether
625 a garbage collection is required, in case we get into a loop doing
626 only allocate() style allocation.
627 -------------------------------------------------------------------------- */
630 stgAllocForGMP (size_t size_in_bytes)
633 nat data_size_in_words, total_size_in_words;
635 /* should be a multiple of sizeof(StgWord) (whole no. of limbs) */
636 ASSERT(size_in_bytes % sizeof(W_) == 0);
638 data_size_in_words = size_in_bytes / sizeof(W_);
639 total_size_in_words = sizeofW(StgArrWords) + data_size_in_words;
641 /* allocate and fill it in. */
642 arr = (StgArrWords *)allocate(total_size_in_words);
643 SET_ARR_HDR(arr, &stg_ARR_WORDS_info, CCCS, data_size_in_words);
645 /* and return a ptr to the goods inside the array */
646 return(BYTE_ARR_CTS(arr));
650 stgReallocForGMP (void *ptr, size_t old_size, size_t new_size)
652 void *new_stuff_ptr = stgAllocForGMP(new_size);
654 char *p = (char *) ptr;
655 char *q = (char *) new_stuff_ptr;
657 for (; i < old_size; i++, p++, q++) {
661 return(new_stuff_ptr);
665 stgDeallocForGMP (void *ptr STG_UNUSED,
666 size_t size STG_UNUSED)
668 /* easy for us: the garbage collector does the dealloc'n */
671 /* -----------------------------------------------------------------------------
673 * -------------------------------------------------------------------------- */
675 /* -----------------------------------------------------------------------------
678 * Approximate how much we've allocated: number of blocks in the
679 * nursery + blocks allocated via allocate() - unused nusery blocks.
680 * This leaves a little slop at the end of each block, and doesn't
681 * take into account large objects (ToDo).
682 * -------------------------------------------------------------------------- */
685 calcAllocated( void )
693 /* All tasks must be stopped. Can't assert that all the
694 capabilities are owned by the scheduler, though: one or more
695 tasks might have been stopped while they were running (non-main)
697 /* ASSERT(n_free_capabilities == RtsFlags.ParFlags.nNodes); */
700 n_free_capabilities * RtsFlags.GcFlags.minAllocAreaSize * BLOCK_SIZE_W
703 for (cap = free_capabilities; cap != NULL; cap = cap->link) {
704 for ( bd = cap->r.rCurrentNursery->link; bd != NULL; bd = bd->link ) {
705 allocated -= BLOCK_SIZE_W;
707 if (cap->r.rCurrentNursery->free < cap->r.rCurrentNursery->start
709 allocated -= (cap->r.rCurrentNursery->start + BLOCK_SIZE_W)
710 - cap->r.rCurrentNursery->free;
715 bdescr *current_nursery = MainCapability.r.rCurrentNursery;
717 allocated = (g0s0->n_blocks * BLOCK_SIZE_W) + allocated_bytes();
718 for ( bd = current_nursery->link; bd != NULL; bd = bd->link ) {
719 allocated -= BLOCK_SIZE_W;
721 if (current_nursery->free < current_nursery->start + BLOCK_SIZE_W) {
722 allocated -= (current_nursery->start + BLOCK_SIZE_W)
723 - current_nursery->free;
727 total_allocated += allocated;
731 /* Approximate the amount of live data in the heap. To be called just
732 * after garbage collection (see GarbageCollect()).
741 if (RtsFlags.GcFlags.generations == 1) {
742 live = (g0s0->n_to_blocks - 1) * BLOCK_SIZE_W +
743 ((lnat)g0s0->hp_bd->free - (lnat)g0s0->hp_bd->start) / sizeof(W_);
747 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
748 for (s = 0; s < generations[g].n_steps; s++) {
749 /* approximate amount of live data (doesn't take into account slop
750 * at end of each block).
752 if (g == 0 && s == 0) {
755 stp = &generations[g].steps[s];
756 live += (stp->n_large_blocks + stp->n_blocks - 1) * BLOCK_SIZE_W;
757 if (stp->hp_bd != NULL) {
758 live += ((lnat)stp->hp_bd->free - (lnat)stp->hp_bd->start)
766 /* Approximate the number of blocks that will be needed at the next
767 * garbage collection.
769 * Assume: all data currently live will remain live. Steps that will
770 * be collected next time will therefore need twice as many blocks
771 * since all the data will be copied.
780 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
781 for (s = 0; s < generations[g].n_steps; s++) {
782 if (g == 0 && s == 0) { continue; }
783 stp = &generations[g].steps[s];
784 if (generations[g].steps[0].n_blocks +
785 generations[g].steps[0].n_large_blocks
786 > generations[g].max_blocks
787 && stp->is_compacted == 0) {
788 needed += 2 * stp->n_blocks;
790 needed += stp->n_blocks;
797 /* -----------------------------------------------------------------------------
800 memInventory() checks for memory leaks by counting up all the
801 blocks we know about and comparing that to the number of blocks
802 allegedly floating around in the system.
803 -------------------------------------------------------------------------- */
813 lnat total_blocks = 0, free_blocks = 0;
815 /* count the blocks we current have */
817 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
818 for (s = 0; s < generations[g].n_steps; s++) {
819 stp = &generations[g].steps[s];
820 total_blocks += stp->n_blocks;
821 if (RtsFlags.GcFlags.generations == 1) {
822 /* two-space collector has a to-space too :-) */
823 total_blocks += g0s0->n_to_blocks;
825 for (bd = stp->large_objects; bd; bd = bd->link) {
826 total_blocks += bd->blocks;
827 /* hack for megablock groups: they have an extra block or two in
828 the second and subsequent megablocks where the block
829 descriptors would normally go.
831 if (bd->blocks > BLOCKS_PER_MBLOCK) {
832 total_blocks -= (MBLOCK_SIZE / BLOCK_SIZE - BLOCKS_PER_MBLOCK)
833 * (bd->blocks/(MBLOCK_SIZE/BLOCK_SIZE));
839 /* any blocks held by allocate() */
840 for (bd = small_alloc_list; bd; bd = bd->link) {
841 total_blocks += bd->blocks;
843 for (bd = large_alloc_list; bd; bd = bd->link) {
844 total_blocks += bd->blocks;
848 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_RETAINER) {
849 for (bd = firstStack; bd != NULL; bd = bd->link)
850 total_blocks += bd->blocks;
854 // count the blocks allocated by the arena allocator
855 total_blocks += arenaBlocks();
857 /* count the blocks on the free list */
858 free_blocks = countFreeList();
860 if (total_blocks + free_blocks != mblocks_allocated *
862 fprintf(stderr, "Blocks: %ld live + %ld free = %ld total (%ld around)\n",
863 total_blocks, free_blocks, total_blocks + free_blocks,
864 mblocks_allocated * BLOCKS_PER_MBLOCK);
867 ASSERT(total_blocks + free_blocks == mblocks_allocated * BLOCKS_PER_MBLOCK);
872 countBlocks(bdescr *bd)
875 for (n=0; bd != NULL; bd=bd->link) {
881 /* Full heap sanity check. */
887 if (RtsFlags.GcFlags.generations == 1) {
888 checkHeap(g0s0->to_blocks);
889 checkChain(g0s0->large_objects);
892 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
893 for (s = 0; s < generations[g].n_steps; s++) {
894 ASSERT(countBlocks(generations[g].steps[s].blocks)
895 == generations[g].steps[s].n_blocks);
896 ASSERT(countBlocks(generations[g].steps[s].large_objects)
897 == generations[g].steps[s].n_large_blocks);
898 if (g == 0 && s == 0) { continue; }
899 checkHeap(generations[g].steps[s].blocks);
900 checkChain(generations[g].steps[s].large_objects);
902 checkMutableList(generations[g].mut_list, g);
903 checkMutOnceList(generations[g].mut_once_list, g);
907 checkFreeListSanity();
911 // handy function for use in gdb, because Bdescr() is inlined.
912 extern bdescr *_bdescr( StgPtr p );