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_IMPL1_VOID(sched_init_block, ir_node *)
36 FIRM_IMPL1_VOID(sched_reset, ir_node *)
37 FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
38 FIRM_IMPL1_VOID(sched_remove, ir_node *)
40 size_t sched_irn_data_offset = 0;
42 static void block_sched_dumper(ir_node *block, void *env)
47 ir_fprintf(f, "%+F:\n", block);
48 sched_foreach(block, curr) {
49 sched_info_t *info = get_irn_sched_info(curr);
50 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
54 void be_sched_dump(FILE *f, ir_graph *irg)
56 irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
59 /* Init the scheduling stuff. */
60 void be_sched_init(void)
62 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
65 void sched_renumber(const ir_node *block)
69 sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
71 sched_foreach(block, irn) {
72 inf = get_irn_sched_info(irn);
73 inf->time_step = step;
74 step += SCHED_INITIAL_GRANULARITY;
78 /* Verify a schedule. */
79 int sched_verify(const ir_node *block)
85 const ir_node **save_nodes;
86 const ir_edge_t *edge;
87 pset *scheduled_nodes = pset_new_ptr_default();
88 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg_sched, "firm.be.sched");
90 /* Count the number of nodes in the schedule. */
92 sched_foreach(block, irn)
98 save_time_step = xmalloc(n * sizeof(save_time_step[0]));
99 save_nodes = xmalloc(n * sizeof(save_nodes[0]));
102 sched_foreach(block, irn) {
103 sched_info_t *info = get_irn_sched_info(irn);
104 save_time_step[i] = info->time_step;
105 save_nodes[i] = (ir_node *)irn;
107 pset_insert_ptr(scheduled_nodes, irn);
113 * Check if each relevant operand of a node is scheduled before
116 sched_foreach(block, irn) {
118 int step = sched_get_time_step(irn);
120 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
121 ir_node *op = get_irn_n(irn, i);
123 if(to_appear_in_schedule(op)
125 && get_nodes_block(op) == block
126 && sched_get_time_step(op) > step) {
128 DBG((dbg_sched, LEVEL_DEFAULT,
129 "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
135 /* Check, if the time steps are correct */
136 for(i = 1; i < n; ++i) {
137 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
138 DBG((dbg_sched, LEVEL_DEFAULT,
139 "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
140 block, save_nodes[i - 1], i - 1, save_nodes[i], i,
141 save_time_step[i - 1], save_time_step[i]));
146 /* Restore the old time steps */
148 sched_foreach(block, irn) {
149 sched_info_t *info = get_irn_sched_info(irn);
150 info->time_step = save_time_step[i++];
153 /* Check for all nodes in the block if they are scheduled. */
154 foreach_out_edge(block, edge) {
155 ir_node *irn = get_edge_src_irn(edge);
156 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn)) {
157 DBG((dbg_sched, LEVEL_DEFAULT,
158 "%+F: %+F is in block but not scheduled\n", block, irn));
163 del_pset(scheduled_nodes);
164 free(save_time_step);
165 free((void *) save_nodes);
170 * Block-Walker: verify the current block and update the status
172 static void sched_verify_walker(ir_node *block, void *data)
175 *res &= sched_verify(block);
178 /* Verify the schedules in all blocks of the irg. */
179 int sched_verify_irg(ir_graph *irg)
182 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
187 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
188 arch_env_t *ae = data;
189 return arch_irn_class_is(ae, irn, branch);
192 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
196 /* Skip nodes in a schedule. */
197 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
199 const ir_node *bl = get_block(from);
203 from = forward ? sched_next(from) : sched_prev(from);
205 for(curr = from; curr != bl && predicator(curr, data); curr = forward ? sched_next(curr) : sched_prev(curr));
210 //---------------------------------------------------------------------------
212 typedef struct remove_dead_nodes_env_t_ {
215 } remove_dead_nodes_env_t;
217 static void mark_dead_nodes_walker(ir_node *node, void *data)
219 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
220 bitset_set(env->reachable, get_irn_idx(node));
223 static void remove_dead_nodes_walker(ir_node *block, void *data)
225 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
226 ir_node *node, *next;
228 for(node = sched_first(block); !sched_is_end(node); node = next) {
231 // get next node now, as after calling sched_remove it will be invalid
232 next = sched_next(node);
234 if(bitset_is_set(env->reachable, get_irn_idx(node)))
237 arity = get_irn_arity(node);
238 for(i = 0; i < arity; ++i)
239 set_irn_n(node, i, new_r_Bad(env->irg));
245 void be_remove_dead_nodes_from_schedule(ir_graph *irg)
247 remove_dead_nodes_env_t env;
249 env.reachable = bitset_alloca(get_irg_last_idx(irg));
251 // mark all reachable nodes
252 irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
254 // walk schedule and remove non-marked nodes
255 irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);