1 /* -----------------------------------------------------------------------------
2 * $Id: ProfHeap.c,v 1.50 2003/11/12 17:49:08 sof Exp $
4 * (c) The GHC Team, 1998-2003
6 * Support for heap profiling
8 * ---------------------------------------------------------------------------*/
10 #if defined(DEBUG) && !defined(PROFILING)
11 #define DEBUG_HEAP_PROF
13 #undef DEBUG_HEAP_PROF
16 #if defined(PROFILING) || defined(DEBUG_HEAP_PROF)
18 #include "PosixSource.h"
22 #include "Profiling.h"
28 #include "RetainerProfile.h"
29 #include "LdvProfile.h"
36 /* -----------------------------------------------------------------------------
37 * era stores the current time period. It is the same as the
38 * number of censuses that have been performed.
41 * era must be no longer than LDV_SHIFT (15 or 30) bits.
43 * era is initialized to 1 in initHeapProfiling().
45 * max_era is initialized to 2^LDV_SHIFT in initHeapProfiling().
46 * When era reaches max_era, the profiling stops because a closure can
47 * store only up to (max_era - 1) as its creation or last use time.
48 * -------------------------------------------------------------------------- */
52 /* -----------------------------------------------------------------------------
55 * For most heap profiles each closure identity gets a simple count
56 * of live words in the heap at each census. However, if we're
57 * selecting by biography, then we have to keep the various
58 * lag/drag/void counters for each identity.
59 * -------------------------------------------------------------------------- */
60 typedef struct _counter {
65 int prim; // total size of 'inherently used' closures
66 int not_used; // total size of 'never used' closures
67 int used; // total size of 'used at least once' closures
68 int void_total; // current total size of 'destroyed without being used' closures
69 int drag_total; // current total size of 'used at least once and waiting to die'
72 struct _counter *next;
76 initLDVCtr( counter *ctr )
79 ctr->c.ldv.not_used = 0;
81 ctr->c.ldv.void_total = 0;
82 ctr->c.ldv.drag_total = 0;
86 double time; // the time in MUT time when the census is made
91 // for LDV profiling, when just displaying by LDV
99 static Census *censuses = NULL;
100 static nat n_censuses = 0;
103 static void aggregateCensusInfo( void );
106 static void dumpCensus( Census *census );
108 /* -----------------------------------------------------------------------------
109 Closure Type Profiling;
111 PROBABLY TOTALLY OUT OF DATE -- ToDo (SDM)
112 -------------------------------------------------------------------------- */
114 #ifdef DEBUG_HEAP_PROF
115 static char *type_names[] = {
121 , "CONSTR_NOCAF_STATIC"
159 , "MUT_ARR_PTRS_FROZEN"
173 #endif /* DEBUG_HEAP_PROF */
175 /* -----------------------------------------------------------------------------
176 * Find the "closure identity", which is a unique pointer reresenting
177 * the band to which this closure's heap space is attributed in the
179 * ------------------------------------------------------------------------- */
181 closureIdentity( StgClosure *p )
183 switch (RtsFlags.ProfFlags.doHeapProfile) {
187 return p->header.prof.ccs;
189 return p->header.prof.ccs->cc->module;
191 return get_itbl(p)->prof.closure_desc;
193 return get_itbl(p)->prof.closure_type;
194 case HEAP_BY_RETAINER:
195 // AFAIK, the only closures in the heap which might not have a
196 // valid retainer set are DEAD_WEAK closures.
197 if (isRetainerSetFieldValid(p))
198 return retainerSetOf(p);
203 case HEAP_BY_INFOPTR:
204 return (void *)((StgClosure *)p)->header.info;
205 case HEAP_BY_CLOSURE_TYPE:
206 return type_names[get_itbl(p)->type];
210 barf("closureIdentity");
214 /* --------------------------------------------------------------------------
215 * Profiling type predicates
216 * ----------------------------------------------------------------------- */
218 STATIC_INLINE rtsBool
219 doingLDVProfiling( void )
221 return (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV
222 || RtsFlags.ProfFlags.bioSelector != NULL);
225 STATIC_INLINE rtsBool
226 doingRetainerProfiling( void )
228 return (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_RETAINER
229 || RtsFlags.ProfFlags.retainerSelector != NULL);
233 // Precesses a closure 'c' being destroyed whose size is 'size'.
234 // Make sure that LDV_recordDead() is not invoked on 'inherently used' closures
235 // such as TSO; they should not be involved in computing dragNew or voidNew.
237 // Even though era is checked in both LdvCensusForDead() and
238 // LdvCensusKillAll(), we still need to make sure that era is > 0 because
239 // LDV_recordDead() may be called from elsewhere in the runtime system. E.g.,
240 // when a thunk is replaced by an indirection object.
244 LDV_recordDead( StgClosure *c, nat size )
250 if (era > 0 && closureSatisfiesConstraints(c)) {
251 size -= sizeofW(StgProfHeader);
252 if ((LDVW((c)) & LDV_STATE_MASK) == LDV_STATE_CREATE) {
253 t = (LDVW((c)) & LDV_CREATE_MASK) >> LDV_SHIFT;
255 if (RtsFlags.ProfFlags.bioSelector == NULL) {
256 censuses[t].void_total += (int)size;
257 censuses[era].void_total -= (int)size;
259 id = closureIdentity(c);
260 ctr = lookupHashTable(censuses[t].hash, (StgWord)id);
261 ASSERT( ctr != NULL );
262 ctr->c.ldv.void_total += (int)size;
263 ctr = lookupHashTable(censuses[era].hash, (StgWord)id);
265 ctr = arenaAlloc(censuses[era].arena, sizeof(counter));
267 insertHashTable(censuses[era].hash, (StgWord)id, ctr);
269 ctr->next = censuses[era].ctrs;
270 censuses[era].ctrs = ctr;
272 ctr->c.ldv.void_total -= (int)size;
276 t = LDVW((c)) & LDV_LAST_MASK;
278 if (RtsFlags.ProfFlags.bioSelector == NULL) {
279 censuses[t+1].drag_total += size;
280 censuses[era].drag_total -= size;
283 id = closureIdentity(c);
284 ctr = lookupHashTable(censuses[t+1].hash, (StgWord)id);
285 ASSERT( ctr != NULL );
286 ctr->c.ldv.drag_total += (int)size;
287 ctr = lookupHashTable(censuses[era].hash, (StgWord)id);
289 ctr = arenaAlloc(censuses[era].arena, sizeof(counter));
291 insertHashTable(censuses[era].hash, (StgWord)id, ctr);
293 ctr->next = censuses[era].ctrs;
294 censuses[era].ctrs = ctr;
296 ctr->c.ldv.drag_total -= (int)size;
304 /* --------------------------------------------------------------------------
305 * Initialize censuses[era];
306 * ----------------------------------------------------------------------- */
308 initEra(Census *census)
310 census->hash = allocHashTable();
312 census->arena = newArena();
314 census->not_used = 0;
317 census->void_total = 0;
318 census->drag_total = 0;
321 /* --------------------------------------------------------------------------
322 * Increases era by 1 and initialize census[era].
323 * Reallocates gi[] and increases its size if needed.
324 * ----------------------------------------------------------------------- */
329 if (doingLDVProfiling()) {
332 if (era == max_era) {
333 prog_belch("maximum number of censuses reached; use +RTS -i to reduce");
334 stg_exit(EXIT_FAILURE);
337 if (era == n_censuses) {
339 censuses = stgReallocBytes(censuses, sizeof(Census) * n_censuses,
345 initEra( &censuses[era] );
348 /* -----------------------------------------------------------------------------
349 * DEBUG heap profiling, by info table
350 * -------------------------------------------------------------------------- */
352 #ifdef DEBUG_HEAP_PROF
354 static char *hp_filename;
356 void initProfiling1( void )
360 void initProfiling2( void )
362 if (RtsFlags.ProfFlags.doHeapProfile) {
363 /* Initialise the log file name */
364 hp_filename = stgMallocBytes(strlen(prog_name) + 6, "hpFileName");
365 sprintf(hp_filename, "%s.hp", prog_name);
367 /* open the log file */
368 if ((hp_file = fopen(hp_filename, "w")) == NULL) {
369 fprintf(stderr, "Can't open profiling report file %s\n",
371 RtsFlags.ProfFlags.doHeapProfile = 0;
379 void endProfiling( void )
383 #endif /* DEBUG_HEAP_PROF */
385 /* --------------------------------------------------------------------------
386 * Initialize the heap profilier
387 * ----------------------------------------------------------------------- */
389 initHeapProfiling(void)
391 if (! RtsFlags.ProfFlags.doHeapProfile) {
396 if (doingLDVProfiling() && doingRetainerProfiling()) {
397 prog_belch("cannot mix -hb and -hr");
402 // we only count eras if we're doing LDV profiling. Otherwise era
405 if (doingLDVProfiling()) {
413 { // max_era = 2^LDV_SHIFT
416 for (p = 0; p < LDV_SHIFT; p++)
421 censuses = stgMallocBytes(sizeof(Census) * n_censuses, "initHeapProfiling");
423 initEra( &censuses[era] );
425 /* initProfilingLogFile(); */
426 fprintf(hp_file, "JOB \"%s", prog_name);
431 for(count = 1; count < prog_argc; count++)
432 fprintf(hp_file, " %s", prog_argv[count]);
433 fprintf(hp_file, " +RTS ");
434 for(count = 0; count < rts_argc; count++)
435 fprintf(hp_file, "%s ", rts_argv[count]);
436 fprintf(hp_file, "\n");
438 #endif /* PROFILING */
440 fprintf(hp_file, "\"\n" );
442 fprintf(hp_file, "DATE \"%s\"\n", time_str());
444 fprintf(hp_file, "SAMPLE_UNIT \"seconds\"\n");
445 fprintf(hp_file, "VALUE_UNIT \"bytes\"\n");
447 fprintf(hp_file, "BEGIN_SAMPLE 0.00\n");
448 fprintf(hp_file, "END_SAMPLE 0.00\n");
450 #ifdef DEBUG_HEAP_PROF
451 DEBUG_LoadSymbols(prog_name);
455 if (doingRetainerProfiling()) {
456 initRetainerProfiling();
464 endHeapProfiling(void)
468 if (! RtsFlags.ProfFlags.doHeapProfile) {
473 if (doingRetainerProfiling()) {
474 endRetainerProfiling();
479 if (doingLDVProfiling()) {
482 aggregateCensusInfo();
483 for (t = 1; t < era; t++) {
484 dumpCensus( &censuses[t] );
489 seconds = mut_user_time();
490 fprintf(hp_file, "BEGIN_SAMPLE %0.2f\n", seconds);
491 fprintf(hp_file, "END_SAMPLE %0.2f\n", seconds);
499 buf_append(char *p, const char *q, char *end)
503 for (m = 0; p < end; p++, q++, m++) {
505 if (*q == '\0') { break; }
511 fprint_ccs(FILE *fp, CostCentreStack *ccs, nat max_length)
513 char buf[max_length+1], *p, *buf_end;
517 // MAIN on its own gets printed as "MAIN", otherwise we ignore MAIN.
518 if (ccs == CCS_MAIN) {
523 fprintf(fp, "(%d)", ccs->ccsID);
526 buf_end = buf + max_length + 1;
528 // keep printing components of the stack until we run out of space
529 // in the buffer. If we run out of space, end with "...".
530 for (; ccs != NULL && ccs != CCS_MAIN; ccs = ccs->prevStack) {
532 // CAF cost centres print as M.CAF, but we leave the module
533 // name out of all the others to save space.
534 if (!strcmp(ccs->cc->label,"CAF")) {
535 p += buf_append(p, ccs->cc->module, buf_end);
536 p += buf_append(p, ".CAF", buf_end);
538 if (ccs->prevStack != NULL && ccs->prevStack != CCS_MAIN) {
539 p += buf_append(p, "/", buf_end);
541 p += buf_append(p, ccs->cc->label, buf_end);
545 sprintf(buf+max_length-4, "...");
548 next_offset += written;
551 fprintf(fp, "%s", buf);
556 strMatchesSelector( char* str, char* sel )
559 // fprintf(stderr, "str_matches_selector %s %s\n", str, sel);
561 // Compare str against wherever we've got to in sel.
563 while (*p != '\0' && *sel != ',' && *sel != '\0' && *p == *sel) {
566 // Match if all of str used and have reached the end of a sel fragment.
567 if (*p == '\0' && (*sel == ',' || *sel == '\0'))
570 // No match. Advance sel to the start of the next elem.
571 while (*sel != ',' && *sel != '\0') sel++;
572 if (*sel == ',') sel++;
574 /* Run out of sel ?? */
575 if (*sel == '\0') return rtsFalse;
579 /* -----------------------------------------------------------------------------
580 * Figure out whether a closure should be counted in this census, by
581 * testing against all the specified constraints.
582 * -------------------------------------------------------------------------- */
584 closureSatisfiesConstraints( StgClosure* p )
586 #ifdef DEBUG_HEAP_PROF
591 // The CCS has a selected field to indicate whether this closure is
592 // deselected by not being mentioned in the module, CC, or CCS
594 if (!p->header.prof.ccs->selected) {
598 if (RtsFlags.ProfFlags.descrSelector) {
599 b = strMatchesSelector( (get_itbl((StgClosure *)p))->prof.closure_desc,
600 RtsFlags.ProfFlags.descrSelector );
601 if (!b) return rtsFalse;
603 if (RtsFlags.ProfFlags.typeSelector) {
604 b = strMatchesSelector( (get_itbl((StgClosure *)p))->prof.closure_type,
605 RtsFlags.ProfFlags.typeSelector );
606 if (!b) return rtsFalse;
608 if (RtsFlags.ProfFlags.retainerSelector) {
611 // We must check that the retainer set is valid here. One
612 // reason it might not be valid is if this closure is a
613 // a newly deceased weak pointer (i.e. a DEAD_WEAK), since
614 // these aren't reached by the retainer profiler's traversal.
615 if (isRetainerSetFieldValid((StgClosure *)p)) {
616 rs = retainerSetOf((StgClosure *)p);
618 for (i = 0; i < rs->num; i++) {
619 b = strMatchesSelector( rs->element[i]->cc->label,
620 RtsFlags.ProfFlags.retainerSelector );
621 if (b) return rtsTrue;
628 #endif /* PROFILING */
631 /* -----------------------------------------------------------------------------
632 * Aggregate the heap census info for biographical profiling
633 * -------------------------------------------------------------------------- */
636 aggregateCensusInfo( void )
640 counter *c, *d, *ctrs;
643 if (!doingLDVProfiling()) return;
645 // Aggregate the LDV counters when displaying by biography.
646 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
647 int void_total, drag_total;
649 // Now we compute void_total and drag_total for each census
652 for (t = 1; t < era; t++) { // note: start at 1, not 0
653 void_total += censuses[t].void_total;
654 drag_total += censuses[t].drag_total;
655 censuses[t].void_total = void_total;
656 censuses[t].drag_total = drag_total;
657 ASSERT( censuses[t].void_total <= censuses[t].not_used );
658 ASSERT( censuses[t].drag_total <= censuses[t].used );
664 // otherwise... we're doing a heap profile that is restricted to
665 // some combination of lag, drag, void or use. We've kept all the
666 // census info for all censuses so far, but we still need to
667 // aggregate the counters forwards.
670 acc = allocHashTable();
673 for (t = 1; t < era; t++) {
675 // first look through all the counters we're aggregating
676 for (c = ctrs; c != NULL; c = c->next) {
677 // if one of the totals is non-zero, then this closure
678 // type must be present in the heap at this census time...
679 d = lookupHashTable(censuses[t].hash, (StgWord)c->identity);
682 // if this closure identity isn't present in the
683 // census for this time period, then our running
684 // totals *must* be zero.
685 ASSERT(c->c.ldv.void_total == 0 && c->c.ldv.drag_total == 0);
687 // fprintCCS(stderr,c->identity);
688 // fprintf(stderr," census=%d void_total=%d drag_total=%d\n",
689 // t, c->c.ldv.void_total, c->c.ldv.drag_total);
691 d->c.ldv.void_total += c->c.ldv.void_total;
692 d->c.ldv.drag_total += c->c.ldv.drag_total;
693 c->c.ldv.void_total = d->c.ldv.void_total;
694 c->c.ldv.drag_total = d->c.ldv.drag_total;
696 ASSERT( c->c.ldv.void_total >= 0 );
697 ASSERT( c->c.ldv.drag_total >= 0 );
701 // now look through the counters in this census to find new ones
702 for (c = censuses[t].ctrs; c != NULL; c = c->next) {
703 d = lookupHashTable(acc, (StgWord)c->identity);
705 d = arenaAlloc( arena, sizeof(counter) );
707 insertHashTable( acc, (StgWord)c->identity, d );
708 d->identity = c->identity;
711 d->c.ldv.void_total = c->c.ldv.void_total;
712 d->c.ldv.drag_total = c->c.ldv.drag_total;
714 ASSERT( c->c.ldv.void_total >= 0 );
715 ASSERT( c->c.ldv.drag_total >= 0 );
719 freeHashTable(acc, NULL);
724 /* -----------------------------------------------------------------------------
725 * Print out the results of a heap census.
726 * -------------------------------------------------------------------------- */
728 dumpCensus( Census *census )
733 fprintf(hp_file, "BEGIN_SAMPLE %0.2f\n", census->time);
736 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
737 fprintf(hp_file, "VOID\t%u\n", census->void_total * sizeof(W_));
738 fprintf(hp_file, "LAG\t%u\n",
739 (census->not_used - census->void_total) * sizeof(W_));
740 fprintf(hp_file, "USE\t%u\n",
741 (census->used - census->drag_total) * sizeof(W_));
742 fprintf(hp_file, "INHERENT_USE\t%u\n",
743 census->prim * sizeof(W_));
744 fprintf(hp_file, "DRAG\t%u\n", census->drag_total *
746 fprintf(hp_file, "END_SAMPLE %0.2f\n", census->time);
751 for (ctr = census->ctrs; ctr != NULL; ctr = ctr->next) {
754 if (RtsFlags.ProfFlags.bioSelector != NULL) {
756 if (strMatchesSelector("lag", RtsFlags.ProfFlags.bioSelector))
757 count += ctr->c.ldv.not_used - ctr->c.ldv.void_total;
758 if (strMatchesSelector("drag", RtsFlags.ProfFlags.bioSelector))
759 count += ctr->c.ldv.drag_total;
760 if (strMatchesSelector("void", RtsFlags.ProfFlags.bioSelector))
761 count += ctr->c.ldv.void_total;
762 if (strMatchesSelector("use", RtsFlags.ProfFlags.bioSelector))
763 count += ctr->c.ldv.used - ctr->c.ldv.drag_total;
767 count = ctr->c.resid;
770 ASSERT( count >= 0 );
772 if (count == 0) continue;
774 #ifdef DEBUG_HEAP_PROF
775 switch (RtsFlags.ProfFlags.doHeapProfile) {
776 case HEAP_BY_INFOPTR:
777 fprintf(hp_file, "%s", lookupGHCName(ctr->identity));
779 case HEAP_BY_CLOSURE_TYPE:
780 fprintf(hp_file, "%s", (char *)ctr->identity);
786 switch (RtsFlags.ProfFlags.doHeapProfile) {
788 fprint_ccs(hp_file, (CostCentreStack *)ctr->identity, 25);
793 fprintf(hp_file, "%s", (char *)ctr->identity);
795 case HEAP_BY_RETAINER:
797 RetainerSet *rs = (RetainerSet *)ctr->identity;
799 // it might be the distinguished retainer set rs_MANY:
800 if (rs == &rs_MANY) {
801 fprintf(hp_file, "MANY");
805 // Mark this retainer set by negating its id, because it
806 // has appeared in at least one census. We print the
807 // values of all such retainer sets into the log file at
808 // the end. A retainer set may exist but not feature in
809 // any censuses if it arose as the intermediate retainer
810 // set for some closure during retainer set calculation.
814 // report in the unit of bytes: * sizeof(StgWord)
815 printRetainerSetShort(hp_file, rs);
819 barf("dumpCensus; doHeapProfile");
823 fprintf(hp_file, "\t%d\n", count * sizeof(W_));
826 fprintf(hp_file, "END_SAMPLE %0.2f\n", census->time);
829 /* -----------------------------------------------------------------------------
830 * Code to perform a heap census.
831 * -------------------------------------------------------------------------- */
833 heapCensusChain( Census *census, bdescr *bd )
843 for (; bd != NULL; bd = bd->link) {
845 // HACK: ignore pinned blocks, because they contain gaps.
846 // It's not clear exactly what we'd like to do here, since we
847 // can't tell which objects in the block are actually alive.
848 // Perhaps the whole block should be counted as SYSTEM memory.
849 if (bd->flags & BF_PINNED) {
854 while (p < bd->free) {
855 info = get_itbl((StgClosure *)p);
858 switch (info->type) {
865 case IND_OLDGEN_PERM:
867 case SE_CAF_BLACKHOLE:
872 case CONSTR_CHARLIKE:
886 size = sizeW_fromITBL(info);
891 size = bco_sizeW((StgBCO *)p);
901 size = sizeW_fromITBL(info);
904 case THUNK_1_0: /* ToDo - shouldn't be here */
905 case THUNK_0_1: /* " ditto " */
907 size = sizeofW(StgHeader) + MIN_UPD_SIZE;
912 size = pap_sizeW((StgPAP *)p);
916 size = ap_stack_sizeW((StgAP_STACK *)p);
921 size = arr_words_sizeW(stgCast(StgArrWords*,p));
925 case MUT_ARR_PTRS_FROZEN:
927 size = mut_arr_ptrs_sizeW((StgMutArrPtrs *)p);
932 #ifdef DEBUG_HEAP_PROF
933 size = tso_sizeW((StgTSO *)p);
936 if (RtsFlags.ProfFlags.includeTSOs) {
937 size = tso_sizeW((StgTSO *)p);
940 // Skip this TSO and move on to the next object
941 p += tso_sizeW((StgTSO *)p);
952 #ifdef DEBUG_HEAP_PROF
955 // subtract the profiling overhead
956 real_size = size - sizeofW(StgProfHeader);
959 if (closureSatisfiesConstraints((StgClosure*)p)) {
961 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
963 census->prim += real_size;
964 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
965 census->not_used += real_size;
967 census->used += real_size;
971 identity = closureIdentity((StgClosure *)p);
973 if (identity != NULL) {
974 ctr = lookupHashTable( census->hash, (StgWord)identity );
977 if (RtsFlags.ProfFlags.bioSelector != NULL) {
979 ctr->c.ldv.prim += real_size;
980 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
981 ctr->c.ldv.not_used += real_size;
983 ctr->c.ldv.used += real_size;
987 ctr->c.resid += real_size;
990 ctr = arenaAlloc( census->arena, sizeof(counter) );
992 insertHashTable( census->hash, (StgWord)identity, ctr );
993 ctr->identity = identity;
994 ctr->next = census->ctrs;
998 if (RtsFlags.ProfFlags.bioSelector != NULL) {
1000 ctr->c.ldv.prim = real_size;
1001 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
1002 ctr->c.ldv.not_used = real_size;
1004 ctr->c.ldv.used = real_size;
1008 ctr->c.resid = real_size;
1026 census = &censuses[era];
1027 census->time = mut_user_time();
1029 // calculate retainer sets if necessary
1031 if (doingRetainerProfiling()) {
1037 stat_startHeapCensus();
1040 // Traverse the heap, collecting the census info
1042 // First the small_alloc_list: we have to fix the free pointer at
1043 // the end by calling tidyAllocatedLists() first.
1044 tidyAllocateLists();
1045 heapCensusChain( census, small_alloc_list );
1047 // Now traverse the heap in each generation/step.
1048 if (RtsFlags.GcFlags.generations == 1) {
1049 heapCensusChain( census, g0s0->to_blocks );
1051 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
1052 for (s = 0; s < generations[g].n_steps; s++) {
1053 heapCensusChain( census, generations[g].steps[s].blocks );
1054 // Are we interested in large objects? might be
1055 // confusing to include the stack in a heap profile.
1056 heapCensusChain( census, generations[g].steps[s].large_objects );
1061 // dump out the census info
1063 // We can't generate any info for LDV profiling until
1064 // the end of the run...
1065 if (!doingLDVProfiling())
1066 dumpCensus( census );
1068 dumpCensus( census );
1072 // free our storage, unless we're keeping all the census info for
1073 // future restriction by biography.
1075 if (RtsFlags.ProfFlags.bioSelector == NULL)
1078 freeHashTable( census->hash, NULL/* don't free the elements */ );
1079 arenaFree( census->arena );
1080 census->hash = NULL;
1081 census->arena = NULL;
1084 // we're into the next time period now
1088 stat_endHeapCensus();
1092 #endif /* PROFILING || DEBUG_HEAP_PROF */