23 #include "phiclass_t.h"
24 #include "bephicoal_t.h"
29 #define CHECK_RESULTS 1
30 #define COUNT_COPY_SAVINGS 1
31 #define DUMP_OPT_DIFF 0
33 #define DO_PHI_STATISTICS 0
34 #define DUMP_IRG_PHI_STAT 1
35 #define DUMP_DIR_PHI_STAT 1
36 #define DUMP_ALL_PHI_STAT 1
38 #define PHI_STAT_FILE "dir.phistat"
39 #define ENV_PHI_STAT "PHI_STAT"
41 static firm_dbg_module_t *dbgphi = NULL;
43 static void phi_node_walker(ir_node *node, void *env) {
44 if (is_Phi(node) && mode_is_datab(get_irn_mode(node)))
45 pset_insert_ptr((pset *)env, node);
49 static void node_collector(ir_node *node, void *env) {
50 struct obstack *obst = env;
51 if (!is_Block(node) && is_allocatable_irn(node))
52 obstack_ptr_grow(obst, node);
56 static void check_result(ir_graph *irg) {
58 ir_node **nodes, *n1, *n2;
62 irg_walk_graph(irg, node_collector, NULL, &ob);
63 obstack_ptr_grow(&ob, NULL);
64 nodes = (ir_node **) obstack_finish(&ob);
65 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
66 assert(! (is_allocatable_irn(n1) && get_irn_color(n1) == NO_COLOR));
67 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o])
68 if (phi_ops_interfere(n1, n2) && get_irn_color(n1) == get_irn_color(n2)) {
69 DBG((dbgphi, 1, "Ouch!\n %n in %n\n %n in %n\n", n1, get_nodes_block(n1), n2, get_nodes_block(n2)));
70 assert(0 && "Interfering values have the same color!");
74 obstack_free(&ob, NULL);
78 /* TODO: how to count copies in case of phi swapping */
79 static void count_copies(pset *all_phi_nodes, int *copies, int *inevitable) {
80 int i, max, phi_color;
83 for (phi = pset_first(all_phi_nodes); phi; phi = pset_next(all_phi_nodes)) {
84 phi_color = get_irn_color(phi);
85 for (i = 0, max = get_irn_arity(phi); i < max; ++i) {
86 ir_node *arg = get_irn_n(phi, i);
87 if (phi_color != get_irn_color(arg))
89 if (phi_ops_interfere(phi, arg))
96 void be_phi_opt(ir_graph* irg) {
97 pset *all_phi_nodes, *all_phi_classes;
98 int before, after, inevitable;
100 DBG((dbgphi, 1, "\n\n=======================> IRG: %s\n\n", get_entity_name(get_irg_entity(irg))));
103 /* get all phi nodes */
104 DBG((dbgphi, 1, "-----------------------> Collecting phi nodes <-----------------------\n"));
105 all_phi_nodes = pset_new_ptr(64);
106 irg_walk_graph(irg, phi_node_walker, NULL, all_phi_nodes);
109 /* get all phi congruence classes */
110 DBG((dbgphi, 1, "-----------------------> Collecting phi classes <---------------------\n"));
111 all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
114 /* do some statistics */
115 if (DO_PHI_STATISTICS) {
116 DBG((dbgphi, 1, "-----------------------> Collecting phi stats <-----------------------\n"));
118 phi_stat_collect(irg, all_phi_nodes, all_phi_classes);
119 if (DUMP_IRG_PHI_STAT) {
121 snprintf(buf, sizeof(buf), "%s.phistat", get_entity_name(get_irg_entity(irg)));
122 /*phi_stat_dump(buf);*/
123 phi_stat_dump_pretty(buf);
125 if (DUMP_DIR_PHI_STAT)
126 phi_stat_update(PHI_STAT_FILE);
127 if (DUMP_ALL_PHI_STAT)
128 phi_stat_update(getenv(ENV_PHI_STAT));
132 /* try to coalesce the colors of each phi class */
133 DBG((dbgphi, 1, "-----------------------> Coalescing <---------------------------------\n"));
137 if (COUNT_COPY_SAVINGS) {
139 count_copies(all_phi_nodes, &before, &inevitable);
146 dump_allocated_irg(irg, "-before");
148 be_phi_coalesce(all_phi_classes);
151 dump_allocated_irg(irg, "-opt");
156 if (COUNT_COPY_SAVINGS) {
159 count_copies(all_phi_nodes, &after, &inevitable);
160 DBG((dbgphi, 0, "Irg: %s. Copies form %d to %d. %d phi-interferers\n", get_entity_name(get_irg_entity(irg)), before, after, inevitable));
162 free_dom_and_peace(irg);
166 void be_phi_opt_init(void) {
167 dbgphi = firm_dbg_register("ir.be.phiopt");
168 firm_dbg_set_mask(dbgphi, DEBUG_LVL);