2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2020 Cerebras Systems
9 * Use of this software is governed by the MIT license
11 * Written by Sven Verdoolaege, K.U.Leuven, Departement
12 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
13 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
14 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 * and Inria Paris - Rocquencourt, Domaine de Voluceau - Rocquencourt,
17 * B.P. 105 - 78153 Le Chesnay, France
18 * and Centre de Recherche Inria de Paris, 2 rue Simone Iff - Voie DQ12,
19 * CS 42112, 75589 Paris Cedex 12, France
20 * and Cerebras Systems, 175 S San Antonio Rd, Los Altos, CA, USA
23 #include <isl_ctx_private.h>
24 #include "isl_map_private.h"
26 #include <isl/options.h>
28 #include <isl_mat_private.h>
29 #include <isl_local_space_private.h>
30 #include <isl_val_private.h>
31 #include <isl_vec_private.h>
32 #include <isl_aff_private.h>
33 #include <isl_equalities.h>
34 #include <isl_constraint_private.h>
36 #include <set_to_map.c>
37 #include <set_from_map.c>
39 #define STATUS_ERROR -1
40 #define STATUS_REDUNDANT 1
41 #define STATUS_VALID 2
42 #define STATUS_SEPARATE 3
44 #define STATUS_ADJ_EQ 5
45 #define STATUS_ADJ_INEQ 6
47 static int status_in(isl_int
*ineq
, struct isl_tab
*tab
)
49 enum isl_ineq_type type
= isl_tab_ineq_type(tab
, ineq
);
52 case isl_ineq_error
: return STATUS_ERROR
;
53 case isl_ineq_redundant
: return STATUS_VALID
;
54 case isl_ineq_separate
: return STATUS_SEPARATE
;
55 case isl_ineq_cut
: return STATUS_CUT
;
56 case isl_ineq_adj_eq
: return STATUS_ADJ_EQ
;
57 case isl_ineq_adj_ineq
: return STATUS_ADJ_INEQ
;
61 /* Compute the position of the equalities of basic map "bmap_i"
62 * with respect to the basic map represented by "tab_j".
63 * The resulting array has twice as many entries as the number
64 * of equalities corresponding to the two inequalities to which
65 * each equality corresponds.
67 static int *eq_status_in(__isl_keep isl_basic_map
*bmap_i
,
68 struct isl_tab
*tab_j
)
74 dim
= isl_basic_map_dim(bmap_i
, isl_dim_all
);
78 eq
= isl_calloc_array(bmap_i
->ctx
, int, 2 * bmap_i
->n_eq
);
82 for (k
= 0; k
< bmap_i
->n_eq
; ++k
) {
83 for (l
= 0; l
< 2; ++l
) {
84 isl_seq_neg(bmap_i
->eq
[k
], bmap_i
->eq
[k
], 1+dim
);
85 eq
[2 * k
+ l
] = status_in(bmap_i
->eq
[k
], tab_j
);
86 if (eq
[2 * k
+ l
] == STATUS_ERROR
)
97 /* Compute the position of the inequalities of basic map "bmap_i"
98 * (also represented by "tab_i", if not NULL) with respect to the basic map
99 * represented by "tab_j".
101 static int *ineq_status_in(__isl_keep isl_basic_map
*bmap_i
,
102 struct isl_tab
*tab_i
, struct isl_tab
*tab_j
)
105 unsigned n_eq
= bmap_i
->n_eq
;
106 int *ineq
= isl_calloc_array(bmap_i
->ctx
, int, bmap_i
->n_ineq
);
111 for (k
= 0; k
< bmap_i
->n_ineq
; ++k
) {
112 if (tab_i
&& isl_tab_is_redundant(tab_i
, n_eq
+ k
)) {
113 ineq
[k
] = STATUS_REDUNDANT
;
116 ineq
[k
] = status_in(bmap_i
->ineq
[k
], tab_j
);
117 if (ineq
[k
] == STATUS_ERROR
)
119 if (ineq
[k
] == STATUS_SEPARATE
)
129 static int any(int *con
, unsigned len
, int status
)
133 for (i
= 0; i
< len
; ++i
)
134 if (con
[i
] == status
)
139 /* Return the first position of "status" in the list "con" of length "len".
140 * Return -1 if there is no such entry.
142 static int find(int *con
, unsigned len
, int status
)
146 for (i
= 0; i
< len
; ++i
)
147 if (con
[i
] == status
)
152 static int count(int *con
, unsigned len
, int status
)
157 for (i
= 0; i
< len
; ++i
)
158 if (con
[i
] == status
)
163 static int all(int *con
, unsigned len
, int status
)
167 for (i
= 0; i
< len
; ++i
) {
168 if (con
[i
] == STATUS_REDUNDANT
)
170 if (con
[i
] != status
)
176 /* Internal information associated to a basic map in a map
177 * that is to be coalesced by isl_map_coalesce.
179 * "bmap" is the basic map itself (or NULL if "removed" is set)
180 * "tab" is the corresponding tableau (or NULL if "removed" is set)
181 * "hull_hash" identifies the affine space in which "bmap" lives.
182 * "modified" is set if this basic map may not be identical
183 * to any of the basic maps in the input.
184 * "removed" is set if this basic map has been removed from the map
185 * "simplify" is set if this basic map may have some unknown integer
186 * divisions that were not present in the input basic maps. The basic
187 * map should then be simplified such that we may be able to find
188 * a definition among the constraints.
190 * "eq" and "ineq" are only set if we are currently trying to coalesce
191 * this basic map with another basic map, in which case they represent
192 * the position of the inequalities of this basic map with respect to
193 * the other basic map. The number of elements in the "eq" array
194 * is twice the number of equalities in the "bmap", corresponding
195 * to the two inequalities that make up each equality.
197 struct isl_coalesce_info
{
208 /* Is there any (half of an) equality constraint in the description
209 * of the basic map represented by "info" that
210 * has position "status" with respect to the other basic map?
212 static int any_eq(struct isl_coalesce_info
*info
, int status
)
216 n_eq
= isl_basic_map_n_equality(info
->bmap
);
217 return any(info
->eq
, 2 * n_eq
, status
);
220 /* Is there any inequality constraint in the description
221 * of the basic map represented by "info" that
222 * has position "status" with respect to the other basic map?
224 static int any_ineq(struct isl_coalesce_info
*info
, int status
)
228 n_ineq
= isl_basic_map_n_inequality(info
->bmap
);
229 return any(info
->ineq
, n_ineq
, status
);
232 /* Return the position of the first half on an equality constraint
233 * in the description of the basic map represented by "info" that
234 * has position "status" with respect to the other basic map.
235 * The returned value is twice the position of the equality constraint
236 * plus zero for the negative half and plus one for the positive half.
237 * Return -1 if there is no such entry.
239 static int find_eq(struct isl_coalesce_info
*info
, int status
)
243 n_eq
= isl_basic_map_n_equality(info
->bmap
);
244 return find(info
->eq
, 2 * n_eq
, status
);
247 /* Return the position of the first inequality constraint in the description
248 * of the basic map represented by "info" that
249 * has position "status" with respect to the other basic map.
250 * Return -1 if there is no such entry.
252 static int find_ineq(struct isl_coalesce_info
*info
, int status
)
256 n_ineq
= isl_basic_map_n_inequality(info
->bmap
);
257 return find(info
->ineq
, n_ineq
, status
);
260 /* Return the number of (halves of) equality constraints in the description
261 * of the basic map represented by "info" that
262 * have position "status" with respect to the other basic map.
264 static int count_eq(struct isl_coalesce_info
*info
, int status
)
268 n_eq
= isl_basic_map_n_equality(info
->bmap
);
269 return count(info
->eq
, 2 * n_eq
, status
);
272 /* Return the number of inequality constraints in the description
273 * of the basic map represented by "info" that
274 * have position "status" with respect to the other basic map.
276 static int count_ineq(struct isl_coalesce_info
*info
, int status
)
280 n_ineq
= isl_basic_map_n_inequality(info
->bmap
);
281 return count(info
->ineq
, n_ineq
, status
);
284 /* Are all non-redundant constraints of the basic map represented by "info"
285 * either valid or cut constraints with respect to the other basic map?
287 static int all_valid_or_cut(struct isl_coalesce_info
*info
)
291 for (i
= 0; i
< 2 * info
->bmap
->n_eq
; ++i
) {
292 if (info
->eq
[i
] == STATUS_REDUNDANT
)
294 if (info
->eq
[i
] == STATUS_VALID
)
296 if (info
->eq
[i
] == STATUS_CUT
)
301 for (i
= 0; i
< info
->bmap
->n_ineq
; ++i
) {
302 if (info
->ineq
[i
] == STATUS_REDUNDANT
)
304 if (info
->ineq
[i
] == STATUS_VALID
)
306 if (info
->ineq
[i
] == STATUS_CUT
)
314 /* Compute the hash of the (apparent) affine hull of info->bmap (with
315 * the existentially quantified variables removed) and store it
318 static int coalesce_info_set_hull_hash(struct isl_coalesce_info
*info
)
323 hull
= isl_basic_map_copy(info
->bmap
);
324 hull
= isl_basic_map_plain_affine_hull(hull
);
325 n_div
= isl_basic_map_dim(hull
, isl_dim_div
);
327 hull
= isl_basic_map_free(hull
);
328 hull
= isl_basic_map_drop_constraints_involving_dims(hull
,
329 isl_dim_div
, 0, n_div
);
330 info
->hull_hash
= isl_basic_map_get_hash(hull
);
331 isl_basic_map_free(hull
);
333 return hull
? 0 : -1;
336 /* Free all the allocated memory in an array
337 * of "n" isl_coalesce_info elements.
339 static void clear_coalesce_info(int n
, struct isl_coalesce_info
*info
)
346 for (i
= 0; i
< n
; ++i
) {
347 isl_basic_map_free(info
[i
].bmap
);
348 isl_tab_free(info
[i
].tab
);
354 /* Clear the memory associated to "info".
356 static void clear(struct isl_coalesce_info
*info
)
358 info
->bmap
= isl_basic_map_free(info
->bmap
);
359 isl_tab_free(info
->tab
);
363 /* Drop the basic map represented by "info".
364 * That is, clear the memory associated to the entry and
365 * mark it as having been removed.
367 static void drop(struct isl_coalesce_info
*info
)
373 /* Exchange the information in "info1" with that in "info2".
375 static void exchange(struct isl_coalesce_info
*info1
,
376 struct isl_coalesce_info
*info2
)
378 struct isl_coalesce_info info
;
385 /* This type represents the kind of change that has been performed
386 * while trying to coalesce two basic maps.
388 * isl_change_none: nothing was changed
389 * isl_change_drop_first: the first basic map was removed
390 * isl_change_drop_second: the second basic map was removed
391 * isl_change_fuse: the two basic maps were replaced by a new basic map.
394 isl_change_error
= -1,
396 isl_change_drop_first
,
397 isl_change_drop_second
,
401 /* Update "change" based on an interchange of the first and the second
402 * basic map. That is, interchange isl_change_drop_first and
403 * isl_change_drop_second.
405 static enum isl_change
invert_change(enum isl_change change
)
408 case isl_change_error
:
409 return isl_change_error
;
410 case isl_change_none
:
411 return isl_change_none
;
412 case isl_change_drop_first
:
413 return isl_change_drop_second
;
414 case isl_change_drop_second
:
415 return isl_change_drop_first
;
416 case isl_change_fuse
:
417 return isl_change_fuse
;
420 return isl_change_error
;
423 /* Add the valid constraints of the basic map represented by "info"
424 * to "bmap". "len" is the size of the constraints.
425 * If only one of the pair of inequalities that make up an equality
426 * is valid, then add that inequality.
428 static __isl_give isl_basic_map
*add_valid_constraints(
429 __isl_take isl_basic_map
*bmap
, struct isl_coalesce_info
*info
,
437 for (k
= 0; k
< info
->bmap
->n_eq
; ++k
) {
438 if (info
->eq
[2 * k
] == STATUS_VALID
&&
439 info
->eq
[2 * k
+ 1] == STATUS_VALID
) {
440 l
= isl_basic_map_alloc_equality(bmap
);
442 return isl_basic_map_free(bmap
);
443 isl_seq_cpy(bmap
->eq
[l
], info
->bmap
->eq
[k
], len
);
444 } else if (info
->eq
[2 * k
] == STATUS_VALID
) {
445 l
= isl_basic_map_alloc_inequality(bmap
);
447 return isl_basic_map_free(bmap
);
448 isl_seq_neg(bmap
->ineq
[l
], info
->bmap
->eq
[k
], len
);
449 } else if (info
->eq
[2 * k
+ 1] == STATUS_VALID
) {
450 l
= isl_basic_map_alloc_inequality(bmap
);
452 return isl_basic_map_free(bmap
);
453 isl_seq_cpy(bmap
->ineq
[l
], info
->bmap
->eq
[k
], len
);
457 for (k
= 0; k
< info
->bmap
->n_ineq
; ++k
) {
458 if (info
->ineq
[k
] != STATUS_VALID
)
460 l
= isl_basic_map_alloc_inequality(bmap
);
462 return isl_basic_map_free(bmap
);
463 isl_seq_cpy(bmap
->ineq
[l
], info
->bmap
->ineq
[k
], len
);
469 /* Is "bmap" defined by a number of (non-redundant) constraints that
470 * is greater than the number of constraints of basic maps i and j combined?
471 * Equalities are counted as two inequalities.
473 static int number_of_constraints_increases(int i
, int j
,
474 struct isl_coalesce_info
*info
,
475 __isl_keep isl_basic_map
*bmap
, struct isl_tab
*tab
)
479 n_old
= 2 * info
[i
].bmap
->n_eq
+ info
[i
].bmap
->n_ineq
;
480 n_old
+= 2 * info
[j
].bmap
->n_eq
+ info
[j
].bmap
->n_ineq
;
482 n_new
= 2 * bmap
->n_eq
;
483 for (k
= 0; k
< bmap
->n_ineq
; ++k
)
484 if (!isl_tab_is_redundant(tab
, bmap
->n_eq
+ k
))
487 return n_new
> n_old
;
490 /* Replace the pair of basic maps i and j by the basic map bounded
491 * by the valid constraints in both basic maps and the constraints
492 * in extra (if not NULL).
493 * Place the fused basic map in the position that is the smallest of i and j.
495 * If "detect_equalities" is set, then look for equalities encoded
496 * as pairs of inequalities.
497 * If "check_number" is set, then the original basic maps are only
498 * replaced if the total number of constraints does not increase.
499 * While the number of integer divisions in the two basic maps
500 * is assumed to be the same, the actual definitions may be different.
501 * We only copy the definition from one of the basic maps if it is
502 * the same as that of the other basic map. Otherwise, we mark
503 * the integer division as unknown and simplify the basic map
504 * in an attempt to recover the integer division definition.
505 * If any extra constraints get introduced, then these may
506 * involve integer divisions with a unit coefficient.
507 * Eliminate those that do not appear with any other coefficient
508 * in other constraints, to ensure they get eliminated completely,
509 * improving the chances of further coalescing.
511 static enum isl_change
fuse(int i
, int j
, struct isl_coalesce_info
*info
,
512 __isl_keep isl_mat
*extra
, int detect_equalities
, int check_number
)
515 struct isl_basic_map
*fused
= NULL
;
516 struct isl_tab
*fused_tab
= NULL
;
517 isl_size total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
518 unsigned extra_rows
= extra
? extra
->n_row
: 0;
519 unsigned n_eq
, n_ineq
;
523 return isl_change_error
;
525 return fuse(j
, i
, info
, extra
, detect_equalities
, check_number
);
527 n_eq
= info
[i
].bmap
->n_eq
+ info
[j
].bmap
->n_eq
;
528 n_ineq
= info
[i
].bmap
->n_ineq
+ info
[j
].bmap
->n_ineq
;
529 fused
= isl_basic_map_alloc_space(isl_space_copy(info
[i
].bmap
->dim
),
530 info
[i
].bmap
->n_div
, n_eq
, n_eq
+ n_ineq
+ extra_rows
);
531 fused
= add_valid_constraints(fused
, &info
[i
], 1 + total
);
532 fused
= add_valid_constraints(fused
, &info
[j
], 1 + total
);
535 if (ISL_F_ISSET(info
[i
].bmap
, ISL_BASIC_MAP_RATIONAL
) &&
536 ISL_F_ISSET(info
[j
].bmap
, ISL_BASIC_MAP_RATIONAL
))
537 ISL_F_SET(fused
, ISL_BASIC_MAP_RATIONAL
);
539 for (k
= 0; k
< info
[i
].bmap
->n_div
; ++k
) {
540 int l
= isl_basic_map_alloc_div(fused
);
543 if (isl_seq_eq(info
[i
].bmap
->div
[k
], info
[j
].bmap
->div
[k
],
545 isl_seq_cpy(fused
->div
[l
], info
[i
].bmap
->div
[k
],
548 isl_int_set_si(fused
->div
[l
][0], 0);
553 for (k
= 0; k
< extra_rows
; ++k
) {
554 l
= isl_basic_map_alloc_inequality(fused
);
557 isl_seq_cpy(fused
->ineq
[l
], extra
->row
[k
], 1 + total
);
560 if (detect_equalities
)
561 fused
= isl_basic_map_detect_inequality_pairs(fused
, NULL
);
562 fused
= isl_basic_map_gauss(fused
, NULL
);
563 if (simplify
|| info
[j
].simplify
) {
564 fused
= isl_basic_map_simplify(fused
);
565 info
[i
].simplify
= 0;
566 } else if (extra_rows
> 0) {
567 fused
= isl_basic_map_eliminate_pure_unit_divs(fused
);
569 fused
= isl_basic_map_finalize(fused
);
571 fused_tab
= isl_tab_from_basic_map(fused
, 0);
572 if (isl_tab_detect_redundant(fused_tab
) < 0)
576 number_of_constraints_increases(i
, j
, info
, fused
, fused_tab
)) {
577 isl_tab_free(fused_tab
);
578 isl_basic_map_free(fused
);
579 return isl_change_none
;
583 info
[i
].bmap
= fused
;
584 info
[i
].tab
= fused_tab
;
585 info
[i
].modified
= 1;
588 return isl_change_fuse
;
590 isl_tab_free(fused_tab
);
591 isl_basic_map_free(fused
);
592 return isl_change_error
;
595 /* Given a pair of basic maps i and j such that all constraints are either
596 * "valid" or "cut", check if the facets corresponding to the "cut"
597 * constraints of i lie entirely within basic map j.
598 * If so, replace the pair by the basic map consisting of the valid
599 * constraints in both basic maps.
600 * Checking whether the facet lies entirely within basic map j
601 * is performed by checking whether the constraints of basic map j
602 * are valid for the facet. These tests are performed on a rational
603 * tableau to avoid the theoretical possibility that a constraint
604 * that was considered to be a cut constraint for the entire basic map i
605 * happens to be considered to be a valid constraint for the facet,
606 * even though it cuts off the same rational points.
608 * To see that we are not introducing any extra points, call the
609 * two basic maps A and B and the resulting map U and let x
610 * be an element of U \setminus ( A \cup B ).
611 * A line connecting x with an element of A \cup B meets a facet F
612 * of either A or B. Assume it is a facet of B and let c_1 be
613 * the corresponding facet constraint. We have c_1(x) < 0 and
614 * so c_1 is a cut constraint. This implies that there is some
615 * (possibly rational) point x' satisfying the constraints of A
616 * and the opposite of c_1 as otherwise c_1 would have been marked
617 * valid for A. The line connecting x and x' meets a facet of A
618 * in a (possibly rational) point that also violates c_1, but this
619 * is impossible since all cut constraints of B are valid for all
621 * In case F is a facet of A rather than B, then we can apply the
622 * above reasoning to find a facet of B separating x from A \cup B first.
624 static enum isl_change
check_facets(int i
, int j
,
625 struct isl_coalesce_info
*info
)
628 struct isl_tab_undo
*snap
, *snap2
;
629 unsigned n_eq
= info
[i
].bmap
->n_eq
;
631 snap
= isl_tab_snap(info
[i
].tab
);
632 if (isl_tab_mark_rational(info
[i
].tab
) < 0)
633 return isl_change_error
;
634 snap2
= isl_tab_snap(info
[i
].tab
);
636 for (k
= 0; k
< info
[i
].bmap
->n_ineq
; ++k
) {
637 if (info
[i
].ineq
[k
] != STATUS_CUT
)
639 if (isl_tab_select_facet(info
[i
].tab
, n_eq
+ k
) < 0)
640 return isl_change_error
;
641 for (l
= 0; l
< info
[j
].bmap
->n_ineq
; ++l
) {
643 if (info
[j
].ineq
[l
] != STATUS_CUT
)
645 stat
= status_in(info
[j
].bmap
->ineq
[l
], info
[i
].tab
);
647 return isl_change_error
;
648 if (stat
!= STATUS_VALID
)
651 if (isl_tab_rollback(info
[i
].tab
, snap2
) < 0)
652 return isl_change_error
;
653 if (l
< info
[j
].bmap
->n_ineq
)
657 if (k
< info
[i
].bmap
->n_ineq
) {
658 if (isl_tab_rollback(info
[i
].tab
, snap
) < 0)
659 return isl_change_error
;
660 return isl_change_none
;
662 return fuse(i
, j
, info
, NULL
, 0, 0);
665 /* Check if info->bmap contains the basic map represented
666 * by the tableau "tab".
667 * For each equality, we check both the constraint itself
668 * (as an inequality) and its negation. Make sure the
669 * equality is returned to its original state before returning.
671 static isl_bool
contains(struct isl_coalesce_info
*info
, struct isl_tab
*tab
)
675 isl_basic_map
*bmap
= info
->bmap
;
677 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
679 return isl_bool_error
;
680 for (k
= 0; k
< bmap
->n_eq
; ++k
) {
682 isl_seq_neg(bmap
->eq
[k
], bmap
->eq
[k
], 1 + dim
);
683 stat
= status_in(bmap
->eq
[k
], tab
);
684 isl_seq_neg(bmap
->eq
[k
], bmap
->eq
[k
], 1 + dim
);
686 return isl_bool_error
;
687 if (stat
!= STATUS_VALID
)
688 return isl_bool_false
;
689 stat
= status_in(bmap
->eq
[k
], tab
);
691 return isl_bool_error
;
692 if (stat
!= STATUS_VALID
)
693 return isl_bool_false
;
696 for (k
= 0; k
< bmap
->n_ineq
; ++k
) {
698 if (info
->ineq
[k
] == STATUS_REDUNDANT
)
700 stat
= status_in(bmap
->ineq
[k
], tab
);
702 return isl_bool_error
;
703 if (stat
!= STATUS_VALID
)
704 return isl_bool_false
;
706 return isl_bool_true
;
709 /* Basic map "i" has an inequality "k" that is adjacent
710 * to some inequality of basic map "j". All the other inequalities
712 * If not NULL, then "extra" contains extra wrapping constraints that are valid
713 * for both "i" and "j".
714 * Check if basic map "j" forms an extension of basic map "i",
715 * taking into account the extra constraints, if any.
717 * Note that this function is only called if some of the equalities or
718 * inequalities of basic map "j" do cut basic map "i". The function is
719 * correct even if there are no such cut constraints, but in that case
720 * the additional checks performed by this function are overkill.
722 * In particular, we replace constraint k, say f >= 0, by constraint
723 * f <= -1, add the inequalities of "j" that are valid for "i",
724 * as well as the "extra" constraints, if any,
725 * and check if the result is a subset of basic map "j".
726 * To improve the chances of the subset relation being detected,
727 * any variable that only attains a single integer value
728 * in the tableau of "i" is first fixed to that value.
729 * If the result is a subset, then we know that this result is exactly equal
730 * to basic map "j" since all its constraints are valid for basic map "j".
731 * By combining the valid constraints of "i" (all equalities and all
732 * inequalities except "k"), the valid constraints of "j" and
733 * the "extra" constraints, if any, we therefore
734 * obtain a basic map that is equal to their union.
735 * In this case, there is no need to perform a rollback of the tableau
736 * since it is going to be destroyed in fuse().
742 * |_______| _ |_________\
758 * |_______| |_______/
760 static enum isl_change
is_adj_ineq_extension_with_wraps(int i
, int j
, int k
,
761 struct isl_coalesce_info
*info
, __isl_keep isl_mat
*extra
)
763 struct isl_tab_undo
*snap
;
764 isl_size n_eq_i
, n_ineq_j
, n_extra
;
765 isl_size total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
770 return isl_change_error
;
772 n_eq_i
= isl_basic_map_n_equality(info
[i
].bmap
);
773 n_ineq_j
= isl_basic_map_n_inequality(info
[j
].bmap
);
774 n_extra
= isl_mat_rows(extra
);
775 if (n_eq_i
< 0 || n_ineq_j
< 0 || n_extra
< 0)
776 return isl_change_error
;
778 if (isl_tab_extend_cons(info
[i
].tab
, 1 + n_ineq_j
+ n_extra
) < 0)
779 return isl_change_error
;
781 snap
= isl_tab_snap(info
[i
].tab
);
783 if (isl_tab_unrestrict(info
[i
].tab
, n_eq_i
+ k
) < 0)
784 return isl_change_error
;
786 isl_seq_neg(info
[i
].bmap
->ineq
[k
], info
[i
].bmap
->ineq
[k
], 1 + total
);
787 isl_int_sub_ui(info
[i
].bmap
->ineq
[k
][0], info
[i
].bmap
->ineq
[k
][0], 1);
788 r
= isl_tab_add_ineq(info
[i
].tab
, info
[i
].bmap
->ineq
[k
]);
789 isl_seq_neg(info
[i
].bmap
->ineq
[k
], info
[i
].bmap
->ineq
[k
], 1 + total
);
790 isl_int_sub_ui(info
[i
].bmap
->ineq
[k
][0], info
[i
].bmap
->ineq
[k
][0], 1);
792 return isl_change_error
;
794 for (k
= 0; k
< n_ineq_j
; ++k
) {
795 if (info
[j
].ineq
[k
] != STATUS_VALID
)
797 if (isl_tab_add_ineq(info
[i
].tab
, info
[j
].bmap
->ineq
[k
]) < 0)
798 return isl_change_error
;
800 for (k
= 0; k
< n_extra
; ++k
) {
801 if (isl_tab_add_ineq(info
[i
].tab
, extra
->row
[k
]) < 0)
802 return isl_change_error
;
804 if (isl_tab_detect_constants(info
[i
].tab
) < 0)
805 return isl_change_error
;
807 super
= contains(&info
[j
], info
[i
].tab
);
809 return isl_change_error
;
811 return fuse(i
, j
, info
, extra
, 0, 0);
813 if (isl_tab_rollback(info
[i
].tab
, snap
) < 0)
814 return isl_change_error
;
816 return isl_change_none
;
819 /* Given an affine transformation matrix "T", does row "row" represent
820 * anything other than a unit vector (possibly shifted by a constant)
821 * that is not involved in any of the other rows?
823 * That is, if a constraint involves the variable corresponding to
824 * the row, then could its preimage by "T" have any coefficients
825 * that are different from those in the original constraint?
827 static int not_unique_unit_row(__isl_keep isl_mat
*T
, int row
)
830 int len
= T
->n_col
- 1;
832 i
= isl_seq_first_non_zero(T
->row
[row
] + 1, len
);
835 if (!isl_int_is_one(T
->row
[row
][1 + i
]) &&
836 !isl_int_is_negone(T
->row
[row
][1 + i
]))
839 j
= isl_seq_first_non_zero(T
->row
[row
] + 1 + i
+ 1, len
- (i
+ 1));
843 for (j
= 1; j
< T
->n_row
; ++j
) {
846 if (!isl_int_is_zero(T
->row
[j
][1 + i
]))
853 /* Does inequality constraint "ineq" of "bmap" involve any of
854 * the variables marked in "affected"?
855 * "total" is the total number of variables, i.e., the number
856 * of entries in "affected".
858 static isl_bool
is_affected(__isl_keep isl_basic_map
*bmap
, int ineq
,
859 int *affected
, int total
)
863 for (i
= 0; i
< total
; ++i
) {
866 if (!isl_int_is_zero(bmap
->ineq
[ineq
][1 + i
]))
867 return isl_bool_true
;
870 return isl_bool_false
;
873 /* Given the compressed version of inequality constraint "ineq"
874 * of info->bmap in "v", check if the constraint can be tightened,
875 * where the compression is based on an equality constraint valid
877 * If so, add the tightened version of the inequality constraint
878 * to info->tab. "v" may be modified by this function.
880 * That is, if the compressed constraint is of the form
884 * with 0 < c < m, then it is equivalent to
888 * This means that c can also be subtracted from the original,
889 * uncompressed constraint without affecting the integer points
890 * in info->tab. Add this tightened constraint as an extra row
891 * to info->tab to make this information explicitly available.
893 static __isl_give isl_vec
*try_tightening(struct isl_coalesce_info
*info
,
894 int ineq
, __isl_take isl_vec
*v
)
902 ctx
= isl_vec_get_ctx(v
);
903 isl_seq_gcd(v
->el
+ 1, v
->size
- 1, &ctx
->normalize_gcd
);
904 if (isl_int_is_zero(ctx
->normalize_gcd
) ||
905 isl_int_is_one(ctx
->normalize_gcd
)) {
913 isl_int_fdiv_r(v
->el
[0], v
->el
[0], ctx
->normalize_gcd
);
914 if (isl_int_is_zero(v
->el
[0]))
917 if (isl_tab_extend_cons(info
->tab
, 1) < 0)
918 return isl_vec_free(v
);
920 isl_int_sub(info
->bmap
->ineq
[ineq
][0],
921 info
->bmap
->ineq
[ineq
][0], v
->el
[0]);
922 r
= isl_tab_add_ineq(info
->tab
, info
->bmap
->ineq
[ineq
]);
923 isl_int_add(info
->bmap
->ineq
[ineq
][0],
924 info
->bmap
->ineq
[ineq
][0], v
->el
[0]);
927 return isl_vec_free(v
);
932 /* Tighten the (non-redundant) constraints on the facet represented
934 * In particular, on input, info->tab represents the result
935 * of relaxing the "n" inequality constraints of info->bmap in "relaxed"
936 * by one, i.e., replacing f_i >= 0 by f_i + 1 >= 0, and then
937 * replacing the one at index "l" by the corresponding equality,
938 * i.e., f_k + 1 = 0, with k = relaxed[l].
940 * Compute a variable compression from the equality constraint f_k + 1 = 0
941 * and use it to tighten the other constraints of info->bmap
942 * (that is, all constraints that have not been relaxed),
943 * updating info->tab (and leaving info->bmap untouched).
944 * The compression handles essentially two cases, one where a variable
945 * is assigned a fixed value and can therefore be eliminated, and one
946 * where one variable is a shifted multiple of some other variable and
947 * can therefore be replaced by that multiple.
948 * Gaussian elimination would also work for the first case, but for
949 * the second case, the effectiveness would depend on the order
951 * After compression, some of the constraints may have coefficients
952 * with a common divisor. If this divisor does not divide the constant
953 * term, then the constraint can be tightened.
954 * The tightening is performed on the tableau info->tab by introducing
955 * extra (temporary) constraints.
957 * Only constraints that are possibly affected by the compression are
958 * considered. In particular, if the constraint only involves variables
959 * that are directly mapped to a distinct set of other variables, then
960 * no common divisor can be introduced and no tightening can occur.
962 * It is important to only consider the non-redundant constraints
963 * since the facet constraint has been relaxed prior to the call
964 * to this function, meaning that the constraints that were redundant
965 * prior to the relaxation may no longer be redundant.
966 * These constraints will be ignored in the fused result, so
967 * the fusion detection should not exploit them.
969 static isl_stat
tighten_on_relaxed_facet(struct isl_coalesce_info
*info
,
970 int n
, int *relaxed
, int l
)
981 ctx
= isl_basic_map_get_ctx(info
->bmap
);
982 total
= isl_basic_map_dim(info
->bmap
, isl_dim_all
);
984 return isl_stat_error
;
985 isl_int_add_ui(info
->bmap
->ineq
[k
][0], info
->bmap
->ineq
[k
][0], 1);
986 T
= isl_mat_sub_alloc6(ctx
, info
->bmap
->ineq
, k
, 1, 0, 1 + total
);
987 T
= isl_mat_variable_compression(T
, NULL
);
988 isl_int_sub_ui(info
->bmap
->ineq
[k
][0], info
->bmap
->ineq
[k
][0], 1);
990 return isl_stat_error
;
996 affected
= isl_alloc_array(ctx
, int, total
);
1000 for (i
= 0; i
< total
; ++i
)
1001 affected
[i
] = not_unique_unit_row(T
, 1 + i
);
1003 for (i
= 0; i
< info
->bmap
->n_ineq
; ++i
) {
1005 if (any(relaxed
, n
, i
))
1007 if (info
->ineq
[i
] == STATUS_REDUNDANT
)
1009 handle
= is_affected(info
->bmap
, i
, affected
, total
);
1014 v
= isl_vec_alloc(ctx
, 1 + total
);
1017 isl_seq_cpy(v
->el
, info
->bmap
->ineq
[i
], 1 + total
);
1018 v
= isl_vec_mat_product(v
, isl_mat_copy(T
));
1019 v
= try_tightening(info
, i
, v
);
1031 return isl_stat_error
;
1034 /* Replace the basic maps "i" and "j" by an extension of "i"
1035 * along the "n" inequality constraints in "relax" by one.
1036 * The tableau info[i].tab has already been extended.
1037 * Extend info[i].bmap accordingly by relaxing all constraints in "relax"
1039 * Each integer division that does not have exactly the same
1040 * definition in "i" and "j" is marked unknown and the basic map
1041 * is scheduled to be simplified in an attempt to recover
1042 * the integer division definition.
1043 * Place the extension in the position that is the smallest of i and j.
1045 static enum isl_change
extend(int i
, int j
, int n
, int *relax
,
1046 struct isl_coalesce_info
*info
)
1051 info
[i
].bmap
= isl_basic_map_cow(info
[i
].bmap
);
1052 total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
1054 return isl_change_error
;
1055 for (l
= 0; l
< info
[i
].bmap
->n_div
; ++l
)
1056 if (!isl_seq_eq(info
[i
].bmap
->div
[l
],
1057 info
[j
].bmap
->div
[l
], 1 + 1 + total
)) {
1058 isl_int_set_si(info
[i
].bmap
->div
[l
][0], 0);
1059 info
[i
].simplify
= 1;
1061 for (l
= 0; l
< n
; ++l
)
1062 isl_int_add_ui(info
[i
].bmap
->ineq
[relax
[l
]][0],
1063 info
[i
].bmap
->ineq
[relax
[l
]][0], 1);
1064 ISL_F_CLR(info
[i
].bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1065 ISL_F_SET(info
[i
].bmap
, ISL_BASIC_MAP_FINAL
);
1067 info
[i
].modified
= 1;
1069 exchange(&info
[i
], &info
[j
]);
1070 return isl_change_fuse
;
1073 /* Basic map "i" has "n" inequality constraints (collected in "relax")
1074 * that are such that they include basic map "j" if they are relaxed
1075 * by one. All the other inequalities are valid for "j".
1076 * Check if basic map "j" forms an extension of basic map "i".
1078 * In particular, relax the constraints in "relax", compute the corresponding
1079 * facets one by one and check whether each of these is included
1080 * in the other basic map.
1081 * Before testing for inclusion, the constraints on each facet
1082 * are tightened to increase the chance of an inclusion being detected.
1083 * (Adding the valid constraints of "j" to the tableau of "i", as is done
1084 * in is_adj_ineq_extension, may further increase those chances, but this
1085 * is not currently done.)
1086 * If each facet is included, we know that relaxing the constraints extends
1087 * the basic map with exactly the other basic map (we already know that this
1088 * other basic map is included in the extension, because all other
1089 * inequality constraints are valid of "j") and we can replace the
1090 * two basic maps by this extension.
1092 * If any of the relaxed constraints turn out to be redundant, then bail out.
1093 * isl_tab_select_facet refuses to handle such constraints. It may be
1094 * possible to handle them anyway by making a distinction between
1095 * redundant constraints with a corresponding facet that still intersects
1096 * the set (allowing isl_tab_select_facet to handle them) and
1097 * those where the facet does not intersect the set (which can be ignored
1098 * because the empty facet is trivially included in the other disjunct).
1099 * However, relaxed constraints that turn out to be redundant should
1100 * be fairly rare and no such instance has been reported where
1101 * coalescing would be successful.
1117 static enum isl_change
is_relaxed_extension(int i
, int j
, int n
, int *relax
,
1118 struct isl_coalesce_info
*info
)
1122 struct isl_tab_undo
*snap
, *snap2
;
1123 unsigned n_eq
= info
[i
].bmap
->n_eq
;
1125 for (l
= 0; l
< n
; ++l
)
1126 if (isl_tab_is_equality(info
[i
].tab
, n_eq
+ relax
[l
]))
1127 return isl_change_none
;
1129 snap
= isl_tab_snap(info
[i
].tab
);
1130 for (l
= 0; l
< n
; ++l
)
1131 if (isl_tab_relax(info
[i
].tab
, n_eq
+ relax
[l
]) < 0)
1132 return isl_change_error
;
1133 for (l
= 0; l
< n
; ++l
) {
1134 if (!isl_tab_is_redundant(info
[i
].tab
, n_eq
+ relax
[l
]))
1136 if (isl_tab_rollback(info
[i
].tab
, snap
) < 0)
1137 return isl_change_error
;
1138 return isl_change_none
;
1140 snap2
= isl_tab_snap(info
[i
].tab
);
1141 for (l
= 0; l
< n
; ++l
) {
1142 if (isl_tab_rollback(info
[i
].tab
, snap2
) < 0)
1143 return isl_change_error
;
1144 if (isl_tab_select_facet(info
[i
].tab
, n_eq
+ relax
[l
]) < 0)
1145 return isl_change_error
;
1146 if (tighten_on_relaxed_facet(&info
[i
], n
, relax
, l
) < 0)
1147 return isl_change_error
;
1148 super
= contains(&info
[j
], info
[i
].tab
);
1150 return isl_change_error
;
1153 if (isl_tab_rollback(info
[i
].tab
, snap
) < 0)
1154 return isl_change_error
;
1155 return isl_change_none
;
1158 if (isl_tab_rollback(info
[i
].tab
, snap2
) < 0)
1159 return isl_change_error
;
1160 return extend(i
, j
, n
, relax
, info
);
1163 /* Data structure that keeps track of the wrapping constraints
1164 * and of information to bound the coefficients of those constraints.
1166 * "failed" is set if wrapping has failed.
1167 * bound is set if we want to apply a bound on the coefficients
1168 * mat contains the wrapping constraints
1169 * max is the bound on the coefficients (if bound is set)
1178 /* Update wraps->max to be greater than or equal to the coefficients
1179 * in the equalities and inequalities of info->bmap that can be removed
1180 * if we end up applying wrapping.
1182 static isl_stat
wraps_update_max(struct isl_wraps
*wraps
,
1183 struct isl_coalesce_info
*info
)
1187 isl_size total
= isl_basic_map_dim(info
->bmap
, isl_dim_all
);
1190 return isl_stat_error
;
1191 isl_int_init(max_k
);
1193 for (k
= 0; k
< info
->bmap
->n_eq
; ++k
) {
1194 if (info
->eq
[2 * k
] == STATUS_VALID
&&
1195 info
->eq
[2 * k
+ 1] == STATUS_VALID
)
1197 isl_seq_abs_max(info
->bmap
->eq
[k
] + 1, total
, &max_k
);
1198 if (isl_int_abs_gt(max_k
, wraps
->max
))
1199 isl_int_set(wraps
->max
, max_k
);
1202 for (k
= 0; k
< info
->bmap
->n_ineq
; ++k
) {
1203 if (info
->ineq
[k
] == STATUS_VALID
||
1204 info
->ineq
[k
] == STATUS_REDUNDANT
)
1206 isl_seq_abs_max(info
->bmap
->ineq
[k
] + 1, total
, &max_k
);
1207 if (isl_int_abs_gt(max_k
, wraps
->max
))
1208 isl_int_set(wraps
->max
, max_k
);
1211 isl_int_clear(max_k
);
1216 /* Initialize the isl_wraps data structure.
1217 * If we want to bound the coefficients of the wrapping constraints,
1218 * we set wraps->max to the largest coefficient
1219 * in the equalities and inequalities that can be removed if we end up
1220 * applying wrapping.
1222 static isl_stat
wraps_init(struct isl_wraps
*wraps
, __isl_take isl_mat
*mat
,
1223 struct isl_coalesce_info
*info
, int i
, int j
)
1231 return isl_stat_error
;
1232 wraps
->mat
->n_row
= 0;
1233 ctx
= isl_mat_get_ctx(mat
);
1234 wraps
->bound
= isl_options_get_coalesce_bounded_wrapping(ctx
);
1237 isl_int_init(wraps
->max
);
1238 isl_int_set_si(wraps
->max
, 0);
1239 if (wraps_update_max(wraps
, &info
[i
]) < 0)
1240 return isl_stat_error
;
1241 if (wraps_update_max(wraps
, &info
[j
]) < 0)
1242 return isl_stat_error
;
1247 /* Free the contents of the isl_wraps data structure.
1249 static void wraps_free(struct isl_wraps
*wraps
)
1251 isl_mat_free(wraps
->mat
);
1253 isl_int_clear(wraps
->max
);
1256 /* Mark the wrapping as failed.
1258 static isl_stat
wraps_mark_failed(struct isl_wraps
*wraps
)
1264 /* Is the wrapping constraint in row "row" allowed?
1266 * If wraps->bound is set, we check that none of the coefficients
1267 * is greater than wraps->max.
1269 static int allow_wrap(struct isl_wraps
*wraps
, int row
)
1276 for (i
= 1; i
< wraps
->mat
->n_col
; ++i
)
1277 if (isl_int_abs_gt(wraps
->mat
->row
[row
][i
], wraps
->max
))
1283 /* Wrap "ineq" (or its opposite if "negate" is set) around "bound"
1284 * to include "set" and add the result in position "w" of "wraps".
1285 * "len" is the total number of coefficients in "bound" and "ineq".
1286 * Return 1 on success, 0 on failure and -1 on error.
1287 * Wrapping can fail if the result of wrapping is equal to "bound"
1288 * or if we want to bound the sizes of the coefficients and
1289 * the wrapped constraint does not satisfy this bound.
1291 static int add_wrap(struct isl_wraps
*wraps
, int w
, isl_int
*bound
,
1292 isl_int
*ineq
, unsigned len
, __isl_keep isl_set
*set
, int negate
)
1294 isl_seq_cpy(wraps
->mat
->row
[w
], bound
, len
);
1296 isl_seq_neg(wraps
->mat
->row
[w
+ 1], ineq
, len
);
1297 ineq
= wraps
->mat
->row
[w
+ 1];
1299 if (!isl_set_wrap_facet(set
, wraps
->mat
->row
[w
], ineq
))
1301 if (isl_seq_eq(wraps
->mat
->row
[w
], bound
, len
))
1303 if (!allow_wrap(wraps
, w
))
1308 /* This function has two modes of operations.
1310 * If "add_valid" is set, then all the constraints of info->bmap
1311 * (except the opposite of "bound") are valid for the other basic map.
1312 * In this case, attempts are made to wrap some of these valid constraints
1313 * to more tightly fit around "set". Only successful wrappings are recorded
1314 * and failed wrappings are ignored.
1316 * If "add_valid" is not set, then some of the constraints of info->bmap
1317 * are not valid for the other basic map, and only those are considered
1318 * for wrapping. In this case all attempted wrappings need to succeed.
1319 * Otherwise "wraps" is marked as failed.
1320 * Note that the constraints that are valid for the other basic map
1321 * will be added to the combined basic map by default, so there is
1322 * no need to wrap them.
1323 * The caller wrap_in_facets even relies on this function not wrapping
1324 * any constraints that are already valid.
1326 * Only consider constraints that are not redundant (as determined
1327 * by info->tab) and that are valid or invalid depending on "add_valid".
1328 * Wrap each constraint around "bound" such that it includes the whole
1329 * set "set" and append the resulting constraint to "wraps".
1330 * "wraps" is assumed to have been pre-allocated to the appropriate size.
1331 * wraps->n_row is the number of actual wrapped constraints that have
1333 * If any of the wrapping problems results in a constraint that is
1334 * identical to "bound", then this means that "set" is unbounded in such
1335 * a way that no wrapping is possible.
1336 * Similarly, if we want to bound the coefficients of the wrapping
1337 * constraints and a newly added wrapping constraint does not
1338 * satisfy the bound, then the wrapping is considered to have failed.
1339 * Note though that "wraps" is only marked failed if "add_valid" is not set.
1341 static isl_stat
add_selected_wraps(struct isl_wraps
*wraps
,
1342 struct isl_coalesce_info
*info
, isl_int
*bound
, __isl_keep isl_set
*set
,
1348 isl_basic_map
*bmap
= info
->bmap
;
1349 isl_size total
= isl_basic_map_dim(bmap
, isl_dim_all
);
1350 unsigned len
= 1 + total
;
1353 return isl_stat_error
;
1355 w
= wraps
->mat
->n_row
;
1357 for (l
= 0; l
< bmap
->n_ineq
; ++l
) {
1358 int is_valid
= info
->ineq
[l
] == STATUS_VALID
;
1359 if ((!add_valid
&& is_valid
) ||
1360 info
->ineq
[l
] == STATUS_REDUNDANT
)
1362 if (isl_seq_is_neg(bound
, bmap
->ineq
[l
], len
))
1364 if (isl_seq_eq(bound
, bmap
->ineq
[l
], len
))
1366 if (isl_tab_is_redundant(info
->tab
, bmap
->n_eq
+ l
))
1369 added
= add_wrap(wraps
, w
, bound
, bmap
->ineq
[l
], len
, set
, 0);
1371 return isl_stat_error
;
1372 if (!added
&& !is_valid
)
1377 for (l
= 0; l
< bmap
->n_eq
; ++l
) {
1378 if (isl_seq_is_neg(bound
, bmap
->eq
[l
], len
))
1380 if (isl_seq_eq(bound
, bmap
->eq
[l
], len
))
1383 for (m
= 0; m
< 2; ++m
) {
1384 if (info
->eq
[2 * l
+ m
] == STATUS_VALID
)
1386 added
= add_wrap(wraps
, w
, bound
, bmap
->eq
[l
], len
,
1389 return isl_stat_error
;
1396 wraps
->mat
->n_row
= w
;
1399 return wraps_mark_failed(wraps
);
1402 /* For each constraint in info->bmap that is not redundant (as determined
1403 * by info->tab) and that is not a valid constraint for the other basic map,
1404 * wrap the constraint around "bound" such that it includes the whole
1405 * set "set" and append the resulting constraint to "wraps".
1406 * Note that the constraints that are valid for the other basic map
1407 * will be added to the combined basic map by default, so there is
1408 * no need to wrap them.
1409 * The caller wrap_in_facets even relies on this function not wrapping
1410 * any constraints that are already valid.
1411 * "wraps" is assumed to have been pre-allocated to the appropriate size.
1412 * wraps->n_row is the number of actual wrapped constraints that have
1414 * If any of the wrapping problems results in a constraint that is
1415 * identical to "bound", then this means that "set" is unbounded in such
1416 * a way that no wrapping is possible. If this happens then "wraps"
1417 * is marked as failed.
1418 * Similarly, if we want to bound the coefficients of the wrapping
1419 * constraints and a newly added wrapping constraint does not
1420 * satisfy the bound, then "wraps" is also marked as failed.
1422 static isl_stat
add_wraps(struct isl_wraps
*wraps
,
1423 struct isl_coalesce_info
*info
, isl_int
*bound
, __isl_keep isl_set
*set
)
1425 return add_selected_wraps(wraps
, info
, bound
, set
, 0);
1428 /* Check if the constraints in "wraps" from "first" until the last
1429 * are all valid for the basic set represented by "tab",
1430 * dropping the invalid constraints if "keep" is set and
1431 * marking the wrapping as failed if "keep" is not set and
1432 * any constraint turns out to be invalid.
1434 static isl_stat
check_wraps(struct isl_wraps
*wraps
, int first
,
1435 struct isl_tab
*tab
, int keep
)
1439 for (i
= wraps
->mat
->n_row
- 1; i
>= first
; --i
) {
1440 enum isl_ineq_type type
;
1441 type
= isl_tab_ineq_type(tab
, wraps
->mat
->row
[i
]);
1442 if (type
== isl_ineq_error
)
1443 return isl_stat_error
;
1444 if (type
== isl_ineq_redundant
)
1447 return wraps_mark_failed(wraps
);
1448 wraps
->mat
= isl_mat_drop_rows(wraps
->mat
, i
, 1);
1450 return isl_stat_error
;
1456 /* Return a set that corresponds to the non-redundant constraints
1457 * (as recorded in tab) of bmap.
1459 * It's important to remove the redundant constraints as some
1460 * of the other constraints may have been modified after the
1461 * constraints were marked redundant.
1462 * In particular, a constraint may have been relaxed.
1463 * Redundant constraints are ignored when a constraint is relaxed
1464 * and should therefore continue to be ignored ever after.
1465 * Otherwise, the relaxation might be thwarted by some of
1466 * these constraints.
1468 * Update the underlying set to ensure that the dimension doesn't change.
1469 * Otherwise the integer divisions could get dropped if the tab
1470 * turns out to be empty.
1472 static __isl_give isl_set
*set_from_updated_bmap(__isl_keep isl_basic_map
*bmap
,
1473 struct isl_tab
*tab
)
1475 isl_basic_set
*bset
;
1477 bmap
= isl_basic_map_copy(bmap
);
1478 bset
= isl_basic_map_underlying_set(bmap
);
1479 bset
= isl_basic_set_cow(bset
);
1480 bset
= isl_basic_set_update_from_tab(bset
, tab
);
1481 return isl_set_from_basic_set(bset
);
1484 /* Does "info" have any cut constraints that are redundant?
1486 static isl_bool
has_redundant_cuts(struct isl_coalesce_info
*info
)
1489 isl_size n_eq
, n_ineq
;
1491 n_eq
= isl_basic_map_n_equality(info
->bmap
);
1492 n_ineq
= isl_basic_map_n_inequality(info
->bmap
);
1493 if (n_eq
< 0 || n_ineq
< 0)
1494 return isl_bool_error
;
1495 for (l
= 0; l
< n_ineq
; ++l
) {
1498 if (info
->ineq
[l
] != STATUS_CUT
)
1500 red
= isl_tab_is_redundant(info
->tab
, n_eq
+ l
);
1502 return isl_bool_error
;
1504 return isl_bool_true
;
1507 return isl_bool_false
;
1510 /* Wrap some constraints of info->bmap that bound the facet defined
1511 * by inequality "k" around (the opposite of) this inequality to
1512 * include "set". "bound" may be used to store the negated inequality.
1514 * If "add_valid" is set, then all ridges are already valid and
1515 * the purpose is to wrap "set" more tightly. In this case,
1516 * wrapping doesn't fail, although it is possible that no constraint
1519 * If "add_valid" is not set, then some of the ridges are cut constraints
1520 * and only those are wrapped around "set".
1522 * Since the wrapped constraints are not guaranteed to contain the whole
1523 * of info->bmap, we check them in check_wraps.
1524 * If any of the wrapped constraints turn out to be invalid, then
1525 * check_wraps will mark "wraps" as failed if "add_valid" is not set.
1526 * If "add_valid" is set, then the offending constraints are
1529 * If the facet turns out to be empty, then no wrapping can be performed.
1530 * This is considered a failure, unless "add_valid" is set.
1532 * If any of the cut constraints of info->bmap turn out
1533 * to be redundant with respect to other constraints
1534 * then these will neither be wrapped nor added directly to the result.
1535 * The result may therefore not be correct.
1536 * Skip wrapping and mark "wraps" as failed in this case.
1538 static isl_stat
add_selected_wraps_around_facet(struct isl_wraps
*wraps
,
1539 struct isl_coalesce_info
*info
, int k
, isl_int
*bound
,
1540 __isl_keep isl_set
*set
, int add_valid
)
1543 struct isl_tab_undo
*snap
;
1545 isl_size total
= isl_basic_map_dim(info
->bmap
, isl_dim_all
);
1548 return isl_stat_error
;
1550 snap
= isl_tab_snap(info
->tab
);
1552 if (isl_tab_select_facet(info
->tab
, info
->bmap
->n_eq
+ k
) < 0)
1553 return isl_stat_error
;
1554 if (isl_tab_detect_redundant(info
->tab
) < 0)
1555 return isl_stat_error
;
1556 if (info
->tab
->empty
) {
1558 return wraps_mark_failed(wraps
);
1561 nowrap
= has_redundant_cuts(info
);
1563 return isl_stat_error
;
1565 n
= wraps
->mat
->n_row
;
1567 isl_seq_neg(bound
, info
->bmap
->ineq
[k
], 1 + total
);
1569 if (add_selected_wraps(wraps
, info
, bound
, set
, add_valid
) < 0)
1570 return isl_stat_error
;
1573 if (isl_tab_rollback(info
->tab
, snap
) < 0)
1574 return isl_stat_error
;
1576 return wraps_mark_failed(wraps
);
1577 if (check_wraps(wraps
, n
, info
->tab
, add_valid
) < 0)
1578 return isl_stat_error
;
1583 /* Wrap the constraints of info->bmap that bound the facet defined
1584 * by inequality "k" around (the opposite of) this inequality to
1585 * include "set". "bound" may be used to store the negated inequality.
1586 * If any of the wrapped constraints turn out to be invalid for info->bmap
1587 * itself, then mark "wraps" as failed.
1589 static isl_stat
add_wraps_around_facet(struct isl_wraps
*wraps
,
1590 struct isl_coalesce_info
*info
, int k
, isl_int
*bound
,
1591 __isl_keep isl_set
*set
)
1593 return add_selected_wraps_around_facet(wraps
, info
, k
, bound
, set
, 0);
1596 /* Wrap the (valid) constraints of info->bmap that bound the facet defined
1597 * by inequality "k" around (the opposite of) this inequality to
1598 * include "set" more tightly.
1599 * "bound" may be used to store the negated inequality.
1600 * Remove any wrapping constraints that turn out to be invalid
1601 * for info->bmap itself.
1603 static isl_stat
add_valid_wraps_around_facet(struct isl_wraps
*wraps
,
1604 struct isl_coalesce_info
*info
, int k
, isl_int
*bound
,
1605 __isl_keep isl_set
*set
)
1607 return add_selected_wraps_around_facet(wraps
, info
, k
, bound
, set
, 1);
1610 /* Basic map "i" has an inequality (say "k") that is adjacent
1611 * to some inequality of basic map "j". All the other inequalities
1612 * are valid for "j".
1613 * Check if basic map "j" forms an extension of basic map "i".
1615 * Note that this function is only called if some of the equalities or
1616 * inequalities of basic map "j" do cut basic map "i". The function is
1617 * correct even if there are no such cut constraints, but in that case
1618 * the additional checks performed by this function are overkill.
1620 * First try and wrap the ridges of "k" around "j".
1621 * Note that those ridges are already valid for "j",
1622 * but the wrapped versions may wrap "j" more tightly,
1623 * increasing the chances of "j" being detected as an extension of "i"
1625 static enum isl_change
is_adj_ineq_extension(int i
, int j
,
1626 struct isl_coalesce_info
*info
)
1629 enum isl_change change
;
1631 isl_size n_eq_i
, n_ineq_i
;
1632 struct isl_wraps wraps
;
1639 k
= find_ineq(&info
[i
], STATUS_ADJ_INEQ
);
1641 isl_die(isl_basic_map_get_ctx(info
[i
].bmap
), isl_error_internal
,
1642 "info[i].ineq should have exactly one STATUS_ADJ_INEQ",
1643 return isl_change_error
);
1645 total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
1646 n_eq_i
= isl_basic_map_n_equality(info
[i
].bmap
);
1647 n_ineq_i
= isl_basic_map_n_inequality(info
[i
].bmap
);
1648 if (total
< 0 || n_eq_i
< 0 || n_ineq_i
< 0)
1649 return isl_change_error
;
1651 set_j
= set_from_updated_bmap(info
[j
].bmap
, info
[j
].tab
);
1652 ctx
= isl_basic_map_get_ctx(info
[i
].bmap
);
1653 bound
= isl_vec_alloc(ctx
, 1 + total
);
1654 mat
= isl_mat_alloc(ctx
, 2 * n_eq_i
+ n_ineq_i
, 1 + total
);
1655 if (wraps_init(&wraps
, mat
, info
, i
, j
) < 0)
1657 if (!bound
|| !set_j
)
1659 r
= add_valid_wraps_around_facet(&wraps
, &info
[i
], k
, bound
->el
, set_j
);
1663 change
= is_adj_ineq_extension_with_wraps(i
, j
, k
, info
, wraps
.mat
);
1666 isl_vec_free(bound
);
1667 isl_set_free(set_j
);
1672 isl_vec_free(bound
);
1673 isl_set_free(set_j
);
1674 return isl_change_error
;
1677 /* Both basic maps have at least one inequality with and adjacent
1678 * (but opposite) inequality in the other basic map.
1679 * Check that there are no cut constraints and that there is only
1680 * a single pair of adjacent inequalities.
1681 * If so, we can replace the pair by a single basic map described
1682 * by all but the pair of adjacent inequalities.
1683 * Any additional points introduced lie strictly between the two
1684 * adjacent hyperplanes and can therefore be integral.
1693 * The test for a single pair of adjacent inequalities is important
1694 * for avoiding the combination of two basic maps like the following
1704 * If there are some cut constraints on one side, then we may
1705 * still be able to fuse the two basic maps, but we need to perform
1706 * some additional checks in is_adj_ineq_extension.
1708 static enum isl_change
check_adj_ineq(int i
, int j
,
1709 struct isl_coalesce_info
*info
)
1711 int count_i
, count_j
;
1714 count_i
= count_ineq(&info
[i
], STATUS_ADJ_INEQ
);
1715 count_j
= count_ineq(&info
[j
], STATUS_ADJ_INEQ
);
1717 if (count_i
!= 1 && count_j
!= 1)
1718 return isl_change_none
;
1720 cut_i
= any_eq(&info
[i
], STATUS_CUT
) || any_ineq(&info
[i
], STATUS_CUT
);
1721 cut_j
= any_eq(&info
[j
], STATUS_CUT
) || any_ineq(&info
[j
], STATUS_CUT
);
1723 if (!cut_i
&& !cut_j
&& count_i
== 1 && count_j
== 1)
1724 return fuse(i
, j
, info
, NULL
, 0, 0);
1726 if (count_i
== 1 && !cut_i
)
1727 return is_adj_ineq_extension(i
, j
, info
);
1729 if (count_j
== 1 && !cut_j
)
1730 return is_adj_ineq_extension(j
, i
, info
);
1732 return isl_change_none
;
1735 /* Given a basic set i with a constraint k that is adjacent to
1736 * basic set j, check if we can wrap
1737 * both the facet corresponding to k (if "wrap_facet" is set) and basic map j
1738 * (always) around their ridges to include the other set.
1739 * If so, replace the pair of basic sets by their union.
1741 * All constraints of i (except k) are assumed to be valid or
1742 * cut constraints for j.
1743 * Wrapping the cut constraints to include basic map j may result
1744 * in constraints that are no longer valid of basic map i
1745 * we have to check that the resulting wrapping constraints are valid for i.
1746 * If "wrap_facet" is not set, then all constraints of i (except k)
1747 * are assumed to be valid for j.
1756 static enum isl_change
can_wrap_in_facet(int i
, int j
, int k
,
1757 struct isl_coalesce_info
*info
, int wrap_facet
)
1759 enum isl_change change
= isl_change_none
;
1760 struct isl_wraps wraps
;
1763 struct isl_set
*set_i
= NULL
;
1764 struct isl_set
*set_j
= NULL
;
1765 struct isl_vec
*bound
= NULL
;
1766 isl_size total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
1769 return isl_change_error
;
1770 set_i
= set_from_updated_bmap(info
[i
].bmap
, info
[i
].tab
);
1771 set_j
= set_from_updated_bmap(info
[j
].bmap
, info
[j
].tab
);
1772 ctx
= isl_basic_map_get_ctx(info
[i
].bmap
);
1773 mat
= isl_mat_alloc(ctx
, 2 * (info
[i
].bmap
->n_eq
+ info
[j
].bmap
->n_eq
) +
1774 info
[i
].bmap
->n_ineq
+ info
[j
].bmap
->n_ineq
,
1776 if (wraps_init(&wraps
, mat
, info
, i
, j
) < 0)
1778 bound
= isl_vec_alloc(ctx
, 1 + total
);
1779 if (!set_i
|| !set_j
|| !bound
)
1782 isl_seq_cpy(bound
->el
, info
[i
].bmap
->ineq
[k
], 1 + total
);
1783 isl_int_add_ui(bound
->el
[0], bound
->el
[0], 1);
1784 isl_seq_normalize(ctx
, bound
->el
, 1 + total
);
1786 isl_seq_cpy(wraps
.mat
->row
[0], bound
->el
, 1 + total
);
1787 wraps
.mat
->n_row
= 1;
1789 if (add_wraps(&wraps
, &info
[j
], bound
->el
, set_i
) < 0)
1795 if (add_wraps_around_facet(&wraps
, &info
[i
], k
,
1796 bound
->el
, set_j
) < 0)
1802 change
= fuse(i
, j
, info
, wraps
.mat
, 0, 0);
1807 isl_set_free(set_i
);
1808 isl_set_free(set_j
);
1810 isl_vec_free(bound
);
1815 isl_vec_free(bound
);
1816 isl_set_free(set_i
);
1817 isl_set_free(set_j
);
1818 return isl_change_error
;
1821 /* Given a cut constraint t(x) >= 0 of basic map i, stored in row "w"
1822 * of wrap.mat, replace it by its relaxed version t(x) + 1 >= 0, and
1823 * add wrapping constraints to wrap.mat for all constraints
1824 * of basic map j that bound the part of basic map j that sticks out
1825 * of the cut constraint.
1826 * "set_i" is the underlying set of basic map i.
1827 * If any wrapping fails, then wraps->mat.n_row is reset to zero.
1829 * In particular, we first intersect basic map j with t(x) + 1 = 0.
1830 * If the result is empty, then t(x) >= 0 was actually a valid constraint
1831 * (with respect to the integer points), so we add t(x) >= 0 instead.
1832 * Otherwise, we wrap the constraints of basic map j that are not
1833 * redundant in this intersection and that are not already valid
1834 * for basic map i over basic map i.
1835 * Note that it is sufficient to wrap the constraints to include
1836 * basic map i, because we will only wrap the constraints that do
1837 * not include basic map i already. The wrapped constraint will
1838 * therefore be more relaxed compared to the original constraint.
1839 * Since the original constraint is valid for basic map j, so is
1840 * the wrapped constraint.
1842 static isl_stat
wrap_in_facet(struct isl_wraps
*wraps
, int w
,
1843 struct isl_coalesce_info
*info_j
, __isl_keep isl_set
*set_i
,
1844 struct isl_tab_undo
*snap
)
1846 isl_int_add_ui(wraps
->mat
->row
[w
][0], wraps
->mat
->row
[w
][0], 1);
1847 if (isl_tab_add_eq(info_j
->tab
, wraps
->mat
->row
[w
]) < 0)
1848 return isl_stat_error
;
1849 if (isl_tab_detect_redundant(info_j
->tab
) < 0)
1850 return isl_stat_error
;
1852 if (info_j
->tab
->empty
)
1853 isl_int_sub_ui(wraps
->mat
->row
[w
][0], wraps
->mat
->row
[w
][0], 1);
1854 else if (add_wraps(wraps
, info_j
, wraps
->mat
->row
[w
], set_i
) < 0)
1855 return isl_stat_error
;
1857 if (isl_tab_rollback(info_j
->tab
, snap
) < 0)
1858 return isl_stat_error
;
1863 /* Given a pair of basic maps i and j such that j sticks out
1864 * of i at n cut constraints, each time by at most one,
1865 * try to compute wrapping constraints and replace the two
1866 * basic maps by a single basic map.
1867 * The other constraints of i are assumed to be valid for j.
1868 * "set_i" is the underlying set of basic map i.
1869 * "wraps" has been initialized to be of the right size.
1871 * For each cut constraint t(x) >= 0 of i, we add the relaxed version
1872 * t(x) + 1 >= 0, along with wrapping constraints for all constraints
1873 * of basic map j that bound the part of basic map j that sticks out
1874 * of the cut constraint.
1876 * If any wrapping fails, i.e., if we cannot wrap to touch
1877 * the union, then we give up.
1878 * Otherwise, the pair of basic maps is replaced by their union.
1880 static enum isl_change
try_wrap_in_facets(int i
, int j
,
1881 struct isl_coalesce_info
*info
, struct isl_wraps
*wraps
,
1882 __isl_keep isl_set
*set_i
)
1886 struct isl_tab_undo
*snap
;
1888 total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
1890 return isl_change_error
;
1892 snap
= isl_tab_snap(info
[j
].tab
);
1894 for (k
= 0; k
< info
[i
].bmap
->n_eq
; ++k
) {
1895 for (l
= 0; l
< 2; ++l
) {
1896 if (info
[i
].eq
[2 * k
+ l
] != STATUS_CUT
)
1898 w
= wraps
->mat
->n_row
++;
1900 isl_seq_neg(wraps
->mat
->row
[w
],
1901 info
[i
].bmap
->eq
[k
], 1 + total
);
1903 isl_seq_cpy(wraps
->mat
->row
[w
],
1904 info
[i
].bmap
->eq
[k
], 1 + total
);
1905 if (wrap_in_facet(wraps
, w
, &info
[j
], set_i
, snap
) < 0)
1906 return isl_change_error
;
1909 return isl_change_none
;
1913 for (k
= 0; k
< info
[i
].bmap
->n_ineq
; ++k
) {
1914 if (info
[i
].ineq
[k
] != STATUS_CUT
)
1916 w
= wraps
->mat
->n_row
++;
1917 isl_seq_cpy(wraps
->mat
->row
[w
],
1918 info
[i
].bmap
->ineq
[k
], 1 + total
);
1919 if (wrap_in_facet(wraps
, w
, &info
[j
], set_i
, snap
) < 0)
1920 return isl_change_error
;
1923 return isl_change_none
;
1926 return fuse(i
, j
, info
, wraps
->mat
, 0, 1);
1929 /* Given a pair of basic maps i and j such that j sticks out
1930 * of i at n cut constraints, each time by at most one,
1931 * try to compute wrapping constraints and replace the two
1932 * basic maps by a single basic map.
1933 * The other constraints of i are assumed to be valid for j.
1935 * The core computation is performed by try_wrap_in_facets.
1936 * This function simply extracts an underlying set representation
1937 * of basic map i and initializes the data structure for keeping
1938 * track of wrapping constraints.
1940 static enum isl_change
wrap_in_facets(int i
, int j
, int n
,
1941 struct isl_coalesce_info
*info
)
1943 enum isl_change change
= isl_change_none
;
1944 struct isl_wraps wraps
;
1947 isl_set
*set_i
= NULL
;
1948 isl_size total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
1952 return isl_change_error
;
1953 if (isl_tab_extend_cons(info
[j
].tab
, 1) < 0)
1954 return isl_change_error
;
1956 max_wrap
= 1 + 2 * info
[j
].bmap
->n_eq
+ info
[j
].bmap
->n_ineq
;
1959 set_i
= set_from_updated_bmap(info
[i
].bmap
, info
[i
].tab
);
1960 ctx
= isl_basic_map_get_ctx(info
[i
].bmap
);
1961 mat
= isl_mat_alloc(ctx
, max_wrap
, 1 + total
);
1962 if (wraps_init(&wraps
, mat
, info
, i
, j
) < 0)
1967 change
= try_wrap_in_facets(i
, j
, info
, &wraps
, set_i
);
1970 isl_set_free(set_i
);
1975 isl_set_free(set_i
);
1976 return isl_change_error
;
1979 /* Return the effect of inequality "ineq" on the tableau "tab",
1980 * after relaxing the constant term of "ineq" by one.
1982 static enum isl_ineq_type
type_of_relaxed(struct isl_tab
*tab
, isl_int
*ineq
)
1984 enum isl_ineq_type type
;
1986 isl_int_add_ui(ineq
[0], ineq
[0], 1);
1987 type
= isl_tab_ineq_type(tab
, ineq
);
1988 isl_int_sub_ui(ineq
[0], ineq
[0], 1);
1993 /* Given two basic sets i and j,
1994 * check if relaxing all the cut constraints of i by one turns
1995 * them into valid constraint for j and check if we can wrap in
1996 * the bits that are sticking out.
1997 * If so, replace the pair by their union.
1999 * We first check if all relaxed cut inequalities of i are valid for j
2000 * and then try to wrap in the intersections of the relaxed cut inequalities
2003 * During this wrapping, we consider the points of j that lie at a distance
2004 * of exactly 1 from i. In particular, we ignore the points that lie in
2005 * between this lower-dimensional space and the basic map i.
2006 * We can therefore only apply this to integer maps.
2032 * Wrapping can fail if the result of wrapping one of the facets
2033 * around its edges does not produce any new facet constraint.
2034 * In particular, this happens when we try to wrap in unbounded sets.
2036 * _______________________________________________________________________
2040 * |_| |_________________________________________________________________
2043 * The following is not an acceptable result of coalescing the above two
2044 * sets as it includes extra integer points.
2045 * _______________________________________________________________________
2050 * \______________________________________________________________________
2052 static enum isl_change
can_wrap_in_set(int i
, int j
,
2053 struct isl_coalesce_info
*info
)
2059 if (ISL_F_ISSET(info
[i
].bmap
, ISL_BASIC_MAP_RATIONAL
) ||
2060 ISL_F_ISSET(info
[j
].bmap
, ISL_BASIC_MAP_RATIONAL
))
2061 return isl_change_none
;
2063 n
= count_eq(&info
[i
], STATUS_CUT
) + count_ineq(&info
[i
], STATUS_CUT
);
2065 return isl_change_none
;
2067 total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
2069 return isl_change_error
;
2070 for (k
= 0; k
< info
[i
].bmap
->n_eq
; ++k
) {
2071 for (l
= 0; l
< 2; ++l
) {
2072 enum isl_ineq_type type
;
2074 if (info
[i
].eq
[2 * k
+ l
] != STATUS_CUT
)
2078 isl_seq_neg(info
[i
].bmap
->eq
[k
],
2079 info
[i
].bmap
->eq
[k
], 1 + total
);
2080 type
= type_of_relaxed(info
[j
].tab
,
2081 info
[i
].bmap
->eq
[k
]);
2083 isl_seq_neg(info
[i
].bmap
->eq
[k
],
2084 info
[i
].bmap
->eq
[k
], 1 + total
);
2085 if (type
== isl_ineq_error
)
2086 return isl_change_error
;
2087 if (type
!= isl_ineq_redundant
)
2088 return isl_change_none
;
2092 for (k
= 0; k
< info
[i
].bmap
->n_ineq
; ++k
) {
2093 enum isl_ineq_type type
;
2095 if (info
[i
].ineq
[k
] != STATUS_CUT
)
2098 type
= type_of_relaxed(info
[j
].tab
, info
[i
].bmap
->ineq
[k
]);
2099 if (type
== isl_ineq_error
)
2100 return isl_change_error
;
2101 if (type
!= isl_ineq_redundant
)
2102 return isl_change_none
;
2105 return wrap_in_facets(i
, j
, n
, info
);
2108 /* Check if either i or j has only cut constraints that can
2109 * be used to wrap in (a facet of) the other basic set.
2110 * if so, replace the pair by their union.
2112 static enum isl_change
check_wrap(int i
, int j
, struct isl_coalesce_info
*info
)
2114 enum isl_change change
= isl_change_none
;
2116 change
= can_wrap_in_set(i
, j
, info
);
2117 if (change
!= isl_change_none
)
2120 change
= can_wrap_in_set(j
, i
, info
);
2124 /* Check if all inequality constraints of "i" that cut "j" cease
2125 * to be cut constraints if they are relaxed by one.
2126 * If so, collect the cut constraints in "list".
2127 * The caller is responsible for allocating "list".
2129 static isl_bool
all_cut_by_one(int i
, int j
, struct isl_coalesce_info
*info
,
2135 for (l
= 0; l
< info
[i
].bmap
->n_ineq
; ++l
) {
2136 enum isl_ineq_type type
;
2138 if (info
[i
].ineq
[l
] != STATUS_CUT
)
2140 type
= type_of_relaxed(info
[j
].tab
, info
[i
].bmap
->ineq
[l
]);
2141 if (type
== isl_ineq_error
)
2142 return isl_bool_error
;
2143 if (type
!= isl_ineq_redundant
)
2144 return isl_bool_false
;
2148 return isl_bool_true
;
2151 /* Given two basic maps such that "j" has at least one equality constraint
2152 * that is adjacent to an inequality constraint of "i" and such that "i" has
2153 * exactly one inequality constraint that is adjacent to an equality
2154 * constraint of "j", check whether "i" can be extended to include "j" or
2155 * whether "j" can be wrapped into "i".
2156 * All remaining constraints of "i" and "j" are assumed to be valid
2157 * or cut constraints of the other basic map.
2158 * However, none of the equality constraints of "i" are cut constraints.
2160 * If "i" has any "cut" inequality constraints, then check if relaxing
2161 * each of them by one is sufficient for them to become valid.
2162 * If so, check if the inequality constraint adjacent to an equality
2163 * constraint of "j" along with all these cut constraints
2164 * can be relaxed by one to contain exactly "j".
2165 * Otherwise, or if this fails, check if "j" can be wrapped into "i".
2167 static enum isl_change
check_single_adj_eq(int i
, int j
,
2168 struct isl_coalesce_info
*info
)
2170 enum isl_change change
= isl_change_none
;
2177 n_cut
= count_ineq(&info
[i
], STATUS_CUT
);
2179 k
= find_ineq(&info
[i
], STATUS_ADJ_EQ
);
2182 ctx
= isl_basic_map_get_ctx(info
[i
].bmap
);
2183 relax
= isl_calloc_array(ctx
, int, 1 + n_cut
);
2185 return isl_change_error
;
2187 try_relax
= all_cut_by_one(i
, j
, info
, relax
+ 1);
2189 change
= isl_change_error
;
2191 try_relax
= isl_bool_true
;
2194 if (try_relax
&& change
== isl_change_none
)
2195 change
= is_relaxed_extension(i
, j
, 1 + n_cut
, relax
, info
);
2198 if (change
!= isl_change_none
)
2201 change
= can_wrap_in_facet(i
, j
, k
, info
, n_cut
> 0);
2206 /* At least one of the basic maps has an equality that is adjacent
2207 * to an inequality. Make sure that only one of the basic maps has
2208 * such an equality and that the other basic map has exactly one
2209 * inequality adjacent to an equality.
2210 * If the other basic map does not have such an inequality, then
2211 * check if all its constraints are either valid or cut constraints
2212 * and, if so, try wrapping in the first map into the second.
2213 * Otherwise, try to extend one basic map with the other or
2214 * wrap one basic map in the other.
2216 static enum isl_change
check_adj_eq(int i
, int j
,
2217 struct isl_coalesce_info
*info
)
2219 if (any_eq(&info
[i
], STATUS_ADJ_INEQ
) &&
2220 any_eq(&info
[j
], STATUS_ADJ_INEQ
))
2221 /* ADJ EQ TOO MANY */
2222 return isl_change_none
;
2224 if (any_eq(&info
[i
], STATUS_ADJ_INEQ
))
2225 return check_adj_eq(j
, i
, info
);
2227 /* j has an equality adjacent to an inequality in i */
2229 if (count_ineq(&info
[i
], STATUS_ADJ_EQ
) != 1) {
2230 if (all_valid_or_cut(&info
[i
]))
2231 return can_wrap_in_set(i
, j
, info
);
2232 return isl_change_none
;
2234 if (any_eq(&info
[i
], STATUS_CUT
))
2235 return isl_change_none
;
2236 if (any_ineq(&info
[j
], STATUS_ADJ_EQ
) ||
2237 any_ineq(&info
[i
], STATUS_ADJ_INEQ
) ||
2238 any_ineq(&info
[j
], STATUS_ADJ_INEQ
))
2239 /* ADJ EQ TOO MANY */
2240 return isl_change_none
;
2242 return check_single_adj_eq(i
, j
, info
);
2245 /* Disjunct "j" lies on a hyperplane that is adjacent to disjunct "i".
2246 * In particular, disjunct "i" has an inequality constraint that is adjacent
2247 * to a (combination of) equality constraint(s) of disjunct "j",
2248 * but disjunct "j" has no explicit equality constraint adjacent
2249 * to an inequality constraint of disjunct "i".
2251 * Disjunct "i" is already known not to have any equality constraints
2252 * that are adjacent to an equality or inequality constraint.
2253 * Check that, other than the inequality constraint mentioned above,
2254 * all other constraints of disjunct "i" are valid for disjunct "j".
2255 * If so, try and wrap in disjunct "j".
2257 static enum isl_change
check_ineq_adj_eq(int i
, int j
,
2258 struct isl_coalesce_info
*info
)
2262 if (any_eq(&info
[i
], STATUS_CUT
))
2263 return isl_change_none
;
2264 if (any_ineq(&info
[i
], STATUS_CUT
))
2265 return isl_change_none
;
2266 if (any_ineq(&info
[i
], STATUS_ADJ_INEQ
))
2267 return isl_change_none
;
2268 if (count_ineq(&info
[i
], STATUS_ADJ_EQ
) != 1)
2269 return isl_change_none
;
2271 k
= find_ineq(&info
[i
], STATUS_ADJ_EQ
);
2273 return can_wrap_in_facet(i
, j
, k
, info
, 0);
2276 /* The two basic maps lie on adjacent hyperplanes. In particular,
2277 * basic map "i" has an equality that lies parallel to basic map "j".
2278 * Check if we can wrap the facets around the parallel hyperplanes
2279 * to include the other set.
2281 * We perform basically the same operations as can_wrap_in_facet,
2282 * except that we don't need to select a facet of one of the sets.
2288 * If there is more than one equality of "i" adjacent to an equality of "j",
2289 * then the result will satisfy one or more equalities that are a linear
2290 * combination of these equalities. These will be encoded as pairs
2291 * of inequalities in the wrapping constraints and need to be made
2294 static enum isl_change
check_eq_adj_eq(int i
, int j
,
2295 struct isl_coalesce_info
*info
)
2298 enum isl_change change
= isl_change_none
;
2299 int detect_equalities
= 0;
2300 struct isl_wraps wraps
;
2303 struct isl_set
*set_i
= NULL
;
2304 struct isl_set
*set_j
= NULL
;
2305 struct isl_vec
*bound
= NULL
;
2306 isl_size total
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_all
);
2309 return isl_change_error
;
2310 if (count_eq(&info
[i
], STATUS_ADJ_EQ
) != 1)
2311 detect_equalities
= 1;
2313 k
= find_eq(&info
[i
], STATUS_ADJ_EQ
);
2315 set_i
= set_from_updated_bmap(info
[i
].bmap
, info
[i
].tab
);
2316 set_j
= set_from_updated_bmap(info
[j
].bmap
, info
[j
].tab
);
2317 ctx
= isl_basic_map_get_ctx(info
[i
].bmap
);
2318 mat
= isl_mat_alloc(ctx
, 2 * (info
[i
].bmap
->n_eq
+ info
[j
].bmap
->n_eq
) +
2319 info
[i
].bmap
->n_ineq
+ info
[j
].bmap
->n_ineq
,
2321 if (wraps_init(&wraps
, mat
, info
, i
, j
) < 0)
2323 bound
= isl_vec_alloc(ctx
, 1 + total
);
2324 if (!set_i
|| !set_j
|| !bound
)
2328 isl_seq_neg(bound
->el
, info
[i
].bmap
->eq
[k
/ 2], 1 + total
);
2330 isl_seq_cpy(bound
->el
, info
[i
].bmap
->eq
[k
/ 2], 1 + total
);
2331 isl_int_add_ui(bound
->el
[0], bound
->el
[0], 1);
2333 isl_seq_cpy(wraps
.mat
->row
[0], bound
->el
, 1 + total
);
2334 wraps
.mat
->n_row
= 1;
2336 if (add_wraps(&wraps
, &info
[j
], bound
->el
, set_i
) < 0)
2341 isl_int_sub_ui(bound
->el
[0], bound
->el
[0], 1);
2342 isl_seq_neg(bound
->el
, bound
->el
, 1 + total
);
2344 isl_seq_cpy(wraps
.mat
->row
[wraps
.mat
->n_row
], bound
->el
, 1 + total
);
2347 if (add_wraps(&wraps
, &info
[i
], bound
->el
, set_j
) < 0)
2352 change
= fuse(i
, j
, info
, wraps
.mat
, detect_equalities
, 0);
2355 error
: change
= isl_change_error
;
2360 isl_set_free(set_i
);
2361 isl_set_free(set_j
);
2362 isl_vec_free(bound
);
2367 /* Initialize the "eq" and "ineq" fields of "info".
2369 static void init_status(struct isl_coalesce_info
*info
)
2371 info
->eq
= info
->ineq
= NULL
;
2374 /* Set info->eq to the positions of the equalities of info->bmap
2375 * with respect to the basic map represented by "tab".
2376 * If info->eq has already been computed, then do not compute it again.
2378 static void set_eq_status_in(struct isl_coalesce_info
*info
,
2379 struct isl_tab
*tab
)
2383 info
->eq
= eq_status_in(info
->bmap
, tab
);
2386 /* Set info->ineq to the positions of the inequalities of info->bmap
2387 * with respect to the basic map represented by "tab".
2388 * If info->ineq has already been computed, then do not compute it again.
2390 static void set_ineq_status_in(struct isl_coalesce_info
*info
,
2391 struct isl_tab
*tab
)
2395 info
->ineq
= ineq_status_in(info
->bmap
, info
->tab
, tab
);
2398 /* Free the memory allocated by the "eq" and "ineq" fields of "info".
2399 * This function assumes that init_status has been called on "info" first,
2400 * after which the "eq" and "ineq" fields may or may not have been
2401 * assigned a newly allocated array.
2403 static void clear_status(struct isl_coalesce_info
*info
)
2409 /* Are all inequality constraints of the basic map represented by "info"
2410 * valid for the other basic map, except for a single constraint
2411 * that is adjacent to an inequality constraint of the other basic map?
2413 static int all_ineq_valid_or_single_adj_ineq(struct isl_coalesce_info
*info
)
2418 for (i
= 0; i
< info
->bmap
->n_ineq
; ++i
) {
2419 if (info
->ineq
[i
] == STATUS_REDUNDANT
)
2421 if (info
->ineq
[i
] == STATUS_VALID
)
2423 if (info
->ineq
[i
] != STATUS_ADJ_INEQ
)
2433 /* Basic map "i" has one or more equality constraints that separate it
2434 * from basic map "j". Check if it happens to be an extension
2436 * In particular, check that all constraints of "j" are valid for "i",
2437 * except for one inequality constraint that is adjacent
2438 * to an inequality constraints of "i".
2439 * If so, check for "i" being an extension of "j" by calling
2440 * is_adj_ineq_extension.
2442 * Clean up the memory allocated for keeping track of the status
2443 * of the constraints before returning.
2445 static enum isl_change
separating_equality(int i
, int j
,
2446 struct isl_coalesce_info
*info
)
2448 enum isl_change change
= isl_change_none
;
2450 if (all(info
[j
].eq
, 2 * info
[j
].bmap
->n_eq
, STATUS_VALID
) &&
2451 all_ineq_valid_or_single_adj_ineq(&info
[j
]))
2452 change
= is_adj_ineq_extension(j
, i
, info
);
2454 clear_status(&info
[i
]);
2455 clear_status(&info
[j
]);
2459 /* Check if the union of the given pair of basic maps
2460 * can be represented by a single basic map.
2461 * If so, replace the pair by the single basic map and return
2462 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse.
2463 * Otherwise, return isl_change_none.
2464 * The two basic maps are assumed to live in the same local space.
2465 * The "eq" and "ineq" fields of info[i] and info[j] are assumed
2466 * to have been initialized by the caller, either to NULL or
2467 * to valid information.
2469 * We first check the effect of each constraint of one basic map
2470 * on the other basic map.
2471 * The constraint may be
2472 * redundant the constraint is redundant in its own
2473 * basic map and should be ignore and removed
2475 * valid all (integer) points of the other basic map
2476 * satisfy the constraint
2477 * separate no (integer) point of the other basic map
2478 * satisfies the constraint
2479 * cut some but not all points of the other basic map
2480 * satisfy the constraint
2481 * adj_eq the given constraint is adjacent (on the outside)
2482 * to an equality of the other basic map
2483 * adj_ineq the given constraint is adjacent (on the outside)
2484 * to an inequality of the other basic map
2486 * We consider seven cases in which we can replace the pair by a single
2487 * basic map. We ignore all "redundant" constraints.
2489 * 1. all constraints of one basic map are valid
2490 * => the other basic map is a subset and can be removed
2492 * 2. all constraints of both basic maps are either "valid" or "cut"
2493 * and the facets corresponding to the "cut" constraints
2494 * of one of the basic maps lies entirely inside the other basic map
2495 * => the pair can be replaced by a basic map consisting
2496 * of the valid constraints in both basic maps
2498 * 3. there is a single pair of adjacent inequalities
2499 * (all other constraints are "valid")
2500 * => the pair can be replaced by a basic map consisting
2501 * of the valid constraints in both basic maps
2503 * 4. one basic map has a single adjacent inequality, while the other
2504 * constraints are "valid". The other basic map has some
2505 * "cut" constraints, but replacing the adjacent inequality by
2506 * its opposite and adding the valid constraints of the other
2507 * basic map results in a subset of the other basic map
2508 * => the pair can be replaced by a basic map consisting
2509 * of the valid constraints in both basic maps
2511 * 5. there is a single adjacent pair of an inequality and an equality,
2512 * the other constraints of the basic map containing the inequality are
2513 * "valid". Moreover, if the inequality the basic map is relaxed
2514 * and then turned into an equality, then resulting facet lies
2515 * entirely inside the other basic map
2516 * => the pair can be replaced by the basic map containing
2517 * the inequality, with the inequality relaxed.
2519 * 6. there is a single inequality adjacent to an equality,
2520 * the other constraints of the basic map containing the inequality are
2521 * "valid". Moreover, the facets corresponding to both
2522 * the inequality and the equality can be wrapped around their
2523 * ridges to include the other basic map
2524 * => the pair can be replaced by a basic map consisting
2525 * of the valid constraints in both basic maps together
2526 * with all wrapping constraints
2528 * 7. one of the basic maps extends beyond the other by at most one.
2529 * Moreover, the facets corresponding to the cut constraints and
2530 * the pieces of the other basic map at offset one from these cut
2531 * constraints can be wrapped around their ridges to include
2532 * the union of the two basic maps
2533 * => the pair can be replaced by a basic map consisting
2534 * of the valid constraints in both basic maps together
2535 * with all wrapping constraints
2537 * 8. the two basic maps live in adjacent hyperplanes. In principle
2538 * such sets can always be combined through wrapping, but we impose
2539 * that there is only one such pair, to avoid overeager coalescing.
2541 * Throughout the computation, we maintain a collection of tableaus
2542 * corresponding to the basic maps. When the basic maps are dropped
2543 * or combined, the tableaus are modified accordingly.
2545 static enum isl_change
coalesce_local_pair_reuse(int i
, int j
,
2546 struct isl_coalesce_info
*info
)
2548 enum isl_change change
= isl_change_none
;
2550 set_ineq_status_in(&info
[i
], info
[j
].tab
);
2551 if (info
[i
].bmap
->n_ineq
&& !info
[i
].ineq
)
2553 if (any_ineq(&info
[i
], STATUS_ERROR
))
2555 if (any_ineq(&info
[i
], STATUS_SEPARATE
))
2558 set_ineq_status_in(&info
[j
], info
[i
].tab
);
2559 if (info
[j
].bmap
->n_ineq
&& !info
[j
].ineq
)
2561 if (any_ineq(&info
[j
], STATUS_ERROR
))
2563 if (any_ineq(&info
[j
], STATUS_SEPARATE
))
2566 set_eq_status_in(&info
[i
], info
[j
].tab
);
2567 if (info
[i
].bmap
->n_eq
&& !info
[i
].eq
)
2569 if (any_eq(&info
[i
], STATUS_ERROR
))
2572 set_eq_status_in(&info
[j
], info
[i
].tab
);
2573 if (info
[j
].bmap
->n_eq
&& !info
[j
].eq
)
2575 if (any_eq(&info
[j
], STATUS_ERROR
))
2578 if (any_eq(&info
[i
], STATUS_SEPARATE
))
2579 return separating_equality(i
, j
, info
);
2580 if (any_eq(&info
[j
], STATUS_SEPARATE
))
2581 return separating_equality(j
, i
, info
);
2583 if (all(info
[i
].eq
, 2 * info
[i
].bmap
->n_eq
, STATUS_VALID
) &&
2584 all(info
[i
].ineq
, info
[i
].bmap
->n_ineq
, STATUS_VALID
)) {
2586 change
= isl_change_drop_second
;
2587 } else if (all(info
[j
].eq
, 2 * info
[j
].bmap
->n_eq
, STATUS_VALID
) &&
2588 all(info
[j
].ineq
, info
[j
].bmap
->n_ineq
, STATUS_VALID
)) {
2590 change
= isl_change_drop_first
;
2591 } else if (any_eq(&info
[i
], STATUS_ADJ_EQ
)) {
2592 change
= check_eq_adj_eq(i
, j
, info
);
2593 } else if (any_eq(&info
[j
], STATUS_ADJ_EQ
)) {
2594 change
= check_eq_adj_eq(j
, i
, info
);
2595 } else if (any_eq(&info
[i
], STATUS_ADJ_INEQ
) ||
2596 any_eq(&info
[j
], STATUS_ADJ_INEQ
)) {
2597 change
= check_adj_eq(i
, j
, info
);
2598 } else if (any_ineq(&info
[i
], STATUS_ADJ_EQ
)) {
2599 change
= check_ineq_adj_eq(i
, j
, info
);
2600 } else if (any_ineq(&info
[j
], STATUS_ADJ_EQ
)) {
2601 change
= check_ineq_adj_eq(j
, i
, info
);
2602 } else if (any_ineq(&info
[i
], STATUS_ADJ_INEQ
) ||
2603 any_ineq(&info
[j
], STATUS_ADJ_INEQ
)) {
2604 change
= check_adj_ineq(i
, j
, info
);
2606 if (!any_eq(&info
[i
], STATUS_CUT
) &&
2607 !any_eq(&info
[j
], STATUS_CUT
))
2608 change
= check_facets(i
, j
, info
);
2609 if (change
== isl_change_none
)
2610 change
= check_wrap(i
, j
, info
);
2614 clear_status(&info
[i
]);
2615 clear_status(&info
[j
]);
2618 clear_status(&info
[i
]);
2619 clear_status(&info
[j
]);
2620 return isl_change_error
;
2623 /* Check if the union of the given pair of basic maps
2624 * can be represented by a single basic map.
2625 * If so, replace the pair by the single basic map and return
2626 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse.
2627 * Otherwise, return isl_change_none.
2628 * The two basic maps are assumed to live in the same local space.
2630 static enum isl_change
coalesce_local_pair(int i
, int j
,
2631 struct isl_coalesce_info
*info
)
2633 init_status(&info
[i
]);
2634 init_status(&info
[j
]);
2635 return coalesce_local_pair_reuse(i
, j
, info
);
2638 /* Shift the integer division at position "div" of the basic map
2639 * represented by "info" by "shift".
2641 * That is, if the integer division has the form
2645 * then replace it by
2647 * floor((f(x) + shift * d)/d) - shift
2649 static isl_stat
shift_div(struct isl_coalesce_info
*info
, int div
,
2652 isl_size total
, n_div
;
2654 info
->bmap
= isl_basic_map_shift_div(info
->bmap
, div
, 0, shift
);
2656 return isl_stat_error
;
2658 total
= isl_basic_map_dim(info
->bmap
, isl_dim_all
);
2659 n_div
= isl_basic_map_dim(info
->bmap
, isl_dim_div
);
2660 if (total
< 0 || n_div
< 0)
2661 return isl_stat_error
;
2663 if (isl_tab_shift_var(info
->tab
, total
+ div
, shift
) < 0)
2664 return isl_stat_error
;
2669 /* If the integer division at position "div" is defined by an equality,
2670 * i.e., a stride constraint, then change the integer division expression
2671 * to have a constant term equal to zero.
2673 * Let the equality constraint be
2677 * The integer division expression is then typically of the form
2679 * a = floor((-f - c')/m)
2681 * The integer division is first shifted by t = floor(c/m),
2682 * turning the equality constraint into
2684 * c - m floor(c/m) + f + m a' = 0
2688 * (c mod m) + f + m a' = 0
2692 * a' = (-f - (c mod m))/m = floor((-f)/m)
2694 * because a' is an integer and 0 <= (c mod m) < m.
2695 * The constant term of a' can therefore be zeroed out,
2696 * but only if the integer division expression is of the expected form.
2698 static isl_stat
normalize_stride_div(struct isl_coalesce_info
*info
, int div
)
2700 isl_bool defined
, valid
;
2703 isl_int shift
, stride
;
2705 defined
= isl_basic_map_has_defining_equality(info
->bmap
, isl_dim_div
,
2708 return isl_stat_error
;
2712 return isl_stat_error
;
2713 valid
= isl_constraint_is_div_equality(c
, div
);
2714 isl_int_init(shift
);
2715 isl_int_init(stride
);
2716 isl_constraint_get_constant(c
, &shift
);
2717 isl_constraint_get_coefficient(c
, isl_dim_div
, div
, &stride
);
2718 isl_int_fdiv_q(shift
, shift
, stride
);
2719 r
= shift_div(info
, div
, shift
);
2720 isl_int_clear(stride
);
2721 isl_int_clear(shift
);
2722 isl_constraint_free(c
);
2723 if (r
< 0 || valid
< 0)
2724 return isl_stat_error
;
2727 info
->bmap
= isl_basic_map_set_div_expr_constant_num_si_inplace(
2728 info
->bmap
, div
, 0);
2730 return isl_stat_error
;
2734 /* The basic maps represented by "info1" and "info2" are known
2735 * to have the same number of integer divisions.
2736 * Check if pairs of integer divisions are equal to each other
2737 * despite the fact that they differ by a rational constant.
2739 * In particular, look for any pair of integer divisions that
2740 * only differ in their constant terms.
2741 * If either of these integer divisions is defined
2742 * by stride constraints, then modify it to have a zero constant term.
2743 * If both are defined by stride constraints then in the end they will have
2744 * the same (zero) constant term.
2746 static isl_stat
harmonize_stride_divs(struct isl_coalesce_info
*info1
,
2747 struct isl_coalesce_info
*info2
)
2752 n
= isl_basic_map_dim(info1
->bmap
, isl_dim_div
);
2754 return isl_stat_error
;
2755 for (i
= 0; i
< n
; ++i
) {
2756 isl_bool known
, harmonize
;
2758 known
= isl_basic_map_div_is_known(info1
->bmap
, i
);
2759 if (known
>= 0 && known
)
2760 known
= isl_basic_map_div_is_known(info2
->bmap
, i
);
2762 return isl_stat_error
;
2765 harmonize
= isl_basic_map_equal_div_expr_except_constant(
2766 info1
->bmap
, i
, info2
->bmap
, i
);
2768 return isl_stat_error
;
2771 if (normalize_stride_div(info1
, i
) < 0)
2772 return isl_stat_error
;
2773 if (normalize_stride_div(info2
, i
) < 0)
2774 return isl_stat_error
;
2780 /* If "shift" is an integer constant, then shift the integer division
2781 * at position "div" of the basic map represented by "info" by "shift".
2782 * If "shift" is not an integer constant, then do nothing.
2783 * If "shift" is equal to zero, then no shift needs to be performed either.
2785 * That is, if the integer division has the form
2789 * then replace it by
2791 * floor((f(x) + shift * d)/d) - shift
2793 static isl_stat
shift_if_cst_int(struct isl_coalesce_info
*info
, int div
,
2794 __isl_keep isl_aff
*shift
)
2801 cst
= isl_aff_is_cst(shift
);
2802 if (cst
< 0 || !cst
)
2803 return cst
< 0 ? isl_stat_error
: isl_stat_ok
;
2805 c
= isl_aff_get_constant_val(shift
);
2806 cst
= isl_val_is_int(c
);
2807 if (cst
>= 0 && cst
)
2808 cst
= isl_bool_not(isl_val_is_zero(c
));
2809 if (cst
< 0 || !cst
) {
2811 return cst
< 0 ? isl_stat_error
: isl_stat_ok
;
2815 r
= isl_val_get_num_isl_int(c
, &d
);
2817 r
= shift_div(info
, div
, d
);
2825 /* Check if some of the divs in the basic map represented by "info1"
2826 * are shifts of the corresponding divs in the basic map represented
2827 * by "info2", taking into account the equality constraints "eq1" of "info1"
2828 * and "eq2" of "info2". If so, align them with those of "info2".
2829 * "info1" and "info2" are assumed to have the same number
2830 * of integer divisions.
2832 * An integer division is considered to be a shift of another integer
2833 * division if, after simplification with respect to the equality
2834 * constraints of the other basic map, one is equal to the other
2837 * In particular, for each pair of integer divisions, if both are known,
2838 * have the same denominator and are not already equal to each other,
2839 * simplify each with respect to the equality constraints
2840 * of the other basic map. If the difference is an integer constant,
2841 * then move this difference outside.
2842 * That is, if, after simplification, one integer division is of the form
2844 * floor((f(x) + c_1)/d)
2846 * while the other is of the form
2848 * floor((f(x) + c_2)/d)
2850 * and n = (c_2 - c_1)/d is an integer, then replace the first
2851 * integer division by
2853 * floor((f_1(x) + c_1 + n * d)/d) - n,
2855 * where floor((f_1(x) + c_1 + n * d)/d) = floor((f2(x) + c_2)/d)
2856 * after simplification with respect to the equality constraints.
2858 static isl_stat
harmonize_divs_with_hulls(struct isl_coalesce_info
*info1
,
2859 struct isl_coalesce_info
*info2
, __isl_keep isl_basic_set
*eq1
,
2860 __isl_keep isl_basic_set
*eq2
)
2864 isl_local_space
*ls1
, *ls2
;
2866 total
= isl_basic_map_dim(info1
->bmap
, isl_dim_all
);
2868 return isl_stat_error
;
2869 ls1
= isl_local_space_wrap(isl_basic_map_get_local_space(info1
->bmap
));
2870 ls2
= isl_local_space_wrap(isl_basic_map_get_local_space(info2
->bmap
));
2871 for (i
= 0; i
< info1
->bmap
->n_div
; ++i
) {
2873 isl_aff
*div1
, *div2
;
2875 if (!isl_local_space_div_is_known(ls1
, i
) ||
2876 !isl_local_space_div_is_known(ls2
, i
))
2878 if (isl_int_ne(info1
->bmap
->div
[i
][0], info2
->bmap
->div
[i
][0]))
2880 if (isl_seq_eq(info1
->bmap
->div
[i
] + 1,
2881 info2
->bmap
->div
[i
] + 1, 1 + total
))
2883 div1
= isl_local_space_get_div(ls1
, i
);
2884 div2
= isl_local_space_get_div(ls2
, i
);
2885 div1
= isl_aff_substitute_equalities(div1
,
2886 isl_basic_set_copy(eq2
));
2887 div2
= isl_aff_substitute_equalities(div2
,
2888 isl_basic_set_copy(eq1
));
2889 div2
= isl_aff_sub(div2
, div1
);
2890 r
= shift_if_cst_int(info1
, i
, div2
);
2895 isl_local_space_free(ls1
);
2896 isl_local_space_free(ls2
);
2898 if (i
< info1
->bmap
->n_div
)
2899 return isl_stat_error
;
2903 /* Check if some of the divs in the basic map represented by "info1"
2904 * are shifts of the corresponding divs in the basic map represented
2905 * by "info2". If so, align them with those of "info2".
2906 * Only do this if "info1" and "info2" have the same number
2907 * of integer divisions.
2909 * An integer division is considered to be a shift of another integer
2910 * division if, after simplification with respect to the equality
2911 * constraints of the other basic map, one is equal to the other
2914 * First check if pairs of integer divisions are equal to each other
2915 * despite the fact that they differ by a rational constant.
2916 * If so, try and arrange for them to have the same constant term.
2918 * Then, extract the equality constraints and continue with
2919 * harmonize_divs_with_hulls.
2921 * If the equality constraints of both basic maps are the same,
2922 * then there is no need to perform any shifting since
2923 * the coefficients of the integer divisions should have been
2924 * reduced in the same way.
2926 static isl_stat
harmonize_divs(struct isl_coalesce_info
*info1
,
2927 struct isl_coalesce_info
*info2
)
2930 isl_basic_map
*bmap1
, *bmap2
;
2931 isl_basic_set
*eq1
, *eq2
;
2934 if (!info1
->bmap
|| !info2
->bmap
)
2935 return isl_stat_error
;
2937 if (info1
->bmap
->n_div
!= info2
->bmap
->n_div
)
2939 if (info1
->bmap
->n_div
== 0)
2942 if (harmonize_stride_divs(info1
, info2
) < 0)
2943 return isl_stat_error
;
2945 bmap1
= isl_basic_map_copy(info1
->bmap
);
2946 bmap2
= isl_basic_map_copy(info2
->bmap
);
2947 eq1
= isl_basic_map_wrap(isl_basic_map_plain_affine_hull(bmap1
));
2948 eq2
= isl_basic_map_wrap(isl_basic_map_plain_affine_hull(bmap2
));
2949 equal
= isl_basic_set_plain_is_equal(eq1
, eq2
);
2955 r
= harmonize_divs_with_hulls(info1
, info2
, eq1
, eq2
);
2956 isl_basic_set_free(eq1
);
2957 isl_basic_set_free(eq2
);
2962 /* Do the two basic maps live in the same local space, i.e.,
2963 * do they have the same (known) divs?
2964 * If either basic map has any unknown divs, then we can only assume
2965 * that they do not live in the same local space.
2967 static isl_bool
same_divs(__isl_keep isl_basic_map
*bmap1
,
2968 __isl_keep isl_basic_map
*bmap2
)
2974 if (!bmap1
|| !bmap2
)
2975 return isl_bool_error
;
2976 if (bmap1
->n_div
!= bmap2
->n_div
)
2977 return isl_bool_false
;
2979 if (bmap1
->n_div
== 0)
2980 return isl_bool_true
;
2982 known
= isl_basic_map_divs_known(bmap1
);
2983 if (known
< 0 || !known
)
2985 known
= isl_basic_map_divs_known(bmap2
);
2986 if (known
< 0 || !known
)
2989 total
= isl_basic_map_dim(bmap1
, isl_dim_all
);
2991 return isl_bool_error
;
2992 for (i
= 0; i
< bmap1
->n_div
; ++i
)
2993 if (!isl_seq_eq(bmap1
->div
[i
], bmap2
->div
[i
], 2 + total
))
2994 return isl_bool_false
;
2996 return isl_bool_true
;
2999 /* Assuming that "tab" contains the equality constraints and
3000 * the initial inequality constraints of "bmap", copy the remaining
3001 * inequality constraints of "bmap" to "Tab".
3003 static isl_stat
copy_ineq(struct isl_tab
*tab
, __isl_keep isl_basic_map
*bmap
)
3008 return isl_stat_error
;
3010 n_ineq
= tab
->n_con
- tab
->n_eq
;
3011 for (i
= n_ineq
; i
< bmap
->n_ineq
; ++i
)
3012 if (isl_tab_add_ineq(tab
, bmap
->ineq
[i
]) < 0)
3013 return isl_stat_error
;
3018 /* Description of an integer division that is added
3019 * during an expansion.
3020 * "pos" is the position of the corresponding variable.
3021 * "cst" indicates whether this integer division has a fixed value.
3022 * "val" contains the fixed value, if the value is fixed.
3024 struct isl_expanded
{
3030 /* For each of the "n" integer division variables "expanded",
3031 * if the variable has a fixed value, then add two inequality
3032 * constraints expressing the fixed value.
3033 * Otherwise, add the corresponding div constraints.
3034 * The caller is responsible for removing the div constraints
3035 * that it added for all these "n" integer divisions.
3037 * The div constraints and the pair of inequality constraints
3038 * forcing the fixed value cannot both be added for a given variable
3039 * as the combination may render some of the original constraints redundant.
3040 * These would then be ignored during the coalescing detection,
3041 * while they could remain in the fused result.
3043 * The two added inequality constraints are
3048 * with "a" the variable and "v" its fixed value.
3049 * The facet corresponding to one of these two constraints is selected
3050 * in the tableau to ensure that the pair of inequality constraints
3051 * is treated as an equality constraint.
3053 * The information in info->ineq is thrown away because it was
3054 * computed in terms of div constraints, while some of those
3055 * have now been replaced by these pairs of inequality constraints.
3057 static isl_stat
fix_constant_divs(struct isl_coalesce_info
*info
,
3058 int n
, struct isl_expanded
*expanded
)
3064 o_div
= isl_basic_map_offset(info
->bmap
, isl_dim_div
) - 1;
3065 ineq
= isl_vec_alloc(isl_tab_get_ctx(info
->tab
), 1 + info
->tab
->n_var
);
3067 return isl_stat_error
;
3068 isl_seq_clr(ineq
->el
+ 1, info
->tab
->n_var
);
3070 for (i
= 0; i
< n
; ++i
) {
3071 if (!expanded
[i
].cst
) {
3072 info
->bmap
= isl_basic_map_extend_constraints(
3074 info
->bmap
= isl_basic_map_add_div_constraints(
3075 info
->bmap
, expanded
[i
].pos
- o_div
);
3077 isl_int_set_si(ineq
->el
[1 + expanded
[i
].pos
], -1);
3078 isl_int_set(ineq
->el
[0], expanded
[i
].val
);
3079 info
->bmap
= isl_basic_map_add_ineq(info
->bmap
,
3081 isl_int_set_si(ineq
->el
[1 + expanded
[i
].pos
], 1);
3082 isl_int_neg(ineq
->el
[0], expanded
[i
].val
);
3083 info
->bmap
= isl_basic_map_add_ineq(info
->bmap
,
3085 isl_int_set_si(ineq
->el
[1 + expanded
[i
].pos
], 0);
3087 if (copy_ineq(info
->tab
, info
->bmap
) < 0)
3089 if (expanded
[i
].cst
&&
3090 isl_tab_select_facet(info
->tab
, info
->tab
->n_con
- 1) < 0)
3099 return i
< n
? isl_stat_error
: isl_stat_ok
;
3102 /* Insert the "n" integer division variables "expanded"
3103 * into info->tab and info->bmap and
3104 * update info->ineq with respect to the redundant constraints
3105 * in the resulting tableau.
3106 * "bmap" contains the result of this insertion in info->bmap,
3107 * while info->bmap is the original version
3108 * of "bmap", i.e., the one that corresponds to the current
3109 * state of info->tab. The number of constraints in info->bmap
3110 * is assumed to be the same as the number of constraints
3111 * in info->tab. This is required to be able to detect
3112 * the extra constraints in "bmap".
3114 * In particular, introduce extra variables corresponding
3115 * to the extra integer divisions and add the div constraints
3116 * that were added to "bmap" after info->tab was created
3118 * Furthermore, check if these extra integer divisions happen
3119 * to attain a fixed integer value in info->tab.
3120 * If so, replace the corresponding div constraints by pairs
3121 * of inequality constraints that fix these
3122 * integer divisions to their single integer values.
3123 * Replace info->bmap by "bmap" to match the changes to info->tab.
3124 * info->ineq was computed without a tableau and therefore
3125 * does not take into account the redundant constraints
3126 * in the tableau. Mark them here.
3127 * There is no need to check the newly added div constraints
3128 * since they cannot be redundant.
3129 * The redundancy check is not performed when constants have been discovered
3130 * since info->ineq is completely thrown away in this case.
3132 static isl_stat
tab_insert_divs(struct isl_coalesce_info
*info
,
3133 int n
, struct isl_expanded
*expanded
, __isl_take isl_basic_map
*bmap
)
3137 struct isl_tab_undo
*snap
;
3141 return isl_stat_error
;
3142 if (info
->bmap
->n_eq
+ info
->bmap
->n_ineq
!= info
->tab
->n_con
)
3143 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
3144 "original tableau does not correspond "
3145 "to original basic map", goto error
);
3147 if (isl_tab_extend_vars(info
->tab
, n
) < 0)
3149 if (isl_tab_extend_cons(info
->tab
, 2 * n
) < 0)
3152 for (i
= 0; i
< n
; ++i
) {
3153 if (isl_tab_insert_var(info
->tab
, expanded
[i
].pos
) < 0)
3157 snap
= isl_tab_snap(info
->tab
);
3159 n_ineq
= info
->tab
->n_con
- info
->tab
->n_eq
;
3160 if (copy_ineq(info
->tab
, bmap
) < 0)
3163 isl_basic_map_free(info
->bmap
);
3167 for (i
= 0; i
< n
; ++i
) {
3168 expanded
[i
].cst
= isl_tab_is_constant(info
->tab
,
3169 expanded
[i
].pos
, &expanded
[i
].val
);
3170 if (expanded
[i
].cst
< 0)
3171 return isl_stat_error
;
3172 if (expanded
[i
].cst
)
3177 if (isl_tab_rollback(info
->tab
, snap
) < 0)
3178 return isl_stat_error
;
3179 info
->bmap
= isl_basic_map_cow(info
->bmap
);
3180 info
->bmap
= isl_basic_map_free_inequality(info
->bmap
, 2 * n
);
3182 return isl_stat_error
;
3184 return fix_constant_divs(info
, n
, expanded
);
3187 n_eq
= info
->bmap
->n_eq
;
3188 for (i
= 0; i
< n_ineq
; ++i
) {
3189 if (isl_tab_is_redundant(info
->tab
, n_eq
+ i
))
3190 info
->ineq
[i
] = STATUS_REDUNDANT
;
3195 isl_basic_map_free(bmap
);
3196 return isl_stat_error
;
3199 /* Expand info->tab and info->bmap in the same way "bmap" was expanded
3200 * in isl_basic_map_expand_divs using the expansion "exp" and
3201 * update info->ineq with respect to the redundant constraints
3202 * in the resulting tableau. info->bmap is the original version
3203 * of "bmap", i.e., the one that corresponds to the current
3204 * state of info->tab. The number of constraints in info->bmap
3205 * is assumed to be the same as the number of constraints
3206 * in info->tab. This is required to be able to detect
3207 * the extra constraints in "bmap".
3209 * Extract the positions where extra local variables are introduced
3210 * from "exp" and call tab_insert_divs.
3212 static isl_stat
expand_tab(struct isl_coalesce_info
*info
, int *exp
,
3213 __isl_take isl_basic_map
*bmap
)
3216 struct isl_expanded
*expanded
;
3219 isl_size total
, n_div
;
3223 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
3224 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
3225 if (total
< 0 || n_div
< 0)
3226 return isl_stat_error
;
3227 pos
= total
- n_div
;
3228 extra_var
= total
- info
->tab
->n_var
;
3229 n
= n_div
- extra_var
;
3231 ctx
= isl_basic_map_get_ctx(bmap
);
3232 expanded
= isl_calloc_array(ctx
, struct isl_expanded
, extra_var
);
3233 if (extra_var
&& !expanded
)
3238 for (j
= 0; j
< n_div
; ++j
) {
3239 if (i
< n
&& exp
[i
] == j
) {
3243 expanded
[k
++].pos
= pos
+ j
;
3246 for (k
= 0; k
< extra_var
; ++k
)
3247 isl_int_init(expanded
[k
].val
);
3249 r
= tab_insert_divs(info
, extra_var
, expanded
, bmap
);
3251 for (k
= 0; k
< extra_var
; ++k
)
3252 isl_int_clear(expanded
[k
].val
);
3257 isl_basic_map_free(bmap
);
3258 return isl_stat_error
;
3261 /* Check if the union of the basic maps represented by info[i] and info[j]
3262 * can be represented by a single basic map,
3263 * after expanding the divs of info[i] to match those of info[j].
3264 * If so, replace the pair by the single basic map and return
3265 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse.
3266 * Otherwise, return isl_change_none.
3268 * The caller has already checked for info[j] being a subset of info[i].
3269 * If some of the divs of info[j] are unknown, then the expanded info[i]
3270 * will not have the corresponding div constraints. The other patterns
3271 * therefore cannot apply. Skip the computation in this case.
3273 * The expansion is performed using the divs "div" and expansion "exp"
3274 * computed by the caller.
3275 * info[i].bmap has already been expanded and the result is passed in
3277 * The "eq" and "ineq" fields of info[i] reflect the status of
3278 * the constraints of the expanded "bmap" with respect to info[j].tab.
3279 * However, inequality constraints that are redundant in info[i].tab
3280 * have not yet been marked as such because no tableau was available.
3282 * Replace info[i].bmap by "bmap" and expand info[i].tab as well,
3283 * updating info[i].ineq with respect to the redundant constraints.
3284 * Then try and coalesce the expanded info[i] with info[j],
3285 * reusing the information in info[i].eq and info[i].ineq.
3286 * If this does not result in any coalescing or if it results in info[j]
3287 * getting dropped (which should not happen in practice, since the case
3288 * of info[j] being a subset of info[i] has already been checked by
3289 * the caller), then revert info[i] to its original state.
3291 static enum isl_change
coalesce_expand_tab_divs(__isl_take isl_basic_map
*bmap
,
3292 int i
, int j
, struct isl_coalesce_info
*info
, __isl_keep isl_mat
*div
,
3296 isl_basic_map
*bmap_i
;
3297 struct isl_tab_undo
*snap
;
3298 enum isl_change change
= isl_change_none
;
3300 known
= isl_basic_map_divs_known(info
[j
].bmap
);
3301 if (known
< 0 || !known
) {
3302 clear_status(&info
[i
]);
3303 isl_basic_map_free(bmap
);
3304 return known
< 0 ? isl_change_error
: isl_change_none
;
3307 bmap_i
= isl_basic_map_copy(info
[i
].bmap
);
3308 snap
= isl_tab_snap(info
[i
].tab
);
3309 if (expand_tab(&info
[i
], exp
, bmap
) < 0)
3310 change
= isl_change_error
;
3312 init_status(&info
[j
]);
3313 if (change
== isl_change_none
)
3314 change
= coalesce_local_pair_reuse(i
, j
, info
);
3316 clear_status(&info
[i
]);
3317 if (change
!= isl_change_none
&& change
!= isl_change_drop_second
) {
3318 isl_basic_map_free(bmap_i
);
3320 isl_basic_map_free(info
[i
].bmap
);
3321 info
[i
].bmap
= bmap_i
;
3323 if (isl_tab_rollback(info
[i
].tab
, snap
) < 0)
3324 change
= isl_change_error
;
3330 /* Check if the union of "bmap" and the basic map represented by info[j]
3331 * can be represented by a single basic map,
3332 * after expanding the divs of "bmap" to match those of info[j].
3333 * If so, replace the pair by the single basic map and return
3334 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse.
3335 * Otherwise, return isl_change_none.
3337 * In particular, check if the expanded "bmap" contains the basic map
3338 * represented by the tableau info[j].tab.
3339 * The expansion is performed using the divs "div" and expansion "exp"
3340 * computed by the caller.
3341 * Then we check if all constraints of the expanded "bmap" are valid for
3344 * If "i" is not equal to -1, then "bmap" is equal to info[i].bmap.
3345 * In this case, the positions of the constraints of info[i].bmap
3346 * with respect to the basic map represented by info[j] are stored
3349 * If the expanded "bmap" does not contain the basic map
3350 * represented by the tableau info[j].tab and if "i" is not -1,
3351 * i.e., if the original "bmap" is info[i].bmap, then expand info[i].tab
3352 * as well and check if that results in coalescing.
3354 static enum isl_change
coalesce_with_expanded_divs(
3355 __isl_keep isl_basic_map
*bmap
, int i
, int j
,
3356 struct isl_coalesce_info
*info
, __isl_keep isl_mat
*div
, int *exp
)
3358 enum isl_change change
= isl_change_none
;
3359 struct isl_coalesce_info info_local
, *info_i
;
3361 info_i
= i
>= 0 ? &info
[i
] : &info_local
;
3362 init_status(info_i
);
3363 bmap
= isl_basic_map_copy(bmap
);
3364 bmap
= isl_basic_map_expand_divs(bmap
, isl_mat_copy(div
), exp
);
3365 bmap
= isl_basic_map_mark_final(bmap
);
3370 info_local
.bmap
= bmap
;
3371 info_i
->eq
= eq_status_in(bmap
, info
[j
].tab
);
3372 if (bmap
->n_eq
&& !info_i
->eq
)
3374 if (any_eq(info_i
, STATUS_ERROR
))
3376 if (any_eq(info_i
, STATUS_SEPARATE
))
3379 info_i
->ineq
= ineq_status_in(bmap
, NULL
, info
[j
].tab
);
3380 if (bmap
->n_ineq
&& !info_i
->ineq
)
3382 if (any_ineq(info_i
, STATUS_ERROR
))
3384 if (any_ineq(info_i
, STATUS_SEPARATE
))
3387 if (all(info_i
->eq
, 2 * bmap
->n_eq
, STATUS_VALID
) &&
3388 all(info_i
->ineq
, bmap
->n_ineq
, STATUS_VALID
)) {
3390 change
= isl_change_drop_second
;
3393 if (change
== isl_change_none
&& i
!= -1)
3394 return coalesce_expand_tab_divs(bmap
, i
, j
, info
, div
, exp
);
3397 isl_basic_map_free(bmap
);
3398 clear_status(info_i
);
3401 isl_basic_map_free(bmap
);
3402 clear_status(info_i
);
3403 return isl_change_error
;
3406 /* Check if the union of "bmap_i" and the basic map represented by info[j]
3407 * can be represented by a single basic map,
3408 * after aligning the divs of "bmap_i" to match those of info[j].
3409 * If so, replace the pair by the single basic map and return
3410 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse.
3411 * Otherwise, return isl_change_none.
3413 * In particular, check if "bmap_i" contains the basic map represented by
3414 * info[j] after aligning the divs of "bmap_i" to those of info[j].
3415 * Note that this can only succeed if the number of divs of "bmap_i"
3416 * is smaller than (or equal to) the number of divs of info[j].
3418 * We first check if the divs of "bmap_i" are all known and form a subset
3419 * of those of info[j].bmap. If so, we pass control over to
3420 * coalesce_with_expanded_divs.
3422 * If "i" is not equal to -1, then "bmap" is equal to info[i].bmap.
3424 static enum isl_change
coalesce_after_aligning_divs(
3425 __isl_keep isl_basic_map
*bmap_i
, int i
, int j
,
3426 struct isl_coalesce_info
*info
)
3429 isl_mat
*div_i
, *div_j
, *div
;
3433 enum isl_change change
;
3435 known
= isl_basic_map_divs_known(bmap_i
);
3437 return isl_change_error
;
3439 return isl_change_none
;
3441 ctx
= isl_basic_map_get_ctx(bmap_i
);
3443 div_i
= isl_basic_map_get_divs(bmap_i
);
3444 div_j
= isl_basic_map_get_divs(info
[j
].bmap
);
3446 if (!div_i
|| !div_j
)
3449 exp1
= isl_alloc_array(ctx
, int, div_i
->n_row
);
3450 exp2
= isl_alloc_array(ctx
, int, div_j
->n_row
);
3451 if ((div_i
->n_row
&& !exp1
) || (div_j
->n_row
&& !exp2
))
3454 div
= isl_merge_divs(div_i
, div_j
, exp1
, exp2
);
3458 if (div
->n_row
== div_j
->n_row
)
3459 change
= coalesce_with_expanded_divs(bmap_i
,
3460 i
, j
, info
, div
, exp1
);
3462 change
= isl_change_none
;
3466 isl_mat_free(div_i
);
3467 isl_mat_free(div_j
);
3474 isl_mat_free(div_i
);
3475 isl_mat_free(div_j
);
3478 return isl_change_error
;
3481 /* Check if basic map "j" is a subset of basic map "i" after
3482 * exploiting the extra equalities of "j" to simplify the divs of "i".
3483 * If so, remove basic map "j" and return isl_change_drop_second.
3485 * If "j" does not have any equalities or if they are the same
3486 * as those of "i", then we cannot exploit them to simplify the divs.
3487 * Similarly, if there are no divs in "i", then they cannot be simplified.
3488 * If, on the other hand, the affine hulls of "i" and "j" do not intersect,
3489 * then "j" cannot be a subset of "i".
3491 * Otherwise, we intersect "i" with the affine hull of "j" and then
3492 * check if "j" is a subset of the result after aligning the divs.
3493 * If so, then "j" is definitely a subset of "i" and can be removed.
3494 * Note that if after intersection with the affine hull of "j".
3495 * "i" still has more divs than "j", then there is no way we can
3496 * align the divs of "i" to those of "j".
3498 static enum isl_change
coalesce_subset_with_equalities(int i
, int j
,
3499 struct isl_coalesce_info
*info
)
3501 isl_basic_map
*hull_i
, *hull_j
, *bmap_i
;
3503 enum isl_change change
;
3505 if (info
[j
].bmap
->n_eq
== 0)
3506 return isl_change_none
;
3507 if (info
[i
].bmap
->n_div
== 0)
3508 return isl_change_none
;
3510 hull_i
= isl_basic_map_copy(info
[i
].bmap
);
3511 hull_i
= isl_basic_map_plain_affine_hull(hull_i
);
3512 hull_j
= isl_basic_map_copy(info
[j
].bmap
);
3513 hull_j
= isl_basic_map_plain_affine_hull(hull_j
);
3515 hull_j
= isl_basic_map_intersect(hull_j
, isl_basic_map_copy(hull_i
));
3516 equal
= isl_basic_map_plain_is_equal(hull_i
, hull_j
);
3517 empty
= isl_basic_map_plain_is_empty(hull_j
);
3518 isl_basic_map_free(hull_i
);
3520 if (equal
< 0 || equal
|| empty
< 0 || empty
) {
3521 isl_basic_map_free(hull_j
);
3522 if (equal
< 0 || empty
< 0)
3523 return isl_change_error
;
3524 return isl_change_none
;
3527 bmap_i
= isl_basic_map_copy(info
[i
].bmap
);
3528 bmap_i
= isl_basic_map_intersect(bmap_i
, hull_j
);
3530 return isl_change_error
;
3532 if (bmap_i
->n_div
> info
[j
].bmap
->n_div
) {
3533 isl_basic_map_free(bmap_i
);
3534 return isl_change_none
;
3537 change
= coalesce_after_aligning_divs(bmap_i
, -1, j
, info
);
3539 isl_basic_map_free(bmap_i
);
3544 /* Check if the union of the basic maps represented by info[i] and info[j]
3545 * can be represented by a single basic map, by aligning or equating
3546 * their integer divisions.
3547 * If so, replace the pair by the single basic map and return
3548 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse.
3549 * Otherwise, return isl_change_none.
3551 * Note that we only perform any test if the number of divs is different
3552 * in the two basic maps. In case the number of divs is the same,
3553 * we have already established that the divs are different
3554 * in the two basic maps.
3555 * In particular, if the number of divs of basic map i is smaller than
3556 * the number of divs of basic map j, then we check if j is a subset of i
3559 static enum isl_change
coalesce_divs(int i
, int j
,
3560 struct isl_coalesce_info
*info
)
3562 enum isl_change change
= isl_change_none
;
3564 if (info
[i
].bmap
->n_div
< info
[j
].bmap
->n_div
)
3565 change
= coalesce_after_aligning_divs(info
[i
].bmap
, i
, j
, info
);
3566 if (change
!= isl_change_none
)
3569 if (info
[j
].bmap
->n_div
< info
[i
].bmap
->n_div
)
3570 change
= coalesce_after_aligning_divs(info
[j
].bmap
, j
, i
, info
);
3571 if (change
!= isl_change_none
)
3572 return invert_change(change
);
3574 change
= coalesce_subset_with_equalities(i
, j
, info
);
3575 if (change
!= isl_change_none
)
3578 change
= coalesce_subset_with_equalities(j
, i
, info
);
3579 if (change
!= isl_change_none
)
3580 return invert_change(change
);
3582 return isl_change_none
;
3585 /* Does "bmap" involve any divs that themselves refer to divs?
3587 static isl_bool
has_nested_div(__isl_keep isl_basic_map
*bmap
)
3593 total
= isl_basic_map_dim(bmap
, isl_dim_all
);
3594 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
3595 if (total
< 0 || n_div
< 0)
3596 return isl_bool_error
;
3599 for (i
= 0; i
< n_div
; ++i
)
3600 if (isl_seq_first_non_zero(bmap
->div
[i
] + 2 + total
,
3602 return isl_bool_true
;
3604 return isl_bool_false
;
3607 /* Return a list of affine expressions, one for each integer division
3608 * in "bmap_i". For each integer division that also appears in "bmap_j",
3609 * the affine expression is set to NaN. The number of NaNs in the list
3610 * is equal to the number of integer divisions in "bmap_j".
3611 * For the other integer divisions of "bmap_i", the corresponding
3612 * element in the list is a purely affine expression equal to the integer
3613 * division in "hull".
3614 * If no such list can be constructed, then the number of elements
3615 * in the returned list is smaller than the number of integer divisions
3617 * The integer division of "bmap_i" and "bmap_j" are assumed to be known and
3618 * not contain any nested divs.
3620 static __isl_give isl_aff_list
*set_up_substitutions(
3621 __isl_keep isl_basic_map
*bmap_i
, __isl_keep isl_basic_map
*bmap_j
,
3622 __isl_take isl_basic_map
*hull
)
3624 isl_size n_div_i
, n_div_j
, total
;
3626 isl_local_space
*ls
;
3627 isl_basic_set
*wrap_hull
;
3632 n_div_i
= isl_basic_map_dim(bmap_i
, isl_dim_div
);
3633 n_div_j
= isl_basic_map_dim(bmap_j
, isl_dim_div
);
3634 total
= isl_basic_map_dim(bmap_i
, isl_dim_all
);
3635 if (!hull
|| n_div_i
< 0 || n_div_j
< 0 || total
< 0)
3638 ctx
= isl_basic_map_get_ctx(hull
);
3641 ls
= isl_basic_map_get_local_space(bmap_i
);
3642 ls
= isl_local_space_wrap(ls
);
3643 wrap_hull
= isl_basic_map_wrap(hull
);
3645 aff_nan
= isl_aff_nan_on_domain(isl_local_space_copy(ls
));
3646 list
= isl_aff_list_alloc(ctx
, n_div_i
);
3649 for (i
= 0; i
< n_div_i
; ++i
) {
3654 isl_basic_map_equal_div_expr_part(bmap_i
, i
, bmap_j
, j
,
3657 list
= isl_aff_list_add(list
, isl_aff_copy(aff_nan
));
3660 if (n_div_i
- i
<= n_div_j
- j
)
3663 aff
= isl_local_space_get_div(ls
, i
);
3664 aff
= isl_aff_substitute_equalities(aff
,
3665 isl_basic_set_copy(wrap_hull
));
3666 aff
= isl_aff_floor(aff
);
3667 n_div
= isl_aff_dim(aff
, isl_dim_div
);
3675 list
= isl_aff_list_add(list
, aff
);
3678 isl_aff_free(aff_nan
);
3679 isl_local_space_free(ls
);
3680 isl_basic_set_free(wrap_hull
);
3684 isl_aff_free(aff_nan
);
3685 isl_local_space_free(ls
);
3686 isl_basic_set_free(wrap_hull
);
3687 isl_aff_list_free(list
);
3691 /* Add variables to info->bmap and info->tab corresponding to the elements
3692 * in "list" that are not set to NaN.
3693 * "extra_var" is the number of these elements.
3694 * "dim" is the offset in the variables of "tab" where we should
3695 * start considering the elements in "list".
3696 * When this function returns, the total number of variables in "tab"
3697 * is equal to "dim" plus the number of elements in "list".
3699 * The newly added existentially quantified variables are not given
3700 * an explicit representation because the corresponding div constraints
3701 * do not appear in info->bmap. These constraints are not added
3702 * to info->bmap because for internal consistency, they would need to
3703 * be added to info->tab as well, where they could combine with the equality
3704 * that is added later to result in constraints that do not hold
3705 * in the original input.
3707 static isl_stat
add_sub_vars(struct isl_coalesce_info
*info
,
3708 __isl_keep isl_aff_list
*list
, int dim
, int extra_var
)
3713 info
->bmap
= isl_basic_map_cow(info
->bmap
);
3714 info
->bmap
= isl_basic_map_extend(info
->bmap
, extra_var
, 0, 0);
3715 n
= isl_aff_list_n_aff(list
);
3716 if (!info
->bmap
|| n
< 0)
3717 return isl_stat_error
;
3718 for (i
= 0; i
< n
; ++i
) {
3722 aff
= isl_aff_list_get_aff(list
, i
);
3723 is_nan
= isl_aff_is_nan(aff
);
3726 return isl_stat_error
;
3730 if (isl_tab_insert_var(info
->tab
, dim
+ i
) < 0)
3731 return isl_stat_error
;
3732 d
= isl_basic_map_alloc_div(info
->bmap
);
3734 return isl_stat_error
;
3735 info
->bmap
= isl_basic_map_mark_div_unknown(info
->bmap
, d
);
3736 for (j
= d
; j
> i
; --j
)
3737 info
->bmap
= isl_basic_map_swap_div(info
->bmap
,
3740 return isl_stat_error
;
3746 /* For each element in "list" that is not set to NaN, fix the corresponding
3747 * variable in "tab" to the purely affine expression defined by the element.
3748 * "dim" is the offset in the variables of "tab" where we should
3749 * start considering the elements in "list".
3751 * This function assumes that a sufficient number of rows and
3752 * elements in the constraint array are available in the tableau.
3754 static isl_stat
add_sub_equalities(struct isl_tab
*tab
,
3755 __isl_keep isl_aff_list
*list
, int dim
)
3763 n
= isl_aff_list_n_aff(list
);
3765 return isl_stat_error
;
3767 ctx
= isl_tab_get_ctx(tab
);
3768 sub
= isl_vec_alloc(ctx
, 1 + dim
+ n
);
3770 return isl_stat_error
;
3771 isl_seq_clr(sub
->el
+ 1 + dim
, n
);
3773 for (i
= 0; i
< n
; ++i
) {
3774 aff
= isl_aff_list_get_aff(list
, i
);
3777 if (isl_aff_is_nan(aff
)) {
3781 isl_seq_cpy(sub
->el
, aff
->v
->el
+ 1, 1 + dim
);
3782 isl_int_neg(sub
->el
[1 + dim
+ i
], aff
->v
->el
[0]);
3783 if (isl_tab_add_eq(tab
, sub
->el
) < 0)
3785 isl_int_set_si(sub
->el
[1 + dim
+ i
], 0);
3794 return isl_stat_error
;
3797 /* Add variables to info->tab and info->bmap corresponding to the elements
3798 * in "list" that are not set to NaN. The value of the added variable
3799 * in info->tab is fixed to the purely affine expression defined by the element.
3800 * "dim" is the offset in the variables of info->tab where we should
3801 * start considering the elements in "list".
3802 * When this function returns, the total number of variables in info->tab
3803 * is equal to "dim" plus the number of elements in "list".
3805 static isl_stat
add_subs(struct isl_coalesce_info
*info
,
3806 __isl_keep isl_aff_list
*list
, int dim
)
3811 n
= isl_aff_list_n_aff(list
);
3813 return isl_stat_error
;
3815 extra_var
= n
- (info
->tab
->n_var
- dim
);
3817 if (isl_tab_extend_vars(info
->tab
, extra_var
) < 0)
3818 return isl_stat_error
;
3819 if (isl_tab_extend_cons(info
->tab
, 2 * extra_var
) < 0)
3820 return isl_stat_error
;
3821 if (add_sub_vars(info
, list
, dim
, extra_var
) < 0)
3822 return isl_stat_error
;
3824 return add_sub_equalities(info
->tab
, list
, dim
);
3827 /* Coalesce basic map "j" into basic map "i" after adding the extra integer
3828 * divisions in "i" but not in "j" to basic map "j", with values
3829 * specified by "list". The total number of elements in "list"
3830 * is equal to the number of integer divisions in "i", while the number
3831 * of NaN elements in the list is equal to the number of integer divisions
3834 * If no coalescing can be performed, then we need to revert basic map "j"
3835 * to its original state. We do the same if basic map "i" gets dropped
3836 * during the coalescing, even though this should not happen in practice
3837 * since we have already checked for "j" being a subset of "i"
3838 * before we reach this stage.
3840 static enum isl_change
coalesce_with_subs(int i
, int j
,
3841 struct isl_coalesce_info
*info
, __isl_keep isl_aff_list
*list
)
3843 isl_basic_map
*bmap_j
;
3844 struct isl_tab_undo
*snap
;
3845 isl_size dim
, n_div
;
3846 enum isl_change change
;
3848 bmap_j
= isl_basic_map_copy(info
[j
].bmap
);
3849 snap
= isl_tab_snap(info
[j
].tab
);
3851 dim
= isl_basic_map_dim(bmap_j
, isl_dim_all
);
3852 n_div
= isl_basic_map_dim(bmap_j
, isl_dim_div
);
3853 if (dim
< 0 || n_div
< 0)
3856 if (add_subs(&info
[j
], list
, dim
) < 0)
3859 change
= coalesce_local_pair(i
, j
, info
);
3860 if (change
!= isl_change_none
&& change
!= isl_change_drop_first
) {
3861 isl_basic_map_free(bmap_j
);
3863 isl_basic_map_free(info
[j
].bmap
);
3864 info
[j
].bmap
= bmap_j
;
3866 if (isl_tab_rollback(info
[j
].tab
, snap
) < 0)
3867 return isl_change_error
;
3872 isl_basic_map_free(bmap_j
);
3873 return isl_change_error
;
3876 /* Check if we can coalesce basic map "j" into basic map "i" after copying
3877 * those extra integer divisions in "i" that can be simplified away
3878 * using the extra equalities in "j".
3879 * All divs are assumed to be known and not contain any nested divs.
3881 * We first check if there are any extra equalities in "j" that we
3882 * can exploit. Then we check if every integer division in "i"
3883 * either already appears in "j" or can be simplified using the
3884 * extra equalities to a purely affine expression.
3885 * If these tests succeed, then we try to coalesce the two basic maps
3886 * by introducing extra dimensions in "j" corresponding to
3887 * the extra integer divisions "i" fixed to the corresponding
3888 * purely affine expression.
3890 static enum isl_change
check_coalesce_into_eq(int i
, int j
,
3891 struct isl_coalesce_info
*info
)
3893 isl_size n_div_i
, n_div_j
, n
;
3894 isl_basic_map
*hull_i
, *hull_j
;
3895 isl_bool equal
, empty
;
3897 enum isl_change change
;
3899 n_div_i
= isl_basic_map_dim(info
[i
].bmap
, isl_dim_div
);
3900 n_div_j
= isl_basic_map_dim(info
[j
].bmap
, isl_dim_div
);
3901 if (n_div_i
< 0 || n_div_j
< 0)
3902 return isl_change_error
;
3903 if (n_div_i
<= n_div_j
)
3904 return isl_change_none
;
3905 if (info
[j
].bmap
->n_eq
== 0)
3906 return isl_change_none
;
3908 hull_i
= isl_basic_map_copy(info
[i
].bmap
);
3909 hull_i
= isl_basic_map_plain_affine_hull(hull_i
);
3910 hull_j
= isl_basic_map_copy(info
[j
].bmap
);
3911 hull_j
= isl_basic_map_plain_affine_hull(hull_j
);
3913 hull_j
= isl_basic_map_intersect(hull_j
, isl_basic_map_copy(hull_i
));
3914 equal
= isl_basic_map_plain_is_equal(hull_i
, hull_j
);
3915 empty
= isl_basic_map_plain_is_empty(hull_j
);
3916 isl_basic_map_free(hull_i
);
3918 if (equal
< 0 || empty
< 0)
3920 if (equal
|| empty
) {
3921 isl_basic_map_free(hull_j
);
3922 return isl_change_none
;
3925 list
= set_up_substitutions(info
[i
].bmap
, info
[j
].bmap
, hull_j
);
3927 return isl_change_error
;
3928 n
= isl_aff_list_n_aff(list
);
3930 change
= isl_change_error
;
3931 else if (n
< n_div_i
)
3932 change
= isl_change_none
;
3934 change
= coalesce_with_subs(i
, j
, info
, list
);
3936 isl_aff_list_free(list
);
3940 isl_basic_map_free(hull_j
);
3941 return isl_change_error
;
3944 /* Check if we can coalesce basic maps "i" and "j" after copying
3945 * those extra integer divisions in one of the basic maps that can
3946 * be simplified away using the extra equalities in the other basic map.
3947 * We require all divs to be known in both basic maps.
3948 * Furthermore, to simplify the comparison of div expressions,
3949 * we do not allow any nested integer divisions.
3951 static enum isl_change
check_coalesce_eq(int i
, int j
,
3952 struct isl_coalesce_info
*info
)
3954 isl_bool known
, nested
;
3955 enum isl_change change
;
3957 known
= isl_basic_map_divs_known(info
[i
].bmap
);
3958 if (known
< 0 || !known
)
3959 return known
< 0 ? isl_change_error
: isl_change_none
;
3960 known
= isl_basic_map_divs_known(info
[j
].bmap
);
3961 if (known
< 0 || !known
)
3962 return known
< 0 ? isl_change_error
: isl_change_none
;
3963 nested
= has_nested_div(info
[i
].bmap
);
3964 if (nested
< 0 || nested
)
3965 return nested
< 0 ? isl_change_error
: isl_change_none
;
3966 nested
= has_nested_div(info
[j
].bmap
);
3967 if (nested
< 0 || nested
)
3968 return nested
< 0 ? isl_change_error
: isl_change_none
;
3970 change
= check_coalesce_into_eq(i
, j
, info
);
3971 if (change
!= isl_change_none
)
3973 change
= check_coalesce_into_eq(j
, i
, info
);
3974 if (change
!= isl_change_none
)
3975 return invert_change(change
);
3977 return isl_change_none
;
3980 /* Check if the union of the given pair of basic maps
3981 * can be represented by a single basic map.
3982 * If so, replace the pair by the single basic map and return
3983 * isl_change_drop_first, isl_change_drop_second or isl_change_fuse.
3984 * Otherwise, return isl_change_none.
3986 * We first check if the two basic maps live in the same local space,
3987 * after aligning the divs that differ by only an integer constant.
3988 * If so, we do the complete check. Otherwise, we check if they have
3989 * the same number of integer divisions and can be coalesced, if one is
3990 * an obvious subset of the other or if the extra integer divisions
3991 * of one basic map can be simplified away using the extra equalities
3992 * of the other basic map.
3994 * Note that trying to coalesce pairs of disjuncts with the same
3995 * number, but different local variables may drop the explicit
3996 * representation of some of these local variables.
3997 * This operation is therefore not performed when
3998 * the "coalesce_preserve_locals" option is set.
4000 static enum isl_change
coalesce_pair(int i
, int j
,
4001 struct isl_coalesce_info
*info
)
4005 enum isl_change change
;
4008 if (harmonize_divs(&info
[i
], &info
[j
]) < 0)
4009 return isl_change_error
;
4010 same
= same_divs(info
[i
].bmap
, info
[j
].bmap
);
4012 return isl_change_error
;
4014 return coalesce_local_pair(i
, j
, info
);
4016 ctx
= isl_basic_map_get_ctx(info
[i
].bmap
);
4017 preserve
= isl_options_get_coalesce_preserve_locals(ctx
);
4018 if (!preserve
&& info
[i
].bmap
->n_div
== info
[j
].bmap
->n_div
) {
4019 change
= coalesce_local_pair(i
, j
, info
);
4020 if (change
!= isl_change_none
)
4024 change
= coalesce_divs(i
, j
, info
);
4025 if (change
!= isl_change_none
)
4028 return check_coalesce_eq(i
, j
, info
);
4031 /* Return the maximum of "a" and "b".
4033 static int isl_max(int a
, int b
)
4035 return a
> b
? a
: b
;
4038 /* Pairwise coalesce the basic maps in the range [start1, end1[ of "info"
4039 * with those in the range [start2, end2[, skipping basic maps
4040 * that have been removed (either before or within this function).
4042 * For each basic map i in the first range, we check if it can be coalesced
4043 * with respect to any previously considered basic map j in the second range.
4044 * If i gets dropped (because it was a subset of some j), then
4045 * we can move on to the next basic map.
4046 * If j gets dropped, we need to continue checking against the other
4047 * previously considered basic maps.
4048 * If the two basic maps got fused, then we recheck the fused basic map
4049 * against the previously considered basic maps, starting at i + 1
4050 * (even if start2 is greater than i + 1).
4052 static int coalesce_range(isl_ctx
*ctx
, struct isl_coalesce_info
*info
,
4053 int start1
, int end1
, int start2
, int end2
)
4057 for (i
= end1
- 1; i
>= start1
; --i
) {
4058 if (info
[i
].removed
)
4060 for (j
= isl_max(i
+ 1, start2
); j
< end2
; ++j
) {
4061 enum isl_change changed
;
4063 if (info
[j
].removed
)
4065 if (info
[i
].removed
)
4066 isl_die(ctx
, isl_error_internal
,
4067 "basic map unexpectedly removed",
4069 changed
= coalesce_pair(i
, j
, info
);
4071 case isl_change_error
:
4073 case isl_change_none
:
4074 case isl_change_drop_second
:
4076 case isl_change_drop_first
:
4079 case isl_change_fuse
:
4089 /* Pairwise coalesce the basic maps described by the "n" elements of "info".
4091 * We consider groups of basic maps that live in the same apparent
4092 * affine hull and we first coalesce within such a group before we
4093 * coalesce the elements in the group with elements of previously
4094 * considered groups. If a fuse happens during the second phase,
4095 * then we also reconsider the elements within the group.
4097 static int coalesce(isl_ctx
*ctx
, int n
, struct isl_coalesce_info
*info
)
4101 for (end
= n
; end
> 0; end
= start
) {
4103 while (start
>= 1 &&
4104 info
[start
- 1].hull_hash
== info
[start
].hull_hash
)
4106 if (coalesce_range(ctx
, info
, start
, end
, start
, end
) < 0)
4108 if (coalesce_range(ctx
, info
, start
, end
, end
, n
) < 0)
4115 /* Update the basic maps in "map" based on the information in "info".
4116 * In particular, remove the basic maps that have been marked removed and
4117 * update the others based on the information in the corresponding tableau.
4118 * Since we detected implicit equalities without calling
4119 * isl_basic_map_gauss, we need to do it now.
4120 * Also call isl_basic_map_simplify if we may have lost the definition
4121 * of one or more integer divisions.
4122 * If a basic map is still equal to the one from which the corresponding "info"
4123 * entry was created, then redundant constraint and
4124 * implicit equality constraint detection have been performed
4125 * on the corresponding tableau and the basic map can be marked as such.
4127 static __isl_give isl_map
*update_basic_maps(__isl_take isl_map
*map
,
4128 int n
, struct isl_coalesce_info
*info
)
4135 for (i
= n
- 1; i
>= 0; --i
) {
4136 if (info
[i
].removed
) {
4137 isl_basic_map_free(map
->p
[i
]);
4138 if (i
!= map
->n
- 1)
4139 map
->p
[i
] = map
->p
[map
->n
- 1];
4144 info
[i
].bmap
= isl_basic_map_update_from_tab(info
[i
].bmap
,
4146 info
[i
].bmap
= isl_basic_map_gauss(info
[i
].bmap
, NULL
);
4147 if (info
[i
].simplify
)
4148 info
[i
].bmap
= isl_basic_map_simplify(info
[i
].bmap
);
4149 info
[i
].bmap
= isl_basic_map_finalize(info
[i
].bmap
);
4151 return isl_map_free(map
);
4152 if (!info
[i
].modified
) {
4153 ISL_F_SET(info
[i
].bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
4154 ISL_F_SET(info
[i
].bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
4156 isl_basic_map_free(map
->p
[i
]);
4157 map
->p
[i
] = info
[i
].bmap
;
4158 info
[i
].bmap
= NULL
;
4164 /* For each pair of basic maps in the map, check if the union of the two
4165 * can be represented by a single basic map.
4166 * If so, replace the pair by the single basic map and start over.
4168 * We factor out any (hidden) common factor from the constraint
4169 * coefficients to improve the detection of adjacent constraints.
4170 * Note that this function does not call isl_basic_map_gauss,
4171 * but it does make sure that only a single copy of the basic map
4172 * is affected. This means that isl_basic_map_gauss may have
4173 * to be called at the end of the computation (in update_basic_maps)
4174 * on this single copy to ensure that
4175 * the basic maps are not left in an unexpected state.
4177 * Since we are constructing the tableaus of the basic maps anyway,
4178 * we exploit them to detect implicit equalities and redundant constraints.
4179 * This also helps the coalescing as it can ignore the redundant constraints.
4180 * In order to avoid confusion, we make all implicit equalities explicit
4181 * in the basic maps. If the basic map only has a single reference
4182 * (this happens in particular if it was modified by
4183 * isl_basic_map_reduce_coefficients), then isl_basic_map_gauss
4184 * does not get called on the result. The call to
4185 * isl_basic_map_gauss in update_basic_maps resolves this as well.
4186 * For each basic map, we also compute the hash of the apparent affine hull
4187 * for use in coalesce.
4189 __isl_give isl_map
*isl_map_coalesce(__isl_take isl_map
*map
)
4194 struct isl_coalesce_info
*info
= NULL
;
4196 map
= isl_map_remove_empty_parts(map
);
4203 ctx
= isl_map_get_ctx(map
);
4204 map
= isl_map_sort_divs(map
);
4205 map
= isl_map_cow(map
);
4212 info
= isl_calloc_array(map
->ctx
, struct isl_coalesce_info
, n
);
4216 for (i
= 0; i
< map
->n
; ++i
) {
4217 map
->p
[i
] = isl_basic_map_reduce_coefficients(map
->p
[i
]);
4220 info
[i
].bmap
= isl_basic_map_copy(map
->p
[i
]);
4221 info
[i
].tab
= isl_tab_from_basic_map(info
[i
].bmap
, 0);
4224 if (!ISL_F_ISSET(info
[i
].bmap
, ISL_BASIC_MAP_NO_IMPLICIT
))
4225 if (isl_tab_detect_implicit_equalities(info
[i
].tab
) < 0)
4227 info
[i
].bmap
= isl_tab_make_equalities_explicit(info
[i
].tab
,
4231 if (!ISL_F_ISSET(info
[i
].bmap
, ISL_BASIC_MAP_NO_REDUNDANT
))
4232 if (isl_tab_detect_redundant(info
[i
].tab
) < 0)
4234 if (coalesce_info_set_hull_hash(&info
[i
]) < 0)
4237 for (i
= map
->n
- 1; i
>= 0; --i
)
4238 if (info
[i
].tab
->empty
)
4241 if (coalesce(ctx
, n
, info
) < 0)
4244 map
= update_basic_maps(map
, n
, info
);
4246 clear_coalesce_info(n
, info
);
4250 clear_coalesce_info(n
, info
);
4255 /* For each pair of basic sets in the set, check if the union of the two
4256 * can be represented by a single basic set.
4257 * If so, replace the pair by the single basic set and start over.
4259 __isl_give isl_set
*isl_set_coalesce(__isl_take isl_set
*set
)
4261 return set_from_map(isl_map_coalesce(set_to_map(set
)));