2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2012 Ecole Normale Superieure
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 Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
13 #include <isl_ctx_private.h>
14 #include <isl_map_private.h>
15 #include "isl_equalities.h"
19 #include <isl_space_private.h>
20 #include <isl_mat_private.h>
22 static void swap_equality(struct isl_basic_map *bmap, int a, int b)
24 isl_int *t = bmap->eq[a];
25 bmap->eq[a] = bmap->eq[b];
29 static void swap_inequality(struct isl_basic_map *bmap, int a, int b)
32 isl_int *t = bmap->ineq[a];
33 bmap->ineq[a] = bmap->ineq[b];
38 static void constraint_drop_vars(isl_int *c, unsigned n, unsigned rem)
40 isl_seq_cpy(c, c + n, rem);
41 isl_seq_clr(c + rem, n);
44 /* Drop n dimensions starting at first.
46 * In principle, this frees up some extra variables as the number
47 * of columns remains constant, but we would have to extend
48 * the div array too as the number of rows in this array is assumed
49 * to be equal to extra.
51 struct isl_basic_set *isl_basic_set_drop_dims(
52 struct isl_basic_set *bset, unsigned first, unsigned n)
59 isl_assert(bset->ctx, first + n <= bset->dim->n_out, goto error);
61 if (n == 0 && !isl_space_get_tuple_name(bset->dim, isl_dim_set))
64 bset = isl_basic_set_cow(bset);
68 for (i = 0; i < bset->n_eq; ++i)
69 constraint_drop_vars(bset->eq[i]+1+bset->dim->nparam+first, n,
70 (bset->dim->n_out-first-n)+bset->extra);
72 for (i = 0; i < bset->n_ineq; ++i)
73 constraint_drop_vars(bset->ineq[i]+1+bset->dim->nparam+first, n,
74 (bset->dim->n_out-first-n)+bset->extra);
76 for (i = 0; i < bset->n_div; ++i)
77 constraint_drop_vars(bset->div[i]+1+1+bset->dim->nparam+first, n,
78 (bset->dim->n_out-first-n)+bset->extra);
80 bset->dim = isl_space_drop_outputs(bset->dim, first, n);
84 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
85 bset = isl_basic_set_simplify(bset);
86 return isl_basic_set_finalize(bset);
88 isl_basic_set_free(bset);
92 struct isl_set *isl_set_drop_dims(
93 struct isl_set *set, unsigned first, unsigned n)
100 isl_assert(set->ctx, first + n <= set->dim->n_out, goto error);
102 if (n == 0 && !isl_space_get_tuple_name(set->dim, isl_dim_set))
104 set = isl_set_cow(set);
107 set->dim = isl_space_drop_outputs(set->dim, first, n);
111 for (i = 0; i < set->n; ++i) {
112 set->p[i] = isl_basic_set_drop_dims(set->p[i], first, n);
117 ISL_F_CLR(set, ISL_SET_NORMALIZED);
124 /* Move "n" divs starting at "first" to the end of the list of divs.
126 static struct isl_basic_map *move_divs_last(struct isl_basic_map *bmap,
127 unsigned first, unsigned n)
132 if (first + n == bmap->n_div)
135 div = isl_alloc_array(bmap->ctx, isl_int *, n);
138 for (i = 0; i < n; ++i)
139 div[i] = bmap->div[first + i];
140 for (i = 0; i < bmap->n_div - first - n; ++i)
141 bmap->div[first + i] = bmap->div[first + n + i];
142 for (i = 0; i < n; ++i)
143 bmap->div[bmap->n_div - n + i] = div[i];
147 isl_basic_map_free(bmap);
151 /* Drop "n" dimensions of type "type" starting at "first".
153 * In principle, this frees up some extra variables as the number
154 * of columns remains constant, but we would have to extend
155 * the div array too as the number of rows in this array is assumed
156 * to be equal to extra.
158 struct isl_basic_map *isl_basic_map_drop(struct isl_basic_map *bmap,
159 enum isl_dim_type type, unsigned first, unsigned n)
169 dim = isl_basic_map_dim(bmap, type);
170 isl_assert(bmap->ctx, first + n <= dim, goto error);
172 if (n == 0 && !isl_space_is_named_or_nested(bmap->dim, type))
175 bmap = isl_basic_map_cow(bmap);
179 offset = isl_basic_map_offset(bmap, type) + first;
180 left = isl_basic_map_total_dim(bmap) - (offset - 1) - n;
181 for (i = 0; i < bmap->n_eq; ++i)
182 constraint_drop_vars(bmap->eq[i]+offset, n, left);
184 for (i = 0; i < bmap->n_ineq; ++i)
185 constraint_drop_vars(bmap->ineq[i]+offset, n, left);
187 for (i = 0; i < bmap->n_div; ++i)
188 constraint_drop_vars(bmap->div[i]+1+offset, n, left);
190 if (type == isl_dim_div) {
191 bmap = move_divs_last(bmap, first, n);
194 isl_basic_map_free_div(bmap, n);
196 bmap->dim = isl_space_drop_dims(bmap->dim, type, first, n);
200 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
201 bmap = isl_basic_map_simplify(bmap);
202 return isl_basic_map_finalize(bmap);
204 isl_basic_map_free(bmap);
208 __isl_give isl_basic_set *isl_basic_set_drop(__isl_take isl_basic_set *bset,
209 enum isl_dim_type type, unsigned first, unsigned n)
211 return (isl_basic_set *)isl_basic_map_drop((isl_basic_map *)bset,
215 struct isl_basic_map *isl_basic_map_drop_inputs(
216 struct isl_basic_map *bmap, unsigned first, unsigned n)
218 return isl_basic_map_drop(bmap, isl_dim_in, first, n);
221 struct isl_map *isl_map_drop(struct isl_map *map,
222 enum isl_dim_type type, unsigned first, unsigned n)
229 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
231 if (n == 0 && !isl_space_get_tuple_name(map->dim, type))
233 map = isl_map_cow(map);
236 map->dim = isl_space_drop_dims(map->dim, type, first, n);
240 for (i = 0; i < map->n; ++i) {
241 map->p[i] = isl_basic_map_drop(map->p[i], type, first, n);
245 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
253 struct isl_set *isl_set_drop(struct isl_set *set,
254 enum isl_dim_type type, unsigned first, unsigned n)
256 return (isl_set *)isl_map_drop((isl_map *)set, type, first, n);
259 struct isl_map *isl_map_drop_inputs(
260 struct isl_map *map, unsigned first, unsigned n)
262 return isl_map_drop(map, isl_dim_in, first, n);
266 * We don't cow, as the div is assumed to be redundant.
268 static struct isl_basic_map *isl_basic_map_drop_div(
269 struct isl_basic_map *bmap, unsigned div)
277 pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div;
279 isl_assert(bmap->ctx, div < bmap->n_div, goto error);
281 for (i = 0; i < bmap->n_eq; ++i)
282 constraint_drop_vars(bmap->eq[i]+pos, 1, bmap->extra-div-1);
284 for (i = 0; i < bmap->n_ineq; ++i) {
285 if (!isl_int_is_zero(bmap->ineq[i][pos])) {
286 isl_basic_map_drop_inequality(bmap, i);
290 constraint_drop_vars(bmap->ineq[i]+pos, 1, bmap->extra-div-1);
293 for (i = 0; i < bmap->n_div; ++i)
294 constraint_drop_vars(bmap->div[i]+1+pos, 1, bmap->extra-div-1);
296 if (div != bmap->n_div - 1) {
298 isl_int *t = bmap->div[div];
300 for (j = div; j < bmap->n_div - 1; ++j)
301 bmap->div[j] = bmap->div[j+1];
303 bmap->div[bmap->n_div - 1] = t;
305 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
306 isl_basic_map_free_div(bmap, 1);
310 isl_basic_map_free(bmap);
314 struct isl_basic_map *isl_basic_map_normalize_constraints(
315 struct isl_basic_map *bmap)
319 unsigned total = isl_basic_map_total_dim(bmap);
325 for (i = bmap->n_eq - 1; i >= 0; --i) {
326 isl_seq_gcd(bmap->eq[i]+1, total, &gcd);
327 if (isl_int_is_zero(gcd)) {
328 if (!isl_int_is_zero(bmap->eq[i][0])) {
329 bmap = isl_basic_map_set_to_empty(bmap);
332 isl_basic_map_drop_equality(bmap, i);
335 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
336 isl_int_gcd(gcd, gcd, bmap->eq[i][0]);
337 if (isl_int_is_one(gcd))
339 if (!isl_int_is_divisible_by(bmap->eq[i][0], gcd)) {
340 bmap = isl_basic_map_set_to_empty(bmap);
343 isl_seq_scale_down(bmap->eq[i], bmap->eq[i], gcd, 1+total);
346 for (i = bmap->n_ineq - 1; i >= 0; --i) {
347 isl_seq_gcd(bmap->ineq[i]+1, total, &gcd);
348 if (isl_int_is_zero(gcd)) {
349 if (isl_int_is_neg(bmap->ineq[i][0])) {
350 bmap = isl_basic_map_set_to_empty(bmap);
353 isl_basic_map_drop_inequality(bmap, i);
356 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
357 isl_int_gcd(gcd, gcd, bmap->ineq[i][0]);
358 if (isl_int_is_one(gcd))
360 isl_int_fdiv_q(bmap->ineq[i][0], bmap->ineq[i][0], gcd);
361 isl_seq_scale_down(bmap->ineq[i]+1, bmap->ineq[i]+1, gcd, total);
368 struct isl_basic_set *isl_basic_set_normalize_constraints(
369 struct isl_basic_set *bset)
371 return (struct isl_basic_set *)isl_basic_map_normalize_constraints(
372 (struct isl_basic_map *)bset);
375 /* Remove any common factor in numerator and denominator of the div expression,
376 * not taking into account the constant term.
377 * That is, if the div is of the form
379 * floor((a + m f(x))/(m d))
383 * floor((floor(a/m) + f(x))/d)
385 * The difference {a/m}/d in the argument satisfies 0 <= {a/m}/d < 1/d
386 * and can therefore not influence the result of the floor.
388 static void normalize_div_expression(__isl_keep isl_basic_map *bmap, int div)
390 unsigned total = isl_basic_map_total_dim(bmap);
391 isl_ctx *ctx = bmap->ctx;
393 if (isl_int_is_zero(bmap->div[div][0]))
395 isl_seq_gcd(bmap->div[div] + 2, total, &ctx->normalize_gcd);
396 isl_int_gcd(ctx->normalize_gcd, ctx->normalize_gcd, bmap->div[div][0]);
397 if (isl_int_is_one(ctx->normalize_gcd))
399 isl_int_fdiv_q(bmap->div[div][1], bmap->div[div][1],
401 isl_int_divexact(bmap->div[div][0], bmap->div[div][0],
403 isl_seq_scale_down(bmap->div[div] + 2, bmap->div[div] + 2,
404 ctx->normalize_gcd, total);
407 /* Remove any common factor in numerator and denominator of a div expression,
408 * not taking into account the constant term.
409 * That is, look for any div of the form
411 * floor((a + m f(x))/(m d))
415 * floor((floor(a/m) + f(x))/d)
417 * The difference {a/m}/d in the argument satisfies 0 <= {a/m}/d < 1/d
418 * and can therefore not influence the result of the floor.
420 static __isl_give isl_basic_map *normalize_div_expressions(
421 __isl_take isl_basic_map *bmap)
427 if (bmap->n_div == 0)
430 for (i = 0; i < bmap->n_div; ++i)
431 normalize_div_expression(bmap, i);
436 /* Assumes divs have been ordered if keep_divs is set.
438 static void eliminate_var_using_equality(struct isl_basic_map *bmap,
439 unsigned pos, isl_int *eq, int keep_divs, int *progress)
442 unsigned space_total;
446 total = isl_basic_map_total_dim(bmap);
447 space_total = isl_space_dim(bmap->dim, isl_dim_all);
448 last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div);
449 for (k = 0; k < bmap->n_eq; ++k) {
450 if (bmap->eq[k] == eq)
452 if (isl_int_is_zero(bmap->eq[k][1+pos]))
456 isl_seq_elim(bmap->eq[k], eq, 1+pos, 1+total, NULL);
457 isl_seq_normalize(bmap->ctx, bmap->eq[k], 1 + total);
460 for (k = 0; k < bmap->n_ineq; ++k) {
461 if (isl_int_is_zero(bmap->ineq[k][1+pos]))
465 isl_seq_elim(bmap->ineq[k], eq, 1+pos, 1+total, NULL);
466 isl_seq_normalize(bmap->ctx, bmap->ineq[k], 1 + total);
467 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
470 for (k = 0; k < bmap->n_div; ++k) {
471 if (isl_int_is_zero(bmap->div[k][0]))
473 if (isl_int_is_zero(bmap->div[k][1+1+pos]))
477 /* We need to be careful about circular definitions,
478 * so for now we just remove the definition of div k
479 * if the equality contains any divs.
480 * If keep_divs is set, then the divs have been ordered
481 * and we can keep the definition as long as the result
484 if (last_div == -1 || (keep_divs && last_div < k)) {
485 isl_seq_elim(bmap->div[k]+1, eq,
486 1+pos, 1+total, &bmap->div[k][0]);
487 normalize_div_expression(bmap, k);
489 isl_seq_clr(bmap->div[k], 1 + total);
490 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
494 /* Assumes divs have been ordered if keep_divs is set.
496 static void eliminate_div(struct isl_basic_map *bmap, isl_int *eq,
497 unsigned div, int keep_divs)
499 unsigned pos = isl_space_dim(bmap->dim, isl_dim_all) + div;
501 eliminate_var_using_equality(bmap, pos, eq, keep_divs, NULL);
503 isl_basic_map_drop_div(bmap, div);
506 /* Check if elimination of div "div" using equality "eq" would not
507 * result in a div depending on a later div.
509 static int ok_to_eliminate_div(struct isl_basic_map *bmap, isl_int *eq,
514 unsigned space_total = isl_space_dim(bmap->dim, isl_dim_all);
515 unsigned pos = space_total + div;
517 last_div = isl_seq_last_non_zero(eq + 1 + space_total, bmap->n_div);
518 if (last_div < 0 || last_div <= div)
521 for (k = 0; k <= last_div; ++k) {
522 if (isl_int_is_zero(bmap->div[k][0]))
524 if (!isl_int_is_zero(bmap->div[k][1 + 1 + pos]))
531 /* Elimininate divs based on equalities
533 static struct isl_basic_map *eliminate_divs_eq(
534 struct isl_basic_map *bmap, int *progress)
541 bmap = isl_basic_map_order_divs(bmap);
546 off = 1 + isl_space_dim(bmap->dim, isl_dim_all);
548 for (d = bmap->n_div - 1; d >= 0 ; --d) {
549 for (i = 0; i < bmap->n_eq; ++i) {
550 if (!isl_int_is_one(bmap->eq[i][off + d]) &&
551 !isl_int_is_negone(bmap->eq[i][off + d]))
553 if (!ok_to_eliminate_div(bmap, bmap->eq[i], d))
557 eliminate_div(bmap, bmap->eq[i], d, 1);
558 isl_basic_map_drop_equality(bmap, i);
563 return eliminate_divs_eq(bmap, progress);
567 /* Elimininate divs based on inequalities
569 static struct isl_basic_map *eliminate_divs_ineq(
570 struct isl_basic_map *bmap, int *progress)
581 off = 1 + isl_space_dim(bmap->dim, isl_dim_all);
583 for (d = bmap->n_div - 1; d >= 0 ; --d) {
584 for (i = 0; i < bmap->n_eq; ++i)
585 if (!isl_int_is_zero(bmap->eq[i][off + d]))
589 for (i = 0; i < bmap->n_ineq; ++i)
590 if (isl_int_abs_gt(bmap->ineq[i][off + d], ctx->one))
592 if (i < bmap->n_ineq)
595 bmap = isl_basic_map_eliminate_vars(bmap, (off-1)+d, 1);
596 if (!bmap || ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
598 bmap = isl_basic_map_drop_div(bmap, d);
605 struct isl_basic_map *isl_basic_map_gauss(
606 struct isl_basic_map *bmap, int *progress)
614 bmap = isl_basic_map_order_divs(bmap);
619 total = isl_basic_map_total_dim(bmap);
620 total_var = total - bmap->n_div;
622 last_var = total - 1;
623 for (done = 0; done < bmap->n_eq; ++done) {
624 for (; last_var >= 0; --last_var) {
625 for (k = done; k < bmap->n_eq; ++k)
626 if (!isl_int_is_zero(bmap->eq[k][1+last_var]))
634 swap_equality(bmap, k, done);
635 if (isl_int_is_neg(bmap->eq[done][1+last_var]))
636 isl_seq_neg(bmap->eq[done], bmap->eq[done], 1+total);
638 eliminate_var_using_equality(bmap, last_var, bmap->eq[done], 1,
641 if (last_var >= total_var &&
642 isl_int_is_zero(bmap->div[last_var - total_var][0])) {
643 unsigned div = last_var - total_var;
644 isl_seq_neg(bmap->div[div]+1, bmap->eq[done], 1+total);
645 isl_int_set_si(bmap->div[div][1+1+last_var], 0);
646 isl_int_set(bmap->div[div][0],
647 bmap->eq[done][1+last_var]);
648 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
651 if (done == bmap->n_eq)
653 for (k = done; k < bmap->n_eq; ++k) {
654 if (isl_int_is_zero(bmap->eq[k][0]))
656 return isl_basic_map_set_to_empty(bmap);
658 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
662 struct isl_basic_set *isl_basic_set_gauss(
663 struct isl_basic_set *bset, int *progress)
665 return (struct isl_basic_set*)isl_basic_map_gauss(
666 (struct isl_basic_map *)bset, progress);
670 static unsigned int round_up(unsigned int v)
681 static int hash_index(isl_int ***index, unsigned int size, int bits,
682 struct isl_basic_map *bmap, int k)
685 unsigned total = isl_basic_map_total_dim(bmap);
686 uint32_t hash = isl_seq_get_hash_bits(bmap->ineq[k]+1, total, bits);
687 for (h = hash; index[h]; h = (h+1) % size)
688 if (&bmap->ineq[k] != index[h] &&
689 isl_seq_eq(bmap->ineq[k]+1, index[h][0]+1, total))
694 static int set_hash_index(isl_int ***index, unsigned int size, int bits,
695 struct isl_basic_set *bset, int k)
697 return hash_index(index, size, bits, (struct isl_basic_map *)bset, k);
700 /* If we can eliminate more than one div, then we need to make
701 * sure we do it from last div to first div, in order not to
702 * change the position of the other divs that still need to
705 static struct isl_basic_map *remove_duplicate_divs(
706 struct isl_basic_map *bmap, int *progress)
718 if (!bmap || bmap->n_div <= 1)
721 total_var = isl_space_dim(bmap->dim, isl_dim_all);
722 total = total_var + bmap->n_div;
725 for (k = bmap->n_div - 1; k >= 0; --k)
726 if (!isl_int_is_zero(bmap->div[k][0]))
731 elim_for = isl_calloc_array(ctx, int, bmap->n_div);
732 size = round_up(4 * bmap->n_div / 3 - 1);
733 bits = ffs(size) - 1;
734 index = isl_calloc_array(ctx, int, size);
737 eq = isl_blk_alloc(ctx, 1+total);
738 if (isl_blk_is_error(eq))
741 isl_seq_clr(eq.data, 1+total);
742 index[isl_seq_get_hash_bits(bmap->div[k], 2+total, bits)] = k + 1;
743 for (--k; k >= 0; --k) {
746 if (isl_int_is_zero(bmap->div[k][0]))
749 hash = isl_seq_get_hash_bits(bmap->div[k], 2+total, bits);
750 for (h = hash; index[h]; h = (h+1) % size)
751 if (isl_seq_eq(bmap->div[k],
752 bmap->div[index[h]-1], 2+total))
761 for (l = bmap->n_div - 1; l >= 0; --l) {
765 isl_int_set_si(eq.data[1+total_var+k], -1);
766 isl_int_set_si(eq.data[1+total_var+l], 1);
767 eliminate_div(bmap, eq.data, l, 0);
768 isl_int_set_si(eq.data[1+total_var+k], 0);
769 isl_int_set_si(eq.data[1+total_var+l], 0);
772 isl_blk_free(ctx, eq);
779 static int n_pure_div_eq(struct isl_basic_map *bmap)
784 total = isl_space_dim(bmap->dim, isl_dim_all);
785 for (i = 0, j = bmap->n_div-1; i < bmap->n_eq; ++i) {
786 while (j >= 0 && isl_int_is_zero(bmap->eq[i][1 + total + j]))
790 if (isl_seq_first_non_zero(bmap->eq[i] + 1 + total, j) != -1)
796 /* Normalize divs that appear in equalities.
798 * In particular, we assume that bmap contains some equalities
803 * and we want to replace the set of e_i by a minimal set and
804 * such that the new e_i have a canonical representation in terms
806 * If any of the equalities involves more than one divs, then
807 * we currently simply bail out.
809 * Let us first additionally assume that all equalities involve
810 * a div. The equalities then express modulo constraints on the
811 * remaining variables and we can use "parameter compression"
812 * to find a minimal set of constraints. The result is a transformation
814 * x = T(x') = x_0 + G x'
816 * with G a lower-triangular matrix with all elements below the diagonal
817 * non-negative and smaller than the diagonal element on the same row.
818 * We first normalize x_0 by making the same property hold in the affine
820 * The rows i of G with a 1 on the diagonal do not impose any modulo
821 * constraint and simply express x_i = x'_i.
822 * For each of the remaining rows i, we introduce a div and a corresponding
823 * equality. In particular
825 * g_ii e_j = x_i - g_i(x')
827 * where each x'_k is replaced either by x_k (if g_kk = 1) or the
828 * corresponding div (if g_kk != 1).
830 * If there are any equalities not involving any div, then we
831 * first apply a variable compression on the variables x:
833 * x = C x'' x'' = C_2 x
835 * and perform the above parameter compression on A C instead of on A.
836 * The resulting compression is then of the form
838 * x'' = T(x') = x_0 + G x'
840 * and in constructing the new divs and the corresponding equalities,
841 * we have to replace each x'', i.e., the x'_k with (g_kk = 1),
842 * by the corresponding row from C_2.
844 static struct isl_basic_map *normalize_divs(
845 struct isl_basic_map *bmap, int *progress)
852 struct isl_mat *T = NULL;
853 struct isl_mat *C = NULL;
854 struct isl_mat *C2 = NULL;
862 if (bmap->n_div == 0)
868 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS))
871 total = isl_space_dim(bmap->dim, isl_dim_all);
872 div_eq = n_pure_div_eq(bmap);
876 if (div_eq < bmap->n_eq) {
877 B = isl_mat_sub_alloc6(bmap->ctx, bmap->eq, div_eq,
878 bmap->n_eq - div_eq, 0, 1 + total);
879 C = isl_mat_variable_compression(B, &C2);
883 bmap = isl_basic_map_set_to_empty(bmap);
890 d = isl_vec_alloc(bmap->ctx, div_eq);
893 for (i = 0, j = bmap->n_div-1; i < div_eq; ++i) {
894 while (j >= 0 && isl_int_is_zero(bmap->eq[i][1 + total + j]))
896 isl_int_set(d->block.data[i], bmap->eq[i][1 + total + j]);
898 B = isl_mat_sub_alloc6(bmap->ctx, bmap->eq, 0, div_eq, 0, 1 + total);
901 B = isl_mat_product(B, C);
905 T = isl_mat_parameter_compression(B, d);
909 bmap = isl_basic_map_set_to_empty(bmap);
915 for (i = 0; i < T->n_row - 1; ++i) {
916 isl_int_fdiv_q(v, T->row[1 + i][0], T->row[1 + i][1 + i]);
917 if (isl_int_is_zero(v))
919 isl_mat_col_submul(T, 0, v, 1 + i);
922 pos = isl_alloc_array(bmap->ctx, int, T->n_row);
925 /* We have to be careful because dropping equalities may reorder them */
927 for (j = bmap->n_div - 1; j >= 0; --j) {
928 for (i = 0; i < bmap->n_eq; ++i)
929 if (!isl_int_is_zero(bmap->eq[i][1 + total + j]))
931 if (i < bmap->n_eq) {
932 bmap = isl_basic_map_drop_div(bmap, j);
933 isl_basic_map_drop_equality(bmap, i);
939 for (i = 1; i < T->n_row; ++i) {
940 if (isl_int_is_one(T->row[i][i]))
945 if (needed > dropped) {
946 bmap = isl_basic_map_extend_space(bmap, isl_space_copy(bmap->dim),
951 for (i = 1; i < T->n_row; ++i) {
952 if (isl_int_is_one(T->row[i][i]))
954 k = isl_basic_map_alloc_div(bmap);
955 pos[i] = 1 + total + k;
956 isl_seq_clr(bmap->div[k] + 1, 1 + total + bmap->n_div);
957 isl_int_set(bmap->div[k][0], T->row[i][i]);
959 isl_seq_cpy(bmap->div[k] + 1, C2->row[i], 1 + total);
961 isl_int_set_si(bmap->div[k][1 + i], 1);
962 for (j = 0; j < i; ++j) {
963 if (isl_int_is_zero(T->row[i][j]))
965 if (pos[j] < T->n_row && C2)
966 isl_seq_submul(bmap->div[k] + 1, T->row[i][j],
967 C2->row[pos[j]], 1 + total);
969 isl_int_neg(bmap->div[k][1 + pos[j]],
972 j = isl_basic_map_alloc_equality(bmap);
973 isl_seq_neg(bmap->eq[j], bmap->div[k]+1, 1+total+bmap->n_div);
974 isl_int_set(bmap->eq[j][pos[i]], bmap->div[k][0]);
983 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
993 static struct isl_basic_map *set_div_from_lower_bound(
994 struct isl_basic_map *bmap, int div, int ineq)
996 unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
998 isl_seq_neg(bmap->div[div] + 1, bmap->ineq[ineq], total + bmap->n_div);
999 isl_int_set(bmap->div[div][0], bmap->ineq[ineq][total + div]);
1000 isl_int_add(bmap->div[div][1], bmap->div[div][1], bmap->div[div][0]);
1001 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
1002 isl_int_set_si(bmap->div[div][1 + total + div], 0);
1007 /* Check whether it is ok to define a div based on an inequality.
1008 * To avoid the introduction of circular definitions of divs, we
1009 * do not allow such a definition if the resulting expression would refer to
1010 * any other undefined divs or if any known div is defined in
1011 * terms of the unknown div.
1013 static int ok_to_set_div_from_bound(struct isl_basic_map *bmap,
1017 unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
1019 /* Not defined in terms of unknown divs */
1020 for (j = 0; j < bmap->n_div; ++j) {
1023 if (isl_int_is_zero(bmap->ineq[ineq][total + j]))
1025 if (isl_int_is_zero(bmap->div[j][0]))
1029 /* No other div defined in terms of this one => avoid loops */
1030 for (j = 0; j < bmap->n_div; ++j) {
1033 if (isl_int_is_zero(bmap->div[j][0]))
1035 if (!isl_int_is_zero(bmap->div[j][1 + total + div]))
1042 /* Given two constraints "k" and "l" that are opposite to each other,
1043 * except for the constant term, check if we can use them
1044 * to obtain an expression for one of the hitherto unknown divs.
1045 * "sum" is the sum of the constant terms of the constraints.
1046 * If this sum is strictly smaller than the coefficient of one
1047 * of the divs, then this pair can be used define the div.
1048 * To avoid the introduction of circular definitions of divs, we
1049 * do not use the pair if the resulting expression would refer to
1050 * any other undefined divs or if any known div is defined in
1051 * terms of the unknown div.
1053 static struct isl_basic_map *check_for_div_constraints(
1054 struct isl_basic_map *bmap, int k, int l, isl_int sum, int *progress)
1057 unsigned total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
1059 for (i = 0; i < bmap->n_div; ++i) {
1060 if (!isl_int_is_zero(bmap->div[i][0]))
1062 if (isl_int_is_zero(bmap->ineq[k][total + i]))
1064 if (isl_int_abs_ge(sum, bmap->ineq[k][total + i]))
1066 if (!ok_to_set_div_from_bound(bmap, i, k))
1068 if (isl_int_is_pos(bmap->ineq[k][total + i]))
1069 bmap = set_div_from_lower_bound(bmap, i, k);
1071 bmap = set_div_from_lower_bound(bmap, i, l);
1079 static struct isl_basic_map *remove_duplicate_constraints(
1080 struct isl_basic_map *bmap, int *progress, int detect_divs)
1086 unsigned total = isl_basic_map_total_dim(bmap);
1090 if (!bmap || bmap->n_ineq <= 1)
1093 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1094 bits = ffs(size) - 1;
1095 ctx = isl_basic_map_get_ctx(bmap);
1096 index = isl_calloc_array(ctx, isl_int **, size);
1100 index[isl_seq_get_hash_bits(bmap->ineq[0]+1, total, bits)] = &bmap->ineq[0];
1101 for (k = 1; k < bmap->n_ineq; ++k) {
1102 h = hash_index(index, size, bits, bmap, k);
1104 index[h] = &bmap->ineq[k];
1109 l = index[h] - &bmap->ineq[0];
1110 if (isl_int_lt(bmap->ineq[k][0], bmap->ineq[l][0]))
1111 swap_inequality(bmap, k, l);
1112 isl_basic_map_drop_inequality(bmap, k);
1116 for (k = 0; k < bmap->n_ineq-1; ++k) {
1117 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1118 h = hash_index(index, size, bits, bmap, k);
1119 isl_seq_neg(bmap->ineq[k]+1, bmap->ineq[k]+1, total);
1122 l = index[h] - &bmap->ineq[0];
1123 isl_int_add(sum, bmap->ineq[k][0], bmap->ineq[l][0]);
1124 if (isl_int_is_pos(sum)) {
1126 bmap = check_for_div_constraints(bmap, k, l,
1130 if (isl_int_is_zero(sum)) {
1131 /* We need to break out of the loop after these
1132 * changes since the contents of the hash
1133 * will no longer be valid.
1134 * Plus, we probably we want to regauss first.
1138 isl_basic_map_drop_inequality(bmap, l);
1139 isl_basic_map_inequality_to_equality(bmap, k);
1141 bmap = isl_basic_map_set_to_empty(bmap);
1151 /* Eliminate knowns divs from constraints where they appear with
1152 * a (positive or negative) unit coefficient.
1156 * floor(e/m) + f >= 0
1164 * -floor(e/m) + f >= 0
1168 * -e + m f + m - 1 >= 0
1170 * The first conversion is valid because floor(e/m) >= -f is equivalent
1171 * to e/m >= -f because -f is an integral expression.
1172 * The second conversion follows from the fact that
1174 * -floor(e/m) = ceil(-e/m) = floor((-e + m - 1)/m)
1177 * We skip integral divs, i.e., those with denominator 1, as we would
1178 * risk eliminating the div from the div constraints. We do not need
1179 * to handle those divs here anyway since the div constraints will turn
1180 * out to form an equality and this equality can then be use to eliminate
1181 * the div from all constraints.
1183 static __isl_give isl_basic_map *eliminate_unit_divs(
1184 __isl_take isl_basic_map *bmap, int *progress)
1193 ctx = isl_basic_map_get_ctx(bmap);
1194 total = 1 + isl_space_dim(bmap->dim, isl_dim_all);
1196 for (i = 0; i < bmap->n_div; ++i) {
1197 if (isl_int_is_zero(bmap->div[i][0]))
1199 if (isl_int_is_one(bmap->div[i][0]))
1201 for (j = 0; j < bmap->n_ineq; ++j) {
1204 if (!isl_int_is_one(bmap->ineq[j][total + i]) &&
1205 !isl_int_is_negone(bmap->ineq[j][total + i]))
1210 s = isl_int_sgn(bmap->ineq[j][total + i]);
1211 isl_int_set_si(bmap->ineq[j][total + i], 0);
1213 isl_seq_combine(bmap->ineq[j],
1214 ctx->negone, bmap->div[i] + 1,
1215 bmap->div[i][0], bmap->ineq[j],
1216 total + bmap->n_div);
1218 isl_seq_combine(bmap->ineq[j],
1219 ctx->one, bmap->div[i] + 1,
1220 bmap->div[i][0], bmap->ineq[j],
1221 total + bmap->n_div);
1223 isl_int_add(bmap->ineq[j][0],
1224 bmap->ineq[j][0], bmap->div[i][0]);
1225 isl_int_sub_ui(bmap->ineq[j][0],
1226 bmap->ineq[j][0], 1);
1234 struct isl_basic_map *isl_basic_map_simplify(struct isl_basic_map *bmap)
1241 bmap = isl_basic_map_normalize_constraints(bmap);
1242 bmap = normalize_div_expressions(bmap);
1243 bmap = remove_duplicate_divs(bmap, &progress);
1244 bmap = eliminate_unit_divs(bmap, &progress);
1245 bmap = eliminate_divs_eq(bmap, &progress);
1246 bmap = eliminate_divs_ineq(bmap, &progress);
1247 bmap = isl_basic_map_gauss(bmap, &progress);
1248 /* requires equalities in normal form */
1249 bmap = normalize_divs(bmap, &progress);
1250 bmap = remove_duplicate_constraints(bmap, &progress, 1);
1255 struct isl_basic_set *isl_basic_set_simplify(struct isl_basic_set *bset)
1257 return (struct isl_basic_set *)
1258 isl_basic_map_simplify((struct isl_basic_map *)bset);
1262 int isl_basic_map_is_div_constraint(__isl_keep isl_basic_map *bmap,
1263 isl_int *constraint, unsigned div)
1270 pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div;
1272 if (isl_int_eq(constraint[pos], bmap->div[div][0])) {
1274 isl_int_sub(bmap->div[div][1],
1275 bmap->div[div][1], bmap->div[div][0]);
1276 isl_int_add_ui(bmap->div[div][1], bmap->div[div][1], 1);
1277 neg = isl_seq_is_neg(constraint, bmap->div[div]+1, pos);
1278 isl_int_sub_ui(bmap->div[div][1], bmap->div[div][1], 1);
1279 isl_int_add(bmap->div[div][1],
1280 bmap->div[div][1], bmap->div[div][0]);
1283 if (isl_seq_first_non_zero(constraint+pos+1,
1284 bmap->n_div-div-1) != -1)
1286 } else if (isl_int_abs_eq(constraint[pos], bmap->div[div][0])) {
1287 if (!isl_seq_eq(constraint, bmap->div[div]+1, pos))
1289 if (isl_seq_first_non_zero(constraint+pos+1,
1290 bmap->n_div-div-1) != -1)
1298 int isl_basic_set_is_div_constraint(__isl_keep isl_basic_set *bset,
1299 isl_int *constraint, unsigned div)
1301 return isl_basic_map_is_div_constraint(bset, constraint, div);
1305 /* If the only constraints a div d=floor(f/m)
1306 * appears in are its two defining constraints
1309 * -(f - (m - 1)) + m d >= 0
1311 * then it can safely be removed.
1313 static int div_is_redundant(struct isl_basic_map *bmap, int div)
1316 unsigned pos = 1 + isl_space_dim(bmap->dim, isl_dim_all) + div;
1318 for (i = 0; i < bmap->n_eq; ++i)
1319 if (!isl_int_is_zero(bmap->eq[i][pos]))
1322 for (i = 0; i < bmap->n_ineq; ++i) {
1323 if (isl_int_is_zero(bmap->ineq[i][pos]))
1325 if (!isl_basic_map_is_div_constraint(bmap, bmap->ineq[i], div))
1329 for (i = 0; i < bmap->n_div; ++i)
1330 if (!isl_int_is_zero(bmap->div[i][1+pos]))
1337 * Remove divs that don't occur in any of the constraints or other divs.
1338 * These can arise when dropping some of the variables in a quast
1339 * returned by piplib.
1341 static struct isl_basic_map *remove_redundant_divs(struct isl_basic_map *bmap)
1348 for (i = bmap->n_div-1; i >= 0; --i) {
1349 if (!div_is_redundant(bmap, i))
1351 bmap = isl_basic_map_drop_div(bmap, i);
1356 struct isl_basic_map *isl_basic_map_finalize(struct isl_basic_map *bmap)
1358 bmap = remove_redundant_divs(bmap);
1361 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
1365 struct isl_basic_set *isl_basic_set_finalize(struct isl_basic_set *bset)
1367 return (struct isl_basic_set *)
1368 isl_basic_map_finalize((struct isl_basic_map *)bset);
1371 struct isl_set *isl_set_finalize(struct isl_set *set)
1377 for (i = 0; i < set->n; ++i) {
1378 set->p[i] = isl_basic_set_finalize(set->p[i]);
1388 struct isl_map *isl_map_finalize(struct isl_map *map)
1394 for (i = 0; i < map->n; ++i) {
1395 map->p[i] = isl_basic_map_finalize(map->p[i]);
1399 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
1407 /* Remove definition of any div that is defined in terms of the given variable.
1408 * The div itself is not removed. Functions such as
1409 * eliminate_divs_ineq depend on the other divs remaining in place.
1411 static struct isl_basic_map *remove_dependent_vars(struct isl_basic_map *bmap,
1416 for (i = 0; i < bmap->n_div; ++i) {
1417 if (isl_int_is_zero(bmap->div[i][0]))
1419 if (isl_int_is_zero(bmap->div[i][1+1+pos]))
1421 isl_int_set_si(bmap->div[i][0], 0);
1426 /* Eliminate the specified variables from the constraints using
1427 * Fourier-Motzkin. The variables themselves are not removed.
1429 struct isl_basic_map *isl_basic_map_eliminate_vars(
1430 struct isl_basic_map *bmap, unsigned pos, unsigned n)
1441 total = isl_basic_map_total_dim(bmap);
1443 bmap = isl_basic_map_cow(bmap);
1444 for (d = pos + n - 1; d >= 0 && d >= pos; --d)
1445 bmap = remove_dependent_vars(bmap, d);
1447 for (d = pos + n - 1;
1448 d >= 0 && d >= total - bmap->n_div && d >= pos; --d)
1449 isl_seq_clr(bmap->div[d-(total-bmap->n_div)], 2+total);
1450 for (d = pos + n - 1; d >= 0 && d >= pos; --d) {
1451 int n_lower, n_upper;
1454 for (i = 0; i < bmap->n_eq; ++i) {
1455 if (isl_int_is_zero(bmap->eq[i][1+d]))
1457 eliminate_var_using_equality(bmap, d, bmap->eq[i], 0, NULL);
1458 isl_basic_map_drop_equality(bmap, i);
1466 for (i = 0; i < bmap->n_ineq; ++i) {
1467 if (isl_int_is_pos(bmap->ineq[i][1+d]))
1469 else if (isl_int_is_neg(bmap->ineq[i][1+d]))
1472 bmap = isl_basic_map_extend_constraints(bmap,
1473 0, n_lower * n_upper);
1476 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1478 if (isl_int_is_zero(bmap->ineq[i][1+d]))
1481 for (j = 0; j < i; ++j) {
1482 if (isl_int_is_zero(bmap->ineq[j][1+d]))
1485 if (isl_int_sgn(bmap->ineq[i][1+d]) ==
1486 isl_int_sgn(bmap->ineq[j][1+d]))
1488 k = isl_basic_map_alloc_inequality(bmap);
1491 isl_seq_cpy(bmap->ineq[k], bmap->ineq[i],
1493 isl_seq_elim(bmap->ineq[k], bmap->ineq[j],
1494 1+d, 1+total, NULL);
1496 isl_basic_map_drop_inequality(bmap, i);
1499 if (n_lower > 0 && n_upper > 0) {
1500 bmap = isl_basic_map_normalize_constraints(bmap);
1501 bmap = remove_duplicate_constraints(bmap, NULL, 0);
1502 bmap = isl_basic_map_gauss(bmap, NULL);
1503 bmap = isl_basic_map_remove_redundancies(bmap);
1507 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
1511 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1513 bmap = isl_basic_map_gauss(bmap, NULL);
1516 isl_basic_map_free(bmap);
1520 struct isl_basic_set *isl_basic_set_eliminate_vars(
1521 struct isl_basic_set *bset, unsigned pos, unsigned n)
1523 return (struct isl_basic_set *)isl_basic_map_eliminate_vars(
1524 (struct isl_basic_map *)bset, pos, n);
1527 /* Eliminate the specified n dimensions starting at first from the
1528 * constraints, without removing the dimensions from the space.
1529 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1530 * Otherwise, they are projected out and the original space is restored.
1532 __isl_give isl_basic_map *isl_basic_map_eliminate(
1533 __isl_take isl_basic_map *bmap,
1534 enum isl_dim_type type, unsigned first, unsigned n)
1543 if (first + n > isl_basic_map_dim(bmap, type) || first + n < first)
1544 isl_die(bmap->ctx, isl_error_invalid,
1545 "index out of bounds", goto error);
1547 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
1548 first += isl_basic_map_offset(bmap, type) - 1;
1549 bmap = isl_basic_map_eliminate_vars(bmap, first, n);
1550 return isl_basic_map_finalize(bmap);
1553 space = isl_basic_map_get_space(bmap);
1554 bmap = isl_basic_map_project_out(bmap, type, first, n);
1555 bmap = isl_basic_map_insert_dims(bmap, type, first, n);
1556 bmap = isl_basic_map_reset_space(bmap, space);
1559 isl_basic_map_free(bmap);
1563 __isl_give isl_basic_set *isl_basic_set_eliminate(
1564 __isl_take isl_basic_set *bset,
1565 enum isl_dim_type type, unsigned first, unsigned n)
1567 return isl_basic_map_eliminate(bset, type, first, n);
1570 /* Don't assume equalities are in order, because align_divs
1571 * may have changed the order of the divs.
1573 static void compute_elimination_index(struct isl_basic_map *bmap, int *elim)
1578 total = isl_space_dim(bmap->dim, isl_dim_all);
1579 for (d = 0; d < total; ++d)
1581 for (i = 0; i < bmap->n_eq; ++i) {
1582 for (d = total - 1; d >= 0; --d) {
1583 if (isl_int_is_zero(bmap->eq[i][1+d]))
1591 static void set_compute_elimination_index(struct isl_basic_set *bset, int *elim)
1593 compute_elimination_index((struct isl_basic_map *)bset, elim);
1596 static int reduced_using_equalities(isl_int *dst, isl_int *src,
1597 struct isl_basic_map *bmap, int *elim)
1603 total = isl_space_dim(bmap->dim, isl_dim_all);
1604 for (d = total - 1; d >= 0; --d) {
1605 if (isl_int_is_zero(src[1+d]))
1610 isl_seq_cpy(dst, src, 1 + total);
1613 isl_seq_elim(dst, bmap->eq[elim[d]], 1 + d, 1 + total, NULL);
1618 static int set_reduced_using_equalities(isl_int *dst, isl_int *src,
1619 struct isl_basic_set *bset, int *elim)
1621 return reduced_using_equalities(dst, src,
1622 (struct isl_basic_map *)bset, elim);
1625 static struct isl_basic_set *isl_basic_set_reduce_using_equalities(
1626 struct isl_basic_set *bset, struct isl_basic_set *context)
1631 if (!bset || !context)
1634 if (context->n_eq == 0) {
1635 isl_basic_set_free(context);
1639 bset = isl_basic_set_cow(bset);
1643 elim = isl_alloc_array(bset->ctx, int, isl_basic_set_n_dim(bset));
1646 set_compute_elimination_index(context, elim);
1647 for (i = 0; i < bset->n_eq; ++i)
1648 set_reduced_using_equalities(bset->eq[i], bset->eq[i],
1650 for (i = 0; i < bset->n_ineq; ++i)
1651 set_reduced_using_equalities(bset->ineq[i], bset->ineq[i],
1653 isl_basic_set_free(context);
1655 bset = isl_basic_set_simplify(bset);
1656 bset = isl_basic_set_finalize(bset);
1659 isl_basic_set_free(bset);
1660 isl_basic_set_free(context);
1664 static struct isl_basic_set *remove_shifted_constraints(
1665 struct isl_basic_set *bset, struct isl_basic_set *context)
1676 size = round_up(4 * (context->n_ineq+1) / 3 - 1);
1677 bits = ffs(size) - 1;
1678 ctx = isl_basic_set_get_ctx(bset);
1679 index = isl_calloc_array(ctx, isl_int **, size);
1683 for (k = 0; k < context->n_ineq; ++k) {
1684 h = set_hash_index(index, size, bits, context, k);
1685 index[h] = &context->ineq[k];
1687 for (k = 0; k < bset->n_ineq; ++k) {
1688 h = set_hash_index(index, size, bits, bset, k);
1691 l = index[h] - &context->ineq[0];
1692 if (isl_int_lt(bset->ineq[k][0], context->ineq[l][0]))
1694 bset = isl_basic_set_cow(bset);
1697 isl_basic_set_drop_inequality(bset, k);
1707 /* Remove all information from bset that is redundant in the context
1708 * of context. Both bset and context are assumed to be full-dimensional.
1710 * We first * remove the inequalities from "bset"
1711 * that are obviously redundant with respect to some inequality in "context".
1713 * If there are any inequalities left, we construct a tableau for
1714 * the context and then add the inequalities of "bset".
1715 * Before adding these inequalities, we freeze all constraints such that
1716 * they won't be considered redundant in terms of the constraints of "bset".
1717 * Then we detect all redundant constraints (among the
1718 * constraints that weren't frozen), first by checking for redundancy in the
1719 * the tableau and then by checking if replacing a constraint by its negation
1720 * would lead to an empty set. This last step is fairly expensive
1721 * and could be optimized by more reuse of the tableau.
1722 * Finally, we update bset according to the results.
1724 static __isl_give isl_basic_set *uset_gist_full(__isl_take isl_basic_set *bset,
1725 __isl_take isl_basic_set *context)
1728 isl_basic_set *combined = NULL;
1729 struct isl_tab *tab = NULL;
1730 unsigned context_ineq;
1733 if (!bset || !context)
1736 if (isl_basic_set_is_universe(bset)) {
1737 isl_basic_set_free(context);
1741 if (isl_basic_set_is_universe(context)) {
1742 isl_basic_set_free(context);
1746 bset = remove_shifted_constraints(bset, context);
1749 if (bset->n_ineq == 0)
1752 context_ineq = context->n_ineq;
1753 combined = isl_basic_set_cow(isl_basic_set_copy(context));
1754 combined = isl_basic_set_extend_constraints(combined, 0, bset->n_ineq);
1755 tab = isl_tab_from_basic_set(combined, 0);
1756 for (i = 0; i < context_ineq; ++i)
1757 if (isl_tab_freeze_constraint(tab, i) < 0)
1759 tab = isl_tab_extend(tab, bset->n_ineq);
1760 for (i = 0; i < bset->n_ineq; ++i)
1761 if (isl_tab_add_ineq(tab, bset->ineq[i]) < 0)
1763 bset = isl_basic_set_add_constraints(combined, bset, 0);
1767 if (isl_tab_detect_redundant(tab) < 0)
1769 total = isl_basic_set_total_dim(bset);
1770 for (i = context_ineq; i < bset->n_ineq; ++i) {
1772 if (tab->con[i].is_redundant)
1774 tab->con[i].is_redundant = 1;
1775 combined = isl_basic_set_dup(bset);
1776 combined = isl_basic_set_update_from_tab(combined, tab);
1777 combined = isl_basic_set_extend_constraints(combined, 0, 1);
1778 k = isl_basic_set_alloc_inequality(combined);
1781 isl_seq_neg(combined->ineq[k], bset->ineq[i], 1 + total);
1782 isl_int_sub_ui(combined->ineq[k][0], combined->ineq[k][0], 1);
1783 is_empty = isl_basic_set_is_empty(combined);
1786 isl_basic_set_free(combined);
1789 tab->con[i].is_redundant = 0;
1791 for (i = 0; i < context_ineq; ++i)
1792 tab->con[i].is_redundant = 1;
1793 bset = isl_basic_set_update_from_tab(bset, tab);
1795 ISL_F_SET(bset, ISL_BASIC_SET_NO_IMPLICIT);
1796 ISL_F_SET(bset, ISL_BASIC_SET_NO_REDUNDANT);
1801 bset = isl_basic_set_simplify(bset);
1802 bset = isl_basic_set_finalize(bset);
1803 isl_basic_set_free(context);
1807 isl_basic_set_free(combined);
1808 isl_basic_set_free(context);
1809 isl_basic_set_free(bset);
1813 /* Remove all information from bset that is redundant in the context
1814 * of context. In particular, equalities that are linear combinations
1815 * of those in context are removed. Then the inequalities that are
1816 * redundant in the context of the equalities and inequalities of
1817 * context are removed.
1819 * We first compute the integer affine hull of the intersection,
1820 * compute the gist inside this affine hull and then add back
1821 * those equalities that are not implied by the context.
1823 * If two constraints are mutually redundant, then uset_gist_full
1824 * will remove the second of those constraints. We therefore first
1825 * sort the constraints so that constraints not involving existentially
1826 * quantified variables are given precedence over those that do.
1827 * We have to perform this sorting before the variable compression,
1828 * because that may effect the order of the variables.
1830 static __isl_give isl_basic_set *uset_gist(__isl_take isl_basic_set *bset,
1831 __isl_take isl_basic_set *context)
1836 isl_basic_set *aff_context;
1839 if (!bset || !context)
1842 bset = isl_basic_set_intersect(bset, isl_basic_set_copy(context));
1843 if (isl_basic_set_plain_is_empty(bset)) {
1844 isl_basic_set_free(context);
1847 bset = isl_basic_set_sort_constraints(bset);
1848 aff = isl_basic_set_affine_hull(isl_basic_set_copy(bset));
1851 if (isl_basic_set_plain_is_empty(aff)) {
1852 isl_basic_set_free(aff);
1853 isl_basic_set_free(context);
1856 if (aff->n_eq == 0) {
1857 isl_basic_set_free(aff);
1858 return uset_gist_full(bset, context);
1860 total = isl_basic_set_total_dim(bset);
1861 eq = isl_mat_sub_alloc6(bset->ctx, aff->eq, 0, aff->n_eq, 0, 1 + total);
1862 eq = isl_mat_cow(eq);
1863 T = isl_mat_variable_compression(eq, &T2);
1864 if (T && T->n_col == 0) {
1867 isl_basic_set_free(context);
1868 isl_basic_set_free(aff);
1869 return isl_basic_set_set_to_empty(bset);
1872 aff_context = isl_basic_set_affine_hull(isl_basic_set_copy(context));
1874 bset = isl_basic_set_preimage(bset, isl_mat_copy(T));
1875 context = isl_basic_set_preimage(context, T);
1877 bset = uset_gist_full(bset, context);
1878 bset = isl_basic_set_preimage(bset, T2);
1879 bset = isl_basic_set_intersect(bset, aff);
1880 bset = isl_basic_set_reduce_using_equalities(bset, aff_context);
1883 ISL_F_SET(bset, ISL_BASIC_SET_NO_IMPLICIT);
1884 ISL_F_SET(bset, ISL_BASIC_SET_NO_REDUNDANT);
1889 isl_basic_set_free(bset);
1890 isl_basic_set_free(context);
1894 /* Normalize the divs in "bmap" in the context of the equalities in "context".
1895 * We simply add the equalities in context to bmap and then do a regular
1896 * div normalizations. Better results can be obtained by normalizing
1897 * only the divs in bmap than do not also appear in context.
1898 * We need to be careful to reduce the divs using the equalities
1899 * so that later calls to isl_basic_map_overlying_set wouldn't introduce
1900 * spurious constraints.
1902 static struct isl_basic_map *normalize_divs_in_context(
1903 struct isl_basic_map *bmap, struct isl_basic_map *context)
1906 unsigned total_context;
1909 div_eq = n_pure_div_eq(bmap);
1913 if (context->n_div > 0)
1914 bmap = isl_basic_map_align_divs(bmap, context);
1916 total_context = isl_basic_map_total_dim(context);
1917 bmap = isl_basic_map_extend_constraints(bmap, context->n_eq, 0);
1918 for (i = 0; i < context->n_eq; ++i) {
1920 k = isl_basic_map_alloc_equality(bmap);
1921 isl_seq_cpy(bmap->eq[k], context->eq[i], 1 + total_context);
1922 isl_seq_clr(bmap->eq[k] + 1 + total_context,
1923 isl_basic_map_total_dim(bmap) - total_context);
1925 bmap = isl_basic_map_gauss(bmap, NULL);
1926 bmap = normalize_divs(bmap, NULL);
1927 bmap = isl_basic_map_gauss(bmap, NULL);
1931 struct isl_basic_map *isl_basic_map_gist(struct isl_basic_map *bmap,
1932 struct isl_basic_map *context)
1934 struct isl_basic_set *bset;
1936 if (!bmap || !context)
1939 if (isl_basic_map_is_universe(bmap)) {
1940 isl_basic_map_free(context);
1943 if (isl_basic_map_plain_is_empty(context)) {
1944 isl_basic_map_free(bmap);
1947 if (isl_basic_map_plain_is_empty(bmap)) {
1948 isl_basic_map_free(context);
1952 bmap = isl_basic_map_remove_redundancies(bmap);
1953 context = isl_basic_map_remove_redundancies(context);
1956 bmap = normalize_divs_in_context(bmap, context);
1958 context = isl_basic_map_align_divs(context, bmap);
1959 bmap = isl_basic_map_align_divs(bmap, context);
1961 bset = uset_gist(isl_basic_map_underlying_set(isl_basic_map_copy(bmap)),
1962 isl_basic_map_underlying_set(context));
1964 return isl_basic_map_overlying_set(bset, bmap);
1966 isl_basic_map_free(bmap);
1967 isl_basic_map_free(context);
1972 * Assumes context has no implicit divs.
1974 __isl_give isl_map *isl_map_gist_basic_map(__isl_take isl_map *map,
1975 __isl_take isl_basic_map *context)
1979 if (!map || !context)
1982 if (isl_basic_map_plain_is_empty(context)) {
1984 return isl_map_from_basic_map(context);
1987 context = isl_basic_map_remove_redundancies(context);
1988 map = isl_map_cow(map);
1989 if (!map || !context)
1991 isl_assert(map->ctx, isl_space_is_equal(map->dim, context->dim), goto error);
1992 map = isl_map_compute_divs(map);
1993 for (i = 0; i < map->n; ++i)
1994 context = isl_basic_map_align_divs(context, map->p[i]);
1995 for (i = map->n - 1; i >= 0; --i) {
1996 map->p[i] = isl_basic_map_gist(map->p[i],
1997 isl_basic_map_copy(context));
2000 if (isl_basic_map_plain_is_empty(map->p[i])) {
2001 isl_basic_map_free(map->p[i]);
2002 if (i != map->n - 1)
2003 map->p[i] = map->p[map->n - 1];
2007 isl_basic_map_free(context);
2008 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2012 isl_basic_map_free(context);
2016 static __isl_give isl_map *map_gist(__isl_take isl_map *map,
2017 __isl_take isl_map *context)
2019 context = isl_map_compute_divs(context);
2020 return isl_map_gist_basic_map(map, isl_map_simple_hull(context));
2023 __isl_give isl_map *isl_map_gist(__isl_take isl_map *map,
2024 __isl_take isl_map *context)
2026 return isl_map_align_params_map_map_and(map, context, &map_gist);
2029 struct isl_basic_set *isl_basic_set_gist(struct isl_basic_set *bset,
2030 struct isl_basic_set *context)
2032 return (struct isl_basic_set *)isl_basic_map_gist(
2033 (struct isl_basic_map *)bset, (struct isl_basic_map *)context);
2036 __isl_give isl_set *isl_set_gist_basic_set(__isl_take isl_set *set,
2037 __isl_take isl_basic_set *context)
2039 return (struct isl_set *)isl_map_gist_basic_map((struct isl_map *)set,
2040 (struct isl_basic_map *)context);
2043 __isl_give isl_set *isl_set_gist_params_basic_set(__isl_take isl_set *set,
2044 __isl_take isl_basic_set *context)
2046 isl_space *space = isl_set_get_space(set);
2047 isl_basic_set *dom_context = isl_basic_set_universe(space);
2048 dom_context = isl_basic_set_intersect_params(dom_context, context);
2049 return isl_set_gist_basic_set(set, dom_context);
2052 __isl_give isl_set *isl_set_gist(__isl_take isl_set *set,
2053 __isl_take isl_set *context)
2055 return (struct isl_set *)isl_map_gist((struct isl_map *)set,
2056 (struct isl_map *)context);
2059 __isl_give isl_map *isl_map_gist_domain(__isl_take isl_map *map,
2060 __isl_take isl_set *context)
2062 isl_map *map_context = isl_map_universe(isl_map_get_space(map));
2063 map_context = isl_map_intersect_domain(map_context, context);
2064 return isl_map_gist(map, map_context);
2067 __isl_give isl_map *isl_map_gist_range(__isl_take isl_map *map,
2068 __isl_take isl_set *context)
2070 isl_map *map_context = isl_map_universe(isl_map_get_space(map));
2071 map_context = isl_map_intersect_range(map_context, context);
2072 return isl_map_gist(map, map_context);
2075 __isl_give isl_map *isl_map_gist_params(__isl_take isl_map *map,
2076 __isl_take isl_set *context)
2078 isl_map *map_context = isl_map_universe(isl_map_get_space(map));
2079 map_context = isl_map_intersect_params(map_context, context);
2080 return isl_map_gist(map, map_context);
2083 __isl_give isl_set *isl_set_gist_params(__isl_take isl_set *set,
2084 __isl_take isl_set *context)
2086 return isl_map_gist_params(set, context);
2089 /* Quick check to see if two basic maps are disjoint.
2090 * In particular, we reduce the equalities and inequalities of
2091 * one basic map in the context of the equalities of the other
2092 * basic map and check if we get a contradiction.
2094 int isl_basic_map_plain_is_disjoint(__isl_keep isl_basic_map *bmap1,
2095 __isl_keep isl_basic_map *bmap2)
2097 struct isl_vec *v = NULL;
2102 if (!bmap1 || !bmap2)
2104 isl_assert(bmap1->ctx, isl_space_is_equal(bmap1->dim, bmap2->dim),
2106 if (bmap1->n_div || bmap2->n_div)
2108 if (!bmap1->n_eq && !bmap2->n_eq)
2111 total = isl_space_dim(bmap1->dim, isl_dim_all);
2114 v = isl_vec_alloc(bmap1->ctx, 1 + total);
2117 elim = isl_alloc_array(bmap1->ctx, int, total);
2120 compute_elimination_index(bmap1, elim);
2121 for (i = 0; i < bmap2->n_eq; ++i) {
2123 reduced = reduced_using_equalities(v->block.data, bmap2->eq[i],
2125 if (reduced && !isl_int_is_zero(v->block.data[0]) &&
2126 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
2129 for (i = 0; i < bmap2->n_ineq; ++i) {
2131 reduced = reduced_using_equalities(v->block.data,
2132 bmap2->ineq[i], bmap1, elim);
2133 if (reduced && isl_int_is_neg(v->block.data[0]) &&
2134 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
2137 compute_elimination_index(bmap2, elim);
2138 for (i = 0; i < bmap1->n_ineq; ++i) {
2140 reduced = reduced_using_equalities(v->block.data,
2141 bmap1->ineq[i], bmap2, elim);
2142 if (reduced && isl_int_is_neg(v->block.data[0]) &&
2143 isl_seq_first_non_zero(v->block.data + 1, total) == -1)
2159 int isl_basic_set_plain_is_disjoint(__isl_keep isl_basic_set *bset1,
2160 __isl_keep isl_basic_set *bset2)
2162 return isl_basic_map_plain_is_disjoint((struct isl_basic_map *)bset1,
2163 (struct isl_basic_map *)bset2);
2166 int isl_map_plain_is_disjoint(__isl_keep isl_map *map1,
2167 __isl_keep isl_map *map2)
2174 if (isl_map_plain_is_equal(map1, map2))
2177 for (i = 0; i < map1->n; ++i) {
2178 for (j = 0; j < map2->n; ++j) {
2179 int d = isl_basic_map_plain_is_disjoint(map1->p[i],
2188 int isl_set_plain_is_disjoint(__isl_keep isl_set *set1,
2189 __isl_keep isl_set *set2)
2191 return isl_map_plain_is_disjoint((struct isl_map *)set1,
2192 (struct isl_map *)set2);
2195 int isl_set_fast_is_disjoint(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
2197 return isl_set_plain_is_disjoint(set1, set2);
2200 /* Check if we can combine a given div with lower bound l and upper
2201 * bound u with some other div and if so return that other div.
2202 * Otherwise return -1.
2204 * We first check that
2205 * - the bounds are opposites of each other (except for the constant
2207 * - the bounds do not reference any other div
2208 * - no div is defined in terms of this div
2210 * Let m be the size of the range allowed on the div by the bounds.
2211 * That is, the bounds are of the form
2213 * e <= a <= e + m - 1
2215 * with e some expression in the other variables.
2216 * We look for another div b such that no third div is defined in terms
2217 * of this second div b and such that in any constraint that contains
2218 * a (except for the given lower and upper bound), also contains b
2219 * with a coefficient that is m times that of b.
2220 * That is, all constraints (execpt for the lower and upper bound)
2223 * e + f (a + m b) >= 0
2225 * If so, we return b so that "a + m b" can be replaced by
2226 * a single div "c = a + m b".
2228 static int div_find_coalesce(struct isl_basic_map *bmap, int *pairs,
2229 unsigned div, unsigned l, unsigned u)
2235 if (bmap->n_div <= 1)
2237 dim = isl_space_dim(bmap->dim, isl_dim_all);
2238 if (isl_seq_first_non_zero(bmap->ineq[l] + 1 + dim, div) != -1)
2240 if (isl_seq_first_non_zero(bmap->ineq[l] + 1 + dim + div + 1,
2241 bmap->n_div - div - 1) != -1)
2243 if (!isl_seq_is_neg(bmap->ineq[l] + 1, bmap->ineq[u] + 1,
2247 for (i = 0; i < bmap->n_div; ++i) {
2248 if (isl_int_is_zero(bmap->div[i][0]))
2250 if (!isl_int_is_zero(bmap->div[i][1 + 1 + dim + div]))
2254 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0], bmap->ineq[u][0]);
2255 if (isl_int_is_neg(bmap->ineq[l][0])) {
2256 isl_int_sub(bmap->ineq[l][0],
2257 bmap->ineq[l][0], bmap->ineq[u][0]);
2258 bmap = isl_basic_map_copy(bmap);
2259 bmap = isl_basic_map_set_to_empty(bmap);
2260 isl_basic_map_free(bmap);
2263 isl_int_add_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
2264 for (i = 0; i < bmap->n_div; ++i) {
2269 for (j = 0; j < bmap->n_div; ++j) {
2270 if (isl_int_is_zero(bmap->div[j][0]))
2272 if (!isl_int_is_zero(bmap->div[j][1 + 1 + dim + i]))
2275 if (j < bmap->n_div)
2277 for (j = 0; j < bmap->n_ineq; ++j) {
2279 if (j == l || j == u)
2281 if (isl_int_is_zero(bmap->ineq[j][1 + dim + div]))
2283 if (isl_int_is_zero(bmap->ineq[j][1 + dim + i]))
2285 isl_int_mul(bmap->ineq[j][1 + dim + div],
2286 bmap->ineq[j][1 + dim + div],
2288 valid = isl_int_eq(bmap->ineq[j][1 + dim + div],
2289 bmap->ineq[j][1 + dim + i]);
2290 isl_int_divexact(bmap->ineq[j][1 + dim + div],
2291 bmap->ineq[j][1 + dim + div],
2296 if (j < bmap->n_ineq)
2301 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
2302 isl_int_sub(bmap->ineq[l][0], bmap->ineq[l][0], bmap->ineq[u][0]);
2306 /* Given a lower and an upper bound on div i, construct an inequality
2307 * that when nonnegative ensures that this pair of bounds always allows
2308 * for an integer value of the given div.
2309 * The lower bound is inequality l, while the upper bound is inequality u.
2310 * The constructed inequality is stored in ineq.
2311 * g, fl, fu are temporary scalars.
2313 * Let the upper bound be
2317 * and the lower bound
2321 * Let n_u = f_u g and n_l = f_l g, with g = gcd(n_u, n_l).
2324 * - f_u e_l <= f_u f_l g a <= f_l e_u
2326 * Since all variables are integer valued, this is equivalent to
2328 * - f_u e_l - (f_u - 1) <= f_u f_l g a <= f_l e_u + (f_l - 1)
2330 * If this interval is at least f_u f_l g, then it contains at least
2331 * one integer value for a.
2332 * That is, the test constraint is
2334 * f_l e_u + f_u e_l + f_l - 1 + f_u - 1 + 1 >= f_u f_l g
2336 static void construct_test_ineq(struct isl_basic_map *bmap, int i,
2337 int l, int u, isl_int *ineq, isl_int g, isl_int fl, isl_int fu)
2340 dim = isl_space_dim(bmap->dim, isl_dim_all);
2342 isl_int_gcd(g, bmap->ineq[l][1 + dim + i], bmap->ineq[u][1 + dim + i]);
2343 isl_int_divexact(fl, bmap->ineq[l][1 + dim + i], g);
2344 isl_int_divexact(fu, bmap->ineq[u][1 + dim + i], g);
2345 isl_int_neg(fu, fu);
2346 isl_seq_combine(ineq, fl, bmap->ineq[u], fu, bmap->ineq[l],
2347 1 + dim + bmap->n_div);
2348 isl_int_add(ineq[0], ineq[0], fl);
2349 isl_int_add(ineq[0], ineq[0], fu);
2350 isl_int_sub_ui(ineq[0], ineq[0], 1);
2351 isl_int_mul(g, g, fl);
2352 isl_int_mul(g, g, fu);
2353 isl_int_sub(ineq[0], ineq[0], g);
2356 /* Remove more kinds of divs that are not strictly needed.
2357 * In particular, if all pairs of lower and upper bounds on a div
2358 * are such that they allow at least one integer value of the div,
2359 * the we can eliminate the div using Fourier-Motzkin without
2360 * introducing any spurious solutions.
2362 static struct isl_basic_map *drop_more_redundant_divs(
2363 struct isl_basic_map *bmap, int *pairs, int n)
2365 struct isl_tab *tab = NULL;
2366 struct isl_vec *vec = NULL;
2378 dim = isl_space_dim(bmap->dim, isl_dim_all);
2379 vec = isl_vec_alloc(bmap->ctx, 1 + dim + bmap->n_div);
2383 tab = isl_tab_from_basic_map(bmap, 0);
2388 enum isl_lp_result res;
2390 for (i = 0; i < bmap->n_div; ++i) {
2393 if (best >= 0 && pairs[best] <= pairs[i])
2399 for (l = 0; l < bmap->n_ineq; ++l) {
2400 if (!isl_int_is_pos(bmap->ineq[l][1 + dim + i]))
2402 for (u = 0; u < bmap->n_ineq; ++u) {
2403 if (!isl_int_is_neg(bmap->ineq[u][1 + dim + i]))
2405 construct_test_ineq(bmap, i, l, u,
2406 vec->el, g, fl, fu);
2407 res = isl_tab_min(tab, vec->el,
2408 bmap->ctx->one, &g, NULL, 0);
2409 if (res == isl_lp_error)
2411 if (res == isl_lp_empty) {
2412 bmap = isl_basic_map_set_to_empty(bmap);
2415 if (res != isl_lp_ok || isl_int_is_neg(g))
2418 if (u < bmap->n_ineq)
2421 if (l == bmap->n_ineq) {
2441 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, remove, 1);
2442 return isl_basic_map_drop_redundant_divs(bmap);
2445 isl_basic_map_free(bmap);
2454 /* Given a pair of divs div1 and div2 such that, expect for the lower bound l
2455 * and the upper bound u, div1 always occurs together with div2 in the form
2456 * (div1 + m div2), where m is the constant range on the variable div1
2457 * allowed by l and u, replace the pair div1 and div2 by a single
2458 * div that is equal to div1 + m div2.
2460 * The new div will appear in the location that contains div2.
2461 * We need to modify all constraints that contain
2462 * div2 = (div - div1) / m
2463 * (If a constraint does not contain div2, it will also not contain div1.)
2464 * If the constraint also contains div1, then we know they appear
2465 * as f (div1 + m div2) and we can simply replace (div1 + m div2) by div,
2466 * i.e., the coefficient of div is f.
2468 * Otherwise, we first need to introduce div1 into the constraint.
2477 * A lower bound on div2
2481 * can be replaced by
2483 * (n * (m div 2 + div1) + m t + n f)/g >= 0
2485 * with g = gcd(m,n).
2490 * can be replaced by
2492 * (-n * (m div2 + div1) + m t + n f')/g >= 0
2494 * These constraint are those that we would obtain from eliminating
2495 * div1 using Fourier-Motzkin.
2497 * After all constraints have been modified, we drop the lower and upper
2498 * bound and then drop div1.
2500 static struct isl_basic_map *coalesce_divs(struct isl_basic_map *bmap,
2501 unsigned div1, unsigned div2, unsigned l, unsigned u)
2506 unsigned dim, total;
2509 dim = isl_space_dim(bmap->dim, isl_dim_all);
2510 total = 1 + dim + bmap->n_div;
2515 isl_int_add(m, bmap->ineq[l][0], bmap->ineq[u][0]);
2516 isl_int_add_ui(m, m, 1);
2518 for (i = 0; i < bmap->n_ineq; ++i) {
2519 if (i == l || i == u)
2521 if (isl_int_is_zero(bmap->ineq[i][1 + dim + div2]))
2523 if (isl_int_is_zero(bmap->ineq[i][1 + dim + div1])) {
2524 isl_int_gcd(b, m, bmap->ineq[i][1 + dim + div2]);
2525 isl_int_divexact(a, m, b);
2526 isl_int_divexact(b, bmap->ineq[i][1 + dim + div2], b);
2527 if (isl_int_is_pos(b)) {
2528 isl_seq_combine(bmap->ineq[i], a, bmap->ineq[i],
2529 b, bmap->ineq[l], total);
2532 isl_seq_combine(bmap->ineq[i], a, bmap->ineq[i],
2533 b, bmap->ineq[u], total);
2536 isl_int_set(bmap->ineq[i][1 + dim + div2],
2537 bmap->ineq[i][1 + dim + div1]);
2538 isl_int_set_si(bmap->ineq[i][1 + dim + div1], 0);
2545 isl_basic_map_drop_inequality(bmap, l);
2546 isl_basic_map_drop_inequality(bmap, u);
2548 isl_basic_map_drop_inequality(bmap, u);
2549 isl_basic_map_drop_inequality(bmap, l);
2551 bmap = isl_basic_map_drop_div(bmap, div1);
2555 /* First check if we can coalesce any pair of divs and
2556 * then continue with dropping more redundant divs.
2558 * We loop over all pairs of lower and upper bounds on a div
2559 * with coefficient 1 and -1, respectively, check if there
2560 * is any other div "c" with which we can coalesce the div
2561 * and if so, perform the coalescing.
2563 static struct isl_basic_map *coalesce_or_drop_more_redundant_divs(
2564 struct isl_basic_map *bmap, int *pairs, int n)
2569 dim = isl_space_dim(bmap->dim, isl_dim_all);
2571 for (i = 0; i < bmap->n_div; ++i) {
2574 for (l = 0; l < bmap->n_ineq; ++l) {
2575 if (!isl_int_is_one(bmap->ineq[l][1 + dim + i]))
2577 for (u = 0; u < bmap->n_ineq; ++u) {
2580 if (!isl_int_is_negone(bmap->ineq[u][1+dim+i]))
2582 c = div_find_coalesce(bmap, pairs, i, l, u);
2586 bmap = coalesce_divs(bmap, i, c, l, u);
2587 return isl_basic_map_drop_redundant_divs(bmap);
2592 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
2595 return drop_more_redundant_divs(bmap, pairs, n);
2598 /* Remove divs that are not strictly needed.
2599 * In particular, if a div only occurs positively (or negatively)
2600 * in constraints, then it can simply be dropped.
2601 * Also, if a div occurs only occurs in two constraints and if moreover
2602 * those two constraints are opposite to each other, except for the constant
2603 * term and if the sum of the constant terms is such that for any value
2604 * of the other values, there is always at least one integer value of the
2605 * div, i.e., if one plus this sum is greater than or equal to
2606 * the (absolute value) of the coefficent of the div in the constraints,
2607 * then we can also simply drop the div.
2609 * If any divs are left after these simple checks then we move on
2610 * to more complicated cases in drop_more_redundant_divs.
2612 struct isl_basic_map *isl_basic_map_drop_redundant_divs(
2613 struct isl_basic_map *bmap)
2623 off = isl_space_dim(bmap->dim, isl_dim_all);
2624 pairs = isl_calloc_array(bmap->ctx, int, bmap->n_div);
2628 for (i = 0; i < bmap->n_div; ++i) {
2630 int last_pos, last_neg;
2634 defined = !isl_int_is_zero(bmap->div[i][0]);
2635 for (j = 0; j < bmap->n_eq; ++j)
2636 if (!isl_int_is_zero(bmap->eq[j][1 + off + i]))
2642 for (j = 0; j < bmap->n_ineq; ++j) {
2643 if (isl_int_is_pos(bmap->ineq[j][1 + off + i])) {
2647 if (isl_int_is_neg(bmap->ineq[j][1 + off + i])) {
2652 pairs[i] = pos * neg;
2653 if (pairs[i] == 0) {
2654 for (j = bmap->n_ineq - 1; j >= 0; --j)
2655 if (!isl_int_is_zero(bmap->ineq[j][1+off+i]))
2656 isl_basic_map_drop_inequality(bmap, j);
2657 bmap = isl_basic_map_drop_div(bmap, i);
2659 return isl_basic_map_drop_redundant_divs(bmap);
2663 if (!isl_seq_is_neg(bmap->ineq[last_pos] + 1,
2664 bmap->ineq[last_neg] + 1,
2668 isl_int_add(bmap->ineq[last_pos][0],
2669 bmap->ineq[last_pos][0], bmap->ineq[last_neg][0]);
2670 isl_int_add_ui(bmap->ineq[last_pos][0],
2671 bmap->ineq[last_pos][0], 1);
2672 redundant = isl_int_ge(bmap->ineq[last_pos][0],
2673 bmap->ineq[last_pos][1+off+i]);
2674 isl_int_sub_ui(bmap->ineq[last_pos][0],
2675 bmap->ineq[last_pos][0], 1);
2676 isl_int_sub(bmap->ineq[last_pos][0],
2677 bmap->ineq[last_pos][0], bmap->ineq[last_neg][0]);
2680 !ok_to_set_div_from_bound(bmap, i, last_pos)) {
2685 bmap = set_div_from_lower_bound(bmap, i, last_pos);
2686 bmap = isl_basic_map_simplify(bmap);
2688 return isl_basic_map_drop_redundant_divs(bmap);
2690 if (last_pos > last_neg) {
2691 isl_basic_map_drop_inequality(bmap, last_pos);
2692 isl_basic_map_drop_inequality(bmap, last_neg);
2694 isl_basic_map_drop_inequality(bmap, last_neg);
2695 isl_basic_map_drop_inequality(bmap, last_pos);
2697 bmap = isl_basic_map_drop_div(bmap, i);
2699 return isl_basic_map_drop_redundant_divs(bmap);
2703 return coalesce_or_drop_more_redundant_divs(bmap, pairs, n);
2709 isl_basic_map_free(bmap);
2713 struct isl_basic_set *isl_basic_set_drop_redundant_divs(
2714 struct isl_basic_set *bset)
2716 return (struct isl_basic_set *)
2717 isl_basic_map_drop_redundant_divs((struct isl_basic_map *)bset);
2720 struct isl_map *isl_map_drop_redundant_divs(struct isl_map *map)
2726 for (i = 0; i < map->n; ++i) {
2727 map->p[i] = isl_basic_map_drop_redundant_divs(map->p[i]);
2731 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2738 struct isl_set *isl_set_drop_redundant_divs(struct isl_set *set)
2740 return (struct isl_set *)
2741 isl_map_drop_redundant_divs((struct isl_map *)set);