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));
57 firm_dbg_register("be.sched");
60 void sched_renumber(const ir_node *block)
64 sched_timestep_t step = 0;
66 sched_foreach(block, irn) {
67 inf = get_irn_sched_info(irn);
68 inf->time_step = step;
69 step += SCHED_INITIAL_GRANULARITY;
73 /* Verify a schedule. */
74 int sched_verify(const ir_node *block)
76 firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
81 const ir_node **save_nodes;
82 const ir_edge_t *edge;
83 pset *scheduled_nodes = pset_new_ptr_default();
85 firm_dbg_set_mask(dbg_sched, -1);
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));
158 del_pset(scheduled_nodes);
159 free(save_time_step);
160 free((void *) save_nodes);
165 * Block-Walker: verify the current block and update the status
167 static void sched_verify_walker(ir_node *block, void *data)
170 *res &= sched_verify(block);
173 /* Verify the schedules in all blocks of the irg. */
174 int sched_verify_irg(ir_graph *irg)
177 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
182 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
183 arch_env_t *ae = data;
184 return arch_irn_classify(ae, irn) == arch_irn_class_branch;
187 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
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));