X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeschedtrivial.c;h=d05a0a98e420aecdcc845eae7f74981153b74b45;hb=0318dc1a48ce72b311592c28affc31fabc95f026;hp=4c03acedfb78ebca887ca5b04765b0f1ccd074ff;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm diff --git a/ir/be/beschedtrivial.c b/ir/be/beschedtrivial.c index 4c03acedf..d05a0a98e 100644 --- a/ir/be/beschedtrivial.c +++ b/ir/be/beschedtrivial.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -18,34 +18,39 @@ */ /** - * Trivial node selector. - * @author Christian Wuerdig - * @date 29.08.2006 - * @cvs-id $Id$ + * @file + * @brief Trivial node selector. + * @author Sebastian Hack + * @date 29.08.2006 + * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include -#include "besched_t.h" +#include "irgraph.h" +#include "irnode.h" +#include "irnodeset.h" + +#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) { - const arch_env_t *arch_env = block_env; - ir_node *irn = NULL; - ir_nodeset_iterator_t iter; + ir_node *irn; + ir_nodeset_iterator_t iter; + (void)block_env; /* assure that branches and constants are executed last */ foreach_ir_nodeset(ready_set, irn, iter) { - if (! arch_irn_class_is(arch_env, irn, branch)) { + if (!is_cfop(irn)) { return irn; } } @@ -57,27 +62,35 @@ static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set, ir_node return irn; } -static void *trivial_init_graph(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg) +static void *trivial_init_graph(ir_graph *irg) { - return (void *)arch_env; + (void)irg; + return NULL; } -static void *trivial_init_block(void *graph_env, ir_node *bl) +static void *trivial_init_block(void *graph_env, ir_node *block) { - return graph_env; + (void)graph_env; + (void)block; + return NULL; } -static const list_sched_selector_t trivial_selector_struct = { - 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); +} -const list_sched_selector_t *trivial_selector = &trivial_selector_struct; +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trivial); +void be_init_sched_trivial(void) +{ + be_register_scheduler("trivial", sched_trivial); +}