X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeinsn.c;h=1215cf74ee93d3859262a756fd79d747fc836606;hb=9276447aec4972df060349e162f583c4898dfec8;hp=c75033579614415ff0889f0a1bba7fff2095296e;hpb=b73faf4843bf2197d6e205e067f54f7863022b30;p=libfirm

diff --git a/ir/be/beinsn.c b/ir/be/beinsn.c
index c75033579..1215cf74e 100644
--- a/ir/be/beinsn.c
+++ b/ir/be/beinsn.c
@@ -1,3 +1,28 @@
+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief       A data structure to treat nodes and node-proj collections uniformly.
+ * @author      Sebastian Hack
+ * @version     $Id$
+ */
 #ifdef HAVE_CONFIG_H
 #include "config.h"
 #endif
@@ -8,7 +33,9 @@
 
 #include "besched_t.h"
 #include "beinsn_t.h"
+#include "beirg_t.h"
 #include "beabi.h"
+#include "raw_bitset.h"
 
 be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 {
@@ -29,12 +56,12 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 
 		for(p = sched_next(irn); is_Proj(p); p = sched_next(p)) {
 			if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, p)) {
-				arch_get_register_req(arch_env, &o.req, p, -1);
+				o.req             = arch_get_register_req(arch_env, p, -1);
 				o.carrier         = p;
 				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);
 				obstack_grow(obst, &o, sizeof(o));
 				insn->n_ops++;
 				insn->out_constraints |= o.has_constraints;
@@ -43,37 +70,40 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 		}
 
 		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);
+	} else if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, irn)) {
+		o.req     = arch_get_register_req(arch_env, irn, -1);
 		o.carrier = 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);
 		obstack_grow(obst, &o, sizeof(o));
 		insn->n_ops++;
 		insn->out_constraints |= o.has_constraints;
 		pre_colored += arch_get_irn_register(arch_env, irn) != NULL;
 	}
 
-	insn->pre_colored = pre_colored == insn->n_ops && insn->n_ops > 0;
+	if(pre_colored > 0) {
+		assert(pre_colored == insn->n_ops && "partly pre-colored nodes not supported");
+		insn->pre_colored = 1;
+	}
 	insn->use_start   = insn->n_ops;
 
 	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;
+
+		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;
@@ -82,18 +112,23 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 	/* Compute the admissible registers bitsets. */
 	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;
+		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(op->req.cls == env->cls);
+		assert(cls == env->cls);
+
 		op->regs = bitset_obstack_alloc(obst, env->cls->n_regs);
 
-		if (arch_register_req_is(&op->req, limited))
-			op->req.limited(op->req.limited_env, op->regs);
-		else {
+		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);
@@ -103,12 +138,15 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 	return insn;
 }
 
-be_insn_env_t *be_insn_env_init(be_insn_env_t *ie, const be_irg_t *birg, const arch_register_class_t *cls, struct obstack *obst)
+be_insn_env_t *be_insn_env_init(be_insn_env_t *ie, const be_irg_t *birg,
+                                const arch_register_class_t *cls,
+                                struct obstack *obst)
 {
-	ie->aenv = birg->main_env->arch_env;
+	ie->aenv = be_get_birg_arch_env(birg);
 	ie->cls  = cls;
 	ie->obst = obst;
 	ie->ignore_colors = bitset_obstack_alloc(obst, cls->n_regs);
 	be_abi_put_ignore_regs(birg->abi, cls, ie->ignore_colors);
+
 	return ie;
 }