4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
22 #endif /* __linux__ */
29 #include <libcore/lc_opts.h>
30 #include <libcore/lc_opts_enum.h>
31 #include <libcore/lc_timing.h>
32 #endif /* WITH_LIBCORE */
41 #include "beifg_impl.h"
43 #include "irphase_t.h"
44 #include "bechordal.h"
46 #include "becopystat.h"
47 #include "becopyopt.h"
49 /** Defines values for the ifg performance test */
50 #define BE_CH_PERFORMANCETEST_MIN_NODES (50)
51 #define BE_CH_PERFORMANCETEST_COUNT (500)
53 typedef struct _coloring_t coloring_t;
57 const arch_env_t *arch_env;
61 size_t (be_ifg_nodes_iter_size)(const void *self)
63 const be_ifg_t *ifg = self;
64 return ifg->impl->nodes_iter_size;
67 size_t (be_ifg_neighbours_iter_size)(const void *self)
69 const be_ifg_t *ifg = self;
70 return ifg->impl->neighbours_iter_size;
73 size_t (be_ifg_cliques_iter_size)(const void *self)
75 const be_ifg_t *ifg = self;
76 return ifg->impl->cliques_iter_size;
79 static void *regs_irn_data_init(phase_t *ph, ir_node *irn, void *data)
81 coloring_t *coloring = (coloring_t *) ph;
82 return (void *) arch_get_irn_register(coloring->arch_env, irn);
85 coloring_t *coloring_init(coloring_t *c, ir_graph *irg, const arch_env_t *aenv)
87 phase_init(&c->ph, "regs_map", irg, PHASE_DEFAULT_GROWTH, regs_irn_data_init);
93 static void get_irn_color(ir_node *irn, void *c)
95 coloring_t *coloring = c;
96 phase_get_or_set_irn_data(&coloring->ph, irn);
99 static void restore_irn_color(ir_node *irn, void *c)
101 coloring_t *coloring = c;
102 const arch_register_t *reg = phase_get_irn_data(&coloring->ph, irn);
104 arch_set_irn_register(coloring->arch_env, irn, reg);
107 void coloring_save(coloring_t *c)
109 irg_walk_graph(c->irg, NULL, get_irn_color, c);
112 void coloring_restore(coloring_t *c)
114 irg_walk_graph(c->irg, NULL, restore_irn_color, c);
117 void (be_ifg_free)(void *self)
119 be_ifg_t *ifg = self;
120 ifg->impl->free(self);
123 int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b)
125 const be_ifg_t *ifg = self;
126 return ifg->impl->connected(self, a, b);
129 ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn)
131 const be_ifg_t *ifg = self;
132 return ifg->impl->neighbours_begin(self, iter, irn);
135 ir_node *(be_ifg_neighbours_next)(const void *self, void *iter)
137 const be_ifg_t *ifg = self;
138 return ifg->impl->neighbours_next(self, iter);
141 void (be_ifg_neighbours_break)(const void *self, void *iter)
143 const be_ifg_t *ifg = self;
144 ifg->impl->neighbours_break(self, iter);
147 ir_node *(be_ifg_nodes_begin)(const void *self, void *iter)
149 const be_ifg_t *ifg = self;
150 return ifg->impl->nodes_begin(self, iter);
153 ir_node *(be_ifg_nodes_next)(const void *self, void *iter)
155 const be_ifg_t *ifg = self;
156 return ifg->impl->nodes_next(self, iter);
159 void (be_ifg_nodes_break)(const void *self, void *iter)
161 const be_ifg_t *ifg = self;
162 ifg->impl->nodes_break(self, iter);
165 int (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf)
167 const be_ifg_t *ifg = self;
168 return ifg->impl->cliques_begin(self, iter, buf);
171 int (be_ifg_cliques_next)(const void *self, void *iter)
173 const be_ifg_t *ifg = self;
174 return ifg->impl->cliques_next(self, iter);
177 void (be_ifg_cliques_break)(const void *self, void *iter)
179 const be_ifg_t *ifg = self;
180 ifg->impl->cliques_break(self, iter);
183 int (be_ifg_degree)(const void *self, const ir_node *irn)
185 const be_ifg_t *ifg = self;
186 return ifg->impl->degree(self, irn);
190 int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
192 int degree = be_ifg_degree(ifg, irn);
193 void *iter = be_ifg_neighbours_iter_alloca(ifg);
195 ir_node **neighbours = xmalloc(degree * sizeof(neighbours[0]));
201 be_ifg_foreach_neighbour(ifg, iter, irn, curr)
202 neighbours[i++] = curr;
204 for(i = 0; i < degree; ++i) {
205 for(j = 0; j < i; ++j)
206 if(!be_ifg_connected(ifg, neighbours[i], neighbours[j])) {
217 void be_ifg_check(const be_ifg_t *ifg)
219 void *iter1 = be_ifg_nodes_iter_alloca(ifg);
220 void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
224 int neighbours_count = 0;
227 /* count all nodes */
228 ir_printf("\n\nFound the following nodes in the graph %+F:\n\n", current_ir_graph);
229 be_ifg_foreach_node(ifg,iter1,n)
232 degree = be_ifg_degree(ifg, n);
233 ir_printf("%d. %+F with degree: %d\n", node_count, n, degree);
236 ir_printf("\n\nNumber of nodes: %d\n\n", node_count);
238 /* Check, if all neighbours are indeed connected to the node. */
239 be_ifg_foreach_node(ifg, iter1, n)
241 ir_printf("\n%+F; ", n);
242 be_ifg_foreach_neighbour(ifg, iter2, n, m)
244 ir_printf("%+F; ", m);
246 if(!be_ifg_connected(ifg, n, m))
247 ir_fprintf(stderr, "%+F is a neighbour of %+F but they are not connected!\n", n, m);
250 ir_printf("\n\nFound %d nodes in the 'check neighbour section'\n", neighbours_count);
253 int be_ifg_check_get_node_count(const be_ifg_t *ifg)
255 void *iter = be_ifg_nodes_iter_alloca(ifg);
259 be_ifg_foreach_node(ifg, iter, n)
267 static int be_ifg_check_cmp_nodes(const void *a, const void *b)
269 const ir_node *node_a = *(ir_node **)a;
270 const ir_node *node_b = *(ir_node **)b;
272 int nr_a = node_a->node_nr;
273 int nr_b = node_b->node_nr;
275 return QSORT_CMP(nr_a, nr_b);
278 void be_ifg_check_sorted(const be_ifg_t *ifg)
280 void *iter1 = be_ifg_nodes_iter_alloca(ifg);
281 void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
284 const int node_count = be_ifg_check_get_node_count(ifg);
285 int neighbours_count = 0;
288 ir_node **all_nodes = xmalloc(node_count * sizeof(all_nodes[0]));
290 be_ifg_foreach_node(ifg, iter1, n)
292 if(!node_is_in_irgs_storage(ifg->env->irg, n))
294 printf ("+%F is in ifg but not in the current irg!",n);
295 assert (node_is_in_irgs_storage(ifg->env->irg, n));
302 qsort(all_nodes, node_count, sizeof(all_nodes[0]), be_ifg_check_cmp_nodes);
304 for (i = 0; i < node_count; i++)
306 ir_node **neighbours = xmalloc(node_count * sizeof(neighbours[0]));
311 degree = be_ifg_degree(ifg, all_nodes[i]);
313 be_ifg_foreach_neighbour(ifg, iter2, all_nodes[i], m)
319 qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes);
321 ir_printf("%d. %+F's neighbours(%d): ", i+1, all_nodes[i], degree);
323 for(k = 0; k < j; k++)
325 ir_printf("%+F, ", neighbours[k]);
337 void be_ifg_check_performance(be_chordal_env_t *chordal_env)
339 int tests = BE_CH_PERFORMANCETEST_COUNT;
347 be_ifg_t *old_if = chordal_env->ifg;
349 lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg");
350 unsigned long elapsed_usec = 0;
352 if ((int) get_irg_estimated_node_cnt >= BE_CH_PERFORMANCETEST_MIN_NODES)
354 coloring_init(&coloring, chordal_env->irg, chordal_env->birg->main_env->arch_env);
355 coloring_save(&coloring);
357 lc_timer_reset(timer);
359 for (i = 0; i<tests; i++) /* performance test with std */
362 used_memory = lc_get_heap_used_bytes();
364 rt = lc_timer_enter_high_priority();
365 lc_timer_start(timer);
367 chordal_env->ifg = be_ifg_std_new(chordal_env);
369 lc_timer_stop(timer);
370 rt = lc_timer_leave_high_priority();
372 used_memory = lc_get_heap_used_bytes() - used_memory;
374 coloring_restore(&coloring);
377 co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
378 co_build_ou_structure(co);
379 co_build_graph_structure(co);
381 rt = lc_timer_enter_high_priority();
382 lc_timer_start(timer);
384 co_solve_heuristic_new(co);
386 lc_timer_stop(timer);
387 rt = lc_timer_leave_high_priority();
389 co_free_graph_structure(co);
390 co_free_ou_structure(co);
392 be_ifg_free(chordal_env->ifg);
396 elapsed_usec = lc_timer_elapsed_usec(timer);
397 /* calculating average */
398 elapsed_usec = elapsed_usec / tests;
400 ir_printf("\nstd:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
406 for (i = 0; i<tests; i++) /* performance test with clique */
408 used_memory = lc_get_heap_used_bytes();
410 rt = lc_timer_enter_high_priority();
411 lc_timer_start(timer);
413 chordal_env->ifg = be_ifg_clique_new(chordal_env);
415 lc_timer_stop(timer);
416 rt = lc_timer_leave_high_priority();
418 used_memory = lc_get_heap_used_bytes() - used_memory;
420 coloring_restore(&coloring);
423 co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
424 co_build_ou_structure(co);
425 co_build_graph_structure(co);
427 rt = lc_timer_enter_high_priority();
428 lc_timer_start(timer);
430 co_solve_heuristic_new(co);
432 lc_timer_stop(timer);
433 rt = lc_timer_leave_high_priority();
435 co_free_graph_structure(co);
436 co_free_ou_structure(co);
438 be_ifg_free(chordal_env->ifg);
442 elapsed_usec = lc_timer_elapsed_usec(timer);
443 /* calculating average */
444 elapsed_usec = elapsed_usec / tests;
446 ir_printf("\nclique:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
452 for (i = 0; i<tests; i++) /* performance test with list */
454 used_memory = lc_get_heap_used_bytes();
456 rt = lc_timer_enter_high_priority();
457 lc_timer_start(timer);
459 chordal_env->ifg = be_ifg_list_new(chordal_env);
461 lc_timer_stop(timer);
462 rt = lc_timer_leave_high_priority();
464 used_memory = lc_get_heap_used_bytes() - used_memory;
466 coloring_restore(&coloring);
469 co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
470 co_build_ou_structure(co);
471 co_build_graph_structure(co);
473 rt = lc_timer_enter_high_priority();
474 lc_timer_start(timer);
476 co_solve_heuristic_new(co);
478 lc_timer_stop(timer);
479 rt = lc_timer_leave_high_priority();
481 co_free_graph_structure(co);
482 co_free_ou_structure(co);
484 be_ifg_free(chordal_env->ifg);
488 elapsed_usec = lc_timer_elapsed_usec(timer);
489 /* calculating average */
490 elapsed_usec = elapsed_usec / tests;
492 ir_printf("\nlist:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
498 for (i = 0; i<tests; i++) /* performance test with pointer */
500 used_memory = lc_get_heap_used_bytes();
502 rt = lc_timer_enter_high_priority();
503 lc_timer_start(timer);
505 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
507 lc_timer_stop(timer);
508 rt = lc_timer_leave_high_priority();
510 used_memory = lc_get_heap_used_bytes() - used_memory;
512 coloring_restore(&coloring);
515 co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
516 co_build_ou_structure(co);
517 co_build_graph_structure(co);
519 rt = lc_timer_enter_high_priority();
520 lc_timer_start(timer);
522 co_solve_heuristic_new(co);
524 lc_timer_stop(timer);
525 rt = lc_timer_leave_high_priority();
527 co_free_graph_structure(co);
528 co_free_ou_structure(co);
530 be_ifg_free(chordal_env->ifg);
534 elapsed_usec = lc_timer_elapsed_usec(timer);
535 /* calculating average */
536 elapsed_usec = elapsed_usec / tests;
538 ir_printf("\npointer:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
545 chordal_env->ifg = old_if;
548 void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self)
550 void *nodes_it = be_ifg_nodes_iter_alloca(ifg);
551 void *neigh_it = be_ifg_neighbours_iter_alloca(ifg);
552 bitset_t *nodes = bitset_malloc(get_irg_last_idx(irg));
556 fprintf(file, "graph G {\n\tgraph [");
558 cb->graph_attr(file, self);
559 fprintf(file, "];\n");
562 cb->at_begin(file, self);
564 be_ifg_foreach_node(ifg, nodes_it, n) {
565 if(cb->is_dump_node && cb->is_dump_node(self, n)) {
566 int idx = get_irn_idx(n);
567 bitset_set(nodes, idx);
568 fprintf(file, "\tnode [");
570 cb->node_attr(file, self, n);
571 fprintf(file, "]; n%d;\n", idx);
575 /* Check, if all neighbours are indeed connected to the node. */
576 be_ifg_foreach_node(ifg, nodes_it, n) {
577 be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
578 int n_idx = get_irn_idx(n);
579 int m_idx = get_irn_idx(m);
581 if(n_idx < m_idx && bitset_is_set(nodes, n_idx) && bitset_is_set(nodes, m_idx)) {
582 fprintf(file, "\tn%d -- n%d [", n_idx, m_idx);
584 cb->edge_attr(file, self, n, m);
585 fprintf(file, "];\n");
591 cb->at_end(file, self);
593 fprintf(file, "}\n");