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_error
;
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 isl_assert(bmap1
->ctx
,
3908 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3909 isl_assert(bmap1
->ctx
,
3910 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3913 bmap1
= isl_basic_map_reverse(bmap1
);
3914 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3915 return isl_basic_map_reverse(bmap1
);
3917 isl_basic_map_free(bmap1
);
3918 isl_basic_map_free(bmap2
);
3922 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3923 * A \cap B -> f(A) + f(B)
3925 struct isl_basic_map
*isl_basic_map_sum(
3926 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3928 unsigned n_in
, n_out
, nparam
, total
, pos
;
3929 struct isl_basic_map
*bmap
= NULL
;
3930 struct isl_dim_map
*dim_map1
, *dim_map2
;
3933 if (!bmap1
|| !bmap2
)
3936 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3939 nparam
= isl_basic_map_n_param(bmap1
);
3940 n_in
= isl_basic_map_n_in(bmap1
);
3941 n_out
= isl_basic_map_n_out(bmap1
);
3943 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3944 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3945 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3946 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3947 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3948 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3949 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3950 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3951 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3952 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3953 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3955 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3956 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3957 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3958 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3959 for (i
= 0; i
< n_out
; ++i
) {
3960 int j
= isl_basic_map_alloc_equality(bmap
);
3963 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3964 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3965 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3966 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3968 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3969 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3970 bmap
= add_divs(bmap
, 2 * n_out
);
3972 bmap
= isl_basic_map_simplify(bmap
);
3973 return isl_basic_map_finalize(bmap
);
3975 isl_basic_map_free(bmap
);
3976 isl_basic_map_free(bmap1
);
3977 isl_basic_map_free(bmap2
);
3981 /* Given two maps A -> f(A) and B -> g(B), construct a map
3982 * A \cap B -> f(A) + f(B)
3984 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3986 struct isl_map
*result
;
3992 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3994 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3995 map1
->n
* map2
->n
, 0);
3998 for (i
= 0; i
< map1
->n
; ++i
)
3999 for (j
= 0; j
< map2
->n
; ++j
) {
4000 struct isl_basic_map
*part
;
4001 part
= isl_basic_map_sum(
4002 isl_basic_map_copy(map1
->p
[i
]),
4003 isl_basic_map_copy(map2
->p
[j
]));
4004 if (isl_basic_map_is_empty(part
))
4005 isl_basic_map_free(part
);
4007 result
= isl_map_add_basic_map(result
, part
);
4020 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
4021 __isl_take isl_set
*set2
)
4023 return set_from_map(isl_map_sum(set_to_map(set1
), set_to_map(set2
)));
4026 /* Given a basic map A -> f(A), construct A -> -f(A).
4028 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
4033 bmap
= isl_basic_map_cow(bmap
);
4037 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
4038 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
4039 for (i
= 0; i
< bmap
->n_eq
; ++i
)
4040 for (j
= 0; j
< n
; ++j
)
4041 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
4042 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4043 for (j
= 0; j
< n
; ++j
)
4044 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
4045 for (i
= 0; i
< bmap
->n_div
; ++i
)
4046 for (j
= 0; j
< n
; ++j
)
4047 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
4048 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4049 return isl_basic_map_finalize(bmap
);
4052 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
4054 return isl_basic_map_neg(bset
);
4057 /* Given a map A -> f(A), construct A -> -f(A).
4059 struct isl_map
*isl_map_neg(struct isl_map
*map
)
4063 map
= isl_map_cow(map
);
4067 for (i
= 0; i
< map
->n
; ++i
) {
4068 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
4079 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
4081 return set_from_map(isl_map_neg(set_to_map(set
)));
4084 /* Given a basic map A -> f(A) and an integer d, construct a basic map
4085 * A -> floor(f(A)/d).
4087 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
4090 unsigned n_in
, n_out
, nparam
, total
, pos
;
4091 struct isl_basic_map
*result
= NULL
;
4092 struct isl_dim_map
*dim_map
;
4098 nparam
= isl_basic_map_n_param(bmap
);
4099 n_in
= isl_basic_map_n_in(bmap
);
4100 n_out
= isl_basic_map_n_out(bmap
);
4102 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
4103 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
4104 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
4105 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
4106 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
4107 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
4109 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
4110 bmap
->n_div
+ n_out
,
4111 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
4112 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
4113 result
= add_divs(result
, n_out
);
4114 for (i
= 0; i
< n_out
; ++i
) {
4116 j
= isl_basic_map_alloc_inequality(result
);
4119 isl_seq_clr(result
->ineq
[j
], 1+total
);
4120 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4121 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
4122 j
= isl_basic_map_alloc_inequality(result
);
4125 isl_seq_clr(result
->ineq
[j
], 1+total
);
4126 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
4127 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
4128 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
4131 result
= isl_basic_map_simplify(result
);
4132 return isl_basic_map_finalize(result
);
4134 isl_basic_map_free(result
);
4138 /* Given a map A -> f(A) and an integer d, construct a map
4139 * A -> floor(f(A)/d).
4141 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
4145 map
= isl_map_cow(map
);
4149 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4150 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4151 for (i
= 0; i
< map
->n
; ++i
) {
4152 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
4163 /* Given a map A -> f(A) and an integer d, construct a map
4164 * A -> floor(f(A)/d).
4166 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
4167 __isl_take isl_val
*d
)
4171 if (!isl_val_is_int(d
))
4172 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
4173 "expecting integer denominator", goto error
);
4174 map
= isl_map_floordiv(map
, d
->n
);
4183 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
4189 i
= isl_basic_map_alloc_equality(bmap
);
4192 nparam
= isl_basic_map_n_param(bmap
);
4193 n_in
= isl_basic_map_n_in(bmap
);
4194 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4195 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
4196 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
4197 return isl_basic_map_finalize(bmap
);
4199 isl_basic_map_free(bmap
);
4203 /* Add a constraint to "bmap" expressing i_pos < o_pos
4205 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
4211 i
= isl_basic_map_alloc_inequality(bmap
);
4214 nparam
= isl_basic_map_n_param(bmap
);
4215 n_in
= isl_basic_map_n_in(bmap
);
4216 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4217 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4218 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4219 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4220 return isl_basic_map_finalize(bmap
);
4222 isl_basic_map_free(bmap
);
4226 /* Add a constraint to "bmap" expressing i_pos <= o_pos
4228 static __isl_give isl_basic_map
*var_less_or_equal(
4229 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4235 i
= isl_basic_map_alloc_inequality(bmap
);
4238 nparam
= isl_basic_map_n_param(bmap
);
4239 n_in
= isl_basic_map_n_in(bmap
);
4240 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4241 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
4242 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
4243 return isl_basic_map_finalize(bmap
);
4245 isl_basic_map_free(bmap
);
4249 /* Add a constraint to "bmap" expressing i_pos > o_pos
4251 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
4257 i
= isl_basic_map_alloc_inequality(bmap
);
4260 nparam
= isl_basic_map_n_param(bmap
);
4261 n_in
= isl_basic_map_n_in(bmap
);
4262 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4263 isl_int_set_si(bmap
->ineq
[i
][0], -1);
4264 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4265 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4266 return isl_basic_map_finalize(bmap
);
4268 isl_basic_map_free(bmap
);
4272 /* Add a constraint to "bmap" expressing i_pos >= o_pos
4274 static __isl_give isl_basic_map
*var_more_or_equal(
4275 __isl_take isl_basic_map
*bmap
, unsigned pos
)
4281 i
= isl_basic_map_alloc_inequality(bmap
);
4284 nparam
= isl_basic_map_n_param(bmap
);
4285 n_in
= isl_basic_map_n_in(bmap
);
4286 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
4287 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
4288 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
4289 return isl_basic_map_finalize(bmap
);
4291 isl_basic_map_free(bmap
);
4295 __isl_give isl_basic_map
*isl_basic_map_equal(
4296 __isl_take isl_space
*dim
, unsigned n_equal
)
4299 struct isl_basic_map
*bmap
;
4300 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4303 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4304 bmap
= var_equal(bmap
, i
);
4305 return isl_basic_map_finalize(bmap
);
4308 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4310 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4314 struct isl_basic_map
*bmap
;
4315 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4318 for (i
= 0; i
< pos
&& bmap
; ++i
)
4319 bmap
= var_equal(bmap
, i
);
4321 bmap
= var_less(bmap
, pos
);
4322 return isl_basic_map_finalize(bmap
);
4325 /* Return a relation on "dim" expressing i_[0..pos] <<= o_[0..pos]
4327 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4328 __isl_take isl_space
*dim
, unsigned pos
)
4331 isl_basic_map
*bmap
;
4333 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4334 for (i
= 0; i
< pos
; ++i
)
4335 bmap
= var_equal(bmap
, i
);
4336 bmap
= var_less_or_equal(bmap
, pos
);
4337 return isl_basic_map_finalize(bmap
);
4340 /* Return a relation on "dim" expressing i_pos > o_pos
4342 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4346 struct isl_basic_map
*bmap
;
4347 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4350 for (i
= 0; i
< pos
&& bmap
; ++i
)
4351 bmap
= var_equal(bmap
, i
);
4353 bmap
= var_more(bmap
, pos
);
4354 return isl_basic_map_finalize(bmap
);
4357 /* Return a relation on "dim" expressing i_[0..pos] >>= o_[0..pos]
4359 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4360 __isl_take isl_space
*dim
, unsigned pos
)
4363 isl_basic_map
*bmap
;
4365 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4366 for (i
= 0; i
< pos
; ++i
)
4367 bmap
= var_equal(bmap
, i
);
4368 bmap
= var_more_or_equal(bmap
, pos
);
4369 return isl_basic_map_finalize(bmap
);
4372 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4373 unsigned n
, int equal
)
4375 struct isl_map
*map
;
4378 if (n
== 0 && equal
)
4379 return isl_map_universe(dims
);
4381 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4383 for (i
= 0; i
+ 1 < n
; ++i
)
4384 map
= isl_map_add_basic_map(map
,
4385 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4388 map
= isl_map_add_basic_map(map
,
4389 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4391 map
= isl_map_add_basic_map(map
,
4392 isl_basic_map_less_at(dims
, n
- 1));
4394 isl_space_free(dims
);
4399 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4403 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4406 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4408 return map_lex_lte_first(dim
, n
, 0);
4411 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4413 return map_lex_lte_first(dim
, n
, 1);
4416 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4418 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4421 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4423 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4426 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4427 unsigned n
, int equal
)
4429 struct isl_map
*map
;
4432 if (n
== 0 && equal
)
4433 return isl_map_universe(dims
);
4435 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4437 for (i
= 0; i
+ 1 < n
; ++i
)
4438 map
= isl_map_add_basic_map(map
,
4439 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4442 map
= isl_map_add_basic_map(map
,
4443 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4445 map
= isl_map_add_basic_map(map
,
4446 isl_basic_map_more_at(dims
, n
- 1));
4448 isl_space_free(dims
);
4453 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4457 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4460 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4462 return map_lex_gte_first(dim
, n
, 0);
4465 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4467 return map_lex_gte_first(dim
, n
, 1);
4470 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4472 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4475 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4477 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4480 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4481 __isl_take isl_set
*set2
)
4484 map
= isl_map_lex_le(isl_set_get_space(set1
));
4485 map
= isl_map_intersect_domain(map
, set1
);
4486 map
= isl_map_intersect_range(map
, set2
);
4490 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4491 __isl_take isl_set
*set2
)
4494 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4495 map
= isl_map_intersect_domain(map
, set1
);
4496 map
= isl_map_intersect_range(map
, set2
);
4500 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4501 __isl_take isl_set
*set2
)
4504 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4505 map
= isl_map_intersect_domain(map
, set1
);
4506 map
= isl_map_intersect_range(map
, set2
);
4510 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4511 __isl_take isl_set
*set2
)
4514 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4515 map
= isl_map_intersect_domain(map
, set1
);
4516 map
= isl_map_intersect_range(map
, set2
);
4520 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4521 __isl_take isl_map
*map2
)
4524 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4525 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4526 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4530 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4531 __isl_take isl_map
*map2
)
4534 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4535 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4536 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4540 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4541 __isl_take isl_map
*map2
)
4544 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4545 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4546 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4550 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4551 __isl_take isl_map
*map2
)
4554 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4555 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4556 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4560 static __isl_give isl_basic_map
*basic_map_from_basic_set(
4561 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4563 struct isl_basic_map
*bmap
;
4565 bset
= isl_basic_set_cow(bset
);
4569 isl_assert(bset
->ctx
, isl_space_compatible_internal(bset
->dim
, dim
),
4571 isl_space_free(bset
->dim
);
4572 bmap
= bset_to_bmap(bset
);
4574 return isl_basic_map_finalize(bmap
);
4576 isl_basic_set_free(bset
);
4577 isl_space_free(dim
);
4581 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4582 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*space
)
4584 return basic_map_from_basic_set(bset
, space
);
4587 /* For a div d = floor(f/m), add the constraint
4591 static int add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4592 unsigned pos
, isl_int
*div
)
4595 unsigned total
= isl_basic_map_total_dim(bmap
);
4597 i
= isl_basic_map_alloc_inequality(bmap
);
4600 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4601 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4606 /* For a div d = floor(f/m), add the constraint
4608 * -(f-(m-1)) + m d >= 0
4610 static int add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4611 unsigned pos
, isl_int
*div
)
4614 unsigned total
= isl_basic_map_total_dim(bmap
);
4616 i
= isl_basic_map_alloc_inequality(bmap
);
4619 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4620 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4621 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4622 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4627 /* For a div d = floor(f/m), add the constraints
4630 * -(f-(m-1)) + m d >= 0
4632 * Note that the second constraint is the negation of
4636 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4637 unsigned pos
, isl_int
*div
)
4639 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4641 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4646 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4647 unsigned pos
, isl_int
*div
)
4649 return isl_basic_map_add_div_constraints_var(bset_to_bmap(bset
),
4653 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4655 unsigned total
= isl_basic_map_total_dim(bmap
);
4656 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4658 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4662 /* For each known div d = floor(f/m), add the constraints
4665 * -(f-(m-1)) + m d >= 0
4667 * Remove duplicate constraints in case of some these div constraints
4668 * already appear in "bmap".
4670 __isl_give isl_basic_map
*isl_basic_map_add_known_div_constraints(
4671 __isl_take isl_basic_map
*bmap
)
4677 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
4681 bmap
= add_known_div_constraints(bmap
);
4682 bmap
= isl_basic_map_remove_duplicate_constraints(bmap
, NULL
, 0);
4683 bmap
= isl_basic_map_finalize(bmap
);
4687 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4689 * In particular, if this div is of the form d = floor(f/m),
4690 * then add the constraint
4694 * if sign < 0 or the constraint
4696 * -(f-(m-1)) + m d >= 0
4700 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4701 unsigned div
, int sign
)
4709 total
= isl_basic_map_total_dim(bmap
);
4710 div_pos
= total
- bmap
->n_div
+ div
;
4713 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4715 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4718 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4720 return isl_basic_map_add_div_constraints(bset
, div
);
4723 struct isl_basic_set
*isl_basic_map_underlying_set(
4724 struct isl_basic_map
*bmap
)
4728 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4730 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4731 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4732 return bset_from_bmap(bmap
);
4733 bmap
= isl_basic_map_cow(bmap
);
4736 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4739 bmap
->extra
-= bmap
->n_div
;
4741 bmap
= isl_basic_map_finalize(bmap
);
4742 return bset_from_bmap(bmap
);
4744 isl_basic_map_free(bmap
);
4748 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4749 __isl_take isl_basic_set
*bset
)
4751 return isl_basic_map_underlying_set(bset_to_bmap(bset
));
4754 /* Replace each element in "list" by the result of applying
4755 * isl_basic_map_underlying_set to the element.
4757 __isl_give isl_basic_set_list
*isl_basic_map_list_underlying_set(
4758 __isl_take isl_basic_map_list
*list
)
4765 n
= isl_basic_map_list_n_basic_map(list
);
4766 for (i
= 0; i
< n
; ++i
) {
4767 isl_basic_map
*bmap
;
4768 isl_basic_set
*bset
;
4770 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
4771 bset
= isl_basic_set_underlying_set(bmap
);
4772 list
= isl_basic_set_list_set_basic_set(list
, i
, bset
);
4778 struct isl_basic_map
*isl_basic_map_overlying_set(
4779 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4781 struct isl_basic_map
*bmap
;
4782 struct isl_ctx
*ctx
;
4789 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4790 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4791 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4793 if (like
->n_div
== 0) {
4794 isl_space
*space
= isl_basic_map_get_space(like
);
4795 isl_basic_map_free(like
);
4796 return isl_basic_map_reset_space(bset
, space
);
4798 bset
= isl_basic_set_cow(bset
);
4801 total
= bset
->dim
->n_out
+ bset
->extra
;
4802 bmap
= bset_to_bmap(bset
);
4803 isl_space_free(bmap
->dim
);
4804 bmap
->dim
= isl_space_copy(like
->dim
);
4807 bmap
->n_div
= like
->n_div
;
4808 bmap
->extra
+= like
->n_div
;
4812 ltotal
= total
- bmap
->extra
+ like
->extra
;
4815 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4816 bmap
->extra
* (1 + 1 + total
));
4817 if (isl_blk_is_error(bmap
->block2
))
4819 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4823 for (i
= 0; i
< bmap
->extra
; ++i
)
4824 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4825 for (i
= 0; i
< like
->n_div
; ++i
) {
4826 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4827 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4829 bmap
= isl_basic_map_add_known_div_constraints(bmap
);
4831 isl_basic_map_free(like
);
4832 bmap
= isl_basic_map_simplify(bmap
);
4833 bmap
= isl_basic_map_finalize(bmap
);
4836 isl_basic_map_free(like
);
4837 isl_basic_set_free(bset
);
4841 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4842 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4844 return bset_from_bmap(isl_basic_map_overlying_set(bset
,
4845 bset_to_bmap(like
)));
4848 struct isl_set
*isl_set_from_underlying_set(
4849 struct isl_set
*set
, struct isl_basic_set
*like
)
4855 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4857 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4858 isl_basic_set_free(like
);
4861 set
= isl_set_cow(set
);
4864 for (i
= 0; i
< set
->n
; ++i
) {
4865 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4866 isl_basic_set_copy(like
));
4870 isl_space_free(set
->dim
);
4871 set
->dim
= isl_space_copy(like
->dim
);
4874 isl_basic_set_free(like
);
4877 isl_basic_set_free(like
);
4882 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4886 map
= isl_map_cow(map
);
4889 map
->dim
= isl_space_cow(map
->dim
);
4893 for (i
= 1; i
< map
->n
; ++i
)
4894 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4896 for (i
= 0; i
< map
->n
; ++i
) {
4897 map
->p
[i
] = bset_to_bmap(
4898 isl_basic_map_underlying_set(map
->p
[i
]));
4903 map
->dim
= isl_space_underlying(map
->dim
, 0);
4905 isl_space_free(map
->dim
);
4906 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4910 return set_from_map(map
);
4916 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4918 return set_from_map(isl_map_underlying_set(set_to_map(set
)));
4921 /* Replace the space of "bmap" by "space".
4923 * If the space of "bmap" is identical to "space" (including the identifiers
4924 * of the input and output dimensions), then simply return the original input.
4926 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4927 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*space
)
4933 equal
= isl_space_is_equal(bmap
->dim
, space
);
4934 if (equal
>= 0 && equal
)
4935 equal
= isl_space_match(bmap
->dim
, isl_dim_in
,
4937 if (equal
>= 0 && equal
)
4938 equal
= isl_space_match(bmap
->dim
, isl_dim_out
,
4939 space
, isl_dim_out
);
4943 isl_space_free(space
);
4946 bmap
= isl_basic_map_cow(bmap
);
4947 if (!bmap
|| !space
)
4950 isl_space_free(bmap
->dim
);
4953 bmap
= isl_basic_map_finalize(bmap
);
4957 isl_basic_map_free(bmap
);
4958 isl_space_free(space
);
4962 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4963 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4965 return bset_from_bmap(isl_basic_map_reset_space(bset_to_bmap(bset
),
4969 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4970 __isl_take isl_space
*dim
)
4974 map
= isl_map_cow(map
);
4978 for (i
= 0; i
< map
->n
; ++i
) {
4979 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4980 isl_space_copy(dim
));
4984 isl_space_free(map
->dim
);
4990 isl_space_free(dim
);
4994 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4995 __isl_take isl_space
*dim
)
4997 return set_from_map(isl_map_reset_space(set_to_map(set
), dim
));
5000 /* Compute the parameter domain of the given basic set.
5002 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
5007 if (isl_basic_set_is_params(bset
))
5010 n
= isl_basic_set_dim(bset
, isl_dim_set
);
5011 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
5012 space
= isl_basic_set_get_space(bset
);
5013 space
= isl_space_params(space
);
5014 bset
= isl_basic_set_reset_space(bset
, space
);
5018 /* Construct a zero-dimensional basic set with the given parameter domain.
5020 __isl_give isl_basic_set
*isl_basic_set_from_params(
5021 __isl_take isl_basic_set
*bset
)
5024 space
= isl_basic_set_get_space(bset
);
5025 space
= isl_space_set_from_params(space
);
5026 bset
= isl_basic_set_reset_space(bset
, space
);
5030 /* Compute the parameter domain of the given set.
5032 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
5037 if (isl_set_is_params(set
))
5040 n
= isl_set_dim(set
, isl_dim_set
);
5041 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
5042 space
= isl_set_get_space(set
);
5043 space
= isl_space_params(space
);
5044 set
= isl_set_reset_space(set
, space
);
5048 /* Construct a zero-dimensional set with the given parameter domain.
5050 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
5053 space
= isl_set_get_space(set
);
5054 space
= isl_space_set_from_params(space
);
5055 set
= isl_set_reset_space(set
, space
);
5059 /* Compute the parameter domain of the given map.
5061 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
5066 n
= isl_map_dim(map
, isl_dim_in
);
5067 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
5068 n
= isl_map_dim(map
, isl_dim_out
);
5069 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
5070 space
= isl_map_get_space(map
);
5071 space
= isl_space_params(space
);
5072 map
= isl_map_reset_space(map
, space
);
5076 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
5083 space
= isl_space_domain(isl_basic_map_get_space(bmap
));
5085 n_out
= isl_basic_map_n_out(bmap
);
5086 bmap
= isl_basic_map_project_out(bmap
, isl_dim_out
, 0, n_out
);
5088 return isl_basic_map_reset_space(bmap
, space
);
5091 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
5095 return isl_space_may_be_set(bmap
->dim
);
5098 /* Is this basic map actually a set?
5099 * Users should never call this function. Outside of isl,
5100 * the type should indicate whether something is a set or a map.
5102 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
5106 return isl_space_is_set(bmap
->dim
);
5109 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
5113 if (isl_basic_map_is_set(bmap
))
5115 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
5118 __isl_give isl_basic_map
*isl_basic_map_domain_map(
5119 __isl_take isl_basic_map
*bmap
)
5123 isl_basic_map
*domain
;
5124 int nparam
, n_in
, n_out
;
5127 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5128 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5129 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5131 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
5132 domain
= isl_basic_map_universe(dim
);
5134 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5135 bmap
= isl_basic_map_apply_range(bmap
, domain
);
5136 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
5138 total
= isl_basic_map_total_dim(bmap
);
5140 for (i
= 0; i
< n_in
; ++i
) {
5141 k
= isl_basic_map_alloc_equality(bmap
);
5144 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5145 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
5146 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5149 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5150 return isl_basic_map_finalize(bmap
);
5152 isl_basic_map_free(bmap
);
5156 __isl_give isl_basic_map
*isl_basic_map_range_map(
5157 __isl_take isl_basic_map
*bmap
)
5161 isl_basic_map
*range
;
5162 int nparam
, n_in
, n_out
;
5165 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
5166 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
5167 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
5169 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
5170 range
= isl_basic_map_universe(dim
);
5172 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
5173 bmap
= isl_basic_map_apply_range(bmap
, range
);
5174 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
5176 total
= isl_basic_map_total_dim(bmap
);
5178 for (i
= 0; i
< n_out
; ++i
) {
5179 k
= isl_basic_map_alloc_equality(bmap
);
5182 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
5183 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
5184 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
5187 bmap
= isl_basic_map_gauss(bmap
, NULL
);
5188 return isl_basic_map_finalize(bmap
);
5190 isl_basic_map_free(bmap
);
5194 int isl_map_may_be_set(__isl_keep isl_map
*map
)
5198 return isl_space_may_be_set(map
->dim
);
5201 /* Is this map actually a set?
5202 * Users should never call this function. Outside of isl,
5203 * the type should indicate whether something is a set or a map.
5205 int isl_map_is_set(__isl_keep isl_map
*map
)
5209 return isl_space_is_set(map
->dim
);
5212 struct isl_set
*isl_map_range(struct isl_map
*map
)
5215 struct isl_set
*set
;
5219 if (isl_map_is_set(map
))
5220 return set_from_map(map
);
5222 map
= isl_map_cow(map
);
5226 set
= set_from_map(map
);
5227 set
->dim
= isl_space_range(set
->dim
);
5230 for (i
= 0; i
< map
->n
; ++i
) {
5231 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
5235 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
5236 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
5243 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
5247 map
= isl_map_cow(map
);
5251 map
->dim
= isl_space_domain_map(map
->dim
);
5254 for (i
= 0; i
< map
->n
; ++i
) {
5255 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
5259 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5260 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5267 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
5270 isl_space
*range_dim
;
5272 map
= isl_map_cow(map
);
5276 range_dim
= isl_space_range(isl_map_get_space(map
));
5277 range_dim
= isl_space_from_range(range_dim
);
5278 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
5279 map
->dim
= isl_space_join(map
->dim
, range_dim
);
5282 for (i
= 0; i
< map
->n
; ++i
) {
5283 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
5287 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
5288 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5295 /* Given a wrapped map of the form A[B -> C],
5296 * return the map A[B -> C] -> B.
5298 __isl_give isl_map
*isl_set_wrapped_domain_map(__isl_take isl_set
*set
)
5305 if (!isl_set_has_tuple_id(set
))
5306 return isl_map_domain_map(isl_set_unwrap(set
));
5308 id
= isl_set_get_tuple_id(set
);
5309 map
= isl_map_domain_map(isl_set_unwrap(set
));
5310 map
= isl_map_set_tuple_id(map
, isl_dim_in
, id
);
5315 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
5316 __isl_take isl_space
*dim
)
5319 struct isl_map
*map
= NULL
;
5321 set
= isl_set_cow(set
);
5324 isl_assert(set
->ctx
, isl_space_compatible_internal(set
->dim
, dim
),
5326 map
= set_to_map(set
);
5327 for (i
= 0; i
< set
->n
; ++i
) {
5328 map
->p
[i
] = basic_map_from_basic_set(
5329 set
->p
[i
], isl_space_copy(dim
));
5333 isl_space_free(map
->dim
);
5337 isl_space_free(dim
);
5342 __isl_give isl_basic_map
*isl_basic_map_from_domain(
5343 __isl_take isl_basic_set
*bset
)
5345 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
5348 __isl_give isl_basic_map
*isl_basic_map_from_range(
5349 __isl_take isl_basic_set
*bset
)
5352 space
= isl_basic_set_get_space(bset
);
5353 space
= isl_space_from_range(space
);
5354 bset
= isl_basic_set_reset_space(bset
, space
);
5355 return bset_to_bmap(bset
);
5358 /* Create a relation with the given set as range.
5359 * The domain of the created relation is a zero-dimensional
5360 * flat anonymous space.
5362 __isl_give isl_map
*isl_map_from_range(__isl_take isl_set
*set
)
5365 space
= isl_set_get_space(set
);
5366 space
= isl_space_from_range(space
);
5367 set
= isl_set_reset_space(set
, space
);
5368 return set_to_map(set
);
5371 /* Create a relation with the given set as domain.
5372 * The range of the created relation is a zero-dimensional
5373 * flat anonymous space.
5375 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5377 return isl_map_reverse(isl_map_from_range(set
));
5380 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5381 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5383 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5386 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5387 __isl_take isl_set
*range
)
5389 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5392 /* Return a newly allocated isl_map with given space and flags and
5393 * room for "n" basic maps.
5394 * Make sure that all cached information is cleared.
5396 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*space
, int n
,
5399 struct isl_map
*map
;
5404 isl_die(space
->ctx
, isl_error_internal
,
5405 "negative number of basic maps", goto error
);
5406 map
= isl_calloc(space
->ctx
, struct isl_map
,
5407 sizeof(struct isl_map
) +
5408 (n
- 1) * sizeof(struct isl_basic_map
*));
5412 map
->ctx
= space
->ctx
;
5413 isl_ctx_ref(map
->ctx
);
5421 isl_space_free(space
);
5425 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5426 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5429 struct isl_map
*map
;
5432 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5436 map
= isl_map_alloc_space(dims
, n
, flags
);
5440 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5442 struct isl_basic_map
*bmap
;
5443 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5444 bmap
= isl_basic_map_set_to_empty(bmap
);
5448 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5450 struct isl_basic_set
*bset
;
5451 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5452 bset
= isl_basic_set_set_to_empty(bset
);
5456 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5458 struct isl_basic_map
*bmap
;
5459 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5460 bmap
= isl_basic_map_finalize(bmap
);
5464 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5466 struct isl_basic_set
*bset
;
5467 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5468 bset
= isl_basic_set_finalize(bset
);
5472 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5475 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5476 isl_basic_map
*bmap
;
5478 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5479 for (i
= 0; i
< total
; ++i
) {
5480 int k
= isl_basic_map_alloc_inequality(bmap
);
5483 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5484 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5488 isl_basic_map_free(bmap
);
5492 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5494 return isl_basic_map_nat_universe(dim
);
5497 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5499 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5502 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5504 return isl_map_nat_universe(dim
);
5507 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5509 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5512 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5514 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5517 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5519 struct isl_map
*map
;
5522 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5523 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5527 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5529 struct isl_set
*set
;
5532 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5533 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5537 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5540 struct isl_map
*dup
;
5544 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5545 for (i
= 0; i
< map
->n
; ++i
)
5546 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5550 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5551 __isl_take isl_basic_map
*bmap
)
5555 if (isl_basic_map_plain_is_empty(bmap
)) {
5556 isl_basic_map_free(bmap
);
5559 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5560 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5561 map
->p
[map
->n
] = bmap
;
5563 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5569 isl_basic_map_free(bmap
);
5573 __isl_null isl_map
*isl_map_free(__isl_take isl_map
*map
)
5584 isl_ctx_deref(map
->ctx
);
5585 for (i
= 0; i
< map
->n
; ++i
)
5586 isl_basic_map_free(map
->p
[i
]);
5587 isl_space_free(map
->dim
);
5593 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5594 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5598 bmap
= isl_basic_map_cow(bmap
);
5599 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5600 j
= isl_basic_map_alloc_equality(bmap
);
5603 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5604 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5605 isl_int_set_si(bmap
->eq
[j
][0], value
);
5606 bmap
= isl_basic_map_simplify(bmap
);
5607 return isl_basic_map_finalize(bmap
);
5609 isl_basic_map_free(bmap
);
5613 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5614 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5618 bmap
= isl_basic_map_cow(bmap
);
5619 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5620 j
= isl_basic_map_alloc_equality(bmap
);
5623 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5624 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5625 isl_int_set(bmap
->eq
[j
][0], value
);
5626 bmap
= isl_basic_map_simplify(bmap
);
5627 return isl_basic_map_finalize(bmap
);
5629 isl_basic_map_free(bmap
);
5633 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5634 enum isl_dim_type type
, unsigned pos
, int value
)
5638 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5639 return isl_basic_map_fix_pos_si(bmap
,
5640 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5642 isl_basic_map_free(bmap
);
5646 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5647 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5651 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5652 return isl_basic_map_fix_pos(bmap
,
5653 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5655 isl_basic_map_free(bmap
);
5659 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5660 * to be equal to "v".
5662 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5663 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5667 if (!isl_val_is_int(v
))
5668 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5669 "expecting integer value", goto error
);
5670 if (pos
>= isl_basic_map_dim(bmap
, type
))
5671 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5672 "index out of bounds", goto error
);
5673 pos
+= isl_basic_map_offset(bmap
, type
);
5674 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5678 isl_basic_map_free(bmap
);
5683 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5684 * to be equal to "v".
5686 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5687 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5689 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5692 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5693 enum isl_dim_type type
, unsigned pos
, int value
)
5695 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
5699 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5700 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5702 return bset_from_bmap(isl_basic_map_fix(bset_to_bmap(bset
),
5706 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5707 unsigned input
, int value
)
5709 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5712 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5713 unsigned dim
, int value
)
5715 return bset_from_bmap(isl_basic_map_fix_si(bset_to_bmap(bset
),
5716 isl_dim_set
, dim
, value
));
5719 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5721 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5728 isl_basic_map_free(map
->p
[i
]);
5729 if (i
!= map
->n
- 1) {
5730 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5731 map
->p
[i
] = map
->p
[map
->n
- 1];
5738 /* Perform "fn" on each basic map of "map", where we may not be holding
5739 * the only reference to "map".
5740 * In particular, "fn" should be a semantics preserving operation
5741 * that we want to apply to all copies of "map". We therefore need
5742 * to be careful not to modify "map" in a way that breaks "map"
5743 * in case anything goes wrong.
5745 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5746 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5748 struct isl_basic_map
*bmap
;
5754 for (i
= map
->n
- 1; i
>= 0; --i
) {
5755 bmap
= isl_basic_map_copy(map
->p
[i
]);
5759 isl_basic_map_free(map
->p
[i
]);
5761 if (remove_if_empty(map
, i
) < 0)
5771 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5772 enum isl_dim_type type
, unsigned pos
, int value
)
5776 map
= isl_map_cow(map
);
5780 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5781 for (i
= map
->n
- 1; i
>= 0; --i
) {
5782 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5783 if (remove_if_empty(map
, i
) < 0)
5786 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5793 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5794 enum isl_dim_type type
, unsigned pos
, int value
)
5796 return set_from_map(isl_map_fix_si(set_to_map(set
), type
, pos
, value
));
5799 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5800 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5804 map
= isl_map_cow(map
);
5808 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5809 for (i
= 0; i
< map
->n
; ++i
) {
5810 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5814 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5821 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5822 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5824 return set_from_map(isl_map_fix(set_to_map(set
), type
, pos
, value
));
5827 /* Fix the value of the variable at position "pos" of type "type" of "map"
5828 * to be equal to "v".
5830 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5831 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5835 map
= isl_map_cow(map
);
5839 if (!isl_val_is_int(v
))
5840 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5841 "expecting integer value", goto error
);
5842 if (pos
>= isl_map_dim(map
, type
))
5843 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5844 "index out of bounds", goto error
);
5845 for (i
= map
->n
- 1; i
>= 0; --i
) {
5846 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5848 if (remove_if_empty(map
, i
) < 0)
5851 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5860 /* Fix the value of the variable at position "pos" of type "type" of "set"
5861 * to be equal to "v".
5863 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5864 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5866 return isl_map_fix_val(set
, type
, pos
, v
);
5869 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5870 unsigned input
, int value
)
5872 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5875 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5877 return set_from_map(isl_map_fix_si(set_to_map(set
),
5878 isl_dim_set
, dim
, value
));
5881 static __isl_give isl_basic_map
*basic_map_bound_si(
5882 __isl_take isl_basic_map
*bmap
,
5883 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5889 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5890 pos
+= isl_basic_map_offset(bmap
, type
);
5891 bmap
= isl_basic_map_cow(bmap
);
5892 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5893 j
= isl_basic_map_alloc_inequality(bmap
);
5896 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5898 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5899 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5901 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5902 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5904 bmap
= isl_basic_map_simplify(bmap
);
5905 return isl_basic_map_finalize(bmap
);
5907 isl_basic_map_free(bmap
);
5911 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5912 __isl_take isl_basic_map
*bmap
,
5913 enum isl_dim_type type
, unsigned pos
, int value
)
5915 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5918 /* Constrain the values of the given dimension to be no greater than "value".
5920 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5921 __isl_take isl_basic_map
*bmap
,
5922 enum isl_dim_type type
, unsigned pos
, int value
)
5924 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5927 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5928 unsigned dim
, isl_int value
)
5932 bset
= isl_basic_set_cow(bset
);
5933 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5934 j
= isl_basic_set_alloc_inequality(bset
);
5937 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5938 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5939 isl_int_neg(bset
->ineq
[j
][0], value
);
5940 bset
= isl_basic_set_simplify(bset
);
5941 return isl_basic_set_finalize(bset
);
5943 isl_basic_set_free(bset
);
5947 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5948 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5952 map
= isl_map_cow(map
);
5956 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5957 for (i
= 0; i
< map
->n
; ++i
) {
5958 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5959 type
, pos
, value
, upper
);
5963 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5970 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5971 enum isl_dim_type type
, unsigned pos
, int value
)
5973 return map_bound_si(map
, type
, pos
, value
, 0);
5976 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5977 enum isl_dim_type type
, unsigned pos
, int value
)
5979 return map_bound_si(map
, type
, pos
, value
, 1);
5982 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5983 enum isl_dim_type type
, unsigned pos
, int value
)
5985 return set_from_map(isl_map_lower_bound_si(set_to_map(set
),
5989 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5990 enum isl_dim_type type
, unsigned pos
, int value
)
5992 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5995 /* Bound the given variable of "bmap" from below (or above is "upper"
5996 * is set) to "value".
5998 static __isl_give isl_basic_map
*basic_map_bound(
5999 __isl_take isl_basic_map
*bmap
,
6000 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6006 if (pos
>= isl_basic_map_dim(bmap
, type
))
6007 isl_die(bmap
->ctx
, isl_error_invalid
,
6008 "index out of bounds", goto error
);
6009 pos
+= isl_basic_map_offset(bmap
, type
);
6010 bmap
= isl_basic_map_cow(bmap
);
6011 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
6012 j
= isl_basic_map_alloc_inequality(bmap
);
6015 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
6017 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
6018 isl_int_set(bmap
->ineq
[j
][0], value
);
6020 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
6021 isl_int_neg(bmap
->ineq
[j
][0], value
);
6023 bmap
= isl_basic_map_simplify(bmap
);
6024 return isl_basic_map_finalize(bmap
);
6026 isl_basic_map_free(bmap
);
6030 /* Bound the given variable of "map" from below (or above is "upper"
6031 * is set) to "value".
6033 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
6034 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
6038 map
= isl_map_cow(map
);
6042 if (pos
>= isl_map_dim(map
, type
))
6043 isl_die(map
->ctx
, isl_error_invalid
,
6044 "index out of bounds", goto error
);
6045 for (i
= map
->n
- 1; i
>= 0; --i
) {
6046 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
6047 if (remove_if_empty(map
, i
) < 0)
6050 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6057 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
6058 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6060 return map_bound(map
, type
, pos
, value
, 0);
6063 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
6064 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6066 return map_bound(map
, type
, pos
, value
, 1);
6069 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
6070 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6072 return isl_map_lower_bound(set
, type
, pos
, value
);
6075 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
6076 enum isl_dim_type type
, unsigned pos
, isl_int value
)
6078 return isl_map_upper_bound(set
, type
, pos
, value
);
6081 /* Force the values of the variable at position "pos" of type "type" of "set"
6082 * to be no smaller than "value".
6084 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
6085 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6089 if (!isl_val_is_int(value
))
6090 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6091 "expecting integer value", goto error
);
6092 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
6093 isl_val_free(value
);
6096 isl_val_free(value
);
6101 /* Force the values of the variable at position "pos" of type "type" of "set"
6102 * to be no greater than "value".
6104 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
6105 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
6109 if (!isl_val_is_int(value
))
6110 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
6111 "expecting integer value", goto error
);
6112 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
6113 isl_val_free(value
);
6116 isl_val_free(value
);
6121 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
6126 set
= isl_set_cow(set
);
6130 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
6131 for (i
= 0; i
< set
->n
; ++i
) {
6132 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
6142 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
6146 map
= isl_map_cow(map
);
6150 map
->dim
= isl_space_reverse(map
->dim
);
6153 for (i
= 0; i
< map
->n
; ++i
) {
6154 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
6158 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
6166 #define TYPE isl_pw_multi_aff
6168 #define SUFFIX _pw_multi_aff
6170 #define EMPTY isl_pw_multi_aff_empty
6172 #define ADD isl_pw_multi_aff_union_add
6173 #include "isl_map_lexopt_templ.c"
6175 /* Given a map "map", compute the lexicographically minimal
6176 * (or maximal) image element for each domain element in dom,
6177 * in the form of an isl_pw_multi_aff.
6178 * If "empty" is not NULL, then set *empty to those elements in dom that
6179 * do not have an image element.
6180 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6181 * should be computed over the domain of "map". "empty" is also NULL
6184 * We first compute the lexicographically minimal or maximal element
6185 * in the first basic map. This results in a partial solution "res"
6186 * and a subset "todo" of dom that still need to be handled.
6187 * We then consider each of the remaining maps in "map" and successively
6188 * update both "res" and "todo".
6189 * If "empty" is NULL, then the todo sets are not needed and therefore
6190 * also not computed.
6192 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6193 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6194 __isl_give isl_set
**empty
, unsigned flags
)
6198 isl_pw_multi_aff
*res
;
6201 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6202 if (!map
|| (!full
&& !dom
))
6205 if (isl_map_plain_is_empty(map
)) {
6210 return isl_pw_multi_aff_from_map(map
);
6213 res
= basic_map_partial_lexopt_pw_multi_aff(
6214 isl_basic_map_copy(map
->p
[0]),
6215 isl_set_copy(dom
), empty
, flags
);
6219 for (i
= 1; i
< map
->n
; ++i
) {
6220 isl_pw_multi_aff
*res_i
;
6222 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6223 isl_basic_map_copy(map
->p
[i
]),
6224 isl_set_copy(dom
), empty
, flags
);
6226 if (ISL_FL_ISSET(flags
, ISL_OPT_MAX
))
6227 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6229 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6232 todo
= isl_set_intersect(todo
, *empty
);
6251 #define TYPE isl_map
6255 #define EMPTY isl_map_empty
6257 #define ADD isl_map_union_disjoint
6258 #include "isl_map_lexopt_templ.c"
6260 /* Given a map "map", compute the lexicographically minimal
6261 * (or maximal) image element for each domain element in "dom",
6262 * in the form of an isl_map.
6263 * If "empty" is not NULL, then set *empty to those elements in "dom" that
6264 * do not have an image element.
6265 * If "flags" includes ISL_OPT_FULL, then "dom" is NULL and the optimum
6266 * should be computed over the domain of "map". "empty" is also NULL
6269 * If the input consists of more than one disjunct, then first
6270 * compute the desired result in the form of an isl_pw_multi_aff and
6271 * then convert that into an isl_map.
6273 * This function used to have an explicit implementation in terms
6274 * of isl_maps, but it would continually intersect the domains of
6275 * partial results with the complement of the domain of the next
6276 * partial solution, potentially leading to an explosion in the number
6277 * of disjuncts if there are several disjuncts in the input.
6278 * An even earlier implementation of this function would look for
6279 * better results in the domain of the partial result and for extra
6280 * results in the complement of this domain, which would lead to
6281 * even more splintering.
6283 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6284 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6285 __isl_give isl_set
**empty
, unsigned flags
)
6288 struct isl_map
*res
;
6289 isl_pw_multi_aff
*pma
;
6291 full
= ISL_FL_ISSET(flags
, ISL_OPT_FULL
);
6292 if (!map
|| (!full
&& !dom
))
6295 if (isl_map_plain_is_empty(map
)) {
6304 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6310 pma
= isl_map_partial_lexopt_aligned_pw_multi_aff(map
, dom
, empty
,
6312 return isl_map_from_pw_multi_aff(pma
);
6321 __isl_give isl_map
*isl_map_partial_lexmax(
6322 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6323 __isl_give isl_set
**empty
)
6325 return isl_map_partial_lexopt(map
, dom
, empty
, ISL_OPT_MAX
);
6328 __isl_give isl_map
*isl_map_partial_lexmin(
6329 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6330 __isl_give isl_set
**empty
)
6332 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6335 __isl_give isl_set
*isl_set_partial_lexmin(
6336 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6337 __isl_give isl_set
**empty
)
6339 return set_from_map(isl_map_partial_lexmin(set_to_map(set
),
6343 __isl_give isl_set
*isl_set_partial_lexmax(
6344 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6345 __isl_give isl_set
**empty
)
6347 return set_from_map(isl_map_partial_lexmax(set_to_map(set
),
6351 /* Compute the lexicographic minimum (or maximum if "flags" includes
6352 * ISL_OPT_MAX) of "bset" over its parametric domain.
6354 __isl_give isl_set
*isl_basic_set_lexopt(__isl_take isl_basic_set
*bset
,
6357 return isl_basic_map_lexopt(bset
, flags
);
6360 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6362 return isl_basic_map_lexopt(bmap
, ISL_OPT_MAX
);
6365 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6367 return set_from_map(isl_basic_map_lexmin(bset_to_bmap(bset
)));
6370 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6372 return set_from_map(isl_basic_map_lexmax(bset_to_bmap(bset
)));
6375 /* Compute the lexicographic minimum of "bset" over its parametric domain
6376 * for the purpose of quantifier elimination.
6377 * That is, find an explicit representation for all the existentially
6378 * quantified variables in "bset" by computing their lexicographic
6381 static __isl_give isl_set
*isl_basic_set_lexmin_compute_divs(
6382 __isl_take isl_basic_set
*bset
)
6384 return isl_basic_set_lexopt(bset
, ISL_OPT_QE
);
6387 /* Extract the first and only affine expression from list
6388 * and then add it to *pwaff with the given dom.
6389 * This domain is known to be disjoint from other domains
6390 * because of the way isl_basic_map_foreach_lexmax works.
6392 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6393 __isl_take isl_aff_list
*list
, void *user
)
6395 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6397 isl_pw_aff
**pwaff
= user
;
6398 isl_pw_aff
*pwaff_i
;
6402 if (isl_aff_list_n_aff(list
) != 1)
6403 isl_die(ctx
, isl_error_internal
,
6404 "expecting single element list", goto error
);
6406 aff
= isl_aff_list_get_aff(list
, 0);
6407 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6409 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6411 isl_aff_list_free(list
);
6415 isl_basic_set_free(dom
);
6416 isl_aff_list_free(list
);
6420 /* Given a basic map with one output dimension, compute the minimum or
6421 * maximum of that dimension as an isl_pw_aff.
6423 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6424 * call update_dim_opt on each leaf of the result.
6426 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6429 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6433 dim
= isl_space_from_domain(isl_space_domain(dim
));
6434 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6435 pwaff
= isl_pw_aff_empty(dim
);
6437 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6439 return isl_pw_aff_free(pwaff
);
6444 /* Compute the minimum or maximum of the given output dimension
6445 * as a function of the parameters and the input dimensions,
6446 * but independently of the other output dimensions.
6448 * We first project out the other output dimension and then compute
6449 * the "lexicographic" maximum in each basic map, combining the results
6450 * using isl_pw_aff_union_max.
6452 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6459 n_out
= isl_map_dim(map
, isl_dim_out
);
6460 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6461 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6466 isl_space
*dim
= isl_map_get_space(map
);
6468 return isl_pw_aff_empty(dim
);
6471 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6472 for (i
= 1; i
< map
->n
; ++i
) {
6473 isl_pw_aff
*pwaff_i
;
6475 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6476 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6484 /* Compute the minimum of the given output dimension as a function of the
6485 * parameters and input dimensions, but independently of
6486 * the other output dimensions.
6488 __isl_give isl_pw_aff
*isl_map_dim_min(__isl_take isl_map
*map
, int pos
)
6490 return map_dim_opt(map
, pos
, 0);
6493 /* Compute the maximum of the given output dimension as a function of the
6494 * parameters and input dimensions, but independently of
6495 * the other output dimensions.
6497 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6499 return map_dim_opt(map
, pos
, 1);
6502 /* Compute the minimum or maximum of the given set dimension
6503 * as a function of the parameters,
6504 * but independently of the other set dimensions.
6506 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6509 return map_dim_opt(set
, pos
, max
);
6512 /* Compute the maximum of the given set dimension as a function of the
6513 * parameters, but independently of the other set dimensions.
6515 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6517 return set_dim_opt(set
, pos
, 1);
6520 /* Compute the minimum of the given set dimension as a function of the
6521 * parameters, but independently of the other set dimensions.
6523 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6525 return set_dim_opt(set
, pos
, 0);
6528 /* Apply a preimage specified by "mat" on the parameters of "bset".
6529 * bset is assumed to have only parameters and divs.
6531 static struct isl_basic_set
*basic_set_parameter_preimage(
6532 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6539 bset
->dim
= isl_space_cow(bset
->dim
);
6543 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6545 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6547 bset
->dim
->nparam
= 0;
6548 bset
->dim
->n_out
= nparam
;
6549 bset
= isl_basic_set_preimage(bset
, mat
);
6551 bset
->dim
->nparam
= bset
->dim
->n_out
;
6552 bset
->dim
->n_out
= 0;
6557 isl_basic_set_free(bset
);
6561 /* Apply a preimage specified by "mat" on the parameters of "set".
6562 * set is assumed to have only parameters and divs.
6564 static __isl_give isl_set
*set_parameter_preimage(__isl_take isl_set
*set
,
6565 __isl_take isl_mat
*mat
)
6573 nparam
= isl_set_dim(set
, isl_dim_param
);
6575 if (mat
->n_row
!= 1 + nparam
)
6576 isl_die(isl_set_get_ctx(set
), isl_error_internal
,
6577 "unexpected number of rows", goto error
);
6579 space
= isl_set_get_space(set
);
6580 space
= isl_space_move_dims(space
, isl_dim_set
, 0,
6581 isl_dim_param
, 0, nparam
);
6582 set
= isl_set_reset_space(set
, space
);
6583 set
= isl_set_preimage(set
, mat
);
6584 nparam
= isl_set_dim(set
, isl_dim_out
);
6585 space
= isl_set_get_space(set
);
6586 space
= isl_space_move_dims(space
, isl_dim_param
, 0,
6587 isl_dim_out
, 0, nparam
);
6588 set
= isl_set_reset_space(set
, space
);
6596 /* Intersect the basic set "bset" with the affine space specified by the
6597 * equalities in "eq".
6599 static struct isl_basic_set
*basic_set_append_equalities(
6600 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6608 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6613 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6614 for (i
= 0; i
< eq
->n_row
; ++i
) {
6615 k
= isl_basic_set_alloc_equality(bset
);
6618 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6619 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6623 bset
= isl_basic_set_gauss(bset
, NULL
);
6624 bset
= isl_basic_set_finalize(bset
);
6629 isl_basic_set_free(bset
);
6633 /* Intersect the set "set" with the affine space specified by the
6634 * equalities in "eq".
6636 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6644 for (i
= 0; i
< set
->n
; ++i
) {
6645 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6658 /* Given a basic set "bset" that only involves parameters and existentially
6659 * quantified variables, return the index of the first equality
6660 * that only involves parameters. If there is no such equality then
6661 * return bset->n_eq.
6663 * This function assumes that isl_basic_set_gauss has been called on "bset".
6665 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6668 unsigned nparam
, n_div
;
6673 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6674 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6676 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6677 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6684 /* Compute an explicit representation for the existentially quantified
6685 * variables in "bset" by computing the "minimal value" of the set
6686 * variables. Since there are no set variables, the computation of
6687 * the minimal value essentially computes an explicit representation
6688 * of the non-empty part(s) of "bset".
6690 * The input only involves parameters and existentially quantified variables.
6691 * All equalities among parameters have been removed.
6693 * Since the existentially quantified variables in the result are in general
6694 * going to be different from those in the input, we first replace
6695 * them by the minimal number of variables based on their equalities.
6696 * This should simplify the parametric integer programming.
6698 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6700 isl_morph
*morph1
, *morph2
;
6706 if (bset
->n_eq
== 0)
6707 return isl_basic_set_lexmin_compute_divs(bset
);
6709 morph1
= isl_basic_set_parameter_compression(bset
);
6710 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6711 bset
= isl_basic_set_lift(bset
);
6712 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6713 bset
= isl_morph_basic_set(morph2
, bset
);
6714 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6715 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6717 set
= isl_basic_set_lexmin_compute_divs(bset
);
6719 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6724 /* Project the given basic set onto its parameter domain, possibly introducing
6725 * new, explicit, existential variables in the constraints.
6726 * The input has parameters and (possibly implicit) existential variables.
6727 * The output has the same parameters, but only
6728 * explicit existentially quantified variables.
6730 * The actual projection is performed by pip, but pip doesn't seem
6731 * to like equalities very much, so we first remove the equalities
6732 * among the parameters by performing a variable compression on
6733 * the parameters. Afterward, an inverse transformation is performed
6734 * and the equalities among the parameters are inserted back in.
6736 * The variable compression on the parameters may uncover additional
6737 * equalities that were only implicit before. We therefore check
6738 * if there are any new parameter equalities in the result and
6739 * if so recurse. The removal of parameter equalities is required
6740 * for the parameter compression performed by base_compute_divs.
6742 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6746 struct isl_mat
*T
, *T2
;
6747 struct isl_set
*set
;
6750 bset
= isl_basic_set_cow(bset
);
6754 if (bset
->n_eq
== 0)
6755 return base_compute_divs(bset
);
6757 bset
= isl_basic_set_gauss(bset
, NULL
);
6760 if (isl_basic_set_plain_is_empty(bset
))
6761 return isl_set_from_basic_set(bset
);
6763 i
= first_parameter_equality(bset
);
6764 if (i
== bset
->n_eq
)
6765 return base_compute_divs(bset
);
6767 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6768 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6770 eq
= isl_mat_cow(eq
);
6771 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6772 if (T
&& T
->n_col
== 0) {
6776 bset
= isl_basic_set_set_to_empty(bset
);
6777 return isl_set_from_basic_set(bset
);
6779 bset
= basic_set_parameter_preimage(bset
, T
);
6781 i
= first_parameter_equality(bset
);
6784 else if (i
== bset
->n_eq
)
6785 set
= base_compute_divs(bset
);
6787 set
= parameter_compute_divs(bset
);
6788 set
= set_parameter_preimage(set
, T2
);
6789 set
= set_append_equalities(set
, eq
);
6793 /* Insert the divs from "ls" before those of "bmap".
6795 * The number of columns is not changed, which means that the last
6796 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6797 * The caller is responsible for removing the same number of dimensions
6798 * from the space of "bmap".
6800 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6801 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6807 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6811 old_n_div
= bmap
->n_div
;
6812 bmap
= insert_div_rows(bmap
, n_div
);
6816 for (i
= 0; i
< n_div
; ++i
) {
6817 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6818 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6824 /* Replace the space of "bmap" by the space and divs of "ls".
6826 * If "ls" has any divs, then we simplify the result since we may
6827 * have discovered some additional equalities that could simplify
6828 * the div expressions.
6830 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6831 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6835 bmap
= isl_basic_map_cow(bmap
);
6839 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6840 bmap
= insert_divs_from_local_space(bmap
, ls
);
6844 isl_space_free(bmap
->dim
);
6845 bmap
->dim
= isl_local_space_get_space(ls
);
6849 isl_local_space_free(ls
);
6851 bmap
= isl_basic_map_simplify(bmap
);
6852 bmap
= isl_basic_map_finalize(bmap
);
6855 isl_basic_map_free(bmap
);
6856 isl_local_space_free(ls
);
6860 /* Replace the space of "map" by the space and divs of "ls".
6862 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6863 __isl_take isl_local_space
*ls
)
6867 map
= isl_map_cow(map
);
6871 for (i
= 0; i
< map
->n
; ++i
) {
6872 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6873 isl_local_space_copy(ls
));
6877 isl_space_free(map
->dim
);
6878 map
->dim
= isl_local_space_get_space(ls
);
6882 isl_local_space_free(ls
);
6885 isl_local_space_free(ls
);
6890 /* Compute an explicit representation for the existentially
6891 * quantified variables for which do not know any explicit representation yet.
6893 * We first sort the existentially quantified variables so that the
6894 * existentially quantified variables for which we already have an explicit
6895 * representation are placed before those for which we do not.
6896 * The input dimensions, the output dimensions and the existentially
6897 * quantified variables for which we already have an explicit
6898 * representation are then turned into parameters.
6899 * compute_divs returns a map with the same parameters and
6900 * no input or output dimensions and the dimension specification
6901 * is reset to that of the input, including the existentially quantified
6902 * variables for which we already had an explicit representation.
6904 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6906 struct isl_basic_set
*bset
;
6907 struct isl_set
*set
;
6908 struct isl_map
*map
;
6910 isl_local_space
*ls
;
6917 bmap
= isl_basic_map_sort_divs(bmap
);
6918 bmap
= isl_basic_map_cow(bmap
);
6922 n_known
= isl_basic_map_first_unknown_div(bmap
);
6924 return isl_map_from_basic_map(isl_basic_map_free(bmap
));
6926 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6927 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6928 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6929 dim
= isl_space_set_alloc(bmap
->ctx
,
6930 nparam
+ n_in
+ n_out
+ n_known
, 0);
6934 ls
= isl_basic_map_get_local_space(bmap
);
6935 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6936 n_known
, bmap
->n_div
- n_known
);
6938 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6939 swap_div(bmap
, i
- n_known
, i
);
6940 bmap
->n_div
-= n_known
;
6941 bmap
->extra
-= n_known
;
6943 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6944 bset
= bset_from_bmap(bmap
);
6946 set
= parameter_compute_divs(bset
);
6947 map
= set_to_map(set
);
6948 map
= replace_space_by_local_space(map
, ls
);
6952 isl_basic_map_free(bmap
);
6956 /* Remove the explicit representation of local variable "div",
6959 __isl_give isl_basic_map
*isl_basic_map_mark_div_unknown(
6960 __isl_take isl_basic_map
*bmap
, int div
)
6964 unknown
= isl_basic_map_div_is_marked_unknown(bmap
, div
);
6966 return isl_basic_map_free(bmap
);
6970 bmap
= isl_basic_map_cow(bmap
);
6973 isl_int_set_si(bmap
->div
[div
][0], 0);
6977 /* Is local variable "div" of "bmap" marked as not having an explicit
6979 * Note that even if "div" is not marked in this way and therefore
6980 * has an explicit representation, this representation may still
6981 * depend (indirectly) on other local variables that do not
6982 * have an explicit representation.
6984 isl_bool
isl_basic_map_div_is_marked_unknown(__isl_keep isl_basic_map
*bmap
,
6988 return isl_bool_error
;
6989 if (div
< 0 || div
>= isl_basic_map_dim(bmap
, isl_dim_div
))
6990 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
6991 "position out of bounds", return isl_bool_error
);
6992 return isl_int_is_zero(bmap
->div
[div
][0]);
6995 /* Return the position of the first local variable that does not
6996 * have an explicit representation.
6997 * Return the total number of local variables if they all have
6998 * an explicit representation.
6999 * Return -1 on error.
7001 int isl_basic_map_first_unknown_div(__isl_keep isl_basic_map
*bmap
)
7008 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7009 if (!isl_basic_map_div_is_known(bmap
, i
))
7015 /* Return the position of the first local variable that does not
7016 * have an explicit representation.
7017 * Return the total number of local variables if they all have
7018 * an explicit representation.
7019 * Return -1 on error.
7021 int isl_basic_set_first_unknown_div(__isl_keep isl_basic_set
*bset
)
7023 return isl_basic_map_first_unknown_div(bset
);
7026 /* Does "bmap" have an explicit representation for all local variables?
7028 isl_bool
isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
7032 n
= isl_basic_map_dim(bmap
, isl_dim_div
);
7033 first
= isl_basic_map_first_unknown_div(bmap
);
7035 return isl_bool_error
;
7039 /* Do all basic maps in "map" have an explicit representation
7040 * for all local variables?
7042 isl_bool
isl_map_divs_known(__isl_keep isl_map
*map
)
7047 return isl_bool_error
;
7049 for (i
= 0; i
< map
->n
; ++i
) {
7050 int known
= isl_basic_map_divs_known(map
->p
[i
]);
7055 return isl_bool_true
;
7058 /* If bmap contains any unknown divs, then compute explicit
7059 * expressions for them. However, this computation may be
7060 * quite expensive, so first try to remove divs that aren't
7063 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
7066 struct isl_map
*map
;
7068 known
= isl_basic_map_divs_known(bmap
);
7072 return isl_map_from_basic_map(bmap
);
7074 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
7076 known
= isl_basic_map_divs_known(bmap
);
7080 return isl_map_from_basic_map(bmap
);
7082 map
= compute_divs(bmap
);
7085 isl_basic_map_free(bmap
);
7089 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
7093 struct isl_map
*res
;
7100 known
= isl_map_divs_known(map
);
7108 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
7109 for (i
= 1 ; i
< map
->n
; ++i
) {
7111 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
7112 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
7113 res
= isl_map_union_disjoint(res
, r2
);
7115 res
= isl_map_union(res
, r2
);
7122 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
7124 return set_from_map(isl_basic_map_compute_divs(bset_to_bmap(bset
)));
7127 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7129 return set_from_map(isl_map_compute_divs(set_to_map(set
)));
7132 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7135 struct isl_set
*set
;
7140 map
= isl_map_cow(map
);
7144 set
= set_from_map(map
);
7145 set
->dim
= isl_space_domain(set
->dim
);
7148 for (i
= 0; i
< map
->n
; ++i
) {
7149 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7153 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7154 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7161 /* Return the union of "map1" and "map2", where we assume for now that
7162 * "map1" and "map2" are disjoint. Note that the basic maps inside
7163 * "map1" or "map2" may not be disjoint from each other.
7164 * Also note that this function is also called from isl_map_union,
7165 * which takes care of handling the situation where "map1" and "map2"
7166 * may not be disjoint.
7168 * If one of the inputs is empty, we can simply return the other input.
7169 * Similarly, if one of the inputs is universal, then it is equal to the union.
7171 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7172 __isl_take isl_map
*map2
)
7176 struct isl_map
*map
= NULL
;
7182 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
7183 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
7184 "spaces don't match", goto error
);
7195 is_universe
= isl_map_plain_is_universe(map1
);
7196 if (is_universe
< 0)
7203 is_universe
= isl_map_plain_is_universe(map2
);
7204 if (is_universe
< 0)
7211 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7212 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7213 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7215 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7216 map1
->n
+ map2
->n
, flags
);
7219 for (i
= 0; i
< map1
->n
; ++i
) {
7220 map
= isl_map_add_basic_map(map
,
7221 isl_basic_map_copy(map1
->p
[i
]));
7225 for (i
= 0; i
< map2
->n
; ++i
) {
7226 map
= isl_map_add_basic_map(map
,
7227 isl_basic_map_copy(map2
->p
[i
]));
7241 /* Return the union of "map1" and "map2", where "map1" and "map2" are
7242 * guaranteed to be disjoint by the caller.
7244 * Note that this functions is called from within isl_map_make_disjoint,
7245 * so we have to be careful not to touch the constraints of the inputs
7248 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7249 __isl_take isl_map
*map2
)
7251 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7254 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7255 * not be disjoint. The parameters are assumed to have been aligned.
7257 * We currently simply call map_union_disjoint, the internal operation
7258 * of which does not really depend on the inputs being disjoint.
7259 * If the result contains more than one basic map, then we clear
7260 * the disjoint flag since the result may contain basic maps from
7261 * both inputs and these are not guaranteed to be disjoint.
7263 * As a special case, if "map1" and "map2" are obviously equal,
7264 * then we simply return "map1".
7266 static __isl_give isl_map
*map_union_aligned(__isl_take isl_map
*map1
,
7267 __isl_take isl_map
*map2
)
7274 equal
= isl_map_plain_is_equal(map1
, map2
);
7282 map1
= map_union_disjoint(map1
, map2
);
7286 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7294 /* Return the union of "map1" and "map2", where "map1" and "map2" may
7297 __isl_give isl_map
*isl_map_union(__isl_take isl_map
*map1
,
7298 __isl_take isl_map
*map2
)
7300 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_aligned
);
7303 struct isl_set
*isl_set_union_disjoint(
7304 struct isl_set
*set1
, struct isl_set
*set2
)
7306 return set_from_map(isl_map_union_disjoint(set_to_map(set1
),
7310 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7312 return set_from_map(isl_map_union(set_to_map(set1
), set_to_map(set2
)));
7315 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7318 * "map" and "set" are assumed to be compatible and non-NULL.
7320 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7321 __isl_take isl_set
*set
,
7322 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7323 __isl_take isl_basic_set
*bset
))
7326 struct isl_map
*result
;
7329 if (isl_set_plain_is_universe(set
)) {
7334 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7335 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7336 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7338 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7339 map
->n
* set
->n
, flags
);
7340 for (i
= 0; result
&& i
< map
->n
; ++i
)
7341 for (j
= 0; j
< set
->n
; ++j
) {
7342 result
= isl_map_add_basic_map(result
,
7343 fn(isl_basic_map_copy(map
->p
[i
]),
7344 isl_basic_set_copy(set
->p
[j
])));
7354 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7355 __isl_take isl_set
*set
)
7360 if (!isl_map_compatible_range(map
, set
))
7361 isl_die(set
->ctx
, isl_error_invalid
,
7362 "incompatible spaces", goto error
);
7364 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7371 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7372 __isl_take isl_set
*set
)
7374 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7377 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7378 __isl_take isl_set
*set
)
7383 if (!isl_map_compatible_domain(map
, set
))
7384 isl_die(set
->ctx
, isl_error_invalid
,
7385 "incompatible spaces", goto error
);
7387 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7394 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7395 __isl_take isl_set
*set
)
7397 return isl_map_align_params_map_map_and(map
, set
,
7398 &map_intersect_domain
);
7401 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7402 __isl_take isl_map
*map2
)
7406 map1
= isl_map_reverse(map1
);
7407 map1
= isl_map_apply_range(map1
, map2
);
7408 return isl_map_reverse(map1
);
7415 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7416 __isl_take isl_map
*map2
)
7418 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7421 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7422 __isl_take isl_map
*map2
)
7424 isl_space
*dim_result
;
7425 struct isl_map
*result
;
7431 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7432 isl_space_copy(map2
->dim
));
7434 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7437 for (i
= 0; i
< map1
->n
; ++i
)
7438 for (j
= 0; j
< map2
->n
; ++j
) {
7439 result
= isl_map_add_basic_map(result
,
7440 isl_basic_map_apply_range(
7441 isl_basic_map_copy(map1
->p
[i
]),
7442 isl_basic_map_copy(map2
->p
[j
])));
7448 if (result
&& result
->n
<= 1)
7449 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7457 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7458 __isl_take isl_map
*map2
)
7460 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7464 * returns range - domain
7466 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7468 isl_space
*target_space
;
7469 struct isl_basic_set
*bset
;
7476 isl_assert(bmap
->ctx
, isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7477 bmap
->dim
, isl_dim_out
),
7479 target_space
= isl_space_domain(isl_basic_map_get_space(bmap
));
7480 dim
= isl_basic_map_n_in(bmap
);
7481 nparam
= isl_basic_map_n_param(bmap
);
7482 bmap
= isl_basic_map_from_range(isl_basic_map_wrap(bmap
));
7483 bmap
= isl_basic_map_add_dims(bmap
, isl_dim_in
, dim
);
7484 bmap
= isl_basic_map_extend_constraints(bmap
, dim
, 0);
7485 for (i
= 0; i
< dim
; ++i
) {
7486 int j
= isl_basic_map_alloc_equality(bmap
);
7488 bmap
= isl_basic_map_free(bmap
);
7491 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7492 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7493 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], 1);
7494 isl_int_set_si(bmap
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7496 bset
= isl_basic_map_domain(bmap
);
7497 bset
= isl_basic_set_reset_space(bset
, target_space
);
7500 isl_basic_map_free(bmap
);
7505 * returns range - domain
7507 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7511 struct isl_set
*result
;
7516 isl_assert(map
->ctx
, isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7517 map
->dim
, isl_dim_out
),
7519 dim
= isl_map_get_space(map
);
7520 dim
= isl_space_domain(dim
);
7521 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7524 for (i
= 0; i
< map
->n
; ++i
)
7525 result
= isl_set_add_basic_set(result
,
7526 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7535 * returns [domain -> range] -> range - domain
7537 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7538 __isl_take isl_basic_map
*bmap
)
7542 isl_basic_map
*domain
;
7546 if (!isl_space_tuple_is_equal(bmap
->dim
, isl_dim_in
,
7547 bmap
->dim
, isl_dim_out
))
7548 isl_die(bmap
->ctx
, isl_error_invalid
,
7549 "domain and range don't match", goto error
);
7551 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7552 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7554 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7555 domain
= isl_basic_map_universe(dim
);
7557 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7558 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7559 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7561 total
= isl_basic_map_total_dim(bmap
);
7563 for (i
= 0; i
< n
; ++i
) {
7564 k
= isl_basic_map_alloc_equality(bmap
);
7567 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7568 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7569 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7570 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7573 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7574 return isl_basic_map_finalize(bmap
);
7576 isl_basic_map_free(bmap
);
7581 * returns [domain -> range] -> range - domain
7583 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7586 isl_space
*domain_dim
;
7591 if (!isl_space_tuple_is_equal(map
->dim
, isl_dim_in
,
7592 map
->dim
, isl_dim_out
))
7593 isl_die(map
->ctx
, isl_error_invalid
,
7594 "domain and range don't match", goto error
);
7596 map
= isl_map_cow(map
);
7600 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7601 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7602 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7605 for (i
= 0; i
< map
->n
; ++i
) {
7606 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7610 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7617 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7619 struct isl_basic_map
*bmap
;
7627 nparam
= dims
->nparam
;
7629 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7633 for (i
= 0; i
< dim
; ++i
) {
7634 int j
= isl_basic_map_alloc_equality(bmap
);
7637 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7638 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7639 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7641 return isl_basic_map_finalize(bmap
);
7643 isl_basic_map_free(bmap
);
7647 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7651 if (dim
->n_in
!= dim
->n_out
)
7652 isl_die(dim
->ctx
, isl_error_invalid
,
7653 "number of input and output dimensions needs to be "
7654 "the same", goto error
);
7655 return basic_map_identity(dim
);
7657 isl_space_free(dim
);
7661 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7663 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7666 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7668 isl_space
*dim
= isl_set_get_space(set
);
7670 id
= isl_map_identity(isl_space_map_from_set(dim
));
7671 return isl_map_intersect_range(id
, set
);
7674 /* Construct a basic set with all set dimensions having only non-negative
7677 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7678 __isl_take isl_space
*space
)
7683 struct isl_basic_set
*bset
;
7687 nparam
= space
->nparam
;
7689 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7692 for (i
= 0; i
< dim
; ++i
) {
7693 int k
= isl_basic_set_alloc_inequality(bset
);
7696 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7697 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7701 isl_basic_set_free(bset
);
7705 /* Construct the half-space x_pos >= 0.
7707 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7711 isl_basic_set
*nonneg
;
7713 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7714 k
= isl_basic_set_alloc_inequality(nonneg
);
7717 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7718 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7720 return isl_basic_set_finalize(nonneg
);
7722 isl_basic_set_free(nonneg
);
7726 /* Construct the half-space x_pos <= -1.
7728 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7733 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7734 k
= isl_basic_set_alloc_inequality(neg
);
7737 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7738 isl_int_set_si(neg
->ineq
[k
][0], -1);
7739 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7741 return isl_basic_set_finalize(neg
);
7743 isl_basic_set_free(neg
);
7747 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7748 enum isl_dim_type type
, unsigned first
, unsigned n
)
7752 isl_basic_set
*nonneg
;
7760 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7762 offset
= pos(set
->dim
, type
);
7763 for (i
= 0; i
< n
; ++i
) {
7764 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7765 offset
+ first
+ i
);
7766 neg
= neg_halfspace(isl_set_get_space(set
), offset
+ first
+ i
);
7768 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7777 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7778 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7785 if (isl_set_plain_is_empty(set
)) {
7790 return fn(set
, signs
, user
);
7793 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7795 half
= isl_set_intersect(half
, isl_set_copy(set
));
7796 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7800 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7802 half
= isl_set_intersect(half
, set
);
7803 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7809 /* Call "fn" on the intersections of "set" with each of the orthants
7810 * (except for obviously empty intersections). The orthant is identified
7811 * by the signs array, with each entry having value 1 or -1 according
7812 * to the sign of the corresponding variable.
7814 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7815 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7825 if (isl_set_plain_is_empty(set
))
7828 nparam
= isl_set_dim(set
, isl_dim_param
);
7829 nvar
= isl_set_dim(set
, isl_dim_set
);
7831 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7833 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7841 isl_bool
isl_set_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7843 return isl_map_is_equal(set_to_map(set1
), set_to_map(set2
));
7846 isl_bool
isl_basic_map_is_subset(__isl_keep isl_basic_map
*bmap1
,
7847 __isl_keep isl_basic_map
*bmap2
)
7850 struct isl_map
*map1
;
7851 struct isl_map
*map2
;
7853 if (!bmap1
|| !bmap2
)
7854 return isl_bool_error
;
7856 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7857 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7859 is_subset
= isl_map_is_subset(map1
, map2
);
7867 isl_bool
isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7868 __isl_keep isl_basic_set
*bset2
)
7870 return isl_basic_map_is_subset(bset1
, bset2
);
7873 isl_bool
isl_basic_map_is_equal(__isl_keep isl_basic_map
*bmap1
,
7874 __isl_keep isl_basic_map
*bmap2
)
7878 if (!bmap1
|| !bmap2
)
7879 return isl_bool_error
;
7880 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7881 if (is_subset
!= isl_bool_true
)
7883 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7887 isl_bool
isl_basic_set_is_equal(__isl_keep isl_basic_set
*bset1
,
7888 __isl_keep isl_basic_set
*bset2
)
7890 return isl_basic_map_is_equal(
7891 bset_to_bmap(bset1
), bset_to_bmap(bset2
));
7894 isl_bool
isl_map_is_empty(__isl_keep isl_map
*map
)
7900 return isl_bool_error
;
7901 for (i
= 0; i
< map
->n
; ++i
) {
7902 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7904 return isl_bool_error
;
7906 return isl_bool_false
;
7908 return isl_bool_true
;
7911 isl_bool
isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7913 return map
? map
->n
== 0 : isl_bool_error
;
7916 isl_bool
isl_set_plain_is_empty(__isl_keep isl_set
*set
)
7918 return set
? set
->n
== 0 : isl_bool_error
;
7921 isl_bool
isl_set_is_empty(__isl_keep isl_set
*set
)
7923 return isl_map_is_empty(set_to_map(set
));
7926 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7931 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7934 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7939 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7942 static isl_bool
map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7947 return isl_bool_error
;
7948 is_subset
= isl_map_is_subset(map1
, map2
);
7949 if (is_subset
!= isl_bool_true
)
7951 is_subset
= isl_map_is_subset(map2
, map1
);
7955 /* Is "map1" equal to "map2"?
7957 * First check if they are obviously equal.
7958 * If not, then perform a more detailed analysis.
7960 isl_bool
isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7964 equal
= isl_map_plain_is_equal(map1
, map2
);
7965 if (equal
< 0 || equal
)
7967 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7970 isl_bool
isl_basic_map_is_strict_subset(
7971 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7975 if (!bmap1
|| !bmap2
)
7976 return isl_bool_error
;
7977 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7978 if (is_subset
!= isl_bool_true
)
7980 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7981 if (is_subset
== isl_bool_error
)
7986 isl_bool
isl_map_is_strict_subset(__isl_keep isl_map
*map1
,
7987 __isl_keep isl_map
*map2
)
7992 return isl_bool_error
;
7993 is_subset
= isl_map_is_subset(map1
, map2
);
7994 if (is_subset
!= isl_bool_true
)
7996 is_subset
= isl_map_is_subset(map2
, map1
);
7997 if (is_subset
== isl_bool_error
)
8002 isl_bool
isl_set_is_strict_subset(__isl_keep isl_set
*set1
,
8003 __isl_keep isl_set
*set2
)
8005 return isl_map_is_strict_subset(set_to_map(set1
), set_to_map(set2
));
8008 /* Is "bmap" obviously equal to the universe with the same space?
8010 * That is, does it not have any constraints?
8012 isl_bool
isl_basic_map_plain_is_universe(__isl_keep isl_basic_map
*bmap
)
8015 return isl_bool_error
;
8016 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
8019 /* Is "bset" obviously equal to the universe with the same space?
8021 isl_bool
isl_basic_set_plain_is_universe(__isl_keep isl_basic_set
*bset
)
8023 return isl_basic_map_plain_is_universe(bset
);
8026 /* If "c" does not involve any existentially quantified variables,
8027 * then set *univ to false and abort
8029 static isl_stat
involves_divs(__isl_take isl_constraint
*c
, void *user
)
8031 isl_bool
*univ
= user
;
8034 n
= isl_constraint_dim(c
, isl_dim_div
);
8035 *univ
= isl_constraint_involves_dims(c
, isl_dim_div
, 0, n
);
8036 isl_constraint_free(c
);
8037 if (*univ
< 0 || !*univ
)
8038 return isl_stat_error
;
8042 /* Is "bmap" equal to the universe with the same space?
8044 * First check if it is obviously equal to the universe.
8045 * If not and if there are any constraints not involving
8046 * existentially quantified variables, then it is certainly
8047 * not equal to the universe.
8048 * Otherwise, check if the universe is a subset of "bmap".
8050 isl_bool
isl_basic_map_is_universe(__isl_keep isl_basic_map
*bmap
)
8053 isl_basic_map
*test
;
8055 univ
= isl_basic_map_plain_is_universe(bmap
);
8056 if (univ
< 0 || univ
)
8058 if (isl_basic_map_dim(bmap
, isl_dim_div
) == 0)
8059 return isl_bool_false
;
8060 univ
= isl_bool_true
;
8061 if (isl_basic_map_foreach_constraint(bmap
, &involves_divs
, &univ
) < 0 &&
8063 return isl_bool_error
;
8064 if (univ
< 0 || !univ
)
8066 test
= isl_basic_map_universe(isl_basic_map_get_space(bmap
));
8067 univ
= isl_basic_map_is_subset(test
, bmap
);
8068 isl_basic_map_free(test
);
8072 /* Is "bset" equal to the universe with the same space?
8074 isl_bool
isl_basic_set_is_universe(__isl_keep isl_basic_set
*bset
)
8076 return isl_basic_map_is_universe(bset
);
8079 isl_bool
isl_map_plain_is_universe(__isl_keep isl_map
*map
)
8084 return isl_bool_error
;
8086 for (i
= 0; i
< map
->n
; ++i
) {
8087 isl_bool r
= isl_basic_map_plain_is_universe(map
->p
[i
]);
8092 return isl_bool_false
;
8095 isl_bool
isl_set_plain_is_universe(__isl_keep isl_set
*set
)
8097 return isl_map_plain_is_universe(set_to_map(set
));
8100 isl_bool
isl_basic_map_is_empty(__isl_keep isl_basic_map
*bmap
)
8102 struct isl_basic_set
*bset
= NULL
;
8103 struct isl_vec
*sample
= NULL
;
8104 isl_bool empty
, non_empty
;
8107 return isl_bool_error
;
8109 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
8110 return isl_bool_true
;
8112 if (isl_basic_map_plain_is_universe(bmap
))
8113 return isl_bool_false
;
8115 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
8116 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
8117 copy
= isl_basic_map_remove_redundancies(copy
);
8118 empty
= isl_basic_map_plain_is_empty(copy
);
8119 isl_basic_map_free(copy
);
8123 non_empty
= isl_basic_map_plain_is_non_empty(bmap
);
8125 return isl_bool_error
;
8127 return isl_bool_false
;
8128 isl_vec_free(bmap
->sample
);
8129 bmap
->sample
= NULL
;
8130 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
8132 return isl_bool_error
;
8133 sample
= isl_basic_set_sample_vec(bset
);
8135 return isl_bool_error
;
8136 empty
= sample
->size
== 0;
8137 isl_vec_free(bmap
->sample
);
8138 bmap
->sample
= sample
;
8140 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
8145 isl_bool
isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
8148 return isl_bool_error
;
8149 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
8152 isl_bool
isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
8155 return isl_bool_error
;
8156 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
8159 /* Is "bmap" known to be non-empty?
8161 * That is, is the cached sample still valid?
8163 isl_bool
isl_basic_map_plain_is_non_empty(__isl_keep isl_basic_map
*bmap
)
8168 return isl_bool_error
;
8170 return isl_bool_false
;
8171 total
= 1 + isl_basic_map_total_dim(bmap
);
8172 if (bmap
->sample
->size
!= total
)
8173 return isl_bool_false
;
8174 return isl_basic_map_contains(bmap
, bmap
->sample
);
8177 isl_bool
isl_basic_set_is_empty(__isl_keep isl_basic_set
*bset
)
8179 return isl_basic_map_is_empty(bset_to_bmap(bset
));
8182 struct isl_map
*isl_basic_map_union(
8183 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
8185 struct isl_map
*map
;
8186 if (!bmap1
|| !bmap2
)
8189 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
8191 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
8194 map
= isl_map_add_basic_map(map
, bmap1
);
8195 map
= isl_map_add_basic_map(map
, bmap2
);
8198 isl_basic_map_free(bmap1
);
8199 isl_basic_map_free(bmap2
);
8203 struct isl_set
*isl_basic_set_union(
8204 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
8206 return set_from_map(isl_basic_map_union(bset_to_bmap(bset1
),
8207 bset_to_bmap(bset2
)));
8210 /* Order divs such that any div only depends on previous divs */
8211 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8219 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8221 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8223 if (isl_int_is_zero(bmap
->div
[i
][0]))
8225 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8230 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_internal
,
8231 "integer division depends on itself",
8232 return isl_basic_map_free(bmap
));
8233 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8239 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8241 return bset_from_bmap(isl_basic_map_order_divs(bset_to_bmap(bset
)));
8244 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8251 for (i
= 0; i
< map
->n
; ++i
) {
8252 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8263 /* Sort the local variables of "bset".
8265 __isl_give isl_basic_set
*isl_basic_set_sort_divs(
8266 __isl_take isl_basic_set
*bset
)
8268 return bset_from_bmap(isl_basic_map_sort_divs(bset_to_bmap(bset
)));
8271 /* Apply the expansion computed by isl_merge_divs.
8272 * The expansion itself is given by "exp" while the resulting
8273 * list of divs is given by "div".
8275 * Move the integer divisions of "bmap" into the right position
8276 * according to "exp" and then introduce the additional integer
8277 * divisions, adding div constraints.
8278 * The moving should be done first to avoid moving coefficients
8279 * in the definitions of the extra integer divisions.
8281 __isl_give isl_basic_map
*isl_basic_map_expand_divs(
8282 __isl_take isl_basic_map
*bmap
, __isl_take isl_mat
*div
, int *exp
)
8287 bmap
= isl_basic_map_cow(bmap
);
8291 if (div
->n_row
< bmap
->n_div
)
8292 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8293 "not an expansion", goto error
);
8295 n_div
= bmap
->n_div
;
8296 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
8297 div
->n_row
- n_div
, 0,
8298 2 * (div
->n_row
- n_div
));
8300 for (i
= n_div
; i
< div
->n_row
; ++i
)
8301 if (isl_basic_map_alloc_div(bmap
) < 0)
8304 for (j
= n_div
- 1; j
>= 0; --j
) {
8307 isl_basic_map_swap_div(bmap
, j
, exp
[j
]);
8310 for (i
= 0; i
< div
->n_row
; ++i
) {
8311 if (j
< n_div
&& exp
[j
] == i
) {
8314 isl_seq_cpy(bmap
->div
[i
], div
->row
[i
], div
->n_col
);
8315 if (isl_basic_map_div_is_marked_unknown(bmap
, i
))
8317 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
8325 isl_basic_map_free(bmap
);
8330 /* Apply the expansion computed by isl_merge_divs.
8331 * The expansion itself is given by "exp" while the resulting
8332 * list of divs is given by "div".
8334 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8335 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8337 return isl_basic_map_expand_divs(bset
, div
, exp
);
8340 /* Look for a div in dst that corresponds to the div "div" in src.
8341 * The divs before "div" in src and dst are assumed to be the same.
8343 * Returns -1 if no corresponding div was found and the position
8344 * of the corresponding div in dst otherwise.
8346 static int find_div(struct isl_basic_map
*dst
,
8347 struct isl_basic_map
*src
, unsigned div
)
8351 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8353 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8354 for (i
= div
; i
< dst
->n_div
; ++i
)
8355 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8356 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8357 dst
->n_div
- div
) == -1)
8362 /* Align the divs of "dst" to those of "src", adding divs from "src"
8363 * if needed. That is, make sure that the first src->n_div divs
8364 * of the result are equal to those of src.
8366 * The result is not finalized as by design it will have redundant
8367 * divs if any divs from "src" were copied.
8369 __isl_give isl_basic_map
*isl_basic_map_align_divs(
8370 __isl_take isl_basic_map
*dst
, __isl_keep isl_basic_map
*src
)
8373 int known
, extended
;
8377 return isl_basic_map_free(dst
);
8379 if (src
->n_div
== 0)
8382 known
= isl_basic_map_divs_known(src
);
8384 return isl_basic_map_free(dst
);
8386 isl_die(isl_basic_map_get_ctx(src
), isl_error_invalid
,
8387 "some src divs are unknown",
8388 return isl_basic_map_free(dst
));
8390 src
= isl_basic_map_order_divs(src
);
8393 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8394 for (i
= 0; i
< src
->n_div
; ++i
) {
8395 int j
= find_div(dst
, src
, i
);
8398 int extra
= src
->n_div
- i
;
8399 dst
= isl_basic_map_cow(dst
);
8402 dst
= isl_basic_map_extend_space(dst
,
8403 isl_space_copy(dst
->dim
),
8404 extra
, 0, 2 * extra
);
8407 j
= isl_basic_map_alloc_div(dst
);
8409 return isl_basic_map_free(dst
);
8410 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8411 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8412 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8413 return isl_basic_map_free(dst
);
8416 isl_basic_map_swap_div(dst
, i
, j
);
8421 struct isl_basic_set
*isl_basic_set_align_divs(
8422 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8424 return bset_from_bmap(isl_basic_map_align_divs(bset_to_bmap(dst
),
8425 bset_to_bmap(src
)));
8428 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8436 map
= isl_map_compute_divs(map
);
8437 map
= isl_map_cow(map
);
8441 for (i
= 1; i
< map
->n
; ++i
)
8442 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8443 for (i
= 1; i
< map
->n
; ++i
) {
8444 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8446 return isl_map_free(map
);
8449 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8453 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8455 return set_from_map(isl_map_align_divs(set_to_map(set
)));
8458 /* Align the divs of the basic maps in "map" to those
8459 * of the basic maps in "list", as well as to the other basic maps in "map".
8460 * The elements in "list" are assumed to have known divs.
8462 __isl_give isl_map
*isl_map_align_divs_to_basic_map_list(
8463 __isl_take isl_map
*map
, __isl_keep isl_basic_map_list
*list
)
8467 map
= isl_map_compute_divs(map
);
8468 map
= isl_map_cow(map
);
8470 return isl_map_free(map
);
8474 n
= isl_basic_map_list_n_basic_map(list
);
8475 for (i
= 0; i
< n
; ++i
) {
8476 isl_basic_map
*bmap
;
8478 bmap
= isl_basic_map_list_get_basic_map(list
, i
);
8479 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], bmap
);
8480 isl_basic_map_free(bmap
);
8483 return isl_map_free(map
);
8485 return isl_map_align_divs(map
);
8488 /* Align the divs of each element of "list" to those of "bmap".
8489 * Both "bmap" and the elements of "list" are assumed to have known divs.
8491 __isl_give isl_basic_map_list
*isl_basic_map_list_align_divs_to_basic_map(
8492 __isl_take isl_basic_map_list
*list
, __isl_keep isl_basic_map
*bmap
)
8497 return isl_basic_map_list_free(list
);
8499 n
= isl_basic_map_list_n_basic_map(list
);
8500 for (i
= 0; i
< n
; ++i
) {
8501 isl_basic_map
*bmap_i
;
8503 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
8504 bmap_i
= isl_basic_map_align_divs(bmap_i
, bmap
);
8505 list
= isl_basic_map_list_set_basic_map(list
, i
, bmap_i
);
8511 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8512 __isl_take isl_map
*map
)
8516 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8517 map
= isl_map_intersect_domain(map
, set
);
8518 set
= isl_map_range(map
);
8526 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8527 __isl_take isl_map
*map
)
8529 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8532 /* There is no need to cow as removing empty parts doesn't change
8533 * the meaning of the set.
8535 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8542 for (i
= map
->n
- 1; i
>= 0; --i
)
8543 remove_if_empty(map
, i
);
8548 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8550 return set_from_map(isl_map_remove_empty_parts(set_to_map(set
)));
8553 static __isl_give isl_basic_map
*map_copy_basic_map(__isl_keep isl_map
*map
)
8555 struct isl_basic_map
*bmap
;
8556 if (!map
|| map
->n
== 0)
8558 bmap
= map
->p
[map
->n
-1];
8559 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8560 return isl_basic_map_copy(bmap
);
8563 __isl_give isl_basic_map
*isl_map_copy_basic_map(__isl_keep isl_map
*map
)
8565 return map_copy_basic_map(map
);
8568 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8570 return bset_from_bmap(map_copy_basic_map(set_to_map(set
)));
8573 static __isl_give isl_map
*map_drop_basic_map(__isl_take isl_map
*map
,
8574 __isl_keep isl_basic_map
*bmap
)
8580 for (i
= map
->n
-1; i
>= 0; --i
) {
8581 if (map
->p
[i
] != bmap
)
8583 map
= isl_map_cow(map
);
8586 isl_basic_map_free(map
->p
[i
]);
8587 if (i
!= map
->n
-1) {
8588 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8589 map
->p
[i
] = map
->p
[map
->n
-1];
8600 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8601 __isl_keep isl_basic_map
*bmap
)
8603 return map_drop_basic_map(map
, bmap
);
8606 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8607 struct isl_basic_set
*bset
)
8609 return set_from_map(map_drop_basic_map(set_to_map(set
),
8610 bset_to_bmap(bset
)));
8613 /* Given two basic sets bset1 and bset2, compute the maximal difference
8614 * between the values of dimension pos in bset1 and those in bset2
8615 * for any common value of the parameters and dimensions preceding pos.
8617 static enum isl_lp_result
basic_set_maximal_difference_at(
8618 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8619 int pos
, isl_int
*opt
)
8621 isl_basic_map
*bmap1
;
8622 isl_basic_map
*bmap2
;
8623 struct isl_ctx
*ctx
;
8624 struct isl_vec
*obj
;
8628 enum isl_lp_result res
;
8630 if (!bset1
|| !bset2
)
8631 return isl_lp_error
;
8633 nparam
= isl_basic_set_n_param(bset1
);
8634 dim1
= isl_basic_set_n_dim(bset1
);
8636 bmap1
= isl_basic_map_from_range(isl_basic_set_copy(bset1
));
8637 bmap2
= isl_basic_map_from_range(isl_basic_set_copy(bset2
));
8638 bmap1
= isl_basic_map_move_dims(bmap1
, isl_dim_in
, 0,
8639 isl_dim_out
, 0, pos
);
8640 bmap2
= isl_basic_map_move_dims(bmap2
, isl_dim_in
, 0,
8641 isl_dim_out
, 0, pos
);
8642 bmap1
= isl_basic_map_range_product(bmap1
, bmap2
);
8644 return isl_lp_error
;
8646 total
= isl_basic_map_total_dim(bmap1
);
8648 obj
= isl_vec_alloc(ctx
, 1 + total
);
8651 isl_seq_clr(obj
->block
.data
, 1 + total
);
8652 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8653 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8654 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8656 isl_basic_map_free(bmap1
);
8660 isl_basic_map_free(bmap1
);
8661 return isl_lp_error
;
8664 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8665 * for any common value of the parameters and dimensions preceding pos
8666 * in both basic sets, the values of dimension pos in bset1 are
8667 * smaller or larger than those in bset2.
8670 * 1 if bset1 follows bset2
8671 * -1 if bset1 precedes bset2
8672 * 0 if bset1 and bset2 are incomparable
8673 * -2 if some error occurred.
8675 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8676 struct isl_basic_set
*bset2
, int pos
)
8679 enum isl_lp_result res
;
8684 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8686 if (res
== isl_lp_empty
)
8688 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8689 res
== isl_lp_unbounded
)
8691 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8700 /* Given two basic sets bset1 and bset2, check whether
8701 * for any common value of the parameters and dimensions preceding pos
8702 * there is a value of dimension pos in bset1 that is larger
8703 * than a value of the same dimension in bset2.
8706 * 1 if there exists such a pair
8707 * 0 if there is no such pair, but there is a pair of equal values
8709 * -2 if some error occurred.
8711 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8712 __isl_keep isl_basic_set
*bset2
, int pos
)
8715 enum isl_lp_result res
;
8720 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8722 if (res
== isl_lp_empty
)
8724 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8725 res
== isl_lp_unbounded
)
8727 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8729 else if (res
== isl_lp_ok
)
8738 /* Given two sets set1 and set2, check whether
8739 * for any common value of the parameters and dimensions preceding pos
8740 * there is a value of dimension pos in set1 that is larger
8741 * than a value of the same dimension in set2.
8744 * 1 if there exists such a pair
8745 * 0 if there is no such pair, but there is a pair of equal values
8747 * -2 if some error occurred.
8749 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8750 __isl_keep isl_set
*set2
, int pos
)
8758 for (i
= 0; i
< set1
->n
; ++i
)
8759 for (j
= 0; j
< set2
->n
; ++j
) {
8761 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8762 if (f
== 1 || f
== -2)
8771 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8772 unsigned pos
, isl_int
*val
)
8780 total
= isl_basic_map_total_dim(bmap
);
8781 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8782 for (; d
+1 > pos
; --d
)
8783 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8787 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8789 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8791 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8794 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8800 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8801 unsigned pos
, isl_int
*val
)
8813 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8816 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8817 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8818 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8819 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8823 isl_int_set(*val
, v
);
8829 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8830 unsigned pos
, isl_int
*val
)
8832 return isl_basic_map_plain_has_fixed_var(bset_to_bmap(bset
),
8836 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8839 return isl_map_plain_has_fixed_var(set_to_map(set
), pos
, val
);
8842 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8843 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8845 if (pos
>= isl_basic_map_dim(bmap
, type
))
8847 return isl_basic_map_plain_has_fixed_var(bmap
,
8848 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8851 /* If "bmap" obviously lies on a hyperplane where the given dimension
8852 * has a fixed value, then return that value.
8853 * Otherwise return NaN.
8855 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8856 __isl_keep isl_basic_map
*bmap
,
8857 enum isl_dim_type type
, unsigned pos
)
8865 ctx
= isl_basic_map_get_ctx(bmap
);
8866 v
= isl_val_alloc(ctx
);
8869 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8871 return isl_val_free(v
);
8873 isl_int_set_si(v
->d
, 1);
8877 return isl_val_nan(ctx
);
8880 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8881 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8883 if (pos
>= isl_map_dim(map
, type
))
8885 return isl_map_plain_has_fixed_var(map
,
8886 map_offset(map
, type
) - 1 + pos
, val
);
8889 /* If "map" obviously lies on a hyperplane where the given dimension
8890 * has a fixed value, then return that value.
8891 * Otherwise return NaN.
8893 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8894 enum isl_dim_type type
, unsigned pos
)
8902 ctx
= isl_map_get_ctx(map
);
8903 v
= isl_val_alloc(ctx
);
8906 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8908 return isl_val_free(v
);
8910 isl_int_set_si(v
->d
, 1);
8914 return isl_val_nan(ctx
);
8917 /* If "set" obviously lies on a hyperplane where the given dimension
8918 * has a fixed value, then return that value.
8919 * Otherwise return NaN.
8921 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8922 enum isl_dim_type type
, unsigned pos
)
8924 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8927 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8928 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8930 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8933 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8934 * then return this fixed value in *val.
8936 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8937 unsigned dim
, isl_int
*val
)
8939 return isl_basic_set_plain_has_fixed_var(bset
,
8940 isl_basic_set_n_param(bset
) + dim
, val
);
8943 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8944 * then return this fixed value in *val.
8946 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8947 unsigned dim
, isl_int
*val
)
8949 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8952 /* Check if input variable in has fixed value and if so and if val is not NULL,
8953 * then return this fixed value in *val.
8955 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8956 unsigned in
, isl_int
*val
)
8958 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8961 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8962 * and if val is not NULL, then return this lower bound in *val.
8964 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8965 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8967 int i
, i_eq
= -1, i_ineq
= -1;
8974 total
= isl_basic_set_total_dim(bset
);
8975 nparam
= isl_basic_set_n_param(bset
);
8976 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8977 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8983 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8984 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8986 if (i_eq
!= -1 || i_ineq
!= -1)
8990 if (i_eq
== -1 && i_ineq
== -1)
8992 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8993 /* The coefficient should always be one due to normalization. */
8994 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8996 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8998 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8999 total
- nparam
- dim
- 1) != -1)
9002 isl_int_neg(*val
, c
[0]);
9006 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
9007 unsigned dim
, isl_int
*val
)
9019 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
9023 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
9025 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
9026 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
9028 if (fixed
== 1 && isl_int_ne(tmp
, v
))
9032 isl_int_set(*val
, v
);
9038 /* Return -1 if the constraint "c1" should be sorted before "c2"
9039 * and 1 if it should be sorted after "c2".
9040 * Return 0 if the two constraints are the same (up to the constant term).
9042 * In particular, if a constraint involves later variables than another
9043 * then it is sorted after this other constraint.
9044 * uset_gist depends on constraints without existentially quantified
9045 * variables sorting first.
9047 * For constraints that have the same latest variable, those
9048 * with the same coefficient for this latest variable (first in absolute value
9049 * and then in actual value) are grouped together.
9050 * This is useful for detecting pairs of constraints that can
9051 * be chained in their printed representation.
9053 * Finally, within a group, constraints are sorted according to
9054 * their coefficients (excluding the constant term).
9056 static int sort_constraint_cmp(const void *p1
, const void *p2
, void *arg
)
9058 isl_int
**c1
= (isl_int
**) p1
;
9059 isl_int
**c2
= (isl_int
**) p2
;
9061 unsigned size
= *(unsigned *) arg
;
9064 l1
= isl_seq_last_non_zero(*c1
+ 1, size
);
9065 l2
= isl_seq_last_non_zero(*c2
+ 1, size
);
9070 cmp
= isl_int_abs_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9073 cmp
= isl_int_cmp((*c1
)[1 + l1
], (*c2
)[1 + l1
]);
9077 return isl_seq_cmp(*c1
+ 1, *c2
+ 1, size
);
9080 /* Return -1 if the constraint "c1" of "bmap" is sorted before "c2"
9081 * by isl_basic_map_sort_constraints, 1 if it is sorted after "c2"
9082 * and 0 if the two constraints are the same (up to the constant term).
9084 int isl_basic_map_constraint_cmp(__isl_keep isl_basic_map
*bmap
,
9085 isl_int
*c1
, isl_int
*c2
)
9091 total
= isl_basic_map_total_dim(bmap
);
9092 return sort_constraint_cmp(&c1
, &c2
, &total
);
9095 __isl_give isl_basic_map
*isl_basic_map_sort_constraints(
9096 __isl_take isl_basic_map
*bmap
)
9102 if (bmap
->n_ineq
== 0)
9104 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9106 total
= isl_basic_map_total_dim(bmap
);
9107 if (isl_sort(bmap
->ineq
, bmap
->n_ineq
, sizeof(isl_int
*),
9108 &sort_constraint_cmp
, &total
) < 0)
9109 return isl_basic_map_free(bmap
);
9113 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
9114 __isl_take isl_basic_set
*bset
)
9116 isl_basic_map
*bmap
= bset_to_bmap(bset
);
9117 return bset_from_bmap(isl_basic_map_sort_constraints(bmap
));
9120 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
9124 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
9126 bmap
= isl_basic_map_remove_redundancies(bmap
);
9127 bmap
= isl_basic_map_sort_constraints(bmap
);
9129 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
9133 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
9135 return bset_from_bmap(isl_basic_map_normalize(bset_to_bmap(bset
)));
9138 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
9139 const __isl_keep isl_basic_map
*bmap2
)
9144 if (!bmap1
|| !bmap2
)
9149 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
9150 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
9151 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
9152 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
9153 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
9154 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
9155 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9156 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
9157 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
9158 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
9159 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9161 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
9163 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
9165 if (bmap1
->n_eq
!= bmap2
->n_eq
)
9166 return bmap1
->n_eq
- bmap2
->n_eq
;
9167 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
9168 return bmap1
->n_ineq
- bmap2
->n_ineq
;
9169 if (bmap1
->n_div
!= bmap2
->n_div
)
9170 return bmap1
->n_div
- bmap2
->n_div
;
9171 total
= isl_basic_map_total_dim(bmap1
);
9172 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
9173 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
9177 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
9178 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
9182 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
9183 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
9190 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
9191 const __isl_keep isl_basic_set
*bset2
)
9193 return isl_basic_map_plain_cmp(bset1
, bset2
);
9196 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9202 if (set1
->n
!= set2
->n
)
9203 return set1
->n
- set2
->n
;
9205 for (i
= 0; i
< set1
->n
; ++i
) {
9206 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
9214 isl_bool
isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
9215 __isl_keep isl_basic_map
*bmap2
)
9217 if (!bmap1
|| !bmap2
)
9218 return isl_bool_error
;
9219 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
9222 isl_bool
isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
9223 __isl_keep isl_basic_set
*bset2
)
9225 return isl_basic_map_plain_is_equal(bset_to_bmap(bset1
),
9226 bset_to_bmap(bset2
));
9229 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
9231 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
9232 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
9234 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
9237 /* Sort the basic maps of "map" and remove duplicate basic maps.
9239 * While removing basic maps, we make sure that the basic maps remain
9240 * sorted because isl_map_normalize expects the basic maps of the result
9243 static __isl_give isl_map
*sort_and_remove_duplicates(__isl_take isl_map
*map
)
9247 map
= isl_map_remove_empty_parts(map
);
9250 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
9251 for (i
= map
->n
- 1; i
>= 1; --i
) {
9252 if (!isl_basic_map_plain_is_equal(map
->p
[i
- 1], map
->p
[i
]))
9254 isl_basic_map_free(map
->p
[i
-1]);
9255 for (j
= i
; j
< map
->n
; ++j
)
9256 map
->p
[j
- 1] = map
->p
[j
];
9263 /* Remove obvious duplicates among the basic maps of "map".
9265 * Unlike isl_map_normalize, this function does not remove redundant
9266 * constraints and only removes duplicates that have exactly the same
9267 * constraints in the input. It does sort the constraints and
9268 * the basic maps to ease the detection of duplicates.
9270 * If "map" has already been normalized or if the basic maps are
9271 * disjoint, then there can be no duplicates.
9273 __isl_give isl_map
*isl_map_remove_obvious_duplicates(__isl_take isl_map
*map
)
9276 isl_basic_map
*bmap
;
9282 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
| ISL_MAP_DISJOINT
))
9284 for (i
= 0; i
< map
->n
; ++i
) {
9285 bmap
= isl_basic_map_copy(map
->p
[i
]);
9286 bmap
= isl_basic_map_sort_constraints(bmap
);
9288 return isl_map_free(map
);
9289 isl_basic_map_free(map
->p
[i
]);
9293 map
= sort_and_remove_duplicates(map
);
9297 /* We normalize in place, but if anything goes wrong we need
9298 * to return NULL, so we need to make sure we don't change the
9299 * meaning of any possible other copies of map.
9301 __isl_give isl_map
*isl_map_normalize(__isl_take isl_map
*map
)
9304 struct isl_basic_map
*bmap
;
9308 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
9310 for (i
= 0; i
< map
->n
; ++i
) {
9311 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
9314 isl_basic_map_free(map
->p
[i
]);
9318 map
= sort_and_remove_duplicates(map
);
9320 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
9327 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
9329 return set_from_map(isl_map_normalize(set_to_map(set
)));
9332 isl_bool
isl_map_plain_is_equal(__isl_keep isl_map
*map1
,
9333 __isl_keep isl_map
*map2
)
9339 return isl_bool_error
;
9342 return isl_bool_true
;
9343 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
9344 return isl_bool_false
;
9346 map1
= isl_map_copy(map1
);
9347 map2
= isl_map_copy(map2
);
9348 map1
= isl_map_normalize(map1
);
9349 map2
= isl_map_normalize(map2
);
9352 equal
= map1
->n
== map2
->n
;
9353 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
9354 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
9364 return isl_bool_error
;
9367 isl_bool
isl_set_plain_is_equal(__isl_keep isl_set
*set1
,
9368 __isl_keep isl_set
*set2
)
9370 return isl_map_plain_is_equal(set_to_map(set1
), set_to_map(set2
));
9373 /* Return an interval that ranges from min to max (inclusive)
9375 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
9376 isl_int min
, isl_int max
)
9379 struct isl_basic_set
*bset
= NULL
;
9381 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
9385 k
= isl_basic_set_alloc_inequality(bset
);
9388 isl_int_set_si(bset
->ineq
[k
][1], 1);
9389 isl_int_neg(bset
->ineq
[k
][0], min
);
9391 k
= isl_basic_set_alloc_inequality(bset
);
9394 isl_int_set_si(bset
->ineq
[k
][1], -1);
9395 isl_int_set(bset
->ineq
[k
][0], max
);
9399 isl_basic_set_free(bset
);
9403 /* Return the basic maps in "map" as a list.
9405 __isl_give isl_basic_map_list
*isl_map_get_basic_map_list(
9406 __isl_keep isl_map
*map
)
9410 isl_basic_map_list
*list
;
9414 ctx
= isl_map_get_ctx(map
);
9415 list
= isl_basic_map_list_alloc(ctx
, map
->n
);
9417 for (i
= 0; i
< map
->n
; ++i
) {
9418 isl_basic_map
*bmap
;
9420 bmap
= isl_basic_map_copy(map
->p
[i
]);
9421 list
= isl_basic_map_list_add(list
, bmap
);
9427 /* Return the intersection of the elements in the non-empty list "list".
9428 * All elements are assumed to live in the same space.
9430 __isl_give isl_basic_map
*isl_basic_map_list_intersect(
9431 __isl_take isl_basic_map_list
*list
)
9434 isl_basic_map
*bmap
;
9438 n
= isl_basic_map_list_n_basic_map(list
);
9440 isl_die(isl_basic_map_list_get_ctx(list
), isl_error_invalid
,
9441 "expecting non-empty list", goto error
);
9443 bmap
= isl_basic_map_list_get_basic_map(list
, 0);
9444 for (i
= 1; i
< n
; ++i
) {
9445 isl_basic_map
*bmap_i
;
9447 bmap_i
= isl_basic_map_list_get_basic_map(list
, i
);
9448 bmap
= isl_basic_map_intersect(bmap
, bmap_i
);
9451 isl_basic_map_list_free(list
);
9454 isl_basic_map_list_free(list
);
9458 /* Return the intersection of the elements in the non-empty list "list".
9459 * All elements are assumed to live in the same space.
9461 __isl_give isl_basic_set
*isl_basic_set_list_intersect(
9462 __isl_take isl_basic_set_list
*list
)
9464 return isl_basic_map_list_intersect(list
);
9467 /* Return the union of the elements of "list".
9468 * The list is required to have at least one element.
9470 __isl_give isl_set
*isl_basic_set_list_union(
9471 __isl_take isl_basic_set_list
*list
)
9475 isl_basic_set
*bset
;
9480 n
= isl_basic_set_list_n_basic_set(list
);
9482 isl_die(isl_basic_set_list_get_ctx(list
), isl_error_invalid
,
9483 "expecting non-empty list", goto error
);
9485 bset
= isl_basic_set_list_get_basic_set(list
, 0);
9486 space
= isl_basic_set_get_space(bset
);
9487 isl_basic_set_free(bset
);
9489 set
= isl_set_alloc_space(space
, n
, 0);
9490 for (i
= 0; i
< n
; ++i
) {
9491 bset
= isl_basic_set_list_get_basic_set(list
, i
);
9492 set
= isl_set_add_basic_set(set
, bset
);
9495 isl_basic_set_list_free(list
);
9498 isl_basic_set_list_free(list
);
9502 /* Return the union of the elements in the non-empty list "list".
9503 * All elements are assumed to live in the same space.
9505 __isl_give isl_set
*isl_set_list_union(__isl_take isl_set_list
*list
)
9512 n
= isl_set_list_n_set(list
);
9514 isl_die(isl_set_list_get_ctx(list
), isl_error_invalid
,
9515 "expecting non-empty list", goto error
);
9517 set
= isl_set_list_get_set(list
, 0);
9518 for (i
= 1; i
< n
; ++i
) {
9521 set_i
= isl_set_list_get_set(list
, i
);
9522 set
= isl_set_union(set
, set_i
);
9525 isl_set_list_free(list
);
9528 isl_set_list_free(list
);
9532 /* Return the Cartesian product of the basic sets in list (in the given order).
9534 __isl_give isl_basic_set
*isl_basic_set_list_product(
9535 __isl_take
struct isl_basic_set_list
*list
)
9543 struct isl_basic_set
*product
= NULL
;
9547 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9548 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9549 nparam
= isl_basic_set_n_param(list
->p
[0]);
9550 dim
= isl_basic_set_n_dim(list
->p
[0]);
9551 extra
= list
->p
[0]->n_div
;
9552 n_eq
= list
->p
[0]->n_eq
;
9553 n_ineq
= list
->p
[0]->n_ineq
;
9554 for (i
= 1; i
< list
->n
; ++i
) {
9555 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9556 isl_assert(list
->ctx
,
9557 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9558 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9559 extra
+= list
->p
[i
]->n_div
;
9560 n_eq
+= list
->p
[i
]->n_eq
;
9561 n_ineq
+= list
->p
[i
]->n_ineq
;
9563 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9568 for (i
= 0; i
< list
->n
; ++i
) {
9569 isl_basic_set_add_constraints(product
,
9570 isl_basic_set_copy(list
->p
[i
]), dim
);
9571 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9573 isl_basic_set_list_free(list
);
9576 isl_basic_set_free(product
);
9577 isl_basic_set_list_free(list
);
9581 struct isl_basic_map
*isl_basic_map_product(
9582 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9584 isl_space
*dim_result
= NULL
;
9585 struct isl_basic_map
*bmap
;
9586 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9587 struct isl_dim_map
*dim_map1
, *dim_map2
;
9589 if (!bmap1
|| !bmap2
)
9592 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9593 bmap2
->dim
, isl_dim_param
), goto error
);
9594 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9595 isl_space_copy(bmap2
->dim
));
9597 in1
= isl_basic_map_n_in(bmap1
);
9598 in2
= isl_basic_map_n_in(bmap2
);
9599 out1
= isl_basic_map_n_out(bmap1
);
9600 out2
= isl_basic_map_n_out(bmap2
);
9601 nparam
= isl_basic_map_n_param(bmap1
);
9603 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9604 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9605 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9606 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9607 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9608 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9609 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9610 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9611 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9612 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9613 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9615 bmap
= isl_basic_map_alloc_space(dim_result
,
9616 bmap1
->n_div
+ bmap2
->n_div
,
9617 bmap1
->n_eq
+ bmap2
->n_eq
,
9618 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9619 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9620 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9621 bmap
= isl_basic_map_simplify(bmap
);
9622 return isl_basic_map_finalize(bmap
);
9624 isl_basic_map_free(bmap1
);
9625 isl_basic_map_free(bmap2
);
9629 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9630 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9632 isl_basic_map
*prod
;
9634 prod
= isl_basic_map_product(bmap1
, bmap2
);
9635 prod
= isl_basic_map_flatten(prod
);
9639 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9640 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9642 return isl_basic_map_flat_range_product(bset1
, bset2
);
9645 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9646 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9648 isl_space
*space_result
= NULL
;
9649 isl_basic_map
*bmap
;
9650 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9651 struct isl_dim_map
*dim_map1
, *dim_map2
;
9653 if (!bmap1
|| !bmap2
)
9656 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9657 isl_space_copy(bmap2
->dim
));
9659 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9660 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9661 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9662 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9664 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9665 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9666 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9667 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9668 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9669 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9670 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9671 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9672 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9673 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9674 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9676 bmap
= isl_basic_map_alloc_space(space_result
,
9677 bmap1
->n_div
+ bmap2
->n_div
,
9678 bmap1
->n_eq
+ bmap2
->n_eq
,
9679 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9680 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9681 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9682 bmap
= isl_basic_map_simplify(bmap
);
9683 return isl_basic_map_finalize(bmap
);
9685 isl_basic_map_free(bmap1
);
9686 isl_basic_map_free(bmap2
);
9690 __isl_give isl_basic_map
*isl_basic_map_range_product(
9691 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9694 isl_space
*dim_result
= NULL
;
9695 isl_basic_map
*bmap
;
9696 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9697 struct isl_dim_map
*dim_map1
, *dim_map2
;
9699 rational
= isl_basic_map_is_rational(bmap1
);
9700 if (rational
>= 0 && rational
)
9701 rational
= isl_basic_map_is_rational(bmap2
);
9702 if (!bmap1
|| !bmap2
|| rational
< 0)
9705 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9706 bmap2
->dim
, isl_dim_param
))
9707 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9708 "parameters don't match", goto error
);
9710 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9711 isl_space_copy(bmap2
->dim
));
9713 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9714 out1
= isl_basic_map_n_out(bmap1
);
9715 out2
= isl_basic_map_n_out(bmap2
);
9716 nparam
= isl_basic_map_n_param(bmap1
);
9718 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9719 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9720 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9721 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9722 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9723 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9724 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9725 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9726 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9727 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9728 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9730 bmap
= isl_basic_map_alloc_space(dim_result
,
9731 bmap1
->n_div
+ bmap2
->n_div
,
9732 bmap1
->n_eq
+ bmap2
->n_eq
,
9733 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9734 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9735 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9737 bmap
= isl_basic_map_set_rational(bmap
);
9738 bmap
= isl_basic_map_simplify(bmap
);
9739 return isl_basic_map_finalize(bmap
);
9741 isl_basic_map_free(bmap1
);
9742 isl_basic_map_free(bmap2
);
9746 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9747 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9749 isl_basic_map
*prod
;
9751 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9752 prod
= isl_basic_map_flatten_range(prod
);
9756 /* Apply "basic_map_product" to each pair of basic maps in "map1" and "map2"
9757 * and collect the results.
9758 * The result live in the space obtained by calling "space_product"
9759 * on the spaces of "map1" and "map2".
9760 * If "remove_duplicates" is set then the result may contain duplicates
9761 * (even if the inputs do not) and so we try and remove the obvious
9764 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9765 __isl_take isl_map
*map2
,
9766 __isl_give isl_space
*(*space_product
)(__isl_take isl_space
*left
,
9767 __isl_take isl_space
*right
),
9768 __isl_give isl_basic_map
*(*basic_map_product
)(
9769 __isl_take isl_basic_map
*left
,
9770 __isl_take isl_basic_map
*right
),
9771 int remove_duplicates
)
9774 struct isl_map
*result
;
9780 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9781 map2
->dim
, isl_dim_param
), goto error
);
9783 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9784 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9785 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9787 result
= isl_map_alloc_space(space_product(isl_space_copy(map1
->dim
),
9788 isl_space_copy(map2
->dim
)),
9789 map1
->n
* map2
->n
, flags
);
9792 for (i
= 0; i
< map1
->n
; ++i
)
9793 for (j
= 0; j
< map2
->n
; ++j
) {
9794 struct isl_basic_map
*part
;
9795 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9796 isl_basic_map_copy(map2
->p
[j
]));
9797 if (isl_basic_map_is_empty(part
))
9798 isl_basic_map_free(part
);
9800 result
= isl_map_add_basic_map(result
, part
);
9804 if (remove_duplicates
)
9805 result
= isl_map_remove_obvious_duplicates(result
);
9815 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9817 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9818 __isl_take isl_map
*map2
)
9820 return map_product(map1
, map2
, &isl_space_product
,
9821 &isl_basic_map_product
, 0);
9824 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9825 __isl_take isl_map
*map2
)
9827 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9830 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9832 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9833 __isl_take isl_map
*map2
)
9837 prod
= isl_map_product(map1
, map2
);
9838 prod
= isl_map_flatten(prod
);
9842 /* Given two set A and B, construct its Cartesian product A x B.
9844 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9846 return isl_map_range_product(set1
, set2
);
9849 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9850 __isl_take isl_set
*set2
)
9852 return isl_map_flat_range_product(set1
, set2
);
9855 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9857 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9858 __isl_take isl_map
*map2
)
9860 return map_product(map1
, map2
, &isl_space_domain_product
,
9861 &isl_basic_map_domain_product
, 1);
9864 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9866 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9867 __isl_take isl_map
*map2
)
9869 return map_product(map1
, map2
, &isl_space_range_product
,
9870 &isl_basic_map_range_product
, 1);
9873 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9874 __isl_take isl_map
*map2
)
9876 return isl_map_align_params_map_map_and(map1
, map2
,
9877 &map_domain_product_aligned
);
9880 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9881 __isl_take isl_map
*map2
)
9883 return isl_map_align_params_map_map_and(map1
, map2
,
9884 &map_range_product_aligned
);
9887 /* Given a map of the form [A -> B] -> [C -> D], return the map A -> C.
9889 __isl_give isl_map
*isl_map_factor_domain(__isl_take isl_map
*map
)
9892 int total1
, keep1
, total2
, keep2
;
9896 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9897 !isl_space_range_is_wrapping(map
->dim
))
9898 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9899 "not a product", return isl_map_free(map
));
9901 space
= isl_map_get_space(map
);
9902 total1
= isl_space_dim(space
, isl_dim_in
);
9903 total2
= isl_space_dim(space
, isl_dim_out
);
9904 space
= isl_space_factor_domain(space
);
9905 keep1
= isl_space_dim(space
, isl_dim_in
);
9906 keep2
= isl_space_dim(space
, isl_dim_out
);
9907 map
= isl_map_project_out(map
, isl_dim_in
, keep1
, total1
- keep1
);
9908 map
= isl_map_project_out(map
, isl_dim_out
, keep2
, total2
- keep2
);
9909 map
= isl_map_reset_space(map
, space
);
9914 /* Given a map of the form [A -> B] -> [C -> D], return the map B -> D.
9916 __isl_give isl_map
*isl_map_factor_range(__isl_take isl_map
*map
)
9919 int total1
, keep1
, total2
, keep2
;
9923 if (!isl_space_domain_is_wrapping(map
->dim
) ||
9924 !isl_space_range_is_wrapping(map
->dim
))
9925 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9926 "not a product", return isl_map_free(map
));
9928 space
= isl_map_get_space(map
);
9929 total1
= isl_space_dim(space
, isl_dim_in
);
9930 total2
= isl_space_dim(space
, isl_dim_out
);
9931 space
= isl_space_factor_range(space
);
9932 keep1
= isl_space_dim(space
, isl_dim_in
);
9933 keep2
= isl_space_dim(space
, isl_dim_out
);
9934 map
= isl_map_project_out(map
, isl_dim_in
, 0, total1
- keep1
);
9935 map
= isl_map_project_out(map
, isl_dim_out
, 0, total2
- keep2
);
9936 map
= isl_map_reset_space(map
, space
);
9941 /* Given a map of the form [A -> B] -> C, return the map A -> C.
9943 __isl_give isl_map
*isl_map_domain_factor_domain(__isl_take isl_map
*map
)
9950 if (!isl_space_domain_is_wrapping(map
->dim
))
9951 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9952 "domain is not a product", return isl_map_free(map
));
9954 space
= isl_map_get_space(map
);
9955 total
= isl_space_dim(space
, isl_dim_in
);
9956 space
= isl_space_domain_factor_domain(space
);
9957 keep
= isl_space_dim(space
, isl_dim_in
);
9958 map
= isl_map_project_out(map
, isl_dim_in
, keep
, total
- keep
);
9959 map
= isl_map_reset_space(map
, space
);
9964 /* Given a map of the form [A -> B] -> C, return the map B -> C.
9966 __isl_give isl_map
*isl_map_domain_factor_range(__isl_take isl_map
*map
)
9973 if (!isl_space_domain_is_wrapping(map
->dim
))
9974 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9975 "domain is not a product", return isl_map_free(map
));
9977 space
= isl_map_get_space(map
);
9978 total
= isl_space_dim(space
, isl_dim_in
);
9979 space
= isl_space_domain_factor_range(space
);
9980 keep
= isl_space_dim(space
, isl_dim_in
);
9981 map
= isl_map_project_out(map
, isl_dim_in
, 0, total
- keep
);
9982 map
= isl_map_reset_space(map
, space
);
9987 /* Given a map A -> [B -> C], extract the map A -> B.
9989 __isl_give isl_map
*isl_map_range_factor_domain(__isl_take isl_map
*map
)
9996 if (!isl_space_range_is_wrapping(map
->dim
))
9997 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
9998 "range is not a product", return isl_map_free(map
));
10000 space
= isl_map_get_space(map
);
10001 total
= isl_space_dim(space
, isl_dim_out
);
10002 space
= isl_space_range_factor_domain(space
);
10003 keep
= isl_space_dim(space
, isl_dim_out
);
10004 map
= isl_map_project_out(map
, isl_dim_out
, keep
, total
- keep
);
10005 map
= isl_map_reset_space(map
, space
);
10010 /* Given a map A -> [B -> C], extract the map A -> C.
10012 __isl_give isl_map
*isl_map_range_factor_range(__isl_take isl_map
*map
)
10019 if (!isl_space_range_is_wrapping(map
->dim
))
10020 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
10021 "range is not a product", return isl_map_free(map
));
10023 space
= isl_map_get_space(map
);
10024 total
= isl_space_dim(space
, isl_dim_out
);
10025 space
= isl_space_range_factor_range(space
);
10026 keep
= isl_space_dim(space
, isl_dim_out
);
10027 map
= isl_map_project_out(map
, isl_dim_out
, 0, total
- keep
);
10028 map
= isl_map_reset_space(map
, space
);
10033 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
10035 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
10036 __isl_take isl_map
*map2
)
10040 prod
= isl_map_domain_product(map1
, map2
);
10041 prod
= isl_map_flatten_domain(prod
);
10045 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
10047 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
10048 __isl_take isl_map
*map2
)
10052 prod
= isl_map_range_product(map1
, map2
);
10053 prod
= isl_map_flatten_range(prod
);
10057 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
10060 uint32_t hash
= isl_hash_init();
10065 bmap
= isl_basic_map_copy(bmap
);
10066 bmap
= isl_basic_map_normalize(bmap
);
10069 total
= isl_basic_map_total_dim(bmap
);
10070 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
10071 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
10073 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
10074 isl_hash_hash(hash
, c_hash
);
10076 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
10077 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10079 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
10080 isl_hash_hash(hash
, c_hash
);
10082 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
10083 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10085 if (isl_int_is_zero(bmap
->div
[i
][0]))
10087 isl_hash_byte(hash
, i
& 0xFF);
10088 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
10089 isl_hash_hash(hash
, c_hash
);
10091 isl_basic_map_free(bmap
);
10095 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
10097 return isl_basic_map_get_hash(bset_to_bmap(bset
));
10100 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
10107 map
= isl_map_copy(map
);
10108 map
= isl_map_normalize(map
);
10112 hash
= isl_hash_init();
10113 for (i
= 0; i
< map
->n
; ++i
) {
10114 uint32_t bmap_hash
;
10115 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
10116 isl_hash_hash(hash
, bmap_hash
);
10124 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
10126 return isl_map_get_hash(set_to_map(set
));
10129 /* Check if the value for dimension dim is completely determined
10130 * by the values of the other parameters and variables.
10131 * That is, check if dimension dim is involved in an equality.
10133 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
10140 nparam
= isl_basic_set_n_param(bset
);
10141 for (i
= 0; i
< bset
->n_eq
; ++i
)
10142 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
10147 /* Check if the value for dimension dim is completely determined
10148 * by the values of the other parameters and variables.
10149 * That is, check if dimension dim is involved in an equality
10150 * for each of the subsets.
10152 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
10158 for (i
= 0; i
< set
->n
; ++i
) {
10160 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
10167 /* Return the number of basic maps in the (current) representation of "map".
10169 int isl_map_n_basic_map(__isl_keep isl_map
*map
)
10171 return map
? map
->n
: 0;
10174 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
10176 return set
? set
->n
: 0;
10179 isl_stat
isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
10180 isl_stat (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
10185 return isl_stat_error
;
10187 for (i
= 0; i
< map
->n
; ++i
)
10188 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
10189 return isl_stat_error
;
10191 return isl_stat_ok
;
10194 isl_stat
isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
10195 isl_stat (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
10200 return isl_stat_error
;
10202 for (i
= 0; i
< set
->n
; ++i
)
10203 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
10204 return isl_stat_error
;
10206 return isl_stat_ok
;
10209 /* Return a list of basic sets, the union of which is equal to "set".
10211 __isl_give isl_basic_set_list
*isl_set_get_basic_set_list(
10212 __isl_keep isl_set
*set
)
10215 isl_basic_set_list
*list
;
10220 list
= isl_basic_set_list_alloc(isl_set_get_ctx(set
), set
->n
);
10221 for (i
= 0; i
< set
->n
; ++i
) {
10222 isl_basic_set
*bset
;
10224 bset
= isl_basic_set_copy(set
->p
[i
]);
10225 list
= isl_basic_set_list_add(list
, bset
);
10231 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
10238 bset
= isl_basic_set_cow(bset
);
10242 dim
= isl_basic_set_get_space(bset
);
10243 dim
= isl_space_lift(dim
, bset
->n_div
);
10246 isl_space_free(bset
->dim
);
10248 bset
->extra
-= bset
->n_div
;
10251 bset
= isl_basic_set_finalize(bset
);
10255 isl_basic_set_free(bset
);
10259 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
10265 set
= isl_set_align_divs(set
);
10270 set
= isl_set_cow(set
);
10274 n_div
= set
->p
[0]->n_div
;
10275 dim
= isl_set_get_space(set
);
10276 dim
= isl_space_lift(dim
, n_div
);
10279 isl_space_free(set
->dim
);
10282 for (i
= 0; i
< set
->n
; ++i
) {
10283 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
10294 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
10297 struct isl_basic_map
*bmap
;
10304 set
= isl_set_align_divs(set
);
10309 dim
= isl_set_get_space(set
);
10310 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
10312 return isl_map_identity(isl_space_map_from_set(dim
));
10315 n_div
= set
->p
[0]->n_div
;
10316 dim
= isl_space_map_from_set(dim
);
10317 n_param
= isl_space_dim(dim
, isl_dim_param
);
10318 n_set
= isl_space_dim(dim
, isl_dim_in
);
10319 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
10320 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
10321 for (i
= 0; i
< n_set
; ++i
)
10322 bmap
= var_equal(bmap
, i
);
10324 total
= n_param
+ n_set
+ n_set
+ n_div
;
10325 for (i
= 0; i
< n_div
; ++i
) {
10326 k
= isl_basic_map_alloc_inequality(bmap
);
10329 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
10330 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
10331 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
10332 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
10333 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
10334 set
->p
[0]->div
[i
][0]);
10336 l
= isl_basic_map_alloc_inequality(bmap
);
10339 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
10340 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
10341 set
->p
[0]->div
[i
][0]);
10342 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
10346 bmap
= isl_basic_map_simplify(bmap
);
10347 bmap
= isl_basic_map_finalize(bmap
);
10348 return isl_map_from_basic_map(bmap
);
10351 isl_basic_map_free(bmap
);
10355 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
10363 dim
= isl_basic_set_total_dim(bset
);
10364 size
+= bset
->n_eq
* (1 + dim
);
10365 size
+= bset
->n_ineq
* (1 + dim
);
10366 size
+= bset
->n_div
* (2 + dim
);
10371 int isl_set_size(__isl_keep isl_set
*set
)
10379 for (i
= 0; i
< set
->n
; ++i
)
10380 size
+= isl_basic_set_size(set
->p
[i
]);
10385 /* Check if there is any lower bound (if lower == 0) and/or upper
10386 * bound (if upper == 0) on the specified dim.
10388 static isl_bool
basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10389 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
10394 return isl_bool_error
;
10396 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
),
10397 return isl_bool_error
);
10399 pos
+= isl_basic_map_offset(bmap
, type
);
10401 for (i
= 0; i
< bmap
->n_div
; ++i
) {
10402 if (isl_int_is_zero(bmap
->div
[i
][0]))
10404 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
10405 return isl_bool_true
;
10408 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10409 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
10410 return isl_bool_true
;
10412 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10413 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
10420 return lower
&& upper
;
10423 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
10424 enum isl_dim_type type
, unsigned pos
)
10426 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
10429 isl_bool
isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
10430 enum isl_dim_type type
, unsigned pos
)
10432 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
10435 isl_bool
isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
10436 enum isl_dim_type type
, unsigned pos
)
10438 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
10441 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
10442 enum isl_dim_type type
, unsigned pos
)
10449 for (i
= 0; i
< map
->n
; ++i
) {
10451 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
10452 if (bounded
< 0 || !bounded
)
10459 /* Return 1 if the specified dim is involved in both an upper bound
10460 * and a lower bound.
10462 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
10463 enum isl_dim_type type
, unsigned pos
)
10465 return isl_map_dim_is_bounded(set_to_map(set
), type
, pos
);
10468 /* Does "map" have a bound (according to "fn") for any of its basic maps?
10470 static isl_bool
has_any_bound(__isl_keep isl_map
*map
,
10471 enum isl_dim_type type
, unsigned pos
,
10472 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10473 enum isl_dim_type type
, unsigned pos
))
10478 return isl_bool_error
;
10480 for (i
= 0; i
< map
->n
; ++i
) {
10482 bounded
= fn(map
->p
[i
], type
, pos
);
10483 if (bounded
< 0 || bounded
)
10487 return isl_bool_false
;
10490 /* Return 1 if the specified dim is involved in any lower bound.
10492 isl_bool
isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
10493 enum isl_dim_type type
, unsigned pos
)
10495 return has_any_bound(set
, type
, pos
,
10496 &isl_basic_map_dim_has_lower_bound
);
10499 /* Return 1 if the specified dim is involved in any upper bound.
10501 isl_bool
isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
10502 enum isl_dim_type type
, unsigned pos
)
10504 return has_any_bound(set
, type
, pos
,
10505 &isl_basic_map_dim_has_upper_bound
);
10508 /* Does "map" have a bound (according to "fn") for all of its basic maps?
10510 static isl_bool
has_bound(__isl_keep isl_map
*map
,
10511 enum isl_dim_type type
, unsigned pos
,
10512 isl_bool (*fn
)(__isl_keep isl_basic_map
*bmap
,
10513 enum isl_dim_type type
, unsigned pos
))
10518 return isl_bool_error
;
10520 for (i
= 0; i
< map
->n
; ++i
) {
10522 bounded
= fn(map
->p
[i
], type
, pos
);
10523 if (bounded
< 0 || !bounded
)
10527 return isl_bool_true
;
10530 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
10532 isl_bool
isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
10533 enum isl_dim_type type
, unsigned pos
)
10535 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
10538 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
10540 isl_bool
isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
10541 enum isl_dim_type type
, unsigned pos
)
10543 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
10546 /* For each of the "n" variables starting at "first", determine
10547 * the sign of the variable and put the results in the first "n"
10548 * elements of the array "signs".
10550 * 1 means that the variable is non-negative
10551 * -1 means that the variable is non-positive
10552 * 0 means the variable attains both positive and negative values.
10554 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
10555 unsigned first
, unsigned n
, int *signs
)
10557 isl_vec
*bound
= NULL
;
10558 struct isl_tab
*tab
= NULL
;
10559 struct isl_tab_undo
*snap
;
10562 if (!bset
|| !signs
)
10565 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
10566 tab
= isl_tab_from_basic_set(bset
, 0);
10567 if (!bound
|| !tab
)
10570 isl_seq_clr(bound
->el
, bound
->size
);
10571 isl_int_set_si(bound
->el
[0], -1);
10573 snap
= isl_tab_snap(tab
);
10574 for (i
= 0; i
< n
; ++i
) {
10577 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
10578 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10580 empty
= tab
->empty
;
10581 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10582 if (isl_tab_rollback(tab
, snap
) < 0)
10590 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
10591 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
10593 empty
= tab
->empty
;
10594 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
10595 if (isl_tab_rollback(tab
, snap
) < 0)
10598 signs
[i
] = empty
? -1 : 0;
10602 isl_vec_free(bound
);
10606 isl_vec_free(bound
);
10610 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
10611 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
10613 if (!bset
|| !signs
)
10615 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
10618 first
+= pos(bset
->dim
, type
) - 1;
10619 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
10622 /* Is it possible for the integer division "div" to depend (possibly
10623 * indirectly) on any output dimensions?
10625 * If the div is undefined, then we conservatively assume that it
10626 * may depend on them.
10627 * Otherwise, we check if it actually depends on them or on any integer
10628 * divisions that may depend on them.
10630 static int div_may_involve_output(__isl_keep isl_basic_map
*bmap
, int div
)
10633 unsigned n_out
, o_out
;
10634 unsigned n_div
, o_div
;
10636 if (isl_int_is_zero(bmap
->div
[div
][0]))
10639 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10640 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10642 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + o_out
, n_out
) != -1)
10645 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10646 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10648 for (i
= 0; i
< n_div
; ++i
) {
10649 if (isl_int_is_zero(bmap
->div
[div
][1 + o_div
+ i
]))
10651 if (div_may_involve_output(bmap
, i
))
10658 /* Return the first integer division of "bmap" in the range
10659 * [first, first + n[ that may depend on any output dimensions and
10660 * that has a non-zero coefficient in "c" (where the first coefficient
10661 * in "c" corresponds to integer division "first").
10663 static int first_div_may_involve_output(__isl_keep isl_basic_map
*bmap
,
10664 isl_int
*c
, int first
, int n
)
10671 for (k
= first
; k
< first
+ n
; ++k
) {
10672 if (isl_int_is_zero(c
[k
]))
10674 if (div_may_involve_output(bmap
, k
))
10681 /* Look for a pair of inequality constraints in "bmap" of the form
10683 * -l + i >= 0 or i >= l
10685 * n + l - i >= 0 or i <= l + n
10687 * with n < "m" and i the output dimension at position "pos".
10688 * (Note that n >= 0 as otherwise the two constraints would conflict.)
10689 * Furthermore, "l" is only allowed to involve parameters, input dimensions
10690 * and earlier output dimensions, as well as integer divisions that do
10691 * not involve any of the output dimensions.
10693 * Return the index of the first inequality constraint or bmap->n_ineq
10694 * if no such pair can be found.
10696 static int find_modulo_constraint_pair(__isl_keep isl_basic_map
*bmap
,
10697 int pos
, isl_int m
)
10702 unsigned n_div
, o_div
;
10703 unsigned n_out
, o_out
;
10709 ctx
= isl_basic_map_get_ctx(bmap
);
10710 total
= isl_basic_map_total_dim(bmap
);
10711 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10712 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10713 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10714 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10715 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
10716 if (!isl_int_abs_eq(bmap
->ineq
[i
][o_out
+ pos
], ctx
->one
))
10718 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + o_out
+ pos
+ 1,
10719 n_out
- (pos
+ 1)) != -1)
10721 if (first_div_may_involve_output(bmap
, bmap
->ineq
[i
] + o_div
,
10724 for (j
= i
+ 1; j
< bmap
->n_ineq
; ++j
) {
10725 if (!isl_int_abs_eq(bmap
->ineq
[j
][o_out
+ pos
],
10728 if (!isl_seq_is_neg(bmap
->ineq
[i
] + 1,
10729 bmap
->ineq
[j
] + 1, total
))
10733 if (j
>= bmap
->n_ineq
)
10735 isl_int_add(bmap
->ineq
[i
][0],
10736 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10737 less
= isl_int_abs_lt(bmap
->ineq
[i
][0], m
);
10738 isl_int_sub(bmap
->ineq
[i
][0],
10739 bmap
->ineq
[i
][0], bmap
->ineq
[j
][0]);
10742 if (isl_int_is_one(bmap
->ineq
[i
][o_out
+ pos
]))
10748 return bmap
->n_ineq
;
10751 /* Return the index of the equality of "bmap" that defines
10752 * the output dimension "pos" in terms of earlier dimensions.
10753 * The equality may also involve integer divisions, as long
10754 * as those integer divisions are defined in terms of
10755 * parameters or input dimensions.
10756 * In this case, *div is set to the number of integer divisions and
10757 * *ineq is set to the number of inequality constraints (provided
10758 * div and ineq are not NULL).
10760 * The equality may also involve a single integer division involving
10761 * the output dimensions (typically only output dimension "pos") as
10762 * long as the coefficient of output dimension "pos" is 1 or -1 and
10763 * there is a pair of constraints i >= l and i <= l + n, with i referring
10764 * to output dimension "pos", l an expression involving only earlier
10765 * dimensions and n smaller than the coefficient of the integer division
10766 * in the equality. In this case, the output dimension can be defined
10767 * in terms of a modulo expression that does not involve the integer division.
10768 * *div is then set to this single integer division and
10769 * *ineq is set to the index of constraint i >= l.
10771 * Return bmap->n_eq if there is no such equality.
10772 * Return -1 on error.
10774 int isl_basic_map_output_defining_equality(__isl_keep isl_basic_map
*bmap
,
10775 int pos
, int *div
, int *ineq
)
10778 unsigned n_out
, o_out
;
10779 unsigned n_div
, o_div
;
10784 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10785 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
10786 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
10787 o_div
= isl_basic_map_offset(bmap
, isl_dim_div
);
10790 *ineq
= bmap
->n_ineq
;
10793 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
10794 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ pos
]))
10796 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ pos
+ 1,
10797 n_out
- (pos
+ 1)) != -1)
10799 k
= first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10803 if (!isl_int_is_one(bmap
->eq
[j
][o_out
+ pos
]) &&
10804 !isl_int_is_negone(bmap
->eq
[j
][o_out
+ pos
]))
10806 if (first_div_may_involve_output(bmap
, bmap
->eq
[j
] + o_div
,
10807 k
+ 1, n_div
- (k
+1)) < n_div
)
10809 l
= find_modulo_constraint_pair(bmap
, pos
,
10810 bmap
->eq
[j
][o_div
+ k
]);
10813 if (l
>= bmap
->n_ineq
)
10825 /* Check if the given basic map is obviously single-valued.
10826 * In particular, for each output dimension, check that there is
10827 * an equality that defines the output dimension in terms of
10828 * earlier dimensions.
10830 isl_bool
isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10836 return isl_bool_error
;
10838 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
10840 for (i
= 0; i
< n_out
; ++i
) {
10843 eq
= isl_basic_map_output_defining_equality(bmap
, i
,
10846 return isl_bool_error
;
10847 if (eq
>= bmap
->n_eq
)
10848 return isl_bool_false
;
10851 return isl_bool_true
;
10854 /* Check if the given basic map is single-valued.
10855 * We simply compute
10859 * and check if the result is a subset of the identity mapping.
10861 isl_bool
isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
10864 isl_basic_map
*test
;
10868 sv
= isl_basic_map_plain_is_single_valued(bmap
);
10872 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
10873 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
10875 space
= isl_basic_map_get_space(bmap
);
10876 space
= isl_space_map_from_set(isl_space_range(space
));
10877 id
= isl_basic_map_identity(space
);
10879 sv
= isl_basic_map_is_subset(test
, id
);
10881 isl_basic_map_free(test
);
10882 isl_basic_map_free(id
);
10887 /* Check if the given map is obviously single-valued.
10889 isl_bool
isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10892 return isl_bool_error
;
10894 return isl_bool_true
;
10896 return isl_bool_false
;
10898 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10901 /* Check if the given map is single-valued.
10902 * We simply compute
10906 * and check if the result is a subset of the identity mapping.
10908 isl_bool
isl_map_is_single_valued(__isl_keep isl_map
*map
)
10915 sv
= isl_map_plain_is_single_valued(map
);
10919 test
= isl_map_reverse(isl_map_copy(map
));
10920 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10922 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10923 id
= isl_map_identity(dim
);
10925 sv
= isl_map_is_subset(test
, id
);
10927 isl_map_free(test
);
10933 isl_bool
isl_map_is_injective(__isl_keep isl_map
*map
)
10937 map
= isl_map_copy(map
);
10938 map
= isl_map_reverse(map
);
10939 in
= isl_map_is_single_valued(map
);
10945 /* Check if the given map is obviously injective.
10947 isl_bool
isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10951 map
= isl_map_copy(map
);
10952 map
= isl_map_reverse(map
);
10953 in
= isl_map_plain_is_single_valued(map
);
10959 isl_bool
isl_map_is_bijective(__isl_keep isl_map
*map
)
10963 sv
= isl_map_is_single_valued(map
);
10967 return isl_map_is_injective(map
);
10970 isl_bool
isl_set_is_singleton(__isl_keep isl_set
*set
)
10972 return isl_map_is_single_valued(set_to_map(set
));
10975 /* Does "map" only map elements to themselves?
10977 * If the domain and range spaces are different, then "map"
10978 * is considered not to be an identity relation, even if it is empty.
10979 * Otherwise, construct the maximal identity relation and
10980 * check whether "map" is a subset of this relation.
10982 isl_bool
isl_map_is_identity(__isl_keep isl_map
*map
)
10986 isl_bool equal
, is_identity
;
10988 space
= isl_map_get_space(map
);
10989 equal
= isl_space_tuple_is_equal(space
, isl_dim_in
, space
, isl_dim_out
);
10990 isl_space_free(space
);
10991 if (equal
< 0 || !equal
)
10994 id
= isl_map_identity(isl_map_get_space(map
));
10995 is_identity
= isl_map_is_subset(map
, id
);
10998 return is_identity
;
11001 int isl_map_is_translation(__isl_keep isl_map
*map
)
11006 delta
= isl_map_deltas(isl_map_copy(map
));
11007 ok
= isl_set_is_singleton(delta
);
11008 isl_set_free(delta
);
11013 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
11015 if (isl_seq_first_non_zero(p
, pos
) != -1)
11017 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
11022 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
11031 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
11034 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
11035 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
11036 for (j
= 0; j
< nvar
; ++j
) {
11037 int lower
= 0, upper
= 0;
11038 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11039 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
11041 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
11045 if (i
< bset
->n_eq
)
11047 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11048 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
11050 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
11052 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
11057 if (!lower
|| !upper
)
11064 int isl_set_is_box(__isl_keep isl_set
*set
)
11071 return isl_basic_set_is_box(set
->p
[0]);
11074 isl_bool
isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
11077 return isl_bool_error
;
11079 return isl_space_is_wrapping(bset
->dim
);
11082 isl_bool
isl_set_is_wrapping(__isl_keep isl_set
*set
)
11085 return isl_bool_error
;
11087 return isl_space_is_wrapping(set
->dim
);
11090 /* Modify the space of "map" through a call to "change".
11091 * If "can_change" is set (not NULL), then first call it to check
11092 * if the modification is allowed, printing the error message "cannot_change"
11095 static __isl_give isl_map
*isl_map_change_space(__isl_take isl_map
*map
,
11096 isl_bool (*can_change
)(__isl_keep isl_map
*map
),
11097 const char *cannot_change
,
11098 __isl_give isl_space
*(*change
)(__isl_take isl_space
*space
))
11106 ok
= can_change
? can_change(map
) : isl_bool_true
;
11108 return isl_map_free(map
);
11110 isl_die(isl_map_get_ctx(map
), isl_error_invalid
, cannot_change
,
11111 return isl_map_free(map
));
11113 space
= change(isl_map_get_space(map
));
11114 map
= isl_map_reset_space(map
, space
);
11119 /* Is the domain of "map" a wrapped relation?
11121 isl_bool
isl_map_domain_is_wrapping(__isl_keep isl_map
*map
)
11124 return isl_bool_error
;
11126 return isl_space_domain_is_wrapping(map
->dim
);
11129 /* Is the range of "map" a wrapped relation?
11131 isl_bool
isl_map_range_is_wrapping(__isl_keep isl_map
*map
)
11134 return isl_bool_error
;
11136 return isl_space_range_is_wrapping(map
->dim
);
11139 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
11141 bmap
= isl_basic_map_cow(bmap
);
11145 bmap
->dim
= isl_space_wrap(bmap
->dim
);
11149 bmap
= isl_basic_map_finalize(bmap
);
11151 return bset_from_bmap(bmap
);
11153 isl_basic_map_free(bmap
);
11157 /* Given a map A -> B, return the set (A -> B).
11159 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
11161 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_wrap
);
11164 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
11166 bset
= isl_basic_set_cow(bset
);
11170 bset
->dim
= isl_space_unwrap(bset
->dim
);
11174 bset
= isl_basic_set_finalize(bset
);
11176 return bset_to_bmap(bset
);
11178 isl_basic_set_free(bset
);
11182 /* Given a set (A -> B), return the map A -> B.
11183 * Error out if "set" is not of the form (A -> B).
11185 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
11187 return isl_map_change_space(set
, &isl_set_is_wrapping
,
11188 "not a wrapping set", &isl_space_unwrap
);
11191 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
11192 enum isl_dim_type type
)
11197 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
11200 bmap
= isl_basic_map_cow(bmap
);
11204 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
11208 bmap
= isl_basic_map_finalize(bmap
);
11212 isl_basic_map_free(bmap
);
11216 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
11217 enum isl_dim_type type
)
11224 if (!isl_space_is_named_or_nested(map
->dim
, type
))
11227 map
= isl_map_cow(map
);
11231 for (i
= 0; i
< map
->n
; ++i
) {
11232 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
11236 map
->dim
= isl_space_reset(map
->dim
, type
);
11246 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
11251 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
11254 bmap
= isl_basic_map_cow(bmap
);
11258 bmap
->dim
= isl_space_flatten(bmap
->dim
);
11262 bmap
= isl_basic_map_finalize(bmap
);
11266 isl_basic_map_free(bmap
);
11270 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
11272 return bset_from_bmap(isl_basic_map_flatten(bset_to_bmap(bset
)));
11275 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
11276 __isl_take isl_basic_map
*bmap
)
11281 if (!bmap
->dim
->nested
[0])
11284 bmap
= isl_basic_map_cow(bmap
);
11288 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
11292 bmap
= isl_basic_map_finalize(bmap
);
11296 isl_basic_map_free(bmap
);
11300 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
11301 __isl_take isl_basic_map
*bmap
)
11306 if (!bmap
->dim
->nested
[1])
11309 bmap
= isl_basic_map_cow(bmap
);
11313 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
11317 bmap
= isl_basic_map_finalize(bmap
);
11321 isl_basic_map_free(bmap
);
11325 /* Remove any internal structure from the spaces of domain and range of "map".
11327 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
11332 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
11335 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten
);
11338 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
11340 return set_from_map(isl_map_flatten(set_to_map(set
)));
11343 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
11345 isl_space
*dim
, *flat_dim
;
11348 dim
= isl_set_get_space(set
);
11349 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
11350 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
11351 map
= isl_map_intersect_domain(map
, set
);
11356 /* Remove any internal structure from the space of the domain of "map".
11358 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
11363 if (!map
->dim
->nested
[0])
11366 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_domain
);
11369 /* Remove any internal structure from the space of the range of "map".
11371 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
11376 if (!map
->dim
->nested
[1])
11379 return isl_map_change_space(map
, NULL
, NULL
, &isl_space_flatten_range
);
11382 /* Reorder the dimensions of "bmap" according to the given dim_map
11383 * and set the dimension specification to "dim" and
11384 * perform Gaussian elimination on the result.
11386 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
11387 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
11389 isl_basic_map
*res
;
11392 bmap
= isl_basic_map_cow(bmap
);
11393 if (!bmap
|| !dim
|| !dim_map
)
11396 flags
= bmap
->flags
;
11397 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
11398 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
11399 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
11400 res
= isl_basic_map_alloc_space(dim
,
11401 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
11402 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
11404 res
->flags
= flags
;
11405 res
= isl_basic_map_gauss(res
, NULL
);
11406 res
= isl_basic_map_finalize(res
);
11410 isl_basic_map_free(bmap
);
11411 isl_space_free(dim
);
11415 /* Reorder the dimensions of "map" according to given reordering.
11417 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
11418 __isl_take isl_reordering
*r
)
11421 struct isl_dim_map
*dim_map
;
11423 map
= isl_map_cow(map
);
11424 dim_map
= isl_dim_map_from_reordering(r
);
11425 if (!map
|| !r
|| !dim_map
)
11428 for (i
= 0; i
< map
->n
; ++i
) {
11429 struct isl_dim_map
*dim_map_i
;
11431 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
11433 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
11434 isl_space_copy(r
->dim
), dim_map_i
);
11440 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
11442 isl_reordering_free(r
);
11448 isl_reordering_free(r
);
11452 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
11453 __isl_take isl_reordering
*r
)
11455 return set_from_map(isl_map_realign(set_to_map(set
), r
));
11458 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
11459 __isl_take isl_space
*model
)
11463 if (!map
|| !model
)
11466 ctx
= isl_space_get_ctx(model
);
11467 if (!isl_space_has_named_params(model
))
11468 isl_die(ctx
, isl_error_invalid
,
11469 "model has unnamed parameters", goto error
);
11470 if (!isl_space_has_named_params(map
->dim
))
11471 isl_die(ctx
, isl_error_invalid
,
11472 "relation has unnamed parameters", goto error
);
11473 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11474 isl_reordering
*exp
;
11476 model
= isl_space_drop_dims(model
, isl_dim_in
,
11477 0, isl_space_dim(model
, isl_dim_in
));
11478 model
= isl_space_drop_dims(model
, isl_dim_out
,
11479 0, isl_space_dim(model
, isl_dim_out
));
11480 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
11481 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
11482 map
= isl_map_realign(map
, exp
);
11485 isl_space_free(model
);
11488 isl_space_free(model
);
11493 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
11494 __isl_take isl_space
*model
)
11496 return isl_map_align_params(set
, model
);
11499 /* Align the parameters of "bmap" to those of "model", introducing
11500 * additional parameters if needed.
11502 __isl_give isl_basic_map
*isl_basic_map_align_params(
11503 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
11507 if (!bmap
|| !model
)
11510 ctx
= isl_space_get_ctx(model
);
11511 if (!isl_space_has_named_params(model
))
11512 isl_die(ctx
, isl_error_invalid
,
11513 "model has unnamed parameters", goto error
);
11514 if (!isl_space_has_named_params(bmap
->dim
))
11515 isl_die(ctx
, isl_error_invalid
,
11516 "relation has unnamed parameters", goto error
);
11517 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
11518 isl_reordering
*exp
;
11519 struct isl_dim_map
*dim_map
;
11521 model
= isl_space_drop_dims(model
, isl_dim_in
,
11522 0, isl_space_dim(model
, isl_dim_in
));
11523 model
= isl_space_drop_dims(model
, isl_dim_out
,
11524 0, isl_space_dim(model
, isl_dim_out
));
11525 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
11526 exp
= isl_reordering_extend_space(exp
,
11527 isl_basic_map_get_space(bmap
));
11528 dim_map
= isl_dim_map_from_reordering(exp
);
11529 bmap
= isl_basic_map_realign(bmap
,
11530 exp
? isl_space_copy(exp
->dim
) : NULL
,
11531 isl_dim_map_extend(dim_map
, bmap
));
11532 isl_reordering_free(exp
);
11536 isl_space_free(model
);
11539 isl_space_free(model
);
11540 isl_basic_map_free(bmap
);
11544 /* Align the parameters of "bset" to those of "model", introducing
11545 * additional parameters if needed.
11547 __isl_give isl_basic_set
*isl_basic_set_align_params(
11548 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
11550 return isl_basic_map_align_params(bset
, model
);
11553 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
11554 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11555 enum isl_dim_type c2
, enum isl_dim_type c3
,
11556 enum isl_dim_type c4
, enum isl_dim_type c5
)
11558 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11559 struct isl_mat
*mat
;
11565 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
11566 isl_basic_map_total_dim(bmap
) + 1);
11569 for (i
= 0; i
< bmap
->n_eq
; ++i
)
11570 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11571 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11572 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11573 isl_int_set(mat
->row
[i
][pos
],
11574 bmap
->eq
[i
][off
+ k
]);
11582 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
11583 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
11584 enum isl_dim_type c2
, enum isl_dim_type c3
,
11585 enum isl_dim_type c4
, enum isl_dim_type c5
)
11587 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11588 struct isl_mat
*mat
;
11594 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
11595 isl_basic_map_total_dim(bmap
) + 1);
11598 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
11599 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11600 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11601 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11602 isl_int_set(mat
->row
[i
][pos
],
11603 bmap
->ineq
[i
][off
+ k
]);
11611 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
11612 __isl_take isl_space
*dim
,
11613 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11614 enum isl_dim_type c2
, enum isl_dim_type c3
,
11615 enum isl_dim_type c4
, enum isl_dim_type c5
)
11617 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
11618 isl_basic_map
*bmap
;
11624 if (!dim
|| !eq
|| !ineq
)
11627 if (eq
->n_col
!= ineq
->n_col
)
11628 isl_die(dim
->ctx
, isl_error_invalid
,
11629 "equalities and inequalities matrices should have "
11630 "same number of columns", goto error
);
11632 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
11634 if (eq
->n_col
< total
)
11635 isl_die(dim
->ctx
, isl_error_invalid
,
11636 "number of columns too small", goto error
);
11638 extra
= eq
->n_col
- total
;
11640 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
11641 eq
->n_row
, ineq
->n_row
);
11644 for (i
= 0; i
< extra
; ++i
) {
11645 k
= isl_basic_map_alloc_div(bmap
);
11648 isl_int_set_si(bmap
->div
[k
][0], 0);
11650 for (i
= 0; i
< eq
->n_row
; ++i
) {
11651 l
= isl_basic_map_alloc_equality(bmap
);
11654 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11655 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11656 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11657 isl_int_set(bmap
->eq
[l
][off
+ k
],
11663 for (i
= 0; i
< ineq
->n_row
; ++i
) {
11664 l
= isl_basic_map_alloc_inequality(bmap
);
11667 for (j
= 0, pos
= 0; j
< 5; ++j
) {
11668 int off
= isl_basic_map_offset(bmap
, c
[j
]);
11669 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
11670 isl_int_set(bmap
->ineq
[l
][off
+ k
],
11671 ineq
->row
[i
][pos
]);
11677 isl_space_free(dim
);
11679 isl_mat_free(ineq
);
11681 bmap
= isl_basic_map_simplify(bmap
);
11682 return isl_basic_map_finalize(bmap
);
11684 isl_space_free(dim
);
11686 isl_mat_free(ineq
);
11690 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
11691 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11692 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11694 return isl_basic_map_equalities_matrix(bset_to_bmap(bset
),
11695 c1
, c2
, c3
, c4
, isl_dim_in
);
11698 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
11699 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
11700 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11702 return isl_basic_map_inequalities_matrix(bset_to_bmap(bset
),
11703 c1
, c2
, c3
, c4
, isl_dim_in
);
11706 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
11707 __isl_take isl_space
*dim
,
11708 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
11709 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
11711 isl_basic_map
*bmap
;
11712 bmap
= isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
11713 c1
, c2
, c3
, c4
, isl_dim_in
);
11714 return bset_from_bmap(bmap
);
11717 isl_bool
isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
11720 return isl_bool_error
;
11722 return isl_space_can_zip(bmap
->dim
);
11725 isl_bool
isl_map_can_zip(__isl_keep isl_map
*map
)
11728 return isl_bool_error
;
11730 return isl_space_can_zip(map
->dim
);
11733 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
11734 * (A -> C) -> (B -> D).
11736 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
11745 if (!isl_basic_map_can_zip(bmap
))
11746 isl_die(bmap
->ctx
, isl_error_invalid
,
11747 "basic map cannot be zipped", goto error
);
11748 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
11749 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
11750 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
11751 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
11752 bmap
= isl_basic_map_cow(bmap
);
11753 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
11756 bmap
->dim
= isl_space_zip(bmap
->dim
);
11759 bmap
= isl_basic_map_mark_final(bmap
);
11762 isl_basic_map_free(bmap
);
11766 /* Given a map (A -> B) -> (C -> D), return the corresponding map
11767 * (A -> C) -> (B -> D).
11769 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
11776 if (!isl_map_can_zip(map
))
11777 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
11780 map
= isl_map_cow(map
);
11784 for (i
= 0; i
< map
->n
; ++i
) {
11785 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
11790 map
->dim
= isl_space_zip(map
->dim
);
11800 /* Can we apply isl_basic_map_curry to "bmap"?
11801 * That is, does it have a nested relation in its domain?
11803 isl_bool
isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
11806 return isl_bool_error
;
11808 return isl_space_can_curry(bmap
->dim
);
11811 /* Can we apply isl_map_curry to "map"?
11812 * That is, does it have a nested relation in its domain?
11814 isl_bool
isl_map_can_curry(__isl_keep isl_map
*map
)
11817 return isl_bool_error
;
11819 return isl_space_can_curry(map
->dim
);
11822 /* Given a basic map (A -> B) -> C, return the corresponding basic map
11825 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
11831 if (!isl_basic_map_can_curry(bmap
))
11832 isl_die(bmap
->ctx
, isl_error_invalid
,
11833 "basic map cannot be curried", goto error
);
11834 bmap
= isl_basic_map_cow(bmap
);
11837 bmap
->dim
= isl_space_curry(bmap
->dim
);
11840 bmap
= isl_basic_map_mark_final(bmap
);
11843 isl_basic_map_free(bmap
);
11847 /* Given a map (A -> B) -> C, return the corresponding map
11850 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
11852 return isl_map_change_space(map
, &isl_map_can_curry
,
11853 "map cannot be curried", &isl_space_curry
);
11856 /* Can isl_map_range_curry be applied to "map"?
11857 * That is, does it have a nested relation in its range,
11858 * the domain of which is itself a nested relation?
11860 isl_bool
isl_map_can_range_curry(__isl_keep isl_map
*map
)
11863 return isl_bool_error
;
11865 return isl_space_can_range_curry(map
->dim
);
11868 /* Given a map A -> ((B -> C) -> D), return the corresponding map
11869 * A -> (B -> (C -> D)).
11871 __isl_give isl_map
*isl_map_range_curry(__isl_take isl_map
*map
)
11873 return isl_map_change_space(map
, &isl_map_can_range_curry
,
11874 "map range cannot be curried",
11875 &isl_space_range_curry
);
11878 /* Can we apply isl_basic_map_uncurry to "bmap"?
11879 * That is, does it have a nested relation in its domain?
11881 isl_bool
isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11884 return isl_bool_error
;
11886 return isl_space_can_uncurry(bmap
->dim
);
11889 /* Can we apply isl_map_uncurry to "map"?
11890 * That is, does it have a nested relation in its domain?
11892 isl_bool
isl_map_can_uncurry(__isl_keep isl_map
*map
)
11895 return isl_bool_error
;
11897 return isl_space_can_uncurry(map
->dim
);
11900 /* Given a basic map A -> (B -> C), return the corresponding basic map
11903 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11909 if (!isl_basic_map_can_uncurry(bmap
))
11910 isl_die(bmap
->ctx
, isl_error_invalid
,
11911 "basic map cannot be uncurried",
11912 return isl_basic_map_free(bmap
));
11913 bmap
= isl_basic_map_cow(bmap
);
11916 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11918 return isl_basic_map_free(bmap
);
11919 bmap
= isl_basic_map_mark_final(bmap
);
11923 /* Given a map A -> (B -> C), return the corresponding map
11926 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11928 return isl_map_change_space(map
, &isl_map_can_uncurry
,
11929 "map cannot be uncurried", &isl_space_uncurry
);
11932 /* Construct a basic map mapping the domain of the affine expression
11933 * to a one-dimensional range prescribed by the affine expression.
11934 * If "rational" is set, then construct a rational basic map.
11936 * A NaN affine expression cannot be converted to a basic map.
11938 static __isl_give isl_basic_map
*isl_basic_map_from_aff2(
11939 __isl_take isl_aff
*aff
, int rational
)
11944 isl_local_space
*ls
;
11945 isl_basic_map
*bmap
= NULL
;
11949 is_nan
= isl_aff_is_nan(aff
);
11953 isl_die(isl_aff_get_ctx(aff
), isl_error_invalid
,
11954 "cannot convert NaN", goto error
);
11956 ls
= isl_aff_get_local_space(aff
);
11957 bmap
= isl_basic_map_from_local_space(ls
);
11958 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11959 k
= isl_basic_map_alloc_equality(bmap
);
11963 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11964 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11965 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11966 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11967 aff
->v
->size
- (pos
+ 1));
11971 bmap
= isl_basic_map_set_rational(bmap
);
11972 bmap
= isl_basic_map_finalize(bmap
);
11976 isl_basic_map_free(bmap
);
11980 /* Construct a basic map mapping the domain of the affine expression
11981 * to a one-dimensional range prescribed by the affine expression.
11983 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11985 return isl_basic_map_from_aff2(aff
, 0);
11988 /* Construct a map mapping the domain of the affine expression
11989 * to a one-dimensional range prescribed by the affine expression.
11991 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11993 isl_basic_map
*bmap
;
11995 bmap
= isl_basic_map_from_aff(aff
);
11996 return isl_map_from_basic_map(bmap
);
11999 /* Construct a basic map mapping the domain the multi-affine expression
12000 * to its range, with each dimension in the range equated to the
12001 * corresponding affine expression.
12002 * If "rational" is set, then construct a rational basic map.
12004 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff2(
12005 __isl_take isl_multi_aff
*maff
, int rational
)
12009 isl_basic_map
*bmap
;
12014 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
12015 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
12016 "invalid space", goto error
);
12018 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
12019 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
12021 bmap
= isl_basic_map_set_rational(bmap
);
12023 for (i
= 0; i
< maff
->n
; ++i
) {
12025 isl_basic_map
*bmap_i
;
12027 aff
= isl_aff_copy(maff
->p
[i
]);
12028 bmap_i
= isl_basic_map_from_aff2(aff
, rational
);
12030 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12033 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
12035 isl_multi_aff_free(maff
);
12038 isl_multi_aff_free(maff
);
12042 /* Construct a basic map mapping the domain the multi-affine expression
12043 * to its range, with each dimension in the range equated to the
12044 * corresponding affine expression.
12046 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
12047 __isl_take isl_multi_aff
*ma
)
12049 return isl_basic_map_from_multi_aff2(ma
, 0);
12052 /* Construct a map mapping the domain the multi-affine expression
12053 * to its range, with each dimension in the range equated to the
12054 * corresponding affine expression.
12056 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
12058 isl_basic_map
*bmap
;
12060 bmap
= isl_basic_map_from_multi_aff(maff
);
12061 return isl_map_from_basic_map(bmap
);
12064 /* Construct a basic map mapping a domain in the given space to
12065 * to an n-dimensional range, with n the number of elements in the list,
12066 * where each coordinate in the range is prescribed by the
12067 * corresponding affine expression.
12068 * The domains of all affine expressions in the list are assumed to match
12071 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
12072 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
12076 isl_basic_map
*bmap
;
12081 dim
= isl_space_from_domain(domain_dim
);
12082 bmap
= isl_basic_map_universe(dim
);
12084 for (i
= 0; i
< list
->n
; ++i
) {
12086 isl_basic_map
*bmap_i
;
12088 aff
= isl_aff_copy(list
->p
[i
]);
12089 bmap_i
= isl_basic_map_from_aff(aff
);
12091 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
12094 isl_aff_list_free(list
);
12098 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
12099 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12101 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
12104 /* Construct a basic map where the given dimensions are equal to each other.
12106 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
12107 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12109 isl_basic_map
*bmap
= NULL
;
12115 if (pos1
>= isl_space_dim(space
, type1
))
12116 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12117 "index out of bounds", goto error
);
12118 if (pos2
>= isl_space_dim(space
, type2
))
12119 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12120 "index out of bounds", goto error
);
12122 if (type1
== type2
&& pos1
== pos2
)
12123 return isl_basic_map_universe(space
);
12125 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
12126 i
= isl_basic_map_alloc_equality(bmap
);
12129 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12130 pos1
+= isl_basic_map_offset(bmap
, type1
);
12131 pos2
+= isl_basic_map_offset(bmap
, type2
);
12132 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
12133 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12134 bmap
= isl_basic_map_finalize(bmap
);
12135 isl_space_free(space
);
12138 isl_space_free(space
);
12139 isl_basic_map_free(bmap
);
12143 /* Add a constraint imposing that the given two dimensions are equal.
12145 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
12146 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12150 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12152 bmap
= isl_basic_map_intersect(bmap
, eq
);
12157 /* Add a constraint imposing that the given two dimensions are equal.
12159 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
12160 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12162 isl_basic_map
*bmap
;
12164 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12166 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12171 /* Add a constraint imposing that the given two dimensions have opposite values.
12173 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
12174 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12176 isl_basic_map
*bmap
= NULL
;
12182 if (pos1
>= isl_map_dim(map
, type1
))
12183 isl_die(map
->ctx
, isl_error_invalid
,
12184 "index out of bounds", goto error
);
12185 if (pos2
>= isl_map_dim(map
, type2
))
12186 isl_die(map
->ctx
, isl_error_invalid
,
12187 "index out of bounds", goto error
);
12189 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
12190 i
= isl_basic_map_alloc_equality(bmap
);
12193 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12194 pos1
+= isl_basic_map_offset(bmap
, type1
);
12195 pos2
+= isl_basic_map_offset(bmap
, type2
);
12196 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
12197 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
12198 bmap
= isl_basic_map_finalize(bmap
);
12200 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12204 isl_basic_map_free(bmap
);
12209 /* Construct a constraint imposing that the value of the first dimension is
12210 * greater than or equal to that of the second.
12212 static __isl_give isl_constraint
*constraint_order_ge(
12213 __isl_take isl_space
*space
, enum isl_dim_type type1
, int pos1
,
12214 enum isl_dim_type type2
, int pos2
)
12221 c
= isl_constraint_alloc_inequality(isl_local_space_from_space(space
));
12223 if (pos1
>= isl_constraint_dim(c
, type1
))
12224 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12225 "index out of bounds", return isl_constraint_free(c
));
12226 if (pos2
>= isl_constraint_dim(c
, type2
))
12227 isl_die(isl_constraint_get_ctx(c
), isl_error_invalid
,
12228 "index out of bounds", return isl_constraint_free(c
));
12230 if (type1
== type2
&& pos1
== pos2
)
12233 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
12234 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
12239 /* Add a constraint imposing that the value of the first dimension is
12240 * greater than or equal to that of the second.
12242 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
12243 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12248 if (type1
== type2
&& pos1
== pos2
)
12250 space
= isl_basic_map_get_space(bmap
);
12251 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12252 bmap
= isl_basic_map_add_constraint(bmap
, c
);
12257 /* Add a constraint imposing that the value of the first dimension is
12258 * greater than or equal to that of the second.
12260 __isl_give isl_map
*isl_map_order_ge(__isl_take isl_map
*map
,
12261 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12266 if (type1
== type2
&& pos1
== pos2
)
12268 space
= isl_map_get_space(map
);
12269 c
= constraint_order_ge(space
, type1
, pos1
, type2
, pos2
);
12270 map
= isl_map_add_constraint(map
, c
);
12275 /* Add a constraint imposing that the value of the first dimension is
12276 * less than or equal to that of the second.
12278 __isl_give isl_map
*isl_map_order_le(__isl_take isl_map
*map
,
12279 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12281 return isl_map_order_ge(map
, type2
, pos2
, type1
, pos1
);
12284 /* Construct a basic map where the value of the first dimension is
12285 * greater than that of the second.
12287 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
12288 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12290 isl_basic_map
*bmap
= NULL
;
12296 if (pos1
>= isl_space_dim(space
, type1
))
12297 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12298 "index out of bounds", goto error
);
12299 if (pos2
>= isl_space_dim(space
, type2
))
12300 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
12301 "index out of bounds", goto error
);
12303 if (type1
== type2
&& pos1
== pos2
)
12304 return isl_basic_map_empty(space
);
12306 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
12307 i
= isl_basic_map_alloc_inequality(bmap
);
12309 return isl_basic_map_free(bmap
);
12310 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
12311 pos1
+= isl_basic_map_offset(bmap
, type1
);
12312 pos2
+= isl_basic_map_offset(bmap
, type2
);
12313 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
12314 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
12315 isl_int_set_si(bmap
->ineq
[i
][0], -1);
12316 bmap
= isl_basic_map_finalize(bmap
);
12320 isl_space_free(space
);
12321 isl_basic_map_free(bmap
);
12325 /* Add a constraint imposing that the value of the first dimension is
12326 * greater than that of the second.
12328 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
12329 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12333 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
12335 bmap
= isl_basic_map_intersect(bmap
, gt
);
12340 /* Add a constraint imposing that the value of the first dimension is
12341 * greater than that of the second.
12343 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
12344 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12346 isl_basic_map
*bmap
;
12348 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
12350 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
12355 /* Add a constraint imposing that the value of the first dimension is
12356 * smaller than that of the second.
12358 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
12359 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
12361 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
12364 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
12368 isl_local_space
*ls
;
12373 if (!isl_basic_map_divs_known(bmap
))
12374 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12375 "some divs are unknown", return NULL
);
12377 ls
= isl_basic_map_get_local_space(bmap
);
12378 div
= isl_local_space_get_div(ls
, pos
);
12379 isl_local_space_free(ls
);
12384 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
12387 return isl_basic_map_get_div(bset
, pos
);
12390 /* Plug in "subs" for dimension "type", "pos" of "bset".
12392 * Let i be the dimension to replace and let "subs" be of the form
12396 * Any integer division with a non-zero coefficient for i,
12398 * floor((a i + g)/m)
12402 * floor((a f + d g)/(m d))
12404 * Constraints of the form
12412 * We currently require that "subs" is an integral expression.
12413 * Handling rational expressions may require us to add stride constraints
12414 * as we do in isl_basic_set_preimage_multi_aff.
12416 __isl_give isl_basic_set
*isl_basic_set_substitute(
12417 __isl_take isl_basic_set
*bset
,
12418 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12424 if (bset
&& isl_basic_set_plain_is_empty(bset
))
12427 bset
= isl_basic_set_cow(bset
);
12428 if (!bset
|| !subs
)
12431 ctx
= isl_basic_set_get_ctx(bset
);
12432 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
12433 isl_die(ctx
, isl_error_invalid
,
12434 "spaces don't match", goto error
);
12435 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
12436 isl_die(ctx
, isl_error_unsupported
,
12437 "cannot handle divs yet", goto error
);
12438 if (!isl_int_is_one(subs
->v
->el
[0]))
12439 isl_die(ctx
, isl_error_invalid
,
12440 "can only substitute integer expressions", goto error
);
12442 pos
+= isl_basic_set_offset(bset
, type
);
12446 for (i
= 0; i
< bset
->n_eq
; ++i
) {
12447 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
12449 isl_int_set(v
, bset
->eq
[i
][pos
]);
12450 isl_int_set_si(bset
->eq
[i
][pos
], 0);
12451 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
12452 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12455 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
12456 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
12458 isl_int_set(v
, bset
->ineq
[i
][pos
]);
12459 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
12460 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
12461 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12464 for (i
= 0; i
< bset
->n_div
; ++i
) {
12465 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
12467 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
12468 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
12469 isl_seq_combine(bset
->div
[i
] + 1,
12470 subs
->v
->el
[0], bset
->div
[i
] + 1,
12471 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
12472 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
12477 bset
= isl_basic_set_simplify(bset
);
12478 return isl_basic_set_finalize(bset
);
12480 isl_basic_set_free(bset
);
12484 /* Plug in "subs" for dimension "type", "pos" of "set".
12486 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
12487 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
12491 if (set
&& isl_set_plain_is_empty(set
))
12494 set
= isl_set_cow(set
);
12498 for (i
= set
->n
- 1; i
>= 0; --i
) {
12499 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
12500 if (remove_if_empty(set
, i
) < 0)
12510 /* Check if the range of "ma" is compatible with the domain or range
12511 * (depending on "type") of "bmap".
12512 * Return -1 if anything is wrong.
12514 static int check_basic_map_compatible_range_multi_aff(
12515 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
12516 __isl_keep isl_multi_aff
*ma
)
12519 isl_space
*ma_space
;
12521 ma_space
= isl_multi_aff_get_space(ma
);
12523 m
= isl_space_match(bmap
->dim
, isl_dim_param
, ma_space
, isl_dim_param
);
12527 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12528 "parameters don't match", goto error
);
12529 m
= isl_space_tuple_is_equal(bmap
->dim
, type
, ma_space
, isl_dim_out
);
12533 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
12534 "spaces don't match", goto error
);
12536 isl_space_free(ma_space
);
12539 isl_space_free(ma_space
);
12543 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
12544 * coefficients before the transformed range of dimensions,
12545 * the "n_after" coefficients after the transformed range of dimensions
12546 * and the coefficients of the other divs in "bmap".
12548 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
12549 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
12554 isl_local_space
*ls
;
12559 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
12563 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
12564 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
12565 for (i
= 0; i
< n_div
; ++i
) {
12566 int o_bmap
= 0, o_ls
= 0;
12568 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
12569 o_bmap
+= 1 + 1 + n_param
;
12570 o_ls
+= 1 + 1 + n_param
;
12571 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
12572 o_bmap
+= n_before
;
12573 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12574 ls
->div
->row
[i
] + o_ls
, n_set
);
12577 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
12579 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
12580 ls
->div
->row
[i
] + o_ls
, n_div
);
12583 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
12584 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
12588 isl_local_space_free(ls
);
12591 isl_local_space_free(ls
);
12595 /* How many stride constraints does "ma" enforce?
12596 * That is, how many of the affine expressions have a denominator
12597 * different from one?
12599 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
12604 for (i
= 0; i
< ma
->n
; ++i
)
12605 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12611 /* For each affine expression in ma of the form
12613 * x_i = (f_i y + h_i)/m_i
12615 * with m_i different from one, add a constraint to "bmap"
12618 * f_i y + h_i = m_i alpha_i
12620 * with alpha_i an additional existentially quantified variable.
12622 * The input variables of "ma" correspond to a subset of the variables
12623 * of "bmap". There are "n_before" variables in "bmap" before this
12624 * subset and "n_after" variables after this subset.
12625 * The integer divisions of the affine expressions in "ma" are assumed
12626 * to have been aligned. There are "n_div_ma" of them and
12627 * they appear first in "bmap", straight after the "n_after" variables.
12629 static __isl_give isl_basic_map
*add_ma_strides(
12630 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
12631 int n_before
, int n_after
, int n_div_ma
)
12639 total
= isl_basic_map_total_dim(bmap
);
12640 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
12641 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
12642 for (i
= 0; i
< ma
->n
; ++i
) {
12643 int o_bmap
= 0, o_ma
= 1;
12645 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
12647 div
= isl_basic_map_alloc_div(bmap
);
12648 k
= isl_basic_map_alloc_equality(bmap
);
12649 if (div
< 0 || k
< 0)
12651 isl_int_set_si(bmap
->div
[div
][0], 0);
12652 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12653 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
12654 o_bmap
+= 1 + n_param
;
12655 o_ma
+= 1 + n_param
;
12656 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
12657 o_bmap
+= n_before
;
12658 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12659 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
12662 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
12664 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
12665 ma
->p
[i
]->v
->el
+ o_ma
, n_div_ma
);
12666 o_bmap
+= n_div_ma
;
12668 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
12669 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
12675 isl_basic_map_free(bmap
);
12679 /* Replace the domain or range space (depending on "type) of "space" by "set".
12681 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
12682 enum isl_dim_type type
, __isl_take isl_space
*set
)
12684 if (type
== isl_dim_in
) {
12685 space
= isl_space_range(space
);
12686 space
= isl_space_map_from_domain_and_range(set
, space
);
12688 space
= isl_space_domain(space
);
12689 space
= isl_space_map_from_domain_and_range(space
, set
);
12695 /* Compute the preimage of the domain or range (depending on "type")
12696 * of "bmap" under the function represented by "ma".
12697 * In other words, plug in "ma" in the domain or range of "bmap".
12698 * The result is a basic map that lives in the same space as "bmap"
12699 * except that the domain or range has been replaced by
12700 * the domain space of "ma".
12702 * If bmap is represented by
12704 * A(p) + S u + B x + T v + C(divs) >= 0,
12706 * where u and x are input and output dimensions if type == isl_dim_out
12707 * while x and v are input and output dimensions if type == isl_dim_in,
12708 * and ma is represented by
12710 * x = D(p) + F(y) + G(divs')
12712 * then the result is
12714 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
12716 * The divs in the input set are similarly adjusted.
12719 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
12723 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
12724 * B_i G(divs') + c_i(divs))/n_i)
12726 * If bmap is not a rational map and if F(y) involves any denominators
12728 * x_i = (f_i y + h_i)/m_i
12730 * then additional constraints are added to ensure that we only
12731 * map back integer points. That is we enforce
12733 * f_i y + h_i = m_i alpha_i
12735 * with alpha_i an additional existentially quantified variable.
12737 * We first copy over the divs from "ma".
12738 * Then we add the modified constraints and divs from "bmap".
12739 * Finally, we add the stride constraints, if needed.
12741 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
12742 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
12743 __isl_take isl_multi_aff
*ma
)
12747 isl_basic_map
*res
= NULL
;
12748 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
12749 isl_int f
, c1
, c2
, g
;
12750 int rational
, strides
;
12757 ma
= isl_multi_aff_align_divs(ma
);
12760 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
12763 if (type
== isl_dim_in
) {
12765 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
12767 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
12770 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
12771 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
12773 space
= isl_multi_aff_get_domain_space(ma
);
12774 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
12775 rational
= isl_basic_map_is_rational(bmap
);
12776 strides
= rational
? 0 : multi_aff_strides(ma
);
12777 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
12778 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
12780 res
= isl_basic_map_set_rational(res
);
12782 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
12783 if (isl_basic_map_alloc_div(res
) < 0)
12786 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
12789 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
12790 k
= isl_basic_map_alloc_equality(res
);
12793 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
12794 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12797 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
12798 k
= isl_basic_map_alloc_inequality(res
);
12801 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
12802 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
12805 for (i
= 0; i
< bmap
->n_div
; ++i
) {
12806 if (isl_int_is_zero(bmap
->div
[i
][0])) {
12807 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
12810 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
12811 n_before
, n_after
, n_div_ma
, n_div_bmap
,
12816 res
= add_ma_strides(res
, ma
, n_before
, n_after
, n_div_ma
);
12822 isl_basic_map_free(bmap
);
12823 isl_multi_aff_free(ma
);
12824 res
= isl_basic_set_simplify(res
);
12825 return isl_basic_map_finalize(res
);
12831 isl_basic_map_free(bmap
);
12832 isl_multi_aff_free(ma
);
12833 isl_basic_map_free(res
);
12837 /* Compute the preimage of "bset" under the function represented by "ma".
12838 * In other words, plug in "ma" in "bset". The result is a basic set
12839 * that lives in the domain space of "ma".
12841 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
12842 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
12844 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
12847 /* Compute the preimage of the domain of "bmap" under the function
12848 * represented by "ma".
12849 * In other words, plug in "ma" in the domain of "bmap".
12850 * The result is a basic map that lives in the same space as "bmap"
12851 * except that the domain has been replaced by the domain space of "ma".
12853 __isl_give isl_basic_map
*isl_basic_map_preimage_domain_multi_aff(
12854 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12856 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_in
, ma
);
12859 /* Compute the preimage of the range of "bmap" under the function
12860 * represented by "ma".
12861 * In other words, plug in "ma" in the range of "bmap".
12862 * The result is a basic map that lives in the same space as "bmap"
12863 * except that the range has been replaced by the domain space of "ma".
12865 __isl_give isl_basic_map
*isl_basic_map_preimage_range_multi_aff(
12866 __isl_take isl_basic_map
*bmap
, __isl_take isl_multi_aff
*ma
)
12868 return isl_basic_map_preimage_multi_aff(bmap
, isl_dim_out
, ma
);
12871 /* Check if the range of "ma" is compatible with the domain or range
12872 * (depending on "type") of "map".
12873 * Return -1 if anything is wrong.
12875 static int check_map_compatible_range_multi_aff(
12876 __isl_keep isl_map
*map
, enum isl_dim_type type
,
12877 __isl_keep isl_multi_aff
*ma
)
12880 isl_space
*ma_space
;
12882 ma_space
= isl_multi_aff_get_space(ma
);
12883 m
= isl_space_tuple_is_equal(map
->dim
, type
, ma_space
, isl_dim_out
);
12884 isl_space_free(ma_space
);
12886 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
12887 "spaces don't match", return -1);
12891 /* Compute the preimage of the domain or range (depending on "type")
12892 * of "map" under the function represented by "ma".
12893 * In other words, plug in "ma" in the domain or range of "map".
12894 * The result is a map that lives in the same space as "map"
12895 * except that the domain or range has been replaced by
12896 * the domain space of "ma".
12898 * The parameters are assumed to have been aligned.
12900 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
12901 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12906 map
= isl_map_cow(map
);
12907 ma
= isl_multi_aff_align_divs(ma
);
12910 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
12913 for (i
= 0; i
< map
->n
; ++i
) {
12914 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
12915 isl_multi_aff_copy(ma
));
12920 space
= isl_multi_aff_get_domain_space(ma
);
12921 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
12923 isl_space_free(map
->dim
);
12928 isl_multi_aff_free(ma
);
12930 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
12931 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
12934 isl_multi_aff_free(ma
);
12939 /* Compute the preimage of the domain or range (depending on "type")
12940 * of "map" under the function represented by "ma".
12941 * In other words, plug in "ma" in the domain or range of "map".
12942 * The result is a map that lives in the same space as "map"
12943 * except that the domain or range has been replaced by
12944 * the domain space of "ma".
12946 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
12947 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
12952 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
12953 return map_preimage_multi_aff(map
, type
, ma
);
12955 if (!isl_space_has_named_params(map
->dim
) ||
12956 !isl_space_has_named_params(ma
->space
))
12957 isl_die(map
->ctx
, isl_error_invalid
,
12958 "unaligned unnamed parameters", goto error
);
12959 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
12960 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
12962 return map_preimage_multi_aff(map
, type
, ma
);
12964 isl_multi_aff_free(ma
);
12965 return isl_map_free(map
);
12968 /* Compute the preimage of "set" under the function represented by "ma".
12969 * In other words, plug in "ma" in "set". The result is a set
12970 * that lives in the domain space of "ma".
12972 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
12973 __isl_take isl_multi_aff
*ma
)
12975 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
12978 /* Compute the preimage of the domain of "map" under the function
12979 * represented by "ma".
12980 * In other words, plug in "ma" in the domain of "map".
12981 * The result is a map that lives in the same space as "map"
12982 * except that the domain has been replaced by the domain space of "ma".
12984 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12985 __isl_take isl_multi_aff
*ma
)
12987 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12990 /* Compute the preimage of the range of "map" under the function
12991 * represented by "ma".
12992 * In other words, plug in "ma" in the range of "map".
12993 * The result is a map that lives in the same space as "map"
12994 * except that the range has been replaced by the domain space of "ma".
12996 __isl_give isl_map
*isl_map_preimage_range_multi_aff(__isl_take isl_map
*map
,
12997 __isl_take isl_multi_aff
*ma
)
12999 return isl_map_preimage_multi_aff(map
, isl_dim_out
, ma
);
13002 /* Compute the preimage of "map" under the function represented by "pma".
13003 * In other words, plug in "pma" in the domain or range of "map".
13004 * The result is a map that lives in the same space as "map",
13005 * except that the space of type "type" has been replaced by
13006 * the domain space of "pma".
13008 * The parameters of "map" and "pma" are assumed to have been aligned.
13010 static __isl_give isl_map
*isl_map_preimage_pw_multi_aff_aligned(
13011 __isl_take isl_map
*map
, enum isl_dim_type type
,
13012 __isl_take isl_pw_multi_aff
*pma
)
13021 isl_pw_multi_aff_free(pma
);
13022 res
= isl_map_empty(isl_map_get_space(map
));
13027 res
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13028 isl_multi_aff_copy(pma
->p
[0].maff
));
13029 if (type
== isl_dim_in
)
13030 res
= isl_map_intersect_domain(res
,
13031 isl_map_copy(pma
->p
[0].set
));
13033 res
= isl_map_intersect_range(res
,
13034 isl_map_copy(pma
->p
[0].set
));
13036 for (i
= 1; i
< pma
->n
; ++i
) {
13039 res_i
= isl_map_preimage_multi_aff(isl_map_copy(map
), type
,
13040 isl_multi_aff_copy(pma
->p
[i
].maff
));
13041 if (type
== isl_dim_in
)
13042 res_i
= isl_map_intersect_domain(res_i
,
13043 isl_map_copy(pma
->p
[i
].set
));
13045 res_i
= isl_map_intersect_range(res_i
,
13046 isl_map_copy(pma
->p
[i
].set
));
13047 res
= isl_map_union(res
, res_i
);
13050 isl_pw_multi_aff_free(pma
);
13054 isl_pw_multi_aff_free(pma
);
13059 /* Compute the preimage of "map" under the function represented by "pma".
13060 * In other words, plug in "pma" in the domain or range of "map".
13061 * The result is a map that lives in the same space as "map",
13062 * except that the space of type "type" has been replaced by
13063 * the domain space of "pma".
13065 __isl_give isl_map
*isl_map_preimage_pw_multi_aff(__isl_take isl_map
*map
,
13066 enum isl_dim_type type
, __isl_take isl_pw_multi_aff
*pma
)
13071 if (isl_space_match(map
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
13072 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13074 if (!isl_space_has_named_params(map
->dim
) ||
13075 !isl_space_has_named_params(pma
->dim
))
13076 isl_die(map
->ctx
, isl_error_invalid
,
13077 "unaligned unnamed parameters", goto error
);
13078 map
= isl_map_align_params(map
, isl_pw_multi_aff_get_space(pma
));
13079 pma
= isl_pw_multi_aff_align_params(pma
, isl_map_get_space(map
));
13081 return isl_map_preimage_pw_multi_aff_aligned(map
, type
, pma
);
13083 isl_pw_multi_aff_free(pma
);
13084 return isl_map_free(map
);
13087 /* Compute the preimage of "set" under the function represented by "pma".
13088 * In other words, plug in "pma" in "set". The result is a set
13089 * that lives in the domain space of "pma".
13091 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
13092 __isl_take isl_pw_multi_aff
*pma
)
13094 return isl_map_preimage_pw_multi_aff(set
, isl_dim_set
, pma
);
13097 /* Compute the preimage of the domain of "map" under the function
13098 * represented by "pma".
13099 * In other words, plug in "pma" in the domain of "map".
13100 * The result is a map that lives in the same space as "map",
13101 * except that domain space has been replaced by the domain space of "pma".
13103 __isl_give isl_map
*isl_map_preimage_domain_pw_multi_aff(
13104 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13106 return isl_map_preimage_pw_multi_aff(map
, isl_dim_in
, pma
);
13109 /* Compute the preimage of the range of "map" under the function
13110 * represented by "pma".
13111 * In other words, plug in "pma" in the range of "map".
13112 * The result is a map that lives in the same space as "map",
13113 * except that range space has been replaced by the domain space of "pma".
13115 __isl_give isl_map
*isl_map_preimage_range_pw_multi_aff(
13116 __isl_take isl_map
*map
, __isl_take isl_pw_multi_aff
*pma
)
13118 return isl_map_preimage_pw_multi_aff(map
, isl_dim_out
, pma
);
13121 /* Compute the preimage of "map" under the function represented by "mpa".
13122 * In other words, plug in "mpa" in the domain or range of "map".
13123 * The result is a map that lives in the same space as "map",
13124 * except that the space of type "type" has been replaced by
13125 * the domain space of "mpa".
13127 * If the map does not involve any constraints that refer to the
13128 * dimensions of the substituted space, then the only possible
13129 * effect of "mpa" on the map is to map the space to a different space.
13130 * We create a separate isl_multi_aff to effectuate this change
13131 * in order to avoid spurious splitting of the map along the pieces
13134 __isl_give isl_map
*isl_map_preimage_multi_pw_aff(__isl_take isl_map
*map
,
13135 enum isl_dim_type type
, __isl_take isl_multi_pw_aff
*mpa
)
13138 isl_pw_multi_aff
*pma
;
13143 n
= isl_map_dim(map
, type
);
13144 if (!isl_map_involves_dims(map
, type
, 0, n
)) {
13148 space
= isl_multi_pw_aff_get_space(mpa
);
13149 isl_multi_pw_aff_free(mpa
);
13150 ma
= isl_multi_aff_zero(space
);
13151 return isl_map_preimage_multi_aff(map
, type
, ma
);
13154 pma
= isl_pw_multi_aff_from_multi_pw_aff(mpa
);
13155 return isl_map_preimage_pw_multi_aff(map
, type
, pma
);
13158 isl_multi_pw_aff_free(mpa
);
13162 /* Compute the preimage of "map" under the function represented by "mpa".
13163 * In other words, plug in "mpa" in the domain "map".
13164 * The result is a map that lives in the same space as "map",
13165 * except that domain space has been replaced by the domain space of "mpa".
13167 __isl_give isl_map
*isl_map_preimage_domain_multi_pw_aff(
13168 __isl_take isl_map
*map
, __isl_take isl_multi_pw_aff
*mpa
)
13170 return isl_map_preimage_multi_pw_aff(map
, isl_dim_in
, mpa
);
13173 /* Compute the preimage of "set" by the function represented by "mpa".
13174 * In other words, plug in "mpa" in "set".
13176 __isl_give isl_set
*isl_set_preimage_multi_pw_aff(__isl_take isl_set
*set
,
13177 __isl_take isl_multi_pw_aff
*mpa
)
13179 return isl_map_preimage_multi_pw_aff(set
, isl_dim_set
, mpa
);
13182 /* Is the point "inner" internal to inequality constraint "ineq"
13184 * The point is considered to be internal to the inequality constraint,
13185 * if it strictly lies on the positive side of the inequality constraint,
13186 * or if it lies on the constraint and the constraint is lexico-positive.
13188 static isl_bool
is_internal(__isl_keep isl_vec
*inner
,
13189 __isl_keep isl_basic_set
*bset
, int ineq
)
13195 if (!inner
|| !bset
)
13196 return isl_bool_error
;
13198 ctx
= isl_basic_set_get_ctx(bset
);
13199 isl_seq_inner_product(inner
->el
, bset
->ineq
[ineq
], inner
->size
,
13200 &ctx
->normalize_gcd
);
13201 if (!isl_int_is_zero(ctx
->normalize_gcd
))
13202 return isl_int_is_nonneg(ctx
->normalize_gcd
);
13204 total
= isl_basic_set_dim(bset
, isl_dim_all
);
13205 pos
= isl_seq_first_non_zero(bset
->ineq
[ineq
] + 1, total
);
13206 return isl_int_is_pos(bset
->ineq
[ineq
][1 + pos
]);
13209 /* Tighten the inequality constraints of "bset" that are outward with respect
13210 * to the point "vec".
13211 * That is, tighten the constraints that are not satisfied by "vec".
13213 * "vec" is a point internal to some superset S of "bset" that is used
13214 * to make the subsets of S disjoint, by tightening one half of the constraints
13215 * that separate two subsets. In particular, the constraints of S
13216 * are all satisfied by "vec" and should not be tightened.
13217 * Of the internal constraints, those that have "vec" on the outside
13218 * are tightened. The shared facet is included in the adjacent subset
13219 * with the opposite constraint.
13220 * For constraints that saturate "vec", this criterion cannot be used
13221 * to determine which of the two sides should be tightened.
13222 * Instead, the sign of the first non-zero coefficient is used
13223 * to make this choice. Note that this second criterion is never used
13224 * on the constraints of S since "vec" is interior to "S".
13226 __isl_give isl_basic_set
*isl_basic_set_tighten_outward(
13227 __isl_take isl_basic_set
*bset
, __isl_keep isl_vec
*vec
)
13231 bset
= isl_basic_set_cow(bset
);
13234 for (j
= 0; j
< bset
->n_ineq
; ++j
) {
13237 internal
= is_internal(vec
, bset
, j
);
13239 return isl_basic_set_free(bset
);
13242 isl_int_sub_ui(bset
->ineq
[j
][0], bset
->ineq
[j
][0], 1);