*****************************************************************************/
+
+size_red_t *new_size_red(copy_opt_t *co) {
+ size_red_t *res = malloc(sizeof(*res));
+
+ res->co = co;
+ res->all_removed = pset_new_ptr_default();
+ res->col_suff = NULL;
+ obstack_init(&res->ob);
+
+ return res;
+}
+
/**
* Checks if a node is simplicial in the graph heeding the already removed nodes.
*/
}
void free_size_red(size_red_t *sr) {
+ del_pset(sr->all_removed);
obstack_free(&sr->ob, NULL);
free(sr);
}
*****************************************************************************/
-ilp_env_t *new_ilp_env(copy_opt_t *co, firm_dbg_module_t *dbg, ilp_callback build, ilp_callback apply, void *env) {
+ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env) {
ilp_env_t *res = malloc(sizeof(*res));
assert(res);
res->co = co;
- res->dbg = dbg;
res->build = build;
res->apply = apply;
res->env = env;
return res;
}
-lpp_sol_state_t ilp_go(ilp_env_t *ienv, double time_limit) {
+lpp_sol_state_t ilp_go(ilp_env_t *ienv) {
sr_remove(ienv->sr);
ienv->build(ienv);
- lpp_set_time_limit(ienv->lp, time_limit);
-
#ifdef LPP_SOLVE_NET
lpp_solve_net(ienv->lp, LPP_HOST, LPP_SOLVER);
#else