11 #include "besched_t.h"
13 #include "belistsched.h"
15 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
16 FIRM_IMPL1(sched_has_next, int, const ir_node *)
17 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
18 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
19 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
20 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
21 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
22 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
23 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
25 size_t sched_irn_data_offset = 0;
27 static void block_sched_dumper(ir_node *block, void *env)
32 ir_fprintf(f, "%+F:\n", block);
33 sched_foreach(block, curr) {
34 sched_info_t *info = get_irn_sched_info(curr);
35 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
39 void be_sched_dump(FILE *f, const ir_graph *irg)
41 irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f);
44 void be_sched_init(void)
46 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
47 firm_dbg_register("be.sched");
50 void be_sched_test(void)
57 for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
58 ir_graph *irg = get_irp_irg(i);
60 list_sched(irg, trivial_selector);
61 be_sched_dump(stdout, irg);
64 obstack_free(&obst, NULL);
67 void sched_renumber(const ir_node *block)
71 sched_timestep_t step = 0;
73 sched_foreach(block, irn) {
74 inf = get_irn_sched_info(irn);
75 inf->time_step = step;
76 step += SCHED_INITIAL_GRANULARITY;
81 int sched_verify(const ir_node *block)
83 firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
88 const ir_edge_t *edge;
89 pset *scheduled_nodes = pset_new_ptr_default();
91 firm_dbg_set_mask(dbg_sched, -1);
93 /* Count the number of nodes in the schedule. */
95 sched_foreach(block, irn)
98 save_time_step = malloc(n * sizeof(save_time_step[0]));
101 sched_foreach(block, irn) {
102 sched_info_t *info = get_irn_sched_info(irn);
103 save_time_step[i] = info->time_step;
105 pset_insert_ptr(scheduled_nodes, irn);
111 * Check if each relevant operand of a node is scheduled before
114 sched_foreach(block, irn) {
116 int step = sched_get_time_step(irn);
118 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
119 ir_node *op = get_irn_n(irn, i);
121 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 "%n is operand of %n but scheduled after", 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 "position %d: time step shrinks (from %d to %d)\n",
137 i, save_time_step[i - 1], save_time_step[i]));
142 /* Restore the old time steps */
144 sched_foreach(block, irn) {
145 sched_info_t *info = get_irn_sched_info(irn);
146 info->time_step = save_time_step[i++];
149 /* Check for all nodes in the block if they are scheduled. */
150 foreach_out_edge(block, edge) {
151 ir_node *irn = get_edge_src_irn(edge);
152 if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn))
153 DBG((dbg_sched, LEVEL_DEFAULT, "%+F is in block but not scheduled\n", irn));
156 del_pset(scheduled_nodes);
157 free(save_time_step);
161 static void sched_verify_walker(ir_node *irn, void *data)
164 *res &= sched_verify(irn);
167 int sched_verify_irg(ir_graph *irg)
170 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);