insn->next_insn = p;
}
-
else if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, irn)) {
arch_get_register_req(arch_env, &o.req, irn, -1);
o.carrier = irn;
for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
ir_node *op = get_irn_n(irn, i);
- if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, op)) {
- arch_get_register_req(arch_env, &o.req, irn, i);
- o.carrier = op;
- o.irn = irn;
- o.pos = i;
- o.partner = NULL;
- o.has_constraints = arch_register_req_is(&o.req, limited);
- obstack_grow(obst, &o, sizeof(o));
- insn->n_ops++;
- insn->in_constraints |= o.has_constraints;
- }
+ if(!arch_irn_consider_in_reg_alloc(arch_env, env->cls, op))
+ continue;
+
+ arch_get_register_req(arch_env, &o.req, irn, i);
+ o.carrier = op;
+ o.irn = irn;
+ o.pos = i;
+ o.partner = NULL;
+ o.has_constraints = arch_register_req_is(&o.req, limited);
+ obstack_grow(obst, &o, sizeof(o));
+ insn->n_ops++;
+ insn->in_constraints |= o.has_constraints;
}
insn->has_constraints = insn->in_constraints | insn->out_constraints;
insn->ops = obstack_finish(obst);
/* Compute the admissible registers bitsets. */
- for(i = 0; i < insn->n_ops; ++i) {
+ for (i = 0; i < insn->n_ops; ++i) {
be_operand_t *op = &insn->ops[i];
+ if (op->req.cls == NULL && op->req.type == arch_register_req_type_none) {
+ op->req.cls = env->cls;
+ op->req.type = arch_register_req_type_normal;
+ }
+
assert(op->req.cls == env->cls);
op->regs = bitset_obstack_alloc(obst, env->cls->n_regs);
- if(arch_register_req_is(&op->req, limited))
+ if (arch_register_req_is(&op->req, limited))
op->req.limited(op->req.limited_env, op->regs);
else {
arch_put_non_ignore_regs(arch_env, env->cls, op->regs);
- if(env->ignore_colors)
+ if (env->ignore_colors)
bitset_andnot(op->regs, env->ignore_colors);
}
-
}
return insn;