2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Scheduling utilities for nodes in Blocks and Blocks.
23 * @author Sebastian Hack
26 #ifndef FIRM_BE_BESCHED_H
27 #define FIRM_BE_BESCHED_H
35 void be_sched_dump(FILE *f, ir_graph *irg);
37 int sched_get_time_step(const ir_node *irn);
38 int sched_has_next(const ir_node *irn);
39 int sched_has_prev(const ir_node *irn);
40 int sched_is_scheduled(const ir_node *irn);
41 ir_node *sched_next(const ir_node *irn);
42 ir_node *sched_prev(const ir_node *irn);
43 ir_node *sched_first(const ir_node *block);
44 ir_node *sched_last(const ir_node *block);
45 void sched_add_before(ir_node *before, ir_node *irn);
46 void sched_add_after(ir_node *before, ir_node *irn);
47 void sched_init_block(ir_node *block);
48 void sched_reset(ir_node *node);
49 void sched_remove(ir_node *irn);
51 #define sched_is_end(irn) is_Block(irn)
52 #define sched_is_begin(irn) is_Block(irn)
54 #define sched_foreach_from(from, irn) \
55 for(irn = from; !sched_is_end(irn); irn = sched_next(irn))
57 #define sched_foreach_reverse_from(from, irn) \
58 for(irn = from; !sched_is_begin(irn); irn = sched_prev(irn))
61 * A shorthand macro for iterating over a schedule.
62 * @param block The block.
63 * @param irn A ir node pointer used as an iterator.
65 #define sched_foreach(block,irn) \
66 sched_foreach_from(sched_first(block), irn)
69 * A shorthand macro for reversely iterating over a schedule.
70 * @param block The block.
71 * @param irn A ir node pointer used as an iterator.
73 #define sched_foreach_reverse(block,irn) \
74 sched_foreach_reverse_from(sched_last(block), irn)
77 * Removes dead nodes from schedule
78 * @param irg the graph
80 void be_remove_dead_nodes_from_schedule(be_irg_t *birg);
82 #endif /* FIRM_BE_BESCHED_H */