int i, o, size = 0;
ir_node **all, *curr;
be_ifg_t *ifg = pi->co->chordal_env->ifg;
- void *iter = be_ifg_iter_alloca(ifg);
+ void *iter = be_ifg_neighbours_iter_alloca(ifg);
all = alloca(be_ifg_degree(ifg, ifn) * sizeof(*all));
int redo = 1;
int n_nodes = 0;
const be_ifg_t *ifg = pi->co->chordal_env->ifg;
- void *iter = be_ifg_iter_alloca(ifg);
+ void *iter = be_ifg_neighbours_iter_alloca(ifg);
DBG((dbg, LEVEL_2, "Find simlicials...\n"));
while (redo) {
+ arch_register_req_t req;
redo = 0;
be_ifg_foreach_node(ifg, iter, irn) {
- if (!is_removed(irn) && !is_optimizable(get_arch_env(pi->co), irn) && !is_optimizable_arg(pi->co, irn)) {
+ if (!is_removed(irn) && !is_optimizable(get_arch_env(pi->co), irn, &req) && !is_optimizable_arg(pi->co, irn)) {
if (pi_is_simplicial(pi, irn)) {
simpl_t *s = xmalloc(sizeof(*s));
s->irn = irn;
simpl_t *simpl, *tmp;
be_ifg_t *ifg = pi->co->chordal_env->ifg;
bitset_t *used_cols = bitset_alloca(arch_register_class_n_regs(pi->co->chordal_env->cls));
- void *iter = be_ifg_iter_alloca(ifg);
+ void *iter = be_ifg_neighbours_iter_alloca(ifg);
DBG((dbg, LEVEL_2, "Set simplicials...\n"));
/* color the simplicial nodes in right order */
problem_instance_t *pi;
dbg = firm_dbg_register("ir.be.copyoptilp");
- if (!strcmp(co->name, DEBUG_IRG))
- firm_dbg_set_mask(dbg, DEBUG_IRG_LVL_ILP);
- else
- firm_dbg_set_mask(dbg, DEBUG_LVL_ILP);
pi = new_pi(co);
if (!pi->all_simplicial) {