2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
31 #include <isl_dim_map.h>
32 #include <isl_local_space_private.h>
33 #include <isl_aff_private.h>
34 #include <isl_options_private.h>
35 #include <isl_morph.h>
36 #include <isl_val_private.h>
38 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
41 case isl_dim_param
: return dim
->nparam
;
42 case isl_dim_in
: return dim
->n_in
;
43 case isl_dim_out
: return dim
->n_out
;
44 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
49 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
52 case isl_dim_param
: return 1;
53 case isl_dim_in
: return 1 + dim
->nparam
;
54 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
59 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
60 enum isl_dim_type type
)
65 case isl_dim_cst
: return 1;
68 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
69 case isl_dim_div
: return bmap
->n_div
;
70 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
75 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
77 return map
? n(map
->dim
, type
) : 0;
80 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
82 return set
? n(set
->dim
, type
) : 0;
85 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
86 enum isl_dim_type type
)
88 isl_space
*dim
= bmap
->dim
;
90 case isl_dim_cst
: return 0;
91 case isl_dim_param
: return 1;
92 case isl_dim_in
: return 1 + dim
->nparam
;
93 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
94 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
99 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
100 enum isl_dim_type type
)
102 return isl_basic_map_offset(bset
, type
);
105 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
107 return pos(map
->dim
, type
);
110 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
111 enum isl_dim_type type
)
113 return isl_basic_map_dim(bset
, type
);
116 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
118 return isl_basic_set_dim(bset
, isl_dim_set
);
121 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
123 return isl_basic_set_dim(bset
, isl_dim_param
);
126 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
130 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
133 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
135 return isl_set_dim(set
, isl_dim_set
);
138 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
140 return isl_set_dim(set
, isl_dim_param
);
143 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
145 return bmap
? bmap
->dim
->n_in
: 0;
148 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
150 return bmap
? bmap
->dim
->n_out
: 0;
153 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
155 return bmap
? bmap
->dim
->nparam
: 0;
158 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
160 return bmap
? bmap
->n_div
: 0;
163 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
165 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
168 unsigned isl_map_n_in(const struct isl_map
*map
)
170 return map
? map
->dim
->n_in
: 0;
173 unsigned isl_map_n_out(const struct isl_map
*map
)
175 return map
? map
->dim
->n_out
: 0;
178 unsigned isl_map_n_param(const struct isl_map
*map
)
180 return map
? map
->dim
->nparam
: 0;
183 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
188 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
191 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
194 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
195 struct isl_basic_set
*bset
)
200 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
203 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
206 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
211 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
214 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
217 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
218 struct isl_basic_set
*bset
)
223 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
226 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
229 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
231 return bmap
? bmap
->ctx
: NULL
;
234 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
236 return bset
? bset
->ctx
: NULL
;
239 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
241 return map
? map
->ctx
: NULL
;
244 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
246 return set
? set
->ctx
: NULL
;
249 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
253 return isl_space_copy(bmap
->dim
);
256 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
260 return isl_space_copy(bset
->dim
);
263 /* Extract the divs in "bmap" as a matrix.
265 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
276 ctx
= isl_basic_map_get_ctx(bmap
);
277 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
278 cols
= 1 + 1 + total
+ bmap
->n_div
;
279 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
283 for (i
= 0; i
< bmap
->n_div
; ++i
)
284 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
289 /* Extract the divs in "bset" as a matrix.
291 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
293 return isl_basic_map_get_divs(bset
);
296 __isl_give isl_local_space
*isl_basic_map_get_local_space(
297 __isl_keep isl_basic_map
*bmap
)
304 div
= isl_basic_map_get_divs(bmap
);
305 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
308 __isl_give isl_local_space
*isl_basic_set_get_local_space(
309 __isl_keep isl_basic_set
*bset
)
311 return isl_basic_map_get_local_space(bset
);
314 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
315 __isl_take isl_local_space
*ls
)
324 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
325 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
326 n_div
, 0, 2 * n_div
);
328 for (i
= 0; i
< n_div
; ++i
)
329 if (isl_basic_map_alloc_div(bmap
) < 0)
332 for (i
= 0; i
< n_div
; ++i
) {
333 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
334 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
338 isl_local_space_free(ls
);
341 isl_local_space_free(ls
);
342 isl_basic_map_free(bmap
);
346 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
347 __isl_take isl_local_space
*ls
)
349 return isl_basic_map_from_local_space(ls
);
352 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
356 return isl_space_copy(map
->dim
);
359 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
363 return isl_space_copy(set
->dim
);
366 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
367 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
369 bmap
= isl_basic_map_cow(bmap
);
372 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
375 bmap
= isl_basic_map_finalize(bmap
);
378 isl_basic_map_free(bmap
);
382 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
383 __isl_take isl_basic_set
*bset
, const char *s
)
385 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
388 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
389 enum isl_dim_type type
)
391 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
394 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
395 enum isl_dim_type type
, const char *s
)
399 map
= isl_map_cow(map
);
403 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
407 for (i
= 0; i
< map
->n
; ++i
) {
408 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
419 /* Does the input or output tuple have a name?
421 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
423 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
426 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
427 enum isl_dim_type type
)
429 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
432 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
435 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
438 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
439 enum isl_dim_type type
, __isl_take isl_id
*id
)
441 map
= isl_map_cow(map
);
443 return isl_id_free(id
);
445 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
447 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
450 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
451 __isl_take isl_id
*id
)
453 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
456 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
457 enum isl_dim_type type
)
459 map
= isl_map_cow(map
);
463 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
465 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
468 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
470 return isl_map_reset_tuple_id(set
, isl_dim_set
);
473 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
475 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
478 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
479 enum isl_dim_type type
)
481 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
484 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
486 return isl_map_has_tuple_id(set
, isl_dim_set
);
489 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
491 return isl_map_get_tuple_id(set
, isl_dim_set
);
494 /* Does the set tuple have a name?
496 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
498 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
502 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
504 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
507 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
509 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
512 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
513 enum isl_dim_type type
, unsigned pos
)
515 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
518 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
519 enum isl_dim_type type
, unsigned pos
)
521 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
524 /* Does the given dimension have a name?
526 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
527 enum isl_dim_type type
, unsigned pos
)
529 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
532 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
533 enum isl_dim_type type
, unsigned pos
)
535 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
538 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
539 enum isl_dim_type type
, unsigned pos
)
541 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
544 /* Does the given dimension have a name?
546 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
547 enum isl_dim_type type
, unsigned pos
)
549 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
552 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
553 __isl_take isl_basic_map
*bmap
,
554 enum isl_dim_type type
, unsigned pos
, const char *s
)
556 bmap
= isl_basic_map_cow(bmap
);
559 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
562 return isl_basic_map_finalize(bmap
);
564 isl_basic_map_free(bmap
);
568 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
569 enum isl_dim_type type
, unsigned pos
, const char *s
)
573 map
= isl_map_cow(map
);
577 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
581 for (i
= 0; i
< map
->n
; ++i
) {
582 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
593 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
594 __isl_take isl_basic_set
*bset
,
595 enum isl_dim_type type
, unsigned pos
, const char *s
)
597 return (isl_basic_set
*)isl_basic_map_set_dim_name(
598 (isl_basic_map
*)bset
, type
, pos
, s
);
601 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
602 enum isl_dim_type type
, unsigned pos
, const char *s
)
604 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
607 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
608 enum isl_dim_type type
, unsigned pos
)
610 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
613 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
614 enum isl_dim_type type
, unsigned pos
)
616 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
619 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
620 enum isl_dim_type type
, unsigned pos
)
622 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
625 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
626 enum isl_dim_type type
, unsigned pos
)
628 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
631 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
632 enum isl_dim_type type
, unsigned pos
)
634 return isl_map_has_dim_id(set
, type
, pos
);
637 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
638 enum isl_dim_type type
, unsigned pos
)
640 return isl_map_get_dim_id(set
, type
, pos
);
643 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
644 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
646 map
= isl_map_cow(map
);
648 return isl_id_free(id
);
650 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
652 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
655 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
656 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
658 return isl_map_set_dim_id(set
, type
, pos
, id
);
661 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
662 __isl_keep isl_id
*id
)
666 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
669 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
670 __isl_keep isl_id
*id
)
672 return isl_map_find_dim_by_id(set
, type
, id
);
675 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
680 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
683 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
686 return isl_map_find_dim_by_name(set
, type
, name
);
689 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
693 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
696 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
698 return isl_basic_map_is_rational(bset
);
701 /* Does "bmap" contain any rational points?
703 * If "bmap" has an equality for each dimension, equating the dimension
704 * to an integer constant, then it has no rational points, even if it
705 * is marked as rational.
707 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
709 int has_rational
= 1;
714 if (isl_basic_map_plain_is_empty(bmap
))
716 if (!isl_basic_map_is_rational(bmap
))
718 bmap
= isl_basic_map_copy(bmap
);
719 bmap
= isl_basic_map_implicit_equalities(bmap
);
722 total
= isl_basic_map_total_dim(bmap
);
723 if (bmap
->n_eq
== total
) {
725 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
726 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
729 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
730 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
732 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
740 isl_basic_map_free(bmap
);
745 /* Does "map" contain any rational points?
747 int isl_map_has_rational(__isl_keep isl_map
*map
)
754 for (i
= 0; i
< map
->n
; ++i
) {
755 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
756 if (has_rational
< 0)
764 /* Does "set" contain any rational points?
766 int isl_set_has_rational(__isl_keep isl_set
*set
)
768 return isl_map_has_rational(set
);
771 /* Is this basic set a parameter domain?
773 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
777 return isl_space_is_params(bset
->dim
);
780 /* Is this set a parameter domain?
782 int isl_set_is_params(__isl_keep isl_set
*set
)
786 return isl_space_is_params(set
->dim
);
789 /* Is this map actually a parameter domain?
790 * Users should never call this function. Outside of isl,
791 * a map can never be a parameter domain.
793 int isl_map_is_params(__isl_keep isl_map
*map
)
797 return isl_space_is_params(map
->dim
);
800 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
801 struct isl_basic_map
*bmap
, unsigned extra
,
802 unsigned n_eq
, unsigned n_ineq
)
805 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
810 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
811 if (isl_blk_is_error(bmap
->block
))
814 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
815 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
819 bmap
->block2
= isl_blk_empty();
822 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
823 if (isl_blk_is_error(bmap
->block2
))
826 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
831 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
832 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
834 for (i
= 0; i
< extra
; ++i
)
835 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
839 bmap
->c_size
= n_eq
+ n_ineq
;
840 bmap
->eq
= bmap
->ineq
+ n_ineq
;
849 isl_basic_map_free(bmap
);
853 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
854 unsigned nparam
, unsigned dim
, unsigned extra
,
855 unsigned n_eq
, unsigned n_ineq
)
857 struct isl_basic_map
*bmap
;
860 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
864 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
865 return (struct isl_basic_set
*)bmap
;
868 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
869 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
871 struct isl_basic_map
*bmap
;
874 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
875 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
876 return (struct isl_basic_set
*)bmap
;
882 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
883 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
885 struct isl_basic_map
*bmap
;
889 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
894 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
900 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
901 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
902 unsigned n_eq
, unsigned n_ineq
)
904 struct isl_basic_map
*bmap
;
907 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
911 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
915 static void dup_constraints(
916 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
919 unsigned total
= isl_basic_map_total_dim(src
);
921 for (i
= 0; i
< src
->n_eq
; ++i
) {
922 int j
= isl_basic_map_alloc_equality(dst
);
923 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
926 for (i
= 0; i
< src
->n_ineq
; ++i
) {
927 int j
= isl_basic_map_alloc_inequality(dst
);
928 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
931 for (i
= 0; i
< src
->n_div
; ++i
) {
932 int j
= isl_basic_map_alloc_div(dst
);
933 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
935 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
938 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
940 struct isl_basic_map
*dup
;
944 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
945 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
948 dup_constraints(dup
, bmap
);
949 dup
->flags
= bmap
->flags
;
950 dup
->sample
= isl_vec_copy(bmap
->sample
);
954 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
956 struct isl_basic_map
*dup
;
958 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
959 return (struct isl_basic_set
*)dup
;
962 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
967 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
971 return isl_basic_set_dup(bset
);
974 struct isl_set
*isl_set_copy(struct isl_set
*set
)
983 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
988 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
992 bmap
= isl_basic_map_dup(bmap
);
994 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
998 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1007 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1012 if (--bmap
->ref
> 0)
1015 isl_ctx_deref(bmap
->ctx
);
1017 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1019 isl_blk_free(bmap
->ctx
, bmap
->block
);
1020 isl_vec_free(bmap
->sample
);
1021 isl_space_free(bmap
->dim
);
1027 void *isl_basic_set_free(struct isl_basic_set
*bset
)
1029 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1032 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1034 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1037 __isl_give isl_map
*isl_map_align_params_map_map_and(
1038 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1039 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1040 __isl_take isl_map
*map2
))
1044 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1045 return fn(map1
, map2
);
1046 if (!isl_space_has_named_params(map1
->dim
) ||
1047 !isl_space_has_named_params(map2
->dim
))
1048 isl_die(map1
->ctx
, isl_error_invalid
,
1049 "unaligned unnamed parameters", goto error
);
1050 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1051 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1052 return fn(map1
, map2
);
1059 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1060 __isl_keep isl_map
*map2
,
1061 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1067 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1068 return fn(map1
, map2
);
1069 if (!isl_space_has_named_params(map1
->dim
) ||
1070 !isl_space_has_named_params(map2
->dim
))
1071 isl_die(map1
->ctx
, isl_error_invalid
,
1072 "unaligned unnamed parameters", return -1);
1073 map1
= isl_map_copy(map1
);
1074 map2
= isl_map_copy(map2
);
1075 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1076 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1083 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1085 struct isl_ctx
*ctx
;
1089 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1090 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1092 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1093 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1094 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1095 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1096 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1097 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1099 int j
= isl_basic_map_alloc_inequality(bmap
);
1103 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1104 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1111 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1112 bmap
->extra
- bmap
->n_div
);
1113 return bmap
->n_eq
++;
1116 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1118 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1121 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1125 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1130 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1132 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1135 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1140 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1142 if (pos
!= bmap
->n_eq
- 1) {
1144 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1145 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1151 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1153 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1156 /* Turn inequality "pos" of "bmap" into an equality.
1158 * In particular, we move the inequality in front of the equalities
1159 * and move the last inequality in the position of the moved inequality.
1160 * Note that isl_tab_make_equalities_explicit depends on this particular
1161 * change in the ordering of the constraints.
1163 void isl_basic_map_inequality_to_equality(
1164 struct isl_basic_map
*bmap
, unsigned pos
)
1168 t
= bmap
->ineq
[pos
];
1169 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1170 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1175 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1176 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1177 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1178 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1181 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1183 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1186 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1188 struct isl_ctx
*ctx
;
1192 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1193 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1194 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1195 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1196 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1197 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1198 1 + isl_basic_map_total_dim(bmap
),
1199 bmap
->extra
- bmap
->n_div
);
1200 return bmap
->n_ineq
++;
1203 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1205 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1208 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1212 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1217 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1219 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1222 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1227 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1229 if (pos
!= bmap
->n_ineq
- 1) {
1230 t
= bmap
->ineq
[pos
];
1231 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1232 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1233 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1239 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1241 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1244 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1249 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1252 k
= isl_basic_map_alloc_equality(bmap
);
1255 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1258 isl_basic_map_free(bmap
);
1262 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1265 return (isl_basic_set
*)
1266 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1269 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1274 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1277 k
= isl_basic_map_alloc_inequality(bmap
);
1280 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1283 isl_basic_map_free(bmap
);
1287 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1290 return (isl_basic_set
*)
1291 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1294 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1298 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1299 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1300 1 + 1 + isl_basic_map_total_dim(bmap
),
1301 bmap
->extra
- bmap
->n_div
);
1302 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1303 return bmap
->n_div
++;
1306 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1308 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1311 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1315 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1320 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1322 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1325 /* Copy constraint from src to dst, putting the vars of src at offset
1326 * dim_off in dst and the divs of src at offset div_off in dst.
1327 * If both sets are actually map, then dim_off applies to the input
1330 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1331 struct isl_basic_map
*src_map
, isl_int
*src
,
1332 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1334 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1335 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1336 unsigned src_in
= isl_basic_map_n_in(src_map
);
1337 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1338 unsigned src_out
= isl_basic_map_n_out(src_map
);
1339 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1340 isl_int_set(dst
[0], src
[0]);
1341 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1342 if (dst_nparam
> src_nparam
)
1343 isl_seq_clr(dst
+1+src_nparam
,
1344 dst_nparam
- src_nparam
);
1345 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1346 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1348 isl_min(dst_in
-in_off
, src_in
));
1349 if (dst_in
-in_off
> src_in
)
1350 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1351 dst_in
- in_off
- src_in
);
1352 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1353 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1354 src
+1+src_nparam
+src_in
,
1355 isl_min(dst_out
-out_off
, src_out
));
1356 if (dst_out
-out_off
> src_out
)
1357 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1358 dst_out
- out_off
- src_out
);
1359 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1360 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1361 src
+1+src_nparam
+src_in
+src_out
,
1362 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1363 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1364 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1365 div_off
+src_map
->n_div
,
1366 dst_map
->n_div
- div_off
- src_map
->n_div
);
1369 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1370 struct isl_basic_map
*src_map
, isl_int
*src
,
1371 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1373 isl_int_set(dst
[0], src
[0]);
1374 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1377 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1378 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1383 if (!bmap1
|| !bmap2
)
1386 div_off
= bmap1
->n_div
;
1388 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1389 int i1
= isl_basic_map_alloc_equality(bmap1
);
1392 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1393 i_pos
, o_pos
, div_off
);
1396 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1397 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1400 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1401 i_pos
, o_pos
, div_off
);
1404 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1405 int i1
= isl_basic_map_alloc_div(bmap1
);
1408 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1409 i_pos
, o_pos
, div_off
);
1412 isl_basic_map_free(bmap2
);
1417 isl_basic_map_free(bmap1
);
1418 isl_basic_map_free(bmap2
);
1422 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1423 struct isl_basic_set
*bset2
, unsigned pos
)
1425 return (struct isl_basic_set
*)
1426 add_constraints((struct isl_basic_map
*)bset1
,
1427 (struct isl_basic_map
*)bset2
, 0, pos
);
1430 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1431 __isl_take isl_space
*dim
, unsigned extra
,
1432 unsigned n_eq
, unsigned n_ineq
)
1434 struct isl_basic_map
*ext
;
1444 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1445 base
->extra
>= base
->n_div
+ extra
;
1447 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1448 room_for_ineq(base
, n_ineq
)) {
1449 isl_space_free(dim
);
1453 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1454 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1455 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1456 extra
+= base
->extra
;
1458 n_ineq
+= base
->n_ineq
;
1460 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1466 ext
->sample
= isl_vec_copy(base
->sample
);
1467 flags
= base
->flags
;
1468 ext
= add_constraints(ext
, base
, 0, 0);
1471 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1477 isl_space_free(dim
);
1478 isl_basic_map_free(base
);
1482 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1483 __isl_take isl_space
*dim
, unsigned extra
,
1484 unsigned n_eq
, unsigned n_ineq
)
1486 return (struct isl_basic_set
*)
1487 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1488 extra
, n_eq
, n_ineq
);
1491 struct isl_basic_map
*isl_basic_map_extend_constraints(
1492 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1496 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1500 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1501 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1502 unsigned n_eq
, unsigned n_ineq
)
1504 struct isl_basic_map
*bmap
;
1509 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1513 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1516 isl_basic_map_free(base
);
1520 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1521 unsigned nparam
, unsigned dim
, unsigned extra
,
1522 unsigned n_eq
, unsigned n_ineq
)
1524 return (struct isl_basic_set
*)
1525 isl_basic_map_extend((struct isl_basic_map
*)base
,
1526 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1529 struct isl_basic_set
*isl_basic_set_extend_constraints(
1530 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1532 return (struct isl_basic_set
*)
1533 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1537 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1539 return (struct isl_basic_set
*)
1540 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1543 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1548 if (bmap
->ref
> 1) {
1550 bmap
= isl_basic_map_dup(bmap
);
1553 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1557 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1565 return isl_set_dup(set
);
1568 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1576 return isl_map_dup(map
);
1579 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1580 unsigned a_len
, unsigned b_len
)
1582 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1583 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1584 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1587 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1588 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1596 isl_assert(bmap
->ctx
,
1597 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1599 if (n1
== 0 || n2
== 0)
1602 bmap
= isl_basic_map_cow(bmap
);
1606 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1607 if (isl_blk_is_error(blk
))
1610 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1612 bmap
->eq
[i
] + pos
, n1
, n2
);
1614 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1616 bmap
->ineq
[i
] + pos
, n1
, n2
);
1618 for (i
= 0; i
< bmap
->n_div
; ++i
)
1620 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1622 isl_blk_free(bmap
->ctx
, blk
);
1624 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1625 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1626 return isl_basic_map_finalize(bmap
);
1628 isl_basic_map_free(bmap
);
1632 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1633 __isl_take isl_basic_set
*bset
, unsigned n
)
1641 nparam
= isl_basic_set_n_param(bset
);
1642 dim
= isl_basic_set_n_dim(bset
);
1643 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1645 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1647 isl_basic_set_free(bset
);
1651 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1657 total
= isl_basic_map_total_dim(bmap
);
1658 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1659 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1661 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1663 i
= isl_basic_map_alloc_equality(bmap
);
1667 isl_int_set_si(bmap
->eq
[i
][0], 1);
1668 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1669 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1670 isl_vec_free(bmap
->sample
);
1671 bmap
->sample
= NULL
;
1672 return isl_basic_map_finalize(bmap
);
1674 isl_basic_map_free(bmap
);
1678 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1680 return (struct isl_basic_set
*)
1681 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1684 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1687 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1689 isl_int
*t
= bmap
->div
[a
];
1690 bmap
->div
[a
] = bmap
->div
[b
];
1694 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1695 * div definitions accordingly.
1697 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1700 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1702 swap_div(bmap
, a
, b
);
1704 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1705 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1707 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1708 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1710 for (i
= 0; i
< bmap
->n_div
; ++i
)
1711 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1712 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1715 /* Eliminate the specified n dimensions starting at first from the
1716 * constraints, without removing the dimensions from the space.
1717 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1719 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1720 enum isl_dim_type type
, unsigned first
, unsigned n
)
1729 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1730 isl_die(map
->ctx
, isl_error_invalid
,
1731 "index out of bounds", goto error
);
1733 map
= isl_map_cow(map
);
1737 for (i
= 0; i
< map
->n
; ++i
) {
1738 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1748 /* Eliminate the specified n dimensions starting at first from the
1749 * constraints, without removing the dimensions from the space.
1750 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1752 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1753 enum isl_dim_type type
, unsigned first
, unsigned n
)
1755 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1758 /* Eliminate the specified n dimensions starting at first from the
1759 * constraints, without removing the dimensions from the space.
1760 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1762 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1763 unsigned first
, unsigned n
)
1765 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1768 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1769 __isl_take isl_basic_map
*bmap
)
1773 bmap
= isl_basic_map_eliminate_vars(bmap
,
1774 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1778 return isl_basic_map_finalize(bmap
);
1781 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1782 __isl_take isl_basic_set
*bset
)
1784 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1785 (struct isl_basic_map
*)bset
);
1788 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1797 map
= isl_map_cow(map
);
1801 for (i
= 0; i
< map
->n
; ++i
) {
1802 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1812 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1814 return isl_map_remove_divs(set
);
1817 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1818 enum isl_dim_type type
, unsigned first
, unsigned n
)
1822 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1824 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1826 bmap
= isl_basic_map_eliminate_vars(bmap
,
1827 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1830 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1832 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1835 isl_basic_map_free(bmap
);
1839 /* Return true if the definition of the given div (recursively) involves
1840 * any of the given variables.
1842 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1843 unsigned first
, unsigned n
)
1846 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1848 if (isl_int_is_zero(bmap
->div
[div
][0]))
1850 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1853 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1854 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1856 if (div_involves_vars(bmap
, i
, first
, n
))
1863 /* Try and add a lower and/or upper bound on "div" to "bmap"
1864 * based on inequality "i".
1865 * "total" is the total number of variables (excluding the divs).
1866 * "v" is a temporary object that can be used during the calculations.
1867 * If "lb" is set, then a lower bound should be constructed.
1868 * If "ub" is set, then an upper bound should be constructed.
1870 * The calling function has already checked that the inequality does not
1871 * reference "div", but we still need to check that the inequality is
1872 * of the right form. We'll consider the case where we want to construct
1873 * a lower bound. The construction of upper bounds is similar.
1875 * Let "div" be of the form
1877 * q = floor((a + f(x))/d)
1879 * We essentially check if constraint "i" is of the form
1883 * so that we can use it to derive a lower bound on "div".
1884 * However, we allow a slightly more general form
1888 * with the condition that the coefficients of g(x) - f(x) are all
1890 * Rewriting this constraint as
1894 * adding a + f(x) to both sides and dividing by d, we obtain
1896 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1898 * Taking the floor on both sides, we obtain
1900 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1904 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1906 * In the case of an upper bound, we construct the constraint
1908 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1911 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1912 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1913 unsigned total
, isl_int v
, int lb
, int ub
)
1917 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1919 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1920 bmap
->div
[div
][1 + 1 + j
]);
1921 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1924 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1925 bmap
->div
[div
][1 + 1 + j
]);
1926 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1932 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1934 int k
= isl_basic_map_alloc_inequality(bmap
);
1937 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1938 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1939 bmap
->div
[div
][1 + j
]);
1940 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1941 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1943 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1946 int k
= isl_basic_map_alloc_inequality(bmap
);
1949 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1950 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1951 bmap
->div
[div
][1 + j
]);
1952 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1953 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1955 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1960 isl_basic_map_free(bmap
);
1964 /* This function is called right before "div" is eliminated from "bmap"
1965 * using Fourier-Motzkin.
1966 * Look through the constraints of "bmap" for constraints on the argument
1967 * of the integer division and use them to construct constraints on the
1968 * integer division itself. These constraints can then be combined
1969 * during the Fourier-Motzkin elimination.
1970 * Note that it is only useful to introduce lower bounds on "div"
1971 * if "bmap" already contains upper bounds on "div" as the newly
1972 * introduce lower bounds can then be combined with the pre-existing
1973 * upper bounds. Similarly for upper bounds.
1974 * We therefore first check if "bmap" contains any lower and/or upper bounds
1977 * It is interesting to note that the introduction of these constraints
1978 * can indeed lead to more accurate results, even when compared to
1979 * deriving constraints on the argument of "div" from constraints on "div".
1980 * Consider, for example, the set
1982 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1984 * The second constraint can be rewritten as
1986 * 2 * [(-i-2j+3)/4] + k >= 0
1988 * from which we can derive
1990 * -i - 2j + 3 >= -2k
1996 * Combined with the first constraint, we obtain
1998 * -3 <= 3 + 2k or k >= -3
2000 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2001 * the first constraint, we obtain
2003 * [(i + 2j)/4] >= [-3/4] = -1
2005 * Combining this constraint with the second constraint, we obtain
2009 static __isl_give isl_basic_map
*insert_bounds_on_div(
2010 __isl_take isl_basic_map
*bmap
, int div
)
2013 int check_lb
, check_ub
;
2020 if (isl_int_is_zero(bmap
->div
[div
][0]))
2023 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2027 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2028 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2035 if (!check_lb
&& !check_ub
)
2040 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2041 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2044 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2045 check_lb
, check_ub
);
2053 /* Remove all divs (recursively) involving any of the given dimensions
2054 * in their definitions.
2056 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2057 __isl_take isl_basic_map
*bmap
,
2058 enum isl_dim_type type
, unsigned first
, unsigned n
)
2064 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2066 first
+= isl_basic_map_offset(bmap
, type
);
2068 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2069 if (!div_involves_vars(bmap
, i
, first
, n
))
2071 bmap
= insert_bounds_on_div(bmap
, i
);
2072 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2080 isl_basic_map_free(bmap
);
2084 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2085 __isl_take isl_basic_set
*bset
,
2086 enum isl_dim_type type
, unsigned first
, unsigned n
)
2088 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2091 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2092 enum isl_dim_type type
, unsigned first
, unsigned n
)
2101 map
= isl_map_cow(map
);
2105 for (i
= 0; i
< map
->n
; ++i
) {
2106 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2117 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2118 enum isl_dim_type type
, unsigned first
, unsigned n
)
2120 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2124 /* Does the desciption of "bmap" depend on the specified dimensions?
2125 * We also check whether the dimensions appear in any of the div definitions.
2126 * In principle there is no need for this check. If the dimensions appear
2127 * in a div definition, they also appear in the defining constraints of that
2130 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2131 enum isl_dim_type type
, unsigned first
, unsigned n
)
2138 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2139 isl_die(bmap
->ctx
, isl_error_invalid
,
2140 "index out of bounds", return -1);
2142 first
+= isl_basic_map_offset(bmap
, type
);
2143 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2144 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2146 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2147 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2149 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2150 if (isl_int_is_zero(bmap
->div
[i
][0]))
2152 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2159 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2160 enum isl_dim_type type
, unsigned first
, unsigned n
)
2167 if (first
+ n
> isl_map_dim(map
, type
))
2168 isl_die(map
->ctx
, isl_error_invalid
,
2169 "index out of bounds", return -1);
2171 for (i
= 0; i
< map
->n
; ++i
) {
2172 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2174 if (involves
< 0 || involves
)
2181 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2182 enum isl_dim_type type
, unsigned first
, unsigned n
)
2184 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2187 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2188 enum isl_dim_type type
, unsigned first
, unsigned n
)
2190 return isl_map_involves_dims(set
, type
, first
, n
);
2193 /* Return true if the definition of the given div is unknown or depends
2196 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2199 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2201 if (isl_int_is_zero(bmap
->div
[div
][0]))
2204 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2205 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2207 if (div_is_unknown(bmap
, i
))
2214 /* Remove all divs that are unknown or defined in terms of unknown divs.
2216 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2217 __isl_take isl_basic_map
*bmap
)
2224 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2225 if (!div_is_unknown(bmap
, i
))
2227 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2236 /* Remove all divs that are unknown or defined in terms of unknown divs.
2238 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2239 __isl_take isl_basic_set
*bset
)
2241 return isl_basic_map_remove_unknown_divs(bset
);
2244 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2253 map
= isl_map_cow(map
);
2257 for (i
= 0; i
< map
->n
; ++i
) {
2258 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2268 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2270 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2273 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2274 __isl_take isl_basic_set
*bset
,
2275 enum isl_dim_type type
, unsigned first
, unsigned n
)
2277 return (isl_basic_set
*)
2278 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2281 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2282 enum isl_dim_type type
, unsigned first
, unsigned n
)
2289 map
= isl_map_cow(map
);
2292 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2294 for (i
= 0; i
< map
->n
; ++i
) {
2295 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2296 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2300 map
= isl_map_drop(map
, type
, first
, n
);
2307 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2308 enum isl_dim_type type
, unsigned first
, unsigned n
)
2310 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2313 /* Project out n inputs starting at first using Fourier-Motzkin */
2314 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2315 unsigned first
, unsigned n
)
2317 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2320 static void dump_term(struct isl_basic_map
*bmap
,
2321 isl_int c
, int pos
, FILE *out
)
2324 unsigned in
= isl_basic_map_n_in(bmap
);
2325 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2326 unsigned nparam
= isl_basic_map_n_param(bmap
);
2328 isl_int_print(out
, c
, 0);
2330 if (!isl_int_is_one(c
))
2331 isl_int_print(out
, c
, 0);
2332 if (pos
< 1 + nparam
) {
2333 name
= isl_space_get_dim_name(bmap
->dim
,
2334 isl_dim_param
, pos
- 1);
2336 fprintf(out
, "%s", name
);
2338 fprintf(out
, "p%d", pos
- 1);
2339 } else if (pos
< 1 + nparam
+ in
)
2340 fprintf(out
, "i%d", pos
- 1 - nparam
);
2341 else if (pos
< 1 + nparam
+ dim
)
2342 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2344 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2348 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2349 int sign
, FILE *out
)
2353 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2357 for (i
= 0, first
= 1; i
< len
; ++i
) {
2358 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2361 fprintf(out
, " + ");
2363 isl_int_abs(v
, c
[i
]);
2364 dump_term(bmap
, v
, i
, out
);
2371 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2372 const char *op
, FILE *out
, int indent
)
2376 fprintf(out
, "%*s", indent
, "");
2378 dump_constraint_sign(bmap
, c
, 1, out
);
2379 fprintf(out
, " %s ", op
);
2380 dump_constraint_sign(bmap
, c
, -1, out
);
2384 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2385 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2387 fprintf(out
, "%*s", indent
, "");
2388 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2393 static void dump_constraints(struct isl_basic_map
*bmap
,
2394 isl_int
**c
, unsigned n
,
2395 const char *op
, FILE *out
, int indent
)
2399 for (i
= 0; i
< n
; ++i
)
2400 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2403 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2407 unsigned total
= isl_basic_map_total_dim(bmap
);
2409 for (j
= 0; j
< 1 + total
; ++j
) {
2410 if (isl_int_is_zero(exp
[j
]))
2412 if (!first
&& isl_int_is_pos(exp
[j
]))
2414 dump_term(bmap
, exp
[j
], j
, out
);
2419 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2423 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2424 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2426 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2427 fprintf(out
, "%*s", indent
, "");
2428 fprintf(out
, "e%d = [(", i
);
2429 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2431 isl_int_print(out
, bmap
->div
[i
][0], 0);
2432 fprintf(out
, "]\n");
2436 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2437 FILE *out
, int indent
)
2440 fprintf(out
, "null basic set\n");
2444 fprintf(out
, "%*s", indent
, "");
2445 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2446 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2447 bset
->extra
, bset
->flags
);
2448 dump((struct isl_basic_map
*)bset
, out
, indent
);
2451 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2452 FILE *out
, int indent
)
2455 fprintf(out
, "null basic map\n");
2459 fprintf(out
, "%*s", indent
, "");
2460 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2461 "flags: %x, n_name: %d\n",
2463 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2464 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2465 dump(bmap
, out
, indent
);
2468 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2473 total
= isl_basic_map_total_dim(bmap
);
2474 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2475 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2476 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2477 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2481 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2484 struct isl_set
*set
;
2488 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2489 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2490 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2491 sizeof(struct isl_set
) +
2492 (n
- 1) * sizeof(struct isl_basic_set
*));
2496 set
->ctx
= dim
->ctx
;
2497 isl_ctx_ref(set
->ctx
);
2505 isl_space_free(dim
);
2509 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2510 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2512 struct isl_set
*set
;
2515 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2519 set
= isl_set_alloc_space(dims
, n
, flags
);
2523 /* Make sure "map" has room for at least "n" more basic maps.
2525 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2528 struct isl_map
*grown
= NULL
;
2532 isl_assert(map
->ctx
, n
>= 0, goto error
);
2533 if (map
->n
+ n
<= map
->size
)
2535 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2538 for (i
= 0; i
< map
->n
; ++i
) {
2539 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2547 isl_map_free(grown
);
2552 /* Make sure "set" has room for at least "n" more basic sets.
2554 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2556 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2559 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2562 struct isl_set
*dup
;
2567 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2570 for (i
= 0; i
< set
->n
; ++i
)
2571 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2575 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2577 return isl_map_from_basic_map(bset
);
2580 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2582 struct isl_map
*map
;
2587 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2588 return isl_map_add_basic_map(map
, bmap
);
2591 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2592 __isl_take isl_basic_set
*bset
)
2594 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2595 (struct isl_basic_map
*)bset
);
2598 void *isl_set_free(__isl_take isl_set
*set
)
2608 isl_ctx_deref(set
->ctx
);
2609 for (i
= 0; i
< set
->n
; ++i
)
2610 isl_basic_set_free(set
->p
[i
]);
2611 isl_space_free(set
->dim
);
2617 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2622 fprintf(out
, "null set\n");
2626 fprintf(out
, "%*s", indent
, "");
2627 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2628 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2630 for (i
= 0; i
< set
->n
; ++i
) {
2631 fprintf(out
, "%*s", indent
, "");
2632 fprintf(out
, "basic set %d:\n", i
);
2633 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2637 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2642 fprintf(out
, "null map\n");
2646 fprintf(out
, "%*s", indent
, "");
2647 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2648 "flags: %x, n_name: %d\n",
2649 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2650 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2651 for (i
= 0; i
< map
->n
; ++i
) {
2652 fprintf(out
, "%*s", indent
, "");
2653 fprintf(out
, "basic map %d:\n", i
);
2654 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2658 struct isl_basic_map
*isl_basic_map_intersect_domain(
2659 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2661 struct isl_basic_map
*bmap_domain
;
2666 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2667 bset
->dim
, isl_dim_param
), goto error
);
2669 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2670 isl_assert(bset
->ctx
,
2671 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2673 bmap
= isl_basic_map_cow(bmap
);
2676 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2677 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2678 bmap_domain
= isl_basic_map_from_domain(bset
);
2679 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2681 bmap
= isl_basic_map_simplify(bmap
);
2682 return isl_basic_map_finalize(bmap
);
2684 isl_basic_map_free(bmap
);
2685 isl_basic_set_free(bset
);
2689 struct isl_basic_map
*isl_basic_map_intersect_range(
2690 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2692 struct isl_basic_map
*bmap_range
;
2697 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2698 bset
->dim
, isl_dim_param
), goto error
);
2700 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2701 isl_assert(bset
->ctx
,
2702 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2704 if (isl_basic_set_is_universe(bset
)) {
2705 isl_basic_set_free(bset
);
2709 bmap
= isl_basic_map_cow(bmap
);
2712 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2713 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2714 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2715 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2717 bmap
= isl_basic_map_simplify(bmap
);
2718 return isl_basic_map_finalize(bmap
);
2720 isl_basic_map_free(bmap
);
2721 isl_basic_set_free(bset
);
2725 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2734 total
= 1 + isl_basic_map_total_dim(bmap
);
2735 if (total
!= vec
->size
)
2740 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2741 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2742 if (!isl_int_is_zero(s
)) {
2748 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2749 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2750 if (isl_int_is_neg(s
)) {
2761 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2763 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2766 struct isl_basic_map
*isl_basic_map_intersect(
2767 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2769 struct isl_vec
*sample
= NULL
;
2771 if (!bmap1
|| !bmap2
)
2774 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2775 bmap2
->dim
, isl_dim_param
), goto error
);
2776 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2777 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2778 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2779 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2780 return isl_basic_map_intersect(bmap2
, bmap1
);
2782 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2783 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2784 isl_assert(bmap1
->ctx
,
2785 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2787 if (bmap1
->sample
&&
2788 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2789 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2790 sample
= isl_vec_copy(bmap1
->sample
);
2791 else if (bmap2
->sample
&&
2792 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2793 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2794 sample
= isl_vec_copy(bmap2
->sample
);
2796 bmap1
= isl_basic_map_cow(bmap1
);
2799 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2800 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2801 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2804 isl_vec_free(sample
);
2806 isl_vec_free(bmap1
->sample
);
2807 bmap1
->sample
= sample
;
2810 bmap1
= isl_basic_map_simplify(bmap1
);
2811 return isl_basic_map_finalize(bmap1
);
2814 isl_vec_free(sample
);
2815 isl_basic_map_free(bmap1
);
2816 isl_basic_map_free(bmap2
);
2820 struct isl_basic_set
*isl_basic_set_intersect(
2821 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2823 return (struct isl_basic_set
*)
2824 isl_basic_map_intersect(
2825 (struct isl_basic_map
*)bset1
,
2826 (struct isl_basic_map
*)bset2
);
2829 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2830 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2832 return isl_basic_set_intersect(bset1
, bset2
);
2835 /* Special case of isl_map_intersect, where both map1 and map2
2836 * are convex, without any divs and such that either map1 or map2
2837 * contains a single constraint. This constraint is then simply
2838 * added to the other map.
2840 static __isl_give isl_map
*map_intersect_add_constraint(
2841 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2843 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2844 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2845 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2846 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2848 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2849 return isl_map_intersect(map2
, map1
);
2851 isl_assert(map2
->ctx
,
2852 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2854 map1
= isl_map_cow(map1
);
2857 if (isl_map_plain_is_empty(map1
)) {
2861 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2862 if (map2
->p
[0]->n_eq
== 1)
2863 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2865 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2866 map2
->p
[0]->ineq
[0]);
2868 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2869 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2873 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2874 isl_basic_map_free(map1
->p
[0]);
2887 /* map2 may be either a parameter domain or a map living in the same
2890 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2891 __isl_take isl_map
*map2
)
2900 if ((isl_map_plain_is_empty(map1
) ||
2901 isl_map_plain_is_universe(map2
)) &&
2902 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2906 if ((isl_map_plain_is_empty(map2
) ||
2907 isl_map_plain_is_universe(map1
)) &&
2908 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2913 if (map1
->n
== 1 && map2
->n
== 1 &&
2914 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2915 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2916 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2917 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2918 return map_intersect_add_constraint(map1
, map2
);
2920 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2921 isl_space_dim(map2
->dim
, isl_dim_param
))
2922 isl_assert(map1
->ctx
,
2923 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2925 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2926 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2927 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2929 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2930 map1
->n
* map2
->n
, flags
);
2933 for (i
= 0; i
< map1
->n
; ++i
)
2934 for (j
= 0; j
< map2
->n
; ++j
) {
2935 struct isl_basic_map
*part
;
2936 part
= isl_basic_map_intersect(
2937 isl_basic_map_copy(map1
->p
[i
]),
2938 isl_basic_map_copy(map2
->p
[j
]));
2939 if (isl_basic_map_is_empty(part
) < 0)
2940 part
= isl_basic_map_free(part
);
2941 result
= isl_map_add_basic_map(result
, part
);
2954 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2955 __isl_take isl_map
*map2
)
2959 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2960 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2961 "spaces don't match", goto error
);
2962 return map_intersect_internal(map1
, map2
);
2969 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2970 __isl_take isl_map
*map2
)
2972 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2975 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2977 return (struct isl_set
*)
2978 isl_map_intersect((struct isl_map
*)set1
,
2979 (struct isl_map
*)set2
);
2982 /* map_intersect_internal accepts intersections
2983 * with parameter domains, so we can just call that function.
2985 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2986 __isl_take isl_set
*params
)
2988 return map_intersect_internal(map
, params
);
2991 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2992 __isl_take isl_map
*map2
)
2994 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2997 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2998 __isl_take isl_set
*params
)
3000 return isl_map_intersect_params(set
, params
);
3003 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3006 struct isl_basic_set
*bset
;
3011 bmap
= isl_basic_map_cow(bmap
);
3014 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3015 in
= isl_basic_map_n_in(bmap
);
3016 bset
= isl_basic_set_from_basic_map(bmap
);
3017 bset
= isl_basic_set_swap_vars(bset
, in
);
3018 return isl_basic_map_from_basic_set(bset
, dim
);
3021 static __isl_give isl_basic_map
*basic_map_space_reset(
3022 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3028 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3031 space
= isl_basic_map_get_space(bmap
);
3032 space
= isl_space_reset(space
, type
);
3033 bmap
= isl_basic_map_reset_space(bmap
, space
);
3037 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3038 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3039 unsigned pos
, unsigned n
)
3042 struct isl_basic_map
*res
;
3043 struct isl_dim_map
*dim_map
;
3044 unsigned total
, off
;
3045 enum isl_dim_type t
;
3048 return basic_map_space_reset(bmap
, type
);
3053 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3055 total
= isl_basic_map_total_dim(bmap
) + n
;
3056 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3058 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3060 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3062 unsigned size
= isl_basic_map_dim(bmap
, t
);
3063 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3065 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3066 pos
, size
- pos
, off
+ pos
+ n
);
3068 off
+= isl_space_dim(res_dim
, t
);
3070 isl_dim_map_div(dim_map
, bmap
, off
);
3072 res
= isl_basic_map_alloc_space(res_dim
,
3073 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3074 if (isl_basic_map_is_rational(bmap
))
3075 res
= isl_basic_map_set_rational(res
);
3076 if (isl_basic_map_plain_is_empty(bmap
)) {
3077 isl_basic_map_free(bmap
);
3079 return isl_basic_map_set_to_empty(res
);
3081 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3082 return isl_basic_map_finalize(res
);
3085 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3086 __isl_take isl_basic_set
*bset
,
3087 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3089 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3092 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3093 enum isl_dim_type type
, unsigned n
)
3097 return isl_basic_map_insert_dims(bmap
, type
,
3098 isl_basic_map_dim(bmap
, type
), n
);
3101 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3102 enum isl_dim_type type
, unsigned n
)
3106 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3107 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3109 isl_basic_set_free(bset
);
3113 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3114 enum isl_dim_type type
)
3118 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3121 space
= isl_map_get_space(map
);
3122 space
= isl_space_reset(space
, type
);
3123 map
= isl_map_reset_space(map
, space
);
3127 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3128 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3133 return map_space_reset(map
, type
);
3135 map
= isl_map_cow(map
);
3139 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3143 for (i
= 0; i
< map
->n
; ++i
) {
3144 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3155 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3156 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3158 return isl_map_insert_dims(set
, type
, pos
, n
);
3161 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3162 enum isl_dim_type type
, unsigned n
)
3166 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3169 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3170 enum isl_dim_type type
, unsigned n
)
3174 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3175 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3181 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3182 __isl_take isl_basic_map
*bmap
,
3183 enum isl_dim_type dst_type
, unsigned dst_pos
,
3184 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3186 struct isl_dim_map
*dim_map
;
3187 struct isl_basic_map
*res
;
3188 enum isl_dim_type t
;
3189 unsigned total
, off
;
3196 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3199 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3202 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3204 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3205 pos(bmap
->dim
, src_type
) + src_pos
+
3206 ((src_type
< dst_type
) ? n
: 0)) {
3207 bmap
= isl_basic_map_cow(bmap
);
3211 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3212 src_type
, src_pos
, n
);
3216 bmap
= isl_basic_map_finalize(bmap
);
3221 total
= isl_basic_map_total_dim(bmap
);
3222 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3225 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3226 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3227 if (t
== dst_type
) {
3228 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3231 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3234 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3235 dst_pos
, size
- dst_pos
, off
);
3236 off
+= size
- dst_pos
;
3237 } else if (t
== src_type
) {
3238 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3241 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3242 src_pos
+ n
, size
- src_pos
- n
, off
);
3243 off
+= size
- src_pos
- n
;
3245 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3249 isl_dim_map_div(dim_map
, bmap
, off
);
3251 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3252 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3253 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3257 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3258 src_type
, src_pos
, n
);
3262 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3263 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3264 bmap
= isl_basic_map_finalize(bmap
);
3268 isl_basic_map_free(bmap
);
3272 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3273 enum isl_dim_type dst_type
, unsigned dst_pos
,
3274 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3276 return (isl_basic_set
*)isl_basic_map_move_dims(
3277 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3280 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3281 enum isl_dim_type dst_type
, unsigned dst_pos
,
3282 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3286 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3287 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3288 src_type
, src_pos
, n
);
3294 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3295 enum isl_dim_type dst_type
, unsigned dst_pos
,
3296 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3305 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3308 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3311 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3313 map
= isl_map_cow(map
);
3317 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3321 for (i
= 0; i
< map
->n
; ++i
) {
3322 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3324 src_type
, src_pos
, n
);
3335 /* Move the specified dimensions to the last columns right before
3336 * the divs. Don't change the dimension specification of bmap.
3337 * That's the responsibility of the caller.
3339 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3340 enum isl_dim_type type
, unsigned first
, unsigned n
)
3342 struct isl_dim_map
*dim_map
;
3343 struct isl_basic_map
*res
;
3344 enum isl_dim_type t
;
3345 unsigned total
, off
;
3349 if (pos(bmap
->dim
, type
) + first
+ n
==
3350 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3353 total
= isl_basic_map_total_dim(bmap
);
3354 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3357 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3358 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3360 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3363 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3364 first
, n
, total
- bmap
->n_div
- n
);
3365 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3366 first
+ n
, size
- (first
+ n
), off
);
3367 off
+= size
- (first
+ n
);
3369 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3373 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3375 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3376 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3377 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3381 /* Insert "n" rows in the divs of "bmap".
3383 * The number of columns is not changed, which means that the last
3384 * dimensions of "bmap" are being reintepreted as the new divs.
3385 * The space of "bmap" is not adjusted, however, which means
3386 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3387 * from the space of "bmap" is the responsibility of the caller.
3389 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3397 bmap
= isl_basic_map_cow(bmap
);
3401 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3402 old
= bmap
->block2
.data
;
3403 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3404 (bmap
->extra
+ n
) * (1 + row_size
));
3405 if (!bmap
->block2
.data
)
3406 return isl_basic_map_free(bmap
);
3407 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3409 return isl_basic_map_free(bmap
);
3410 for (i
= 0; i
< n
; ++i
) {
3411 new_div
[i
] = bmap
->block2
.data
+
3412 (bmap
->extra
+ i
) * (1 + row_size
);
3413 isl_seq_clr(new_div
[i
], 1 + row_size
);
3415 for (i
= 0; i
< bmap
->extra
; ++i
)
3416 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3418 bmap
->div
= new_div
;
3425 /* Turn the n dimensions of type type, starting at first
3426 * into existentially quantified variables.
3428 __isl_give isl_basic_map
*isl_basic_map_project_out(
3429 __isl_take isl_basic_map
*bmap
,
3430 enum isl_dim_type type
, unsigned first
, unsigned n
)
3433 return basic_map_space_reset(bmap
, type
);
3438 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3439 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3441 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3444 bmap
= move_last(bmap
, type
, first
, n
);
3445 bmap
= isl_basic_map_cow(bmap
);
3446 bmap
= insert_div_rows(bmap
, n
);
3450 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3453 bmap
= isl_basic_map_simplify(bmap
);
3454 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3455 return isl_basic_map_finalize(bmap
);
3457 isl_basic_map_free(bmap
);
3461 /* Turn the n dimensions of type type, starting at first
3462 * into existentially quantified variables.
3464 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3465 enum isl_dim_type type
, unsigned first
, unsigned n
)
3467 return (isl_basic_set
*)isl_basic_map_project_out(
3468 (isl_basic_map
*)bset
, type
, first
, n
);
3471 /* Turn the n dimensions of type type, starting at first
3472 * into existentially quantified variables.
3474 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3475 enum isl_dim_type type
, unsigned first
, unsigned n
)
3483 return map_space_reset(map
, type
);
3485 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3487 map
= isl_map_cow(map
);
3491 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3495 for (i
= 0; i
< map
->n
; ++i
) {
3496 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3507 /* Turn the n dimensions of type type, starting at first
3508 * into existentially quantified variables.
3510 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3511 enum isl_dim_type type
, unsigned first
, unsigned n
)
3513 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3516 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3520 for (i
= 0; i
< n
; ++i
) {
3521 j
= isl_basic_map_alloc_div(bmap
);
3524 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3528 isl_basic_map_free(bmap
);
3532 struct isl_basic_map
*isl_basic_map_apply_range(
3533 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3535 isl_space
*dim_result
= NULL
;
3536 struct isl_basic_map
*bmap
;
3537 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3538 struct isl_dim_map
*dim_map1
, *dim_map2
;
3540 if (!bmap1
|| !bmap2
)
3542 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3543 bmap2
->dim
, isl_dim_param
))
3544 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3545 "parameters don't match", goto error
);
3546 if (!isl_space_tuple_match(bmap1
->dim
, isl_dim_out
,
3547 bmap2
->dim
, isl_dim_in
))
3548 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3549 "spaces don't match", goto error
);
3551 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3552 isl_space_copy(bmap2
->dim
));
3554 n_in
= isl_basic_map_n_in(bmap1
);
3555 n_out
= isl_basic_map_n_out(bmap2
);
3556 n
= isl_basic_map_n_out(bmap1
);
3557 nparam
= isl_basic_map_n_param(bmap1
);
3559 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3560 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3561 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3562 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3563 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3564 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3565 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3566 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3567 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3568 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3569 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3571 bmap
= isl_basic_map_alloc_space(dim_result
,
3572 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3573 bmap1
->n_eq
+ bmap2
->n_eq
,
3574 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3575 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3576 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3577 bmap
= add_divs(bmap
, n
);
3578 bmap
= isl_basic_map_simplify(bmap
);
3579 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3580 return isl_basic_map_finalize(bmap
);
3582 isl_basic_map_free(bmap1
);
3583 isl_basic_map_free(bmap2
);
3587 struct isl_basic_set
*isl_basic_set_apply(
3588 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3593 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3596 return (struct isl_basic_set
*)
3597 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3599 isl_basic_set_free(bset
);
3600 isl_basic_map_free(bmap
);
3604 struct isl_basic_map
*isl_basic_map_apply_domain(
3605 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3607 if (!bmap1
|| !bmap2
)
3610 isl_assert(bmap1
->ctx
,
3611 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3612 isl_assert(bmap1
->ctx
,
3613 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3616 bmap1
= isl_basic_map_reverse(bmap1
);
3617 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3618 return isl_basic_map_reverse(bmap1
);
3620 isl_basic_map_free(bmap1
);
3621 isl_basic_map_free(bmap2
);
3625 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3626 * A \cap B -> f(A) + f(B)
3628 struct isl_basic_map
*isl_basic_map_sum(
3629 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3631 unsigned n_in
, n_out
, nparam
, total
, pos
;
3632 struct isl_basic_map
*bmap
= NULL
;
3633 struct isl_dim_map
*dim_map1
, *dim_map2
;
3636 if (!bmap1
|| !bmap2
)
3639 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3642 nparam
= isl_basic_map_n_param(bmap1
);
3643 n_in
= isl_basic_map_n_in(bmap1
);
3644 n_out
= isl_basic_map_n_out(bmap1
);
3646 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3647 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3648 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3649 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3650 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3651 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3652 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3653 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3654 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3655 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3656 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3658 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3659 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3660 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3661 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3662 for (i
= 0; i
< n_out
; ++i
) {
3663 int j
= isl_basic_map_alloc_equality(bmap
);
3666 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3667 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3668 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3669 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3671 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3672 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3673 bmap
= add_divs(bmap
, 2 * n_out
);
3675 bmap
= isl_basic_map_simplify(bmap
);
3676 return isl_basic_map_finalize(bmap
);
3678 isl_basic_map_free(bmap
);
3679 isl_basic_map_free(bmap1
);
3680 isl_basic_map_free(bmap2
);
3684 /* Given two maps A -> f(A) and B -> g(B), construct a map
3685 * A \cap B -> f(A) + f(B)
3687 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3689 struct isl_map
*result
;
3695 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3697 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3698 map1
->n
* map2
->n
, 0);
3701 for (i
= 0; i
< map1
->n
; ++i
)
3702 for (j
= 0; j
< map2
->n
; ++j
) {
3703 struct isl_basic_map
*part
;
3704 part
= isl_basic_map_sum(
3705 isl_basic_map_copy(map1
->p
[i
]),
3706 isl_basic_map_copy(map2
->p
[j
]));
3707 if (isl_basic_map_is_empty(part
))
3708 isl_basic_map_free(part
);
3710 result
= isl_map_add_basic_map(result
, part
);
3723 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3724 __isl_take isl_set
*set2
)
3726 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3729 /* Given a basic map A -> f(A), construct A -> -f(A).
3731 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3736 bmap
= isl_basic_map_cow(bmap
);
3740 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3741 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3742 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3743 for (j
= 0; j
< n
; ++j
)
3744 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3745 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3746 for (j
= 0; j
< n
; ++j
)
3747 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3748 for (i
= 0; i
< bmap
->n_div
; ++i
)
3749 for (j
= 0; j
< n
; ++j
)
3750 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3751 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3752 return isl_basic_map_finalize(bmap
);
3755 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3757 return isl_basic_map_neg(bset
);
3760 /* Given a map A -> f(A), construct A -> -f(A).
3762 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3766 map
= isl_map_cow(map
);
3770 for (i
= 0; i
< map
->n
; ++i
) {
3771 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3782 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3784 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3787 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3788 * A -> floor(f(A)/d).
3790 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3793 unsigned n_in
, n_out
, nparam
, total
, pos
;
3794 struct isl_basic_map
*result
= NULL
;
3795 struct isl_dim_map
*dim_map
;
3801 nparam
= isl_basic_map_n_param(bmap
);
3802 n_in
= isl_basic_map_n_in(bmap
);
3803 n_out
= isl_basic_map_n_out(bmap
);
3805 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3806 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3807 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3808 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3809 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3810 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3812 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3813 bmap
->n_div
+ n_out
,
3814 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3815 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3816 result
= add_divs(result
, n_out
);
3817 for (i
= 0; i
< n_out
; ++i
) {
3819 j
= isl_basic_map_alloc_inequality(result
);
3822 isl_seq_clr(result
->ineq
[j
], 1+total
);
3823 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3824 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3825 j
= isl_basic_map_alloc_inequality(result
);
3828 isl_seq_clr(result
->ineq
[j
], 1+total
);
3829 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3830 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3831 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3834 result
= isl_basic_map_simplify(result
);
3835 return isl_basic_map_finalize(result
);
3837 isl_basic_map_free(result
);
3841 /* Given a map A -> f(A) and an integer d, construct a map
3842 * A -> floor(f(A)/d).
3844 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3848 map
= isl_map_cow(map
);
3852 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3853 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3854 for (i
= 0; i
< map
->n
; ++i
) {
3855 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3866 /* Given a map A -> f(A) and an integer d, construct a map
3867 * A -> floor(f(A)/d).
3869 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
3870 __isl_take isl_val
*d
)
3874 if (!isl_val_is_int(d
))
3875 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
3876 "expecting integer denominator", goto error
);
3877 map
= isl_map_floordiv(map
, d
->n
);
3886 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3892 i
= isl_basic_map_alloc_equality(bmap
);
3895 nparam
= isl_basic_map_n_param(bmap
);
3896 n_in
= isl_basic_map_n_in(bmap
);
3897 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3898 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3899 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3900 return isl_basic_map_finalize(bmap
);
3902 isl_basic_map_free(bmap
);
3906 /* Add a constraints to "bmap" expressing i_pos < o_pos
3908 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3914 i
= isl_basic_map_alloc_inequality(bmap
);
3917 nparam
= isl_basic_map_n_param(bmap
);
3918 n_in
= isl_basic_map_n_in(bmap
);
3919 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3920 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3921 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3922 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3923 return isl_basic_map_finalize(bmap
);
3925 isl_basic_map_free(bmap
);
3929 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3931 static __isl_give isl_basic_map
*var_less_or_equal(
3932 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3938 i
= isl_basic_map_alloc_inequality(bmap
);
3941 nparam
= isl_basic_map_n_param(bmap
);
3942 n_in
= isl_basic_map_n_in(bmap
);
3943 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3944 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3945 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3946 return isl_basic_map_finalize(bmap
);
3948 isl_basic_map_free(bmap
);
3952 /* Add a constraints to "bmap" expressing i_pos > o_pos
3954 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3960 i
= isl_basic_map_alloc_inequality(bmap
);
3963 nparam
= isl_basic_map_n_param(bmap
);
3964 n_in
= isl_basic_map_n_in(bmap
);
3965 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3966 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3967 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3968 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3969 return isl_basic_map_finalize(bmap
);
3971 isl_basic_map_free(bmap
);
3975 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3977 static __isl_give isl_basic_map
*var_more_or_equal(
3978 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3984 i
= isl_basic_map_alloc_inequality(bmap
);
3987 nparam
= isl_basic_map_n_param(bmap
);
3988 n_in
= isl_basic_map_n_in(bmap
);
3989 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3990 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3991 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3992 return isl_basic_map_finalize(bmap
);
3994 isl_basic_map_free(bmap
);
3998 __isl_give isl_basic_map
*isl_basic_map_equal(
3999 __isl_take isl_space
*dim
, unsigned n_equal
)
4002 struct isl_basic_map
*bmap
;
4003 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4006 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4007 bmap
= var_equal(bmap
, i
);
4008 return isl_basic_map_finalize(bmap
);
4011 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4013 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4017 struct isl_basic_map
*bmap
;
4018 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4021 for (i
= 0; i
< pos
&& bmap
; ++i
)
4022 bmap
= var_equal(bmap
, i
);
4024 bmap
= var_less(bmap
, pos
);
4025 return isl_basic_map_finalize(bmap
);
4028 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4030 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4031 __isl_take isl_space
*dim
, unsigned pos
)
4034 isl_basic_map
*bmap
;
4036 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4037 for (i
= 0; i
< pos
; ++i
)
4038 bmap
= var_equal(bmap
, i
);
4039 bmap
= var_less_or_equal(bmap
, pos
);
4040 return isl_basic_map_finalize(bmap
);
4043 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4045 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4049 struct isl_basic_map
*bmap
;
4050 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4053 for (i
= 0; i
< pos
&& bmap
; ++i
)
4054 bmap
= var_equal(bmap
, i
);
4056 bmap
= var_more(bmap
, pos
);
4057 return isl_basic_map_finalize(bmap
);
4060 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4062 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4063 __isl_take isl_space
*dim
, unsigned pos
)
4066 isl_basic_map
*bmap
;
4068 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4069 for (i
= 0; i
< pos
; ++i
)
4070 bmap
= var_equal(bmap
, i
);
4071 bmap
= var_more_or_equal(bmap
, pos
);
4072 return isl_basic_map_finalize(bmap
);
4075 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4076 unsigned n
, int equal
)
4078 struct isl_map
*map
;
4081 if (n
== 0 && equal
)
4082 return isl_map_universe(dims
);
4084 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4086 for (i
= 0; i
+ 1 < n
; ++i
)
4087 map
= isl_map_add_basic_map(map
,
4088 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4091 map
= isl_map_add_basic_map(map
,
4092 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4094 map
= isl_map_add_basic_map(map
,
4095 isl_basic_map_less_at(dims
, n
- 1));
4097 isl_space_free(dims
);
4102 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4106 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4109 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4111 return map_lex_lte_first(dim
, n
, 0);
4114 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4116 return map_lex_lte_first(dim
, n
, 1);
4119 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4121 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4124 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4126 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4129 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4130 unsigned n
, int equal
)
4132 struct isl_map
*map
;
4135 if (n
== 0 && equal
)
4136 return isl_map_universe(dims
);
4138 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4140 for (i
= 0; i
+ 1 < n
; ++i
)
4141 map
= isl_map_add_basic_map(map
,
4142 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4145 map
= isl_map_add_basic_map(map
,
4146 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4148 map
= isl_map_add_basic_map(map
,
4149 isl_basic_map_more_at(dims
, n
- 1));
4151 isl_space_free(dims
);
4156 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4160 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4163 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4165 return map_lex_gte_first(dim
, n
, 0);
4168 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4170 return map_lex_gte_first(dim
, n
, 1);
4173 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4175 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4178 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4180 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4183 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4184 __isl_take isl_set
*set2
)
4187 map
= isl_map_lex_le(isl_set_get_space(set1
));
4188 map
= isl_map_intersect_domain(map
, set1
);
4189 map
= isl_map_intersect_range(map
, set2
);
4193 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4194 __isl_take isl_set
*set2
)
4197 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4198 map
= isl_map_intersect_domain(map
, set1
);
4199 map
= isl_map_intersect_range(map
, set2
);
4203 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4204 __isl_take isl_set
*set2
)
4207 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4208 map
= isl_map_intersect_domain(map
, set1
);
4209 map
= isl_map_intersect_range(map
, set2
);
4213 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4214 __isl_take isl_set
*set2
)
4217 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4218 map
= isl_map_intersect_domain(map
, set1
);
4219 map
= isl_map_intersect_range(map
, set2
);
4223 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4224 __isl_take isl_map
*map2
)
4227 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4228 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4229 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4233 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4234 __isl_take isl_map
*map2
)
4237 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4238 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4239 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4243 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4244 __isl_take isl_map
*map2
)
4247 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4248 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4249 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4253 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4254 __isl_take isl_map
*map2
)
4257 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4258 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4259 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4263 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4264 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4266 struct isl_basic_map
*bmap
;
4268 bset
= isl_basic_set_cow(bset
);
4272 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4273 isl_space_free(bset
->dim
);
4274 bmap
= (struct isl_basic_map
*) bset
;
4276 return isl_basic_map_finalize(bmap
);
4278 isl_basic_set_free(bset
);
4279 isl_space_free(dim
);
4283 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4287 if (bmap
->dim
->n_in
== 0)
4288 return (struct isl_basic_set
*)bmap
;
4289 bmap
= isl_basic_map_cow(bmap
);
4292 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4295 bmap
= isl_basic_map_finalize(bmap
);
4296 return (struct isl_basic_set
*)bmap
;
4298 isl_basic_map_free(bmap
);
4302 /* For a div d = floor(f/m), add the constraints
4305 * -(f-(n-1)) + m d >= 0
4307 * Note that the second constraint is the negation of
4311 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4312 unsigned pos
, isl_int
*div
)
4315 unsigned total
= isl_basic_map_total_dim(bmap
);
4317 i
= isl_basic_map_alloc_inequality(bmap
);
4320 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4321 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4323 j
= isl_basic_map_alloc_inequality(bmap
);
4326 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4327 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4328 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4332 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4333 unsigned pos
, isl_int
*div
)
4335 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4339 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4341 unsigned total
= isl_basic_map_total_dim(bmap
);
4342 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4344 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4348 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4350 return isl_basic_map_add_div_constraints(bset
, div
);
4353 struct isl_basic_set
*isl_basic_map_underlying_set(
4354 struct isl_basic_map
*bmap
)
4358 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4360 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4361 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4362 return (struct isl_basic_set
*)bmap
;
4363 bmap
= isl_basic_map_cow(bmap
);
4366 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4369 bmap
->extra
-= bmap
->n_div
;
4371 bmap
= isl_basic_map_finalize(bmap
);
4372 return (struct isl_basic_set
*)bmap
;
4374 isl_basic_map_free(bmap
);
4378 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4379 __isl_take isl_basic_set
*bset
)
4381 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4384 struct isl_basic_map
*isl_basic_map_overlying_set(
4385 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4387 struct isl_basic_map
*bmap
;
4388 struct isl_ctx
*ctx
;
4395 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4396 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4397 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4399 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4400 isl_basic_map_free(like
);
4401 return (struct isl_basic_map
*)bset
;
4403 bset
= isl_basic_set_cow(bset
);
4406 total
= bset
->dim
->n_out
+ bset
->extra
;
4407 bmap
= (struct isl_basic_map
*)bset
;
4408 isl_space_free(bmap
->dim
);
4409 bmap
->dim
= isl_space_copy(like
->dim
);
4412 bmap
->n_div
= like
->n_div
;
4413 bmap
->extra
+= like
->n_div
;
4417 ltotal
= total
- bmap
->extra
+ like
->extra
;
4420 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4421 bmap
->extra
* (1 + 1 + total
));
4422 if (isl_blk_is_error(bmap
->block2
))
4424 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4428 for (i
= 0; i
< bmap
->extra
; ++i
)
4429 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4430 for (i
= 0; i
< like
->n_div
; ++i
) {
4431 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4432 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4434 bmap
= isl_basic_map_extend_constraints(bmap
,
4435 0, 2 * like
->n_div
);
4436 for (i
= 0; i
< like
->n_div
; ++i
) {
4439 if (isl_int_is_zero(bmap
->div
[i
][0]))
4441 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4442 bmap
= isl_basic_map_free(bmap
);
4445 isl_basic_map_free(like
);
4446 bmap
= isl_basic_map_simplify(bmap
);
4447 bmap
= isl_basic_map_finalize(bmap
);
4450 isl_basic_map_free(like
);
4451 isl_basic_set_free(bset
);
4455 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4456 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4458 return (struct isl_basic_set
*)
4459 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4462 struct isl_set
*isl_set_from_underlying_set(
4463 struct isl_set
*set
, struct isl_basic_set
*like
)
4469 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4471 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4472 isl_basic_set_free(like
);
4475 set
= isl_set_cow(set
);
4478 for (i
= 0; i
< set
->n
; ++i
) {
4479 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4480 isl_basic_set_copy(like
));
4484 isl_space_free(set
->dim
);
4485 set
->dim
= isl_space_copy(like
->dim
);
4488 isl_basic_set_free(like
);
4491 isl_basic_set_free(like
);
4496 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4500 map
= isl_map_cow(map
);
4503 map
->dim
= isl_space_cow(map
->dim
);
4507 for (i
= 1; i
< map
->n
; ++i
)
4508 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4510 for (i
= 0; i
< map
->n
; ++i
) {
4511 map
->p
[i
] = (struct isl_basic_map
*)
4512 isl_basic_map_underlying_set(map
->p
[i
]);
4517 map
->dim
= isl_space_underlying(map
->dim
, 0);
4519 isl_space_free(map
->dim
);
4520 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4524 return (struct isl_set
*)map
;
4530 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4532 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4535 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4536 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4538 bmap
= isl_basic_map_cow(bmap
);
4542 isl_space_free(bmap
->dim
);
4545 bmap
= isl_basic_map_finalize(bmap
);
4549 isl_basic_map_free(bmap
);
4550 isl_space_free(dim
);
4554 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4555 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4557 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4561 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4562 __isl_take isl_space
*dim
)
4566 map
= isl_map_cow(map
);
4570 for (i
= 0; i
< map
->n
; ++i
) {
4571 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4572 isl_space_copy(dim
));
4576 isl_space_free(map
->dim
);
4582 isl_space_free(dim
);
4586 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4587 __isl_take isl_space
*dim
)
4589 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4592 /* Compute the parameter domain of the given basic set.
4594 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4599 if (isl_basic_set_is_params(bset
))
4602 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4603 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4604 space
= isl_basic_set_get_space(bset
);
4605 space
= isl_space_params(space
);
4606 bset
= isl_basic_set_reset_space(bset
, space
);
4610 /* Construct a zero-dimensional basic set with the given parameter domain.
4612 __isl_give isl_basic_set
*isl_basic_set_from_params(
4613 __isl_take isl_basic_set
*bset
)
4616 space
= isl_basic_set_get_space(bset
);
4617 space
= isl_space_set_from_params(space
);
4618 bset
= isl_basic_set_reset_space(bset
, space
);
4622 /* Compute the parameter domain of the given set.
4624 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4629 if (isl_set_is_params(set
))
4632 n
= isl_set_dim(set
, isl_dim_set
);
4633 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4634 space
= isl_set_get_space(set
);
4635 space
= isl_space_params(space
);
4636 set
= isl_set_reset_space(set
, space
);
4640 /* Construct a zero-dimensional set with the given parameter domain.
4642 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4645 space
= isl_set_get_space(set
);
4646 space
= isl_space_set_from_params(space
);
4647 set
= isl_set_reset_space(set
, space
);
4651 /* Compute the parameter domain of the given map.
4653 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4658 n
= isl_map_dim(map
, isl_dim_in
);
4659 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4660 n
= isl_map_dim(map
, isl_dim_out
);
4661 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4662 space
= isl_map_get_space(map
);
4663 space
= isl_space_params(space
);
4664 map
= isl_map_reset_space(map
, space
);
4668 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4671 struct isl_basic_set
*domain
;
4677 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4679 n_in
= isl_basic_map_n_in(bmap
);
4680 n_out
= isl_basic_map_n_out(bmap
);
4681 domain
= isl_basic_set_from_basic_map(bmap
);
4682 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4684 domain
= isl_basic_set_reset_space(domain
, dim
);
4689 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4693 return isl_space_may_be_set(bmap
->dim
);
4696 /* Is this basic map actually a set?
4697 * Users should never call this function. Outside of isl,
4698 * the type should indicate whether something is a set or a map.
4700 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4704 return isl_space_is_set(bmap
->dim
);
4707 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4711 if (isl_basic_map_is_set(bmap
))
4713 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4716 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4717 __isl_take isl_basic_map
*bmap
)
4721 isl_basic_map
*domain
;
4722 int nparam
, n_in
, n_out
;
4725 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4726 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4727 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4729 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4730 domain
= isl_basic_map_universe(dim
);
4732 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4733 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4734 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4736 total
= isl_basic_map_total_dim(bmap
);
4738 for (i
= 0; i
< n_in
; ++i
) {
4739 k
= isl_basic_map_alloc_equality(bmap
);
4742 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4743 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4744 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4747 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4748 return isl_basic_map_finalize(bmap
);
4750 isl_basic_map_free(bmap
);
4754 __isl_give isl_basic_map
*isl_basic_map_range_map(
4755 __isl_take isl_basic_map
*bmap
)
4759 isl_basic_map
*range
;
4760 int nparam
, n_in
, n_out
;
4763 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4764 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4765 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4767 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4768 range
= isl_basic_map_universe(dim
);
4770 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4771 bmap
= isl_basic_map_apply_range(bmap
, range
);
4772 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4774 total
= isl_basic_map_total_dim(bmap
);
4776 for (i
= 0; i
< n_out
; ++i
) {
4777 k
= isl_basic_map_alloc_equality(bmap
);
4780 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4781 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4782 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4785 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4786 return isl_basic_map_finalize(bmap
);
4788 isl_basic_map_free(bmap
);
4792 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4796 return isl_space_may_be_set(map
->dim
);
4799 /* Is this map actually a set?
4800 * Users should never call this function. Outside of isl,
4801 * the type should indicate whether something is a set or a map.
4803 int isl_map_is_set(__isl_keep isl_map
*map
)
4807 return isl_space_is_set(map
->dim
);
4810 struct isl_set
*isl_map_range(struct isl_map
*map
)
4813 struct isl_set
*set
;
4817 if (isl_map_is_set(map
))
4818 return (isl_set
*)map
;
4820 map
= isl_map_cow(map
);
4824 set
= (struct isl_set
*) map
;
4825 set
->dim
= isl_space_range(set
->dim
);
4828 for (i
= 0; i
< map
->n
; ++i
) {
4829 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4833 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4834 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4841 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4844 isl_space
*domain_dim
;
4846 map
= isl_map_cow(map
);
4850 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4851 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4852 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4855 for (i
= 0; i
< map
->n
; ++i
) {
4856 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4860 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4861 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4868 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4871 isl_space
*range_dim
;
4873 map
= isl_map_cow(map
);
4877 range_dim
= isl_space_range(isl_map_get_space(map
));
4878 range_dim
= isl_space_from_range(range_dim
);
4879 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4880 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4883 for (i
= 0; i
< map
->n
; ++i
) {
4884 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4888 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4889 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4896 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4897 __isl_take isl_space
*dim
)
4900 struct isl_map
*map
= NULL
;
4902 set
= isl_set_cow(set
);
4905 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4906 map
= (struct isl_map
*)set
;
4907 for (i
= 0; i
< set
->n
; ++i
) {
4908 map
->p
[i
] = isl_basic_map_from_basic_set(
4909 set
->p
[i
], isl_space_copy(dim
));
4913 isl_space_free(map
->dim
);
4917 isl_space_free(dim
);
4922 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4923 __isl_take isl_basic_set
*bset
)
4925 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4928 __isl_give isl_basic_map
*isl_basic_map_from_range(
4929 __isl_take isl_basic_set
*bset
)
4932 space
= isl_basic_set_get_space(bset
);
4933 space
= isl_space_from_range(space
);
4934 bset
= isl_basic_set_reset_space(bset
, space
);
4935 return (isl_basic_map
*)bset
;
4938 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4941 space
= isl_set_get_space(set
);
4942 space
= isl_space_from_range(space
);
4943 set
= isl_set_reset_space(set
, space
);
4944 return (struct isl_map
*)set
;
4947 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4949 return isl_map_reverse(isl_map_from_range(set
));
4952 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4953 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4955 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4958 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4959 __isl_take isl_set
*range
)
4961 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4964 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4967 struct isl_set
*set
= NULL
;
4971 map
= isl_map_cow(map
);
4974 map
->dim
= isl_space_as_set_space(map
->dim
);
4977 set
= (struct isl_set
*)map
;
4978 for (i
= 0; i
< map
->n
; ++i
) {
4979 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4989 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4992 struct isl_map
*map
;
4997 isl_die(dim
->ctx
, isl_error_internal
,
4998 "negative number of basic maps", goto error
);
4999 map
= isl_alloc(dim
->ctx
, struct isl_map
,
5000 sizeof(struct isl_map
) +
5001 (n
- 1) * sizeof(struct isl_basic_map
*));
5005 map
->ctx
= dim
->ctx
;
5006 isl_ctx_ref(map
->ctx
);
5014 isl_space_free(dim
);
5018 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5019 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5022 struct isl_map
*map
;
5025 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5029 map
= isl_map_alloc_space(dims
, n
, flags
);
5033 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5035 struct isl_basic_map
*bmap
;
5036 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5037 bmap
= isl_basic_map_set_to_empty(bmap
);
5041 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5043 struct isl_basic_set
*bset
;
5044 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5045 bset
= isl_basic_set_set_to_empty(bset
);
5049 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5051 struct isl_basic_map
*bmap
;
5054 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5055 bmap
= isl_basic_map_set_to_empty(bmap
);
5059 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5061 struct isl_basic_map
*bmap
;
5064 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5065 bmap
= isl_basic_map_set_to_empty(bmap
);
5069 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5071 struct isl_basic_set
*bset
;
5074 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5075 bset
= isl_basic_set_set_to_empty(bset
);
5079 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5081 struct isl_basic_map
*bmap
;
5082 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5083 bmap
= isl_basic_map_finalize(bmap
);
5087 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5089 struct isl_basic_set
*bset
;
5090 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5091 bset
= isl_basic_set_finalize(bset
);
5095 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5098 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5099 isl_basic_map
*bmap
;
5101 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5102 for (i
= 0; i
< total
; ++i
) {
5103 int k
= isl_basic_map_alloc_inequality(bmap
);
5106 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5107 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5111 isl_basic_map_free(bmap
);
5115 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5117 return isl_basic_map_nat_universe(dim
);
5120 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5122 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5125 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5127 return isl_map_nat_universe(dim
);
5130 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5131 __isl_keep isl_basic_map
*model
)
5135 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5138 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5142 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5145 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5146 __isl_keep isl_set
*model
)
5150 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5153 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5155 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5158 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5162 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5165 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5169 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5172 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5174 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5177 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5181 return isl_set_empty(isl_space_copy(model
->dim
));
5184 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5186 struct isl_map
*map
;
5189 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5190 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5194 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5196 struct isl_set
*set
;
5199 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5200 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5204 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5208 return isl_set_universe(isl_space_copy(model
->dim
));
5211 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5214 struct isl_map
*dup
;
5218 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5219 for (i
= 0; i
< map
->n
; ++i
)
5220 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5224 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5225 __isl_take isl_basic_map
*bmap
)
5229 if (isl_basic_map_plain_is_empty(bmap
)) {
5230 isl_basic_map_free(bmap
);
5233 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5234 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5235 map
->p
[map
->n
] = bmap
;
5237 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5243 isl_basic_map_free(bmap
);
5247 void *isl_map_free(struct isl_map
*map
)
5257 isl_ctx_deref(map
->ctx
);
5258 for (i
= 0; i
< map
->n
; ++i
)
5259 isl_basic_map_free(map
->p
[i
]);
5260 isl_space_free(map
->dim
);
5266 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5267 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5271 base
= isl_map_cow(base
);
5275 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5278 for (i
= 0; i
< base
->n
; ++i
) {
5279 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5280 isl_space_copy(base
->dim
), 0, 0, 0);
5290 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5291 unsigned nparam
, unsigned dim
)
5293 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5297 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5298 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5302 bmap
= isl_basic_map_cow(bmap
);
5303 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5304 j
= isl_basic_map_alloc_equality(bmap
);
5307 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5308 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5309 isl_int_set_si(bmap
->eq
[j
][0], value
);
5310 bmap
= isl_basic_map_simplify(bmap
);
5311 return isl_basic_map_finalize(bmap
);
5313 isl_basic_map_free(bmap
);
5317 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5318 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5322 bmap
= isl_basic_map_cow(bmap
);
5323 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5324 j
= isl_basic_map_alloc_equality(bmap
);
5327 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5328 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5329 isl_int_set(bmap
->eq
[j
][0], value
);
5330 bmap
= isl_basic_map_simplify(bmap
);
5331 return isl_basic_map_finalize(bmap
);
5333 isl_basic_map_free(bmap
);
5337 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5338 enum isl_dim_type type
, unsigned pos
, int value
)
5342 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5343 return isl_basic_map_fix_pos_si(bmap
,
5344 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5346 isl_basic_map_free(bmap
);
5350 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5351 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5355 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5356 return isl_basic_map_fix_pos(bmap
,
5357 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5359 isl_basic_map_free(bmap
);
5363 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5364 * to be equal to "v".
5366 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5367 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5371 if (!isl_val_is_int(v
))
5372 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5373 "expecting integer value", goto error
);
5374 if (pos
>= isl_basic_map_dim(bmap
, type
))
5375 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5376 "index out of bounds", goto error
);
5377 pos
+= isl_basic_map_offset(bmap
, type
);
5378 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5382 isl_basic_map_free(bmap
);
5387 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5388 * to be equal to "v".
5390 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5391 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5393 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5396 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5397 enum isl_dim_type type
, unsigned pos
, int value
)
5399 return (struct isl_basic_set
*)
5400 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5404 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5405 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5407 return (struct isl_basic_set
*)
5408 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5412 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5413 unsigned input
, int value
)
5415 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5418 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5419 unsigned dim
, int value
)
5421 return (struct isl_basic_set
*)
5422 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5423 isl_dim_set
, dim
, value
);
5426 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5428 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5435 isl_basic_map_free(map
->p
[i
]);
5436 if (i
!= map
->n
- 1) {
5437 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5438 map
->p
[i
] = map
->p
[map
->n
- 1];
5445 /* Perform "fn" on each basic map of "map", where we may not be holding
5446 * the only reference to "map".
5447 * In particular, "fn" should be a semantics preserving operation
5448 * that we want to apply to all copies of "map". We therefore need
5449 * to be careful not to modify "map" in a way that breaks "map"
5450 * in case anything goes wrong.
5452 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5453 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5455 struct isl_basic_map
*bmap
;
5461 for (i
= map
->n
- 1; i
>= 0; --i
) {
5462 bmap
= isl_basic_map_copy(map
->p
[i
]);
5466 isl_basic_map_free(map
->p
[i
]);
5468 if (remove_if_empty(map
, i
) < 0)
5478 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5479 enum isl_dim_type type
, unsigned pos
, int value
)
5483 map
= isl_map_cow(map
);
5487 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5488 for (i
= map
->n
- 1; i
>= 0; --i
) {
5489 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5490 if (remove_if_empty(map
, i
) < 0)
5493 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5500 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5501 enum isl_dim_type type
, unsigned pos
, int value
)
5503 return (struct isl_set
*)
5504 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5507 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5508 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5512 map
= isl_map_cow(map
);
5516 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5517 for (i
= 0; i
< map
->n
; ++i
) {
5518 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5522 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5529 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5530 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5532 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5535 /* Fix the value of the variable at position "pos" of type "type" of "map"
5536 * to be equal to "v".
5538 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5539 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5543 map
= isl_map_cow(map
);
5547 if (!isl_val_is_int(v
))
5548 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5549 "expecting integer value", goto error
);
5550 if (pos
>= isl_map_dim(map
, type
))
5551 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5552 "index out of bounds", goto error
);
5553 for (i
= map
->n
- 1; i
>= 0; --i
) {
5554 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5556 if (remove_if_empty(map
, i
) < 0)
5559 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5568 /* Fix the value of the variable at position "pos" of type "type" of "set"
5569 * to be equal to "v".
5571 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5572 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5574 return isl_map_fix_val(set
, type
, pos
, v
);
5577 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5578 unsigned input
, int value
)
5580 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5583 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5585 return (struct isl_set
*)
5586 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5589 static __isl_give isl_basic_map
*basic_map_bound_si(
5590 __isl_take isl_basic_map
*bmap
,
5591 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5597 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5598 pos
+= isl_basic_map_offset(bmap
, type
);
5599 bmap
= isl_basic_map_cow(bmap
);
5600 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5601 j
= isl_basic_map_alloc_inequality(bmap
);
5604 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5606 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5607 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5609 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5610 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5612 bmap
= isl_basic_map_simplify(bmap
);
5613 return isl_basic_map_finalize(bmap
);
5615 isl_basic_map_free(bmap
);
5619 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5620 __isl_take isl_basic_map
*bmap
,
5621 enum isl_dim_type type
, unsigned pos
, int value
)
5623 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5626 /* Constrain the values of the given dimension to be no greater than "value".
5628 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5629 __isl_take isl_basic_map
*bmap
,
5630 enum isl_dim_type type
, unsigned pos
, int value
)
5632 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5635 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5636 unsigned dim
, isl_int value
)
5640 bset
= isl_basic_set_cow(bset
);
5641 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5642 j
= isl_basic_set_alloc_inequality(bset
);
5645 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5646 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5647 isl_int_neg(bset
->ineq
[j
][0], value
);
5648 bset
= isl_basic_set_simplify(bset
);
5649 return isl_basic_set_finalize(bset
);
5651 isl_basic_set_free(bset
);
5655 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5656 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5660 map
= isl_map_cow(map
);
5664 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5665 for (i
= 0; i
< map
->n
; ++i
) {
5666 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5667 type
, pos
, value
, upper
);
5671 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5678 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5679 enum isl_dim_type type
, unsigned pos
, int value
)
5681 return map_bound_si(map
, type
, pos
, value
, 0);
5684 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5685 enum isl_dim_type type
, unsigned pos
, int value
)
5687 return map_bound_si(map
, type
, pos
, value
, 1);
5690 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5691 enum isl_dim_type type
, unsigned pos
, int value
)
5693 return (struct isl_set
*)
5694 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5697 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5698 enum isl_dim_type type
, unsigned pos
, int value
)
5700 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5703 /* Bound the given variable of "bmap" from below (or above is "upper"
5704 * is set) to "value".
5706 static __isl_give isl_basic_map
*basic_map_bound(
5707 __isl_take isl_basic_map
*bmap
,
5708 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5714 if (pos
>= isl_basic_map_dim(bmap
, type
))
5715 isl_die(bmap
->ctx
, isl_error_invalid
,
5716 "index out of bounds", goto error
);
5717 pos
+= isl_basic_map_offset(bmap
, type
);
5718 bmap
= isl_basic_map_cow(bmap
);
5719 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5720 j
= isl_basic_map_alloc_inequality(bmap
);
5723 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5725 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5726 isl_int_set(bmap
->ineq
[j
][0], value
);
5728 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5729 isl_int_neg(bmap
->ineq
[j
][0], value
);
5731 bmap
= isl_basic_map_simplify(bmap
);
5732 return isl_basic_map_finalize(bmap
);
5734 isl_basic_map_free(bmap
);
5738 /* Bound the given variable of "map" from below (or above is "upper"
5739 * is set) to "value".
5741 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5742 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5746 map
= isl_map_cow(map
);
5750 if (pos
>= isl_map_dim(map
, type
))
5751 isl_die(map
->ctx
, isl_error_invalid
,
5752 "index out of bounds", goto error
);
5753 for (i
= map
->n
- 1; i
>= 0; --i
) {
5754 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5755 if (remove_if_empty(map
, i
) < 0)
5758 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5765 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5766 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5768 return map_bound(map
, type
, pos
, value
, 0);
5771 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5772 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5774 return map_bound(map
, type
, pos
, value
, 1);
5777 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5778 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5780 return isl_map_lower_bound(set
, type
, pos
, value
);
5783 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5784 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5786 return isl_map_upper_bound(set
, type
, pos
, value
);
5789 /* Force the values of the variable at position "pos" of type "type" of "set"
5790 * to be no smaller than "value".
5792 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
5793 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5797 if (!isl_val_is_int(value
))
5798 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5799 "expecting integer value", goto error
);
5800 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
5801 isl_val_free(value
);
5804 isl_val_free(value
);
5809 /* Force the values of the variable at position "pos" of type "type" of "set"
5810 * to be no greater than "value".
5812 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
5813 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5817 if (!isl_val_is_int(value
))
5818 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5819 "expecting integer value", goto error
);
5820 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
5821 isl_val_free(value
);
5824 isl_val_free(value
);
5829 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5834 set
= isl_set_cow(set
);
5838 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5839 for (i
= 0; i
< set
->n
; ++i
) {
5840 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5850 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5854 map
= isl_map_cow(map
);
5858 map
->dim
= isl_space_reverse(map
->dim
);
5861 for (i
= 0; i
< map
->n
; ++i
) {
5862 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5866 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5873 static struct isl_map
*isl_basic_map_partial_lexopt(
5874 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5875 struct isl_set
**empty
, int max
)
5879 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5880 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5882 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5884 isl_basic_map_free(bmap
);
5885 isl_basic_set_free(dom
);
5891 struct isl_map
*isl_basic_map_partial_lexmax(
5892 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5893 struct isl_set
**empty
)
5895 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5898 struct isl_map
*isl_basic_map_partial_lexmin(
5899 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5900 struct isl_set
**empty
)
5902 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5905 struct isl_set
*isl_basic_set_partial_lexmin(
5906 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5907 struct isl_set
**empty
)
5909 return (struct isl_set
*)
5910 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5914 struct isl_set
*isl_basic_set_partial_lexmax(
5915 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5916 struct isl_set
**empty
)
5918 return (struct isl_set
*)
5919 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5923 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5924 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5925 __isl_give isl_set
**empty
)
5927 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5930 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5931 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5932 __isl_give isl_set
**empty
)
5934 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5937 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5938 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5939 __isl_give isl_set
**empty
)
5941 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5944 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5945 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5946 __isl_give isl_set
**empty
)
5948 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5951 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5952 __isl_take isl_basic_map
*bmap
, int max
)
5954 isl_basic_set
*dom
= NULL
;
5955 isl_space
*dom_space
;
5959 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5960 dom
= isl_basic_set_universe(dom_space
);
5961 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5963 isl_basic_map_free(bmap
);
5967 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5968 __isl_take isl_basic_map
*bmap
)
5970 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5974 #define TYPE isl_pw_multi_aff
5976 #define SUFFIX _pw_multi_aff
5978 #define EMPTY isl_pw_multi_aff_empty
5980 #define ADD isl_pw_multi_aff_union_add
5981 #include "isl_map_lexopt_templ.c"
5983 /* Given a map "map", compute the lexicographically minimal
5984 * (or maximal) image element for each domain element in dom,
5985 * in the form of an isl_pw_multi_aff.
5986 * Set *empty to those elements in dom that do not have an image element.
5988 * We first compute the lexicographically minimal or maximal element
5989 * in the first basic map. This results in a partial solution "res"
5990 * and a subset "todo" of dom that still need to be handled.
5991 * We then consider each of the remaining maps in "map" and successively
5992 * update both "res" and "todo".
5994 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5995 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5996 __isl_give isl_set
**empty
, int max
)
5999 isl_pw_multi_aff
*res
;
6005 if (isl_map_plain_is_empty(map
)) {
6010 return isl_pw_multi_aff_from_map(map
);
6013 res
= basic_map_partial_lexopt_pw_multi_aff(
6014 isl_basic_map_copy(map
->p
[0]),
6015 isl_set_copy(dom
), &todo
, max
);
6017 for (i
= 1; i
< map
->n
; ++i
) {
6018 isl_pw_multi_aff
*res_i
;
6021 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6022 isl_basic_map_copy(map
->p
[i
]),
6023 isl_set_copy(dom
), &todo_i
, max
);
6026 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6028 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6030 todo
= isl_set_intersect(todo
, todo_i
);
6051 #define TYPE isl_map
6055 #define EMPTY isl_map_empty
6057 #define ADD isl_map_union_disjoint
6058 #include "isl_map_lexopt_templ.c"
6060 /* Given a map "map", compute the lexicographically minimal
6061 * (or maximal) image element for each domain element in dom.
6062 * Set *empty to those elements in dom that do not have an image element.
6064 * We first compute the lexicographically minimal or maximal element
6065 * in the first basic map. This results in a partial solution "res"
6066 * and a subset "todo" of dom that still need to be handled.
6067 * We then consider each of the remaining maps in "map" and successively
6068 * update both "res" and "todo".
6070 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6071 * Assume we are computing the lexicographical maximum.
6072 * We first compute the lexicographically maximal element in basic map i.
6073 * This results in a partial solution res_i and a subset todo_i.
6074 * Then we combine these results with those obtain for the first k basic maps
6075 * to obtain a result that is valid for the first k+1 basic maps.
6076 * In particular, the set where there is no solution is the set where
6077 * there is no solution for the first k basic maps and also no solution
6078 * for the ith basic map, i.e.,
6080 * todo^i = todo^k * todo_i
6082 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6083 * solutions, arbitrarily breaking ties in favor of res^k.
6084 * That is, when res^k(a) >= res_i(a), we pick res^k and
6085 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6086 * the lexicographic order.)
6087 * In practice, we compute
6089 * res^k * (res_i . "<=")
6093 * res_i * (res^k . "<")
6095 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6096 * where only one of res^k and res_i provides a solution and we simply pick
6103 * Note that we only compute these intersections when dom(res^k) intersects
6104 * dom(res_i). Otherwise, the only effect of these intersections is to
6105 * potentially break up res^k and res_i into smaller pieces.
6106 * We want to avoid such splintering as much as possible.
6107 * In fact, an earlier implementation of this function would look for
6108 * better results in the domain of res^k and for extra results in todo^k,
6109 * but this would always result in a splintering according to todo^k,
6110 * even when the domain of basic map i is disjoint from the domains of
6111 * the previous basic maps.
6113 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6114 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6115 __isl_give isl_set
**empty
, int max
)
6118 struct isl_map
*res
;
6119 struct isl_set
*todo
;
6124 if (isl_map_plain_is_empty(map
)) {
6132 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6133 isl_set_copy(dom
), &todo
, max
);
6135 for (i
= 1; i
< map
->n
; ++i
) {
6139 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
6141 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
6142 isl_set_copy(dom
), &todo_i
, max
);
6145 lt
= isl_map_lex_lt(isl_space_copy(dim
));
6146 le
= isl_map_lex_le(dim
);
6148 lt
= isl_map_lex_gt(isl_space_copy(dim
));
6149 le
= isl_map_lex_ge(dim
);
6151 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
6152 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6153 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6154 le
= isl_map_intersect(le
, isl_map_copy(res
));
6156 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6157 res
= isl_map_intersect_domain(res
,
6158 isl_set_copy(todo_i
));
6159 res_i
= isl_map_intersect_domain(res_i
,
6160 isl_set_copy(todo
));
6163 res
= isl_map_union_disjoint(res
, res_i
);
6164 res
= isl_map_union_disjoint(res
, lt
);
6165 res
= isl_map_union_disjoint(res
, le
);
6167 todo
= isl_set_intersect(todo
, todo_i
);
6187 __isl_give isl_map
*isl_map_partial_lexmax(
6188 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6189 __isl_give isl_set
**empty
)
6191 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6194 __isl_give isl_map
*isl_map_partial_lexmin(
6195 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6196 __isl_give isl_set
**empty
)
6198 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6201 __isl_give isl_set
*isl_set_partial_lexmin(
6202 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6203 __isl_give isl_set
**empty
)
6205 return (struct isl_set
*)
6206 isl_map_partial_lexmin((struct isl_map
*)set
,
6210 __isl_give isl_set
*isl_set_partial_lexmax(
6211 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6212 __isl_give isl_set
**empty
)
6214 return (struct isl_set
*)
6215 isl_map_partial_lexmax((struct isl_map
*)set
,
6219 /* Compute the lexicographic minimum (or maximum if "max" is set)
6220 * of "bmap" over its domain.
6222 * Since we are not interested in the part of the domain space where
6223 * there is no solution, we initialize the domain to those constraints
6224 * of "bmap" that only involve the parameters and the input dimensions.
6225 * This relieves the parametric programming engine from detecting those
6226 * inequalities and transferring them to the context. More importantly,
6227 * it ensures that those inequalities are transferred first and not
6228 * intermixed with inequalities that actually split the domain.
6230 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6234 isl_basic_map
*copy
;
6237 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6238 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6239 copy
= isl_basic_map_copy(bmap
);
6240 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6241 isl_dim_div
, 0, n_div
);
6242 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6243 isl_dim_out
, 0, n_out
);
6244 dom
= isl_basic_map_domain(copy
);
6245 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6248 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6250 return isl_basic_map_lexopt(bmap
, 0);
6253 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6255 return isl_basic_map_lexopt(bmap
, 1);
6258 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6260 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6263 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6265 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6268 /* Extract the first and only affine expression from list
6269 * and then add it to *pwaff with the given dom.
6270 * This domain is known to be disjoint from other domains
6271 * because of the way isl_basic_map_foreach_lexmax works.
6273 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6274 __isl_take isl_aff_list
*list
, void *user
)
6276 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6278 isl_pw_aff
**pwaff
= user
;
6279 isl_pw_aff
*pwaff_i
;
6283 if (isl_aff_list_n_aff(list
) != 1)
6284 isl_die(ctx
, isl_error_internal
,
6285 "expecting single element list", goto error
);
6287 aff
= isl_aff_list_get_aff(list
, 0);
6288 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6290 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6292 isl_aff_list_free(list
);
6296 isl_basic_set_free(dom
);
6297 isl_aff_list_free(list
);
6301 /* Given a basic map with one output dimension, compute the minimum or
6302 * maximum of that dimension as an isl_pw_aff.
6304 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6305 * call update_dim_opt on each leaf of the result.
6307 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6310 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6314 dim
= isl_space_from_domain(isl_space_domain(dim
));
6315 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6316 pwaff
= isl_pw_aff_empty(dim
);
6318 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6320 return isl_pw_aff_free(pwaff
);
6325 /* Compute the minimum or maximum of the given output dimension
6326 * as a function of the parameters and the input dimensions,
6327 * but independently of the other output dimensions.
6329 * We first project out the other output dimension and then compute
6330 * the "lexicographic" maximum in each basic map, combining the results
6331 * using isl_pw_aff_union_max.
6333 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6340 n_out
= isl_map_dim(map
, isl_dim_out
);
6341 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6342 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6347 isl_space
*dim
= isl_map_get_space(map
);
6348 dim
= isl_space_domain(isl_space_from_range(dim
));
6350 return isl_pw_aff_empty(dim
);
6353 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6354 for (i
= 1; i
< map
->n
; ++i
) {
6355 isl_pw_aff
*pwaff_i
;
6357 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6358 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6366 /* Compute the maximum of the given output dimension as a function of the
6367 * parameters and input dimensions, but independently of
6368 * the other output dimensions.
6370 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6372 return map_dim_opt(map
, pos
, 1);
6375 /* Compute the minimum or maximum of the given set dimension
6376 * as a function of the parameters,
6377 * but independently of the other set dimensions.
6379 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6382 return map_dim_opt(set
, pos
, max
);
6385 /* Compute the maximum of the given set dimension as a function of the
6386 * parameters, but independently of the other set dimensions.
6388 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6390 return set_dim_opt(set
, pos
, 1);
6393 /* Compute the minimum of the given set dimension as a function of the
6394 * parameters, but independently of the other set dimensions.
6396 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6398 return set_dim_opt(set
, pos
, 0);
6401 /* Apply a preimage specified by "mat" on the parameters of "bset".
6402 * bset is assumed to have only parameters and divs.
6404 static struct isl_basic_set
*basic_set_parameter_preimage(
6405 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6412 bset
->dim
= isl_space_cow(bset
->dim
);
6416 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6418 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6420 bset
->dim
->nparam
= 0;
6421 bset
->dim
->n_out
= nparam
;
6422 bset
= isl_basic_set_preimage(bset
, mat
);
6424 bset
->dim
->nparam
= bset
->dim
->n_out
;
6425 bset
->dim
->n_out
= 0;
6430 isl_basic_set_free(bset
);
6434 /* Apply a preimage specified by "mat" on the parameters of "set".
6435 * set is assumed to have only parameters and divs.
6437 static struct isl_set
*set_parameter_preimage(
6438 struct isl_set
*set
, struct isl_mat
*mat
)
6440 isl_space
*dim
= NULL
;
6446 dim
= isl_space_copy(set
->dim
);
6447 dim
= isl_space_cow(dim
);
6451 nparam
= isl_set_dim(set
, isl_dim_param
);
6453 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6456 dim
->n_out
= nparam
;
6457 isl_set_reset_space(set
, dim
);
6458 set
= isl_set_preimage(set
, mat
);
6461 dim
= isl_space_copy(set
->dim
);
6462 dim
= isl_space_cow(dim
);
6465 dim
->nparam
= dim
->n_out
;
6467 isl_set_reset_space(set
, dim
);
6470 isl_space_free(dim
);
6477 /* Intersect the basic set "bset" with the affine space specified by the
6478 * equalities in "eq".
6480 static struct isl_basic_set
*basic_set_append_equalities(
6481 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6489 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6494 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6495 for (i
= 0; i
< eq
->n_row
; ++i
) {
6496 k
= isl_basic_set_alloc_equality(bset
);
6499 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6500 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6504 bset
= isl_basic_set_gauss(bset
, NULL
);
6505 bset
= isl_basic_set_finalize(bset
);
6510 isl_basic_set_free(bset
);
6514 /* Intersect the set "set" with the affine space specified by the
6515 * equalities in "eq".
6517 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6525 for (i
= 0; i
< set
->n
; ++i
) {
6526 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6539 /* Given a basic set "bset" that only involves parameters and existentially
6540 * quantified variables, return the index of the first equality
6541 * that only involves parameters. If there is no such equality then
6542 * return bset->n_eq.
6544 * This function assumes that isl_basic_set_gauss has been called on "bset".
6546 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6549 unsigned nparam
, n_div
;
6554 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6555 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6557 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6558 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6565 /* Compute an explicit representation for the existentially quantified
6566 * variables in "bset" by computing the "minimal value" of the set
6567 * variables. Since there are no set variables, the computation of
6568 * the minimal value essentially computes an explicit representation
6569 * of the non-empty part(s) of "bset".
6571 * The input only involves parameters and existentially quantified variables.
6572 * All equalities among parameters have been removed.
6574 * Since the existentially quantified variables in the result are in general
6575 * going to be different from those in the input, we first replace
6576 * them by the minimal number of variables based on their equalities.
6577 * This should simplify the parametric integer programming.
6579 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6581 isl_morph
*morph1
, *morph2
;
6587 if (bset
->n_eq
== 0)
6588 return isl_basic_set_lexmin(bset
);
6590 morph1
= isl_basic_set_parameter_compression(bset
);
6591 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6592 bset
= isl_basic_set_lift(bset
);
6593 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6594 bset
= isl_morph_basic_set(morph2
, bset
);
6595 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6596 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6598 set
= isl_basic_set_lexmin(bset
);
6600 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6605 /* Project the given basic set onto its parameter domain, possibly introducing
6606 * new, explicit, existential variables in the constraints.
6607 * The input has parameters and (possibly implicit) existential variables.
6608 * The output has the same parameters, but only
6609 * explicit existentially quantified variables.
6611 * The actual projection is performed by pip, but pip doesn't seem
6612 * to like equalities very much, so we first remove the equalities
6613 * among the parameters by performing a variable compression on
6614 * the parameters. Afterward, an inverse transformation is performed
6615 * and the equalities among the parameters are inserted back in.
6617 * The variable compression on the parameters may uncover additional
6618 * equalities that were only implicit before. We therefore check
6619 * if there are any new parameter equalities in the result and
6620 * if so recurse. The removal of parameter equalities is required
6621 * for the parameter compression performed by base_compute_divs.
6623 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6627 struct isl_mat
*T
, *T2
;
6628 struct isl_set
*set
;
6631 bset
= isl_basic_set_cow(bset
);
6635 if (bset
->n_eq
== 0)
6636 return base_compute_divs(bset
);
6638 bset
= isl_basic_set_gauss(bset
, NULL
);
6641 if (isl_basic_set_plain_is_empty(bset
))
6642 return isl_set_from_basic_set(bset
);
6644 i
= first_parameter_equality(bset
);
6645 if (i
== bset
->n_eq
)
6646 return base_compute_divs(bset
);
6648 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6649 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6651 eq
= isl_mat_cow(eq
);
6652 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6653 if (T
&& T
->n_col
== 0) {
6657 bset
= isl_basic_set_set_to_empty(bset
);
6658 return isl_set_from_basic_set(bset
);
6660 bset
= basic_set_parameter_preimage(bset
, T
);
6662 i
= first_parameter_equality(bset
);
6665 else if (i
== bset
->n_eq
)
6666 set
= base_compute_divs(bset
);
6668 set
= parameter_compute_divs(bset
);
6669 set
= set_parameter_preimage(set
, T2
);
6670 set
= set_append_equalities(set
, eq
);
6674 /* Insert the divs from "ls" before those of "bmap".
6676 * The number of columns is not changed, which means that the last
6677 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6678 * The caller is responsible for removing the same number of dimensions
6679 * from the space of "bmap".
6681 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6682 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6688 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6692 old_n_div
= bmap
->n_div
;
6693 bmap
= insert_div_rows(bmap
, n_div
);
6697 for (i
= 0; i
< n_div
; ++i
) {
6698 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6699 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6705 /* Replace the space of "bmap" by the space and divs of "ls".
6707 * If "ls" has any divs, then we simplify the result since we may
6708 * have discovered some additional equalities that could simplify
6709 * the div expressions.
6711 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6712 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6716 bmap
= isl_basic_map_cow(bmap
);
6720 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6721 bmap
= insert_divs_from_local_space(bmap
, ls
);
6725 isl_space_free(bmap
->dim
);
6726 bmap
->dim
= isl_local_space_get_space(ls
);
6730 isl_local_space_free(ls
);
6732 bmap
= isl_basic_map_simplify(bmap
);
6733 bmap
= isl_basic_map_finalize(bmap
);
6736 isl_basic_map_free(bmap
);
6737 isl_local_space_free(ls
);
6741 /* Replace the space of "map" by the space and divs of "ls".
6743 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6744 __isl_take isl_local_space
*ls
)
6748 map
= isl_map_cow(map
);
6752 for (i
= 0; i
< map
->n
; ++i
) {
6753 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6754 isl_local_space_copy(ls
));
6758 isl_space_free(map
->dim
);
6759 map
->dim
= isl_local_space_get_space(ls
);
6763 isl_local_space_free(ls
);
6766 isl_local_space_free(ls
);
6771 /* Compute an explicit representation for the existentially
6772 * quantified variables for which do not know any explicit representation yet.
6774 * We first sort the existentially quantified variables so that the
6775 * existentially quantified variables for which we already have an explicit
6776 * representation are placed before those for which we do not.
6777 * The input dimensions, the output dimensions and the existentially
6778 * quantified variables for which we already have an explicit
6779 * representation are then turned into parameters.
6780 * compute_divs returns a map with the same parameters and
6781 * no input or output dimensions and the dimension specification
6782 * is reset to that of the input, including the existentially quantified
6783 * variables for which we already had an explicit representation.
6785 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6787 struct isl_basic_set
*bset
;
6788 struct isl_set
*set
;
6789 struct isl_map
*map
;
6791 isl_local_space
*ls
;
6798 bmap
= isl_basic_map_sort_divs(bmap
);
6799 bmap
= isl_basic_map_cow(bmap
);
6803 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6804 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6807 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6808 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6809 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6810 dim
= isl_space_set_alloc(bmap
->ctx
,
6811 nparam
+ n_in
+ n_out
+ n_known
, 0);
6815 ls
= isl_basic_map_get_local_space(bmap
);
6816 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6817 n_known
, bmap
->n_div
- n_known
);
6819 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6820 swap_div(bmap
, i
- n_known
, i
);
6821 bmap
->n_div
-= n_known
;
6822 bmap
->extra
-= n_known
;
6824 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6825 bset
= (struct isl_basic_set
*)bmap
;
6827 set
= parameter_compute_divs(bset
);
6828 map
= (struct isl_map
*)set
;
6829 map
= replace_space_by_local_space(map
, ls
);
6833 isl_basic_map_free(bmap
);
6837 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6845 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6846 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6847 if (isl_int_is_zero(bmap
->div
[i
][0]))
6849 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6855 static int map_divs_known(__isl_keep isl_map
*map
)
6862 for (i
= 0; i
< map
->n
; ++i
) {
6863 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6871 /* If bmap contains any unknown divs, then compute explicit
6872 * expressions for them. However, this computation may be
6873 * quite expensive, so first try to remove divs that aren't
6876 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6879 struct isl_map
*map
;
6881 known
= isl_basic_map_divs_known(bmap
);
6885 return isl_map_from_basic_map(bmap
);
6887 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6889 known
= isl_basic_map_divs_known(bmap
);
6893 return isl_map_from_basic_map(bmap
);
6895 map
= compute_divs(bmap
);
6898 isl_basic_map_free(bmap
);
6902 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6906 struct isl_map
*res
;
6913 known
= map_divs_known(map
);
6921 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6922 for (i
= 1 ; i
< map
->n
; ++i
) {
6924 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6925 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6926 res
= isl_map_union_disjoint(res
, r2
);
6928 res
= isl_map_union(res
, r2
);
6935 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6937 return (struct isl_set
*)
6938 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6941 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6943 return (struct isl_set
*)
6944 isl_map_compute_divs((struct isl_map
*)set
);
6947 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6950 struct isl_set
*set
;
6955 map
= isl_map_cow(map
);
6959 set
= (struct isl_set
*)map
;
6960 set
->dim
= isl_space_domain(set
->dim
);
6963 for (i
= 0; i
< map
->n
; ++i
) {
6964 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6968 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6969 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6976 /* Return the union of "map1" and "map2", where we assume for now that
6977 * "map1" and "map2" are disjoint. Note that the basic maps inside
6978 * "map1" or "map2" may not be disjoint from each other.
6979 * Also note that this function is also called from isl_map_union,
6980 * which takes care of handling the situation where "map1" and "map2"
6981 * may not be disjoint.
6983 * If one of the inputs is empty, we can simply return the other input.
6984 * Similarly, if one of the inputs is universal, then it is equal to the union.
6986 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6987 __isl_take isl_map
*map2
)
6991 struct isl_map
*map
= NULL
;
7006 is_universe
= isl_map_plain_is_universe(map1
);
7007 if (is_universe
< 0)
7014 is_universe
= isl_map_plain_is_universe(map2
);
7015 if (is_universe
< 0)
7022 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
7024 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7025 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7026 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7028 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7029 map1
->n
+ map2
->n
, flags
);
7032 for (i
= 0; i
< map1
->n
; ++i
) {
7033 map
= isl_map_add_basic_map(map
,
7034 isl_basic_map_copy(map1
->p
[i
]));
7038 for (i
= 0; i
< map2
->n
; ++i
) {
7039 map
= isl_map_add_basic_map(map
,
7040 isl_basic_map_copy(map2
->p
[i
]));
7054 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7055 __isl_take isl_map
*map2
)
7057 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7060 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
7062 map1
= isl_map_union_disjoint(map1
, map2
);
7066 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7070 struct isl_set
*isl_set_union_disjoint(
7071 struct isl_set
*set1
, struct isl_set
*set2
)
7073 return (struct isl_set
*)
7074 isl_map_union_disjoint(
7075 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7078 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7080 return (struct isl_set
*)
7081 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7084 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7087 * "map" and "set" are assumed to be compatible and non-NULL.
7089 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7090 __isl_take isl_set
*set
,
7091 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7092 __isl_take isl_basic_set
*bset
))
7095 struct isl_map
*result
;
7098 if (isl_set_plain_is_universe(set
)) {
7103 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7104 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7105 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7107 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7108 map
->n
* set
->n
, flags
);
7109 for (i
= 0; result
&& i
< map
->n
; ++i
)
7110 for (j
= 0; j
< set
->n
; ++j
) {
7111 result
= isl_map_add_basic_map(result
,
7112 fn(isl_basic_map_copy(map
->p
[i
]),
7113 isl_basic_set_copy(set
->p
[j
])));
7123 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7124 __isl_take isl_set
*set
)
7129 if (!isl_map_compatible_range(map
, set
))
7130 isl_die(set
->ctx
, isl_error_invalid
,
7131 "incompatible spaces", goto error
);
7133 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7140 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7141 __isl_take isl_set
*set
)
7143 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7146 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7147 __isl_take isl_set
*set
)
7152 if (!isl_map_compatible_domain(map
, set
))
7153 isl_die(set
->ctx
, isl_error_invalid
,
7154 "incompatible spaces", goto error
);
7156 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7163 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7164 __isl_take isl_set
*set
)
7166 return isl_map_align_params_map_map_and(map
, set
,
7167 &map_intersect_domain
);
7170 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7171 __isl_take isl_map
*map2
)
7175 map1
= isl_map_reverse(map1
);
7176 map1
= isl_map_apply_range(map1
, map2
);
7177 return isl_map_reverse(map1
);
7184 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7185 __isl_take isl_map
*map2
)
7187 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7190 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7191 __isl_take isl_map
*map2
)
7193 isl_space
*dim_result
;
7194 struct isl_map
*result
;
7200 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7201 isl_space_copy(map2
->dim
));
7203 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7206 for (i
= 0; i
< map1
->n
; ++i
)
7207 for (j
= 0; j
< map2
->n
; ++j
) {
7208 result
= isl_map_add_basic_map(result
,
7209 isl_basic_map_apply_range(
7210 isl_basic_map_copy(map1
->p
[i
]),
7211 isl_basic_map_copy(map2
->p
[j
])));
7217 if (result
&& result
->n
<= 1)
7218 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7226 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7227 __isl_take isl_map
*map2
)
7229 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7233 * returns range - domain
7235 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7237 isl_space
*dims
, *target_dim
;
7238 struct isl_basic_set
*bset
;
7245 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7246 bmap
->dim
, isl_dim_out
),
7248 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7249 dim
= isl_basic_map_n_in(bmap
);
7250 nparam
= isl_basic_map_n_param(bmap
);
7251 bset
= isl_basic_set_from_basic_map(bmap
);
7252 bset
= isl_basic_set_cow(bset
);
7253 dims
= isl_basic_set_get_space(bset
);
7254 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7255 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7256 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7257 for (i
= 0; i
< dim
; ++i
) {
7258 int j
= isl_basic_map_alloc_equality(
7259 (struct isl_basic_map
*)bset
);
7261 bset
= isl_basic_set_free(bset
);
7264 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7265 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7266 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7267 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7269 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7270 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7273 isl_basic_map_free(bmap
);
7278 * returns range - domain
7280 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7284 struct isl_set
*result
;
7289 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7290 map
->dim
, isl_dim_out
),
7292 dim
= isl_map_get_space(map
);
7293 dim
= isl_space_domain(dim
);
7294 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7297 for (i
= 0; i
< map
->n
; ++i
)
7298 result
= isl_set_add_basic_set(result
,
7299 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7308 * returns [domain -> range] -> range - domain
7310 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7311 __isl_take isl_basic_map
*bmap
)
7315 isl_basic_map
*domain
;
7319 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7320 isl_die(bmap
->ctx
, isl_error_invalid
,
7321 "domain and range don't match", goto error
);
7323 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7324 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7326 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7327 domain
= isl_basic_map_universe(dim
);
7329 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7330 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7331 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7333 total
= isl_basic_map_total_dim(bmap
);
7335 for (i
= 0; i
< n
; ++i
) {
7336 k
= isl_basic_map_alloc_equality(bmap
);
7339 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7340 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7341 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7342 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7345 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7346 return isl_basic_map_finalize(bmap
);
7348 isl_basic_map_free(bmap
);
7353 * returns [domain -> range] -> range - domain
7355 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7358 isl_space
*domain_dim
;
7363 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7364 isl_die(map
->ctx
, isl_error_invalid
,
7365 "domain and range don't match", goto error
);
7367 map
= isl_map_cow(map
);
7371 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7372 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7373 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7376 for (i
= 0; i
< map
->n
; ++i
) {
7377 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7381 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7388 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7390 struct isl_basic_map
*bmap
;
7398 nparam
= dims
->nparam
;
7400 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7404 for (i
= 0; i
< dim
; ++i
) {
7405 int j
= isl_basic_map_alloc_equality(bmap
);
7408 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7409 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7410 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7412 return isl_basic_map_finalize(bmap
);
7414 isl_basic_map_free(bmap
);
7418 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7422 if (dim
->n_in
!= dim
->n_out
)
7423 isl_die(dim
->ctx
, isl_error_invalid
,
7424 "number of input and output dimensions needs to be "
7425 "the same", goto error
);
7426 return basic_map_identity(dim
);
7428 isl_space_free(dim
);
7432 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7434 if (!model
|| !model
->dim
)
7436 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7439 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7441 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7444 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7446 if (!model
|| !model
->dim
)
7448 return isl_map_identity(isl_space_copy(model
->dim
));
7451 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7453 if (!model
|| !model
->dim
)
7455 return isl_map_identity(isl_space_copy(model
->dim
));
7458 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7460 isl_space
*dim
= isl_set_get_space(set
);
7462 id
= isl_map_identity(isl_space_map_from_set(dim
));
7463 return isl_map_intersect_range(id
, set
);
7466 /* Construct a basic set with all set dimensions having only non-negative
7469 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7470 __isl_take isl_space
*space
)
7475 struct isl_basic_set
*bset
;
7479 nparam
= space
->nparam
;
7481 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7484 for (i
= 0; i
< dim
; ++i
) {
7485 int k
= isl_basic_set_alloc_inequality(bset
);
7488 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7489 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7493 isl_basic_set_free(bset
);
7497 /* Construct the half-space x_pos >= 0.
7499 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7503 isl_basic_set
*nonneg
;
7505 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7506 k
= isl_basic_set_alloc_inequality(nonneg
);
7509 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7510 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7512 return isl_basic_set_finalize(nonneg
);
7514 isl_basic_set_free(nonneg
);
7518 /* Construct the half-space x_pos <= -1.
7520 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7525 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7526 k
= isl_basic_set_alloc_inequality(neg
);
7529 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7530 isl_int_set_si(neg
->ineq
[k
][0], -1);
7531 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7533 return isl_basic_set_finalize(neg
);
7535 isl_basic_set_free(neg
);
7539 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7540 enum isl_dim_type type
, unsigned first
, unsigned n
)
7543 isl_basic_set
*nonneg
;
7551 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7553 for (i
= 0; i
< n
; ++i
) {
7554 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7555 pos(set
->dim
, type
) + first
+ i
);
7556 neg
= neg_halfspace(isl_set_get_space(set
),
7557 pos(set
->dim
, type
) + first
+ i
);
7559 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7568 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7569 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7576 if (isl_set_plain_is_empty(set
)) {
7581 return fn(set
, signs
, user
);
7584 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7586 half
= isl_set_intersect(half
, isl_set_copy(set
));
7587 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7591 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7593 half
= isl_set_intersect(half
, set
);
7594 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7600 /* Call "fn" on the intersections of "set" with each of the orthants
7601 * (except for obviously empty intersections). The orthant is identified
7602 * by the signs array, with each entry having value 1 or -1 according
7603 * to the sign of the corresponding variable.
7605 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7606 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7616 if (isl_set_plain_is_empty(set
))
7619 nparam
= isl_set_dim(set
, isl_dim_param
);
7620 nvar
= isl_set_dim(set
, isl_dim_set
);
7622 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7624 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7632 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7634 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7637 int isl_basic_map_is_subset(
7638 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7641 struct isl_map
*map1
;
7642 struct isl_map
*map2
;
7644 if (!bmap1
|| !bmap2
)
7647 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7648 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7650 is_subset
= isl_map_is_subset(map1
, map2
);
7658 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7659 __isl_keep isl_basic_set
*bset2
)
7661 return isl_basic_map_is_subset(bset1
, bset2
);
7664 int isl_basic_map_is_equal(
7665 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7669 if (!bmap1
|| !bmap2
)
7671 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7674 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7678 int isl_basic_set_is_equal(
7679 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7681 return isl_basic_map_is_equal(
7682 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7685 int isl_map_is_empty(struct isl_map
*map
)
7692 for (i
= 0; i
< map
->n
; ++i
) {
7693 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7702 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7704 return map
? map
->n
== 0 : -1;
7707 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7709 return isl_map_plain_is_empty(map
);
7712 int isl_set_plain_is_empty(struct isl_set
*set
)
7714 return set
? set
->n
== 0 : -1;
7717 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7719 return isl_set_plain_is_empty(set
);
7722 int isl_set_is_empty(struct isl_set
*set
)
7724 return isl_map_is_empty((struct isl_map
*)set
);
7727 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7732 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7735 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7740 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7743 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7749 is_subset
= isl_map_is_subset(map1
, map2
);
7752 is_subset
= isl_map_is_subset(map2
, map1
);
7756 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7758 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7761 int isl_basic_map_is_strict_subset(
7762 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7766 if (!bmap1
|| !bmap2
)
7768 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7771 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7772 if (is_subset
== -1)
7777 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7783 is_subset
= isl_map_is_subset(map1
, map2
);
7786 is_subset
= isl_map_is_subset(map2
, map1
);
7787 if (is_subset
== -1)
7792 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7794 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7797 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7801 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7804 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7808 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7811 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7818 for (i
= 0; i
< map
->n
; ++i
) {
7819 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7827 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7829 return isl_map_plain_is_universe((isl_map
*) set
);
7832 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7834 return isl_set_plain_is_universe(set
);
7837 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7839 struct isl_basic_set
*bset
= NULL
;
7840 struct isl_vec
*sample
= NULL
;
7847 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7850 if (isl_basic_map_is_universe(bmap
))
7853 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7854 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7855 copy
= isl_basic_map_remove_redundancies(copy
);
7856 empty
= isl_basic_map_plain_is_empty(copy
);
7857 isl_basic_map_free(copy
);
7861 total
= 1 + isl_basic_map_total_dim(bmap
);
7862 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7863 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7869 isl_vec_free(bmap
->sample
);
7870 bmap
->sample
= NULL
;
7871 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7874 sample
= isl_basic_set_sample_vec(bset
);
7877 empty
= sample
->size
== 0;
7878 isl_vec_free(bmap
->sample
);
7879 bmap
->sample
= sample
;
7881 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7886 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7890 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7893 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7895 return isl_basic_map_plain_is_empty(bmap
);
7898 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7902 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7905 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7907 return isl_basic_set_plain_is_empty(bset
);
7910 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7912 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7915 struct isl_map
*isl_basic_map_union(
7916 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7918 struct isl_map
*map
;
7919 if (!bmap1
|| !bmap2
)
7922 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7924 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7927 map
= isl_map_add_basic_map(map
, bmap1
);
7928 map
= isl_map_add_basic_map(map
, bmap2
);
7931 isl_basic_map_free(bmap1
);
7932 isl_basic_map_free(bmap2
);
7936 struct isl_set
*isl_basic_set_union(
7937 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7939 return (struct isl_set
*)isl_basic_map_union(
7940 (struct isl_basic_map
*)bset1
,
7941 (struct isl_basic_map
*)bset2
);
7944 /* Order divs such that any div only depends on previous divs */
7945 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7953 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7955 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7957 if (isl_int_is_zero(bmap
->div
[i
][0]))
7959 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7963 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7969 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7971 return (struct isl_basic_set
*)
7972 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7975 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7982 for (i
= 0; i
< map
->n
; ++i
) {
7983 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7994 /* Apply the expansion computed by isl_merge_divs.
7995 * The expansion itself is given by "exp" while the resulting
7996 * list of divs is given by "div".
7998 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7999 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8004 bset
= isl_basic_set_cow(bset
);
8008 if (div
->n_row
< bset
->n_div
)
8009 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8010 "not an expansion", goto error
);
8012 n_div
= bset
->n_div
;
8013 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
8014 div
->n_row
- n_div
, 0,
8015 2 * (div
->n_row
- n_div
));
8017 for (i
= n_div
; i
< div
->n_row
; ++i
)
8018 if (isl_basic_set_alloc_div(bset
) < 0)
8022 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
8023 if (j
>= 0 && exp
[j
] == i
) {
8025 isl_basic_map_swap_div(bset
, i
, j
);
8028 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
8029 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
8037 isl_basic_set_free(bset
);
8042 /* Look for a div in dst that corresponds to the div "div" in src.
8043 * The divs before "div" in src and dst are assumed to be the same.
8045 * Returns -1 if no corresponding div was found and the position
8046 * of the corresponding div in dst otherwise.
8048 static int find_div(struct isl_basic_map
*dst
,
8049 struct isl_basic_map
*src
, unsigned div
)
8053 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8055 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8056 for (i
= div
; i
< dst
->n_div
; ++i
)
8057 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8058 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8059 dst
->n_div
- div
) == -1)
8064 struct isl_basic_map
*isl_basic_map_align_divs(
8065 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
8073 if (src
->n_div
== 0)
8076 for (i
= 0; i
< src
->n_div
; ++i
)
8077 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
8079 src
= isl_basic_map_order_divs(src
);
8080 dst
= isl_basic_map_cow(dst
);
8083 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
8084 src
->n_div
, 0, 2 * src
->n_div
);
8087 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8088 for (i
= 0; i
< src
->n_div
; ++i
) {
8089 int j
= find_div(dst
, src
, i
);
8091 j
= isl_basic_map_alloc_div(dst
);
8094 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8095 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8096 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8100 isl_basic_map_swap_div(dst
, i
, j
);
8104 isl_basic_map_free(dst
);
8108 struct isl_basic_set
*isl_basic_set_align_divs(
8109 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8111 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8112 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8115 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8123 map
= isl_map_compute_divs(map
);
8124 map
= isl_map_cow(map
);
8128 for (i
= 1; i
< map
->n
; ++i
)
8129 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8130 for (i
= 1; i
< map
->n
; ++i
) {
8131 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8133 return isl_map_free(map
);
8136 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8140 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8142 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8145 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8146 __isl_take isl_map
*map
)
8150 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8151 map
= isl_map_intersect_domain(map
, set
);
8152 set
= isl_map_range(map
);
8160 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8161 __isl_take isl_map
*map
)
8163 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8166 /* There is no need to cow as removing empty parts doesn't change
8167 * the meaning of the set.
8169 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8176 for (i
= map
->n
- 1; i
>= 0; --i
)
8177 remove_if_empty(map
, i
);
8182 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8184 return (struct isl_set
*)
8185 isl_map_remove_empty_parts((struct isl_map
*)set
);
8188 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8190 struct isl_basic_map
*bmap
;
8191 if (!map
|| map
->n
== 0)
8193 bmap
= map
->p
[map
->n
-1];
8194 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8195 return isl_basic_map_copy(bmap
);
8198 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8200 return (struct isl_basic_set
*)
8201 isl_map_copy_basic_map((struct isl_map
*)set
);
8204 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8205 __isl_keep isl_basic_map
*bmap
)
8211 for (i
= map
->n
-1; i
>= 0; --i
) {
8212 if (map
->p
[i
] != bmap
)
8214 map
= isl_map_cow(map
);
8217 isl_basic_map_free(map
->p
[i
]);
8218 if (i
!= map
->n
-1) {
8219 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8220 map
->p
[i
] = map
->p
[map
->n
-1];
8231 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8232 struct isl_basic_set
*bset
)
8234 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8235 (struct isl_basic_map
*)bset
);
8238 /* Given two basic sets bset1 and bset2, compute the maximal difference
8239 * between the values of dimension pos in bset1 and those in bset2
8240 * for any common value of the parameters and dimensions preceding pos.
8242 static enum isl_lp_result
basic_set_maximal_difference_at(
8243 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8244 int pos
, isl_int
*opt
)
8247 struct isl_basic_map
*bmap1
= NULL
;
8248 struct isl_basic_map
*bmap2
= NULL
;
8249 struct isl_ctx
*ctx
;
8250 struct isl_vec
*obj
;
8253 unsigned dim1
, dim2
;
8254 enum isl_lp_result res
;
8256 if (!bset1
|| !bset2
)
8257 return isl_lp_error
;
8259 nparam
= isl_basic_set_n_param(bset1
);
8260 dim1
= isl_basic_set_n_dim(bset1
);
8261 dim2
= isl_basic_set_n_dim(bset2
);
8262 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8263 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8264 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8265 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8266 if (!bmap1
|| !bmap2
)
8268 bmap1
= isl_basic_map_cow(bmap1
);
8269 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8270 pos
, (dim1
- pos
) + (dim2
- pos
),
8271 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8272 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8275 total
= isl_basic_map_total_dim(bmap1
);
8277 obj
= isl_vec_alloc(ctx
, 1 + total
);
8280 isl_seq_clr(obj
->block
.data
, 1 + total
);
8281 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8282 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8283 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8285 isl_basic_map_free(bmap1
);
8289 isl_basic_map_free(bmap2
);
8291 isl_basic_map_free(bmap1
);
8292 return isl_lp_error
;
8295 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8296 * for any common value of the parameters and dimensions preceding pos
8297 * in both basic sets, the values of dimension pos in bset1 are
8298 * smaller or larger than those in bset2.
8301 * 1 if bset1 follows bset2
8302 * -1 if bset1 precedes bset2
8303 * 0 if bset1 and bset2 are incomparable
8304 * -2 if some error occurred.
8306 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8307 struct isl_basic_set
*bset2
, int pos
)
8310 enum isl_lp_result res
;
8315 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8317 if (res
== isl_lp_empty
)
8319 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8320 res
== isl_lp_unbounded
)
8322 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8331 /* Given two basic sets bset1 and bset2, check whether
8332 * for any common value of the parameters and dimensions preceding pos
8333 * there is a value of dimension pos in bset1 that is larger
8334 * than a value of the same dimension in bset2.
8337 * 1 if there exists such a pair
8338 * 0 if there is no such pair, but there is a pair of equal values
8340 * -2 if some error occurred.
8342 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8343 __isl_keep isl_basic_set
*bset2
, int pos
)
8346 enum isl_lp_result res
;
8351 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8353 if (res
== isl_lp_empty
)
8355 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8356 res
== isl_lp_unbounded
)
8358 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8360 else if (res
== isl_lp_ok
)
8369 /* Given two sets set1 and set2, check whether
8370 * for any common value of the parameters and dimensions preceding pos
8371 * there is a value of dimension pos in set1 that is larger
8372 * than a value of the same dimension in set2.
8375 * 1 if there exists such a pair
8376 * 0 if there is no such pair, but there is a pair of equal values
8378 * -2 if some error occurred.
8380 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8381 __isl_keep isl_set
*set2
, int pos
)
8389 for (i
= 0; i
< set1
->n
; ++i
)
8390 for (j
= 0; j
< set2
->n
; ++j
) {
8392 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8393 if (f
== 1 || f
== -2)
8402 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8403 unsigned pos
, isl_int
*val
)
8411 total
= isl_basic_map_total_dim(bmap
);
8412 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8413 for (; d
+1 > pos
; --d
)
8414 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8418 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8420 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8422 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8425 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8431 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8432 unsigned pos
, isl_int
*val
)
8444 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8447 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8448 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8449 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8450 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8454 isl_int_set(*val
, v
);
8460 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8461 unsigned pos
, isl_int
*val
)
8463 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8467 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8470 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8473 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8474 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8476 if (pos
>= isl_basic_map_dim(bmap
, type
))
8478 return isl_basic_map_plain_has_fixed_var(bmap
,
8479 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8482 /* If "bmap" obviously lies on a hyperplane where the given dimension
8483 * has a fixed value, then return that value.
8484 * Otherwise return NaN.
8486 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8487 __isl_keep isl_basic_map
*bmap
,
8488 enum isl_dim_type type
, unsigned pos
)
8496 ctx
= isl_basic_map_get_ctx(bmap
);
8497 v
= isl_val_alloc(ctx
);
8500 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8502 return isl_val_free(v
);
8504 isl_int_set_si(v
->d
, 1);
8508 return isl_val_nan(ctx
);
8511 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8512 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8514 if (pos
>= isl_map_dim(map
, type
))
8516 return isl_map_plain_has_fixed_var(map
,
8517 map_offset(map
, type
) - 1 + pos
, val
);
8520 /* If "map" obviously lies on a hyperplane where the given dimension
8521 * has a fixed value, then return that value.
8522 * Otherwise return NaN.
8524 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8525 enum isl_dim_type type
, unsigned pos
)
8533 ctx
= isl_map_get_ctx(map
);
8534 v
= isl_val_alloc(ctx
);
8537 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8539 return isl_val_free(v
);
8541 isl_int_set_si(v
->d
, 1);
8545 return isl_val_nan(ctx
);
8548 /* If "set" obviously lies on a hyperplane where the given dimension
8549 * has a fixed value, then return that value.
8550 * Otherwise return NaN.
8552 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8553 enum isl_dim_type type
, unsigned pos
)
8555 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8558 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8559 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8561 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8564 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8565 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8567 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8570 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8571 * then return this fixed value in *val.
8573 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8574 unsigned dim
, isl_int
*val
)
8576 return isl_basic_set_plain_has_fixed_var(bset
,
8577 isl_basic_set_n_param(bset
) + dim
, val
);
8580 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8581 * then return this fixed value in *val.
8583 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8584 unsigned dim
, isl_int
*val
)
8586 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8589 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8590 unsigned dim
, isl_int
*val
)
8592 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8595 /* Check if input variable in has fixed value and if so and if val is not NULL,
8596 * then return this fixed value in *val.
8598 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8599 unsigned in
, isl_int
*val
)
8601 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8604 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8605 * and if val is not NULL, then return this lower bound in *val.
8607 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8608 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8610 int i
, i_eq
= -1, i_ineq
= -1;
8617 total
= isl_basic_set_total_dim(bset
);
8618 nparam
= isl_basic_set_n_param(bset
);
8619 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8620 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8626 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8627 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8629 if (i_eq
!= -1 || i_ineq
!= -1)
8633 if (i_eq
== -1 && i_ineq
== -1)
8635 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8636 /* The coefficient should always be one due to normalization. */
8637 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8639 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8641 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8642 total
- nparam
- dim
- 1) != -1)
8645 isl_int_neg(*val
, c
[0]);
8649 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8650 unsigned dim
, isl_int
*val
)
8662 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8666 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8668 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8669 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8671 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8675 isl_int_set(*val
, v
);
8686 /* uset_gist depends on constraints without existentially quantified
8687 * variables sorting first.
8689 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8691 const struct constraint
*c1
= (const struct constraint
*)p1
;
8692 const struct constraint
*c2
= (const struct constraint
*)p2
;
8694 unsigned size
= isl_min(c1
->size
, c2
->size
);
8696 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8697 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8702 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8705 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8706 struct isl_basic_map
*bmap
)
8709 struct constraint
*c
;
8714 if (bmap
->n_ineq
== 0)
8716 total
= isl_basic_map_total_dim(bmap
);
8717 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8720 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8722 c
[i
].c
= bmap
->ineq
[i
];
8724 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8725 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8726 bmap
->ineq
[i
] = c
[i
].c
;
8730 isl_basic_map_free(bmap
);
8734 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8735 __isl_take isl_basic_set
*bset
)
8737 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8738 (struct isl_basic_map
*)bset
);
8741 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8745 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8747 bmap
= isl_basic_map_remove_redundancies(bmap
);
8748 bmap
= isl_basic_map_sort_constraints(bmap
);
8750 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8754 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8756 return (struct isl_basic_set
*)isl_basic_map_normalize(
8757 (struct isl_basic_map
*)bset
);
8760 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8761 const __isl_keep isl_basic_map
*bmap2
)
8768 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8769 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8770 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8771 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8772 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8773 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8774 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8775 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8776 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8777 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8778 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8780 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8782 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8784 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8785 return bmap1
->n_eq
- bmap2
->n_eq
;
8786 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8787 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8788 if (bmap1
->n_div
!= bmap2
->n_div
)
8789 return bmap1
->n_div
- bmap2
->n_div
;
8790 total
= isl_basic_map_total_dim(bmap1
);
8791 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8792 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8796 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8797 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8801 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8802 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8809 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8810 const __isl_keep isl_basic_set
*bset2
)
8812 return isl_basic_map_plain_cmp(bset1
, bset2
);
8815 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8821 if (set1
->n
!= set2
->n
)
8822 return set1
->n
- set2
->n
;
8824 for (i
= 0; i
< set1
->n
; ++i
) {
8825 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8833 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8834 __isl_keep isl_basic_map
*bmap2
)
8836 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8839 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8840 __isl_keep isl_basic_set
*bset2
)
8842 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8843 (isl_basic_map
*)bset2
);
8846 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8848 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8849 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8851 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8854 /* We normalize in place, but if anything goes wrong we need
8855 * to return NULL, so we need to make sure we don't change the
8856 * meaning of any possible other copies of map.
8858 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8861 struct isl_basic_map
*bmap
;
8865 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8867 for (i
= 0; i
< map
->n
; ++i
) {
8868 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8871 isl_basic_map_free(map
->p
[i
]);
8874 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8875 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8876 map
= isl_map_remove_empty_parts(map
);
8879 for (i
= map
->n
- 1; i
>= 1; --i
) {
8880 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8882 isl_basic_map_free(map
->p
[i
-1]);
8883 for (j
= i
; j
< map
->n
; ++j
)
8884 map
->p
[j
-1] = map
->p
[j
];
8894 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8896 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8899 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8909 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8912 map1
= isl_map_copy(map1
);
8913 map2
= isl_map_copy(map2
);
8914 map1
= isl_map_normalize(map1
);
8915 map2
= isl_map_normalize(map2
);
8918 equal
= map1
->n
== map2
->n
;
8919 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8920 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8933 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8935 return isl_map_plain_is_equal(map1
, map2
);
8938 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8940 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8941 (struct isl_map
*)set2
);
8944 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8946 return isl_set_plain_is_equal(set1
, set2
);
8949 /* Return an interval that ranges from min to max (inclusive)
8951 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8952 isl_int min
, isl_int max
)
8955 struct isl_basic_set
*bset
= NULL
;
8957 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8961 k
= isl_basic_set_alloc_inequality(bset
);
8964 isl_int_set_si(bset
->ineq
[k
][1], 1);
8965 isl_int_neg(bset
->ineq
[k
][0], min
);
8967 k
= isl_basic_set_alloc_inequality(bset
);
8970 isl_int_set_si(bset
->ineq
[k
][1], -1);
8971 isl_int_set(bset
->ineq
[k
][0], max
);
8975 isl_basic_set_free(bset
);
8979 /* Return the Cartesian product of the basic sets in list (in the given order).
8981 __isl_give isl_basic_set
*isl_basic_set_list_product(
8982 __isl_take
struct isl_basic_set_list
*list
)
8990 struct isl_basic_set
*product
= NULL
;
8994 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8995 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8996 nparam
= isl_basic_set_n_param(list
->p
[0]);
8997 dim
= isl_basic_set_n_dim(list
->p
[0]);
8998 extra
= list
->p
[0]->n_div
;
8999 n_eq
= list
->p
[0]->n_eq
;
9000 n_ineq
= list
->p
[0]->n_ineq
;
9001 for (i
= 1; i
< list
->n
; ++i
) {
9002 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9003 isl_assert(list
->ctx
,
9004 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9005 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9006 extra
+= list
->p
[i
]->n_div
;
9007 n_eq
+= list
->p
[i
]->n_eq
;
9008 n_ineq
+= list
->p
[i
]->n_ineq
;
9010 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9015 for (i
= 0; i
< list
->n
; ++i
) {
9016 isl_basic_set_add_constraints(product
,
9017 isl_basic_set_copy(list
->p
[i
]), dim
);
9018 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9020 isl_basic_set_list_free(list
);
9023 isl_basic_set_free(product
);
9024 isl_basic_set_list_free(list
);
9028 struct isl_basic_map
*isl_basic_map_product(
9029 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9031 isl_space
*dim_result
= NULL
;
9032 struct isl_basic_map
*bmap
;
9033 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9034 struct isl_dim_map
*dim_map1
, *dim_map2
;
9036 if (!bmap1
|| !bmap2
)
9039 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9040 bmap2
->dim
, isl_dim_param
), goto error
);
9041 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9042 isl_space_copy(bmap2
->dim
));
9044 in1
= isl_basic_map_n_in(bmap1
);
9045 in2
= isl_basic_map_n_in(bmap2
);
9046 out1
= isl_basic_map_n_out(bmap1
);
9047 out2
= isl_basic_map_n_out(bmap2
);
9048 nparam
= isl_basic_map_n_param(bmap1
);
9050 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9051 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9052 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9053 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9054 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9055 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9056 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9057 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9058 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9059 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9060 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9062 bmap
= isl_basic_map_alloc_space(dim_result
,
9063 bmap1
->n_div
+ bmap2
->n_div
,
9064 bmap1
->n_eq
+ bmap2
->n_eq
,
9065 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9066 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9067 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9068 bmap
= isl_basic_map_simplify(bmap
);
9069 return isl_basic_map_finalize(bmap
);
9071 isl_basic_map_free(bmap1
);
9072 isl_basic_map_free(bmap2
);
9076 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9077 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9079 isl_basic_map
*prod
;
9081 prod
= isl_basic_map_product(bmap1
, bmap2
);
9082 prod
= isl_basic_map_flatten(prod
);
9086 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9087 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9089 return isl_basic_map_flat_range_product(bset1
, bset2
);
9092 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9093 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9095 isl_space
*space_result
= NULL
;
9096 isl_basic_map
*bmap
;
9097 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9098 struct isl_dim_map
*dim_map1
, *dim_map2
;
9100 if (!bmap1
|| !bmap2
)
9103 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9104 isl_space_copy(bmap2
->dim
));
9106 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9107 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9108 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9109 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9111 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9112 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9113 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9114 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9115 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9116 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9117 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9118 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9119 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9120 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9121 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9123 bmap
= isl_basic_map_alloc_space(space_result
,
9124 bmap1
->n_div
+ bmap2
->n_div
,
9125 bmap1
->n_eq
+ bmap2
->n_eq
,
9126 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9127 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9128 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9129 bmap
= isl_basic_map_simplify(bmap
);
9130 return isl_basic_map_finalize(bmap
);
9132 isl_basic_map_free(bmap1
);
9133 isl_basic_map_free(bmap2
);
9137 __isl_give isl_basic_map
*isl_basic_map_range_product(
9138 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9140 isl_space
*dim_result
= NULL
;
9141 isl_basic_map
*bmap
;
9142 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9143 struct isl_dim_map
*dim_map1
, *dim_map2
;
9145 if (!bmap1
|| !bmap2
)
9148 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9149 bmap2
->dim
, isl_dim_param
))
9150 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9151 "parameters don't match", goto error
);
9153 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9154 isl_space_copy(bmap2
->dim
));
9156 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9157 out1
= isl_basic_map_n_out(bmap1
);
9158 out2
= isl_basic_map_n_out(bmap2
);
9159 nparam
= isl_basic_map_n_param(bmap1
);
9161 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9162 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9163 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9164 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9165 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9166 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9167 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9168 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9169 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9170 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9171 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9173 bmap
= isl_basic_map_alloc_space(dim_result
,
9174 bmap1
->n_div
+ bmap2
->n_div
,
9175 bmap1
->n_eq
+ bmap2
->n_eq
,
9176 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9177 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9178 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9179 bmap
= isl_basic_map_simplify(bmap
);
9180 return isl_basic_map_finalize(bmap
);
9182 isl_basic_map_free(bmap1
);
9183 isl_basic_map_free(bmap2
);
9187 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9188 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9190 isl_basic_map
*prod
;
9192 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9193 prod
= isl_basic_map_flatten_range(prod
);
9197 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9198 __isl_take isl_map
*map2
,
9199 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
9200 __isl_take isl_space
*right
),
9201 __isl_give isl_basic_map
*(*basic_map_product
)(
9202 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
9205 struct isl_map
*result
;
9211 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9212 map2
->dim
, isl_dim_param
), goto error
);
9214 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9215 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9216 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9218 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
9219 isl_space_copy(map2
->dim
)),
9220 map1
->n
* map2
->n
, flags
);
9223 for (i
= 0; i
< map1
->n
; ++i
)
9224 for (j
= 0; j
< map2
->n
; ++j
) {
9225 struct isl_basic_map
*part
;
9226 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9227 isl_basic_map_copy(map2
->p
[j
]));
9228 if (isl_basic_map_is_empty(part
))
9229 isl_basic_map_free(part
);
9231 result
= isl_map_add_basic_map(result
, part
);
9244 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9246 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9247 __isl_take isl_map
*map2
)
9249 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
9252 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9253 __isl_take isl_map
*map2
)
9255 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9258 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9260 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9261 __isl_take isl_map
*map2
)
9265 prod
= isl_map_product(map1
, map2
);
9266 prod
= isl_map_flatten(prod
);
9270 /* Given two set A and B, construct its Cartesian product A x B.
9272 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9274 return isl_map_range_product(set1
, set2
);
9277 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9278 __isl_take isl_set
*set2
)
9280 return isl_map_flat_range_product(set1
, set2
);
9283 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9285 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9286 __isl_take isl_map
*map2
)
9288 return map_product(map1
, map2
, &isl_space_domain_product
,
9289 &isl_basic_map_domain_product
);
9292 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9294 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9295 __isl_take isl_map
*map2
)
9297 return map_product(map1
, map2
, &isl_space_range_product
,
9298 &isl_basic_map_range_product
);
9301 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9302 __isl_take isl_map
*map2
)
9304 return isl_map_align_params_map_map_and(map1
, map2
,
9305 &map_domain_product_aligned
);
9308 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9309 __isl_take isl_map
*map2
)
9311 return isl_map_align_params_map_map_and(map1
, map2
,
9312 &map_range_product_aligned
);
9315 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9317 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9318 __isl_take isl_map
*map2
)
9322 prod
= isl_map_domain_product(map1
, map2
);
9323 prod
= isl_map_flatten_domain(prod
);
9327 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9329 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9330 __isl_take isl_map
*map2
)
9334 prod
= isl_map_range_product(map1
, map2
);
9335 prod
= isl_map_flatten_range(prod
);
9339 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9342 uint32_t hash
= isl_hash_init();
9347 bmap
= isl_basic_map_copy(bmap
);
9348 bmap
= isl_basic_map_normalize(bmap
);
9351 total
= isl_basic_map_total_dim(bmap
);
9352 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9353 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9355 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9356 isl_hash_hash(hash
, c_hash
);
9358 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9359 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9361 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9362 isl_hash_hash(hash
, c_hash
);
9364 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9365 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9367 if (isl_int_is_zero(bmap
->div
[i
][0]))
9369 isl_hash_byte(hash
, i
& 0xFF);
9370 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9371 isl_hash_hash(hash
, c_hash
);
9373 isl_basic_map_free(bmap
);
9377 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9379 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9382 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9389 map
= isl_map_copy(map
);
9390 map
= isl_map_normalize(map
);
9394 hash
= isl_hash_init();
9395 for (i
= 0; i
< map
->n
; ++i
) {
9397 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9398 isl_hash_hash(hash
, bmap_hash
);
9406 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9408 return isl_map_get_hash((isl_map
*)set
);
9411 /* Check if the value for dimension dim is completely determined
9412 * by the values of the other parameters and variables.
9413 * That is, check if dimension dim is involved in an equality.
9415 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9422 nparam
= isl_basic_set_n_param(bset
);
9423 for (i
= 0; i
< bset
->n_eq
; ++i
)
9424 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9429 /* Check if the value for dimension dim is completely determined
9430 * by the values of the other parameters and variables.
9431 * That is, check if dimension dim is involved in an equality
9432 * for each of the subsets.
9434 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9440 for (i
= 0; i
< set
->n
; ++i
) {
9442 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9449 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9451 return set
? set
->n
: 0;
9454 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9455 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9462 for (i
= 0; i
< map
->n
; ++i
)
9463 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9469 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9470 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9477 for (i
= 0; i
< set
->n
; ++i
)
9478 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9484 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9491 bset
= isl_basic_set_cow(bset
);
9495 dim
= isl_basic_set_get_space(bset
);
9496 dim
= isl_space_lift(dim
, bset
->n_div
);
9499 isl_space_free(bset
->dim
);
9501 bset
->extra
-= bset
->n_div
;
9504 bset
= isl_basic_set_finalize(bset
);
9508 isl_basic_set_free(bset
);
9512 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9518 set
= isl_set_align_divs(set
);
9523 set
= isl_set_cow(set
);
9527 n_div
= set
->p
[0]->n_div
;
9528 dim
= isl_set_get_space(set
);
9529 dim
= isl_space_lift(dim
, n_div
);
9532 isl_space_free(set
->dim
);
9535 for (i
= 0; i
< set
->n
; ++i
) {
9536 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9547 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9550 struct isl_basic_map
*bmap
;
9557 set
= isl_set_align_divs(set
);
9562 dim
= isl_set_get_space(set
);
9563 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9565 return isl_map_identity(isl_space_map_from_set(dim
));
9568 n_div
= set
->p
[0]->n_div
;
9569 dim
= isl_space_map_from_set(dim
);
9570 n_param
= isl_space_dim(dim
, isl_dim_param
);
9571 n_set
= isl_space_dim(dim
, isl_dim_in
);
9572 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9573 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9574 for (i
= 0; i
< n_set
; ++i
)
9575 bmap
= var_equal(bmap
, i
);
9577 total
= n_param
+ n_set
+ n_set
+ n_div
;
9578 for (i
= 0; i
< n_div
; ++i
) {
9579 k
= isl_basic_map_alloc_inequality(bmap
);
9582 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9583 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9584 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9585 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9586 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9587 set
->p
[0]->div
[i
][0]);
9589 l
= isl_basic_map_alloc_inequality(bmap
);
9592 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9593 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9594 set
->p
[0]->div
[i
][0]);
9595 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9599 bmap
= isl_basic_map_simplify(bmap
);
9600 bmap
= isl_basic_map_finalize(bmap
);
9601 return isl_map_from_basic_map(bmap
);
9604 isl_basic_map_free(bmap
);
9608 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9616 dim
= isl_basic_set_total_dim(bset
);
9617 size
+= bset
->n_eq
* (1 + dim
);
9618 size
+= bset
->n_ineq
* (1 + dim
);
9619 size
+= bset
->n_div
* (2 + dim
);
9624 int isl_set_size(__isl_keep isl_set
*set
)
9632 for (i
= 0; i
< set
->n
; ++i
)
9633 size
+= isl_basic_set_size(set
->p
[i
]);
9638 /* Check if there is any lower bound (if lower == 0) and/or upper
9639 * bound (if upper == 0) on the specified dim.
9641 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9642 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9649 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9651 pos
+= isl_basic_map_offset(bmap
, type
);
9653 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9654 if (isl_int_is_zero(bmap
->div
[i
][0]))
9656 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9660 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9661 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9664 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9665 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9672 return lower
&& upper
;
9675 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9676 enum isl_dim_type type
, unsigned pos
)
9678 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9681 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9682 enum isl_dim_type type
, unsigned pos
)
9684 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9687 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9688 enum isl_dim_type type
, unsigned pos
)
9690 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9693 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9694 enum isl_dim_type type
, unsigned pos
)
9701 for (i
= 0; i
< map
->n
; ++i
) {
9703 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9704 if (bounded
< 0 || !bounded
)
9711 /* Return 1 if the specified dim is involved in both an upper bound
9712 * and a lower bound.
9714 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9715 enum isl_dim_type type
, unsigned pos
)
9717 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9720 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9722 static int has_any_bound(__isl_keep isl_map
*map
,
9723 enum isl_dim_type type
, unsigned pos
,
9724 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9725 enum isl_dim_type type
, unsigned pos
))
9732 for (i
= 0; i
< map
->n
; ++i
) {
9734 bounded
= fn(map
->p
[i
], type
, pos
);
9735 if (bounded
< 0 || bounded
)
9742 /* Return 1 if the specified dim is involved in any lower bound.
9744 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9745 enum isl_dim_type type
, unsigned pos
)
9747 return has_any_bound(set
, type
, pos
,
9748 &isl_basic_map_dim_has_lower_bound
);
9751 /* Return 1 if the specified dim is involved in any upper bound.
9753 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9754 enum isl_dim_type type
, unsigned pos
)
9756 return has_any_bound(set
, type
, pos
,
9757 &isl_basic_map_dim_has_upper_bound
);
9760 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9762 static int has_bound(__isl_keep isl_map
*map
,
9763 enum isl_dim_type type
, unsigned pos
,
9764 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9765 enum isl_dim_type type
, unsigned pos
))
9772 for (i
= 0; i
< map
->n
; ++i
) {
9774 bounded
= fn(map
->p
[i
], type
, pos
);
9775 if (bounded
< 0 || !bounded
)
9782 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9784 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9785 enum isl_dim_type type
, unsigned pos
)
9787 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9790 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9792 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9793 enum isl_dim_type type
, unsigned pos
)
9795 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9798 /* For each of the "n" variables starting at "first", determine
9799 * the sign of the variable and put the results in the first "n"
9800 * elements of the array "signs".
9802 * 1 means that the variable is non-negative
9803 * -1 means that the variable is non-positive
9804 * 0 means the variable attains both positive and negative values.
9806 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9807 unsigned first
, unsigned n
, int *signs
)
9809 isl_vec
*bound
= NULL
;
9810 struct isl_tab
*tab
= NULL
;
9811 struct isl_tab_undo
*snap
;
9814 if (!bset
|| !signs
)
9817 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9818 tab
= isl_tab_from_basic_set(bset
, 0);
9822 isl_seq_clr(bound
->el
, bound
->size
);
9823 isl_int_set_si(bound
->el
[0], -1);
9825 snap
= isl_tab_snap(tab
);
9826 for (i
= 0; i
< n
; ++i
) {
9829 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9830 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9833 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9834 if (isl_tab_rollback(tab
, snap
) < 0)
9842 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9843 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9846 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9847 if (isl_tab_rollback(tab
, snap
) < 0)
9850 signs
[i
] = empty
? -1 : 0;
9854 isl_vec_free(bound
);
9858 isl_vec_free(bound
);
9862 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9863 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9865 if (!bset
|| !signs
)
9867 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9870 first
+= pos(bset
->dim
, type
) - 1;
9871 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9874 /* Check if the given basic map is obviously single-valued.
9875 * In particular, for each output dimension, check that there is
9876 * an equality that defines the output dimension in terms of
9877 * earlier dimensions.
9879 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9889 total
= 1 + isl_basic_map_total_dim(bmap
);
9890 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9891 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9893 for (i
= 0; i
< n_out
; ++i
) {
9894 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9895 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9897 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9898 total
- (o_out
+ i
+ 1)) == -1)
9901 if (j
>= bmap
->n_eq
)
9908 /* Check if the given basic map is single-valued.
9913 * and check if the result is a subset of the identity mapping.
9915 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9918 isl_basic_map
*test
;
9922 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9926 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9927 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9929 space
= isl_basic_map_get_space(bmap
);
9930 space
= isl_space_map_from_set(isl_space_range(space
));
9931 id
= isl_basic_map_identity(space
);
9933 sv
= isl_basic_map_is_subset(test
, id
);
9935 isl_basic_map_free(test
);
9936 isl_basic_map_free(id
);
9941 /* Check if the given map is obviously single-valued.
9943 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9952 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9955 /* Check if the given map is single-valued.
9960 * and check if the result is a subset of the identity mapping.
9962 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9969 sv
= isl_map_plain_is_single_valued(map
);
9973 test
= isl_map_reverse(isl_map_copy(map
));
9974 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9976 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9977 id
= isl_map_identity(dim
);
9979 sv
= isl_map_is_subset(test
, id
);
9987 int isl_map_is_injective(__isl_keep isl_map
*map
)
9991 map
= isl_map_copy(map
);
9992 map
= isl_map_reverse(map
);
9993 in
= isl_map_is_single_valued(map
);
9999 /* Check if the given map is obviously injective.
10001 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10005 map
= isl_map_copy(map
);
10006 map
= isl_map_reverse(map
);
10007 in
= isl_map_plain_is_single_valued(map
);
10013 int isl_map_is_bijective(__isl_keep isl_map
*map
)
10017 sv
= isl_map_is_single_valued(map
);
10021 return isl_map_is_injective(map
);
10024 int isl_set_is_singleton(__isl_keep isl_set
*set
)
10026 return isl_map_is_single_valued((isl_map
*)set
);
10029 int isl_map_is_translation(__isl_keep isl_map
*map
)
10034 delta
= isl_map_deltas(isl_map_copy(map
));
10035 ok
= isl_set_is_singleton(delta
);
10036 isl_set_free(delta
);
10041 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10043 if (isl_seq_first_non_zero(p
, pos
) != -1)
10045 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10050 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10059 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10062 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10063 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10064 for (j
= 0; j
< nvar
; ++j
) {
10065 int lower
= 0, upper
= 0;
10066 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10067 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10069 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10073 if (i
< bset
->n_eq
)
10075 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10076 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10078 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10080 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10085 if (!lower
|| !upper
)
10092 int isl_set_is_box(__isl_keep isl_set
*set
)
10099 return isl_basic_set_is_box(set
->p
[0]);
10102 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10107 return isl_space_is_wrapping(bset
->dim
);
10110 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
10115 return isl_space_is_wrapping(set
->dim
);
10118 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10120 bmap
= isl_basic_map_cow(bmap
);
10124 bmap
->dim
= isl_space_wrap(bmap
->dim
);
10128 bmap
= isl_basic_map_finalize(bmap
);
10130 return (isl_basic_set
*)bmap
;
10132 isl_basic_map_free(bmap
);
10136 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
10140 map
= isl_map_cow(map
);
10144 for (i
= 0; i
< map
->n
; ++i
) {
10145 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
10149 map
->dim
= isl_space_wrap(map
->dim
);
10153 return (isl_set
*)map
;
10159 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
10161 bset
= isl_basic_set_cow(bset
);
10165 bset
->dim
= isl_space_unwrap(bset
->dim
);
10169 bset
= isl_basic_set_finalize(bset
);
10171 return (isl_basic_map
*)bset
;
10173 isl_basic_set_free(bset
);
10177 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
10184 if (!isl_set_is_wrapping(set
))
10185 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
10188 set
= isl_set_cow(set
);
10192 for (i
= 0; i
< set
->n
; ++i
) {
10193 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
10198 set
->dim
= isl_space_unwrap(set
->dim
);
10202 return (isl_map
*)set
;
10208 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
10209 enum isl_dim_type type
)
10214 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
10217 bmap
= isl_basic_map_cow(bmap
);
10221 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10225 bmap
= isl_basic_map_finalize(bmap
);
10229 isl_basic_map_free(bmap
);
10233 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10234 enum isl_dim_type type
)
10241 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10244 map
= isl_map_cow(map
);
10248 for (i
= 0; i
< map
->n
; ++i
) {
10249 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10253 map
->dim
= isl_space_reset(map
->dim
, type
);
10263 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10268 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10271 bmap
= isl_basic_map_cow(bmap
);
10275 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10279 bmap
= isl_basic_map_finalize(bmap
);
10283 isl_basic_map_free(bmap
);
10287 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10289 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10292 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10293 __isl_take isl_basic_map
*bmap
)
10298 if (!bmap
->dim
->nested
[0])
10301 bmap
= isl_basic_map_cow(bmap
);
10305 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10309 bmap
= isl_basic_map_finalize(bmap
);
10313 isl_basic_map_free(bmap
);
10317 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10318 __isl_take isl_basic_map
*bmap
)
10323 if (!bmap
->dim
->nested
[1])
10326 bmap
= isl_basic_map_cow(bmap
);
10330 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10334 bmap
= isl_basic_map_finalize(bmap
);
10338 isl_basic_map_free(bmap
);
10342 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10349 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10352 map
= isl_map_cow(map
);
10356 for (i
= 0; i
< map
->n
; ++i
) {
10357 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10361 map
->dim
= isl_space_flatten(map
->dim
);
10371 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10373 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10376 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10378 isl_space
*dim
, *flat_dim
;
10381 dim
= isl_set_get_space(set
);
10382 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10383 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10384 map
= isl_map_intersect_domain(map
, set
);
10389 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10396 if (!map
->dim
->nested
[0])
10399 map
= isl_map_cow(map
);
10403 for (i
= 0; i
< map
->n
; ++i
) {
10404 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10408 map
->dim
= isl_space_flatten_domain(map
->dim
);
10418 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10425 if (!map
->dim
->nested
[1])
10428 map
= isl_map_cow(map
);
10432 for (i
= 0; i
< map
->n
; ++i
) {
10433 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10437 map
->dim
= isl_space_flatten_range(map
->dim
);
10447 /* Reorder the dimensions of "bmap" according to the given dim_map
10448 * and set the dimension specification to "dim".
10450 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10451 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10453 isl_basic_map
*res
;
10456 bmap
= isl_basic_map_cow(bmap
);
10457 if (!bmap
|| !dim
|| !dim_map
)
10460 flags
= bmap
->flags
;
10461 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10462 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10463 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10464 res
= isl_basic_map_alloc_space(dim
,
10465 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10466 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10468 res
->flags
= flags
;
10469 res
= isl_basic_map_finalize(res
);
10473 isl_basic_map_free(bmap
);
10474 isl_space_free(dim
);
10478 /* Reorder the dimensions of "map" according to given reordering.
10480 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10481 __isl_take isl_reordering
*r
)
10484 struct isl_dim_map
*dim_map
;
10486 map
= isl_map_cow(map
);
10487 dim_map
= isl_dim_map_from_reordering(r
);
10488 if (!map
|| !r
|| !dim_map
)
10491 for (i
= 0; i
< map
->n
; ++i
) {
10492 struct isl_dim_map
*dim_map_i
;
10494 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10496 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10497 isl_space_copy(r
->dim
), dim_map_i
);
10503 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10505 isl_reordering_free(r
);
10511 isl_reordering_free(r
);
10515 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10516 __isl_take isl_reordering
*r
)
10518 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10521 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10522 __isl_take isl_space
*model
)
10526 if (!map
|| !model
)
10529 ctx
= isl_space_get_ctx(model
);
10530 if (!isl_space_has_named_params(model
))
10531 isl_die(ctx
, isl_error_invalid
,
10532 "model has unnamed parameters", goto error
);
10533 if (!isl_space_has_named_params(map
->dim
))
10534 isl_die(ctx
, isl_error_invalid
,
10535 "relation has unnamed parameters", goto error
);
10536 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10537 isl_reordering
*exp
;
10539 model
= isl_space_drop_dims(model
, isl_dim_in
,
10540 0, isl_space_dim(model
, isl_dim_in
));
10541 model
= isl_space_drop_dims(model
, isl_dim_out
,
10542 0, isl_space_dim(model
, isl_dim_out
));
10543 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10544 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10545 map
= isl_map_realign(map
, exp
);
10548 isl_space_free(model
);
10551 isl_space_free(model
);
10556 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10557 __isl_take isl_space
*model
)
10559 return isl_map_align_params(set
, model
);
10562 /* Align the parameters of "bmap" to those of "model", introducing
10563 * additional parameters if needed.
10565 __isl_give isl_basic_map
*isl_basic_map_align_params(
10566 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10570 if (!bmap
|| !model
)
10573 ctx
= isl_space_get_ctx(model
);
10574 if (!isl_space_has_named_params(model
))
10575 isl_die(ctx
, isl_error_invalid
,
10576 "model has unnamed parameters", goto error
);
10577 if (!isl_space_has_named_params(bmap
->dim
))
10578 isl_die(ctx
, isl_error_invalid
,
10579 "relation has unnamed parameters", goto error
);
10580 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10581 isl_reordering
*exp
;
10582 struct isl_dim_map
*dim_map
;
10584 model
= isl_space_drop_dims(model
, isl_dim_in
,
10585 0, isl_space_dim(model
, isl_dim_in
));
10586 model
= isl_space_drop_dims(model
, isl_dim_out
,
10587 0, isl_space_dim(model
, isl_dim_out
));
10588 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10589 exp
= isl_reordering_extend_space(exp
,
10590 isl_basic_map_get_space(bmap
));
10591 dim_map
= isl_dim_map_from_reordering(exp
);
10592 bmap
= isl_basic_map_realign(bmap
,
10593 exp
? isl_space_copy(exp
->dim
) : NULL
,
10594 isl_dim_map_extend(dim_map
, bmap
));
10595 isl_reordering_free(exp
);
10599 isl_space_free(model
);
10602 isl_space_free(model
);
10603 isl_basic_map_free(bmap
);
10607 /* Align the parameters of "bset" to those of "model", introducing
10608 * additional parameters if needed.
10610 __isl_give isl_basic_set
*isl_basic_set_align_params(
10611 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10613 return isl_basic_map_align_params(bset
, model
);
10616 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10617 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10618 enum isl_dim_type c2
, enum isl_dim_type c3
,
10619 enum isl_dim_type c4
, enum isl_dim_type c5
)
10621 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10622 struct isl_mat
*mat
;
10628 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10629 isl_basic_map_total_dim(bmap
) + 1);
10632 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10633 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10634 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10635 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10636 isl_int_set(mat
->row
[i
][pos
],
10637 bmap
->eq
[i
][off
+ k
]);
10645 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10646 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10647 enum isl_dim_type c2
, enum isl_dim_type c3
,
10648 enum isl_dim_type c4
, enum isl_dim_type c5
)
10650 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10651 struct isl_mat
*mat
;
10657 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10658 isl_basic_map_total_dim(bmap
) + 1);
10661 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10662 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10663 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10664 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10665 isl_int_set(mat
->row
[i
][pos
],
10666 bmap
->ineq
[i
][off
+ k
]);
10674 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10675 __isl_take isl_space
*dim
,
10676 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10677 enum isl_dim_type c2
, enum isl_dim_type c3
,
10678 enum isl_dim_type c4
, enum isl_dim_type c5
)
10680 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10681 isl_basic_map
*bmap
;
10687 if (!dim
|| !eq
|| !ineq
)
10690 if (eq
->n_col
!= ineq
->n_col
)
10691 isl_die(dim
->ctx
, isl_error_invalid
,
10692 "equalities and inequalities matrices should have "
10693 "same number of columns", goto error
);
10695 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10697 if (eq
->n_col
< total
)
10698 isl_die(dim
->ctx
, isl_error_invalid
,
10699 "number of columns too small", goto error
);
10701 extra
= eq
->n_col
- total
;
10703 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10704 eq
->n_row
, ineq
->n_row
);
10707 for (i
= 0; i
< extra
; ++i
) {
10708 k
= isl_basic_map_alloc_div(bmap
);
10711 isl_int_set_si(bmap
->div
[k
][0], 0);
10713 for (i
= 0; i
< eq
->n_row
; ++i
) {
10714 l
= isl_basic_map_alloc_equality(bmap
);
10717 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10718 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10719 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10720 isl_int_set(bmap
->eq
[l
][off
+ k
],
10726 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10727 l
= isl_basic_map_alloc_inequality(bmap
);
10730 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10731 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10732 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10733 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10734 ineq
->row
[i
][pos
]);
10740 isl_space_free(dim
);
10742 isl_mat_free(ineq
);
10744 bmap
= isl_basic_map_simplify(bmap
);
10745 return isl_basic_map_finalize(bmap
);
10747 isl_space_free(dim
);
10749 isl_mat_free(ineq
);
10753 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10754 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10755 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10757 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10758 c1
, c2
, c3
, c4
, isl_dim_in
);
10761 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10762 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10763 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10765 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10766 c1
, c2
, c3
, c4
, isl_dim_in
);
10769 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10770 __isl_take isl_space
*dim
,
10771 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10772 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10774 return (isl_basic_set
*)
10775 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10776 c1
, c2
, c3
, c4
, isl_dim_in
);
10779 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10784 return isl_space_can_zip(bmap
->dim
);
10787 int isl_map_can_zip(__isl_keep isl_map
*map
)
10792 return isl_space_can_zip(map
->dim
);
10795 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10796 * (A -> C) -> (B -> D).
10798 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10807 if (!isl_basic_map_can_zip(bmap
))
10808 isl_die(bmap
->ctx
, isl_error_invalid
,
10809 "basic map cannot be zipped", goto error
);
10810 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10811 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10812 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10813 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10814 bmap
= isl_basic_map_cow(bmap
);
10815 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10818 bmap
->dim
= isl_space_zip(bmap
->dim
);
10823 isl_basic_map_free(bmap
);
10827 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10828 * (A -> C) -> (B -> D).
10830 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10837 if (!isl_map_can_zip(map
))
10838 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10841 map
= isl_map_cow(map
);
10845 for (i
= 0; i
< map
->n
; ++i
) {
10846 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10851 map
->dim
= isl_space_zip(map
->dim
);
10861 /* Can we apply isl_basic_map_curry to "bmap"?
10862 * That is, does it have a nested relation in its domain?
10864 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10869 return isl_space_can_curry(bmap
->dim
);
10872 /* Can we apply isl_map_curry to "map"?
10873 * That is, does it have a nested relation in its domain?
10875 int isl_map_can_curry(__isl_keep isl_map
*map
)
10880 return isl_space_can_curry(map
->dim
);
10883 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10886 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10892 if (!isl_basic_map_can_curry(bmap
))
10893 isl_die(bmap
->ctx
, isl_error_invalid
,
10894 "basic map cannot be curried", goto error
);
10895 bmap
= isl_basic_map_cow(bmap
);
10898 bmap
->dim
= isl_space_curry(bmap
->dim
);
10903 isl_basic_map_free(bmap
);
10907 /* Given a map (A -> B) -> C, return the corresponding map
10910 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10917 if (!isl_map_can_curry(map
))
10918 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10921 map
= isl_map_cow(map
);
10925 for (i
= 0; i
< map
->n
; ++i
) {
10926 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10931 map
->dim
= isl_space_curry(map
->dim
);
10941 /* Can we apply isl_basic_map_uncurry to "bmap"?
10942 * That is, does it have a nested relation in its domain?
10944 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10949 return isl_space_can_uncurry(bmap
->dim
);
10952 /* Can we apply isl_map_uncurry to "map"?
10953 * That is, does it have a nested relation in its domain?
10955 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10960 return isl_space_can_uncurry(map
->dim
);
10963 /* Given a basic map A -> (B -> C), return the corresponding basic map
10966 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10972 if (!isl_basic_map_can_uncurry(bmap
))
10973 isl_die(bmap
->ctx
, isl_error_invalid
,
10974 "basic map cannot be uncurried",
10975 return isl_basic_map_free(bmap
));
10976 bmap
= isl_basic_map_cow(bmap
);
10979 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10981 return isl_basic_map_free(bmap
);
10985 /* Given a map A -> (B -> C), return the corresponding map
10988 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10995 if (!isl_map_can_uncurry(map
))
10996 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10997 return isl_map_free(map
));
10999 map
= isl_map_cow(map
);
11003 for (i
= 0; i
< map
->n
; ++i
) {
11004 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
11006 return isl_map_free(map
);
11009 map
->dim
= isl_space_uncurry(map
->dim
);
11011 return isl_map_free(map
);
11016 /* Construct a basic map mapping the domain of the affine expression
11017 * to a one-dimensional range prescribed by the affine expression.
11019 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11023 isl_local_space
*ls
;
11024 isl_basic_map
*bmap
;
11029 ls
= isl_aff_get_local_space(aff
);
11030 bmap
= isl_basic_map_from_local_space(ls
);
11031 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11032 k
= isl_basic_map_alloc_equality(bmap
);
11036 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11037 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11038 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11039 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11040 aff
->v
->size
- (pos
+ 1));
11043 bmap
= isl_basic_map_finalize(bmap
);
11047 isl_basic_map_free(bmap
);
11051 /* Construct a map mapping the domain of the affine expression
11052 * to a one-dimensional range prescribed by the affine expression.
11054 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11056 isl_basic_map
*bmap
;
11058 bmap
= isl_basic_map_from_aff(aff
);
11059 return isl_map_from_basic_map(bmap
);
11062 /* Construct a basic map mapping the domain the multi-affine expression
11063 * to its range, with each dimension in the range equated to the
11064 * corresponding affine expression.
11066 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11067 __isl_take isl_multi_aff
*maff
)
11071 isl_basic_map
*bmap
;
11076 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11077 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11078 "invalid space", return isl_multi_aff_free(maff
));
11080 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11081 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11083 for (i
= 0; i
< maff
->n
; ++i
) {
11085 isl_basic_map
*bmap_i
;
11087 aff
= isl_aff_copy(maff
->p
[i
]);
11088 bmap_i
= isl_basic_map_from_aff(aff
);
11090 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11093 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11095 isl_multi_aff_free(maff
);
11099 /* Construct a map mapping the domain the multi-affine expression
11100 * to its range, with each dimension in the range equated to the
11101 * corresponding affine expression.
11103 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11105 isl_basic_map
*bmap
;
11107 bmap
= isl_basic_map_from_multi_aff(maff
);
11108 return isl_map_from_basic_map(bmap
);
11111 /* Construct a basic map mapping a domain in the given space to
11112 * to an n-dimensional range, with n the number of elements in the list,
11113 * where each coordinate in the range is prescribed by the
11114 * corresponding affine expression.
11115 * The domains of all affine expressions in the list are assumed to match
11118 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11119 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11123 isl_basic_map
*bmap
;
11128 dim
= isl_space_from_domain(domain_dim
);
11129 bmap
= isl_basic_map_universe(dim
);
11131 for (i
= 0; i
< list
->n
; ++i
) {
11133 isl_basic_map
*bmap_i
;
11135 aff
= isl_aff_copy(list
->p
[i
]);
11136 bmap_i
= isl_basic_map_from_aff(aff
);
11138 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11141 isl_aff_list_free(list
);
11145 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11146 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11148 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11151 /* Construct a basic map where the given dimensions are equal to each other.
11153 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11154 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11156 isl_basic_map
*bmap
= NULL
;
11162 if (pos1
>= isl_space_dim(space
, type1
))
11163 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11164 "index out of bounds", goto error
);
11165 if (pos2
>= isl_space_dim(space
, type2
))
11166 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11167 "index out of bounds", goto error
);
11169 if (type1
== type2
&& pos1
== pos2
)
11170 return isl_basic_map_universe(space
);
11172 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11173 i
= isl_basic_map_alloc_equality(bmap
);
11176 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11177 pos1
+= isl_basic_map_offset(bmap
, type1
);
11178 pos2
+= isl_basic_map_offset(bmap
, type2
);
11179 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11180 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11181 bmap
= isl_basic_map_finalize(bmap
);
11182 isl_space_free(space
);
11185 isl_space_free(space
);
11186 isl_basic_map_free(bmap
);
11190 /* Add a constraint imposing that the given two dimensions are equal.
11192 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11193 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11197 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11199 bmap
= isl_basic_map_intersect(bmap
, eq
);
11204 /* Add a constraint imposing that the given two dimensions are equal.
11206 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11207 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11209 isl_basic_map
*bmap
;
11211 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11213 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11218 /* Add a constraint imposing that the given two dimensions have opposite values.
11220 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11221 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11223 isl_basic_map
*bmap
= NULL
;
11229 if (pos1
>= isl_map_dim(map
, type1
))
11230 isl_die(map
->ctx
, isl_error_invalid
,
11231 "index out of bounds", goto error
);
11232 if (pos2
>= isl_map_dim(map
, type2
))
11233 isl_die(map
->ctx
, isl_error_invalid
,
11234 "index out of bounds", goto error
);
11236 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11237 i
= isl_basic_map_alloc_equality(bmap
);
11240 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11241 pos1
+= isl_basic_map_offset(bmap
, type1
);
11242 pos2
+= isl_basic_map_offset(bmap
, type2
);
11243 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11244 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11245 bmap
= isl_basic_map_finalize(bmap
);
11247 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11251 isl_basic_map_free(bmap
);
11256 /* Add a constraint imposing that the value of the first dimension is
11257 * greater than or equal to that of the second.
11259 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11260 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11263 isl_local_space
*ls
;
11268 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
11269 isl_die(bmap
->ctx
, isl_error_invalid
,
11270 "index out of bounds", return isl_basic_map_free(bmap
));
11271 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
11272 isl_die(bmap
->ctx
, isl_error_invalid
,
11273 "index out of bounds", return isl_basic_map_free(bmap
));
11275 if (type1
== type2
&& pos1
== pos2
)
11278 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
11279 c
= isl_inequality_alloc(ls
);
11280 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11281 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11282 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11287 /* Construct a basic map where the value of the first dimension is
11288 * greater than that of the second.
11290 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
11291 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11293 isl_basic_map
*bmap
= NULL
;
11299 if (pos1
>= isl_space_dim(space
, type1
))
11300 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11301 "index out of bounds", goto error
);
11302 if (pos2
>= isl_space_dim(space
, type2
))
11303 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11304 "index out of bounds", goto error
);
11306 if (type1
== type2
&& pos1
== pos2
)
11307 return isl_basic_map_empty(space
);
11309 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
11310 i
= isl_basic_map_alloc_inequality(bmap
);
11313 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11314 pos1
+= isl_basic_map_offset(bmap
, type1
);
11315 pos2
+= isl_basic_map_offset(bmap
, type2
);
11316 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11317 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11318 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11319 bmap
= isl_basic_map_finalize(bmap
);
11323 isl_space_free(space
);
11324 isl_basic_map_free(bmap
);
11328 /* Add a constraint imposing that the value of the first dimension is
11329 * greater than that of the second.
11331 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
11332 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11336 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11338 bmap
= isl_basic_map_intersect(bmap
, gt
);
11343 /* Add a constraint imposing that the value of the first dimension is
11344 * greater than that of the second.
11346 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
11347 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11349 isl_basic_map
*bmap
;
11351 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11353 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11358 /* Add a constraint imposing that the value of the first dimension is
11359 * smaller than that of the second.
11361 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11362 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11364 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11367 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11371 isl_local_space
*ls
;
11376 if (!isl_basic_map_divs_known(bmap
))
11377 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11378 "some divs are unknown", return NULL
);
11380 ls
= isl_basic_map_get_local_space(bmap
);
11381 div
= isl_local_space_get_div(ls
, pos
);
11382 isl_local_space_free(ls
);
11387 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11390 return isl_basic_map_get_div(bset
, pos
);
11393 /* Plug in "subs" for dimension "type", "pos" of "bset".
11395 * Let i be the dimension to replace and let "subs" be of the form
11399 * Any integer division with a non-zero coefficient for i,
11401 * floor((a i + g)/m)
11405 * floor((a f + d g)/(m d))
11407 * Constraints of the form
11415 * We currently require that "subs" is an integral expression.
11416 * Handling rational expressions may require us to add stride constraints
11417 * as we do in isl_basic_set_preimage_multi_aff.
11419 __isl_give isl_basic_set
*isl_basic_set_substitute(
11420 __isl_take isl_basic_set
*bset
,
11421 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11427 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11430 bset
= isl_basic_set_cow(bset
);
11431 if (!bset
|| !subs
)
11434 ctx
= isl_basic_set_get_ctx(bset
);
11435 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11436 isl_die(ctx
, isl_error_invalid
,
11437 "spaces don't match", goto error
);
11438 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11439 isl_die(ctx
, isl_error_unsupported
,
11440 "cannot handle divs yet", goto error
);
11441 if (!isl_int_is_one(subs
->v
->el
[0]))
11442 isl_die(ctx
, isl_error_invalid
,
11443 "can only substitute integer expressions", goto error
);
11445 pos
+= isl_basic_set_offset(bset
, type
);
11449 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11450 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11452 isl_int_set(v
, bset
->eq
[i
][pos
]);
11453 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11454 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11455 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11458 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11459 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11461 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11462 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11463 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11464 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11467 for (i
= 0; i
< bset
->n_div
; ++i
) {
11468 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11470 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11471 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11472 isl_seq_combine(bset
->div
[i
] + 1,
11473 subs
->v
->el
[0], bset
->div
[i
] + 1,
11474 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11475 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11480 bset
= isl_basic_set_simplify(bset
);
11481 return isl_basic_set_finalize(bset
);
11483 isl_basic_set_free(bset
);
11487 /* Plug in "subs" for dimension "type", "pos" of "set".
11489 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11490 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11494 if (set
&& isl_set_plain_is_empty(set
))
11497 set
= isl_set_cow(set
);
11501 for (i
= set
->n
- 1; i
>= 0; --i
) {
11502 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11503 if (remove_if_empty(set
, i
) < 0)
11513 /* Check if the range of "ma" is compatible with the domain or range
11514 * (depending on "type") of "bmap".
11515 * Return -1 if anything is wrong.
11517 static int check_basic_map_compatible_range_multi_aff(
11518 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
11519 __isl_keep isl_multi_aff
*ma
)
11522 isl_space
*ma_space
;
11524 ma_space
= isl_multi_aff_get_space(ma
);
11525 m
= isl_space_tuple_match(bmap
->dim
, type
, ma_space
, isl_dim_out
);
11526 isl_space_free(ma_space
);
11528 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11529 "spaces don't match", return -1);
11533 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
11534 * coefficients before the transformed range of dimensions,
11535 * the "n_after" coefficients after the transformed range of dimensions
11536 * and the coefficients of the other divs in "bmap".
11538 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
11539 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
11544 isl_local_space
*ls
;
11549 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11553 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
11554 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
11555 for (i
= 0; i
< n_div
; ++i
) {
11556 int o_bmap
= 0, o_ls
= 0;
11558 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
11559 o_bmap
+= 1 + 1 + n_param
;
11560 o_ls
+= 1 + 1 + n_param
;
11561 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
11562 o_bmap
+= n_before
;
11563 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11564 ls
->div
->row
[i
] + o_ls
, n_set
);
11567 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
11569 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11570 ls
->div
->row
[i
] + o_ls
, n_div
);
11573 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
11574 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
11578 isl_local_space_free(ls
);
11581 isl_local_space_free(ls
);
11585 /* How many stride constraints does "ma" enforce?
11586 * That is, how many of the affine expressions have a denominator
11587 * different from one?
11589 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11594 for (i
= 0; i
< ma
->n
; ++i
)
11595 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11601 /* For each affine expression in ma of the form
11603 * x_i = (f_i y + h_i)/m_i
11605 * with m_i different from one, add a constraint to "bmap"
11608 * f_i y + h_i = m_i alpha_i
11610 * with alpha_i an additional existentially quantified variable.
11612 static __isl_give isl_basic_map
*add_ma_strides(
11613 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
11614 int n_before
, int n_after
)
11623 total
= isl_basic_map_total_dim(bmap
);
11624 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
11625 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
11626 n_div
= isl_multi_aff_dim(ma
, isl_dim_div
);
11627 for (i
= 0; i
< ma
->n
; ++i
) {
11628 int o_bmap
= 0, o_ma
= 1;
11630 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11632 div
= isl_basic_map_alloc_div(bmap
);
11633 k
= isl_basic_map_alloc_equality(bmap
);
11634 if (div
< 0 || k
< 0)
11636 isl_int_set_si(bmap
->div
[div
][0], 0);
11637 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11638 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
11639 o_bmap
+= 1 + n_param
;
11640 o_ma
+= 1 + n_param
;
11641 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
11642 o_bmap
+= n_before
;
11643 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11644 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
11647 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
11649 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11650 ma
->p
[i
]->v
->el
+ o_ma
, n_div
);
11653 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
11654 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11660 isl_basic_map_free(bmap
);
11664 /* Replace the domain or range space (depending on "type) of "space" by "set".
11666 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
11667 enum isl_dim_type type
, __isl_take isl_space
*set
)
11669 if (type
== isl_dim_in
) {
11670 space
= isl_space_range(space
);
11671 space
= isl_space_map_from_domain_and_range(set
, space
);
11673 space
= isl_space_domain(space
);
11674 space
= isl_space_map_from_domain_and_range(space
, set
);
11680 /* Compute the preimage of the domain or range (depending on "type")
11681 * of "bmap" under the function represented by "ma".
11682 * In other words, plug in "ma" in the domain or range of "bmap".
11683 * The result is a basic map that lives in the same space as "bmap"
11684 * except that the domain or range has been replaced by
11685 * the domain space of "ma".
11687 * If bmap is represented by
11689 * A(p) + S u + B x + T v + C(divs) >= 0,
11691 * where u and x are input and output dimensions if type == isl_dim_out
11692 * while x and v are input and output dimensions if type == isl_dim_in,
11693 * and ma is represented by
11695 * x = D(p) + F(y) + G(divs')
11697 * then the result is
11699 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
11701 * The divs in the input set are similarly adjusted.
11704 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
11708 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
11709 * B_i G(divs') + c_i(divs))/n_i)
11711 * If bmap is not a rational map and if F(y) involves any denominators
11713 * x_i = (f_i y + h_i)/m_i
11715 * then additional constraints are added to ensure that we only
11716 * map back integer points. That is we enforce
11718 * f_i y + h_i = m_i alpha_i
11720 * with alpha_i an additional existentially quantified variable.
11722 * We first copy over the divs from "ma".
11723 * Then we add the modified constraints and divs from "bmap".
11724 * Finally, we add the stride constraints, if needed.
11726 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
11727 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
11728 __isl_take isl_multi_aff
*ma
)
11732 isl_basic_map
*res
= NULL
;
11733 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
11734 isl_int f
, c1
, c2
, g
;
11735 int rational
, strides
;
11742 ma
= isl_multi_aff_align_divs(ma
);
11745 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
11748 if (type
== isl_dim_in
) {
11750 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
11752 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
11755 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
11756 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11758 space
= isl_multi_aff_get_domain_space(ma
);
11759 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
11760 rational
= isl_basic_map_is_rational(bmap
);
11761 strides
= rational
? 0 : multi_aff_strides(ma
);
11762 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
11763 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
11765 res
= isl_basic_map_set_rational(res
);
11767 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
11768 if (isl_basic_map_alloc_div(res
) < 0)
11771 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
11774 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
11775 k
= isl_basic_map_alloc_equality(res
);
11778 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
11779 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11782 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11783 k
= isl_basic_map_alloc_inequality(res
);
11786 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
11787 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11790 for (i
= 0; i
< bmap
->n_div
; ++i
) {
11791 if (isl_int_is_zero(bmap
->div
[i
][0])) {
11792 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11795 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
11796 n_before
, n_after
, n_div_ma
, n_div_bmap
,
11801 res
= add_ma_strides(res
, ma
, n_before
, n_after
);
11807 isl_basic_map_free(bmap
);
11808 isl_multi_aff_free(ma
);
11809 res
= isl_basic_set_simplify(res
);
11810 return isl_basic_map_finalize(res
);
11816 isl_basic_map_free(bmap
);
11817 isl_multi_aff_free(ma
);
11818 isl_basic_map_free(res
);
11822 /* Compute the preimage of "bset" under the function represented by "ma".
11823 * In other words, plug in "ma" in "bset". The result is a basic set
11824 * that lives in the domain space of "ma".
11826 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11827 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11829 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
11832 /* Check if the range of "ma" is compatible with the domain or range
11833 * (depending on "type") of "map".
11834 * Return -1 if anything is wrong.
11836 static int check_map_compatible_range_multi_aff(
11837 __isl_keep isl_map
*map
, enum isl_dim_type type
,
11838 __isl_keep isl_multi_aff
*ma
)
11841 isl_space
*ma_space
;
11843 ma_space
= isl_multi_aff_get_space(ma
);
11844 m
= isl_space_tuple_match(map
->dim
, type
, ma_space
, isl_dim_out
);
11845 isl_space_free(ma_space
);
11847 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11848 "spaces don't match", return -1);
11852 /* Compute the preimage of the domain or range (depending on "type")
11853 * of "map" under the function represented by "ma".
11854 * In other words, plug in "ma" in the domain or range of "map".
11855 * The result is a map that lives in the same space as "map"
11856 * except that the domain or range has been replaced by
11857 * the domain space of "ma".
11859 * The parameters are assumed to have been aligned.
11861 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
11862 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11867 map
= isl_map_cow(map
);
11868 ma
= isl_multi_aff_align_divs(ma
);
11871 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
11874 for (i
= 0; i
< map
->n
; ++i
) {
11875 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
11876 isl_multi_aff_copy(ma
));
11881 space
= isl_multi_aff_get_domain_space(ma
);
11882 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
11884 isl_space_free(map
->dim
);
11889 isl_multi_aff_free(ma
);
11891 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
11892 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
11895 isl_multi_aff_free(ma
);
11900 /* Compute the preimage of the domain or range (depending on "type")
11901 * of "map" under the function represented by "ma".
11902 * In other words, plug in "ma" in the domain or range of "map".
11903 * The result is a map that lives in the same space as "map"
11904 * except that the domain or range has been replaced by
11905 * the domain space of "ma".
11907 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
11908 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11913 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11914 return map_preimage_multi_aff(map
, type
, ma
);
11916 if (!isl_space_has_named_params(map
->dim
) ||
11917 !isl_space_has_named_params(ma
->space
))
11918 isl_die(map
->ctx
, isl_error_invalid
,
11919 "unaligned unnamed parameters", goto error
);
11920 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
11921 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
11923 return map_preimage_multi_aff(map
, type
, ma
);
11925 isl_multi_aff_free(ma
);
11926 return isl_map_free(map
);
11929 /* Compute the preimage of "set" under the function represented by "ma".
11930 * In other words, plug in "ma" "set". The result is a set
11931 * that lives in the domain space of "ma".
11933 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11934 __isl_take isl_multi_aff
*ma
)
11936 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
11939 /* Compute the preimage of the domain of "map" under the function
11940 * represented by "ma".
11941 * In other words, plug in "ma" in the domain of "map".
11942 * The result is a map that lives in the same space as "map"
11943 * except that the domain has been replaced by the domain space of "ma".
11945 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
11946 __isl_take isl_multi_aff
*ma
)
11948 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
11951 /* Compute the preimage of "set" under the function represented by "pma".
11952 * In other words, plug in "pma" in "set. The result is a set
11953 * that lives in the domain space of "pma".
11955 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11956 __isl_take isl_pw_multi_aff
*pma
)
11965 isl_pw_multi_aff_free(pma
);
11966 res
= isl_set_empty(isl_set_get_space(set
));
11971 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11972 isl_multi_aff_copy(pma
->p
[0].maff
));
11973 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11975 for (i
= 1; i
< pma
->n
; ++i
) {
11978 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11979 isl_multi_aff_copy(pma
->p
[i
].maff
));
11980 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11981 res
= isl_set_union(res
, res_i
);
11984 isl_pw_multi_aff_free(pma
);
11988 isl_pw_multi_aff_free(pma
);
11993 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11994 __isl_take isl_pw_multi_aff
*pma
)
11999 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
12000 return set_preimage_pw_multi_aff(set
, pma
);
12002 if (!isl_space_has_named_params(set
->dim
) ||
12003 !isl_space_has_named_params(pma
->dim
))
12004 isl_die(set
->ctx
, isl_error_invalid
,
12005 "unaligned unnamed parameters", goto error
);
12006 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
12007 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
12009 return set_preimage_pw_multi_aff(set
, pma
);
12011 isl_pw_multi_aff_free(pma
);
12012 return isl_set_free(set
);