X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive.c;h=e6b5e71c8ad5e8e9a31893f18a6bf25c7c85b771;hb=a813e06fca6cf70514b39e0b56ee4c8711f54d63;hp=bce02065983518c42fcc77c7712a5b40f78db8f7;hpb=32277076cb0d3e89849b42ce37536c300c30c0c7;p=libfirm

diff --git a/ir/be/belive.c b/ir/be/belive.c
index bce020659..e6b5e71c8 100644
--- a/ir/be/belive.c
+++ b/ir/be/belive.c
@@ -11,9 +11,13 @@
 #include "iredges_t.h"
 #include "irgwalk.h"
 #include "irprintf_t.h"
+#include "irbitset.h"
 
 #include "beutil.h"
 #include "belive_t.h"
+#include "besched_t.h"
+
+#define DBG_MODULE "firm.be.liveness"
 
 FIRM_IMPL2(is_live_in, int, const ir_node *, const ir_node *)
 FIRM_IMPL2(is_live_out, int, const ir_node *, const ir_node *)
@@ -27,16 +31,25 @@ void be_liveness_init(void)
   live_irg_data_offset = register_additional_graph_data(sizeof(irn_live_t));
 }
 
+/**
+ * Mark a node as live-in in a block.
+ */
 static INLINE void mark_live_in(ir_node *block, const ir_node *irn)
 {
   _get_or_set_live(block, irn, live_state_in);
 }
 
+/**
+ * Mark a node as live-out in a block.
+ */
 static INLINE void mark_live_out(ir_node *block, const ir_node *irn)
 {
   _get_or_set_live(block, irn, live_state_out | live_state_end);
 }
 
