9 struct isl_tab_undo **stack;
15 /* number of constraints in initial product tableau */
19 static struct tab_lp *init_lp(struct isl_basic_set *bset);
20 static void set_lp_obj(struct tab_lp *lp, isl_int *row, int dim);
21 static int solve_lp(struct tab_lp *lp);
22 static void get_obj_val(struct tab_lp* lp, mpq_t *F);
23 static void delete_lp(struct tab_lp *lp);
24 static int add_lp_row(struct tab_lp *lp, isl_int *row, int dim);
25 static void get_alpha(struct tab_lp* lp, int row, mpq_t *alpha);
26 static void del_lp_row(struct tab_lp *lp);
28 #define GBR_LP struct tab_lp
29 #define GBR_type mpq_t
30 #define GBR_init(v) mpq_init(v)
31 #define GBR_clear(v) mpq_clear(v)
32 #define GBR_set(a,b) mpq_set(a,b)
33 #define GBR_set_ui(a,b) mpq_set_ui(a,b,1)
34 #define GBR_mul(a,b,c) mpq_mul(a,b,c)
35 #define GBR_lt(a,b) (mpq_cmp(a,b) < 0)
36 #define GBR_floor(a,b) mpz_fdiv_q(a,mpq_numref(b),mpq_denref(b))
37 #define GBR_ceil(a,b) mpz_cdiv_q(a,mpq_numref(b),mpq_denref(b))
38 #define GBR_lp_init(P) init_lp(P)
39 #define GBR_lp_set_obj(lp, obj, dim) set_lp_obj(lp, obj, dim)
40 #define GBR_lp_solve(lp) solve_lp(lp)
41 #define GBR_lp_get_obj_val(lp, F) get_obj_val(lp, F)
42 #define GBR_lp_delete(lp) delete_lp(lp)
43 #define GBR_lp_next_row(lp) lp->neq
44 #define GBR_lp_add_row(lp, row, dim) add_lp_row(lp, row, dim)
45 #define GBR_lp_get_alpha(lp, row, alpha) get_alpha(lp, row, alpha)
46 #define GBR_lp_del_row(lp) del_lp_row(lp);
47 #include "basis_reduction_templ.c"
49 /* Set up a tableau for the Cartesian product of bset with itself.
50 * This could be optimized by first setting up a tableau for bset
51 * and then performing the Cartesian product on the tableau.
53 static struct isl_tab *gbr_tab(struct isl_basic_set *bset,
63 dim = isl_basic_set_total_dim(bset);
64 tab = isl_tab_alloc(bset->ctx, 2 * bset->n_ineq + dim + 1, 2 * dim, 0);
66 for (i = 0; i < 2; ++i) {
67 isl_seq_clr(row->el + 1 + (1 - i) * dim, dim);
68 for (j = 0; j < bset->n_ineq; ++j) {
69 isl_int_set(row->el[0], bset->ineq[j][0]);
70 isl_seq_cpy(row->el + 1 + i * dim,
71 bset->ineq[j] + 1, dim);
72 tab = isl_tab_add_ineq(tab, row->el);
73 if (!tab || tab->empty)
81 static struct tab_lp *init_lp(struct isl_basic_set *bset)
83 struct tab_lp *lp = NULL;
88 isl_assert(bset->ctx, bset->n_eq == 0, return NULL);
90 lp = isl_calloc_type(bset->ctx, struct tab_lp);
94 isl_int_init(lp->opt);
95 isl_int_init(lp->opt_denom);
97 lp->dim = isl_basic_set_total_dim(bset);
100 isl_ctx_ref(lp->ctx);
102 lp->stack = isl_alloc_array(lp->ctx, struct isl_tab_undo *, lp->dim);
104 lp->row = isl_vec_alloc(lp->ctx, 1 + 2 * lp->dim);
107 lp->tab = gbr_tab(bset, lp->row);
110 lp->con_offset = lp->tab->n_con;
120 static void set_lp_obj(struct tab_lp *lp, isl_int *row, int dim)
125 static int solve_lp(struct tab_lp *lp)
127 enum isl_lp_result res;
130 isl_int_set_si(lp->row->el[0], 0);
131 isl_seq_cpy(lp->row->el + 1, lp->obj, lp->dim);
132 isl_seq_neg(lp->row->el + 1 + lp->dim, lp->obj, lp->dim);
134 flags = ISL_TAB_SAVE_DUAL;
135 res = isl_tab_min(lp->tab, lp->row->el, lp->ctx->one,
136 &lp->opt, &lp->opt_denom, flags);
137 if (res != isl_lp_ok)
142 static void get_obj_val(struct tab_lp* lp, mpq_t *F)
144 isl_int_neg(mpq_numref(*F), lp->opt);
145 isl_int_set(mpq_denref(*F), lp->opt_denom);
148 static void delete_lp(struct tab_lp *lp)
153 isl_int_clear(lp->opt);
154 isl_int_clear(lp->opt_denom);
155 isl_vec_free(lp->row);
157 isl_tab_free(lp->tab);
158 isl_ctx_deref(lp->ctx);
162 static int add_lp_row(struct tab_lp *lp, isl_int *row, int dim)
164 lp->stack[lp->neq] = isl_tab_snap(lp->tab);
166 isl_int_set_si(lp->row->el[0], 0);
167 isl_seq_cpy(lp->row->el + 1, row, lp->dim);
168 isl_seq_neg(lp->row->el + 1 + lp->dim, row, lp->dim);
170 lp->tab = isl_tab_add_valid_eq(lp->tab, lp->row->el);
175 static void get_alpha(struct tab_lp* lp, int row, mpq_t *alpha)
177 row += lp->con_offset;
178 isl_int_neg(mpq_numref(*alpha), lp->tab->dual->el[1 + row]);
179 isl_int_set(mpq_denref(*alpha), lp->tab->dual->el[0]);
182 static void del_lp_row(struct tab_lp *lp)
185 isl_tab_rollback(lp->tab, lp->stack[lp->neq]);