-/**
- * @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.
+ *
+ * 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.
*
- * Copyright (C) 2005-2006 Universitaet Karlsruhe
- * Released under the GPL
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
*
- * Driver for the chordal register allocator.
+ * 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>
+#include "config.h"
#endif
+#include <stdlib.h>
#include <time.h>
#include "obst.h"
#include "iterator.h"
#include "firm_config.h"
-#ifdef WITH_LIBCORE
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>
-#endif /* WITH_LIBCORE */
#include "ircons_t.h"
#include "irmode_t.h"
#include "debug.h"
#include "xmalloc.h"
#include "execfreq.h"
+#include "iredges_t.h"
#include "bechordal_t.h"
#include "beabi.h"
#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"
#include "bespillslots.h"
#include "bespilloptions.h"
#include "belower.h"
BE_CH_DUMP_NONE,
BE_CH_LOWER_PERM_SWAP,
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;
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 }
+ LC_OPT_LAST
};
static void dump(unsigned mask, ir_graph *irg,
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);
}
}
return cnt;
}
-#ifdef WITH_LIBCORE
/**
* Initialize all timers.
*/
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.
*/
-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;
+static void pre_spill(post_spill_env_t *pse, const arch_register_class_t *cls)
+{
+ be_chordal_env_t *chordal_env = &pse->cenv;
+ be_irg_t *birg = pse->birg;
+ ir_graph *irg = be_get_birg_irg(birg);
+ const be_main_env_t *main_env = birg->main_env;
+ node_stat_t node_stat;
- pse->cls = arch_isa_get_reg_class(isa, cls_idx);
- chordal_env->cls = pse->cls;
+ pse->cls = cls;
+ chordal_env->cls = cls;
chordal_env->border_heads = pmap_create();
chordal_env->ignore_colors = bitset_malloc(chordal_env->cls->n_regs);
-#ifdef FIRM_STATISTICS
- if (be_stat_ev_is_active()) {
- be_stat_tags[STAT_TAG_CLS] = pse->cls->name;
- be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
-
- /* perform some node statistics. */
- node_stats(birg, pse->cls, &node_stat);
- be_stat_ev("phis_before_spill", node_stat.n_phis);
- }
-#endif /* FIRM_STATISTICS */
+ be_assure_liveness(birg);
+ be_liveness_assure_chk(be_get_birg_liveness(birg));
+ stat_ev_ctx_push_str("bechordal_cls", pse->cls->name);
+ stat_ev_do(node_stats(birg, pse->cls, &node_stat));
+ stat_ev_do(pse->pre_spill_cost = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq));
+ stat_ev_dbl("phis_before_spill", node_stat.n_phis);
/* put all ignore registers into the ignore register set. */
be_put_ignore_regs(birg, pse->cls, chordal_env->ignore_colors);
be_pre_spill_prepare_constr(chordal_env);
dump(BE_CH_DUMP_CONSTR, birg->irg, pse->cls, "-constr-pre", dump_ir_block_graph_sched);
-#ifdef FIRM_STATISTICS
- if (be_stat_ev_is_active()) {
- pse->pre_spill_cost = be_estimate_irg_costs(birg->irg,
- birg->main_env->arch_env, birg->exec_freq);
- }
-#endif /* FIRM_STATISTICS */
+ stat_ev_ctx_pop("bechordal_cls");
}
/**
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) {
+
+ stat_ev_ctx_push_str("cls", pse->cls->name);
+ stat_ev_do(node_stats(birg, pse->cls, &node_stat));
+ 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);
+ stat_ev_dbl("spillcosts", be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - pse->pre_spill_cost);
+
+ /*
+ 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);
+ }
-#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;
-
- be_stat_ev_l("spillcosts", (long) spillcosts);
+ BE_TIMER_PUSH(ra_timer.t_verify);
- 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 */
-
- /*
- 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);
- }
-
- BE_TIMER_PUSH(ra_timer.t_verify);
+ /* 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);
- /* 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);
+ /* Color the graph. */
+ BE_TIMER_PUSH(ra_timer.t_color);
+ be_ra_chordal_color(chordal_env);
+ BE_TIMER_POP(ra_timer.t_color);
- if (be_elr_split && ! splitted) {
- extreme_liverange_splitting(chordal_env);
- splitted = 1;
- }
+ dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "-color", dump_ir_block_graph_sched);
- /* Color the graph. */
- BE_TIMER_PUSH(ra_timer.t_color);
- be_ra_chordal_color(chordal_env);
- BE_TIMER_POP(ra_timer.t_color);
+ /* 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);
- dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "-color", dump_ir_block_graph_sched);
+ {
+ be_ifg_stat_t stat;
- /* 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);
+ 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);
-#ifdef FIRM_STATISTICS
- if (be_stat_ev_is_active()) {
- be_ifg_stat_t stat;
+ 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);
+ }
- 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);
+ /* copy minimization */
+ BE_TIMER_PUSH(ra_timer.t_copymin);
+ co_driver(chordal_env);
+ BE_TIMER_POP(ra_timer.t_copymin);
- 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 */
+ dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "-copymin", dump_ir_block_graph_sched);
- /* copy minimization */
- BE_TIMER_PUSH(ra_timer.t_copymin);
- co_driver(chordal_env);
- BE_TIMER_POP(ra_timer.t_copymin);
+ BE_TIMER_PUSH(ra_timer.t_ssa);
- dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "-copymin", dump_ir_block_graph_sched);
+ /* ssa destruction */
+ stat_ev_ctx_push_str("berachordal_phase", "ssadestr");
+ be_ssa_destruction(chordal_env);
+ stat_ev_ctx_pop("berachordal_phase");
- BE_TIMER_PUSH(ra_timer.t_ssa);
+ BE_TIMER_POP(ra_timer.t_ssa);
- /* ssa destruction */
- be_ssa_destruction(chordal_env);
+ dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "-ssadestr", dump_ir_block_graph_sched);
- BE_TIMER_POP(ra_timer.t_ssa);
+ 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);
- dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "-ssadestr", dump_ir_block_graph_sched);
+ 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("cls");
- BE_TIMER_PUSH(ra_timer.t_verify);
- if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) {
- be_ssa_destruction_check(chordal_env);
+ /* 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 */
}
/**
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_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);
be_stat_ev("insns_before", count_insns(irg));
+
+
if (! arch_code_generator_has_spiller(birg->cg)) {
/* use one of the generic spiller */
/* 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;
+ const arch_register_class_t *cls
+ = arch_isa_get_reg_class(isa, j);
+
+ if(arch_register_class_flags(cls) & arch_register_class_flag_manual_ra)
+ continue;
+
memcpy(&pse.cenv, &chordal_env, sizeof(chordal_env));
pse.birg = birg;
- pre_spill(isa, j, &pse);
+ pre_spill(&pse, cls);
+
+#if 0
+ /* this is a hack, TODO remove me later */
+ if(j == 2) {
+ be_do_stat_reg_pressure(birg);
+ }
+#endif
BE_TIMER_PUSH(ra_timer.t_spill);
- be_do_spill(birg, pse.cls);
+ be_do_spill(birg, cls);
BE_TIMER_POP(ra_timer.t_spill);
- dump(BE_CH_DUMP_SPILL, irg, pse.cls, "-spill", dump_ir_block_graph_sched);
+ dump(BE_CH_DUMP_SPILL, irg, pse.cls, "-spill",
+ dump_ir_block_graph_sched);
post_spill(&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]);
+ pre_spill(&pse[j], pse[j].cls);
}
BE_TIMER_PUSH(ra_timer.t_spill);
}
}
- // Matze: this should be removed here, but I don't know if this would break
- // STA...
-#if 1
- 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);
-#endif
+ be_verify_register_allocation(birg);
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);
- be_invalidate_liveness(birg);
+ obstack_free(&obst, NULL);
+ be_liveness_invalidate(be_get_birg_liveness(birg));
BE_TIMER_POP(ra_timer.t_epilog);
BE_TIMER_POP(ra_timer.t_other);
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");
be_register_allocator("chordal", &be_ra_chordal_allocator);
}
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal);
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_main);
projects / libfirm / blobdiff