- if(!arch_irn_consider_in_reg_alloc(arch_env, env->cls, op))
- continue;
-
- o.req = arch_get_register_req(arch_env, 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) {
- be_operand_t *op = &insn->ops[i];
- const arch_register_req_t *req = op->req;
- const arch_register_class_t *cls = req->cls;
- arch_register_req_type_t type = req->type;
-
- /* If there is no special requirement, we allow current class here */
- if (cls == NULL && req->type == arch_register_req_type_none) {
- cls = env->cls;
- type = arch_register_req_type_normal;
- }
-
- assert(cls == env->cls);
-
- op->regs = bitset_obstack_alloc(obst, env->cls->n_regs);
-
- if (type & arch_register_req_type_limited) {
- rbitset_copy_to_bitset(req->limited, op->regs);
- } else {
- arch_put_non_ignore_regs(arch_env, env->cls, op->regs);
- if (env->ignore_colors)
- bitset_andnot(op->regs, env->ignore_colors);
+ if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
+ /* found a register use, create an operand */
+ arch_register_req_t const *const req = arch_get_irn_register_req_in(irn, i);
+ if (arch_register_req_is(req, limited)) {
+ o.regs = req->limited;
+ has_constraints = true;
+ } else {
+ o.regs = env->allocatable_regs->data;
+ }
+ o.carrier = op;
+ o.partner = NULL;
+ obstack_grow(obst, &o, sizeof(o));
+ insn->n_ops++;