};
static const lc_opt_enum_mask_items_t algo_items[] = {
+ { "none", CO_ALGO_NONE },
{ "heur", CO_ALGO_HEUR },
{ "heur2", CO_ALGO_HEUR2 },
{ "heur3", CO_ALGO_HEUR3 },
be_co2_register_options(co_grp);
be_co3_register_options(co_grp);
+#ifdef WITH_ILP
be_co_ilp_register_options(co_grp);
+#endif
}
#endif
for(j = 0, n = get_Block_n_cfgpreds(bl); j < n; ++j) {
ir_node *pred = get_Block_cfgpred_block(bl, j);
- appel_block_info_t *pred_bli = phase_get_irn_data(&env->ph, pred);
int nr = appel_get_live_end_nr(env, pred, irn);
assert(nr >= 0);
for(j = 0, n = get_Block_n_cfgpreds(bl); j < n; ++j) {
ir_node *pred = get_Block_cfgpred_block(bl, j);
- appel_block_info_t *pred_bli = phase_get_irn_data(&env->ph, pred);
ir_node *op = get_irn_n(irn, j);
int nr = appel_get_live_end_nr(env, pred, op);
}
else
- fprintf(f, "label=\"\"" );
+ fprintf(f, "label=\"\" shape=point " );
if(env->flags & CO_IFG_DUMP_SHAPE)
fprintf(f, "shape=%s ", limited ? "diamond" : "ellipse");
co_gs_foreach_neighb(a, n) {
const arch_register_t *nr = arch_get_irn_register(env->co->aenv, n->irn);
- int nidx = get_irn_idx(n->irn);
+ unsigned nidx = get_irn_idx(n->irn);
if(aidx < nidx) {
const char *color = nr == ar ? "blue" : "red";
}
-static void void_algo(copy_opt_t *co)
+static int void_algo(copy_opt_t *co)
{
+ return 0;
}
/*
co_solve_heuristic,
co_solve_heuristic_new,
co_solve_heuristic_java,
+#ifdef WITH_ILP
co_solve_ilp2
+#endif
};
/*
{
copy_opt_t *co;
co_algo_t *algo_func;
+ int init_costs;
if(algo < 0 || algo >= CO_ALGO_LAST)
return;
co = new_copy_opt(cenv, cost_func);
co_build_ou_structure(co);
co_build_graph_structure(co);
- if(do_stats) {
- ir_printf("%30F %10s %7d%7d%7d%7d", cenv->irg, cenv->cls->name,
- co_get_max_copy_costs(co), co_get_copy_costs(co),
- co_get_inevit_copy_costs(co), co_get_lower_bound(co));
- }
+ init_costs = co_get_copy_costs(co);
/* Dump the interference graph in Appel's format. */
if(dump_flags & DUMP_APPEL) {
int remaining = co_get_copy_costs(co);
int evitable = remaining - co_get_lower_bound(co);
+ ir_printf("%30F %10s %10d%10d%10d%10d", cenv->irg, cenv->cls->name,
+ co_get_max_copy_costs(co), init_costs,
+ co_get_inevit_copy_costs(co), co_get_lower_bound(co));
+
if(optimizable_costs > 0)
- printf("%5d %5.2f\n", remaining, (evitable * 100.0) / optimizable_costs);
+ printf("%10d %5.2f\n", remaining, (evitable * 100.0) / optimizable_costs);
else
- printf("%5d %5s\n", remaining, "-");
+ printf("%10d %5s\n", remaining, "-");
}
co_free_graph_structure(co);