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_private.h>
15 #include <isl_space_private.h>
16 #include <isl_div_private.h>
18 #include <isl_aff_private.h>
19 #include <isl_local_space_private.h>
21 isl_ctx *isl_constraint_get_ctx(__isl_keep isl_constraint *c)
23 return c ? isl_local_space_get_ctx(c->ls) : NULL;
26 static unsigned n(struct isl_constraint *c, enum isl_dim_type type)
28 return isl_local_space_dim(c->ls, type);
31 static unsigned offset(struct isl_constraint *c, enum isl_dim_type type)
33 return isl_local_space_offset(c->ls, type);
36 static unsigned basic_map_offset(__isl_keep isl_basic_map *bmap,
37 enum isl_dim_type type)
39 return type == isl_dim_div ? 1 + isl_space_dim(bmap->dim, isl_dim_all)
40 : 1 + isl_space_offset(bmap->dim, type);
43 static unsigned basic_set_offset(struct isl_basic_set *bset,
44 enum isl_dim_type type)
46 isl_space *dim = bset->dim;
48 case isl_dim_param: return 1;
49 case isl_dim_in: return 1 + dim->nparam;
50 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
51 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
56 __isl_give isl_constraint *isl_constraint_alloc(int eq,
57 __isl_take isl_local_space *ls, __isl_take isl_vec *v)
59 isl_constraint *constraint;
64 constraint = isl_alloc_type(isl_vec_get_ctx(v), isl_constraint);
75 isl_local_space_free(ls);
80 struct isl_constraint *isl_basic_map_constraint(struct isl_basic_map *bmap,
86 isl_local_space *ls = NULL;
87 isl_constraint *constraint;
92 eq = line >= bmap->eq;
94 ctx = isl_basic_map_get_ctx(bmap);
95 ls = isl_basic_map_get_local_space(bmap);
96 v = isl_vec_alloc(ctx, 1 + isl_local_space_dim(ls, isl_dim_all));
99 isl_seq_cpy(v->el, line[0], v->size);
100 constraint = isl_constraint_alloc(eq, ls, v);
102 isl_basic_map_free(bmap);
105 isl_local_space_free(ls);
106 isl_basic_map_free(bmap);
110 struct isl_constraint *isl_basic_set_constraint(struct isl_basic_set *bset,
113 return isl_basic_map_constraint((struct isl_basic_map *)bset, line);
116 struct isl_constraint *isl_equality_alloc(__isl_take isl_space *dim)
118 struct isl_basic_map *bmap;
123 bmap = isl_basic_map_alloc_space(dim, 0, 1, 0);
127 isl_basic_map_alloc_equality(bmap);
128 isl_seq_clr(bmap->eq[0], 1 + isl_basic_map_total_dim(bmap));
129 return isl_basic_map_constraint(bmap, &bmap->eq[0]);
132 struct isl_constraint *isl_inequality_alloc(__isl_take isl_space *dim)
134 struct isl_basic_map *bmap;
139 bmap = isl_basic_map_alloc_space(dim, 0, 0, 1);
143 isl_basic_map_alloc_inequality(bmap);
144 isl_seq_clr(bmap->ineq[0], 1 + isl_basic_map_total_dim(bmap));
145 return isl_basic_map_constraint(bmap, &bmap->ineq[0]);
148 struct isl_constraint *isl_constraint_dup(struct isl_constraint *c)
153 return isl_constraint_alloc(c->eq, isl_local_space_copy(c->ls),
157 struct isl_constraint *isl_constraint_cow(struct isl_constraint *c)
165 return isl_constraint_dup(c);
168 struct isl_constraint *isl_constraint_copy(struct isl_constraint *constraint)
177 void *isl_constraint_free(struct isl_constraint *c)
185 isl_local_space_free(c->ls);
192 int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map *bmap,
193 int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
196 struct isl_constraint *c;
201 isl_assert(bmap->ctx, ISL_F_ISSET(bmap, ISL_BASIC_MAP_FINAL),
204 for (i = 0; i < bmap->n_eq; ++i) {
205 c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
213 for (i = 0; i < bmap->n_ineq; ++i) {
214 c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
225 int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set *bset,
226 int (*fn)(__isl_take isl_constraint *c, void *user), void *user)
228 return isl_basic_map_foreach_constraint((isl_basic_map *)bset, fn, user);
231 int isl_constraint_is_equal(struct isl_constraint *constraint1,
232 struct isl_constraint *constraint2)
236 if (!constraint1 || !constraint2)
238 if (constraint1->eq != constraint2->eq)
240 equal = isl_local_space_is_equal(constraint1->ls, constraint2->ls);
241 if (equal < 0 || !equal)
243 return isl_vec_is_equal(constraint1->v, constraint2->v);
246 struct isl_basic_map *isl_basic_map_add_constraint(
247 struct isl_basic_map *bmap, struct isl_constraint *constraint)
253 if (!bmap || !constraint)
256 ctx = isl_constraint_get_ctx(constraint);
257 dim = isl_constraint_get_space(constraint);
258 equal_space = isl_space_is_equal(bmap->dim, dim);
260 isl_assert(ctx, equal_space, goto error);
262 bmap = isl_basic_map_intersect(bmap,
263 isl_basic_map_from_constraint(constraint));
266 isl_basic_map_free(bmap);
267 isl_constraint_free(constraint);
271 struct isl_basic_set *isl_basic_set_add_constraint(
272 struct isl_basic_set *bset, struct isl_constraint *constraint)
274 return (struct isl_basic_set *)
275 isl_basic_map_add_constraint((struct isl_basic_map *)bset,
279 __isl_give isl_map *isl_map_add_constraint(__isl_take isl_map *map,
280 __isl_take isl_constraint *constraint)
284 bmap = isl_basic_map_from_constraint(constraint);
285 map = isl_map_intersect(map, isl_map_from_basic_map(bmap));
290 __isl_give isl_set *isl_set_add_constraint(__isl_take isl_set *set,
291 __isl_take isl_constraint *constraint)
293 return isl_map_add_constraint(set, constraint);
296 __isl_give isl_space *isl_constraint_get_space(
297 __isl_keep isl_constraint *constraint)
299 return constraint ? isl_local_space_get_space(constraint->ls) : NULL;
302 int isl_constraint_dim(struct isl_constraint *constraint,
303 enum isl_dim_type type)
307 return n(constraint, type);
310 int isl_constraint_involves_dims(__isl_keep isl_constraint *constraint,
311 enum isl_dim_type type, unsigned first, unsigned n)
323 ctx = isl_constraint_get_ctx(constraint);
324 if (first + n > isl_constraint_dim(constraint, type))
325 isl_die(ctx, isl_error_invalid,
326 "range out of bounds", return -1);
328 active = isl_local_space_get_active(constraint->ls,
329 constraint->v->el + 1);
333 first += isl_local_space_offset(constraint->ls, type) - 1;
334 for (i = 0; i < n; ++i)
335 if (active[first + i]) {
348 const char *isl_constraint_get_dim_name(__isl_keep isl_constraint *constraint,
349 enum isl_dim_type type, unsigned pos)
352 isl_local_space_get_dim_name(constraint->ls, type, pos) : NULL;
355 void isl_constraint_get_constant(struct isl_constraint *constraint, isl_int *v)
359 isl_int_set(*v, constraint->v->el[0]);
362 void isl_constraint_get_coefficient(struct isl_constraint *constraint,
363 enum isl_dim_type type, int pos, isl_int *v)
368 if (pos >= isl_local_space_dim(constraint->ls, type))
369 isl_die(constraint->v->ctx, isl_error_invalid,
370 "position out of bounds", return);
372 pos += isl_local_space_offset(constraint->ls, type);
373 isl_int_set(*v, constraint->v->el[pos]);
376 struct isl_div *isl_constraint_div(struct isl_constraint *constraint, int pos)
381 return isl_local_space_get_div(constraint->ls, pos);
384 __isl_give isl_constraint *isl_constraint_set_constant(
385 __isl_take isl_constraint *constraint, isl_int v)
387 constraint = isl_constraint_cow(constraint);
391 constraint->v = isl_vec_cow(constraint->v);
393 return isl_constraint_free(constraint);
395 isl_int_set(constraint->v->el[0], v);
399 __isl_give isl_constraint *isl_constraint_set_constant_si(
400 __isl_take isl_constraint *constraint, int v)
402 constraint = isl_constraint_cow(constraint);
406 constraint->v = isl_vec_cow(constraint->v);
408 return isl_constraint_free(constraint);
410 isl_int_set_si(constraint->v->el[0], v);
414 __isl_give isl_constraint *isl_constraint_set_coefficient(
415 __isl_take isl_constraint *constraint,
416 enum isl_dim_type type, int pos, isl_int v)
418 constraint = isl_constraint_cow(constraint);
422 if (pos >= isl_local_space_dim(constraint->ls, type))
423 isl_die(constraint->v->ctx, isl_error_invalid,
424 "position out of bounds",
425 return isl_constraint_free(constraint));
427 constraint = isl_constraint_cow(constraint);
431 constraint->v = isl_vec_cow(constraint->v);
433 return isl_constraint_free(constraint);
435 pos += isl_local_space_offset(constraint->ls, type);
436 isl_int_set(constraint->v->el[pos], v);
441 __isl_give isl_constraint *isl_constraint_set_coefficient_si(
442 __isl_take isl_constraint *constraint,
443 enum isl_dim_type type, int pos, int v)
445 constraint = isl_constraint_cow(constraint);
449 if (pos >= isl_local_space_dim(constraint->ls, type))
450 isl_die(constraint->v->ctx, isl_error_invalid,
451 "position out of bounds",
452 return isl_constraint_free(constraint));
454 constraint = isl_constraint_cow(constraint);
458 constraint->v = isl_vec_cow(constraint->v);
460 return isl_constraint_free(constraint);
462 pos += isl_local_space_offset(constraint->ls, type);
463 isl_int_set_si(constraint->v->el[pos], v);
468 /* Drop any constraint from "bset" that is identical to "constraint".
469 * In particular, this means that the local spaces of "bset" and
470 * "constraint" need to be the same.
472 * Since the given constraint may actually be a pointer into the bset,
473 * we have to be careful not to reorder the constraints as the user
474 * may be holding on to other constraints from the same bset.
475 * This should be cleaned up when the internal representation of
476 * isl_constraint is changed to use isl_aff.
478 __isl_give isl_basic_set *isl_basic_set_drop_constraint(
479 __isl_take isl_basic_set *bset, __isl_take isl_constraint *constraint)
485 isl_local_space *ls1;
488 if (!bset || !constraint)
491 ls1 = isl_basic_set_get_local_space(bset);
492 equal = isl_local_space_is_equal(ls1, constraint->ls);
493 isl_local_space_free(ls1);
497 isl_constraint_free(constraint);
501 if (isl_constraint_is_equality(constraint)) {
509 total = isl_constraint_dim(constraint, isl_dim_all);
510 for (i = 0; i < n; ++i)
511 if (isl_seq_eq(row[i], constraint->v->el, 1 + total))
512 isl_seq_clr(row[i], 1 + total);
514 isl_constraint_free(constraint);
517 isl_constraint_free(constraint);
518 isl_basic_set_free(bset);
522 struct isl_constraint *isl_constraint_negate(struct isl_constraint *constraint)
526 constraint = isl_constraint_cow(constraint);
530 ctx = isl_constraint_get_ctx(constraint);
531 if (isl_constraint_is_equality(constraint))
532 isl_die(ctx, isl_error_invalid, "cannot negate equality",
533 return isl_constraint_free(constraint));
534 constraint->v = isl_vec_neg(constraint->v);
535 constraint->v = isl_vec_cow(constraint->v);
537 return isl_constraint_free(constraint);
538 isl_int_sub_ui(constraint->v->el[0], constraint->v->el[0], 1);
542 int isl_constraint_is_equality(struct isl_constraint *constraint)
546 return constraint->eq;
549 int isl_constraint_is_div_constraint(__isl_keep isl_constraint *constraint)
556 if (isl_constraint_is_equality(constraint))
558 n_div = isl_constraint_dim(constraint, isl_dim_div);
559 for (i = 0; i < n_div; ++i) {
560 if (isl_local_space_is_div_constraint(constraint->ls,
561 constraint->v->el, i))
568 /* We manually set ISL_BASIC_SET_FINAL instead of calling
569 * isl_basic_map_finalize because we want to keep the position
570 * of the divs and we therefore do not want to throw away redundant divs.
571 * This is arguably a bit fragile.
573 __isl_give isl_basic_map *isl_basic_map_from_constraint(
574 __isl_take isl_constraint *constraint)
578 struct isl_basic_map *bmap;
585 ls = isl_local_space_copy(constraint->ls);
586 bmap = isl_basic_map_from_local_space(ls);
587 bmap = isl_basic_map_extend_constraints(bmap, 1, 1);
588 if (isl_constraint_is_equality(constraint)) {
589 k = isl_basic_map_alloc_equality(bmap);
595 k = isl_basic_map_alloc_inequality(bmap);
600 total = isl_basic_map_total_dim(bmap);
601 isl_seq_cpy(c, constraint->v->el, 1 + total);
602 isl_constraint_free(constraint);
604 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
607 isl_constraint_free(constraint);
608 isl_basic_map_free(bmap);
612 struct isl_basic_set *isl_basic_set_from_constraint(
613 struct isl_constraint *constraint)
618 if (isl_constraint_dim(constraint, isl_dim_in) != 0)
619 isl_die(isl_constraint_get_ctx(constraint), isl_error_invalid,
620 "not a set constraint",
621 return isl_constraint_free(constraint));
622 return (isl_basic_set *)isl_basic_map_from_constraint(constraint);
625 int isl_basic_map_has_defining_equality(
626 __isl_keep isl_basic_map *bmap, enum isl_dim_type type, int pos,
627 __isl_give isl_constraint **c)
635 offset = basic_map_offset(bmap, type);
636 total = isl_basic_map_total_dim(bmap);
637 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
638 for (i = 0; i < bmap->n_eq; ++i)
639 if (!isl_int_is_zero(bmap->eq[i][offset + pos]) &&
640 isl_seq_first_non_zero(bmap->eq[i]+offset+pos+1,
641 1+total-offset-pos-1) == -1) {
642 *c = isl_basic_map_constraint(isl_basic_map_copy(bmap),
649 int isl_basic_set_has_defining_equality(
650 __isl_keep isl_basic_set *bset, enum isl_dim_type type, int pos,
651 __isl_give isl_constraint **c)
653 return isl_basic_map_has_defining_equality((isl_basic_map *)bset,
657 int isl_basic_set_has_defining_inequalities(
658 struct isl_basic_set *bset, enum isl_dim_type type, int pos,
659 struct isl_constraint **lower,
660 struct isl_constraint **upper)
666 isl_int **lower_line, **upper_line;
670 offset = basic_set_offset(bset, type);
671 total = isl_basic_set_total_dim(bset);
672 isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
674 for (i = 0; i < bset->n_ineq; ++i) {
675 if (isl_int_is_zero(bset->ineq[i][offset + pos]))
677 if (isl_int_is_one(bset->ineq[i][offset + pos]))
679 if (isl_int_is_negone(bset->ineq[i][offset + pos]))
681 if (isl_seq_first_non_zero(bset->ineq[i]+offset+pos+1,
682 1+total-offset-pos-1) != -1)
684 for (j = i + 1; j < bset->n_ineq; ++j) {
685 if (!isl_seq_is_neg(bset->ineq[i]+1, bset->ineq[j]+1,
688 isl_int_add(m, bset->ineq[i][0], bset->ineq[j][0]);
689 if (isl_int_abs_ge(m, bset->ineq[i][offset+pos]))
692 if (isl_int_is_pos(bset->ineq[i][offset+pos])) {
693 lower_line = &bset->ineq[i];
694 upper_line = &bset->ineq[j];
696 lower_line = &bset->ineq[j];
697 upper_line = &bset->ineq[i];
699 *lower = isl_basic_set_constraint(
700 isl_basic_set_copy(bset), lower_line);
701 *upper = isl_basic_set_constraint(
702 isl_basic_set_copy(bset), upper_line);
713 /* Given two constraints "a" and "b" on the variable at position "abs_pos"
714 * (in "a" and "b"), add a constraint to "bset" that ensures that the
715 * bound implied by "a" is (strictly) larger than the bound implied by "b".
717 * If both constraints imply lower bounds, then this means that "a" is
718 * active in the result.
719 * If both constraints imply upper bounds, then this means that "b" is
720 * active in the result.
722 static __isl_give isl_basic_set *add_larger_bound_constraint(
723 __isl_take isl_basic_set *bset, isl_int *a, isl_int *b,
724 unsigned abs_pos, int strict)
730 k = isl_basic_set_alloc_inequality(bset);
734 total = isl_basic_set_dim(bset, isl_dim_all);
737 isl_int_neg(t, b[1 + abs_pos]);
739 isl_seq_combine(bset->ineq[k], t, a, a[1 + abs_pos], b, 1 + abs_pos);
740 isl_seq_combine(bset->ineq[k] + 1 + abs_pos,
741 t, a + 1 + abs_pos + 1, a[1 + abs_pos], b + 1 + abs_pos + 1,
745 isl_int_sub_ui(bset->ineq[k][0], bset->ineq[k][0], 1);
751 isl_basic_set_free(bset);
755 /* Add constraints to "context" that ensure that "u" is the smallest
756 * (and therefore active) upper bound on "abs_pos" in "bset" and return
757 * the resulting basic set.
759 static __isl_give isl_basic_set *set_smallest_upper_bound(
760 __isl_keep isl_basic_set *context,
761 __isl_keep isl_basic_set *bset, unsigned abs_pos, int n_upper, int u)
765 context = isl_basic_set_copy(context);
766 context = isl_basic_set_cow(context);
768 context = isl_basic_set_extend_constraints(context, 0, n_upper - 1);
770 for (j = 0; j < bset->n_ineq; ++j) {
773 if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos]))
775 context = add_larger_bound_constraint(context,
776 bset->ineq[j], bset->ineq[u], abs_pos, j > u);
779 context = isl_basic_set_simplify(context);
780 context = isl_basic_set_finalize(context);
785 /* Add constraints to "context" that ensure that "u" is the largest
786 * (and therefore active) upper bound on "abs_pos" in "bset" and return
787 * the resulting basic set.
789 static __isl_give isl_basic_set *set_largest_lower_bound(
790 __isl_keep isl_basic_set *context,
791 __isl_keep isl_basic_set *bset, unsigned abs_pos, int n_lower, int l)
795 context = isl_basic_set_copy(context);
796 context = isl_basic_set_cow(context);
798 context = isl_basic_set_extend_constraints(context, 0, n_lower - 1);
800 for (j = 0; j < bset->n_ineq; ++j) {
803 if (!isl_int_is_pos(bset->ineq[j][1 + abs_pos]))
805 context = add_larger_bound_constraint(context,
806 bset->ineq[l], bset->ineq[j], abs_pos, j > l);
809 context = isl_basic_set_simplify(context);
810 context = isl_basic_set_finalize(context);
815 static int foreach_upper_bound(__isl_keep isl_basic_set *bset,
816 enum isl_dim_type type, unsigned abs_pos,
817 __isl_take isl_basic_set *context, int n_upper,
818 int (*fn)(__isl_take isl_constraint *lower,
819 __isl_take isl_constraint *upper,
820 __isl_take isl_basic_set *bset, void *user), void *user)
822 isl_basic_set *context_i;
823 isl_constraint *upper = NULL;
826 for (i = 0; i < bset->n_ineq; ++i) {
827 if (isl_int_is_zero(bset->ineq[i][1 + abs_pos]))
830 context_i = set_smallest_upper_bound(context, bset,
831 abs_pos, n_upper, i);
832 if (isl_basic_set_is_empty(context_i)) {
833 isl_basic_set_free(context_i);
836 upper = isl_basic_set_constraint(isl_basic_set_copy(bset),
838 if (!upper || !context_i)
840 if (fn(NULL, upper, context_i, user) < 0)
844 isl_basic_set_free(context);
846 if (i < bset->n_ineq)
851 isl_constraint_free(upper);
852 isl_basic_set_free(context_i);
853 isl_basic_set_free(context);
857 static int foreach_lower_bound(__isl_keep isl_basic_set *bset,
858 enum isl_dim_type type, unsigned abs_pos,
859 __isl_take isl_basic_set *context, int n_lower,
860 int (*fn)(__isl_take isl_constraint *lower,
861 __isl_take isl_constraint *upper,
862 __isl_take isl_basic_set *bset, void *user), void *user)
864 isl_basic_set *context_i;
865 isl_constraint *lower = NULL;
868 for (i = 0; i < bset->n_ineq; ++i) {
869 if (isl_int_is_zero(bset->ineq[i][1 + abs_pos]))
872 context_i = set_largest_lower_bound(context, bset,
873 abs_pos, n_lower, i);
874 if (isl_basic_set_is_empty(context_i)) {
875 isl_basic_set_free(context_i);
878 lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
880 if (!lower || !context_i)
882 if (fn(lower, NULL, context_i, user) < 0)
886 isl_basic_set_free(context);
888 if (i < bset->n_ineq)
893 isl_constraint_free(lower);
894 isl_basic_set_free(context_i);
895 isl_basic_set_free(context);
899 static int foreach_bound_pair(__isl_keep isl_basic_set *bset,
900 enum isl_dim_type type, unsigned abs_pos,
901 __isl_take isl_basic_set *context, int n_lower, int n_upper,
902 int (*fn)(__isl_take isl_constraint *lower,
903 __isl_take isl_constraint *upper,
904 __isl_take isl_basic_set *bset, void *user), void *user)
906 isl_basic_set *context_i, *context_j;
907 isl_constraint *lower = NULL;
908 isl_constraint *upper = NULL;
911 for (i = 0; i < bset->n_ineq; ++i) {
912 if (!isl_int_is_pos(bset->ineq[i][1 + abs_pos]))
915 context_i = set_largest_lower_bound(context, bset,
916 abs_pos, n_lower, i);
917 if (isl_basic_set_is_empty(context_i)) {
918 isl_basic_set_free(context_i);
922 for (j = 0; j < bset->n_ineq; ++j) {
923 if (!isl_int_is_neg(bset->ineq[j][1 + abs_pos]))
926 context_j = set_smallest_upper_bound(context_i, bset,
927 abs_pos, n_upper, j);
928 context_j = isl_basic_set_extend_constraints(context_j,
930 context_j = add_larger_bound_constraint(context_j,
931 bset->ineq[i], bset->ineq[j], abs_pos, 0);
932 context_j = isl_basic_set_simplify(context_j);
933 context_j = isl_basic_set_finalize(context_j);
934 if (isl_basic_set_is_empty(context_j)) {
935 isl_basic_set_free(context_j);
938 lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
940 upper = isl_basic_set_constraint(isl_basic_set_copy(bset),
942 if (!lower || !upper || !context_j)
944 if (fn(lower, upper, context_j, user) < 0)
948 isl_basic_set_free(context_i);
950 if (j < bset->n_ineq)
954 isl_basic_set_free(context);
956 if (i < bset->n_ineq)
961 isl_constraint_free(lower);
962 isl_constraint_free(upper);
963 isl_basic_set_free(context_i);
964 isl_basic_set_free(context_j);
965 isl_basic_set_free(context);
969 /* For each pair of lower and upper bounds on the variable "pos"
970 * of type "type", call "fn" with these lower and upper bounds and the
971 * set of constraints on the remaining variables where these bounds
972 * are active, i.e., (stricly) larger/smaller than the other lower/upper bounds.
974 * If the designated variable is equal to an affine combination of the
975 * other variables then fn is called with both lower and upper
976 * set to the corresponding equality.
978 * If there is no lower (or upper) bound, then NULL is passed
979 * as the corresponding bound.
981 * We first check if the variable is involved in any equality.
982 * If not, we count the number of lower and upper bounds and
985 int isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set *bset,
986 enum isl_dim_type type, unsigned pos,
987 int (*fn)(__isl_take isl_constraint *lower,
988 __isl_take isl_constraint *upper,
989 __isl_take isl_basic_set *bset, void *user), void *user)
992 isl_constraint *lower = NULL;
993 isl_constraint *upper = NULL;
994 isl_basic_set *context = NULL;
996 int n_lower, n_upper;
1000 isl_assert(bset->ctx, pos < isl_basic_set_dim(bset, type), return -1);
1001 isl_assert(bset->ctx, type == isl_dim_param || type == isl_dim_set,
1005 if (type == isl_dim_set)
1006 abs_pos += isl_basic_set_dim(bset, isl_dim_param);
1008 for (i = 0; i < bset->n_eq; ++i) {
1009 if (isl_int_is_zero(bset->eq[i][1 + abs_pos]))
1012 lower = isl_basic_set_constraint(isl_basic_set_copy(bset),
1014 upper = isl_constraint_copy(lower);
1015 context = isl_basic_set_remove_dims(isl_basic_set_copy(bset),
1017 if (!lower || !upper || !context)
1019 return fn(lower, upper, context, user);
1024 for (i = 0; i < bset->n_ineq; ++i) {
1025 if (isl_int_is_pos(bset->ineq[i][1 + abs_pos]))
1027 else if (isl_int_is_neg(bset->ineq[i][1 + abs_pos]))
1031 context = isl_basic_set_copy(bset);
1032 context = isl_basic_set_cow(context);
1035 for (i = context->n_ineq - 1; i >= 0; --i)
1036 if (!isl_int_is_zero(context->ineq[i][1 + abs_pos]))
1037 isl_basic_set_drop_inequality(context, i);
1039 context = isl_basic_set_drop(context, type, pos, 1);
1040 if (!n_lower && !n_upper)
1041 return fn(NULL, NULL, context, user);
1043 return foreach_upper_bound(bset, type, abs_pos, context, n_upper,
1046 return foreach_lower_bound(bset, type, abs_pos, context, n_lower,
1048 return foreach_bound_pair(bset, type, abs_pos, context, n_lower, n_upper,
1051 isl_constraint_free(lower);
1052 isl_constraint_free(upper);
1053 isl_basic_set_free(context);
1057 __isl_give isl_aff *isl_constraint_get_bound(
1058 __isl_keep isl_constraint *constraint, enum isl_dim_type type, int pos)
1065 ctx = isl_constraint_get_ctx(constraint);
1066 if (pos >= isl_constraint_dim(constraint, type))
1067 isl_die(ctx, isl_error_invalid,
1068 "index out of bounds", return NULL);
1069 if (isl_constraint_dim(constraint, isl_dim_in) != 0)
1070 isl_die(ctx, isl_error_invalid,
1071 "not a set constraint", return NULL);
1073 pos += offset(constraint, type);
1074 if (isl_int_is_zero(constraint->v->el[pos]))
1075 isl_die(ctx, isl_error_invalid,
1076 "constraint does not define a bound on given dimension",
1079 aff = isl_aff_alloc(isl_local_space_copy(constraint->ls));
1083 if (isl_int_is_neg(constraint->v->el[pos]))
1084 isl_seq_cpy(aff->v->el + 1, constraint->v->el, aff->v->size - 1);
1086 isl_seq_neg(aff->v->el + 1, constraint->v->el, aff->v->size - 1);
1087 isl_int_set_si(aff->v->el[1 + pos], 0);
1088 isl_int_abs(aff->v->el[0], constraint->v->el[pos]);
1093 /* For an inequality constraint
1097 * or an equality constraint
1101 * return the affine expression f.
1103 __isl_give isl_aff *isl_constraint_get_aff(
1104 __isl_keep isl_constraint *constraint)
1111 aff = isl_aff_alloc(isl_local_space_copy(constraint->ls));
1115 isl_seq_cpy(aff->v->el + 1, constraint->v->el, aff->v->size - 1);
1116 isl_int_set_si(aff->v->el[0], 1);
1121 /* Construct an equality constraint equating the given affine expression
1124 __isl_give isl_constraint *isl_equality_from_aff(__isl_take isl_aff *aff)
1127 isl_local_space *ls;
1128 isl_basic_set *bset;
1133 ls = isl_aff_get_domain_local_space(aff);
1134 bset = isl_basic_set_from_local_space(ls);
1135 bset = isl_basic_set_extend_constraints(bset, 1, 0);
1136 k = isl_basic_set_alloc_equality(bset);
1140 isl_seq_cpy(bset->eq[k], aff->v->el + 1, aff->v->size - 1);
1143 return isl_basic_set_constraint(bset, &bset->eq[k]);
1146 isl_basic_set_free(bset);
1150 /* Construct an inequality constraint enforcing the given affine expression
1151 * to be non-negative.
1153 __isl_give isl_constraint *isl_inequality_from_aff(__isl_take isl_aff *aff)
1156 isl_local_space *ls;
1157 isl_basic_set *bset;
1162 ls = isl_aff_get_domain_local_space(aff);
1163 bset = isl_basic_set_from_local_space(ls);
1164 bset = isl_basic_set_extend_constraints(bset, 0, 1);
1165 k = isl_basic_set_alloc_inequality(bset);
1169 isl_seq_cpy(bset->ineq[k], aff->v->el + 1, aff->v->size - 1);
1172 return isl_basic_set_constraint(bset, &bset->ineq[k]);
1175 isl_basic_set_free(bset);