3 * More experiments on coalescing.
4 * @author Sebastian Hack
12 #include <libcore/lc_opts.h>
13 #include <libcore/lc_opts_enum.h>
23 #include "bitfiddle.h"
26 #include "irphase_t.h"
27 #include "irgraph_t.h"
35 #include "becopyopt.h"
36 #include "becopyopt_t.h"
37 #include "bechordal_t.h"
38 #include "bejavacoal.h"
45 #define DUMP_ALL 2 * DUMP_AFTER - 1
47 static unsigned dump_flags = 0;
48 static int dbg_level = 0;
50 static const lc_opt_enum_mask_items_t dump_items[] = {
51 { "before", DUMP_BEFORE },
52 { "after", DUMP_AFTER },
57 static lc_opt_enum_mask_var_t dump_var = {
58 &dump_flags, dump_items
61 static const lc_opt_table_entry_t options[] = {
62 LC_OPT_ENT_ENUM_MASK("dump", "dump ifg cloud", &dump_var),
63 LC_OPT_ENT_INT ("dbg", "debug level for the Java coalescer", &dbg_level),
67 void be_init_copyheur3(void)
69 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
70 lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
71 lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
72 lc_opt_entry_t *co3_grp = lc_opt_get_grp(chordal_grp, "co3");
74 lc_opt_add_table(co3_grp, options);
77 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyheur3);
79 static void set_admissible_regs(be_java_coal_t *coal, copy_opt_t *co, ir_node *irn, int t_idx, int *col_map)
82 arch_register_req_t req;
83 unsigned n_regs = co->cls->n_regs;
85 // ir_printf("%+F\n", irn);
86 arch_get_register_req(co->aenv, &req, irn, BE_OUT_POS(0));
87 if(arch_register_req_is(&req, limited)) {
88 bitset_t *adm = bitset_alloca(n_regs);
89 req.limited(req.limited_env, adm);
90 for(i = 0; i < n_regs; ++i)
91 if(!bitset_is_set(adm, i) && col_map[i] >= 0) {
92 // printf("\tforbidding color: %d\n", i);
93 be_java_coal_forbid_color(coal, t_idx, col_map[i]);
98 int co_solve_heuristic_java(copy_opt_t *co)
100 be_ifg_t *ifg = co->cenv->ifg;
101 void *nodes_it = be_ifg_nodes_iter_alloca(ifg);
102 void *neigh_it = be_ifg_neighbours_iter_alloca(ifg);
103 bitset_t *nodes = bitset_malloc(get_irg_last_idx(co->irg));
104 unsigned n_regs = co->cenv->cls->n_regs;
107 unsigned i, j, curr_idx;
114 be_java_coal_t *coal;
117 col_map = alloca(n_regs * sizeof(col_map[0]));
118 inv_col_map = alloca(n_regs * sizeof(inv_col_map[0]));
120 memset(inv_col_map, -1, sizeof(inv_col_map[0]) * n_regs);
122 for(i = 0, j = 0; i < n_regs; ++i) {
123 const arch_register_t *reg = &co->cls->regs[i];
125 if(!arch_register_type_is(reg, ignore)) {
132 node_map = malloc((get_irg_last_idx(co->irg) + 1) * sizeof(node_map[0]));
133 inv_node_map = malloc((get_irg_last_idx(co->irg) + 1) * sizeof(inv_node_map[0]));
136 be_ifg_foreach_node(ifg, nodes_it, n) {
137 if(!arch_irn_is(co->aenv, n, ignore)) {
138 int idx = get_irn_idx(n);
139 bitset_set(nodes, idx);
140 node_map[idx] = curr_idx;
141 inv_node_map[curr_idx] = idx;
153 coal = be_java_coal_init("test", curr_idx, j, dbg_level);
155 /* Check, if all neighbours are indeed connected to the node. */
156 be_ifg_foreach_node(ifg, nodes_it, n) {
157 int n_idx = get_irn_idx(n);
158 int t_idx = node_map[n_idx];
160 if(bitset_is_set(nodes, n_idx)) {
161 affinity_node_t *an = get_affinity_info(co, n);
163 ir_snprintf(dbg, sizeof(dbg), "%+F", n);
164 be_java_coal_set_debug(coal, t_idx, dbg);
165 be_java_coal_set_color(coal, t_idx, col_map[arch_get_irn_register(co->aenv, n)->index]);
166 set_admissible_regs(coal, co, n, t_idx, col_map);
167 be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
168 int m_idx = get_irn_idx(m);
169 int s_idx = node_map[m_idx];
171 if(n_idx < m_idx && bitset_is_set(nodes, m_idx)) {
172 be_java_coal_add_int_edge(coal, s_idx, t_idx);
178 co_gs_foreach_neighb(an, neigh) {
179 int m_idx = get_irn_idx(neigh->irn);
180 int s_idx = node_map[m_idx];
182 if(n_idx < m_idx && bitset_is_set(nodes, m_idx)) {
183 be_java_coal_add_aff_edge(coal, s_idx, t_idx, neigh->costs);
190 if(dump_flags & DUMP_BEFORE) {
192 ir_snprintf(fn, sizeof(fn), "%F-%s-before.dot", co->cenv->irg, co->cenv->cls->name);
193 be_java_coal_dump(coal, fn);
196 be_java_coal_coalesce(coal);
198 be_ifg_foreach_node(ifg, nodes_it, n) {
199 unsigned idx = get_irn_idx(n);
200 if(bitset_is_set(nodes, idx)) {
201 unsigned t_idx = node_map[idx];
202 unsigned col = inv_col_map[be_java_coal_get_color(coal, t_idx)];
203 const arch_register_t *reg;
205 assert(col < n_regs);
206 reg = &co->cls->regs[col];
207 arch_set_irn_register(co->aenv, n, reg);
211 if(dump_flags & DUMP_AFTER) {
213 ir_snprintf(fn, sizeof(fn), "%F-%s-after.dot", co->cenv->irg, co->cenv->cls->name);
214 be_java_coal_dump(coal, fn);
217 be_java_coal_destroy(coal);