2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 #include <isl_map_private.h>
14 #include <isl/constraint.h>
15 #include <isl_dim_private.h>
16 #include <isl_div_private.h>
18 #include <isl_aff_private.h>
20 isl_ctx *isl_constraint_get_ctx(__isl_keep isl_constraint *c)
22 return c ? c->ctx : NULL;
25 static unsigned n(struct isl_constraint *c, enum isl_dim_type type)
27 return isl_basic_map_dim(c->bmap, type);
30 static unsigned offset(struct isl_constraint *c, enum isl_dim_type type)
32 struct isl_dim *dim = c->bmap->dim;
34 case isl_dim_param: return 1;
35 case isl_dim_in: return 1 + dim->nparam;
36 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
37 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
42 static unsigned basic_map_offset(__isl_keep isl_basic_map *bmap,
43 enum isl_dim_type type)
45 return type == isl_dim_div ? 1 + isl_dim_total(bmap->dim)
46 : 1 + isl_dim_offset(bmap->dim, type);
49 static unsigned basic_set_offset(struct isl_basic_set *bset,
50 enum isl_dim_type type)
52 struct isl_dim *dim = bset->dim;
54 case isl_dim_param: return 1;
55 case isl_dim_in: return 1 + dim->nparam;
56 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
57 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
62 struct isl_constraint *isl_basic_map_constraint(struct isl_basic_map *bmap,
65 struct isl_constraint *constraint;
70 constraint = isl_alloc_type(bmap->ctx, struct isl_constraint);
74 constraint->ctx = bmap->ctx;
75 isl_ctx_ref(constraint->ctx);
77 constraint->bmap = bmap;
78 constraint->line = line;
82 isl_basic_map_free(bmap);
86 struct isl_constraint *isl_basic_set_constraint(struct isl_basic_set *bset,
89 return isl_basic_map_constraint((struct isl_basic_map *)bset, line);
92 struct isl_constraint *isl_equality_alloc(struct isl_dim *dim)
94 struct isl_basic_map *bmap;
99 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
103 isl_basic_map_alloc_equality(bmap);
104 isl_seq_clr(bmap->eq[0], 1 + isl_basic_map_total_dim(bmap));
105 return isl_basic_map_constraint(bmap, &bmap->eq[0]);
108 struct isl_constraint *isl_inequality_alloc(struct isl_dim *dim)
110 struct isl_basic_map *bmap;
115 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 1);
119 isl_basic_map_alloc_inequality(bmap);
120 isl_seq_clr(bmap->ineq[0], 1 + isl_basic_map_total_dim(bmap));
121 return isl_basic_map_constraint(bmap, &bmap->ineq[0]);
124 struct isl_constraint *isl_constraint_dup(struct isl_constraint *c)
126 struct isl_basic_map *bmap;
133 eq = c->line < c->bmap->eq + c->bmap->n_eq;
134 i = eq ? c->line - c->bmap->eq : c->line - c->bmap->ineq;
135 bmap = isl_basic_map_copy(c->bmap);
138 return isl_basic_map_constraint(bmap, eq ? bmap->eq + i : bmap->ineq + i);
141 struct isl_constraint *isl_constraint_cow(struct isl_constraint *c)
149 return isl_constraint_dup(c);
152 struct isl_constraint *isl_constraint_copy(struct isl_constraint *constraint)
161 void isl_constraint_free(struct isl_constraint *c)
169 isl_basic_map_free(c->bmap);
170 isl_ctx_deref(c->ctx);
174 __isl_give isl_constraint *isl_basic_map_first_constraint(
175 __isl_take isl_basic_map *bmap)
181 return isl_basic_map_constraint(bmap, &bmap->eq[0]);
183 if (bmap->n_ineq > 0)
184 return isl_basic_map_constraint(bmap, &bmap->ineq[0]);
186 isl_basic_map_free(bmap);
190 __isl_give isl_constraint *isl_basic_set_first_constraint(
191 __isl_take isl_basic_set *bset)
193 return isl_basic_map_first_constraint((struct isl_basic_map *)bset);
196 struct isl_constraint *isl_constraint_next(struct isl_constraint *c)
198 c = isl_constraint_cow(c);
199 if (c->line >= c->bmap->eq) {
201 if (c->line < c->bmap->eq + c->bmap->n_eq)
203 c->line = c->bmap->ineq;
206 if (c->line < c->bmap->ineq + c->bmap->n_ineq)
208 isl_constraint_free(c);
212 int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap,
213 int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
216 struct isl_constraint *c;
221 isl_assert(bmap->ctx, ISL_F_ISSET(bmap, ISL_BASIC_MAP_FINAL),
224 for (i = 0; i < bmap->n_eq; ++i) {
225 c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
233 for (i = 0; i < bmap->n_ineq; ++i) {
234 c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
245 int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset,
246 int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
248 return isl_basic_map_foreach_constraint((isl_basic_map *)bset, fn, user);
251 int isl_constraint_is_equal(struct isl_constraint *constraint1,
252 struct isl_constraint *constraint2)
254 if (!constraint1 || !constraint2)
256 return constraint1->bmap == constraint2->bmap &&
257 constraint1->line == constraint2->line;
260 struct isl_basic_map *isl_basic_map_add_constraint(
261 struct isl_basic_map *bmap, struct isl_constraint *constraint)
263 if (!bmap || !constraint)
266 isl_assert(constraint->ctx,
267 isl_dim_equal(bmap->dim, constraint->bmap->dim), goto error);
269 bmap = isl_basic_map_intersect(bmap,
270 isl_basic_map_from_constraint(constraint));
273 isl_basic_map_free(bmap);
274 isl_constraint_free(constraint);
278 struct isl_basic_set *isl_basic_set_add_constraint(
279 struct isl_basic_set *bset, struct isl_constraint *constraint)
281 return (struct isl_basic_set *)
282 isl_basic_map_add_constraint((struct isl_basic_map *)bset,
286 struct isl_constraint *isl_constraint_add_div(struct isl_constraint *constraint,
287 struct isl_div *div, int *pos)
289 if (!constraint || !div)
292 isl_assert(constraint->ctx,
293 isl_dim_equal(div->bmap->dim, constraint->bmap->dim), goto error);
294 isl_assert(constraint->ctx,
295 constraint->bmap->n_eq + constraint->bmap->n_ineq == 1, goto error);
297 constraint->bmap = isl_basic_map_cow(constraint->bmap);
298 constraint->bmap = isl_basic_map_extend_dim(constraint->bmap,
299 isl_dim_copy(constraint->bmap->dim), 1, 0, 0);
300 if (!constraint->bmap)
302 constraint->line = &constraint->bmap->ineq[0];
303 *pos = isl_basic_map_alloc_div(constraint->bmap);
306 isl_seq_cpy(constraint->bmap->div[*pos], div->line[0],
307 1 + 1 + isl_basic_map_total_dim(constraint->bmap));
311 isl_constraint_free(constraint);
316 __isl_give isl_dim *isl_constraint_get_dim(
317 __isl_keep isl_constraint *constraint)
319 return constraint ? isl_basic_map_get_dim(constraint->bmap) : NULL;
322 int isl_constraint_dim(struct isl_constraint *constraint,
323 enum isl_dim_type type)
327 return n(constraint, type);
330 int isl_constraint_involves_dims(__isl_keep isl_constraint *constraint,
331 enum isl_dim_type type, unsigned first, unsigned n)
336 if (first + n > isl_basic_set_dim(constraint->bmap, type))
337 isl_die(constraint->ctx, isl_error_invalid,
338 "index out of bounds", return -1);
340 first += isl_basic_map_offset(constraint->bmap, type);
342 if (isl_seq_first_non_zero(constraint->line[0] + first, n) >= 0)
348 const char *isl_constraint_get_dim_name(__isl_keep isl_constraint *constraint,
349 enum isl_dim_type type, unsigned pos)
352 isl_basic_map_get_dim_name(constraint->bmap, type, pos) : NULL;
355 void isl_constraint_get_constant(struct isl_constraint *constraint, isl_int *v)
359 isl_int_set(*v, constraint->line[0][0]);
362 void isl_constraint_get_coefficient(struct isl_constraint *constraint,
363 enum isl_dim_type type, int pos, isl_int *v)
368 isl_assert(constraint->ctx, pos < n(constraint, type), return);
369 isl_int_set(*v, constraint->line[0][offset(constraint, type) + pos]);
372 struct isl_div *isl_constraint_div(struct isl_constraint *constraint, int pos)
377 isl_assert(constraint->ctx, pos < n(constraint, isl_dim_div),
379 isl_assert(constraint->ctx,
380 !isl_int_is_zero(constraint->bmap->div[pos][0]), return NULL);
381 return isl_basic_map_div(isl_basic_map_copy(constraint->bmap), pos);
384 void isl_constraint_set_constant(struct isl_constraint *constraint, isl_int v)
388 isl_int_set(constraint->line[0][0], v);
391 void isl_constraint_set_constant_si(__isl_keep isl_constraint *constraint,
396 isl_int_set_si(constraint->line[0][0], v);
399 void isl_constraint_set_coefficient(struct isl_constraint *constraint,
400 enum isl_dim_type type, int pos, isl_int v)
405 isl_assert(constraint->ctx, pos < n(constraint, type), return);
406 isl_int_set(constraint->line[0][offset(constraint, type) + pos], v);
409 void isl_constraint_set_coefficient_si(__isl_keep isl_constraint *constraint,
410 enum isl_dim_type type, int pos, int v)
415 isl_assert(constraint->ctx, pos < n(constraint, type), return);
416 isl_int_set_si(constraint->line[0][offset(constraint, type) + pos], v);
419 void isl_constraint_clear(struct isl_constraint *constraint)
425 total = isl_basic_map_total_dim(constraint->bmap);
426 isl_seq_clr(constraint->line[0], 1 + total);
429 struct isl_constraint *isl_constraint_negate(struct isl_constraint *constraint)
436 isl_assert(constraint->ctx, !isl_constraint_is_equality(constraint),
438 isl_assert(constraint->ctx, constraint->bmap->ref == 1, goto error);
439 total = isl_basic_map_total_dim(constraint->bmap);
440 isl_seq_neg(constraint->line[0], constraint->line[0], 1 + total);
441 isl_int_sub_ui(constraint->line[0][0], constraint->line[0][0], 1);
442 ISL_F_CLR(constraint->bmap, ISL_BASIC_MAP_NORMALIZED);
445 isl_constraint_free(constraint);
449 int isl_constraint_is_equality(struct isl_constraint *constraint)
453 return constraint->line >= constraint->bmap->eq;
456 int isl_constraint_is_div_constraint(__isl_keep isl_constraint *constraint)
462 if (isl_constraint_is_equality(constraint))
464 for (i = 0; i < constraint->bmap->n_div; ++i) {
465 if (isl_int_is_zero(constraint->bmap->div[i][0]))
467 if (isl_basic_map_is_div_constraint(constraint->bmap,
468 constraint->line[0], i))
475 /* We manually set ISL_BASIC_SET_FINAL instead of calling
476 * isl_basic_map_finalize because we want to keep the position
477 * of the divs and we therefore do not want to throw away redundant divs.
478 * This is arguably a bit fragile.
480 __isl_give isl_basic_map *isl_basic_map_from_constraint(
481 __isl_take isl_constraint *constraint)
484 struct isl_basic_map *bmap;
491 if (constraint->bmap->n_eq == 1 && constraint->bmap->n_ineq == 0) {
492 bmap = isl_basic_map_copy(constraint->bmap);
493 isl_constraint_free(constraint);
497 bmap = isl_basic_map_universe_like(constraint->bmap);
498 bmap = isl_basic_map_align_divs(bmap, constraint->bmap);
499 bmap = isl_basic_map_cow(bmap);
500 bmap = isl_basic_map_extend_constraints(bmap, 1, 1);
501 if (isl_constraint_is_equality(constraint)) {
502 k = isl_basic_map_alloc_equality(bmap);
508 k = isl_basic_map_alloc_inequality(bmap);
513 total = isl_basic_map_total_dim(bmap);
514 isl_seq_cpy(c, constraint->line[0], 1 + total);
515 isl_constraint_free(constraint);
517 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
520 isl_constraint_free(constraint);
521 isl_basic_map_free(bmap);
525 struct isl_basic_set *isl_basic_set_from_constraint(
526 struct isl_constraint *constraint)
531 isl_assert(constraint->ctx,n(constraint, isl_dim_in) == 0, goto error);
532 return (isl_basic_set *)isl_basic_map_from_constraint(constraint);
534 isl_constraint_free(constraint);
538 int isl_basic_map_has_defining_equality(
539 __isl_keep isl_basic_map *bmap, enum isl_dim_type type, int pos,
540 __isl_give isl_constraint **c)
548 offset = basic_map_offset(bmap, type);
549 total = isl_basic_map_total_dim(bmap);
550 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
551 for (i = 0; i < bmap->n_eq; ++i)
552 if (!isl_int_is_zero(bmap->eq[i][offset + pos]) &&
553 isl_seq_first_non_zero(bmap->eq[i]+offset+pos+1,
554 1+total-offset-pos-1) == -1) {
555 *c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
562 int isl_basic_set_has_defining_equality(
563 __isl_keep isl_basic_set *bset, enum isl_dim_type type, int pos,
564 __isl_give isl_constraint **c)
566 return isl_basic_map_has_defining_equality((isl_basic_map *)bset,
570 int isl_basic_set_has_defining_inequalities(
571 struct isl_basic_set *bset, enum isl_dim_type type, int pos,
572 struct isl_constraint **lower,
573 struct isl_constraint **upper)
579 isl_int **lower_line, **upper_line;
583 offset = basic_set_offset(bset, type);
584 total = isl_basic_set_total_dim(bset);
585 isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
587 for (i = 0; i < bset->n_ineq; ++i) {
588 if (isl_int_is_zero(bset->ineq[i][offset + pos]))
590 if (isl_int_is_one(bset->ineq[i][offset + pos]))
592 if (isl_int_is_negone(bset->ineq[i][offset + pos]))
594 if (isl_seq_first_non_zero(bset->ineq[i]+offset+pos+1,
595 1+total-offset-pos-1) != -1)
597 for (j = i + 1; j < bset->n_ineq; ++j) {
598 if (!isl_seq_is_neg(bset->ineq[i]+1, bset->ineq[j]+1,
601 isl_int_add(m, bset->ineq[i][0], bset->ineq[j][0]);
602 if (isl_int_abs_ge(m, bset->ineq[i][offset+pos]))
605 if (isl_int_is_pos(bset->ineq[i][offset+pos])) {
606 lower_line = &bset->ineq[i];
607 upper_line = &bset->ineq[j];
609 lower_line = &bset->ineq[j];
610 upper_line = &bset->ineq[i];
612 *lower = isl_basic_set_constraint(
613 isl_basic_set_copy(bset), lower_line);
614 *upper = isl_basic_set_constraint(
615 isl_basic_set_copy(bset), upper_line);
626 /* Given two constraints "a" and "b" on the variable at position "abs_pos"
627 * (in "a" and "b"), add a constraint to "bset" that ensures that the
628 * bound implied by "a" is (strictly) larger than the bound implied by "b".
630 * If both constraints imply lower bounds, then this means that "a" is
631 * active in the result.
632 * If both constraints imply upper bounds, then this means that "b" is
633 * active in the result.
635 static __isl_give isl_basic_set *add_larger_bound_constraint(
636 __isl_take isl_basic_set *bset, isl_int *a, isl_int *b,
637 unsigned abs_pos, int strict)
643 k = isl_basic_set_alloc_inequality(bset);
647 total = isl_basic_set_dim(bset, isl_dim_all);
650 isl_int_neg(t, b[1 + abs_pos]);
652 isl_seq_combine(bset->ineq[k], t, a, a[1 + abs_pos], b, 1 + abs_pos);
653 isl_seq_combine(bset->ineq[k] + 1 + abs_pos,
654 t, a + 1 + abs_pos + 1, a[1 + abs_pos], b + 1 + abs_pos + 1,
658 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
664 isl_basic_set_free(bset);
668 /* Add constraints to "context" that ensure that "u" is the smallest
669 * (and therefore active) upper bound on "abs_pos" in "bset" and return
670 * the resulting basic set.
672 static __isl_give isl_basic_set *set_smallest_upper_bound(
673 __isl_keep isl_basic_set *context,
674 __isl_keep isl_basic_set *bset, unsigned abs_pos, int n_upper, int u)
678 context = isl_basic_set_copy(context);
679 context = isl_basic_set_cow(context);
681 context = isl_basic_set_extend_constraints(context, 0, n_upper - 1);
683 for (j = 0; j < bset->n_ineq; ++j) {
686 if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos]))
688 context = add_larger_bound_constraint(context,
689 bset->ineq[j], bset->ineq[u], abs_pos, j > u);
692 context = isl_basic_set_simplify(context);
693 context = isl_basic_set_finalize(context);
698 /* Add constraints to "context" that ensure that "u" is the largest
699 * (and therefore active) upper bound on "abs_pos" in "bset" and return
700 * the resulting basic set.
702 static __isl_give isl_basic_set *set_largest_lower_bound(
703 __isl_keep isl_basic_set *context,
704 __isl_keep isl_basic_set *bset, unsigned abs_pos, int n_lower, int l)
708 context = isl_basic_set_copy(context);
709 context = isl_basic_set_cow(context);
711 context = isl_basic_set_extend_constraints(context, 0, n_lower - 1);
713 for (j = 0; j < bset->n_ineq; ++j) {
716 if (!isl_int_is_pos(bset->ineq[j][1 + abs_pos]))
718 context = add_larger_bound_constraint(context,
719 bset->ineq[l], bset->ineq[j], abs_pos, j > l);
722 context = isl_basic_set_simplify(context);
723 context = isl_basic_set_finalize(context);
728 static int foreach_upper_bound(__isl_keep isl_basic_set *bset,
729 enum isl_dim_type type, unsigned abs_pos,
730 __isl_take isl_basic_set *context, int n_upper,
731 int (*fn)(__isl_take isl_constraint *lower,
732 __isl_take isl_constraint *upper,
733 __isl_take isl_basic_set *bset, void *user), void *user)
735 isl_basic_set *context_i;
736 isl_constraint *upper = NULL;
739 for (i = 0; i < bset->n_ineq; ++i) {
740 if (isl_int_is_zero(bset->ineq[i][1 + abs_pos]))
743 context_i = set_smallest_upper_bound(context, bset,
744 abs_pos, n_upper, i);
745 if (isl_basic_set_is_empty(context_i)) {
746 isl_basic_set_free(context_i);
749 upper = isl_basic_set_constraint(isl_basic_set_copy(bset),
751 if (!upper || !context_i)
753 if (fn(NULL, upper, context_i, user) < 0)
757 isl_basic_set_free(context);
759 if (i < bset->n_ineq)
764 isl_constraint_free(upper);
765 isl_basic_set_free(context_i);
766 isl_basic_set_free(context);
770 static int foreach_lower_bound(__isl_keep isl_basic_set *bset,
771 enum isl_dim_type type, unsigned abs_pos,
772 __isl_take isl_basic_set *context, int n_lower,
773 int (*fn)(__isl_take isl_constraint *lower,
774 __isl_take isl_constraint *upper,
775 __isl_take isl_basic_set *bset, void *user), void *user)
777 isl_basic_set *context_i;
778 isl_constraint *lower = NULL;
781 for (i = 0; i < bset->n_ineq; ++i) {
782 if (isl_int_is_zero(bset->ineq[i][1 + abs_pos]))
785 context_i = set_largest_lower_bound(context, bset,
786 abs_pos, n_lower, i);
787 if (isl_basic_set_is_empty(context_i)) {
788 isl_basic_set_free(context_i);
791 lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
793 if (!lower || !context_i)
795 if (fn(lower, NULL, context_i, user) < 0)
799 isl_basic_set_free(context);
801 if (i < bset->n_ineq)
806 isl_constraint_free(lower);
807 isl_basic_set_free(context_i);
808 isl_basic_set_free(context);
812 static int foreach_bound_pair(__isl_keep isl_basic_set *bset,
813 enum isl_dim_type type, unsigned abs_pos,
814 __isl_take isl_basic_set *context, int n_lower, int n_upper,
815 int (*fn)(__isl_take isl_constraint *lower,
816 __isl_take isl_constraint *upper,
817 __isl_take isl_basic_set *bset, void *user), void *user)
819 isl_basic_set *context_i, *context_j;
820 isl_constraint *lower = NULL;
821 isl_constraint *upper = NULL;
824 for (i = 0; i < bset->n_ineq; ++i) {
825 if (!isl_int_is_pos(bset->ineq[i][1 + abs_pos]))
828 context_i = set_largest_lower_bound(context, bset,
829 abs_pos, n_lower, i);
830 if (isl_basic_set_is_empty(context_i)) {
831 isl_basic_set_free(context_i);
835 for (j = 0; j < bset->n_ineq; ++j) {
836 if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos]))
839 context_j = set_smallest_upper_bound(context_i, bset,
840 abs_pos, n_upper, j);
841 context_j = isl_basic_set_extend_constraints(context_j,
843 context_j = add_larger_bound_constraint(context_j,
844 bset->ineq[i], bset->ineq[j], abs_pos, 0);
845 context_j = isl_basic_set_simplify(context_j);
846 context_j = isl_basic_set_finalize(context_j);
847 if (isl_basic_set_is_empty(context_j)) {
848 isl_basic_set_free(context_j);
851 lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
853 upper = isl_basic_set_constraint(isl_basic_set_copy(bset),
855 if (!lower || !upper || !context_j)
857 if (fn(lower, upper, context_j, user) < 0)
861 isl_basic_set_free(context_i);
863 if (j < bset->n_ineq)
867 isl_basic_set_free(context);
869 if (i < bset->n_ineq)
874 isl_constraint_free(lower);
875 isl_constraint_free(upper);
876 isl_basic_set_free(context_i);
877 isl_basic_set_free(context_j);
878 isl_basic_set_free(context);
882 /* For each pair of lower and upper bounds on the variable "pos"
883 * of type "type", call "fn" with these lower and upper bounds and the
884 * set of constraints on the remaining variables where these bounds
885 * are active, i.e., (stricly) larger/smaller than the other lower/upper bounds.
887 * If the designated variable is equal to an affine combination of the
888 * other variables then fn is called with both lower and upper
889 * set to the corresponding equality.
891 * If there is no lower (or upper) bound, then NULL is passed
892 * as the corresponding bound.
894 * We first check if the variable is involved in any equality.
895 * If not, we count the number of lower and upper bounds and
898 int isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set *bset,
899 enum isl_dim_type type, unsigned pos,
900 int (*fn)(__isl_take isl_constraint *lower,
901 __isl_take isl_constraint *upper,
902 __isl_take isl_basic_set *bset, void *user), void *user)
905 isl_constraint *lower = NULL;
906 isl_constraint *upper = NULL;
907 isl_basic_set *context = NULL;
909 int n_lower, n_upper;
913 isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
914 isl_assert(bset->ctx, type == isl_dim_param || type == isl_dim_set,
918 if (type == isl_dim_set)
919 abs_pos += isl_basic_set_dim(bset, isl_dim_param);
921 for (i = 0; i < bset->n_eq; ++i) {
922 if (isl_int_is_zero(bset->eq[i][1 + abs_pos]))
925 lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
927 upper = isl_constraint_copy(lower);
928 context = isl_basic_set_remove_dims(isl_basic_set_copy(bset),
930 if (!lower || !upper || !context)
932 return fn(lower, upper, context, user);
937 for (i = 0; i < bset->n_ineq; ++i) {
938 if (isl_int_is_pos(bset->ineq[i][1 + abs_pos]))
940 else if (isl_int_is_neg(bset->ineq[i][1 + abs_pos]))
944 context = isl_basic_set_copy(bset);
945 context = isl_basic_set_cow(context);
948 for (i = context->n_ineq - 1; i >= 0; --i)
949 if (!isl_int_is_zero(context->ineq[i][1 + abs_pos]))
950 isl_basic_set_drop_inequality(context, i);
952 context = isl_basic_set_drop(context, type, pos, 1);
953 if (!n_lower && !n_upper)
954 return fn(NULL, NULL, context, user);
956 return foreach_upper_bound(bset, type, abs_pos, context, n_upper,
959 return foreach_lower_bound(bset, type, abs_pos, context, n_lower,
961 return foreach_bound_pair(bset, type, abs_pos, context, n_lower, n_upper,
964 isl_constraint_free(lower);
965 isl_constraint_free(upper);
966 isl_basic_set_free(context);
970 __isl_give isl_aff *isl_constraint_get_bound(
971 __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos)
978 if (pos >= isl_basic_set_dim(constraint->bmap, type))
979 isl_die(constraint->ctx, isl_error_invalid,
980 "index out of bounds", return NULL);
981 if (!isl_basic_map_may_be_set(constraint->bmap))
982 isl_die(constraint->ctx, isl_error_invalid,
983 "not a set constraint", return NULL);
985 pos += offset(constraint, type);
986 if (isl_int_is_zero(constraint->line[0][pos]))
987 isl_die(constraint->ctx, isl_error_invalid,
988 "constraint does not define a bound on given dimension",
991 ls = isl_basic_set_get_local_space(constraint->bmap);
992 aff = isl_aff_alloc(ls);
996 if (isl_int_is_neg(constraint->line[0][pos]))
997 isl_seq_cpy(aff->v->el + 1, constraint->line[0],
1000 isl_seq_neg(aff->v->el + 1, constraint->line[0],
1002 isl_int_set_si(aff->v->el[1 + pos], 0);
1003 isl_int_abs(aff->v->el[0], constraint->line[0][pos]);
1008 /* Construct an equality constraint equating the given affine expression
1011 __isl_give isl_constraint *isl_equality_from_aff(__isl_take isl_aff *aff)
1014 isl_basic_set *bset;
1019 bset = isl_basic_set_from_local_space(isl_aff_get_local_space(aff));
1020 bset = isl_basic_set_extend_constraints(bset, 1, 0);
1021 k = isl_basic_set_alloc_equality(bset);
1025 isl_seq_cpy(bset->eq[k], aff->v->el + 1, aff->v->size - 1);
1028 return isl_basic_set_constraint(bset, &bset->eq[k]);
1031 isl_basic_set_free(bset);