+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_new();
+ 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;
+ }
+
+ chordal_env->ifg = old_if;
+
+ ir_timer_free(timer);
+}
+