X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_main.c;h=278b5c282a0785fbc8847f4649d59726be39e9f1;hb=dfc341ac6f54b4b0922d605e28333be76f487c68;hp=78274f847126d92caa0a8369c4c99cffe8fbdaaf;hpb=bd98b8604bd9ac2eb16c6d07297d5b8cff2d7f0f;p=libfirm diff --git a/ir/be/bechordal_main.c b/ir/be/bechordal_main.c index 78274f847..278b5c282 100644 --- a/ir/be/bechordal_main.c +++ b/ir/be/bechordal_main.c @@ -1,18 +1,34 @@ -/** - * @file bechordal_main.c - * @date 29.11.2005 - * @author Sebastian Hack - * @cvs-id $Id$ +/* + * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. * - * Copyright (C) 2005-2006 Universitaet Karlsruhe - * Released under the GPL + * 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. * - * Driver for the chordal register allocator. + * 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 Driver for the chordal register allocator. + * @author Sebastian Hack + * @date 29.11.2005 + * @version $Id$ */ #ifdef HAVE_CONFIG_H #include "config.h" #endif +#include #include #include "obst.h" @@ -22,11 +38,9 @@ #include "iterator.h" #include "firm_config.h" -#ifdef WITH_LIBCORE #include #include #include -#endif /* WITH_LIBCORE */ #include "ircons_t.h" #include "irmode_t.h" @@ -43,6 +57,7 @@ #include "debug.h" #include "xmalloc.h" #include "execfreq.h" +#include "iredges_t.h" #include "bechordal_t.h" #include "beabi.h" @@ -51,13 +66,16 @@ #include "besched.h" #include "besched_t.h" #include "belive_t.h" -#include "bearch.h" +#include "bearch_t.h" #include "beifg_t.h" #include "beifg_impl.h" #include "benode_t.h" #include "bestatevent.h" #include "bestat.h" #include "bemodule.h" +#include "be_t.h" +#include "bera.h" +#include "beirg_t.h" #include "bespillbelady.h" #include "bespillmorgan.h" @@ -82,9 +100,6 @@ static be_ra_chordal_opts_t options = { BE_CH_VRFY_WARN, }; -/** Enable extreme live range splitting. */ -static int be_elr_split = 0; - typedef struct _post_spill_env_t { be_chordal_env_t cenv; be_irg_t *birg; @@ -155,7 +170,6 @@ static const lc_opt_table_entry_t be_chordal_options[] = { LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options", &lower_perm_var), LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var), LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options", &be_ch_vrfy_var), - LC_OPT_ENT_BOOL ("elrsplit", "enable extreme live range splitting", &be_elr_split), { NULL } }; @@ -202,7 +216,6 @@ static void memory_operand_walker(ir_node *irn, void *env) { assert(src && "outedges broken!"); if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) { - DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src)); arch_perform_memory_operand(aenv, src, spill, pos); } } @@ -316,7 +329,6 @@ static unsigned int count_insns(ir_graph *irg) return cnt; } -#ifdef WITH_LIBCORE /** * Initialize all timers. */ @@ -346,6 +358,8 @@ static void be_init_timer(be_options_t *main_opts) LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa); LC_STOP_AND_RESET_TIMER(ra_timer.t_verify); LC_STOP_AND_RESET_TIMER(ra_timer.t_other); + + global_ra_timer = &ra_timer; } } @@ -371,13 +385,6 @@ static void be_init_timer(be_options_t *main_opts) lc_timer_get_name(tmp), lc_timer_get_name(timer)); \ timer = tmp; \ } -#else - -#define BE_TIMER_INIT(main_opts) -#define BE_TIMER_PUSH(timer) -#define BE_TIMER_POP(timer) - -#endif /* WITH_LIBCORE */ /** * Perform things which need to be done per register class before spilling. @@ -413,6 +420,7 @@ static void pre_spill(const arch_isa_t *isa, int cls_idx, post_spill_env_t *pse) if (be_stat_ev_is_active()) { pse->pre_spill_cost = be_estimate_irg_costs(birg->irg, birg->main_env->arch_env, birg->exec_freq); + be_stat_ev_pop(); } #endif /* FIRM_STATISTICS */ } @@ -426,114 +434,119 @@ static void post_spill(post_spill_env_t *pse, int iteration) { ir_graph *irg = birg->irg; const be_main_env_t *main_env = birg->main_env; be_options_t *main_opts = main_env->options; - static int splitted = 0; node_stat_t node_stat; + int colors_n = arch_register_class_n_regs(chordal_env->cls); + int allocatable_regs = colors_n - be_put_ignore_regs(birg, chordal_env->cls, NULL); + + /* some special classes contain only ignore regs, no work to be done */ + if (allocatable_regs > 0) { #ifdef FIRM_STATISTICS - if (be_stat_ev_is_active()) { - double spillcosts = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - pse->pre_spill_cost; + if (be_stat_ev_is_active()) { + double spillcosts = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - pse->pre_spill_cost; - be_stat_ev_l("spillcosts", (long) spillcosts); + be_stat_tags[STAT_TAG_CLS] = pse->cls->name; + be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file); - node_stats(birg, pse->cls, &node_stat); - be_stat_ev("phis_after_spill", node_stat.n_phis); - be_stat_ev("mem_phis", node_stat.n_mem_phis); - be_stat_ev("reloads", node_stat.n_reloads); - be_stat_ev("spills", node_stat.n_spills); - } -#endif /* FIRM_STATISTICS */ + be_stat_ev_l("spillcosts", (long) spillcosts); - /* - If we have a backend provided spiller, post spill is - called in a loop after spilling for each register class. - But we only need to fix stack nodes once in this case. - */ - if (iteration == 0) { - check_for_memory_operands(chordal_env); - be_abi_fix_stack_nodes(birg->abi, birg->lv); - } + node_stats(birg, pse->cls, &node_stat); + be_stat_ev("phis_after_spill", node_stat.n_phis); + be_stat_ev("mem_phis", node_stat.n_mem_phis); + be_stat_ev("reloads", node_stat.n_reloads); + be_stat_ev("spills", node_stat.n_spills); + } +#endif /* FIRM_STATISTICS */ - BE_TIMER_PUSH(ra_timer.t_verify); + /* + If we have a backend provided spiller, post spill is + called in a loop after spilling for each register class. + But we only need to fix stack nodes once in this case. + */ + if (iteration == 0) { + check_for_memory_operands(chordal_env); + be_abi_fix_stack_nodes(birg->abi); + } - /* verify schedule and register pressure */ - if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) { - be_verify_schedule(irg); - be_verify_register_pressure(birg, pse->cls, irg); - } - else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) { - assert(be_verify_schedule(irg) && "Schedule verification failed"); - assert(be_verify_register_pressure(birg, pse->cls, irg) - && "Register pressure verification failed"); - } - BE_TIMER_POP(ra_timer.t_verify); + BE_TIMER_PUSH(ra_timer.t_verify); - if (be_elr_split && ! splitted) { - extreme_liverange_splitting(chordal_env); - splitted = 1; - } + /* verify schedule and register pressure */ + if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) { + be_verify_schedule(birg); + be_verify_register_pressure(birg, pse->cls, irg); + } + else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) { + assert(be_verify_schedule(birg) && "Schedule verification failed"); + assert(be_verify_register_pressure(birg, pse->cls, irg) + && "Register pressure verification failed"); + } + BE_TIMER_POP(ra_timer.t_verify); - /* Color the graph. */ - BE_TIMER_PUSH(ra_timer.t_color); - be_ra_chordal_color(chordal_env); - BE_TIMER_POP(ra_timer.t_color); + /* Color the graph. */ + BE_TIMER_PUSH(ra_timer.t_color); + be_ra_chordal_color(chordal_env); + BE_TIMER_POP(ra_timer.t_color); - dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "-color", dump_ir_block_graph_sched); + dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "-color", dump_ir_block_graph_sched); - /* Create the ifg with the selected flavor */ - BE_TIMER_PUSH(ra_timer.t_ifg); - chordal_env->ifg = be_create_ifg(chordal_env); - BE_TIMER_POP(ra_timer.t_ifg); + /* Create the ifg with the selected flavor */ + BE_TIMER_PUSH(ra_timer.t_ifg); + chordal_env->ifg = be_create_ifg(chordal_env); + BE_TIMER_POP(ra_timer.t_ifg); #ifdef FIRM_STATISTICS - if (be_stat_ev_is_active()) { - be_ifg_stat_t stat; + if (be_stat_ev_is_active()) { + be_ifg_stat_t stat; - be_ifg_stat(birg, chordal_env->ifg, &stat); - be_stat_ev("ifg_nodes", stat.n_nodes); - be_stat_ev("ifg_edges", stat.n_edges); - be_stat_ev("ifg_comps", stat.n_comps); + be_ifg_stat(birg, chordal_env->ifg, &stat); + be_stat_ev("ifg_nodes", stat.n_nodes); + be_stat_ev("ifg_edges", stat.n_edges); + be_stat_ev("ifg_comps", stat.n_comps); - node_stats(birg, pse->cls, &node_stat); - be_stat_ev("perms_before_coal", node_stat.n_perms); - be_stat_ev("copies_before_coal", node_stat.n_copies); - } + node_stats(birg, pse->cls, &node_stat); + be_stat_ev("perms_before_coal", node_stat.n_perms); + be_stat_ev("copies_before_coal", node_stat.n_copies); + } #endif /* FIRM_STATISTICS */ - /* copy minimization */ - BE_TIMER_PUSH(ra_timer.t_copymin); - co_driver(chordal_env); - BE_TIMER_POP(ra_timer.t_copymin); + /* copy minimization */ + BE_TIMER_PUSH(ra_timer.t_copymin); + co_driver(chordal_env); + BE_TIMER_POP(ra_timer.t_copymin); - dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "-copymin", dump_ir_block_graph_sched); + dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "-copymin", dump_ir_block_graph_sched); - BE_TIMER_PUSH(ra_timer.t_ssa); + BE_TIMER_PUSH(ra_timer.t_ssa); - /* ssa destruction */ - be_ssa_destruction(chordal_env); + /* ssa destruction */ + be_ssa_destruction(chordal_env); - BE_TIMER_POP(ra_timer.t_ssa); + BE_TIMER_POP(ra_timer.t_ssa); - dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "-ssadestr", dump_ir_block_graph_sched); + dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "-ssadestr", dump_ir_block_graph_sched); - BE_TIMER_PUSH(ra_timer.t_verify); - if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) { - be_ssa_destruction_check(chordal_env); + BE_TIMER_PUSH(ra_timer.t_verify); + if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) { + be_ssa_destruction_check(chordal_env); + } + BE_TIMER_POP(ra_timer.t_verify); + +#ifdef FIRM_STATISTICS + if (be_stat_ev_is_active()) { + node_stats(birg, pse->cls, &node_stat); + be_stat_ev("perms_after_coal", node_stat.n_perms); + be_stat_ev("copies_after_coal", node_stat.n_copies); + be_stat_ev_pop(); + } +#endif /* FIRM_STATISTICS */ + + /* the ifg exists only if there are allocatable regs */ + be_ifg_free(chordal_env->ifg); } - BE_TIMER_POP(ra_timer.t_verify); - /* free some data structures */ - be_ifg_free(chordal_env->ifg); + /* free some always allocated data structures */ pmap_destroy(chordal_env->border_heads); bitset_free(chordal_env->ignore_colors); - -#ifdef FIRM_STATISTICS - if (be_stat_ev_is_active()) { - node_stats(birg, pse->cls, &node_stat); - be_stat_ev("perms_after_coal", node_stat.n_perms); - be_stat_ev("copies_after_coal", node_stat.n_copies); - be_stat_ev_pop(); - } -#endif /* FIRM_STATISTICS */ } /** @@ -550,6 +563,7 @@ static void be_ra_chordal_main(be_irg_t *birg) be_options_t *main_opts = main_env->options; int j, m; be_chordal_env_t chordal_env; + struct obstack obst; BE_TIMER_INIT(main_opts); BE_TIMER_PUSH(ra_timer.t_other); @@ -558,12 +572,15 @@ static void be_ra_chordal_main(be_irg_t *birg) be_assure_dom_front(birg); be_assure_liveness(birg); - chordal_env.opts = &options; - chordal_env.irg = irg; - chordal_env.birg = birg; - FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal"); + chordal_env.obst = &obst; + chordal_env.opts = &options; + chordal_env.irg = irg; + chordal_env.birg = birg; + chordal_env.border_heads = NULL; + chordal_env.ifg = NULL; + chordal_env.ignore_colors = NULL; - obstack_init(&chordal_env.obst); + obstack_init(&obst); BE_TIMER_POP(ra_timer.t_prolog); @@ -588,8 +605,7 @@ static void be_ra_chordal_main(be_irg_t *birg) post_spill(&pse, 0); } - } - else { + } else { post_spill_env_t *pse; /* the backend has it's own spiller */ @@ -613,30 +629,12 @@ static void be_ra_chordal_main(be_irg_t *birg) } } - BE_TIMER_PUSH(ra_timer.t_spillslots); - - be_coalesce_spillslots(&chordal_env); - dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched); - - BE_TIMER_POP(ra_timer.t_spillslots); - - BE_TIMER_PUSH(ra_timer.t_verify); - /* verify spillslots */ - if (options.vrfy_option == BE_CH_VRFY_WARN) { - be_verify_spillslots(main_env->arch_env, irg); - } - else if (options.vrfy_option == BE_CH_VRFY_ASSERT) { - assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed"); - } - BE_TIMER_POP(ra_timer.t_verify); - BE_TIMER_PUSH(ra_timer.t_epilog); - dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched); - lower_nodes_after_ra(birg, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0); dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched); - obstack_free(&chordal_env.obst, NULL); + obstack_free(&obst, NULL); + be_invalidate_liveness(birg); BE_TIMER_POP(ra_timer.t_epilog); BE_TIMER_POP(ra_timer.t_other); @@ -650,7 +648,7 @@ static be_ra_t be_ra_chordal_allocator = { be_ra_chordal_main, }; -void be_init_chordal(void) +void be_init_chordal_main(void) { lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra"); @@ -661,4 +659,4 @@ void be_init_chordal(void) be_register_allocator("chordal", &be_ra_chordal_allocator); } -BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal); +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_main);