X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_main.c;h=962f6f83196b249d8d8789c205b853fbfefa93a6;hb=a2dc796648be8a0e8c85d6488e5ab5a790c218a9;hp=777eaa0ca01add3ccdb8acecfabbd8dcdbee65a3;hpb=c156991040b357821b88a31c2a20e0a25399011a;p=libfirm diff --git a/ir/be/bechordal_main.c b/ir/be/bechordal_main.c index 777eaa0ca..962f6f831 100644 --- a/ir/be/bechordal_main.c +++ b/ir/be/bechordal_main.c @@ -1,17 +1,36 @@ -/** - * @file bechordal_main.c - * @date 29.11.2005 - * @author Sebastian Hack +/* + * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. * - * Copyright (C) 2005 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" #include "pset.h" #include "list.h" @@ -19,108 +38,77 @@ #include "iterator.h" #include "firm_config.h" -#ifdef WITH_LIBCORE #include #include #include -#endif /* WITH_LIBCORE */ +#include "ircons_t.h" #include "irmode_t.h" #include "irgraph_t.h" #include "irprintf_t.h" #include "irgwalk.h" +#include "ircons.h" #include "irdump.h" #include "irdom.h" +#include "ircons.h" #include "irbitset.h" +#include "irnode.h" +#include "ircons.h" #include "debug.h" #include "xmalloc.h" +#include "execfreq.h" +#include "iredges_t.h" #include "bechordal_t.h" #include "beabi.h" +#include "bejavacoal.h" #include "beutil.h" #include "besched.h" -#include "benumb_t.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" +#include "bespillslots.h" +#include "bespilloptions.h" #include "belower.h" #ifdef WITH_ILP -#include "bespillilp.h" #include "bespillremat.h" -#include "bespillappel.h" #endif /* WITH_ILP */ +#include "bejavacoal.h" #include "becopystat.h" #include "becopyopt.h" #include "bessadestr.h" #include "beverify.h" - - -void be_ra_chordal_check(be_chordal_env_t *chordal_env) { - const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env; - struct obstack ob; - pmap_entry *pme; - ir_node **nodes, *n1, *n2; - int i, o; - DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;) - - /* Collect all irns */ - obstack_init(&ob); - pmap_foreach(chordal_env->border_heads, pme) { - border_t *curr; - struct list_head *head = pme->value; - list_for_each_entry(border_t, curr, head, list) - if (curr->is_def && curr->is_real) - if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls) - obstack_ptr_grow(&ob, curr->irn); - } - obstack_ptr_grow(&ob, NULL); - nodes = (ir_node **) obstack_finish(&ob); - - /* Check them */ - for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) { - const arch_register_t *n1_reg, *n2_reg; - - n1_reg = arch_get_irn_register(arch_env, n1); - if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) { - DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1)); - assert(0 && "Register constraint does not hold"); - } - for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) { - n2_reg = arch_get_irn_register(arch_env, n2); - if (values_interfere(n1, n2) && n1_reg == n2_reg) { - DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned\n", n1, n2)); - assert(0 && "Interfering values have the same color!"); - } - } - } - obstack_free(&ob, NULL); -} - -int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b) -{ - if(env->ifg) - return be_ifg_connected(env->ifg, a, b); - else - return values_interfere(a, b); -} - +#include "benode_t.h" static be_ra_chordal_opts_t options = { BE_CH_DUMP_NONE, - BE_CH_SPILL_BELADY, - BE_CH_COPYMIN_HEUR1, - BE_CH_IFG_STD, BE_CH_LOWER_PERM_SWAP, BE_CH_VRFY_WARN, + "", + "" }; +typedef struct _post_spill_env_t { + be_chordal_env_t cenv; + be_irg_t *birg; + const arch_register_class_t *cls; + double pre_spill_cost; +} post_spill_env_t; + static be_ra_timer_t ra_timer = { NULL, NULL, @@ -130,41 +118,9 @@ static be_ra_timer_t ra_timer = { NULL, NULL, NULL, -}; - -#ifdef WITH_LIBCORE -static const lc_opt_enum_int_items_t spill_items[] = { - { "morgan", BE_CH_SPILL_MORGAN }, - { "belady", BE_CH_SPILL_BELADY }, -#ifdef WITH_ILP - { "ilp", BE_CH_SPILL_ILP }, - { "remat", BE_CH_SPILL_REMAT }, - { "appel", BE_CH_SPILL_APPEL }, -#endif /* WITH_ILP */ - { NULL, 0 } -}; - -static const lc_opt_enum_int_items_t copymin_items[] = { - { "none", BE_CH_COPYMIN_NONE }, - { "heur1", BE_CH_COPYMIN_HEUR1 }, - { "heur2", BE_CH_COPYMIN_HEUR2 }, - { "stat", BE_CH_COPYMIN_STAT }, - { "park", BE_CH_COPYMIN_PARK_MOON }, -#ifdef WITH_ILP - { "ilp1", BE_CH_COPYMIN_ILP1 }, - { "ilp2", BE_CH_COPYMIN_ILP2 }, -#endif /* WITH_ILP */ - { NULL, 0 } -}; - -static const lc_opt_enum_int_items_t ifg_flavor_items[] = { - { "std", BE_CH_IFG_STD }, - { "fast", BE_CH_IFG_FAST }, - { "clique", BE_CH_IFG_CLIQUE }, - { "pointer", BE_CH_IFG_POINTER }, - { "list", BE_CH_IFG_LIST }, - { "check", BE_CH_IFG_CHECK }, - { NULL, 0 } + NULL, + NULL, + NULL, }; static const lc_opt_enum_int_items_t lower_perm_items[] = { @@ -178,15 +134,18 @@ static const lc_opt_enum_int_items_t lower_perm_stat_items[] = { }; static const lc_opt_enum_int_items_t dump_items[] = { - { "spill", BE_CH_DUMP_SPILL }, - { "live", BE_CH_DUMP_LIVE }, - { "color", BE_CH_DUMP_COLOR }, - { "copymin", BE_CH_DUMP_COPYMIN }, - { "ssadestr", BE_CH_DUMP_SSADESTR }, - { "tree", BE_CH_DUMP_TREE_INTV }, - { "constr", BE_CH_DUMP_CONSTR }, - { "lower", BE_CH_DUMP_LOWER }, - { "all", BE_CH_DUMP_ALL }, + { "none", BE_CH_DUMP_NONE }, + { "spill", BE_CH_DUMP_SPILL }, + { "live", BE_CH_DUMP_LIVE }, + { "color", BE_CH_DUMP_COLOR }, + { "copymin", BE_CH_DUMP_COPYMIN }, + { "ssadestr", BE_CH_DUMP_SSADESTR }, + { "tree", BE_CH_DUMP_TREE_INTV }, + { "constr", BE_CH_DUMP_CONSTR }, + { "lower", BE_CH_DUMP_LOWER }, + { "spillslots", BE_CH_DUMP_SPILLSLOTS }, + { "appel", BE_CH_DUMP_APPEL }, + { "all", BE_CH_DUMP_ALL }, { NULL, 0 } }; @@ -197,18 +156,6 @@ static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = { { NULL, 0 } }; -static lc_opt_enum_int_var_t spill_var = { - &options.spill_method, spill_items -}; - -static lc_opt_enum_int_var_t copymin_var = { - &options.copymin_method, copymin_items -}; - -static lc_opt_enum_int_var_t ifg_flavor_var = { - &options.ifg_flavor, ifg_flavor_items -}; - static lc_opt_enum_int_var_t lower_perm_var = { &options.lower_perm_opt, lower_perm_items }; @@ -222,31 +169,12 @@ static lc_opt_enum_int_var_t be_ch_vrfy_var = { }; static const lc_opt_table_entry_t be_chordal_options[] = { - LC_OPT_ENT_ENUM_MASK("spill", "spill method (belady, ilp, remat or appel)", &spill_var), - LC_OPT_ENT_ENUM_PTR ("copymin", "copymin method (none, heur1, heur2, ilp1, ilp2 or stat)", ©min_var), - LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour (std, fast, clique, pointer, list, check)", &ifg_flavor_var), - LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options (copy or swap)", &lower_perm_var), - LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var), - LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options (off, warn, assert)", &be_ch_vrfy_var), - { NULL } + 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_LAST }; -static void be_ra_chordal_register_options(lc_opt_entry_t *grp) -{ - static int run_once = 0; - lc_opt_entry_t *chordal_grp; - - if (! run_once) { - run_once = 1; - chordal_grp = lc_opt_get_grp(grp, "chordal"); - - lc_opt_add_table(chordal_grp, be_chordal_options); - } - - co_register_options(chordal_grp); -} -#endif /* WITH_LIBCORE */ - static void dump(unsigned mask, ir_graph *irg, const arch_register_class_t *cls, const char *suffix, @@ -263,288 +191,451 @@ static void dump(unsigned mask, ir_graph *irg, } } -static void put_ignore_colors(be_chordal_env_t *chordal_env) -{ - int n_colors = chordal_env->cls->n_regs; - int i; - - bitset_clear_all(chordal_env->ignore_colors); - be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors); - for(i = 0; i < n_colors; ++i) - if(arch_register_type_is(&chordal_env->cls->regs[i], ignore)) - bitset_set(chordal_env->ignore_colors, i); +/** + * Checks for every reload if it's user can perform the load on itself. + */ +static void memory_operand_walker(ir_node *irn, void *env) { + be_chordal_env_t *cenv = env; + const arch_env_t *aenv = cenv->birg->main_env->arch_env; + const ir_edge_t *edge, *ne; + ir_node *block; + ir_node *spill; + + if (! be_is_Reload(irn)) + return; + + /* only use memory operands, if the reload is only used by 1 node */ + if(get_irn_n_edges(irn) > 1) + return; + + spill = be_get_Reload_mem(irn); + block = get_nodes_block(irn); + + foreach_out_edge_safe(irn, edge, ne) { + ir_node *src = get_edge_src_irn(edge); + int pos = get_edge_src_pos(edge); + + assert(src && "outedges broken!"); + + if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) { + arch_perform_memory_operand(aenv, src, spill, pos); + } + } + + /* kill the Reload */ + if (get_irn_n_edges(irn) == 0) { + sched_remove(irn); + set_irn_n(irn, be_pos_Reload_mem, new_Bad()); + set_irn_n(irn, be_pos_Reload_frame, new_Bad()); + } +} + +/** + * Starts a walk for memory operands if supported by the backend. + */ +static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) { + irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env); } -FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix) +/** + * Sorry for doing stats again... + */ +typedef struct _node_stat_t { + unsigned int n_phis; /**< Phis of the current register class. */ + unsigned int n_mem_phis; /**< Memory Phis (Phis with spill operands). */ + unsigned int n_copies; /**< Copies */ + unsigned int n_perms; /**< Perms */ + unsigned int n_spills; /**< Spill nodes */ + unsigned int n_reloads; /**< Reloads */ +} node_stat_t; + +struct node_stat_walker { + node_stat_t *stat; + const arch_env_t *arch_env; + bitset_t *mem_phis; + const arch_register_class_t *cls; +}; + +static void node_stat_walker(ir_node *irn, void *data) { - char buf[1024]; + struct node_stat_walker *env = data; + const arch_env_t *aenv = env->arch_env; + + if (arch_irn_consider_in_reg_alloc(aenv, env->cls, irn)) { + + /* if the node is a normal phi */ + if(is_Phi(irn)) + env->stat->n_phis++; + + else if(arch_irn_classify(aenv, irn) & arch_irn_class_spill) + ++env->stat->n_spills; + + else if(arch_irn_classify(aenv, irn) & arch_irn_class_reload) + ++env->stat->n_reloads; + + else if(arch_irn_classify(aenv, irn) & arch_irn_class_copy) + ++env->stat->n_copies; + + else if(arch_irn_classify(aenv, irn) & arch_irn_class_perm) + ++env->stat->n_perms; + } + + /* a mem phi is a PhiM with a mem phi operand or a Spill operand */ + else if(is_Phi(irn) && get_irn_mode(irn) == mode_M) { + int i; + + for(i = get_irn_arity(irn) - 1; i >= 0; --i) { + ir_node *op = get_irn_n(irn, i); - ir_snprintf(buf, sizeof(buf), "%s%F_%s.%s", prefix, env->irg, env->cls->name, suffix); - return fopen(buf, "wt"); + if((is_Phi(op) && bitset_contains_irn(env->mem_phis, op)) || (arch_irn_classify(aenv, op) & arch_irn_class_spill)) { + bitset_add_irn(env->mem_phis, irn); + env->stat->n_mem_phis++; + break; + } + } + } } -void check_ifg_implementations(be_chordal_env_t *chordal_env) +static void node_stats(be_irg_t *birg, const arch_register_class_t *cls, node_stat_t *stat) { -/* - FILE *f; - - f = be_chordal_open(chordal_env, "std", "log"); - chordal_env->ifg = be_ifg_std_new(chordal_env); - be_ifg_check_sorted(chordal_env->ifg, f); - fclose(f); - - f = be_chordal_open(chordal_env, "list", "log"); - chordal_env->ifg = be_ifg_list_new(chordal_env); - be_ifg_check_sorted(chordal_env->ifg, f); - fclose(f); - - f = be_chordal_open(chordal_env, "clique", "log"); - chordal_env->ifg = be_ifg_clique_new(chordal_env); - be_ifg_check_sorted(chordal_env->ifg, f); - fclose(f); - - f = be_chordal_open(chordal_env, "pointer", "log"); - chordal_env->ifg = be_ifg_pointer_new(chordal_env); - be_ifg_check_sorted(chordal_env->ifg, f); - fclose(f); -*/ - chordal_env->ifg = NULL; -}; + struct node_stat_walker env; + + memset(stat, 0, sizeof(stat[0])); + env.arch_env = birg->main_env->arch_env; + env.mem_phis = bitset_irg_malloc(birg->irg); + env.stat = stat; + env.cls = cls; + irg_walk_graph(birg->irg, NULL, node_stat_walker, &env); + bitset_free(env.mem_phis); +} -static be_ra_timer_t *be_ra_chordal_main(const be_irg_t *bi) +static void insn_count_walker(ir_node *irn, void *data) { - const be_main_env_t *main_env = bi->main_env; - const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env); - ir_graph *irg = bi->irg; - be_options_t *main_opts = main_env->options; - copy_opt_t *co; + int *cnt = data; + + switch(get_irn_opcode(irn)) { + case iro_Proj: + case iro_Phi: + case iro_Start: + case iro_End: + break; + default: + (*cnt)++; + } +} - int j, m; - be_chordal_env_t chordal_env; +static unsigned int count_insns(ir_graph *irg) +{ + int cnt = 0; + irg_walk_graph(irg, insn_count_walker, NULL, &cnt); + return cnt; +} +/** + * Initialize all timers. + */ +static void be_init_timer(be_options_t *main_opts) +{ if (main_opts->timing == BE_TIME_ON) { - ra_timer.t_prolog = lc_timer_register("prolog", "regalloc prolog"); - ra_timer.t_epilog = lc_timer_register("epilog", "regalloc epilog"); - ra_timer.t_live = lc_timer_register("liveness", "be liveness"); - ra_timer.t_spill = lc_timer_register("spill", "spiller"); - ra_timer.t_color = lc_timer_register("color", "graph coloring"); - ra_timer.t_ifg = lc_timer_register("ifg", "build interference graph"); - ra_timer.t_copymin = lc_timer_register("copymin", "copy minimization"); - ra_timer.t_ssa = lc_timer_register("ssadestr", "ssa destruction"); + ra_timer.t_prolog = lc_timer_register("ra_prolog", "regalloc prolog"); + ra_timer.t_epilog = lc_timer_register("ra_epilog", "regalloc epilog"); + ra_timer.t_live = lc_timer_register("ra_liveness", "be liveness"); + ra_timer.t_spill = lc_timer_register("ra_spill", "spiller"); + ra_timer.t_spillslots = lc_timer_register("ra_spillslots", "spillslots"); + ra_timer.t_color = lc_timer_register("ra_color", "graph coloring"); + ra_timer.t_ifg = lc_timer_register("ra_ifg", "interference graph"); + ra_timer.t_copymin = lc_timer_register("ra_copymin", "copy minimization"); + ra_timer.t_ssa = lc_timer_register("ra_ssadestr", "ssa destruction"); + ra_timer.t_verify = lc_timer_register("ra_verify", "graph verification"); + ra_timer.t_other = lc_timer_register("ra_other", "other time"); LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog); LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog); LC_STOP_AND_RESET_TIMER(ra_timer.t_live); LC_STOP_AND_RESET_TIMER(ra_timer.t_spill); + LC_STOP_AND_RESET_TIMER(ra_timer.t_spillslots); LC_STOP_AND_RESET_TIMER(ra_timer.t_color); LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg); LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin); LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa); - } - -#define BE_TIME_START(timer) if (main_opts->timing == BE_TIME_ON) lc_timer_start(timer) -#define BE_TIME_STOP(timer) if (main_opts->timing == BE_TIME_ON) lc_timer_stop(timer) - - BE_TIME_START(ra_timer.t_prolog); - - compute_doms(irg); + LC_STOP_AND_RESET_TIMER(ra_timer.t_verify); + LC_STOP_AND_RESET_TIMER(ra_timer.t_other); - chordal_env.opts = &options; - chordal_env.irg = irg; - chordal_env.birg = bi; - chordal_env.dom_front = be_compute_dominance_frontiers(irg); - FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal"); + global_ra_timer = &ra_timer; + } +} - obstack_init(&chordal_env.obst); +#define BE_TIMER_INIT(main_opts) be_init_timer(main_opts) + +#define BE_TIMER_PUSH(timer) \ + if (main_opts->timing == BE_TIME_ON) { \ + if (! lc_timer_push(timer)) { \ + if (options.vrfy_option == BE_CH_VRFY_ASSERT) \ + assert(!"Timer already on stack, cannot be pushed twice."); \ + else if (options.vrfy_option == BE_CH_VRFY_WARN) \ + fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \ + lc_timer_get_name(timer)); \ + } \ + } +#define BE_TIMER_POP(timer) \ + if (main_opts->timing == BE_TIME_ON) { \ + lc_timer_t *tmp = lc_timer_pop(); \ + if (options.vrfy_option == BE_CH_VRFY_ASSERT) \ + assert(tmp == timer && "Attempt to pop wrong timer."); \ + else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer) \ + fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \ + lc_timer_get_name(tmp), lc_timer_get_name(timer)); \ + timer = tmp; \ + } - BE_TIME_STOP(ra_timer.t_prolog); +/** + * Perform things which need to be done per register class before spilling. + */ +static void pre_spill(const arch_isa_t *isa, int cls_idx, post_spill_env_t *pse) { + be_chordal_env_t *chordal_env = &pse->cenv; + be_irg_t *birg = pse->birg; + node_stat_t node_stat; - /* Perform the following for each register class. */ - for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) { - chordal_env.cls = arch_isa_get_reg_class(isa, j); - chordal_env.border_heads = pmap_create(); - chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs); + pse->cls = arch_isa_get_reg_class(isa, cls_idx); + chordal_env->cls = pse->cls; + chordal_env->border_heads = pmap_create(); + chordal_env->ignore_colors = bitset_malloc(chordal_env->cls->n_regs); - BE_TIME_START(ra_timer.t_live); + be_assure_liveness(birg); + be_liveness_assure_chk(be_get_birg_liveness(birg)); + stat_ev_ctx_push("cls", pse->cls->name); + stat_ev_dbl("phis_before_spill", node_stat.n_phis); + stat_ev_do(node_stats(birg, pse->cls, &node_stat)); - /* put all ignore registers into the ignore register set. */ - put_ignore_colors(&chordal_env); + /* put all ignore registers into the ignore register set. */ + be_put_ignore_regs(birg, pse->cls, chordal_env->ignore_colors); - be_liveness(irg); - dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched); + be_pre_spill_prepare_constr(chordal_env); + dump(BE_CH_DUMP_CONSTR, birg->irg, pse->cls, "-constr-pre", dump_ir_block_graph_sched); - BE_TIME_STOP(ra_timer.t_live); - BE_TIME_START(ra_timer.t_spill); + stat_ev_ctx_pop(); +} - /* spilling */ - switch(options.spill_method) { - case BE_CH_SPILL_MORGAN: - be_spill_morgan(&chordal_env); - break; - case BE_CH_SPILL_BELADY: - be_spill_belady(&chordal_env); - break; -#ifdef WITH_ILP - case BE_CH_SPILL_ILP: - be_spill_ilp(&chordal_env); - break; - case BE_CH_SPILL_REMAT: - be_spill_remat(&chordal_env); - break; - case BE_CH_SPILL_APPEL: - be_spill_appel(&chordal_env); - break; -#endif /* WITH_ILP */ - default: - fprintf(stderr, "no valid spiller selected. falling back to belady\n"); - be_spill_belady(&chordal_env); +/** + * Perform things which need to be done per register class after spilling. + */ +static void post_spill(post_spill_env_t *pse, int iteration) { + be_chordal_env_t *chordal_env = &pse->cenv; + be_irg_t *birg = pse->birg; + ir_graph *irg = birg->irg; + const be_main_env_t *main_env = birg->main_env; + be_options_t *main_opts = main_env->options; + 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) { + + stat_ev_ctx_push("cls", pse->cls->name); + stat_ev_do(node_stats(birg, pse->cls, &node_stat)); + stat_ev_dbl("spillcosts", be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - pse->pre_spill_cost); + stat_ev_dbl("phis_after_spill", node_stat.n_phis); + stat_ev_dbl("mem_phis", node_stat.n_mem_phis); + stat_ev_dbl("reloads", node_stat.n_reloads); + stat_ev_dbl("spills", node_stat.n_spills); + + /* + 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); } - dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched); - be_abi_fix_stack_nodes(bi->abi); + + BE_TIMER_PUSH(ra_timer.t_verify); /* verify schedule and register pressure */ - if (options.vrfy_option == BE_CH_VRFY_WARN) { - be_verify_schedule(irg); - be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg); + if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) { + be_verify_schedule(birg); + be_verify_register_pressure(birg, pse->cls, irg); } - else if (options.vrfy_option == BE_CH_VRFY_ASSERT) { - assert(be_verify_schedule(irg) && "Schedule verification failed"); - assert(be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.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_TIME_STOP(ra_timer.t_spill); - BE_TIME_START(ra_timer.t_live); - be_liveness(irg); - BE_TIME_STOP(ra_timer.t_live); + BE_TIMER_POP(ra_timer.t_verify); /* Color the graph. */ - BE_TIME_START(ra_timer.t_color); - be_ra_chordal_color(&chordal_env); - dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched); + BE_TIMER_PUSH(ra_timer.t_color); + be_ra_chordal_color(chordal_env); + BE_TIMER_POP(ra_timer.t_color); - BE_TIME_STOP(ra_timer.t_color); - BE_TIME_START(ra_timer.t_ifg); - //be_ifg_check_performance(&chordal_env); + dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "-color", dump_ir_block_graph_sched); /* Create the ifg with the selected flavor */ - switch (options.ifg_flavor) { - default: - fprintf(stderr, "no valid ifg flavour selected. falling back to std\n"); - case BE_CH_IFG_STD: - case BE_CH_IFG_FAST: - chordal_env.ifg = be_ifg_std_new(&chordal_env); - break; - case BE_CH_IFG_CLIQUE: - chordal_env.ifg = be_ifg_clique_new(&chordal_env); - break; - case BE_CH_IFG_POINTER: - chordal_env.ifg = be_ifg_pointer_new(&chordal_env); - break; - case BE_CH_IFG_LIST: - chordal_env.ifg = be_ifg_list_new(&chordal_env); - break; - case BE_CH_IFG_CHECK: - check_ifg_implementations(&chordal_env); - /* Build the interference graph. */ - chordal_env.ifg = be_ifg_std_new(&chordal_env); - //be_ifg_check(chordal_env.ifg); - //be_ifg_check_sorted(chordal_env.ifg); - break; - } + BE_TIMER_PUSH(ra_timer.t_ifg); + chordal_env->ifg = be_create_ifg(chordal_env); + BE_TIMER_POP(ra_timer.t_ifg); - BE_TIME_STOP(ra_timer.t_ifg); - BE_TIME_START(ra_timer.t_copymin); + { + be_ifg_stat_t stat; - /* copy minimization */ - co = NULL; - if (options.copymin_method != BE_CH_COPYMIN_NONE && options.copymin_method != BE_CH_COPYMIN_STAT) { - co = new_copy_opt(&chordal_env, co_get_costs_loop_depth); - co_build_ou_structure(co); - co_build_graph_structure(co); - } + stat_ev_do(be_ifg_stat(birg, chordal_env->ifg, &stat)); + stat_ev_dbl("ifg_nodes", stat.n_nodes); + stat_ev_dbl("ifg_edges", stat.n_edges); + stat_ev_dbl("ifg_comps", stat.n_comps); - switch(options.copymin_method) { - case BE_CH_COPYMIN_HEUR1: - co_solve_heuristic(co); - break; - case BE_CH_COPYMIN_HEUR2: - co_solve_heuristic_new(co); - break; - case BE_CH_COPYMIN_PARK_MOON: - co_solve_park_moon(co); - break; - case BE_CH_COPYMIN_STAT: - co_compare_solvers(&chordal_env); - break; -#ifdef WITH_ILP - case BE_CH_COPYMIN_ILP1: - printf("FIXME: %s:%d ILP1 not yet implemented!\n", __FILE__, __LINE__); - co_solve_ilp1(co, 60.0); - break; - case BE_CH_COPYMIN_ILP2: - co_solve_ilp2(co, 60.0); - break; -#endif /* WITH_ILP */ - case BE_CH_COPYMIN_NONE: - default: - break; + stat_ev_do(node_stats(birg, pse->cls, &node_stat)); + stat_ev_dbl("perms_before_coal", node_stat.n_perms); + stat_ev_dbl("copies_before_coal", node_stat.n_copies); } - if (co) { - co_free_graph_structure(co); - co_free_ou_structure(co); - free_copy_opt(co); - } + /* 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, chordal_env.cls, "-copymin", dump_ir_block_graph_sched); - if (options.vrfy_option != BE_CH_VRFY_OFF) - be_ra_chordal_check(&chordal_env); + dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "-copymin", dump_ir_block_graph_sched); - BE_TIME_STOP(ra_timer.t_copymin); - BE_TIME_START(ra_timer.t_ssa); + BE_TIMER_PUSH(ra_timer.t_ssa); /* ssa destruction */ - be_ssa_destruction(&chordal_env); - dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched); - if (options.vrfy_option != BE_CH_VRFY_OFF) { - be_ssa_destruction_check(&chordal_env); - be_ra_chordal_check(&chordal_env); - } + be_ssa_destruction(chordal_env); + + BE_TIMER_POP(ra_timer.t_ssa); - if (options.copymin_method == BE_CH_COPYMIN_STAT) - copystat_dump(irg); + dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "-ssadestr", dump_ir_block_graph_sched); - be_ifg_free(chordal_env.ifg); - pmap_destroy(chordal_env.border_heads); - bitset_free(chordal_env.ignore_colors); + 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); + + stat_ev_do(node_stats(birg, pse->cls, &node_stat)); + stat_ev_dbl("perms_after_coal", node_stat.n_perms); + stat_ev_dbl("copies_after_coal", node_stat.n_copies); + stat_ev_ctx_pop(); - BE_TIME_STOP(ra_timer.t_ssa); + /* the ifg exists only if there are allocatable regs */ + be_ifg_free(chordal_env->ifg); } - BE_TIME_START(ra_timer.t_epilog); + /* free some always allocated data structures */ + pmap_destroy(chordal_env->border_heads); + bitset_free(chordal_env->ignore_colors); +} + +/** + * Performs chordal register allocation for each register class on given irg. + * + * @param birg Backend irg object + * @return Structure containing timer for the single phases or NULL if no timing requested. + */ +static void be_ra_chordal_main(be_irg_t *birg) +{ + const be_main_env_t *main_env = birg->main_env; + const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env); + ir_graph *irg = birg->irg; + 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); + BE_TIMER_PUSH(ra_timer.t_prolog); + + be_assure_dom_front(birg); + be_assure_liveness(birg); + + 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(&obst); + + BE_TIMER_POP(ra_timer.t_prolog); + + be_stat_ev("insns_before", count_insns(irg)); + + if (! arch_code_generator_has_spiller(birg->cg)) { + /* use one of the generic spiller */ - be_compute_spill_offsets(&chordal_env); + /* Perform the following for each register class. */ + for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) { + post_spill_env_t pse; - dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched); + memcpy(&pse.cenv, &chordal_env, sizeof(chordal_env)); + pse.birg = birg; + pre_spill(isa, j, &pse); - lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0); + BE_TIMER_PUSH(ra_timer.t_spill); + be_do_spill(birg, pse.cls); + BE_TIMER_POP(ra_timer.t_spill); + + dump(BE_CH_DUMP_SPILL, irg, pse.cls, "-spill", dump_ir_block_graph_sched); + + post_spill(&pse, 0); + } + } else { + post_spill_env_t *pse; + + /* the backend has it's own spiller */ + m = arch_isa_get_n_reg_class(isa); + + pse = alloca(m * sizeof(pse[0])); + + for (j = 0; j < m; ++j) { + memcpy(&pse[j].cenv, &chordal_env, sizeof(chordal_env)); + pse[j].birg = birg; + pre_spill(isa, j, &pse[j]); + } + + BE_TIMER_PUSH(ra_timer.t_spill); + arch_code_generator_spill(birg->cg, birg); + BE_TIMER_POP(ra_timer.t_spill); + dump(BE_CH_DUMP_SPILL, irg, NULL, "-spill", dump_ir_block_graph_sched); + + for (j = 0; j < m; ++j) { + post_spill(&pse[j], j); + } + } + + be_verify_register_allocation(main_env->arch_env, irg); + + + BE_TIMER_PUSH(ra_timer.t_epilog); + 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); - be_free_dominance_frontiers(chordal_env.dom_front); + obstack_free(&obst, NULL); + be_liveness_invalidate(be_get_birg_liveness(birg)); + BE_TIMER_POP(ra_timer.t_epilog); - BE_TIME_STOP(ra_timer.t_epilog); + BE_TIMER_POP(ra_timer.t_other); - if (main_opts->timing == BE_TIME_ON) - return &ra_timer; - else - return NULL; + be_stat_ev("insns_after", count_insns(irg)); + + return; } -const be_ra_t be_ra_chordal_allocator = { -#ifdef WITH_LIBCORE - be_ra_chordal_register_options, -#endif - be_ra_chordal_main +static be_ra_t be_ra_chordal_allocator = { + be_ra_chordal_main, }; + +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"); + lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal"); + + lc_opt_add_table(chordal_grp, be_chordal_options); + + be_register_allocator("chordal", &be_ra_chordal_allocator); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_main);