20 #include "phiclass_t.h"
21 #include "bephicoal_t.h"
24 #define DEBUG_LVL SET_LEVEL_1
25 #define DO_PHI_STATISTICS 0
26 #define CHECK_RESULTS 1
27 #define COUNT_COPY_SAVINGS 1
28 #define DUMP_OPT_DIFF 1
30 #define DUMP_IRG_PHI_STAT 1
31 #define DUMP_DIR_PHI_STAT 1
32 #define DUMP_ALL_PHI_STAT 1
34 #define PHI_STAT_FILE "all.phistat"
35 #define ENV_PHI_STAT "PHI_STAT"
37 static firm_dbg_module_t *dbgphi = NULL;
39 static void phi_node_walker(ir_node *node, void *env) {
40 if (is_Phi(node) && mode_is_datab(get_irn_mode(node)))
41 pset_insert_ptr((pset *)env, node);
45 static void node_collector(ir_node *node, void *env) {
46 if (!is_Block(node) && is_allocatable_irn(node))
47 obstack_ptr_grow(env, node);
51 static void check_result(ir_graph *irg) {
53 ir_node **nodes, *n1, *n2;
57 irg_walk_graph(irg, node_collector, NULL, &ob);
58 obstack_ptr_grow(&ob, NULL);
59 nodes = (ir_node **) obstack_finish(&ob);
60 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i])
61 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o])
62 if (phi_ops_interfere(n1, n2) && get_irn_color(n1) == get_irn_color(n2)) {
63 DBG((dbgphi, 1, "Ouch!\n %n in %n\n %n in %n\n", n1, get_nodes_block(n1), n2, get_nodes_block(n2)));
64 assert(0 && "Interfering values have the same color!");
67 obstack_free(&ob, NULL);
71 /* TODO: how to count copies in case of phi swapping */
72 static void count_copies(pset *all_phi_nodes, int *copies, int *inevitable) {
73 int i, max, phi_color;
76 for (phi = pset_first(all_phi_nodes); phi; phi = pset_next(all_phi_nodes)) {
77 phi_color = get_irn_color(phi);
78 for (i = 0, max = get_irn_arity(phi); i < max; ++i) {
79 ir_node *arg = get_irn_n(phi, i);
80 if (phi_color != get_irn_color(arg))
82 if (phi_ops_interfere(phi, arg))
89 void be_phi_opt(ir_graph* irg) {
90 pset *all_phi_nodes, *all_phi_classes;
91 int before, after, inevitable;
93 DBG((dbgphi, 1, "\n\n=======================> IRG: %s\n\n", get_entity_name(get_irg_entity(irg))));
96 /* get all phi nodes */
97 DBG((dbgphi, 1, "-----------------------> Collecting phi nodes <-----------------------\n"));
98 all_phi_nodes = pset_new_ptr(64);
99 irg_walk_graph(irg, phi_node_walker, NULL, all_phi_nodes);
102 /* get all phi congruence classes */
103 DBG((dbgphi, 1, "-----------------------> Collecting phi classes <---------------------\n"));
104 all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
107 /* do some statistics */
108 if (DO_PHI_STATISTICS) {
109 DBG((dbgphi, 1, "-----------------------> Collecting phi stats <-----------------------\n"));
111 phi_stat_collect(irg, all_phi_nodes, all_phi_classes);
112 if (DUMP_IRG_PHI_STAT) {
114 snprintf(buf, sizeof(buf), "%s.phistat", get_entity_name(get_irg_entity(irg)));
115 /*phi_stat_dump(buf);*/
116 phi_stat_dump_pretty(buf);
118 if (DUMP_DIR_PHI_STAT)
119 phi_stat_update(PHI_STAT_FILE);
120 if (DUMP_ALL_PHI_STAT)
121 phi_stat_update(getenv(ENV_PHI_STAT));
125 /* try to coalesce the colors of each phi class */
126 DBG((dbgphi, 1, "-----------------------> Coalescing <---------------------------------\n"));
130 if (COUNT_COPY_SAVINGS) {
132 count_copies(all_phi_nodes, &before, &inevitable);
139 dump_allocated_irg(irg, "-before");
141 be_phi_coalesce(all_phi_classes);
144 dump_allocated_irg(irg, "-opt");
149 if (COUNT_COPY_SAVINGS) {
152 count_copies(all_phi_nodes, &after, &inevitable);
153 DBG((dbgphi, 1, "Irg: %s. Copies form %d to %d. %d phi-interfers\n", get_entity_name(get_irg_entity(irg)), before, after, inevitable));
155 free_dom_and_peace(irg);
159 void be_phi_opt_init(void) {
160 dbgphi = firm_dbg_register("ir.be.phiopt");
161 firm_dbg_set_mask(dbgphi, DEBUG_LVL);