2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the MIT 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>
17 #include <isl_aff_private.h>
18 #include <isl_local_space_private.h>
19 #include <isl_val_private.h>
20 #include <isl_vec_private.h>
23 #define BASE constraint
25 #include <isl_list_templ.c>
27 isl_ctx
*isl_constraint_get_ctx(__isl_keep isl_constraint
*c
)
29 return c
? isl_local_space_get_ctx(c
->ls
) : NULL
;
32 static unsigned n(struct isl_constraint
*c
, enum isl_dim_type type
)
34 return isl_local_space_dim(c
->ls
, type
);
37 static unsigned offset(struct isl_constraint
*c
, enum isl_dim_type type
)
39 return isl_local_space_offset(c
->ls
, type
);
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_space_dim(bmap
->dim
, isl_dim_all
)
46 : 1 + isl_space_offset(bmap
->dim
, type
);
49 static unsigned basic_set_offset(struct isl_basic_set
*bset
,
50 enum isl_dim_type type
)
52 isl_space
*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 __isl_give isl_constraint
*isl_constraint_alloc_vec(int eq
,
63 __isl_take isl_local_space
*ls
, __isl_take isl_vec
*v
)
65 isl_constraint
*constraint
;
70 constraint
= isl_alloc_type(isl_vec_get_ctx(v
), isl_constraint
);
81 isl_local_space_free(ls
);
86 __isl_give isl_constraint
*isl_constraint_alloc(int eq
,
87 __isl_take isl_local_space
*ls
)
95 ctx
= isl_local_space_get_ctx(ls
);
96 v
= isl_vec_alloc(ctx
, 1 + isl_local_space_dim(ls
, isl_dim_all
));
98 return isl_constraint_alloc_vec(eq
, ls
, v
);
101 struct isl_constraint
*isl_basic_map_constraint(struct isl_basic_map
*bmap
,
107 isl_local_space
*ls
= NULL
;
108 isl_constraint
*constraint
;
113 eq
= line
>= bmap
->eq
;
115 ctx
= isl_basic_map_get_ctx(bmap
);
116 ls
= isl_basic_map_get_local_space(bmap
);
117 v
= isl_vec_alloc(ctx
, 1 + isl_local_space_dim(ls
, isl_dim_all
));
120 isl_seq_cpy(v
->el
, line
[0], v
->size
);
121 constraint
= isl_constraint_alloc_vec(eq
, ls
, v
);
123 isl_basic_map_free(bmap
);
126 isl_local_space_free(ls
);
127 isl_basic_map_free(bmap
);
131 struct isl_constraint
*isl_basic_set_constraint(struct isl_basic_set
*bset
,
134 return isl_basic_map_constraint((struct isl_basic_map
*)bset
, line
);
137 __isl_give isl_constraint
*isl_equality_alloc(__isl_take isl_local_space
*ls
)
139 return isl_constraint_alloc(1, ls
);
142 __isl_give isl_constraint
*isl_inequality_alloc(__isl_take isl_local_space
*ls
)
144 return isl_constraint_alloc(0, ls
);
147 struct isl_constraint
*isl_constraint_dup(struct isl_constraint
*c
)
152 return isl_constraint_alloc_vec(c
->eq
, isl_local_space_copy(c
->ls
),
156 struct isl_constraint
*isl_constraint_cow(struct isl_constraint
*c
)
164 return isl_constraint_dup(c
);
167 struct isl_constraint
*isl_constraint_copy(struct isl_constraint
*constraint
)
176 void *isl_constraint_free(struct isl_constraint
*c
)
184 isl_local_space_free(c
->ls
);
191 /* Return the number of constraints in "bset", i.e., the
192 * number of times isl_basic_set_foreach_constraint will
195 int isl_basic_set_n_constraint(__isl_keep isl_basic_set
*bset
)
200 return bset
->n_eq
+ bset
->n_ineq
;
203 int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map
*bmap
,
204 int (*fn
)(__isl_take isl_constraint
*c
, void *user
), void *user
)
207 struct isl_constraint
*c
;
212 isl_assert(bmap
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_MAP_FINAL
),
215 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
216 c
= isl_basic_map_constraint(isl_basic_map_copy(bmap
),
224 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
225 c
= isl_basic_map_constraint(isl_basic_map_copy(bmap
),
236 int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set
*bset
,
237 int (*fn
)(__isl_take isl_constraint
*c
, void *user
), void *user
)
239 return isl_basic_map_foreach_constraint((isl_basic_map
*)bset
, fn
, user
);
242 int isl_constraint_is_equal(struct isl_constraint
*constraint1
,
243 struct isl_constraint
*constraint2
)
247 if (!constraint1
|| !constraint2
)
249 if (constraint1
->eq
!= constraint2
->eq
)
251 equal
= isl_local_space_is_equal(constraint1
->ls
, constraint2
->ls
);
252 if (equal
< 0 || !equal
)
254 return isl_vec_is_equal(constraint1
->v
, constraint2
->v
);
257 struct isl_basic_map
*isl_basic_map_add_constraint(
258 struct isl_basic_map
*bmap
, struct isl_constraint
*constraint
)
264 if (!bmap
|| !constraint
)
267 ctx
= isl_constraint_get_ctx(constraint
);
268 dim
= isl_constraint_get_space(constraint
);
269 equal_space
= isl_space_is_equal(bmap
->dim
, dim
);
271 isl_assert(ctx
, equal_space
, goto error
);
273 bmap
= isl_basic_map_intersect(bmap
,
274 isl_basic_map_from_constraint(constraint
));
277 isl_basic_map_free(bmap
);
278 isl_constraint_free(constraint
);
282 struct isl_basic_set
*isl_basic_set_add_constraint(
283 struct isl_basic_set
*bset
, struct isl_constraint
*constraint
)
285 return (struct isl_basic_set
*)
286 isl_basic_map_add_constraint((struct isl_basic_map
*)bset
,
290 __isl_give isl_map
*isl_map_add_constraint(__isl_take isl_map
*map
,
291 __isl_take isl_constraint
*constraint
)
295 bmap
= isl_basic_map_from_constraint(constraint
);
296 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
301 __isl_give isl_set
*isl_set_add_constraint(__isl_take isl_set
*set
,
302 __isl_take isl_constraint
*constraint
)
304 return isl_map_add_constraint(set
, constraint
);
307 __isl_give isl_space
*isl_constraint_get_space(
308 __isl_keep isl_constraint
*constraint
)
310 return constraint
? isl_local_space_get_space(constraint
->ls
) : NULL
;
313 __isl_give isl_local_space
*isl_constraint_get_local_space(
314 __isl_keep isl_constraint
*constraint
)
316 return constraint
? isl_local_space_copy(constraint
->ls
) : NULL
;
319 int isl_constraint_dim(struct isl_constraint
*constraint
,
320 enum isl_dim_type type
)
324 return n(constraint
, type
);
327 int isl_constraint_involves_dims(__isl_keep isl_constraint
*constraint
,
328 enum isl_dim_type type
, unsigned first
, unsigned n
)
340 ctx
= isl_constraint_get_ctx(constraint
);
341 if (first
+ n
> isl_constraint_dim(constraint
, type
))
342 isl_die(ctx
, isl_error_invalid
,
343 "range out of bounds", return -1);
345 active
= isl_local_space_get_active(constraint
->ls
,
346 constraint
->v
->el
+ 1);
350 first
+= isl_local_space_offset(constraint
->ls
, type
) - 1;
351 for (i
= 0; i
< n
; ++i
)
352 if (active
[first
+ i
]) {
365 /* Does the given constraint represent a lower bound on the given
368 int isl_constraint_is_lower_bound(__isl_keep isl_constraint
*constraint
,
369 enum isl_dim_type type
, unsigned pos
)
374 if (pos
>= isl_local_space_dim(constraint
->ls
, type
))
375 isl_die(isl_constraint_get_ctx(constraint
), isl_error_invalid
,
376 "position out of bounds", return -1);
378 pos
+= isl_local_space_offset(constraint
->ls
, type
);
379 return isl_int_is_pos(constraint
->v
->el
[pos
]);
382 /* Does the given constraint represent an upper bound on the given
385 int isl_constraint_is_upper_bound(__isl_keep isl_constraint
*constraint
,
386 enum isl_dim_type type
, unsigned pos
)
391 if (pos
>= isl_local_space_dim(constraint
->ls
, type
))
392 isl_die(isl_constraint_get_ctx(constraint
), isl_error_invalid
,
393 "position out of bounds", return -1);
395 pos
+= isl_local_space_offset(constraint
->ls
, type
);
396 return isl_int_is_neg(constraint
->v
->el
[pos
]);
399 const char *isl_constraint_get_dim_name(__isl_keep isl_constraint
*constraint
,
400 enum isl_dim_type type
, unsigned pos
)
403 isl_local_space_get_dim_name(constraint
->ls
, type
, pos
) : NULL
;
406 void isl_constraint_get_constant(struct isl_constraint
*constraint
, isl_int
*v
)
410 isl_int_set(*v
, constraint
->v
->el
[0]);
413 /* Return the constant term of "constraint".
415 __isl_give isl_val
*isl_constraint_get_constant_val(
416 __isl_keep isl_constraint
*constraint
)
423 ctx
= isl_constraint_get_ctx(constraint
);
424 return isl_val_int_from_isl_int(ctx
, constraint
->v
->el
[0]);
427 void isl_constraint_get_coefficient(struct isl_constraint
*constraint
,
428 enum isl_dim_type type
, int pos
, isl_int
*v
)
433 if (pos
>= isl_local_space_dim(constraint
->ls
, type
))
434 isl_die(constraint
->v
->ctx
, isl_error_invalid
,
435 "position out of bounds", return);
437 pos
+= isl_local_space_offset(constraint
->ls
, type
);
438 isl_int_set(*v
, constraint
->v
->el
[pos
]);
441 /* Return the coefficient of the variable of type "type" at position "pos"
444 __isl_give isl_val
*isl_constraint_get_coefficient_val(
445 __isl_keep isl_constraint
*constraint
, enum isl_dim_type type
, int pos
)
452 ctx
= isl_constraint_get_ctx(constraint
);
453 if (pos
< 0 || pos
>= isl_local_space_dim(constraint
->ls
, type
))
454 isl_die(ctx
, isl_error_invalid
,
455 "position out of bounds", return NULL
);
457 pos
+= isl_local_space_offset(constraint
->ls
, type
);
458 return isl_val_int_from_isl_int(ctx
, constraint
->v
->el
[pos
]);
461 __isl_give isl_aff
*isl_constraint_get_div(__isl_keep isl_constraint
*constraint
,
467 return isl_local_space_get_div(constraint
->ls
, pos
);
470 __isl_give isl_constraint
*isl_constraint_set_constant(
471 __isl_take isl_constraint
*constraint
, isl_int v
)
473 constraint
= isl_constraint_cow(constraint
);
477 constraint
->v
= isl_vec_cow(constraint
->v
);
479 return isl_constraint_free(constraint
);
481 isl_int_set(constraint
->v
->el
[0], v
);
485 /* Replace the constant term of "constraint" by "v".
487 __isl_give isl_constraint
*isl_constraint_set_constant_val(
488 __isl_take isl_constraint
*constraint
, __isl_take isl_val
*v
)
490 constraint
= isl_constraint_cow(constraint
);
491 if (!constraint
|| !v
)
493 if (!isl_val_is_int(v
))
494 isl_die(isl_constraint_get_ctx(constraint
), isl_error_invalid
,
495 "expecting integer value", goto error
);
496 constraint
->v
= isl_vec_set_element_val(constraint
->v
, 0, v
);
498 constraint
= isl_constraint_free(constraint
);
502 return isl_constraint_free(constraint
);
505 __isl_give isl_constraint
*isl_constraint_set_constant_si(
506 __isl_take isl_constraint
*constraint
, int v
)
508 constraint
= isl_constraint_cow(constraint
);
512 constraint
->v
= isl_vec_cow(constraint
->v
);
514 return isl_constraint_free(constraint
);
516 isl_int_set_si(constraint
->v
->el
[0], v
);
520 __isl_give isl_constraint
*isl_constraint_set_coefficient(
521 __isl_take isl_constraint
*constraint
,
522 enum isl_dim_type type
, int pos
, isl_int v
)
524 constraint
= isl_constraint_cow(constraint
);
528 if (pos
>= isl_local_space_dim(constraint
->ls
, type
))
529 isl_die(constraint
->v
->ctx
, isl_error_invalid
,
530 "position out of bounds",
531 return isl_constraint_free(constraint
));
533 constraint
= isl_constraint_cow(constraint
);
537 constraint
->v
= isl_vec_cow(constraint
->v
);
539 return isl_constraint_free(constraint
);
541 pos
+= isl_local_space_offset(constraint
->ls
, type
);
542 isl_int_set(constraint
->v
->el
[pos
], v
);
547 /* Replace the coefficient of the variable of type "type" at position "pos"
548 * of "constraint" by "v".
550 __isl_give isl_constraint
*isl_constraint_set_coefficient_val(
551 __isl_take isl_constraint
*constraint
,
552 enum isl_dim_type type
, int pos
, isl_val
*v
)
554 constraint
= isl_constraint_cow(constraint
);
555 if (!constraint
|| !v
)
557 if (!isl_val_is_int(v
))
558 isl_die(isl_constraint_get_ctx(constraint
), isl_error_invalid
,
559 "expecting integer value", goto error
);
561 if (pos
>= isl_local_space_dim(constraint
->ls
, type
))
562 isl_die(isl_constraint_get_ctx(constraint
), isl_error_invalid
,
563 "position out of bounds", goto error
);
565 pos
+= isl_local_space_offset(constraint
->ls
, type
);
566 constraint
->v
= isl_vec_set_element_val(constraint
->v
, pos
, v
);
568 constraint
= isl_constraint_free(constraint
);
572 return isl_constraint_free(constraint
);
575 __isl_give isl_constraint
*isl_constraint_set_coefficient_si(
576 __isl_take isl_constraint
*constraint
,
577 enum isl_dim_type type
, int pos
, int v
)
579 constraint
= isl_constraint_cow(constraint
);
583 if (pos
>= isl_local_space_dim(constraint
->ls
, type
))
584 isl_die(constraint
->v
->ctx
, isl_error_invalid
,
585 "position out of bounds",
586 return isl_constraint_free(constraint
));
588 constraint
= isl_constraint_cow(constraint
);
592 constraint
->v
= isl_vec_cow(constraint
->v
);
594 return isl_constraint_free(constraint
);
596 pos
+= isl_local_space_offset(constraint
->ls
, type
);
597 isl_int_set_si(constraint
->v
->el
[pos
], v
);
602 /* Drop any constraint from "bset" that is identical to "constraint".
603 * In particular, this means that the local spaces of "bset" and
604 * "constraint" need to be the same.
606 * Since the given constraint may actually be a pointer into the bset,
607 * we have to be careful not to reorder the constraints as the user
608 * may be holding on to other constraints from the same bset.
609 * This should be cleaned up when the internal representation of
610 * isl_constraint is changed to use isl_aff.
612 __isl_give isl_basic_set
*isl_basic_set_drop_constraint(
613 __isl_take isl_basic_set
*bset
, __isl_take isl_constraint
*constraint
)
619 isl_local_space
*ls1
;
622 if (!bset
|| !constraint
)
625 ls1
= isl_basic_set_get_local_space(bset
);
626 equal
= isl_local_space_is_equal(ls1
, constraint
->ls
);
627 isl_local_space_free(ls1
);
631 isl_constraint_free(constraint
);
635 if (isl_constraint_is_equality(constraint
)) {
643 total
= isl_constraint_dim(constraint
, isl_dim_all
);
644 for (i
= 0; i
< n
; ++i
)
645 if (isl_seq_eq(row
[i
], constraint
->v
->el
, 1 + total
))
646 isl_seq_clr(row
[i
], 1 + total
);
648 isl_constraint_free(constraint
);
651 isl_constraint_free(constraint
);
652 isl_basic_set_free(bset
);
656 struct isl_constraint
*isl_constraint_negate(struct isl_constraint
*constraint
)
660 constraint
= isl_constraint_cow(constraint
);
664 ctx
= isl_constraint_get_ctx(constraint
);
665 if (isl_constraint_is_equality(constraint
))
666 isl_die(ctx
, isl_error_invalid
, "cannot negate equality",
667 return isl_constraint_free(constraint
));
668 constraint
->v
= isl_vec_neg(constraint
->v
);
669 constraint
->v
= isl_vec_cow(constraint
->v
);
671 return isl_constraint_free(constraint
);
672 isl_int_sub_ui(constraint
->v
->el
[0], constraint
->v
->el
[0], 1);
676 int isl_constraint_is_equality(struct isl_constraint
*constraint
)
680 return constraint
->eq
;
683 int isl_constraint_is_div_constraint(__isl_keep isl_constraint
*constraint
)
690 if (isl_constraint_is_equality(constraint
))
692 n_div
= isl_constraint_dim(constraint
, isl_dim_div
);
693 for (i
= 0; i
< n_div
; ++i
) {
694 if (isl_local_space_is_div_constraint(constraint
->ls
,
695 constraint
->v
->el
, i
))
702 /* We manually set ISL_BASIC_SET_FINAL instead of calling
703 * isl_basic_map_finalize because we want to keep the position
704 * of the divs and we therefore do not want to throw away redundant divs.
705 * This is arguably a bit fragile.
707 __isl_give isl_basic_map
*isl_basic_map_from_constraint(
708 __isl_take isl_constraint
*constraint
)
712 struct isl_basic_map
*bmap
;
719 ls
= isl_local_space_copy(constraint
->ls
);
720 bmap
= isl_basic_map_from_local_space(ls
);
721 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 1);
722 if (isl_constraint_is_equality(constraint
)) {
723 k
= isl_basic_map_alloc_equality(bmap
);
729 k
= isl_basic_map_alloc_inequality(bmap
);
734 total
= isl_basic_map_total_dim(bmap
);
735 isl_seq_cpy(c
, constraint
->v
->el
, 1 + total
);
736 isl_constraint_free(constraint
);
738 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
741 isl_constraint_free(constraint
);
742 isl_basic_map_free(bmap
);
746 struct isl_basic_set
*isl_basic_set_from_constraint(
747 struct isl_constraint
*constraint
)
752 if (isl_constraint_dim(constraint
, isl_dim_in
) != 0)
753 isl_die(isl_constraint_get_ctx(constraint
), isl_error_invalid
,
754 "not a set constraint",
755 return isl_constraint_free(constraint
));
756 return (isl_basic_set
*)isl_basic_map_from_constraint(constraint
);
759 int isl_basic_map_has_defining_equality(
760 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
, int pos
,
761 __isl_give isl_constraint
**c
)
769 offset
= basic_map_offset(bmap
, type
);
770 total
= isl_basic_map_total_dim(bmap
);
771 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
772 for (i
= 0; i
< bmap
->n_eq
; ++i
)
773 if (!isl_int_is_zero(bmap
->eq
[i
][offset
+ pos
]) &&
774 isl_seq_first_non_zero(bmap
->eq
[i
]+offset
+pos
+1,
775 1+total
-offset
-pos
-1) == -1) {
776 *c
= isl_basic_map_constraint(isl_basic_map_copy(bmap
),
783 int isl_basic_set_has_defining_equality(
784 __isl_keep isl_basic_set
*bset
, enum isl_dim_type type
, int pos
,
785 __isl_give isl_constraint
**c
)
787 return isl_basic_map_has_defining_equality((isl_basic_map
*)bset
,
791 int isl_basic_set_has_defining_inequalities(
792 struct isl_basic_set
*bset
, enum isl_dim_type type
, int pos
,
793 struct isl_constraint
**lower
,
794 struct isl_constraint
**upper
)
800 isl_int
**lower_line
, **upper_line
;
804 offset
= basic_set_offset(bset
, type
);
805 total
= isl_basic_set_total_dim(bset
);
806 isl_assert(bset
->ctx
, pos
< isl_basic_set_dim(bset
, type
), return -1);
808 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
809 if (isl_int_is_zero(bset
->ineq
[i
][offset
+ pos
]))
811 if (isl_int_is_one(bset
->ineq
[i
][offset
+ pos
]))
813 if (isl_int_is_negone(bset
->ineq
[i
][offset
+ pos
]))
815 if (isl_seq_first_non_zero(bset
->ineq
[i
]+offset
+pos
+1,
816 1+total
-offset
-pos
-1) != -1)
818 for (j
= i
+ 1; j
< bset
->n_ineq
; ++j
) {
819 if (!isl_seq_is_neg(bset
->ineq
[i
]+1, bset
->ineq
[j
]+1,
822 isl_int_add(m
, bset
->ineq
[i
][0], bset
->ineq
[j
][0]);
823 if (isl_int_abs_ge(m
, bset
->ineq
[i
][offset
+pos
]))
826 if (isl_int_is_pos(bset
->ineq
[i
][offset
+pos
])) {
827 lower_line
= &bset
->ineq
[i
];
828 upper_line
= &bset
->ineq
[j
];
830 lower_line
= &bset
->ineq
[j
];
831 upper_line
= &bset
->ineq
[i
];
833 *lower
= isl_basic_set_constraint(
834 isl_basic_set_copy(bset
), lower_line
);
835 *upper
= isl_basic_set_constraint(
836 isl_basic_set_copy(bset
), upper_line
);
847 /* Given two constraints "a" and "b" on the variable at position "abs_pos"
848 * (in "a" and "b"), add a constraint to "bset" that ensures that the
849 * bound implied by "a" is (strictly) larger than the bound implied by "b".
851 * If both constraints imply lower bounds, then this means that "a" is
852 * active in the result.
853 * If both constraints imply upper bounds, then this means that "b" is
854 * active in the result.
856 static __isl_give isl_basic_set
*add_larger_bound_constraint(
857 __isl_take isl_basic_set
*bset
, isl_int
*a
, isl_int
*b
,
858 unsigned abs_pos
, int strict
)
864 k
= isl_basic_set_alloc_inequality(bset
);
868 total
= isl_basic_set_dim(bset
, isl_dim_all
);
871 isl_int_neg(t
, b
[1 + abs_pos
]);
873 isl_seq_combine(bset
->ineq
[k
], t
, a
, a
[1 + abs_pos
], b
, 1 + abs_pos
);
874 isl_seq_combine(bset
->ineq
[k
] + 1 + abs_pos
,
875 t
, a
+ 1 + abs_pos
+ 1, a
[1 + abs_pos
], b
+ 1 + abs_pos
+ 1,
879 isl_int_sub_ui(bset
->ineq
[k
][0], bset
->ineq
[k
][0], 1);
885 isl_basic_set_free(bset
);
889 /* Add constraints to "context" that ensure that "u" is the smallest
890 * (and therefore active) upper bound on "abs_pos" in "bset" and return
891 * the resulting basic set.
893 static __isl_give isl_basic_set
*set_smallest_upper_bound(
894 __isl_keep isl_basic_set
*context
,
895 __isl_keep isl_basic_set
*bset
, unsigned abs_pos
, int n_upper
, int u
)
899 context
= isl_basic_set_copy(context
);
900 context
= isl_basic_set_cow(context
);
902 context
= isl_basic_set_extend_constraints(context
, 0, n_upper
- 1);
904 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
907 if (!isl_int_is_neg(bset
->ineq
[j
][1 + abs_pos
]))
909 context
= add_larger_bound_constraint(context
,
910 bset
->ineq
[j
], bset
->ineq
[u
], abs_pos
, j
> u
);
913 context
= isl_basic_set_simplify(context
);
914 context
= isl_basic_set_finalize(context
);
919 /* Add constraints to "context" that ensure that "u" is the largest
920 * (and therefore active) upper bound on "abs_pos" in "bset" and return
921 * the resulting basic set.
923 static __isl_give isl_basic_set
*set_largest_lower_bound(
924 __isl_keep isl_basic_set
*context
,
925 __isl_keep isl_basic_set
*bset
, unsigned abs_pos
, int n_lower
, int l
)
929 context
= isl_basic_set_copy(context
);
930 context
= isl_basic_set_cow(context
);
932 context
= isl_basic_set_extend_constraints(context
, 0, n_lower
- 1);
934 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
937 if (!isl_int_is_pos(bset
->ineq
[j
][1 + abs_pos
]))
939 context
= add_larger_bound_constraint(context
,
940 bset
->ineq
[l
], bset
->ineq
[j
], abs_pos
, j
> l
);
943 context
= isl_basic_set_simplify(context
);
944 context
= isl_basic_set_finalize(context
);
949 static int foreach_upper_bound(__isl_keep isl_basic_set
*bset
,
950 enum isl_dim_type type
, unsigned abs_pos
,
951 __isl_take isl_basic_set
*context
, int n_upper
,
952 int (*fn
)(__isl_take isl_constraint
*lower
,
953 __isl_take isl_constraint
*upper
,
954 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
956 isl_basic_set
*context_i
;
957 isl_constraint
*upper
= NULL
;
960 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
961 if (isl_int_is_zero(bset
->ineq
[i
][1 + abs_pos
]))
964 context_i
= set_smallest_upper_bound(context
, bset
,
965 abs_pos
, n_upper
, i
);
966 if (isl_basic_set_is_empty(context_i
)) {
967 isl_basic_set_free(context_i
);
970 upper
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
972 if (!upper
|| !context_i
)
974 if (fn(NULL
, upper
, context_i
, user
) < 0)
978 isl_basic_set_free(context
);
980 if (i
< bset
->n_ineq
)
985 isl_constraint_free(upper
);
986 isl_basic_set_free(context_i
);
987 isl_basic_set_free(context
);
991 static int foreach_lower_bound(__isl_keep isl_basic_set
*bset
,
992 enum isl_dim_type type
, unsigned abs_pos
,
993 __isl_take isl_basic_set
*context
, int n_lower
,
994 int (*fn
)(__isl_take isl_constraint
*lower
,
995 __isl_take isl_constraint
*upper
,
996 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
998 isl_basic_set
*context_i
;
999 isl_constraint
*lower
= NULL
;
1002 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
1003 if (isl_int_is_zero(bset
->ineq
[i
][1 + abs_pos
]))
1006 context_i
= set_largest_lower_bound(context
, bset
,
1007 abs_pos
, n_lower
, i
);
1008 if (isl_basic_set_is_empty(context_i
)) {
1009 isl_basic_set_free(context_i
);
1012 lower
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
1014 if (!lower
|| !context_i
)
1016 if (fn(lower
, NULL
, context_i
, user
) < 0)
1020 isl_basic_set_free(context
);
1022 if (i
< bset
->n_ineq
)
1027 isl_constraint_free(lower
);
1028 isl_basic_set_free(context_i
);
1029 isl_basic_set_free(context
);
1033 static int foreach_bound_pair(__isl_keep isl_basic_set
*bset
,
1034 enum isl_dim_type type
, unsigned abs_pos
,
1035 __isl_take isl_basic_set
*context
, int n_lower
, int n_upper
,
1036 int (*fn
)(__isl_take isl_constraint
*lower
,
1037 __isl_take isl_constraint
*upper
,
1038 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
1040 isl_basic_set
*context_i
, *context_j
;
1041 isl_constraint
*lower
= NULL
;
1042 isl_constraint
*upper
= NULL
;
1045 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
1046 if (!isl_int_is_pos(bset
->ineq
[i
][1 + abs_pos
]))
1049 context_i
= set_largest_lower_bound(context
, bset
,
1050 abs_pos
, n_lower
, i
);
1051 if (isl_basic_set_is_empty(context_i
)) {
1052 isl_basic_set_free(context_i
);
1056 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
1057 if (!isl_int_is_neg(bset
->ineq
[j
][1 + abs_pos
]))
1060 context_j
= set_smallest_upper_bound(context_i
, bset
,
1061 abs_pos
, n_upper
, j
);
1062 context_j
= isl_basic_set_extend_constraints(context_j
,
1064 context_j
= add_larger_bound_constraint(context_j
,
1065 bset
->ineq
[i
], bset
->ineq
[j
], abs_pos
, 0);
1066 context_j
= isl_basic_set_simplify(context_j
);
1067 context_j
= isl_basic_set_finalize(context_j
);
1068 if (isl_basic_set_is_empty(context_j
)) {
1069 isl_basic_set_free(context_j
);
1072 lower
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
1074 upper
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
1076 if (!lower
|| !upper
|| !context_j
)
1078 if (fn(lower
, upper
, context_j
, user
) < 0)
1082 isl_basic_set_free(context_i
);
1084 if (j
< bset
->n_ineq
)
1088 isl_basic_set_free(context
);
1090 if (i
< bset
->n_ineq
)
1095 isl_constraint_free(lower
);
1096 isl_constraint_free(upper
);
1097 isl_basic_set_free(context_i
);
1098 isl_basic_set_free(context_j
);
1099 isl_basic_set_free(context
);
1103 /* For each pair of lower and upper bounds on the variable "pos"
1104 * of type "type", call "fn" with these lower and upper bounds and the
1105 * set of constraints on the remaining variables where these bounds
1106 * are active, i.e., (stricly) larger/smaller than the other lower/upper bounds.
1108 * If the designated variable is equal to an affine combination of the
1109 * other variables then fn is called with both lower and upper
1110 * set to the corresponding equality.
1112 * If there is no lower (or upper) bound, then NULL is passed
1113 * as the corresponding bound.
1115 * We first check if the variable is involved in any equality.
1116 * If not, we count the number of lower and upper bounds and
1119 int isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set
*bset
,
1120 enum isl_dim_type type
, unsigned pos
,
1121 int (*fn
)(__isl_take isl_constraint
*lower
,
1122 __isl_take isl_constraint
*upper
,
1123 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
1126 isl_constraint
*lower
= NULL
;
1127 isl_constraint
*upper
= NULL
;
1128 isl_basic_set
*context
= NULL
;
1130 int n_lower
, n_upper
;
1134 isl_assert(bset
->ctx
, pos
< isl_basic_set_dim(bset
, type
), return -1);
1135 isl_assert(bset
->ctx
, type
== isl_dim_param
|| type
== isl_dim_set
,
1139 if (type
== isl_dim_set
)
1140 abs_pos
+= isl_basic_set_dim(bset
, isl_dim_param
);
1142 for (i
= 0; i
< bset
->n_eq
; ++i
) {
1143 if (isl_int_is_zero(bset
->eq
[i
][1 + abs_pos
]))
1146 lower
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
1148 upper
= isl_constraint_copy(lower
);
1149 context
= isl_basic_set_remove_dims(isl_basic_set_copy(bset
),
1151 if (!lower
|| !upper
|| !context
)
1153 return fn(lower
, upper
, context
, user
);
1158 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
1159 if (isl_int_is_pos(bset
->ineq
[i
][1 + abs_pos
]))
1161 else if (isl_int_is_neg(bset
->ineq
[i
][1 + abs_pos
]))
1165 context
= isl_basic_set_copy(bset
);
1166 context
= isl_basic_set_cow(context
);
1169 for (i
= context
->n_ineq
- 1; i
>= 0; --i
)
1170 if (!isl_int_is_zero(context
->ineq
[i
][1 + abs_pos
]))
1171 isl_basic_set_drop_inequality(context
, i
);
1173 context
= isl_basic_set_drop(context
, type
, pos
, 1);
1174 if (!n_lower
&& !n_upper
)
1175 return fn(NULL
, NULL
, context
, user
);
1177 return foreach_upper_bound(bset
, type
, abs_pos
, context
, n_upper
,
1180 return foreach_lower_bound(bset
, type
, abs_pos
, context
, n_lower
,
1182 return foreach_bound_pair(bset
, type
, abs_pos
, context
, n_lower
, n_upper
,
1185 isl_constraint_free(lower
);
1186 isl_constraint_free(upper
);
1187 isl_basic_set_free(context
);
1191 __isl_give isl_aff
*isl_constraint_get_bound(
1192 __isl_keep isl_constraint
*constraint
, enum isl_dim_type type
, int pos
)
1199 ctx
= isl_constraint_get_ctx(constraint
);
1200 if (pos
>= isl_constraint_dim(constraint
, type
))
1201 isl_die(ctx
, isl_error_invalid
,
1202 "index out of bounds", return NULL
);
1203 if (isl_constraint_dim(constraint
, isl_dim_in
) != 0)
1204 isl_die(ctx
, isl_error_invalid
,
1205 "not a set constraint", return NULL
);
1207 pos
+= offset(constraint
, type
);
1208 if (isl_int_is_zero(constraint
->v
->el
[pos
]))
1209 isl_die(ctx
, isl_error_invalid
,
1210 "constraint does not define a bound on given dimension",
1213 aff
= isl_aff_alloc(isl_local_space_copy(constraint
->ls
));
1217 if (isl_int_is_neg(constraint
->v
->el
[pos
]))
1218 isl_seq_cpy(aff
->v
->el
+ 1, constraint
->v
->el
, aff
->v
->size
- 1);
1220 isl_seq_neg(aff
->v
->el
+ 1, constraint
->v
->el
, aff
->v
->size
- 1);
1221 isl_int_set_si(aff
->v
->el
[1 + pos
], 0);
1222 isl_int_abs(aff
->v
->el
[0], constraint
->v
->el
[pos
]);
1227 /* For an inequality constraint
1231 * or an equality constraint
1235 * return the affine expression f.
1237 __isl_give isl_aff
*isl_constraint_get_aff(
1238 __isl_keep isl_constraint
*constraint
)
1245 aff
= isl_aff_alloc(isl_local_space_copy(constraint
->ls
));
1249 isl_seq_cpy(aff
->v
->el
+ 1, constraint
->v
->el
, aff
->v
->size
- 1);
1250 isl_int_set_si(aff
->v
->el
[0], 1);
1255 /* Construct an inequality (eq = 0) or equality (eq = 1) constraint from "aff".
1256 * In particular, construct aff >= 0 or aff = 0.
1258 * The denominator of "aff" can be ignored.
1260 static __isl_give isl_constraint
*isl_constraint_alloc_aff(int eq
,
1261 __isl_take isl_aff
*aff
)
1263 isl_local_space
*ls
;
1268 ls
= isl_aff_get_domain_local_space(aff
);
1269 v
= isl_vec_drop_els(isl_vec_copy(aff
->v
), 0, 1);
1272 return isl_constraint_alloc_vec(eq
, ls
, v
);
1275 /* Construct an equality constraint equating the given affine expression
1278 __isl_give isl_constraint
*isl_equality_from_aff(__isl_take isl_aff
*aff
)
1280 return isl_constraint_alloc_aff(1, aff
);
1283 /* Construct an inequality constraint enforcing the given affine expression
1284 * to be non-negative.
1286 __isl_give isl_constraint
*isl_inequality_from_aff(__isl_take isl_aff
*aff
)
1288 return isl_constraint_alloc_aff(0, aff
);