15 #include "irgraph_t.h"
16 #include "iredges_t.h"
21 #include "besched_t.h"
23 #include "belistsched.h"
25 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
26 FIRM_IMPL1(sched_has_next, int, const ir_node *)
27 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
28 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
29 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
30 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
31 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
32 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
33 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
34 FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
35 FIRM_IMPL1_VOID(sched_remove, ir_node *)
37 size_t sched_irn_data_offset = 0;
39 static void block_sched_dumper(ir_node *block, void *env)
44 ir_fprintf(f, "%+F:\n", block);
45 sched_foreach(block, curr) {
46 sched_info_t *info = get_irn_sched_info(curr);
47 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
51 void be_sched_dump(FILE *f, ir_graph *irg)
53 irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
56 /* Init the scheduling stuff. */
57 void be_sched_init(void)
59 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
62 void sched_renumber(const ir_node *block)
66 sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
68 sched_foreach(block, irn) {
69 inf = get_irn_sched_info(irn);
70 inf->time_step = step;
71 step += SCHED_INITIAL_GRANULARITY;
75 /* Verify a schedule. */
76 int sched_verify(const ir_node *block)
82 const ir_node **save_nodes;
83 const ir_edge_t *edge;
84 pset *scheduled_nodes = pset_new_ptr_default();
85 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg_sched, "firm.be.sched");
87 /* Count the number of nodes in the schedule. */
89 sched_foreach(block, irn)
95 save_time_step = xmalloc(n * sizeof(save_time_step[0]));
96 save_nodes = xmalloc(n * sizeof(save_nodes[0]));
99 sched_foreach(block, irn) {
100 sched_info_t *info = get_irn_sched_info(irn);
101 save_time_step[i] = info->time_step;
102 save_nodes[i] = (ir_node *)irn;
104 pset_insert_ptr(scheduled_nodes, irn);
110 * Check if each relevant operand of a node is scheduled before
113 sched_foreach(block, irn) {
115 int step = sched_get_time_step(irn);
117 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
118 ir_node *op = get_irn_n(irn, i);
120 if(to_appear_in_schedule(op)
122 && get_nodes_block(op) == block
123 && sched_get_time_step(op) > step) {
125 DBG((dbg_sched, LEVEL_DEFAULT,
126 "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
132 /* Check, if the time steps are correct */
133 for(i = 1; i < n; ++i) {
134 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
135 DBG((dbg_sched, LEVEL_DEFAULT,
136 "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
137 block, save_nodes[i - 1], i - 1, save_nodes[i], i,
138 save_time_step[i - 1], save_time_step[i]));
143 /* Restore the old time steps */
145 sched_foreach(block, irn) {
146 sched_info_t *info = get_irn_sched_info(irn);
147 info->time_step = save_time_step[i++];
150 /* Check for all nodes in the block if they are scheduled. */
151 foreach_out_edge(block, edge) {
152 ir_node *irn = get_edge_src_irn(edge);
153 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn)) {
154 DBG((dbg_sched, LEVEL_DEFAULT,
155 "%+F: %+F is in block but not scheduled\n", block, irn));
160 del_pset(scheduled_nodes);
161 free(save_time_step);
162 free((void *) save_nodes);
167 * Block-Walker: verify the current block and update the status
169 static void sched_verify_walker(ir_node *block, void *data)
172 *res &= sched_verify(block);
175 /* Verify the schedules in all blocks of the irg. */
176 int sched_verify_irg(ir_graph *irg)
179 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
184 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
185 arch_env_t *ae = data;
186 return arch_irn_classify(ae, irn) == arch_irn_class_branch;
189 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
193 /* Skip nodes in a schedule. */
194 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
196 const ir_node *bl = get_block(from);
200 from = forward ? sched_next(from) : sched_prev(from);
202 for(curr = from; curr != bl && predicator(curr, data); curr = forward ? sched_next(curr) : sched_prev(curr));
207 /** A simple forward single linked list. */
209 ir_node *start; /**< start of the list */
210 ir_node *end; /**< last block in the list */
211 unsigned n_blks; /**< number of blocks in the list */
215 * Ext-Block walker: create a block schedule
217 static void create_block_list(ir_extblk *blk, void *env) {
221 for (i = 0, n = get_extbb_n_blocks(blk); i < n; ++i) {
222 ir_node *block = get_extbb_block(blk, i);
224 set_irn_link(block, NULL);
226 set_irn_link(list->end, block);
236 * Calculates a block schedule. The schedule is stored as a linked
237 * list starting at the start_block of the irg.
239 ir_node **sched_create_block_schedule(ir_graph *irg)
242 ir_node **blk_list, *b, *n;
245 /* schedule extended basic blocks */
251 irg_extblock_walk_graph(irg, NULL, create_block_list, &list);
253 /** create an array, so we can go forward and backward */
254 blk_list = NEW_ARR_D(ir_node *, irg->obst,list.n_blks);
256 for (i = 0, b = list.start; b; b = n, ++i) {
258 set_irn_link(b, INT_TO_PTR(i));
265 typedef struct remove_dead_nodes_env_t_ {
268 } remove_dead_nodes_env_t;
270 static void mark_dead_nodes_walker(ir_node *node, void *data)
272 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
273 bitset_set(env->reachable, get_irn_idx(node));
276 static void remove_dead_nodes_walker(ir_node *block, void *data)
278 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
279 ir_node *node, *next;
281 for(node = sched_first(block); !sched_is_end(node); node = next) {
284 // get next node now, as after calling sched_remove it will be invalid
285 next = sched_next(node);
287 if(bitset_is_set(env->reachable, get_irn_idx(node)))
290 arity = get_irn_arity(node);
291 for(i = 0; i < arity; ++i)
292 set_irn_n(node, i, new_r_Bad(env->irg));
298 void be_remove_dead_nodes_from_schedule(ir_graph *irg)
300 remove_dead_nodes_env_t env;
302 env.reachable = bitset_alloca(get_irg_last_idx(irg));
304 // mark all reachable nodes
305 irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
307 // walk schedule and remove non-marked nodes
308 irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);