+#include "beirg.h"
+
+void be_sched_dump(FILE *f, ir_graph *irg);
+
+/**
+ * returns the time step of a node. Each node in a block has a timestep
+ * unique to that block. a node schedule before another node has a lower
+ * timestep than this node.
+ */
+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);
+int sched_is_scheduled(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);
+void sched_add_before(ir_node *before, ir_node *irn);
+void sched_add_after(ir_node *after, ir_node *irn);
+void sched_init_block(ir_node *block);
+void sched_reset(ir_node *node);
+void sched_remove(ir_node *irn);
+
+#define sched_is_end(irn) is_Block(irn)
+#define sched_is_begin(irn) is_Block(irn)