7 void be_sched_dump(FILE *f, const ir_graph *irg);
9 int (sched_get_time_step)(const ir_node *irn);
10 int (sched_has_succ)(const ir_node *irn);
11 int (sched_has_prev)(const ir_node *irn);
12 const ir_node *(sched_succ)(const ir_node *irn);
13 const ir_node *(sched_prev)(const ir_node *irn);
14 const ir_node *(sched_first)(const ir_node *block);
15 const ir_node *(sched_last)(const ir_node *block);
16 const ir_node *(sched_add)(ir_node *block, const ir_node *irn);
19 * A shorthand macro for iterating over a schedule.
20 * @param block The block.
21 * @param irn A ir node pointer used as an iterator.
23 #define sched_foreach(block,irn) \
24 for(irn = sched_first(block); irn; irn = sched_succ(irn))
27 * A shorthand macro for reversely iterating over a schedule.
28 * @param block The block.
29 * @param irn A ir node pointer used as an iterator.
31 #define sched_foreach_reverse(block,irn) \
32 for(irn = sched_last(block); irn; irn = sched_prev(irn))