__isl_give isl_point *isl_point_alloc(__isl_take isl_dim *dim,
__isl_take isl_vec *vec)
{
struct isl_point *pnt;
if (!dim || !vec)
goto error;
if (vec->size > 1 + isl_dim_total(dim)) {
vec = isl_vec_cow(vec);
if (!vec)
goto error;
vec->size = 1 + isl_dim_total(dim);
}
pnt = isl_alloc_type(dim->ctx, struct isl_point);
if (!pnt)
goto error;
pnt->ref = 1;
pnt->dim = dim;
pnt->vec = vec;
return pnt;
error:
isl_dim_free(dim);
isl_vec_free(vec);
return NULL;
}
/* Add a specific constraint of bmap (or its opposite) to tab.
* The position of the constraint is specified by "c", where
* the equalities of bmap are counted twice, once for the inequality
* that is equal to the equality, and once for its negation.
*/
static int tab_add_constraint(struct isl_tab *tab,
__isl_keep isl_basic_map *bmap, int *div_map, int c, int oppose)
{
unsigned dim;
unsigned tab_total;
unsigned bmap_total;
isl_vec *v;
int r;
if (!tab || !bmap)
return -1;
tab_total = isl_basic_map_total_dim(tab->bmap);
bmap_total = isl_basic_map_total_dim(bmap);
dim = isl_dim_total(tab->bmap->dim);
v = isl_vec_alloc(bmap->ctx, 1 + tab_total);
if (!v)
return -1;
if (c < 2 * bmap->n_eq) {
if ((c % 2) != oppose)
isl_seq_neg(bmap->eq[c/2], bmap->eq[c/2],
1 + bmap_total);
if (oppose)
isl_int_sub_ui(bmap->eq[c/2][0], bmap->eq[c/2][0], 1);
expand_constraint(v, dim, bmap->eq[c/2], div_map, bmap->n_div);
r = isl_tab_add_ineq(tab, v->el);
if (oppose)
isl_int_add_ui(bmap->eq[c/2][0], bmap->eq[c/2][0], 1);
if ((c % 2) != oppose)
isl_seq_neg(bmap->eq[c/2], bmap->eq[c/2],
1 + bmap_total);
} else {
c -= 2 * bmap->n_eq;
if (oppose) {
isl_seq_neg(bmap->ineq[c], bmap->ineq[c],
1 + bmap_total);
isl_int_sub_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1);
}
expand_constraint(v, dim, bmap->ineq[c], div_map, bmap->n_div);
r = isl_tab_add_ineq(tab, v->el);
if (oppose) {
isl_int_add_ui(bmap->ineq[c][0], bmap->ineq[c][0], 1);
isl_seq_neg(bmap->ineq[c], bmap->ineq[c],
1 + bmap_total);
}
}
isl_vec_free(v);
return r;
}
/* Add all constraints of bmap to tab. The equalities of bmap
* are added as a pair of inequalities.
*/
static int tab_add_constraints(struct isl_tab *tab,
__isl_keep isl_basic_map *bmap, int *div_map)
{
int i;
unsigned dim;
unsigned tab_total;
unsigned bmap_total;
isl_vec *v;
if (!tab || !bmap)
return -1;
tab_total = isl_basic_map_total_dim(tab->bmap);
bmap_total = isl_basic_map_total_dim(bmap);
dim = isl_dim_total(tab->bmap->dim);
if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0)
return -1;
v = isl_vec_alloc(bmap->ctx, 1 + tab_total);
if (!v)
return -1;
for (i = 0; i < bmap->n_eq; ++i) {
expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div);
if (isl_tab_add_ineq(tab, v->el) < 0)
goto error;
isl_seq_neg(bmap->eq[i], bmap->eq[i], 1 + bmap_total);
expand_constraint(v, dim, bmap->eq[i], div_map, bmap->n_div);
if (isl_tab_add_ineq(tab, v->el) < 0)
goto error;
isl_seq_neg(bmap->eq[i], bmap->eq[i], 1 + bmap_total);
if (tab->empty)
break;
}
for (i = 0; i < bmap->n_ineq; ++i) {
expand_constraint(v, dim, bmap->ineq[i], div_map, bmap->n_div);
if (isl_tab_add_ineq(tab, v->el) < 0)
goto error;
if (tab->empty)
break;
}
isl_vec_free(v);
return 0;
error:
isl_vec_free(v);
return -1;
}
__isl_give isl_point *isl_point_zero(__isl_take isl_dim *dim)
{
isl_vec *vec;
if (!dim)
return NULL;
vec = isl_vec_alloc(dim->ctx, 1 + isl_dim_total(dim));
if (!vec)
goto error;
isl_int_set_si(vec->el[0], 1);
isl_seq_clr(vec->el + 1, vec->size - 1);
return isl_point_alloc(dim, vec);
error:
isl_dim_free(dim);
return NULL;
}
__isl_give isl_basic_set *isl_basic_set_box_from_points(
__isl_take isl_point *pnt1, __isl_take isl_point *pnt2)
{
isl_basic_set *bset;
unsigned total;
int i;
int k;
isl_int t;
isl_int_init(t);
if (!pnt1 || !pnt2)
goto error;
isl_assert(pnt1->dim->ctx,
isl_dim_equal(pnt1->dim, pnt2->dim), goto error);
if (isl_point_is_void(pnt1) && isl_point_is_void(pnt2)) {
isl_dim *dim = isl_dim_copy(pnt1->dim);
isl_point_free(pnt1);
isl_point_free(pnt2);
isl_int_clear(t);
return isl_basic_set_empty(dim);
}
if (isl_point_is_void(pnt1)) {
isl_point_free(pnt1);
isl_int_clear(t);
return isl_basic_set_from_point(pnt2);
}
if (isl_point_is_void(pnt2)) {
isl_point_free(pnt2);
isl_int_clear(t);
return isl_basic_set_from_point(pnt1);
}
total = isl_dim_total(pnt1->dim);
bset = isl_basic_set_alloc_dim(isl_dim_copy(pnt1->dim), 0, 0, 2 * total);
for (i = 0; i < total; ++i) {
isl_int_mul(t, pnt1->vec->el[1 + i], pnt2->vec->el[0]);
isl_int_submul(t, pnt2->vec->el[1 + i], pnt1->vec->el[0]);
k = isl_basic_set_alloc_inequality(bset);
if (k < 0)
goto error;
isl_seq_clr(bset->ineq[k] + 1, total);
if (isl_int_is_pos(t)) {
isl_int_set_si(bset->ineq[k][1 + i], -1);
isl_int_set(bset->ineq[k][0], pnt1->vec->el[1 + i]);
} else {
isl_int_set_si(bset->ineq[k][1 + i], 1);
isl_int_neg(bset->ineq[k][0], pnt1->vec->el[1 + i]);
}
isl_int_fdiv_q(bset->ineq[k][0], bset->ineq[k][0], pnt1->vec->el[0]);
k = isl_basic_set_alloc_inequality(bset);
if (k < 0)
goto error;
isl_seq_clr(bset->ineq[k] + 1, total);
if (isl_int_is_pos(t)) {
isl_int_set_si(bset->ineq[k][1 + i], 1);
isl_int_neg(bset->ineq[k][0], pnt2->vec->el[1 + i]);
} else {
isl_int_set_si(bset->ineq[k][1 + i], -1);
isl_int_set(bset->ineq[k][0], pnt2->vec->el[1 + i]);
}
isl_int_fdiv_q(bset->ineq[k][0], bset->ineq[k][0], pnt2->vec->el[0]);
}
bset = isl_basic_set_finalize(bset);
isl_point_free(pnt1);
isl_point_free(pnt2);
isl_int_clear(t);
return bset;
error:
isl_point_free(pnt1);
isl_point_free(pnt2);
isl_int_clear(t);
return NULL;
}
