X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched.c;h=64a2cb7ed57d1ba1d6551f8e5cdfae07967bd853;hb=80a6158fdd766f42ee6c508a773bc114ff1b61f3;hp=be565debc0fb1dd36851b0cf1a6cc9f013018fc9;hpb=c1e510b1fb12eba816d8731d069b3dfffea430eb;p=libfirm

diff --git a/ir/be/besched.c b/ir/be/besched.c
index be565debc..64a2cb7ed 100644
--- a/ir/be/besched.c
+++ b/ir/be/besched.c
@@ -15,8 +15,10 @@
 #include "irgraph_t.h"
 #include "iredges_t.h"
 #include "ircons.h"
+#include "irextbb.h"
 #include "debug.h"
 
+#include "bemodule.h"
 #include "bearch.h"
 #include "besched_t.h"
 #include "beutil.h"
@@ -31,6 +33,8 @@ FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
+FIRM_IMPL1_VOID(sched_init_block, ir_node *)
+FIRM_IMPL1_VOID(sched_reset, ir_node *)
 FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
 FIRM_IMPL1_VOID(sched_remove, ir_node *)
 
@@ -54,11 +58,13 @@ void be_sched_dump(FILE *f, ir_graph *irg)
 }
 
 /* Init the scheduling stuff. */
-void be_sched_init(void)
+void be_init_sched(void)
 {
 	sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
 }
 
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);
+
 void sched_renumber(const ir_node *block)
 {
 	ir_node *irn;
@@ -204,91 +210,7 @@ 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;
-
-static void add_block(anchor *list, ir_node *block) {
-	if(list->start == NULL) {
-		list->start = block;
-		list->end = block;
-	} else {
-		set_irn_link(list->end, block);
-		list->end = block;
-	}
-
-	list->n_blks++;
-}
-
-static void create_block_list(ir_node *leader_block, anchor *list) {
-	int i;
-	ir_node *block = NULL;
-	const ir_edge_t *edge;
-
-	ir_extblk *extbb = get_Block_extbb(leader_block);
-	if(extbb_visited(extbb))
-		return;
-	mark_extbb_visited(extbb);
-
-	for(i = 0; i < get_extbb_n_blocks(extbb); ++i) {
-		block = get_extbb_block(extbb, i);
-		add_block(list, block);
-	}
-
-	assert(block != NULL);
-
-	// pick successor extbbs
-	foreach_block_succ(block, edge) {
-		ir_node *succ = get_edge_src_irn(edge);
-
-		create_block_list(succ, list);
-	}
-
-	for(i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
-		block = get_extbb_block(extbb, i);
-		foreach_block_succ(block, edge) {
-			ir_node *succ = get_edge_src_irn(edge);
-
-			create_block_list(succ, list);
-		}
-	}
-}
-
-void compute_extbb_execfreqs(ir_graph *irg, exec_freq_t *execfreqs);
-
-/*
- * 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, exec_freq_t *execfreqs)
-{
-	anchor list;
-	ir_node **blk_list, *b, *n;
-	unsigned i;
-
-	/* schedule extended basic blocks */
-	compute_extbb_execfreqs(irg, execfreqs);
-	//compute_extbb(irg);
-
-	list.start  = NULL;
-	list.end    = NULL;
-	list.n_blks = 0;
-	inc_irg_block_visited(irg);
-	create_block_list(get_irg_start_block(irg), &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);
-		blk_list[i] = b;
-	}
-
-	return blk_list;
-}
+//---------------------------------------------------------------------------
 
 typedef struct remove_dead_nodes_env_t_ {
 	ir_graph *irg;