+/**
+ * Mark a node as live-end in a block.
+ */
 static INLINE void mark_live_end(ir_node *block, const ir_node *irn)
 {
   _get_or_set_live(block, irn, live_state_end);
@@ -52,31 +65,29 @@ static INLINE void mark_live_end(ir_node *block, const ir_node *irn)
  * @param is_true_out Is the node real out there or only live at the end
  * of the block.
  */
-static void live_end_at_block(ir_node *def, ir_node *block,
-    pset *visited, int is_true_out)
+static void live_end_at_block(ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
 {
-  mark_live_end(block, def);
-  if(is_true_out)
-    mark_live_out(block, def);
+	mark_live_end(block, def);
+	if(is_true_out)
+		mark_live_out(block, def);
 
-  if(!pset_find_ptr(visited, block)) {
+	if(!bitset_contains_irn(visited, block)) {
+		bitset_add_irn(visited, block);
 
-    pset_insert_ptr(visited, block);
+		/*
+		* If this block is not the definition block, we have to go up
+		* further.
+		*/
+		if(get_nodes_block(def) != block) {
+			int i, n;
 
-    /*
-     * If this block is not the definition block, we have to go up
-     * further.
-     */
-    if(get_nodes_block(def) != block) {
-      int i, n;
+			mark_live_in(block, def);
 
-      mark_live_in(block, def);
-
-      for(i = 0, n = get_irn_arity(block); i < n; ++i)
-        live_end_at_block(def, get_Block_cfgpred_block(block, i), visited, 1);
-    }
+			for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
+				live_end_at_block(def, get_Block_cfgpred_block(block, i), visited, 1);
+		}
 
-  }
+	}
 }
 
 /**
@@ -86,63 +97,64 @@ static void live_end_at_block(ir_node *def, ir_node *block,
  * @param irn The node (value).
  * @param env Ignored.
  */
-static void liveness_for_node(ir_node *irn, void *env)
-{
-  const ir_edge_t *edge;
-  ir_node *def_block;
-  pset *visited;
-
-  /* Don't compute liveness information for non-data nodes. */
-  if(!is_data_node(irn))
-    return;
-
-  visited = pset_new_ptr(512);
-  def_block = get_nodes_block(irn);
-
-  /* Go over all uses of the value */
-  foreach_out_edge(irn, edge) {
-    ir_node *use = edge->src;
-    ir_node *use_block;
-
-    /*
-     * If the usage is no data node, skip this use, since it does not
-     * affect the liveness of the node.
-     */
-    if(!is_data_node(use))
-      continue;
-
-    /* Get the block where the usage is in. */
-    use_block = get_nodes_block(use);
-
-    /*
-     * If the use is a phi function, determine the corresponding block
-     * through which the value reaches the phi function and mark the
-     * value as live out of that block.
-     */
-    if(is_Phi(use)) {
+static void liveness_for_node(ir_node *irn, void *data)
+{
+	bitset_t *visited = data;
+	const ir_edge_t *edge;
+	ir_node *def_block;
+
+	/* Don't compute liveness information for non-data nodes. */
+	if(!is_data_node(irn))
+		return;
+
+	bitset_clear_all(visited);
+	def_block = get_nodes_block(irn);
+
+	/* Go over all uses of the value */
+	foreach_out_edge(irn, edge) {
+		ir_node *use = edge->src;
+		ir_node *use_block;
+
+		/*
+		* If the usage is no data node, skip this use, since it does not
+		* affect the liveness of the node.
+		*/
+		if(!is_data_node(use))
+			continue;
+
+		/* Get the block where the usage is in. */
+		use_block = get_nodes_block(use);
+
+		/*
+		* If the use is a phi function, determine the corresponding block
+		* through which the value reaches the phi function and mark the
+		* value as live out of that block.
+		*/
+		if(is_Phi(use)) {
 			ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
 			live_end_at_block(irn, pred_block, visited, 0);
-    }
-
-    /*
-     * Else, the value is live in at this block. Mark it and call live
-     * out on the predecessors.
-     */
-    else if(def_block != use_block) {
-      int i, n;
+		}
 
-      mark_live_in(use_block, irn);
+		/*
+		* Else, the value is live in at this block. Mark it and call live
+		* out on the predecessors.
+		*/
+		else if(def_block != use_block) {
+			int i, n;
 
-      for(i = 0, n = get_irn_arity(use_block); i < n; ++i) {
-        ir_node *pred_block = get_nodes_block(get_irn_n(use_block, i));
-        live_end_at_block(irn, pred_block, visited, 1);
-      }
-    }
-  }
+			mark_live_in(use_block, irn);
 
-  del_pset(visited);
+			for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
+				ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
+				live_end_at_block(irn, pred_block, visited, 1);
+			}
+		}
+	}
 }
 
+/**
+ * Compare two live entries.
+ */
 static int cmp_irn_live(const void *a, const void *b, size_t size)
 {
   const irn_live_t *p = a;
@@ -151,17 +163,65 @@ static int cmp_irn_live(const void *a, const void *b, size_t size)
   return !(p->block == q->block && p->irn == q->irn);
 }
 
+static int (*old_dump_block_func)(ir_node *self, FILE *F, dump_reason_t reason) = NULL;
+
+static int dump_block_func(ir_node *self, FILE *F, dump_reason_t reason)
+{
+	switch(reason) {
+	case dump_node_opcode_txt:
+		fprintf(F, get_irn_opname(self));
+		break;
+	case dump_node_mode_txt:
+		fprintf(F, get_irn_modename(self));
+		break;
+	case dump_node_nodeattr_txt:
+		break;
+	case dump_node_info_txt:
+		if(!get_irg_live_info(get_irn_irg(self))->live)
+			return 0;
+#if 0
+		fprintf(F, "liveness information:\n");
+		{
+			irn_live_t *li;
+			live_foreach(self, li) {
+				ir_fprintf(F, "%+F", li->irn);
+				if(live_is_in(li))
+					fprintf(F, " in");
+				if(live_is_end(li))
+					fprintf(F, " end");
+				if(live_is_out(li))
+					fprintf(F, " out");
+
+				fprintf(F, "\n");
+			}
+		}
+#endif
+	}
+
+	return 0;
+}
+
+/* Compute the inter block liveness for a graph. */
 void be_liveness(ir_graph *irg)
 {
-  irg_live_info_t *live_info = get_irg_live_info(irg);
-  if(live_info->live)
-    del_set(live_info->live);
+	bitset_t *visited = bitset_irg_malloc(irg);
 
+	irg_live_info_t *live_info = get_irg_live_info(irg);
+	if(live_info->live)
+		del_set(live_info->live);
 
-  live_info->live = new_set(cmp_irn_live, 8192);
-  irg_walk_graph(irg, liveness_for_node, NULL, NULL);
+	live_info->live = new_set(cmp_irn_live, 8192);
+	irg_walk_graph(irg, liveness_for_node, NULL, visited);
+
+	old_dump_block_func     = op_Block->ops.dump_node;
+	op_Block->ops.dump_node = dump_block_func;
+
+	bitset_free(visited);
 }
 
+/**
+ * Pre-walker: dump liveness data to a file
+ */
 static void dump_liveness_walker(ir_node *bl, void *data)
 {
 	FILE *f = data;
@@ -185,11 +245,13 @@ static void dump_liveness_walker(ir_node *bl, void *data)
 	}
 }
 
+/* Dump the liveness information for a graph. */
 void be_liveness_dump(ir_graph *irg, FILE *f)
 {
 	irg_block_walk_graph(irg, dump_liveness_walker, NULL, f);
 }
 
+/* Dump the liveness information for a graph. */
 void be_liveness_dumpto(ir_graph *irg, const char *cls_name)
 {
 	FILE *f;
@@ -201,6 +263,10 @@ void be_liveness_dumpto(ir_graph *irg, const char *cls_name)
 	}
 }
 
