/* -----------------------------------------------------------------------------
- * $Id: ProfHeap.c,v 1.34 2001/12/12 15:01:25 simonmar Exp $
+ * $Id: ProfHeap.c,v 1.48 2003/09/23 15:38:36 simonmar Exp $
*
- * (c) The GHC Team, 1998-2000
+ * (c) The GHC Team, 1998-2003
*
* Support for heap profiling
*
#include "Arena.h"
#include "Printer.h"
+#include <string.h>
+#include <stdlib.h>
+
/* -----------------------------------------------------------------------------
* era stores the current time period. It is the same as the
* number of censuses that have been performed.
int drag_total;
} Census;
-Census *censuses = NULL;
-nat n_censuses = 0;
+static Census *censuses = NULL;
+static nat n_censuses = 0;
#ifdef PROFILING
static void aggregateCensusInfo( void );
, "THUNK_SELECTOR"
, "BCO"
- , "AP_UPD"
+ , "AP_STACK"
+ , "AP"
, "PAP"
, "UPDATE_FRAME"
, "CATCH_FRAME"
, "STOP_FRAME"
- , "SEQ_FRAME"
, "BLACKHOLE"
, "BLACKHOLE_BQ"
era++;
if (era == max_era) {
- barf("maximum number of censuses reached; use +RTS -i to reduce");
+ prog_belch("maximum number of censuses reached; use +RTS -i to reduce");
+ stg_exit(EXIT_FAILURE);
}
if (era == n_censuses) {
}
}
#endif // PROFILING
-
+
initEra( &censuses[era] );
}
initEra( &censuses[era] );
- fprintf(hp_file, "JOB \"%s", prog_argv[0]);
+ fprintf(hp_file, "JOB \"%s", prog_name);
#ifdef PROFILING
{
fprintf(hp_file, "END_SAMPLE 0.00\n");
#ifdef DEBUG_HEAP_PROF
- DEBUG_LoadSymbols(prog_argv[0]);
+ DEBUG_LoadSymbols(prog_name);
#endif
#ifdef PROFILING
#ifdef PROFILING
+static size_t
+buf_append(char *p, const char *q, char *end)
+{
+ int m;
+
+ for (m = 0; p < end; p++, q++, m++) {
+ *p = *q;
+ if (*q == '\0') { break; }
+ }
+ return m;
+}
+
static void
fprint_ccs(FILE *fp, CostCentreStack *ccs, nat max_length)
{
- char buf[max_length+1];
+ char buf[max_length+1], *p, *buf_end;
nat next_offset = 0;
nat written;
- char *template;
// MAIN on its own gets printed as "MAIN", otherwise we ignore MAIN.
if (ccs == CCS_MAIN) {
return;
}
+ fprintf(fp, "(%d)", ccs->ccsID);
+
+ p = buf;
+ buf_end = buf + max_length + 1;
+
// keep printing components of the stack until we run out of space
// in the buffer. If we run out of space, end with "...".
for (; ccs != NULL && ccs != CCS_MAIN; ccs = ccs->prevStack) {
// CAF cost centres print as M.CAF, but we leave the module
// name out of all the others to save space.
if (!strcmp(ccs->cc->label,"CAF")) {
- written = snprintf(buf+next_offset,
- (int)max_length-3-(int)next_offset,
- "%s.CAF", ccs->cc->module);
+ p += buf_append(p, ccs->cc->module, buf_end);
+ p += buf_append(p, ".CAF", buf_end);
} else {
if (ccs->prevStack != NULL && ccs->prevStack != CCS_MAIN) {
- template = "%s/";
- } else {
- template = "%s";
+ p += buf_append(p, "/", buf_end);
}
- written = snprintf(buf+next_offset,
- (int)max_length-3-(int)next_offset,
- template, ccs->cc->label);
+ p += buf_append(p, ccs->cc->label, buf_end);
}
-
- if (next_offset+written >= max_length-4) {
+
+ if (p >= buf_end) {
sprintf(buf+max_length-4, "...");
break;
} else {
if (RtsFlags.ProfFlags.retainerSelector) {
RetainerSet *rs;
nat i;
- rs = retainerSetOf((StgClosure *)p);
- if (rs != NULL) {
- for (i = 0; i < rs->num; i++) {
- b = strMatchesSelector( rs->element[i]->cc->label,
- RtsFlags.ProfFlags.retainerSelector );
- if (b) return rtsTrue;
+ // We must check that the retainer set is valid here. One
+ // reason it might not be valid is if this closure is a
+ // a newly deceased weak pointer (i.e. a DEAD_WEAK), since
+ // these aren't reached by the retainer profiler's traversal.
+ if (isRetainerSetFieldValid((StgClosure *)p)) {
+ rs = retainerSetOf((StgClosure *)p);
+ if (rs != NULL) {
+ for (i = 0; i < rs->num; i++) {
+ b = strMatchesSelector( rs->element[i]->cc->label,
+ RtsFlags.ProfFlags.retainerSelector );
+ if (b) return rtsTrue;
+ }
}
}
return rtsFalse;
#ifdef PROFILING
switch (RtsFlags.ProfFlags.doHeapProfile) {
case HEAP_BY_CCS:
- fprint_ccs(hp_file, (CostCentreStack *)ctr->identity, 30);
+ fprint_ccs(hp_file, (CostCentreStack *)ctr->identity, 25);
break;
case HEAP_BY_MOD:
case HEAP_BY_DESCR:
rtsBool prim;
for (; bd != NULL; bd = bd->link) {
+
+ // HACK: ignore pinned blocks, because they contain gaps.
+ // It's not clear exactly what we'd like to do here, since we
+ // can't tell which objects in the block are actually alive.
+ // Perhaps the whole block should be counted as SYSTEM memory.
+ if (bd->flags & BF_PINNED) {
+ continue;
+ }
+
p = bd->start;
while (p < bd->free) {
info = get_itbl((StgClosure *)p);
case FUN:
case THUNK:
case IND_PERM:
+ case IND_OLDGEN:
case IND_OLDGEN_PERM:
case CAF_BLACKHOLE:
case SE_CAF_BLACKHOLE:
break;
case BCO:
+ prim = rtsTrue;
+ size = bco_sizeW((StgBCO *)p);
+ break;
+
case MVAR:
case WEAK:
case FOREIGN:
size = sizeofW(StgHeader) + MIN_UPD_SIZE;
break;
+ case AP:
case PAP:
- case AP_UPD:
size = pap_sizeW((StgPAP *)p);
break;
+
+ case AP_STACK:
+ size = ap_stack_sizeW((StgAP_STACK *)p);
+ break;
case ARR_WORDS:
prim = rtsTrue;
case TSO:
prim = rtsTrue;
+#ifdef DEBUG_HEAP_PROF
size = tso_sizeW((StgTSO *)p);
break;
-
+#else
+ if (RtsFlags.ProfFlags.includeTSOs) {
+ size = tso_sizeW((StgTSO *)p);
+ break;
+ } else {
+ // Skip this TSO and move on to the next object
+ p += tso_sizeW((StgTSO *)p);
+ continue;
+ }
+#endif
+
default:
barf("heapCensus");
}
stat_startHeapCensus();
#endif
- // traverse the heap, collecting the census info
+ // Traverse the heap, collecting the census info
+
+ // First the small_alloc_list: we have to fix the free pointer at
+ // the end by calling tidyAllocatedLists() first.
+ tidyAllocateLists();
heapCensusChain( census, small_alloc_list );
+
+ // Now traverse the heap in each generation/step.
if (RtsFlags.GcFlags.generations == 1) {
heapCensusChain( census, g0s0->to_blocks );
} else {
heapCensusChain( census, generations[g].steps[s].blocks );
// Are we interested in large objects? might be
// confusing to include the stack in a heap profile.
- // heapCensusChain( census, generations[g].steps[s].large_objects );
+ heapCensusChain( census, generations[g].steps[s].large_objects );
}
}
}
projects / ghc-hetmet.git / blobdiff