|
Packit |
fb9d21 |
/*
|
|
Packit |
fb9d21 |
* Copyright 2008-2009 Katholieke Universiteit Leuven
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Use of this software is governed by the MIT license
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Written by Sven Verdoolaege, K.U.Leuven, Departement
|
|
Packit |
fb9d21 |
* Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
|
|
Packit |
fb9d21 |
*/
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
#include <isl_ctx_private.h>
|
|
Packit |
fb9d21 |
#include <isl_map_private.h>
|
|
Packit |
fb9d21 |
#include <isl/lp.h>
|
|
Packit |
fb9d21 |
#include <isl_seq.h>
|
|
Packit |
fb9d21 |
#include "isl_tab.h"
|
|
Packit |
fb9d21 |
#include <isl_options_private.h>
|
|
Packit |
fb9d21 |
#include <isl_local_space_private.h>
|
|
Packit |
fb9d21 |
#include <isl_aff_private.h>
|
|
Packit |
fb9d21 |
#include <isl_mat_private.h>
|
|
Packit |
fb9d21 |
#include <isl_val_private.h>
|
|
Packit |
fb9d21 |
#include <isl_vec_private.h>
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
enum isl_lp_result isl_tab_solve_lp(struct isl_basic_map *bmap, int maximize,
|
|
Packit |
fb9d21 |
isl_int *f, isl_int denom, isl_int *opt,
|
|
Packit |
fb9d21 |
isl_int *opt_denom,
|
|
Packit |
fb9d21 |
struct isl_vec **sol)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
struct isl_tab *tab;
|
|
Packit |
fb9d21 |
enum isl_lp_result res;
|
|
Packit |
fb9d21 |
unsigned dim = isl_basic_map_total_dim(bmap);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (maximize)
|
|
Packit |
fb9d21 |
isl_seq_neg(f, f, 1 + dim);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
bmap = isl_basic_map_gauss(bmap, NULL);
|
|
Packit |
fb9d21 |
tab = isl_tab_from_basic_map(bmap, 0);
|
|
Packit |
fb9d21 |
res = isl_tab_min(tab, f, denom, opt, opt_denom, 0);
|
|
Packit |
fb9d21 |
if (res == isl_lp_ok && sol) {
|
|
Packit |
fb9d21 |
*sol = isl_tab_get_sample_value(tab);
|
|
Packit |
fb9d21 |
if (!*sol)
|
|
Packit |
fb9d21 |
res = isl_lp_error;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
isl_tab_free(tab);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (maximize)
|
|
Packit |
fb9d21 |
isl_seq_neg(f, f, 1 + dim);
|
|
Packit |
fb9d21 |
if (maximize && opt)
|
|
Packit |
fb9d21 |
isl_int_neg(*opt, *opt);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
return res;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
/* Given a basic map "bmap" and an affine combination of the variables "f"
|
|
Packit |
fb9d21 |
* with denominator "denom", set *opt / *opt_denom to the minimal
|
|
Packit |
fb9d21 |
* (or maximal if "maximize" is true) value attained by f/d over "bmap",
|
|
Packit |
fb9d21 |
* assuming the basic map is not empty and the expression cannot attain
|
|
Packit |
fb9d21 |
* arbitrarily small (or large) values.
|
|
Packit |
fb9d21 |
* If opt_denom is NULL, then *opt is rounded up (or down)
|
|
Packit |
fb9d21 |
* to the nearest integer.
|
|
Packit |
fb9d21 |
* The return value reflects the nature of the result (empty, unbounded,
|
|
Packit |
fb9d21 |
* minmimal or maximal value returned in *opt).
|
|
Packit |
fb9d21 |
*/
|
|
Packit |
fb9d21 |
enum isl_lp_result isl_basic_map_solve_lp(struct isl_basic_map *bmap, int max,
|
|
Packit |
fb9d21 |
isl_int *f, isl_int d, isl_int *opt,
|
|
Packit |
fb9d21 |
isl_int *opt_denom,
|
|
Packit |
fb9d21 |
struct isl_vec **sol)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
if (sol)
|
|
Packit |
fb9d21 |
*sol = NULL;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (!bmap)
|
|
Packit |
fb9d21 |
return isl_lp_error;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
return isl_tab_solve_lp(bmap, max, f, d, opt, opt_denom, sol);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
enum isl_lp_result isl_basic_set_solve_lp(struct isl_basic_set *bset, int max,
|
|
Packit |
fb9d21 |
isl_int *f, isl_int d, isl_int *opt,
|
|
Packit |
fb9d21 |
isl_int *opt_denom,
|
|
Packit |
fb9d21 |
struct isl_vec **sol)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
return isl_basic_map_solve_lp((struct isl_basic_map *)bset, max,
|
|
Packit |
fb9d21 |
f, d, opt, opt_denom, sol);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
enum isl_lp_result isl_map_solve_lp(__isl_keep isl_map *map, int max,
|
|
Packit |
fb9d21 |
isl_int *f, isl_int d, isl_int *opt,
|
|
Packit |
fb9d21 |
isl_int *opt_denom,
|
|
Packit |
fb9d21 |
struct isl_vec **sol)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
int i;
|
|
Packit |
fb9d21 |
isl_int o;
|
|
Packit |
fb9d21 |
isl_int t;
|
|
Packit |
fb9d21 |
isl_int opt_i;
|
|
Packit |
fb9d21 |
isl_int opt_denom_i;
|
|
Packit |
fb9d21 |
enum isl_lp_result res;
|
|
Packit |
fb9d21 |
int max_div;
|
|
Packit |
fb9d21 |
isl_vec *v = NULL;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (!map)
|
|
Packit |
fb9d21 |
return isl_lp_error;
|
|
Packit |
fb9d21 |
if (map->n == 0)
|
|
Packit |
fb9d21 |
return isl_lp_empty;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
max_div = 0;
|
|
Packit |
fb9d21 |
for (i = 0; i < map->n; ++i)
|
|
Packit |
fb9d21 |
if (map->p[i]->n_div > max_div)
|
|
Packit |
fb9d21 |
max_div = map->p[i]->n_div;
|
|
Packit |
fb9d21 |
if (max_div > 0) {
|
|
Packit |
fb9d21 |
unsigned total = isl_space_dim(map->dim, isl_dim_all);
|
|
Packit |
fb9d21 |
v = isl_vec_alloc(map->ctx, 1 + total + max_div);
|
|
Packit |
fb9d21 |
if (!v)
|
|
Packit |
fb9d21 |
return isl_lp_error;
|
|
Packit |
fb9d21 |
isl_seq_cpy(v->el, f, 1 + total);
|
|
Packit |
fb9d21 |
isl_seq_clr(v->el + 1 + total, max_div);
|
|
Packit |
fb9d21 |
f = v->el;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (!opt && map->n > 1 && sol) {
|
|
Packit |
fb9d21 |
isl_int_init(o);
|
|
Packit |
fb9d21 |
opt = &o;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
if (map->n > 0)
|
|
Packit |
fb9d21 |
isl_int_init(opt_i);
|
|
Packit |
fb9d21 |
if (map->n > 0 && opt_denom) {
|
|
Packit |
fb9d21 |
isl_int_init(opt_denom_i);
|
|
Packit |
fb9d21 |
isl_int_init(t);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
res = isl_basic_map_solve_lp(map->p[0], max, f, d,
|
|
Packit |
fb9d21 |
opt, opt_denom, sol);
|
|
Packit |
fb9d21 |
if (res == isl_lp_error || res == isl_lp_unbounded)
|
|
Packit |
fb9d21 |
goto done;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (sol)
|
|
Packit |
fb9d21 |
*sol = NULL;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
for (i = 1; i < map->n; ++i) {
|
|
Packit |
fb9d21 |
isl_vec *sol_i = NULL;
|
|
Packit |
fb9d21 |
enum isl_lp_result res_i;
|
|
Packit |
fb9d21 |
int better;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
res_i = isl_basic_map_solve_lp(map->p[i], max, f, d,
|
|
Packit |
fb9d21 |
&opt_i,
|
|
Packit |
fb9d21 |
opt_denom ? &opt_denom_i : NULL,
|
|
Packit |
fb9d21 |
sol ? &sol_i : NULL);
|
|
Packit |
fb9d21 |
if (res_i == isl_lp_error || res_i == isl_lp_unbounded) {
|
|
Packit |
fb9d21 |
res = res_i;
|
|
Packit |
fb9d21 |
goto done;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
if (res_i == isl_lp_empty)
|
|
Packit |
fb9d21 |
continue;
|
|
Packit |
fb9d21 |
if (res == isl_lp_empty) {
|
|
Packit |
fb9d21 |
better = 1;
|
|
Packit |
fb9d21 |
} else if (!opt_denom) {
|
|
Packit |
fb9d21 |
if (max)
|
|
Packit |
fb9d21 |
better = isl_int_gt(opt_i, *opt);
|
|
Packit |
fb9d21 |
else
|
|
Packit |
fb9d21 |
better = isl_int_lt(opt_i, *opt);
|
|
Packit |
fb9d21 |
} else {
|
|
Packit |
fb9d21 |
isl_int_mul(t, opt_i, *opt_denom);
|
|
Packit |
fb9d21 |
isl_int_submul(t, *opt, opt_denom_i);
|
|
Packit |
fb9d21 |
if (max)
|
|
Packit |
fb9d21 |
better = isl_int_is_pos(t);
|
|
Packit |
fb9d21 |
else
|
|
Packit |
fb9d21 |
better = isl_int_is_neg(t);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
if (better) {
|
|
Packit |
fb9d21 |
res = res_i;
|
|
Packit |
fb9d21 |
if (opt)
|
|
Packit |
fb9d21 |
isl_int_set(*opt, opt_i);
|
|
Packit |
fb9d21 |
if (opt_denom)
|
|
Packit |
fb9d21 |
isl_int_set(*opt_denom, opt_denom_i);
|
|
Packit |
fb9d21 |
if (sol) {
|
|
Packit |
fb9d21 |
isl_vec_free(*sol);
|
|
Packit |
fb9d21 |
*sol = sol_i;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
} else
|
|
Packit |
fb9d21 |
isl_vec_free(sol_i);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
done:
|
|
Packit |
fb9d21 |
isl_vec_free(v);
|
|
Packit |
fb9d21 |
if (map->n > 0 && opt_denom) {
|
|
Packit |
fb9d21 |
isl_int_clear(opt_denom_i);
|
|
Packit |
fb9d21 |
isl_int_clear(t);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
if (map->n > 0)
|
|
Packit |
fb9d21 |
isl_int_clear(opt_i);
|
|
Packit |
fb9d21 |
if (opt == &o)
|
|
Packit |
fb9d21 |
isl_int_clear(o);
|
|
Packit |
fb9d21 |
return res;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
enum isl_lp_result isl_set_solve_lp(__isl_keep isl_set *set, int max,
|
|
Packit |
fb9d21 |
isl_int *f, isl_int d, isl_int *opt,
|
|
Packit |
fb9d21 |
isl_int *opt_denom,
|
|
Packit |
fb9d21 |
struct isl_vec **sol)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
return isl_map_solve_lp((struct isl_map *)set, max,
|
|
Packit |
fb9d21 |
f, d, opt, opt_denom, sol);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
/* Return the optimal (rational) value of "obj" over "bset", assuming
|
|
Packit |
fb9d21 |
* that "obj" and "bset" have aligned parameters and divs.
|
|
Packit |
fb9d21 |
* If "max" is set, then the maximal value is computed.
|
|
Packit |
fb9d21 |
* Otherwise, the minimal value is computed.
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Return infinity or negative infinity if the optimal value is unbounded and
|
|
Packit |
fb9d21 |
* NaN if "bset" is empty.
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Call isl_basic_set_solve_lp and translate the results.
|
|
Packit |
fb9d21 |
*/
|
|
Packit |
fb9d21 |
static __isl_give isl_val *basic_set_opt_lp(
|
|
Packit |
fb9d21 |
__isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
isl_ctx *ctx;
|
|
Packit |
fb9d21 |
isl_val *res;
|
|
Packit |
fb9d21 |
enum isl_lp_result lp_res;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (!bset || !obj)
|
|
Packit |
fb9d21 |
return NULL;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
ctx = isl_aff_get_ctx(obj);
|
|
Packit |
fb9d21 |
res = isl_val_alloc(ctx);
|
|
Packit |
fb9d21 |
if (!res)
|
|
Packit |
fb9d21 |
return NULL;
|
|
Packit |
fb9d21 |
lp_res = isl_basic_set_solve_lp(bset, max, obj->v->el + 1,
|
|
Packit |
fb9d21 |
obj->v->el[0], &res->n, &res->d, NULL);
|
|
Packit |
fb9d21 |
if (lp_res == isl_lp_ok)
|
|
Packit |
fb9d21 |
return isl_val_normalize(res);
|
|
Packit |
fb9d21 |
isl_val_free(res);
|
|
Packit |
fb9d21 |
if (lp_res == isl_lp_error)
|
|
Packit |
fb9d21 |
return NULL;
|
|
Packit |
fb9d21 |
if (lp_res == isl_lp_empty)
|
|
Packit |
fb9d21 |
return isl_val_nan(ctx);
|
|
Packit |
fb9d21 |
if (max)
|
|
Packit |
fb9d21 |
return isl_val_infty(ctx);
|
|
Packit |
fb9d21 |
else
|
|
Packit |
fb9d21 |
return isl_val_neginfty(ctx);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
/* Return the optimal (rational) value of "obj" over "bset", assuming
|
|
Packit |
fb9d21 |
* that "obj" and "bset" have aligned parameters.
|
|
Packit |
fb9d21 |
* If "max" is set, then the maximal value is computed.
|
|
Packit |
fb9d21 |
* Otherwise, the minimal value is computed.
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Return infinity or negative infinity if the optimal value is unbounded and
|
|
Packit |
fb9d21 |
* NaN if "bset" is empty.
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Align the divs of "bset" and "obj" and call basic_set_opt_lp.
|
|
Packit |
fb9d21 |
*/
|
|
Packit |
fb9d21 |
static __isl_give isl_val *isl_basic_set_opt_lp_val_aligned(
|
|
Packit |
fb9d21 |
__isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
int *exp1 = NULL;
|
|
Packit |
fb9d21 |
int *exp2 = NULL;
|
|
Packit |
fb9d21 |
isl_ctx *ctx;
|
|
Packit |
fb9d21 |
isl_mat *bset_div = NULL;
|
|
Packit |
fb9d21 |
isl_mat *div = NULL;
|
|
Packit |
fb9d21 |
isl_val *res;
|
|
Packit |
fb9d21 |
int bset_n_div, obj_n_div;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (!bset || !obj)
|
|
Packit |
fb9d21 |
return NULL;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
ctx = isl_aff_get_ctx(obj);
|
|
Packit |
fb9d21 |
if (!isl_space_is_equal(bset->dim, obj->ls->dim))
|
|
Packit |
fb9d21 |
isl_die(ctx, isl_error_invalid,
|
|
Packit |
fb9d21 |
"spaces don't match", return NULL);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
bset_n_div = isl_basic_set_dim(bset, isl_dim_div);
|
|
Packit |
fb9d21 |
obj_n_div = isl_aff_dim(obj, isl_dim_div);
|
|
Packit |
fb9d21 |
if (bset_n_div == 0 && obj_n_div == 0)
|
|
Packit |
fb9d21 |
return basic_set_opt_lp(bset, max, obj);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
bset = isl_basic_set_copy(bset);
|
|
Packit |
fb9d21 |
obj = isl_aff_copy(obj);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
bset_div = isl_basic_set_get_divs(bset);
|
|
Packit |
fb9d21 |
exp1 = isl_alloc_array(ctx, int, bset_n_div);
|
|
Packit |
fb9d21 |
exp2 = isl_alloc_array(ctx, int, obj_n_div);
|
|
Packit |
fb9d21 |
if (!bset_div || (bset_n_div && !exp1) || (obj_n_div && !exp2))
|
|
Packit |
fb9d21 |
goto error;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
div = isl_merge_divs(bset_div, obj->ls->div, exp1, exp2);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
bset = isl_basic_set_expand_divs(bset, isl_mat_copy(div), exp1);
|
|
Packit |
fb9d21 |
obj = isl_aff_expand_divs(obj, isl_mat_copy(div), exp2);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
res = basic_set_opt_lp(bset, max, obj);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
isl_mat_free(bset_div);
|
|
Packit |
fb9d21 |
isl_mat_free(div);
|
|
Packit |
fb9d21 |
free(exp1);
|
|
Packit |
fb9d21 |
free(exp2);
|
|
Packit |
fb9d21 |
isl_basic_set_free(bset);
|
|
Packit |
fb9d21 |
isl_aff_free(obj);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
return res;
|
|
Packit |
fb9d21 |
error:
|
|
Packit |
fb9d21 |
isl_mat_free(div);
|
|
Packit |
fb9d21 |
isl_mat_free(bset_div);
|
|
Packit |
fb9d21 |
free(exp1);
|
|
Packit |
fb9d21 |
free(exp2);
|
|
Packit |
fb9d21 |
isl_basic_set_free(bset);
|
|
Packit |
fb9d21 |
isl_aff_free(obj);
|
|
Packit |
fb9d21 |
return NULL;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
/* Return the optimal (rational) value of "obj" over "bset".
|
|
Packit |
fb9d21 |
* If "max" is set, then the maximal value is computed.
|
|
Packit |
fb9d21 |
* Otherwise, the minimal value is computed.
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Return infinity or negative infinity if the optimal value is unbounded and
|
|
Packit |
fb9d21 |
* NaN if "bset" is empty.
|
|
Packit |
fb9d21 |
*/
|
|
Packit |
fb9d21 |
static __isl_give isl_val *isl_basic_set_opt_lp_val(
|
|
Packit |
fb9d21 |
__isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
isl_val *res;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (!bset || !obj)
|
|
Packit |
fb9d21 |
return NULL;
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
if (isl_space_match(bset->dim, isl_dim_param,
|
|
Packit |
fb9d21 |
obj->ls->dim, isl_dim_param))
|
|
Packit |
fb9d21 |
return isl_basic_set_opt_lp_val_aligned(bset, max, obj);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
bset = isl_basic_set_copy(bset);
|
|
Packit |
fb9d21 |
obj = isl_aff_copy(obj);
|
|
Packit |
fb9d21 |
bset = isl_basic_set_align_params(bset, isl_aff_get_domain_space(obj));
|
|
Packit |
fb9d21 |
obj = isl_aff_align_params(obj, isl_basic_set_get_space(bset));
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
res = isl_basic_set_opt_lp_val_aligned(bset, max, obj);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
isl_basic_set_free(bset);
|
|
Packit |
fb9d21 |
isl_aff_free(obj);
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
return res;
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
/* Return the minimal (rational) value of "obj" over "bset".
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Return negative infinity if the minimal value is unbounded and
|
|
Packit |
fb9d21 |
* NaN if "bset" is empty.
|
|
Packit |
fb9d21 |
*/
|
|
Packit |
fb9d21 |
__isl_give isl_val *isl_basic_set_min_lp_val(__isl_keep isl_basic_set *bset,
|
|
Packit |
fb9d21 |
__isl_keep isl_aff *obj)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
return isl_basic_set_opt_lp_val(bset, 0, obj);
|
|
Packit |
fb9d21 |
}
|
|
Packit |
fb9d21 |
|
|
Packit |
fb9d21 |
/* Return the maximal (rational) value of "obj" over "bset".
|
|
Packit |
fb9d21 |
*
|
|
Packit |
fb9d21 |
* Return infinity if the maximal value is unbounded and
|
|
Packit |
fb9d21 |
* NaN if "bset" is empty.
|
|
Packit |
fb9d21 |
*/
|
|
Packit |
fb9d21 |
__isl_give isl_val *isl_basic_set_max_lp_val(__isl_keep isl_basic_set *bset,
|
|
Packit |
fb9d21 |
__isl_keep isl_aff *obj)
|
|
Packit |
fb9d21 |
{
|
|
Packit |
fb9d21 |
return isl_basic_set_opt_lp_val(bset, 1, obj);
|
|
Packit |
fb9d21 |
}
|