11 #include "iredges_t.h"
15 #include "besched_t.h"
17 #include "belistsched.h"
19 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
20 FIRM_IMPL1(sched_has_next, int, const ir_node *)
21 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
22 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
23 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
24 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
25 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
26 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
27 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
28 FIRM_IMPL1_VOID(sched_remove, ir_node *)
30 size_t sched_irn_data_offset = 0;
32 static void block_sched_dumper(ir_node *block, void *env)
37 ir_fprintf(f, "%+F:\n", block);
38 sched_foreach(block, curr) {
39 sched_info_t *info = get_irn_sched_info(curr);
40 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
44 void be_sched_dump(FILE *f, const ir_graph *irg)
46 irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f);
49 void be_sched_init(void)
51 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
52 firm_dbg_register("be.sched");
55 void be_sched_test(void)
62 for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
63 ir_graph *irg = get_irp_irg(i);
65 list_sched(irg, trivial_selector);
66 be_sched_dump(stdout, irg);
69 obstack_free(&obst, NULL);
72 void sched_renumber(const ir_node *block)
76 sched_timestep_t step = 0;
78 sched_foreach(block, irn) {
79 inf = get_irn_sched_info(irn);
80 inf->time_step = step;
81 step += SCHED_INITIAL_GRANULARITY;
86 int sched_verify(const ir_node *block)
88 firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
93 const ir_node **save_nodes;
94 const ir_edge_t *edge;
95 pset *scheduled_nodes = pset_new_ptr_default();
97 firm_dbg_set_mask(dbg_sched, -1);
99 /* Count the number of nodes in the schedule. */
101 sched_foreach(block, irn)
107 save_time_step = malloc(n * sizeof(save_time_step[0]));
108 save_nodes = malloc(n * sizeof(save_nodes[0]));
111 sched_foreach(block, irn) {
112 sched_info_t *info = get_irn_sched_info(irn);
113 save_time_step[i] = info->time_step;
116 pset_insert_ptr(scheduled_nodes, irn);
122 * Check if each relevant operand of a node is scheduled before
125 sched_foreach(block, irn) {
127 int step = sched_get_time_step(irn);
129 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
130 ir_node *op = get_irn_n(irn, i);
132 if(to_appear_in_schedule(op)
134 && get_nodes_block(op) == block
135 && sched_get_time_step(op) > step) {
137 DBG((dbg_sched, LEVEL_DEFAULT,
138 "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
144 /* Check, if the time steps are correct */
145 for(i = 1; i < n; ++i) {
146 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
147 DBG((dbg_sched, LEVEL_DEFAULT,
148 "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
149 block, save_nodes[i - 1], i - 1, save_nodes[i], i,
150 save_time_step[i - 1], save_time_step[i]));
155 /* Restore the old time steps */
157 sched_foreach(block, irn) {
158 sched_info_t *info = get_irn_sched_info(irn);
159 info->time_step = save_time_step[i++];
162 /* Check for all nodes in the block if they are scheduled. */
163 foreach_out_edge(block, edge) {
164 ir_node *irn = get_edge_src_irn(edge);
165 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn))
166 DBG((dbg_sched, LEVEL_DEFAULT,
167 "%+F: %+F is in block but not scheduled\n", block, irn));
170 del_pset(scheduled_nodes);
171 free(save_time_step);
176 static void sched_verify_walker(ir_node *irn, void *data)
179 *res &= sched_verify(irn);
182 int sched_verify_irg(ir_graph *irg)
185 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);
190 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
191 arch_env_t *ae = data;
192 return arch_irn_classify(ae, irn) == arch_irn_class_branch;
195 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
199 extern ir_node *sched_skip(ir_node *from, int forward,
200 sched_predicator_t *predicator, void *data)
202 const ir_node *bl = get_block(from);
205 for(curr = from; curr != bl && predicator(curr, data);
206 curr = forward ? sched_next(curr) : sched_prev(curr));