2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2014 Ecole Normale Superieure
5 * Copyright 2014 INRIA Rocquencourt
6 * Copyright 2016 INRIA Paris
7 * Copyright 2016 Sven Verdoolaege
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
23 #include <isl_ctx_private.h>
24 #include <isl_map_private.h>
26 #include <isl/constraint.h>
27 #include "isl_space_private.h"
28 #include "isl_equalities.h"
29 #include <isl_lp_private.h>
33 #include <isl_reordering.h>
34 #include "isl_sample.h"
38 #include <isl_mat_private.h>
39 #include <isl_vec_private.h>
40 #include <isl_dim_map.h>
41 #include <isl_local_space_private.h>
42 #include <isl_aff_private.h>
43 #include <isl_options_private.h>
44 #include <isl_morph.h>
45 #include <isl_val_private.h>
46 #include <isl/deprecated/map_int.h>
47 #include <isl/deprecated/set_int.h>
49 #include <bset_to_bmap.c>
50 #include <bset_from_bmap.c>
51 #include <set_to_map.c>
52 #include <set_from_map.c>
54 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
57 case isl_dim_param
: return dim
->nparam
;
58 case isl_dim_in
: return dim
->n_in
;
59 case isl_dim_out
: return dim
->n_out
;
60 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
65 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
68 case isl_dim_param
: return 1;
69 case isl_dim_in
: return 1 + dim
->nparam
;
70 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
75 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
76 enum isl_dim_type type
)
81 case isl_dim_cst
: return 1;
84 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
85 case isl_dim_div
: return bmap
->n_div
;
86 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
91 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
93 return map
? n(map
->dim
, type
) : 0;
96 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
98 return set
? n(set
->dim
, type
) : 0;
101 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
102 enum isl_dim_type type
)
111 case isl_dim_cst
: return 0;
112 case isl_dim_param
: return 1;
113 case isl_dim_in
: return 1 + space
->nparam
;
114 case isl_dim_out
: return 1 + space
->nparam
+ space
->n_in
;
115 case isl_dim_div
: return 1 + space
->nparam
+ space
->n_in
+
121 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
122 enum isl_dim_type type
)
124 return isl_basic_map_offset(bset
, type
);
127 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
129 return pos(map
->dim
, type
);
132 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
133 enum isl_dim_type type
)
135 return isl_basic_map_dim(bset
, type
);
138 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
140 return isl_basic_set_dim(bset
, isl_dim_set
);
143 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
145 return isl_basic_set_dim(bset
, isl_dim_param
);
148 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
152 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
155 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
157 return isl_set_dim(set
, isl_dim_set
);
160 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
162 return isl_set_dim(set
, isl_dim_param
);
165 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
167 return bmap
? bmap
->dim
->n_in
: 0;
170 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
172 return bmap
? bmap
->dim
->n_out
: 0;
175 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
177 return bmap
? bmap
->dim
->nparam
: 0;
180 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
182 return bmap
? bmap
->n_div
: 0;
185 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
187 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
190 unsigned isl_map_n_in(const struct isl_map
*map
)
192 return map
? map
->dim
->n_in
: 0;
195 unsigned isl_map_n_out(const struct isl_map
*map
)
197 return map
? map
->dim
->n_out
: 0;
200 unsigned isl_map_n_param(const struct isl_map
*map
)
202 return map
? map
->dim
->nparam
: 0;
205 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
210 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
213 return isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
214 set
->dim
, isl_dim_set
);
217 isl_bool
isl_basic_map_compatible_domain(__isl_keep isl_basic_map
*bmap
,
218 __isl_keep isl_basic_set
*bset
)
222 return isl_bool_error
;
223 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
226 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
227 bset
->dim
, isl_dim_set
);
230 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
235 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
238 return isl_space_tuple_is_equal(map
->dim
, isl_dim_out
,
239 set
->dim
, isl_dim_set
);
242 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
243 struct isl_basic_set
*bset
)
248 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
251 return isl_space_tuple_is_equal(bmap
->dim
, isl_dim_out
,
252 bset
->dim
, isl_dim_set
);
255 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
257 return bmap
? bmap
->ctx
: NULL
;
260 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
262 return bset
? bset
->ctx
: NULL
;
265 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
267 return map
? map
->ctx
: NULL
;
270 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
272 return set
? set
->ctx
: NULL
;
275 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
279 return isl_space_copy(bmap
->dim
);
282 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
286 return isl_space_copy(bset
->dim
);
289 /* Extract the divs in "bmap" as a matrix.
291 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
302 ctx
= isl_basic_map_get_ctx(bmap
);
303 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
304 cols
= 1 + 1 + total
+ bmap
->n_div
;
305 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
309 for (i
= 0; i
< bmap
->n_div
; ++i
)
310 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
315 /* Extract the divs in "bset" as a matrix.
317 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
319 return isl_basic_map_get_divs(bset
);
322 __isl_give isl_local_space
*isl_basic_map_get_local_space(
323 __isl_keep isl_basic_map
*bmap
)
330 div
= isl_basic_map_get_divs(bmap
);
331 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
334 __isl_give isl_local_space
*isl_basic_set_get_local_space(
335 __isl_keep isl_basic_set
*bset
)
337 return isl_basic_map_get_local_space(bset
);
340 /* For each known div d = floor(f/m), add the constraints
343 * -(f-(m-1)) + m d >= 0
345 * Do not finalize the result.
347 static __isl_give isl_basic_map
*add_known_div_constraints(
348 __isl_take isl_basic_map
*bmap
)
355 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
358 bmap
= isl_basic_map_cow(bmap
);
359 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 2 * n_div
);
362 for (i
= 0; i
< n_div
; ++i
) {
363 if (isl_int_is_zero(bmap
->div
[i
][0]))
365 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
366 return isl_basic_map_free(bmap
);
372 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
373 __isl_take isl_local_space
*ls
)
382 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
383 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
384 n_div
, 0, 2 * n_div
);
386 for (i
= 0; i
< n_div
; ++i
)
387 if (isl_basic_map_alloc_div(bmap
) < 0)
390 for (i
= 0; i
< n_div
; ++i
)
391 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
392 bmap
= add_known_div_constraints(bmap
);
394 isl_local_space_free(ls
);
397 isl_local_space_free(ls
);
398 isl_basic_map_free(bmap
);
402 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
403 __isl_take isl_local_space
*ls
)
405 return isl_basic_map_from_local_space(ls
);
408 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
412 return isl_space_copy(map
->dim
);
415 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
419 return isl_space_copy(set
->dim
);
422 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
423 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
425 bmap
= isl_basic_map_cow(bmap
);
428 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
431 bmap
= isl_basic_map_finalize(bmap
);
434 isl_basic_map_free(bmap
);
438 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
439 __isl_take isl_basic_set
*bset
, const char *s
)
441 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
444 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
445 enum isl_dim_type type
)
447 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
450 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
451 enum isl_dim_type type
, const char *s
)
455 map
= isl_map_cow(map
);
459 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
463 for (i
= 0; i
< map
->n
; ++i
) {
464 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
475 /* Replace the identifier of the tuple of type "type" by "id".
477 __isl_give isl_basic_map
*isl_basic_map_set_tuple_id(
478 __isl_take isl_basic_map
*bmap
,
479 enum isl_dim_type type
, __isl_take isl_id
*id
)
481 bmap
= isl_basic_map_cow(bmap
);
484 bmap
->dim
= isl_space_set_tuple_id(bmap
->dim
, type
, id
);
486 return isl_basic_map_free(bmap
);
487 bmap
= isl_basic_map_finalize(bmap
);
494 /* Replace the identifier of the tuple by "id".
496 __isl_give isl_basic_set
*isl_basic_set_set_tuple_id(
497 __isl_take isl_basic_set
*bset
, __isl_take isl_id
*id
)
499 return isl_basic_map_set_tuple_id(bset
, isl_dim_set
, id
);
502 /* Does the input or output tuple have a name?
504 isl_bool
isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
506 return map
? isl_space_has_tuple_name(map
->dim
, type
) : isl_bool_error
;
509 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
510 enum isl_dim_type type
)
512 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
515 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
518 return set_from_map(isl_map_set_tuple_name(set_to_map(set
),
522 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
523 enum isl_dim_type type
, __isl_take isl_id
*id
)
525 map
= isl_map_cow(map
);
529 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
531 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
537 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
538 __isl_take isl_id
*id
)
540 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
543 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
544 enum isl_dim_type type
)
546 map
= isl_map_cow(map
);
550 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
552 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
555 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
557 return isl_map_reset_tuple_id(set
, isl_dim_set
);
560 isl_bool
isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
562 return map
? isl_space_has_tuple_id(map
->dim
, type
) : isl_bool_error
;
565 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
566 enum isl_dim_type type
)
568 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
571 isl_bool
isl_set_has_tuple_id(__isl_keep isl_set
*set
)
573 return isl_map_has_tuple_id(set
, isl_dim_set
);
576 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
578 return isl_map_get_tuple_id(set
, isl_dim_set
);
581 /* Does the set tuple have a name?
583 isl_bool
isl_set_has_tuple_name(__isl_keep isl_set
*set
)
586 return isl_bool_error
;
587 return isl_space_has_tuple_name(set
->dim
, isl_dim_set
);
591 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
593 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
596 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
598 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
601 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
602 enum isl_dim_type type
, unsigned pos
)
604 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
607 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
608 enum isl_dim_type type
, unsigned pos
)
610 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
613 /* Does the given dimension have a name?
615 isl_bool
isl_map_has_dim_name(__isl_keep isl_map
*map
,
616 enum isl_dim_type type
, unsigned pos
)
619 return isl_bool_error
;
620 return isl_space_has_dim_name(map
->dim
, type
, pos
);
623 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
624 enum isl_dim_type type
, unsigned pos
)
626 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
629 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
630 enum isl_dim_type type
, unsigned pos
)
632 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
635 /* Does the given dimension have a name?
637 isl_bool
isl_set_has_dim_name(__isl_keep isl_set
*set
,
638 enum isl_dim_type type
, unsigned pos
)
641 return isl_bool_error
;
642 return isl_space_has_dim_name(set
->dim
, type
, pos
);
645 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
646 __isl_take isl_basic_map
*bmap
,
647 enum isl_dim_type type
, unsigned pos
, const char *s
)
649 bmap
= isl_basic_map_cow(bmap
);
652 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
655 return isl_basic_map_finalize(bmap
);
657 isl_basic_map_free(bmap
);
661 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
662 enum isl_dim_type type
, unsigned pos
, const char *s
)
666 map
= isl_map_cow(map
);
670 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
674 for (i
= 0; i
< map
->n
; ++i
) {
675 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
686 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
687 __isl_take isl_basic_set
*bset
,
688 enum isl_dim_type type
, unsigned pos
, const char *s
)
690 return bset_from_bmap(isl_basic_map_set_dim_name(bset_to_bmap(bset
),
694 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
695 enum isl_dim_type type
, unsigned pos
, const char *s
)
697 return set_from_map(isl_map_set_dim_name(set_to_map(set
),
701 isl_bool
isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
702 enum isl_dim_type type
, unsigned pos
)
705 return isl_bool_error
;
706 return isl_space_has_dim_id(bmap
->dim
, type
, pos
);
709 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
710 enum isl_dim_type type
, unsigned pos
)
712 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
715 isl_bool
isl_map_has_dim_id(__isl_keep isl_map
*map
,
716 enum isl_dim_type type
, unsigned pos
)
718 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : isl_bool_error
;
721 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
722 enum isl_dim_type type
, unsigned pos
)
724 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
727 isl_bool
isl_set_has_dim_id(__isl_keep isl_set
*set
,
728 enum isl_dim_type type
, unsigned pos
)
730 return isl_map_has_dim_id(set
, type
, pos
);
733 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
734 enum isl_dim_type type
, unsigned pos
)
736 return isl_map_get_dim_id(set
, type
, pos
);
739 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
740 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
742 map
= isl_map_cow(map
);
746 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
748 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
754 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
755 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
757 return isl_map_set_dim_id(set
, type
, pos
, id
);
760 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
761 __isl_keep isl_id
*id
)
765 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
768 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
769 __isl_keep isl_id
*id
)
771 return isl_map_find_dim_by_id(set
, type
, id
);
774 /* Return the position of the dimension of the given type and name
776 * Return -1 if no such dimension can be found.
778 int isl_basic_map_find_dim_by_name(__isl_keep isl_basic_map
*bmap
,
779 enum isl_dim_type type
, const char *name
)
783 return isl_space_find_dim_by_name(bmap
->dim
, type
, name
);
786 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
791 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
794 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
797 return isl_map_find_dim_by_name(set
, type
, name
);
800 /* Reset the user pointer on all identifiers of parameters and tuples
801 * of the space of "map".
803 __isl_give isl_map
*isl_map_reset_user(__isl_take isl_map
*map
)
807 space
= isl_map_get_space(map
);
808 space
= isl_space_reset_user(space
);
809 map
= isl_map_reset_space(map
, space
);
814 /* Reset the user pointer on all identifiers of parameters and tuples
815 * of the space of "set".
817 __isl_give isl_set
*isl_set_reset_user(__isl_take isl_set
*set
)
819 return isl_map_reset_user(set
);
822 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
826 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
829 /* Has "map" been marked as a rational map?
830 * In particular, have all basic maps in "map" been marked this way?
831 * An empty map is not considered to be rational.
832 * Maps where only some of the basic maps are marked rational
835 isl_bool
isl_map_is_rational(__isl_keep isl_map
*map
)
841 return isl_bool_error
;
843 return isl_bool_false
;
844 rational
= isl_basic_map_is_rational(map
->p
[0]);
847 for (i
= 1; i
< map
->n
; ++i
) {
850 rational_i
= isl_basic_map_is_rational(map
->p
[i
]);
853 if (rational
!= rational_i
)
854 isl_die(isl_map_get_ctx(map
), isl_error_unsupported
,
855 "mixed rational and integer basic maps "
856 "not supported", return isl_bool_error
);
862 /* Has "set" been marked as a rational set?
863 * In particular, have all basic set in "set" been marked this way?
864 * An empty set is not considered to be rational.
865 * Sets where only some of the basic sets are marked rational
868 isl_bool
isl_set_is_rational(__isl_keep isl_set
*set
)
870 return isl_map_is_rational(set
);
873 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
875 return isl_basic_map_is_rational(bset
);
878 /* Does "bmap" contain any rational points?
880 * If "bmap" has an equality for each dimension, equating the dimension
881 * to an integer constant, then it has no rational points, even if it
882 * is marked as rational.
884 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
886 int has_rational
= 1;
891 if (isl_basic_map_plain_is_empty(bmap
))
893 if (!isl_basic_map_is_rational(bmap
))
895 bmap
= isl_basic_map_copy(bmap
);
896 bmap
= isl_basic_map_implicit_equalities(bmap
);
899 total
= isl_basic_map_total_dim(bmap
);
900 if (bmap
->n_eq
== total
) {
902 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
903 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
906 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
907 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
909 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
917 isl_basic_map_free(bmap
);
922 /* Does "map" contain any rational points?
924 int isl_map_has_rational(__isl_keep isl_map
*map
)
931 for (i
= 0; i
< map
->n
; ++i
) {
932 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
933 if (has_rational
< 0)
941 /* Does "set" contain any rational points?
943 int isl_set_has_rational(__isl_keep isl_set
*set
)
945 return isl_map_has_rational(set
);
948 /* Is this basic set a parameter domain?
950 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
954 return isl_space_is_params(bset
->dim
);
957 /* Is this set a parameter domain?
959 isl_bool
isl_set_is_params(__isl_keep isl_set
*set
)
962 return isl_bool_error
;
963 return isl_space_is_params(set
->dim
);
966 /* Is this map actually a parameter domain?
967 * Users should never call this function. Outside of isl,
968 * a map can never be a parameter domain.
970 int isl_map_is_params(__isl_keep isl_map
*map
)
974 return isl_space_is_params(map
->dim
);
977 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
978 struct isl_basic_map
*bmap
, unsigned extra
,
979 unsigned n_eq
, unsigned n_ineq
)
982 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
987 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
988 if (isl_blk_is_error(bmap
->block
))
991 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
992 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
996 bmap
->block2
= isl_blk_empty();
999 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
1000 if (isl_blk_is_error(bmap
->block2
))
1003 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
1008 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
1009 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
1011 for (i
= 0; i
< extra
; ++i
)
1012 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
1016 bmap
->c_size
= n_eq
+ n_ineq
;
1017 bmap
->eq
= bmap
->ineq
+ n_ineq
;
1018 bmap
->extra
= extra
;
1022 bmap
->sample
= NULL
;
1026 isl_basic_map_free(bmap
);
1030 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
1031 unsigned nparam
, unsigned dim
, unsigned extra
,
1032 unsigned n_eq
, unsigned n_ineq
)
1034 struct isl_basic_map
*bmap
;
1037 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
1041 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
1042 return bset_from_bmap(bmap
);
1045 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
1046 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1048 struct isl_basic_map
*bmap
;
1051 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
1052 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1053 return bset_from_bmap(bmap
);
1055 isl_space_free(dim
);
1059 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
1060 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
1062 struct isl_basic_map
*bmap
;
1066 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
1071 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
1073 isl_space_free(dim
);
1077 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
1078 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
1079 unsigned n_eq
, unsigned n_ineq
)
1081 struct isl_basic_map
*bmap
;
1084 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
1088 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1092 static void dup_constraints(
1093 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
1096 unsigned total
= isl_basic_map_total_dim(src
);
1098 for (i
= 0; i
< src
->n_eq
; ++i
) {
1099 int j
= isl_basic_map_alloc_equality(dst
);
1100 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
1103 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1104 int j
= isl_basic_map_alloc_inequality(dst
);
1105 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
1108 for (i
= 0; i
< src
->n_div
; ++i
) {
1109 int j
= isl_basic_map_alloc_div(dst
);
1110 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
1112 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
1115 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
1117 struct isl_basic_map
*dup
;
1121 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
1122 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
1125 dup_constraints(dup
, bmap
);
1126 dup
->flags
= bmap
->flags
;
1127 dup
->sample
= isl_vec_copy(bmap
->sample
);
1131 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
1133 struct isl_basic_map
*dup
;
1135 dup
= isl_basic_map_dup(bset_to_bmap(bset
));
1136 return bset_from_bmap(dup
);
1139 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
1144 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
1148 return isl_basic_set_dup(bset
);
1151 struct isl_set
*isl_set_copy(struct isl_set
*set
)
1160 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
1165 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
1169 bmap
= isl_basic_map_dup(bmap
);
1171 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
1175 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1184 __isl_null isl_basic_map
*isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1189 if (--bmap
->ref
> 0)
1192 isl_ctx_deref(bmap
->ctx
);
1194 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1196 isl_blk_free(bmap
->ctx
, bmap
->block
);
1197 isl_vec_free(bmap
->sample
);
1198 isl_space_free(bmap
->dim
);
1204 __isl_null isl_basic_set
*isl_basic_set_free(__isl_take isl_basic_set
*bset
)
1206 return isl_basic_map_free(bset_to_bmap(bset
));
1209 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1211 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1214 __isl_give isl_map
*isl_map_align_params_map_map_and(
1215 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1216 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1217 __isl_take isl_map
*map2
))
1221 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1222 return fn(map1
, map2
);
1223 if (!isl_space_has_named_params(map1
->dim
) ||
1224 !isl_space_has_named_params(map2
->dim
))
1225 isl_die(map1
->ctx
, isl_error_invalid
,
1226 "unaligned unnamed parameters", goto error
);
1227 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1228 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1229 return fn(map1
, map2
);
1236 isl_bool
isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1237 __isl_keep isl_map
*map2
,
1238 isl_bool (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1243 return isl_bool_error
;
1244 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1245 return fn(map1
, map2
);
1246 if (!isl_space_has_named_params(map1
->dim
) ||
1247 !isl_space_has_named_params(map2
->dim
))
1248 isl_die(map1
->ctx
, isl_error_invalid
,
1249 "unaligned unnamed parameters", return isl_bool_error
);
1250 map1
= isl_map_copy(map1
);
1251 map2
= isl_map_copy(map2
);
1252 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1253 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1260 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1262 struct isl_ctx
*ctx
;
1266 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1267 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1269 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1270 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1271 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1272 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1273 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1274 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1276 int j
= isl_basic_map_alloc_inequality(bmap
);
1280 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1281 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1288 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1289 bmap
->extra
- bmap
->n_div
);
1290 return bmap
->n_eq
++;
1293 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1295 return isl_basic_map_alloc_equality(bset_to_bmap(bset
));
1298 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1302 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1307 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1309 return isl_basic_map_free_equality(bset_to_bmap(bset
), n
);
1312 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1317 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1319 if (pos
!= bmap
->n_eq
- 1) {
1321 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1322 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1328 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1330 return isl_basic_map_drop_equality(bset_to_bmap(bset
), pos
);
1333 /* Turn inequality "pos" of "bmap" into an equality.
1335 * In particular, we move the inequality in front of the equalities
1336 * and move the last inequality in the position of the moved inequality.
1337 * Note that isl_tab_make_equalities_explicit depends on this particular
1338 * change in the ordering of the constraints.
1340 void isl_basic_map_inequality_to_equality(
1341 struct isl_basic_map
*bmap
, unsigned pos
)
1345 t
= bmap
->ineq
[pos
];
1346 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1347 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1352 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1353 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1354 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1355 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1358 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1360 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1363 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1365 struct isl_ctx
*ctx
;
1369 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1370 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1371 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1372 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1373 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1374 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1375 1 + isl_basic_map_total_dim(bmap
),
1376 bmap
->extra
- bmap
->n_div
);
1377 return bmap
->n_ineq
++;
1380 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1382 return isl_basic_map_alloc_inequality(bset_to_bmap(bset
));
1385 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1389 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1394 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1396 return isl_basic_map_free_inequality(bset_to_bmap(bset
), n
);
1399 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1404 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1406 if (pos
!= bmap
->n_ineq
- 1) {
1407 t
= bmap
->ineq
[pos
];
1408 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1409 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1410 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1416 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1418 return isl_basic_map_drop_inequality(bset_to_bmap(bset
), pos
);
1421 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1426 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1429 k
= isl_basic_map_alloc_equality(bmap
);
1432 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1435 isl_basic_map_free(bmap
);
1439 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1442 return bset_from_bmap(isl_basic_map_add_eq(bset_to_bmap(bset
), eq
));
1445 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1450 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1453 k
= isl_basic_map_alloc_inequality(bmap
);
1456 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1459 isl_basic_map_free(bmap
);
1463 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1466 return bset_from_bmap(isl_basic_map_add_ineq(bset_to_bmap(bset
), ineq
));
1469 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1473 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1474 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1475 1 + 1 + isl_basic_map_total_dim(bmap
),
1476 bmap
->extra
- bmap
->n_div
);
1477 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1478 return bmap
->n_div
++;
1481 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1483 return isl_basic_map_alloc_div(bset_to_bmap(bset
));
1486 /* Insert an extra integer division, prescribed by "div", to "bmap"
1487 * at (integer division) position "pos".
1489 * The integer division is first added at the end and then moved
1490 * into the right position.
1492 __isl_give isl_basic_map
*isl_basic_map_insert_div(
1493 __isl_take isl_basic_map
*bmap
, int pos
, __isl_keep isl_vec
*div
)
1497 bmap
= isl_basic_map_cow(bmap
);
1499 return isl_basic_map_free(bmap
);
1501 if (div
->size
!= 1 + 1 + isl_basic_map_dim(bmap
, isl_dim_all
))
1502 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1503 "unexpected size", return isl_basic_map_free(bmap
));
1504 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
1505 if (pos
< 0 || pos
> n_div
)
1506 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
1507 "invalid position", return isl_basic_map_free(bmap
));
1509 bmap
= isl_basic_map_extend_space(bmap
,
1510 isl_basic_map_get_space(bmap
), 1, 0, 2);
1511 k
= isl_basic_map_alloc_div(bmap
);
1513 return isl_basic_map_free(bmap
);
1514 isl_seq_cpy(bmap
->div
[k
], div
->el
, div
->size
);
1515 isl_int_set_si(bmap
->div
[k
][div
->size
], 0);
1517 for (i
= k
; i
> pos
; --i
)
1518 isl_basic_map_swap_div(bmap
, i
, i
- 1);
1523 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1527 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1532 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1534 return isl_basic_map_free_div(bset_to_bmap(bset
), n
);
1537 /* Copy constraint from src to dst, putting the vars of src at offset
1538 * dim_off in dst and the divs of src at offset div_off in dst.
1539 * If both sets are actually map, then dim_off applies to the input
1542 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1543 struct isl_basic_map
*src_map
, isl_int
*src
,
1544 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1546 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1547 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1548 unsigned src_in
= isl_basic_map_n_in(src_map
);
1549 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1550 unsigned src_out
= isl_basic_map_n_out(src_map
);
1551 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1552 isl_int_set(dst
[0], src
[0]);
1553 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1554 if (dst_nparam
> src_nparam
)
1555 isl_seq_clr(dst
+1+src_nparam
,
1556 dst_nparam
- src_nparam
);
1557 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1558 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1560 isl_min(dst_in
-in_off
, src_in
));
1561 if (dst_in
-in_off
> src_in
)
1562 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1563 dst_in
- in_off
- src_in
);
1564 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1565 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1566 src
+1+src_nparam
+src_in
,
1567 isl_min(dst_out
-out_off
, src_out
));
1568 if (dst_out
-out_off
> src_out
)
1569 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1570 dst_out
- out_off
- src_out
);
1571 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1572 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1573 src
+1+src_nparam
+src_in
+src_out
,
1574 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1575 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1576 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1577 div_off
+src_map
->n_div
,
1578 dst_map
->n_div
- div_off
- src_map
->n_div
);
1581 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1582 struct isl_basic_map
*src_map
, isl_int
*src
,
1583 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1585 isl_int_set(dst
[0], src
[0]);
1586 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1589 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1590 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1595 if (!bmap1
|| !bmap2
)
1598 div_off
= bmap1
->n_div
;
1600 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1601 int i1
= isl_basic_map_alloc_equality(bmap1
);
1604 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1605 i_pos
, o_pos
, div_off
);
1608 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1609 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1612 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1613 i_pos
, o_pos
, div_off
);
1616 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1617 int i1
= isl_basic_map_alloc_div(bmap1
);
1620 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1621 i_pos
, o_pos
, div_off
);
1624 isl_basic_map_free(bmap2
);
1629 isl_basic_map_free(bmap1
);
1630 isl_basic_map_free(bmap2
);
1634 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1635 struct isl_basic_set
*bset2
, unsigned pos
)
1637 return bset_from_bmap(add_constraints(bset_to_bmap(bset1
),
1638 bset_to_bmap(bset2
), 0, pos
));
1641 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1642 __isl_take isl_space
*dim
, unsigned extra
,
1643 unsigned n_eq
, unsigned n_ineq
)
1645 struct isl_basic_map
*ext
;
1655 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1656 base
->extra
>= base
->n_div
+ extra
;
1658 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1659 room_for_ineq(base
, n_ineq
)) {
1660 isl_space_free(dim
);
1664 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1665 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1666 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1667 extra
+= base
->extra
;
1669 n_ineq
+= base
->n_ineq
;
1671 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1677 ext
->sample
= isl_vec_copy(base
->sample
);
1678 flags
= base
->flags
;
1679 ext
= add_constraints(ext
, base
, 0, 0);
1682 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1688 isl_space_free(dim
);
1689 isl_basic_map_free(base
);
1693 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1694 __isl_take isl_space
*dim
, unsigned extra
,
1695 unsigned n_eq
, unsigned n_ineq
)
1697 return bset_from_bmap(isl_basic_map_extend_space(bset_to_bmap(base
),
1698 dim
, extra
, n_eq
, n_ineq
));
1701 struct isl_basic_map
*isl_basic_map_extend_constraints(
1702 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1706 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1710 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1711 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1712 unsigned n_eq
, unsigned n_ineq
)
1714 struct isl_basic_map
*bmap
;
1719 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1723 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1726 isl_basic_map_free(base
);
1730 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1731 unsigned nparam
, unsigned dim
, unsigned extra
,
1732 unsigned n_eq
, unsigned n_ineq
)
1734 return bset_from_bmap(isl_basic_map_extend(bset_to_bmap(base
),
1735 nparam
, 0, dim
, extra
, n_eq
, n_ineq
));
1738 struct isl_basic_set
*isl_basic_set_extend_constraints(
1739 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1741 isl_basic_map
*bmap
= bset_to_bmap(base
);
1742 bmap
= isl_basic_map_extend_constraints(bmap
, n_eq
, n_ineq
);
1743 return bset_from_bmap(bmap
);
1746 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1748 return bset_from_bmap(isl_basic_map_cow(bset_to_bmap(bset
)));
1751 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1756 if (bmap
->ref
> 1) {
1758 bmap
= isl_basic_map_dup(bmap
);
1761 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1762 ISL_F_CLR(bmap
, ISL_BASIC_MAP_REDUCED_COEFFICIENTS
);
1767 /* Clear all cached information in "map", either because it is about
1768 * to be modified or because it is being freed.
1769 * Always return the same pointer that is passed in.
1770 * This is needed for the use in isl_map_free.
1772 static __isl_give isl_map
*clear_caches(__isl_take isl_map
*map
)
1774 isl_basic_map_free(map
->cached_simple_hull
[0]);
1775 isl_basic_map_free(map
->cached_simple_hull
[1]);
1776 map
->cached_simple_hull
[0] = NULL
;
1777 map
->cached_simple_hull
[1] = NULL
;
1781 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1783 return isl_map_cow(set
);
1786 /* Return an isl_map that is equal to "map" and that has only
1787 * a single reference.
1789 * If the original input already has only one reference, then
1790 * simply return it, but clear all cached information, since
1791 * it may be rendered invalid by the operations that will be
1792 * performed on the result.
1794 * Otherwise, create a duplicate (without any cached information).
1796 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1802 return clear_caches(map
);
1804 return isl_map_dup(map
);
1807 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1808 unsigned a_len
, unsigned b_len
)
1810 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1811 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1812 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1815 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1816 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1824 isl_assert(bmap
->ctx
,
1825 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1827 if (n1
== 0 || n2
== 0)
1830 bmap
= isl_basic_map_cow(bmap
);
1834 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1835 if (isl_blk_is_error(blk
))
1838 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1840 bmap
->eq
[i
] + pos
, n1
, n2
);
1842 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1844 bmap
->ineq
[i
] + pos
, n1
, n2
);
1846 for (i
= 0; i
< bmap
->n_div
; ++i
)
1848 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1850 isl_blk_free(bmap
->ctx
, blk
);
1852 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1853 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1854 return isl_basic_map_finalize(bmap
);
1856 isl_basic_map_free(bmap
);
1860 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1866 total
= isl_basic_map_total_dim(bmap
);
1867 if (isl_basic_map_free_div(bmap
, bmap
->n_div
) < 0)
1868 return isl_basic_map_free(bmap
);
1869 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1871 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1873 i
= isl_basic_map_alloc_equality(bmap
);
1877 isl_int_set_si(bmap
->eq
[i
][0], 1);
1878 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1879 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1880 isl_vec_free(bmap
->sample
);
1881 bmap
->sample
= NULL
;
1882 return isl_basic_map_finalize(bmap
);
1884 isl_basic_map_free(bmap
);
1888 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1890 return bset_from_bmap(isl_basic_map_set_to_empty(bset_to_bmap(bset
)));
1893 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1896 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1898 isl_int
*t
= bmap
->div
[a
];
1899 bmap
->div
[a
] = bmap
->div
[b
];
1903 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1904 * div definitions accordingly.
1906 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1909 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1911 swap_div(bmap
, a
, b
);
1913 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1914 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1916 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1917 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1919 for (i
= 0; i
< bmap
->n_div
; ++i
)
1920 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1921 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1924 /* Swap divs "a" and "b" in "bset" and adjust the constraints and
1925 * div definitions accordingly.
1927 void isl_basic_set_swap_div(__isl_keep isl_basic_set
*bset
, int a
, int b
)
1929 isl_basic_map_swap_div(bset
, a
, b
);
1932 /* Eliminate the specified n dimensions starting at first from the
1933 * constraints, without removing the dimensions from the space.
1934 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1936 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1937 enum isl_dim_type type
, unsigned first
, unsigned n
)
1946 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1947 isl_die(map
->ctx
, isl_error_invalid
,
1948 "index out of bounds", goto error
);
1950 map
= isl_map_cow(map
);
1954 for (i
= 0; i
< map
->n
; ++i
) {
1955 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1965 /* Eliminate the specified n dimensions starting at first from the
1966 * constraints, without removing the dimensions from the space.
1967 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1969 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1970 enum isl_dim_type type
, unsigned first
, unsigned n
)
1972 return set_from_map(isl_map_eliminate(set_to_map(set
), type
, first
, n
));
1975 /* Eliminate the specified n dimensions starting at first from the
1976 * constraints, without removing the dimensions from the space.
1977 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1979 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1980 unsigned first
, unsigned n
)
1982 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1985 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1986 __isl_take isl_basic_map
*bmap
)
1990 bmap
= isl_basic_map_eliminate_vars(bmap
,
1991 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1995 return isl_basic_map_finalize(bmap
);
1998 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1999 __isl_take isl_basic_set
*bset
)
2001 return bset_from_bmap(isl_basic_map_remove_divs(bset_to_bmap(bset
)));
2004 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
2013 map
= isl_map_cow(map
);
2017 for (i
= 0; i
< map
->n
; ++i
) {
2018 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
2028 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
2030 return isl_map_remove_divs(set
);
2033 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
2034 enum isl_dim_type type
, unsigned first
, unsigned n
)
2038 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2040 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
2042 bmap
= isl_basic_map_eliminate_vars(bmap
,
2043 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
2046 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
2048 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
2051 isl_basic_map_free(bmap
);
2055 /* Return true if the definition of the given div (recursively) involves
2056 * any of the given variables.
2058 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
2059 unsigned first
, unsigned n
)
2062 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2064 if (isl_int_is_zero(bmap
->div
[div
][0]))
2066 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
2069 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2070 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2072 if (div_involves_vars(bmap
, i
, first
, n
))
2079 /* Try and add a lower and/or upper bound on "div" to "bmap"
2080 * based on inequality "i".
2081 * "total" is the total number of variables (excluding the divs).
2082 * "v" is a temporary object that can be used during the calculations.
2083 * If "lb" is set, then a lower bound should be constructed.
2084 * If "ub" is set, then an upper bound should be constructed.
2086 * The calling function has already checked that the inequality does not
2087 * reference "div", but we still need to check that the inequality is
2088 * of the right form. We'll consider the case where we want to construct
2089 * a lower bound. The construction of upper bounds is similar.
2091 * Let "div" be of the form
2093 * q = floor((a + f(x))/d)
2095 * We essentially check if constraint "i" is of the form
2099 * so that we can use it to derive a lower bound on "div".
2100 * However, we allow a slightly more general form
2104 * with the condition that the coefficients of g(x) - f(x) are all
2106 * Rewriting this constraint as
2110 * adding a + f(x) to both sides and dividing by d, we obtain
2112 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
2114 * Taking the floor on both sides, we obtain
2116 * q >= floor((a-b)/d) + (f(x)-g(x))/d
2120 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
2122 * In the case of an upper bound, we construct the constraint
2124 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
2127 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
2128 __isl_take isl_basic_map
*bmap
, int div
, int i
,
2129 unsigned total
, isl_int v
, int lb
, int ub
)
2133 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
2135 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
2136 bmap
->div
[div
][1 + 1 + j
]);
2137 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2140 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
2141 bmap
->div
[div
][1 + 1 + j
]);
2142 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
2148 bmap
= isl_basic_map_cow(bmap
);
2149 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
2151 int k
= isl_basic_map_alloc_inequality(bmap
);
2154 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2155 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2156 bmap
->div
[div
][1 + j
]);
2157 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
2158 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2160 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
2163 int k
= isl_basic_map_alloc_inequality(bmap
);
2166 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
2167 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
2168 bmap
->div
[div
][1 + j
]);
2169 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
2170 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
2172 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
2175 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2178 isl_basic_map_free(bmap
);
2182 /* This function is called right before "div" is eliminated from "bmap"
2183 * using Fourier-Motzkin.
2184 * Look through the constraints of "bmap" for constraints on the argument
2185 * of the integer division and use them to construct constraints on the
2186 * integer division itself. These constraints can then be combined
2187 * during the Fourier-Motzkin elimination.
2188 * Note that it is only useful to introduce lower bounds on "div"
2189 * if "bmap" already contains upper bounds on "div" as the newly
2190 * introduce lower bounds can then be combined with the pre-existing
2191 * upper bounds. Similarly for upper bounds.
2192 * We therefore first check if "bmap" contains any lower and/or upper bounds
2195 * It is interesting to note that the introduction of these constraints
2196 * can indeed lead to more accurate results, even when compared to
2197 * deriving constraints on the argument of "div" from constraints on "div".
2198 * Consider, for example, the set
2200 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
2202 * The second constraint can be rewritten as
2204 * 2 * [(-i-2j+3)/4] + k >= 0
2206 * from which we can derive
2208 * -i - 2j + 3 >= -2k
2214 * Combined with the first constraint, we obtain
2216 * -3 <= 3 + 2k or k >= -3
2218 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2219 * the first constraint, we obtain
2221 * [(i + 2j)/4] >= [-3/4] = -1
2223 * Combining this constraint with the second constraint, we obtain
2227 static __isl_give isl_basic_map
*insert_bounds_on_div(
2228 __isl_take isl_basic_map
*bmap
, int div
)
2231 int check_lb
, check_ub
;
2238 if (isl_int_is_zero(bmap
->div
[div
][0]))
2241 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2245 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2246 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2253 if (!check_lb
&& !check_ub
)
2258 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2259 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2262 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2263 check_lb
, check_ub
);
2271 /* Remove all divs (recursively) involving any of the given dimensions
2272 * in their definitions.
2274 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2275 __isl_take isl_basic_map
*bmap
,
2276 enum isl_dim_type type
, unsigned first
, unsigned n
)
2282 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2284 first
+= isl_basic_map_offset(bmap
, type
);
2286 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2287 if (!div_involves_vars(bmap
, i
, first
, n
))
2289 bmap
= insert_bounds_on_div(bmap
, i
);
2290 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2298 isl_basic_map_free(bmap
);
2302 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2303 __isl_take isl_basic_set
*bset
,
2304 enum isl_dim_type type
, unsigned first
, unsigned n
)
2306 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2309 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2310 enum isl_dim_type type
, unsigned first
, unsigned n
)
2319 map
= isl_map_cow(map
);
2323 for (i
= 0; i
< map
->n
; ++i
) {
2324 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2335 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2336 enum isl_dim_type type
, unsigned first
, unsigned n
)
2338 return set_from_map(isl_map_remove_divs_involving_dims(set_to_map(set
),
2342 /* Does the description of "bmap" depend on the specified dimensions?
2343 * We also check whether the dimensions appear in any of the div definitions.
2344 * In principle there is no need for this check. If the dimensions appear
2345 * in a div definition, they also appear in the defining constraints of that
2348 isl_bool
isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2349 enum isl_dim_type type
, unsigned first
, unsigned n
)
2354 return isl_bool_error
;
2356 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2357 isl_die(bmap
->ctx
, isl_error_invalid
,
2358 "index out of bounds", return isl_bool_error
);
2360 first
+= isl_basic_map_offset(bmap
, type
);
2361 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2362 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2363 return isl_bool_true
;
2364 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2365 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2366 return isl_bool_true
;
2367 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2368 if (isl_int_is_zero(bmap
->div
[i
][0]))
2370 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2371 return isl_bool_true
;
2374 return isl_bool_false
;
2377 isl_bool
isl_map_involves_dims(__isl_keep isl_map
*map
,
2378 enum isl_dim_type type
, unsigned first
, unsigned n
)
2383 return isl_bool_error
;
2385 if (first
+ n
> isl_map_dim(map
, type
))
2386 isl_die(map
->ctx
, isl_error_invalid
,
2387 "index out of bounds", return isl_bool_error
);
2389 for (i
= 0; i
< map
->n
; ++i
) {
2390 isl_bool involves
= isl_basic_map_involves_dims(map
->p
[i
],
2392 if (involves
< 0 || involves
)
2396 return isl_bool_false
;
2399 isl_bool
isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2400 enum isl_dim_type type
, unsigned first
, unsigned n
)
2402 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2405 isl_bool
isl_set_involves_dims(__isl_keep isl_set
*set
,
2406 enum isl_dim_type type
, unsigned first
, unsigned n
)
2408 return isl_map_involves_dims(set
, type
, first
, n
);
2411 /* Does local variable "div" of "bmap" have a complete explicit representation?
2412 * Having a complete explicit representation requires not only
2413 * an explicit representation, but also that all local variables
2414 * that appear in this explicit representation in turn have
2415 * a complete explicit representation.
2417 isl_bool
isl_basic_map_div_is_known(__isl_keep isl_basic_map
*bmap
, int div
)
2420 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2423 marked
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
2424 if (marked
< 0 || marked
)
2425 return isl_bool_not(marked
);
2427 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2430 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2432 known
= isl_basic_map_div_is_known(bmap
, i
);
2433 if (known
< 0 || !known
)
2437 return isl_bool_true
;
2440 /* Does local variable "div" of "bset" have a complete explicit representation?
2442 isl_bool
isl_basic_set_div_is_known(__isl_keep isl_basic_set
*bset
, int div
)
2444 return isl_basic_map_div_is_known(bset
, div
);
2447 /* Remove all divs that are unknown or defined in terms of unknown divs.
2449 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2450 __isl_take isl_basic_map
*bmap
)
2457 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2458 if (isl_basic_map_div_is_known(bmap
, i
))
2460 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2469 /* Remove all divs that are unknown or defined in terms of unknown divs.
2471 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2472 __isl_take isl_basic_set
*bset
)
2474 return isl_basic_map_remove_unknown_divs(bset
);
2477 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2486 map
= isl_map_cow(map
);
2490 for (i
= 0; i
< map
->n
; ++i
) {
2491 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2501 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2503 return set_from_map(isl_map_remove_unknown_divs(set_to_map(set
)));
2506 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2507 __isl_take isl_basic_set
*bset
,
2508 enum isl_dim_type type
, unsigned first
, unsigned n
)
2510 isl_basic_map
*bmap
= bset_to_bmap(bset
);
2511 bmap
= isl_basic_map_remove_dims(bmap
, type
, first
, n
);
2512 return bset_from_bmap(bmap
);
2515 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2516 enum isl_dim_type type
, unsigned first
, unsigned n
)
2523 map
= isl_map_cow(map
);
2526 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2528 for (i
= 0; i
< map
->n
; ++i
) {
2529 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2530 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2534 map
= isl_map_drop(map
, type
, first
, n
);
2541 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2542 enum isl_dim_type type
, unsigned first
, unsigned n
)
2544 return set_from_map(isl_map_remove_dims(set_to_map(bset
),
2548 /* Project out n inputs starting at first using Fourier-Motzkin */
2549 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2550 unsigned first
, unsigned n
)
2552 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2555 static void dump_term(struct isl_basic_map
*bmap
,
2556 isl_int c
, int pos
, FILE *out
)
2559 unsigned in
= isl_basic_map_n_in(bmap
);
2560 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2561 unsigned nparam
= isl_basic_map_n_param(bmap
);
2563 isl_int_print(out
, c
, 0);
2565 if (!isl_int_is_one(c
))
2566 isl_int_print(out
, c
, 0);
2567 if (pos
< 1 + nparam
) {
2568 name
= isl_space_get_dim_name(bmap
->dim
,
2569 isl_dim_param
, pos
- 1);
2571 fprintf(out
, "%s", name
);
2573 fprintf(out
, "p%d", pos
- 1);
2574 } else if (pos
< 1 + nparam
+ in
)
2575 fprintf(out
, "i%d", pos
- 1 - nparam
);
2576 else if (pos
< 1 + nparam
+ dim
)
2577 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2579 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2583 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2584 int sign
, FILE *out
)
2588 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2592 for (i
= 0, first
= 1; i
< len
; ++i
) {
2593 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2596 fprintf(out
, " + ");
2598 isl_int_abs(v
, c
[i
]);
2599 dump_term(bmap
, v
, i
, out
);
2606 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2607 const char *op
, FILE *out
, int indent
)
2611 fprintf(out
, "%*s", indent
, "");
2613 dump_constraint_sign(bmap
, c
, 1, out
);
2614 fprintf(out
, " %s ", op
);
2615 dump_constraint_sign(bmap
, c
, -1, out
);
2619 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2620 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2622 fprintf(out
, "%*s", indent
, "");
2623 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2628 static void dump_constraints(struct isl_basic_map
*bmap
,
2629 isl_int
**c
, unsigned n
,
2630 const char *op
, FILE *out
, int indent
)
2634 for (i
= 0; i
< n
; ++i
)
2635 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2638 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2642 unsigned total
= isl_basic_map_total_dim(bmap
);
2644 for (j
= 0; j
< 1 + total
; ++j
) {
2645 if (isl_int_is_zero(exp
[j
]))
2647 if (!first
&& isl_int_is_pos(exp
[j
]))
2649 dump_term(bmap
, exp
[j
], j
, out
);
2654 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2658 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2659 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2661 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2662 fprintf(out
, "%*s", indent
, "");
2663 fprintf(out
, "e%d = [(", i
);
2664 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2666 isl_int_print(out
, bmap
->div
[i
][0], 0);
2667 fprintf(out
, "]\n");
2671 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2672 FILE *out
, int indent
)
2675 fprintf(out
, "null basic set\n");
2679 fprintf(out
, "%*s", indent
, "");
2680 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2681 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2682 bset
->extra
, bset
->flags
);
2683 dump(bset_to_bmap(bset
), out
, indent
);
2686 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2687 FILE *out
, int indent
)
2690 fprintf(out
, "null basic map\n");
2694 fprintf(out
, "%*s", indent
, "");
2695 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2696 "flags: %x, n_name: %d\n",
2698 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2699 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2700 dump(bmap
, out
, indent
);
2703 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2708 total
= isl_basic_map_total_dim(bmap
);
2709 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2710 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2711 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2712 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2716 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*space
, int n
,
2721 if (isl_space_dim(space
, isl_dim_in
) != 0)
2722 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
2723 "set cannot have input dimensions", goto error
);
2724 return isl_map_alloc_space(space
, n
, flags
);
2726 isl_space_free(space
);
2730 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2731 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2733 struct isl_set
*set
;
2736 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2740 set
= isl_set_alloc_space(dims
, n
, flags
);
2744 /* Make sure "map" has room for at least "n" more basic maps.
2746 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2749 struct isl_map
*grown
= NULL
;
2753 isl_assert(map
->ctx
, n
>= 0, goto error
);
2754 if (map
->n
+ n
<= map
->size
)
2756 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2759 for (i
= 0; i
< map
->n
; ++i
) {
2760 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2768 isl_map_free(grown
);
2773 /* Make sure "set" has room for at least "n" more basic sets.
2775 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2777 return set_from_map(isl_map_grow(set_to_map(set
), n
));
2780 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2783 struct isl_set
*dup
;
2788 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2791 for (i
= 0; i
< set
->n
; ++i
)
2792 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2796 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2798 return isl_map_from_basic_map(bset
);
2801 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2803 struct isl_map
*map
;
2808 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2809 return isl_map_add_basic_map(map
, bmap
);
2812 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2813 __isl_take isl_basic_set
*bset
)
2815 return set_from_map(isl_map_add_basic_map(set_to_map(set
),
2816 bset_to_bmap(bset
)));
2819 __isl_null isl_set
*isl_set_free(__isl_take isl_set
*set
)
2821 return isl_map_free(set
);
2824 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2829 fprintf(out
, "null set\n");
2833 fprintf(out
, "%*s", indent
, "");
2834 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2835 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2837 for (i
= 0; i
< set
->n
; ++i
) {
2838 fprintf(out
, "%*s", indent
, "");
2839 fprintf(out
, "basic set %d:\n", i
);
2840 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2844 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2849 fprintf(out
, "null map\n");
2853 fprintf(out
, "%*s", indent
, "");
2854 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2855 "flags: %x, n_name: %d\n",
2856 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2857 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2858 for (i
= 0; i
< map
->n
; ++i
) {
2859 fprintf(out
, "%*s", indent
, "");
2860 fprintf(out
, "basic map %d:\n", i
);
2861 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2865 struct isl_basic_map
*isl_basic_map_intersect_domain(
2866 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2868 struct isl_basic_map
*bmap_domain
;
2873 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2874 bset
->dim
, isl_dim_param
), goto error
);
2876 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2877 isl_assert(bset
->ctx
,
2878 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2880 bmap
= isl_basic_map_cow(bmap
);
2883 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2884 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2885 bmap_domain
= isl_basic_map_from_domain(bset
);
2886 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2888 bmap
= isl_basic_map_simplify(bmap
);
2889 return isl_basic_map_finalize(bmap
);
2891 isl_basic_map_free(bmap
);
2892 isl_basic_set_free(bset
);
2896 struct isl_basic_map
*isl_basic_map_intersect_range(
2897 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2899 struct isl_basic_map
*bmap_range
;
2904 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2905 bset
->dim
, isl_dim_param
), goto error
);
2907 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2908 isl_assert(bset
->ctx
,
2909 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2911 if (isl_basic_set_plain_is_universe(bset
)) {
2912 isl_basic_set_free(bset
);
2916 bmap
= isl_basic_map_cow(bmap
);
2919 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2920 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2921 bmap_range
= bset_to_bmap(bset
);
2922 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2924 bmap
= isl_basic_map_simplify(bmap
);
2925 return isl_basic_map_finalize(bmap
);
2927 isl_basic_map_free(bmap
);
2928 isl_basic_set_free(bset
);
2932 isl_bool
isl_basic_map_contains(__isl_keep isl_basic_map
*bmap
,
2933 __isl_keep isl_vec
*vec
)
2940 return isl_bool_error
;
2942 total
= 1 + isl_basic_map_total_dim(bmap
);
2943 if (total
!= vec
->size
)
2944 return isl_bool_false
;
2948 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2949 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2950 if (!isl_int_is_zero(s
)) {
2952 return isl_bool_false
;
2956 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2957 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2958 if (isl_int_is_neg(s
)) {
2960 return isl_bool_false
;
2966 return isl_bool_true
;
2969 isl_bool
isl_basic_set_contains(__isl_keep isl_basic_set
*bset
,
2970 __isl_keep isl_vec
*vec
)
2972 return isl_basic_map_contains(bset_to_bmap(bset
), vec
);
2975 struct isl_basic_map
*isl_basic_map_intersect(
2976 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2978 struct isl_vec
*sample
= NULL
;
2980 if (!bmap1
|| !bmap2
)
2983 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2984 bmap2
->dim
, isl_dim_param
), goto error
);
2985 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2986 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2987 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2988 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2989 return isl_basic_map_intersect(bmap2
, bmap1
);
2991 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2992 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2993 isl_assert(bmap1
->ctx
,
2994 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2996 if (isl_basic_map_plain_is_empty(bmap1
)) {
2997 isl_basic_map_free(bmap2
);
3000 if (isl_basic_map_plain_is_empty(bmap2
)) {
3001 isl_basic_map_free(bmap1
);
3005 if (bmap1
->sample
&&
3006 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
3007 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
3008 sample
= isl_vec_copy(bmap1
->sample
);
3009 else if (bmap2
->sample
&&
3010 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
3011 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
3012 sample
= isl_vec_copy(bmap2
->sample
);
3014 bmap1
= isl_basic_map_cow(bmap1
);
3017 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
3018 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3019 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
3022 isl_vec_free(sample
);
3024 isl_vec_free(bmap1
->sample
);
3025 bmap1
->sample
= sample
;
3028 bmap1
= isl_basic_map_simplify(bmap1
);
3029 return isl_basic_map_finalize(bmap1
);
3032 isl_vec_free(sample
);
3033 isl_basic_map_free(bmap1
);
3034 isl_basic_map_free(bmap2
);
3038 struct isl_basic_set
*isl_basic_set_intersect(
3039 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3041 return bset_from_bmap(isl_basic_map_intersect(bset_to_bmap(bset1
),
3042 bset_to_bmap(bset2
)));
3045 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
3046 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
3048 return isl_basic_set_intersect(bset1
, bset2
);
3051 /* Special case of isl_map_intersect, where both map1 and map2
3052 * are convex, without any divs and such that either map1 or map2
3053 * contains a single constraint. This constraint is then simply
3054 * added to the other map.
3056 static __isl_give isl_map
*map_intersect_add_constraint(
3057 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
3059 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
3060 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
3061 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3062 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
3064 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
3065 return isl_map_intersect(map2
, map1
);
3067 isl_assert(map2
->ctx
,
3068 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
3070 map1
= isl_map_cow(map1
);
3073 if (isl_map_plain_is_empty(map1
)) {
3077 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
3078 if (map2
->p
[0]->n_eq
== 1)
3079 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
3081 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
3082 map2
->p
[0]->ineq
[0]);
3084 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
3085 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
3089 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
3090 isl_basic_map_free(map1
->p
[0]);
3103 /* map2 may be either a parameter domain or a map living in the same
3106 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
3107 __isl_take isl_map
*map2
)
3116 if ((isl_map_plain_is_empty(map1
) ||
3117 isl_map_plain_is_universe(map2
)) &&
3118 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3122 if ((isl_map_plain_is_empty(map2
) ||
3123 isl_map_plain_is_universe(map1
)) &&
3124 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
3129 if (map1
->n
== 1 && map2
->n
== 1 &&
3130 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
3131 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
3132 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
3133 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
3134 return map_intersect_add_constraint(map1
, map2
);
3136 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
3137 isl_space_dim(map2
->dim
, isl_dim_param
))
3138 isl_assert(map1
->ctx
,
3139 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3141 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3142 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3143 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3145 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3146 map1
->n
* map2
->n
, flags
);
3149 for (i
= 0; i
< map1
->n
; ++i
)
3150 for (j
= 0; j
< map2
->n
; ++j
) {
3151 struct isl_basic_map
*part
;
3152 part
= isl_basic_map_intersect(
3153 isl_basic_map_copy(map1
->p
[i
]),
3154 isl_basic_map_copy(map2
->p
[j
]));
3155 if (isl_basic_map_is_empty(part
) < 0)
3156 part
= isl_basic_map_free(part
);
3157 result
= isl_map_add_basic_map(result
, part
);
3170 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
3171 __isl_take isl_map
*map2
)
3175 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
3176 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
3177 "spaces don't match", goto error
);
3178 return map_intersect_internal(map1
, map2
);
3185 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
3186 __isl_take isl_map
*map2
)
3188 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
3191 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
3193 return set_from_map(isl_map_intersect(set_to_map(set1
),
3197 /* map_intersect_internal accepts intersections
3198 * with parameter domains, so we can just call that function.
3200 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
3201 __isl_take isl_set
*params
)
3203 return map_intersect_internal(map
, params
);
3206 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
3207 __isl_take isl_map
*map2
)
3209 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
3212 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
3213 __isl_take isl_set
*params
)
3215 return isl_map_intersect_params(set
, params
);
3218 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3221 unsigned pos
, n1
, n2
;
3225 bmap
= isl_basic_map_cow(bmap
);
3228 space
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3229 pos
= isl_basic_map_offset(bmap
, isl_dim_in
);
3230 n1
= isl_basic_map_dim(bmap
, isl_dim_in
);
3231 n2
= isl_basic_map_dim(bmap
, isl_dim_out
);
3232 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
3233 return isl_basic_map_reset_space(bmap
, space
);
3236 static __isl_give isl_basic_map
*basic_map_space_reset(
3237 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3243 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3246 space
= isl_basic_map_get_space(bmap
);
3247 space
= isl_space_reset(space
, type
);
3248 bmap
= isl_basic_map_reset_space(bmap
, space
);
3252 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3253 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3254 unsigned pos
, unsigned n
)
3257 struct isl_basic_map
*res
;
3258 struct isl_dim_map
*dim_map
;
3259 unsigned total
, off
;
3260 enum isl_dim_type t
;
3263 return basic_map_space_reset(bmap
, type
);
3268 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3270 total
= isl_basic_map_total_dim(bmap
) + n
;
3271 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3273 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3275 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3277 unsigned size
= isl_basic_map_dim(bmap
, t
);
3278 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3280 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3281 pos
, size
- pos
, off
+ pos
+ n
);
3283 off
+= isl_space_dim(res_dim
, t
);
3285 isl_dim_map_div(dim_map
, bmap
, off
);
3287 res
= isl_basic_map_alloc_space(res_dim
,
3288 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3289 if (isl_basic_map_is_rational(bmap
))
3290 res
= isl_basic_map_set_rational(res
);
3291 if (isl_basic_map_plain_is_empty(bmap
)) {
3292 isl_basic_map_free(bmap
);
3294 return isl_basic_map_set_to_empty(res
);
3296 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3297 return isl_basic_map_finalize(res
);
3300 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3301 __isl_take isl_basic_set
*bset
,
3302 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3304 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3307 __isl_give isl_basic_map
*isl_basic_map_add_dims(__isl_take isl_basic_map
*bmap
,
3308 enum isl_dim_type type
, unsigned n
)
3312 return isl_basic_map_insert_dims(bmap
, type
,
3313 isl_basic_map_dim(bmap
, type
), n
);
3316 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3317 enum isl_dim_type type
, unsigned n
)
3321 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3322 return isl_basic_map_add_dims(bset
, type
, n
);
3324 isl_basic_set_free(bset
);
3328 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3329 enum isl_dim_type type
)
3333 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3336 space
= isl_map_get_space(map
);
3337 space
= isl_space_reset(space
, type
);
3338 map
= isl_map_reset_space(map
, space
);
3342 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3343 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3348 return map_space_reset(map
, type
);
3350 map
= isl_map_cow(map
);
3354 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3358 for (i
= 0; i
< map
->n
; ++i
) {
3359 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3370 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3371 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3373 return isl_map_insert_dims(set
, type
, pos
, n
);
3376 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3377 enum isl_dim_type type
, unsigned n
)
3381 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3384 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3385 enum isl_dim_type type
, unsigned n
)
3389 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3390 return set_from_map(isl_map_add_dims(set_to_map(set
), type
, n
));
3396 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3397 __isl_take isl_basic_map
*bmap
,
3398 enum isl_dim_type dst_type
, unsigned dst_pos
,
3399 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3401 struct isl_dim_map
*dim_map
;
3402 struct isl_basic_map
*res
;
3403 enum isl_dim_type t
;
3404 unsigned total
, off
;
3411 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3414 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3417 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3419 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3420 pos(bmap
->dim
, src_type
) + src_pos
+
3421 ((src_type
< dst_type
) ? n
: 0)) {
3422 bmap
= isl_basic_map_cow(bmap
);
3426 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3427 src_type
, src_pos
, n
);
3431 bmap
= isl_basic_map_finalize(bmap
);
3436 total
= isl_basic_map_total_dim(bmap
);
3437 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3440 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3441 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3442 if (t
== dst_type
) {
3443 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3446 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3449 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3450 dst_pos
, size
- dst_pos
, off
);
3451 off
+= size
- dst_pos
;
3452 } else if (t
== src_type
) {
3453 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3456 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3457 src_pos
+ n
, size
- src_pos
- n
, off
);
3458 off
+= size
- src_pos
- n
;
3460 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3464 isl_dim_map_div(dim_map
, bmap
, off
);
3466 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3467 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3468 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3472 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3473 src_type
, src_pos
, n
);
3477 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3478 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3479 bmap
= isl_basic_map_finalize(bmap
);
3483 isl_basic_map_free(bmap
);
3487 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3488 enum isl_dim_type dst_type
, unsigned dst_pos
,
3489 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3491 isl_basic_map
*bmap
= bset_to_bmap(bset
);
3492 bmap
= isl_basic_map_move_dims(bmap
, dst_type
, dst_pos
,
3493 src_type
, src_pos
, n
);
3494 return bset_from_bmap(bmap
);
3497 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3498 enum isl_dim_type dst_type
, unsigned dst_pos
,
3499 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3503 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3504 return set_from_map(isl_map_move_dims(set_to_map(set
),
3505 dst_type
, dst_pos
, src_type
, src_pos
, n
));
3511 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3512 enum isl_dim_type dst_type
, unsigned dst_pos
,
3513 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3522 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3525 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3528 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3530 map
= isl_map_cow(map
);
3534 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3538 for (i
= 0; i
< map
->n
; ++i
) {
3539 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3541 src_type
, src_pos
, n
);
3552 /* Move the specified dimensions to the last columns right before
3553 * the divs. Don't change the dimension specification of bmap.
3554 * That's the responsibility of the caller.
3556 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3557 enum isl_dim_type type
, unsigned first
, unsigned n
)
3559 struct isl_dim_map
*dim_map
;
3560 struct isl_basic_map
*res
;
3561 enum isl_dim_type t
;
3562 unsigned total
, off
;
3566 if (pos(bmap
->dim
, type
) + first
+ n
==
3567 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3570 total
= isl_basic_map_total_dim(bmap
);
3571 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3574 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3575 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3577 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3580 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3581 first
, n
, total
- bmap
->n_div
- n
);
3582 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3583 first
+ n
, size
- (first
+ n
), off
);
3584 off
+= size
- (first
+ n
);
3586 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3590 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3592 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3593 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3594 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3598 /* Insert "n" rows in the divs of "bmap".
3600 * The number of columns is not changed, which means that the last
3601 * dimensions of "bmap" are being reintepreted as the new divs.
3602 * The space of "bmap" is not adjusted, however, which means
3603 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3604 * from the space of "bmap" is the responsibility of the caller.
3606 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3614 bmap
= isl_basic_map_cow(bmap
);
3618 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3619 old
= bmap
->block2
.data
;
3620 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3621 (bmap
->extra
+ n
) * (1 + row_size
));
3622 if (!bmap
->block2
.data
)
3623 return isl_basic_map_free(bmap
);
3624 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3626 return isl_basic_map_free(bmap
);
3627 for (i
= 0; i
< n
; ++i
) {
3628 new_div
[i
] = bmap
->block2
.data
+
3629 (bmap
->extra
+ i
) * (1 + row_size
);
3630 isl_seq_clr(new_div
[i
], 1 + row_size
);
3632 for (i
= 0; i
< bmap
->extra
; ++i
)
3633 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3635 bmap
->div
= new_div
;
3642 /* Drop constraints from "bmap" that only involve the variables
3643 * of "type" in the range [first, first + n] that are not related
3644 * to any of the variables outside that interval.
3645 * These constraints cannot influence the values for the variables
3646 * outside the interval, except in case they cause "bmap" to be empty.
3647 * Only drop the constraints if "bmap" is known to be non-empty.
3649 static __isl_give isl_basic_map
*drop_irrelevant_constraints(
3650 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3651 unsigned first
, unsigned n
)
3655 unsigned dim
, n_div
;
3658 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
3660 return isl_basic_map_free(bmap
);
3664 dim
= isl_basic_map_dim(bmap
, isl_dim_all
);
3665 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
3666 groups
= isl_calloc_array(isl_basic_map_get_ctx(bmap
), int, dim
);
3668 return isl_basic_map_free(bmap
);
3669 first
+= isl_basic_map_offset(bmap
, type
) - 1;
3670 for (i
= 0; i
< first
; ++i
)
3672 for (i
= first
+ n
; i
< dim
- n_div
; ++i
)
3675 bmap
= isl_basic_map_drop_unrelated_constraints(bmap
, groups
);
3680 /* Turn the n dimensions of type type, starting at first
3681 * into existentially quantified variables.
3683 * If a subset of the projected out variables are unrelated
3684 * to any of the variables that remain, then the constraints
3685 * involving this subset are simply dropped first.
3687 __isl_give isl_basic_map
*isl_basic_map_project_out(
3688 __isl_take isl_basic_map
*bmap
,
3689 enum isl_dim_type type
, unsigned first
, unsigned n
)
3692 return basic_map_space_reset(bmap
, type
);
3693 if (type
== isl_dim_div
)
3694 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
3695 "cannot project out existentially quantified variables",
3696 return isl_basic_map_free(bmap
));
3698 bmap
= drop_irrelevant_constraints(bmap
, type
, first
, n
);
3702 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3703 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3705 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3708 bmap
= move_last(bmap
, type
, first
, n
);
3709 bmap
= isl_basic_map_cow(bmap
);
3710 bmap
= insert_div_rows(bmap
, n
);
3714 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3717 bmap
= isl_basic_map_simplify(bmap
);
3718 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3719 return isl_basic_map_finalize(bmap
);
3721 isl_basic_map_free(bmap
);
3725 /* Turn the n dimensions of type type, starting at first
3726 * into existentially quantified variables.
3728 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3729 enum isl_dim_type type
, unsigned first
, unsigned n
)
3731 return bset_from_bmap(isl_basic_map_project_out(bset_to_bmap(bset
),
3735 /* Turn the n dimensions of type type, starting at first
3736 * into existentially quantified variables.
3738 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3739 enum isl_dim_type type
, unsigned first
, unsigned n
)
3747 return map_space_reset(map
, type
);
3749 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3751 map
= isl_map_cow(map
);
3755 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3759 for (i
= 0; i
< map
->n
; ++i
) {
3760 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3771 /* Turn the n dimensions of type type, starting at first
3772 * into existentially quantified variables.
3774 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3775 enum isl_dim_type type
, unsigned first
, unsigned n
)
3777 return set_from_map(isl_map_project_out(set_to_map(set
),
3781 /* Return a map that projects the elements in "set" onto their
3782 * "n" set dimensions starting at "first".
3783 * "type" should be equal to isl_dim_set.
3785 __isl_give isl_map
*isl_set_project_onto_map(__isl_take isl_set
*set
,
3786 enum isl_dim_type type
, unsigned first
, unsigned n
)
3794 if (type
!= isl_dim_set
)
3795 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
3796 "only set dimensions can be projected out", goto error
);
3797 dim
= isl_set_dim(set
, isl_dim_set
);
3798 if (first
+ n
> dim
|| first
+ n
< first
)
3799 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
3800 "index out of bounds", goto error
);
3802 map
= isl_map_from_domain(set
);
3803 map
= isl_map_add_dims(map
, isl_dim_out
, n
);
3804 for (i
= 0; i
< n
; ++i
)
3805 map
= isl_map_equate(map
, isl_dim_in
, first
+ i
,
3813 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3817 for (i
= 0; i
< n
; ++i
) {
3818 j
= isl_basic_map_alloc_div(bmap
);
3821 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3825 isl_basic_map_free(bmap
);
3829 struct isl_basic_map
*isl_basic_map_apply_range(
3830 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3832 isl_space
*dim_result
= NULL
;
3833 struct isl_basic_map
*bmap
;
3834 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3835 struct isl_dim_map
*dim_map1
, *dim_map2
;
3837 if (!bmap1
|| !bmap2
)
3839 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3840 bmap2
->dim
, isl_dim_param
))
3841 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3842 "parameters don't match", goto error
);
3843 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_out
,
3844 bmap2
->dim
, isl_dim_in
))
3845 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3846 "spaces don't match", goto error
);
3848 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3849 isl_space_copy(bmap2
->dim
));
3851 n_in
= isl_basic_map_n_in(bmap1
);
3852 n_out
= isl_basic_map_n_out(bmap2
);
3853 n
= isl_basic_map_n_out(bmap1
);
3854 nparam
= isl_basic_map_n_param(bmap1
);
3856 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3857 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3858 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3859 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3860 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3861 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3862 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3863 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3864 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3865 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3866 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3868 bmap
= isl_basic_map_alloc_space(dim_result
,
3869 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3870 bmap1
->n_eq
+ bmap2
->n_eq
,
3871 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3872 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3873 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3874 bmap
= add_divs(bmap
, n
);
3875 bmap
= isl_basic_map_simplify(bmap
);
3876 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3877 return isl_basic_map_finalize(bmap
);
3879 isl_basic_map_free(bmap1
);
3880 isl_basic_map_free(bmap2
);
3884 struct isl_basic_set
*isl_basic_set_apply(
3885 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3890 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3893 return bset_from_bmap(isl_basic_map_apply_range(bset_to_bmap(bset
),
3896 isl_basic_set_free(bset
);
3897 isl_basic_map_free(bmap
);
3901 struct isl_basic_map
*isl_basic_map_apply_domain(
3902 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3904 if (!bmap1
|| !bmap2
)
3907 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3908 bmap2
->dim
, isl_dim_param
))
3909 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3910 "parameters don't match", goto error
);
3911 if (!isl_space_tuple_is_equal(bmap1
->dim
, isl_dim_in
,
3912 bmap2
->dim
, isl_dim_in
))
3913 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3914 "spaces don't match", goto error
);
3916 bmap1
= isl_basic_map_reverse(bmap1
);
3917 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3918 return isl_basic_map_reverse(bmap1
);
3920 isl_basic_map_free(bmap1
);
3921 isl_basic_map_free(bmap2
);
3925 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3926 * A \cap B -> f(A) + f(B)
3928 struct isl_basic_map
*isl_basic_map_sum(
3929 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3931 unsigned n_in
, n_out
, nparam
, total
, pos
;
3932 struct isl_basic_map
*bmap
= NULL
;
3933 struct isl_dim_map
*dim_map1
, *dim_map2
;
3936 if (!bmap1
|| !bmap2
)
3939 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3942 nparam
= isl_basic_map_n_param(bmap1
);
3943 n_in
= isl_basic_map_n_in(bmap1
);
3944 n_out
= isl_basic_map_n_out(bmap1
);
3946 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3947 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3948 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3949 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3950 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3951 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3952 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3953 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3954 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3955 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3956 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3958 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3959 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3960 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3961 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3962 for (i
= 0; i
< n_out
; ++i
) {
3963 int j
= isl_basic_map_alloc_equality(bmap
);
3966 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3967 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3968 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3969 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3971 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3972 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3973 bmap
= add_divs(bmap
, 2 * n_out
);
3975 bmap
= isl_basic_map_simplify(bmap
);
3976 return isl_basic_map_finalize(bmap
);
3978 isl_basic_map_free(bmap
);
3979 isl_basic_map_free(bmap1
);
3980 isl_basic_map_free(bmap2
);
3984 /* Given two maps A -> f(A) and B -> g(B), construct a map
3985 * A \cap B -> f(A) + f(B)
3987 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3989 struct isl_map
*result
;
3995 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3997 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3998 map1
->n
* map2
->n
, 0);
4001 for (i
= 0; i
< map1
->n
; ++i
)
4002 for (j
= 0; j
< map2
->n
; ++j
) {
4003 struct isl_basic_map
*part
;
4004 part
= isl_basic_map_sum(
4005 isl_basic_map_copy(map1
->p
[i
]),
4006 isl_basic_map_copy(map2
->p
[j
]));
4007 if (isl_basic_map_is_empty(part
))
4008 isl_basic_map_free(part
);
4010 result
= isl_map_add_basic_map(result
, part
);
4023 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4024 __isl_take isl_set
*set2
)
4026 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4029 /* Given a basic map A -> f(A), construct A -> -f(A).
4031 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
4036 bmap
= isl_basic_map_cow(bmap
);
4040 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4041 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4042 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4043 for (j
= 0; j
< n
; ++j
)
4044 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4045 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4046 for (j
= 0; j
< n
; ++j
)
4047 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4048 for (i
= 0; i
< bmap
->n_div
; ++i
)
4049 for (j
= 0; j
< n
; ++j
)
4050 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4051 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4052 return isl_basic_map_finalize(bmap
);
4055 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4057 return isl_basic_map_neg(bset
);
4060 /* Given a map A -> f(A), construct A -> -f(A).
4062 struct isl_map
*isl_map_neg(struct isl_map
*map
)
4066 map
= isl_map_cow(map
);
4070 for (i
= 0; i
< map
->n
; ++i
) {
4071 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4082 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4084 return set_from_map(isl_map_neg(set_to_map(set
)));
4087 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4088 * A -> floor(f(A)/d).
4090 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
4093 unsigned n_in
, n_out
, nparam
, total
, pos
;
4094 struct isl_basic_map
*result
= NULL
;
4095 struct isl_dim_map
*dim_map
;
4101 nparam
= isl_basic_map_n_param(bmap
);
4102 n_in
= isl_basic_map_n_in(bmap
);
4103 n_out
= isl_basic_map_n_out(bmap
);
4105 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4106 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4107 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4108 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4109 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4110 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4112 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4113 bmap
->n_div
+ n_out
,
4114 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4115 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4116 result
= add_divs(result
, n_out
);
4117 for (i
= 0; i
< n_out
; ++i
) {
4119 j
= isl_basic_map_alloc_inequality(result
);
4122 isl_seq_clr(result
->ineq
[j
], 1+total
);
4123 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4124 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4125 j
= isl_basic_map_alloc_inequality(result
);
4128 isl_seq_clr(result
->ineq
[j
], 1+total
);
4129 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4130 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4131 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4134 result
= isl_basic_map_simplify(result
);
4135 return isl_basic_map_finalize(result
);
4137 isl_basic_map_free(result
);
4141 /* Given a map A -> f(A) and an integer d, construct a map
4142 * A -> floor(f(A)/d).
4144 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
4148 map
= isl_map_cow(map
);
4152 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4153 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4154 for (i
= 0; i
< map
->n
; ++i
) {
4155 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4166 /* Given a map A -> f(A) and an integer d, construct a map
4167 * A -> floor(f(A)/d).
4169 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4170 __isl_take isl_val
*d
)
4174 if (!isl_val_is_int(d
))
4175 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4176 "expecting integer denominator", goto error
);
4177 map
= isl_map_floordiv(map
, d
->n
);
4186 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
4192 i
= isl_basic_map_alloc_equality(bmap
);
4195 nparam
= isl_basic_map_n_param(bmap
);
4196 n_in
= isl_basic_map_n_in(bmap
);
4197 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4198 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4199 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4200 return isl_basic_map_finalize(bmap
);
4202 isl_basic_map_free(bmap
);
4206 /* Add a constraint to "bmap" expressing i_pos < o_pos
4208 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
4214 i
= isl_basic_map_alloc_inequality(bmap
);
4217 nparam
= isl_basic_map_n_param(bmap
);
4218 n_in
= isl_basic_map_n_in(bmap
);
4219 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4220 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4221 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4222 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4223 return isl_basic_map_finalize(bmap
);
4225 isl_basic_map_free(bmap
);
4229 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4231 static __isl_give isl_basic_map
*var_less_or_equal(
4232 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4238 i
= isl_basic_map_alloc_inequality(bmap
);
4241 nparam
= isl_basic_map_n_param(bmap
);
4242 n_in
= isl_basic_map_n_in(bmap
);
4243 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4244 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4245 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4246 return isl_basic_map_finalize(bmap
);
4248 isl_basic_map_free(bmap
);
4252 /* Add a constraint to "bmap" expressing i_pos > o_pos
4254 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4260 i
= isl_basic_map_alloc_inequality(bmap
);
4263 nparam
= isl_basic_map_n_param(bmap
);
4264 n_in
= isl_basic_map_n_in(bmap
);
4265 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4266 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4267 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4268 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4269 return isl_basic_map_finalize(bmap
);
4271 isl_basic_map_free(bmap
);
4275 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4277 static __isl_give isl_basic_map
*var_more_or_equal(
4278 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4284 i
= isl_basic_map_alloc_inequality(bmap
);
4287 nparam
= isl_basic_map_n_param(bmap
);
4288 n_in
= isl_basic_map_n_in(bmap
);
4289 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4290 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4291 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4292 return isl_basic_map_finalize(bmap
);
4294 isl_basic_map_free(bmap
);
4298 __isl_give isl_basic_map
*isl_basic_map_equal(
4299 __isl_take isl_space
*dim
, unsigned n_equal
)
4302 struct isl_basic_map
*bmap
;
4303 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4306 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4307 bmap
= var_equal(bmap
, i
);
4308 return isl_basic_map_finalize(bmap
);
4311 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4313 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4317 struct isl_basic_map
*bmap
;
4318 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4321 for (i
= 0; i
< pos
&& bmap
; ++i
)
4322 bmap
= var_equal(bmap
, i
);
4324 bmap
= var_less(bmap
, pos
);
4325 return isl_basic_map_finalize(bmap
);
4328 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4330 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4331 __isl_take isl_space
*dim
, unsigned pos
)
4334 isl_basic_map
*bmap
;
4336 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4337 for (i
= 0; i
< pos
; ++i
)
4338 bmap
= var_equal(bmap
, i
);
4339 bmap
= var_less_or_equal(bmap
, pos
);
4340 return isl_basic_map_finalize(bmap
);
4343 /* Return a relation on "dim" expressing i_pos > o_pos
4345 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4349 struct isl_basic_map
*bmap
;
4350 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4353 for (i
= 0; i
< pos
&& bmap
; ++i
)
4354 bmap
= var_equal(bmap
, i
);
4356 bmap
= var_more(bmap
, pos
);
4357 return isl_basic_map_finalize(bmap
);
4360 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4362 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4363 __isl_take isl_space
*dim
, unsigned pos
)
4366 isl_basic_map
*bmap
;
4368 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4369 for (i
= 0; i
< pos
; ++i
)
4370 bmap
= var_equal(bmap
, i
);
4371 bmap
= var_more_or_equal(bmap
, pos
);
4372 return isl_basic_map_finalize(bmap
);
4375 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4376 unsigned n
, int equal
)
4378 struct isl_map
*map
;
4381 if (n
== 0 && equal
)
4382 return isl_map_universe(dims
);
4384 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4386 for (i
= 0; i
+ 1 < n
; ++i
)
4387 map
= isl_map_add_basic_map(map
,
4388 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4391 map
= isl_map_add_basic_map(map
,
4392 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4394 map
= isl_map_add_basic_map(map
,
4395 isl_basic_map_less_at(dims
, n
- 1));
4397 isl_space_free(dims
);
4402 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4406 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4409 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4411 return map_lex_lte_first(dim
, n
, 0);
4414 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4416 return map_lex_lte_first(dim
, n
, 1);
4419 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4421 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4424 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4426 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4429 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4430 unsigned n
, int equal
)
4432 struct isl_map
*map
;
4435 if (n
== 0 && equal
)
4436 return isl_map_universe(dims
);
4438 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4440 for (i
= 0; i
+ 1 < n
; ++i
)
4441 map
= isl_map_add_basic_map(map
,
4442 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4445 map
= isl_map_add_basic_map(map
,
4446 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4448 map
= isl_map_add_basic_map(map
,
4449 isl_basic_map_more_at(dims
, n
- 1));
4451 isl_space_free(dims
);
4456 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4460 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4463 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4465 return map_lex_gte_first(dim
, n
, 0);
4468 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4470 return map_lex_gte_first(dim
, n
, 1);
4473 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4475 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4478 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4480 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4483 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4484 __isl_take isl_set
*set2
)
4487 map
= isl_map_lex_le(isl_set_get_space(set1
));
4488 map
= isl_map_intersect_domain(map
, set1
);
4489 map
= isl_map_intersect_range(map
, set2
);
4493 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4494 __isl_take isl_set
*set2
)
4497 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4498 map
= isl_map_intersect_domain(map
, set1
);
4499 map
= isl_map_intersect_range(map
, set2
);
4503 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4504 __isl_take isl_set
*set2
)
4507 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4508 map
= isl_map_intersect_domain(map
, set1
);
4509 map
= isl_map_intersect_range(map
, set2
);
4513 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4514 __isl_take isl_set
*set2
)
4517 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4518 map
= isl_map_intersect_domain(map
, set1
);
4519 map
= isl_map_intersect_range(map
, set2
);
4523 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4524 __isl_take isl_map
*map2
)
4527 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4528 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4529 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4533 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4534 __isl_take isl_map
*map2
)
4537 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4538 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4539 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4543 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4544 __isl_take isl_map
*map2
)
4547 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4548 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4549 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4553 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4554 __isl_take isl_map
*map2
)
4557 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4558 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4559 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4563 static __isl_give isl_basic_map
*basic_map_from_basic_set(
4564 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4566 struct isl_basic_map
*bmap
;
4568 bset
= isl_basic_set_cow(bset
);
4572 isl_assert(bset
->ctx
, isl_space_compatible_internal(bset
->dim
, dim
),
4574 isl_space_free(bset
->dim
);
4575 bmap
= bset_to_bmap(bset
);
4577 return isl_basic_map_finalize(bmap
);
4579 isl_basic_set_free(bset
);
4580 isl_space_free(dim
);
4584 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4585 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*space
)
4587 return basic_map_from_basic_set(bset
, space
);
4590 /* For a div d = floor(f/m), add the constraint
4594 static int add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4595 unsigned pos
, isl_int
*div
)
4598 unsigned total
= isl_basic_map_total_dim(bmap
);
4600 i
= isl_basic_map_alloc_inequality(bmap
);
4603 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4604 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4609 /* For a div d = floor(f/m), add the constraint
4611 * -(f-(m-1)) + m d >= 0
4613 static int add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4614 unsigned pos
, isl_int
*div
)
4617 unsigned total
= isl_basic_map_total_dim(bmap
);
4619 i
= isl_basic_map_alloc_inequality(bmap
);
4622 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4623 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4624 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4625 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4630 /* For a div d = floor(f/m), add the constraints
4633 * -(f-(m-1)) + m d >= 0
4635 * Note that the second constraint is the negation of
4639 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4640 unsigned pos
, isl_int
*div
)
4642 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4644 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4649 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4650 unsigned pos
, isl_int
*div
)
4652 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
4656 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4658 unsigned total
= isl_basic_map_total_dim(bmap
);
4659 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4661 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4665 /* For each known div d = floor(f/m), add the constraints
4668 * -(f-(m-1)) + m d >= 0
4670 * Remove duplicate constraints in case of some these div constraints
4671 * already appear in "bmap".
4673 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
4674 __isl_take isl_basic_map
*bmap
)
4680 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4684 bmap
= add_known_div_constraints(bmap
);
4685 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
4686 bmap
= isl_basic_map_finalize(bmap
);
4690 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4692 * In particular, if this div is of the form d = floor(f/m),
4693 * then add the constraint
4697 * if sign < 0 or the constraint
4699 * -(f-(m-1)) + m d >= 0
4703 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4704 unsigned div
, int sign
)
4712 total
= isl_basic_map_total_dim(bmap
);
4713 div_pos
= total
- bmap
->n_div
+ div
;
4716 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4718 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4721 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4723 return isl_basic_map_add_div_constraints(bset
, div
);
4726 struct isl_basic_set
*isl_basic_map_underlying_set(
4727 struct isl_basic_map
*bmap
)
4731 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4733 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4734 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4735 return bset_from_bmap(bmap
);
4736 bmap
= isl_basic_map_cow(bmap
);
4739 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4742 bmap
->extra
-= bmap
->n_div
;
4744 bmap
= isl_basic_map_finalize(bmap
);
4745 return bset_from_bmap(bmap
);
4747 isl_basic_map_free(bmap
);
4751 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4752 __isl_take isl_basic_set
*bset
)
4754 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
4757 /* Replace each element in "list" by the result of applying
4758 * isl_basic_map_underlying_set to the element.
4760 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
4761 __isl_take isl_basic_map_list
*list
)
4768 n
= isl_basic_map_list_n_basic_map(list
);
4769 for (i
= 0; i
< n
; ++i
) {
4770 isl_basic_map
*bmap
;
4771 isl_basic_set
*bset
;
4773 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
4774 bset
= isl_basic_set_underlying_set(bmap
);
4775 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
4781 struct isl_basic_map
*isl_basic_map_overlying_set(
4782 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4784 struct isl_basic_map
*bmap
;
4785 struct isl_ctx
*ctx
;
4792 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4793 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4794 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4796 if (like
->n_div
== 0) {
4797 isl_space
*space
= isl_basic_map_get_space(like
);
4798 isl_basic_map_free(like
);
4799 return isl_basic_map_reset_space(bset
, space
);
4801 bset
= isl_basic_set_cow(bset
);
4804 total
= bset
->dim
->n_out
+ bset
->extra
;
4805 bmap
= bset_to_bmap(bset
);
4806 isl_space_free(bmap
->dim
);
4807 bmap
->dim
= isl_space_copy(like
->dim
);
4810 bmap
->n_div
= like
->n_div
;
4811 bmap
->extra
+= like
->n_div
;
4815 ltotal
= total
- bmap
->extra
+ like
->extra
;
4818 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4819 bmap
->extra
* (1 + 1 + total
));
4820 if (isl_blk_is_error(bmap
->block2
))
4822 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4826 for (i
= 0; i
< bmap
->extra
; ++i
)
4827 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4828 for (i
= 0; i
< like
->n_div
; ++i
) {
4829 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4830 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4832 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
4834 isl_basic_map_free(like
);
4835 bmap
= isl_basic_map_simplify(bmap
);
4836 bmap
= isl_basic_map_finalize(bmap
);
4839 isl_basic_map_free(like
);
4840 isl_basic_set_free(bset
);
4844 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4845 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4847 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
4848 bset_to_bmap(like
)));
4851 struct isl_set
*isl_set_from_underlying_set(
4852 struct isl_set
*set
, struct isl_basic_set
*like
)
4858 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4860 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4861 isl_basic_set_free(like
);
4864 set
= isl_set_cow(set
);
4867 for (i
= 0; i
< set
->n
; ++i
) {
4868 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4869 isl_basic_set_copy(like
));
4873 isl_space_free(set
->dim
);
4874 set
->dim
= isl_space_copy(like
->dim
);
4877 isl_basic_set_free(like
);
4880 isl_basic_set_free(like
);
4885 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4889 map
= isl_map_cow(map
);
4892 map
->dim
= isl_space_cow(map
->dim
);
4896 for (i
= 1; i
< map
->n
; ++i
)
4897 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4899 for (i
= 0; i
< map
->n
; ++i
) {
4900 map
->p
[i
] = bset_to_bmap(
4901 isl_basic_map_underlying_set(map
->p
[i
]));
4906 map
->dim
= isl_space_underlying(map
->dim
, 0);
4908 isl_space_free(map
->dim
);
4909 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4913 return set_from_map(map
);
4919 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4921 return set_from_map(isl_map_underlying_set(set_to_map(set
)));
4924 /* Replace the space of "bmap" by "space".
4926 * If the space of "bmap" is identical to "space" (including the identifiers
4927 * of the input and output dimensions), then simply return the original input.
4929 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4930 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
4936 equal
= isl_space_is_equal(bmap
->dim
, space
);
4937 if (equal
>= 0 && equal
)
4938 equal
= isl_space_match(bmap
->dim
, isl_dim_in
,
4940 if (equal
>= 0 && equal
)
4941 equal
= isl_space_match(bmap
->dim
, isl_dim_out
,
4942 space
, isl_dim_out
);
4946 isl_space_free(space
);
4949 bmap
= isl_basic_map_cow(bmap
);
4950 if (!bmap
|| !space
)
4953 isl_space_free(bmap
->dim
);
4956 bmap
= isl_basic_map_finalize(bmap
);
4960 isl_basic_map_free(bmap
);
4961 isl_space_free(space
);
4965 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4966 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4968 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
4972 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4973 __isl_take isl_space
*dim
)
4977 map
= isl_map_cow(map
);
4981 for (i
= 0; i
< map
->n
; ++i
) {
4982 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4983 isl_space_copy(dim
));
4987 isl_space_free(map
->dim
);
4993 isl_space_free(dim
);
4997 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4998 __isl_take isl_space
*dim
)
5000 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5003 /* Compute the parameter domain of the given basic set.
5005 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5010 if (isl_basic_set_is_params(bset
))
5013 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5014 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5015 space
= isl_basic_set_get_space(bset
);
5016 space
= isl_space_params(space
);
5017 bset
= isl_basic_set_reset_space(bset
, space
);
5021 /* Construct a zero-dimensional basic set with the given parameter domain.
5023 __isl_give isl_basic_set
*isl_basic_set_from_params(
5024 __isl_take isl_basic_set
*bset
)
5027 space
= isl_basic_set_get_space(bset
);
5028 space
= isl_space_set_from_params(space
);
5029 bset
= isl_basic_set_reset_space(bset
, space
);
5033 /* Compute the parameter domain of the given set.
5035 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5040 if (isl_set_is_params(set
))
5043 n
= isl_set_dim(set
, isl_dim_set
);
5044 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5045 space
= isl_set_get_space(set
);
5046 space
= isl_space_params(space
);
5047 set
= isl_set_reset_space(set
, space
);
5051 /* Construct a zero-dimensional set with the given parameter domain.
5053 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5056 space
= isl_set_get_space(set
);
5057 space
= isl_space_set_from_params(space
);
5058 set
= isl_set_reset_space(set
, space
);
5062 /* Compute the parameter domain of the given map.
5064 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5069 n
= isl_map_dim(map
, isl_dim_in
);
5070 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5071 n
= isl_map_dim(map
, isl_dim_out
);
5072 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5073 space
= isl_map_get_space(map
);
5074 space
= isl_space_params(space
);
5075 map
= isl_map_reset_space(map
, space
);
5079 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5086 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5088 n_out
= isl_basic_map_n_out(bmap
);
5089 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5091 return isl_basic_map_reset_space(bmap
, space
);
5094 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5098 return isl_space_may_be_set(bmap
->dim
);
5101 /* Is this basic map actually a set?
5102 * Users should never call this function. Outside of isl,
5103 * the type should indicate whether something is a set or a map.
5105 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5109 return isl_space_is_set(bmap
->dim
);
5112 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5116 if (isl_basic_map_is_set(bmap
))
5118 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5121 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5122 __isl_take isl_basic_map
*bmap
)
5126 isl_basic_map
*domain
;
5127 int nparam
, n_in
, n_out
;
5130 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5131 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5132 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5134 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5135 domain
= isl_basic_map_universe(dim
);
5137 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5138 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5139 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5141 total
= isl_basic_map_total_dim(bmap
);
5143 for (i
= 0; i
< n_in
; ++i
) {
5144 k
= isl_basic_map_alloc_equality(bmap
);
5147 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5148 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
5149 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5152 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5153 return isl_basic_map_finalize(bmap
);
5155 isl_basic_map_free(bmap
);
5159 __isl_give isl_basic_map
*isl_basic_map_range_map(
5160 __isl_take isl_basic_map
*bmap
)
5164 isl_basic_map
*range
;
5165 int nparam
, n_in
, n_out
;
5168 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5169 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5170 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5172 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5173 range
= isl_basic_map_universe(dim
);
5175 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5176 bmap
= isl_basic_map_apply_range(bmap
, range
);
5177 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5179 total
= isl_basic_map_total_dim(bmap
);
5181 for (i
= 0; i
< n_out
; ++i
) {
5182 k
= isl_basic_map_alloc_equality(bmap
);
5185 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5186 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
5187 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5190 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5191 return isl_basic_map_finalize(bmap
);
5193 isl_basic_map_free(bmap
);
5197 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5201 return isl_space_may_be_set(map
->dim
);
5204 /* Is this map actually a set?
5205 * Users should never call this function. Outside of isl,
5206 * the type should indicate whether something is a set or a map.
5208 int isl_map_is_set(__isl_keep isl_map
*map
)
5212 return isl_space_is_set(map
->dim
);
5215 struct isl_set
*isl_map_range(struct isl_map
*map
)
5218 struct isl_set
*set
;
5222 if (isl_map_is_set(map
))
5223 return set_from_map(map
);
5225 map
= isl_map_cow(map
);
5229 set
= set_from_map(map
);
5230 set
->dim
= isl_space_range(set
->dim
);
5233 for (i
= 0; i
< map
->n
; ++i
) {
5234 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5238 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5239 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5246 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5250 map
= isl_map_cow(map
);
5254 map
->dim
= isl_space_domain_map(map
->dim
);
5257 for (i
= 0; i
< map
->n
; ++i
) {
5258 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5262 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5263 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5270 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5273 isl_space
*range_dim
;
5275 map
= isl_map_cow(map
);
5279 range_dim
= isl_space_range(isl_map_get_space(map
));
5280 range_dim
= isl_space_from_range(range_dim
);
5281 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5282 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5285 for (i
= 0; i
< map
->n
; ++i
) {
5286 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5290 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5291 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5298 /* Given a wrapped map of the form A[B -> C],
5299 * return the map A[B -> C] -> B.
5301 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5308 if (!isl_set_has_tuple_id(set
))
5309 return isl_map_domain_map(isl_set_unwrap(set
));
5311 id
= isl_set_get_tuple_id(set
);
5312 map
= isl_map_domain_map(isl_set_unwrap(set
));
5313 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5318 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
5319 __isl_take isl_space
*dim
)
5322 struct isl_map
*map
= NULL
;
5324 set
= isl_set_cow(set
);
5327 isl_assert(set
->ctx
, isl_space_compatible_internal(set
->dim
, dim
),
5329 map
= set_to_map(set
);
5330 for (i
= 0; i
< set
->n
; ++i
) {
5331 map
->p
[i
] = basic_map_from_basic_set(
5332 set
->p
[i
], isl_space_copy(dim
));
5336 isl_space_free(map
->dim
);
5340 isl_space_free(dim
);
5345 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5346 __isl_take isl_basic_set
*bset
)
5348 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5351 __isl_give isl_basic_map
*isl_basic_map_from_range(
5352 __isl_take isl_basic_set
*bset
)
5355 space
= isl_basic_set_get_space(bset
);
5356 space
= isl_space_from_range(space
);
5357 bset
= isl_basic_set_reset_space(bset
, space
);
5358 return bset_to_bmap(bset
);
5361 /* Create a relation with the given set as range.
5362 * The domain of the created relation is a zero-dimensional
5363 * flat anonymous space.
5365 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5368 space
= isl_set_get_space(set
);
5369 space
= isl_space_from_range(space
);
5370 set
= isl_set_reset_space(set
, space
);
5371 return set_to_map(set
);
5374 /* Create a relation with the given set as domain.
5375 * The range of the created relation is a zero-dimensional
5376 * flat anonymous space.
5378 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5380 return isl_map_reverse(isl_map_from_range(set
));
5383 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5384 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5386 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5389 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5390 __isl_take isl_set
*range
)
5392 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5395 /* Return a newly allocated isl_map with given space and flags and
5396 * room for "n" basic maps.
5397 * Make sure that all cached information is cleared.
5399 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5402 struct isl_map
*map
;
5407 isl_die(space
->ctx
, isl_error_internal
,
5408 "negative number of basic maps", goto error
);
5409 map
= isl_calloc(space
->ctx
, struct isl_map
,
5410 sizeof(struct isl_map
) +
5411 (n
- 1) * sizeof(struct isl_basic_map
*));
5415 map
->ctx
= space
->ctx
;
5416 isl_ctx_ref(map
->ctx
);
5424 isl_space_free(space
);
5428 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5429 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5432 struct isl_map
*map
;
5435 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5439 map
= isl_map_alloc_space(dims
, n
, flags
);
5443 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5445 struct isl_basic_map
*bmap
;
5446 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5447 bmap
= isl_basic_map_set_to_empty(bmap
);
5451 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5453 struct isl_basic_set
*bset
;
5454 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5455 bset
= isl_basic_set_set_to_empty(bset
);
5459 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5461 struct isl_basic_map
*bmap
;
5462 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5463 bmap
= isl_basic_map_finalize(bmap
);
5467 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5469 struct isl_basic_set
*bset
;
5470 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5471 bset
= isl_basic_set_finalize(bset
);
5475 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5478 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5479 isl_basic_map
*bmap
;
5481 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5482 for (i
= 0; i
< total
; ++i
) {
5483 int k
= isl_basic_map_alloc_inequality(bmap
);
5486 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5487 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5491 isl_basic_map_free(bmap
);
5495 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5497 return isl_basic_map_nat_universe(dim
);
5500 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5502 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5505 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5507 return isl_map_nat_universe(dim
);
5510 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5512 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5515 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5517 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5520 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5522 struct isl_map
*map
;
5525 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5526 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5530 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5532 struct isl_set
*set
;
5535 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5536 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5540 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5543 struct isl_map
*dup
;
5547 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5548 for (i
= 0; i
< map
->n
; ++i
)
5549 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5553 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5554 __isl_take isl_basic_map
*bmap
)
5558 if (isl_basic_map_plain_is_empty(bmap
)) {
5559 isl_basic_map_free(bmap
);
5562 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5563 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5564 map
->p
[map
->n
] = bmap
;
5566 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5572 isl_basic_map_free(bmap
);
5576 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
5587 isl_ctx_deref(map
->ctx
);
5588 for (i
= 0; i
< map
->n
; ++i
)
5589 isl_basic_map_free(map
->p
[i
]);
5590 isl_space_free(map
->dim
);
5596 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5597 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5601 bmap
= isl_basic_map_cow(bmap
);
5602 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5603 j
= isl_basic_map_alloc_equality(bmap
);
5606 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5607 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5608 isl_int_set_si(bmap
->eq
[j
][0], value
);
5609 bmap
= isl_basic_map_simplify(bmap
);
5610 return isl_basic_map_finalize(bmap
);
5612 isl_basic_map_free(bmap
);
5616 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5617 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5621 bmap
= isl_basic_map_cow(bmap
);
5622 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5623 j
= isl_basic_map_alloc_equality(bmap
);
5626 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5627 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5628 isl_int_set(bmap
->eq
[j
][0], value
);
5629 bmap
= isl_basic_map_simplify(bmap
);
5630 return isl_basic_map_finalize(bmap
);
5632 isl_basic_map_free(bmap
);
5636 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5637 enum isl_dim_type type
, unsigned pos
, int value
)
5641 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5642 return isl_basic_map_fix_pos_si(bmap
,
5643 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5645 isl_basic_map_free(bmap
);
5649 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5650 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5654 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5655 return isl_basic_map_fix_pos(bmap
,
5656 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5658 isl_basic_map_free(bmap
);
5662 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5663 * to be equal to "v".
5665 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5666 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5670 if (!isl_val_is_int(v
))
5671 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5672 "expecting integer value", goto error
);
5673 if (pos
>= isl_basic_map_dim(bmap
, type
))
5674 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5675 "index out of bounds", goto error
);
5676 pos
+= isl_basic_map_offset(bmap
, type
);
5677 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5681 isl_basic_map_free(bmap
);
5686 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5687 * to be equal to "v".
5689 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5690 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5692 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5695 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5696 enum isl_dim_type type
, unsigned pos
, int value
)
5698 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
5702 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5703 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5705 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
5709 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5710 unsigned input
, int value
)
5712 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5715 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5716 unsigned dim
, int value
)
5718 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
5719 isl_dim_set
, dim
, value
));
5722 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5724 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5731 isl_basic_map_free(map
->p
[i
]);
5732 if (i
!= map
->n
- 1) {
5733 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5734 map
->p
[i
] = map
->p
[map
->n
- 1];
5741 /* Perform "fn" on each basic map of "map", where we may not be holding
5742 * the only reference to "map".
5743 * In particular, "fn" should be a semantics preserving operation
5744 * that we want to apply to all copies of "map". We therefore need
5745 * to be careful not to modify "map" in a way that breaks "map"
5746 * in case anything goes wrong.
5748 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5749 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5751 struct isl_basic_map
*bmap
;
5757 for (i
= map
->n
- 1; i
>= 0; --i
) {
5758 bmap
= isl_basic_map_copy(map
->p
[i
]);
5762 isl_basic_map_free(map
->p
[i
]);
5764 if (remove_if_empty(map
, i
) < 0)
5774 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5775 enum isl_dim_type type
, unsigned pos
, int value
)
5779 map
= isl_map_cow(map
);
5783 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5784 for (i
= map
->n
- 1; i
>= 0; --i
) {
5785 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5786 if (remove_if_empty(map
, i
) < 0)
5789 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5796 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5797 enum isl_dim_type type
, unsigned pos
, int value
)
5799 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
5802 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5803 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5807 map
= isl_map_cow(map
);
5811 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5812 for (i
= 0; i
< map
->n
; ++i
) {
5813 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5817 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5824 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5825 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5827 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
5830 /* Fix the value of the variable at position "pos" of type "type" of "map"
5831 * to be equal to "v".
5833 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5834 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5838 map
= isl_map_cow(map
);
5842 if (!isl_val_is_int(v
))
5843 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5844 "expecting integer value", goto error
);
5845 if (pos
>= isl_map_dim(map
, type
))
5846 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5847 "index out of bounds", goto error
);
5848 for (i
= map
->n
- 1; i
>= 0; --i
) {
5849 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5851 if (remove_if_empty(map
, i
) < 0)
5854 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5863 /* Fix the value of the variable at position "pos" of type "type" of "set"
5864 * to be equal to "v".
5866 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5867 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5869 return isl_map_fix_val(set
, type
, pos
, v
);
5872 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5873 unsigned input
, int value
)
5875 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5878 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5880 return set_from_map(isl_map_fix_si(set_to_map(set
),
5881 isl_dim_set
, dim
, value
));
5884 static __isl_give isl_basic_map
*basic_map_bound_si(
5885 __isl_take isl_basic_map
*bmap
,
5886 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5892 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5893 pos
+= isl_basic_map_offset(bmap
, type
);
5894 bmap
= isl_basic_map_cow(bmap
);
5895 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5896 j
= isl_basic_map_alloc_inequality(bmap
);
5899 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5901 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5902 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5904 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5905 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5907 bmap
= isl_basic_map_simplify(bmap
);
5908 return isl_basic_map_finalize(bmap
);
5910 isl_basic_map_free(bmap
);
5914 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5915 __isl_take isl_basic_map
*bmap
,
5916 enum isl_dim_type type
, unsigned pos
, int value
)
5918 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5921 /* Constrain the values of the given dimension to be no greater than "value".
5923 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5924 __isl_take isl_basic_map
*bmap
,
5925 enum isl_dim_type type
, unsigned pos
, int value
)
5927 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5930 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5931 unsigned dim
, isl_int value
)
5935 bset
= isl_basic_set_cow(bset
);
5936 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5937 j
= isl_basic_set_alloc_inequality(bset
);
5940 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5941 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5942 isl_int_neg(bset
->ineq
[j
][0], value
);
5943 bset
= isl_basic_set_simplify(bset
);
5944 return isl_basic_set_finalize(bset
);
5946 isl_basic_set_free(bset
);
5950 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5951 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5955 map
= isl_map_cow(map
);
5959 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5960 for (i
= 0; i
< map
->n
; ++i
) {
5961 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5962 type
, pos
, value
, upper
);
5966 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5973 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5974 enum isl_dim_type type
, unsigned pos
, int value
)
5976 return map_bound_si(map
, type
, pos
, value
, 0);
5979 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5980 enum isl_dim_type type
, unsigned pos
, int value
)
5982 return map_bound_si(map
, type
, pos
, value
, 1);
5985 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5986 enum isl_dim_type type
, unsigned pos
, int value
)
5988 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
5992 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5993 enum isl_dim_type type
, unsigned pos
, int value
)
5995 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5998 /* Bound the given variable of "bmap" from below (or above is "upper"
5999 * is set) to "value".
6001 static __isl_give isl_basic_map
*basic_map_bound(
6002 __isl_take isl_basic_map
*bmap
,
6003 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6009 if (pos
>= isl_basic_map_dim(bmap
, type
))
6010 isl_die(bmap
->ctx
, isl_error_invalid
,
6011 "index out of bounds", goto error
);
6012 pos
+= isl_basic_map_offset(bmap
, type
);
6013 bmap
= isl_basic_map_cow(bmap
);
6014 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6015 j
= isl_basic_map_alloc_inequality(bmap
);
6018 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6020 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6021 isl_int_set(bmap
->ineq
[j
][0], value
);
6023 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6024 isl_int_neg(bmap
->ineq
[j
][0], value
);
6026 bmap
= isl_basic_map_simplify(bmap
);
6027 return isl_basic_map_finalize(bmap
);
6029 isl_basic_map_free(bmap
);
6033 /* Bound the given variable of "map" from below (or above is "upper"
6034 * is set) to "value".
6036 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6037 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6041 map
= isl_map_cow(map
);
6045 if (pos
>= isl_map_dim(map
, type
))
6046 isl_die(map
->ctx
, isl_error_invalid
,
6047 "index out of bounds", goto error
);
6048 for (i
= map
->n
- 1; i
>= 0; --i
) {
6049 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6050 if (remove_if_empty(map
, i
) < 0)
6053 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6060 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6061 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6063 return map_bound(map
, type
, pos
, value
, 0);
6066 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6067 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6069 return map_bound(map
, type
, pos
, value
, 1);
6072 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6073 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6075 return isl_map_lower_bound(set
, type
, pos
, value
);
6078 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6079 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6081 return isl_map_upper_bound(set
, type
, pos
, value
);
6084 /* Force the values of the variable at position "pos" of type "type" of "set"
6085 * to be no smaller than "value".
6087 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6088 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6092 if (!isl_val_is_int(value
))
6093 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6094 "expecting integer value", goto error
);
6095 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6096 isl_val_free(value
);
6099 isl_val_free(value
);
6104 /* Force the values of the variable at position "pos" of type "type" of "set"
6105 * to be no greater than "value".
6107 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6108 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6112 if (!isl_val_is_int(value
))
6113 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6114 "expecting integer value", goto error
);
6115 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6116 isl_val_free(value
);
6119 isl_val_free(value
);
6124 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
6129 set
= isl_set_cow(set
);
6133 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
6134 for (i
= 0; i
< set
->n
; ++i
) {
6135 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
6145 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
6149 map
= isl_map_cow(map
);
6153 map
->dim
= isl_space_reverse(map
->dim
);
6156 for (i
= 0; i
< map
->n
; ++i
) {
6157 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6161 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6169 #define TYPE isl_pw_multi_aff
6171 #define SUFFIX _pw_multi_aff
6173 #define EMPTY isl_pw_multi_aff_empty
6175 #define ADD isl_pw_multi_aff_union_add
6176 #include "isl_map_lexopt_templ.c"
6178 /* Given a map "map", compute the lexicographically minimal
6179 * (or maximal) image element for each domain element in dom,
6180 * in the form of an isl_pw_multi_aff.
6181 * If "empty" is not NULL, then set *empty to those elements in dom that
6182 * do not have an image element.
6183 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6184 * should be computed over the domain of "map". "empty" is also NULL
6187 * We first compute the lexicographically minimal or maximal element
6188 * in the first basic map. This results in a partial solution "res"
6189 * and a subset "todo" of dom that still need to be handled.
6190 * We then consider each of the remaining maps in "map" and successively
6191 * update both "res" and "todo".
6192 * If "empty" is NULL, then the todo sets are not needed and therefore
6193 * also not computed.
6195 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6196 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6197 __isl_give isl_set
**empty
, unsigned flags
)
6201 isl_pw_multi_aff
*res
;
6204 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6205 if (!map
|| (!full
&& !dom
))
6208 if (isl_map_plain_is_empty(map
)) {
6213 return isl_pw_multi_aff_from_map(map
);
6216 res
= basic_map_partial_lexopt_pw_multi_aff(
6217 isl_basic_map_copy(map
->p
[0]),
6218 isl_set_copy(dom
), empty
, flags
);
6222 for (i
= 1; i
< map
->n
; ++i
) {
6223 isl_pw_multi_aff
*res_i
;
6225 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6226 isl_basic_map_copy(map
->p
[i
]),
6227 isl_set_copy(dom
), empty
, flags
);
6229 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6230 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6232 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6235 todo
= isl_set_intersect(todo
, *empty
);
6254 #define TYPE isl_map
6258 #define EMPTY isl_map_empty
6260 #define ADD isl_map_union_disjoint
6261 #include "isl_map_lexopt_templ.c"
6263 /* Given a map "map", compute the lexicographically minimal
6264 * (or maximal) image element for each domain element in "dom",
6265 * in the form of an isl_map.
6266 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6267 * do not have an image element.
6268 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6269 * should be computed over the domain of "map". "empty" is also NULL
6272 * If the input consists of more than one disjunct, then first
6273 * compute the desired result in the form of an isl_pw_multi_aff and
6274 * then convert that into an isl_map.
6276 * This function used to have an explicit implementation in terms
6277 * of isl_maps, but it would continually intersect the domains of
6278 * partial results with the complement of the domain of the next
6279 * partial solution, potentially leading to an explosion in the number
6280 * of disjuncts if there are several disjuncts in the input.
6281 * An even earlier implementation of this function would look for
6282 * better results in the domain of the partial result and for extra
6283 * results in the complement of this domain, which would lead to
6284 * even more splintering.
6286 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6287 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6288 __isl_give isl_set
**empty
, unsigned flags
)
6291 struct isl_map
*res
;
6292 isl_pw_multi_aff
*pma
;
6294 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6295 if (!map
|| (!full
&& !dom
))
6298 if (isl_map_plain_is_empty(map
)) {
6307 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6313 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6315 return isl_map_from_pw_multi_aff(pma
);
6324 __isl_give isl_map
*isl_map_partial_lexmax(
6325 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6326 __isl_give isl_set
**empty
)
6328 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6331 __isl_give isl_map
*isl_map_partial_lexmin(
6332 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6333 __isl_give isl_set
**empty
)
6335 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6338 __isl_give isl_set
*isl_set_partial_lexmin(
6339 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6340 __isl_give isl_set
**empty
)
6342 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6346 __isl_give isl_set
*isl_set_partial_lexmax(
6347 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6348 __isl_give isl_set
**empty
)
6350 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6354 /* Compute the lexicographic minimum (or maximum if "flags" includes
6355 * ISL_OPT_MAX) of "bset" over its parametric domain.
6357 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6360 return isl_basic_map_lexopt(bset
, flags
);
6363 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6365 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6368 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6370 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6373 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6375 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6378 /* Compute the lexicographic minimum of "bset" over its parametric domain
6379 * for the purpose of quantifier elimination.
6380 * That is, find an explicit representation for all the existentially
6381 * quantified variables in "bset" by computing their lexicographic
6384 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6385 __isl_take isl_basic_set
*bset
)
6387 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6390 /* Extract the first and only affine expression from list
6391 * and then add it to *pwaff with the given dom.
6392 * This domain is known to be disjoint from other domains
6393 * because of the way isl_basic_map_foreach_lexmax works.
6395 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6396 __isl_take isl_aff_list
*list
, void *user
)
6398 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6400 isl_pw_aff
**pwaff
= user
;
6401 isl_pw_aff
*pwaff_i
;
6405 if (isl_aff_list_n_aff(list
) != 1)
6406 isl_die(ctx
, isl_error_internal
,
6407 "expecting single element list", goto error
);
6409 aff
= isl_aff_list_get_aff(list
, 0);
6410 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6412 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6414 isl_aff_list_free(list
);
6418 isl_basic_set_free(dom
);
6419 isl_aff_list_free(list
);
6423 /* Given a basic map with one output dimension, compute the minimum or
6424 * maximum of that dimension as an isl_pw_aff.
6426 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6427 * call update_dim_opt on each leaf of the result.
6429 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6432 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6436 dim
= isl_space_from_domain(isl_space_domain(dim
));
6437 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6438 pwaff
= isl_pw_aff_empty(dim
);
6440 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6442 return isl_pw_aff_free(pwaff
);
6447 /* Compute the minimum or maximum of the given output dimension
6448 * as a function of the parameters and the input dimensions,
6449 * but independently of the other output dimensions.
6451 * We first project out the other output dimension and then compute
6452 * the "lexicographic" maximum in each basic map, combining the results
6453 * using isl_pw_aff_union_max.
6455 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6462 n_out
= isl_map_dim(map
, isl_dim_out
);
6463 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6464 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6469 isl_space
*dim
= isl_map_get_space(map
);
6471 return isl_pw_aff_empty(dim
);
6474 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6475 for (i
= 1; i
< map
->n
; ++i
) {
6476 isl_pw_aff
*pwaff_i
;
6478 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6479 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6487 /* Compute the minimum of the given output dimension as a function of the
6488 * parameters and input dimensions, but independently of
6489 * the other output dimensions.
6491 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6493 return map_dim_opt(map
, pos
, 0);
6496 /* Compute the maximum of the given output dimension as a function of the
6497 * parameters and input dimensions, but independently of
6498 * the other output dimensions.
6500 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6502 return map_dim_opt(map
, pos
, 1);
6505 /* Compute the minimum or maximum of the given set dimension
6506 * as a function of the parameters,
6507 * but independently of the other set dimensions.
6509 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6512 return map_dim_opt(set
, pos
, max
);
6515 /* Compute the maximum of the given set dimension as a function of the
6516 * parameters, but independently of the other set dimensions.
6518 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6520 return set_dim_opt(set
, pos
, 1);
6523 /* Compute the minimum of the given set dimension as a function of the
6524 * parameters, but independently of the other set dimensions.
6526 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6528 return set_dim_opt(set
, pos
, 0);
6531 /* Apply a preimage specified by "mat" on the parameters of "bset".
6532 * bset is assumed to have only parameters and divs.
6534 static struct isl_basic_set
*basic_set_parameter_preimage(
6535 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6542 bset
->dim
= isl_space_cow(bset
->dim
);
6546 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6548 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6550 bset
->dim
->nparam
= 0;
6551 bset
->dim
->n_out
= nparam
;
6552 bset
= isl_basic_set_preimage(bset
, mat
);
6554 bset
->dim
->nparam
= bset
->dim
->n_out
;
6555 bset
->dim
->n_out
= 0;
6560 isl_basic_set_free(bset
);
6564 /* Apply a preimage specified by "mat" on the parameters of "set".
6565 * set is assumed to have only parameters and divs.
6567 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6568 __isl_take isl_mat
*mat
)
6576 nparam
= isl_set_dim(set
, isl_dim_param
);
6578 if (mat
->n_row
!= 1 + nparam
)
6579 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6580 "unexpected number of rows", goto error
);
6582 space
= isl_set_get_space(set
);
6583 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
6584 isl_dim_param
, 0, nparam
);
6585 set
= isl_set_reset_space(set
, space
);
6586 set
= isl_set_preimage(set
, mat
);
6587 nparam
= isl_set_dim(set
, isl_dim_out
);
6588 space
= isl_set_get_space(set
);
6589 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
6590 isl_dim_out
, 0, nparam
);
6591 set
= isl_set_reset_space(set
, space
);
6599 /* Intersect the basic set "bset" with the affine space specified by the
6600 * equalities in "eq".
6602 static struct isl_basic_set
*basic_set_append_equalities(
6603 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6611 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6616 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6617 for (i
= 0; i
< eq
->n_row
; ++i
) {
6618 k
= isl_basic_set_alloc_equality(bset
);
6621 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6622 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6626 bset
= isl_basic_set_gauss(bset
, NULL
);
6627 bset
= isl_basic_set_finalize(bset
);
6632 isl_basic_set_free(bset
);
6636 /* Intersect the set "set" with the affine space specified by the
6637 * equalities in "eq".
6639 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6647 for (i
= 0; i
< set
->n
; ++i
) {
6648 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6661 /* Given a basic set "bset" that only involves parameters and existentially
6662 * quantified variables, return the index of the first equality
6663 * that only involves parameters. If there is no such equality then
6664 * return bset->n_eq.
6666 * This function assumes that isl_basic_set_gauss has been called on "bset".
6668 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6671 unsigned nparam
, n_div
;
6676 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6677 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6679 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6680 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6687 /* Compute an explicit representation for the existentially quantified
6688 * variables in "bset" by computing the "minimal value" of the set
6689 * variables. Since there are no set variables, the computation of
6690 * the minimal value essentially computes an explicit representation
6691 * of the non-empty part(s) of "bset".
6693 * The input only involves parameters and existentially quantified variables.
6694 * All equalities among parameters have been removed.
6696 * Since the existentially quantified variables in the result are in general
6697 * going to be different from those in the input, we first replace
6698 * them by the minimal number of variables based on their equalities.
6699 * This should simplify the parametric integer programming.
6701 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6703 isl_morph
*morph1
, *morph2
;
6709 if (bset
->n_eq
== 0)
6710 return isl_basic_set_lexmin_compute_divs(bset
);
6712 morph1
= isl_basic_set_parameter_compression(bset
);
6713 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6714 bset
= isl_basic_set_lift(bset
);
6715 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6716 bset
= isl_morph_basic_set(morph2
, bset
);
6717 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6718 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6720 set
= isl_basic_set_lexmin_compute_divs(bset
);
6722 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6727 /* Project the given basic set onto its parameter domain, possibly introducing
6728 * new, explicit, existential variables in the constraints.
6729 * The input has parameters and (possibly implicit) existential variables.
6730 * The output has the same parameters, but only
6731 * explicit existentially quantified variables.
6733 * The actual projection is performed by pip, but pip doesn't seem
6734 * to like equalities very much, so we first remove the equalities
6735 * among the parameters by performing a variable compression on
6736 * the parameters. Afterward, an inverse transformation is performed
6737 * and the equalities among the parameters are inserted back in.
6739 * The variable compression on the parameters may uncover additional
6740 * equalities that were only implicit before. We therefore check
6741 * if there are any new parameter equalities in the result and
6742 * if so recurse. The removal of parameter equalities is required
6743 * for the parameter compression performed by base_compute_divs.
6745 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6749 struct isl_mat
*T
, *T2
;
6750 struct isl_set
*set
;
6753 bset
= isl_basic_set_cow(bset
);
6757 if (bset
->n_eq
== 0)
6758 return base_compute_divs(bset
);
6760 bset
= isl_basic_set_gauss(bset
, NULL
);
6763 if (isl_basic_set_plain_is_empty(bset
))
6764 return isl_set_from_basic_set(bset
);
6766 i
= first_parameter_equality(bset
);
6767 if (i
== bset
->n_eq
)
6768 return base_compute_divs(bset
);
6770 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6771 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6773 eq
= isl_mat_cow(eq
);
6774 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6775 if (T
&& T
->n_col
== 0) {
6779 bset
= isl_basic_set_set_to_empty(bset
);
6780 return isl_set_from_basic_set(bset
);
6782 bset
= basic_set_parameter_preimage(bset
, T
);
6784 i
= first_parameter_equality(bset
);
6787 else if (i
== bset
->n_eq
)
6788 set
= base_compute_divs(bset
);
6790 set
= parameter_compute_divs(bset
);
6791 set
= set_parameter_preimage(set
, T2
);
6792 set
= set_append_equalities(set
, eq
);
6796 /* Insert the divs from "ls" before those of "bmap".
6798 * The number of columns is not changed, which means that the last
6799 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6800 * The caller is responsible for removing the same number of dimensions
6801 * from the space of "bmap".
6803 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6804 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6810 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6814 old_n_div
= bmap
->n_div
;
6815 bmap
= insert_div_rows(bmap
, n_div
);
6819 for (i
= 0; i
< n_div
; ++i
) {
6820 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6821 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6827 /* Replace the space of "bmap" by the space and divs of "ls".
6829 * If "ls" has any divs, then we simplify the result since we may
6830 * have discovered some additional equalities that could simplify
6831 * the div expressions.
6833 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6834 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6838 bmap
= isl_basic_map_cow(bmap
);
6842 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6843 bmap
= insert_divs_from_local_space(bmap
, ls
);
6847 isl_space_free(bmap
->dim
);
6848 bmap
->dim
= isl_local_space_get_space(ls
);
6852 isl_local_space_free(ls
);
6854 bmap
= isl_basic_map_simplify(bmap
);
6855 bmap
= isl_basic_map_finalize(bmap
);
6858 isl_basic_map_free(bmap
);
6859 isl_local_space_free(ls
);
6863 /* Replace the space of "map" by the space and divs of "ls".
6865 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6866 __isl_take isl_local_space
*ls
)
6870 map
= isl_map_cow(map
);
6874 for (i
= 0; i
< map
->n
; ++i
) {
6875 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6876 isl_local_space_copy(ls
));
6880 isl_space_free(map
->dim
);
6881 map
->dim
= isl_local_space_get_space(ls
);
6885 isl_local_space_free(ls
);
6888 isl_local_space_free(ls
);
6893 /* Compute an explicit representation for the existentially
6894 * quantified variables for which do not know any explicit representation yet.
6896 * We first sort the existentially quantified variables so that the
6897 * existentially quantified variables for which we already have an explicit
6898 * representation are placed before those for which we do not.
6899 * The input dimensions, the output dimensions and the existentially
6900 * quantified variables for which we already have an explicit
6901 * representation are then turned into parameters.
6902 * compute_divs returns a map with the same parameters and
6903 * no input or output dimensions and the dimension specification
6904 * is reset to that of the input, including the existentially quantified
6905 * variables for which we already had an explicit representation.
6907 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6909 struct isl_basic_set
*bset
;
6910 struct isl_set
*set
;
6911 struct isl_map
*map
;
6913 isl_local_space
*ls
;
6920 bmap
= isl_basic_map_sort_divs(bmap
);
6921 bmap
= isl_basic_map_cow(bmap
);
6925 n_known
= isl_basic_map_first_unknown_div(bmap
);
6927 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
6929 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6930 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6931 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6932 dim
= isl_space_set_alloc(bmap
->ctx
,
6933 nparam
+ n_in
+ n_out
+ n_known
, 0);
6937 ls
= isl_basic_map_get_local_space(bmap
);
6938 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6939 n_known
, bmap
->n_div
- n_known
);
6941 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6942 swap_div(bmap
, i
- n_known
, i
);
6943 bmap
->n_div
-= n_known
;
6944 bmap
->extra
-= n_known
;
6946 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6947 bset
= bset_from_bmap(bmap
);
6949 set
= parameter_compute_divs(bset
);
6950 map
= set_to_map(set
);
6951 map
= replace_space_by_local_space(map
, ls
);
6955 isl_basic_map_free(bmap
);
6959 /* Remove the explicit representation of local variable "div",
6962 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
6963 __isl_take isl_basic_map
*bmap
, int div
)
6967 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
6969 return isl_basic_map_free(bmap
);
6973 bmap
= isl_basic_map_cow(bmap
);
6976 isl_int_set_si(bmap
->div
[div
][0], 0);
6980 /* Is local variable "div" of "bmap" marked as not having an explicit
6982 * Note that even if "div" is not marked in this way and therefore
6983 * has an explicit representation, this representation may still
6984 * depend (indirectly) on other local variables that do not
6985 * have an explicit representation.
6987 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
6991 return isl_bool_error
;
6992 if (div
< 0 || div
>= isl_basic_map_dim(bmap
, isl_dim_div
))
6993 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6994 "position out of bounds", return isl_bool_error
);
6995 return isl_int_is_zero(bmap
->div
[div
][0]);
6998 /* Return the position of the first local variable that does not
6999 * have an explicit representation.
7000 * Return the total number of local variables if they all have
7001 * an explicit representation.
7002 * Return -1 on error.
7004 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7011 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7012 if (!isl_basic_map_div_is_known(bmap
, i
))
7018 /* Return the position of the first local variable that does not
7019 * have an explicit representation.
7020 * Return the total number of local variables if they all have
7021 * an explicit representation.
7022 * Return -1 on error.
7024 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7026 return isl_basic_map_first_unknown_div(bset
);
7029 /* Does "bmap" have an explicit representation for all local variables?
7031 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7035 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7036 first
= isl_basic_map_first_unknown_div(bmap
);
7038 return isl_bool_error
;
7042 /* Do all basic maps in "map" have an explicit representation
7043 * for all local variables?
7045 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7050 return isl_bool_error
;
7052 for (i
= 0; i
< map
->n
; ++i
) {
7053 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7058 return isl_bool_true
;
7061 /* If bmap contains any unknown divs, then compute explicit
7062 * expressions for them. However, this computation may be
7063 * quite expensive, so first try to remove divs that aren't
7066 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
7069 struct isl_map
*map
;
7071 known
= isl_basic_map_divs_known(bmap
);
7075 return isl_map_from_basic_map(bmap
);
7077 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7079 known
= isl_basic_map_divs_known(bmap
);
7083 return isl_map_from_basic_map(bmap
);
7085 map
= compute_divs(bmap
);
7088 isl_basic_map_free(bmap
);
7092 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7096 struct isl_map
*res
;
7103 known
= isl_map_divs_known(map
);
7111 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7112 for (i
= 1 ; i
< map
->n
; ++i
) {
7114 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7115 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7116 res
= isl_map_union_disjoint(res
, r2
);
7118 res
= isl_map_union(res
, r2
);
7125 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7127 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7130 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7132 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7135 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7138 struct isl_set
*set
;
7143 map
= isl_map_cow(map
);
7147 set
= set_from_map(map
);
7148 set
->dim
= isl_space_domain(set
->dim
);
7151 for (i
= 0; i
< map
->n
; ++i
) {
7152 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7156 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7157 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7164 /* Return the union of "map1" and "map2", where we assume for now that
7165 * "map1" and "map2" are disjoint. Note that the basic maps inside
7166 * "map1" or "map2" may not be disjoint from each other.
7167 * Also note that this function is also called from isl_map_union,
7168 * which takes care of handling the situation where "map1" and "map2"
7169 * may not be disjoint.
7171 * If one of the inputs is empty, we can simply return the other input.
7172 * Similarly, if one of the inputs is universal, then it is equal to the union.
7174 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7175 __isl_take isl_map
*map2
)
7179 struct isl_map
*map
= NULL
;
7185 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7186 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7187 "spaces don't match", goto error
);
7198 is_universe
= isl_map_plain_is_universe(map1
);
7199 if (is_universe
< 0)
7206 is_universe
= isl_map_plain_is_universe(map2
);
7207 if (is_universe
< 0)
7214 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7215 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7216 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7218 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7219 map1
->n
+ map2
->n
, flags
);
7222 for (i
= 0; i
< map1
->n
; ++i
) {
7223 map
= isl_map_add_basic_map(map
,
7224 isl_basic_map_copy(map1
->p
[i
]));
7228 for (i
= 0; i
< map2
->n
; ++i
) {
7229 map
= isl_map_add_basic_map(map
,
7230 isl_basic_map_copy(map2
->p
[i
]));
7244 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7245 * guaranteed to be disjoint by the caller.
7247 * Note that this functions is called from within isl_map_make_disjoint,
7248 * so we have to be careful not to touch the constraints of the inputs
7251 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7252 __isl_take isl_map
*map2
)
7254 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7257 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7258 * not be disjoint. The parameters are assumed to have been aligned.
7260 * We currently simply call map_union_disjoint, the internal operation
7261 * of which does not really depend on the inputs being disjoint.
7262 * If the result contains more than one basic map, then we clear
7263 * the disjoint flag since the result may contain basic maps from
7264 * both inputs and these are not guaranteed to be disjoint.
7266 * As a special case, if "map1" and "map2" are obviously equal,
7267 * then we simply return "map1".
7269 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7270 __isl_take isl_map
*map2
)
7277 equal
= isl_map_plain_is_equal(map1
, map2
);
7285 map1
= map_union_disjoint(map1
, map2
);
7289 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7297 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7300 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7301 __isl_take isl_map
*map2
)
7303 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7306 struct isl_set
*isl_set_union_disjoint(
7307 struct isl_set
*set1
, struct isl_set
*set2
)
7309 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7313 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7315 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7318 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7321 * "map" and "set" are assumed to be compatible and non-NULL.
7323 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7324 __isl_take isl_set
*set
,
7325 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7326 __isl_take isl_basic_set
*bset
))
7329 struct isl_map
*result
;
7332 if (isl_set_plain_is_universe(set
)) {
7337 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7338 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7339 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7341 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7342 map
->n
* set
->n
, flags
);
7343 for (i
= 0; result
&& i
< map
->n
; ++i
)
7344 for (j
= 0; j
< set
->n
; ++j
) {
7345 result
= isl_map_add_basic_map(result
,
7346 fn(isl_basic_map_copy(map
->p
[i
]),
7347 isl_basic_set_copy(set
->p
[j
])));
7357 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7358 __isl_take isl_set
*set
)
7363 if (!isl_map_compatible_range(map
, set
))
7364 isl_die(set
->ctx
, isl_error_invalid
,
7365 "incompatible spaces", goto error
);
7367 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7374 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7375 __isl_take isl_set
*set
)
7377 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7380 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7381 __isl_take isl_set
*set
)
7386 if (!isl_map_compatible_domain(map
, set
))
7387 isl_die(set
->ctx
, isl_error_invalid
,
7388 "incompatible spaces", goto error
);
7390 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7397 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7398 __isl_take isl_set
*set
)
7400 return isl_map_align_params_map_map_and(map
, set
,
7401 &map_intersect_domain
);
7404 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7405 __isl_take isl_map
*map2
)
7409 map1
= isl_map_reverse(map1
);
7410 map1
= isl_map_apply_range(map1
, map2
);
7411 return isl_map_reverse(map1
);
7418 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7419 __isl_take isl_map
*map2
)
7421 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7424 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7425 __isl_take isl_map
*map2
)
7427 isl_space
*dim_result
;
7428 struct isl_map
*result
;
7434 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7435 isl_space_copy(map2
->dim
));
7437 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7440 for (i
= 0; i
< map1
->n
; ++i
)
7441 for (j
= 0; j
< map2
->n
; ++j
) {
7442 result
= isl_map_add_basic_map(result
,
7443 isl_basic_map_apply_range(
7444 isl_basic_map_copy(map1
->p
[i
]),
7445 isl_basic_map_copy(map2
->p
[j
])));
7451 if (result
&& result
->n
<= 1)
7452 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7460 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7461 __isl_take isl_map
*map2
)
7463 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7467 * returns range - domain
7469 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7471 isl_space
*target_space
;
7472 struct isl_basic_set
*bset
;
7479 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7480 bmap
->dim
, isl_dim_out
),
7482 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7483 dim
= isl_basic_map_n_in(bmap
);
7484 nparam
= isl_basic_map_n_param(bmap
);
7485 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7486 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7487 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7488 for (i
= 0; i
< dim
; ++i
) {
7489 int j
= isl_basic_map_alloc_equality(bmap
);
7491 bmap
= isl_basic_map_free(bmap
);
7494 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7495 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7496 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7497 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7499 bset
= isl_basic_map_domain(bmap
);
7500 bset
= isl_basic_set_reset_space(bset
, target_space
);
7503 isl_basic_map_free(bmap
);
7508 * returns range - domain
7510 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7514 struct isl_set
*result
;
7519 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7520 map
->dim
, isl_dim_out
),
7522 dim
= isl_map_get_space(map
);
7523 dim
= isl_space_domain(dim
);
7524 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7527 for (i
= 0; i
< map
->n
; ++i
)
7528 result
= isl_set_add_basic_set(result
,
7529 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7538 * returns [domain -> range] -> range - domain
7540 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7541 __isl_take isl_basic_map
*bmap
)
7545 isl_basic_map
*domain
;
7549 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7550 bmap
->dim
, isl_dim_out
))
7551 isl_die(bmap
->ctx
, isl_error_invalid
,
7552 "domain and range don't match", goto error
);
7554 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7555 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7557 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7558 domain
= isl_basic_map_universe(dim
);
7560 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7561 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7562 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7564 total
= isl_basic_map_total_dim(bmap
);
7566 for (i
= 0; i
< n
; ++i
) {
7567 k
= isl_basic_map_alloc_equality(bmap
);
7570 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7571 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7572 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7573 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7576 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7577 return isl_basic_map_finalize(bmap
);
7579 isl_basic_map_free(bmap
);
7584 * returns [domain -> range] -> range - domain
7586 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7589 isl_space
*domain_dim
;
7594 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7595 map
->dim
, isl_dim_out
))
7596 isl_die(map
->ctx
, isl_error_invalid
,
7597 "domain and range don't match", goto error
);
7599 map
= isl_map_cow(map
);
7603 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7604 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7605 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7608 for (i
= 0; i
< map
->n
; ++i
) {
7609 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7613 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7620 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7622 struct isl_basic_map
*bmap
;
7630 nparam
= dims
->nparam
;
7632 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7636 for (i
= 0; i
< dim
; ++i
) {
7637 int j
= isl_basic_map_alloc_equality(bmap
);
7640 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7641 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7642 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7644 return isl_basic_map_finalize(bmap
);
7646 isl_basic_map_free(bmap
);
7650 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7654 if (dim
->n_in
!= dim
->n_out
)
7655 isl_die(dim
->ctx
, isl_error_invalid
,
7656 "number of input and output dimensions needs to be "
7657 "the same", goto error
);
7658 return basic_map_identity(dim
);
7660 isl_space_free(dim
);
7664 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7666 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7669 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7671 isl_space
*dim
= isl_set_get_space(set
);
7673 id
= isl_map_identity(isl_space_map_from_set(dim
));
7674 return isl_map_intersect_range(id
, set
);
7677 /* Construct a basic set with all set dimensions having only non-negative
7680 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7681 __isl_take isl_space
*space
)
7686 struct isl_basic_set
*bset
;
7690 nparam
= space
->nparam
;
7692 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7695 for (i
= 0; i
< dim
; ++i
) {
7696 int k
= isl_basic_set_alloc_inequality(bset
);
7699 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7700 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7704 isl_basic_set_free(bset
);
7708 /* Construct the half-space x_pos >= 0.
7710 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7714 isl_basic_set
*nonneg
;
7716 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7717 k
= isl_basic_set_alloc_inequality(nonneg
);
7720 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7721 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7723 return isl_basic_set_finalize(nonneg
);
7725 isl_basic_set_free(nonneg
);
7729 /* Construct the half-space x_pos <= -1.
7731 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7736 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7737 k
= isl_basic_set_alloc_inequality(neg
);
7740 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7741 isl_int_set_si(neg
->ineq
[k
][0], -1);
7742 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7744 return isl_basic_set_finalize(neg
);
7746 isl_basic_set_free(neg
);
7750 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7751 enum isl_dim_type type
, unsigned first
, unsigned n
)
7755 isl_basic_set
*nonneg
;
7763 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7765 offset
= pos(set
->dim
, type
);
7766 for (i
= 0; i
< n
; ++i
) {
7767 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7768 offset
+ first
+ i
);
7769 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
7771 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7780 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7781 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7788 if (isl_set_plain_is_empty(set
)) {
7793 return fn(set
, signs
, user
);
7796 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7798 half
= isl_set_intersect(half
, isl_set_copy(set
));
7799 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7803 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7805 half
= isl_set_intersect(half
, set
);
7806 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7812 /* Call "fn" on the intersections of "set" with each of the orthants
7813 * (except for obviously empty intersections). The orthant is identified
7814 * by the signs array, with each entry having value 1 or -1 according
7815 * to the sign of the corresponding variable.
7817 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7818 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7828 if (isl_set_plain_is_empty(set
))
7831 nparam
= isl_set_dim(set
, isl_dim_param
);
7832 nvar
= isl_set_dim(set
, isl_dim_set
);
7834 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7836 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7844 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7846 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
7849 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
7850 __isl_keep isl_basic_map
*bmap2
)
7853 struct isl_map
*map1
;
7854 struct isl_map
*map2
;
7856 if (!bmap1
|| !bmap2
)
7857 return isl_bool_error
;
7859 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7860 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7862 is_subset
= isl_map_is_subset(map1
, map2
);
7870 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7871 __isl_keep isl_basic_set
*bset2
)
7873 return isl_basic_map_is_subset(bset1
, bset2
);
7876 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
7877 __isl_keep isl_basic_map
*bmap2
)
7881 if (!bmap1
|| !bmap2
)
7882 return isl_bool_error
;
7883 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7884 if (is_subset
!= isl_bool_true
)
7886 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7890 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
7891 __isl_keep isl_basic_set
*bset2
)
7893 return isl_basic_map_is_equal(
7894 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
7897 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
7903 return isl_bool_error
;
7904 for (i
= 0; i
< map
->n
; ++i
) {
7905 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7907 return isl_bool_error
;
7909 return isl_bool_false
;
7911 return isl_bool_true
;
7914 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7916 return map
? map
->n
== 0 : isl_bool_error
;
7919 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
7921 return set
? set
->n
== 0 : isl_bool_error
;
7924 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
7926 return isl_map_is_empty(set_to_map(set
));
7929 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7934 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7937 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7942 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7945 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7950 return isl_bool_error
;
7951 is_subset
= isl_map_is_subset(map1
, map2
);
7952 if (is_subset
!= isl_bool_true
)
7954 is_subset
= isl_map_is_subset(map2
, map1
);
7958 /* Is "map1" equal to "map2"?
7960 * First check if they are obviously equal.
7961 * If not, then perform a more detailed analysis.
7963 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7967 equal
= isl_map_plain_is_equal(map1
, map2
);
7968 if (equal
< 0 || equal
)
7970 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7973 isl_bool
isl_basic_map_is_strict_subset(
7974 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7978 if (!bmap1
|| !bmap2
)
7979 return isl_bool_error
;
7980 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7981 if (is_subset
!= isl_bool_true
)
7983 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7984 if (is_subset
== isl_bool_error
)
7989 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
7990 __isl_keep isl_map
*map2
)
7995 return isl_bool_error
;
7996 is_subset
= isl_map_is_subset(map1
, map2
);
7997 if (is_subset
!= isl_bool_true
)
7999 is_subset
= isl_map_is_subset(map2
, map1
);
8000 if (is_subset
== isl_bool_error
)
8005 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8006 __isl_keep isl_set
*set2
)
8008 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8011 /* Is "bmap" obviously equal to the universe with the same space?
8013 * That is, does it not have any constraints?
8015 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8018 return isl_bool_error
;
8019 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8022 /* Is "bset" obviously equal to the universe with the same space?
8024 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8026 return isl_basic_map_plain_is_universe(bset
);
8029 /* If "c" does not involve any existentially quantified variables,
8030 * then set *univ to false and abort
8032 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8034 isl_bool
*univ
= user
;
8037 n
= isl_constraint_dim(c
, isl_dim_div
);
8038 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8039 isl_constraint_free(c
);
8040 if (*univ
< 0 || !*univ
)
8041 return isl_stat_error
;
8045 /* Is "bmap" equal to the universe with the same space?
8047 * First check if it is obviously equal to the universe.
8048 * If not and if there are any constraints not involving
8049 * existentially quantified variables, then it is certainly
8050 * not equal to the universe.
8051 * Otherwise, check if the universe is a subset of "bmap".
8053 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8056 isl_basic_map
*test
;
8058 univ
= isl_basic_map_plain_is_universe(bmap
);
8059 if (univ
< 0 || univ
)
8061 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8062 return isl_bool_false
;
8063 univ
= isl_bool_true
;
8064 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8066 return isl_bool_error
;
8067 if (univ
< 0 || !univ
)
8069 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8070 univ
= isl_basic_map_is_subset(test
, bmap
);
8071 isl_basic_map_free(test
);
8075 /* Is "bset" equal to the universe with the same space?
8077 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8079 return isl_basic_map_is_universe(bset
);
8082 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8087 return isl_bool_error
;
8089 for (i
= 0; i
< map
->n
; ++i
) {
8090 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8095 return isl_bool_false
;
8098 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8100 return isl_map_plain_is_universe(set_to_map(set
));
8103 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8105 struct isl_basic_set
*bset
= NULL
;
8106 struct isl_vec
*sample
= NULL
;
8107 isl_bool empty
, non_empty
;
8110 return isl_bool_error
;
8112 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8113 return isl_bool_true
;
8115 if (isl_basic_map_plain_is_universe(bmap
))
8116 return isl_bool_false
;
8118 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8119 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8120 copy
= isl_basic_map_remove_redundancies(copy
);
8121 empty
= isl_basic_map_plain_is_empty(copy
);
8122 isl_basic_map_free(copy
);
8126 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8128 return isl_bool_error
;
8130 return isl_bool_false
;
8131 isl_vec_free(bmap
->sample
);
8132 bmap
->sample
= NULL
;
8133 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8135 return isl_bool_error
;
8136 sample
= isl_basic_set_sample_vec(bset
);
8138 return isl_bool_error
;
8139 empty
= sample
->size
== 0;
8140 isl_vec_free(bmap
->sample
);
8141 bmap
->sample
= sample
;
8143 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8148 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8151 return isl_bool_error
;
8152 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8155 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8158 return isl_bool_error
;
8159 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8162 /* Is "bmap" known to be non-empty?
8164 * That is, is the cached sample still valid?
8166 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8171 return isl_bool_error
;
8173 return isl_bool_false
;
8174 total
= 1 + isl_basic_map_total_dim(bmap
);
8175 if (bmap
->sample
->size
!= total
)
8176 return isl_bool_false
;
8177 return isl_basic_map_contains(bmap
, bmap
->sample
);
8180 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8182 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8185 struct isl_map
*isl_basic_map_union(
8186 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8188 struct isl_map
*map
;
8189 if (!bmap1
|| !bmap2
)
8192 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8194 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8197 map
= isl_map_add_basic_map(map
, bmap1
);
8198 map
= isl_map_add_basic_map(map
, bmap2
);
8201 isl_basic_map_free(bmap1
);
8202 isl_basic_map_free(bmap2
);
8206 struct isl_set
*isl_basic_set_union(
8207 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8209 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8210 bset_to_bmap(bset2
)));
8213 /* Order divs such that any div only depends on previous divs */
8214 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8222 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8224 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8226 if (isl_int_is_zero(bmap
->div
[i
][0]))
8228 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8233 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8234 "integer division depends on itself",
8235 return isl_basic_map_free(bmap
));
8236 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8242 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8244 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8247 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8254 for (i
= 0; i
< map
->n
; ++i
) {
8255 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8266 /* Sort the local variables of "bset".
8268 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8269 __isl_take isl_basic_set
*bset
)
8271 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8274 /* Apply the expansion computed by isl_merge_divs.
8275 * The expansion itself is given by "exp" while the resulting
8276 * list of divs is given by "div".
8278 * Move the integer divisions of "bmap" into the right position
8279 * according to "exp" and then introduce the additional integer
8280 * divisions, adding div constraints.
8281 * The moving should be done first to avoid moving coefficients
8282 * in the definitions of the extra integer divisions.
8284 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8285 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8290 bmap
= isl_basic_map_cow(bmap
);
8294 if (div
->n_row
< bmap
->n_div
)
8295 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8296 "not an expansion", goto error
);
8298 n_div
= bmap
->n_div
;
8299 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8300 div
->n_row
- n_div
, 0,
8301 2 * (div
->n_row
- n_div
));
8303 for (i
= n_div
; i
< div
->n_row
; ++i
)
8304 if (isl_basic_map_alloc_div(bmap
) < 0)
8307 for (j
= n_div
- 1; j
>= 0; --j
) {
8310 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8313 for (i
= 0; i
< div
->n_row
; ++i
) {
8314 if (j
< n_div
&& exp
[j
] == i
) {
8317 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8318 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8320 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8328 isl_basic_map_free(bmap
);
8333 /* Apply the expansion computed by isl_merge_divs.
8334 * The expansion itself is given by "exp" while the resulting
8335 * list of divs is given by "div".
8337 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8338 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8340 return isl_basic_map_expand_divs(bset
, div
, exp
);
8343 /* Look for a div in dst that corresponds to the div "div" in src.
8344 * The divs before "div" in src and dst are assumed to be the same.
8346 * Returns -1 if no corresponding div was found and the position
8347 * of the corresponding div in dst otherwise.
8349 static int find_div(struct isl_basic_map
*dst
,
8350 struct isl_basic_map
*src
, unsigned div
)
8354 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8356 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8357 for (i
= div
; i
< dst
->n_div
; ++i
)
8358 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8359 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8360 dst
->n_div
- div
) == -1)
8365 /* Align the divs of "dst" to those of "src", adding divs from "src"
8366 * if needed. That is, make sure that the first src->n_div divs
8367 * of the result are equal to those of src.
8369 * The result is not finalized as by design it will have redundant
8370 * divs if any divs from "src" were copied.
8372 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8373 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8376 int known
, extended
;
8380 return isl_basic_map_free(dst
);
8382 if (src
->n_div
== 0)
8385 known
= isl_basic_map_divs_known(src
);
8387 return isl_basic_map_free(dst
);
8389 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8390 "some src divs are unknown",
8391 return isl_basic_map_free(dst
));
8393 src
= isl_basic_map_order_divs(src
);
8396 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8397 for (i
= 0; i
< src
->n_div
; ++i
) {
8398 int j
= find_div(dst
, src
, i
);
8401 int extra
= src
->n_div
- i
;
8402 dst
= isl_basic_map_cow(dst
);
8405 dst
= isl_basic_map_extend_space(dst
,
8406 isl_space_copy(dst
->dim
),
8407 extra
, 0, 2 * extra
);
8410 j
= isl_basic_map_alloc_div(dst
);
8412 return isl_basic_map_free(dst
);
8413 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8414 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8415 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8416 return isl_basic_map_free(dst
);
8419 isl_basic_map_swap_div(dst
, i
, j
);
8424 struct isl_basic_set
*isl_basic_set_align_divs(
8425 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8427 return bset_from_bmap(isl_basic_map_align_divs(bset_to_bmap(dst
),
8428 bset_to_bmap(src
)));
8431 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8439 map
= isl_map_compute_divs(map
);
8440 map
= isl_map_cow(map
);
8444 for (i
= 1; i
< map
->n
; ++i
)
8445 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8446 for (i
= 1; i
< map
->n
; ++i
) {
8447 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8449 return isl_map_free(map
);
8452 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8456 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8458 return set_from_map(isl_map_align_divs(set_to_map(set
)));
8461 /* Align the divs of the basic maps in "map" to those
8462 * of the basic maps in "list", as well as to the other basic maps in "map".
8463 * The elements in "list" are assumed to have known divs.
8465 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8466 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8470 map
= isl_map_compute_divs(map
);
8471 map
= isl_map_cow(map
);
8473 return isl_map_free(map
);
8477 n
= isl_basic_map_list_n_basic_map(list
);
8478 for (i
= 0; i
< n
; ++i
) {
8479 isl_basic_map
*bmap
;
8481 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8482 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8483 isl_basic_map_free(bmap
);
8486 return isl_map_free(map
);
8488 return isl_map_align_divs(map
);
8491 /* Align the divs of each element of "list" to those of "bmap".
8492 * Both "bmap" and the elements of "list" are assumed to have known divs.
8494 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8495 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8500 return isl_basic_map_list_free(list
);
8502 n
= isl_basic_map_list_n_basic_map(list
);
8503 for (i
= 0; i
< n
; ++i
) {
8504 isl_basic_map
*bmap_i
;
8506 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8507 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8508 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8514 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8515 __isl_take isl_map
*map
)
8519 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8520 map
= isl_map_intersect_domain(map
, set
);
8521 set
= isl_map_range(map
);
8529 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8530 __isl_take isl_map
*map
)
8532 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8535 /* There is no need to cow as removing empty parts doesn't change
8536 * the meaning of the set.
8538 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8545 for (i
= map
->n
- 1; i
>= 0; --i
)
8546 remove_if_empty(map
, i
);
8551 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8553 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
8556 static __isl_give isl_basic_map
*map_copy_basic_map(__isl_keep isl_map
*map
)
8558 struct isl_basic_map
*bmap
;
8559 if (!map
|| map
->n
== 0)
8561 bmap
= map
->p
[map
->n
-1];
8562 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8563 return isl_basic_map_copy(bmap
);
8566 __isl_give isl_basic_map
*isl_map_copy_basic_map(__isl_keep isl_map
*map
)
8568 return map_copy_basic_map(map
);
8571 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8573 return bset_from_bmap(map_copy_basic_map(set_to_map(set
)));
8576 static __isl_give isl_map
*map_drop_basic_map(__isl_take isl_map
*map
,
8577 __isl_keep isl_basic_map
*bmap
)
8583 for (i
= map
->n
-1; i
>= 0; --i
) {
8584 if (map
->p
[i
] != bmap
)
8586 map
= isl_map_cow(map
);
8589 isl_basic_map_free(map
->p
[i
]);
8590 if (i
!= map
->n
-1) {
8591 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8592 map
->p
[i
] = map
->p
[map
->n
-1];
8603 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8604 __isl_keep isl_basic_map
*bmap
)
8606 return map_drop_basic_map(map
, bmap
);
8609 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8610 struct isl_basic_set
*bset
)
8612 return set_from_map(map_drop_basic_map(set_to_map(set
),
8613 bset_to_bmap(bset
)));
8616 /* Given two basic sets bset1 and bset2, compute the maximal difference
8617 * between the values of dimension pos in bset1 and those in bset2
8618 * for any common value of the parameters and dimensions preceding pos.
8620 static enum isl_lp_result
basic_set_maximal_difference_at(
8621 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8622 int pos
, isl_int
*opt
)
8624 isl_basic_map
*bmap1
;
8625 isl_basic_map
*bmap2
;
8626 struct isl_ctx
*ctx
;
8627 struct isl_vec
*obj
;
8631 enum isl_lp_result res
;
8633 if (!bset1
|| !bset2
)
8634 return isl_lp_error
;
8636 nparam
= isl_basic_set_n_param(bset1
);
8637 dim1
= isl_basic_set_n_dim(bset1
);
8639 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
8640 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
8641 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
8642 isl_dim_out
, 0, pos
);
8643 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
8644 isl_dim_out
, 0, pos
);
8645 bmap1
= isl_basic_map_range_product(bmap1
, bmap2
);
8647 return isl_lp_error
;
8649 total
= isl_basic_map_total_dim(bmap1
);
8651 obj
= isl_vec_alloc(ctx
, 1 + total
);
8654 isl_seq_clr(obj
->block
.data
, 1 + total
);
8655 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8656 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8657 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8659 isl_basic_map_free(bmap1
);
8663 isl_basic_map_free(bmap1
);
8664 return isl_lp_error
;
8667 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8668 * for any common value of the parameters and dimensions preceding pos
8669 * in both basic sets, the values of dimension pos in bset1 are
8670 * smaller or larger than those in bset2.
8673 * 1 if bset1 follows bset2
8674 * -1 if bset1 precedes bset2
8675 * 0 if bset1 and bset2 are incomparable
8676 * -2 if some error occurred.
8678 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8679 struct isl_basic_set
*bset2
, int pos
)
8682 enum isl_lp_result res
;
8687 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8689 if (res
== isl_lp_empty
)
8691 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8692 res
== isl_lp_unbounded
)
8694 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8703 /* Given two basic sets bset1 and bset2, check whether
8704 * for any common value of the parameters and dimensions preceding pos
8705 * there is a value of dimension pos in bset1 that is larger
8706 * than a value of the same dimension in bset2.
8709 * 1 if there exists such a pair
8710 * 0 if there is no such pair, but there is a pair of equal values
8712 * -2 if some error occurred.
8714 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8715 __isl_keep isl_basic_set
*bset2
, int pos
)
8718 enum isl_lp_result res
;
8723 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8725 if (res
== isl_lp_empty
)
8727 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8728 res
== isl_lp_unbounded
)
8730 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8732 else if (res
== isl_lp_ok
)
8741 /* Given two sets set1 and set2, check whether
8742 * for any common value of the parameters and dimensions preceding pos
8743 * there is a value of dimension pos in set1 that is larger
8744 * than a value of the same dimension in set2.
8747 * 1 if there exists such a pair
8748 * 0 if there is no such pair, but there is a pair of equal values
8750 * -2 if some error occurred.
8752 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8753 __isl_keep isl_set
*set2
, int pos
)
8761 for (i
= 0; i
< set1
->n
; ++i
)
8762 for (j
= 0; j
< set2
->n
; ++j
) {
8764 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8765 if (f
== 1 || f
== -2)
8774 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8775 unsigned pos
, isl_int
*val
)
8783 total
= isl_basic_map_total_dim(bmap
);
8784 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8785 for (; d
+1 > pos
; --d
)
8786 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8790 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8792 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8794 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8797 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8803 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8804 unsigned pos
, isl_int
*val
)
8816 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8819 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8820 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8821 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8822 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8826 isl_int_set(*val
, v
);
8832 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8833 unsigned pos
, isl_int
*val
)
8835 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
8839 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8842 return isl_map_plain_has_fixed_var(set_to_map(set
), pos
, val
);
8845 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8846 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8848 if (pos
>= isl_basic_map_dim(bmap
, type
))
8850 return isl_basic_map_plain_has_fixed_var(bmap
,
8851 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8854 /* If "bmap" obviously lies on a hyperplane where the given dimension
8855 * has a fixed value, then return that value.
8856 * Otherwise return NaN.
8858 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8859 __isl_keep isl_basic_map
*bmap
,
8860 enum isl_dim_type type
, unsigned pos
)
8868 ctx
= isl_basic_map_get_ctx(bmap
);
8869 v
= isl_val_alloc(ctx
);
8872 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8874 return isl_val_free(v
);
8876 isl_int_set_si(v
->d
, 1);
8880 return isl_val_nan(ctx
);
8883 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8884 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8886 if (pos
>= isl_map_dim(map
, type
))
8888 return isl_map_plain_has_fixed_var(map
,
8889 map_offset(map
, type
) - 1 + pos
, val
);
8892 /* If "map" obviously lies on a hyperplane where the given dimension
8893 * has a fixed value, then return that value.
8894 * Otherwise return NaN.
8896 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8897 enum isl_dim_type type
, unsigned pos
)
8905 ctx
= isl_map_get_ctx(map
);
8906 v
= isl_val_alloc(ctx
);
8909 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8911 return isl_val_free(v
);
8913 isl_int_set_si(v
->d
, 1);
8917 return isl_val_nan(ctx
);
8920 /* If "set" obviously lies on a hyperplane where the given dimension
8921 * has a fixed value, then return that value.
8922 * Otherwise return NaN.
8924 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8925 enum isl_dim_type type
, unsigned pos
)
8927 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8930 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8931 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8933 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8936 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8937 * then return this fixed value in *val.
8939 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8940 unsigned dim
, isl_int
*val
)
8942 return isl_basic_set_plain_has_fixed_var(bset
,
8943 isl_basic_set_n_param(bset
) + dim
, val
);
8946 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8947 * then return this fixed value in *val.
8949 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8950 unsigned dim
, isl_int
*val
)
8952 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8955 /* Check if input variable in has fixed value and if so and if val is not NULL,
8956 * then return this fixed value in *val.
8958 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8959 unsigned in
, isl_int
*val
)
8961 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8964 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8965 * and if val is not NULL, then return this lower bound in *val.
8967 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8968 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8970 int i
, i_eq
= -1, i_ineq
= -1;
8977 total
= isl_basic_set_total_dim(bset
);
8978 nparam
= isl_basic_set_n_param(bset
);
8979 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8980 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8986 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8987 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8989 if (i_eq
!= -1 || i_ineq
!= -1)
8993 if (i_eq
== -1 && i_ineq
== -1)
8995 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8996 /* The coefficient should always be one due to normalization. */
8997 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8999 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
9001 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
9002 total
- nparam
- dim
- 1) != -1)
9005 isl_int_neg(*val
, c
[0]);
9009 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
9010 unsigned dim
, isl_int
*val
)
9022 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
9026 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
9028 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
9029 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
9031 if (fixed
== 1 && isl_int_ne(tmp
, v
))
9035 isl_int_set(*val
, v
);
9041 /* Return -1 if the constraint "c1" should be sorted before "c2"
9042 * and 1 if it should be sorted after "c2".
9043 * Return 0 if the two constraints are the same (up to the constant term).
9045 * In particular, if a constraint involves later variables than another
9046 * then it is sorted after this other constraint.
9047 * uset_gist depends on constraints without existentially quantified
9048 * variables sorting first.
9050 * For constraints that have the same latest variable, those
9051 * with the same coefficient for this latest variable (first in absolute value
9052 * and then in actual value) are grouped together.
9053 * This is useful for detecting pairs of constraints that can
9054 * be chained in their printed representation.
9056 * Finally, within a group, constraints are sorted according to
9057 * their coefficients (excluding the constant term).
9059 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9061 isl_int
**c1
= (isl_int
**) p1
;
9062 isl_int
**c2
= (isl_int
**) p2
;
9064 unsigned size
= *(unsigned *) arg
;
9067 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9068 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9073 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9076 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9080 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9083 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9084 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9085 * and 0 if the two constraints are the same (up to the constant term).
9087 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9088 isl_int
*c1
, isl_int
*c2
)
9094 total
= isl_basic_map_total_dim(bmap
);
9095 return sort_constraint_cmp(&c1
, &c2
, &total
);
9098 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9099 __isl_take isl_basic_map
*bmap
)
9105 if (bmap
->n_ineq
== 0)
9107 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9109 total
= isl_basic_map_total_dim(bmap
);
9110 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9111 &sort_constraint_cmp
, &total
) < 0)
9112 return isl_basic_map_free(bmap
);
9116 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9117 __isl_take isl_basic_set
*bset
)
9119 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9120 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9123 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
9127 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9129 bmap
= isl_basic_map_remove_redundancies(bmap
);
9130 bmap
= isl_basic_map_sort_constraints(bmap
);
9132 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9136 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
9138 return bset_from_bmap(isl_basic_map_normalize(bset_to_bmap(bset
)));
9141 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
9142 const __isl_keep isl_basic_map
*bmap2
)
9147 if (!bmap1
|| !bmap2
)
9152 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9153 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9154 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9155 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
9156 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
9157 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
9158 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9159 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
9160 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9161 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9162 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9164 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9166 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9168 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9169 return bmap1
->n_eq
- bmap2
->n_eq
;
9170 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9171 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9172 if (bmap1
->n_div
!= bmap2
->n_div
)
9173 return bmap1
->n_div
- bmap2
->n_div
;
9174 total
= isl_basic_map_total_dim(bmap1
);
9175 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9176 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9180 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9181 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9185 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9186 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9193 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
9194 const __isl_keep isl_basic_set
*bset2
)
9196 return isl_basic_map_plain_cmp(bset1
, bset2
);
9199 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9205 if (set1
->n
!= set2
->n
)
9206 return set1
->n
- set2
->n
;
9208 for (i
= 0; i
< set1
->n
; ++i
) {
9209 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9217 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9218 __isl_keep isl_basic_map
*bmap2
)
9220 if (!bmap1
|| !bmap2
)
9221 return isl_bool_error
;
9222 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9225 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9226 __isl_keep isl_basic_set
*bset2
)
9228 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9229 bset_to_bmap(bset2
));
9232 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9234 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
9235 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
9237 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9240 /* Sort the basic maps of "map" and remove duplicate basic maps.
9242 * While removing basic maps, we make sure that the basic maps remain
9243 * sorted because isl_map_normalize expects the basic maps of the result
9246 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9250 map
= isl_map_remove_empty_parts(map
);
9253 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9254 for (i
= map
->n
- 1; i
>= 1; --i
) {
9255 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9257 isl_basic_map_free(map
->p
[i
-1]);
9258 for (j
= i
; j
< map
->n
; ++j
)
9259 map
->p
[j
- 1] = map
->p
[j
];
9266 /* Remove obvious duplicates among the basic maps of "map".
9268 * Unlike isl_map_normalize, this function does not remove redundant
9269 * constraints and only removes duplicates that have exactly the same
9270 * constraints in the input. It does sort the constraints and
9271 * the basic maps to ease the detection of duplicates.
9273 * If "map" has already been normalized or if the basic maps are
9274 * disjoint, then there can be no duplicates.
9276 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9279 isl_basic_map
*bmap
;
9285 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9287 for (i
= 0; i
< map
->n
; ++i
) {
9288 bmap
= isl_basic_map_copy(map
->p
[i
]);
9289 bmap
= isl_basic_map_sort_constraints(bmap
);
9291 return isl_map_free(map
);
9292 isl_basic_map_free(map
->p
[i
]);
9296 map
= sort_and_remove_duplicates(map
);
9300 /* We normalize in place, but if anything goes wrong we need
9301 * to return NULL, so we need to make sure we don't change the
9302 * meaning of any possible other copies of map.
9304 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9307 struct isl_basic_map
*bmap
;
9311 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9313 for (i
= 0; i
< map
->n
; ++i
) {
9314 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9317 isl_basic_map_free(map
->p
[i
]);
9321 map
= sort_and_remove_duplicates(map
);
9323 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9330 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9332 return set_from_map(isl_map_normalize(set_to_map(set
)));
9335 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9336 __isl_keep isl_map
*map2
)
9342 return isl_bool_error
;
9345 return isl_bool_true
;
9346 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9347 return isl_bool_false
;
9349 map1
= isl_map_copy(map1
);
9350 map2
= isl_map_copy(map2
);
9351 map1
= isl_map_normalize(map1
);
9352 map2
= isl_map_normalize(map2
);
9355 equal
= map1
->n
== map2
->n
;
9356 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9357 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9367 return isl_bool_error
;
9370 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9371 __isl_keep isl_set
*set2
)
9373 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9376 /* Return an interval that ranges from min to max (inclusive)
9378 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
9379 isl_int min
, isl_int max
)
9382 struct isl_basic_set
*bset
= NULL
;
9384 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
9388 k
= isl_basic_set_alloc_inequality(bset
);
9391 isl_int_set_si(bset
->ineq
[k
][1], 1);
9392 isl_int_neg(bset
->ineq
[k
][0], min
);
9394 k
= isl_basic_set_alloc_inequality(bset
);
9397 isl_int_set_si(bset
->ineq
[k
][1], -1);
9398 isl_int_set(bset
->ineq
[k
][0], max
);
9402 isl_basic_set_free(bset
);
9406 /* Return the basic maps in "map" as a list.
9408 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9409 __isl_keep isl_map
*map
)
9413 isl_basic_map_list
*list
;
9417 ctx
= isl_map_get_ctx(map
);
9418 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9420 for (i
= 0; i
< map
->n
; ++i
) {
9421 isl_basic_map
*bmap
;
9423 bmap
= isl_basic_map_copy(map
->p
[i
]);
9424 list
= isl_basic_map_list_add(list
, bmap
);
9430 /* Return the intersection of the elements in the non-empty list "list".
9431 * All elements are assumed to live in the same space.
9433 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9434 __isl_take isl_basic_map_list
*list
)
9437 isl_basic_map
*bmap
;
9441 n
= isl_basic_map_list_n_basic_map(list
);
9443 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9444 "expecting non-empty list", goto error
);
9446 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9447 for (i
= 1; i
< n
; ++i
) {
9448 isl_basic_map
*bmap_i
;
9450 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9451 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9454 isl_basic_map_list_free(list
);
9457 isl_basic_map_list_free(list
);
9461 /* Return the intersection of the elements in the non-empty list "list".
9462 * All elements are assumed to live in the same space.
9464 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9465 __isl_take isl_basic_set_list
*list
)
9467 return isl_basic_map_list_intersect(list
);
9470 /* Return the union of the elements of "list".
9471 * The list is required to have at least one element.
9473 __isl_give isl_set
*isl_basic_set_list_union(
9474 __isl_take isl_basic_set_list
*list
)
9478 isl_basic_set
*bset
;
9483 n
= isl_basic_set_list_n_basic_set(list
);
9485 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9486 "expecting non-empty list", goto error
);
9488 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9489 space
= isl_basic_set_get_space(bset
);
9490 isl_basic_set_free(bset
);
9492 set
= isl_set_alloc_space(space
, n
, 0);
9493 for (i
= 0; i
< n
; ++i
) {
9494 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9495 set
= isl_set_add_basic_set(set
, bset
);
9498 isl_basic_set_list_free(list
);
9501 isl_basic_set_list_free(list
);
9505 /* Return the union of the elements in the non-empty list "list".
9506 * All elements are assumed to live in the same space.
9508 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9515 n
= isl_set_list_n_set(list
);
9517 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9518 "expecting non-empty list", goto error
);
9520 set
= isl_set_list_get_set(list
, 0);
9521 for (i
= 1; i
< n
; ++i
) {
9524 set_i
= isl_set_list_get_set(list
, i
);
9525 set
= isl_set_union(set
, set_i
);
9528 isl_set_list_free(list
);
9531 isl_set_list_free(list
);
9535 /* Return the Cartesian product of the basic sets in list (in the given order).
9537 __isl_give isl_basic_set
*isl_basic_set_list_product(
9538 __isl_take
struct isl_basic_set_list
*list
)
9546 struct isl_basic_set
*product
= NULL
;
9550 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9551 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9552 nparam
= isl_basic_set_n_param(list
->p
[0]);
9553 dim
= isl_basic_set_n_dim(list
->p
[0]);
9554 extra
= list
->p
[0]->n_div
;
9555 n_eq
= list
->p
[0]->n_eq
;
9556 n_ineq
= list
->p
[0]->n_ineq
;
9557 for (i
= 1; i
< list
->n
; ++i
) {
9558 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9559 isl_assert(list
->ctx
,
9560 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9561 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9562 extra
+= list
->p
[i
]->n_div
;
9563 n_eq
+= list
->p
[i
]->n_eq
;
9564 n_ineq
+= list
->p
[i
]->n_ineq
;
9566 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9571 for (i
= 0; i
< list
->n
; ++i
) {
9572 isl_basic_set_add_constraints(product
,
9573 isl_basic_set_copy(list
->p
[i
]), dim
);
9574 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9576 isl_basic_set_list_free(list
);
9579 isl_basic_set_free(product
);
9580 isl_basic_set_list_free(list
);
9584 struct isl_basic_map
*isl_basic_map_product(
9585 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9587 isl_space
*dim_result
= NULL
;
9588 struct isl_basic_map
*bmap
;
9589 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9590 struct isl_dim_map
*dim_map1
, *dim_map2
;
9592 if (!bmap1
|| !bmap2
)
9595 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9596 bmap2
->dim
, isl_dim_param
), goto error
);
9597 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9598 isl_space_copy(bmap2
->dim
));
9600 in1
= isl_basic_map_n_in(bmap1
);
9601 in2
= isl_basic_map_n_in(bmap2
);
9602 out1
= isl_basic_map_n_out(bmap1
);
9603 out2
= isl_basic_map_n_out(bmap2
);
9604 nparam
= isl_basic_map_n_param(bmap1
);
9606 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9607 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9608 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9609 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9610 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9611 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9612 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9613 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9614 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9615 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9616 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9618 bmap
= isl_basic_map_alloc_space(dim_result
,
9619 bmap1
->n_div
+ bmap2
->n_div
,
9620 bmap1
->n_eq
+ bmap2
->n_eq
,
9621 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9622 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9623 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9624 bmap
= isl_basic_map_simplify(bmap
);
9625 return isl_basic_map_finalize(bmap
);
9627 isl_basic_map_free(bmap1
);
9628 isl_basic_map_free(bmap2
);
9632 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9633 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9635 isl_basic_map
*prod
;
9637 prod
= isl_basic_map_product(bmap1
, bmap2
);
9638 prod
= isl_basic_map_flatten(prod
);
9642 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9643 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9645 return isl_basic_map_flat_range_product(bset1
, bset2
);
9648 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9649 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9651 isl_space
*space_result
= NULL
;
9652 isl_basic_map
*bmap
;
9653 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9654 struct isl_dim_map
*dim_map1
, *dim_map2
;
9656 if (!bmap1
|| !bmap2
)
9659 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9660 isl_space_copy(bmap2
->dim
));
9662 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9663 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9664 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9665 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9667 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9668 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9669 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9670 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9671 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9672 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9673 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9674 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9675 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9676 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9677 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9679 bmap
= isl_basic_map_alloc_space(space_result
,
9680 bmap1
->n_div
+ bmap2
->n_div
,
9681 bmap1
->n_eq
+ bmap2
->n_eq
,
9682 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9683 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9684 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9685 bmap
= isl_basic_map_simplify(bmap
);
9686 return isl_basic_map_finalize(bmap
);
9688 isl_basic_map_free(bmap1
);
9689 isl_basic_map_free(bmap2
);
9693 __isl_give isl_basic_map
*isl_basic_map_range_product(
9694 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9697 isl_space
*dim_result
= NULL
;
9698 isl_basic_map
*bmap
;
9699 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9700 struct isl_dim_map
*dim_map1
, *dim_map2
;
9702 rational
= isl_basic_map_is_rational(bmap1
);
9703 if (rational
>= 0 && rational
)
9704 rational
= isl_basic_map_is_rational(bmap2
);
9705 if (!bmap1
|| !bmap2
|| rational
< 0)
9708 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9709 bmap2
->dim
, isl_dim_param
))
9710 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9711 "parameters don't match", goto error
);
9713 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9714 isl_space_copy(bmap2
->dim
));
9716 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9717 out1
= isl_basic_map_n_out(bmap1
);
9718 out2
= isl_basic_map_n_out(bmap2
);
9719 nparam
= isl_basic_map_n_param(bmap1
);
9721 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9722 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9723 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9724 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9725 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9726 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9727 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9728 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9729 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9730 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9731 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9733 bmap
= isl_basic_map_alloc_space(dim_result
,
9734 bmap1
->n_div
+ bmap2
->n_div
,
9735 bmap1
->n_eq
+ bmap2
->n_eq
,
9736 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9737 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9738 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9740 bmap
= isl_basic_map_set_rational(bmap
);
9741 bmap
= isl_basic_map_simplify(bmap
);
9742 return isl_basic_map_finalize(bmap
);
9744 isl_basic_map_free(bmap1
);
9745 isl_basic_map_free(bmap2
);
9749 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9750 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9752 isl_basic_map
*prod
;
9754 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9755 prod
= isl_basic_map_flatten_range(prod
);
9759 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9760 * and collect the results.
9761 * The result live in the space obtained by calling "space_product"
9762 * on the spaces of "map1" and "map2".
9763 * If "remove_duplicates" is set then the result may contain duplicates
9764 * (even if the inputs do not) and so we try and remove the obvious
9767 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9768 __isl_take isl_map
*map2
,
9769 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9770 __isl_take isl_space
*right
),
9771 __isl_give isl_basic_map
*(*basic_map_product
)(
9772 __isl_take isl_basic_map
*left
,
9773 __isl_take isl_basic_map
*right
),
9774 int remove_duplicates
)
9777 struct isl_map
*result
;
9783 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9784 map2
->dim
, isl_dim_param
), goto error
);
9786 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9787 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9788 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9790 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9791 isl_space_copy(map2
->dim
)),
9792 map1
->n
* map2
->n
, flags
);
9795 for (i
= 0; i
< map1
->n
; ++i
)
9796 for (j
= 0; j
< map2
->n
; ++j
) {
9797 struct isl_basic_map
*part
;
9798 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9799 isl_basic_map_copy(map2
->p
[j
]));
9800 if (isl_basic_map_is_empty(part
))
9801 isl_basic_map_free(part
);
9803 result
= isl_map_add_basic_map(result
, part
);
9807 if (remove_duplicates
)
9808 result
= isl_map_remove_obvious_duplicates(result
);
9818 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9820 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9821 __isl_take isl_map
*map2
)
9823 return map_product(map1
, map2
, &isl_space_product
,
9824 &isl_basic_map_product
, 0);
9827 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9828 __isl_take isl_map
*map2
)
9830 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9833 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9835 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9836 __isl_take isl_map
*map2
)
9840 prod
= isl_map_product(map1
, map2
);
9841 prod
= isl_map_flatten(prod
);
9845 /* Given two set A and B, construct its Cartesian product A x B.
9847 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9849 return isl_map_range_product(set1
, set2
);
9852 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9853 __isl_take isl_set
*set2
)
9855 return isl_map_flat_range_product(set1
, set2
);
9858 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9860 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9861 __isl_take isl_map
*map2
)
9863 return map_product(map1
, map2
, &isl_space_domain_product
,
9864 &isl_basic_map_domain_product
, 1);
9867 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9869 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9870 __isl_take isl_map
*map2
)
9872 return map_product(map1
, map2
, &isl_space_range_product
,
9873 &isl_basic_map_range_product
, 1);
9876 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9877 __isl_take isl_map
*map2
)
9879 return isl_map_align_params_map_map_and(map1
, map2
,
9880 &map_domain_product_aligned
);
9883 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9884 __isl_take isl_map
*map2
)
9886 return isl_map_align_params_map_map_and(map1
, map2
,
9887 &map_range_product_aligned
);
9890 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
9892 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
9895 int total1
, keep1
, total2
, keep2
;
9899 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9900 !isl_space_range_is_wrapping(map
->dim
))
9901 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9902 "not a product", return isl_map_free(map
));
9904 space
= isl_map_get_space(map
);
9905 total1
= isl_space_dim(space
, isl_dim_in
);
9906 total2
= isl_space_dim(space
, isl_dim_out
);
9907 space
= isl_space_factor_domain(space
);
9908 keep1
= isl_space_dim(space
, isl_dim_in
);
9909 keep2
= isl_space_dim(space
, isl_dim_out
);
9910 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
9911 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
9912 map
= isl_map_reset_space(map
, space
);
9917 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
9919 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
9922 int total1
, keep1
, total2
, keep2
;
9926 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9927 !isl_space_range_is_wrapping(map
->dim
))
9928 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9929 "not a product", return isl_map_free(map
));
9931 space
= isl_map_get_space(map
);
9932 total1
= isl_space_dim(space
, isl_dim_in
);
9933 total2
= isl_space_dim(space
, isl_dim_out
);
9934 space
= isl_space_factor_range(space
);
9935 keep1
= isl_space_dim(space
, isl_dim_in
);
9936 keep2
= isl_space_dim(space
, isl_dim_out
);
9937 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
9938 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
9939 map
= isl_map_reset_space(map
, space
);
9944 /* Given a map of the form [A -> B] -> C, return the map A -> C.
9946 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
9953 if (!isl_space_domain_is_wrapping(map
->dim
))
9954 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9955 "domain is not a product", return isl_map_free(map
));
9957 space
= isl_map_get_space(map
);
9958 total
= isl_space_dim(space
, isl_dim_in
);
9959 space
= isl_space_domain_factor_domain(space
);
9960 keep
= isl_space_dim(space
, isl_dim_in
);
9961 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
9962 map
= isl_map_reset_space(map
, space
);
9967 /* Given a map of the form [A -> B] -> C, return the map B -> C.
9969 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
9976 if (!isl_space_domain_is_wrapping(map
->dim
))
9977 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9978 "domain is not a product", return isl_map_free(map
));
9980 space
= isl_map_get_space(map
);
9981 total
= isl_space_dim(space
, isl_dim_in
);
9982 space
= isl_space_domain_factor_range(space
);
9983 keep
= isl_space_dim(space
, isl_dim_in
);
9984 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
9985 map
= isl_map_reset_space(map
, space
);
9990 /* Given a map A -> [B -> C], extract the map A -> B.
9992 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9999 if (!isl_space_range_is_wrapping(map
->dim
))
10000 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10001 "range is not a product", return isl_map_free(map
));
10003 space
= isl_map_get_space(map
);
10004 total
= isl_space_dim(space
, isl_dim_out
);
10005 space
= isl_space_range_factor_domain(space
);
10006 keep
= isl_space_dim(space
, isl_dim_out
);
10007 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10008 map
= isl_map_reset_space(map
, space
);
10013 /* Given a map A -> [B -> C], extract the map A -> C.
10015 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10022 if (!isl_space_range_is_wrapping(map
->dim
))
10023 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10024 "range is not a product", return isl_map_free(map
));
10026 space
= isl_map_get_space(map
);
10027 total
= isl_space_dim(space
, isl_dim_out
);
10028 space
= isl_space_range_factor_range(space
);
10029 keep
= isl_space_dim(space
, isl_dim_out
);
10030 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10031 map
= isl_map_reset_space(map
, space
);
10036 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10038 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10039 __isl_take isl_map
*map2
)
10043 prod
= isl_map_domain_product(map1
, map2
);
10044 prod
= isl_map_flatten_domain(prod
);
10048 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10050 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10051 __isl_take isl_map
*map2
)
10055 prod
= isl_map_range_product(map1
, map2
);
10056 prod
= isl_map_flatten_range(prod
);
10060 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10063 uint32_t hash
= isl_hash_init();
10068 bmap
= isl_basic_map_copy(bmap
);
10069 bmap
= isl_basic_map_normalize(bmap
);
10072 total
= isl_basic_map_total_dim(bmap
);
10073 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10074 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10076 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10077 isl_hash_hash(hash
, c_hash
);
10079 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10080 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10082 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10083 isl_hash_hash(hash
, c_hash
);
10085 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10086 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10088 if (isl_int_is_zero(bmap
->div
[i
][0]))
10090 isl_hash_byte(hash
, i
& 0xFF);
10091 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10092 isl_hash_hash(hash
, c_hash
);
10094 isl_basic_map_free(bmap
);
10098 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10100 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10103 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10110 map
= isl_map_copy(map
);
10111 map
= isl_map_normalize(map
);
10115 hash
= isl_hash_init();
10116 for (i
= 0; i
< map
->n
; ++i
) {
10117 uint32_t bmap_hash
;
10118 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10119 isl_hash_hash(hash
, bmap_hash
);
10127 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10129 return isl_map_get_hash(set_to_map(set
));
10132 /* Check if the value for dimension dim is completely determined
10133 * by the values of the other parameters and variables.
10134 * That is, check if dimension dim is involved in an equality.
10136 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
10143 nparam
= isl_basic_set_n_param(bset
);
10144 for (i
= 0; i
< bset
->n_eq
; ++i
)
10145 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
10150 /* Check if the value for dimension dim is completely determined
10151 * by the values of the other parameters and variables.
10152 * That is, check if dimension dim is involved in an equality
10153 * for each of the subsets.
10155 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
10161 for (i
= 0; i
< set
->n
; ++i
) {
10163 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
10170 /* Return the number of basic maps in the (current) representation of "map".
10172 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10174 return map
? map
->n
: 0;
10177 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10179 return set
? set
->n
: 0;
10182 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10183 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10188 return isl_stat_error
;
10190 for (i
= 0; i
< map
->n
; ++i
)
10191 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10192 return isl_stat_error
;
10194 return isl_stat_ok
;
10197 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10198 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10203 return isl_stat_error
;
10205 for (i
= 0; i
< set
->n
; ++i
)
10206 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10207 return isl_stat_error
;
10209 return isl_stat_ok
;
10212 /* Return a list of basic sets, the union of which is equal to "set".
10214 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10215 __isl_keep isl_set
*set
)
10218 isl_basic_set_list
*list
;
10223 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10224 for (i
= 0; i
< set
->n
; ++i
) {
10225 isl_basic_set
*bset
;
10227 bset
= isl_basic_set_copy(set
->p
[i
]);
10228 list
= isl_basic_set_list_add(list
, bset
);
10234 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10241 bset
= isl_basic_set_cow(bset
);
10245 dim
= isl_basic_set_get_space(bset
);
10246 dim
= isl_space_lift(dim
, bset
->n_div
);
10249 isl_space_free(bset
->dim
);
10251 bset
->extra
-= bset
->n_div
;
10254 bset
= isl_basic_set_finalize(bset
);
10258 isl_basic_set_free(bset
);
10262 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10268 set
= isl_set_align_divs(set
);
10273 set
= isl_set_cow(set
);
10277 n_div
= set
->p
[0]->n_div
;
10278 dim
= isl_set_get_space(set
);
10279 dim
= isl_space_lift(dim
, n_div
);
10282 isl_space_free(set
->dim
);
10285 for (i
= 0; i
< set
->n
; ++i
) {
10286 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10297 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
10300 struct isl_basic_map
*bmap
;
10307 set
= isl_set_align_divs(set
);
10312 dim
= isl_set_get_space(set
);
10313 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
10315 return isl_map_identity(isl_space_map_from_set(dim
));
10318 n_div
= set
->p
[0]->n_div
;
10319 dim
= isl_space_map_from_set(dim
);
10320 n_param
= isl_space_dim(dim
, isl_dim_param
);
10321 n_set
= isl_space_dim(dim
, isl_dim_in
);
10322 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
10323 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
10324 for (i
= 0; i
< n_set
; ++i
)
10325 bmap
= var_equal(bmap
, i
);
10327 total
= n_param
+ n_set
+ n_set
+ n_div
;
10328 for (i
= 0; i
< n_div
; ++i
) {
10329 k
= isl_basic_map_alloc_inequality(bmap
);
10332 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
10333 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
10334 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
10335 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
10336 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
10337 set
->p
[0]->div
[i
][0]);
10339 l
= isl_basic_map_alloc_inequality(bmap
);
10342 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
10343 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
10344 set
->p
[0]->div
[i
][0]);
10345 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
10349 bmap
= isl_basic_map_simplify(bmap
);
10350 bmap
= isl_basic_map_finalize(bmap
);
10351 return isl_map_from_basic_map(bmap
);
10354 isl_basic_map_free(bmap
);
10358 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10366 dim
= isl_basic_set_total_dim(bset
);
10367 size
+= bset
->n_eq
* (1 + dim
);
10368 size
+= bset
->n_ineq
* (1 + dim
);
10369 size
+= bset
->n_div
* (2 + dim
);
10374 int isl_set_size(__isl_keep isl_set
*set
)
10382 for (i
= 0; i
< set
->n
; ++i
)
10383 size
+= isl_basic_set_size(set
->p
[i
]);
10388 /* Check if there is any lower bound (if lower == 0) and/or upper
10389 * bound (if upper == 0) on the specified dim.
10391 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10392 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10397 return isl_bool_error
;
10399 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
),
10400 return isl_bool_error
);
10402 pos
+= isl_basic_map_offset(bmap
, type
);
10404 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10405 if (isl_int_is_zero(bmap
->div
[i
][0]))
10407 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10408 return isl_bool_true
;
10411 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10412 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10413 return isl_bool_true
;
10415 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10416 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10423 return lower
&& upper
;
10426 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10427 enum isl_dim_type type
, unsigned pos
)
10429 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10432 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10433 enum isl_dim_type type
, unsigned pos
)
10435 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10438 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10439 enum isl_dim_type type
, unsigned pos
)
10441 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10444 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10445 enum isl_dim_type type
, unsigned pos
)
10452 for (i
= 0; i
< map
->n
; ++i
) {
10454 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10455 if (bounded
< 0 || !bounded
)
10462 /* Return 1 if the specified dim is involved in both an upper bound
10463 * and a lower bound.
10465 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10466 enum isl_dim_type type
, unsigned pos
)
10468 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10471 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10473 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10474 enum isl_dim_type type
, unsigned pos
,
10475 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10476 enum isl_dim_type type
, unsigned pos
))
10481 return isl_bool_error
;
10483 for (i
= 0; i
< map
->n
; ++i
) {
10485 bounded
= fn(map
->p
[i
], type
, pos
);
10486 if (bounded
< 0 || bounded
)
10490 return isl_bool_false
;
10493 /* Return 1 if the specified dim is involved in any lower bound.
10495 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10496 enum isl_dim_type type
, unsigned pos
)
10498 return has_any_bound(set
, type
, pos
,
10499 &isl_basic_map_dim_has_lower_bound
);
10502 /* Return 1 if the specified dim is involved in any upper bound.
10504 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10505 enum isl_dim_type type
, unsigned pos
)
10507 return has_any_bound(set
, type
, pos
,
10508 &isl_basic_map_dim_has_upper_bound
);
10511 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10513 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10514 enum isl_dim_type type
, unsigned pos
,
10515 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10516 enum isl_dim_type type
, unsigned pos
))
10521 return isl_bool_error
;
10523 for (i
= 0; i
< map
->n
; ++i
) {
10525 bounded
= fn(map
->p
[i
], type
, pos
);
10526 if (bounded
< 0 || !bounded
)
10530 return isl_bool_true
;
10533 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10535 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10536 enum isl_dim_type type
, unsigned pos
)
10538 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10541 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10543 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10544 enum isl_dim_type type
, unsigned pos
)
10546 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10549 /* For each of the "n" variables starting at "first", determine
10550 * the sign of the variable and put the results in the first "n"
10551 * elements of the array "signs".
10553 * 1 means that the variable is non-negative
10554 * -1 means that the variable is non-positive
10555 * 0 means the variable attains both positive and negative values.
10557 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10558 unsigned first
, unsigned n
, int *signs
)
10560 isl_vec
*bound
= NULL
;
10561 struct isl_tab
*tab
= NULL
;
10562 struct isl_tab_undo
*snap
;
10565 if (!bset
|| !signs
)
10568 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10569 tab
= isl_tab_from_basic_set(bset
, 0);
10570 if (!bound
|| !tab
)
10573 isl_seq_clr(bound
->el
, bound
->size
);
10574 isl_int_set_si(bound
->el
[0], -1);
10576 snap
= isl_tab_snap(tab
);
10577 for (i
= 0; i
< n
; ++i
) {
10580 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10581 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10583 empty
= tab
->empty
;
10584 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10585 if (isl_tab_rollback(tab
, snap
) < 0)
10593 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10594 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10596 empty
= tab
->empty
;
10597 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10598 if (isl_tab_rollback(tab
, snap
) < 0)
10601 signs
[i
] = empty
? -1 : 0;
10605 isl_vec_free(bound
);
10609 isl_vec_free(bound
);
10613 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10614 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10616 if (!bset
|| !signs
)
10618 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10621 first
+= pos(bset
->dim
, type
) - 1;
10622 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10625 /* Is it possible for the integer division "div" to depend (possibly
10626 * indirectly) on any output dimensions?
10628 * If the div is undefined, then we conservatively assume that it
10629 * may depend on them.
10630 * Otherwise, we check if it actually depends on them or on any integer
10631 * divisions that may depend on them.
10633 static int div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10636 unsigned n_out
, o_out
;
10637 unsigned n_div
, o_div
;
10639 if (isl_int_is_zero(bmap
->div
[div
][0]))
10642 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10643 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10645 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10648 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10649 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10651 for (i
= 0; i
< n_div
; ++i
) {
10652 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10654 if (div_may_involve_output(bmap
, i
))
10661 /* Return the first integer division of "bmap" in the range
10662 * [first, first + n[ that may depend on any output dimensions and
10663 * that has a non-zero coefficient in "c" (where the first coefficient
10664 * in "c" corresponds to integer division "first").
10666 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10667 isl_int
*c
, int first
, int n
)
10674 for (k
= first
; k
< first
+ n
; ++k
) {
10675 if (isl_int_is_zero(c
[k
]))
10677 if (div_may_involve_output(bmap
, k
))
10684 /* Look for a pair of inequality constraints in "bmap" of the form
10686 * -l + i >= 0 or i >= l
10688 * n + l - i >= 0 or i <= l + n
10690 * with n < "m" and i the output dimension at position "pos".
10691 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10692 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10693 * and earlier output dimensions, as well as integer divisions that do
10694 * not involve any of the output dimensions.
10696 * Return the index of the first inequality constraint or bmap->n_ineq
10697 * if no such pair can be found.
10699 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10700 int pos
, isl_int m
)
10705 unsigned n_div
, o_div
;
10706 unsigned n_out
, o_out
;
10712 ctx
= isl_basic_map_get_ctx(bmap
);
10713 total
= isl_basic_map_total_dim(bmap
);
10714 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10715 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10716 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10717 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10718 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10719 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10721 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10722 n_out
- (pos
+ 1)) != -1)
10724 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10727 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10728 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10731 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10732 bmap
->ineq
[j
] + 1, total
))
10736 if (j
>= bmap
->n_ineq
)
10738 isl_int_add(bmap
->ineq
[i
][0],
10739 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10740 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10741 isl_int_sub(bmap
->ineq
[i
][0],
10742 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10745 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10751 return bmap
->n_ineq
;
10754 /* Return the index of the equality of "bmap" that defines
10755 * the output dimension "pos" in terms of earlier dimensions.
10756 * The equality may also involve integer divisions, as long
10757 * as those integer divisions are defined in terms of
10758 * parameters or input dimensions.
10759 * In this case, *div is set to the number of integer divisions and
10760 * *ineq is set to the number of inequality constraints (provided
10761 * div and ineq are not NULL).
10763 * The equality may also involve a single integer division involving
10764 * the output dimensions (typically only output dimension "pos") as
10765 * long as the coefficient of output dimension "pos" is 1 or -1 and
10766 * there is a pair of constraints i >= l and i <= l + n, with i referring
10767 * to output dimension "pos", l an expression involving only earlier
10768 * dimensions and n smaller than the coefficient of the integer division
10769 * in the equality. In this case, the output dimension can be defined
10770 * in terms of a modulo expression that does not involve the integer division.
10771 * *div is then set to this single integer division and
10772 * *ineq is set to the index of constraint i >= l.
10774 * Return bmap->n_eq if there is no such equality.
10775 * Return -1 on error.
10777 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10778 int pos
, int *div
, int *ineq
)
10781 unsigned n_out
, o_out
;
10782 unsigned n_div
, o_div
;
10787 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10788 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10789 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10790 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10793 *ineq
= bmap
->n_ineq
;
10796 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10797 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10799 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10800 n_out
- (pos
+ 1)) != -1)
10802 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10806 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10807 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10809 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10810 k
+ 1, n_div
- (k
+1)) < n_div
)
10812 l
= find_modulo_constraint_pair(bmap
, pos
,
10813 bmap
->eq
[j
][o_div
+ k
]);
10816 if (l
>= bmap
->n_ineq
)
10828 /* Check if the given basic map is obviously single-valued.
10829 * In particular, for each output dimension, check that there is
10830 * an equality that defines the output dimension in terms of
10831 * earlier dimensions.
10833 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10839 return isl_bool_error
;
10841 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10843 for (i
= 0; i
< n_out
; ++i
) {
10846 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
10849 return isl_bool_error
;
10850 if (eq
>= bmap
->n_eq
)
10851 return isl_bool_false
;
10854 return isl_bool_true
;
10857 /* Check if the given basic map is single-valued.
10858 * We simply compute
10862 * and check if the result is a subset of the identity mapping.
10864 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10867 isl_basic_map
*test
;
10871 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10875 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10876 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10878 space
= isl_basic_map_get_space(bmap
);
10879 space
= isl_space_map_from_set(isl_space_range(space
));
10880 id
= isl_basic_map_identity(space
);
10882 sv
= isl_basic_map_is_subset(test
, id
);
10884 isl_basic_map_free(test
);
10885 isl_basic_map_free(id
);
10890 /* Check if the given map is obviously single-valued.
10892 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10895 return isl_bool_error
;
10897 return isl_bool_true
;
10899 return isl_bool_false
;
10901 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10904 /* Check if the given map is single-valued.
10905 * We simply compute
10909 * and check if the result is a subset of the identity mapping.
10911 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
10918 sv
= isl_map_plain_is_single_valued(map
);
10922 test
= isl_map_reverse(isl_map_copy(map
));
10923 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10925 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10926 id
= isl_map_identity(dim
);
10928 sv
= isl_map_is_subset(test
, id
);
10930 isl_map_free(test
);
10936 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
10940 map
= isl_map_copy(map
);
10941 map
= isl_map_reverse(map
);
10942 in
= isl_map_is_single_valued(map
);
10948 /* Check if the given map is obviously injective.
10950 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10954 map
= isl_map_copy(map
);
10955 map
= isl_map_reverse(map
);
10956 in
= isl_map_plain_is_single_valued(map
);
10962 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
10966 sv
= isl_map_is_single_valued(map
);
10970 return isl_map_is_injective(map
);
10973 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
10975 return isl_map_is_single_valued(set_to_map(set
));
10978 /* Does "map" only map elements to themselves?
10980 * If the domain and range spaces are different, then "map"
10981 * is considered not to be an identity relation, even if it is empty.
10982 * Otherwise, construct the maximal identity relation and
10983 * check whether "map" is a subset of this relation.
10985 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
10989 isl_bool equal
, is_identity
;
10991 space
= isl_map_get_space(map
);
10992 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
10993 isl_space_free(space
);
10994 if (equal
< 0 || !equal
)
10997 id
= isl_map_identity(isl_map_get_space(map
));
10998 is_identity
= isl_map_is_subset(map
, id
);
11001 return is_identity
;
11004 int isl_map_is_translation(__isl_keep isl_map
*map
)
11009 delta
= isl_map_deltas(isl_map_copy(map
));
11010 ok
= isl_set_is_singleton(delta
);
11011 isl_set_free(delta
);
11016 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11018 if (isl_seq_first_non_zero(p
, pos
) != -1)
11020 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11025 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11034 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11037 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11038 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11039 for (j
= 0; j
< nvar
; ++j
) {
11040 int lower
= 0, upper
= 0;
11041 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11042 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11044 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11048 if (i
< bset
->n_eq
)
11050 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11051 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11053 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11055 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11060 if (!lower
|| !upper
)
11067 int isl_set_is_box(__isl_keep isl_set
*set
)
11074 return isl_basic_set_is_box(set
->p
[0]);
11077 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11080 return isl_bool_error
;
11082 return isl_space_is_wrapping(bset
->dim
);
11085 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11088 return isl_bool_error
;
11090 return isl_space_is_wrapping(set
->dim
);
11093 /* Modify the space of "map" through a call to "change".
11094 * If "can_change" is set (not NULL), then first call it to check
11095 * if the modification is allowed, printing the error message "cannot_change"
11098 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11099 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11100 const char *cannot_change
,
11101 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11109 ok
= can_change
? can_change(map
) : isl_bool_true
;
11111 return isl_map_free(map
);
11113 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11114 return isl_map_free(map
));
11116 space
= change(isl_map_get_space(map
));
11117 map
= isl_map_reset_space(map
, space
);
11122 /* Is the domain of "map" a wrapped relation?
11124 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11127 return isl_bool_error
;
11129 return isl_space_domain_is_wrapping(map
->dim
);
11132 /* Is the range of "map" a wrapped relation?
11134 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11137 return isl_bool_error
;
11139 return isl_space_range_is_wrapping(map
->dim
);
11142 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11144 bmap
= isl_basic_map_cow(bmap
);
11148 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11152 bmap
= isl_basic_map_finalize(bmap
);
11154 return bset_from_bmap(bmap
);
11156 isl_basic_map_free(bmap
);
11160 /* Given a map A -> B, return the set (A -> B).
11162 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11164 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11167 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11169 bset
= isl_basic_set_cow(bset
);
11173 bset
->dim
= isl_space_unwrap(bset
->dim
);
11177 bset
= isl_basic_set_finalize(bset
);
11179 return bset_to_bmap(bset
);
11181 isl_basic_set_free(bset
);
11185 /* Given a set (A -> B), return the map A -> B.
11186 * Error out if "set" is not of the form (A -> B).
11188 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11190 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11191 "not a wrapping set", &isl_space_unwrap
);
11194 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11195 enum isl_dim_type type
)
11200 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11203 bmap
= isl_basic_map_cow(bmap
);
11207 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11211 bmap
= isl_basic_map_finalize(bmap
);
11215 isl_basic_map_free(bmap
);
11219 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11220 enum isl_dim_type type
)
11227 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11230 map
= isl_map_cow(map
);
11234 for (i
= 0; i
< map
->n
; ++i
) {
11235 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11239 map
->dim
= isl_space_reset(map
->dim
, type
);
11249 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11254 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11257 bmap
= isl_basic_map_cow(bmap
);
11261 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11265 bmap
= isl_basic_map_finalize(bmap
);
11269 isl_basic_map_free(bmap
);
11273 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11275 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11278 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11279 __isl_take isl_basic_map
*bmap
)
11284 if (!bmap
->dim
->nested
[0])
11287 bmap
= isl_basic_map_cow(bmap
);
11291 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11295 bmap
= isl_basic_map_finalize(bmap
);
11299 isl_basic_map_free(bmap
);
11303 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11304 __isl_take isl_basic_map
*bmap
)
11309 if (!bmap
->dim
->nested
[1])
11312 bmap
= isl_basic_map_cow(bmap
);
11316 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11320 bmap
= isl_basic_map_finalize(bmap
);
11324 isl_basic_map_free(bmap
);
11328 /* Remove any internal structure from the spaces of domain and range of "map".
11330 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11335 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11338 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11341 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11343 return set_from_map(isl_map_flatten(set_to_map(set
)));
11346 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11348 isl_space
*dim
, *flat_dim
;
11351 dim
= isl_set_get_space(set
);
11352 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11353 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11354 map
= isl_map_intersect_domain(map
, set
);
11359 /* Remove any internal structure from the space of the domain of "map".
11361 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11366 if (!map
->dim
->nested
[0])
11369 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11372 /* Remove any internal structure from the space of the range of "map".
11374 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11379 if (!map
->dim
->nested
[1])
11382 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11385 /* Reorder the dimensions of "bmap" according to the given dim_map
11386 * and set the dimension specification to "dim" and
11387 * perform Gaussian elimination on the result.
11389 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11390 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11392 isl_basic_map
*res
;
11395 bmap
= isl_basic_map_cow(bmap
);
11396 if (!bmap
|| !dim
|| !dim_map
)
11399 flags
= bmap
->flags
;
11400 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11401 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11402 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11403 res
= isl_basic_map_alloc_space(dim
,
11404 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11405 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11407 res
->flags
= flags
;
11408 res
= isl_basic_map_gauss(res
, NULL
);
11409 res
= isl_basic_map_finalize(res
);
11413 isl_basic_map_free(bmap
);
11414 isl_space_free(dim
);
11418 /* Reorder the dimensions of "map" according to given reordering.
11420 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11421 __isl_take isl_reordering
*r
)
11424 struct isl_dim_map
*dim_map
;
11426 map
= isl_map_cow(map
);
11427 dim_map
= isl_dim_map_from_reordering(r
);
11428 if (!map
|| !r
|| !dim_map
)
11431 for (i
= 0; i
< map
->n
; ++i
) {
11432 struct isl_dim_map
*dim_map_i
;
11434 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11436 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11437 isl_space_copy(r
->dim
), dim_map_i
);
11443 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11445 isl_reordering_free(r
);
11451 isl_reordering_free(r
);
11455 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11456 __isl_take isl_reordering
*r
)
11458 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11461 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11462 __isl_take isl_space
*model
)
11466 if (!map
|| !model
)
11469 ctx
= isl_space_get_ctx(model
);
11470 if (!isl_space_has_named_params(model
))
11471 isl_die(ctx
, isl_error_invalid
,
11472 "model has unnamed parameters", goto error
);
11473 if (!isl_space_has_named_params(map
->dim
))
11474 isl_die(ctx
, isl_error_invalid
,
11475 "relation has unnamed parameters", goto error
);
11476 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11477 isl_reordering
*exp
;
11479 model
= isl_space_drop_dims(model
, isl_dim_in
,
11480 0, isl_space_dim(model
, isl_dim_in
));
11481 model
= isl_space_drop_dims(model
, isl_dim_out
,
11482 0, isl_space_dim(model
, isl_dim_out
));
11483 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11484 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11485 map
= isl_map_realign(map
, exp
);
11488 isl_space_free(model
);
11491 isl_space_free(model
);
11496 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11497 __isl_take isl_space
*model
)
11499 return isl_map_align_params(set
, model
);
11502 /* Align the parameters of "bmap" to those of "model", introducing
11503 * additional parameters if needed.
11505 __isl_give isl_basic_map
*isl_basic_map_align_params(
11506 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11510 if (!bmap
|| !model
)
11513 ctx
= isl_space_get_ctx(model
);
11514 if (!isl_space_has_named_params(model
))
11515 isl_die(ctx
, isl_error_invalid
,
11516 "model has unnamed parameters", goto error
);
11517 if (!isl_space_has_named_params(bmap
->dim
))
11518 isl_die(ctx
, isl_error_invalid
,
11519 "relation has unnamed parameters", goto error
);
11520 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11521 isl_reordering
*exp
;
11522 struct isl_dim_map
*dim_map
;
11524 model
= isl_space_drop_dims(model
, isl_dim_in
,
11525 0, isl_space_dim(model
, isl_dim_in
));
11526 model
= isl_space_drop_dims(model
, isl_dim_out
,
11527 0, isl_space_dim(model
, isl_dim_out
));
11528 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11529 exp
= isl_reordering_extend_space(exp
,
11530 isl_basic_map_get_space(bmap
));
11531 dim_map
= isl_dim_map_from_reordering(exp
);
11532 bmap
= isl_basic_map_realign(bmap
,
11533 exp
? isl_space_copy(exp
->dim
) : NULL
,
11534 isl_dim_map_extend(dim_map
, bmap
));
11535 isl_reordering_free(exp
);
11539 isl_space_free(model
);
11542 isl_space_free(model
);
11543 isl_basic_map_free(bmap
);
11547 /* Align the parameters of "bset" to those of "model", introducing
11548 * additional parameters if needed.
11550 __isl_give isl_basic_set
*isl_basic_set_align_params(
11551 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11553 return isl_basic_map_align_params(bset
, model
);
11556 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11557 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11558 enum isl_dim_type c2
, enum isl_dim_type c3
,
11559 enum isl_dim_type c4
, enum isl_dim_type c5
)
11561 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11562 struct isl_mat
*mat
;
11568 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11569 isl_basic_map_total_dim(bmap
) + 1);
11572 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11573 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11574 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11575 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11576 isl_int_set(mat
->row
[i
][pos
],
11577 bmap
->eq
[i
][off
+ k
]);
11585 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11586 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11587 enum isl_dim_type c2
, enum isl_dim_type c3
,
11588 enum isl_dim_type c4
, enum isl_dim_type c5
)
11590 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11591 struct isl_mat
*mat
;
11597 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11598 isl_basic_map_total_dim(bmap
) + 1);
11601 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11602 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11603 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11604 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11605 isl_int_set(mat
->row
[i
][pos
],
11606 bmap
->ineq
[i
][off
+ k
]);
11614 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11615 __isl_take isl_space
*dim
,
11616 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11617 enum isl_dim_type c2
, enum isl_dim_type c3
,
11618 enum isl_dim_type c4
, enum isl_dim_type c5
)
11620 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11621 isl_basic_map
*bmap
;
11627 if (!dim
|| !eq
|| !ineq
)
11630 if (eq
->n_col
!= ineq
->n_col
)
11631 isl_die(dim
->ctx
, isl_error_invalid
,
11632 "equalities and inequalities matrices should have "
11633 "same number of columns", goto error
);
11635 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11637 if (eq
->n_col
< total
)
11638 isl_die(dim
->ctx
, isl_error_invalid
,
11639 "number of columns too small", goto error
);
11641 extra
= eq
->n_col
- total
;
11643 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11644 eq
->n_row
, ineq
->n_row
);
11647 for (i
= 0; i
< extra
; ++i
) {
11648 k
= isl_basic_map_alloc_div(bmap
);
11651 isl_int_set_si(bmap
->div
[k
][0], 0);
11653 for (i
= 0; i
< eq
->n_row
; ++i
) {
11654 l
= isl_basic_map_alloc_equality(bmap
);
11657 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11658 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11659 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11660 isl_int_set(bmap
->eq
[l
][off
+ k
],
11666 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11667 l
= isl_basic_map_alloc_inequality(bmap
);
11670 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11671 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11672 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11673 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11674 ineq
->row
[i
][pos
]);
11680 isl_space_free(dim
);
11682 isl_mat_free(ineq
);
11684 bmap
= isl_basic_map_simplify(bmap
);
11685 return isl_basic_map_finalize(bmap
);
11687 isl_space_free(dim
);
11689 isl_mat_free(ineq
);
11693 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11694 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11695 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11697 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11698 c1
, c2
, c3
, c4
, isl_dim_in
);
11701 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11702 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11703 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11705 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11706 c1
, c2
, c3
, c4
, isl_dim_in
);
11709 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11710 __isl_take isl_space
*dim
,
11711 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11712 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11714 isl_basic_map
*bmap
;
11715 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11716 c1
, c2
, c3
, c4
, isl_dim_in
);
11717 return bset_from_bmap(bmap
);
11720 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11723 return isl_bool_error
;
11725 return isl_space_can_zip(bmap
->dim
);
11728 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11731 return isl_bool_error
;
11733 return isl_space_can_zip(map
->dim
);
11736 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11737 * (A -> C) -> (B -> D).
11739 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11748 if (!isl_basic_map_can_zip(bmap
))
11749 isl_die(bmap
->ctx
, isl_error_invalid
,
11750 "basic map cannot be zipped", goto error
);
11751 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11752 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11753 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11754 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11755 bmap
= isl_basic_map_cow(bmap
);
11756 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11759 bmap
->dim
= isl_space_zip(bmap
->dim
);
11762 bmap
= isl_basic_map_mark_final(bmap
);
11765 isl_basic_map_free(bmap
);
11769 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11770 * (A -> C) -> (B -> D).
11772 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11779 if (!isl_map_can_zip(map
))
11780 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11783 map
= isl_map_cow(map
);
11787 for (i
= 0; i
< map
->n
; ++i
) {
11788 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11793 map
->dim
= isl_space_zip(map
->dim
);
11803 /* Can we apply isl_basic_map_curry to "bmap"?
11804 * That is, does it have a nested relation in its domain?
11806 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11809 return isl_bool_error
;
11811 return isl_space_can_curry(bmap
->dim
);
11814 /* Can we apply isl_map_curry to "map"?
11815 * That is, does it have a nested relation in its domain?
11817 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
11820 return isl_bool_error
;
11822 return isl_space_can_curry(map
->dim
);
11825 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11828 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11834 if (!isl_basic_map_can_curry(bmap
))
11835 isl_die(bmap
->ctx
, isl_error_invalid
,
11836 "basic map cannot be curried", goto error
);
11837 bmap
= isl_basic_map_cow(bmap
);
11840 bmap
->dim
= isl_space_curry(bmap
->dim
);
11843 bmap
= isl_basic_map_mark_final(bmap
);
11846 isl_basic_map_free(bmap
);
11850 /* Given a map (A -> B) -> C, return the corresponding map
11853 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11855 return isl_map_change_space(map
, &isl_map_can_curry
,
11856 "map cannot be curried", &isl_space_curry
);
11859 /* Can isl_map_range_curry be applied to "map"?
11860 * That is, does it have a nested relation in its range,
11861 * the domain of which is itself a nested relation?
11863 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
11866 return isl_bool_error
;
11868 return isl_space_can_range_curry(map
->dim
);
11871 /* Given a map A -> ((B -> C) -> D), return the corresponding map
11872 * A -> (B -> (C -> D)).
11874 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
11876 return isl_map_change_space(map
, &isl_map_can_range_curry
,
11877 "map range cannot be curried",
11878 &isl_space_range_curry
);
11881 /* Can we apply isl_basic_map_uncurry to "bmap"?
11882 * That is, does it have a nested relation in its domain?
11884 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11887 return isl_bool_error
;
11889 return isl_space_can_uncurry(bmap
->dim
);
11892 /* Can we apply isl_map_uncurry to "map"?
11893 * That is, does it have a nested relation in its domain?
11895 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
11898 return isl_bool_error
;
11900 return isl_space_can_uncurry(map
->dim
);
11903 /* Given a basic map A -> (B -> C), return the corresponding basic map
11906 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11912 if (!isl_basic_map_can_uncurry(bmap
))
11913 isl_die(bmap
->ctx
, isl_error_invalid
,
11914 "basic map cannot be uncurried",
11915 return isl_basic_map_free(bmap
));
11916 bmap
= isl_basic_map_cow(bmap
);
11919 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11921 return isl_basic_map_free(bmap
);
11922 bmap
= isl_basic_map_mark_final(bmap
);
11926 /* Given a map A -> (B -> C), return the corresponding map
11929 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11931 return isl_map_change_space(map
, &isl_map_can_uncurry
,
11932 "map cannot be uncurried", &isl_space_uncurry
);
11935 /* Construct a basic map mapping the domain of the affine expression
11936 * to a one-dimensional range prescribed by the affine expression.
11937 * If "rational" is set, then construct a rational basic map.
11939 * A NaN affine expression cannot be converted to a basic map.
11941 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
11942 __isl_take isl_aff
*aff
, int rational
)
11947 isl_local_space
*ls
;
11948 isl_basic_map
*bmap
= NULL
;
11952 is_nan
= isl_aff_is_nan(aff
);
11956 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
11957 "cannot convert NaN", goto error
);
11959 ls
= isl_aff_get_local_space(aff
);
11960 bmap
= isl_basic_map_from_local_space(ls
);
11961 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11962 k
= isl_basic_map_alloc_equality(bmap
);
11966 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11967 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11968 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11969 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11970 aff
->v
->size
- (pos
+ 1));
11974 bmap
= isl_basic_map_set_rational(bmap
);
11975 bmap
= isl_basic_map_finalize(bmap
);
11979 isl_basic_map_free(bmap
);
11983 /* Construct a basic map mapping the domain of the affine expression
11984 * to a one-dimensional range prescribed by the affine expression.
11986 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11988 return isl_basic_map_from_aff2(aff
, 0);
11991 /* Construct a map mapping the domain of the affine expression
11992 * to a one-dimensional range prescribed by the affine expression.
11994 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11996 isl_basic_map
*bmap
;
11998 bmap
= isl_basic_map_from_aff(aff
);
11999 return isl_map_from_basic_map(bmap
);
12002 /* Construct a basic map mapping the domain the multi-affine expression
12003 * to its range, with each dimension in the range equated to the
12004 * corresponding affine expression.
12005 * If "rational" is set, then construct a rational basic map.
12007 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12008 __isl_take isl_multi_aff
*maff
, int rational
)
12012 isl_basic_map
*bmap
;
12017 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12018 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12019 "invalid space", goto error
);
12021 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12022 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12024 bmap
= isl_basic_map_set_rational(bmap
);
12026 for (i
= 0; i
< maff
->n
; ++i
) {
12028 isl_basic_map
*bmap_i
;
12030 aff
= isl_aff_copy(maff
->p
[i
]);
12031 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12033 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12036 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12038 isl_multi_aff_free(maff
);
12041 isl_multi_aff_free(maff
);
12045 /* Construct a basic map mapping the domain the multi-affine expression
12046 * to its range, with each dimension in the range equated to the
12047 * corresponding affine expression.
12049 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12050 __isl_take isl_multi_aff
*ma
)
12052 return isl_basic_map_from_multi_aff2(ma
, 0);
12055 /* Construct a map mapping the domain the multi-affine expression
12056 * to its range, with each dimension in the range equated to the
12057 * corresponding affine expression.
12059 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12061 isl_basic_map
*bmap
;
12063 bmap
= isl_basic_map_from_multi_aff(maff
);
12064 return isl_map_from_basic_map(bmap
);
12067 /* Construct a basic map mapping a domain in the given space to
12068 * to an n-dimensional range, with n the number of elements in the list,
12069 * where each coordinate in the range is prescribed by the
12070 * corresponding affine expression.
12071 * The domains of all affine expressions in the list are assumed to match
12074 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12075 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12079 isl_basic_map
*bmap
;
12084 dim
= isl_space_from_domain(domain_dim
);
12085 bmap
= isl_basic_map_universe(dim
);
12087 for (i
= 0; i
< list
->n
; ++i
) {
12089 isl_basic_map
*bmap_i
;
12091 aff
= isl_aff_copy(list
->p
[i
]);
12092 bmap_i
= isl_basic_map_from_aff(aff
);
12094 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12097 isl_aff_list_free(list
);
12101 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12102 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12104 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12107 /* Construct a basic map where the given dimensions are equal to each other.
12109 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12110 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12112 isl_basic_map
*bmap
= NULL
;
12118 if (pos1
>= isl_space_dim(space
, type1
))
12119 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12120 "index out of bounds", goto error
);
12121 if (pos2
>= isl_space_dim(space
, type2
))
12122 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12123 "index out of bounds", goto error
);
12125 if (type1
== type2
&& pos1
== pos2
)
12126 return isl_basic_map_universe(space
);
12128 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12129 i
= isl_basic_map_alloc_equality(bmap
);
12132 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12133 pos1
+= isl_basic_map_offset(bmap
, type1
);
12134 pos2
+= isl_basic_map_offset(bmap
, type2
);
12135 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12136 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12137 bmap
= isl_basic_map_finalize(bmap
);
12138 isl_space_free(space
);
12141 isl_space_free(space
);
12142 isl_basic_map_free(bmap
);
12146 /* Add a constraint imposing that the given two dimensions are equal.
12148 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12149 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12153 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12155 bmap
= isl_basic_map_intersect(bmap
, eq
);
12160 /* Add a constraint imposing that the given two dimensions are equal.
12162 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12163 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12165 isl_basic_map
*bmap
;
12167 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12169 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12174 /* Add a constraint imposing that the given two dimensions have opposite values.
12176 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12177 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12179 isl_basic_map
*bmap
= NULL
;
12185 if (pos1
>= isl_map_dim(map
, type1
))
12186 isl_die(map
->ctx
, isl_error_invalid
,
12187 "index out of bounds", goto error
);
12188 if (pos2
>= isl_map_dim(map
, type2
))
12189 isl_die(map
->ctx
, isl_error_invalid
,
12190 "index out of bounds", goto error
);
12192 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12193 i
= isl_basic_map_alloc_equality(bmap
);
12196 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12197 pos1
+= isl_basic_map_offset(bmap
, type1
);
12198 pos2
+= isl_basic_map_offset(bmap
, type2
);
12199 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12200 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12201 bmap
= isl_basic_map_finalize(bmap
);
12203 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12207 isl_basic_map_free(bmap
);
12212 /* Construct a constraint imposing that the value of the first dimension is
12213 * greater than or equal to that of the second.
12215 static __isl_give isl_constraint
*constraint_order_ge(
12216 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12217 enum isl_dim_type type2
, int pos2
)
12224 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12226 if (pos1
>= isl_constraint_dim(c
, type1
))
12227 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12228 "index out of bounds", return isl_constraint_free(c
));
12229 if (pos2
>= isl_constraint_dim(c
, type2
))
12230 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12231 "index out of bounds", return isl_constraint_free(c
));
12233 if (type1
== type2
&& pos1
== pos2
)
12236 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12237 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12242 /* Add a constraint imposing that the value of the first dimension is
12243 * greater than or equal to that of the second.
12245 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12246 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12251 if (type1
== type2
&& pos1
== pos2
)
12253 space
= isl_basic_map_get_space(bmap
);
12254 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12255 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12260 /* Add a constraint imposing that the value of the first dimension is
12261 * greater than or equal to that of the second.
12263 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12264 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12269 if (type1
== type2
&& pos1
== pos2
)
12271 space
= isl_map_get_space(map
);
12272 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12273 map
= isl_map_add_constraint(map
, c
);
12278 /* Add a constraint imposing that the value of the first dimension is
12279 * less than or equal to that of the second.
12281 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12282 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12284 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12287 /* Construct a basic map where the value of the first dimension is
12288 * greater than that of the second.
12290 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12291 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12293 isl_basic_map
*bmap
= NULL
;
12299 if (pos1
>= isl_space_dim(space
, type1
))
12300 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12301 "index out of bounds", goto error
);
12302 if (pos2
>= isl_space_dim(space
, type2
))
12303 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12304 "index out of bounds", goto error
);
12306 if (type1
== type2
&& pos1
== pos2
)
12307 return isl_basic_map_empty(space
);
12309 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12310 i
= isl_basic_map_alloc_inequality(bmap
);
12312 return isl_basic_map_free(bmap
);
12313 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12314 pos1
+= isl_basic_map_offset(bmap
, type1
);
12315 pos2
+= isl_basic_map_offset(bmap
, type2
);
12316 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12317 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12318 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12319 bmap
= isl_basic_map_finalize(bmap
);
12323 isl_space_free(space
);
12324 isl_basic_map_free(bmap
);
12328 /* Add a constraint imposing that the value of the first dimension is
12329 * greater than that of the second.
12331 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12332 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12336 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12338 bmap
= isl_basic_map_intersect(bmap
, gt
);
12343 /* Add a constraint imposing that the value of the first dimension is
12344 * greater than that of the second.
12346 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12347 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12349 isl_basic_map
*bmap
;
12351 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12353 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12358 /* Add a constraint imposing that the value of the first dimension is
12359 * smaller than that of the second.
12361 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12362 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12364 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12367 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12371 isl_local_space
*ls
;
12376 if (!isl_basic_map_divs_known(bmap
))
12377 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12378 "some divs are unknown", return NULL
);
12380 ls
= isl_basic_map_get_local_space(bmap
);
12381 div
= isl_local_space_get_div(ls
, pos
);
12382 isl_local_space_free(ls
);
12387 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12390 return isl_basic_map_get_div(bset
, pos
);
12393 /* Plug in "subs" for dimension "type", "pos" of "bset".
12395 * Let i be the dimension to replace and let "subs" be of the form
12399 * Any integer division with a non-zero coefficient for i,
12401 * floor((a i + g)/m)
12405 * floor((a f + d g)/(m d))
12407 * Constraints of the form
12415 * We currently require that "subs" is an integral expression.
12416 * Handling rational expressions may require us to add stride constraints
12417 * as we do in isl_basic_set_preimage_multi_aff.
12419 __isl_give isl_basic_set
*isl_basic_set_substitute(
12420 __isl_take isl_basic_set
*bset
,
12421 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12427 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12430 bset
= isl_basic_set_cow(bset
);
12431 if (!bset
|| !subs
)
12434 ctx
= isl_basic_set_get_ctx(bset
);
12435 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12436 isl_die(ctx
, isl_error_invalid
,
12437 "spaces don't match", goto error
);
12438 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12439 isl_die(ctx
, isl_error_unsupported
,
12440 "cannot handle divs yet", goto error
);
12441 if (!isl_int_is_one(subs
->v
->el
[0]))
12442 isl_die(ctx
, isl_error_invalid
,
12443 "can only substitute integer expressions", goto error
);
12445 pos
+= isl_basic_set_offset(bset
, type
);
12449 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12450 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12452 isl_int_set(v
, bset
->eq
[i
][pos
]);
12453 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12454 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12455 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12458 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12459 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12461 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12462 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12463 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12464 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12467 for (i
= 0; i
< bset
->n_div
; ++i
) {
12468 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12470 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12471 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12472 isl_seq_combine(bset
->div
[i
] + 1,
12473 subs
->v
->el
[0], bset
->div
[i
] + 1,
12474 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12475 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12480 bset
= isl_basic_set_simplify(bset
);
12481 return isl_basic_set_finalize(bset
);
12483 isl_basic_set_free(bset
);
12487 /* Plug in "subs" for dimension "type", "pos" of "set".
12489 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12490 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12494 if (set
&& isl_set_plain_is_empty(set
))
12497 set
= isl_set_cow(set
);
12501 for (i
= set
->n
- 1; i
>= 0; --i
) {
12502 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12503 if (remove_if_empty(set
, i
) < 0)
12513 /* Check if the range of "ma" is compatible with the domain or range
12514 * (depending on "type") of "bmap".
12515 * Return -1 if anything is wrong.
12517 static int check_basic_map_compatible_range_multi_aff(
12518 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12519 __isl_keep isl_multi_aff
*ma
)
12522 isl_space
*ma_space
;
12524 ma_space
= isl_multi_aff_get_space(ma
);
12526 m
= isl_space_match(bmap
->dim
, isl_dim_param
, ma_space
, isl_dim_param
);
12530 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12531 "parameters don't match", goto error
);
12532 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12536 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12537 "spaces don't match", goto error
);
12539 isl_space_free(ma_space
);
12542 isl_space_free(ma_space
);
12546 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12547 * coefficients before the transformed range of dimensions,
12548 * the "n_after" coefficients after the transformed range of dimensions
12549 * and the coefficients of the other divs in "bmap".
12551 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12552 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12557 isl_local_space
*ls
;
12562 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12566 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12567 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12568 for (i
= 0; i
< n_div
; ++i
) {
12569 int o_bmap
= 0, o_ls
= 0;
12571 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12572 o_bmap
+= 1 + 1 + n_param
;
12573 o_ls
+= 1 + 1 + n_param
;
12574 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12575 o_bmap
+= n_before
;
12576 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12577 ls
->div
->row
[i
] + o_ls
, n_set
);
12580 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12582 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12583 ls
->div
->row
[i
] + o_ls
, n_div
);
12586 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12587 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
12591 isl_local_space_free(ls
);
12594 isl_local_space_free(ls
);
12598 /* How many stride constraints does "ma" enforce?
12599 * That is, how many of the affine expressions have a denominator
12600 * different from one?
12602 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12607 for (i
= 0; i
< ma
->n
; ++i
)
12608 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12614 /* For each affine expression in ma of the form
12616 * x_i = (f_i y + h_i)/m_i
12618 * with m_i different from one, add a constraint to "bmap"
12621 * f_i y + h_i = m_i alpha_i
12623 * with alpha_i an additional existentially quantified variable.
12625 * The input variables of "ma" correspond to a subset of the variables
12626 * of "bmap". There are "n_before" variables in "bmap" before this
12627 * subset and "n_after" variables after this subset.
12628 * The integer divisions of the affine expressions in "ma" are assumed
12629 * to have been aligned. There are "n_div_ma" of them and
12630 * they appear first in "bmap", straight after the "n_after" variables.
12632 static __isl_give isl_basic_map
*add_ma_strides(
12633 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12634 int n_before
, int n_after
, int n_div_ma
)
12642 total
= isl_basic_map_total_dim(bmap
);
12643 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12644 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12645 for (i
= 0; i
< ma
->n
; ++i
) {
12646 int o_bmap
= 0, o_ma
= 1;
12648 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12650 div
= isl_basic_map_alloc_div(bmap
);
12651 k
= isl_basic_map_alloc_equality(bmap
);
12652 if (div
< 0 || k
< 0)
12654 isl_int_set_si(bmap
->div
[div
][0], 0);
12655 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12656 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12657 o_bmap
+= 1 + n_param
;
12658 o_ma
+= 1 + n_param
;
12659 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12660 o_bmap
+= n_before
;
12661 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12662 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12665 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12667 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12668 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12669 o_bmap
+= n_div_ma
;
12671 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12672 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12678 isl_basic_map_free(bmap
);
12682 /* Replace the domain or range space (depending on "type) of "space" by "set".
12684 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12685 enum isl_dim_type type
, __isl_take isl_space
*set
)
12687 if (type
== isl_dim_in
) {
12688 space
= isl_space_range(space
);
12689 space
= isl_space_map_from_domain_and_range(set
, space
);
12691 space
= isl_space_domain(space
);
12692 space
= isl_space_map_from_domain_and_range(space
, set
);
12698 /* Compute the preimage of the domain or range (depending on "type")
12699 * of "bmap" under the function represented by "ma".
12700 * In other words, plug in "ma" in the domain or range of "bmap".
12701 * The result is a basic map that lives in the same space as "bmap"
12702 * except that the domain or range has been replaced by
12703 * the domain space of "ma".
12705 * If bmap is represented by
12707 * A(p) + S u + B x + T v + C(divs) >= 0,
12709 * where u and x are input and output dimensions if type == isl_dim_out
12710 * while x and v are input and output dimensions if type == isl_dim_in,
12711 * and ma is represented by
12713 * x = D(p) + F(y) + G(divs')
12715 * then the result is
12717 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12719 * The divs in the input set are similarly adjusted.
12722 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12726 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12727 * B_i G(divs') + c_i(divs))/n_i)
12729 * If bmap is not a rational map and if F(y) involves any denominators
12731 * x_i = (f_i y + h_i)/m_i
12733 * then additional constraints are added to ensure that we only
12734 * map back integer points. That is we enforce
12736 * f_i y + h_i = m_i alpha_i
12738 * with alpha_i an additional existentially quantified variable.
12740 * We first copy over the divs from "ma".
12741 * Then we add the modified constraints and divs from "bmap".
12742 * Finally, we add the stride constraints, if needed.
12744 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12745 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12746 __isl_take isl_multi_aff
*ma
)
12750 isl_basic_map
*res
= NULL
;
12751 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12752 isl_int f
, c1
, c2
, g
;
12753 int rational
, strides
;
12760 ma
= isl_multi_aff_align_divs(ma
);
12763 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12766 if (type
== isl_dim_in
) {
12768 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12770 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12773 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12774 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12776 space
= isl_multi_aff_get_domain_space(ma
);
12777 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12778 rational
= isl_basic_map_is_rational(bmap
);
12779 strides
= rational
? 0 : multi_aff_strides(ma
);
12780 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12781 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12783 res
= isl_basic_map_set_rational(res
);
12785 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12786 if (isl_basic_map_alloc_div(res
) < 0)
12789 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12792 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12793 k
= isl_basic_map_alloc_equality(res
);
12796 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12797 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12800 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12801 k
= isl_basic_map_alloc_inequality(res
);
12804 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12805 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12808 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12809 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12810 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12813 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12814 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12819 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12825 isl_basic_map_free(bmap
);
12826 isl_multi_aff_free(ma
);
12827 res
= isl_basic_set_simplify(res
);
12828 return isl_basic_map_finalize(res
);
12834 isl_basic_map_free(bmap
);
12835 isl_multi_aff_free(ma
);
12836 isl_basic_map_free(res
);
12840 /* Compute the preimage of "bset" under the function represented by "ma".
12841 * In other words, plug in "ma" in "bset". The result is a basic set
12842 * that lives in the domain space of "ma".
12844 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12845 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12847 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12850 /* Compute the preimage of the domain of "bmap" under the function
12851 * represented by "ma".
12852 * In other words, plug in "ma" in the domain of "bmap".
12853 * The result is a basic map that lives in the same space as "bmap"
12854 * except that the domain has been replaced by the domain space of "ma".
12856 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12857 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12859 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12862 /* Compute the preimage of the range of "bmap" under the function
12863 * represented by "ma".
12864 * In other words, plug in "ma" in the range of "bmap".
12865 * The result is a basic map that lives in the same space as "bmap"
12866 * except that the range has been replaced by the domain space of "ma".
12868 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12869 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12871 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12874 /* Check if the range of "ma" is compatible with the domain or range
12875 * (depending on "type") of "map".
12876 * Return -1 if anything is wrong.
12878 static int check_map_compatible_range_multi_aff(
12879 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12880 __isl_keep isl_multi_aff
*ma
)
12883 isl_space
*ma_space
;
12885 ma_space
= isl_multi_aff_get_space(ma
);
12886 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12887 isl_space_free(ma_space
);
12889 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12890 "spaces don't match", return -1);
12894 /* Compute the preimage of the domain or range (depending on "type")
12895 * of "map" under the function represented by "ma".
12896 * In other words, plug in "ma" in the domain or range of "map".
12897 * The result is a map that lives in the same space as "map"
12898 * except that the domain or range has been replaced by
12899 * the domain space of "ma".
12901 * The parameters are assumed to have been aligned.
12903 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12904 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12909 map
= isl_map_cow(map
);
12910 ma
= isl_multi_aff_align_divs(ma
);
12913 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12916 for (i
= 0; i
< map
->n
; ++i
) {
12917 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12918 isl_multi_aff_copy(ma
));
12923 space
= isl_multi_aff_get_domain_space(ma
);
12924 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
12926 isl_space_free(map
->dim
);
12931 isl_multi_aff_free(ma
);
12933 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12934 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12937 isl_multi_aff_free(ma
);
12942 /* Compute the preimage of the domain or range (depending on "type")
12943 * of "map" under the function represented by "ma".
12944 * In other words, plug in "ma" in the domain or range of "map".
12945 * The result is a map that lives in the same space as "map"
12946 * except that the domain or range has been replaced by
12947 * the domain space of "ma".
12949 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12950 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12955 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
12956 return map_preimage_multi_aff(map
, type
, ma
);
12958 if (!isl_space_has_named_params(map
->dim
) ||
12959 !isl_space_has_named_params(ma
->space
))
12960 isl_die(map
->ctx
, isl_error_invalid
,
12961 "unaligned unnamed parameters", goto error
);
12962 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12963 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12965 return map_preimage_multi_aff(map
, type
, ma
);
12967 isl_multi_aff_free(ma
);
12968 return isl_map_free(map
);
12971 /* Compute the preimage of "set" under the function represented by "ma".
12972 * In other words, plug in "ma" in "set". The result is a set
12973 * that lives in the domain space of "ma".
12975 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12976 __isl_take isl_multi_aff
*ma
)
12978 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12981 /* Compute the preimage of the domain of "map" under the function
12982 * represented by "ma".
12983 * In other words, plug in "ma" in the domain of "map".
12984 * The result is a map that lives in the same space as "map"
12985 * except that the domain has been replaced by the domain space of "ma".
12987 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12988 __isl_take isl_multi_aff
*ma
)
12990 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12993 /* Compute the preimage of the range of "map" under the function
12994 * represented by "ma".
12995 * In other words, plug in "ma" in the range of "map".
12996 * The result is a map that lives in the same space as "map"
12997 * except that the range has been replaced by the domain space of "ma".
12999 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
13000 __isl_take isl_multi_aff
*ma
)
13002 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13005 /* Compute the preimage of "map" under the function represented by "pma".
13006 * In other words, plug in "pma" in the domain or range of "map".
13007 * The result is a map that lives in the same space as "map",
13008 * except that the space of type "type" has been replaced by
13009 * the domain space of "pma".
13011 * The parameters of "map" and "pma" are assumed to have been aligned.
13013 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13014 __isl_take isl_map
*map
, enum isl_dim_type type
,
13015 __isl_take isl_pw_multi_aff
*pma
)
13024 isl_pw_multi_aff_free(pma
);
13025 res
= isl_map_empty(isl_map_get_space(map
));
13030 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13031 isl_multi_aff_copy(pma
->p
[0].maff
));
13032 if (type
== isl_dim_in
)
13033 res
= isl_map_intersect_domain(res
,
13034 isl_map_copy(pma
->p
[0].set
));
13036 res
= isl_map_intersect_range(res
,
13037 isl_map_copy(pma
->p
[0].set
));
13039 for (i
= 1; i
< pma
->n
; ++i
) {
13042 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13043 isl_multi_aff_copy(pma
->p
[i
].maff
));
13044 if (type
== isl_dim_in
)
13045 res_i
= isl_map_intersect_domain(res_i
,
13046 isl_map_copy(pma
->p
[i
].set
));
13048 res_i
= isl_map_intersect_range(res_i
,
13049 isl_map_copy(pma
->p
[i
].set
));
13050 res
= isl_map_union(res
, res_i
);
13053 isl_pw_multi_aff_free(pma
);
13057 isl_pw_multi_aff_free(pma
);
13062 /* Compute the preimage of "map" under the function represented by "pma".
13063 * In other words, plug in "pma" in the domain or range of "map".
13064 * The result is a map that lives in the same space as "map",
13065 * except that the space of type "type" has been replaced by
13066 * the domain space of "pma".
13068 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13069 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13074 if (isl_space_match(map
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
13075 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13077 if (!isl_space_has_named_params(map
->dim
) ||
13078 !isl_space_has_named_params(pma
->dim
))
13079 isl_die(map
->ctx
, isl_error_invalid
,
13080 "unaligned unnamed parameters", goto error
);
13081 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13082 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13084 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13086 isl_pw_multi_aff_free(pma
);
13087 return isl_map_free(map
);
13090 /* Compute the preimage of "set" under the function represented by "pma".
13091 * In other words, plug in "pma" in "set". The result is a set
13092 * that lives in the domain space of "pma".
13094 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13095 __isl_take isl_pw_multi_aff
*pma
)
13097 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13100 /* Compute the preimage of the domain of "map" under the function
13101 * represented by "pma".
13102 * In other words, plug in "pma" in the domain of "map".
13103 * The result is a map that lives in the same space as "map",
13104 * except that domain space has been replaced by the domain space of "pma".
13106 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13107 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13109 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13112 /* Compute the preimage of the range of "map" under the function
13113 * represented by "pma".
13114 * In other words, plug in "pma" in the range of "map".
13115 * The result is a map that lives in the same space as "map",
13116 * except that range space has been replaced by the domain space of "pma".
13118 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13119 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13121 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13124 /* Compute the preimage of "map" under the function represented by "mpa".
13125 * In other words, plug in "mpa" in the domain or range of "map".
13126 * The result is a map that lives in the same space as "map",
13127 * except that the space of type "type" has been replaced by
13128 * the domain space of "mpa".
13130 * If the map does not involve any constraints that refer to the
13131 * dimensions of the substituted space, then the only possible
13132 * effect of "mpa" on the map is to map the space to a different space.
13133 * We create a separate isl_multi_aff to effectuate this change
13134 * in order to avoid spurious splitting of the map along the pieces
13137 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13138 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13141 isl_pw_multi_aff
*pma
;
13146 n
= isl_map_dim(map
, type
);
13147 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
13151 space
= isl_multi_pw_aff_get_space(mpa
);
13152 isl_multi_pw_aff_free(mpa
);
13153 ma
= isl_multi_aff_zero(space
);
13154 return isl_map_preimage_multi_aff(map
, type
, ma
);
13157 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13158 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13161 isl_multi_pw_aff_free(mpa
);
13165 /* Compute the preimage of "map" under the function represented by "mpa".
13166 * In other words, plug in "mpa" in the domain "map".
13167 * The result is a map that lives in the same space as "map",
13168 * except that domain space has been replaced by the domain space of "mpa".
13170 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13171 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13173 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13176 /* Compute the preimage of "set" by the function represented by "mpa".
13177 * In other words, plug in "mpa" in "set".
13179 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13180 __isl_take isl_multi_pw_aff
*mpa
)
13182 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13185 /* Is the point "inner" internal to inequality constraint "ineq"
13187 * The point is considered to be internal to the inequality constraint,
13188 * if it strictly lies on the positive side of the inequality constraint,
13189 * or if it lies on the constraint and the constraint is lexico-positive.
13191 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13192 __isl_keep isl_basic_set
*bset
, int ineq
)
13198 if (!inner
|| !bset
)
13199 return isl_bool_error
;
13201 ctx
= isl_basic_set_get_ctx(bset
);
13202 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13203 &ctx
->normalize_gcd
);
13204 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13205 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13207 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13208 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13209 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13212 /* Tighten the inequality constraints of "bset" that are outward with respect
13213 * to the point "vec".
13214 * That is, tighten the constraints that are not satisfied by "vec".
13216 * "vec" is a point internal to some superset S of "bset" that is used
13217 * to make the subsets of S disjoint, by tightening one half of the constraints
13218 * that separate two subsets. In particular, the constraints of S
13219 * are all satisfied by "vec" and should not be tightened.
13220 * Of the internal constraints, those that have "vec" on the outside
13221 * are tightened. The shared facet is included in the adjacent subset
13222 * with the opposite constraint.
13223 * For constraints that saturate "vec", this criterion cannot be used
13224 * to determine which of the two sides should be tightened.
13225 * Instead, the sign of the first non-zero coefficient is used
13226 * to make this choice. Note that this second criterion is never used
13227 * on the constraints of S since "vec" is interior to "S".
13229 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13230 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13234 bset
= isl_basic_set_cow(bset
);
13237 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13240 internal
= is_internal(vec
, bset
, j
);
13242 return isl_basic_set_free(bset
);
13245 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);