X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeuses.c;h=b3261d3731f330677e8763870a746e39ff3a4d81;hb=81a1291a7e91bb22b018d5daa2c749c0c184ac8d;hp=defe30878a9536607f0c112e398c4717f08f6d4a;hpb=bf3c9c635dbb99589a219bdcd17878fe86193c04;p=libfirm

diff --git a/ir/be/beuses.c b/ir/be/beuses.c
index defe30878..b3261d373 100644
--- a/ir/be/beuses.c
+++ b/ir/be/beuses.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -51,7 +51,6 @@
 #include "beirgmod.h"
 #include "bearch_t.h"
 #include "beuses.h"
-#include "benodesets.h"
 
 #define SCAN_INTERBLOCK_USES
 
@@ -75,6 +74,8 @@ static int cmp_use(const void *a, const void *b, size_t n)
 {
 	const be_use_t *p = a;
 	const be_use_t *q = b;
+	(void) n;
+
 	return !(p->block == q->block && p->node == q->node);
 }
 
@@ -86,7 +87,7 @@ static const be_use_t *get_or_set_use_block(be_uses_t *env,
                                             const ir_node *block,
                                             const ir_node *def)
 {
-	unsigned hash = HASH_COMBINE(nodeset_hash(block), nodeset_hash(def));
+	unsigned hash = HASH_COMBINE(hash_irn(block), hash_irn(def));
 	be_use_t temp;
 	be_use_t* result;
 
@@ -118,7 +119,7 @@ static const be_use_t *get_or_set_use_block(be_uses_t *env,
 	return result;
 }
 
-static int be_is_phi_argument(const be_lv_t *lv, const ir_node *block, const ir_node *def)
+static int be_is_phi_argument(const ir_node *block, const ir_node *def)
 {
 	ir_node *node;
 	ir_node *succ_block = NULL;
@@ -169,7 +170,7 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 								  unsigned from_step, const ir_node *def,
 								  int skip_from_uses)
 {
-	unsigned  step = from_step;
+	unsigned  step  = from_step;
 	ir_node  *block = get_nodes_block(from);
 	ir_node  *next_use;
 	ir_node  *node;
@@ -190,6 +191,8 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 		ir_node  *node = get_edge_src_irn(edge);
 		unsigned  node_step;
 
+		if(is_Anchor(node))
+			continue;
 		if(get_nodes_block(node) != block)
 			continue;
 		if(is_Phi(node))
@@ -208,6 +211,7 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 		be_next_use_t result;
 		result.time           = next_use_step - timestep + skip_from_uses;
 		result.outermost_loop = get_loop_depth(get_irn_loop(block));
+		result.before         = next_use;
 		return result;
 	}
 
@@ -245,8 +249,9 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 					return be_get_next_use(env, node, step, node, 1);
 				}
 
-				result.time = step;
+				result.time           = step;
 				result.outermost_loop = get_loop_depth(get_irn_loop(block));
+				result.before         = node;
 				return result;
 			}
 		}
@@ -255,7 +260,7 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 	}
 #endif
 
-	if(be_is_phi_argument(env->lv, block, def)) {
+	if(be_is_phi_argument(block, def)) {
 		// TODO we really should continue searching the uses of the phi,
 		// as a phi isn't a real use that implies a reload (because we could
 		// easily spill the whole phi)
@@ -263,6 +268,7 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 		be_next_use_t result;
 		result.time           = step;
 		result.outermost_loop = get_loop_depth(get_irn_loop(block));
+		result.before         = block;
 		return result;
 	}
 
@@ -278,6 +284,7 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 	ir_graph *irg       = get_irn_irg(block);
 	ir_node *startblock = get_irg_start_block(irg);
 
+	result.before  = NULL;
 	outermost_loop = loopdepth;
 	foreach_block_succ(block, edge) {
 		const be_use_t *use;
@@ -317,15 +324,16 @@ static be_next_use_t get_next_use(be_uses_t *env, ir_node *from,
 		}
 
 		if(use_dist < next_use) {
-			next_use = use_dist;
+			next_use       = use_dist;
 			outermost_loop = use->outermost_loop;
+			result.before  = use->node;
 		}
 	}
 
 	if(loopdepth < outermost_loop)
 		outermost_loop = loopdepth;
 
-	result.time = next_use + step;
+	result.time           = next_use + step;
 	result.outermost_loop = outermost_loop;
 
 	if(!found_use && found_visited) {
@@ -354,6 +362,7 @@ void set_sched_step_walker(ir_node *block, void *data)
 {
 	ir_node  *node;
 	unsigned step = 0;
+	(void) data;
 
 	sched_foreach(block, node) {
 		set_irn_link(node, INT_TO_PTR(step));