2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
12 #include "isl_lp_piplib.h"
15 #include "isl_map_private.h"
17 enum isl_lp_result isl_tab_solve_lp(struct isl_basic_map *bmap, int maximize,
18 isl_int *f, isl_int denom, isl_int *opt,
23 enum isl_lp_result res;
24 unsigned dim = isl_basic_map_total_dim(bmap);
27 isl_seq_neg(f, f, 1 + dim);
29 bmap = isl_basic_map_gauss(bmap, NULL);
30 tab = isl_tab_from_basic_map(bmap);
31 res = isl_tab_min(tab, f, bmap->ctx->one, opt, opt_denom, 0);
32 if (res == isl_lp_ok && sol) {
33 *sol = isl_tab_get_sample_value(tab);
40 isl_seq_neg(f, f, 1 + dim);
42 isl_int_neg(*opt, *opt);
47 /* Given a basic map "bmap" and an affine combination of the variables "f"
48 * with denominator "denom", set *opt/*opt_denom to the minimal
49 * (or maximal if "maximize" is true) value attained by f/d over "bmap",
50 * assuming the basic map is not empty and the expression cannot attain
51 * arbitrarily small (or large) values.
52 * If opt_denom is NULL, then *opt is rounded up (or down)
53 * to the nearest integer.
54 * The return value reflects the nature of the result (empty, unbounded,
55 * minmimal or maximal value returned in *opt).
57 enum isl_lp_result isl_basic_map_solve_lp(struct isl_basic_map *bmap, int max,
58 isl_int *f, isl_int d, isl_int *opt,
68 switch (bmap->ctx->opt->lp_solver) {
70 return isl_pip_solve_lp(bmap, max, f, d, opt, opt_denom, sol);
72 return isl_tab_solve_lp(bmap, max, f, d, opt, opt_denom, sol);
78 enum isl_lp_result isl_basic_set_solve_lp(struct isl_basic_set *bset, int max,
79 isl_int *f, isl_int d, isl_int *opt,
83 return isl_basic_map_solve_lp((struct isl_basic_map *)bset, max,
84 f, d, opt, opt_denom, sol);