2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
13 #include "isl_map_private.h"
17 #define STATUS_ERROR -1
18 #define STATUS_REDUNDANT 1
19 #define STATUS_VALID 2
20 #define STATUS_SEPARATE 3
22 #define STATUS_ADJ_EQ 5
23 #define STATUS_ADJ_INEQ 6
25 static int status_in(isl_int *ineq, struct isl_tab *tab)
27 enum isl_ineq_type type = isl_tab_ineq_type(tab, ineq);
29 case isl_ineq_error: return STATUS_ERROR;
30 case isl_ineq_redundant: return STATUS_VALID;
31 case isl_ineq_separate: return STATUS_SEPARATE;
32 case isl_ineq_cut: return STATUS_CUT;
33 case isl_ineq_adj_eq: return STATUS_ADJ_EQ;
34 case isl_ineq_adj_ineq: return STATUS_ADJ_INEQ;
38 /* Compute the position of the equalities of basic map "i"
39 * with respect to basic map "j".
40 * The resulting array has twice as many entries as the number
41 * of equalities corresponding to the two inequalties to which
42 * each equality corresponds.
44 static int *eq_status_in(struct isl_map *map, int i, int j,
45 struct isl_tab **tabs)
48 int *eq = isl_calloc_array(map->ctx, int, 2 * map->p[i]->n_eq);
51 dim = isl_basic_map_total_dim(map->p[i]);
52 for (k = 0; k < map->p[i]->n_eq; ++k) {
53 for (l = 0; l < 2; ++l) {
54 isl_seq_neg(map->p[i]->eq[k], map->p[i]->eq[k], 1+dim);
55 eq[2 * k + l] = status_in(map->p[i]->eq[k], tabs[j]);
56 if (eq[2 * k + l] == STATUS_ERROR)
59 if (eq[2 * k] == STATUS_SEPARATE ||
60 eq[2 * k + 1] == STATUS_SEPARATE)
70 /* Compute the position of the inequalities of basic map "i"
71 * with respect to basic map "j".
73 static int *ineq_status_in(struct isl_map *map, int i, int j,
74 struct isl_tab **tabs)
77 unsigned n_eq = map->p[i]->n_eq;
78 int *ineq = isl_calloc_array(map->ctx, int, map->p[i]->n_ineq);
80 for (k = 0; k < map->p[i]->n_ineq; ++k) {
81 if (isl_tab_is_redundant(tabs[i], n_eq + k)) {
82 ineq[k] = STATUS_REDUNDANT;
85 ineq[k] = status_in(map->p[i]->ineq[k], tabs[j]);
86 if (ineq[k] == STATUS_ERROR)
88 if (ineq[k] == STATUS_SEPARATE)
98 static int any(int *con, unsigned len, int status)
102 for (i = 0; i < len ; ++i)
103 if (con[i] == status)
108 static int count(int *con, unsigned len, int status)
113 for (i = 0; i < len ; ++i)
114 if (con[i] == status)
119 static int all(int *con, unsigned len, int status)
123 for (i = 0; i < len ; ++i) {
124 if (con[i] == STATUS_REDUNDANT)
126 if (con[i] != status)
132 static void drop(struct isl_map *map, int i, struct isl_tab **tabs)
134 isl_basic_map_free(map->p[i]);
135 isl_tab_free(tabs[i]);
137 if (i != map->n - 1) {
138 map->p[i] = map->p[map->n - 1];
139 tabs[i] = tabs[map->n - 1];
141 tabs[map->n - 1] = NULL;
145 /* Replace the pair of basic maps i and j by the basic map bounded
146 * by the valid constraints in both basic maps and the constraint
147 * in extra (if not NULL).
149 static int fuse(struct isl_map *map, int i, int j,
150 struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j,
151 __isl_keep isl_mat *extra)
154 struct isl_basic_map *fused = NULL;
155 struct isl_tab *fused_tab = NULL;
156 unsigned total = isl_basic_map_total_dim(map->p[i]);
157 unsigned extra_rows = extra ? extra->n_row : 0;
159 fused = isl_basic_map_alloc_dim(isl_dim_copy(map->p[i]->dim),
161 map->p[i]->n_eq + map->p[j]->n_eq,
162 map->p[i]->n_ineq + map->p[j]->n_ineq + extra_rows);
166 for (k = 0; k < map->p[i]->n_eq; ++k) {
167 if (eq_i && (eq_i[2 * k] != STATUS_VALID ||
168 eq_i[2 * k + 1] != STATUS_VALID))
170 l = isl_basic_map_alloc_equality(fused);
173 isl_seq_cpy(fused->eq[l], map->p[i]->eq[k], 1 + total);
176 for (k = 0; k < map->p[j]->n_eq; ++k) {
177 if (eq_j && (eq_j[2 * k] != STATUS_VALID ||
178 eq_j[2 * k + 1] != STATUS_VALID))
180 l = isl_basic_map_alloc_equality(fused);
183 isl_seq_cpy(fused->eq[l], map->p[j]->eq[k], 1 + total);
186 for (k = 0; k < map->p[i]->n_ineq; ++k) {
187 if (ineq_i[k] != STATUS_VALID)
189 l = isl_basic_map_alloc_inequality(fused);
192 isl_seq_cpy(fused->ineq[l], map->p[i]->ineq[k], 1 + total);
195 for (k = 0; k < map->p[j]->n_ineq; ++k) {
196 if (ineq_j[k] != STATUS_VALID)
198 l = isl_basic_map_alloc_inequality(fused);
201 isl_seq_cpy(fused->ineq[l], map->p[j]->ineq[k], 1 + total);
204 for (k = 0; k < map->p[i]->n_div; ++k) {
205 int l = isl_basic_map_alloc_div(fused);
208 isl_seq_cpy(fused->div[l], map->p[i]->div[k], 1 + 1 + total);
211 for (k = 0; k < extra_rows; ++k) {
212 l = isl_basic_map_alloc_inequality(fused);
215 isl_seq_cpy(fused->ineq[l], extra->row[k], 1 + total);
218 fused = isl_basic_map_gauss(fused, NULL);
219 ISL_F_SET(fused, ISL_BASIC_MAP_FINAL);
220 if (ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_RATIONAL) &&
221 ISL_F_ISSET(map->p[j], ISL_BASIC_MAP_RATIONAL))
222 ISL_F_SET(fused, ISL_BASIC_MAP_RATIONAL);
224 fused_tab = isl_tab_from_basic_map(fused);
225 if (isl_tab_detect_redundant(fused_tab) < 0)
228 isl_basic_map_free(map->p[i]);
230 isl_tab_free(tabs[i]);
236 isl_tab_free(fused_tab);
237 isl_basic_map_free(fused);
241 /* Given a pair of basic maps i and j such that all constraints are either
242 * "valid" or "cut", check if the facets corresponding to the "cut"
243 * constraints of i lie entirely within basic map j.
244 * If so, replace the pair by the basic map consisting of the valid
245 * constraints in both basic maps.
247 * To see that we are not introducing any extra points, call the
248 * two basic maps A and B and the resulting map U and let x
249 * be an element of U \setminus ( A \cup B ).
250 * Then there is a pair of cut constraints c_1 and c_2 in A and B such that x
251 * violates them. Let X be the intersection of U with the opposites
252 * of these constraints. Then x \in X.
253 * The facet corresponding to c_1 contains the corresponding facet of A.
254 * This facet is entirely contained in B, so c_2 is valid on the facet.
255 * However, since it is also (part of) a facet of X, -c_2 is also valid
256 * on the facet. This means c_2 is saturated on the facet, so c_1 and
257 * c_2 must be opposites of each other, but then x could not violate
260 static int check_facets(struct isl_map *map, int i, int j,
261 struct isl_tab **tabs, int *ineq_i, int *ineq_j)
264 struct isl_tab_undo *snap;
265 unsigned n_eq = map->p[i]->n_eq;
267 snap = isl_tab_snap(tabs[i]);
269 for (k = 0; k < map->p[i]->n_ineq; ++k) {
270 if (ineq_i[k] != STATUS_CUT)
272 tabs[i] = isl_tab_select_facet(tabs[i], n_eq + k);
273 for (l = 0; l < map->p[j]->n_ineq; ++l) {
275 if (ineq_j[l] != STATUS_CUT)
277 stat = status_in(map->p[j]->ineq[l], tabs[i]);
278 if (stat != STATUS_VALID)
281 if (isl_tab_rollback(tabs[i], snap) < 0)
283 if (l < map->p[j]->n_ineq)
287 if (k < map->p[i]->n_ineq)
290 return fuse(map, i, j, tabs, NULL, ineq_i, NULL, ineq_j, NULL);
293 /* Both basic maps have at least one inequality with and adjacent
294 * (but opposite) inequality in the other basic map.
295 * Check that there are no cut constraints and that there is only
296 * a single pair of adjacent inequalities.
297 * If so, we can replace the pair by a single basic map described
298 * by all but the pair of adjacent inequalities.
299 * Any additional points introduced lie strictly between the two
300 * adjacent hyperplanes and can therefore be integral.
309 * The test for a single pair of adjancent inequalities is important
310 * for avoiding the combination of two basic maps like the following
320 static int check_adj_ineq(struct isl_map *map, int i, int j,
321 struct isl_tab **tabs, int *ineq_i, int *ineq_j)
325 if (any(ineq_i, map->p[i]->n_ineq, STATUS_CUT) ||
326 any(ineq_j, map->p[j]->n_ineq, STATUS_CUT))
329 else if (count(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ) == 1 &&
330 count(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ) == 1)
331 changed = fuse(map, i, j, tabs, NULL, ineq_i, NULL, ineq_j, NULL);
332 /* else ADJ INEQ TOO MANY */
337 /* Check if basic map "i" contains the basic map represented
338 * by the tableau "tab".
340 static int contains(struct isl_map *map, int i, int *ineq_i,
346 dim = isl_basic_map_total_dim(map->p[i]);
347 for (k = 0; k < map->p[i]->n_eq; ++k) {
348 for (l = 0; l < 2; ++l) {
350 isl_seq_neg(map->p[i]->eq[k], map->p[i]->eq[k], 1+dim);
351 stat = status_in(map->p[i]->eq[k], tab);
352 if (stat != STATUS_VALID)
357 for (k = 0; k < map->p[i]->n_ineq; ++k) {
359 if (ineq_i[k] == STATUS_REDUNDANT)
361 stat = status_in(map->p[i]->ineq[k], tab);
362 if (stat != STATUS_VALID)
368 /* Basic map "i" has an inequality "k" that is adjacent to some equality
369 * of basic map "j". All the other inequalities are valid for "j".
370 * Check if basic map "j" forms an extension of basic map "i".
372 * In particular, we relax constraint "k", compute the corresponding
373 * facet and check whether it is included in the other basic map.
374 * If so, we know that relaxing the constraint extends the basic
375 * map with exactly the other basic map (we already know that this
376 * other basic map is included in the extension, because there
377 * were no "cut" inequalities in "i") and we can replace the
378 * two basic maps by thie extension.
386 static int is_extension(struct isl_map *map, int i, int j, int k,
387 struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j)
391 struct isl_tab_undo *snap, *snap2;
392 unsigned n_eq = map->p[i]->n_eq;
394 snap = isl_tab_snap(tabs[i]);
395 tabs[i] = isl_tab_relax(tabs[i], n_eq + k);
396 snap2 = isl_tab_snap(tabs[i]);
397 tabs[i] = isl_tab_select_facet(tabs[i], n_eq + k);
398 super = contains(map, j, ineq_j, tabs[i]);
400 if (isl_tab_rollback(tabs[i], snap2) < 0)
402 map->p[i] = isl_basic_map_cow(map->p[i]);
405 isl_int_add_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1);
406 ISL_F_SET(map->p[i], ISL_BASIC_MAP_FINAL);
410 if (isl_tab_rollback(tabs[i], snap) < 0)
416 /* For each non-redundant constraint in "bmap" (as determined by "tab"),
417 * wrap the constraint around "bound" such that it includes the whole
418 * set "set" and append the resulting constraint to "wraps".
419 * "wraps" is assumed to have been pre-allocated to the appropriate size.
420 * wraps->n_row is the number of actual wrapped constraints that have
422 * If any of the wrapping problems results in a constraint that is
423 * identical to "bound", then this means that "set" is unbounded in such
424 * way that no wrapping is possible. If this happens then wraps->n_row
427 static int add_wraps(__isl_keep isl_mat *wraps, __isl_keep isl_basic_map *bmap,
428 struct isl_tab *tab, isl_int *bound, __isl_keep isl_set *set)
432 unsigned total = isl_basic_map_total_dim(bmap);
436 for (l = 0; l < bmap->n_ineq; ++l) {
437 if (isl_seq_is_neg(bound, bmap->ineq[l], 1 + total))
439 if (isl_seq_eq(bound, bmap->ineq[l], 1 + total))
441 if (isl_tab_is_redundant(tab, bmap->n_eq + l))
444 isl_seq_cpy(wraps->row[w], bound, 1 + total);
445 if (!isl_set_wrap_facet(set, wraps->row[w], bmap->ineq[l]))
447 if (isl_seq_eq(wraps->row[w], bound, 1 + total))
451 for (l = 0; l < bmap->n_eq; ++l) {
452 if (isl_seq_is_neg(bound, bmap->eq[l], 1 + total))
454 if (isl_seq_eq(bound, bmap->eq[l], 1 + total))
457 isl_seq_cpy(wraps->row[w], bound, 1 + total);
458 isl_seq_neg(wraps->row[w + 1], bmap->eq[l], 1 + total);
459 if (!isl_set_wrap_facet(set, wraps->row[w], wraps->row[w + 1]))
461 if (isl_seq_eq(wraps->row[w], bound, 1 + total))
465 isl_seq_cpy(wraps->row[w], bound, 1 + total);
466 if (!isl_set_wrap_facet(set, wraps->row[w], bmap->eq[l]))
468 if (isl_seq_eq(wraps->row[w], bound, 1 + total))
480 /* Return a set that corresponds to the non-redudant constraints
481 * (as recorded in tab) of bmap.
483 * It's important to remove the redundant constraints as some
484 * of the other constraints may have been modified after the
485 * constraints were marked redundant.
486 * In particular, a constraint may have been relaxed.
487 * Redundant constraints are ignored when a constraint is relaxed
488 * and should therefore continue to be ignored ever after.
489 * Otherwise, the relaxation might be thwarted by some of
492 static __isl_give isl_set *set_from_updated_bmap(__isl_keep isl_basic_map *bmap,
495 bmap = isl_basic_map_copy(bmap);
496 bmap = isl_basic_map_cow(bmap);
497 bmap = isl_basic_map_update_from_tab(bmap, tab);
498 return isl_set_from_basic_set(isl_basic_map_underlying_set(bmap));
501 /* Given a basic set i with a constraint k that is adjacent to either the
502 * whole of basic set j or a facet of basic set j, check if we can wrap
503 * both the facet corresponding to k and the facet of j (or the whole of j)
504 * around their ridges to include the other set.
505 * If so, replace the pair of basic sets by their union.
507 * All constraints of i (except k) are assumed to be valid for j.
509 * In the case where j has a facet adjacent to i, tab[j] is assumed
510 * to have been restricted to this facet, so that the non-redundant
511 * constraints in tab[j] are the ridges of the facet.
512 * Note that for the purpose of wrapping, it does not matter whether
513 * we wrap the ridges of i around the whole of j or just around
514 * the facet since all the other constraints are assumed to be valid for j.
515 * In practice, we wrap to include the whole of j.
524 static int can_wrap_in_facet(struct isl_map *map, int i, int j, int k,
525 struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j)
528 struct isl_mat *wraps = NULL;
529 struct isl_set *set_i = NULL;
530 struct isl_set *set_j = NULL;
531 struct isl_vec *bound = NULL;
532 unsigned total = isl_basic_map_total_dim(map->p[i]);
533 struct isl_tab_undo *snap;
535 snap = isl_tab_snap(tabs[i]);
537 set_i = set_from_updated_bmap(map->p[i], tabs[i]);
538 set_j = set_from_updated_bmap(map->p[j], tabs[j]);
539 wraps = isl_mat_alloc(map->ctx, 2 * (map->p[i]->n_eq + map->p[j]->n_eq) +
540 map->p[i]->n_ineq + map->p[j]->n_ineq,
542 bound = isl_vec_alloc(map->ctx, 1 + total);
543 if (!set_i || !set_j || !wraps || !bound)
546 isl_seq_cpy(bound->el, map->p[i]->ineq[k], 1 + total);
547 isl_int_add_ui(bound->el[0], bound->el[0], 1);
549 isl_seq_cpy(wraps->row[0], bound->el, 1 + total);
552 if (add_wraps(wraps, map->p[j], tabs[j], bound->el, set_i) < 0)
557 tabs[i] = isl_tab_select_facet(tabs[i], map->p[i]->n_eq + k);
558 if (isl_tab_detect_redundant(tabs[i]) < 0)
561 isl_seq_neg(bound->el, map->p[i]->ineq[k], 1 + total);
563 if (add_wraps(wraps, map->p[i], tabs[i], bound->el, set_j) < 0)
568 changed = fuse(map, i, j, tabs, eq_i, ineq_i, eq_j, ineq_j, wraps);
572 if (isl_tab_rollback(tabs[i], snap) < 0)
592 /* Given two basic sets i and j such that i has exactly one cut constraint,
593 * check if we can wrap the corresponding facet around its ridges to include
594 * the other basic set (and nothing else).
595 * If so, replace the pair by their union.
597 * We first check if j has a facet adjacent to the cut constraint of i.
598 * If so, we try to wrap in the facet.
606 static int can_wrap_in_set(struct isl_map *map, int i, int j,
607 struct isl_tab **tabs, int *ineq_i, int *ineq_j)
611 unsigned total = isl_basic_map_total_dim(map->p[i]);
612 struct isl_tab_undo *snap;
614 for (k = 0; k < map->p[i]->n_ineq; ++k)
615 if (ineq_i[k] == STATUS_CUT)
618 isl_assert(map->ctx, k < map->p[i]->n_ineq, return -1);
620 isl_int_add_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1);
621 for (l = 0; l < map->p[j]->n_ineq; ++l) {
622 if (isl_tab_is_redundant(tabs[j], map->p[j]->n_eq + l))
624 if (isl_seq_eq(map->p[i]->ineq[k],
625 map->p[j]->ineq[l], 1 + total))
628 isl_int_sub_ui(map->p[i]->ineq[k][0], map->p[i]->ineq[k][0], 1);
630 if (l >= map->p[j]->n_ineq)
633 snap = isl_tab_snap(tabs[j]);
634 tabs[j] = isl_tab_select_facet(tabs[j], map->p[j]->n_eq + l);
635 if (isl_tab_detect_redundant(tabs[j]) < 0)
638 changed = can_wrap_in_facet(map, i, j, k, tabs, NULL, ineq_i, NULL, ineq_j);
640 if (!changed && isl_tab_rollback(tabs[j], snap) < 0)
646 /* Check if either i or j has a single cut constraint that can
647 * be used to wrap in (a facet of) the other basic set.
648 * if so, replace the pair by their union.
650 static int check_wrap(struct isl_map *map, int i, int j,
651 struct isl_tab **tabs, int *ineq_i, int *ineq_j)
655 if (count(ineq_i, map->p[i]->n_ineq, STATUS_CUT) == 1)
656 changed = can_wrap_in_set(map, i, j, tabs, ineq_i, ineq_j);
660 if (count(ineq_j, map->p[j]->n_ineq, STATUS_CUT) == 1)
661 changed = can_wrap_in_set(map, j, i, tabs, ineq_j, ineq_i);
665 /* At least one of the basic maps has an equality that is adjacent
666 * to inequality. Make sure that only one of the basic maps has
667 * such an equality and that the other basic map has exactly one
668 * inequality adjacent to an equality.
669 * We call the basic map that has the inequality "i" and the basic
670 * map that has the equality "j".
671 * If "i" has any "cut" inequality, then relaxing the inequality
672 * by one would not result in a basic map that contains the other
675 static int check_adj_eq(struct isl_map *map, int i, int j,
676 struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j)
681 if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ) &&
682 any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ))
683 /* ADJ EQ TOO MANY */
686 if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ))
687 return check_adj_eq(map, j, i, tabs,
688 eq_j, ineq_j, eq_i, ineq_i);
690 /* j has an equality adjacent to an inequality in i */
692 if (any(ineq_i, map->p[i]->n_ineq, STATUS_CUT))
695 if (count(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ) != 1 ||
696 count(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_EQ) != 1 ||
697 any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_EQ) ||
698 any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ) ||
699 any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ))
700 /* ADJ EQ TOO MANY */
703 for (k = 0; k < map->p[i]->n_ineq ; ++k)
704 if (ineq_i[k] == STATUS_ADJ_EQ)
707 changed = is_extension(map, i, j, k, tabs, eq_i, ineq_i, eq_j, ineq_j);
711 changed = can_wrap_in_facet(map, i, j, k, tabs, eq_i, ineq_i, eq_j, ineq_j);
716 /* Check if the union of the given pair of basic maps
717 * can be represented by a single basic map.
718 * If so, replace the pair by the single basic map and return 1.
719 * Otherwise, return 0;
721 * We first check the effect of each constraint of one basic map
722 * on the other basic map.
723 * The constraint may be
724 * redundant the constraint is redundant in its own
725 * basic map and should be ignore and removed
727 * valid all (integer) points of the other basic map
728 * satisfy the constraint
729 * separate no (integer) point of the other basic map
730 * satisfies the constraint
731 * cut some but not all points of the other basic map
732 * satisfy the constraint
733 * adj_eq the given constraint is adjacent (on the outside)
734 * to an equality of the other basic map
735 * adj_ineq the given constraint is adjacent (on the outside)
736 * to an inequality of the other basic map
738 * We consider six cases in which we can replace the pair by a single
739 * basic map. We ignore all "redundant" constraints.
741 * 1. all constraints of one basic map are valid
742 * => the other basic map is a subset and can be removed
744 * 2. all constraints of both basic maps are either "valid" or "cut"
745 * and the facets corresponding to the "cut" constraints
746 * of one of the basic maps lies entirely inside the other basic map
747 * => the pair can be replaced by a basic map consisting
748 * of the valid constraints in both basic maps
750 * 3. there is a single pair of adjacent inequalities
751 * (all other constraints are "valid")
752 * => the pair can be replaced by a basic map consisting
753 * of the valid constraints in both basic maps
755 * 4. there is a single adjacent pair of an inequality and an equality,
756 * the other constraints of the basic map containing the inequality are
757 * "valid". Moreover, if the inequality the basic map is relaxed
758 * and then turned into an equality, then resulting facet lies
759 * entirely inside the other basic map
760 * => the pair can be replaced by the basic map containing
761 * the inequality, with the inequality relaxed.
763 * 5. there is a single adjacent pair of an inequality and an equality,
764 * the other constraints of the basic map containing the inequality are
765 * "valid". Moreover, the facets corresponding to both
766 * the inequality and the equality can be wrapped around their
767 * ridges to include the other basic map
768 * => the pair can be replaced by a basic map consisting
769 * of the valid constraints in both basic maps together
770 * with all wrapping constraints
772 * 6. one of the basic maps has a single cut constraint and
773 * the other basic map has a constraint adjacent to this constraint.
774 * Moreover, the facets corresponding to both constraints
775 * can be wrapped around their ridges to include the other basic map
776 * => the pair can be replaced by a basic map consisting
777 * of the valid constraints in both basic maps together
778 * with all wrapping constraints
780 * Throughout the computation, we maintain a collection of tableaus
781 * corresponding to the basic maps. When the basic maps are dropped
782 * or combined, the tableaus are modified accordingly.
784 static int coalesce_pair(struct isl_map *map, int i, int j,
785 struct isl_tab **tabs)
793 eq_i = eq_status_in(map, i, j, tabs);
794 if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ERROR))
796 if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_SEPARATE))
799 eq_j = eq_status_in(map, j, i, tabs);
800 if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_ERROR))
802 if (any(eq_j, 2 * map->p[j]->n_eq, STATUS_SEPARATE))
805 ineq_i = ineq_status_in(map, i, j, tabs);
806 if (any(ineq_i, map->p[i]->n_ineq, STATUS_ERROR))
808 if (any(ineq_i, map->p[i]->n_ineq, STATUS_SEPARATE))
811 ineq_j = ineq_status_in(map, j, i, tabs);
812 if (any(ineq_j, map->p[j]->n_ineq, STATUS_ERROR))
814 if (any(ineq_j, map->p[j]->n_ineq, STATUS_SEPARATE))
817 if (all(eq_i, 2 * map->p[i]->n_eq, STATUS_VALID) &&
818 all(ineq_i, map->p[i]->n_ineq, STATUS_VALID)) {
821 } else if (all(eq_j, 2 * map->p[j]->n_eq, STATUS_VALID) &&
822 all(ineq_j, map->p[j]->n_ineq, STATUS_VALID)) {
825 } else if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_CUT) ||
826 any(eq_j, 2 * map->p[j]->n_eq, STATUS_CUT)) {
828 } else if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_EQ) ||
829 any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_EQ)) {
831 } else if (any(eq_i, 2 * map->p[i]->n_eq, STATUS_ADJ_INEQ) ||
832 any(eq_j, 2 * map->p[j]->n_eq, STATUS_ADJ_INEQ)) {
833 changed = check_adj_eq(map, i, j, tabs,
834 eq_i, ineq_i, eq_j, ineq_j);
835 } else if (any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_EQ) ||
836 any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_EQ)) {
839 } else if (any(ineq_i, map->p[i]->n_ineq, STATUS_ADJ_INEQ) ||
840 any(ineq_j, map->p[j]->n_ineq, STATUS_ADJ_INEQ)) {
841 changed = check_adj_ineq(map, i, j, tabs, ineq_i, ineq_j);
843 changed = check_facets(map, i, j, tabs, ineq_i, ineq_j);
845 changed = check_wrap(map, i, j, tabs, ineq_i, ineq_j);
862 static struct isl_map *coalesce(struct isl_map *map, struct isl_tab **tabs)
866 for (i = map->n - 2; i >= 0; --i)
868 for (j = i + 1; j < map->n; ++j) {
870 changed = coalesce_pair(map, i, j, tabs);
882 /* For each pair of basic maps in the map, check if the union of the two
883 * can be represented by a single basic map.
884 * If so, replace the pair by the single basic map and start over.
886 struct isl_map *isl_map_coalesce(struct isl_map *map)
890 struct isl_tab **tabs = NULL;
898 map = isl_map_align_divs(map);
900 tabs = isl_calloc_array(map->ctx, struct isl_tab *, map->n);
905 for (i = 0; i < map->n; ++i) {
906 tabs[i] = isl_tab_from_basic_map(map->p[i]);
909 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_NO_IMPLICIT))
910 tabs[i] = isl_tab_detect_implicit_equalities(tabs[i]);
911 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_NO_REDUNDANT))
912 if (isl_tab_detect_redundant(tabs[i]) < 0)
915 for (i = map->n - 1; i >= 0; --i)
919 map = coalesce(map, tabs);
922 for (i = 0; i < map->n; ++i) {
923 map->p[i] = isl_basic_map_update_from_tab(map->p[i],
925 map->p[i] = isl_basic_map_finalize(map->p[i]);
928 ISL_F_SET(map->p[i], ISL_BASIC_MAP_NO_IMPLICIT);
929 ISL_F_SET(map->p[i], ISL_BASIC_MAP_NO_REDUNDANT);
932 for (i = 0; i < n; ++i)
933 isl_tab_free(tabs[i]);
940 for (i = 0; i < n; ++i)
941 isl_tab_free(tabs[i]);
946 /* For each pair of basic sets in the set, check if the union of the two
947 * can be represented by a single basic set.
948 * If so, replace the pair by the single basic set and start over.
950 struct isl_set *isl_set_coalesce(struct isl_set *set)
952 return (struct isl_set *)isl_map_coalesce((struct isl_map *)set);