X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbestate.c;h=1e3bf3effedb3086da0544c9e28db81165fcaf3d;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=32d0c14ee3bc7851ed652a22a6ee4fcaba580a44;hpb=1a3b7d363474ab544c13093a2f0b578718d37c7a;p=libfirm

diff --git a/ir/be/bestate.c b/ir/be/bestate.c
index 32d0c14ee..1e3bf3eff 100644
--- a/ir/be/bestate.c
+++ b/ir/be/bestate.c
@@ -23,7 +23,6 @@
  *              algorithm optimized for the 1-register case.
  * @author      Matthias Braun
  * @date        26.03.2007
- * @version     $Id$
  */
 #include "config.h"
 
@@ -38,7 +37,7 @@
 #include "ircons_t.h"
 #include "irgmod.h"
 #include "irnodeset.h"
-#include "irnodemap.h"
+#include "irnodehashmap.h"
 #include "adt/cpset.h"
 
 #include "bearch.h"
@@ -67,7 +66,7 @@ typedef struct minibelady_env_t {
 	create_reload_func     create_reload;
 	create_spill_func      create_spill;
 	spill_info_t          *spills;
-	ir_nodemap_t           spill_infos;
+	ir_nodehashmap_t       spill_infos;
 
 	be_uses_t             *uses;           /**< env for the next-use magic */
 } minibelady_env_t;
@@ -100,7 +99,7 @@ static inline spill_info_t *create_spill_info(minibelady_env_t *env, ir_node *st
 	spill_info->value = state;
 	spill_info->reloads = NEW_ARR_F(ir_node*, 0);
 
-	ir_nodemap_insert(&env->spill_infos, state, spill_info);
+	ir_nodehashmap_insert(&env->spill_infos, state, spill_info);
 	//ir_fprintf(stderr, "Insert %+F -> %p\n", state, spill_info);
 
 	spill_info->next = env->spills;
@@ -112,7 +111,7 @@ static inline spill_info_t *create_spill_info(minibelady_env_t *env, ir_node *st
 static inline spill_info_t *get_spill_info(minibelady_env_t *env, const ir_node *node)
 {
 	spill_info_t *spill_info
-		= (spill_info_t*) ir_nodemap_get(&env->spill_infos, node);
+		= (spill_info_t*) ir_nodehashmap_get(&env->spill_infos, node);
 	//ir_fprintf(stderr, "Get %+F -> %p\n", node, spill_info);
 	return spill_info;
 }
@@ -135,8 +134,7 @@ static spill_info_t *create_spill(minibelady_env_t *env, ir_node *state, int for
 		do {
 			after = next;
 			next = sched_next(after);
-		} while (is_Proj(next) || is_Phi(next) || be_is_Keep(next)
-		        || (arch_irn_get_flags(next) & arch_irn_flags_prolog));
+		} while (is_Proj(next) || is_Phi(next) || be_is_Keep(next));
 	} else {
 		after = state;
 	}
@@ -162,7 +160,7 @@ static void spill_phi(minibelady_env_t *env, ir_node *phi)
 	ir_graph     *irg           = get_irn_irg(phi);
 	ir_node      *block         = get_nodes_block(phi);
 	int           arity         = get_irn_arity(phi);
-	ir_node     **in            = ALLOCAN(ir_node*, arity);
+	ir_node     **phi_in        = ALLOCAN(ir_node*, arity);
 	ir_node      *dummy         = new_r_Dummy(irg, mode_M);
 	ir_node      *spill_to_kill = NULL;
 	spill_info_t *spill_info;
@@ -178,13 +176,13 @@ static void spill_phi(minibelady_env_t *env, ir_node *phi)
 
 	/* create a new phi-M with bad preds */
 	for (i = 0; i < arity; ++i) {
-		in[i] = dummy;
+		phi_in[i] = dummy;
 	}
 
 	DBG((dbg, LEVEL_2, "\tcreate Phi-M for %+F\n", phi));
 
 	/* create a Phi-M */
-	spill_info->spill = be_new_Phi(block, arity, in, mode_M, NULL);
+	spill_info->spill = be_new_Phi(block, arity, phi_in, mode_M, NULL);
 	sched_add_after(block, spill_info->spill);
 
 	if (spill_to_kill != NULL) {
@@ -352,17 +350,6 @@ static block_info_t *compute_block_start_state(minibelady_env_t *env, ir_node *b
 	return block_info;
 }
 
-static ir_node *get_reload_point(ir_node *before)
-{
-	while (true) {
-		ir_node *prev = sched_prev(before);
-		if (! (arch_irn_get_flags(prev) & arch_irn_flags_epilog))
-			break;
-		before = prev;
-	}
-	return before;
-}
-
 /**
  * For the given block @p block, decide for each values
  * whether it is used from a register or is reloaded
@@ -419,7 +406,7 @@ static void belady(minibelady_env_t *env, ir_node *block)
 		}
 		/* create a reload to match state if necessary */
 		if (need_val != NULL && need_val != current_state) {
-			ir_node *before = get_reload_point(node);
+			ir_node *before = node;
 			DBG((dbg, LEVEL_3, "\t... reloading %+F\n", need_val));
 			create_reload(env, need_val, before, current_state);
 			current_state = need_val;
@@ -538,13 +525,10 @@ void be_assure_state(ir_graph *irg, const arch_register_t *reg, void *func_env,
 {
 	minibelady_env_t env;
 	spill_info_t *info;
-	be_lv_t *lv = be_assure_liveness(irg);
+	be_lv_t *lv = be_get_irg_liveness(irg);
 
-	be_liveness_assure_sets(lv);
-	/* construct control flow loop tree */
-	if (! (get_irg_loopinfo_state(irg) & loopinfo_cf_consistent)) {
-		construct_cf_backedges(irg);
-	}
+	be_assure_live_sets(irg);
+	assure_loopinfo(irg);
 
 	obstack_init(&env.obst);
 	env.reg           = reg;
@@ -554,7 +538,7 @@ void be_assure_state(ir_graph *irg, const arch_register_t *reg, void *func_env,
 	env.lv            = be_get_irg_liveness(irg);
 	env.uses          = be_begin_uses(irg, env.lv);
 	env.spills        = NULL;
-	ir_nodemap_init(&env.spill_infos);
+	ir_nodehashmap_init(&env.spill_infos);
 
 	assure_doms(irg);
 	ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED | IR_RESOURCE_IRN_LINK);
@@ -609,12 +593,12 @@ void be_assure_state(ir_graph *irg, const arch_register_t *reg, void *func_env,
 	/* some nodes might be dead now. */
 	be_remove_dead_nodes_from_schedule(irg);
 
-	ir_nodemap_destroy(&env.spill_infos);
+	ir_nodehashmap_destroy(&env.spill_infos);
 	be_end_uses(env.uses);
 	obstack_free(&env.obst, NULL);
 }
 
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_state);
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_state)
 void be_init_state(void)
 {
 	FIRM_DBG_REGISTER(dbg, "firm.be.state");