10 #include "besched_t.h"
12 #include "belistsched.h"
14 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
15 FIRM_IMPL1(sched_has_succ, int, const ir_node *)
16 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
17 FIRM_IMPL1(sched_succ, ir_node *, const ir_node *)
18 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
19 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
20 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
21 FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
22 FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
24 size_t sched_irn_data_offset = 0;
26 static void block_sched_dumper(ir_node *block, void *env)
31 ir_fprintf(f, "%n:\n", block);
32 sched_foreach(block, curr) {
33 ir_fprintf(f, "\t%n\n", curr);
37 void be_sched_dump(FILE *f, const ir_graph *irg)
39 irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f);
42 void be_sched_init(void)
44 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
45 firm_dbg_register("be.sched");
48 void be_sched_test(void)
55 for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
56 ir_graph *irg = get_irp_irg(i);
58 list_sched(irg, trivial_selector);
59 be_sched_dump(stdout, irg);
62 obstack_free(&obst, NULL);
65 void sched_renumber(const ir_node *block)
69 sched_timestep_t step = 0;
71 sched_foreach(block, irn) {
72 inf = get_irn_sched_info(irn);
73 inf->time_step = step;
74 step += SCHED_INITIAL_GRANULARITY;
79 int sched_verify(const ir_node *block)
81 firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
87 /* Count the number of nodes in the schedule. */
89 sched_foreach(block, irn)
92 save_time_step = malloc(n * sizeof(save_time_step[0]));
95 sched_foreach(block, irn) {
96 sched_info_t *info = get_irn_sched_info(irn);
97 save_time_step[i] = info->time_step;
104 * Check if each relevant operand of a node is scheduled before
107 sched_foreach(block, irn) {
109 int step = sched_get_time_step(irn);
111 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
112 ir_node *op = get_irn_n(irn, i);
114 if(mode_is_datab(get_irn_mode(op))
115 && get_nodes_block(op) == block
116 && sched_get_time_step(op) > step) {
118 DBG((dbg_sched, LEVEL_DEFAULT,
119 "%n is operand of %n but scheduled after", op, irn));
125 /* Check, if the time steps are correct */
126 for(i = 1; i < n; ++i) {
127 if(save_time_step[i] - save_time_step[i - 1] <= 0) {
128 DBG((dbg_sched, LEVEL_DEFAULT,
129 "position %d: time step shrinks (from %d to %d)\n",
130 i, save_time_step[i - 1], save_time_step[i]));
135 /* Restore the old time steps */
137 sched_foreach(block, irn) {
138 sched_info_t *info = get_irn_sched_info(irn);
139 info->time_step = save_time_step[i++];
142 free(save_time_step);
146 static void sched_verify_walker(ir_node *irn, void *data)
149 *res &= sched_verify(irn);
152 int sched_verify_irg(ir_graph *irg)
155 irg_block_walk_graph(irg, sched_verify_walker, NULL, &res);