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

diff --git a/ir/be/besched.h b/ir/be/besched.h
index 312ec6346..c2e9d2eec 100644
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -10,6 +10,8 @@
 
 #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);
@@ -53,4 +55,23 @@ ir_node *sched_irg_first(const ir_graph *irg);
 #define sched_foreach_reverse(block,irn) \
   sched_foreach_reverse_from(sched_last(block), irn)
 
+/**
+ * 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 */