+ }
+ }
+ ir_printf("\n\nFound %d nodes in the 'check neighbour section'\n", neighbours_count);
+}
+
+int be_ifg_check_get_node_count(const be_ifg_t *ifg)
+{
+ void *iter = be_ifg_nodes_iter_alloca(ifg);
+ int node_count = 0;
+ ir_node *n;
+
+ be_ifg_foreach_node(ifg, iter, n)
+ {
+ node_count++;
+ }
+
+ return node_count;
+}
+
+static int be_ifg_check_cmp_nodes(const void *a, const void *b)
+{
+ const ir_node *node_a = *(ir_node **)a;
+ const ir_node *node_b = *(ir_node **)b;
+
+ long nr_a = get_irn_idx(node_a);
+ long nr_b = get_irn_idx(node_b);
+
+ return QSORT_CMP(nr_a, nr_b);
+}
+
+void be_ifg_check_sorted(const be_ifg_t *ifg)
+{
+ void *iter1 = be_ifg_nodes_iter_alloca(ifg);
+ void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
+
+ ir_node *n, *m;
+ const int node_count = be_ifg_check_get_node_count(ifg);
+ int i = 0;
+
+ ir_node **all_nodes = XMALLOCN(ir_node*, node_count);
+
+ be_ifg_foreach_node(ifg, iter1, n)
+ {
+ if(!node_is_in_irgs_storage(ifg->env->irg, n))
+ {
+ ir_printf("+%F is in ifg but not in the current irg!", n);
+ assert (node_is_in_irgs_storage(ifg->env->irg, n));
+ }
+
+ all_nodes[i] = n;
+ i++;
+ }
+
+ qsort(all_nodes, node_count, sizeof(all_nodes[0]), be_ifg_check_cmp_nodes);
+
+ for (i = 0; i < node_count; i++)
+ {
+ ir_node **neighbours = XMALLOCN(ir_node*, node_count);
+ int j = 0;
+ int k = 0;
+ int degree = 0;
+
+ degree = be_ifg_degree(ifg, all_nodes[i]);
+
+ be_ifg_foreach_neighbour(ifg, iter2, all_nodes[i], m)
+ {
+ neighbours[j] = m;
+ j++;
+ }
+
+ qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes);
+
+ ir_printf("%d. %+F's neighbours(%d): ", i+1, all_nodes[i], degree);
+
+ for(k = 0; k < j; k++)
+ {
+ ir_printf("%+F, ", neighbours[k]);
+ }
+
+ ir_printf("\n");
+
+ free(neighbours);
+ }
+
+ free(all_nodes);
+
+}
+
+void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f)
+{
+ void *iter1 = be_ifg_nodes_iter_alloca(ifg);
+ void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
+
+ ir_node *n, *m;
+ const int node_count = be_ifg_check_get_node_count(ifg);
+ int i = 0;
+
+ ir_node **all_nodes = XMALLOCN(ir_node*, node_count);
+
+ be_ifg_foreach_node(ifg, iter1, n)
+ {
+ if(!node_is_in_irgs_storage(ifg->env->irg, n))
+ {
+ ir_fprintf (f,"+%F is in ifg but not in the current irg!",n);
+ assert (node_is_in_irgs_storage(ifg->env->irg, n));
+ }
+
+ all_nodes[i] = n;
+ i++;
+ }
+
+ qsort(all_nodes, node_count, sizeof(all_nodes[0]), be_ifg_check_cmp_nodes);
+
+ for (i = 0; i < node_count; i++)
+ {
+ ir_node **neighbours = XMALLOCN(ir_node*, node_count);
+ int j = 0;
+ int k = 0;
+ int degree = 0;
+
+ degree = be_ifg_degree(ifg, all_nodes[i]);
+
+ be_ifg_foreach_neighbour(ifg, iter2, all_nodes[i], m)
+ {
+ neighbours[j] = m;
+ j++;
+ }
+
+ qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes);
+
+ ir_fprintf (f,"%d. %+F's neighbours(%d): ", i+1, all_nodes[i], degree);
+
+ for(k = 0; k < j; k++)
+ {
+ ir_fprintf (f,"%+F, ", neighbours[k]);
+ }
+
+ ir_fprintf (f,"\n");
+
+ free(neighbours);
+ }
+
+ free(all_nodes);
+
+}
+
+void be_ifg_check_performance(be_chordal_env_t *chordal_env)
+{
+ int tests = BE_CH_PERFORMANCETEST_COUNT;
+ coloring_t coloring;
+
+ int used_memory;
+
+ int i = 0;
+ int rt;
+ copy_opt_t *co;
+ be_ifg_t *old_if = chordal_env->ifg;
+
+ ir_timer_t *timer = ir_timer_register("getTime","get Time of copy minimization using the ifg");
+ unsigned long elapsed_usec = 0;
+
+ if (get_irg_estimated_node_cnt(chordal_env->irg) >= BE_CH_PERFORMANCETEST_MIN_NODES)
+ {
+ coloring_init(&coloring, chordal_env->irg);
+ coloring_save(&coloring);
+
+ ir_timer_reset(timer);
+
+ for (i = 0; i<tests; i++) /* performance test with std */
+ {
+
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = be_ifg_std_new(chordal_env);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ used_memory = ir_get_heap_used_bytes() - used_memory;
+
+ coloring_restore(&coloring);
+
+ co = NULL;
+ co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
+ co_build_ou_structure(co);
+ co_build_graph_structure(co);
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ co_solve_heuristic_new(co);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ co_free_graph_structure(co);
+ co_free_ou_structure(co);
+ free_copy_opt(co);
+ be_ifg_free(chordal_env->ifg);
+
+ }
+
+ elapsed_usec = ir_timer_elapsed_usec(timer);
+ /* calculating average */
+ elapsed_usec = elapsed_usec / tests;
+
+ ir_printf("\nstd:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
+
+ used_memory=0;
+ elapsed_usec=0;
+
+ for (i = 0; i<tests; i++) /* performance test with clique */
+ {
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = be_ifg_clique_new(chordal_env);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ used_memory = ir_get_heap_used_bytes() - used_memory;
+
+ coloring_restore(&coloring);
+
+ co = NULL;
+ co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
+ co_build_ou_structure(co);
+ co_build_graph_structure(co);
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ co_solve_heuristic_new(co);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ co_free_graph_structure(co);
+ co_free_ou_structure(co);
+ free_copy_opt(co);
+ be_ifg_free(chordal_env->ifg);
+
+ }
+
+ elapsed_usec = ir_timer_elapsed_usec(timer);
+ /* calculating average */
+ elapsed_usec = elapsed_usec / tests;
+
+ ir_printf("\nclique:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
+
+ used_memory=0;
+ elapsed_usec=0;
+
+ for (i = 0; i<tests; i++) /* performance test with list */
+ {
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = be_ifg_list_new(chordal_env);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ used_memory = ir_get_heap_used_bytes() - used_memory;
+
+ coloring_restore(&coloring);
+
+ co = NULL;
+ co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
+ co_build_ou_structure(co);
+ co_build_graph_structure(co);
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ co_solve_heuristic_new(co);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ co_free_graph_structure(co);
+ co_free_ou_structure(co);
+ free_copy_opt(co);
+ be_ifg_free(chordal_env->ifg);
+
+ }
+
+ elapsed_usec = ir_timer_elapsed_usec(timer);
+ /* calculating average */
+ elapsed_usec = elapsed_usec / tests;
+
+ ir_printf("\nlist:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
+
+ used_memory=0;
+ elapsed_usec=0;
+
+ for (i = 0; i<tests; i++) /* performance test with pointer */
+ {
+ used_memory = ir_get_heap_used_bytes();
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ chordal_env->ifg = be_ifg_pointer_new(chordal_env);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ used_memory = ir_get_heap_used_bytes() - used_memory;
+
+ coloring_restore(&coloring);
+
+ co = NULL;
+ co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
+ co_build_ou_structure(co);
+ co_build_graph_structure(co);
+
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
+
+ co_solve_heuristic_new(co);
+
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
+
+ co_free_graph_structure(co);
+ co_free_ou_structure(co);
+ free_copy_opt(co);
+ be_ifg_free(chordal_env->ifg);
+
+ }
+
+ elapsed_usec = ir_timer_elapsed_usec(timer);
+ /* calculating average */
+ elapsed_usec = elapsed_usec / tests;
+
+ ir_printf("\npointer:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
+
+ i=0;
+ used_memory=0;
+ elapsed_usec=0;