X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespilldaemel.c;h=2950f690257673aa903e8a81557ab7a16a1ffcc7;hb=82795c6b1b7873647691efad4eb8f6229a167a8d;hp=e549aadd66ce9ff87c8f5f006cc2ccd2a6d6f9fe;hpb=cbcf8b93de62865b8564e6a47aca7a28790b65ad;p=libfirm

diff --git a/ir/be/bespilldaemel.c b/ir/be/bespilldaemel.c
index e549aadd6..2950f6902 100644
--- a/ir/be/bespilldaemel.c
+++ b/ir/be/bespilldaemel.c
@@ -19,12 +19,12 @@
 
 /**
  * @file
- * @brief       Naiv spilling algorithm
+ * @brief       Naive spilling algorithm
  * @author      Matthias Braun
  * @date        20.09.2005
  * @version     $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $
- * @summary
- *   This implements a naiv spilling algorithm. It is design to produce similar
+ * @brief
+ *   This implements a naive spilling algorithm. It is designed to produce similar
  *   effects to the spill decisions produced by traditional graph coloring
  *   register allocators that spill while they are coloring the graph.
  *
@@ -33,9 +33,7 @@
  *   Spilling in this context means placing a spill instruction behind the
  *   definition of the value and a reload before each usage.
  */
-#ifdef HAVE_CONFIG_H
 #include "config.h"
-#endif
 
 #include "debug.h"
 
@@ -46,20 +44,20 @@
 #include "error.h"
 
 #include "beirg.h"
-#include "bespilloptions.h"
 #include "bespill.h"
+#include "bespillutil.h"
 #include "bemodule.h"
 #include "besched.h"
-#include "bearch_t.h"
+#include "bearch.h"
 #include "be_t.h"
-#include "benode_t.h"
+#include "benode.h"
 #include "beirg.h"
+#include "belive.h"
 
 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
 
 static spill_env_t                 *spill_env;
 static int                          n_regs;
-static const arch_env_t            *arch_env;
 static const arch_register_class_t *cls;
 static const be_lv_t               *lv;
 static bitset_t                    *spilled_nodes;
@@ -160,11 +158,11 @@ static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node)
 		foreach_out_edge(node, edge) {
 			const ir_node *proj = get_edge_src_irn(edge);
 
-			if(arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
+			if (arch_irn_consider_in_reg_alloc(cls, proj)) {
 				++values_defined;
 			}
 		}
-	} else if(arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
+	} else if (arch_irn_consider_in_reg_alloc(cls, node)) {
 		++values_defined;
 	}
 
@@ -172,7 +170,7 @@ static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node)
 	arity = get_irn_arity(node);
 	for(i = 0; i < arity; ++i) {
 		ir_node *pred = get_irn_n(node, i);
-		if(arch_irn_consider_in_reg_alloc(arch_env, cls, pred)
+		if (arch_irn_consider_in_reg_alloc(cls, pred)
 				&& !ir_nodeset_contains(live_nodes, pred)) {
 			++free_regs_needed;
 		}
@@ -188,7 +186,7 @@ static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node)
 		return;
 	DBG((dbg, LEVEL_2, "\tspills needed after %+F: %d\n", node, spills_needed));
 
-	candidates = alloca(n_live_nodes * sizeof(candidates[0]));
+	candidates = ALLOCAN(spill_candidate_t, n_live_nodes);
 
 	/* construct array with spill candidates and calculate their costs */
 	i = 0;
@@ -223,7 +221,7 @@ static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node)
 		cand_node = candidate->node;
 		++cand_idx;
 
-		if(arch_irn_is(arch_env, cand_node, dont_spill))
+		if (arch_irn_is(skip_Proj_const(cand_node), dont_spill))
 			continue;
 
 		/* make sure the node is not an argument of the instruction */
@@ -260,30 +258,30 @@ static void remove_defs(ir_node *node, ir_nodeset_t *nodeset)
 		foreach_out_edge(node, edge) {
 			const ir_node *proj = get_edge_src_irn(edge);
 
-			if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
+			if (arch_irn_consider_in_reg_alloc(cls, proj)) {
 				ir_nodeset_remove(nodeset, proj);
 			}
 		}
 	}
 
-    if(arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
-        ir_nodeset_remove(nodeset, node);
-    }
+	if (arch_irn_consider_in_reg_alloc(cls, node)) {
+		ir_nodeset_remove(nodeset, node);
+	}
 }
 
 static void add_uses(ir_node *node, ir_nodeset_t *nodeset)
 {
 	int i, arity;
 
-    arity = get_irn_arity(node);
-    for(i = 0; i < arity; ++i) {
-        ir_node *op = get_irn_n(node, i);
+	arity = get_irn_arity(node);
+	for(i = 0; i < arity; ++i) {
+		ir_node *op = get_irn_n(node, i);
 
-        if(arch_irn_consider_in_reg_alloc(arch_env, cls, op)
-		   && !bitset_is_set(spilled_nodes, get_irn_idx(op))) {
-            ir_nodeset_insert(nodeset, op);
+		if (arch_irn_consider_in_reg_alloc(cls, op) &&
+				!bitset_is_set(spilled_nodes, get_irn_idx(op))) {
+			ir_nodeset_insert(nodeset, op);
 		}
-    }
+	}
 }
 
 static __attribute__((unused))
@@ -316,7 +314,7 @@ static void spill_block(ir_node *block, void *data)
 
 	/* construct set of live nodes at end of block */
 	ir_nodeset_init(&live_nodes);
-	be_liveness_end_of_block(lv, arch_env, cls, block, &live_nodes);
+	be_liveness_end_of_block(lv, cls, block, &live_nodes);
 
 	/* remove already spilled nodes from liveset */
 	foreach_ir_nodeset(&live_nodes, node, iter) {
@@ -390,7 +388,6 @@ void be_spill_daemel(be_irg_t *birg, const arch_register_class_t *new_cls)
 	be_liveness_assure_sets(be_assure_liveness(birg));
 
 	spill_env     = be_new_spill_env(birg);
-	arch_env      = be_get_birg_arch_env(birg);
 	cls           = new_cls;
 	lv            = be_get_birg_liveness(birg);
 	spilled_nodes = bitset_malloc(get_irg_last_idx(irg));