X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched.h;h=c2e9d2eec4911af6c4e962411bc7b3ac482676fc;hb=48f0393daa5d5a14ed7e3e32ee2b090759c9371e;hp=134fd6f3279edd34bb5d0ecabbc2ed9c1b2ff854;hpb=38a2ba857e1e5a2f3e67c2b9f4d7510c1a2d074d;p=libfirm

diff --git a/ir/be/besched.h b/ir/be/besched.h
index 134fd6f32..c2e9d2eec 100644
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -1,22 +1,34 @@
-
+/*
+ * Scheduling utilities for nodes in Blocks and Blocks.
+ *
+ * $Id$
+ */
 #ifndef _BESCHED_H
 #define _BESCHED_H
 
 #include <stdio.h>
-#include "irgraph.h"
-#include "irnode.h"
 
-void be_sched_dump(FILE *f, const ir_graph *irg);
+#include "firm_types.h"
+
+#include "execfreq.h"
+
+void be_sched_dump(FILE *f, ir_graph *irg);
 
-int (sched_get_time_step)(const ir_node *irn);
-int (sched_has_next)(const ir_node *irn);
-int (sched_has_prev)(const ir_node *irn);
-ir_node *(sched_next)(const ir_node *irn);
-ir_node *(sched_prev)(const ir_node *irn);
-ir_node *(sched_first)(const ir_node *block);
-ir_node *(sched_last)(const ir_node *block);
-ir_node *(sched_add_before)(ir_node *before, ir_node *irn);
-ir_node *(sched_add_after)(ir_node *before, ir_node *irn);
+int     sched_get_time_step(const ir_node *irn);
+int     sched_has_next(const ir_node *irn);
+int     sched_has_prev(const ir_node *irn);
+ir_node *sched_next(const ir_node *irn);
+ir_node *sched_prev(const ir_node *irn);
+ir_node *sched_first(const ir_node *block);
+ir_node *sched_last(const ir_node *block);
+ir_node *sched_add_before(ir_node *before, ir_node *irn);
+ir_node *sched_add_after(ir_node *before, ir_node *irn);
+void    sched_remove(ir_node *irn);
+
+/**
+ * Returns the first block of a graphs block schedule.
+ */
+ir_node *sched_irg_first(const ir_graph *irg);
 
 #define sched_is_end(irn) is_Block(irn)
 #define sched_is_begin(irn) is_Block(irn)
@@ -43,4 +55,23 @@ ir_node *(sched_add_after)(ir_node *before, ir_node *irn);
 #define sched_foreach_reverse(block,irn) \
   sched_foreach_reverse_from(sched_last(block), irn)
 
-#endif
+/**
+ * Calculates a block schedule. The schedule is returned as
+ * an array allocated on the irg's obstack.
+ *
+ * @param irg  the graph to be scheduled
+ *
+ * @return A list of all blocks in schedule order. This list is
+ *         allocated on irg's obstack and is freed if the graph is destroyed.
+ *
+ * This function implements a simple extended block scheduling algorithm.
+ */
+ir_node **sched_create_block_schedule(ir_graph *irg, ir_exec_freq *execfreqs);
+
+/**
+ * Removes dead nodes from schedule
+ * @param irg  the graph
+ */
+void be_remove_dead_nodes_from_schedule(ir_graph *irg);
+
+#endif /* _BESCHED_H */