-/**
- * @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 <stdlib.h>
#include <time.h>
#include "obst.h"
#include "debug.h"
#include "xmalloc.h"
#include "execfreq.h"
+#include "iredges_t.h"
#include "bechordal_t.h"
#include "beabi.h"
#include "bestat.h"
#include "bemodule.h"
#include "be_t.h"
+#include "bera.h"
+#include "beirg_t.h"
#include "bespillbelady.h"
#include "bespillmorgan.h"
BE_CH_DUMP_NONE,
BE_CH_LOWER_PERM_SWAP,
BE_CH_VRFY_WARN,
+ "",
+ ""
};
typedef struct _post_spill_env_t {
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),
- { NULL }
+ LC_OPT_LAST
};
static void dump(unsigned mask, ir_graph *irg,
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("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. */
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);
- be_stat_ev_pop();
- }
-#endif /* FIRM_STATISTICS */
+ stat_ev_ctx_pop();
}
/**
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)
- return;
-
-#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_tags[STAT_TAG_CLS] = pse->cls->name;
- be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
+ 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);
+ }
- 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);
- }
+ /* 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);
- BE_TIMER_PUSH(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);
- /* 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);
+ 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 */
+ be_ssa_destruction(chordal_env);
- 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();
- 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;
+ 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_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_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);