X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelistsched.c;h=300f9204945f1bda9dca244116a91ba7e63e95d2;hb=8cb8fe7d9d69a9bd06365823d5d5f68d051f6db0;hp=498cf28d469139dae495e8acd9192dae3d1934d4;hpb=da48a7f7266cfe6274fc4d159d63bba245724222;p=libfirm diff --git a/ir/be/belistsched.c b/ir/be/belistsched.c index 498cf28d4..300f92049 100644 --- a/ir/be/belistsched.c +++ b/ir/be/belistsched.c @@ -1,11 +1,29 @@ -/** - * Scheduling algorithms. - * Just a simple list scheduling algorithm is here. - * @date 20.10.2004 - * @author Sebastian Hack - * @cvs-id $Id$ +/* + * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ +/** + * @file + * @brief Primitive list scheduling with different node selectors. + * @author Sebastian Hack + * @date 20.10.2004 + * @version $Id$ + */ #ifdef HAVE_CONFIG_H #include "config.h" #endif @@ -39,13 +57,16 @@ #include "belistsched.h" #include "beschedmris.h" #include "beschedrss.h" -#include "bearch.h" +#include "bearch_t.h" #include "bestat.h" +#include "beirg_t.h" -#ifdef WITH_LIBCORE #include #include -#endif /* WITH_LIBCORE */ + +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL); + +#define BE_SCHED_NODE(irn) (be_is_Keep(irn) || be_is_CopyKeep(irn) || be_is_RegParams(irn)) enum { BE_SCHED_SELECT_TRIVIAL = 0, @@ -72,7 +93,6 @@ static list_sched_options_t list_sched_options = { BE_SCHED_PREP_NONE, /* no scheduling preparation */ }; -#ifdef WITH_LIBCORE /* schedule selector options. */ static const lc_opt_enum_int_items_t sched_select_items[] = { { "trivial", BE_SCHED_SELECT_TRIVIAL }, @@ -105,7 +125,6 @@ static const lc_opt_table_entry_t list_sched_option_table[] = { LC_OPT_ENT_ENUM_PTR("select", "node selector", &sched_select_var), { NULL } }; -#endif /* WITH_LIBCORE */ /** * All scheduling info needed per node. @@ -131,13 +150,12 @@ typedef struct _sched_env_t { */ typedef struct _block_sched_env_t { sched_irn_t *sched_info; /**< scheduling info per node, copied from the global scheduler object */ - nodeset *cands; /**< the set of candidates */ + ir_nodeset_t cands; /**< the set of candidates */ ir_node *block; /**< the current block */ sched_env_t *sched_env; /**< the scheduler environment */ - nodeset *live; /**< simple liveness during scheduling */ + ir_nodeset_t live; /**< simple liveness during scheduling */ const list_sched_selector_t *selector; void *selector_block_env; - DEBUG_ONLY(firm_dbg_module_t *dbg;) } block_sched_env_t; /** @@ -173,39 +191,39 @@ static INLINE int make_ready(block_sched_env_t *env, ir_node *pred, ir_node *irn { int i, n; - /* Blocks cannot be scheduled. */ - if (is_Block(irn) || get_irn_n_edges(irn) == 0) - return 0; + /* Blocks cannot be scheduled. */ + if (is_Block(irn) || get_irn_n_edges(irn) == 0) + return 0; - /* - * Check, if the given ir node is in a different block as the - * currently scheduled one. If that is so, don't make the node ready. - */ - if (env->block != get_nodes_block(irn)) - return 0; + /* + * Check, if the given ir node is in a different block as the + * currently scheduled one. If that is so, don't make the node ready. + */ + if (env->block != get_nodes_block(irn)) + return 0; for (i = 0, n = get_irn_ins_or_deps(irn); i < n; ++i) { - ir_node *op = get_irn_in_or_dep(irn, i); - - /* if irn is an End we have keep-alives and op might be a block, skip that */ - if (is_Block(op)) { - assert(get_irn_op(irn) == op_End); - continue; - } - - /* If the operand is local to the scheduled block and not yet - * scheduled, this nodes cannot be made ready, so exit. */ - if (! is_already_scheduled(env, op) && get_nodes_block(op) == env->block) - return 0; - } + ir_node *op = get_irn_in_or_dep(irn, i); - nodeset_insert(env->cands, irn); + /* if irn is an End we have keep-alives and op might be a block, skip that */ + if (is_Block(op)) { + assert(get_irn_op(irn) == op_End); + continue; + } + + /* If the operand is local to the scheduled block and not yet + * scheduled, this nodes cannot be made ready, so exit. */ + if (! is_already_scheduled(env, op) && get_nodes_block(op) == env->block) + return 0; + } + + ir_nodeset_insert(&env->cands, irn); /* Notify selector about the ready node. */ if (env->selector->node_ready) env->selector->node_ready(env->selector_block_env, irn, pred); - DB((env->dbg, LEVEL_2, "\tmaking ready: %+F\n", irn)); + DB((dbg, LEVEL_2, "\tmaking ready: %+F\n", irn)); return 1; } @@ -213,7 +231,7 @@ static INLINE int make_ready(block_sched_env_t *env, ir_node *pred, ir_node *irn /** * Try, to make all users of a node ready. * In fact, a usage node can only be made ready, if all its operands - * have already been scheduled yet. This is checked my make_ready(). + * have already been scheduled yet. This is checked by make_ready(). * @param env The block schedule environment. * @param irn The node, which usages (successors) are to be made ready. */ @@ -314,9 +332,9 @@ static void update_sched_liveness(block_sched_env_t *env, ir_node *irn) { in = get_Proj_pred(in); /* if in is still in the live set: reduce number of users by one */ - if (nodeset_find(env->live, in)) { + if (ir_nodeset_contains(&env->live, in)) { if (add_irn_not_sched_user(env, in, -1) <= 0) - nodeset_remove(env->live, in); + ir_nodeset_remove(&env->live, in); } } @@ -329,7 +347,7 @@ static void update_sched_liveness(block_sched_env_t *env, ir_node *irn) { i = get_num_successors(irn); if (i > 0) { set_irn_not_sched_user(env, irn, i); - nodeset_insert(env->live, irn); + ir_nodeset_insert(&env->live, irn); } } @@ -337,10 +355,13 @@ static INLINE int must_appear_in_schedule(const list_sched_selector_t *sel, void { int res = -1; - if(sel->to_appear_in_schedule) + if (get_irn_n_edges(irn) < 1) + return 0; + + if (sel->to_appear_in_schedule) res = sel->to_appear_in_schedule(block_env, irn); - return res >= 0 ? res : (to_appear_in_schedule(irn) || be_is_Keep(irn) || be_is_CopyKeep(irn) || be_is_RegParams(irn)); + return res >= 0 ? res : ((to_appear_in_schedule(irn) || BE_SCHED_NODE(irn)) && ! is_Unknown(irn)); } /** @@ -357,7 +378,7 @@ static ir_node *add_to_sched(block_sched_env_t *env, ir_node *irn) update_sched_liveness(env, irn); sched_add_before(env->block, irn); - DBG((env->dbg, LEVEL_2, "\tadding %+F\n", irn)); + DBG((dbg, LEVEL_2, "\tadding %+F\n", irn)); } /* notify the selector about the finally selected node. */ @@ -368,8 +389,7 @@ static ir_node *add_to_sched(block_sched_env_t *env, ir_node *irn) mark_already_scheduled(env, irn); /* Remove the node from the ready set */ - if(nodeset_find(env->cands, irn)) - nodeset_remove(env->cands, irn); + ir_nodeset_remove(&env->cands, irn); return irn; } @@ -390,7 +410,7 @@ static void add_tuple_projs(block_sched_env_t *env, ir_node *irn) assert(get_irn_mode(irn) == mode_T && "Mode of node must be tuple"); - if(is_Bad(irn)) + if (is_Bad(irn)) return; @@ -443,13 +463,12 @@ static void list_sched_block(ir_node *block, void *env_ptr) /* Initialize the block scheduling environment */ be.sched_info = env->sched_info; be.block = block; - be.cands = new_nodeset(get_irn_n_edges(block)); - be.live = new_nodeset(get_irn_n_edges(block)); + ir_nodeset_init_size(&be.cands, get_irn_n_edges(block)); + ir_nodeset_init_size(&be.live, get_irn_n_edges(block)); be.selector = selector; be.sched_env = env; - FIRM_DBG_REGISTER(be.dbg, "firm.be.sched"); - DBG((be.dbg, LEVEL_1, "scheduling %+F\n", block)); + DBG((dbg, LEVEL_1, "scheduling %+F\n", block)); if (selector->init_block) be.selector_block_env = selector->init_block(env->selector_env, block); @@ -499,31 +518,31 @@ static void list_sched_block(ir_node *block, void *env_ptr) /* Make the node ready, if all operands live in a foreign block */ if (ready) { - DBG((be.dbg, LEVEL_2, "\timmediately ready: %+F\n", irn)); + DBG((dbg, LEVEL_2, "\timmediately ready: %+F\n", irn)); make_ready(&be, NULL, irn); } } } /* Iterate over all remaining nodes */ - while (nodeset_count(be.cands) > 0) { + while (ir_nodeset_size(&be.cands) > 0) { + ir_nodeset_iterator_t iter; /* collect statistics about amount of ready nodes */ - be_do_stat_sched_ready(block, be.cands); + be_do_stat_sched_ready(block, &be.cands); /* Keeps must be scheduled immediatly */ - foreach_nodeset(be.cands, irn) { - if (be_is_Keep(irn) || be_is_CopyKeep(irn) || get_irn_mode(irn) == mode_M) { - nodeset_break(be.cands); + foreach_ir_nodeset(&be.cands, irn, iter) { + if (be_is_Keep(irn) || be_is_CopyKeep(irn) || is_Sync(irn)) { break; } } if (! irn) { /* Keeps must be immediately scheduled */ - irn = be.selector->select(be.selector_block_env, be.cands, be.live); + irn = be.selector->select(be.selector_block_env, &be.cands, &be.live); } - DB((be.dbg, LEVEL_2, "\tpicked node %+F\n", irn)); + DB((dbg, LEVEL_2, "\tpicked node %+F\n", irn)); /* Add the node to the schedule. */ add_to_sched(&be, irn); @@ -534,15 +553,14 @@ static void list_sched_block(ir_node *block, void *env_ptr) make_users_ready(&be, irn); /* remove the scheduled node from the ready list. */ - if (nodeset_find(be.cands, irn)) - nodeset_remove(be.cands, irn); + ir_nodeset_remove(&be.cands, irn); } if (selector->finish_block) selector->finish_block(be.selector_block_env); - del_nodeset(be.cands); - del_nodeset(be.live); + ir_nodeset_destroy(&be.cands); + ir_nodeset_destroy(&be.live); } /* List schedule a graph. */ @@ -578,9 +596,16 @@ void list_sched(const be_irg_t *birg, be_options_t *be_opts) memcpy(&sel, trivial_selector, sizeof(sel)); } - /* Assure, that the out edges are computed */ +#if 1 + /* Matze: This is very slow, we should avoid it to improve backend speed, + * we just have to make sure that we have no dangling out-edges at this + * point... + */ + + /* Assure, that we have no dangling out-edges to deleted stuff */ edges_deactivate(birg->irg); edges_activate(birg->irg); +#endif switch (list_sched_options.prep) { case BE_SCHED_PREP_MRIS: @@ -619,7 +644,65 @@ void list_sched(const be_irg_t *birg, be_options_t *be_opts) DEL_ARR_F(env.sched_info); } -#ifdef WITH_LIBCORE +/* List schedule a block. */ +void list_sched_single_block(const be_irg_t *birg, ir_node *block, be_options_t *be_opts) +{ + const arch_env_t *arch_env = birg->main_env->arch_env; + ir_graph *irg = birg->irg; + + int num_nodes; + sched_env_t env; + list_sched_selector_t sel; + + /* Select a scheduler based on backend options */ + switch (list_sched_options.select) { + case BE_SCHED_SELECT_TRIVIAL: + memcpy(&sel, trivial_selector, sizeof(sel)); + break; + case BE_SCHED_SELECT_RANDOM: + memcpy(&sel, random_selector, sizeof(sel)); + break; + case BE_SCHED_SELECT_REGPRESS: + memcpy(&sel, reg_pressure_selector, sizeof(sel)); + break; + case BE_SCHED_SELECT_MUCHNIK: + memcpy(&sel, muchnik_selector, sizeof(sel)); + break; + case BE_SCHED_SELECT_HEUR: + memcpy(&sel, heuristic_selector, sizeof(sel)); + break; + case BE_SCHED_SELECT_HMUCHNIK: + default: + memcpy(&sel, trivial_selector, sizeof(sel)); + } + + /* Assure, that the out edges are computed */ + edges_deactivate(birg->irg); + edges_activate(birg->irg); + + num_nodes = get_irg_last_idx(irg); + + /* initialize environment for list scheduler */ + memset(&env, 0, sizeof(env)); + env.selector = arch_env->isa->impl->get_list_sched_selector(arch_env->isa, &sel); + env.arch_env = arch_env; + env.irg = irg; + env.sched_info = NEW_ARR_F(sched_irn_t, num_nodes); + + memset(env.sched_info, 0, num_nodes * sizeof(env.sched_info[0])); + + if (env.selector->init_graph) + env.selector_env = env.selector->init_graph(env.selector, arch_env, irg); + + /* Schedule block. */ + list_sched_block(block, &env); + + if (env.selector->finish_graph) + env.selector->finish_graph(env.selector_env); + + DEL_ARR_F(env.sched_info); +} + /** * Register list scheduler options. */ @@ -628,7 +711,8 @@ void be_init_listsched(void) { lc_opt_entry_t *sched_grp = lc_opt_get_grp(be_grp, "listsched"); lc_opt_add_table(sched_grp, list_sched_option_table); + + FIRM_DBG_REGISTER(dbg, "firm.be.sched"); } BE_REGISTER_MODULE_CONSTRUCTOR(be_init_listsched); -#endif /* WITH_LIBCORE */