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_init_block(ir_node *block);
+void sched_reset(ir_node *node);
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)
#define sched_foreach_reverse(block,irn) \
sched_foreach_reverse_from(sched_last(block), irn)
+/**
+ * Removes dead nodes from schedule
+ * @param irg the graph
+ */
+void be_remove_dead_nodes_from_schedule(ir_graph *irg);
+
#endif /* _BESCHED_H */