4 * Created on: Aug 28, 2009
11 #include "becopypbqp.h"
17 #include "html_dumper.h"
18 #include "heuristical.h"
19 #include "pbqp_node_t.h"
21 #include "becopyopt_t.h"
25 #include "irprintf_t.h"
40 static FILE *my_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
47 n = strlen(env->birg->main_env->cup_name);
48 tu_name = XMALLOCN(char, n + 1);
49 strcpy(tu_name, env->birg->main_env->cup_name);
50 for (i = 0; i < n; ++i)
51 if (tu_name[i] == '.')
54 ir_snprintf(buf, sizeof(buf), "%s%s_%F_%s%s", prefix, tu_name, env->irg, env->cls->name, suffix);
56 result = fopen(buf, "wt");
58 panic("Couldn't open '%s' for writing.", buf);
65 static void insert_into_reverse_peo(ir_node *block, void *data) {
66 pqueue_t *queue = new_pqueue();
67 pqueue_t *constatQueue = new_pqueue();
68 pbqp_co_t *pbqp_co = data;
71 sched_foreach(block, irn) {
74 if (get_irn_mode(irn) == mode_T) {
75 const ir_edge_t *edge;
77 foreach_out_edge(irn, edge) {
78 ir_node *proj = get_edge_src_irn(edge);
79 if (!arch_irn_consider_in_reg_alloc(pbqp_co->cls, proj))
82 // get related pbqp_node and insert into reverse peo
83 assert(node && "No corresponding PBQP-Node found!");
85 // insert proj node into priority queue (descending by their degree in ifg)
86 if(bitset_is_set(pbqp_co->restricted_nodes, get_irn_idx(proj))) {
87 pqueue_put(constatQueue,proj, be_ifg_degree(pbqp_co->ifg,proj));
90 pqueue_put(queue,proj, be_ifg_degree(pbqp_co->ifg,proj));
94 /* first insert all restricted nodes */
95 while(!pqueue_empty(constatQueue)) {
96 plist_insert_back(pbqp_co->rpeo, get_node(pbqp_co->pbqp, get_irn_idx(pqueue_pop_front(constatQueue))));
99 /* insert proj nodes into reverse perfect elimination order (descending by their degree in ifg) */
100 while(!pqueue_empty(queue)) {
101 plist_insert_back(pbqp_co->rpeo, get_node(pbqp_co->pbqp, get_irn_idx(pqueue_pop_front(queue))));
105 if (!arch_irn_consider_in_reg_alloc(pbqp_co->cls, irn))
108 /* get related pbqp_node and insert into reverse peo */
109 assert(node && "No corresponding PBQP-Node found!");
110 plist_insert_back(pbqp_co->rpeo, get_node(pbqp_co->pbqp, get_irn_idx(irn)));
114 /* free priority queues */
116 del_pqueue(constatQueue);
119 static int co_solve_heuristic_pbqp(copy_opt_t *co) {
120 void *nodes_it = be_ifg_nodes_iter_alloca(co->cenv->ifg);
121 void *neigh_it = be_ifg_neighbours_iter_alloca(co->cenv->ifg);
122 unsigned number_registers = co->cls->n_regs;
123 unsigned number_nodes = get_irg_last_idx(co->irg);
124 ir_timer_t *t_ra_copymin_pbqp_create = ir_timer_register("be_co_pbqp_create", "copy minimization pbqp create");
125 ir_timer_t *t_ra_copymin_pbqp_solve = ir_timer_register("be_co_pbqp_solve", "copy minimization pbqp solve");
127 ir_node *if_neighb_node;
131 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(co->irg)));
135 ir_timer_start(t_ra_copymin_pbqp_create);
137 /* create and initialize data structure for pbqp copy minimization optimization */
138 pbqp_co.cls = co->cls;
139 pbqp_co.rpeo = plist_new();;
140 pbqp_co.map = pmap_create_ex(number_nodes);
141 pbqp_co.pbqp = alloc_pbqp(number_nodes);
142 pbqp_co.ignore_reg = bitset_malloc(number_registers);
143 pbqp_co.restricted_nodes = bitset_malloc(number_nodes);
144 pbqp_co.ifg = co->cenv->ifg;
146 /* get ignored registers */
147 be_put_ignore_regs(co->cenv->birg, co->cls, pbqp_co.ignore_reg);
149 /* add costs vector to nodes */
150 be_ifg_foreach_node(co->cenv->ifg, nodes_it, ifg_node) {
151 int cntFreeChoosableRegs = 0;
153 /* create costs vector */
154 struct vector *costs_vector = vector_alloc(pbqp_co.pbqp, number_registers);
158 for(cnt = 0; cnt < costs_vector->len; cnt++) {
159 if (bitset_is_set(pbqp_co.ignore_reg,cnt)) {
160 vector_set(costs_vector, cnt, INF_COSTS);
163 if (!arch_reg_out_is_allocatable(ifg_node, arch_register_for_index(co->cls, cnt)))
165 vector_set(costs_vector, cnt, INF_COSTS);
168 vector_set(costs_vector, cnt, 0);
169 cntFreeChoosableRegs++;
173 #if KAPS_ENABLE_VECTOR_NAMES
174 /* add description */
175 vector_set_description(costs_vector, cnt, arch_register_for_index(co->cls, cnt)->name);
179 /* add costs vector to node */
180 add_node_costs(pbqp_co.pbqp, get_irn_idx(ifg_node), costs_vector);
182 /* insert ir_node and pbqp_node into map */
183 pmap_insert(pbqp_co.map, ifg_node, get_node(pbqp_co.pbqp, get_irn_idx(ifg_node)));
185 if(cntFreeChoosableRegs <= 4) {
186 /* node is restricted */
187 bitset_set(pbqp_co.restricted_nodes, get_irn_idx(ifg_node));
191 /* node is not restricted */
192 bitset_clear(pbqp_co.restricted_nodes, get_irn_idx(ifg_node));
197 /* add pbqp edges and cost matrix */
198 be_ifg_foreach_node(co->cenv->ifg, nodes_it, ifg_node) {
199 /* add costs matrix between nodes (interference edge) */
200 be_ifg_foreach_neighbour(co->cenv->ifg, neigh_it, ifg_node, if_neighb_node) {
201 if(get_edge(pbqp_co.pbqp,get_irn_idx(ifg_node), get_irn_idx(if_neighb_node)) == NULL) {
202 /* create costs matrix */
203 struct pbqp_matrix *matrix = pbqp_matrix_alloc(pbqp_co.pbqp, number_registers, number_registers);
207 for(row = 0; row < number_registers; row++) {
208 for(col = 0; col < number_registers; col++) {
210 pbqp_matrix_set(matrix, row, col, INF_COSTS);
213 pbqp_matrix_set(matrix, row, col, 0);
218 /* add costs matrix to interference edge */
219 add_edge_costs(pbqp_co.pbqp, get_irn_idx(ifg_node), get_irn_idx(if_neighb_node) , matrix);
223 /* add costs matrix between nodes (affinity edge) */
224 affinity_node_t *aff_node = get_affinity_info(co, ifg_node);
225 neighb_t *aff_neighb_node;
226 if(aff_node != NULL) {
227 co_gs_foreach_neighb(aff_node, aff_neighb_node) {
228 pmap_entry *ptr_pbqp_node = pmap_find(pbqp_co.map,aff_neighb_node->irn);
230 /* ignore Unknowns */
231 if(ptr_pbqp_node == NULL) {
235 if(get_edge(pbqp_co.pbqp, get_irn_idx(aff_node->irn), get_irn_idx(aff_neighb_node->irn)) == NULL) {
236 /* create costs matrix */
237 struct pbqp_matrix *matrix = pbqp_matrix_alloc(pbqp_co.pbqp, number_registers, number_registers);
241 for(row = 0; row < number_registers; row++) {
242 for(col = 0; col < number_registers; col++) {
244 pbqp_matrix_set(matrix, row, col, 0);
247 pbqp_matrix_set(matrix, row, col, 2);
252 /* add costs matrix to affinity edge */
253 add_edge_costs(pbqp_co.pbqp, get_irn_idx(aff_node->irn), get_irn_idx(aff_neighb_node->irn) , matrix);
259 /* create reverse perfect elimination order */
260 assure_doms(co->irg);
261 dom_tree_walk_irg(co->irg, insert_into_reverse_peo, NULL, &pbqp_co);
264 ir_timer_stop(t_ra_copymin_pbqp_create);
267 // dump graph before solving pbqp
268 FILE *file_before = my_open(co->cenv, "", "-before.html");
269 set_dumpfile(pbqp_co.pbqp, file_before);
270 pbqp_dump_input(pbqp_co.pbqp);
274 ir_timer_start(t_ra_copymin_pbqp_solve);
276 /* solve pbqp problem using a reverse perfect elimination order */
277 solve_pbqp_heuristical_co(pbqp_co.pbqp, pbqp_co.rpeo);
278 num solution = get_solution(pbqp_co.pbqp);
281 ir_timer_stop(t_ra_copymin_pbqp_solve);
284 printf("Number of independent edges : %d\n", pbqp_co.pbqp->num_edges);
285 printf("Number of trivial solved nodes: %d\n", pbqp_co.pbqp->num_r0);
286 printf("Number of R1 reductions : %d\n", pbqp_co.pbqp->num_r1);
287 printf("Number of R2 reductions : %d\n", pbqp_co.pbqp->num_r2);
288 printf("Number of RN reductions : %d\n", pbqp_co.pbqp->num_rn);
291 assert(solution != INF_COSTS && "No PBQP solution found");
294 /* dump graph after solving pbqp */
295 FILE *file_after = my_open(co->cenv, "", "-after.html");
296 set_dumpfile(pbqp_co.pbqp, file_after);
297 pbqp_dump_input(pbqp_co.pbqp);
301 be_ifg_foreach_node(co->cenv->ifg, nodes_it, ifg_node) {
302 num index = get_node_solution(pbqp_co.pbqp, get_irn_idx(ifg_node));
303 const arch_register_t *reg = arch_register_for_index(co->cls, index);
304 arch_set_irn_register(ifg_node, reg);
307 /* free pbqp resources */
312 bitset_free(pbqp_co.ignore_reg);
313 bitset_free(pbqp_co.restricted_nodes);
314 pmap_destroy(pbqp_co.map);
315 plist_free(pbqp_co.rpeo);
316 free_pbqp(pbqp_co.pbqp);
321 void be_init_copypbqp(void)
323 static co_algo_info copyheur = {
324 co_solve_heuristic_pbqp, 0
327 be_register_copyopt("pbqp", ©heur);
330 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copypbqp);