2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2014 INRIA Rocquencourt
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 Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
10 * B.P. 105 - 78153 Le Chesnay, France
13 #include <isl_ctx_private.h>
14 #include <isl_map_private.h>
15 #include <isl_lp_private.h>
17 #include <isl_mat_private.h>
18 #include <isl_vec_private.h>
21 #include <isl_options_private.h>
22 #include "isl_equalities.h"
26 #include <bset_to_bmap.c>
27 #include <bset_from_bmap.c>
28 #include <set_to_map.c>
30 static __isl_give isl_basic_set
*uset_convex_hull_wrap_bounded(
31 __isl_take isl_set
*set
);
34 * constraints. If the minimal value along the normal of a constraint
35 * is the same if the constraint is removed, then the constraint is redundant.
37 * Since some constraints may be mutually redundant, sort the constraints
38 * first such that constraints that involve existentially quantified
39 * variables are considered for removal before those that do not.
40 * The sorting is also needed for the use in map_simple_hull.
42 * Note that isl_tab_detect_implicit_equalities may also end up
43 * marking some constraints as redundant. Make sure the constraints
44 * are preserved and undo those marking such that isl_tab_detect_redundant
45 * can consider the constraints in the sorted order.
47 * Alternatively, we could have intersected the basic map with the
48 * corresponding equality and then checked if the dimension was that
51 __isl_give isl_basic_map
*isl_basic_map_remove_redundancies(
52 __isl_take isl_basic_map
*bmap
)
59 bmap
= isl_basic_map_gauss(bmap
, NULL
);
60 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
62 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
))
64 if (bmap
->n_ineq
<= 1)
67 bmap
= isl_basic_map_sort_constraints(bmap
);
68 tab
= isl_tab_from_basic_map(bmap
, 0);
72 if (isl_tab_detect_implicit_equalities(tab
) < 0)
74 if (isl_tab_restore_redundant(tab
) < 0)
77 if (isl_tab_detect_redundant(tab
) < 0)
79 bmap
= isl_basic_map_update_from_tab(bmap
, tab
);
83 ISL_F_SET(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
84 ISL_F_SET(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
88 isl_basic_map_free(bmap
);
92 __isl_give isl_basic_set
*isl_basic_set_remove_redundancies(
93 __isl_take isl_basic_set
*bset
)
95 return bset_from_bmap(
96 isl_basic_map_remove_redundancies(bset_to_bmap(bset
)));
99 /* Remove redundant constraints in each of the basic maps.
101 __isl_give isl_map
*isl_map_remove_redundancies(__isl_take isl_map
*map
)
103 return isl_map_inline_foreach_basic_map(map
,
104 &isl_basic_map_remove_redundancies
);
107 __isl_give isl_set
*isl_set_remove_redundancies(__isl_take isl_set
*set
)
109 return isl_map_remove_redundancies(set
);
112 /* Check if the set set is bound in the direction of the affine
113 * constraint c and if so, set the constant term such that the
114 * resulting constraint is a bounding constraint for the set.
116 static isl_bool
uset_is_bound(__isl_keep isl_set
*set
, isl_int
*c
, unsigned len
)
124 isl_int_init(opt_denom
);
126 for (j
= 0; j
< set
->n
; ++j
) {
127 enum isl_lp_result res
;
129 if (ISL_F_ISSET(set
->p
[j
], ISL_BASIC_SET_EMPTY
))
132 res
= isl_basic_set_solve_lp(set
->p
[j
],
133 0, c
, set
->ctx
->one
, &opt
, &opt_denom
, NULL
);
134 if (res
== isl_lp_unbounded
)
136 if (res
== isl_lp_error
)
138 if (res
== isl_lp_empty
) {
139 set
->p
[j
] = isl_basic_set_set_to_empty(set
->p
[j
]);
144 if (first
|| isl_int_is_neg(opt
)) {
145 if (!isl_int_is_one(opt_denom
))
146 isl_seq_scale(c
, c
, opt_denom
, len
);
147 isl_int_sub(c
[0], c
[0], opt
);
152 isl_int_clear(opt_denom
);
153 return isl_bool_ok(j
>= set
->n
);
156 isl_int_clear(opt_denom
);
157 return isl_bool_error
;
160 static __isl_give isl_set
*isl_set_add_basic_set_equality(
161 __isl_take isl_set
*set
, isl_int
*c
)
165 set
= isl_set_cow(set
);
168 for (i
= 0; i
< set
->n
; ++i
) {
169 set
->p
[i
] = isl_basic_set_add_eq(set
->p
[i
], c
);
179 /* Given a union of basic sets, construct the constraints for wrapping
180 * a facet around one of its ridges.
181 * In particular, if each of n the d-dimensional basic sets i in "set"
182 * contains the origin, satisfies the constraints x_1 >= 0 and x_2 >= 0
183 * and is defined by the constraints
187 * then the resulting set is of dimension n*(1+d) and has as constraints
196 static __isl_give isl_basic_set
*wrap_constraints(__isl_keep isl_set
*set
)
198 struct isl_basic_set
*lp
;
202 isl_size dim
, lp_dim
;
204 dim
= isl_set_dim(set
, isl_dim_set
);
211 for (i
= 0; i
< set
->n
; ++i
) {
212 n_eq
+= set
->p
[i
]->n_eq
;
213 n_ineq
+= set
->p
[i
]->n_ineq
;
215 lp
= isl_basic_set_alloc(set
->ctx
, 0, dim
* set
->n
, 0, n_eq
, n_ineq
);
216 lp
= isl_basic_set_set_rational(lp
);
219 lp_dim
= isl_basic_set_dim(lp
, isl_dim_set
);
221 return isl_basic_set_free(lp
);
222 k
= isl_basic_set_alloc_equality(lp
);
223 isl_int_set_si(lp
->eq
[k
][0], -1);
224 for (i
= 0; i
< set
->n
; ++i
) {
225 isl_int_set_si(lp
->eq
[k
][1+dim
*i
], 0);
226 isl_int_set_si(lp
->eq
[k
][1+dim
*i
+1], 1);
227 isl_seq_clr(lp
->eq
[k
]+1+dim
*i
+2, dim
-2);
229 for (i
= 0; i
< set
->n
; ++i
) {
230 k
= isl_basic_set_alloc_inequality(lp
);
231 isl_seq_clr(lp
->ineq
[k
], 1+lp_dim
);
232 isl_int_set_si(lp
->ineq
[k
][1+dim
*i
], 1);
234 for (j
= 0; j
< set
->p
[i
]->n_eq
; ++j
) {
235 k
= isl_basic_set_alloc_equality(lp
);
236 isl_seq_clr(lp
->eq
[k
], 1+dim
*i
);
237 isl_seq_cpy(lp
->eq
[k
]+1+dim
*i
, set
->p
[i
]->eq
[j
], dim
);
238 isl_seq_clr(lp
->eq
[k
]+1+dim
*(i
+1), dim
*(set
->n
-i
-1));
241 for (j
= 0; j
< set
->p
[i
]->n_ineq
; ++j
) {
242 k
= isl_basic_set_alloc_inequality(lp
);
243 isl_seq_clr(lp
->ineq
[k
], 1+dim
*i
);
244 isl_seq_cpy(lp
->ineq
[k
]+1+dim
*i
, set
->p
[i
]->ineq
[j
], dim
);
245 isl_seq_clr(lp
->ineq
[k
]+1+dim
*(i
+1), dim
*(set
->n
-i
-1));
251 /* Given a facet "facet" of the convex hull of "set" and a facet "ridge"
252 * of that facet, compute the other facet of the convex hull that contains
255 * We first transform the set such that the facet constraint becomes
259 * I.e., the facet lies in
263 * and on that facet, the constraint that defines the ridge is
267 * (This transformation is not strictly needed, all that is needed is
268 * that the ridge contains the origin.)
270 * Since the ridge contains the origin, the cone of the convex hull
271 * will be of the form
276 * with this second constraint defining the new facet.
277 * The constant a is obtained by settting x_1 in the cone of the
278 * convex hull to 1 and minimizing x_2.
279 * Now, each element in the cone of the convex hull is the sum
280 * of elements in the cones of the basic sets.
281 * If a_i is the dilation factor of basic set i, then the problem
282 * we need to solve is
295 * the constraints of each (transformed) basic set.
296 * If a = n/d, then the constraint defining the new facet (in the transformed
299 * -n x_1 + d x_2 >= 0
301 * In the original space, we need to take the same combination of the
302 * corresponding constraints "facet" and "ridge".
304 * If a = -infty = "-1/0", then we just return the original facet constraint.
305 * This means that the facet is unbounded, but has a bounded intersection
306 * with the union of sets.
308 isl_int
*isl_set_wrap_facet(__isl_keep isl_set
*set
,
309 isl_int
*facet
, isl_int
*ridge
)
313 struct isl_mat
*T
= NULL
;
314 struct isl_basic_set
*lp
= NULL
;
316 enum isl_lp_result res
;
320 dim
= isl_set_dim(set
, isl_dim_set
);
324 set
= isl_set_copy(set
);
325 set
= isl_set_set_rational(set
);
328 T
= isl_mat_alloc(ctx
, 3, dim
);
331 isl_int_set_si(T
->row
[0][0], 1);
332 isl_seq_clr(T
->row
[0]+1, dim
- 1);
333 isl_seq_cpy(T
->row
[1], facet
, dim
);
334 isl_seq_cpy(T
->row
[2], ridge
, dim
);
335 T
= isl_mat_right_inverse(T
);
336 set
= isl_set_preimage(set
, T
);
340 lp
= wrap_constraints(set
);
341 obj
= isl_vec_alloc(ctx
, 1 + dim
*set
->n
);
344 isl_int_set_si(obj
->block
.data
[0], 0);
345 for (i
= 0; i
< set
->n
; ++i
) {
346 isl_seq_clr(obj
->block
.data
+ 1 + dim
*i
, 2);
347 isl_int_set_si(obj
->block
.data
[1 + dim
*i
+2], 1);
348 isl_seq_clr(obj
->block
.data
+ 1 + dim
*i
+3, dim
-3);
352 res
= isl_basic_set_solve_lp(lp
, 0,
353 obj
->block
.data
, ctx
->one
, &num
, &den
, NULL
);
354 if (res
== isl_lp_ok
) {
355 isl_int_neg(num
, num
);
356 isl_seq_combine(facet
, num
, facet
, den
, ridge
, dim
);
357 isl_seq_normalize(ctx
, facet
, dim
);
362 isl_basic_set_free(lp
);
364 if (res
== isl_lp_error
)
366 isl_assert(ctx
, res
== isl_lp_ok
|| res
== isl_lp_unbounded
,
370 isl_basic_set_free(lp
);
376 /* Compute the constraint of a facet of "set".
378 * We first compute the intersection with a bounding constraint
379 * that is orthogonal to one of the coordinate axes.
380 * If the affine hull of this intersection has only one equality,
381 * we have found a facet.
382 * Otherwise, we wrap the current bounding constraint around
383 * one of the equalities of the face (one that is not equal to
384 * the current bounding constraint).
385 * This process continues until we have found a facet.
386 * The dimension of the intersection increases by at least
387 * one on each iteration, so termination is guaranteed.
389 static __isl_give isl_mat
*initial_facet_constraint(__isl_keep isl_set
*set
)
391 struct isl_set
*slice
= NULL
;
392 struct isl_basic_set
*face
= NULL
;
394 isl_size dim
= isl_set_dim(set
, isl_dim_set
);
396 isl_mat
*bounds
= NULL
;
400 isl_assert(set
->ctx
, set
->n
> 0, goto error
);
401 bounds
= isl_mat_alloc(set
->ctx
, 1, 1 + dim
);
405 isl_seq_clr(bounds
->row
[0], dim
);
406 isl_int_set_si(bounds
->row
[0][1 + dim
- 1], 1);
407 is_bound
= uset_is_bound(set
, bounds
->row
[0], 1 + dim
);
410 isl_assert(set
->ctx
, is_bound
, goto error
);
411 isl_seq_normalize(set
->ctx
, bounds
->row
[0], 1 + dim
);
415 slice
= isl_set_copy(set
);
416 slice
= isl_set_add_basic_set_equality(slice
, bounds
->row
[0]);
417 face
= isl_set_affine_hull(slice
);
420 if (face
->n_eq
== 1) {
421 isl_basic_set_free(face
);
424 for (i
= 0; i
< face
->n_eq
; ++i
)
425 if (!isl_seq_eq(bounds
->row
[0], face
->eq
[i
], 1 + dim
) &&
426 !isl_seq_is_neg(bounds
->row
[0],
427 face
->eq
[i
], 1 + dim
))
429 isl_assert(set
->ctx
, i
< face
->n_eq
, goto error
);
430 if (!isl_set_wrap_facet(set
, bounds
->row
[0], face
->eq
[i
]))
432 isl_seq_normalize(set
->ctx
, bounds
->row
[0], bounds
->n_col
);
433 isl_basic_set_free(face
);
438 isl_basic_set_free(face
);
439 isl_mat_free(bounds
);
443 /* Given the bounding constraint "c" of a facet of the convex hull of "set",
444 * compute a hyperplane description of the facet, i.e., compute the facets
447 * We compute an affine transformation that transforms the constraint
456 * by computing the right inverse U of a matrix that starts with the rows
469 * Since z_1 is zero, we can drop this variable as well as the corresponding
470 * column of U to obtain
478 * with Q' equal to Q, but without the corresponding row.
479 * After computing the facets of the facet in the z' space,
480 * we convert them back to the x space through Q.
482 static __isl_give isl_basic_set
*compute_facet(__isl_keep isl_set
*set
,
485 struct isl_mat
*m
, *U
, *Q
;
486 struct isl_basic_set
*facet
= NULL
;
490 dim
= isl_set_dim(set
, isl_dim_set
);
494 set
= isl_set_copy(set
);
495 m
= isl_mat_alloc(set
->ctx
, 2, 1 + dim
);
498 isl_int_set_si(m
->row
[0][0], 1);
499 isl_seq_clr(m
->row
[0]+1, dim
);
500 isl_seq_cpy(m
->row
[1], c
, 1+dim
);
501 U
= isl_mat_right_inverse(m
);
502 Q
= isl_mat_right_inverse(isl_mat_copy(U
));
503 U
= isl_mat_drop_cols(U
, 1, 1);
504 Q
= isl_mat_drop_rows(Q
, 1, 1);
505 set
= isl_set_preimage(set
, U
);
506 facet
= uset_convex_hull_wrap_bounded(set
);
507 facet
= isl_basic_set_preimage(facet
, Q
);
508 if (facet
&& facet
->n_eq
!= 0)
509 isl_die(ctx
, isl_error_internal
, "unexpected equality",
510 return isl_basic_set_free(facet
));
513 isl_basic_set_free(facet
);
518 /* Given an initial facet constraint, compute the remaining facets.
519 * We do this by running through all facets found so far and computing
520 * the adjacent facets through wrapping, adding those facets that we
521 * hadn't already found before.
523 * For each facet we have found so far, we first compute its facets
524 * in the resulting convex hull. That is, we compute the ridges
525 * of the resulting convex hull contained in the facet.
526 * We also compute the corresponding facet in the current approximation
527 * of the convex hull. There is no need to wrap around the ridges
528 * in this facet since that would result in a facet that is already
529 * present in the current approximation.
531 * This function can still be significantly optimized by checking which of
532 * the facets of the basic sets are also facets of the convex hull and
533 * using all the facets so far to help in constructing the facets of the
536 * using the technique in section "3.1 Ridge Generation" of
537 * "Extended Convex Hull" by Fukuda et al.
539 static __isl_give isl_basic_set
*extend(__isl_take isl_basic_set
*hull
,
540 __isl_keep isl_set
*set
)
544 struct isl_basic_set
*facet
= NULL
;
545 struct isl_basic_set
*hull_facet
= NULL
;
548 dim
= isl_set_dim(set
, isl_dim_set
);
549 if (dim
< 0 || !hull
)
550 return isl_basic_set_free(hull
);
552 isl_assert(set
->ctx
, set
->n
> 0, goto error
);
554 for (i
= 0; i
< hull
->n_ineq
; ++i
) {
555 facet
= compute_facet(set
, hull
->ineq
[i
]);
556 facet
= isl_basic_set_add_eq(facet
, hull
->ineq
[i
]);
557 facet
= isl_basic_set_gauss(facet
, NULL
);
558 facet
= isl_basic_set_normalize_constraints(facet
);
559 hull_facet
= isl_basic_set_copy(hull
);
560 hull_facet
= isl_basic_set_add_eq(hull_facet
, hull
->ineq
[i
]);
561 hull_facet
= isl_basic_set_gauss(hull_facet
, NULL
);
562 hull_facet
= isl_basic_set_normalize_constraints(hull_facet
);
563 if (!facet
|| !hull_facet
)
565 hull
= isl_basic_set_cow(hull
);
566 hull
= isl_basic_set_extend_space(hull
,
567 isl_space_copy(hull
->dim
), 0, 0, facet
->n_ineq
);
570 for (j
= 0; j
< facet
->n_ineq
; ++j
) {
571 for (f
= 0; f
< hull_facet
->n_ineq
; ++f
)
572 if (isl_seq_eq(facet
->ineq
[j
],
573 hull_facet
->ineq
[f
], 1 + dim
))
575 if (f
< hull_facet
->n_ineq
)
577 k
= isl_basic_set_alloc_inequality(hull
);
580 isl_seq_cpy(hull
->ineq
[k
], hull
->ineq
[i
], 1+dim
);
581 if (!isl_set_wrap_facet(set
, hull
->ineq
[k
], facet
->ineq
[j
]))
584 isl_basic_set_free(hull_facet
);
585 isl_basic_set_free(facet
);
587 hull
= isl_basic_set_simplify(hull
);
588 hull
= isl_basic_set_finalize(hull
);
591 isl_basic_set_free(hull_facet
);
592 isl_basic_set_free(facet
);
593 isl_basic_set_free(hull
);
597 /* Special case for computing the convex hull of a one dimensional set.
598 * We simply collect the lower and upper bounds of each basic set
599 * and the biggest of those.
601 static __isl_give isl_basic_set
*convex_hull_1d(__isl_take isl_set
*set
)
603 struct isl_mat
*c
= NULL
;
604 isl_int
*lower
= NULL
;
605 isl_int
*upper
= NULL
;
608 struct isl_basic_set
*hull
;
610 for (i
= 0; i
< set
->n
; ++i
) {
611 set
->p
[i
] = isl_basic_set_simplify(set
->p
[i
]);
615 set
= isl_set_remove_empty_parts(set
);
618 isl_assert(set
->ctx
, set
->n
> 0, goto error
);
619 c
= isl_mat_alloc(set
->ctx
, 2, 2);
623 if (set
->p
[0]->n_eq
> 0) {
624 isl_assert(set
->ctx
, set
->p
[0]->n_eq
== 1, goto error
);
627 if (isl_int_is_pos(set
->p
[0]->eq
[0][1])) {
628 isl_seq_cpy(lower
, set
->p
[0]->eq
[0], 2);
629 isl_seq_neg(upper
, set
->p
[0]->eq
[0], 2);
631 isl_seq_neg(lower
, set
->p
[0]->eq
[0], 2);
632 isl_seq_cpy(upper
, set
->p
[0]->eq
[0], 2);
635 for (j
= 0; j
< set
->p
[0]->n_ineq
; ++j
) {
636 if (isl_int_is_pos(set
->p
[0]->ineq
[j
][1])) {
638 isl_seq_cpy(lower
, set
->p
[0]->ineq
[j
], 2);
641 isl_seq_cpy(upper
, set
->p
[0]->ineq
[j
], 2);
648 for (i
= 0; i
< set
->n
; ++i
) {
649 struct isl_basic_set
*bset
= set
->p
[i
];
653 for (j
= 0; j
< bset
->n_eq
; ++j
) {
657 isl_int_mul(a
, lower
[0], bset
->eq
[j
][1]);
658 isl_int_mul(b
, lower
[1], bset
->eq
[j
][0]);
659 if (isl_int_lt(a
, b
) && isl_int_is_pos(bset
->eq
[j
][1]))
660 isl_seq_cpy(lower
, bset
->eq
[j
], 2);
661 if (isl_int_gt(a
, b
) && isl_int_is_neg(bset
->eq
[j
][1]))
662 isl_seq_neg(lower
, bset
->eq
[j
], 2);
665 isl_int_mul(a
, upper
[0], bset
->eq
[j
][1]);
666 isl_int_mul(b
, upper
[1], bset
->eq
[j
][0]);
667 if (isl_int_lt(a
, b
) && isl_int_is_pos(bset
->eq
[j
][1]))
668 isl_seq_neg(upper
, bset
->eq
[j
], 2);
669 if (isl_int_gt(a
, b
) && isl_int_is_neg(bset
->eq
[j
][1]))
670 isl_seq_cpy(upper
, bset
->eq
[j
], 2);
673 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
674 if (isl_int_is_pos(bset
->ineq
[j
][1]))
676 if (isl_int_is_neg(bset
->ineq
[j
][1]))
678 if (lower
&& isl_int_is_pos(bset
->ineq
[j
][1])) {
679 isl_int_mul(a
, lower
[0], bset
->ineq
[j
][1]);
680 isl_int_mul(b
, lower
[1], bset
->ineq
[j
][0]);
681 if (isl_int_lt(a
, b
))
682 isl_seq_cpy(lower
, bset
->ineq
[j
], 2);
684 if (upper
&& isl_int_is_neg(bset
->ineq
[j
][1])) {
685 isl_int_mul(a
, upper
[0], bset
->ineq
[j
][1]);
686 isl_int_mul(b
, upper
[1], bset
->ineq
[j
][0]);
687 if (isl_int_gt(a
, b
))
688 isl_seq_cpy(upper
, bset
->ineq
[j
], 2);
699 hull
= isl_basic_set_alloc(set
->ctx
, 0, 1, 0, 0, 2);
700 hull
= isl_basic_set_set_rational(hull
);
704 k
= isl_basic_set_alloc_inequality(hull
);
705 isl_seq_cpy(hull
->ineq
[k
], lower
, 2);
708 k
= isl_basic_set_alloc_inequality(hull
);
709 isl_seq_cpy(hull
->ineq
[k
], upper
, 2);
711 hull
= isl_basic_set_finalize(hull
);
721 static __isl_give isl_basic_set
*convex_hull_0d(__isl_take isl_set
*set
)
723 struct isl_basic_set
*convex_hull
;
728 if (isl_set_is_empty(set
))
729 convex_hull
= isl_basic_set_empty(isl_space_copy(set
->dim
));
731 convex_hull
= isl_basic_set_universe(isl_space_copy(set
->dim
));
736 /* Compute the convex hull of a pair of basic sets without any parameters or
737 * integer divisions using Fourier-Motzkin elimination.
738 * The convex hull is the set of all points that can be written as
739 * the sum of points from both basic sets (in homogeneous coordinates).
740 * We set up the constraints in a space with dimensions for each of
741 * the three sets and then project out the dimensions corresponding
742 * to the two original basic sets, retaining only those corresponding
743 * to the convex hull.
745 static __isl_give isl_basic_set
*convex_hull_pair_elim(
746 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
749 struct isl_basic_set
*bset
[2];
750 struct isl_basic_set
*hull
= NULL
;
753 dim
= isl_basic_set_dim(bset1
, isl_dim_set
);
754 if (dim
< 0 || !bset2
)
757 hull
= isl_basic_set_alloc(bset1
->ctx
, 0, 2 + 3 * dim
, 0,
758 1 + dim
+ bset1
->n_eq
+ bset2
->n_eq
,
759 2 + bset1
->n_ineq
+ bset2
->n_ineq
);
762 for (i
= 0; i
< 2; ++i
) {
763 for (j
= 0; j
< bset
[i
]->n_eq
; ++j
) {
764 k
= isl_basic_set_alloc_equality(hull
);
767 isl_seq_clr(hull
->eq
[k
], (i
+1) * (1+dim
));
768 isl_seq_clr(hull
->eq
[k
]+(i
+2)*(1+dim
), (1-i
)*(1+dim
));
769 isl_seq_cpy(hull
->eq
[k
]+(i
+1)*(1+dim
), bset
[i
]->eq
[j
],
772 for (j
= 0; j
< bset
[i
]->n_ineq
; ++j
) {
773 k
= isl_basic_set_alloc_inequality(hull
);
776 isl_seq_clr(hull
->ineq
[k
], (i
+1) * (1+dim
));
777 isl_seq_clr(hull
->ineq
[k
]+(i
+2)*(1+dim
), (1-i
)*(1+dim
));
778 isl_seq_cpy(hull
->ineq
[k
]+(i
+1)*(1+dim
),
779 bset
[i
]->ineq
[j
], 1+dim
);
781 k
= isl_basic_set_alloc_inequality(hull
);
784 isl_seq_clr(hull
->ineq
[k
], 1+2+3*dim
);
785 isl_int_set_si(hull
->ineq
[k
][(i
+1)*(1+dim
)], 1);
787 for (j
= 0; j
< 1+dim
; ++j
) {
788 k
= isl_basic_set_alloc_equality(hull
);
791 isl_seq_clr(hull
->eq
[k
], 1+2+3*dim
);
792 isl_int_set_si(hull
->eq
[k
][j
], -1);
793 isl_int_set_si(hull
->eq
[k
][1+dim
+j
], 1);
794 isl_int_set_si(hull
->eq
[k
][2*(1+dim
)+j
], 1);
796 hull
= isl_basic_set_set_rational(hull
);
797 hull
= isl_basic_set_remove_dims(hull
, isl_dim_set
, dim
, 2*(1+dim
));
798 hull
= isl_basic_set_remove_redundancies(hull
);
799 isl_basic_set_free(bset1
);
800 isl_basic_set_free(bset2
);
803 isl_basic_set_free(bset1
);
804 isl_basic_set_free(bset2
);
805 isl_basic_set_free(hull
);
809 /* Is the set bounded for each value of the parameters?
811 isl_bool
isl_basic_set_is_bounded(__isl_keep isl_basic_set
*bset
)
817 return isl_bool_error
;
818 if (isl_basic_set_plain_is_empty(bset
))
819 return isl_bool_true
;
821 tab
= isl_tab_from_recession_cone(bset
, 1);
822 bounded
= isl_tab_cone_is_bounded(tab
);
827 /* Is the image bounded for each value of the parameters and
828 * the domain variables?
830 isl_bool
isl_basic_map_image_is_bounded(__isl_keep isl_basic_map
*bmap
)
832 isl_size nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
833 isl_size n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
836 if (nparam
< 0 || n_in
< 0)
837 return isl_bool_error
;
839 bmap
= isl_basic_map_copy(bmap
);
840 bmap
= isl_basic_map_cow(bmap
);
841 bmap
= isl_basic_map_move_dims(bmap
, isl_dim_param
, nparam
,
842 isl_dim_in
, 0, n_in
);
843 bounded
= isl_basic_set_is_bounded(bset_from_bmap(bmap
));
844 isl_basic_map_free(bmap
);
849 /* Is the set bounded for each value of the parameters?
851 isl_bool
isl_set_is_bounded(__isl_keep isl_set
*set
)
856 return isl_bool_error
;
858 for (i
= 0; i
< set
->n
; ++i
) {
859 isl_bool bounded
= isl_basic_set_is_bounded(set
->p
[i
]);
860 if (!bounded
|| bounded
< 0)
863 return isl_bool_true
;
866 /* Compute the lineality space of the convex hull of bset1 and bset2.
868 * We first compute the intersection of the recession cone of bset1
869 * with the negative of the recession cone of bset2 and then compute
870 * the linear hull of the resulting cone.
872 static __isl_give isl_basic_set
*induced_lineality_space(
873 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
876 struct isl_basic_set
*lin
= NULL
;
879 dim
= isl_basic_set_dim(bset1
, isl_dim_all
);
880 if (dim
< 0 || !bset2
)
883 lin
= isl_basic_set_alloc_space(isl_basic_set_get_space(bset1
), 0,
884 bset1
->n_eq
+ bset2
->n_eq
,
885 bset1
->n_ineq
+ bset2
->n_ineq
);
886 lin
= isl_basic_set_set_rational(lin
);
889 for (i
= 0; i
< bset1
->n_eq
; ++i
) {
890 k
= isl_basic_set_alloc_equality(lin
);
893 isl_int_set_si(lin
->eq
[k
][0], 0);
894 isl_seq_cpy(lin
->eq
[k
] + 1, bset1
->eq
[i
] + 1, dim
);
896 for (i
= 0; i
< bset1
->n_ineq
; ++i
) {
897 k
= isl_basic_set_alloc_inequality(lin
);
900 isl_int_set_si(lin
->ineq
[k
][0], 0);
901 isl_seq_cpy(lin
->ineq
[k
] + 1, bset1
->ineq
[i
] + 1, dim
);
903 for (i
= 0; i
< bset2
->n_eq
; ++i
) {
904 k
= isl_basic_set_alloc_equality(lin
);
907 isl_int_set_si(lin
->eq
[k
][0], 0);
908 isl_seq_neg(lin
->eq
[k
] + 1, bset2
->eq
[i
] + 1, dim
);
910 for (i
= 0; i
< bset2
->n_ineq
; ++i
) {
911 k
= isl_basic_set_alloc_inequality(lin
);
914 isl_int_set_si(lin
->ineq
[k
][0], 0);
915 isl_seq_neg(lin
->ineq
[k
] + 1, bset2
->ineq
[i
] + 1, dim
);
918 isl_basic_set_free(bset1
);
919 isl_basic_set_free(bset2
);
920 return isl_basic_set_affine_hull(lin
);
922 isl_basic_set_free(lin
);
923 isl_basic_set_free(bset1
);
924 isl_basic_set_free(bset2
);
928 static __isl_give isl_basic_set
*uset_convex_hull(__isl_take isl_set
*set
);
930 /* Given a set and a linear space "lin" of dimension n > 0,
931 * project the linear space from the set, compute the convex hull
932 * and then map the set back to the original space.
938 * describe the linear space. We first compute the Hermite normal
939 * form H = M U of M = H Q, to obtain
943 * The last n rows of H will be zero, so the last n variables of x' = Q x
944 * are the one we want to project out. We do this by transforming each
945 * basic set A x >= b to A U x' >= b and then removing the last n dimensions.
946 * After computing the convex hull in x'_1, i.e., A' x'_1 >= b',
947 * we transform the hull back to the original space as A' Q_1 x >= b',
948 * with Q_1 all but the last n rows of Q.
950 static __isl_give isl_basic_set
*modulo_lineality(__isl_take isl_set
*set
,
951 __isl_take isl_basic_set
*lin
)
953 isl_size total
= isl_basic_set_dim(lin
, isl_dim_all
);
955 struct isl_basic_set
*hull
;
956 struct isl_mat
*M
, *U
, *Q
;
958 if (!set
|| total
< 0)
960 lin_dim
= total
- lin
->n_eq
;
961 M
= isl_mat_sub_alloc6(set
->ctx
, lin
->eq
, 0, lin
->n_eq
, 1, total
);
962 M
= isl_mat_left_hermite(M
, 0, &U
, &Q
);
966 isl_basic_set_free(lin
);
968 Q
= isl_mat_drop_rows(Q
, Q
->n_row
- lin_dim
, lin_dim
);
970 U
= isl_mat_lin_to_aff(U
);
971 Q
= isl_mat_lin_to_aff(Q
);
973 set
= isl_set_preimage(set
, U
);
974 set
= isl_set_remove_dims(set
, isl_dim_set
, total
- lin_dim
, lin_dim
);
975 hull
= uset_convex_hull(set
);
976 hull
= isl_basic_set_preimage(hull
, Q
);
980 isl_basic_set_free(lin
);
985 /* Given two polyhedra with as constraints h_{ij} x >= 0 in homegeneous space,
986 * set up an LP for solving
988 * \sum_j \alpha_{1j} h_{1j} = \sum_j \alpha_{2j} h_{2j}
990 * \alpha{i0} corresponds to the (implicit) positivity constraint 1 >= 0
991 * The next \alpha{ij} correspond to the equalities and come in pairs.
992 * The final \alpha{ij} correspond to the inequalities.
994 static __isl_give isl_basic_set
*valid_direction_lp(
995 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
998 struct isl_basic_set
*lp
;
1004 total
= isl_basic_set_dim(bset1
, isl_dim_all
);
1005 if (total
< 0 || !bset2
)
1009 2 * bset1
->n_eq
+ bset1
->n_ineq
+ 2 * bset2
->n_eq
+ bset2
->n_ineq
;
1010 dim
= isl_space_set_alloc(bset1
->ctx
, 0, n
);
1011 lp
= isl_basic_set_alloc_space(dim
, 0, d
, n
);
1014 for (i
= 0; i
< n
; ++i
) {
1015 k
= isl_basic_set_alloc_inequality(lp
);
1018 isl_seq_clr(lp
->ineq
[k
] + 1, n
);
1019 isl_int_set_si(lp
->ineq
[k
][0], -1);
1020 isl_int_set_si(lp
->ineq
[k
][1 + i
], 1);
1022 for (i
= 0; i
< d
; ++i
) {
1023 k
= isl_basic_set_alloc_equality(lp
);
1027 isl_int_set_si(lp
->eq
[k
][n
], 0); n
++;
1028 /* positivity constraint 1 >= 0 */
1029 isl_int_set_si(lp
->eq
[k
][n
], i
== 0); n
++;
1030 for (j
= 0; j
< bset1
->n_eq
; ++j
) {
1031 isl_int_set(lp
->eq
[k
][n
], bset1
->eq
[j
][i
]); n
++;
1032 isl_int_neg(lp
->eq
[k
][n
], bset1
->eq
[j
][i
]); n
++;
1034 for (j
= 0; j
< bset1
->n_ineq
; ++j
) {
1035 isl_int_set(lp
->eq
[k
][n
], bset1
->ineq
[j
][i
]); n
++;
1037 /* positivity constraint 1 >= 0 */
1038 isl_int_set_si(lp
->eq
[k
][n
], -(i
== 0)); n
++;
1039 for (j
= 0; j
< bset2
->n_eq
; ++j
) {
1040 isl_int_neg(lp
->eq
[k
][n
], bset2
->eq
[j
][i
]); n
++;
1041 isl_int_set(lp
->eq
[k
][n
], bset2
->eq
[j
][i
]); n
++;
1043 for (j
= 0; j
< bset2
->n_ineq
; ++j
) {
1044 isl_int_neg(lp
->eq
[k
][n
], bset2
->ineq
[j
][i
]); n
++;
1047 lp
= isl_basic_set_gauss(lp
, NULL
);
1048 isl_basic_set_free(bset1
);
1049 isl_basic_set_free(bset2
);
1052 isl_basic_set_free(bset1
);
1053 isl_basic_set_free(bset2
);
1057 /* Compute a vector s in the homogeneous space such that <s, r> > 0
1058 * for all rays in the homogeneous space of the two cones that correspond
1059 * to the input polyhedra bset1 and bset2.
1061 * We compute s as a vector that satisfies
1063 * s = \sum_j \alpha_{ij} h_{ij} for i = 1,2 (*)
1065 * with h_{ij} the normals of the facets of polyhedron i
1066 * (including the "positivity constraint" 1 >= 0) and \alpha_{ij}
1067 * strictly positive numbers. For simplicity we impose \alpha_{ij} >= 1.
1068 * We first set up an LP with as variables the \alpha{ij}.
1069 * In this formulation, for each polyhedron i,
1070 * the first constraint is the positivity constraint, followed by pairs
1071 * of variables for the equalities, followed by variables for the inequalities.
1072 * We then simply pick a feasible solution and compute s using (*).
1074 * Note that we simply pick any valid direction and make no attempt
1075 * to pick a "good" or even the "best" valid direction.
1077 static __isl_give isl_vec
*valid_direction(
1078 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
1080 struct isl_basic_set
*lp
;
1081 struct isl_tab
*tab
;
1082 struct isl_vec
*sample
= NULL
;
1083 struct isl_vec
*dir
;
1088 if (!bset1
|| !bset2
)
1090 lp
= valid_direction_lp(isl_basic_set_copy(bset1
),
1091 isl_basic_set_copy(bset2
));
1092 tab
= isl_tab_from_basic_set(lp
, 0);
1093 sample
= isl_tab_get_sample_value(tab
);
1095 isl_basic_set_free(lp
);
1098 d
= isl_basic_set_dim(bset1
, isl_dim_all
);
1101 dir
= isl_vec_alloc(bset1
->ctx
, 1 + d
);
1104 isl_seq_clr(dir
->block
.data
+ 1, dir
->size
- 1);
1106 /* positivity constraint 1 >= 0 */
1107 isl_int_set(dir
->block
.data
[0], sample
->block
.data
[n
]); n
++;
1108 for (i
= 0; i
< bset1
->n_eq
; ++i
) {
1109 isl_int_sub(sample
->block
.data
[n
],
1110 sample
->block
.data
[n
], sample
->block
.data
[n
+1]);
1111 isl_seq_combine(dir
->block
.data
,
1112 bset1
->ctx
->one
, dir
->block
.data
,
1113 sample
->block
.data
[n
], bset1
->eq
[i
], 1 + d
);
1117 for (i
= 0; i
< bset1
->n_ineq
; ++i
)
1118 isl_seq_combine(dir
->block
.data
,
1119 bset1
->ctx
->one
, dir
->block
.data
,
1120 sample
->block
.data
[n
++], bset1
->ineq
[i
], 1 + d
);
1121 isl_vec_free(sample
);
1122 isl_seq_normalize(bset1
->ctx
, dir
->el
, dir
->size
);
1123 isl_basic_set_free(bset1
);
1124 isl_basic_set_free(bset2
);
1127 isl_vec_free(sample
);
1128 isl_basic_set_free(bset1
);
1129 isl_basic_set_free(bset2
);
1133 /* Given a polyhedron b_i + A_i x >= 0 and a map T = S^{-1},
1134 * compute b_i' + A_i' x' >= 0, with
1136 * [ b_i A_i ] [ y' ] [ y' ]
1137 * [ 1 0 ] S^{-1} [ x' ] >= 0 or [ b_i' A_i' ] [ x' ] >= 0
1139 * In particular, add the "positivity constraint" and then perform
1142 static __isl_give isl_basic_set
*homogeneous_map(__isl_take isl_basic_set
*bset
,
1143 __isl_take isl_mat
*T
)
1148 total
= isl_basic_set_dim(bset
, isl_dim_all
);
1151 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
1152 k
= isl_basic_set_alloc_inequality(bset
);
1155 isl_seq_clr(bset
->ineq
[k
] + 1, total
);
1156 isl_int_set_si(bset
->ineq
[k
][0], 1);
1157 bset
= isl_basic_set_preimage(bset
, T
);
1161 isl_basic_set_free(bset
);
1165 /* Compute the convex hull of a pair of basic sets without any parameters or
1166 * integer divisions, where the convex hull is known to be pointed,
1167 * but the basic sets may be unbounded.
1169 * We turn this problem into the computation of a convex hull of a pair
1170 * _bounded_ polyhedra by "changing the direction of the homogeneous
1171 * dimension". This idea is due to Matthias Koeppe.
1173 * Consider the cones in homogeneous space that correspond to the
1174 * input polyhedra. The rays of these cones are also rays of the
1175 * polyhedra if the coordinate that corresponds to the homogeneous
1176 * dimension is zero. That is, if the inner product of the rays
1177 * with the homogeneous direction is zero.
1178 * The cones in the homogeneous space can also be considered to
1179 * correspond to other pairs of polyhedra by chosing a different
1180 * homogeneous direction. To ensure that both of these polyhedra
1181 * are bounded, we need to make sure that all rays of the cones
1182 * correspond to vertices and not to rays.
1183 * Let s be a direction such that <s, r> > 0 for all rays r of both cones.
1184 * Then using s as a homogeneous direction, we obtain a pair of polytopes.
1185 * The vector s is computed in valid_direction.
1187 * Note that we need to consider _all_ rays of the cones and not just
1188 * the rays that correspond to rays in the polyhedra. If we were to
1189 * only consider those rays and turn them into vertices, then we
1190 * may inadvertently turn some vertices into rays.
1192 * The standard homogeneous direction is the unit vector in the 0th coordinate.
1193 * We therefore transform the two polyhedra such that the selected
1194 * direction is mapped onto this standard direction and then proceed
1195 * with the normal computation.
1196 * Let S be a non-singular square matrix with s as its first row,
1197 * then we want to map the polyhedra to the space
1199 * [ y' ] [ y ] [ y ] [ y' ]
1200 * [ x' ] = S [ x ] i.e., [ x ] = S^{-1} [ x' ]
1202 * We take S to be the unimodular completion of s to limit the growth
1203 * of the coefficients in the following computations.
1205 * Let b_i + A_i x >= 0 be the constraints of polyhedron i.
1206 * We first move to the homogeneous dimension
1208 * b_i y + A_i x >= 0 [ b_i A_i ] [ y ] [ 0 ]
1209 * y >= 0 or [ 1 0 ] [ x ] >= [ 0 ]
1211 * Then we change directoin
1213 * [ b_i A_i ] [ y' ] [ y' ]
1214 * [ 1 0 ] S^{-1} [ x' ] >= 0 or [ b_i' A_i' ] [ x' ] >= 0
1216 * Then we compute the convex hull of the polytopes b_i' + A_i' x' >= 0
1217 * resulting in b' + A' x' >= 0, which we then convert back
1220 * [ b' A' ] S [ x ] >= 0 or [ b A ] [ x ] >= 0
1222 * The polyhedron b + A x >= 0 is then the convex hull of the input polyhedra.
1224 static __isl_give isl_basic_set
*convex_hull_pair_pointed(
1225 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
1227 struct isl_ctx
*ctx
= NULL
;
1228 struct isl_vec
*dir
= NULL
;
1229 struct isl_mat
*T
= NULL
;
1230 struct isl_mat
*T2
= NULL
;
1231 struct isl_basic_set
*hull
;
1232 struct isl_set
*set
;
1234 if (!bset1
|| !bset2
)
1236 ctx
= isl_basic_set_get_ctx(bset1
);
1237 dir
= valid_direction(isl_basic_set_copy(bset1
),
1238 isl_basic_set_copy(bset2
));
1241 T
= isl_mat_alloc(ctx
, dir
->size
, dir
->size
);
1244 isl_seq_cpy(T
->row
[0], dir
->block
.data
, dir
->size
);
1245 T
= isl_mat_unimodular_complete(T
, 1);
1246 T2
= isl_mat_right_inverse(isl_mat_copy(T
));
1248 bset1
= homogeneous_map(bset1
, isl_mat_copy(T2
));
1249 bset2
= homogeneous_map(bset2
, T2
);
1250 set
= isl_set_alloc_space(isl_basic_set_get_space(bset1
), 2, 0);
1251 set
= isl_set_add_basic_set(set
, bset1
);
1252 set
= isl_set_add_basic_set(set
, bset2
);
1253 hull
= uset_convex_hull(set
);
1254 hull
= isl_basic_set_preimage(hull
, T
);
1261 isl_basic_set_free(bset1
);
1262 isl_basic_set_free(bset2
);
1266 static __isl_give isl_basic_set
*uset_convex_hull_wrap(__isl_take isl_set
*set
);
1267 static __isl_give isl_basic_set
*modulo_affine_hull(
1268 __isl_take isl_set
*set
, __isl_take isl_basic_set
*affine_hull
);
1270 /* Compute the convex hull of a pair of basic sets without any parameters or
1271 * integer divisions.
1273 * This function is called from uset_convex_hull_unbounded, which
1274 * means that the complete convex hull is unbounded. Some pairs
1275 * of basic sets may still be bounded, though.
1276 * They may even lie inside a lower dimensional space, in which
1277 * case they need to be handled inside their affine hull since
1278 * the main algorithm assumes that the result is full-dimensional.
1280 * If the convex hull of the two basic sets would have a non-trivial
1281 * lineality space, we first project out this lineality space.
1283 static __isl_give isl_basic_set
*convex_hull_pair(
1284 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
1286 isl_basic_set
*lin
, *aff
;
1287 isl_bool bounded1
, bounded2
;
1290 if (bset1
->ctx
->opt
->convex
== ISL_CONVEX_HULL_FM
)
1291 return convex_hull_pair_elim(bset1
, bset2
);
1293 aff
= isl_set_affine_hull(isl_basic_set_union(isl_basic_set_copy(bset1
),
1294 isl_basic_set_copy(bset2
)));
1298 return modulo_affine_hull(isl_basic_set_union(bset1
, bset2
), aff
);
1299 isl_basic_set_free(aff
);
1301 bounded1
= isl_basic_set_is_bounded(bset1
);
1302 bounded2
= isl_basic_set_is_bounded(bset2
);
1304 if (bounded1
< 0 || bounded2
< 0)
1307 if (bounded1
&& bounded2
)
1308 return uset_convex_hull_wrap(isl_basic_set_union(bset1
, bset2
));
1310 if (bounded1
|| bounded2
)
1311 return convex_hull_pair_pointed(bset1
, bset2
);
1313 lin
= induced_lineality_space(isl_basic_set_copy(bset1
),
1314 isl_basic_set_copy(bset2
));
1317 if (isl_basic_set_plain_is_universe(lin
)) {
1318 isl_basic_set_free(bset1
);
1319 isl_basic_set_free(bset2
);
1322 total
= isl_basic_set_dim(lin
, isl_dim_all
);
1323 if (lin
->n_eq
< total
) {
1324 struct isl_set
*set
;
1325 set
= isl_set_alloc_space(isl_basic_set_get_space(bset1
), 2, 0);
1326 set
= isl_set_add_basic_set(set
, bset1
);
1327 set
= isl_set_add_basic_set(set
, bset2
);
1328 return modulo_lineality(set
, lin
);
1330 isl_basic_set_free(lin
);
1334 return convex_hull_pair_pointed(bset1
, bset2
);
1336 isl_basic_set_free(bset1
);
1337 isl_basic_set_free(bset2
);
1341 /* Compute the lineality space of a basic set.
1342 * We basically just drop the constants and turn every inequality
1344 * Any explicit representations of local variables are removed
1345 * because they may no longer be valid representations
1346 * in the lineality space.
1348 __isl_give isl_basic_set
*isl_basic_set_lineality_space(
1349 __isl_take isl_basic_set
*bset
)
1352 struct isl_basic_set
*lin
= NULL
;
1353 isl_size n_div
, dim
;
1355 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
1356 dim
= isl_basic_set_dim(bset
, isl_dim_all
);
1357 if (n_div
< 0 || dim
< 0)
1358 return isl_basic_set_free(bset
);
1360 lin
= isl_basic_set_alloc_space(isl_basic_set_get_space(bset
),
1362 for (i
= 0; i
< n_div
; ++i
)
1363 if (isl_basic_set_alloc_div(lin
) < 0)
1367 for (i
= 0; i
< bset
->n_eq
; ++i
) {
1368 k
= isl_basic_set_alloc_equality(lin
);
1371 isl_int_set_si(lin
->eq
[k
][0], 0);
1372 isl_seq_cpy(lin
->eq
[k
] + 1, bset
->eq
[i
] + 1, dim
);
1374 lin
= isl_basic_set_gauss(lin
, NULL
);
1377 for (i
= 0; i
< bset
->n_ineq
&& lin
->n_eq
< dim
; ++i
) {
1378 k
= isl_basic_set_alloc_equality(lin
);
1381 isl_int_set_si(lin
->eq
[k
][0], 0);
1382 isl_seq_cpy(lin
->eq
[k
] + 1, bset
->ineq
[i
] + 1, dim
);
1383 lin
= isl_basic_set_gauss(lin
, NULL
);
1387 isl_basic_set_free(bset
);
1390 isl_basic_set_free(lin
);
1391 isl_basic_set_free(bset
);
1395 /* Compute the (linear) hull of the lineality spaces of the basic sets in the
1398 __isl_give isl_basic_set
*isl_set_combined_lineality_space(
1399 __isl_take isl_set
*set
)
1402 struct isl_set
*lin
= NULL
;
1407 isl_space
*space
= isl_set_get_space(set
);
1409 return isl_basic_set_empty(space
);
1412 lin
= isl_set_alloc_space(isl_set_get_space(set
), set
->n
, 0);
1413 for (i
= 0; i
< set
->n
; ++i
)
1414 lin
= isl_set_add_basic_set(lin
,
1415 isl_basic_set_lineality_space(isl_basic_set_copy(set
->p
[i
])));
1417 return isl_set_affine_hull(lin
);
1420 /* Compute the convex hull of a set without any parameters or
1421 * integer divisions.
1422 * In each step, we combined two basic sets until only one
1423 * basic set is left.
1424 * The input basic sets are assumed not to have a non-trivial
1425 * lineality space. If any of the intermediate results has
1426 * a non-trivial lineality space, it is projected out.
1428 static __isl_give isl_basic_set
*uset_convex_hull_unbounded(
1429 __isl_take isl_set
*set
)
1431 isl_basic_set_list
*list
;
1433 list
= isl_set_get_basic_set_list(set
);
1438 struct isl_basic_set
*t
;
1439 isl_basic_set
*bset1
, *bset2
;
1441 n
= isl_basic_set_list_n_basic_set(list
);
1445 isl_die(isl_basic_set_list_get_ctx(list
),
1447 "expecting at least two elements", goto error
);
1448 bset1
= isl_basic_set_list_get_basic_set(list
, n
- 1);
1449 bset2
= isl_basic_set_list_get_basic_set(list
, n
- 2);
1450 bset1
= convex_hull_pair(bset1
, bset2
);
1452 isl_basic_set_list_free(list
);
1455 bset1
= isl_basic_set_underlying_set(bset1
);
1456 list
= isl_basic_set_list_drop(list
, n
- 2, 2);
1457 list
= isl_basic_set_list_add(list
, bset1
);
1459 t
= isl_basic_set_list_get_basic_set(list
, n
- 2);
1460 t
= isl_basic_set_lineality_space(t
);
1463 if (isl_basic_set_plain_is_universe(t
)) {
1464 isl_basic_set_list_free(list
);
1467 total
= isl_basic_set_dim(t
, isl_dim_all
);
1468 if (t
->n_eq
< total
) {
1469 set
= isl_basic_set_list_union(list
);
1470 return modulo_lineality(set
, t
);
1472 isl_basic_set_free(t
);
1479 isl_basic_set_list_free(list
);
1483 /* Compute an initial hull for wrapping containing a single initial
1485 * This function assumes that the given set is bounded.
1487 static __isl_give isl_basic_set
*initial_hull(__isl_take isl_basic_set
*hull
,
1488 __isl_keep isl_set
*set
)
1490 struct isl_mat
*bounds
= NULL
;
1496 bounds
= initial_facet_constraint(set
);
1499 k
= isl_basic_set_alloc_inequality(hull
);
1502 dim
= isl_set_dim(set
, isl_dim_set
);
1505 isl_assert(set
->ctx
, 1 + dim
== bounds
->n_col
, goto error
);
1506 isl_seq_cpy(hull
->ineq
[k
], bounds
->row
[0], bounds
->n_col
);
1507 isl_mat_free(bounds
);
1511 isl_basic_set_free(hull
);
1512 isl_mat_free(bounds
);
1516 struct max_constraint
{
1522 static int max_constraint_equal(const void *entry
, const void *val
)
1524 struct max_constraint
*a
= (struct max_constraint
*)entry
;
1525 isl_int
*b
= (isl_int
*)val
;
1527 return isl_seq_eq(a
->c
->row
[0] + 1, b
, a
->c
->n_col
- 1);
1530 static void update_constraint(struct isl_ctx
*ctx
, struct isl_hash_table
*table
,
1531 isl_int
*con
, unsigned len
, int n
, int ineq
)
1533 struct isl_hash_table_entry
*entry
;
1534 struct max_constraint
*c
;
1537 c_hash
= isl_seq_get_hash(con
+ 1, len
);
1538 entry
= isl_hash_table_find(ctx
, table
, c_hash
, max_constraint_equal
,
1544 isl_hash_table_remove(ctx
, table
, entry
);
1548 if (isl_int_gt(c
->c
->row
[0][0], con
[0]))
1550 if (isl_int_eq(c
->c
->row
[0][0], con
[0])) {
1555 c
->c
= isl_mat_cow(c
->c
);
1556 isl_int_set(c
->c
->row
[0][0], con
[0]);
1560 /* Check whether the constraint hash table "table" contains the constraint
1563 static int has_constraint(struct isl_ctx
*ctx
, struct isl_hash_table
*table
,
1564 isl_int
*con
, unsigned len
, int n
)
1566 struct isl_hash_table_entry
*entry
;
1567 struct max_constraint
*c
;
1570 c_hash
= isl_seq_get_hash(con
+ 1, len
);
1571 entry
= isl_hash_table_find(ctx
, table
, c_hash
, max_constraint_equal
,
1578 return isl_int_eq(c
->c
->row
[0][0], con
[0]);
1581 /* Are the constraints of "bset" known to be facets?
1582 * If there are any equality constraints, then they are not.
1583 * If there may be redundant constraints, then those
1584 * redundant constraints are not facets.
1586 static isl_bool
has_facets(__isl_keep isl_basic_set
*bset
)
1590 n_eq
= isl_basic_set_n_equality(bset
);
1592 return isl_bool_error
;
1594 return isl_bool_false
;
1595 return ISL_F_ISSET(bset
, ISL_BASIC_SET_NO_REDUNDANT
);
1598 /* Check for inequality constraints of a basic set without equalities
1599 * or redundant constraints
1600 * such that the same or more stringent copies of the constraint appear
1601 * in all of the basic sets. Such constraints are necessarily facet
1602 * constraints of the convex hull.
1604 * If the resulting basic set is by chance identical to one of
1605 * the basic sets in "set", then we know that this basic set contains
1606 * all other basic sets and is therefore the convex hull of set.
1607 * In this case we set *is_hull to 1.
1609 static __isl_give isl_basic_set
*common_constraints(
1610 __isl_take isl_basic_set
*hull
, __isl_keep isl_set
*set
, int *is_hull
)
1613 int min_constraints
;
1615 struct max_constraint
*constraints
= NULL
;
1616 struct isl_hash_table
*table
= NULL
;
1621 for (i
= 0; i
< set
->n
; ++i
) {
1622 isl_bool facets
= has_facets(set
->p
[i
]);
1624 return isl_basic_set_free(hull
);
1630 min_constraints
= set
->p
[i
]->n_ineq
;
1632 for (i
= best
+ 1; i
< set
->n
; ++i
) {
1633 isl_bool facets
= has_facets(set
->p
[i
]);
1635 return isl_basic_set_free(hull
);
1638 if (set
->p
[i
]->n_ineq
>= min_constraints
)
1640 min_constraints
= set
->p
[i
]->n_ineq
;
1643 constraints
= isl_calloc_array(hull
->ctx
, struct max_constraint
,
1647 table
= isl_alloc_type(hull
->ctx
, struct isl_hash_table
);
1648 if (isl_hash_table_init(hull
->ctx
, table
, min_constraints
))
1651 total
= isl_set_dim(set
, isl_dim_all
);
1654 for (i
= 0; i
< set
->p
[best
]->n_ineq
; ++i
) {
1655 constraints
[i
].c
= isl_mat_sub_alloc6(hull
->ctx
,
1656 set
->p
[best
]->ineq
+ i
, 0, 1, 0, 1 + total
);
1657 if (!constraints
[i
].c
)
1659 constraints
[i
].ineq
= 1;
1661 for (i
= 0; i
< min_constraints
; ++i
) {
1662 struct isl_hash_table_entry
*entry
;
1664 c_hash
= isl_seq_get_hash(constraints
[i
].c
->row
[0] + 1, total
);
1665 entry
= isl_hash_table_find(hull
->ctx
, table
, c_hash
,
1666 max_constraint_equal
, constraints
[i
].c
->row
[0] + 1, 1);
1669 isl_assert(hull
->ctx
, !entry
->data
, goto error
);
1670 entry
->data
= &constraints
[i
];
1674 for (s
= 0; s
< set
->n
; ++s
) {
1678 for (i
= 0; i
< set
->p
[s
]->n_eq
; ++i
) {
1679 isl_int
*eq
= set
->p
[s
]->eq
[i
];
1680 for (j
= 0; j
< 2; ++j
) {
1681 isl_seq_neg(eq
, eq
, 1 + total
);
1682 update_constraint(hull
->ctx
, table
,
1686 for (i
= 0; i
< set
->p
[s
]->n_ineq
; ++i
) {
1687 isl_int
*ineq
= set
->p
[s
]->ineq
[i
];
1688 update_constraint(hull
->ctx
, table
, ineq
, total
, n
,
1689 set
->p
[s
]->n_eq
== 0);
1694 for (i
= 0; i
< min_constraints
; ++i
) {
1695 if (constraints
[i
].count
< n
)
1697 if (!constraints
[i
].ineq
)
1699 j
= isl_basic_set_alloc_inequality(hull
);
1702 isl_seq_cpy(hull
->ineq
[j
], constraints
[i
].c
->row
[0], 1 + total
);
1705 for (s
= 0; s
< set
->n
; ++s
) {
1706 if (set
->p
[s
]->n_eq
)
1708 if (set
->p
[s
]->n_ineq
!= hull
->n_ineq
)
1710 for (i
= 0; i
< set
->p
[s
]->n_ineq
; ++i
) {
1711 isl_int
*ineq
= set
->p
[s
]->ineq
[i
];
1712 if (!has_constraint(hull
->ctx
, table
, ineq
, total
, n
))
1715 if (i
== set
->p
[s
]->n_ineq
)
1719 isl_hash_table_clear(table
);
1720 for (i
= 0; i
< min_constraints
; ++i
)
1721 isl_mat_free(constraints
[i
].c
);
1726 isl_hash_table_clear(table
);
1729 for (i
= 0; i
< min_constraints
; ++i
)
1730 isl_mat_free(constraints
[i
].c
);
1735 /* Create a template for the convex hull of "set" and fill it up
1736 * obvious facet constraints, if any. If the result happens to
1737 * be the convex hull of "set" then *is_hull is set to 1.
1739 static __isl_give isl_basic_set
*proto_hull(__isl_keep isl_set
*set
,
1742 struct isl_basic_set
*hull
;
1747 for (i
= 0; i
< set
->n
; ++i
) {
1748 n_ineq
+= set
->p
[i
]->n_eq
;
1749 n_ineq
+= set
->p
[i
]->n_ineq
;
1751 hull
= isl_basic_set_alloc_space(isl_space_copy(set
->dim
), 0, 0, n_ineq
);
1752 hull
= isl_basic_set_set_rational(hull
);
1755 return common_constraints(hull
, set
, is_hull
);
1758 static __isl_give isl_basic_set
*uset_convex_hull_wrap(__isl_take isl_set
*set
)
1760 struct isl_basic_set
*hull
;
1763 hull
= proto_hull(set
, &is_hull
);
1764 if (hull
&& !is_hull
) {
1765 if (hull
->n_ineq
== 0)
1766 hull
= initial_hull(hull
, set
);
1767 hull
= extend(hull
, set
);
1774 /* Compute the convex hull of a set without any parameters or
1775 * integer divisions. Depending on whether the set is bounded,
1776 * we pass control to the wrapping based convex hull or
1777 * the Fourier-Motzkin elimination based convex hull.
1778 * We also handle a few special cases before checking the boundedness.
1780 static __isl_give isl_basic_set
*uset_convex_hull(__isl_take isl_set
*set
)
1784 struct isl_basic_set
*convex_hull
= NULL
;
1785 struct isl_basic_set
*lin
;
1787 dim
= isl_set_dim(set
, isl_dim_all
);
1791 return convex_hull_0d(set
);
1793 set
= isl_set_coalesce(set
);
1794 set
= isl_set_set_rational(set
);
1799 convex_hull
= isl_basic_set_copy(set
->p
[0]);
1804 return convex_hull_1d(set
);
1806 bounded
= isl_set_is_bounded(set
);
1809 if (bounded
&& set
->ctx
->opt
->convex
== ISL_CONVEX_HULL_WRAP
)
1810 return uset_convex_hull_wrap(set
);
1812 lin
= isl_set_combined_lineality_space(isl_set_copy(set
));
1815 if (isl_basic_set_plain_is_universe(lin
)) {
1819 if (lin
->n_eq
< dim
)
1820 return modulo_lineality(set
, lin
);
1821 isl_basic_set_free(lin
);
1823 return uset_convex_hull_unbounded(set
);
1826 isl_basic_set_free(convex_hull
);
1830 /* This is the core procedure, where "set" is a "pure" set, i.e.,
1831 * without parameters or divs and where the convex hull of set is
1832 * known to be full-dimensional.
1834 static __isl_give isl_basic_set
*uset_convex_hull_wrap_bounded(
1835 __isl_take isl_set
*set
)
1837 struct isl_basic_set
*convex_hull
= NULL
;
1840 dim
= isl_set_dim(set
, isl_dim_all
);
1845 convex_hull
= isl_basic_set_universe(isl_space_copy(set
->dim
));
1847 convex_hull
= isl_basic_set_set_rational(convex_hull
);
1851 set
= isl_set_set_rational(set
);
1852 set
= isl_set_coalesce(set
);
1856 convex_hull
= isl_basic_set_copy(set
->p
[0]);
1858 convex_hull
= isl_basic_map_remove_redundancies(convex_hull
);
1862 return convex_hull_1d(set
);
1864 return uset_convex_hull_wrap(set
);
1870 /* Compute the convex hull of set "set" with affine hull "affine_hull",
1871 * We first remove the equalities (transforming the set), compute the
1872 * convex hull of the transformed set and then add the equalities back
1873 * (after performing the inverse transformation.
1875 static __isl_give isl_basic_set
*modulo_affine_hull(
1876 __isl_take isl_set
*set
, __isl_take isl_basic_set
*affine_hull
)
1880 struct isl_basic_set
*dummy
;
1881 struct isl_basic_set
*convex_hull
;
1883 dummy
= isl_basic_set_remove_equalities(
1884 isl_basic_set_copy(affine_hull
), &T
, &T2
);
1887 isl_basic_set_free(dummy
);
1888 set
= isl_set_preimage(set
, T
);
1889 convex_hull
= uset_convex_hull(set
);
1890 convex_hull
= isl_basic_set_preimage(convex_hull
, T2
);
1891 convex_hull
= isl_basic_set_intersect(convex_hull
, affine_hull
);
1896 isl_basic_set_free(affine_hull
);
1901 /* Return an empty basic map living in the same space as "map".
1903 static __isl_give isl_basic_map
*replace_map_by_empty_basic_map(
1904 __isl_take isl_map
*map
)
1908 space
= isl_map_get_space(map
);
1910 return isl_basic_map_empty(space
);
1913 /* Compute the convex hull of a map.
1915 * The implementation was inspired by "Extended Convex Hull" by Fukuda et al.,
1916 * specifically, the wrapping of facets to obtain new facets.
1918 __isl_give isl_basic_map
*isl_map_convex_hull(__isl_take isl_map
*map
)
1920 struct isl_basic_set
*bset
;
1921 struct isl_basic_map
*model
= NULL
;
1922 struct isl_basic_set
*affine_hull
= NULL
;
1923 struct isl_basic_map
*convex_hull
= NULL
;
1924 struct isl_set
*set
= NULL
;
1926 map
= isl_map_detect_equalities(map
);
1927 map
= isl_map_align_divs_internal(map
);
1932 return replace_map_by_empty_basic_map(map
);
1934 model
= isl_basic_map_copy(map
->p
[0]);
1935 set
= isl_map_underlying_set(map
);
1939 affine_hull
= isl_set_affine_hull(isl_set_copy(set
));
1942 if (affine_hull
->n_eq
!= 0)
1943 bset
= modulo_affine_hull(set
, affine_hull
);
1945 isl_basic_set_free(affine_hull
);
1946 bset
= uset_convex_hull(set
);
1949 convex_hull
= isl_basic_map_overlying_set(bset
, model
);
1953 ISL_F_SET(convex_hull
, ISL_BASIC_MAP_NO_IMPLICIT
);
1954 ISL_F_SET(convex_hull
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1955 ISL_F_CLR(convex_hull
, ISL_BASIC_MAP_RATIONAL
);
1959 isl_basic_map_free(model
);
1963 struct isl_basic_set
*isl_set_convex_hull(struct isl_set
*set
)
1965 return bset_from_bmap(isl_map_convex_hull(set_to_map(set
)));
1968 __isl_give isl_basic_map
*isl_map_polyhedral_hull(__isl_take isl_map
*map
)
1970 isl_basic_map
*hull
;
1972 hull
= isl_map_convex_hull(map
);
1973 return isl_basic_map_remove_divs(hull
);
1976 __isl_give isl_basic_set
*isl_set_polyhedral_hull(__isl_take isl_set
*set
)
1978 return bset_from_bmap(isl_map_polyhedral_hull(set_to_map(set
)));
1981 struct sh_data_entry
{
1982 struct isl_hash_table
*table
;
1983 struct isl_tab
*tab
;
1986 /* Holds the data needed during the simple hull computation.
1988 * n the number of basic sets in the original set
1989 * hull_table a hash table of already computed constraints
1990 * in the simple hull
1991 * p for each basic set,
1992 * table a hash table of the constraints
1993 * tab the tableau corresponding to the basic set
1996 struct isl_ctx
*ctx
;
1998 struct isl_hash_table
*hull_table
;
1999 struct sh_data_entry p
[1];
2002 static void sh_data_free(struct sh_data
*data
)
2008 isl_hash_table_free(data
->ctx
, data
->hull_table
);
2009 for (i
= 0; i
< data
->n
; ++i
) {
2010 isl_hash_table_free(data
->ctx
, data
->p
[i
].table
);
2011 isl_tab_free(data
->p
[i
].tab
);
2016 struct ineq_cmp_data
{
2021 static int has_ineq(const void *entry
, const void *val
)
2023 isl_int
*row
= (isl_int
*)entry
;
2024 struct ineq_cmp_data
*v
= (struct ineq_cmp_data
*)val
;
2026 return isl_seq_eq(row
+ 1, v
->p
+ 1, v
->len
) ||
2027 isl_seq_is_neg(row
+ 1, v
->p
+ 1, v
->len
);
2030 static int hash_ineq(struct isl_ctx
*ctx
, struct isl_hash_table
*table
,
2031 isl_int
*ineq
, unsigned len
)
2034 struct ineq_cmp_data v
;
2035 struct isl_hash_table_entry
*entry
;
2039 c_hash
= isl_seq_get_hash(ineq
+ 1, len
);
2040 entry
= isl_hash_table_find(ctx
, table
, c_hash
, has_ineq
, &v
, 1);
2047 /* Fill hash table "table" with the constraints of "bset".
2048 * Equalities are added as two inequalities.
2049 * The value in the hash table is a pointer to the (in)equality of "bset".
2051 static isl_stat
hash_basic_set(struct isl_hash_table
*table
,
2052 __isl_keep isl_basic_set
*bset
)
2055 isl_size dim
= isl_basic_set_dim(bset
, isl_dim_all
);
2058 return isl_stat_error
;
2059 for (i
= 0; i
< bset
->n_eq
; ++i
) {
2060 for (j
= 0; j
< 2; ++j
) {
2061 isl_seq_neg(bset
->eq
[i
], bset
->eq
[i
], 1 + dim
);
2062 if (hash_ineq(bset
->ctx
, table
, bset
->eq
[i
], dim
) < 0)
2063 return isl_stat_error
;
2066 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
2067 if (hash_ineq(bset
->ctx
, table
, bset
->ineq
[i
], dim
) < 0)
2068 return isl_stat_error
;
2073 static struct sh_data
*sh_data_alloc(__isl_keep isl_set
*set
, unsigned n_ineq
)
2075 struct sh_data
*data
;
2078 data
= isl_calloc(set
->ctx
, struct sh_data
,
2079 sizeof(struct sh_data
) +
2080 (set
->n
- 1) * sizeof(struct sh_data_entry
));
2083 data
->ctx
= set
->ctx
;
2085 data
->hull_table
= isl_hash_table_alloc(set
->ctx
, n_ineq
);
2086 if (!data
->hull_table
)
2088 for (i
= 0; i
< set
->n
; ++i
) {
2089 data
->p
[i
].table
= isl_hash_table_alloc(set
->ctx
,
2090 2 * set
->p
[i
]->n_eq
+ set
->p
[i
]->n_ineq
);
2091 if (!data
->p
[i
].table
)
2093 if (hash_basic_set(data
->p
[i
].table
, set
->p
[i
]) < 0)
2102 /* Check if inequality "ineq" is a bound for basic set "j" or if
2103 * it can be relaxed (by increasing the constant term) to become
2104 * a bound for that basic set. In the latter case, the constant
2106 * Relaxation of the constant term is only allowed if "shift" is set.
2108 * Return 1 if "ineq" is a bound
2109 * 0 if "ineq" may attain arbitrarily small values on basic set "j"
2110 * -1 if some error occurred
2112 static int is_bound(struct sh_data
*data
, __isl_keep isl_set
*set
, int j
,
2113 isl_int
*ineq
, int shift
)
2115 enum isl_lp_result res
;
2118 if (!data
->p
[j
].tab
) {
2119 data
->p
[j
].tab
= isl_tab_from_basic_set(set
->p
[j
], 0);
2120 if (!data
->p
[j
].tab
)
2126 res
= isl_tab_min(data
->p
[j
].tab
, ineq
, data
->ctx
->one
,
2128 if (res
== isl_lp_ok
&& isl_int_is_neg(opt
)) {
2130 isl_int_sub(ineq
[0], ineq
[0], opt
);
2132 res
= isl_lp_unbounded
;
2137 return (res
== isl_lp_ok
|| res
== isl_lp_empty
) ? 1 :
2138 res
== isl_lp_unbounded
? 0 : -1;
2141 /* Set the constant term of "ineq" to the maximum of those of the constraints
2142 * in the basic sets of "set" following "i" that are parallel to "ineq".
2143 * That is, if any of the basic sets of "set" following "i" have a more
2144 * relaxed copy of "ineq", then replace "ineq" by the most relaxed copy.
2145 * "c_hash" is the hash value of the linear part of "ineq".
2146 * "v" has been set up for use by has_ineq.
2148 * Note that the two inequality constraints corresponding to an equality are
2149 * represented by the same inequality constraint in data->p[j].table
2150 * (but with different hash values). This means the constraint (or at
2151 * least its constant term) may need to be temporarily negated to get
2152 * the actually hashed constraint.
2154 static void set_max_constant_term(struct sh_data
*data
, __isl_keep isl_set
*set
,
2155 int i
, isl_int
*ineq
, uint32_t c_hash
, struct ineq_cmp_data
*v
)
2159 struct isl_hash_table_entry
*entry
;
2161 ctx
= isl_set_get_ctx(set
);
2162 for (j
= i
+ 1; j
< set
->n
; ++j
) {
2166 entry
= isl_hash_table_find(ctx
, data
->p
[j
].table
,
2167 c_hash
, &has_ineq
, v
, 0);
2171 ineq_j
= entry
->data
;
2172 neg
= isl_seq_is_neg(ineq_j
+ 1, ineq
+ 1, v
->len
);
2174 isl_int_neg(ineq_j
[0], ineq_j
[0]);
2175 if (isl_int_gt(ineq_j
[0], ineq
[0]))
2176 isl_int_set(ineq
[0], ineq_j
[0]);
2178 isl_int_neg(ineq_j
[0], ineq_j
[0]);
2182 /* Check if inequality "ineq" from basic set "i" is or can be relaxed to
2183 * become a bound on the whole set. If so, add the (relaxed) inequality
2184 * to "hull". Relaxation is only allowed if "shift" is set.
2186 * We first check if "hull" already contains a translate of the inequality.
2187 * If so, we are done.
2188 * Then, we check if any of the previous basic sets contains a translate
2189 * of the inequality. If so, then we have already considered this
2190 * inequality and we are done.
2191 * Otherwise, for each basic set other than "i", we check if the inequality
2192 * is a bound on the basic set, but first replace the constant term
2193 * by the maximal value of any translate of the inequality in any
2194 * of the following basic sets.
2195 * For previous basic sets, we know that they do not contain a translate
2196 * of the inequality, so we directly call is_bound.
2197 * For following basic sets, we first check if a translate of the
2198 * inequality appears in its description. If so, the constant term
2199 * of the inequality has already been updated with respect to this
2200 * translate and the inequality is therefore known to be a bound
2201 * of this basic set.
2203 static __isl_give isl_basic_set
*add_bound(__isl_take isl_basic_set
*hull
,
2204 struct sh_data
*data
, __isl_keep isl_set
*set
, int i
, isl_int
*ineq
,
2208 struct ineq_cmp_data v
;
2209 struct isl_hash_table_entry
*entry
;
2213 total
= isl_basic_set_dim(hull
, isl_dim_all
);
2215 return isl_basic_set_free(hull
);
2219 c_hash
= isl_seq_get_hash(ineq
+ 1, v
.len
);
2221 entry
= isl_hash_table_find(hull
->ctx
, data
->hull_table
, c_hash
,
2226 for (j
= 0; j
< i
; ++j
) {
2227 entry
= isl_hash_table_find(hull
->ctx
, data
->p
[j
].table
,
2228 c_hash
, has_ineq
, &v
, 0);
2235 k
= isl_basic_set_alloc_inequality(hull
);
2238 isl_seq_cpy(hull
->ineq
[k
], ineq
, 1 + v
.len
);
2240 set_max_constant_term(data
, set
, i
, hull
->ineq
[k
], c_hash
, &v
);
2241 for (j
= 0; j
< i
; ++j
) {
2243 bound
= is_bound(data
, set
, j
, hull
->ineq
[k
], shift
);
2250 return isl_basic_set_free_inequality(hull
, 1);
2252 for (j
= i
+ 1; j
< set
->n
; ++j
) {
2254 entry
= isl_hash_table_find(hull
->ctx
, data
->p
[j
].table
,
2255 c_hash
, has_ineq
, &v
, 0);
2258 bound
= is_bound(data
, set
, j
, hull
->ineq
[k
], shift
);
2265 return isl_basic_set_free_inequality(hull
, 1);
2267 entry
= isl_hash_table_find(hull
->ctx
, data
->hull_table
, c_hash
,
2271 entry
->data
= hull
->ineq
[k
];
2275 isl_basic_set_free(hull
);
2279 /* Check if any inequality from basic set "i" is or can be relaxed to
2280 * become a bound on the whole set. If so, add the (relaxed) inequality
2281 * to "hull". Relaxation is only allowed if "shift" is set.
2283 static __isl_give isl_basic_set
*add_bounds(__isl_take isl_basic_set
*bset
,
2284 struct sh_data
*data
, __isl_keep isl_set
*set
, int i
, int shift
)
2287 isl_size dim
= isl_basic_set_dim(bset
, isl_dim_all
);
2290 return isl_basic_set_free(bset
);
2292 for (j
= 0; j
< set
->p
[i
]->n_eq
; ++j
) {
2293 for (k
= 0; k
< 2; ++k
) {
2294 isl_seq_neg(set
->p
[i
]->eq
[j
], set
->p
[i
]->eq
[j
], 1+dim
);
2295 bset
= add_bound(bset
, data
, set
, i
, set
->p
[i
]->eq
[j
],
2299 for (j
= 0; j
< set
->p
[i
]->n_ineq
; ++j
)
2300 bset
= add_bound(bset
, data
, set
, i
, set
->p
[i
]->ineq
[j
], shift
);
2304 /* Compute a superset of the convex hull of set that is described
2305 * by only (translates of) the constraints in the constituents of set.
2306 * Translation is only allowed if "shift" is set.
2308 static __isl_give isl_basic_set
*uset_simple_hull(__isl_take isl_set
*set
,
2311 struct sh_data
*data
= NULL
;
2312 struct isl_basic_set
*hull
= NULL
;
2320 for (i
= 0; i
< set
->n
; ++i
) {
2323 n_ineq
+= 2 * set
->p
[i
]->n_eq
+ set
->p
[i
]->n_ineq
;
2326 hull
= isl_basic_set_alloc_space(isl_space_copy(set
->dim
), 0, 0, n_ineq
);
2330 data
= sh_data_alloc(set
, n_ineq
);
2334 for (i
= 0; i
< set
->n
; ++i
)
2335 hull
= add_bounds(hull
, data
, set
, i
, shift
);
2343 isl_basic_set_free(hull
);
2348 /* Compute a superset of the convex hull of map that is described
2349 * by only (translates of) the constraints in the constituents of map.
2350 * Handle trivial cases where map is NULL or contains at most one disjunct.
2352 static __isl_give isl_basic_map
*map_simple_hull_trivial(
2353 __isl_take isl_map
*map
)
2355 isl_basic_map
*hull
;
2360 return replace_map_by_empty_basic_map(map
);
2362 hull
= isl_basic_map_copy(map
->p
[0]);
2367 /* Return a copy of the simple hull cached inside "map".
2368 * "shift" determines whether to return the cached unshifted or shifted
2371 static __isl_give isl_basic_map
*cached_simple_hull(__isl_take isl_map
*map
,
2374 isl_basic_map
*hull
;
2376 hull
= isl_basic_map_copy(map
->cached_simple_hull
[shift
]);
2382 /* Compute a superset of the convex hull of map that is described
2383 * by only (translates of) the constraints in the constituents of map.
2384 * Translation is only allowed if "shift" is set.
2386 * The constraints are sorted while removing redundant constraints
2387 * in order to indicate a preference of which constraints should
2388 * be preserved. In particular, pairs of constraints that are
2389 * sorted together are preferred to either both be preserved
2390 * or both be removed. The sorting is performed inside
2391 * isl_basic_map_remove_redundancies.
2393 * The result of the computation is stored in map->cached_simple_hull[shift]
2394 * such that it can be reused in subsequent calls. The cache is cleared
2395 * whenever the map is modified (in isl_map_cow).
2396 * Note that the results need to be stored in the input map for there
2397 * to be any chance that they may get reused. In particular, they
2398 * are stored in a copy of the input map that is saved before
2399 * the integer division alignment.
2401 static __isl_give isl_basic_map
*map_simple_hull(__isl_take isl_map
*map
,
2404 struct isl_set
*set
= NULL
;
2405 struct isl_basic_map
*model
= NULL
;
2406 struct isl_basic_map
*hull
;
2407 struct isl_basic_map
*affine_hull
;
2408 struct isl_basic_set
*bset
= NULL
;
2411 if (!map
|| map
->n
<= 1)
2412 return map_simple_hull_trivial(map
);
2414 if (map
->cached_simple_hull
[shift
])
2415 return cached_simple_hull(map
, shift
);
2417 map
= isl_map_detect_equalities(map
);
2418 if (!map
|| map
->n
<= 1)
2419 return map_simple_hull_trivial(map
);
2420 affine_hull
= isl_map_affine_hull(isl_map_copy(map
));
2421 input
= isl_map_copy(map
);
2422 map
= isl_map_align_divs_internal(map
);
2423 model
= map
? isl_basic_map_copy(map
->p
[0]) : NULL
;
2425 set
= isl_map_underlying_set(map
);
2427 bset
= uset_simple_hull(set
, shift
);
2429 hull
= isl_basic_map_overlying_set(bset
, model
);
2431 hull
= isl_basic_map_intersect(hull
, affine_hull
);
2432 hull
= isl_basic_map_remove_redundancies(hull
);
2435 ISL_F_SET(hull
, ISL_BASIC_MAP_NO_IMPLICIT
);
2436 ISL_F_SET(hull
, ISL_BASIC_MAP_ALL_EQUALITIES
);
2439 hull
= isl_basic_map_finalize(hull
);
2441 input
->cached_simple_hull
[shift
] = isl_basic_map_copy(hull
);
2442 isl_map_free(input
);
2447 /* Compute a superset of the convex hull of map that is described
2448 * by only translates of the constraints in the constituents of map.
2450 __isl_give isl_basic_map
*isl_map_simple_hull(__isl_take isl_map
*map
)
2452 return map_simple_hull(map
, 1);
2455 struct isl_basic_set
*isl_set_simple_hull(struct isl_set
*set
)
2457 return bset_from_bmap(isl_map_simple_hull(set_to_map(set
)));
2460 /* Compute a superset of the convex hull of map that is described
2461 * by only the constraints in the constituents of map.
2463 __isl_give isl_basic_map
*isl_map_unshifted_simple_hull(
2464 __isl_take isl_map
*map
)
2466 return map_simple_hull(map
, 0);
2469 __isl_give isl_basic_set
*isl_set_unshifted_simple_hull(
2470 __isl_take isl_set
*set
)
2472 return isl_map_unshifted_simple_hull(set
);
2475 /* Drop all inequalities from "bmap1" that do not also appear in "bmap2".
2476 * A constraint that appears with different constant terms
2477 * in "bmap1" and "bmap2" is also kept, with the least restrictive
2478 * (i.e., greatest) constant term.
2479 * "bmap1" and "bmap2" are assumed to have the same (known)
2480 * integer divisions.
2481 * The constraints of both "bmap1" and "bmap2" are assumed
2482 * to have been sorted using isl_basic_map_sort_constraints.
2484 * Run through the inequality constraints of "bmap1" and "bmap2"
2486 * Each constraint of "bmap1" without a matching constraint in "bmap2"
2488 * If a match is found, the constraint is kept. If needed, the constant
2489 * term of the constraint is adjusted.
2491 static __isl_give isl_basic_map
*select_shared_inequalities(
2492 __isl_take isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
2496 bmap1
= isl_basic_map_cow(bmap1
);
2497 if (!bmap1
|| !bmap2
)
2498 return isl_basic_map_free(bmap1
);
2500 i1
= bmap1
->n_ineq
- 1;
2501 i2
= bmap2
->n_ineq
- 1;
2502 while (bmap1
&& i1
>= 0 && i2
>= 0) {
2505 cmp
= isl_basic_map_constraint_cmp(bmap1
, bmap1
->ineq
[i1
],
2512 if (isl_basic_map_drop_inequality(bmap1
, i1
) < 0)
2513 bmap1
= isl_basic_map_free(bmap1
);
2517 if (isl_int_lt(bmap1
->ineq
[i1
][0], bmap2
->ineq
[i2
][0]))
2518 isl_int_set(bmap1
->ineq
[i1
][0], bmap2
->ineq
[i2
][0]);
2522 for (; i1
>= 0; --i1
)
2523 if (isl_basic_map_drop_inequality(bmap1
, i1
) < 0)
2524 bmap1
= isl_basic_map_free(bmap1
);
2529 /* Drop all equalities from "bmap1" that do not also appear in "bmap2".
2530 * "bmap1" and "bmap2" are assumed to have the same (known)
2531 * integer divisions.
2533 * Run through the equality constraints of "bmap1" and "bmap2".
2534 * Each constraint of "bmap1" without a matching constraint in "bmap2"
2537 static __isl_give isl_basic_map
*select_shared_equalities(
2538 __isl_take isl_basic_map
*bmap1
, __isl_keep isl_basic_map
*bmap2
)
2543 bmap1
= isl_basic_map_cow(bmap1
);
2544 total
= isl_basic_map_dim(bmap1
, isl_dim_all
);
2545 if (total
< 0 || !bmap2
)
2546 return isl_basic_map_free(bmap1
);
2548 i1
= bmap1
->n_eq
- 1;
2549 i2
= bmap2
->n_eq
- 1;
2550 while (bmap1
&& i1
>= 0 && i2
>= 0) {
2553 last1
= isl_seq_last_non_zero(bmap1
->eq
[i1
] + 1, total
);
2554 last2
= isl_seq_last_non_zero(bmap2
->eq
[i2
] + 1, total
);
2555 if (last1
> last2
) {
2559 if (last1
< last2
) {
2560 if (isl_basic_map_drop_equality(bmap1
, i1
) < 0)
2561 bmap1
= isl_basic_map_free(bmap1
);
2565 if (!isl_seq_eq(bmap1
->eq
[i1
], bmap2
->eq
[i2
], 1 + total
)) {
2566 if (isl_basic_map_drop_equality(bmap1
, i1
) < 0)
2567 bmap1
= isl_basic_map_free(bmap1
);
2572 for (; i1
>= 0; --i1
)
2573 if (isl_basic_map_drop_equality(bmap1
, i1
) < 0)
2574 bmap1
= isl_basic_map_free(bmap1
);
2579 /* Compute a superset of "bmap1" and "bmap2" that is described
2580 * by only the constraints that appear in both "bmap1" and "bmap2".
2582 * First drop constraints that involve unknown integer divisions
2583 * since it is not trivial to check whether two such integer divisions
2584 * in different basic maps are the same.
2585 * Then align the remaining (known) divs and sort the constraints.
2586 * Finally drop all inequalities and equalities from "bmap1" that
2587 * do not also appear in "bmap2".
2589 __isl_give isl_basic_map
*isl_basic_map_plain_unshifted_simple_hull(
2590 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
2592 bmap1
= isl_basic_map_drop_constraint_involving_unknown_divs(bmap1
);
2593 bmap2
= isl_basic_map_drop_constraint_involving_unknown_divs(bmap2
);
2594 bmap2
= isl_basic_map_align_divs(bmap2
, bmap1
);
2595 bmap1
= isl_basic_map_align_divs(bmap1
, bmap2
);
2596 bmap1
= isl_basic_map_gauss(bmap1
, NULL
);
2597 bmap2
= isl_basic_map_gauss(bmap2
, NULL
);
2598 bmap1
= isl_basic_map_sort_constraints(bmap1
);
2599 bmap2
= isl_basic_map_sort_constraints(bmap2
);
2601 bmap1
= select_shared_inequalities(bmap1
, bmap2
);
2602 bmap1
= select_shared_equalities(bmap1
, bmap2
);
2604 isl_basic_map_free(bmap2
);
2605 bmap1
= isl_basic_map_finalize(bmap1
);
2609 /* Compute a superset of the convex hull of "map" that is described
2610 * by only the constraints in the constituents of "map".
2611 * In particular, the result is composed of constraints that appear
2612 * in each of the basic maps of "map"
2614 * Constraints that involve unknown integer divisions are dropped
2615 * since it is not trivial to check whether two such integer divisions
2616 * in different basic maps are the same.
2618 * The hull is initialized from the first basic map and then
2619 * updated with respect to the other basic maps in turn.
2621 __isl_give isl_basic_map
*isl_map_plain_unshifted_simple_hull(
2622 __isl_take isl_map
*map
)
2625 isl_basic_map
*hull
;
2630 return map_simple_hull_trivial(map
);
2631 map
= isl_map_drop_constraint_involving_unknown_divs(map
);
2632 hull
= isl_basic_map_copy(map
->p
[0]);
2633 for (i
= 1; i
< map
->n
; ++i
) {
2634 isl_basic_map
*bmap_i
;
2636 bmap_i
= isl_basic_map_copy(map
->p
[i
]);
2637 hull
= isl_basic_map_plain_unshifted_simple_hull(hull
, bmap_i
);
2644 /* Compute a superset of the convex hull of "set" that is described
2645 * by only the constraints in the constituents of "set".
2646 * In particular, the result is composed of constraints that appear
2647 * in each of the basic sets of "set"
2649 __isl_give isl_basic_set
*isl_set_plain_unshifted_simple_hull(
2650 __isl_take isl_set
*set
)
2652 return isl_map_plain_unshifted_simple_hull(set
);
2655 /* Check if "ineq" is a bound on "set" and, if so, add it to "hull".
2657 * For each basic set in "set", we first check if the basic set
2658 * contains a translate of "ineq". If this translate is more relaxed,
2659 * then we assume that "ineq" is not a bound on this basic set.
2660 * Otherwise, we know that it is a bound.
2661 * If the basic set does not contain a translate of "ineq", then
2662 * we call is_bound to perform the test.
2664 static __isl_give isl_basic_set
*add_bound_from_constraint(
2665 __isl_take isl_basic_set
*hull
, struct sh_data
*data
,
2666 __isl_keep isl_set
*set
, isl_int
*ineq
)
2671 struct ineq_cmp_data v
;
2674 total
= isl_basic_set_dim(hull
, isl_dim_all
);
2675 if (total
< 0 || !set
)
2676 return isl_basic_set_free(hull
);
2680 c_hash
= isl_seq_get_hash(ineq
+ 1, v
.len
);
2682 ctx
= isl_basic_set_get_ctx(hull
);
2683 for (i
= 0; i
< set
->n
; ++i
) {
2685 struct isl_hash_table_entry
*entry
;
2687 entry
= isl_hash_table_find(ctx
, data
->p
[i
].table
,
2688 c_hash
, &has_ineq
, &v
, 0);
2690 isl_int
*ineq_i
= entry
->data
;
2691 int neg
, more_relaxed
;
2693 neg
= isl_seq_is_neg(ineq_i
+ 1, ineq
+ 1, v
.len
);
2695 isl_int_neg(ineq_i
[0], ineq_i
[0]);
2696 more_relaxed
= isl_int_gt(ineq_i
[0], ineq
[0]);
2698 isl_int_neg(ineq_i
[0], ineq_i
[0]);
2704 bound
= is_bound(data
, set
, i
, ineq
, 0);
2706 return isl_basic_set_free(hull
);
2713 k
= isl_basic_set_alloc_inequality(hull
);
2715 return isl_basic_set_free(hull
);
2716 isl_seq_cpy(hull
->ineq
[k
], ineq
, 1 + v
.len
);
2721 /* Compute a superset of the convex hull of "set" that is described
2722 * by only some of the "n_ineq" constraints in the list "ineq", where "set"
2723 * has no parameters or integer divisions.
2725 * The inequalities in "ineq" are assumed to have been sorted such
2726 * that constraints with the same linear part appear together and
2727 * that among constraints with the same linear part, those with
2728 * smaller constant term appear first.
2730 * We reuse the same data structure that is used by uset_simple_hull,
2731 * but we do not need the hull table since we will not consider the
2732 * same constraint more than once. We therefore allocate it with zero size.
2734 * We run through the constraints and try to add them one by one,
2735 * skipping identical constraints. If we have added a constraint and
2736 * the next constraint is a more relaxed translate, then we skip this
2737 * next constraint as well.
2739 static __isl_give isl_basic_set
*uset_unshifted_simple_hull_from_constraints(
2740 __isl_take isl_set
*set
, int n_ineq
, isl_int
**ineq
)
2744 struct sh_data
*data
= NULL
;
2745 isl_basic_set
*hull
= NULL
;
2748 hull
= isl_basic_set_alloc_space(isl_set_get_space(set
), 0, 0, n_ineq
);
2752 data
= sh_data_alloc(set
, 0);
2756 dim
= isl_set_dim(set
, isl_dim_set
);
2759 for (i
= 0; i
< n_ineq
; ++i
) {
2760 int hull_n_ineq
= hull
->n_ineq
;
2763 parallel
= i
> 0 && isl_seq_eq(ineq
[i
- 1] + 1, ineq
[i
] + 1,
2766 (last_added
|| isl_int_eq(ineq
[i
- 1][0], ineq
[i
][0])))
2768 hull
= add_bound_from_constraint(hull
, data
, set
, ineq
[i
]);
2771 last_added
= hull
->n_ineq
> hull_n_ineq
;
2780 isl_basic_set_free(hull
);
2784 /* Collect pointers to all the inequalities in the elements of "list"
2785 * in "ineq". For equalities, store both a pointer to the equality and
2786 * a pointer to its opposite, which is first copied to "mat".
2787 * "ineq" and "mat" are assumed to have been preallocated to the right size
2788 * (the number of inequalities + 2 times the number of equalites and
2789 * the number of equalities, respectively).
2791 static __isl_give isl_mat
*collect_inequalities(__isl_take isl_mat
*mat
,
2792 __isl_keep isl_basic_set_list
*list
, isl_int
**ineq
)
2794 int i
, j
, n_eq
, n_ineq
;
2797 n
= isl_basic_set_list_n_basic_set(list
);
2799 return isl_mat_free(mat
);
2803 for (i
= 0; i
< n
; ++i
) {
2804 isl_basic_set
*bset
;
2805 bset
= isl_basic_set_list_get_basic_set(list
, i
);
2807 return isl_mat_free(mat
);
2808 for (j
= 0; j
< bset
->n_eq
; ++j
) {
2809 ineq
[n_ineq
++] = mat
->row
[n_eq
];
2810 ineq
[n_ineq
++] = bset
->eq
[j
];
2811 isl_seq_neg(mat
->row
[n_eq
++], bset
->eq
[j
], mat
->n_col
);
2813 for (j
= 0; j
< bset
->n_ineq
; ++j
)
2814 ineq
[n_ineq
++] = bset
->ineq
[j
];
2815 isl_basic_set_free(bset
);
2821 /* Comparison routine for use as an isl_sort callback.
2823 * Constraints with the same linear part are sorted together and
2824 * among constraints with the same linear part, those with smaller
2825 * constant term are sorted first.
2827 static int cmp_ineq(const void *a
, const void *b
, void *arg
)
2829 unsigned dim
= *(unsigned *) arg
;
2830 isl_int
* const *ineq1
= a
;
2831 isl_int
* const *ineq2
= b
;
2834 cmp
= isl_seq_cmp((*ineq1
) + 1, (*ineq2
) + 1, dim
);
2837 return isl_int_cmp((*ineq1
)[0], (*ineq2
)[0]);
2840 /* Compute a superset of the convex hull of "set" that is described
2841 * by only constraints in the elements of "list", where "set" has
2842 * no parameters or integer divisions.
2844 * We collect all the constraints in those elements and then
2845 * sort the constraints such that constraints with the same linear part
2846 * are sorted together and that those with smaller constant term are
2849 static __isl_give isl_basic_set
*uset_unshifted_simple_hull_from_basic_set_list(
2850 __isl_take isl_set
*set
, __isl_take isl_basic_set_list
*list
)
2852 int i
, n_eq
, n_ineq
;
2856 isl_mat
*mat
= NULL
;
2857 isl_int
**ineq
= NULL
;
2858 isl_basic_set
*hull
;
2860 n
= isl_basic_set_list_n_basic_set(list
);
2863 ctx
= isl_set_get_ctx(set
);
2867 for (i
= 0; i
< n
; ++i
) {
2868 isl_basic_set
*bset
;
2869 bset
= isl_basic_set_list_get_basic_set(list
, i
);
2873 n_ineq
+= 2 * bset
->n_eq
+ bset
->n_ineq
;
2874 isl_basic_set_free(bset
);
2877 ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
);
2878 if (n_ineq
> 0 && !ineq
)
2881 dim
= isl_set_dim(set
, isl_dim_set
);
2884 mat
= isl_mat_alloc(ctx
, n_eq
, 1 + dim
);
2885 mat
= collect_inequalities(mat
, list
, ineq
);
2889 if (isl_sort(ineq
, n_ineq
, sizeof(ineq
[0]), &cmp_ineq
, &dim
) < 0)
2892 hull
= uset_unshifted_simple_hull_from_constraints(set
, n_ineq
, ineq
);
2896 isl_basic_set_list_free(list
);
2902 isl_basic_set_list_free(list
);
2906 /* Compute a superset of the convex hull of "map" that is described
2907 * by only constraints in the elements of "list".
2909 * If the list is empty, then we can only describe the universe set.
2910 * If the input map is empty, then all constraints are valid, so
2911 * we return the intersection of the elements in "list".
2913 * Otherwise, we align all divs and temporarily treat them
2914 * as regular variables, computing the unshifted simple hull in
2915 * uset_unshifted_simple_hull_from_basic_set_list.
2917 static __isl_give isl_basic_map
*map_unshifted_simple_hull_from_basic_map_list(
2918 __isl_take isl_map
*map
, __isl_take isl_basic_map_list
*list
)
2921 isl_basic_map
*model
;
2922 isl_basic_map
*hull
;
2924 isl_basic_set_list
*bset_list
;
2926 n
= isl_basic_map_list_n_basic_map(list
);
2933 space
= isl_map_get_space(map
);
2935 isl_basic_map_list_free(list
);
2936 return isl_basic_map_universe(space
);
2938 if (isl_map_plain_is_empty(map
)) {
2940 return isl_basic_map_list_intersect(list
);
2943 map
= isl_map_align_divs_to_basic_map_list(map
, list
);
2946 list
= isl_basic_map_list_align_divs_to_basic_map(list
, map
->p
[0]);
2948 model
= isl_basic_map_list_get_basic_map(list
, 0);
2950 set
= isl_map_underlying_set(map
);
2951 bset_list
= isl_basic_map_list_underlying_set(list
);
2953 hull
= uset_unshifted_simple_hull_from_basic_set_list(set
, bset_list
);
2954 hull
= isl_basic_map_overlying_set(hull
, model
);
2959 isl_basic_map_list_free(list
);
2963 /* Return a sequence of the basic maps that make up the maps in "list".
2965 static __isl_give isl_basic_map_list
*collect_basic_maps(
2966 __isl_take isl_map_list
*list
)
2971 isl_basic_map_list
*bmap_list
;
2975 n
= isl_map_list_n_map(list
);
2976 ctx
= isl_map_list_get_ctx(list
);
2977 bmap_list
= isl_basic_map_list_alloc(ctx
, 0);
2979 bmap_list
= isl_basic_map_list_free(bmap_list
);
2981 for (i
= 0; i
< n
; ++i
) {
2983 isl_basic_map_list
*list_i
;
2985 map
= isl_map_list_get_map(list
, i
);
2986 map
= isl_map_compute_divs(map
);
2987 list_i
= isl_map_get_basic_map_list(map
);
2989 bmap_list
= isl_basic_map_list_concat(bmap_list
, list_i
);
2992 isl_map_list_free(list
);
2996 /* Compute a superset of the convex hull of "map" that is described
2997 * by only constraints in the elements of "list".
2999 * If "map" is the universe, then the convex hull (and therefore
3000 * any superset of the convexhull) is the universe as well.
3002 * Otherwise, we collect all the basic maps in the map list and
3003 * continue with map_unshifted_simple_hull_from_basic_map_list.
3005 __isl_give isl_basic_map
*isl_map_unshifted_simple_hull_from_map_list(
3006 __isl_take isl_map
*map
, __isl_take isl_map_list
*list
)
3008 isl_basic_map_list
*bmap_list
;
3011 is_universe
= isl_map_plain_is_universe(map
);
3012 if (is_universe
< 0)
3013 map
= isl_map_free(map
);
3014 if (is_universe
< 0 || is_universe
) {
3015 isl_map_list_free(list
);
3016 return isl_map_unshifted_simple_hull(map
);
3019 bmap_list
= collect_basic_maps(list
);
3020 return map_unshifted_simple_hull_from_basic_map_list(map
, bmap_list
);
3023 /* Compute a superset of the convex hull of "set" that is described
3024 * by only constraints in the elements of "list".
3026 __isl_give isl_basic_set
*isl_set_unshifted_simple_hull_from_set_list(
3027 __isl_take isl_set
*set
, __isl_take isl_set_list
*list
)
3029 return isl_map_unshifted_simple_hull_from_map_list(set
, list
);
3032 /* Given a set "set", return parametric bounds on the dimension "dim".
3034 static __isl_give isl_basic_set
*set_bounds(__isl_keep isl_set
*set
, int dim
)
3036 isl_size set_dim
= isl_set_dim(set
, isl_dim_set
);
3039 set
= isl_set_copy(set
);
3040 set
= isl_set_eliminate_dims(set
, dim
+ 1, set_dim
- (dim
+ 1));
3041 set
= isl_set_eliminate_dims(set
, 0, dim
);
3042 return isl_set_convex_hull(set
);
3045 /* Computes a "simple hull" and then check if each dimension in the
3046 * resulting hull is bounded by a symbolic constant. If not, the
3047 * hull is intersected with the corresponding bounds on the whole set.
3049 __isl_give isl_basic_set
*isl_set_bounded_simple_hull(__isl_take isl_set
*set
)
3052 struct isl_basic_set
*hull
;
3053 isl_size nparam
, dim
, total
;
3055 int removed_divs
= 0;
3057 hull
= isl_set_simple_hull(isl_set_copy(set
));
3058 nparam
= isl_basic_set_dim(hull
, isl_dim_param
);
3059 dim
= isl_basic_set_dim(hull
, isl_dim_set
);
3060 total
= isl_basic_set_dim(hull
, isl_dim_all
);
3061 if (nparam
< 0 || dim
< 0 || total
< 0)
3064 for (i
= 0; i
< dim
; ++i
) {
3065 int lower
= 0, upper
= 0;
3066 struct isl_basic_set
*bounds
;
3068 left
= total
- nparam
- i
- 1;
3069 for (j
= 0; j
< hull
->n_eq
; ++j
) {
3070 if (isl_int_is_zero(hull
->eq
[j
][1 + nparam
+ i
]))
3072 if (isl_seq_first_non_zero(hull
->eq
[j
]+1+nparam
+i
+1,
3079 for (j
= 0; j
< hull
->n_ineq
; ++j
) {
3080 if (isl_int_is_zero(hull
->ineq
[j
][1 + nparam
+ i
]))
3082 if (isl_seq_first_non_zero(hull
->ineq
[j
]+1+nparam
+i
+1,
3084 isl_seq_first_non_zero(hull
->ineq
[j
]+1+nparam
,
3087 if (isl_int_is_pos(hull
->ineq
[j
][1 + nparam
+ i
]))
3098 if (!removed_divs
) {
3099 set
= isl_set_remove_divs(set
);
3104 bounds
= set_bounds(set
, i
);
3105 hull
= isl_basic_set_intersect(hull
, bounds
);
3114 isl_basic_set_free(hull
);