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

diff --git a/ir/be/besched.h b/ir/be/besched.h
index 312ec6346..e5a1bf803 100644
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -53,4 +53,17 @@ 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);
+
 #endif /* _BESCHED_H */