11 #include "iredges_t.h"
14 #include "besched_t.h"
16 #include "belistsched.h"
18 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
19 FIRM_IMPL1(sched_has_next, int, const ir_node *)
20 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
21 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
22 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
23 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
24 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
25 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
26 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
27 FIRM_IMPL1_VOID(sched_remove, ir_node *)
29 size_t sched_irn_data_offset = 0;
31 static void block_sched_dumper(ir_node *block, void *env)
36 ir_fprintf(f, "%+F:\n", block);
37 sched_foreach(block, curr) {
38 sched_info_t *info = get_irn_sched_info(curr);
39 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
43 void be_sched_dump(FILE *f, const ir_graph *irg)
45 irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f);
48 void be_sched_init(void)
50 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
51 firm_dbg_register("be.sched");
54 void be_sched_test(void)
61 for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
62 ir_graph *irg = get_irp_irg(i);
64 list_sched(irg, trivial_selector);
65 be_sched_dump(stdout, irg);
68 obstack_free(&obst, NULL);
71 void sched_renumber(const ir_node *block)
75 sched_timestep_t step = 0;
77 sched_foreach(block, irn) {
78 inf = get_irn_sched_info(irn);
79 inf->time_step = step;
80 step += SCHED_INITIAL_GRANULARITY;
85 int sched_verify(const ir_node *block)
87 firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
92 const ir_node **save_nodes;
93 const ir_edge_t *edge;
94 pset *scheduled_nodes = pset_new_ptr_default();
96 firm_dbg_set_mask(dbg_sched, -1);
98 /* Count the number of nodes in the schedule. */
100 sched_foreach(block, irn)
106 save_time_step = malloc(n * sizeof(save_time_step[0]));
107 save_nodes = malloc(n * sizeof(save_nodes[0]));
110 sched_foreach(block, irn) {
111 sched_info_t *info = get_irn_sched_info(irn);
112 save_time_step[i] = info->time_step;
115 pset_insert_ptr(scheduled_nodes, irn);
121 * Check if each relevant operand of a node is scheduled before
124 sched_foreach(block, irn) {
126 int step = sched_get_time_step(irn);
128 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
129 ir_node *op = get_irn_n(irn, i);
131 if(to_appear_in_schedule(op)
133 && get_nodes_block(op) == block
134 && sched_get_time_step(op) > step) {
136 DBG((dbg_sched, LEVEL_DEFAULT,
137 "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
143 /* Check, if the time steps are correct */
144 for(i = 1; i < n; ++i) {
145 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
146 DBG((dbg_sched, LEVEL_DEFAULT,
147 "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
148 block, save_nodes[i - 1], i - 1, save_nodes[i], i,
149 save_time_step[i - 1], save_time_step[i]));
154 /* Restore the old time steps */
156 sched_foreach(block, irn) {
157 sched_info_t *info = get_irn_sched_info(irn);
158 info->time_step = save_time_step[i++];
161 /* Check for all nodes in the block if they are scheduled. */
162 foreach_out_edge(block, edge) {
163 ir_node *irn = get_edge_src_irn(edge);
164 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn))
165 DBG((dbg_sched, LEVEL_DEFAULT,
166 "%+F: %+F is in block but not scheduled\n", block, irn));
169 del_pset(scheduled_nodes);
170 free(save_time_step);
175 static void sched_verify_walker(ir_node *irn, void *data)
178 *res &= sched_verify(irn);
181 int sched_verify_irg(ir_graph *irg)
184 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);