+/**
+ * Walker: checks the every predecessors of a node dominate
+ * the note.
+ */
 static void dom_check(ir_node *irn, void *data)
 {
 	if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
@@ -223,7 +289,71 @@ static void dom_check(ir_node *irn, void *data)
 	}
 }
 
+/* Check, if the SSA dominance property is fulfilled. */
 void be_check_dominance(ir_graph *irg)
 {
 	irg_walk_graph(irg, dom_check, NULL, NULL);
 }
+
+pset *be_liveness_transfer(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *irn, pset *live)
+{
+	int i, n;
+	ir_node *x;
+	FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, DBG_MODULE);
+
+	DEBUG_ONLY(
+		DBG((dbg, LEVEL_1, "%+F\n", irn));
+		for(x = pset_first(live); x; x = pset_next(live))
+			DBG((dbg, LEVEL_1, "\tlive: %+F\n", x));
+	)
+
+	/* You should better break out of your loop when hitting the first phi function. */
+	assert(!is_Phi(irn) && "liveness_transfer produces invalid results for phi nodes");
+
+	if(arch_irn_consider_in_reg_alloc(arch_env, cls, irn)) {
+		ir_node *del = pset_remove_ptr(live, irn);
+		assert(irn == del);
+	}
+
+	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, cls, op))
+			pset_insert_ptr(live, op);
+	}
+
+	return live;
+}
+
+pset *be_liveness_end_of_block(const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *bl, pset *live)
+{
+	irn_live_t *li;
+
+	live_foreach(bl, li) {
+		ir_node *irn = (ir_node *) li->irn;
+		if(live_is_end(li) && arch_irn_consider_in_reg_alloc(arch_env, cls, irn))
+			pset_insert_ptr(live, irn);
+	}
+
+	return live;
+}
+
+pset *be_liveness_nodes_live_at(const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live)
+{
+	const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
+	ir_node *irn;
+
+	be_liveness_end_of_block(arch_env, cls, bl, live);
+	sched_foreach_reverse(bl, irn) {
+		/*
+		 * If we encounter the node we want to insert the Perm after,
+		 * exit immediately, so that this node is still live
+		 */
+		if(irn == pos)
+			return live;
+
+		be_liveness_transfer(arch_env, cls, irn, live);
+	}
+
+	return live;
+}