* @brief Block-scheduling strategies.
* @author Matthias Braun, Christoph Mallon
* @date 27.09.2006
- * @version $Id$
*
* The goals of the greedy (and ILP) algorithm here works by assuming that
* we want to change as many jumps to fallthroughs as possible (executed jumps
static void coalesce_blocks_ilp(blocksched_ilp_env_t *env)
{
int edge_count = ARR_LEN(env->ilpedges);
- be_options_t *options = be_get_irg_options(env->env.irg);
int i;
/* complete out constraints */
lpp_set_factor_fast(env->lpp, entry->out_cst, edge->ilpvar, 1.0);
}
- lpp_solve_net(env->lpp, options->ilp_server, options->ilp_solver);
+ lpp_solve_net(env->lpp, be_options.ilp_server, be_options.ilp_solver);
assert(lpp_is_sol_valid(env->lpp));
/* Apply results to edges */