X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeinsn.c;h=ed44d42d32de3f00c0fb1935a62efb4a254d0f4a;hb=24d4d90a8a18fd1e2157787efc06fb3c9c7f2380;hp=5f50b28e77feefebf5df74aeb4320da33223cc88;hpb=41dc42afc8d00e0f364711ed0c919e4e29cb20e4;p=libfirm

diff --git a/ir/be/beinsn.c b/ir/be/beinsn.c
index 5f50b28e7..ed44d42d3 100644
--- a/ir/be/beinsn.c
+++ b/ir/be/beinsn.c
@@ -21,7 +21,6 @@
  * @file
  * @brief       A data structure to treat nodes and node-proj collections uniformly.
  * @author      Sebastian Hack
- * @version     $Id$
  */
 #include "config.h"
 
@@ -36,40 +35,6 @@
 #include "beabi.h"
 #include "raw_bitset.h"
 
-/**
- * Add machine operands to the instruction uses.
- *
- * @param env      the insn construction environment
- * @param insn     the be_insn that is build
- * @param mach_op  the machine operand for which uses are added
- */
-static void add_machine_operands(const be_insn_env_t *env, be_insn_t *insn, ir_node *mach_op)
-{
-	struct obstack *obst = env->obst;
-	int i, n;
-
-	for (i = 0, n = get_irn_arity(mach_op); i < n; ++i) {
-		ir_node *op = get_irn_n(mach_op, i);
-
-		if (is_irn_machine_operand(op)) {
-			add_machine_operands(env, insn, op);
-		} else if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
-			be_operand_t o;
-
-			/* found a register use, create an operand */
-			o.req     = arch_get_irn_register_req_in(mach_op, i);
-			o.carrier = op;
-			o.irn     = insn->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;
-		}
-	}
-}
-
 /**
  * Create a be_insn_t for an IR node.
  *
@@ -110,7 +75,7 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 				o.irn             = irn;
 				o.pos             = -(get_Proj_proj(p) + 1);
 				o.partner         = NULL;
-				o.has_constraints = arch_register_req_is(o.req, limited);
+				o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
 				obstack_grow(obst, &o, sizeof(o));
 				insn->n_ops++;
 				insn->out_constraints |= o.has_constraints;
@@ -124,7 +89,7 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 		o.irn     = irn;
 		o.pos     = -1;
 		o.partner = NULL;
-		o.has_constraints = arch_register_req_is(o.req, limited);
+		o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
 		obstack_grow(obst, &o, sizeof(o));
 		insn->n_ops++;
 		insn->out_constraints |= o.has_constraints;
@@ -141,9 +106,7 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 	for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
 		ir_node *op = get_irn_n(irn, i);
 
-		if (is_irn_machine_operand(op)) {
-			add_machine_operands(env, insn, op);
-		} else if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
+		if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
 			/* found a register use, create an operand */
 			o.req     = arch_get_irn_register_req_in(irn, i);
 			o.carrier = op;