9 #include "belistsched.h"
11 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
12 FIRM_IMPL1(sched_has_succ, int, const ir_node *)
13 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
14 FIRM_IMPL1(sched_succ, ir_node *, const ir_node *)
15 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
16 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
17 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
19 size_t sched_irn_data_offset = 0;
21 static void block_sched_dumper(ir_node *block, void *env)
26 ir_fprintf(f, "%n:\n", block);
27 sched_foreach(block, curr) {
28 ir_fprintf(f, "\t%n\n", curr);
32 void be_sched_dump(FILE *f, const ir_graph *irg)
34 irg_block_walk_graph((ir_graph *) irg, block_sched_dumper, NULL, f);
37 void be_sched_init(void)
39 sched_irn_data_offset = register_additional_node_data(sizeof(sched_info_t));
42 void be_sched_test(void)
49 for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
50 ir_graph *irg = get_irp_irg(i);
52 list_sched(irg, trivial_selector, NULL);
53 be_sched_dump(stdout, irg);
56 obstack_free(&obst, NULL);