2 * Scheduling utilities for nodes in Blocks and Blocks.
11 #include "firm_types.h"
13 void be_sched_dump(FILE *f, ir_graph *irg);
15 int sched_get_time_step(const ir_node *irn);
16 int sched_has_next(const ir_node *irn);
17 int sched_has_prev(const ir_node *irn);
18 ir_node *sched_next(const ir_node *irn);
19 ir_node *sched_prev(const ir_node *irn);
20 ir_node *sched_first(const ir_node *block);
21 ir_node *sched_last(const ir_node *block);
22 ir_node *sched_add_before(ir_node *before, ir_node *irn);
23 ir_node *sched_add_after(ir_node *before, ir_node *irn);
24 void sched_init_block(ir_node *block);
25 void sched_reset(ir_node *node);
26 void sched_remove(ir_node *irn);
28 #define sched_is_end(irn) is_Block(irn)
29 #define sched_is_begin(irn) is_Block(irn)
31 #define sched_foreach_from(from, irn) \
32 for(irn = from; !sched_is_end(irn); irn = sched_next(irn))
34 #define sched_foreach_reverse_from(from, irn) \
35 for(irn = from; !sched_is_begin(irn); irn = sched_prev(irn))
38 * A shorthand macro for iterating over a schedule.
39 * @param block The block.
40 * @param irn A ir node pointer used as an iterator.
42 #define sched_foreach(block,irn) \
43 sched_foreach_from(sched_first(block), irn)
46 * A shorthand macro for reversely iterating over a schedule.
47 * @param block The block.
48 * @param irn A ir node pointer used as an iterator.
50 #define sched_foreach_reverse(block,irn) \
51 sched_foreach_reverse_from(sched_last(block), irn)
54 * Removes dead nodes from schedule
55 * @param irg the graph
57 void be_remove_dead_nodes_from_schedule(ir_graph *irg);
59 #endif /* _BESCHED_H */