1 /* -----------------------------------------------------------------------------
2 * $Id: ProfHeap.c,v 1.35 2001/12/12 15:59:33 simonmar Exp $
4 * (c) The GHC Team, 1998-2000
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"
33 /* -----------------------------------------------------------------------------
34 * era stores the current time period. It is the same as the
35 * number of censuses that have been performed.
38 * era must be no longer than LDV_SHIFT (15 or 30) bits.
40 * era is initialized to 1 in initHeapProfiling().
42 * max_era is initialized to 2^LDV_SHIFT in initHeapProfiling().
43 * When era reaches max_era, the profiling stops because a closure can
44 * store only up to (max_era - 1) as its creation or last use time.
45 * -------------------------------------------------------------------------- */
49 /* -----------------------------------------------------------------------------
52 * For most heap profiles each closure identity gets a simple count
53 * of live words in the heap at each census. However, if we're
54 * selecting by biography, then we have to keep the various
55 * lag/drag/void counters for each identity.
56 * -------------------------------------------------------------------------- */
57 typedef struct _counter {
62 int prim; // total size of 'inherently used' closures
63 int not_used; // total size of 'never used' closures
64 int used; // total size of 'used at least once' closures
65 int void_total; // current total size of 'destroyed without being used' closures
66 int drag_total; // current total size of 'used at least once and waiting to die'
69 struct _counter *next;
73 initLDVCtr( counter *ctr )
76 ctr->c.ldv.not_used = 0;
78 ctr->c.ldv.void_total = 0;
79 ctr->c.ldv.drag_total = 0;
83 double time; // the time in MUT time when the census is made
88 // for LDV profiling, when just displaying by LDV
96 Census *censuses = NULL;
100 static void aggregateCensusInfo( void );
103 static void dumpCensus( Census *census );
105 /* -----------------------------------------------------------------------------
106 Closure Type Profiling;
108 PROBABLY TOTALLY OUT OF DATE -- ToDo (SDM)
109 -------------------------------------------------------------------------- */
111 #ifdef DEBUG_HEAP_PROF
112 static char *type_names[] = {
118 , "CONSTR_NOCAF_STATIC"
156 , "MUT_ARR_PTRS_FROZEN"
170 #endif /* DEBUG_HEAP_PROF */
172 /* -----------------------------------------------------------------------------
173 * Find the "closure identity", which is a unique pointer reresenting
174 * the band to which this closure's heap space is attributed in the
176 * ------------------------------------------------------------------------- */
178 closureIdentity( StgClosure *p )
180 switch (RtsFlags.ProfFlags.doHeapProfile) {
184 return p->header.prof.ccs;
186 return p->header.prof.ccs->cc->module;
188 return get_itbl(p)->prof.closure_desc;
190 return get_itbl(p)->prof.closure_type;
191 case HEAP_BY_RETAINER:
192 // AFAIK, the only closures in the heap which might not have a
193 // valid retainer set are DEAD_WEAK closures.
194 if (isRetainerSetFieldValid(p))
195 return retainerSetOf(p);
200 case HEAP_BY_INFOPTR:
201 return (void *)((StgClosure *)p)->header.info;
202 case HEAP_BY_CLOSURE_TYPE:
203 return type_names[get_itbl(p)->type];
207 barf("closureIdentity");
211 /* --------------------------------------------------------------------------
212 * Profiling type predicates
213 * ----------------------------------------------------------------------- */
215 static inline rtsBool
216 doingLDVProfiling( void )
218 return (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV
219 || RtsFlags.ProfFlags.bioSelector != NULL);
222 static inline rtsBool
223 doingRetainerProfiling( void )
225 return (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_RETAINER
226 || RtsFlags.ProfFlags.retainerSelector != NULL);
230 // Precesses a closure 'c' being destroyed whose size is 'size'.
231 // Make sure that LDV_recordDead() is not invoked on 'inherently used' closures
232 // such as TSO; they should not be involved in computing dragNew or voidNew.
234 // Even though era is checked in both LdvCensusForDead() and
235 // LdvCensusKillAll(), we still need to make sure that era is > 0 because
236 // LDV_recordDead() may be called from elsewhere in the runtime system. E.g.,
237 // when a thunk is replaced by an indirection object.
241 LDV_recordDead( StgClosure *c, nat size )
247 if (era > 0 && closureSatisfiesConstraints(c)) {
248 size -= sizeofW(StgProfHeader);
249 if ((LDVW((c)) & LDV_STATE_MASK) == LDV_STATE_CREATE) {
250 t = (LDVW((c)) & LDV_CREATE_MASK) >> LDV_SHIFT;
252 if (RtsFlags.ProfFlags.bioSelector == NULL) {
253 censuses[t].void_total += (int)size;
254 censuses[era].void_total -= (int)size;
256 id = closureIdentity(c);
257 ctr = lookupHashTable(censuses[t].hash, (StgWord)id);
258 ASSERT( ctr != NULL );
259 ctr->c.ldv.void_total += (int)size;
260 ctr = lookupHashTable(censuses[era].hash, (StgWord)id);
262 ctr = arenaAlloc(censuses[era].arena, sizeof(counter));
264 insertHashTable(censuses[era].hash, (StgWord)id, ctr);
266 ctr->next = censuses[era].ctrs;
267 censuses[era].ctrs = ctr;
269 ctr->c.ldv.void_total -= (int)size;
273 t = LDVW((c)) & LDV_LAST_MASK;
275 if (RtsFlags.ProfFlags.bioSelector == NULL) {
276 censuses[t+1].drag_total += size;
277 censuses[era].drag_total -= size;
280 id = closureIdentity(c);
281 ctr = lookupHashTable(censuses[t+1].hash, (StgWord)id);
282 ASSERT( ctr != NULL );
283 ctr->c.ldv.drag_total += (int)size;
284 ctr = lookupHashTable(censuses[era].hash, (StgWord)id);
286 ctr = arenaAlloc(censuses[era].arena, sizeof(counter));
288 insertHashTable(censuses[era].hash, (StgWord)id, ctr);
290 ctr->next = censuses[era].ctrs;
291 censuses[era].ctrs = ctr;
293 ctr->c.ldv.drag_total -= (int)size;
301 /* --------------------------------------------------------------------------
302 * Initialize censuses[era];
303 * ----------------------------------------------------------------------- */
305 initEra(Census *census)
307 census->hash = allocHashTable();
309 census->arena = newArena();
311 census->not_used = 0;
314 census->void_total = 0;
315 census->drag_total = 0;
318 /* --------------------------------------------------------------------------
319 * Increases era by 1 and initialize census[era].
320 * Reallocates gi[] and increases its size if needed.
321 * ----------------------------------------------------------------------- */
326 if (doingLDVProfiling()) {
329 if (era == max_era) {
330 barf("maximum number of censuses reached; use +RTS -i to reduce");
333 if (era == n_censuses) {
335 censuses = stgReallocBytes(censuses, sizeof(Census) * n_censuses,
341 initEra( &censuses[era] );
344 /* -----------------------------------------------------------------------------
345 * DEBUG heap profiling, by info table
346 * -------------------------------------------------------------------------- */
348 #ifdef DEBUG_HEAP_PROF
351 void initProfiling1( void )
355 void initProfiling2( void )
360 void endProfiling( void )
364 #endif /* DEBUG_HEAP_PROF */
366 /* --------------------------------------------------------------------------
367 * Initialize the heap profilier
368 * ----------------------------------------------------------------------- */
370 initHeapProfiling(void)
372 if (! RtsFlags.ProfFlags.doHeapProfile) {
377 if (doingLDVProfiling() && doingRetainerProfiling()) {
378 prog_belch("cannot mix -hb and -hr");
383 // we only count eras if we're doing LDV profiling. Otherwise era
386 if (doingLDVProfiling()) {
394 { // max_era = 2^LDV_SHIFT
397 for (p = 0; p < LDV_SHIFT; p++)
402 censuses = stgMallocBytes(sizeof(Census) * n_censuses, "initHeapProfiling");
404 initEra( &censuses[era] );
406 fprintf(hp_file, "JOB \"%s", prog_argv[0]);
411 for(count = 1; count < prog_argc; count++)
412 fprintf(hp_file, " %s", prog_argv[count]);
413 fprintf(hp_file, " +RTS ");
414 for(count = 0; count < rts_argc; count++)
415 fprintf(hp_file, "%s ", rts_argv[count]);
416 fprintf(hp_file, "\n");
418 #endif /* PROFILING */
420 fprintf(hp_file, "\"\n" );
422 fprintf(hp_file, "DATE \"%s\"\n", time_str());
424 fprintf(hp_file, "SAMPLE_UNIT \"seconds\"\n");
425 fprintf(hp_file, "VALUE_UNIT \"bytes\"\n");
427 fprintf(hp_file, "BEGIN_SAMPLE 0.00\n");
428 fprintf(hp_file, "END_SAMPLE 0.00\n");
430 #ifdef DEBUG_HEAP_PROF
431 DEBUG_LoadSymbols(prog_argv[0]);
435 if (doingRetainerProfiling()) {
436 initRetainerProfiling();
444 endHeapProfiling(void)
448 if (! RtsFlags.ProfFlags.doHeapProfile) {
453 if (doingRetainerProfiling()) {
454 endRetainerProfiling();
459 if (doingLDVProfiling()) {
462 aggregateCensusInfo();
463 for (t = 1; t < era; t++) {
464 dumpCensus( &censuses[t] );
469 seconds = mut_user_time();
470 fprintf(hp_file, "BEGIN_SAMPLE %0.2f\n", seconds);
471 fprintf(hp_file, "END_SAMPLE %0.2f\n", seconds);
479 fprint_ccs(FILE *fp, CostCentreStack *ccs, nat max_length)
481 char buf[max_length+1];
486 // MAIN on its own gets printed as "MAIN", otherwise we ignore MAIN.
487 if (ccs == CCS_MAIN) {
492 fprintf(fp, "(%d)", ccs->ccsID);
494 // keep printing components of the stack until we run out of space
495 // in the buffer. If we run out of space, end with "...".
496 for (; ccs != NULL && ccs != CCS_MAIN; ccs = ccs->prevStack) {
498 // CAF cost centres print as M.CAF, but we leave the module
499 // name out of all the others to save space.
500 if (!strcmp(ccs->cc->label,"CAF")) {
501 written = snprintf(buf+next_offset,
502 (int)max_length-3-(int)next_offset,
503 "%s.CAF", ccs->cc->module);
505 if (ccs->prevStack != NULL && ccs->prevStack != CCS_MAIN) {
510 written = snprintf(buf+next_offset,
511 (int)max_length-3-(int)next_offset,
512 template, ccs->cc->label);
515 if (next_offset+written >= max_length-4) {
516 sprintf(buf+max_length-4, "...");
519 next_offset += written;
522 fprintf(fp, "%s", buf);
527 strMatchesSelector( char* str, char* sel )
530 // fprintf(stderr, "str_matches_selector %s %s\n", str, sel);
532 // Compare str against wherever we've got to in sel.
534 while (*p != '\0' && *sel != ',' && *sel != '\0' && *p == *sel) {
537 // Match if all of str used and have reached the end of a sel fragment.
538 if (*p == '\0' && (*sel == ',' || *sel == '\0'))
541 // No match. Advance sel to the start of the next elem.
542 while (*sel != ',' && *sel != '\0') sel++;
543 if (*sel == ',') sel++;
545 /* Run out of sel ?? */
546 if (*sel == '\0') return rtsFalse;
550 /* -----------------------------------------------------------------------------
551 * Figure out whether a closure should be counted in this census, by
552 * testing against all the specified constraints.
553 * -------------------------------------------------------------------------- */
555 closureSatisfiesConstraints( StgClosure* p )
557 #ifdef DEBUG_HEAP_PROF
562 // The CCS has a selected field to indicate whether this closure is
563 // deselected by not being mentioned in the module, CC, or CCS
565 if (!p->header.prof.ccs->selected) {
569 if (RtsFlags.ProfFlags.descrSelector) {
570 b = strMatchesSelector( (get_itbl((StgClosure *)p))->prof.closure_desc,
571 RtsFlags.ProfFlags.descrSelector );
572 if (!b) return rtsFalse;
574 if (RtsFlags.ProfFlags.typeSelector) {
575 b = strMatchesSelector( (get_itbl((StgClosure *)p))->prof.closure_type,
576 RtsFlags.ProfFlags.typeSelector );
577 if (!b) return rtsFalse;
579 if (RtsFlags.ProfFlags.retainerSelector) {
582 rs = retainerSetOf((StgClosure *)p);
584 for (i = 0; i < rs->num; i++) {
585 b = strMatchesSelector( rs->element[i]->cc->label,
586 RtsFlags.ProfFlags.retainerSelector );
587 if (b) return rtsTrue;
593 #endif /* PROFILING */
596 /* -----------------------------------------------------------------------------
597 * Aggregate the heap census info for biographical profiling
598 * -------------------------------------------------------------------------- */
601 aggregateCensusInfo( void )
605 counter *c, *d, *ctrs;
608 if (!doingLDVProfiling()) return;
610 // Aggregate the LDV counters when displaying by biography.
611 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
612 int void_total, drag_total;
614 // Now we compute void_total and drag_total for each census
617 for (t = 1; t < era; t++) { // note: start at 1, not 0
618 void_total += censuses[t].void_total;
619 drag_total += censuses[t].drag_total;
620 censuses[t].void_total = void_total;
621 censuses[t].drag_total = drag_total;
622 ASSERT( censuses[t].void_total <= censuses[t].not_used );
623 ASSERT( censuses[t].drag_total <= censuses[t].used );
629 // otherwise... we're doing a heap profile that is restricted to
630 // some combination of lag, drag, void or use. We've kept all the
631 // census info for all censuses so far, but we still need to
632 // aggregate the counters forwards.
635 acc = allocHashTable();
638 for (t = 1; t < era; t++) {
640 // first look through all the counters we're aggregating
641 for (c = ctrs; c != NULL; c = c->next) {
642 // if one of the totals is non-zero, then this closure
643 // type must be present in the heap at this census time...
644 d = lookupHashTable(censuses[t].hash, (StgWord)c->identity);
647 // if this closure identity isn't present in the
648 // census for this time period, then our running
649 // totals *must* be zero.
650 ASSERT(c->c.ldv.void_total == 0 && c->c.ldv.drag_total == 0);
652 // fprintCCS(stderr,c->identity);
653 // fprintf(stderr," census=%d void_total=%d drag_total=%d\n",
654 // t, c->c.ldv.void_total, c->c.ldv.drag_total);
656 d->c.ldv.void_total += c->c.ldv.void_total;
657 d->c.ldv.drag_total += c->c.ldv.drag_total;
658 c->c.ldv.void_total = d->c.ldv.void_total;
659 c->c.ldv.drag_total = d->c.ldv.drag_total;
661 ASSERT( c->c.ldv.void_total >= 0 );
662 ASSERT( c->c.ldv.drag_total >= 0 );
666 // now look through the counters in this census to find new ones
667 for (c = censuses[t].ctrs; c != NULL; c = c->next) {
668 d = lookupHashTable(acc, (StgWord)c->identity);
670 d = arenaAlloc( arena, sizeof(counter) );
672 insertHashTable( acc, (StgWord)c->identity, d );
673 d->identity = c->identity;
676 d->c.ldv.void_total = c->c.ldv.void_total;
677 d->c.ldv.drag_total = c->c.ldv.drag_total;
679 ASSERT( c->c.ldv.void_total >= 0 );
680 ASSERT( c->c.ldv.drag_total >= 0 );
684 freeHashTable(acc, NULL);
689 /* -----------------------------------------------------------------------------
690 * Print out the results of a heap census.
691 * -------------------------------------------------------------------------- */
693 dumpCensus( Census *census )
698 fprintf(hp_file, "BEGIN_SAMPLE %0.2f\n", census->time);
701 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
702 fprintf(hp_file, "VOID\t%u\n", census->void_total * sizeof(W_));
703 fprintf(hp_file, "LAG\t%u\n",
704 (census->not_used - census->void_total) * sizeof(W_));
705 fprintf(hp_file, "USE\t%u\n",
706 (census->used - census->drag_total) * sizeof(W_));
707 fprintf(hp_file, "INHERENT_USE\t%u\n",
708 census->prim * sizeof(W_));
709 fprintf(hp_file, "DRAG\t%u\n", census->drag_total *
711 fprintf(hp_file, "END_SAMPLE %0.2f\n", census->time);
716 for (ctr = census->ctrs; ctr != NULL; ctr = ctr->next) {
719 if (RtsFlags.ProfFlags.bioSelector != NULL) {
721 if (strMatchesSelector("lag", RtsFlags.ProfFlags.bioSelector))
722 count += ctr->c.ldv.not_used - ctr->c.ldv.void_total;
723 if (strMatchesSelector("drag", RtsFlags.ProfFlags.bioSelector))
724 count += ctr->c.ldv.drag_total;
725 if (strMatchesSelector("void", RtsFlags.ProfFlags.bioSelector))
726 count += ctr->c.ldv.void_total;
727 if (strMatchesSelector("use", RtsFlags.ProfFlags.bioSelector))
728 count += ctr->c.ldv.used - ctr->c.ldv.drag_total;
732 count = ctr->c.resid;
735 ASSERT( count >= 0 );
737 if (count == 0) continue;
739 #ifdef DEBUG_HEAP_PROF
740 switch (RtsFlags.ProfFlags.doHeapProfile) {
741 case HEAP_BY_INFOPTR:
742 fprintf(hp_file, "%s", lookupGHCName(ctr->identity));
744 case HEAP_BY_CLOSURE_TYPE:
745 fprintf(hp_file, "%s", (char *)ctr->identity);
751 switch (RtsFlags.ProfFlags.doHeapProfile) {
753 fprint_ccs(hp_file, (CostCentreStack *)ctr->identity, 25);
758 fprintf(hp_file, "%s", (char *)ctr->identity);
760 case HEAP_BY_RETAINER:
762 RetainerSet *rs = (RetainerSet *)ctr->identity;
764 // it might be the distinguished retainer set rs_MANY:
765 if (rs == &rs_MANY) {
766 fprintf(hp_file, "MANY");
770 // Mark this retainer set by negating its id, because it
771 // has appeared in at least one census. We print the
772 // values of all such retainer sets into the log file at
773 // the end. A retainer set may exist but not feature in
774 // any censuses if it arose as the intermediate retainer
775 // set for some closure during retainer set calculation.
779 // report in the unit of bytes: * sizeof(StgWord)
780 printRetainerSetShort(hp_file, rs);
784 barf("dumpCensus; doHeapProfile");
788 fprintf(hp_file, "\t%d\n", count * sizeof(W_));
791 fprintf(hp_file, "END_SAMPLE %0.2f\n", census->time);
794 /* -----------------------------------------------------------------------------
795 * Code to perform a heap census.
796 * -------------------------------------------------------------------------- */
798 heapCensusChain( Census *census, bdescr *bd )
808 for (; bd != NULL; bd = bd->link) {
810 while (p < bd->free) {
811 info = get_itbl((StgClosure *)p);
814 switch (info->type) {
820 case IND_OLDGEN_PERM:
822 case SE_CAF_BLACKHOLE:
827 case CONSTR_CHARLIKE:
841 size = sizeW_fromITBL(info);
852 size = sizeW_fromITBL(info);
855 case THUNK_1_0: /* ToDo - shouldn't be here */
856 case THUNK_0_1: /* " ditto " */
858 size = sizeofW(StgHeader) + MIN_UPD_SIZE;
863 size = pap_sizeW((StgPAP *)p);
868 size = arr_words_sizeW(stgCast(StgArrWords*,p));
872 case MUT_ARR_PTRS_FROZEN:
874 size = mut_arr_ptrs_sizeW((StgMutArrPtrs *)p);
879 size = tso_sizeW((StgTSO *)p);
888 #ifdef DEBUG_HEAP_PROF
891 // subtract the profiling overhead
892 real_size = size - sizeofW(StgProfHeader);
895 if (closureSatisfiesConstraints((StgClosure*)p)) {
897 if (RtsFlags.ProfFlags.doHeapProfile == HEAP_BY_LDV) {
899 census->prim += real_size;
900 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
901 census->not_used += real_size;
903 census->used += real_size;
907 identity = closureIdentity((StgClosure *)p);
909 if (identity != NULL) {
910 ctr = lookupHashTable( census->hash, (StgWord)identity );
913 if (RtsFlags.ProfFlags.bioSelector != NULL) {
915 ctr->c.ldv.prim += real_size;
916 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
917 ctr->c.ldv.not_used += real_size;
919 ctr->c.ldv.used += real_size;
923 ctr->c.resid += real_size;
926 ctr = arenaAlloc( census->arena, sizeof(counter) );
928 insertHashTable( census->hash, (StgWord)identity, ctr );
929 ctr->identity = identity;
930 ctr->next = census->ctrs;
934 if (RtsFlags.ProfFlags.bioSelector != NULL) {
936 ctr->c.ldv.prim = real_size;
937 else if ((LDVW(p) & LDV_STATE_MASK) == LDV_STATE_CREATE)
938 ctr->c.ldv.not_used = real_size;
940 ctr->c.ldv.used = real_size;
944 ctr->c.resid = real_size;
962 census = &censuses[era];
963 census->time = mut_user_time();
965 // calculate retainer sets if necessary
967 if (doingRetainerProfiling()) {
973 stat_startHeapCensus();
976 // traverse the heap, collecting the census info
977 heapCensusChain( census, small_alloc_list );
978 if (RtsFlags.GcFlags.generations == 1) {
979 heapCensusChain( census, g0s0->to_blocks );
981 for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
982 for (s = 0; s < generations[g].n_steps; s++) {
983 heapCensusChain( census, generations[g].steps[s].blocks );
984 // Are we interested in large objects? might be
985 // confusing to include the stack in a heap profile.
986 // heapCensusChain( census, generations[g].steps[s].large_objects );
991 // dump out the census info
993 // We can't generate any info for LDV profiling until
994 // the end of the run...
995 if (!doingLDVProfiling())
996 dumpCensus( census );
998 dumpCensus( census );
1002 // free our storage, unless we're keeping all the census info for
1003 // future restriction by biography.
1005 if (RtsFlags.ProfFlags.bioSelector == NULL)
1008 freeHashTable( census->hash, NULL/* don't free the elements */ );
1009 arenaFree( census->arena );
1010 census->hash = NULL;
1011 census->arena = NULL;
1014 // we're into the next time period now
1018 stat_endHeapCensus();
1022 #endif /* PROFILING || DEBUG_HEAP_PROF */