1 /* ----------------------------------------------------------------------------
3 * (c) The GHC Team, 1998-2003
5 * Support for heap profiling
7 * --------------------------------------------------------------------------*/
9 #include "PosixSource.h"
13 #include "Profiling.h"
17 #include "RetainerProfile.h"
18 #include "LdvProfile.h"
26 /* -----------------------------------------------------------------------------
27 * era stores the current time period. It is the same as the
28 * number of censuses that have been performed.
31 * era must be no longer than LDV_SHIFT (15 or 30) bits.
33 * era is initialized to 1 in initHeapProfiling().
35 * max_era is initialized to 2^LDV_SHIFT in initHeapProfiling().
36 * When era reaches max_era, the profiling stops because a closure can
37 * store only up to (max_era - 1) as its creation or last use time.
38 * -------------------------------------------------------------------------- */
42 /* -----------------------------------------------------------------------------
45 * For most heap profiles each closure identity gets a simple count
46 * of live words in the heap at each census. However, if we're
47 * selecting by biography, then we have to keep the various
48 * lag/drag/void counters for each identity.
49 * -------------------------------------------------------------------------- */
50 typedef struct _counter {
55 int prim; // total size of 'inherently used' closures
56 int not_used; // total size of 'never used' closures
57 int used; // total size of 'used at least once' closures
58 int void_total; // current total size of 'destroyed without being used' closures
59 int drag_total; // current total size of 'used at least once and waiting to die'
62 struct _counter *next;
66 initLDVCtr( counter *ctr )
69 ctr->c.ldv.not_used = 0;
71 ctr->c.ldv.void_total = 0;
72 ctr->c.ldv.drag_total = 0;
76 double time; // the time in MUT time when the census is made
81 // for LDV profiling, when just displaying by LDV
89 static Census *censuses = NULL;
90 static nat n_censuses = 0;
93 static void aggregateCensusInfo( void );
96 static void dumpCensus( Census *census );
98 /* ----------------------------------------------------------------------------
99 Closure Type Profiling;
100 ------------------------------------------------------------------------- */
103 static char *type_names[] = {
112 "CONSTR_NOCAF_STATIC",
150 "MUT_ARR_PTRS_CLEAN",
151 "MUT_ARR_PTRS_DIRTY",
152 "MUT_ARR_PTRS_FROZEN0",
153 "MUT_ARR_PTRS_FROZEN",
165 "INVARIANT_CHECK_QUEUE",
178 /* ----------------------------------------------------------------------------
179 * Find the "closure identity", which is a unique pointer reresenting
180 * the band to which this closure's heap space is attributed in the
182 * ------------------------------------------------------------------------- */
184 closureIdentity( StgClosure *p )
186 switch (RtsFlags.ProfFlags.doHeapProfile) {
190 return p->header.prof.ccs;
192 return p->header.prof.ccs->cc->module;
194 return GET_PROF_DESC(get_itbl(p));
196 return GET_PROF_TYPE(get_itbl(p));
197 case HEAP_BY_RETAINER:
198 // AFAIK, the only closures in the heap which might not have a
199 // valid retainer set are DEAD_WEAK closures.
200 if (isRetainerSetFieldValid(p))
201 return retainerSetOf(p);
206 case HEAP_BY_CLOSURE_TYPE:
210 switch (info->type) {
218 case CONSTR_NOCAF_STATIC:
219 return GET_CON_DESC(itbl_to_con_itbl(info));
221 return type_names[info->type];
227 barf("closureIdentity");
231 /* --------------------------------------------------------------------------
232 * Profiling type predicates
233 * ----------------------------------------------------------------------- */
235 STATIC_INLINE rtsBool
236 doingLDVProfiling( void )
238 return (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV
239 || RtsFlags.ProfFlags.bioSelector != NULL);
242 STATIC_INLINE rtsBool
243 doingRetainerProfiling( void )
245 return (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_RETAINER
246 || RtsFlags.ProfFlags.retainerSelector != NULL);
248 #endif /* PROFILING */
250 // Precesses a closure 'c' being destroyed whose size is 'size'.
251 // Make sure that LDV_recordDead() is not invoked on 'inherently used' closures
252 // such as TSO; they should not be involved in computing dragNew or voidNew.
254 // Even though era is checked in both LdvCensusForDead() and
255 // LdvCensusKillAll(), we still need to make sure that era is > 0 because
256 // LDV_recordDead() may be called from elsewhere in the runtime system. E.g.,
257 // when a thunk is replaced by an indirection object.
261 LDV_recordDead( StgClosure *c, nat size )
267 if (era > 0 && closureSatisfiesConstraints(c)) {
268 size -= sizeofW(StgProfHeader);
269 ASSERT(LDVW(c) != 0);
270 if ((LDVW((c)) & LDV_STATE_MASK) == LDV_STATE_CREATE) {
271 t = (LDVW((c)) & LDV_CREATE_MASK) >> LDV_SHIFT;
273 if (RtsFlags.ProfFlags.bioSelector == NULL) {
274 censuses[t].void_total += (int)size;
275 censuses[era].void_total -= (int)size;
276 ASSERT(censuses[t].void_total < censuses[t].not_used);
278 id = closureIdentity(c);
279 ctr = lookupHashTable(censuses[t].hash, (StgWord)id);
280 ASSERT( ctr != NULL );
281 ctr->c.ldv.void_total += (int)size;
282 ctr = lookupHashTable(censuses[era].hash, (StgWord)id);
284 ctr = arenaAlloc(censuses[era].arena, sizeof(counter));
286 insertHashTable(censuses[era].hash, (StgWord)id, ctr);
288 ctr->next = censuses[era].ctrs;
289 censuses[era].ctrs = ctr;
291 ctr->c.ldv.void_total -= (int)size;
295 t = LDVW((c)) & LDV_LAST_MASK;
297 if (RtsFlags.ProfFlags.bioSelector == NULL) {
298 censuses[t+1].drag_total += size;
299 censuses[era].drag_total -= size;
302 id = closureIdentity(c);
303 ctr = lookupHashTable(censuses[t+1].hash, (StgWord)id);
304 ASSERT( ctr != NULL );
305 ctr->c.ldv.drag_total += (int)size;
306 ctr = lookupHashTable(censuses[era].hash, (StgWord)id);
308 ctr = arenaAlloc(censuses[era].arena, sizeof(counter));
310 insertHashTable(censuses[era].hash, (StgWord)id, ctr);
312 ctr->next = censuses[era].ctrs;
313 censuses[era].ctrs = ctr;
315 ctr->c.ldv.drag_total -= (int)size;
323 /* --------------------------------------------------------------------------
324 * Initialize censuses[era];
325 * ----------------------------------------------------------------------- */
328 initEra(Census *census)
330 census->hash = allocHashTable();
332 census->arena = newArena();
334 census->not_used = 0;
337 census->void_total = 0;
338 census->drag_total = 0;
342 freeEra(Census *census)
344 if (RtsFlags.ProfFlags.bioSelector != NULL)
345 // when bioSelector==NULL, these are freed in heapCensus()
347 arenaFree(census->arena);
348 freeHashTable(census->hash, NULL);
352 /* --------------------------------------------------------------------------
353 * Increases era by 1 and initialize census[era].
354 * Reallocates gi[] and increases its size if needed.
355 * ----------------------------------------------------------------------- */
361 if (doingLDVProfiling()) {
364 if (era == max_era) {
365 errorBelch("maximum number of censuses reached; use +RTS -i to reduce");
366 stg_exit(EXIT_FAILURE);
369 if (era == n_censuses) {
371 censuses = stgReallocBytes(censuses, sizeof(Census) * n_censuses,
375 #endif /* PROFILING */
377 initEra( &censuses[era] );
380 /* ----------------------------------------------------------------------------
381 * Heap profiling by info table
382 * ------------------------------------------------------------------------- */
384 #if !defined(PROFILING)
386 static char *hp_filename;
388 void initProfiling1 (void)
392 void freeProfiling1 (void)
396 void initProfiling2 (void)
400 prog = stgMallocBytes(strlen(prog_name) + 1, "initProfiling2");
401 strcpy(prog, prog_name);
402 #ifdef mingw32_HOST_OS
403 // on Windows, drop the .exe suffix if there is one
406 suff = strrchr(prog,'.');
407 if (suff != NULL && !strcmp(suff,".exe")) {
413 if (RtsFlags.ProfFlags.doHeapProfile) {
414 /* Initialise the log file name */
415 hp_filename = stgMallocBytes(strlen(prog) + 6, "hpFileName");
416 sprintf(hp_filename, "%s.hp", prog);
418 /* open the log file */
419 if ((hp_file = fopen(hp_filename, "w")) == NULL) {
420 debugBelch("Can't open profiling report file %s\n",
422 RtsFlags.ProfFlags.doHeapProfile = 0;
432 void endProfiling( void )
436 #endif /* !PROFILING */
439 printSample(rtsBool beginSample, StgDouble sampleValue)
441 StgDouble fractionalPart, integralPart;
442 fractionalPart = modf(sampleValue, &integralPart);
443 fprintf(hp_file, "%s %" FMT_Word64 ".%02" FMT_Word64 "\n",
444 (beginSample ? "BEGIN_SAMPLE" : "END_SAMPLE"),
445 (StgWord64)integralPart, (StgWord64)(fractionalPart * 100));
448 /* --------------------------------------------------------------------------
449 * Initialize the heap profilier
450 * ----------------------------------------------------------------------- */
452 initHeapProfiling(void)
454 if (! RtsFlags.ProfFlags.doHeapProfile) {
459 if (doingLDVProfiling() && doingRetainerProfiling()) {
460 errorBelch("cannot mix -hb and -hr");
461 stg_exit(EXIT_FAILURE);
465 // we only count eras if we're doing LDV profiling. Otherwise era
468 if (doingLDVProfiling()) {
476 // max_era = 2^LDV_SHIFT
477 max_era = 1 << LDV_SHIFT;
480 censuses = stgMallocBytes(sizeof(Census) * n_censuses, "initHeapProfiling");
482 initEra( &censuses[era] );
484 /* initProfilingLogFile(); */
485 fprintf(hp_file, "JOB \"%s", prog_name);
490 for(count = 1; count < prog_argc; count++)
491 fprintf(hp_file, " %s", prog_argv[count]);
492 fprintf(hp_file, " +RTS");
493 for(count = 0; count < rts_argc; count++)
494 fprintf(hp_file, " %s", rts_argv[count]);
496 #endif /* PROFILING */
498 fprintf(hp_file, "\"\n" );
500 fprintf(hp_file, "DATE \"%s\"\n", time_str());
502 fprintf(hp_file, "SAMPLE_UNIT \"seconds\"\n");
503 fprintf(hp_file, "VALUE_UNIT \"bytes\"\n");
505 printSample(rtsTrue, 0);
506 printSample(rtsFalse, 0);
509 if (doingRetainerProfiling()) {
510 initRetainerProfiling();
518 endHeapProfiling(void)
522 if (! RtsFlags.ProfFlags.doHeapProfile) {
527 if (doingRetainerProfiling()) {
528 endRetainerProfiling();
533 if (doingLDVProfiling()) {
536 aggregateCensusInfo();
537 for (t = 1; t < era; t++) {
538 dumpCensus( &censuses[t] );
544 if (doingLDVProfiling()) {
546 for (t = 1; t <= era; t++) {
547 freeEra( &censuses[t] );
550 freeEra( &censuses[0] );
553 freeEra( &censuses[0] );
558 seconds = mut_user_time();
559 printSample(rtsTrue, seconds);
560 printSample(rtsFalse, seconds);
568 buf_append(char *p, const char *q, char *end)
572 for (m = 0; p < end; p++, q++, m++) {
574 if (*q == '\0') { break; }
580 fprint_ccs(FILE *fp, CostCentreStack *ccs, nat max_length)
582 char buf[max_length+1], *p, *buf_end;
584 // MAIN on its own gets printed as "MAIN", otherwise we ignore MAIN.
585 if (ccs == CCS_MAIN) {
590 fprintf(fp, "(%ld)", ccs->ccsID);
593 buf_end = buf + max_length + 1;
595 // keep printing components of the stack until we run out of space
596 // in the buffer. If we run out of space, end with "...".
597 for (; ccs != NULL && ccs != CCS_MAIN; ccs = ccs->prevStack) {
599 // CAF cost centres print as M.CAF, but we leave the module
600 // name out of all the others to save space.
601 if (!strcmp(ccs->cc->label,"CAF")) {
602 p += buf_append(p, ccs->cc->module, buf_end);
603 p += buf_append(p, ".CAF", buf_end);
605 p += buf_append(p, ccs->cc->label, buf_end);
606 if (ccs->prevStack != NULL && ccs->prevStack != CCS_MAIN) {
607 p += buf_append(p, "/", buf_end);
612 sprintf(buf+max_length-4, "...");
616 fprintf(fp, "%s", buf);
618 #endif /* PROFILING */
621 strMatchesSelector( char* str, char* sel )
624 // debugBelch("str_matches_selector %s %s\n", str, sel);
626 // Compare str against wherever we've got to in sel.
628 while (*p != '\0' && *sel != ',' && *sel != '\0' && *p == *sel) {
631 // Match if all of str used and have reached the end of a sel fragment.
632 if (*p == '\0' && (*sel == ',' || *sel == '\0'))
635 // No match. Advance sel to the start of the next elem.
636 while (*sel != ',' && *sel != '\0') sel++;
637 if (*sel == ',') sel++;
639 /* Run out of sel ?? */
640 if (*sel == '\0') return rtsFalse;
644 /* -----------------------------------------------------------------------------
645 * Figure out whether a closure should be counted in this census, by
646 * testing against all the specified constraints.
647 * -------------------------------------------------------------------------- */
649 closureSatisfiesConstraints( StgClosure* p )
651 #if !defined(PROFILING)
652 (void)p; /* keep gcc -Wall happy */
657 // The CCS has a selected field to indicate whether this closure is
658 // deselected by not being mentioned in the module, CC, or CCS
660 if (!p->header.prof.ccs->selected) {
664 if (RtsFlags.ProfFlags.descrSelector) {
665 b = strMatchesSelector( (GET_PROF_DESC(get_itbl((StgClosure *)p))),
666 RtsFlags.ProfFlags.descrSelector );
667 if (!b) return rtsFalse;
669 if (RtsFlags.ProfFlags.typeSelector) {
670 b = strMatchesSelector( (GET_PROF_TYPE(get_itbl((StgClosure *)p))),
671 RtsFlags.ProfFlags.typeSelector );
672 if (!b) return rtsFalse;
674 if (RtsFlags.ProfFlags.retainerSelector) {
677 // We must check that the retainer set is valid here. One
678 // reason it might not be valid is if this closure is a
679 // a newly deceased weak pointer (i.e. a DEAD_WEAK), since
680 // these aren't reached by the retainer profiler's traversal.
681 if (isRetainerSetFieldValid((StgClosure *)p)) {
682 rs = retainerSetOf((StgClosure *)p);
684 for (i = 0; i < rs->num; i++) {
685 b = strMatchesSelector( rs->element[i]->cc->label,
686 RtsFlags.ProfFlags.retainerSelector );
687 if (b) return rtsTrue;
694 #endif /* PROFILING */
697 /* -----------------------------------------------------------------------------
698 * Aggregate the heap census info for biographical profiling
699 * -------------------------------------------------------------------------- */
702 aggregateCensusInfo( void )
706 counter *c, *d, *ctrs;
709 if (!doingLDVProfiling()) return;
711 // Aggregate the LDV counters when displaying by biography.
712 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
713 int void_total, drag_total;
715 // Now we compute void_total and drag_total for each census
716 // After the program has finished, the void_total field of
717 // each census contains the count of words that were *created*
718 // in this era and were eventually void. Conversely, if a
719 // void closure was destroyed in this era, it will be
720 // represented by a negative count of words in void_total.
722 // To get the count of live words that are void at each
723 // census, just propagate the void_total count forwards:
727 for (t = 1; t < era; t++) { // note: start at 1, not 0
728 void_total += censuses[t].void_total;
729 drag_total += censuses[t].drag_total;
730 censuses[t].void_total = void_total;
731 censuses[t].drag_total = drag_total;
733 ASSERT( censuses[t].void_total <= censuses[t].not_used );
734 // should be true because: void_total is the count of
735 // live words that are void at this census, which *must*
736 // be less than the number of live words that have not
739 ASSERT( censuses[t].drag_total <= censuses[t].used );
740 // similar reasoning as above.
746 // otherwise... we're doing a heap profile that is restricted to
747 // some combination of lag, drag, void or use. We've kept all the
748 // census info for all censuses so far, but we still need to
749 // aggregate the counters forwards.
752 acc = allocHashTable();
755 for (t = 1; t < era; t++) {
757 // first look through all the counters we're aggregating
758 for (c = ctrs; c != NULL; c = c->next) {
759 // if one of the totals is non-zero, then this closure
760 // type must be present in the heap at this census time...
761 d = lookupHashTable(censuses[t].hash, (StgWord)c->identity);
764 // if this closure identity isn't present in the
765 // census for this time period, then our running
766 // totals *must* be zero.
767 ASSERT(c->c.ldv.void_total == 0 && c->c.ldv.drag_total == 0);
769 // debugCCS(c->identity);
770 // debugBelch(" census=%d void_total=%d drag_total=%d\n",
771 // t, c->c.ldv.void_total, c->c.ldv.drag_total);
773 d->c.ldv.void_total += c->c.ldv.void_total;
774 d->c.ldv.drag_total += c->c.ldv.drag_total;
775 c->c.ldv.void_total = d->c.ldv.void_total;
776 c->c.ldv.drag_total = d->c.ldv.drag_total;
778 ASSERT( c->c.ldv.void_total >= 0 );
779 ASSERT( c->c.ldv.drag_total >= 0 );
783 // now look through the counters in this census to find new ones
784 for (c = censuses[t].ctrs; c != NULL; c = c->next) {
785 d = lookupHashTable(acc, (StgWord)c->identity);
787 d = arenaAlloc( arena, sizeof(counter) );
789 insertHashTable( acc, (StgWord)c->identity, d );
790 d->identity = c->identity;
793 d->c.ldv.void_total = c->c.ldv.void_total;
794 d->c.ldv.drag_total = c->c.ldv.drag_total;
796 ASSERT( c->c.ldv.void_total >= 0 );
797 ASSERT( c->c.ldv.drag_total >= 0 );
801 freeHashTable(acc, NULL);
806 /* -----------------------------------------------------------------------------
807 * Print out the results of a heap census.
808 * -------------------------------------------------------------------------- */
810 dumpCensus( Census *census )
815 printSample(rtsTrue, census->time);
818 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
819 fprintf(hp_file, "VOID\t%lu\n", (unsigned long)(census->void_total) * sizeof(W_));
820 fprintf(hp_file, "LAG\t%lu\n",
821 (unsigned long)(census->not_used - census->void_total) * sizeof(W_));
822 fprintf(hp_file, "USE\t%lu\n",
823 (unsigned long)(census->used - census->drag_total) * sizeof(W_));
824 fprintf(hp_file, "INHERENT_USE\t%lu\n",
825 (unsigned long)(census->prim) * sizeof(W_));
826 fprintf(hp_file, "DRAG\t%lu\n",
827 (unsigned long)(census->drag_total) * sizeof(W_));
828 printSample(rtsFalse, census->time);
833 for (ctr = census->ctrs; ctr != NULL; ctr = ctr->next) {
836 if (RtsFlags.ProfFlags.bioSelector != NULL) {
838 if (strMatchesSelector("lag", RtsFlags.ProfFlags.bioSelector))
839 count += ctr->c.ldv.not_used - ctr->c.ldv.void_total;
840 if (strMatchesSelector("drag", RtsFlags.ProfFlags.bioSelector))
841 count += ctr->c.ldv.drag_total;
842 if (strMatchesSelector("void", RtsFlags.ProfFlags.bioSelector))
843 count += ctr->c.ldv.void_total;
844 if (strMatchesSelector("use", RtsFlags.ProfFlags.bioSelector))
845 count += ctr->c.ldv.used - ctr->c.ldv.drag_total;
849 count = ctr->c.resid;
852 ASSERT( count >= 0 );
854 if (count == 0) continue;
856 #if !defined(PROFILING)
857 switch (RtsFlags.ProfFlags.doHeapProfile) {
858 case HEAP_BY_CLOSURE_TYPE:
859 fprintf(hp_file, "%s", (char *)ctr->identity);
865 switch (RtsFlags.ProfFlags.doHeapProfile) {
867 fprint_ccs(hp_file, (CostCentreStack *)ctr->identity, RtsFlags.ProfFlags.ccsLength);
872 fprintf(hp_file, "%s", (char *)ctr->identity);
874 case HEAP_BY_RETAINER:
876 RetainerSet *rs = (RetainerSet *)ctr->identity;
878 // it might be the distinguished retainer set rs_MANY:
879 if (rs == &rs_MANY) {
880 fprintf(hp_file, "MANY");
884 // Mark this retainer set by negating its id, because it
885 // has appeared in at least one census. We print the
886 // values of all such retainer sets into the log file at
887 // the end. A retainer set may exist but not feature in
888 // any censuses if it arose as the intermediate retainer
889 // set for some closure during retainer set calculation.
893 // report in the unit of bytes: * sizeof(StgWord)
894 printRetainerSetShort(hp_file, rs);
898 barf("dumpCensus; doHeapProfile");
902 fprintf(hp_file, "\t%lu\n", (unsigned long)count * sizeof(W_));
905 printSample(rtsFalse, census->time);
908 /* -----------------------------------------------------------------------------
909 * Code to perform a heap census.
910 * -------------------------------------------------------------------------- */
912 heapCensusChain( Census *census, bdescr *bd )
922 for (; bd != NULL; bd = bd->link) {
924 // HACK: ignore pinned blocks, because they contain gaps.
925 // It's not clear exactly what we'd like to do here, since we
926 // can't tell which objects in the block are actually alive.
927 // Perhaps the whole block should be counted as SYSTEM memory.
928 if (bd->flags & BF_PINNED) {
933 while (p < bd->free) {
934 info = get_itbl((StgClosure *)p);
937 switch (info->type) {
940 size = thunk_sizeW_fromITBL(info);
946 size = sizeofW(StgThunkHeader) + 2;
952 size = sizeofW(StgThunkHeader) + 1;
959 case IND_OLDGEN_PERM:
972 size = sizeW_fromITBL(info);
976 // Special case/Delicate Hack: INDs don't normally
977 // appear, since we're doing this heap census right
978 // after GC. However, GarbageCollect() also does
979 // resurrectThreads(), which can update some
980 // blackholes when it calls raiseAsync() on the
981 // resurrected threads. So we know that any IND will
982 // be the size of a BLACKHOLE.
983 size = BLACKHOLE_sizeW();
988 size = bco_sizeW((StgBCO *)p);
998 size = sizeW_fromITBL(info);
1002 size = ap_sizeW((StgAP *)p);
1006 size = pap_sizeW((StgPAP *)p);
1010 size = ap_stack_sizeW((StgAP_STACK *)p);
1015 size = arr_words_sizeW(stgCast(StgArrWords*,p));
1018 case MUT_ARR_PTRS_CLEAN:
1019 case MUT_ARR_PTRS_DIRTY:
1020 case MUT_ARR_PTRS_FROZEN:
1021 case MUT_ARR_PTRS_FROZEN0:
1023 size = mut_arr_ptrs_sizeW((StgMutArrPtrs *)p);
1029 if (RtsFlags.ProfFlags.includeTSOs) {
1030 size = tso_sizeW((StgTSO *)p);
1033 // Skip this TSO and move on to the next object
1034 p += tso_sizeW((StgTSO *)p);
1038 size = tso_sizeW((StgTSO *)p);
1044 size = sizeofW(StgTRecHeader);
1047 case TVAR_WATCH_QUEUE:
1049 size = sizeofW(StgTVarWatchQueue);
1052 case INVARIANT_CHECK_QUEUE:
1054 size = sizeofW(StgInvariantCheckQueue);
1057 case ATOMIC_INVARIANT:
1059 size = sizeofW(StgAtomicInvariant);
1064 size = sizeofW(StgTVar);
1069 size = sizeofW(StgTRecChunk);
1073 barf("heapCensus, unknown object: %d", info->type);
1079 // subtract the profiling overhead
1080 real_size = size - sizeofW(StgProfHeader);
1085 if (closureSatisfiesConstraints((StgClosure*)p)) {
1087 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
1089 census->prim += real_size;
1090 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
1091 census->not_used += real_size;
1093 census->used += real_size;
1097 identity = closureIdentity((StgClosure *)p);
1099 if (identity != NULL) {
1100 ctr = lookupHashTable( census->hash, (StgWord)identity );
1103 if (RtsFlags.ProfFlags.bioSelector != NULL) {
1105 ctr->c.ldv.prim += real_size;
1106 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
1107 ctr->c.ldv.not_used += real_size;
1109 ctr->c.ldv.used += real_size;
1113 ctr->c.resid += real_size;
1116 ctr = arenaAlloc( census->arena, sizeof(counter) );
1118 insertHashTable( census->hash, (StgWord)identity, ctr );
1119 ctr->identity = identity;
1120 ctr->next = census->ctrs;
1124 if (RtsFlags.ProfFlags.bioSelector != NULL) {
1126 ctr->c.ldv.prim = real_size;
1127 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
1128 ctr->c.ldv.not_used = real_size;
1130 ctr->c.ldv.used = real_size;
1134 ctr->c.resid = real_size;
1152 census = &censuses[era];
1153 census->time = mut_user_time();
1155 // calculate retainer sets if necessary
1157 if (doingRetainerProfiling()) {
1163 stat_startHeapCensus();
1166 // Traverse the heap, collecting the census info
1167 if (RtsFlags.GcFlags.generations == 1) {
1168 heapCensusChain( census, g0s0->blocks );
1170 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
1171 for (s = 0; s < generations[g].n_steps; s++) {
1172 heapCensusChain( census, generations[g].steps[s].blocks );
1173 // Are we interested in large objects? might be
1174 // confusing to include the stack in a heap profile.
1175 heapCensusChain( census, generations[g].steps[s].large_objects );
1180 // dump out the census info
1182 // We can't generate any info for LDV profiling until
1183 // the end of the run...
1184 if (!doingLDVProfiling())
1185 dumpCensus( census );
1187 dumpCensus( census );
1191 // free our storage, unless we're keeping all the census info for
1192 // future restriction by biography.
1194 if (RtsFlags.ProfFlags.bioSelector == NULL)
1196 freeHashTable( census->hash, NULL/* don't free the elements */ );
1197 arenaFree( census->arena );
1198 census->hash = NULL;
1199 census->arena = NULL;
1203 // we're into the next time period now
1207 stat_endHeapCensus();