#include "beifg_impl.h"
#include "bespillbelady.h"
-#include "bespillilp.h"
#include "belower.h"
-#include "becopyoptmain.h"
-#include "bessadestr.h"
+#ifdef WITH_ILP
+#include "bespillilp.h"
+#endif /* WITH_ILP */
+
#include "becopystat.h"
+#include "becopyopt.h"
+#include "bessadestr.h"
void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
firm_dbg_module_t *dbg = chordal_env->dbg;
- const arch_env_t *arch_env = chordal_env->main_env->arch_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;
#ifdef WITH_LIBCORE
static const lc_opt_enum_int_items_t spill_items[] = {
{ "belady", BE_CH_SPILL_BELADY },
+#ifdef WITH_ILP
{ "ilp", BE_CH_SPILL_ILP },
+#endif
{ NULL, 0 }
};
static const lc_opt_enum_int_items_t copymin_items[] = {
{ "heur", BE_CH_COPYMIN_HEUR },
+#ifdef WITH_ILP
{ "ilp", BE_CH_COPYMIN_ILP },
+#endif
{ NULL, 0 }
};
const char *suffix,
void (*dump_func)(ir_graph *, const char *))
{
- if(1 || (options.dump_flags & mask) == mask) {
+ if(1 || ((options.dump_flags & mask) == mask)) {
if(cls) {
char buf[256];
snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
}
}
-static void be_ra_chordal_main(const be_main_env_t *main_env, ir_graph *irg)
+static void be_ra_chordal_main(const be_irg_t *bi)
{
int j, m;
be_chordal_env_t chordal_env;
+ ir_graph *irg = bi->irg;
+ const be_main_env_t *main_env = bi->main_env;
const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
compute_doms(irg);
+ chordal_env.opts = &options;
chordal_env.irg = irg;
chordal_env.dbg = firm_dbg_register("firm.be.chordal");
- chordal_env.main_env = main_env;
+ chordal_env.birg = bi;
chordal_env.dom_front = be_compute_dominance_frontiers(irg);
obstack_init(&chordal_env.obst);
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;
+#endif /* WITH_ILP */
default:
fprintf(stderr, "no valid spiller selected. falling back to belady\n");
be_spill_belady(&chordal_env);
/* copy minimization */
copystat_collect_cls(&chordal_env);
- be_copy_opt(&chordal_env);
+#ifdef COPYOPT_STAT
+ co_compare_solvers(&chordal_env);
+#else
+ {
+ copy_opt_t *co = new_copy_opt(&chordal_env, co_get_costs_loop_depth);
+ co_solve_heuristic(co);
+ free_copy_opt(co);
+ }
+#endif
dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
be_ra_chordal_check(&chordal_env);
be_ssa_destruction(&chordal_env);
dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
be_ssa_destruction_check(&chordal_env);
- be_ra_chordal_check(&chordal_env);
+// be_ra_chordal_check(&chordal_env);
copystat_dump(irg);
lower_nodes_after_ra(&chordal_env, options.lower_perm_method == BE_CH_LOWER_PERM_COPY ? 1 : 0);
dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
- be_free_dominance_frontiers(chordal_env.dom_front);
obstack_free(&chordal_env.obst, NULL);
+ be_free_dominance_frontiers(chordal_env.dom_front);
}
const be_ra_t be_ra_chordal_allocator = {