13 #include "irgraph_t.h"
14 #include "iredges_t.h"
18 #include "besched_t.h"
20 #include "belistsched.h"
22 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
23 FIRM_IMPL1(sched_has_next, int, const ir_node *)
24 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
25 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
26 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
27 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
28 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
29 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
30 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
31 FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
32 FIRM_IMPL1_VOID(sched_remove, ir_node *)
34 size_t sched_irn_data_offset = 0;
36 static void block_sched_dumper(ir_node *block, void *env)
41 ir_fprintf(f, "%+F:\n", block);
42 sched_foreach(block, curr) {
43 sched_info_t *info = get_irn_sched_info(curr);
44 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
48 void be_sched_dump(FILE *f, ir_graph *irg)
50 irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
53 /* Init the scheduling stuff. */
54 void be_sched_init(void)
56 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
59 void sched_renumber(const ir_node *block)
63 sched_timestep_t step = 0;
65 sched_foreach(block, irn) {
66 inf = get_irn_sched_info(irn);
67 inf->time_step = step;
68 step += SCHED_INITIAL_GRANULARITY;
72 /* Verify a schedule. */
73 int sched_verify(const ir_node *block)
79 const ir_node **save_nodes;
80 const ir_edge_t *edge;
81 pset *scheduled_nodes = pset_new_ptr_default();
82 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg_sched, "firm.be.sched");
84 firm_dbg_set_mask(dbg_sched, -1);
86 /* Count the number of nodes in the schedule. */
88 sched_foreach(block, irn)
94 save_time_step = xmalloc(n * sizeof(save_time_step[0]));
95 save_nodes = xmalloc(n * sizeof(save_nodes[0]));
98 sched_foreach(block, irn) {
99 sched_info_t *info = get_irn_sched_info(irn);
100 save_time_step[i] = info->time_step;
101 save_nodes[i] = (ir_node *)irn;
103 pset_insert_ptr(scheduled_nodes, irn);
109 * Check if each relevant operand of a node is scheduled before
112 sched_foreach(block, irn) {
114 int step = sched_get_time_step(irn);
116 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
117 ir_node *op = get_irn_n(irn, i);
119 if(to_appear_in_schedule(op)
121 && get_nodes_block(op) == block
122 && sched_get_time_step(op) > step) {
124 DBG((dbg_sched, LEVEL_DEFAULT,
125 "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
131 /* Check, if the time steps are correct */
132 for(i = 1; i < n; ++i) {
133 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
134 DBG((dbg_sched, LEVEL_DEFAULT,
135 "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
136 block, save_nodes[i - 1], i - 1, save_nodes[i], i,
137 save_time_step[i - 1], save_time_step[i]));
142 /* Restore the old time steps */
144 sched_foreach(block, irn) {
145 sched_info_t *info = get_irn_sched_info(irn);
146 info->time_step = save_time_step[i++];
149 /* Check for all nodes in the block if they are scheduled. */
150 foreach_out_edge(block, edge) {
151 ir_node *irn = get_edge_src_irn(edge);
152 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn))
153 DBG((dbg_sched, LEVEL_DEFAULT,
154 "%+F: %+F is in block but not scheduled\n", block, irn));
157 del_pset(scheduled_nodes);
158 free(save_time_step);
159 free((void *) save_nodes);
164 * Block-Walker: verify the current block and update the status
166 static void sched_verify_walker(ir_node *block, void *data)
169 *res &= sched_verify(block);
172 /* Verify the schedules in all blocks of the irg. */
173 int sched_verify_irg(ir_graph *irg)
176 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
181 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
182 arch_env_t *ae = data;
183 return arch_irn_classify(ae, irn) == arch_irn_class_branch;
186 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
190 /* Skip nodes in a schedule. */
191 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
193 const ir_node *bl = get_block(from);
197 from = forward ? sched_next(from) : sched_prev(from);
199 for(curr = from; curr != bl && predicator(curr, data); curr = forward ? sched_next(curr) : sched_prev(curr));
204 /** A simple forward single linked list. */
206 ir_node *start; /**< start of the list */
207 ir_node *end; /**< last block in the list */
208 unsigned n_blks; /**< number of blocks in the list */
212 * Ext-Block walker: create a block schedule
214 static void create_block_list(ir_extblk *blk, void *env) {
218 for (i = 0, n = get_extbb_n_blocks(blk); i < n; ++i) {
219 ir_node *block = get_extbb_block(blk, i);
221 set_irn_link(block, NULL);
223 set_irn_link(list->end, block);
233 * Calculates a block schedule. The schedule is stored as a linked
234 * list starting at the start_block of the irg.
236 ir_node **sched_create_block_schedule(ir_graph *irg)
239 ir_node **blk_list, *b, *n;
242 /* schedule extended basic blocks */
248 irg_extblock_walk_graph(irg, NULL, create_block_list, &list);
250 /** create an array, so we can go forward and backward */
251 blk_list = NEW_ARR_D(ir_node *, irg->obst,list.n_blks);
253 for (i = 0, b = list.start; b; b = n, ++i) {
255 set_irn_link(b, INT_TO_PTR(i));