X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeschedtrivial.c;h=4fe8a181fa9a27d72d480a6ce23f572a27228161;hb=fd96240794b2bc719ca2da1e2415ae9cef8d475a;hp=5bc61f1cb640a5f883773e14c0d8193f0bdc5998;hpb=65a52a96e8ab7ed601d7f98c516d37c46b674b4a;p=libfirm diff --git a/ir/be/beschedtrivial.c b/ir/be/beschedtrivial.c index 5bc61f1cb..4fe8a181f 100644 --- a/ir/be/beschedtrivial.c +++ b/ir/be/beschedtrivial.c @@ -22,7 +22,6 @@ * @brief Trivial node selector. * @author Sebastian Hack * @date 29.08.2006 - * @version $Id$ */ #include "config.h" @@ -34,19 +33,17 @@ #include "bearch.h" #include "belistsched.h" +#include "bemodule.h" +#include "besched.h" /** * The trivial selector: * Just assure that branches are executed last, otherwise select * the first node ready. */ -static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set, - ir_nodeset_t *live_set) +static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set) { - ir_node *irn; - ir_nodeset_iterator_t iter; (void)block_env; - (void)live_set; /* assure that branches and constants are executed last */ foreach_ir_nodeset(ready_set, irn, iter) { @@ -56,15 +53,11 @@ static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set, } /* at last: schedule branches */ - ir_nodeset_iterator_init(&iter, ready_set); - irn = ir_nodeset_iterator_next(&iter); - - return irn; + return ir_nodeset_first(ready_set); } -static void *trivial_init_graph(const list_sched_selector_t *vtab, ir_graph *irg) +static void *trivial_init_graph(ir_graph *irg) { - (void)vtab; (void)irg; return NULL; } @@ -76,15 +69,22 @@ static void *trivial_init_block(void *graph_env, ir_node *block) return NULL; } -const list_sched_selector_t trivial_selector = { - trivial_init_graph, - trivial_init_block, - trivial_select, - NULL, /* to_appear_in_schedule */ - NULL, /* node_ready */ - NULL, /* node_selected */ - NULL, /* exectime */ - NULL, /* latency */ - NULL, /* finish_block */ - NULL /* finish_graph */ -}; +static void sched_trivial(ir_graph *irg) +{ + static const list_sched_selector_t trivial_selector = { + trivial_init_graph, + trivial_init_block, + trivial_select, + NULL, /* node_ready */ + NULL, /* node_selected */ + NULL, /* finish_block */ + NULL /* finish_graph */ + }; + be_list_sched_graph(irg, &trivial_selector); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trivial) +void be_init_sched_trivial(void) +{ + be_register_scheduler("trivial", sched_trivial); +}