#endif
#include <string.h>
-#include "phiclass_t.h"
+#include "irgraph.h"
#include "irprog.h"
+#include "phiclass_t.h"
#include "becopyopt.h"
#include "becopystat.h"
#include "xmalloc.h"
#ifdef DO_STAT
+#define DEBUG_LVL 0 //SET_LEVEL_1
+static firm_dbg_module_t *dbg = NULL;
+
static pset *all_phi_nodes;
static pset *all_phi_classes;
static pset *all_copy_nodes;
void copystat_init(void) {
+ dbg = firm_dbg_register("ir.be.copystat");
+ firm_dbg_set_mask(dbg, DEBUG_LVL);
+
all_phi_nodes = pset_new_ptr_default();
all_phi_classes = pset_new_ptr_default();
all_copy_nodes = pset_new_ptr_default();
phi_class_init();
-
}
void copystat_reset(void) {
int i;
for (i = 0; i < ASIZE; ++i)
curr_vals[i] = 0;
+ del_pset(all_phi_nodes);
+ del_pset(all_phi_classes);
+ del_pset(all_copy_nodes);
+ all_phi_nodes = pset_new_ptr_default();
+ all_phi_classes = pset_new_ptr_default();
+ all_copy_nodes = pset_new_ptr_default();
}
/**
* Collect general data
*/
-static void stat_walker(ir_node *node, void *env) {
+static void irg_stat_walker(ir_node *node, void *env) {
+ arch_env_t *arch_env = env;
curr_vals[I_ALL_NODES]++; /* count all nodes */
if (is_Block(node)) /* count all blocks */
if (is_Phi(node)) /* collect phis */
pset_insert_ptr(all_phi_nodes, node);
- if (is_Copy(node))
+ if (is_Copy(arch_env, node))
pset_insert_ptr(all_copy_nodes, node);
}
+void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) {
+ irg_walk_graph(irg, irg_stat_walker, NULL, arch_env);
+ curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */
+ all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
+}
+
/**
* Collect phi node data
*/
if (phi != arg) {
curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */
- if (nodes_interfere(chordal_env, phi, arg))
+ if (nodes_interfere(chordal_env, phi, arg)) {
+ DBG((dbg, LEVEL_1, "%e -- In Block %N: %n %N %n %N\n", get_irg_entity(chordal_env->irg), get_nodes_block(phi), phi, phi, arg, arg));
curr_vals[I_COPIES_IF]++;
+ }
}
if (arg == phi) {
xfree(members);
}
-void copystat_collect_irg(ir_graph *irg) {
- irg_walk_graph(irg, stat_walker, NULL, NULL);
- curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */
- all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
-}
-
#define is_curr_reg_class(irn) (arch_get_irn_reg_class(chordal_env->arch_env, irn, arch_pos_make_out(0)) == chordal_env->cls)
void copystat_collect_cls(be_chordal_env_t *chordal_env) {
void copystat_dump(ir_graph *irg) {
int i;
char buf[1024];
+ FILE *out;
snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
- FILE *out = ffopen(buf, "stat", "wt");
+ out = ffopen(buf, "stat", "wt");
fprintf(out, "%s\n", get_irp_prog_name());
for (i = 0; i < ASIZE; i++) {
fclose(out);
}
-//TODO copystat_dump_pretty
void copystat_dump_pretty(ir_graph *irg) {
int i;
- FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "pretty", "wt");
-
- fprintf(out, "\nPhi argument types\n");
- fprintf(out, "Total %4d\n", curr_vals[I_PHI_ARG_CNT]);
- fprintf(out, "Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
- fprintf(out, "CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]);
- fprintf(out, "Others %4d\n", curr_vals[I_PHI_ARG_GLOB]);
-
- fprintf(out, "\nPhi class interference\n");
- fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]);
- fprintf(out, "Phis %4d\n", curr_vals[I_PHI_CNT]);
+ char buf[1024];
+ FILE *out;
- fprintf(out, "\nPhi arity\n");
+ snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
+ out = ffopen(buf, "pstat", "wt");
+
+ fprintf(out, "Nodes %4d\n", curr_vals[I_ALL_NODES]);
+ fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]);
+ fprintf(out, "CopyIrn %4d\n", curr_vals[I_CPY_CNT]);
+
+ fprintf(out, "\nPhis %4d\n", curr_vals[I_PHI_CNT]);
+ fprintf(out, "... argument types\n");
+ fprintf(out, " Total %4d\n", curr_vals[I_PHI_ARG_CNT]);
+ fprintf(out, " Self %4d\n", curr_vals[I_PHI_ARG_SELF]);
+ fprintf(out, " Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
+ fprintf(out, " CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]);
+ fprintf(out, " Others %4d\n", curr_vals[I_PHI_ARG_GLOB]);
+ fprintf(out, "... arities\n");
for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
- fprintf(out, "%2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
+ fprintf(out, " %2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
- fprintf(out, "\nPhi class sizes\n");
+ fprintf(out, "\nPhi classes %4d\n", curr_vals[I_CLS_CNT]);
+ fprintf(out, " compl. free %4d\n", curr_vals[I_CLS_IF_FREE]);
+ fprintf(out, " inner intf. %4d / %4d\n", curr_vals[I_CLS_IF_CNT], curr_vals[I_CLS_IF_MAX]);
+ fprintf(out, "... sizes\n");
for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
- fprintf(out, "%2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
-
- fprintf(out, "\n\nTotal nodes: %4d\n", curr_vals[I_ALL_NODES]);
+ fprintf(out, " %2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
+
+ fprintf(out, "\nILP stat\n");
+ fprintf(out, " Time %8d\n", curr_vals[I_ILP_TIME]);
+ fprintf(out, " Iter %8d\n", curr_vals[I_ILP_ITER]);
+
+ fprintf(out, "\nCopy stat\n");
+ fprintf(out, " Max %4d\n", curr_vals[I_COPIES_MAX]);
+ fprintf(out, " Init %4d\n", curr_vals[I_COPIES_INIT]);
+ fprintf(out, " Heur %4d\n", curr_vals[I_COPIES_HEUR]);
+ fprintf(out, " Opt %4d\n", curr_vals[I_COPIES_OPT]);
+ fprintf(out, " Intf %4d\n", curr_vals[I_COPIES_IF]);
fclose(out);
}
projects / libfirm / blobdiff