#include <stdlib.h>
-#include <libcore/lc_opts.h>
-#include <libcore/lc_opts_enum.h>
-#include <libcore/lc_timing.h>
+#include "lc_opts.h"
+#include "lc_opts_enum.h"
+#include "timing.h"
#include "bitset.h"
#include "irgwalk.h"
#include "irnode_t.h"
copy_opt_t *co;
be_ifg_t *old_if = chordal_env->ifg;
- lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the 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, chordal_env->birg->main_env->arch_env);
+ coloring_init(&coloring, chordal_env->irg, &chordal_env->birg->main_env->arch_env);
coloring_save(&coloring);
- lc_timer_reset(timer);
+ ir_timer_reset(timer);
for (i = 0; i<tests; i++) /* performance test with std */
{
- used_memory = lc_get_heap_used_bytes();
+ used_memory = ir_get_heap_used_bytes();
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
chordal_env->ifg = be_ifg_std_new(chordal_env);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
- used_memory = lc_get_heap_used_bytes() - used_memory;
+ used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
co_build_ou_structure(co);
co_build_graph_structure(co);
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
co_solve_heuristic_new(co);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
}
- elapsed_usec = lc_timer_elapsed_usec(timer);
+ elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
for (i = 0; i<tests; i++) /* performance test with clique */
{
- used_memory = lc_get_heap_used_bytes();
+ used_memory = ir_get_heap_used_bytes();
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
chordal_env->ifg = be_ifg_clique_new(chordal_env);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
- used_memory = lc_get_heap_used_bytes() - used_memory;
+ used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
co_build_ou_structure(co);
co_build_graph_structure(co);
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
co_solve_heuristic_new(co);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
}
- elapsed_usec = lc_timer_elapsed_usec(timer);
+ elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
for (i = 0; i<tests; i++) /* performance test with list */
{
- used_memory = lc_get_heap_used_bytes();
+ used_memory = ir_get_heap_used_bytes();
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
chordal_env->ifg = be_ifg_list_new(chordal_env);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
- used_memory = lc_get_heap_used_bytes() - used_memory;
+ used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
co_build_ou_structure(co);
co_build_graph_structure(co);
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
co_solve_heuristic_new(co);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
}
- elapsed_usec = lc_timer_elapsed_usec(timer);
+ elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
for (i = 0; i<tests; i++) /* performance test with pointer */
{
- used_memory = lc_get_heap_used_bytes();
+ used_memory = ir_get_heap_used_bytes();
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
chordal_env->ifg = be_ifg_pointer_new(chordal_env);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
- used_memory = lc_get_heap_used_bytes() - used_memory;
+ used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
co_build_ou_structure(co);
co_build_graph_structure(co);
- rt = lc_timer_enter_high_priority();
- lc_timer_start(timer);
+ rt = ir_timer_enter_high_priority();
+ ir_timer_start(timer);
co_solve_heuristic_new(co);
- lc_timer_stop(timer);
- rt = lc_timer_leave_high_priority();
+ ir_timer_stop(timer);
+ rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
}
- elapsed_usec = lc_timer_elapsed_usec(timer);
+ elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
ir_node *m;
be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
- if(!bitset_contains_irn(seen, m) && !arch_irn_is(birg->main_env->arch_env, m, ignore)) {
+ if(!bitset_contains_irn(seen, m) && !arch_irn_is(&birg->main_env->arch_env, m, ignore)) {
bitset_add_irn(seen, m);
int_comp_rec(birg, ifg, m, seen);
}
ir_node *n;
be_ifg_foreach_node(ifg, nodes_it, n) {
- if (! bitset_contains_irn(seen, n) && ! arch_irn_is(birg->main_env->arch_env, n, ignore)) {
+ if (! bitset_contains_irn(seen, n) && ! arch_irn_is(&birg->main_env->arch_env, n, ignore)) {
++n_comp;
bitset_add_irn(seen, n);
int_comp_rec(birg, ifg, n, seen);