15 #include "irgraph_t.h"
16 #include "iredges_t.h"
22 #include "besched_t.h"
24 #include "belistsched.h"
26 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
27 FIRM_IMPL1(sched_has_next, int, const ir_node *)
28 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
29 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
30 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
31 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
32 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
33 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
34 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
35 FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
36 FIRM_IMPL1_VOID(sched_remove, ir_node *)
38 size_t sched_irn_data_offset = 0;
40 static void block_sched_dumper(ir_node *block, void *env)
45 ir_fprintf(f, "%+F:\n", block);
46 sched_foreach(block, curr) {
47 sched_info_t *info = get_irn_sched_info(curr);
48 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
52 void be_sched_dump(FILE *f, ir_graph *irg)
54 irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
57 /* Init the scheduling stuff. */
58 void be_sched_init(void)
60 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
63 void sched_renumber(const ir_node *block)
67 sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
69 sched_foreach(block, irn) {
70 inf = get_irn_sched_info(irn);
71 inf->time_step = step;
72 step += SCHED_INITIAL_GRANULARITY;
76 /* Verify a schedule. */
77 int sched_verify(const ir_node *block)
83 const ir_node **save_nodes;
84 const ir_edge_t *edge;
85 pset *scheduled_nodes = pset_new_ptr_default();
86 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg_sched, "firm.be.sched");
88 /* Count the number of nodes in the schedule. */
90 sched_foreach(block, irn)
96 save_time_step = xmalloc(n * sizeof(save_time_step[0]));
97 save_nodes = xmalloc(n * sizeof(save_nodes[0]));
100 sched_foreach(block, irn) {
101 sched_info_t *info = get_irn_sched_info(irn);
102 save_time_step[i] = info->time_step;
103 save_nodes[i] = (ir_node *)irn;
105 pset_insert_ptr(scheduled_nodes, irn);
111 * Check if each relevant operand of a node is scheduled before
114 sched_foreach(block, irn) {
116 int step = sched_get_time_step(irn);
118 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
119 ir_node *op = get_irn_n(irn, i);
121 if(to_appear_in_schedule(op)
123 && get_nodes_block(op) == block
124 && sched_get_time_step(op) > step) {
126 DBG((dbg_sched, LEVEL_DEFAULT,
127 "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
133 /* Check, if the time steps are correct */
134 for(i = 1; i < n; ++i) {
135 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
136 DBG((dbg_sched, LEVEL_DEFAULT,
137 "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
138 block, save_nodes[i - 1], i - 1, save_nodes[i], i,
139 save_time_step[i - 1], save_time_step[i]));
144 /* Restore the old time steps */
146 sched_foreach(block, irn) {
147 sched_info_t *info = get_irn_sched_info(irn);
148 info->time_step = save_time_step[i++];
151 /* Check for all nodes in the block if they are scheduled. */
152 foreach_out_edge(block, edge) {
153 ir_node *irn = get_edge_src_irn(edge);
154 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn)) {
155 DBG((dbg_sched, LEVEL_DEFAULT,
156 "%+F: %+F is in block but not scheduled\n", block, irn));
161 del_pset(scheduled_nodes);
162 free(save_time_step);
163 free((void *) save_nodes);
168 * Block-Walker: verify the current block and update the status
170 static void sched_verify_walker(ir_node *block, void *data)
173 *res &= sched_verify(block);
176 /* Verify the schedules in all blocks of the irg. */
177 int sched_verify_irg(ir_graph *irg)
180 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
185 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
186 arch_env_t *ae = data;
187 return arch_irn_class_is(ae, irn, branch);
190 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
194 /* Skip nodes in a schedule. */
195 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
197 const ir_node *bl = get_block(from);
201 from = forward ? sched_next(from) : sched_prev(from);
203 for(curr = from; curr != bl && predicator(curr, data); curr = forward ? sched_next(curr) : sched_prev(curr));
208 //---------------------------------------------------------------------------
210 typedef struct remove_dead_nodes_env_t_ {
213 } remove_dead_nodes_env_t;
215 static void mark_dead_nodes_walker(ir_node *node, void *data)
217 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
218 bitset_set(env->reachable, get_irn_idx(node));
221 static void remove_dead_nodes_walker(ir_node *block, void *data)
223 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
224 ir_node *node, *next;
226 for(node = sched_first(block); !sched_is_end(node); node = next) {
229 // get next node now, as after calling sched_remove it will be invalid
230 next = sched_next(node);
232 if(bitset_is_set(env->reachable, get_irn_idx(node)))
235 arity = get_irn_arity(node);
236 for(i = 0; i < arity; ++i)
237 set_irn_n(node, i, new_r_Bad(env->irg));
243 void be_remove_dead_nodes_from_schedule(ir_graph *irg)
245 remove_dead_nodes_env_t env;
247 env.reachable = bitset_alloca(get_irg_last_idx(irg));
249 // mark all reachable nodes
250 irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
252 // walk schedule and remove non-marked nodes
253 irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);