#include <string.h>
#include "irgraph.h"
#include "irprog.h"
+#include "iredges.h"
#include "phiclass_t.h"
#include "becopyopt.h"
#include "becopystat.h"
I_CLS_PHIS_E = I_CLS_PHIS_S+MAX_CLS_PHIS,
/* FROM HERE: RESULT VLAUES */
+ /* all of them are external set */
/* ilp values */
- I_ILP_TIME, /* !external set! solving time in seconds */
- I_ILP_ITER, /* !external set! number of simplex iterations */
+ I_HEUR_TIME, /* solving time in milli seconds */
+ I_ILP_TIME, /* solving time in milli seconds */
+ I_ILP_VARS,
+ I_ILP_CSTR,
+ I_ILP_ITER, /* number of simplex iterations */
/* copy instructions */
- I_COPIES_MAX, /* !external set! max possible costs of copies*/
- I_COPIES_INIT, /* !external set! number of copies in initial allocation */
- I_COPIES_HEUR, /* !external set! number of copies after heuristic */
- I_COPIES_OPT, /* !external set! number of copies after ilp */
- I_COPIES_IF, /* !external set! number of copies inevitable due to root-arg-interf */
+ I_COPIES_MAX, /* max possible costs of copies*/
+ I_COPIES_INIT, /* number of copies in initial allocation */
+ I_COPIES_HEUR, /* number of copies after heuristic */
+ I_COPIES_NSEC, /* number of copies after ilp with max n sec */
+ I_COPIES_OPT, /* number of copies after ilp */
+ I_COPIES_IF, /* number of copies inevitable due to root-arg-interf */
ASIZE
};
static pset *all_phi_nodes;
static pset *all_phi_classes;
static pset *all_copy_nodes;
+static ir_graph *last_irg;
void copystat_init(void) {
dbg = firm_dbg_register("ir.be.copystat");
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) {
pset_insert_ptr(all_copy_nodes, node);
}
-void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) {
+static 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);
+ last_irg = irg;
+}
+
+/**
+ * @return 1 if the block at pos @p pos removed a critical edge
+ * 0 else
+ */
+static INLINE int was_edge_critical(const ir_node *bl, int pos) {
+ const ir_edge_t *edge;
+ const ir_node *bl_at_pos, *bl_before;
+ assert(is_Block(bl));
+
+ /* Does bl have several predecessors ?*/
+ if (get_irn_arity(bl) <= 1)
+ return 0;
+
+ /* Does the pred have exactly one predecessor */
+ bl_at_pos = get_irn_n(bl, pos);
+ if (get_irn_arity(bl_at_pos) != 1)
+ return 0;
+
+ /* Does the pred of the pred have several sucsecessors */
+ bl_before = get_irn_n(bl_at_pos, 0);
+ edge = get_block_succ_first(bl_before);
+ return get_block_succ_next(bl_before, edge) ? 1 : 0;
}
/**
*/
static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) {
int arity, i;
+ ir_node *phi_bl;
assert(is_Phi(phi));
/* count all phi phis */
else
curr_vals[I_PHI_ARITY_S + arity]++;
+ phi_bl = get_nodes_block(phi);
/* type of argument {self, const, pred, glob} */
for (i = 0; i < arity; i++) {
ir_node *block_of_arg, *block_ith_pred;
- ir_node *cfg_node, *arg = get_irn_n(phi, i);
+ ir_node *arg = get_irn_n(phi, i);
if (arg == phi) {
curr_vals[I_PHI_ARG_SELF]++;
continue;
}
- block_of_arg = get_nodes_block(arg);
-
/* get the pred block skipping blocks on critical edges */
- cfg_node = get_irn_n(get_nodes_block(phi), i);
- block_ith_pred = get_nodes_block(cfg_node);
- if (get_irn_opcode(cfg_node) == iro_Jmp && get_irn_arity(block_ith_pred) == 1) {
- /* Then cfg_node_block has exactly 1 pred and 1 succ block,
- * thus it must have been inserted during remove_critical_edges */
+ block_ith_pred = get_Block_cfgpred_block(phi_bl, i);
+ if (was_edge_critical(phi_bl, i))
block_ith_pred = get_Block_cfgpred_block(block_ith_pred, 0);
- }
+ block_of_arg = get_nodes_block(arg);
if (block_of_arg == block_ith_pred) {
curr_vals[I_PHI_ARG_PRED]++;
continue;
/* get an array of all members for double iterating */
members = xmalloc(size * sizeof(*members));
- for (i = 0, p = pset_first(pc); p; p = pset_next(pc))
+ DBG((dbg, LEVEL_2, "Phi-class:\n"));
+ for (i = 0, p = pset_first(pc); p; p = pset_next(pc)) {
+ DBG((dbg, LEVEL_2, " %+F\n", p));
members[i++] = p;
+ }
assert(i == size);
/* determine number of phis on this class */
void copystat_collect_cls(be_chordal_env_t *chordal_env) {
ir_node *n;
pset *pc;
+ ir_graph *irg = chordal_env->session_env->irg;
+
+ if (last_irg != irg) {
+ copystat_reset();
+ copystat_collect_irg(irg, chordal_env->session_env->main_env->arch_env);
+ }
for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
if (is_curr_reg_class(n))
void copystat_add_heur_costs(int costs) {
curr_vals[I_COPIES_HEUR] += costs;
}
+void copystat_add_ilp_n_sec_costs(int costs) {
+ curr_vals[I_COPIES_NSEC] += costs;
+}
void copystat_add_opt_costs(int costs) {
curr_vals[I_COPIES_OPT] += costs;
}
+void copystat_add_heur_time(int time) {
+ curr_vals[I_HEUR_TIME] += time;
+}
void copystat_add_ilp_time(int time) {
curr_vals[I_ILP_TIME] += time;
}
+void copystat_add_ilp_vars(int vars) {
+ curr_vals[I_ILP_VARS] += vars;
+}
+void copystat_add_ilp_csts(int csts) {
+ curr_vals[I_ILP_CSTR] += csts;
+}
void copystat_add_ilp_iter(int iters) {
curr_vals[I_ILP_ITER] += iters;
}
projects / libfirm / blobdiff