9 void be_sched_dump(FILE *f, const ir_graph *irg);
11 int (sched_get_time_step)(const ir_node *irn);
12 int (sched_has_next)(const ir_node *irn);
13 int (sched_has_prev)(const ir_node *irn);
14 ir_node *(sched_next)(const ir_node *irn);
15 ir_node *(sched_prev)(const ir_node *irn);
16 ir_node *(sched_first)(const ir_node *block);
17 ir_node *(sched_last)(const ir_node *block);
18 ir_node *(sched_add_before)(ir_node *before, ir_node *irn);
19 ir_node *(sched_add_after)(ir_node *before, ir_node *irn);
20 void (sched_remove)(ir_node *irn);
22 #define sched_is_end(irn) is_Block(irn)
23 #define sched_is_begin(irn) is_Block(irn)
25 #define sched_foreach_from(from, irn) \
26 for(irn = from; !sched_is_end(irn); irn = sched_next(irn))
28 #define sched_foreach_reverse_from(from, irn) \
29 for(irn = from; !sched_is_begin(irn); irn = sched_prev(irn))
32 * A shorthand macro for iterating over a schedule.
33 * @param block The block.
34 * @param irn A ir node pointer used as an iterator.
36 #define sched_foreach(block,irn) \
37 sched_foreach_from(sched_first(block), irn)
40 * A shorthand macro for reversely iterating over a schedule.
41 * @param block The block.
42 * @param irn A ir node pointer used as an iterator.
44 #define sched_foreach_reverse(block,irn) \
45 sched_foreach_reverse_from(sched_last(block), irn)