static int algo = BLOCKSCHED_GREEDY;
+#ifdef WITH_LIBCORE
static const lc_opt_enum_int_items_t blockschedalgo_items[] = {
{ "naiv", BLOCKSCHED_NAIV },
{ "extbb", BLOCKSCHED_EXTBB },
LC_OPT_ENT_ENUM_INT ("algo", "the block scheduling algorithm", &algo_var),
{ NULL }
};
+#endif
/*
* ____ _
entry = get_irn_link(block);
pred_entry = get_irn_link(pred_block);
- /* TODO: what's this check for? */
+ /* is 1 of the blocks already attached to another block? */
if (pred_entry->next != NULL || entry->prev != NULL)
continue;
{
int i;
int edge_count = ARR_LEN(env->ilpedges);
- FILE *f;
- char fname[256];
/* complete out constraints */
for(i = 0; i < edge_count; ++i) {
lpp_set_factor_fast(env->lpp, entry->out_cst, edge->ilpvar, 1.0);
}
- lpp_dump(env->lpp, "lpp.out");
- snprintf(fname, sizeof(fname), "lpp_%s.plain", get_irg_dump_name(env->env.irg));
- f = fopen(fname, "w");
- lpp_dump_plain(env->lpp, f);
- fclose(f);
+#if 0
+ {
+ FILE *f;
+ char fname[256];
+ lpp_dump(env->lpp, "lpp.out");
+ snprintf(fname, sizeof(fname), "lpp_%s.plain", get_irg_dump_name(env->env.irg));
+ f = fopen(fname, "w");
+ lpp_dump_plain(env->lpp, f);
+ fclose(f);
+ }
+#endif
+
//lpp_solve_net(env->lpp, main_env->options->ilp_server, main_env->options->ilp_solver);
lpp_solve_net(env->lpp, "i44pc52", "cplex");
assert(lpp_is_sol_valid(env->lpp));