14 #include "firm_types.h"
15 #include "irgraph_t.h"
16 #include "iredges_t.h"
23 #include "besched_t.h"
25 #include "belistsched.h"
27 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
28 FIRM_IMPL1(sched_has_next, int, const ir_node *)
29 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
30 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
31 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
32 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
33 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
34 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
35 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
36 FIRM_IMPL1_VOID(sched_init_block, ir_node *)
37 FIRM_IMPL1_VOID(sched_reset, ir_node *)
38 FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
39 FIRM_IMPL1_VOID(sched_remove, ir_node *)
41 size_t sched_irn_data_offset = 0;
43 static void block_sched_dumper(ir_node *block, void *env)
48 ir_fprintf(f, "%+F:\n", block);
50 sched_foreach(block, curr) {
51 sched_info_t *info = get_irn_sched_info(curr);
52 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
56 void be_sched_dump(FILE *f, ir_graph *irg)
58 irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
61 /* Init the scheduling stuff. */
62 void be_init_sched(void)
64 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
67 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);
69 void sched_renumber(const ir_node *block)
73 sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
75 sched_foreach(block, irn) {
76 inf = get_irn_sched_info(irn);
77 inf->time_step = step;
78 step += SCHED_INITIAL_GRANULARITY;
82 /* Verify a schedule. */
83 int sched_verify(const ir_node *block)
89 const ir_node **save_nodes;
90 const ir_edge_t *edge;
91 pset *scheduled_nodes = pset_new_ptr_default();
92 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg_sched, "firm.be.sched");
94 /* Count the number of nodes in the schedule. */
96 sched_foreach(block, irn)
102 save_time_step = xmalloc(n * sizeof(save_time_step[0]));
103 save_nodes = xmalloc(n * sizeof(save_nodes[0]));
106 sched_foreach(block, irn) {
107 sched_info_t *info = get_irn_sched_info(irn);
108 save_time_step[i] = info->time_step;
109 save_nodes[i] = (ir_node *)irn;
111 pset_insert_ptr(scheduled_nodes, irn);
117 * Check if each relevant operand of a node is scheduled before
120 sched_foreach(block, irn) {
122 int step = sched_get_time_step(irn);
124 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
125 ir_node *op = get_irn_n(irn, i);
127 if(to_appear_in_schedule(op)
129 && get_nodes_block(op) == block
130 && sched_get_time_step(op) > step) {
132 DBG((dbg_sched, LEVEL_DEFAULT,
133 "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
139 /* Check, if the time steps are correct */
140 for(i = 1; i < n; ++i) {
141 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
142 DBG((dbg_sched, LEVEL_DEFAULT,
143 "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
144 block, save_nodes[i - 1], i - 1, save_nodes[i], i,
145 save_time_step[i - 1], save_time_step[i]));
150 /* Restore the old time steps */
152 sched_foreach(block, irn) {
153 sched_info_t *info = get_irn_sched_info(irn);
154 info->time_step = save_time_step[i++];
157 /* Check for all nodes in the block if they are scheduled. */
158 foreach_out_edge(block, edge) {
159 ir_node *irn = get_edge_src_irn(edge);
160 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn)) {
161 DBG((dbg_sched, LEVEL_DEFAULT,
162 "%+F: %+F is in block but not scheduled\n", block, irn));
167 del_pset(scheduled_nodes);
168 free(save_time_step);
169 free((void *) save_nodes);
174 * Block-Walker: verify the current block and update the status
176 static void sched_verify_walker(ir_node *block, void *data)
179 *res &= sched_verify(block);
182 /* Verify the schedules in all blocks of the irg. */
183 int sched_verify_irg(ir_graph *irg)
186 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
191 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
192 arch_env_t *ae = data;
193 return arch_irn_class_is(ae, irn, branch);
196 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
200 /* Skip nodes in a schedule. */
201 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
203 const ir_node *bl = get_block(from);
208 from = sched_next(from);
209 for (curr = from; curr != bl && predicator(curr, data); curr = sched_next(curr)) {
213 from = sched_prev(from);
214 for (curr = from; curr != bl && predicator(curr, data); curr = sched_prev(curr)) {
221 //---------------------------------------------------------------------------
223 typedef struct remove_dead_nodes_env_t_ {
226 } remove_dead_nodes_env_t;
229 * Post-walker: remember all visited nodes in a bitset.
231 static void mark_dead_nodes_walker(ir_node *node, void *data)
233 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
234 bitset_set(env->reachable, get_irn_idx(node));
239 * Walk through the schedule of every block and remove all dead nodes from it.
241 static void remove_dead_nodes_walker(ir_node *block, void *data)
243 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
244 ir_node *node, *next;
246 for (node = sched_first(block); ! sched_is_end(node); node = next) {
249 /* get next node now, as after calling sched_remove it will be invalid */
250 next = sched_next(node);
252 if (bitset_is_set(env->reachable, get_irn_idx(node)))
257 /* when a node is exchanged, it is turned into Bad, do not set ins for those */
261 for (i = get_irn_arity(node) - 1; i >= 0; --i)
262 set_irn_n(node, i, new_r_Bad(env->irg));
266 void be_remove_dead_nodes_from_schedule(ir_graph *irg)
268 remove_dead_nodes_env_t env;
270 env.reachable = bitset_alloca(get_irg_last_idx(irg));
272 // mark all reachable nodes
273 irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
275 // walk schedule and remove non-marked nodes
276 irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);