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 ------------------------------------------------------------------------- */
102 static char *type_names[] = {
111 "CONSTR_NOCAF_STATIC",
150 "MUT_ARR_PTRS_CLEAN",
151 "MUT_ARR_PTRS_DIRTY",
152 "MUT_ARR_PTRS_FROZEN0",
153 "MUT_ARR_PTRS_FROZEN",
166 "INVARIANT_CHECK_QUEUE",
177 /* ----------------------------------------------------------------------------
178 * Find the "closure identity", which is a unique pointer reresenting
179 * the band to which this closure's heap space is attributed in the
181 * ------------------------------------------------------------------------- */
183 closureIdentity( StgClosure *p )
185 switch (RtsFlags.ProfFlags.doHeapProfile) {
189 return p->header.prof.ccs;
191 return p->header.prof.ccs->cc->module;
193 return get_itbl(p)->prof.closure_desc;
195 return get_itbl(p)->prof.closure_type;
196 case HEAP_BY_RETAINER:
197 // AFAIK, the only closures in the heap which might not have a
198 // valid retainer set are DEAD_WEAK closures.
199 if (isRetainerSetFieldValid(p))
200 return retainerSetOf(p);
205 case HEAP_BY_CLOSURE_TYPE:
209 switch (info->type) {
217 case CONSTR_NOCAF_STATIC:
218 printf("",strlen(GET_CON_DESC(itbl_to_con_itbl(info))));
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 arenaFree(census->arena);
345 freeHashTable(census->hash, NULL);
348 /* --------------------------------------------------------------------------
349 * Increases era by 1 and initialize census[era].
350 * Reallocates gi[] and increases its size if needed.
351 * ----------------------------------------------------------------------- */
357 if (doingLDVProfiling()) {
360 if (era == max_era) {
361 errorBelch("maximum number of censuses reached; use +RTS -i to reduce");
362 stg_exit(EXIT_FAILURE);
365 if (era == n_censuses) {
367 censuses = stgReallocBytes(censuses, sizeof(Census) * n_censuses,
371 #endif /* PROFILING */
373 initEra( &censuses[era] );
376 /* ----------------------------------------------------------------------------
377 * Heap profiling by info table
378 * ------------------------------------------------------------------------- */
380 #if !defined(PROFILNG)
382 static char *hp_filename;
384 void initProfiling1 (void)
388 void freeProfiling1 (void)
392 void initProfiling2 (void)
394 if (RtsFlags.ProfFlags.doHeapProfile) {
395 /* Initialise the log file name */
396 hp_filename = stgMallocBytes(strlen(prog_name) + 6, "hpFileName");
397 sprintf(hp_filename, "%s.hp", prog_name);
399 /* open the log file */
400 if ((hp_file = fopen(hp_filename, "w")) == NULL) {
401 debugBelch("Can't open profiling report file %s\n",
403 RtsFlags.ProfFlags.doHeapProfile = 0;
411 void endProfiling( void )
415 #endif /* !PROFILING */
418 printSample(rtsBool beginSample, StgDouble sampleValue)
420 StgDouble fractionalPart, integralPart;
421 fractionalPart = modf(sampleValue, &integralPart);
422 fprintf(hp_file, "%s %" FMT_Word64 ".%02" FMT_Word64 "\n",
423 (beginSample ? "BEGIN_SAMPLE" : "END_SAMPLE"),
424 (StgWord64)integralPart, (StgWord64)(fractionalPart * 100));
427 /* --------------------------------------------------------------------------
428 * Initialize the heap profilier
429 * ----------------------------------------------------------------------- */
431 initHeapProfiling(void)
433 if (! RtsFlags.ProfFlags.doHeapProfile) {
438 if (doingLDVProfiling() && doingRetainerProfiling()) {
439 errorBelch("cannot mix -hb and -hr");
440 stg_exit(EXIT_FAILURE);
444 // we only count eras if we're doing LDV profiling. Otherwise era
447 if (doingLDVProfiling()) {
455 { // max_era = 2^LDV_SHIFT
458 for (p = 0; p < LDV_SHIFT; p++)
463 censuses = stgMallocBytes(sizeof(Census) * n_censuses, "initHeapProfiling");
465 initEra( &censuses[era] );
467 /* initProfilingLogFile(); */
468 fprintf(hp_file, "JOB \"%s", prog_name);
473 for(count = 1; count < prog_argc; count++)
474 fprintf(hp_file, " %s", prog_argv[count]);
475 fprintf(hp_file, " +RTS");
476 for(count = 0; count < rts_argc; count++)
477 fprintf(hp_file, " %s", rts_argv[count]);
479 #endif /* PROFILING */
481 fprintf(hp_file, "\"\n" );
483 fprintf(hp_file, "DATE \"%s\"\n", time_str());
485 fprintf(hp_file, "SAMPLE_UNIT \"seconds\"\n");
486 fprintf(hp_file, "VALUE_UNIT \"bytes\"\n");
488 printSample(rtsTrue, 0);
489 printSample(rtsFalse, 0);
492 if (doingRetainerProfiling()) {
493 initRetainerProfiling();
501 endHeapProfiling(void)
505 if (! RtsFlags.ProfFlags.doHeapProfile) {
510 if (doingRetainerProfiling()) {
511 endRetainerProfiling();
516 if (doingLDVProfiling()) {
519 aggregateCensusInfo();
520 for (t = 1; t < era; t++) {
521 dumpCensus( &censuses[t] );
528 for (t = 0; t <= era; t++) {
529 freeEra( &censuses[t] );
534 seconds = mut_user_time();
535 printSample(rtsTrue, seconds);
536 printSample(rtsFalse, seconds);
544 buf_append(char *p, const char *q, char *end)
548 for (m = 0; p < end; p++, q++, m++) {
550 if (*q == '\0') { break; }
556 fprint_ccs(FILE *fp, CostCentreStack *ccs, nat max_length)
558 char buf[max_length+1], *p, *buf_end;
560 // MAIN on its own gets printed as "MAIN", otherwise we ignore MAIN.
561 if (ccs == CCS_MAIN) {
566 fprintf(fp, "(%ld)", ccs->ccsID);
569 buf_end = buf + max_length + 1;
571 // keep printing components of the stack until we run out of space
572 // in the buffer. If we run out of space, end with "...".
573 for (; ccs != NULL && ccs != CCS_MAIN; ccs = ccs->prevStack) {
575 // CAF cost centres print as M.CAF, but we leave the module
576 // name out of all the others to save space.
577 if (!strcmp(ccs->cc->label,"CAF")) {
578 p += buf_append(p, ccs->cc->module, buf_end);
579 p += buf_append(p, ".CAF", buf_end);
581 p += buf_append(p, ccs->cc->label, buf_end);
582 if (ccs->prevStack != NULL && ccs->prevStack != CCS_MAIN) {
583 p += buf_append(p, "/", buf_end);
588 sprintf(buf+max_length-4, "...");
592 fprintf(fp, "%s", buf);
594 #endif /* PROFILING */
597 strMatchesSelector( char* str, char* sel )
600 // debugBelch("str_matches_selector %s %s\n", str, sel);
602 // Compare str against wherever we've got to in sel.
604 while (*p != '\0' && *sel != ',' && *sel != '\0' && *p == *sel) {
607 // Match if all of str used and have reached the end of a sel fragment.
608 if (*p == '\0' && (*sel == ',' || *sel == '\0'))
611 // No match. Advance sel to the start of the next elem.
612 while (*sel != ',' && *sel != '\0') sel++;
613 if (*sel == ',') sel++;
615 /* Run out of sel ?? */
616 if (*sel == '\0') return rtsFalse;
620 /* -----------------------------------------------------------------------------
621 * Figure out whether a closure should be counted in this census, by
622 * testing against all the specified constraints.
623 * -------------------------------------------------------------------------- */
625 closureSatisfiesConstraints( StgClosure* p )
627 #if !defined(PROFILING)
628 (void)p; /* keep gcc -Wall happy */
633 // The CCS has a selected field to indicate whether this closure is
634 // deselected by not being mentioned in the module, CC, or CCS
636 if (!p->header.prof.ccs->selected) {
640 if (RtsFlags.ProfFlags.descrSelector) {
641 b = strMatchesSelector( (get_itbl((StgClosure *)p))->prof.closure_desc,
642 RtsFlags.ProfFlags.descrSelector );
643 if (!b) return rtsFalse;
645 if (RtsFlags.ProfFlags.typeSelector) {
646 b = strMatchesSelector( (get_itbl((StgClosure *)p))->prof.closure_type,
647 RtsFlags.ProfFlags.typeSelector );
648 if (!b) return rtsFalse;
650 if (RtsFlags.ProfFlags.retainerSelector) {
653 // We must check that the retainer set is valid here. One
654 // reason it might not be valid is if this closure is a
655 // a newly deceased weak pointer (i.e. a DEAD_WEAK), since
656 // these aren't reached by the retainer profiler's traversal.
657 if (isRetainerSetFieldValid((StgClosure *)p)) {
658 rs = retainerSetOf((StgClosure *)p);
660 for (i = 0; i < rs->num; i++) {
661 b = strMatchesSelector( rs->element[i]->cc->label,
662 RtsFlags.ProfFlags.retainerSelector );
663 if (b) return rtsTrue;
670 #endif /* PROFILING */
673 /* -----------------------------------------------------------------------------
674 * Aggregate the heap census info for biographical profiling
675 * -------------------------------------------------------------------------- */
678 aggregateCensusInfo( void )
682 counter *c, *d, *ctrs;
685 if (!doingLDVProfiling()) return;
687 // Aggregate the LDV counters when displaying by biography.
688 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
689 int void_total, drag_total;
691 // Now we compute void_total and drag_total for each census
692 // After the program has finished, the void_total field of
693 // each census contains the count of words that were *created*
694 // in this era and were eventually void. Conversely, if a
695 // void closure was destroyed in this era, it will be
696 // represented by a negative count of words in void_total.
698 // To get the count of live words that are void at each
699 // census, just propagate the void_total count forwards:
703 for (t = 1; t < era; t++) { // note: start at 1, not 0
704 void_total += censuses[t].void_total;
705 drag_total += censuses[t].drag_total;
706 censuses[t].void_total = void_total;
707 censuses[t].drag_total = drag_total;
709 ASSERT( censuses[t].void_total <= censuses[t].not_used );
710 // should be true because: void_total is the count of
711 // live words that are void at this census, which *must*
712 // be less than the number of live words that have not
715 ASSERT( censuses[t].drag_total <= censuses[t].used );
716 // similar reasoning as above.
722 // otherwise... we're doing a heap profile that is restricted to
723 // some combination of lag, drag, void or use. We've kept all the
724 // census info for all censuses so far, but we still need to
725 // aggregate the counters forwards.
728 acc = allocHashTable();
731 for (t = 1; t < era; t++) {
733 // first look through all the counters we're aggregating
734 for (c = ctrs; c != NULL; c = c->next) {
735 // if one of the totals is non-zero, then this closure
736 // type must be present in the heap at this census time...
737 d = lookupHashTable(censuses[t].hash, (StgWord)c->identity);
740 // if this closure identity isn't present in the
741 // census for this time period, then our running
742 // totals *must* be zero.
743 ASSERT(c->c.ldv.void_total == 0 && c->c.ldv.drag_total == 0);
745 // debugCCS(c->identity);
746 // debugBelch(" census=%d void_total=%d drag_total=%d\n",
747 // t, c->c.ldv.void_total, c->c.ldv.drag_total);
749 d->c.ldv.void_total += c->c.ldv.void_total;
750 d->c.ldv.drag_total += c->c.ldv.drag_total;
751 c->c.ldv.void_total = d->c.ldv.void_total;
752 c->c.ldv.drag_total = d->c.ldv.drag_total;
754 ASSERT( c->c.ldv.void_total >= 0 );
755 ASSERT( c->c.ldv.drag_total >= 0 );
759 // now look through the counters in this census to find new ones
760 for (c = censuses[t].ctrs; c != NULL; c = c->next) {
761 d = lookupHashTable(acc, (StgWord)c->identity);
763 d = arenaAlloc( arena, sizeof(counter) );
765 insertHashTable( acc, (StgWord)c->identity, d );
766 d->identity = c->identity;
769 d->c.ldv.void_total = c->c.ldv.void_total;
770 d->c.ldv.drag_total = c->c.ldv.drag_total;
772 ASSERT( c->c.ldv.void_total >= 0 );
773 ASSERT( c->c.ldv.drag_total >= 0 );
777 freeHashTable(acc, NULL);
782 /* -----------------------------------------------------------------------------
783 * Print out the results of a heap census.
784 * -------------------------------------------------------------------------- */
786 dumpCensus( Census *census )
791 printSample(rtsTrue, census->time);
794 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
795 fprintf(hp_file, "VOID\t%lu\n", (unsigned long)(census->void_total) * sizeof(W_));
796 fprintf(hp_file, "LAG\t%lu\n",
797 (unsigned long)(census->not_used - census->void_total) * sizeof(W_));
798 fprintf(hp_file, "USE\t%lu\n",
799 (unsigned long)(census->used - census->drag_total) * sizeof(W_));
800 fprintf(hp_file, "INHERENT_USE\t%lu\n",
801 (unsigned long)(census->prim) * sizeof(W_));
802 fprintf(hp_file, "DRAG\t%lu\n",
803 (unsigned long)(census->drag_total) * sizeof(W_));
804 printSample(rtsFalse, census->time);
809 for (ctr = census->ctrs; ctr != NULL; ctr = ctr->next) {
812 if (RtsFlags.ProfFlags.bioSelector != NULL) {
814 if (strMatchesSelector("lag", RtsFlags.ProfFlags.bioSelector))
815 count += ctr->c.ldv.not_used - ctr->c.ldv.void_total;
816 if (strMatchesSelector("drag", RtsFlags.ProfFlags.bioSelector))
817 count += ctr->c.ldv.drag_total;
818 if (strMatchesSelector("void", RtsFlags.ProfFlags.bioSelector))
819 count += ctr->c.ldv.void_total;
820 if (strMatchesSelector("use", RtsFlags.ProfFlags.bioSelector))
821 count += ctr->c.ldv.used - ctr->c.ldv.drag_total;
825 count = ctr->c.resid;
828 ASSERT( count >= 0 );
830 if (count == 0) continue;
832 #if !defined(PROFILING)
833 switch (RtsFlags.ProfFlags.doHeapProfile) {
834 case HEAP_BY_CLOSURE_TYPE:
835 fprintf(hp_file, "%s", (char *)ctr->identity);
841 switch (RtsFlags.ProfFlags.doHeapProfile) {
843 fprint_ccs(hp_file, (CostCentreStack *)ctr->identity, RtsFlags.ProfFlags.ccsLength);
848 fprintf(hp_file, "%s", (char *)ctr->identity);
850 case HEAP_BY_RETAINER:
852 RetainerSet *rs = (RetainerSet *)ctr->identity;
854 // it might be the distinguished retainer set rs_MANY:
855 if (rs == &rs_MANY) {
856 fprintf(hp_file, "MANY");
860 // Mark this retainer set by negating its id, because it
861 // has appeared in at least one census. We print the
862 // values of all such retainer sets into the log file at
863 // the end. A retainer set may exist but not feature in
864 // any censuses if it arose as the intermediate retainer
865 // set for some closure during retainer set calculation.
869 // report in the unit of bytes: * sizeof(StgWord)
870 printRetainerSetShort(hp_file, rs);
874 barf("dumpCensus; doHeapProfile");
878 fprintf(hp_file, "\t%lu\n", (unsigned long)count * sizeof(W_));
881 printSample(rtsFalse, census->time);
884 /* -----------------------------------------------------------------------------
885 * Code to perform a heap census.
886 * -------------------------------------------------------------------------- */
888 heapCensusChain( Census *census, bdescr *bd )
898 for (; bd != NULL; bd = bd->link) {
900 // HACK: ignore pinned blocks, because they contain gaps.
901 // It's not clear exactly what we'd like to do here, since we
902 // can't tell which objects in the block are actually alive.
903 // Perhaps the whole block should be counted as SYSTEM memory.
904 if (bd->flags & BF_PINNED) {
909 while (p < bd->free) {
910 info = get_itbl((StgClosure *)p);
913 switch (info->type) {
916 size = thunk_sizeW_fromITBL(info);
922 size = sizeofW(StgThunkHeader) + 2;
928 size = sizeofW(StgThunkHeader) + 1;
935 case IND_OLDGEN_PERM:
937 case SE_CAF_BLACKHOLE:
950 size = sizeW_fromITBL(info);
954 // Special case/Delicate Hack: INDs don't normally
955 // appear, since we're doing this heap census right
956 // after GC. However, GarbageCollect() also does
957 // resurrectThreads(), which can update some
958 // blackholes when it calls raiseAsync() on the
959 // resurrected threads. So we know that any IND will
960 // be the size of a BLACKHOLE.
961 size = BLACKHOLE_sizeW();
966 size = bco_sizeW((StgBCO *)p);
975 size = sizeW_fromITBL(info);
979 size = ap_sizeW((StgAP *)p);
983 size = pap_sizeW((StgPAP *)p);
987 size = ap_stack_sizeW((StgAP_STACK *)p);
992 size = arr_words_sizeW(stgCast(StgArrWords*,p));
995 case MUT_ARR_PTRS_CLEAN:
996 case MUT_ARR_PTRS_DIRTY:
997 case MUT_ARR_PTRS_FROZEN:
998 case MUT_ARR_PTRS_FROZEN0:
1000 size = mut_arr_ptrs_sizeW((StgMutArrPtrs *)p);
1006 if (RtsFlags.ProfFlags.includeTSOs) {
1007 size = tso_sizeW((StgTSO *)p);
1010 // Skip this TSO and move on to the next object
1011 p += tso_sizeW((StgTSO *)p);
1015 size = tso_sizeW((StgTSO *)p);
1021 size = sizeofW(StgTRecHeader);
1024 case TVAR_WATCH_QUEUE:
1026 size = sizeofW(StgTVarWatchQueue);
1029 case INVARIANT_CHECK_QUEUE:
1031 size = sizeofW(StgInvariantCheckQueue);
1034 case ATOMIC_INVARIANT:
1036 size = sizeofW(StgAtomicInvariant);
1041 size = sizeofW(StgTVar);
1046 size = sizeofW(StgTRecChunk);
1050 barf("heapCensus, unknown object: %d", info->type);
1056 // subtract the profiling overhead
1057 real_size = size - sizeofW(StgProfHeader);
1062 if (closureSatisfiesConstraints((StgClosure*)p)) {
1064 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
1066 census->prim += real_size;
1067 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
1068 census->not_used += real_size;
1070 census->used += real_size;
1074 identity = closureIdentity((StgClosure *)p);
1076 if (identity != NULL) {
1077 ctr = lookupHashTable( census->hash, (StgWord)identity );
1080 if (RtsFlags.ProfFlags.bioSelector != NULL) {
1082 ctr->c.ldv.prim += real_size;
1083 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
1084 ctr->c.ldv.not_used += real_size;
1086 ctr->c.ldv.used += real_size;
1090 ctr->c.resid += real_size;
1093 ctr = arenaAlloc( census->arena, sizeof(counter) );
1095 insertHashTable( census->hash, (StgWord)identity, ctr );
1096 ctr->identity = identity;
1097 ctr->next = census->ctrs;
1101 if (RtsFlags.ProfFlags.bioSelector != NULL) {
1103 ctr->c.ldv.prim = real_size;
1104 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
1105 ctr->c.ldv.not_used = real_size;
1107 ctr->c.ldv.used = real_size;
1111 ctr->c.resid = real_size;
1129 census = &censuses[era];
1130 census->time = mut_user_time();
1132 // calculate retainer sets if necessary
1134 if (doingRetainerProfiling()) {
1140 stat_startHeapCensus();
1143 // Traverse the heap, collecting the census info
1145 // First the small_alloc_list: we have to fix the free pointer at
1146 // the end by calling tidyAllocatedLists() first.
1147 tidyAllocateLists();
1148 heapCensusChain( census, small_alloc_list );
1150 // Now traverse the heap in each generation/step.
1151 if (RtsFlags.GcFlags.generations == 1) {
1152 heapCensusChain( census, g0s0->blocks );
1154 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
1155 for (s = 0; s < generations[g].n_steps; s++) {
1156 heapCensusChain( census, generations[g].steps[s].blocks );
1157 // Are we interested in large objects? might be
1158 // confusing to include the stack in a heap profile.
1159 heapCensusChain( census, generations[g].steps[s].large_objects );
1164 // dump out the census info
1166 // We can't generate any info for LDV profiling until
1167 // the end of the run...
1168 if (!doingLDVProfiling())
1169 dumpCensus( census );
1171 dumpCensus( census );
1175 // free our storage, unless we're keeping all the census info for
1176 // future restriction by biography.
1178 if (RtsFlags.ProfFlags.bioSelector == NULL)
1180 freeHashTable( census->hash, NULL/* don't free the elements */ );
1181 arenaFree( census->arena );
1182 census->hash = NULL;
1183 census->arena = NULL;
1187 // we're into the next time period now
1191 stat_endHeapCensus();