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"));
/* iterate over all possible colors in order */
bitset_clear_all(pos_regs);
- arch_get_allocatable_regs(get_arch_env(pi->co), curr->irn, -1, pi->co->chordal_env->cls, pos_regs);
+ arch_get_allocatable_regs(get_arch_env(pi->co), curr->irn, -1, pos_regs);
bitset_foreach(pos_regs, col) {
int var_idx;
mangle_var2(pi->buf, 'x', nnr, col);
root = curr->nodes[0];
rootnr = get_irn_graph_nr(root);
bitset_clear_all(root_regs);
- arch_get_allocatable_regs(get_arch_env(pi->co), root, -1, pi->co->chordal_env->cls, root_regs);
+ arch_get_allocatable_regs(get_arch_env(pi->co), root, -1, root_regs);
/* for all arguments of root */
for (i = 1; i < curr->node_count; ++i) {
arg = curr->nodes[i];
argnr = get_irn_graph_nr(arg);
bitset_clear_all(arg_regs);
- arch_get_allocatable_regs(get_arch_env(pi->co), arg, -1, pi->co->chordal_env->cls, arg_regs);
+ arch_get_allocatable_regs(get_arch_env(pi->co), arg, -1, arg_regs);
/* Introduce new variable and set factor in objective function */
mangle_var2(buf, 'y', rootnr, argnr);
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) {