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_aff_get_ctx(c
->aff
) : NULL
;
26 static unsigned n(struct isl_constraint
*c
, enum isl_dim_type type
)
28 return isl_aff_dim(c
->aff
, type
);
31 static unsigned offset(struct isl_constraint
*c
, enum isl_dim_type type
)
33 return isl_local_space_offset(c
->aff
->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
, __isl_take isl_aff
*aff
)
58 isl_constraint
*constraint
;
63 constraint
= isl_alloc_type(isl_aff_get_ctx(aff
), isl_constraint
);
69 constraint
->aff
= aff
;
77 struct isl_constraint
*isl_basic_map_constraint(struct isl_basic_map
*bmap
,
83 isl_constraint
*constraint
;
88 eq
= line
>= bmap
->eq
;
90 ls
= isl_basic_map_get_local_space(bmap
);
91 aff
= isl_aff_alloc(ls
);
94 isl_int_set_si(aff
->v
->el
[0], 1);
95 isl_seq_cpy(aff
->v
->el
+ 1, line
[0], aff
->v
->size
- 1);
96 constraint
= isl_constraint_alloc(eq
, aff
);
98 isl_basic_map_free(bmap
);
101 isl_basic_map_free(bmap
);
105 struct isl_constraint
*isl_basic_set_constraint(struct isl_basic_set
*bset
,
108 return isl_basic_map_constraint((struct isl_basic_map
*)bset
, line
);
111 struct isl_constraint
*isl_equality_alloc(__isl_take isl_space
*dim
)
113 struct isl_basic_map
*bmap
;
118 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
122 isl_basic_map_alloc_equality(bmap
);
123 isl_seq_clr(bmap
->eq
[0], 1 + isl_basic_map_total_dim(bmap
));
124 return isl_basic_map_constraint(bmap
, &bmap
->eq
[0]);
127 struct isl_constraint
*isl_inequality_alloc(__isl_take isl_space
*dim
)
129 struct isl_basic_map
*bmap
;
134 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 1);
138 isl_basic_map_alloc_inequality(bmap
);
139 isl_seq_clr(bmap
->ineq
[0], 1 + isl_basic_map_total_dim(bmap
));
140 return isl_basic_map_constraint(bmap
, &bmap
->ineq
[0]);
143 struct isl_constraint
*isl_constraint_dup(struct isl_constraint
*c
)
148 return isl_constraint_alloc(c
->eq
, isl_aff_copy(c
->aff
));
151 struct isl_constraint
*isl_constraint_cow(struct isl_constraint
*c
)
159 return isl_constraint_dup(c
);
162 struct isl_constraint
*isl_constraint_copy(struct isl_constraint
*constraint
)
171 void *isl_constraint_free(struct isl_constraint
*c
)
179 isl_aff_free(c
->aff
);
185 int isl_basic_map_foreach_constraint(__isl_keep isl_basic_map
*bmap
,
186 int (*fn
)(__isl_take isl_constraint
*c
, void *user
), void *user
)
189 struct isl_constraint
*c
;
194 isl_assert(bmap
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_MAP_FINAL
),
197 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
198 c
= isl_basic_map_constraint(isl_basic_map_copy(bmap
),
206 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
207 c
= isl_basic_map_constraint(isl_basic_map_copy(bmap
),
218 int isl_basic_set_foreach_constraint(__isl_keep isl_basic_set
*bset
,
219 int (*fn
)(__isl_take isl_constraint
*c
, void *user
), void *user
)
221 return isl_basic_map_foreach_constraint((isl_basic_map
*)bset
, fn
, user
);
224 int isl_constraint_is_equal(struct isl_constraint
*constraint1
,
225 struct isl_constraint
*constraint2
)
227 if (!constraint1
|| !constraint2
)
229 return constraint1
->eq
== constraint2
->eq
&&
230 isl_aff_plain_is_equal(constraint1
->aff
, constraint2
->aff
);
233 struct isl_basic_map
*isl_basic_map_add_constraint(
234 struct isl_basic_map
*bmap
, struct isl_constraint
*constraint
)
240 if (!bmap
|| !constraint
)
243 ctx
= isl_constraint_get_ctx(constraint
);
244 dim
= isl_constraint_get_space(constraint
);
245 equal_space
= isl_space_is_equal(bmap
->dim
, dim
);
247 isl_assert(ctx
, equal_space
, goto error
);
249 bmap
= isl_basic_map_intersect(bmap
,
250 isl_basic_map_from_constraint(constraint
));
253 isl_basic_map_free(bmap
);
254 isl_constraint_free(constraint
);
258 struct isl_basic_set
*isl_basic_set_add_constraint(
259 struct isl_basic_set
*bset
, struct isl_constraint
*constraint
)
261 return (struct isl_basic_set
*)
262 isl_basic_map_add_constraint((struct isl_basic_map
*)bset
,
266 __isl_give isl_map
*isl_map_add_constraint(__isl_take isl_map
*map
,
267 __isl_take isl_constraint
*constraint
)
271 bmap
= isl_basic_map_from_constraint(constraint
);
272 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
277 __isl_give isl_set
*isl_set_add_constraint(__isl_take isl_set
*set
,
278 __isl_take isl_constraint
*constraint
)
280 return isl_map_add_constraint(set
, constraint
);
283 __isl_give isl_space
*isl_constraint_get_space(
284 __isl_keep isl_constraint
*constraint
)
286 return constraint
? isl_aff_get_space(constraint
->aff
) : NULL
;
289 int isl_constraint_dim(struct isl_constraint
*constraint
,
290 enum isl_dim_type type
)
294 return n(constraint
, type
);
297 int isl_constraint_involves_dims(__isl_keep isl_constraint
*constraint
,
298 enum isl_dim_type type
, unsigned first
, unsigned n
)
303 return isl_aff_involves_dims(constraint
->aff
, type
, first
, n
);
306 const char *isl_constraint_get_dim_name(__isl_keep isl_constraint
*constraint
,
307 enum isl_dim_type type
, unsigned pos
)
310 isl_aff_get_dim_name(constraint
->aff
, type
, pos
) : NULL
;
313 void isl_constraint_get_constant(struct isl_constraint
*constraint
, isl_int
*v
)
317 isl_aff_get_constant(constraint
->aff
, v
);
320 void isl_constraint_get_coefficient(struct isl_constraint
*constraint
,
321 enum isl_dim_type type
, int pos
, isl_int
*v
)
326 isl_aff_get_coefficient(constraint
->aff
, type
, pos
, v
);
329 struct isl_div
*isl_constraint_div(struct isl_constraint
*constraint
, int pos
)
334 return isl_aff_get_div(constraint
->aff
, pos
);
337 __isl_give isl_constraint
*isl_constraint_set_constant(
338 __isl_take isl_constraint
*constraint
, isl_int v
)
340 constraint
= isl_constraint_cow(constraint
);
343 constraint
->aff
= isl_aff_set_constant(constraint
->aff
, v
);
344 if (!constraint
->aff
)
345 return isl_constraint_free(constraint
);
349 __isl_give isl_constraint
*isl_constraint_set_constant_si(
350 __isl_take isl_constraint
*constraint
, int v
)
352 constraint
= isl_constraint_cow(constraint
);
355 constraint
->aff
= isl_aff_set_constant_si(constraint
->aff
, v
);
356 if (!constraint
->aff
)
357 return isl_constraint_free(constraint
);
361 __isl_give isl_constraint
*isl_constraint_set_coefficient(
362 __isl_take isl_constraint
*constraint
,
363 enum isl_dim_type type
, int pos
, isl_int v
)
365 constraint
= isl_constraint_cow(constraint
);
368 constraint
->aff
= isl_aff_set_coefficient(constraint
->aff
,
370 if (!constraint
->aff
)
371 return isl_constraint_free(constraint
);
375 __isl_give isl_constraint
*isl_constraint_set_coefficient_si(
376 __isl_take isl_constraint
*constraint
,
377 enum isl_dim_type type
, int pos
, int v
)
379 constraint
= isl_constraint_cow(constraint
);
382 constraint
->aff
= isl_aff_set_coefficient_si(constraint
->aff
,
384 if (!constraint
->aff
)
385 return isl_constraint_free(constraint
);
389 /* Drop any constraint from "bset" that is identical to "constraint".
390 * In particular, this means that the local spaces of "bset" and
391 * "constraint" need to be the same.
393 * Since the given constraint may actually be a pointer into the bset,
394 * we have to be careful not to reorder the constraints as the user
395 * may be holding on to other constraints from the same bset.
396 * This should be cleaned up when the internal representation of
397 * isl_constraint is changed to use isl_aff.
399 __isl_give isl_basic_set
*isl_basic_set_drop_constraint(
400 __isl_take isl_basic_set
*bset
, __isl_take isl_constraint
*constraint
)
406 isl_local_space
*ls1
, *ls2
;
409 if (!bset
|| !constraint
)
412 ls1
= isl_basic_set_get_local_space(bset
);
413 ls2
= isl_aff_get_local_space(constraint
->aff
);
414 equal
= isl_local_space_is_equal(ls1
, ls2
);
415 isl_local_space_free(ls1
);
416 isl_local_space_free(ls2
);
420 isl_constraint_free(constraint
);
424 if (isl_constraint_is_equality(constraint
)) {
432 total
= isl_aff_dim(constraint
->aff
, isl_dim_all
);
433 for (i
= 0; i
< n
; ++i
)
434 if (isl_seq_eq(row
[i
], constraint
->aff
->v
->el
+ 1, 1 + total
))
435 isl_seq_clr(row
[i
], 1 + total
);
437 isl_constraint_free(constraint
);
440 isl_constraint_free(constraint
);
441 isl_basic_set_free(bset
);
445 struct isl_constraint
*isl_constraint_negate(struct isl_constraint
*constraint
)
449 constraint
= isl_constraint_cow(constraint
);
453 ctx
= isl_constraint_get_ctx(constraint
);
454 if (isl_constraint_is_equality(constraint
))
455 isl_die(ctx
, isl_error_invalid
, "cannot negate equality",
456 return isl_constraint_free(constraint
));
457 constraint
->aff
= isl_aff_neg(constraint
->aff
);
458 constraint
->aff
= isl_aff_add_constant_si(constraint
->aff
, -1);
459 if (!constraint
->aff
)
460 return isl_constraint_free(constraint
);
464 int isl_constraint_is_equality(struct isl_constraint
*constraint
)
468 return constraint
->eq
;
471 int isl_constraint_is_div_constraint(__isl_keep isl_constraint
*constraint
)
478 if (isl_constraint_is_equality(constraint
))
480 n_div
= isl_aff_dim(constraint
->aff
, isl_dim_div
);
481 for (i
= 0; i
< n_div
; ++i
) {
482 if (isl_local_space_is_div_constraint(constraint
->aff
->ls
,
483 constraint
->aff
->v
->el
+ 1, i
))
490 /* We manually set ISL_BASIC_SET_FINAL instead of calling
491 * isl_basic_map_finalize because we want to keep the position
492 * of the divs and we therefore do not want to throw away redundant divs.
493 * This is arguably a bit fragile.
495 __isl_give isl_basic_map
*isl_basic_map_from_constraint(
496 __isl_take isl_constraint
*constraint
)
500 struct isl_basic_map
*bmap
;
507 ls
= isl_aff_get_local_space(constraint
->aff
);
508 bmap
= isl_basic_map_from_local_space(ls
);
509 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 1);
510 if (isl_constraint_is_equality(constraint
)) {
511 k
= isl_basic_map_alloc_equality(bmap
);
517 k
= isl_basic_map_alloc_inequality(bmap
);
522 total
= isl_basic_map_total_dim(bmap
);
523 isl_seq_cpy(c
, constraint
->aff
->v
->el
+ 1, 1 + total
);
524 isl_constraint_free(constraint
);
526 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
529 isl_constraint_free(constraint
);
530 isl_basic_map_free(bmap
);
534 struct isl_basic_set
*isl_basic_set_from_constraint(
535 struct isl_constraint
*constraint
)
540 if (isl_constraint_dim(constraint
, isl_dim_in
) != 0)
541 isl_die(isl_constraint_get_ctx(constraint
), isl_error_invalid
,
542 "not a set constraint",
543 return isl_constraint_free(constraint
));
544 return (isl_basic_set
*)isl_basic_map_from_constraint(constraint
);
547 int isl_basic_map_has_defining_equality(
548 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
, int pos
,
549 __isl_give isl_constraint
**c
)
557 offset
= basic_map_offset(bmap
, type
);
558 total
= isl_basic_map_total_dim(bmap
);
559 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
560 for (i
= 0; i
< bmap
->n_eq
; ++i
)
561 if (!isl_int_is_zero(bmap
->eq
[i
][offset
+ pos
]) &&
562 isl_seq_first_non_zero(bmap
->eq
[i
]+offset
+pos
+1,
563 1+total
-offset
-pos
-1) == -1) {
564 *c
= isl_basic_map_constraint(isl_basic_map_copy(bmap
),
571 int isl_basic_set_has_defining_equality(
572 __isl_keep isl_basic_set
*bset
, enum isl_dim_type type
, int pos
,
573 __isl_give isl_constraint
**c
)
575 return isl_basic_map_has_defining_equality((isl_basic_map
*)bset
,
579 int isl_basic_set_has_defining_inequalities(
580 struct isl_basic_set
*bset
, enum isl_dim_type type
, int pos
,
581 struct isl_constraint
**lower
,
582 struct isl_constraint
**upper
)
588 isl_int
**lower_line
, **upper_line
;
592 offset
= basic_set_offset(bset
, type
);
593 total
= isl_basic_set_total_dim(bset
);
594 isl_assert(bset
->ctx
, pos
< isl_basic_set_dim(bset
, type
), return -1);
596 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
597 if (isl_int_is_zero(bset
->ineq
[i
][offset
+ pos
]))
599 if (isl_int_is_one(bset
->ineq
[i
][offset
+ pos
]))
601 if (isl_int_is_negone(bset
->ineq
[i
][offset
+ pos
]))
603 if (isl_seq_first_non_zero(bset
->ineq
[i
]+offset
+pos
+1,
604 1+total
-offset
-pos
-1) != -1)
606 for (j
= i
+ 1; j
< bset
->n_ineq
; ++j
) {
607 if (!isl_seq_is_neg(bset
->ineq
[i
]+1, bset
->ineq
[j
]+1,
610 isl_int_add(m
, bset
->ineq
[i
][0], bset
->ineq
[j
][0]);
611 if (isl_int_abs_ge(m
, bset
->ineq
[i
][offset
+pos
]))
614 if (isl_int_is_pos(bset
->ineq
[i
][offset
+pos
])) {
615 lower_line
= &bset
->ineq
[i
];
616 upper_line
= &bset
->ineq
[j
];
618 lower_line
= &bset
->ineq
[j
];
619 upper_line
= &bset
->ineq
[i
];
621 *lower
= isl_basic_set_constraint(
622 isl_basic_set_copy(bset
), lower_line
);
623 *upper
= isl_basic_set_constraint(
624 isl_basic_set_copy(bset
), upper_line
);
635 /* Given two constraints "a" and "b" on the variable at position "abs_pos"
636 * (in "a" and "b"), add a constraint to "bset" that ensures that the
637 * bound implied by "a" is (strictly) larger than the bound implied by "b".
639 * If both constraints imply lower bounds, then this means that "a" is
640 * active in the result.
641 * If both constraints imply upper bounds, then this means that "b" is
642 * active in the result.
644 static __isl_give isl_basic_set
*add_larger_bound_constraint(
645 __isl_take isl_basic_set
*bset
, isl_int
*a
, isl_int
*b
,
646 unsigned abs_pos
, int strict
)
652 k
= isl_basic_set_alloc_inequality(bset
);
656 total
= isl_basic_set_dim(bset
, isl_dim_all
);
659 isl_int_neg(t
, b
[1 + abs_pos
]);
661 isl_seq_combine(bset
->ineq
[k
], t
, a
, a
[1 + abs_pos
], b
, 1 + abs_pos
);
662 isl_seq_combine(bset
->ineq
[k
] + 1 + abs_pos
,
663 t
, a
+ 1 + abs_pos
+ 1, a
[1 + abs_pos
], b
+ 1 + abs_pos
+ 1,
667 isl_int_sub_ui(bset
->ineq
[k
][0], bset
->ineq
[k
][0], 1);
673 isl_basic_set_free(bset
);
677 /* Add constraints to "context" that ensure that "u" is the smallest
678 * (and therefore active) upper bound on "abs_pos" in "bset" and return
679 * the resulting basic set.
681 static __isl_give isl_basic_set
*set_smallest_upper_bound(
682 __isl_keep isl_basic_set
*context
,
683 __isl_keep isl_basic_set
*bset
, unsigned abs_pos
, int n_upper
, int u
)
687 context
= isl_basic_set_copy(context
);
688 context
= isl_basic_set_cow(context
);
690 context
= isl_basic_set_extend_constraints(context
, 0, n_upper
- 1);
692 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
695 if (!isl_int_is_neg(bset
->ineq
[j
][1 + abs_pos
]))
697 context
= add_larger_bound_constraint(context
,
698 bset
->ineq
[j
], bset
->ineq
[u
], abs_pos
, j
> u
);
701 context
= isl_basic_set_simplify(context
);
702 context
= isl_basic_set_finalize(context
);
707 /* Add constraints to "context" that ensure that "u" is the largest
708 * (and therefore active) upper bound on "abs_pos" in "bset" and return
709 * the resulting basic set.
711 static __isl_give isl_basic_set
*set_largest_lower_bound(
712 __isl_keep isl_basic_set
*context
,
713 __isl_keep isl_basic_set
*bset
, unsigned abs_pos
, int n_lower
, int l
)
717 context
= isl_basic_set_copy(context
);
718 context
= isl_basic_set_cow(context
);
720 context
= isl_basic_set_extend_constraints(context
, 0, n_lower
- 1);
722 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
725 if (!isl_int_is_pos(bset
->ineq
[j
][1 + abs_pos
]))
727 context
= add_larger_bound_constraint(context
,
728 bset
->ineq
[l
], bset
->ineq
[j
], abs_pos
, j
> l
);
731 context
= isl_basic_set_simplify(context
);
732 context
= isl_basic_set_finalize(context
);
737 static int foreach_upper_bound(__isl_keep isl_basic_set
*bset
,
738 enum isl_dim_type type
, unsigned abs_pos
,
739 __isl_take isl_basic_set
*context
, int n_upper
,
740 int (*fn
)(__isl_take isl_constraint
*lower
,
741 __isl_take isl_constraint
*upper
,
742 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
744 isl_basic_set
*context_i
;
745 isl_constraint
*upper
= NULL
;
748 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
749 if (isl_int_is_zero(bset
->ineq
[i
][1 + abs_pos
]))
752 context_i
= set_smallest_upper_bound(context
, bset
,
753 abs_pos
, n_upper
, i
);
754 if (isl_basic_set_is_empty(context_i
)) {
755 isl_basic_set_free(context_i
);
758 upper
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
760 if (!upper
|| !context_i
)
762 if (fn(NULL
, upper
, context_i
, user
) < 0)
766 isl_basic_set_free(context
);
768 if (i
< bset
->n_ineq
)
773 isl_constraint_free(upper
);
774 isl_basic_set_free(context_i
);
775 isl_basic_set_free(context
);
779 static int foreach_lower_bound(__isl_keep isl_basic_set
*bset
,
780 enum isl_dim_type type
, unsigned abs_pos
,
781 __isl_take isl_basic_set
*context
, int n_lower
,
782 int (*fn
)(__isl_take isl_constraint
*lower
,
783 __isl_take isl_constraint
*upper
,
784 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
786 isl_basic_set
*context_i
;
787 isl_constraint
*lower
= NULL
;
790 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
791 if (isl_int_is_zero(bset
->ineq
[i
][1 + abs_pos
]))
794 context_i
= set_largest_lower_bound(context
, bset
,
795 abs_pos
, n_lower
, i
);
796 if (isl_basic_set_is_empty(context_i
)) {
797 isl_basic_set_free(context_i
);
800 lower
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
802 if (!lower
|| !context_i
)
804 if (fn(lower
, NULL
, context_i
, user
) < 0)
808 isl_basic_set_free(context
);
810 if (i
< bset
->n_ineq
)
815 isl_constraint_free(lower
);
816 isl_basic_set_free(context_i
);
817 isl_basic_set_free(context
);
821 static int foreach_bound_pair(__isl_keep isl_basic_set
*bset
,
822 enum isl_dim_type type
, unsigned abs_pos
,
823 __isl_take isl_basic_set
*context
, int n_lower
, int n_upper
,
824 int (*fn
)(__isl_take isl_constraint
*lower
,
825 __isl_take isl_constraint
*upper
,
826 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
828 isl_basic_set
*context_i
, *context_j
;
829 isl_constraint
*lower
= NULL
;
830 isl_constraint
*upper
= NULL
;
833 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
834 if (!isl_int_is_pos(bset
->ineq
[i
][1 + abs_pos
]))
837 context_i
= set_largest_lower_bound(context
, bset
,
838 abs_pos
, n_lower
, i
);
839 if (isl_basic_set_is_empty(context_i
)) {
840 isl_basic_set_free(context_i
);
844 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
845 if (!isl_int_is_neg(bset
->ineq
[j
][1 + abs_pos
]))
848 context_j
= set_smallest_upper_bound(context_i
, bset
,
849 abs_pos
, n_upper
, j
);
850 context_j
= isl_basic_set_extend_constraints(context_j
,
852 context_j
= add_larger_bound_constraint(context_j
,
853 bset
->ineq
[i
], bset
->ineq
[j
], abs_pos
, 0);
854 context_j
= isl_basic_set_simplify(context_j
);
855 context_j
= isl_basic_set_finalize(context_j
);
856 if (isl_basic_set_is_empty(context_j
)) {
857 isl_basic_set_free(context_j
);
860 lower
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
862 upper
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
864 if (!lower
|| !upper
|| !context_j
)
866 if (fn(lower
, upper
, context_j
, user
) < 0)
870 isl_basic_set_free(context_i
);
872 if (j
< bset
->n_ineq
)
876 isl_basic_set_free(context
);
878 if (i
< bset
->n_ineq
)
883 isl_constraint_free(lower
);
884 isl_constraint_free(upper
);
885 isl_basic_set_free(context_i
);
886 isl_basic_set_free(context_j
);
887 isl_basic_set_free(context
);
891 /* For each pair of lower and upper bounds on the variable "pos"
892 * of type "type", call "fn" with these lower and upper bounds and the
893 * set of constraints on the remaining variables where these bounds
894 * are active, i.e., (stricly) larger/smaller than the other lower/upper bounds.
896 * If the designated variable is equal to an affine combination of the
897 * other variables then fn is called with both lower and upper
898 * set to the corresponding equality.
900 * If there is no lower (or upper) bound, then NULL is passed
901 * as the corresponding bound.
903 * We first check if the variable is involved in any equality.
904 * If not, we count the number of lower and upper bounds and
907 int isl_basic_set_foreach_bound_pair(__isl_keep isl_basic_set
*bset
,
908 enum isl_dim_type type
, unsigned pos
,
909 int (*fn
)(__isl_take isl_constraint
*lower
,
910 __isl_take isl_constraint
*upper
,
911 __isl_take isl_basic_set
*bset
, void *user
), void *user
)
914 isl_constraint
*lower
= NULL
;
915 isl_constraint
*upper
= NULL
;
916 isl_basic_set
*context
= NULL
;
918 int n_lower
, n_upper
;
922 isl_assert(bset
->ctx
, pos
< isl_basic_set_dim(bset
, type
), return -1);
923 isl_assert(bset
->ctx
, type
== isl_dim_param
|| type
== isl_dim_set
,
927 if (type
== isl_dim_set
)
928 abs_pos
+= isl_basic_set_dim(bset
, isl_dim_param
);
930 for (i
= 0; i
< bset
->n_eq
; ++i
) {
931 if (isl_int_is_zero(bset
->eq
[i
][1 + abs_pos
]))
934 lower
= isl_basic_set_constraint(isl_basic_set_copy(bset
),
936 upper
= isl_constraint_copy(lower
);
937 context
= isl_basic_set_remove_dims(isl_basic_set_copy(bset
),
939 if (!lower
|| !upper
|| !context
)
941 return fn(lower
, upper
, context
, user
);
946 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
947 if (isl_int_is_pos(bset
->ineq
[i
][1 + abs_pos
]))
949 else if (isl_int_is_neg(bset
->ineq
[i
][1 + abs_pos
]))
953 context
= isl_basic_set_copy(bset
);
954 context
= isl_basic_set_cow(context
);
957 for (i
= context
->n_ineq
- 1; i
>= 0; --i
)
958 if (!isl_int_is_zero(context
->ineq
[i
][1 + abs_pos
]))
959 isl_basic_set_drop_inequality(context
, i
);
961 context
= isl_basic_set_drop(context
, type
, pos
, 1);
962 if (!n_lower
&& !n_upper
)
963 return fn(NULL
, NULL
, context
, user
);
965 return foreach_upper_bound(bset
, type
, abs_pos
, context
, n_upper
,
968 return foreach_lower_bound(bset
, type
, abs_pos
, context
, n_lower
,
970 return foreach_bound_pair(bset
, type
, abs_pos
, context
, n_lower
, n_upper
,
973 isl_constraint_free(lower
);
974 isl_constraint_free(upper
);
975 isl_basic_set_free(context
);
979 __isl_give isl_aff
*isl_constraint_get_bound(
980 __isl_keep isl_constraint
*constraint
, enum isl_dim_type type
, int pos
)
988 ctx
= isl_constraint_get_ctx(constraint
);
989 if (pos
>= isl_constraint_dim(constraint
, type
))
990 isl_die(ctx
, isl_error_invalid
,
991 "index out of bounds", return NULL
);
992 if (isl_constraint_dim(constraint
, isl_dim_in
) != 0)
993 isl_die(ctx
, isl_error_invalid
,
994 "not a set constraint", return NULL
);
996 pos
+= offset(constraint
, type
);
997 if (isl_int_is_zero(constraint
->aff
->v
->el
[1 + pos
]))
998 isl_die(ctx
, isl_error_invalid
,
999 "constraint does not define a bound on given dimension",
1002 ls
= isl_aff_get_local_space(constraint
->aff
);
1003 aff
= isl_aff_alloc(ls
);
1007 if (isl_int_is_neg(constraint
->aff
->v
->el
[1 + pos
]))
1008 isl_seq_cpy(aff
->v
->el
+ 1, constraint
->aff
->v
->el
+ 1,
1011 isl_seq_neg(aff
->v
->el
+ 1, constraint
->aff
->v
->el
+ 1,
1013 isl_int_set_si(aff
->v
->el
[1 + pos
], 0);
1014 isl_int_abs(aff
->v
->el
[0], constraint
->aff
->v
->el
[1 + pos
]);
1019 /* For an inequality constraint
1023 * or an equality constraint
1027 * return the affine expression f.
1029 __isl_give isl_aff
*isl_constraint_get_aff(
1030 __isl_keep isl_constraint
*constraint
)
1035 return isl_aff_copy(constraint
->aff
);
1038 /* Construct an equality constraint equating the given affine expression
1041 __isl_give isl_constraint
*isl_equality_from_aff(__isl_take isl_aff
*aff
)
1044 isl_basic_set
*bset
;
1049 bset
= isl_basic_set_from_local_space(isl_aff_get_local_space(aff
));
1050 bset
= isl_basic_set_extend_constraints(bset
, 1, 0);
1051 k
= isl_basic_set_alloc_equality(bset
);
1055 isl_seq_cpy(bset
->eq
[k
], aff
->v
->el
+ 1, aff
->v
->size
- 1);
1058 return isl_basic_set_constraint(bset
, &bset
->eq
[k
]);
1061 isl_basic_set_free(bset
);
1065 /* Construct an inequality constraint enforcing the given affine expression
1066 * to be non-negative.
1068 __isl_give isl_constraint
*isl_inequality_from_aff(__isl_take isl_aff
*aff
)
1071 isl_basic_set
*bset
;
1076 bset
= isl_basic_set_from_local_space(isl_aff_get_local_space(aff
));
1077 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
1078 k
= isl_basic_set_alloc_inequality(bset
);
1082 isl_seq_cpy(bset
->ineq
[k
], aff
->v
->el
+ 1, aff
->v
->size
- 1);
1085 return isl_basic_set_constraint(bset
, &bset
->ineq
[k
]);
1088 isl_basic_set_free(bset
);