X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched.c;h=d8c03c716584907f9c9b632642e4d39ab49e6d91;hb=6e3e499d6c68aee0c6a9ada6a99f16c4f6f8445b;hp=4a14efc8a13e2b82540d1e8b127475cbe1492f86;hpb=e578aad6663605a9c1a7d673116e29bae96d71e1;p=libfirm

diff --git a/ir/be/besched.c b/ir/be/besched.c
index 4a14efc8a..d8c03c716 100644
--- a/ir/be/besched.c
+++ b/ir/be/besched.c
@@ -54,7 +54,6 @@ void be_sched_dump(FILE *f, ir_graph *irg)
 void be_sched_init(void)
 {
 	sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
-	firm_dbg_register("be.sched");
 }
 
 void sched_renumber(const ir_node *block)
@@ -73,7 +72,6 @@ void sched_renumber(const ir_node *block)
 /* Verify a schedule. */
 int sched_verify(const ir_node *block)
 {
-  firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
   int res = 1;
   const ir_node *irn;
   int i, n;
@@ -81,6 +79,7 @@ int sched_verify(const ir_node *block)
   const ir_node **save_nodes;
   const ir_edge_t *edge;
   pset *scheduled_nodes = pset_new_ptr_default();
+  FIRM_DBG_REGISTER(firm_dbg_module_t *dbg_sched, "firm.be.sched");
 
   firm_dbg_set_mask(dbg_sched, -1);
 
@@ -188,6 +187,7 @@ int sched_skip_phi_predicator(const ir_node *irn, void *data) {
 	return is_Phi(irn);
 }
 
+/* Skip nodes in a schedule. */
 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
 {
 	const ir_node *bl = get_block(from);
@@ -200,3 +200,61 @@ ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator,
 
 	return curr;
 }
+
+/** A simple forward single linked list. */
+typedef struct {
+	ir_node *start;   /**< start of the list */
+	ir_node *end;     /**< last block in the list */
+	unsigned n_blks;  /**< number of blocks in the list */
+} anchor;
+
+/**
+ * Ext-Block walker: create a block schedule
+ */
+static void create_block_list(ir_extblk *blk, void *env) {
+	anchor *list = env;
+	int i, n;
+
+	for (i = 0, n = get_extbb_n_blocks(blk); i < n; ++i) {
+		ir_node *block = get_extbb_block(blk, i);
+
+		set_irn_link(block, NULL);
+		if (list->start)
+			set_irn_link(list->end, block);
+		else
+			list->start = block;
+
+		list->end = block;
+		++list->n_blks;
+	}
+}
+
+/*
+ * Calculates a block schedule. The schedule is stored as a linked
+ * list starting at the start_block of the irg.
+ */
+ir_node **sched_create_block_schedule(ir_graph *irg)
+{
+	anchor list;
+	ir_node **blk_list, *b, *n;
+	unsigned i;
+
+	/* schedule extended basic blocks */
+	compute_extbb(irg);
+
+	list.start  = NULL;
+	list.end    = NULL;
+	list.n_blks = 0;
+	irg_extblock_walk_graph(irg, NULL, create_block_list, &list);
+
+	/** create an array, so we can go forward and backward */
+	blk_list = NEW_ARR_D(ir_node *, irg->obst,list.n_blks);
+
+	for (i = 0, b = list.start; b; b = n, ++i) {
+		n = get_irn_link(b);
+		set_irn_link(b, INT_TO_PTR(i));
+
+		blk_list[i] = b;
+	}
+	return blk_list;
+}