4 * Created on: Aug 28, 2009
11 #include "becopypbqp.h"
17 #include "html_dumper.h"
18 #include "heuristical_co.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)
67 pqueue_t *queue = new_pqueue();
68 pqueue_t *restrictedNodesQueue = new_pqueue();
69 pbqp_co_t *pbqp_co = data;
72 sched_foreach(block, irn) {
73 if (get_irn_mode(irn) == mode_T) {
74 const ir_edge_t *edge;
76 foreach_out_edge(irn, edge) {
77 ir_node *proj = get_edge_src_irn(edge);
78 if (!arch_irn_consider_in_reg_alloc(pbqp_co->cls, proj))
81 // insert proj node into priority queue (descending by their degree in ifg)
82 if (bitset_is_set(pbqp_co->restricted_nodes, get_irn_idx(proj))) {
83 pqueue_put(restrictedNodesQueue,proj, be_ifg_degree(pbqp_co->ifg,proj));
86 pqueue_put(queue,proj, be_ifg_degree(pbqp_co->ifg,proj));
90 /* first insert all restricted nodes */
91 while (!pqueue_empty(restrictedNodesQueue)) {
92 plist_insert_back(pbqp_co->rpeo, get_node(pbqp_co->pbqp, get_irn_idx(pqueue_pop_front(restrictedNodesQueue))));
95 /* insert proj nodes into reverse perfect elimination order (descending by their degree in ifg) */
96 while (!pqueue_empty(queue)) {
97 plist_insert_back(pbqp_co->rpeo, get_node(pbqp_co->pbqp, get_irn_idx(pqueue_pop_front(queue))));
101 if (!arch_irn_consider_in_reg_alloc(pbqp_co->cls, irn))
104 /* insert pbqp node into reverse peo */
105 plist_insert_back(pbqp_co->rpeo, get_node(pbqp_co->pbqp, get_irn_idx(irn)));
109 /* free priority queues */
111 del_pqueue(restrictedNodesQueue);
114 static int co_solve_heuristic_pbqp(copy_opt_t *co)
116 void *nodes_it = be_ifg_nodes_iter_alloca(co->cenv->ifg);
117 void *neigh_it = be_ifg_neighbours_iter_alloca(co->cenv->ifg);
118 unsigned number_registers = co->cls->n_regs;
119 unsigned number_nodes = get_irg_last_idx(co->irg);
120 ir_timer_t *t_ra_copymin_pbqp_create = ir_timer_new();
121 ir_timer_t *t_ra_copymin_pbqp_solve = ir_timer_new();
123 ir_node *if_neighb_node;
128 printf("==>> START PBQP TIMING on IRG %s (%s) <<==\n", get_entity_name(get_irg_entity(co->irg)), arch_register_class_name(co->cls));
132 ir_timer_reset_and_start(t_ra_copymin_pbqp_create);
134 /* create and initialize data structure for pbqp copy minimization optimization */
135 pbqp_co.cls = co->cls;
136 pbqp_co.rpeo = plist_new();
137 pbqp_co.pbqp = alloc_pbqp(number_nodes);
138 pbqp_co.ignore_reg = bitset_malloc(number_registers);
139 pbqp_co.restricted_nodes = bitset_malloc(number_nodes);
140 pbqp_co.ifg = co->cenv->ifg;
142 /* no node is restricted at the beginning */
143 bitset_clear_all(pbqp_co.restricted_nodes);
145 /* get ignored registers */
146 be_put_ignore_regs(co->cenv->birg, co->cls, pbqp_co.ignore_reg);
148 /* add costs vector to nodes */
149 be_ifg_foreach_node(co->cenv->ifg, nodes_it, ifg_node) {
150 int cntFreeChoosableRegs = 0;
152 /* create costs vector */
153 struct vector *costs_vector = vector_alloc(pbqp_co.pbqp, number_registers);
157 for (cnt = 0; cnt < costs_vector->len; cnt++) {
158 if (bitset_is_set(pbqp_co.ignore_reg,cnt)) {
159 vector_set(costs_vector, cnt, INF_COSTS);
162 if (!arch_reg_out_is_allocatable(ifg_node, arch_register_for_index(co->cls, cnt)))
164 vector_set(costs_vector, cnt, INF_COSTS);
167 vector_set(costs_vector, cnt, 0);
168 cntFreeChoosableRegs++;
172 #if KAPS_ENABLE_VECTOR_NAMES
173 /* add description */
174 vector_set_description(costs_vector, cnt, arch_register_for_index(co->cls, cnt)->name);
178 /* add costs vector to node */
179 add_node_costs(pbqp_co.pbqp, get_irn_idx(ifg_node), costs_vector);
181 if (cntFreeChoosableRegs <= 4) {
182 /* node is restricted */
183 bitset_set(pbqp_co.restricted_nodes, get_irn_idx(ifg_node));
187 /* create costs matrix for interference edges */
188 struct pbqp_matrix *ife_matrix = pbqp_matrix_alloc(pbqp_co.pbqp, number_registers, number_registers);
190 for (row = 0; row < number_registers; row++) {
191 pbqp_matrix_set(ife_matrix, row, row, INF_COSTS);
194 /* create costs matrix for affinity edges */
195 struct pbqp_matrix *afe_matrix = pbqp_matrix_alloc(pbqp_co.pbqp, number_registers, number_registers);
197 for (row = 0; row < number_registers; row++) {
198 for (col = 0; col < number_registers; col++) {
200 pbqp_matrix_set(afe_matrix, row, col, 0);
203 pbqp_matrix_set(afe_matrix, row, col, 2);
208 /* add pbqp edges and cost matrix */
209 be_ifg_foreach_node(co->cenv->ifg, nodes_it, ifg_node) {
210 /* add costs matrix between nodes (interference edge) */
211 be_ifg_foreach_neighbour(co->cenv->ifg, neigh_it, ifg_node, if_neighb_node) {
212 if (get_edge(pbqp_co.pbqp,get_irn_idx(ifg_node), get_irn_idx(if_neighb_node)) == NULL) {
214 struct pbqp_matrix *matrix = pbqp_matrix_copy(pbqp_co.pbqp, ife_matrix);
216 /* add costs matrix to interference edge */
217 add_edge_costs(pbqp_co.pbqp, get_irn_idx(ifg_node), get_irn_idx(if_neighb_node) , matrix);
222 /* add costs matrix between nodes (affinity edge) */
223 affinity_node_t *aff_node = get_affinity_info(co, ifg_node);
224 neighb_t *aff_neighb_node;
225 if (aff_node != NULL) {
226 co_gs_foreach_neighb(aff_node, aff_neighb_node) {
227 /* ignore Unknowns */
228 if (get_node(pbqp_co.pbqp, get_irn_idx(aff_neighb_node->irn)) == NULL)
231 if (get_edge(pbqp_co.pbqp, get_irn_idx(aff_node->irn), get_irn_idx(aff_neighb_node->irn)) == NULL) {
233 struct pbqp_matrix *matrix = pbqp_matrix_copy(pbqp_co.pbqp, afe_matrix);
235 /* add costs matrix to affinity edge */
236 add_edge_costs(pbqp_co.pbqp, get_irn_idx(aff_node->irn), get_irn_idx(aff_neighb_node->irn) , matrix);
242 /* create reverse perfect elimination order */
243 assure_doms(co->irg);
244 dom_tree_walk_irg(co->irg, insert_into_reverse_peo, NULL, &pbqp_co);
247 ir_timer_stop(t_ra_copymin_pbqp_create);
250 // dump graph before solving pbqp
251 FILE *file = my_open(co->cenv, "", "-pbqp_copymin.html");
252 set_dumpfile(pbqp_co.pbqp, file);
256 ir_timer_reset_and_start(t_ra_copymin_pbqp_solve);
258 /* solve pbqp problem using a reverse perfect elimination order */
259 solve_pbqp_heuristical_co(pbqp_co.pbqp, pbqp_co.rpeo);
260 num solution = get_solution(pbqp_co.pbqp);
263 ir_timer_stop(t_ra_copymin_pbqp_solve);
266 printf("==>> PBQP STATISTIC on IRG %s (%s) <<==\n", get_entity_name(get_irg_entity(co->irg)), arch_register_class_name(co->cls));
267 printf("Number of Nodes: %d\n", number_nodes);
268 printf("Number of independent edges : %d\n", pbqp_co.pbqp->num_edges);
269 printf("Number of trivial solved nodes: %d\n", pbqp_co.pbqp->num_r0);
270 printf("Number of R1 reductions : %d\n", pbqp_co.pbqp->num_r1);
271 printf("Number of R2 reductions : %d\n", pbqp_co.pbqp->num_r2);
272 printf("Number of RN reductions : %d\n", pbqp_co.pbqp->num_rn);
276 printf("%-20s: %8.3lf msec\n", "copy minimization pbqp create",
277 (double)ir_timer_elapsed_usec(t_ra_copymin_pbqp_create) / 1000.0);
278 printf("%-20s: %8.3lf msec\n" , "copy minimization pbqp solve",
279 (double)ir_timer_elapsed_usec(t_ra_copymin_pbqp_solve) / 1000.0);
280 printf("==>> END PBQP TIMING on IRG %s (%s) <<==\n", get_entity_name(get_irg_entity(co->irg)), arch_register_class_name(co->cls));
283 assert(solution != INF_COSTS && "No PBQP solution found");
286 be_ifg_foreach_node(co->cenv->ifg, nodes_it, ifg_node) {
287 num index = get_node_solution(pbqp_co.pbqp, get_irn_idx(ifg_node));
288 const arch_register_t *reg = arch_register_for_index(co->cls, index);
289 arch_set_irn_register(ifg_node, reg);
292 /* free allocated memory */
296 bitset_free(pbqp_co.ignore_reg);
297 bitset_free(pbqp_co.restricted_nodes);
298 plist_free(pbqp_co.rpeo);
299 free_pbqp(pbqp_co.pbqp);
304 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copypbqp);
305 void be_init_copypbqp(void)
307 static co_algo_info copyheur = {
308 co_solve_heuristic_pbqp, 0
311 be_register_copyopt("pbqp", ©heur);