/* -----------------------------------------------------------------------------
- * $Id: Ticky.c,v 1.2 1999/02/02 14:21:34 simonm Exp $
+ * $Id: Ticky.c,v 1.10 1999/10/13 16:39:24 simonmar Exp $
*
- * (c) The GHC Team, Glasgow University, 1992-1998
+ * (c) The AQUA project, Glasgow University, 1992-1997
+ * (c) The GHC Team, 1998-1999
*
* Ticky-ticky profiling
*-------------------------------------------------------------------------- */
{
unsigned long i;
unsigned long tot_allocs = /* total number of things allocated */
- ALLOC_FUN_ctr + ALLOC_THK_ctr + ALLOC_CON_ctr + ALLOC_TUP_ctr +
+ ALLOC_FUN_ctr + ALLOC_SE_THK_ctr + ALLOC_UP_THK_ctr + ALLOC_CON_ctr + ALLOC_TUP_ctr +
ALLOC_TSO_ctr +
#ifdef PAR
ALLOC_FMBQ_ctr + ALLOC_FME_ctr + ALLOC_BF_ctr +
unsigned long tot_enters =
ENT_CON_ctr + ENT_FUN_DIRECT_ctr +
- ENT_IND_ctr + ENT_PAP_ctr + ENT_THK_ctr;
+ ENT_IND_ctr + ENT_PERM_IND_ctr + ENT_PAP_ctr + ENT_THK_ctr;
unsigned long jump_direct_enters =
tot_enters - ENT_VIA_NODE_ctr;
unsigned long bypass_enters =
unsigned long tot_returns_of_new = RET_NEW_ctr;
+ unsigned long con_updates = UPD_CON_IN_NEW_ctr + UPD_CON_IN_PLACE_ctr;
unsigned long pap_updates = UPD_PAP_IN_NEW_ctr + UPD_PAP_IN_PLACE_ctr;
- unsigned long tot_updates = UPD_EXISTING_ctr + UPD_SQUEEZED_ctr + pap_updates;
+ unsigned long tot_updates = UPD_SQUEEZED_ctr + pap_updates + con_updates;
- unsigned long tot_new_updates = UPD_NEW_IND_ctr;
- unsigned long tot_old_updates = UPD_OLD_IND_ctr;
+ unsigned long tot_new_updates = UPD_NEW_IND_ctr + UPD_NEW_PERM_IND_ctr;
+ unsigned long tot_old_updates = UPD_OLD_IND_ctr + UPD_OLD_PERM_IND_ctr;
unsigned long tot_gengc_updates = tot_new_updates + tot_old_updates;
FILE *tf = RtsFlags.TickyFlags.tickyFile;
fprintf(tf,"\t\t%5.1f %5.1f %5.1f %5.1f %5.1f", ALLOC_HISTO_MAGIC(FUN));
fprintf(tf,"\n%7ld (%5.1f%%) thunks",
- ALLOC_THK_ctr,
- PC(INTAVG(ALLOC_THK_ctr, tot_allocs)));
- if (ALLOC_THK_ctr != 0)
+ ALLOC_SE_THK_ctr + ALLOC_UP_THK_ctr,
+ PC(INTAVG(ALLOC_SE_THK_ctr + ALLOC_UP_THK_ctr, tot_allocs)));
+
+#define ALLOC_THK_ctr (ALLOC_UP_THK_ctr + ALLOC_SE_THK_ctr)
+ /* hack to make ALLOC_HISTO_MAGIC still work for THK */
+ if ((ALLOC_SE_THK_ctr + ALLOC_UP_THK_ctr) != 0)
fprintf(tf,"\t\t\t\t%5.1f %5.1f %5.1f %5.1f %5.1f", ALLOC_HISTO_MAGIC(THK));
+#undef ALLOC_THK_ctr
fprintf(tf,"\n%7ld (%5.1f%%) data values",
ALLOC_CON_ctr,
fprintf(tf,"%7ld (%5.1f%%) partial applications\n",
ENT_PAP_ctr,
PC(INTAVG(ENT_PAP_ctr,tot_enters)));
- fprintf(tf,"%7ld (%5.1f%%) indirections\n",
+ fprintf(tf,"%7ld (%5.1f%%) normal indirections\n",
ENT_IND_ctr,
PC(INTAVG(ENT_IND_ctr,tot_enters)));
+ fprintf(tf,"%7ld (%5.1f%%) permanent indirections\n",
+ ENT_PERM_IND_ctr,
+ PC(INTAVG(ENT_PERM_IND_ctr,tot_enters)));
fprintf(tf,"\nRETURNS: %ld\n", tot_returns);
fprintf(tf,"%7ld (%5.1f%%) from entering a new constructor\n\t\t [the rest from entering an existing constructor]\n",
UPDF_RCC_OMITTED_ctr);
fprintf(tf,"\nUPDATES: %ld\n", tot_updates);
- fprintf(tf,"%7ld (%5.1f%%) data values\n",
- UPD_CON_IN_NEW_ctr,
- PC(INTAVG(UPD_CON_IN_NEW_ctr,tot_updates)));
+ fprintf(tf,"%7ld (%5.1f%%) data values\n\t\t [%ld in place, %ld allocated new space]\n",
+ con_updates,
+ PC(INTAVG(con_updates,tot_updates)),
+ UPD_CON_IN_PLACE_ctr, UPD_CON_IN_NEW_ctr);
fprintf(tf,"%7ld (%5.1f%%) partial applications\n\t\t [%ld in place, %ld allocated new space]\n",
pap_updates,
PC(INTAVG(pap_updates,tot_updates)),
UPD_PAP_IN_PLACE_ctr, UPD_PAP_IN_NEW_ctr);
- fprintf(tf,"%7ld (%5.1f%%) updates to existing heap objects (%ld by squeezing)\n",
- UPD_EXISTING_ctr + UPD_SQUEEZED_ctr,
- PC(INTAVG(UPD_EXISTING_ctr + UPD_SQUEEZED_ctr, tot_updates)),
- UPD_SQUEEZED_ctr);
+ fprintf(tf,"%7ld (%5.1f%%) updates by squeezing\n",
+ UPD_SQUEEZED_ctr,
+ PC(INTAVG(UPD_SQUEEZED_ctr, tot_updates)));
- fprintf(tf, "UPD_CON_IN_NEW: %7ld: ", UPD_CON_IN_NEW_ctr);
+ fprintf(tf, "\nUPD_CON_IN_NEW: %7ld: ", UPD_CON_IN_NEW_ctr);
for (i = 0; i < 9; i++) { fprintf(tf, "%7ld", UPD_CON_IN_NEW_hst[i]); }
fprintf(tf, "\n");
+ fprintf(tf, "UPD_CON_IN_PLACE: %7ld: ", UPD_CON_IN_PLACE_ctr);
+ for (i = 0; i < 9; i++) { fprintf(tf, "%7ld", UPD_CON_IN_PLACE_hst[i]); }
+ fprintf(tf, "\n");
fprintf(tf, "UPD_PAP_IN_NEW: %7ld: ", UPD_PAP_IN_NEW_ctr);
for (i = 0; i < 9; i++) { fprintf(tf, "%7ld", UPD_PAP_IN_NEW_hst[i]); }
fprintf(tf, "\n");
if (tot_gengc_updates != 0) {
- fprintf(tf,"\nNEW GEN UPDATES: %ld (%5.1f%%)\n",
+ fprintf(tf,"\nNEW GEN UPDATES: %9ld (%5.1f%%)\n",
tot_new_updates,
PC(INTAVG(tot_new_updates,tot_gengc_updates)));
- fprintf(tf,"\nOLD GEN UPDATES: %ld (%5.1f%%)\n",
+ fprintf(tf,"OLD GEN UPDATES: %9ld (%5.1f%%)\n",
tot_old_updates,
PC(INTAVG(tot_old_updates,tot_gengc_updates)));
}
fprintf(tf,"\nTotal bytes copied during GC: %ld\n",
GC_WORDS_COPIED_ctr * sizeof(W_));
-#if 0
printRegisteredCounterInfo(tf);
-#endif
fprintf(tf,"\n**************************************************\n");
#define PR_CTR(ctr) \
do { fprintf(tf,"%7ld " #ctr "\n", ctr); } while(0)
+/* COND_PR_CTR takes a boolean; if false then msg is the printname rather than ctr */
+#define COND_PR_CTR(ctr,b,msg) \
+ if (b) { fprintf(tf,"%7ld " #ctr "\n", ctr); } else { fprintf(tf,"%7ld " msg "\n", ctr); }
#define PR_HST(hst,i) \
do { fprintf(tf,"%7ld " #hst "_" #i "\n", hst[i]); } while(0)
PR_HST(ALLOC_FUN_hst,2);
PR_HST(ALLOC_FUN_hst,3);
PR_HST(ALLOC_FUN_hst,4);
- PR_CTR(ALLOC_THK_ctr);
+ PR_CTR(ALLOC_UP_THK_ctr);
+ PR_CTR(ALLOC_SE_THK_ctr);
PR_CTR(ALLOC_THK_adm);
PR_CTR(ALLOC_THK_gds);
PR_CTR(ALLOC_THK_slp);
PR_CTR(ENT_FUN_STD_ctr);
PR_CTR(ENT_FUN_DIRECT_ctr);
PR_CTR(ENT_IND_ctr);
+
+/* The counters ENT_PERM_IND and UPD_{NEW,OLD}_PERM_IND are not dumped
+ * at the end of execution unless update squeezing is turned off (+RTS
+ * -Z =RtsFlags.GcFlags.squeezeUpdFrames), as they will be wrong
+ * otherwise. Why? Because for each update frame squeezed out, we
+ * count an UPD_NEW_PERM_IND *at GC time* (i.e., too early). And
+ * further, when we enter the closure that has been updated, we count
+ * the ENT_PERM_IND, but we then enter the PERM_IND that was built for
+ * the next update frame below, and so on down the chain until we
+ * finally reach the value. Thus we count many new ENT_PERM_INDs too
+ * early.
+ *
+ * This of course refers to the -ticky version that uses PERM_INDs to
+ * determine the number of closures entered 0/1/>1. KSW 1999-04. */
+ COND_PR_CTR(ENT_PERM_IND_ctr,RtsFlags.GcFlags.squeezeUpdFrames == rtsTrue,"E!NT_PERM_IND_ctr requires +RTS -Z");
+
PR_CTR(ENT_PAP_ctr);
+ PR_CTR(ENT_AP_UPD_ctr);
+ PR_CTR(ENT_BH_ctr);
PR_CTR(ENT_THK_ctr);
PR_CTR(RET_NEW_ctr);
PR_CTR(RET_OLD_ctr);
+ PR_CTR(RET_UNBOXED_TUP_ctr);
PR_CTR(RET_SEMI_BY_DEFAULT_ctr);
PR_CTR(RET_SEMI_IN_HEAP_ctr);
PR_CTR(RET_SEMI_FAILED_IND_ctr);
PR_HST(RET_OLD_hst,6);
PR_HST(RET_OLD_hst,7);
PR_HST(RET_OLD_hst,8);
+ PR_HST(RET_UNBOXED_TUP_hst,0);
+ PR_HST(RET_UNBOXED_TUP_hst,1);
+ PR_HST(RET_UNBOXED_TUP_hst,2);
+ PR_HST(RET_UNBOXED_TUP_hst,3);
+ PR_HST(RET_UNBOXED_TUP_hst,4);
+ PR_HST(RET_UNBOXED_TUP_hst,5);
+ PR_HST(RET_UNBOXED_TUP_hst,6);
+ PR_HST(RET_UNBOXED_TUP_hst,7);
+ PR_HST(RET_UNBOXED_TUP_hst,8);
PR_HST(RET_SEMI_IN_HEAP_hst,0);
PR_HST(RET_SEMI_IN_HEAP_hst,1);
PR_HST(RET_SEMI_IN_HEAP_hst,2);
PR_CTR(UPDF_RCC_PUSHED_ctr);
PR_CTR(UPDF_RCC_OMITTED_ctr);
- PR_CTR(UPD_EXISTING_ctr);
PR_CTR(UPD_SQUEEZED_ctr);
PR_CTR(UPD_CON_IN_NEW_ctr);
+ PR_CTR(UPD_CON_IN_PLACE_ctr);
PR_CTR(UPD_PAP_IN_NEW_ctr);
+ PR_CTR(UPD_PAP_IN_PLACE_ctr);
+
+ PR_CTR(UPD_BH_UPDATABLE_ctr);
+ PR_CTR(UPD_BH_SINGLE_ENTRY_ctr);
+ PR_CTR(UPD_CAF_BH_UPDATABLE_ctr);
+ PR_CTR(UPD_CAF_BH_SINGLE_ENTRY_ctr);
PR_HST(UPD_CON_IN_NEW_hst,0);
PR_HST(UPD_CON_IN_NEW_hst,1);
PR_HST(UPD_PAP_IN_NEW_hst,8);
PR_CTR(UPD_NEW_IND_ctr);
+ /* see comment on ENT_PERM_IND_ctr */
+ COND_PR_CTR(UPD_NEW_PERM_IND_ctr,RtsFlags.GcFlags.squeezeUpdFrames == rtsTrue,"U!PD_NEW_PERM_IND_ctr requires +RTS -Z");
PR_CTR(UPD_OLD_IND_ctr);
+ /* see comment on ENT_PERM_IND_ctr */
+ COND_PR_CTR(UPD_OLD_PERM_IND_ctr,RtsFlags.GcFlags.squeezeUpdFrames == rtsTrue,"U!PD_OLD_PERM_IND_ctr requires +RTS -Z");
PR_CTR(GC_SEL_ABANDONED_ctr);
PR_CTR(GC_SEL_MINOR_ctr);
PR_CTR(GC_WORDS_COPIED_ctr);
}
-#if 0
/* Data structure used in ``registering'' one of these counters. */
-struct ent_counter *ListOfEntryCtrs = NULL; /* root of list of them */
+StgEntCounter *ticky_entry_ctrs = NULL; /* root of list of them */
/* To print out all the registered-counter info: */
static void
printRegisteredCounterInfo (FILE *tf)
{
- struct ent_counter *p;
+ StgEntCounter *p;
- if ( ListOfEntryCtrs != NULL ) {
- fprintf(tf,"\n**************************************************\n");
+ if ( ticky_entry_ctrs != NULL ) {
+ fprintf(tf,"\n**************************************************\n\n");
}
-
- for (p = ListOfEntryCtrs; p != NULL; p = p->link) {
- /* common stuff first; then the wrapper info if avail */
- fprintf(tf, "%-40s%u\t%u\t%u\t%-16s%ld",
- p->f_str,
+ fprintf(tf, "%-30s %6s%6s %-16s%-11s%-11s\n",
+ "Function", "Arity", "Stack", "Kinds", "Entries",
+ "Allocs");
+ fprintf(tf, "--------------------------------------------------------------------------------\n");
+
+ for (p = ticky_entry_ctrs; p != NULL; p = p->link) {
+ fprintf(tf, "%-30s%6u%6u %-11s%11ld%11ld",
+ p->str,
p->arity,
- p->Astk_args,
- p->Bstk_args,
- p->f_arg_kinds,
- p->ctr);
-
- if ( p->wrap_str == NULL ) {
- fprintf(tf, "\n");
-
- } else {
- fprintf(tf, "\t%s\t%s\n",
- p->wrap_str,
- p->wrap_arg_kinds);
- }
+ p->stk_args,
+ p->arg_kinds,
+ p->ctr,
+ p->allocs);
+
+ fprintf(tf, "\n");
+
}
}
-#endif
+
+/* Catch-all top-level counter struct. Allocations from CAFs will go
+ * here.
+ */
+StgEntCounter top_ct
+ = { 0, 0, 0,
+ "TOP", "",
+ 0, 0, NULL };
#endif /* TICKY_TICKY */
+