#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);
#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 */