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 int sched_is_scheduled(const ir_node *irn);
19 ir_node *sched_next(const ir_node *irn);
20 ir_node *sched_prev(const ir_node *irn);
21 ir_node *sched_first(const ir_node *block);
22 ir_node *sched_last(const ir_node *block);
23 ir_node *sched_add_before(ir_node *before, ir_node *irn);
24 ir_node *sched_add_after(ir_node *before, ir_node *irn);
25 void sched_init_block(ir_node *block);
26 void sched_reset(ir_node *node);
27 void sched_remove(ir_node *irn);
29 #define sched_is_end(irn) is_Block(irn)
30 #define sched_is_begin(irn) is_Block(irn)
32 #define sched_foreach_from(from, irn) \
33 for(irn = from; !sched_is_end(irn); irn = sched_next(irn))
35 #define sched_foreach_reverse_from(from, irn) \
36 for(irn = from; !sched_is_begin(irn); irn = sched_prev(irn))
39 * A shorthand macro for iterating over a schedule.
40 * @param block The block.
41 * @param irn A ir node pointer used as an iterator.
43 #define sched_foreach(block,irn) \
44 sched_foreach_from(sched_first(block), irn)
47 * A shorthand macro for reversely iterating over a schedule.
48 * @param block The block.
49 * @param irn A ir node pointer used as an iterator.
51 #define sched_foreach_reverse(block,irn) \
52 sched_foreach_reverse_from(sched_last(block), irn)
55 * Removes dead nodes from schedule
56 * @param irg the graph
58 void be_remove_dead_nodes_from_schedule(ir_graph *irg);
60 #endif /* _BESCHED_H */