#include "becopystat.h"
#include "becopyopt.h"
-#include "beirg_t.h"
+#include "beirg.h"
#include "bemodule.h"
/** Defines values for the ifg performance test */
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");
+ 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)
}
chordal_env->ifg = old_if;
+
+ ir_timer_free(timer);
}
void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self)
ir_node *m;
be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
- if (!bitset_contains_irn(seen, m) && !arch_irn_is(m, ignore)) {
- bitset_add_irn(seen, m);
- int_comp_rec(ifg, m, seen);
- }
+ if (bitset_contains_irn(seen, m))
+ continue;
+
+ if (arch_get_register_req_out(m)->type & arch_register_req_type_ignore)
+ continue;
+
+ bitset_add_irn(seen, m);
+ int_comp_rec(ifg, m, seen);
}
}
ir_node *n;
be_ifg_foreach_node(ifg, nodes_it, n) {
- if (!bitset_contains_irn(seen, n) && !arch_irn_is(n, ignore)) {
- ++n_comp;
- bitset_add_irn(seen, n);
- int_comp_rec(ifg, n, seen);
- }
+ if (bitset_contains_irn(seen, n))
+ continue;
+
+ if (arch_get_register_req_out(n)->type & arch_register_req_type_ignore)
+ continue;
+
+ ++n_comp;
+ bitset_add_irn(seen, n);
+ int_comp_rec(ifg, n, seen);
}
free(seen);