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
);
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
)
3543 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3544 isl_space_copy(bmap2
->dim
));
3546 n_in
= isl_basic_map_n_in(bmap1
);
3547 n_out
= isl_basic_map_n_out(bmap2
);
3548 n
= isl_basic_map_n_out(bmap1
);
3549 nparam
= isl_basic_map_n_param(bmap1
);
3551 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3552 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3553 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3554 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3555 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3556 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3557 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3558 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3559 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3560 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3561 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3563 bmap
= isl_basic_map_alloc_space(dim_result
,
3564 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3565 bmap1
->n_eq
+ bmap2
->n_eq
,
3566 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3567 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3568 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3569 bmap
= add_divs(bmap
, n
);
3570 bmap
= isl_basic_map_simplify(bmap
);
3571 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3572 return isl_basic_map_finalize(bmap
);
3574 isl_basic_map_free(bmap1
);
3575 isl_basic_map_free(bmap2
);
3579 struct isl_basic_set
*isl_basic_set_apply(
3580 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3585 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3588 return (struct isl_basic_set
*)
3589 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3591 isl_basic_set_free(bset
);
3592 isl_basic_map_free(bmap
);
3596 struct isl_basic_map
*isl_basic_map_apply_domain(
3597 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3599 if (!bmap1
|| !bmap2
)
3602 isl_assert(bmap1
->ctx
,
3603 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3604 isl_assert(bmap1
->ctx
,
3605 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3608 bmap1
= isl_basic_map_reverse(bmap1
);
3609 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3610 return isl_basic_map_reverse(bmap1
);
3612 isl_basic_map_free(bmap1
);
3613 isl_basic_map_free(bmap2
);
3617 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3618 * A \cap B -> f(A) + f(B)
3620 struct isl_basic_map
*isl_basic_map_sum(
3621 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3623 unsigned n_in
, n_out
, nparam
, total
, pos
;
3624 struct isl_basic_map
*bmap
= NULL
;
3625 struct isl_dim_map
*dim_map1
, *dim_map2
;
3628 if (!bmap1
|| !bmap2
)
3631 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3634 nparam
= isl_basic_map_n_param(bmap1
);
3635 n_in
= isl_basic_map_n_in(bmap1
);
3636 n_out
= isl_basic_map_n_out(bmap1
);
3638 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3639 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3640 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3641 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3642 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3643 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3644 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3645 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3646 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3647 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3648 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3650 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3651 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3652 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3653 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3654 for (i
= 0; i
< n_out
; ++i
) {
3655 int j
= isl_basic_map_alloc_equality(bmap
);
3658 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3659 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3660 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3661 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3663 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3664 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3665 bmap
= add_divs(bmap
, 2 * n_out
);
3667 bmap
= isl_basic_map_simplify(bmap
);
3668 return isl_basic_map_finalize(bmap
);
3670 isl_basic_map_free(bmap
);
3671 isl_basic_map_free(bmap1
);
3672 isl_basic_map_free(bmap2
);
3676 /* Given two maps A -> f(A) and B -> g(B), construct a map
3677 * A \cap B -> f(A) + f(B)
3679 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3681 struct isl_map
*result
;
3687 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3689 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3690 map1
->n
* map2
->n
, 0);
3693 for (i
= 0; i
< map1
->n
; ++i
)
3694 for (j
= 0; j
< map2
->n
; ++j
) {
3695 struct isl_basic_map
*part
;
3696 part
= isl_basic_map_sum(
3697 isl_basic_map_copy(map1
->p
[i
]),
3698 isl_basic_map_copy(map2
->p
[j
]));
3699 if (isl_basic_map_is_empty(part
))
3700 isl_basic_map_free(part
);
3702 result
= isl_map_add_basic_map(result
, part
);
3715 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3716 __isl_take isl_set
*set2
)
3718 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3721 /* Given a basic map A -> f(A), construct A -> -f(A).
3723 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3728 bmap
= isl_basic_map_cow(bmap
);
3732 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3733 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3734 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3735 for (j
= 0; j
< n
; ++j
)
3736 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3737 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3738 for (j
= 0; j
< n
; ++j
)
3739 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3740 for (i
= 0; i
< bmap
->n_div
; ++i
)
3741 for (j
= 0; j
< n
; ++j
)
3742 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3743 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3744 return isl_basic_map_finalize(bmap
);
3747 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3749 return isl_basic_map_neg(bset
);
3752 /* Given a map A -> f(A), construct A -> -f(A).
3754 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3758 map
= isl_map_cow(map
);
3762 for (i
= 0; i
< map
->n
; ++i
) {
3763 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3774 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3776 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3779 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3780 * A -> floor(f(A)/d).
3782 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3785 unsigned n_in
, n_out
, nparam
, total
, pos
;
3786 struct isl_basic_map
*result
= NULL
;
3787 struct isl_dim_map
*dim_map
;
3793 nparam
= isl_basic_map_n_param(bmap
);
3794 n_in
= isl_basic_map_n_in(bmap
);
3795 n_out
= isl_basic_map_n_out(bmap
);
3797 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3798 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3799 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3800 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3801 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3802 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3804 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3805 bmap
->n_div
+ n_out
,
3806 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3807 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3808 result
= add_divs(result
, n_out
);
3809 for (i
= 0; i
< n_out
; ++i
) {
3811 j
= isl_basic_map_alloc_inequality(result
);
3814 isl_seq_clr(result
->ineq
[j
], 1+total
);
3815 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3816 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3817 j
= isl_basic_map_alloc_inequality(result
);
3820 isl_seq_clr(result
->ineq
[j
], 1+total
);
3821 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3822 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3823 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3826 result
= isl_basic_map_simplify(result
);
3827 return isl_basic_map_finalize(result
);
3829 isl_basic_map_free(result
);
3833 /* Given a map A -> f(A) and an integer d, construct a map
3834 * A -> floor(f(A)/d).
3836 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3840 map
= isl_map_cow(map
);
3844 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3845 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3846 for (i
= 0; i
< map
->n
; ++i
) {
3847 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3858 /* Given a map A -> f(A) and an integer d, construct a map
3859 * A -> floor(f(A)/d).
3861 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
3862 __isl_take isl_val
*d
)
3866 if (!isl_val_is_int(d
))
3867 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
3868 "expecting integer denominator", goto error
);
3869 map
= isl_map_floordiv(map
, d
->n
);
3878 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3884 i
= isl_basic_map_alloc_equality(bmap
);
3887 nparam
= isl_basic_map_n_param(bmap
);
3888 n_in
= isl_basic_map_n_in(bmap
);
3889 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3890 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3891 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3892 return isl_basic_map_finalize(bmap
);
3894 isl_basic_map_free(bmap
);
3898 /* Add a constraints to "bmap" expressing i_pos < o_pos
3900 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3906 i
= isl_basic_map_alloc_inequality(bmap
);
3909 nparam
= isl_basic_map_n_param(bmap
);
3910 n_in
= isl_basic_map_n_in(bmap
);
3911 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3912 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3913 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3914 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3915 return isl_basic_map_finalize(bmap
);
3917 isl_basic_map_free(bmap
);
3921 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3923 static __isl_give isl_basic_map
*var_less_or_equal(
3924 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3930 i
= isl_basic_map_alloc_inequality(bmap
);
3933 nparam
= isl_basic_map_n_param(bmap
);
3934 n_in
= isl_basic_map_n_in(bmap
);
3935 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3936 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3937 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3938 return isl_basic_map_finalize(bmap
);
3940 isl_basic_map_free(bmap
);
3944 /* Add a constraints to "bmap" expressing i_pos > o_pos
3946 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3952 i
= isl_basic_map_alloc_inequality(bmap
);
3955 nparam
= isl_basic_map_n_param(bmap
);
3956 n_in
= isl_basic_map_n_in(bmap
);
3957 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3958 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3959 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3960 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3961 return isl_basic_map_finalize(bmap
);
3963 isl_basic_map_free(bmap
);
3967 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3969 static __isl_give isl_basic_map
*var_more_or_equal(
3970 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3976 i
= isl_basic_map_alloc_inequality(bmap
);
3979 nparam
= isl_basic_map_n_param(bmap
);
3980 n_in
= isl_basic_map_n_in(bmap
);
3981 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3982 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3983 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3984 return isl_basic_map_finalize(bmap
);
3986 isl_basic_map_free(bmap
);
3990 __isl_give isl_basic_map
*isl_basic_map_equal(
3991 __isl_take isl_space
*dim
, unsigned n_equal
)
3994 struct isl_basic_map
*bmap
;
3995 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
3998 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3999 bmap
= var_equal(bmap
, i
);
4000 return isl_basic_map_finalize(bmap
);
4003 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4005 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4009 struct isl_basic_map
*bmap
;
4010 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4013 for (i
= 0; i
< pos
&& bmap
; ++i
)
4014 bmap
= var_equal(bmap
, i
);
4016 bmap
= var_less(bmap
, pos
);
4017 return isl_basic_map_finalize(bmap
);
4020 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4022 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4023 __isl_take isl_space
*dim
, unsigned pos
)
4026 isl_basic_map
*bmap
;
4028 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4029 for (i
= 0; i
< pos
; ++i
)
4030 bmap
= var_equal(bmap
, i
);
4031 bmap
= var_less_or_equal(bmap
, pos
);
4032 return isl_basic_map_finalize(bmap
);
4035 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4037 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4041 struct isl_basic_map
*bmap
;
4042 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4045 for (i
= 0; i
< pos
&& bmap
; ++i
)
4046 bmap
= var_equal(bmap
, i
);
4048 bmap
= var_more(bmap
, pos
);
4049 return isl_basic_map_finalize(bmap
);
4052 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4054 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4055 __isl_take isl_space
*dim
, unsigned pos
)
4058 isl_basic_map
*bmap
;
4060 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4061 for (i
= 0; i
< pos
; ++i
)
4062 bmap
= var_equal(bmap
, i
);
4063 bmap
= var_more_or_equal(bmap
, pos
);
4064 return isl_basic_map_finalize(bmap
);
4067 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4068 unsigned n
, int equal
)
4070 struct isl_map
*map
;
4073 if (n
== 0 && equal
)
4074 return isl_map_universe(dims
);
4076 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4078 for (i
= 0; i
+ 1 < n
; ++i
)
4079 map
= isl_map_add_basic_map(map
,
4080 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4083 map
= isl_map_add_basic_map(map
,
4084 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4086 map
= isl_map_add_basic_map(map
,
4087 isl_basic_map_less_at(dims
, n
- 1));
4089 isl_space_free(dims
);
4094 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4098 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4101 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4103 return map_lex_lte_first(dim
, n
, 0);
4106 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4108 return map_lex_lte_first(dim
, n
, 1);
4111 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4113 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4116 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4118 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4121 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4122 unsigned n
, int equal
)
4124 struct isl_map
*map
;
4127 if (n
== 0 && equal
)
4128 return isl_map_universe(dims
);
4130 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4132 for (i
= 0; i
+ 1 < n
; ++i
)
4133 map
= isl_map_add_basic_map(map
,
4134 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4137 map
= isl_map_add_basic_map(map
,
4138 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4140 map
= isl_map_add_basic_map(map
,
4141 isl_basic_map_more_at(dims
, n
- 1));
4143 isl_space_free(dims
);
4148 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4152 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4155 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4157 return map_lex_gte_first(dim
, n
, 0);
4160 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4162 return map_lex_gte_first(dim
, n
, 1);
4165 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4167 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4170 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4172 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4175 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4176 __isl_take isl_set
*set2
)
4179 map
= isl_map_lex_le(isl_set_get_space(set1
));
4180 map
= isl_map_intersect_domain(map
, set1
);
4181 map
= isl_map_intersect_range(map
, set2
);
4185 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4186 __isl_take isl_set
*set2
)
4189 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4190 map
= isl_map_intersect_domain(map
, set1
);
4191 map
= isl_map_intersect_range(map
, set2
);
4195 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4196 __isl_take isl_set
*set2
)
4199 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4200 map
= isl_map_intersect_domain(map
, set1
);
4201 map
= isl_map_intersect_range(map
, set2
);
4205 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4206 __isl_take isl_set
*set2
)
4209 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4210 map
= isl_map_intersect_domain(map
, set1
);
4211 map
= isl_map_intersect_range(map
, set2
);
4215 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4216 __isl_take isl_map
*map2
)
4219 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4220 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4221 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4225 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4226 __isl_take isl_map
*map2
)
4229 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4230 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4231 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4235 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4236 __isl_take isl_map
*map2
)
4239 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4240 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4241 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4245 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4246 __isl_take isl_map
*map2
)
4249 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4250 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4251 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4255 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4256 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4258 struct isl_basic_map
*bmap
;
4260 bset
= isl_basic_set_cow(bset
);
4264 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4265 isl_space_free(bset
->dim
);
4266 bmap
= (struct isl_basic_map
*) bset
;
4268 return isl_basic_map_finalize(bmap
);
4270 isl_basic_set_free(bset
);
4271 isl_space_free(dim
);
4275 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4279 if (bmap
->dim
->n_in
== 0)
4280 return (struct isl_basic_set
*)bmap
;
4281 bmap
= isl_basic_map_cow(bmap
);
4284 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4287 bmap
= isl_basic_map_finalize(bmap
);
4288 return (struct isl_basic_set
*)bmap
;
4290 isl_basic_map_free(bmap
);
4294 /* For a div d = floor(f/m), add the constraints
4297 * -(f-(n-1)) + m d >= 0
4299 * Note that the second constraint is the negation of
4303 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4304 unsigned pos
, isl_int
*div
)
4307 unsigned total
= isl_basic_map_total_dim(bmap
);
4309 i
= isl_basic_map_alloc_inequality(bmap
);
4312 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4313 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4315 j
= isl_basic_map_alloc_inequality(bmap
);
4318 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
4319 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
4320 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
4324 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4325 unsigned pos
, isl_int
*div
)
4327 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4331 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4333 unsigned total
= isl_basic_map_total_dim(bmap
);
4334 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4336 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4340 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4342 return isl_basic_map_add_div_constraints(bset
, div
);
4345 struct isl_basic_set
*isl_basic_map_underlying_set(
4346 struct isl_basic_map
*bmap
)
4350 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4352 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4353 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4354 return (struct isl_basic_set
*)bmap
;
4355 bmap
= isl_basic_map_cow(bmap
);
4358 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4361 bmap
->extra
-= bmap
->n_div
;
4363 bmap
= isl_basic_map_finalize(bmap
);
4364 return (struct isl_basic_set
*)bmap
;
4366 isl_basic_map_free(bmap
);
4370 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4371 __isl_take isl_basic_set
*bset
)
4373 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4376 struct isl_basic_map
*isl_basic_map_overlying_set(
4377 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4379 struct isl_basic_map
*bmap
;
4380 struct isl_ctx
*ctx
;
4387 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4388 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4389 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4391 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4392 isl_basic_map_free(like
);
4393 return (struct isl_basic_map
*)bset
;
4395 bset
= isl_basic_set_cow(bset
);
4398 total
= bset
->dim
->n_out
+ bset
->extra
;
4399 bmap
= (struct isl_basic_map
*)bset
;
4400 isl_space_free(bmap
->dim
);
4401 bmap
->dim
= isl_space_copy(like
->dim
);
4404 bmap
->n_div
= like
->n_div
;
4405 bmap
->extra
+= like
->n_div
;
4409 ltotal
= total
- bmap
->extra
+ like
->extra
;
4412 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4413 bmap
->extra
* (1 + 1 + total
));
4414 if (isl_blk_is_error(bmap
->block2
))
4416 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4420 for (i
= 0; i
< bmap
->extra
; ++i
)
4421 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4422 for (i
= 0; i
< like
->n_div
; ++i
) {
4423 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4424 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4426 bmap
= isl_basic_map_extend_constraints(bmap
,
4427 0, 2 * like
->n_div
);
4428 for (i
= 0; i
< like
->n_div
; ++i
) {
4431 if (isl_int_is_zero(bmap
->div
[i
][0]))
4433 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4434 bmap
= isl_basic_map_free(bmap
);
4437 isl_basic_map_free(like
);
4438 bmap
= isl_basic_map_simplify(bmap
);
4439 bmap
= isl_basic_map_finalize(bmap
);
4442 isl_basic_map_free(like
);
4443 isl_basic_set_free(bset
);
4447 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4448 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4450 return (struct isl_basic_set
*)
4451 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4454 struct isl_set
*isl_set_from_underlying_set(
4455 struct isl_set
*set
, struct isl_basic_set
*like
)
4461 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4463 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4464 isl_basic_set_free(like
);
4467 set
= isl_set_cow(set
);
4470 for (i
= 0; i
< set
->n
; ++i
) {
4471 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4472 isl_basic_set_copy(like
));
4476 isl_space_free(set
->dim
);
4477 set
->dim
= isl_space_copy(like
->dim
);
4480 isl_basic_set_free(like
);
4483 isl_basic_set_free(like
);
4488 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4492 map
= isl_map_cow(map
);
4495 map
->dim
= isl_space_cow(map
->dim
);
4499 for (i
= 1; i
< map
->n
; ++i
)
4500 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4502 for (i
= 0; i
< map
->n
; ++i
) {
4503 map
->p
[i
] = (struct isl_basic_map
*)
4504 isl_basic_map_underlying_set(map
->p
[i
]);
4509 map
->dim
= isl_space_underlying(map
->dim
, 0);
4511 isl_space_free(map
->dim
);
4512 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4516 return (struct isl_set
*)map
;
4522 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4524 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4527 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4528 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4530 bmap
= isl_basic_map_cow(bmap
);
4534 isl_space_free(bmap
->dim
);
4537 bmap
= isl_basic_map_finalize(bmap
);
4541 isl_basic_map_free(bmap
);
4542 isl_space_free(dim
);
4546 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4547 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4549 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4553 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4554 __isl_take isl_space
*dim
)
4558 map
= isl_map_cow(map
);
4562 for (i
= 0; i
< map
->n
; ++i
) {
4563 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4564 isl_space_copy(dim
));
4568 isl_space_free(map
->dim
);
4574 isl_space_free(dim
);
4578 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4579 __isl_take isl_space
*dim
)
4581 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4584 /* Compute the parameter domain of the given basic set.
4586 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4591 if (isl_basic_set_is_params(bset
))
4594 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4595 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4596 space
= isl_basic_set_get_space(bset
);
4597 space
= isl_space_params(space
);
4598 bset
= isl_basic_set_reset_space(bset
, space
);
4602 /* Construct a zero-dimensional basic set with the given parameter domain.
4604 __isl_give isl_basic_set
*isl_basic_set_from_params(
4605 __isl_take isl_basic_set
*bset
)
4608 space
= isl_basic_set_get_space(bset
);
4609 space
= isl_space_set_from_params(space
);
4610 bset
= isl_basic_set_reset_space(bset
, space
);
4614 /* Compute the parameter domain of the given set.
4616 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4621 if (isl_set_is_params(set
))
4624 n
= isl_set_dim(set
, isl_dim_set
);
4625 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4626 space
= isl_set_get_space(set
);
4627 space
= isl_space_params(space
);
4628 set
= isl_set_reset_space(set
, space
);
4632 /* Construct a zero-dimensional set with the given parameter domain.
4634 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4637 space
= isl_set_get_space(set
);
4638 space
= isl_space_set_from_params(space
);
4639 set
= isl_set_reset_space(set
, space
);
4643 /* Compute the parameter domain of the given map.
4645 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4650 n
= isl_map_dim(map
, isl_dim_in
);
4651 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4652 n
= isl_map_dim(map
, isl_dim_out
);
4653 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4654 space
= isl_map_get_space(map
);
4655 space
= isl_space_params(space
);
4656 map
= isl_map_reset_space(map
, space
);
4660 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4663 struct isl_basic_set
*domain
;
4669 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4671 n_in
= isl_basic_map_n_in(bmap
);
4672 n_out
= isl_basic_map_n_out(bmap
);
4673 domain
= isl_basic_set_from_basic_map(bmap
);
4674 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4676 domain
= isl_basic_set_reset_space(domain
, dim
);
4681 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4685 return isl_space_may_be_set(bmap
->dim
);
4688 /* Is this basic map actually a set?
4689 * Users should never call this function. Outside of isl,
4690 * the type should indicate whether something is a set or a map.
4692 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4696 return isl_space_is_set(bmap
->dim
);
4699 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4703 if (isl_basic_map_is_set(bmap
))
4705 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4708 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4709 __isl_take isl_basic_map
*bmap
)
4713 isl_basic_map
*domain
;
4714 int nparam
, n_in
, n_out
;
4717 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4718 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4719 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4721 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4722 domain
= isl_basic_map_universe(dim
);
4724 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4725 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4726 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4728 total
= isl_basic_map_total_dim(bmap
);
4730 for (i
= 0; i
< n_in
; ++i
) {
4731 k
= isl_basic_map_alloc_equality(bmap
);
4734 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4735 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4736 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4739 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4740 return isl_basic_map_finalize(bmap
);
4742 isl_basic_map_free(bmap
);
4746 __isl_give isl_basic_map
*isl_basic_map_range_map(
4747 __isl_take isl_basic_map
*bmap
)
4751 isl_basic_map
*range
;
4752 int nparam
, n_in
, n_out
;
4755 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4756 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4757 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4759 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4760 range
= isl_basic_map_universe(dim
);
4762 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4763 bmap
= isl_basic_map_apply_range(bmap
, range
);
4764 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4766 total
= isl_basic_map_total_dim(bmap
);
4768 for (i
= 0; i
< n_out
; ++i
) {
4769 k
= isl_basic_map_alloc_equality(bmap
);
4772 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4773 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4774 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4777 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4778 return isl_basic_map_finalize(bmap
);
4780 isl_basic_map_free(bmap
);
4784 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4788 return isl_space_may_be_set(map
->dim
);
4791 /* Is this map actually a set?
4792 * Users should never call this function. Outside of isl,
4793 * the type should indicate whether something is a set or a map.
4795 int isl_map_is_set(__isl_keep isl_map
*map
)
4799 return isl_space_is_set(map
->dim
);
4802 struct isl_set
*isl_map_range(struct isl_map
*map
)
4805 struct isl_set
*set
;
4809 if (isl_map_is_set(map
))
4810 return (isl_set
*)map
;
4812 map
= isl_map_cow(map
);
4816 set
= (struct isl_set
*) map
;
4817 set
->dim
= isl_space_range(set
->dim
);
4820 for (i
= 0; i
< map
->n
; ++i
) {
4821 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4825 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4826 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4833 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4836 isl_space
*domain_dim
;
4838 map
= isl_map_cow(map
);
4842 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4843 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4844 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4847 for (i
= 0; i
< map
->n
; ++i
) {
4848 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4852 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4853 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4860 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4863 isl_space
*range_dim
;
4865 map
= isl_map_cow(map
);
4869 range_dim
= isl_space_range(isl_map_get_space(map
));
4870 range_dim
= isl_space_from_range(range_dim
);
4871 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4872 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4875 for (i
= 0; i
< map
->n
; ++i
) {
4876 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4880 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4881 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4888 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4889 __isl_take isl_space
*dim
)
4892 struct isl_map
*map
= NULL
;
4894 set
= isl_set_cow(set
);
4897 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4898 map
= (struct isl_map
*)set
;
4899 for (i
= 0; i
< set
->n
; ++i
) {
4900 map
->p
[i
] = isl_basic_map_from_basic_set(
4901 set
->p
[i
], isl_space_copy(dim
));
4905 isl_space_free(map
->dim
);
4909 isl_space_free(dim
);
4914 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4915 __isl_take isl_basic_set
*bset
)
4917 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4920 __isl_give isl_basic_map
*isl_basic_map_from_range(
4921 __isl_take isl_basic_set
*bset
)
4924 space
= isl_basic_set_get_space(bset
);
4925 space
= isl_space_from_range(space
);
4926 bset
= isl_basic_set_reset_space(bset
, space
);
4927 return (isl_basic_map
*)bset
;
4930 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
4933 space
= isl_set_get_space(set
);
4934 space
= isl_space_from_range(space
);
4935 set
= isl_set_reset_space(set
, space
);
4936 return (struct isl_map
*)set
;
4939 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
4941 return isl_map_reverse(isl_map_from_range(set
));
4944 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
4945 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
4947 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
4950 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
4951 __isl_take isl_set
*range
)
4953 return isl_map_apply_range(isl_map_reverse(domain
), range
);
4956 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
4959 struct isl_set
*set
= NULL
;
4963 map
= isl_map_cow(map
);
4966 map
->dim
= isl_space_as_set_space(map
->dim
);
4969 set
= (struct isl_set
*)map
;
4970 for (i
= 0; i
< map
->n
; ++i
) {
4971 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
4981 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
4984 struct isl_map
*map
;
4989 isl_die(dim
->ctx
, isl_error_internal
,
4990 "negative number of basic maps", goto error
);
4991 map
= isl_alloc(dim
->ctx
, struct isl_map
,
4992 sizeof(struct isl_map
) +
4993 (n
- 1) * sizeof(struct isl_basic_map
*));
4997 map
->ctx
= dim
->ctx
;
4998 isl_ctx_ref(map
->ctx
);
5006 isl_space_free(dim
);
5010 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5011 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5014 struct isl_map
*map
;
5017 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5021 map
= isl_map_alloc_space(dims
, n
, flags
);
5025 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5027 struct isl_basic_map
*bmap
;
5028 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5029 bmap
= isl_basic_map_set_to_empty(bmap
);
5033 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5035 struct isl_basic_set
*bset
;
5036 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5037 bset
= isl_basic_set_set_to_empty(bset
);
5041 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5043 struct isl_basic_map
*bmap
;
5046 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5047 bmap
= isl_basic_map_set_to_empty(bmap
);
5051 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5053 struct isl_basic_map
*bmap
;
5056 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5057 bmap
= isl_basic_map_set_to_empty(bmap
);
5061 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5063 struct isl_basic_set
*bset
;
5066 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5067 bset
= isl_basic_set_set_to_empty(bset
);
5071 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5073 struct isl_basic_map
*bmap
;
5074 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5075 bmap
= isl_basic_map_finalize(bmap
);
5079 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5081 struct isl_basic_set
*bset
;
5082 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5083 bset
= isl_basic_set_finalize(bset
);
5087 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5090 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5091 isl_basic_map
*bmap
;
5093 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5094 for (i
= 0; i
< total
; ++i
) {
5095 int k
= isl_basic_map_alloc_inequality(bmap
);
5098 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5099 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5103 isl_basic_map_free(bmap
);
5107 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5109 return isl_basic_map_nat_universe(dim
);
5112 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5114 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5117 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5119 return isl_map_nat_universe(dim
);
5122 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5123 __isl_keep isl_basic_map
*model
)
5127 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5130 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5134 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5137 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5138 __isl_keep isl_set
*model
)
5142 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5145 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5147 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5150 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5154 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5157 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5161 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5164 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5166 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5169 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5173 return isl_set_empty(isl_space_copy(model
->dim
));
5176 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5178 struct isl_map
*map
;
5181 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5182 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5186 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5188 struct isl_set
*set
;
5191 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5192 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5196 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5200 return isl_set_universe(isl_space_copy(model
->dim
));
5203 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5206 struct isl_map
*dup
;
5210 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5211 for (i
= 0; i
< map
->n
; ++i
)
5212 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5216 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5217 __isl_take isl_basic_map
*bmap
)
5221 if (isl_basic_map_plain_is_empty(bmap
)) {
5222 isl_basic_map_free(bmap
);
5225 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5226 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5227 map
->p
[map
->n
] = bmap
;
5229 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5235 isl_basic_map_free(bmap
);
5239 void *isl_map_free(struct isl_map
*map
)
5249 isl_ctx_deref(map
->ctx
);
5250 for (i
= 0; i
< map
->n
; ++i
)
5251 isl_basic_map_free(map
->p
[i
]);
5252 isl_space_free(map
->dim
);
5258 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5259 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5263 base
= isl_map_cow(base
);
5267 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5270 for (i
= 0; i
< base
->n
; ++i
) {
5271 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5272 isl_space_copy(base
->dim
), 0, 0, 0);
5282 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5283 unsigned nparam
, unsigned dim
)
5285 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5289 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5290 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5294 bmap
= isl_basic_map_cow(bmap
);
5295 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5296 j
= isl_basic_map_alloc_equality(bmap
);
5299 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5300 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5301 isl_int_set_si(bmap
->eq
[j
][0], value
);
5302 bmap
= isl_basic_map_simplify(bmap
);
5303 return isl_basic_map_finalize(bmap
);
5305 isl_basic_map_free(bmap
);
5309 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5310 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5314 bmap
= isl_basic_map_cow(bmap
);
5315 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5316 j
= isl_basic_map_alloc_equality(bmap
);
5319 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5320 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5321 isl_int_set(bmap
->eq
[j
][0], value
);
5322 bmap
= isl_basic_map_simplify(bmap
);
5323 return isl_basic_map_finalize(bmap
);
5325 isl_basic_map_free(bmap
);
5329 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5330 enum isl_dim_type type
, unsigned pos
, int value
)
5334 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5335 return isl_basic_map_fix_pos_si(bmap
,
5336 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5338 isl_basic_map_free(bmap
);
5342 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5343 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5347 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5348 return isl_basic_map_fix_pos(bmap
,
5349 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5351 isl_basic_map_free(bmap
);
5355 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5356 * to be equal to "v".
5358 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5359 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5363 if (!isl_val_is_int(v
))
5364 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5365 "expecting integer value", goto error
);
5366 if (pos
>= isl_basic_map_dim(bmap
, type
))
5367 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5368 "index out of bounds", goto error
);
5369 pos
+= isl_basic_map_offset(bmap
, type
);
5370 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5374 isl_basic_map_free(bmap
);
5379 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5380 * to be equal to "v".
5382 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5383 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5385 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5388 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5389 enum isl_dim_type type
, unsigned pos
, int value
)
5391 return (struct isl_basic_set
*)
5392 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5396 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5397 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5399 return (struct isl_basic_set
*)
5400 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5404 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5405 unsigned input
, int value
)
5407 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5410 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5411 unsigned dim
, int value
)
5413 return (struct isl_basic_set
*)
5414 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5415 isl_dim_set
, dim
, value
);
5418 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5420 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5427 isl_basic_map_free(map
->p
[i
]);
5428 if (i
!= map
->n
- 1) {
5429 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5430 map
->p
[i
] = map
->p
[map
->n
- 1];
5437 /* Perform "fn" on each basic map of "map", where we may not be holding
5438 * the only reference to "map".
5439 * In particular, "fn" should be a semantics preserving operation
5440 * that we want to apply to all copies of "map". We therefore need
5441 * to be careful not to modify "map" in a way that breaks "map"
5442 * in case anything goes wrong.
5444 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5445 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5447 struct isl_basic_map
*bmap
;
5453 for (i
= map
->n
- 1; i
>= 0; --i
) {
5454 bmap
= isl_basic_map_copy(map
->p
[i
]);
5458 isl_basic_map_free(map
->p
[i
]);
5460 if (remove_if_empty(map
, i
) < 0)
5470 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5471 enum isl_dim_type type
, unsigned pos
, int value
)
5475 map
= isl_map_cow(map
);
5479 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5480 for (i
= map
->n
- 1; i
>= 0; --i
) {
5481 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5482 if (remove_if_empty(map
, i
) < 0)
5485 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5492 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5493 enum isl_dim_type type
, unsigned pos
, int value
)
5495 return (struct isl_set
*)
5496 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5499 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5500 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5504 map
= isl_map_cow(map
);
5508 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5509 for (i
= 0; i
< map
->n
; ++i
) {
5510 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5514 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5521 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5522 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5524 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5527 /* Fix the value of the variable at position "pos" of type "type" of "map"
5528 * to be equal to "v".
5530 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5531 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5535 map
= isl_map_cow(map
);
5539 if (!isl_val_is_int(v
))
5540 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5541 "expecting integer value", goto error
);
5542 if (pos
>= isl_map_dim(map
, type
))
5543 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5544 "index out of bounds", goto error
);
5545 for (i
= map
->n
- 1; i
>= 0; --i
) {
5546 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5548 if (remove_if_empty(map
, i
) < 0)
5551 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5560 /* Fix the value of the variable at position "pos" of type "type" of "set"
5561 * to be equal to "v".
5563 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5564 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5566 return isl_map_fix_val(set
, type
, pos
, v
);
5569 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5570 unsigned input
, int value
)
5572 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5575 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5577 return (struct isl_set
*)
5578 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5581 static __isl_give isl_basic_map
*basic_map_bound_si(
5582 __isl_take isl_basic_map
*bmap
,
5583 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5589 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5590 pos
+= isl_basic_map_offset(bmap
, type
);
5591 bmap
= isl_basic_map_cow(bmap
);
5592 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5593 j
= isl_basic_map_alloc_inequality(bmap
);
5596 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5598 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5599 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5601 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5602 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5604 bmap
= isl_basic_map_simplify(bmap
);
5605 return isl_basic_map_finalize(bmap
);
5607 isl_basic_map_free(bmap
);
5611 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5612 __isl_take isl_basic_map
*bmap
,
5613 enum isl_dim_type type
, unsigned pos
, int value
)
5615 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5618 /* Constrain the values of the given dimension to be no greater than "value".
5620 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5621 __isl_take isl_basic_map
*bmap
,
5622 enum isl_dim_type type
, unsigned pos
, int value
)
5624 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5627 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5628 unsigned dim
, isl_int value
)
5632 bset
= isl_basic_set_cow(bset
);
5633 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5634 j
= isl_basic_set_alloc_inequality(bset
);
5637 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5638 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5639 isl_int_neg(bset
->ineq
[j
][0], value
);
5640 bset
= isl_basic_set_simplify(bset
);
5641 return isl_basic_set_finalize(bset
);
5643 isl_basic_set_free(bset
);
5647 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5648 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5652 map
= isl_map_cow(map
);
5656 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5657 for (i
= 0; i
< map
->n
; ++i
) {
5658 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5659 type
, pos
, value
, upper
);
5663 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5670 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5671 enum isl_dim_type type
, unsigned pos
, int value
)
5673 return map_bound_si(map
, type
, pos
, value
, 0);
5676 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5677 enum isl_dim_type type
, unsigned pos
, int value
)
5679 return map_bound_si(map
, type
, pos
, value
, 1);
5682 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5683 enum isl_dim_type type
, unsigned pos
, int value
)
5685 return (struct isl_set
*)
5686 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5689 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5690 enum isl_dim_type type
, unsigned pos
, int value
)
5692 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5695 /* Bound the given variable of "bmap" from below (or above is "upper"
5696 * is set) to "value".
5698 static __isl_give isl_basic_map
*basic_map_bound(
5699 __isl_take isl_basic_map
*bmap
,
5700 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5706 if (pos
>= isl_basic_map_dim(bmap
, type
))
5707 isl_die(bmap
->ctx
, isl_error_invalid
,
5708 "index out of bounds", goto error
);
5709 pos
+= isl_basic_map_offset(bmap
, type
);
5710 bmap
= isl_basic_map_cow(bmap
);
5711 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5712 j
= isl_basic_map_alloc_inequality(bmap
);
5715 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5717 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5718 isl_int_set(bmap
->ineq
[j
][0], value
);
5720 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5721 isl_int_neg(bmap
->ineq
[j
][0], value
);
5723 bmap
= isl_basic_map_simplify(bmap
);
5724 return isl_basic_map_finalize(bmap
);
5726 isl_basic_map_free(bmap
);
5730 /* Bound the given variable of "map" from below (or above is "upper"
5731 * is set) to "value".
5733 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5734 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5738 map
= isl_map_cow(map
);
5742 if (pos
>= isl_map_dim(map
, type
))
5743 isl_die(map
->ctx
, isl_error_invalid
,
5744 "index out of bounds", goto error
);
5745 for (i
= map
->n
- 1; i
>= 0; --i
) {
5746 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5747 if (remove_if_empty(map
, i
) < 0)
5750 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5757 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5758 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5760 return map_bound(map
, type
, pos
, value
, 0);
5763 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5764 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5766 return map_bound(map
, type
, pos
, value
, 1);
5769 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5770 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5772 return isl_map_lower_bound(set
, type
, pos
, value
);
5775 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5776 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5778 return isl_map_upper_bound(set
, type
, pos
, value
);
5781 /* Force the values of the variable at position "pos" of type "type" of "set"
5782 * to be no smaller than "value".
5784 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
5785 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5789 if (!isl_val_is_int(value
))
5790 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5791 "expecting integer value", goto error
);
5792 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
5793 isl_val_free(value
);
5796 isl_val_free(value
);
5801 /* Force the values of the variable at position "pos" of type "type" of "set"
5802 * to be no greater than "value".
5804 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
5805 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5809 if (!isl_val_is_int(value
))
5810 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5811 "expecting integer value", goto error
);
5812 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
5813 isl_val_free(value
);
5816 isl_val_free(value
);
5821 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5826 set
= isl_set_cow(set
);
5830 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5831 for (i
= 0; i
< set
->n
; ++i
) {
5832 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5842 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5846 map
= isl_map_cow(map
);
5850 map
->dim
= isl_space_reverse(map
->dim
);
5853 for (i
= 0; i
< map
->n
; ++i
) {
5854 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5858 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5865 static struct isl_map
*isl_basic_map_partial_lexopt(
5866 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5867 struct isl_set
**empty
, int max
)
5871 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5872 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5874 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5876 isl_basic_map_free(bmap
);
5877 isl_basic_set_free(dom
);
5883 struct isl_map
*isl_basic_map_partial_lexmax(
5884 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5885 struct isl_set
**empty
)
5887 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5890 struct isl_map
*isl_basic_map_partial_lexmin(
5891 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5892 struct isl_set
**empty
)
5894 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5897 struct isl_set
*isl_basic_set_partial_lexmin(
5898 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5899 struct isl_set
**empty
)
5901 return (struct isl_set
*)
5902 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5906 struct isl_set
*isl_basic_set_partial_lexmax(
5907 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5908 struct isl_set
**empty
)
5910 return (struct isl_set
*)
5911 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5915 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5916 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5917 __isl_give isl_set
**empty
)
5919 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5922 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5923 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5924 __isl_give isl_set
**empty
)
5926 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5929 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5930 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5931 __isl_give isl_set
**empty
)
5933 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
5936 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
5937 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5938 __isl_give isl_set
**empty
)
5940 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
5943 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
5944 __isl_take isl_basic_map
*bmap
, int max
)
5946 isl_basic_set
*dom
= NULL
;
5947 isl_space
*dom_space
;
5951 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
5952 dom
= isl_basic_set_universe(dom_space
);
5953 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
5955 isl_basic_map_free(bmap
);
5959 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
5960 __isl_take isl_basic_map
*bmap
)
5962 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
5966 #define TYPE isl_pw_multi_aff
5968 #define SUFFIX _pw_multi_aff
5970 #define EMPTY isl_pw_multi_aff_empty
5972 #define ADD isl_pw_multi_aff_union_add
5973 #include "isl_map_lexopt_templ.c"
5975 /* Given a map "map", compute the lexicographically minimal
5976 * (or maximal) image element for each domain element in dom,
5977 * in the form of an isl_pw_multi_aff.
5978 * Set *empty to those elements in dom that do not have an image element.
5980 * We first compute the lexicographically minimal or maximal element
5981 * in the first basic map. This results in a partial solution "res"
5982 * and a subset "todo" of dom that still need to be handled.
5983 * We then consider each of the remaining maps in "map" and successively
5984 * update both "res" and "todo".
5986 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
5987 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
5988 __isl_give isl_set
**empty
, int max
)
5991 isl_pw_multi_aff
*res
;
5997 if (isl_map_plain_is_empty(map
)) {
6002 return isl_pw_multi_aff_from_map(map
);
6005 res
= basic_map_partial_lexopt_pw_multi_aff(
6006 isl_basic_map_copy(map
->p
[0]),
6007 isl_set_copy(dom
), &todo
, max
);
6009 for (i
= 1; i
< map
->n
; ++i
) {
6010 isl_pw_multi_aff
*res_i
;
6013 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6014 isl_basic_map_copy(map
->p
[i
]),
6015 isl_set_copy(dom
), &todo_i
, max
);
6018 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6020 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6022 todo
= isl_set_intersect(todo
, todo_i
);
6043 #define TYPE isl_map
6047 #define EMPTY isl_map_empty
6049 #define ADD isl_map_union_disjoint
6050 #include "isl_map_lexopt_templ.c"
6052 /* Given a map "map", compute the lexicographically minimal
6053 * (or maximal) image element for each domain element in dom.
6054 * Set *empty to those elements in dom that do not have an image element.
6056 * We first compute the lexicographically minimal or maximal element
6057 * in the first basic map. This results in a partial solution "res"
6058 * and a subset "todo" of dom that still need to be handled.
6059 * We then consider each of the remaining maps in "map" and successively
6060 * update both "res" and "todo".
6062 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6063 * Assume we are computing the lexicographical maximum.
6064 * We first compute the lexicographically maximal element in basic map i.
6065 * This results in a partial solution res_i and a subset todo_i.
6066 * Then we combine these results with those obtain for the first k basic maps
6067 * to obtain a result that is valid for the first k+1 basic maps.
6068 * In particular, the set where there is no solution is the set where
6069 * there is no solution for the first k basic maps and also no solution
6070 * for the ith basic map, i.e.,
6072 * todo^i = todo^k * todo_i
6074 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6075 * solutions, arbitrarily breaking ties in favor of res^k.
6076 * That is, when res^k(a) >= res_i(a), we pick res^k and
6077 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6078 * the lexicographic order.)
6079 * In practice, we compute
6081 * res^k * (res_i . "<=")
6085 * res_i * (res^k . "<")
6087 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6088 * where only one of res^k and res_i provides a solution and we simply pick
6095 * Note that we only compute these intersections when dom(res^k) intersects
6096 * dom(res_i). Otherwise, the only effect of these intersections is to
6097 * potentially break up res^k and res_i into smaller pieces.
6098 * We want to avoid such splintering as much as possible.
6099 * In fact, an earlier implementation of this function would look for
6100 * better results in the domain of res^k and for extra results in todo^k,
6101 * but this would always result in a splintering according to todo^k,
6102 * even when the domain of basic map i is disjoint from the domains of
6103 * the previous basic maps.
6105 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6106 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6107 __isl_give isl_set
**empty
, int max
)
6110 struct isl_map
*res
;
6111 struct isl_set
*todo
;
6116 if (isl_map_plain_is_empty(map
)) {
6124 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6125 isl_set_copy(dom
), &todo
, max
);
6127 for (i
= 1; i
< map
->n
; ++i
) {
6131 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
6133 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
6134 isl_set_copy(dom
), &todo_i
, max
);
6137 lt
= isl_map_lex_lt(isl_space_copy(dim
));
6138 le
= isl_map_lex_le(dim
);
6140 lt
= isl_map_lex_gt(isl_space_copy(dim
));
6141 le
= isl_map_lex_ge(dim
);
6143 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
6144 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6145 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6146 le
= isl_map_intersect(le
, isl_map_copy(res
));
6148 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6149 res
= isl_map_intersect_domain(res
,
6150 isl_set_copy(todo_i
));
6151 res_i
= isl_map_intersect_domain(res_i
,
6152 isl_set_copy(todo
));
6155 res
= isl_map_union_disjoint(res
, res_i
);
6156 res
= isl_map_union_disjoint(res
, lt
);
6157 res
= isl_map_union_disjoint(res
, le
);
6159 todo
= isl_set_intersect(todo
, todo_i
);
6179 __isl_give isl_map
*isl_map_partial_lexmax(
6180 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6181 __isl_give isl_set
**empty
)
6183 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6186 __isl_give isl_map
*isl_map_partial_lexmin(
6187 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6188 __isl_give isl_set
**empty
)
6190 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6193 __isl_give isl_set
*isl_set_partial_lexmin(
6194 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6195 __isl_give isl_set
**empty
)
6197 return (struct isl_set
*)
6198 isl_map_partial_lexmin((struct isl_map
*)set
,
6202 __isl_give isl_set
*isl_set_partial_lexmax(
6203 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6204 __isl_give isl_set
**empty
)
6206 return (struct isl_set
*)
6207 isl_map_partial_lexmax((struct isl_map
*)set
,
6211 /* Compute the lexicographic minimum (or maximum if "max" is set)
6212 * of "bmap" over its domain.
6214 * Since we are not interested in the part of the domain space where
6215 * there is no solution, we initialize the domain to those constraints
6216 * of "bmap" that only involve the parameters and the input dimensions.
6217 * This relieves the parametric programming engine from detecting those
6218 * inequalities and transferring them to the context. More importantly,
6219 * it ensures that those inequalities are transferred first and not
6220 * intermixed with inequalities that actually split the domain.
6222 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6226 isl_basic_map
*copy
;
6229 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6230 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6231 copy
= isl_basic_map_copy(bmap
);
6232 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6233 isl_dim_div
, 0, n_div
);
6234 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6235 isl_dim_out
, 0, n_out
);
6236 dom
= isl_basic_map_domain(copy
);
6237 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6240 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6242 return isl_basic_map_lexopt(bmap
, 0);
6245 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6247 return isl_basic_map_lexopt(bmap
, 1);
6250 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6252 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6255 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6257 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6260 /* Extract the first and only affine expression from list
6261 * and then add it to *pwaff with the given dom.
6262 * This domain is known to be disjoint from other domains
6263 * because of the way isl_basic_map_foreach_lexmax works.
6265 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6266 __isl_take isl_aff_list
*list
, void *user
)
6268 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6270 isl_pw_aff
**pwaff
= user
;
6271 isl_pw_aff
*pwaff_i
;
6275 if (isl_aff_list_n_aff(list
) != 1)
6276 isl_die(ctx
, isl_error_internal
,
6277 "expecting single element list", goto error
);
6279 aff
= isl_aff_list_get_aff(list
, 0);
6280 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6282 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6284 isl_aff_list_free(list
);
6288 isl_basic_set_free(dom
);
6289 isl_aff_list_free(list
);
6293 /* Given a basic map with one output dimension, compute the minimum or
6294 * maximum of that dimension as an isl_pw_aff.
6296 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6297 * call update_dim_opt on each leaf of the result.
6299 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6302 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6306 dim
= isl_space_from_domain(isl_space_domain(dim
));
6307 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6308 pwaff
= isl_pw_aff_empty(dim
);
6310 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6312 return isl_pw_aff_free(pwaff
);
6317 /* Compute the minimum or maximum of the given output dimension
6318 * as a function of the parameters and the input dimensions,
6319 * but independently of the other output dimensions.
6321 * We first project out the other output dimension and then compute
6322 * the "lexicographic" maximum in each basic map, combining the results
6323 * using isl_pw_aff_union_max.
6325 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6332 n_out
= isl_map_dim(map
, isl_dim_out
);
6333 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6334 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6339 isl_space
*dim
= isl_map_get_space(map
);
6340 dim
= isl_space_domain(isl_space_from_range(dim
));
6342 return isl_pw_aff_empty(dim
);
6345 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6346 for (i
= 1; i
< map
->n
; ++i
) {
6347 isl_pw_aff
*pwaff_i
;
6349 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6350 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6358 /* Compute the maximum of the given output dimension as a function of the
6359 * parameters and input dimensions, but independently of
6360 * the other output dimensions.
6362 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6364 return map_dim_opt(map
, pos
, 1);
6367 /* Compute the minimum or maximum of the given set dimension
6368 * as a function of the parameters,
6369 * but independently of the other set dimensions.
6371 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6374 return map_dim_opt(set
, pos
, max
);
6377 /* Compute the maximum of the given set dimension as a function of the
6378 * parameters, but independently of the other set dimensions.
6380 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6382 return set_dim_opt(set
, pos
, 1);
6385 /* Compute the minimum 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_min(__isl_take isl_set
*set
, int pos
)
6390 return set_dim_opt(set
, pos
, 0);
6393 /* Apply a preimage specified by "mat" on the parameters of "bset".
6394 * bset is assumed to have only parameters and divs.
6396 static struct isl_basic_set
*basic_set_parameter_preimage(
6397 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6404 bset
->dim
= isl_space_cow(bset
->dim
);
6408 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6410 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6412 bset
->dim
->nparam
= 0;
6413 bset
->dim
->n_out
= nparam
;
6414 bset
= isl_basic_set_preimage(bset
, mat
);
6416 bset
->dim
->nparam
= bset
->dim
->n_out
;
6417 bset
->dim
->n_out
= 0;
6422 isl_basic_set_free(bset
);
6426 /* Apply a preimage specified by "mat" on the parameters of "set".
6427 * set is assumed to have only parameters and divs.
6429 static struct isl_set
*set_parameter_preimage(
6430 struct isl_set
*set
, struct isl_mat
*mat
)
6432 isl_space
*dim
= NULL
;
6438 dim
= isl_space_copy(set
->dim
);
6439 dim
= isl_space_cow(dim
);
6443 nparam
= isl_set_dim(set
, isl_dim_param
);
6445 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6448 dim
->n_out
= nparam
;
6449 isl_set_reset_space(set
, dim
);
6450 set
= isl_set_preimage(set
, mat
);
6453 dim
= isl_space_copy(set
->dim
);
6454 dim
= isl_space_cow(dim
);
6457 dim
->nparam
= dim
->n_out
;
6459 isl_set_reset_space(set
, dim
);
6462 isl_space_free(dim
);
6469 /* Intersect the basic set "bset" with the affine space specified by the
6470 * equalities in "eq".
6472 static struct isl_basic_set
*basic_set_append_equalities(
6473 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6481 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6486 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6487 for (i
= 0; i
< eq
->n_row
; ++i
) {
6488 k
= isl_basic_set_alloc_equality(bset
);
6491 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6492 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6496 bset
= isl_basic_set_gauss(bset
, NULL
);
6497 bset
= isl_basic_set_finalize(bset
);
6502 isl_basic_set_free(bset
);
6506 /* Intersect the set "set" with the affine space specified by the
6507 * equalities in "eq".
6509 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6517 for (i
= 0; i
< set
->n
; ++i
) {
6518 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6531 /* Given a basic set "bset" that only involves parameters and existentially
6532 * quantified variables, return the index of the first equality
6533 * that only involves parameters. If there is no such equality then
6534 * return bset->n_eq.
6536 * This function assumes that isl_basic_set_gauss has been called on "bset".
6538 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6541 unsigned nparam
, n_div
;
6546 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6547 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6549 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6550 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6557 /* Compute an explicit representation for the existentially quantified
6558 * variables in "bset" by computing the "minimal value" of the set
6559 * variables. Since there are no set variables, the computation of
6560 * the minimal value essentially computes an explicit representation
6561 * of the non-empty part(s) of "bset".
6563 * The input only involves parameters and existentially quantified variables.
6564 * All equalities among parameters have been removed.
6566 * Since the existentially quantified variables in the result are in general
6567 * going to be different from those in the input, we first replace
6568 * them by the minimal number of variables based on their equalities.
6569 * This should simplify the parametric integer programming.
6571 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6573 isl_morph
*morph1
, *morph2
;
6579 if (bset
->n_eq
== 0)
6580 return isl_basic_set_lexmin(bset
);
6582 morph1
= isl_basic_set_parameter_compression(bset
);
6583 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6584 bset
= isl_basic_set_lift(bset
);
6585 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6586 bset
= isl_morph_basic_set(morph2
, bset
);
6587 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6588 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6590 set
= isl_basic_set_lexmin(bset
);
6592 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6597 /* Project the given basic set onto its parameter domain, possibly introducing
6598 * new, explicit, existential variables in the constraints.
6599 * The input has parameters and (possibly implicit) existential variables.
6600 * The output has the same parameters, but only
6601 * explicit existentially quantified variables.
6603 * The actual projection is performed by pip, but pip doesn't seem
6604 * to like equalities very much, so we first remove the equalities
6605 * among the parameters by performing a variable compression on
6606 * the parameters. Afterward, an inverse transformation is performed
6607 * and the equalities among the parameters are inserted back in.
6609 * The variable compression on the parameters may uncover additional
6610 * equalities that were only implicit before. We therefore check
6611 * if there are any new parameter equalities in the result and
6612 * if so recurse. The removal of parameter equalities is required
6613 * for the parameter compression performed by base_compute_divs.
6615 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6619 struct isl_mat
*T
, *T2
;
6620 struct isl_set
*set
;
6623 bset
= isl_basic_set_cow(bset
);
6627 if (bset
->n_eq
== 0)
6628 return base_compute_divs(bset
);
6630 bset
= isl_basic_set_gauss(bset
, NULL
);
6633 if (isl_basic_set_plain_is_empty(bset
))
6634 return isl_set_from_basic_set(bset
);
6636 i
= first_parameter_equality(bset
);
6637 if (i
== bset
->n_eq
)
6638 return base_compute_divs(bset
);
6640 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6641 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6643 eq
= isl_mat_cow(eq
);
6644 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6645 if (T
&& T
->n_col
== 0) {
6649 bset
= isl_basic_set_set_to_empty(bset
);
6650 return isl_set_from_basic_set(bset
);
6652 bset
= basic_set_parameter_preimage(bset
, T
);
6654 i
= first_parameter_equality(bset
);
6657 else if (i
== bset
->n_eq
)
6658 set
= base_compute_divs(bset
);
6660 set
= parameter_compute_divs(bset
);
6661 set
= set_parameter_preimage(set
, T2
);
6662 set
= set_append_equalities(set
, eq
);
6666 /* Insert the divs from "ls" before those of "bmap".
6668 * The number of columns is not changed, which means that the last
6669 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6670 * The caller is responsible for removing the same number of dimensions
6671 * from the space of "bmap".
6673 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6674 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6680 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6684 old_n_div
= bmap
->n_div
;
6685 bmap
= insert_div_rows(bmap
, n_div
);
6689 for (i
= 0; i
< n_div
; ++i
) {
6690 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6691 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6697 /* Replace the space of "bmap" by the space and divs of "ls".
6699 * If "ls" has any divs, then we simplify the result since we may
6700 * have discovered some additional equalities that could simplify
6701 * the div expressions.
6703 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6704 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6708 bmap
= isl_basic_map_cow(bmap
);
6712 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6713 bmap
= insert_divs_from_local_space(bmap
, ls
);
6717 isl_space_free(bmap
->dim
);
6718 bmap
->dim
= isl_local_space_get_space(ls
);
6722 isl_local_space_free(ls
);
6724 bmap
= isl_basic_map_simplify(bmap
);
6725 bmap
= isl_basic_map_finalize(bmap
);
6728 isl_basic_map_free(bmap
);
6729 isl_local_space_free(ls
);
6733 /* Replace the space of "map" by the space and divs of "ls".
6735 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6736 __isl_take isl_local_space
*ls
)
6740 map
= isl_map_cow(map
);
6744 for (i
= 0; i
< map
->n
; ++i
) {
6745 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6746 isl_local_space_copy(ls
));
6750 isl_space_free(map
->dim
);
6751 map
->dim
= isl_local_space_get_space(ls
);
6755 isl_local_space_free(ls
);
6758 isl_local_space_free(ls
);
6763 /* Compute an explicit representation for the existentially
6764 * quantified variables for which do not know any explicit representation yet.
6766 * We first sort the existentially quantified variables so that the
6767 * existentially quantified variables for which we already have an explicit
6768 * representation are placed before those for which we do not.
6769 * The input dimensions, the output dimensions and the existentially
6770 * quantified variables for which we already have an explicit
6771 * representation are then turned into parameters.
6772 * compute_divs returns a map with the same parameters and
6773 * no input or output dimensions and the dimension specification
6774 * is reset to that of the input, including the existentially quantified
6775 * variables for which we already had an explicit representation.
6777 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6779 struct isl_basic_set
*bset
;
6780 struct isl_set
*set
;
6781 struct isl_map
*map
;
6783 isl_local_space
*ls
;
6790 bmap
= isl_basic_map_sort_divs(bmap
);
6791 bmap
= isl_basic_map_cow(bmap
);
6795 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6796 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6799 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6800 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6801 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6802 dim
= isl_space_set_alloc(bmap
->ctx
,
6803 nparam
+ n_in
+ n_out
+ n_known
, 0);
6807 ls
= isl_basic_map_get_local_space(bmap
);
6808 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6809 n_known
, bmap
->n_div
- n_known
);
6811 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6812 swap_div(bmap
, i
- n_known
, i
);
6813 bmap
->n_div
-= n_known
;
6814 bmap
->extra
-= n_known
;
6816 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6817 bset
= (struct isl_basic_set
*)bmap
;
6819 set
= parameter_compute_divs(bset
);
6820 map
= (struct isl_map
*)set
;
6821 map
= replace_space_by_local_space(map
, ls
);
6825 isl_basic_map_free(bmap
);
6829 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6837 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6838 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6839 if (isl_int_is_zero(bmap
->div
[i
][0]))
6841 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6847 static int map_divs_known(__isl_keep isl_map
*map
)
6854 for (i
= 0; i
< map
->n
; ++i
) {
6855 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6863 /* If bmap contains any unknown divs, then compute explicit
6864 * expressions for them. However, this computation may be
6865 * quite expensive, so first try to remove divs that aren't
6868 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6871 struct isl_map
*map
;
6873 known
= isl_basic_map_divs_known(bmap
);
6877 return isl_map_from_basic_map(bmap
);
6879 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6881 known
= isl_basic_map_divs_known(bmap
);
6885 return isl_map_from_basic_map(bmap
);
6887 map
= compute_divs(bmap
);
6890 isl_basic_map_free(bmap
);
6894 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6898 struct isl_map
*res
;
6905 known
= map_divs_known(map
);
6913 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6914 for (i
= 1 ; i
< map
->n
; ++i
) {
6916 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6917 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6918 res
= isl_map_union_disjoint(res
, r2
);
6920 res
= isl_map_union(res
, r2
);
6927 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6929 return (struct isl_set
*)
6930 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
6933 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
6935 return (struct isl_set
*)
6936 isl_map_compute_divs((struct isl_map
*)set
);
6939 struct isl_set
*isl_map_domain(struct isl_map
*map
)
6942 struct isl_set
*set
;
6947 map
= isl_map_cow(map
);
6951 set
= (struct isl_set
*)map
;
6952 set
->dim
= isl_space_domain(set
->dim
);
6955 for (i
= 0; i
< map
->n
; ++i
) {
6956 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
6960 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
6961 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
6968 /* Return the union of "map1" and "map2", where we assume for now that
6969 * "map1" and "map2" are disjoint. Note that the basic maps inside
6970 * "map1" or "map2" may not be disjoint from each other.
6971 * Also note that this function is also called from isl_map_union,
6972 * which takes care of handling the situation where "map1" and "map2"
6973 * may not be disjoint.
6975 * If one of the inputs is empty, we can simply return the other input.
6976 * Similarly, if one of the inputs is universal, then it is equal to the union.
6978 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
6979 __isl_take isl_map
*map2
)
6983 struct isl_map
*map
= NULL
;
6998 is_universe
= isl_map_plain_is_universe(map1
);
6999 if (is_universe
< 0)
7006 is_universe
= isl_map_plain_is_universe(map2
);
7007 if (is_universe
< 0)
7014 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
7016 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7017 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7018 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7020 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7021 map1
->n
+ map2
->n
, flags
);
7024 for (i
= 0; i
< map1
->n
; ++i
) {
7025 map
= isl_map_add_basic_map(map
,
7026 isl_basic_map_copy(map1
->p
[i
]));
7030 for (i
= 0; i
< map2
->n
; ++i
) {
7031 map
= isl_map_add_basic_map(map
,
7032 isl_basic_map_copy(map2
->p
[i
]));
7046 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7047 __isl_take isl_map
*map2
)
7049 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7052 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
7054 map1
= isl_map_union_disjoint(map1
, map2
);
7058 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7062 struct isl_set
*isl_set_union_disjoint(
7063 struct isl_set
*set1
, struct isl_set
*set2
)
7065 return (struct isl_set
*)
7066 isl_map_union_disjoint(
7067 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7070 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7072 return (struct isl_set
*)
7073 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7076 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7079 * "map" and "set" are assumed to be compatible and non-NULL.
7081 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7082 __isl_take isl_set
*set
,
7083 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7084 __isl_take isl_basic_set
*bset
))
7087 struct isl_map
*result
;
7090 if (isl_set_plain_is_universe(set
)) {
7095 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7096 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7097 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7099 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7100 map
->n
* set
->n
, flags
);
7101 for (i
= 0; result
&& i
< map
->n
; ++i
)
7102 for (j
= 0; j
< set
->n
; ++j
) {
7103 result
= isl_map_add_basic_map(result
,
7104 fn(isl_basic_map_copy(map
->p
[i
]),
7105 isl_basic_set_copy(set
->p
[j
])));
7115 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7116 __isl_take isl_set
*set
)
7121 if (!isl_map_compatible_range(map
, set
))
7122 isl_die(set
->ctx
, isl_error_invalid
,
7123 "incompatible spaces", goto error
);
7125 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7132 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7133 __isl_take isl_set
*set
)
7135 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7138 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7139 __isl_take isl_set
*set
)
7144 if (!isl_map_compatible_domain(map
, set
))
7145 isl_die(set
->ctx
, isl_error_invalid
,
7146 "incompatible spaces", goto error
);
7148 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7155 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7156 __isl_take isl_set
*set
)
7158 return isl_map_align_params_map_map_and(map
, set
,
7159 &map_intersect_domain
);
7162 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7163 __isl_take isl_map
*map2
)
7167 map1
= isl_map_reverse(map1
);
7168 map1
= isl_map_apply_range(map1
, map2
);
7169 return isl_map_reverse(map1
);
7176 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7177 __isl_take isl_map
*map2
)
7179 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7182 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7183 __isl_take isl_map
*map2
)
7185 isl_space
*dim_result
;
7186 struct isl_map
*result
;
7192 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7193 isl_space_copy(map2
->dim
));
7195 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7198 for (i
= 0; i
< map1
->n
; ++i
)
7199 for (j
= 0; j
< map2
->n
; ++j
) {
7200 result
= isl_map_add_basic_map(result
,
7201 isl_basic_map_apply_range(
7202 isl_basic_map_copy(map1
->p
[i
]),
7203 isl_basic_map_copy(map2
->p
[j
])));
7209 if (result
&& result
->n
<= 1)
7210 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7218 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7219 __isl_take isl_map
*map2
)
7221 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7225 * returns range - domain
7227 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7229 isl_space
*dims
, *target_dim
;
7230 struct isl_basic_set
*bset
;
7237 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7238 bmap
->dim
, isl_dim_out
),
7240 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7241 dim
= isl_basic_map_n_in(bmap
);
7242 nparam
= isl_basic_map_n_param(bmap
);
7243 bset
= isl_basic_set_from_basic_map(bmap
);
7244 bset
= isl_basic_set_cow(bset
);
7245 dims
= isl_basic_set_get_space(bset
);
7246 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7247 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7248 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7249 for (i
= 0; i
< dim
; ++i
) {
7250 int j
= isl_basic_map_alloc_equality(
7251 (struct isl_basic_map
*)bset
);
7253 bset
= isl_basic_set_free(bset
);
7256 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7257 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7258 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7259 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7261 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7262 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7265 isl_basic_map_free(bmap
);
7270 * returns range - domain
7272 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7276 struct isl_set
*result
;
7281 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7282 map
->dim
, isl_dim_out
),
7284 dim
= isl_map_get_space(map
);
7285 dim
= isl_space_domain(dim
);
7286 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7289 for (i
= 0; i
< map
->n
; ++i
)
7290 result
= isl_set_add_basic_set(result
,
7291 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7300 * returns [domain -> range] -> range - domain
7302 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7303 __isl_take isl_basic_map
*bmap
)
7307 isl_basic_map
*domain
;
7311 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7312 isl_die(bmap
->ctx
, isl_error_invalid
,
7313 "domain and range don't match", goto error
);
7315 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7316 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7318 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7319 domain
= isl_basic_map_universe(dim
);
7321 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7322 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7323 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7325 total
= isl_basic_map_total_dim(bmap
);
7327 for (i
= 0; i
< n
; ++i
) {
7328 k
= isl_basic_map_alloc_equality(bmap
);
7331 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7332 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7333 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7334 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7337 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7338 return isl_basic_map_finalize(bmap
);
7340 isl_basic_map_free(bmap
);
7345 * returns [domain -> range] -> range - domain
7347 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7350 isl_space
*domain_dim
;
7355 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7356 isl_die(map
->ctx
, isl_error_invalid
,
7357 "domain and range don't match", goto error
);
7359 map
= isl_map_cow(map
);
7363 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7364 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7365 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7368 for (i
= 0; i
< map
->n
; ++i
) {
7369 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7373 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7380 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7382 struct isl_basic_map
*bmap
;
7390 nparam
= dims
->nparam
;
7392 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7396 for (i
= 0; i
< dim
; ++i
) {
7397 int j
= isl_basic_map_alloc_equality(bmap
);
7400 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7401 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7402 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7404 return isl_basic_map_finalize(bmap
);
7406 isl_basic_map_free(bmap
);
7410 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7414 if (dim
->n_in
!= dim
->n_out
)
7415 isl_die(dim
->ctx
, isl_error_invalid
,
7416 "number of input and output dimensions needs to be "
7417 "the same", goto error
);
7418 return basic_map_identity(dim
);
7420 isl_space_free(dim
);
7424 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7426 if (!model
|| !model
->dim
)
7428 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7431 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7433 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7436 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7438 if (!model
|| !model
->dim
)
7440 return isl_map_identity(isl_space_copy(model
->dim
));
7443 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7445 if (!model
|| !model
->dim
)
7447 return isl_map_identity(isl_space_copy(model
->dim
));
7450 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7452 isl_space
*dim
= isl_set_get_space(set
);
7454 id
= isl_map_identity(isl_space_map_from_set(dim
));
7455 return isl_map_intersect_range(id
, set
);
7458 /* Construct a basic set with all set dimensions having only non-negative
7461 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7462 __isl_take isl_space
*space
)
7467 struct isl_basic_set
*bset
;
7471 nparam
= space
->nparam
;
7473 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7476 for (i
= 0; i
< dim
; ++i
) {
7477 int k
= isl_basic_set_alloc_inequality(bset
);
7480 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7481 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7485 isl_basic_set_free(bset
);
7489 /* Construct the half-space x_pos >= 0.
7491 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7495 isl_basic_set
*nonneg
;
7497 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7498 k
= isl_basic_set_alloc_inequality(nonneg
);
7501 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7502 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7504 return isl_basic_set_finalize(nonneg
);
7506 isl_basic_set_free(nonneg
);
7510 /* Construct the half-space x_pos <= -1.
7512 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7517 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7518 k
= isl_basic_set_alloc_inequality(neg
);
7521 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7522 isl_int_set_si(neg
->ineq
[k
][0], -1);
7523 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7525 return isl_basic_set_finalize(neg
);
7527 isl_basic_set_free(neg
);
7531 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7532 enum isl_dim_type type
, unsigned first
, unsigned n
)
7535 isl_basic_set
*nonneg
;
7543 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7545 for (i
= 0; i
< n
; ++i
) {
7546 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7547 pos(set
->dim
, type
) + first
+ i
);
7548 neg
= neg_halfspace(isl_set_get_space(set
),
7549 pos(set
->dim
, type
) + first
+ i
);
7551 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7560 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7561 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7568 if (isl_set_plain_is_empty(set
)) {
7573 return fn(set
, signs
, user
);
7576 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7578 half
= isl_set_intersect(half
, isl_set_copy(set
));
7579 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7583 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7585 half
= isl_set_intersect(half
, set
);
7586 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7592 /* Call "fn" on the intersections of "set" with each of the orthants
7593 * (except for obviously empty intersections). The orthant is identified
7594 * by the signs array, with each entry having value 1 or -1 according
7595 * to the sign of the corresponding variable.
7597 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7598 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7608 if (isl_set_plain_is_empty(set
))
7611 nparam
= isl_set_dim(set
, isl_dim_param
);
7612 nvar
= isl_set_dim(set
, isl_dim_set
);
7614 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7616 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7624 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7626 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7629 int isl_basic_map_is_subset(
7630 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7633 struct isl_map
*map1
;
7634 struct isl_map
*map2
;
7636 if (!bmap1
|| !bmap2
)
7639 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7640 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7642 is_subset
= isl_map_is_subset(map1
, map2
);
7650 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7651 __isl_keep isl_basic_set
*bset2
)
7653 return isl_basic_map_is_subset(bset1
, bset2
);
7656 int isl_basic_map_is_equal(
7657 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7661 if (!bmap1
|| !bmap2
)
7663 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7666 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7670 int isl_basic_set_is_equal(
7671 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7673 return isl_basic_map_is_equal(
7674 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7677 int isl_map_is_empty(struct isl_map
*map
)
7684 for (i
= 0; i
< map
->n
; ++i
) {
7685 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7694 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7696 return map
? map
->n
== 0 : -1;
7699 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7701 return isl_map_plain_is_empty(map
);
7704 int isl_set_plain_is_empty(struct isl_set
*set
)
7706 return set
? set
->n
== 0 : -1;
7709 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7711 return isl_set_plain_is_empty(set
);
7714 int isl_set_is_empty(struct isl_set
*set
)
7716 return isl_map_is_empty((struct isl_map
*)set
);
7719 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7724 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7727 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7732 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7735 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7741 is_subset
= isl_map_is_subset(map1
, map2
);
7744 is_subset
= isl_map_is_subset(map2
, map1
);
7748 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7750 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7753 int isl_basic_map_is_strict_subset(
7754 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7758 if (!bmap1
|| !bmap2
)
7760 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7763 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7764 if (is_subset
== -1)
7769 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7775 is_subset
= isl_map_is_subset(map1
, map2
);
7778 is_subset
= isl_map_is_subset(map2
, map1
);
7779 if (is_subset
== -1)
7784 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7786 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7789 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7793 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7796 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7800 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7803 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7810 for (i
= 0; i
< map
->n
; ++i
) {
7811 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7819 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7821 return isl_map_plain_is_universe((isl_map
*) set
);
7824 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7826 return isl_set_plain_is_universe(set
);
7829 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7831 struct isl_basic_set
*bset
= NULL
;
7832 struct isl_vec
*sample
= NULL
;
7839 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7842 if (isl_basic_map_is_universe(bmap
))
7845 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7846 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7847 copy
= isl_basic_map_remove_redundancies(copy
);
7848 empty
= isl_basic_map_plain_is_empty(copy
);
7849 isl_basic_map_free(copy
);
7853 total
= 1 + isl_basic_map_total_dim(bmap
);
7854 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7855 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7861 isl_vec_free(bmap
->sample
);
7862 bmap
->sample
= NULL
;
7863 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7866 sample
= isl_basic_set_sample_vec(bset
);
7869 empty
= sample
->size
== 0;
7870 isl_vec_free(bmap
->sample
);
7871 bmap
->sample
= sample
;
7873 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7878 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7882 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7885 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7887 return isl_basic_map_plain_is_empty(bmap
);
7890 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7894 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7897 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7899 return isl_basic_set_plain_is_empty(bset
);
7902 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7904 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7907 struct isl_map
*isl_basic_map_union(
7908 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7910 struct isl_map
*map
;
7911 if (!bmap1
|| !bmap2
)
7914 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7916 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7919 map
= isl_map_add_basic_map(map
, bmap1
);
7920 map
= isl_map_add_basic_map(map
, bmap2
);
7923 isl_basic_map_free(bmap1
);
7924 isl_basic_map_free(bmap2
);
7928 struct isl_set
*isl_basic_set_union(
7929 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7931 return (struct isl_set
*)isl_basic_map_union(
7932 (struct isl_basic_map
*)bset1
,
7933 (struct isl_basic_map
*)bset2
);
7936 /* Order divs such that any div only depends on previous divs */
7937 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
7945 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
7947 for (i
= 0; i
< bmap
->n_div
; ++i
) {
7949 if (isl_int_is_zero(bmap
->div
[i
][0]))
7951 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
7955 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
7961 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
7963 return (struct isl_basic_set
*)
7964 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
7967 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
7974 for (i
= 0; i
< map
->n
; ++i
) {
7975 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
7986 /* Apply the expansion computed by isl_merge_divs.
7987 * The expansion itself is given by "exp" while the resulting
7988 * list of divs is given by "div".
7990 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
7991 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
7996 bset
= isl_basic_set_cow(bset
);
8000 if (div
->n_row
< bset
->n_div
)
8001 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8002 "not an expansion", goto error
);
8004 n_div
= bset
->n_div
;
8005 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
8006 div
->n_row
- n_div
, 0,
8007 2 * (div
->n_row
- n_div
));
8009 for (i
= n_div
; i
< div
->n_row
; ++i
)
8010 if (isl_basic_set_alloc_div(bset
) < 0)
8014 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
8015 if (j
>= 0 && exp
[j
] == i
) {
8017 isl_basic_map_swap_div(bset
, i
, j
);
8020 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
8021 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
8029 isl_basic_set_free(bset
);
8034 /* Look for a div in dst that corresponds to the div "div" in src.
8035 * The divs before "div" in src and dst are assumed to be the same.
8037 * Returns -1 if no corresponding div was found and the position
8038 * of the corresponding div in dst otherwise.
8040 static int find_div(struct isl_basic_map
*dst
,
8041 struct isl_basic_map
*src
, unsigned div
)
8045 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8047 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8048 for (i
= div
; i
< dst
->n_div
; ++i
)
8049 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8050 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8051 dst
->n_div
- div
) == -1)
8056 struct isl_basic_map
*isl_basic_map_align_divs(
8057 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
8065 if (src
->n_div
== 0)
8068 for (i
= 0; i
< src
->n_div
; ++i
)
8069 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
8071 src
= isl_basic_map_order_divs(src
);
8072 dst
= isl_basic_map_cow(dst
);
8075 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
8076 src
->n_div
, 0, 2 * src
->n_div
);
8079 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8080 for (i
= 0; i
< src
->n_div
; ++i
) {
8081 int j
= find_div(dst
, src
, i
);
8083 j
= isl_basic_map_alloc_div(dst
);
8086 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8087 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8088 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8092 isl_basic_map_swap_div(dst
, i
, j
);
8096 isl_basic_map_free(dst
);
8100 struct isl_basic_set
*isl_basic_set_align_divs(
8101 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8103 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8104 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8107 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8115 map
= isl_map_compute_divs(map
);
8116 map
= isl_map_cow(map
);
8120 for (i
= 1; i
< map
->n
; ++i
)
8121 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8122 for (i
= 1; i
< map
->n
; ++i
) {
8123 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8125 return isl_map_free(map
);
8128 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8132 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8134 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8137 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8138 __isl_take isl_map
*map
)
8142 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8143 map
= isl_map_intersect_domain(map
, set
);
8144 set
= isl_map_range(map
);
8152 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8153 __isl_take isl_map
*map
)
8155 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8158 /* There is no need to cow as removing empty parts doesn't change
8159 * the meaning of the set.
8161 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8168 for (i
= map
->n
- 1; i
>= 0; --i
)
8169 remove_if_empty(map
, i
);
8174 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8176 return (struct isl_set
*)
8177 isl_map_remove_empty_parts((struct isl_map
*)set
);
8180 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8182 struct isl_basic_map
*bmap
;
8183 if (!map
|| map
->n
== 0)
8185 bmap
= map
->p
[map
->n
-1];
8186 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8187 return isl_basic_map_copy(bmap
);
8190 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8192 return (struct isl_basic_set
*)
8193 isl_map_copy_basic_map((struct isl_map
*)set
);
8196 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8197 __isl_keep isl_basic_map
*bmap
)
8203 for (i
= map
->n
-1; i
>= 0; --i
) {
8204 if (map
->p
[i
] != bmap
)
8206 map
= isl_map_cow(map
);
8209 isl_basic_map_free(map
->p
[i
]);
8210 if (i
!= map
->n
-1) {
8211 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8212 map
->p
[i
] = map
->p
[map
->n
-1];
8223 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8224 struct isl_basic_set
*bset
)
8226 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8227 (struct isl_basic_map
*)bset
);
8230 /* Given two basic sets bset1 and bset2, compute the maximal difference
8231 * between the values of dimension pos in bset1 and those in bset2
8232 * for any common value of the parameters and dimensions preceding pos.
8234 static enum isl_lp_result
basic_set_maximal_difference_at(
8235 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8236 int pos
, isl_int
*opt
)
8239 struct isl_basic_map
*bmap1
= NULL
;
8240 struct isl_basic_map
*bmap2
= NULL
;
8241 struct isl_ctx
*ctx
;
8242 struct isl_vec
*obj
;
8245 unsigned dim1
, dim2
;
8246 enum isl_lp_result res
;
8248 if (!bset1
|| !bset2
)
8249 return isl_lp_error
;
8251 nparam
= isl_basic_set_n_param(bset1
);
8252 dim1
= isl_basic_set_n_dim(bset1
);
8253 dim2
= isl_basic_set_n_dim(bset2
);
8254 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8255 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8256 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8257 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8258 if (!bmap1
|| !bmap2
)
8260 bmap1
= isl_basic_map_cow(bmap1
);
8261 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8262 pos
, (dim1
- pos
) + (dim2
- pos
),
8263 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8264 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8267 total
= isl_basic_map_total_dim(bmap1
);
8269 obj
= isl_vec_alloc(ctx
, 1 + total
);
8272 isl_seq_clr(obj
->block
.data
, 1 + total
);
8273 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8274 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8275 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8277 isl_basic_map_free(bmap1
);
8281 isl_basic_map_free(bmap2
);
8283 isl_basic_map_free(bmap1
);
8284 return isl_lp_error
;
8287 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8288 * for any common value of the parameters and dimensions preceding pos
8289 * in both basic sets, the values of dimension pos in bset1 are
8290 * smaller or larger than those in bset2.
8293 * 1 if bset1 follows bset2
8294 * -1 if bset1 precedes bset2
8295 * 0 if bset1 and bset2 are incomparable
8296 * -2 if some error occurred.
8298 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8299 struct isl_basic_set
*bset2
, int pos
)
8302 enum isl_lp_result res
;
8307 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8309 if (res
== isl_lp_empty
)
8311 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8312 res
== isl_lp_unbounded
)
8314 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8323 /* Given two basic sets bset1 and bset2, check whether
8324 * for any common value of the parameters and dimensions preceding pos
8325 * there is a value of dimension pos in bset1 that is larger
8326 * than a value of the same dimension in bset2.
8329 * 1 if there exists such a pair
8330 * 0 if there is no such pair, but there is a pair of equal values
8332 * -2 if some error occurred.
8334 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8335 __isl_keep isl_basic_set
*bset2
, int pos
)
8338 enum isl_lp_result res
;
8343 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8345 if (res
== isl_lp_empty
)
8347 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8348 res
== isl_lp_unbounded
)
8350 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8352 else if (res
== isl_lp_ok
)
8361 /* Given two sets set1 and set2, check whether
8362 * for any common value of the parameters and dimensions preceding pos
8363 * there is a value of dimension pos in set1 that is larger
8364 * than a value of the same dimension in set2.
8367 * 1 if there exists such a pair
8368 * 0 if there is no such pair, but there is a pair of equal values
8370 * -2 if some error occurred.
8372 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8373 __isl_keep isl_set
*set2
, int pos
)
8381 for (i
= 0; i
< set1
->n
; ++i
)
8382 for (j
= 0; j
< set2
->n
; ++j
) {
8384 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8385 if (f
== 1 || f
== -2)
8394 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8395 unsigned pos
, isl_int
*val
)
8403 total
= isl_basic_map_total_dim(bmap
);
8404 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8405 for (; d
+1 > pos
; --d
)
8406 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8410 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8412 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8414 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8417 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8423 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8424 unsigned pos
, isl_int
*val
)
8436 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8439 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8440 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8441 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8442 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8446 isl_int_set(*val
, v
);
8452 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8453 unsigned pos
, isl_int
*val
)
8455 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8459 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8462 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8465 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8466 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8468 if (pos
>= isl_basic_map_dim(bmap
, type
))
8470 return isl_basic_map_plain_has_fixed_var(bmap
,
8471 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8474 /* If "bmap" obviously lies on a hyperplane where the given dimension
8475 * has a fixed value, then return that value.
8476 * Otherwise return NaN.
8478 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8479 __isl_keep isl_basic_map
*bmap
,
8480 enum isl_dim_type type
, unsigned pos
)
8488 ctx
= isl_basic_map_get_ctx(bmap
);
8489 v
= isl_val_alloc(ctx
);
8492 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8494 return isl_val_free(v
);
8496 isl_int_set_si(v
->d
, 1);
8500 return isl_val_nan(ctx
);
8503 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8504 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8506 if (pos
>= isl_map_dim(map
, type
))
8508 return isl_map_plain_has_fixed_var(map
,
8509 map_offset(map
, type
) - 1 + pos
, val
);
8512 /* If "map" obviously lies on a hyperplane where the given dimension
8513 * has a fixed value, then return that value.
8514 * Otherwise return NaN.
8516 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8517 enum isl_dim_type type
, unsigned pos
)
8525 ctx
= isl_map_get_ctx(map
);
8526 v
= isl_val_alloc(ctx
);
8529 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8531 return isl_val_free(v
);
8533 isl_int_set_si(v
->d
, 1);
8537 return isl_val_nan(ctx
);
8540 /* If "set" obviously lies on a hyperplane where the given dimension
8541 * has a fixed value, then return that value.
8542 * Otherwise return NaN.
8544 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8545 enum isl_dim_type type
, unsigned pos
)
8547 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8550 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8551 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8553 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8556 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8557 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8559 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8562 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8563 * then return this fixed value in *val.
8565 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8566 unsigned dim
, isl_int
*val
)
8568 return isl_basic_set_plain_has_fixed_var(bset
,
8569 isl_basic_set_n_param(bset
) + dim
, val
);
8572 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8573 * then return this fixed value in *val.
8575 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8576 unsigned dim
, isl_int
*val
)
8578 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8581 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8582 unsigned dim
, isl_int
*val
)
8584 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8587 /* Check if input variable in has fixed value and if so and if val is not NULL,
8588 * then return this fixed value in *val.
8590 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8591 unsigned in
, isl_int
*val
)
8593 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8596 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8597 * and if val is not NULL, then return this lower bound in *val.
8599 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8600 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8602 int i
, i_eq
= -1, i_ineq
= -1;
8609 total
= isl_basic_set_total_dim(bset
);
8610 nparam
= isl_basic_set_n_param(bset
);
8611 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8612 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8618 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8619 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8621 if (i_eq
!= -1 || i_ineq
!= -1)
8625 if (i_eq
== -1 && i_ineq
== -1)
8627 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8628 /* The coefficient should always be one due to normalization. */
8629 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8631 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8633 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8634 total
- nparam
- dim
- 1) != -1)
8637 isl_int_neg(*val
, c
[0]);
8641 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8642 unsigned dim
, isl_int
*val
)
8654 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8658 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8660 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8661 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8663 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8667 isl_int_set(*val
, v
);
8678 /* uset_gist depends on constraints without existentially quantified
8679 * variables sorting first.
8681 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8683 const struct constraint
*c1
= (const struct constraint
*)p1
;
8684 const struct constraint
*c2
= (const struct constraint
*)p2
;
8686 unsigned size
= isl_min(c1
->size
, c2
->size
);
8688 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8689 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8694 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8697 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8698 struct isl_basic_map
*bmap
)
8701 struct constraint
*c
;
8706 total
= isl_basic_map_total_dim(bmap
);
8707 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8710 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8712 c
[i
].c
= bmap
->ineq
[i
];
8714 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8715 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8716 bmap
->ineq
[i
] = c
[i
].c
;
8720 isl_basic_map_free(bmap
);
8724 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8725 __isl_take isl_basic_set
*bset
)
8727 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8728 (struct isl_basic_map
*)bset
);
8731 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8735 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8737 bmap
= isl_basic_map_remove_redundancies(bmap
);
8738 bmap
= isl_basic_map_sort_constraints(bmap
);
8740 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8744 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8746 return (struct isl_basic_set
*)isl_basic_map_normalize(
8747 (struct isl_basic_map
*)bset
);
8750 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8751 const __isl_keep isl_basic_map
*bmap2
)
8758 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8759 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8760 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8761 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8762 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8763 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8764 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8765 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8766 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8767 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8768 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8770 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8772 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8774 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8775 return bmap1
->n_eq
- bmap2
->n_eq
;
8776 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8777 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8778 if (bmap1
->n_div
!= bmap2
->n_div
)
8779 return bmap1
->n_div
- bmap2
->n_div
;
8780 total
= isl_basic_map_total_dim(bmap1
);
8781 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8782 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8786 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8787 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8791 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8792 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8799 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8800 const __isl_keep isl_basic_set
*bset2
)
8802 return isl_basic_map_plain_cmp(bset1
, bset2
);
8805 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8811 if (set1
->n
!= set2
->n
)
8812 return set1
->n
- set2
->n
;
8814 for (i
= 0; i
< set1
->n
; ++i
) {
8815 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8823 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8824 __isl_keep isl_basic_map
*bmap2
)
8826 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8829 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8830 __isl_keep isl_basic_set
*bset2
)
8832 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8833 (isl_basic_map
*)bset2
);
8836 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8838 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8839 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8841 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8844 /* We normalize in place, but if anything goes wrong we need
8845 * to return NULL, so we need to make sure we don't change the
8846 * meaning of any possible other copies of map.
8848 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8851 struct isl_basic_map
*bmap
;
8855 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8857 for (i
= 0; i
< map
->n
; ++i
) {
8858 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8861 isl_basic_map_free(map
->p
[i
]);
8864 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8865 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8866 map
= isl_map_remove_empty_parts(map
);
8869 for (i
= map
->n
- 1; i
>= 1; --i
) {
8870 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8872 isl_basic_map_free(map
->p
[i
-1]);
8873 for (j
= i
; j
< map
->n
; ++j
)
8874 map
->p
[j
-1] = map
->p
[j
];
8884 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8886 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8889 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8899 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8902 map1
= isl_map_copy(map1
);
8903 map2
= isl_map_copy(map2
);
8904 map1
= isl_map_normalize(map1
);
8905 map2
= isl_map_normalize(map2
);
8908 equal
= map1
->n
== map2
->n
;
8909 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8910 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8923 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8925 return isl_map_plain_is_equal(map1
, map2
);
8928 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8930 return isl_map_plain_is_equal((struct isl_map
*)set1
,
8931 (struct isl_map
*)set2
);
8934 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8936 return isl_set_plain_is_equal(set1
, set2
);
8939 /* Return an interval that ranges from min to max (inclusive)
8941 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
8942 isl_int min
, isl_int max
)
8945 struct isl_basic_set
*bset
= NULL
;
8947 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
8951 k
= isl_basic_set_alloc_inequality(bset
);
8954 isl_int_set_si(bset
->ineq
[k
][1], 1);
8955 isl_int_neg(bset
->ineq
[k
][0], min
);
8957 k
= isl_basic_set_alloc_inequality(bset
);
8960 isl_int_set_si(bset
->ineq
[k
][1], -1);
8961 isl_int_set(bset
->ineq
[k
][0], max
);
8965 isl_basic_set_free(bset
);
8969 /* Return the Cartesian product of the basic sets in list (in the given order).
8971 __isl_give isl_basic_set
*isl_basic_set_list_product(
8972 __isl_take
struct isl_basic_set_list
*list
)
8980 struct isl_basic_set
*product
= NULL
;
8984 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
8985 isl_assert(list
->ctx
, list
->p
[0], goto error
);
8986 nparam
= isl_basic_set_n_param(list
->p
[0]);
8987 dim
= isl_basic_set_n_dim(list
->p
[0]);
8988 extra
= list
->p
[0]->n_div
;
8989 n_eq
= list
->p
[0]->n_eq
;
8990 n_ineq
= list
->p
[0]->n_ineq
;
8991 for (i
= 1; i
< list
->n
; ++i
) {
8992 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
8993 isl_assert(list
->ctx
,
8994 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
8995 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
8996 extra
+= list
->p
[i
]->n_div
;
8997 n_eq
+= list
->p
[i
]->n_eq
;
8998 n_ineq
+= list
->p
[i
]->n_ineq
;
9000 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9005 for (i
= 0; i
< list
->n
; ++i
) {
9006 isl_basic_set_add_constraints(product
,
9007 isl_basic_set_copy(list
->p
[i
]), dim
);
9008 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9010 isl_basic_set_list_free(list
);
9013 isl_basic_set_free(product
);
9014 isl_basic_set_list_free(list
);
9018 struct isl_basic_map
*isl_basic_map_product(
9019 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9021 isl_space
*dim_result
= NULL
;
9022 struct isl_basic_map
*bmap
;
9023 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9024 struct isl_dim_map
*dim_map1
, *dim_map2
;
9026 if (!bmap1
|| !bmap2
)
9029 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9030 bmap2
->dim
, isl_dim_param
), goto error
);
9031 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9032 isl_space_copy(bmap2
->dim
));
9034 in1
= isl_basic_map_n_in(bmap1
);
9035 in2
= isl_basic_map_n_in(bmap2
);
9036 out1
= isl_basic_map_n_out(bmap1
);
9037 out2
= isl_basic_map_n_out(bmap2
);
9038 nparam
= isl_basic_map_n_param(bmap1
);
9040 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9041 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9042 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9043 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9044 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9045 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9046 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9047 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9048 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9049 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9050 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9052 bmap
= isl_basic_map_alloc_space(dim_result
,
9053 bmap1
->n_div
+ bmap2
->n_div
,
9054 bmap1
->n_eq
+ bmap2
->n_eq
,
9055 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9056 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9057 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9058 bmap
= isl_basic_map_simplify(bmap
);
9059 return isl_basic_map_finalize(bmap
);
9061 isl_basic_map_free(bmap1
);
9062 isl_basic_map_free(bmap2
);
9066 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9067 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9069 isl_basic_map
*prod
;
9071 prod
= isl_basic_map_product(bmap1
, bmap2
);
9072 prod
= isl_basic_map_flatten(prod
);
9076 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9077 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9079 return isl_basic_map_flat_range_product(bset1
, bset2
);
9082 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9083 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9085 isl_space
*space_result
= NULL
;
9086 isl_basic_map
*bmap
;
9087 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9088 struct isl_dim_map
*dim_map1
, *dim_map2
;
9090 if (!bmap1
|| !bmap2
)
9093 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9094 isl_space_copy(bmap2
->dim
));
9096 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9097 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9098 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9099 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9101 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9102 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9103 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9104 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9105 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9106 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9107 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9108 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9109 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9110 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9111 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9113 bmap
= isl_basic_map_alloc_space(space_result
,
9114 bmap1
->n_div
+ bmap2
->n_div
,
9115 bmap1
->n_eq
+ bmap2
->n_eq
,
9116 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9117 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9118 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9119 bmap
= isl_basic_map_simplify(bmap
);
9120 return isl_basic_map_finalize(bmap
);
9122 isl_basic_map_free(bmap1
);
9123 isl_basic_map_free(bmap2
);
9127 __isl_give isl_basic_map
*isl_basic_map_range_product(
9128 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9130 isl_space
*dim_result
= NULL
;
9131 isl_basic_map
*bmap
;
9132 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9133 struct isl_dim_map
*dim_map1
, *dim_map2
;
9135 if (!bmap1
|| !bmap2
)
9138 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9139 bmap2
->dim
, isl_dim_param
))
9140 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9141 "parameters don't match", goto error
);
9143 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9144 isl_space_copy(bmap2
->dim
));
9146 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9147 out1
= isl_basic_map_n_out(bmap1
);
9148 out2
= isl_basic_map_n_out(bmap2
);
9149 nparam
= isl_basic_map_n_param(bmap1
);
9151 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9152 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9153 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9154 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9155 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9156 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9157 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9158 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9159 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9160 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9161 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9163 bmap
= isl_basic_map_alloc_space(dim_result
,
9164 bmap1
->n_div
+ bmap2
->n_div
,
9165 bmap1
->n_eq
+ bmap2
->n_eq
,
9166 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9167 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9168 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9169 bmap
= isl_basic_map_simplify(bmap
);
9170 return isl_basic_map_finalize(bmap
);
9172 isl_basic_map_free(bmap1
);
9173 isl_basic_map_free(bmap2
);
9177 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9178 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9180 isl_basic_map
*prod
;
9182 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9183 prod
= isl_basic_map_flatten_range(prod
);
9187 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9188 __isl_take isl_map
*map2
,
9189 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
9190 __isl_take isl_space
*right
),
9191 __isl_give isl_basic_map
*(*basic_map_product
)(
9192 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
9195 struct isl_map
*result
;
9201 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9202 map2
->dim
, isl_dim_param
), goto error
);
9204 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9205 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9206 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9208 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
9209 isl_space_copy(map2
->dim
)),
9210 map1
->n
* map2
->n
, flags
);
9213 for (i
= 0; i
< map1
->n
; ++i
)
9214 for (j
= 0; j
< map2
->n
; ++j
) {
9215 struct isl_basic_map
*part
;
9216 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9217 isl_basic_map_copy(map2
->p
[j
]));
9218 if (isl_basic_map_is_empty(part
))
9219 isl_basic_map_free(part
);
9221 result
= isl_map_add_basic_map(result
, part
);
9234 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9236 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9237 __isl_take isl_map
*map2
)
9239 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
9242 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9243 __isl_take isl_map
*map2
)
9245 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9248 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9250 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9251 __isl_take isl_map
*map2
)
9255 prod
= isl_map_product(map1
, map2
);
9256 prod
= isl_map_flatten(prod
);
9260 /* Given two set A and B, construct its Cartesian product A x B.
9262 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9264 return isl_map_range_product(set1
, set2
);
9267 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9268 __isl_take isl_set
*set2
)
9270 return isl_map_flat_range_product(set1
, set2
);
9273 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9275 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9276 __isl_take isl_map
*map2
)
9278 return map_product(map1
, map2
, &isl_space_domain_product
,
9279 &isl_basic_map_domain_product
);
9282 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9284 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9285 __isl_take isl_map
*map2
)
9287 return map_product(map1
, map2
, &isl_space_range_product
,
9288 &isl_basic_map_range_product
);
9291 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9292 __isl_take isl_map
*map2
)
9294 return isl_map_align_params_map_map_and(map1
, map2
,
9295 &map_domain_product_aligned
);
9298 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9299 __isl_take isl_map
*map2
)
9301 return isl_map_align_params_map_map_and(map1
, map2
,
9302 &map_range_product_aligned
);
9305 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9307 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9308 __isl_take isl_map
*map2
)
9312 prod
= isl_map_domain_product(map1
, map2
);
9313 prod
= isl_map_flatten_domain(prod
);
9317 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9319 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9320 __isl_take isl_map
*map2
)
9324 prod
= isl_map_range_product(map1
, map2
);
9325 prod
= isl_map_flatten_range(prod
);
9329 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9332 uint32_t hash
= isl_hash_init();
9337 bmap
= isl_basic_map_copy(bmap
);
9338 bmap
= isl_basic_map_normalize(bmap
);
9341 total
= isl_basic_map_total_dim(bmap
);
9342 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9343 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9345 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9346 isl_hash_hash(hash
, c_hash
);
9348 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9349 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9351 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9352 isl_hash_hash(hash
, c_hash
);
9354 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9355 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9357 if (isl_int_is_zero(bmap
->div
[i
][0]))
9359 isl_hash_byte(hash
, i
& 0xFF);
9360 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9361 isl_hash_hash(hash
, c_hash
);
9363 isl_basic_map_free(bmap
);
9367 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9369 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9372 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9379 map
= isl_map_copy(map
);
9380 map
= isl_map_normalize(map
);
9384 hash
= isl_hash_init();
9385 for (i
= 0; i
< map
->n
; ++i
) {
9387 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9388 isl_hash_hash(hash
, bmap_hash
);
9396 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9398 return isl_map_get_hash((isl_map
*)set
);
9401 /* Check if the value for dimension dim is completely determined
9402 * by the values of the other parameters and variables.
9403 * That is, check if dimension dim is involved in an equality.
9405 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9412 nparam
= isl_basic_set_n_param(bset
);
9413 for (i
= 0; i
< bset
->n_eq
; ++i
)
9414 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9419 /* Check if the value for dimension dim is completely determined
9420 * by the values of the other parameters and variables.
9421 * That is, check if dimension dim is involved in an equality
9422 * for each of the subsets.
9424 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9430 for (i
= 0; i
< set
->n
; ++i
) {
9432 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9439 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9441 return set
? set
->n
: 0;
9444 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9445 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9452 for (i
= 0; i
< map
->n
; ++i
)
9453 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9459 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9460 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9467 for (i
= 0; i
< set
->n
; ++i
)
9468 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9474 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9481 bset
= isl_basic_set_cow(bset
);
9485 dim
= isl_basic_set_get_space(bset
);
9486 dim
= isl_space_lift(dim
, bset
->n_div
);
9489 isl_space_free(bset
->dim
);
9491 bset
->extra
-= bset
->n_div
;
9494 bset
= isl_basic_set_finalize(bset
);
9498 isl_basic_set_free(bset
);
9502 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9508 set
= isl_set_align_divs(set
);
9513 set
= isl_set_cow(set
);
9517 n_div
= set
->p
[0]->n_div
;
9518 dim
= isl_set_get_space(set
);
9519 dim
= isl_space_lift(dim
, n_div
);
9522 isl_space_free(set
->dim
);
9525 for (i
= 0; i
< set
->n
; ++i
) {
9526 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9537 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9540 struct isl_basic_map
*bmap
;
9547 set
= isl_set_align_divs(set
);
9552 dim
= isl_set_get_space(set
);
9553 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9555 return isl_map_identity(isl_space_map_from_set(dim
));
9558 n_div
= set
->p
[0]->n_div
;
9559 dim
= isl_space_map_from_set(dim
);
9560 n_param
= isl_space_dim(dim
, isl_dim_param
);
9561 n_set
= isl_space_dim(dim
, isl_dim_in
);
9562 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9563 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9564 for (i
= 0; i
< n_set
; ++i
)
9565 bmap
= var_equal(bmap
, i
);
9567 total
= n_param
+ n_set
+ n_set
+ n_div
;
9568 for (i
= 0; i
< n_div
; ++i
) {
9569 k
= isl_basic_map_alloc_inequality(bmap
);
9572 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9573 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9574 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9575 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9576 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9577 set
->p
[0]->div
[i
][0]);
9579 l
= isl_basic_map_alloc_inequality(bmap
);
9582 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9583 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9584 set
->p
[0]->div
[i
][0]);
9585 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9589 bmap
= isl_basic_map_simplify(bmap
);
9590 bmap
= isl_basic_map_finalize(bmap
);
9591 return isl_map_from_basic_map(bmap
);
9594 isl_basic_map_free(bmap
);
9598 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9606 dim
= isl_basic_set_total_dim(bset
);
9607 size
+= bset
->n_eq
* (1 + dim
);
9608 size
+= bset
->n_ineq
* (1 + dim
);
9609 size
+= bset
->n_div
* (2 + dim
);
9614 int isl_set_size(__isl_keep isl_set
*set
)
9622 for (i
= 0; i
< set
->n
; ++i
)
9623 size
+= isl_basic_set_size(set
->p
[i
]);
9628 /* Check if there is any lower bound (if lower == 0) and/or upper
9629 * bound (if upper == 0) on the specified dim.
9631 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9632 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9639 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9641 pos
+= isl_basic_map_offset(bmap
, type
);
9643 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9644 if (isl_int_is_zero(bmap
->div
[i
][0]))
9646 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9650 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9651 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9654 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9655 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9662 return lower
&& upper
;
9665 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9666 enum isl_dim_type type
, unsigned pos
)
9668 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9671 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9672 enum isl_dim_type type
, unsigned pos
)
9674 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9677 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9678 enum isl_dim_type type
, unsigned pos
)
9680 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9683 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9684 enum isl_dim_type type
, unsigned pos
)
9691 for (i
= 0; i
< map
->n
; ++i
) {
9693 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9694 if (bounded
< 0 || !bounded
)
9701 /* Return 1 if the specified dim is involved in both an upper bound
9702 * and a lower bound.
9704 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9705 enum isl_dim_type type
, unsigned pos
)
9707 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9710 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9712 static int has_any_bound(__isl_keep isl_map
*map
,
9713 enum isl_dim_type type
, unsigned pos
,
9714 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9715 enum isl_dim_type type
, unsigned pos
))
9722 for (i
= 0; i
< map
->n
; ++i
) {
9724 bounded
= fn(map
->p
[i
], type
, pos
);
9725 if (bounded
< 0 || bounded
)
9732 /* Return 1 if the specified dim is involved in any lower bound.
9734 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9735 enum isl_dim_type type
, unsigned pos
)
9737 return has_any_bound(set
, type
, pos
,
9738 &isl_basic_map_dim_has_lower_bound
);
9741 /* Return 1 if the specified dim is involved in any upper bound.
9743 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9744 enum isl_dim_type type
, unsigned pos
)
9746 return has_any_bound(set
, type
, pos
,
9747 &isl_basic_map_dim_has_upper_bound
);
9750 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9752 static int has_bound(__isl_keep isl_map
*map
,
9753 enum isl_dim_type type
, unsigned pos
,
9754 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9755 enum isl_dim_type type
, unsigned pos
))
9762 for (i
= 0; i
< map
->n
; ++i
) {
9764 bounded
= fn(map
->p
[i
], type
, pos
);
9765 if (bounded
< 0 || !bounded
)
9772 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9774 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9775 enum isl_dim_type type
, unsigned pos
)
9777 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9780 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9782 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9783 enum isl_dim_type type
, unsigned pos
)
9785 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9788 /* For each of the "n" variables starting at "first", determine
9789 * the sign of the variable and put the results in the first "n"
9790 * elements of the array "signs".
9792 * 1 means that the variable is non-negative
9793 * -1 means that the variable is non-positive
9794 * 0 means the variable attains both positive and negative values.
9796 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9797 unsigned first
, unsigned n
, int *signs
)
9799 isl_vec
*bound
= NULL
;
9800 struct isl_tab
*tab
= NULL
;
9801 struct isl_tab_undo
*snap
;
9804 if (!bset
|| !signs
)
9807 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9808 tab
= isl_tab_from_basic_set(bset
, 0);
9812 isl_seq_clr(bound
->el
, bound
->size
);
9813 isl_int_set_si(bound
->el
[0], -1);
9815 snap
= isl_tab_snap(tab
);
9816 for (i
= 0; i
< n
; ++i
) {
9819 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9820 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9823 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9824 if (isl_tab_rollback(tab
, snap
) < 0)
9832 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9833 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9836 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9837 if (isl_tab_rollback(tab
, snap
) < 0)
9840 signs
[i
] = empty
? -1 : 0;
9844 isl_vec_free(bound
);
9848 isl_vec_free(bound
);
9852 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9853 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9855 if (!bset
|| !signs
)
9857 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9860 first
+= pos(bset
->dim
, type
) - 1;
9861 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9864 /* Check if the given basic map is obviously single-valued.
9865 * In particular, for each output dimension, check that there is
9866 * an equality that defines the output dimension in terms of
9867 * earlier dimensions.
9869 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9879 total
= 1 + isl_basic_map_total_dim(bmap
);
9880 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9881 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9883 for (i
= 0; i
< n_out
; ++i
) {
9884 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9885 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9887 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9888 total
- (o_out
+ i
+ 1)) == -1)
9891 if (j
>= bmap
->n_eq
)
9898 /* Check if the given basic map is single-valued.
9903 * and check if the result is a subset of the identity mapping.
9905 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9908 isl_basic_map
*test
;
9912 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9916 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9917 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9919 space
= isl_basic_map_get_space(bmap
);
9920 space
= isl_space_map_from_set(isl_space_range(space
));
9921 id
= isl_basic_map_identity(space
);
9923 sv
= isl_basic_map_is_subset(test
, id
);
9925 isl_basic_map_free(test
);
9926 isl_basic_map_free(id
);
9931 /* Check if the given map is obviously single-valued.
9933 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
9942 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
9945 /* Check if the given map is single-valued.
9950 * and check if the result is a subset of the identity mapping.
9952 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
9959 sv
= isl_map_plain_is_single_valued(map
);
9963 test
= isl_map_reverse(isl_map_copy(map
));
9964 test
= isl_map_apply_range(test
, isl_map_copy(map
));
9966 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
9967 id
= isl_map_identity(dim
);
9969 sv
= isl_map_is_subset(test
, id
);
9977 int isl_map_is_injective(__isl_keep isl_map
*map
)
9981 map
= isl_map_copy(map
);
9982 map
= isl_map_reverse(map
);
9983 in
= isl_map_is_single_valued(map
);
9989 /* Check if the given map is obviously injective.
9991 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
9995 map
= isl_map_copy(map
);
9996 map
= isl_map_reverse(map
);
9997 in
= isl_map_plain_is_single_valued(map
);
10003 int isl_map_is_bijective(__isl_keep isl_map
*map
)
10007 sv
= isl_map_is_single_valued(map
);
10011 return isl_map_is_injective(map
);
10014 int isl_set_is_singleton(__isl_keep isl_set
*set
)
10016 return isl_map_is_single_valued((isl_map
*)set
);
10019 int isl_map_is_translation(__isl_keep isl_map
*map
)
10024 delta
= isl_map_deltas(isl_map_copy(map
));
10025 ok
= isl_set_is_singleton(delta
);
10026 isl_set_free(delta
);
10031 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10033 if (isl_seq_first_non_zero(p
, pos
) != -1)
10035 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10040 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10049 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10052 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10053 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10054 for (j
= 0; j
< nvar
; ++j
) {
10055 int lower
= 0, upper
= 0;
10056 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10057 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10059 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10063 if (i
< bset
->n_eq
)
10065 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10066 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10068 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10070 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10075 if (!lower
|| !upper
)
10082 int isl_set_is_box(__isl_keep isl_set
*set
)
10089 return isl_basic_set_is_box(set
->p
[0]);
10092 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10097 return isl_space_is_wrapping(bset
->dim
);
10100 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
10105 return isl_space_is_wrapping(set
->dim
);
10108 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10110 bmap
= isl_basic_map_cow(bmap
);
10114 bmap
->dim
= isl_space_wrap(bmap
->dim
);
10118 bmap
= isl_basic_map_finalize(bmap
);
10120 return (isl_basic_set
*)bmap
;
10122 isl_basic_map_free(bmap
);
10126 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
10130 map
= isl_map_cow(map
);
10134 for (i
= 0; i
< map
->n
; ++i
) {
10135 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
10139 map
->dim
= isl_space_wrap(map
->dim
);
10143 return (isl_set
*)map
;
10149 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
10151 bset
= isl_basic_set_cow(bset
);
10155 bset
->dim
= isl_space_unwrap(bset
->dim
);
10159 bset
= isl_basic_set_finalize(bset
);
10161 return (isl_basic_map
*)bset
;
10163 isl_basic_set_free(bset
);
10167 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
10174 if (!isl_set_is_wrapping(set
))
10175 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
10178 set
= isl_set_cow(set
);
10182 for (i
= 0; i
< set
->n
; ++i
) {
10183 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
10188 set
->dim
= isl_space_unwrap(set
->dim
);
10192 return (isl_map
*)set
;
10198 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
10199 enum isl_dim_type type
)
10204 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
10207 bmap
= isl_basic_map_cow(bmap
);
10211 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10215 bmap
= isl_basic_map_finalize(bmap
);
10219 isl_basic_map_free(bmap
);
10223 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10224 enum isl_dim_type type
)
10231 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10234 map
= isl_map_cow(map
);
10238 for (i
= 0; i
< map
->n
; ++i
) {
10239 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10243 map
->dim
= isl_space_reset(map
->dim
, type
);
10253 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10258 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10261 bmap
= isl_basic_map_cow(bmap
);
10265 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10269 bmap
= isl_basic_map_finalize(bmap
);
10273 isl_basic_map_free(bmap
);
10277 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10279 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10282 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10283 __isl_take isl_basic_map
*bmap
)
10288 if (!bmap
->dim
->nested
[0])
10291 bmap
= isl_basic_map_cow(bmap
);
10295 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10299 bmap
= isl_basic_map_finalize(bmap
);
10303 isl_basic_map_free(bmap
);
10307 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10308 __isl_take isl_basic_map
*bmap
)
10313 if (!bmap
->dim
->nested
[1])
10316 bmap
= isl_basic_map_cow(bmap
);
10320 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10324 bmap
= isl_basic_map_finalize(bmap
);
10328 isl_basic_map_free(bmap
);
10332 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10339 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10342 map
= isl_map_cow(map
);
10346 for (i
= 0; i
< map
->n
; ++i
) {
10347 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10351 map
->dim
= isl_space_flatten(map
->dim
);
10361 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10363 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10366 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10368 isl_space
*dim
, *flat_dim
;
10371 dim
= isl_set_get_space(set
);
10372 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10373 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10374 map
= isl_map_intersect_domain(map
, set
);
10379 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10386 if (!map
->dim
->nested
[0])
10389 map
= isl_map_cow(map
);
10393 for (i
= 0; i
< map
->n
; ++i
) {
10394 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10398 map
->dim
= isl_space_flatten_domain(map
->dim
);
10408 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10415 if (!map
->dim
->nested
[1])
10418 map
= isl_map_cow(map
);
10422 for (i
= 0; i
< map
->n
; ++i
) {
10423 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10427 map
->dim
= isl_space_flatten_range(map
->dim
);
10437 /* Reorder the dimensions of "bmap" according to the given dim_map
10438 * and set the dimension specification to "dim".
10440 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10441 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10443 isl_basic_map
*res
;
10446 bmap
= isl_basic_map_cow(bmap
);
10447 if (!bmap
|| !dim
|| !dim_map
)
10450 flags
= bmap
->flags
;
10451 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10452 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10453 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10454 res
= isl_basic_map_alloc_space(dim
,
10455 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10456 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10458 res
->flags
= flags
;
10459 res
= isl_basic_map_finalize(res
);
10463 isl_basic_map_free(bmap
);
10464 isl_space_free(dim
);
10468 /* Reorder the dimensions of "map" according to given reordering.
10470 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10471 __isl_take isl_reordering
*r
)
10474 struct isl_dim_map
*dim_map
;
10476 map
= isl_map_cow(map
);
10477 dim_map
= isl_dim_map_from_reordering(r
);
10478 if (!map
|| !r
|| !dim_map
)
10481 for (i
= 0; i
< map
->n
; ++i
) {
10482 struct isl_dim_map
*dim_map_i
;
10484 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10486 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10487 isl_space_copy(r
->dim
), dim_map_i
);
10493 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10495 isl_reordering_free(r
);
10501 isl_reordering_free(r
);
10505 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10506 __isl_take isl_reordering
*r
)
10508 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10511 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10512 __isl_take isl_space
*model
)
10516 if (!map
|| !model
)
10519 ctx
= isl_space_get_ctx(model
);
10520 if (!isl_space_has_named_params(model
))
10521 isl_die(ctx
, isl_error_invalid
,
10522 "model has unnamed parameters", goto error
);
10523 if (!isl_space_has_named_params(map
->dim
))
10524 isl_die(ctx
, isl_error_invalid
,
10525 "relation has unnamed parameters", goto error
);
10526 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10527 isl_reordering
*exp
;
10529 model
= isl_space_drop_dims(model
, isl_dim_in
,
10530 0, isl_space_dim(model
, isl_dim_in
));
10531 model
= isl_space_drop_dims(model
, isl_dim_out
,
10532 0, isl_space_dim(model
, isl_dim_out
));
10533 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10534 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10535 map
= isl_map_realign(map
, exp
);
10538 isl_space_free(model
);
10541 isl_space_free(model
);
10546 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10547 __isl_take isl_space
*model
)
10549 return isl_map_align_params(set
, model
);
10552 /* Align the parameters of "bmap" to those of "model", introducing
10553 * additional parameters if needed.
10555 __isl_give isl_basic_map
*isl_basic_map_align_params(
10556 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10560 if (!bmap
|| !model
)
10563 ctx
= isl_space_get_ctx(model
);
10564 if (!isl_space_has_named_params(model
))
10565 isl_die(ctx
, isl_error_invalid
,
10566 "model has unnamed parameters", goto error
);
10567 if (!isl_space_has_named_params(bmap
->dim
))
10568 isl_die(ctx
, isl_error_invalid
,
10569 "relation has unnamed parameters", goto error
);
10570 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10571 isl_reordering
*exp
;
10572 struct isl_dim_map
*dim_map
;
10574 model
= isl_space_drop_dims(model
, isl_dim_in
,
10575 0, isl_space_dim(model
, isl_dim_in
));
10576 model
= isl_space_drop_dims(model
, isl_dim_out
,
10577 0, isl_space_dim(model
, isl_dim_out
));
10578 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10579 exp
= isl_reordering_extend_space(exp
,
10580 isl_basic_map_get_space(bmap
));
10581 dim_map
= isl_dim_map_from_reordering(exp
);
10582 bmap
= isl_basic_map_realign(bmap
,
10583 exp
? isl_space_copy(exp
->dim
) : NULL
,
10584 isl_dim_map_extend(dim_map
, bmap
));
10585 isl_reordering_free(exp
);
10589 isl_space_free(model
);
10592 isl_space_free(model
);
10593 isl_basic_map_free(bmap
);
10597 /* Align the parameters of "bset" to those of "model", introducing
10598 * additional parameters if needed.
10600 __isl_give isl_basic_set
*isl_basic_set_align_params(
10601 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10603 return isl_basic_map_align_params(bset
, model
);
10606 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10607 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10608 enum isl_dim_type c2
, enum isl_dim_type c3
,
10609 enum isl_dim_type c4
, enum isl_dim_type c5
)
10611 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10612 struct isl_mat
*mat
;
10618 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10619 isl_basic_map_total_dim(bmap
) + 1);
10622 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10623 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10624 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10625 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10626 isl_int_set(mat
->row
[i
][pos
],
10627 bmap
->eq
[i
][off
+ k
]);
10635 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10636 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10637 enum isl_dim_type c2
, enum isl_dim_type c3
,
10638 enum isl_dim_type c4
, enum isl_dim_type c5
)
10640 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10641 struct isl_mat
*mat
;
10647 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10648 isl_basic_map_total_dim(bmap
) + 1);
10651 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10652 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10653 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10654 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10655 isl_int_set(mat
->row
[i
][pos
],
10656 bmap
->ineq
[i
][off
+ k
]);
10664 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10665 __isl_take isl_space
*dim
,
10666 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10667 enum isl_dim_type c2
, enum isl_dim_type c3
,
10668 enum isl_dim_type c4
, enum isl_dim_type c5
)
10670 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10671 isl_basic_map
*bmap
;
10677 if (!dim
|| !eq
|| !ineq
)
10680 if (eq
->n_col
!= ineq
->n_col
)
10681 isl_die(dim
->ctx
, isl_error_invalid
,
10682 "equalities and inequalities matrices should have "
10683 "same number of columns", goto error
);
10685 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10687 if (eq
->n_col
< total
)
10688 isl_die(dim
->ctx
, isl_error_invalid
,
10689 "number of columns too small", goto error
);
10691 extra
= eq
->n_col
- total
;
10693 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10694 eq
->n_row
, ineq
->n_row
);
10697 for (i
= 0; i
< extra
; ++i
) {
10698 k
= isl_basic_map_alloc_div(bmap
);
10701 isl_int_set_si(bmap
->div
[k
][0], 0);
10703 for (i
= 0; i
< eq
->n_row
; ++i
) {
10704 l
= isl_basic_map_alloc_equality(bmap
);
10707 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10708 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10709 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10710 isl_int_set(bmap
->eq
[l
][off
+ k
],
10716 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10717 l
= isl_basic_map_alloc_inequality(bmap
);
10720 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10721 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10722 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10723 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10724 ineq
->row
[i
][pos
]);
10730 isl_space_free(dim
);
10732 isl_mat_free(ineq
);
10734 bmap
= isl_basic_map_simplify(bmap
);
10735 return isl_basic_map_finalize(bmap
);
10737 isl_space_free(dim
);
10739 isl_mat_free(ineq
);
10743 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10744 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10745 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10747 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10748 c1
, c2
, c3
, c4
, isl_dim_in
);
10751 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10752 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10753 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10755 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10756 c1
, c2
, c3
, c4
, isl_dim_in
);
10759 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10760 __isl_take isl_space
*dim
,
10761 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10762 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10764 return (isl_basic_set
*)
10765 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10766 c1
, c2
, c3
, c4
, isl_dim_in
);
10769 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10774 return isl_space_can_zip(bmap
->dim
);
10777 int isl_map_can_zip(__isl_keep isl_map
*map
)
10782 return isl_space_can_zip(map
->dim
);
10785 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10786 * (A -> C) -> (B -> D).
10788 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10797 if (!isl_basic_map_can_zip(bmap
))
10798 isl_die(bmap
->ctx
, isl_error_invalid
,
10799 "basic map cannot be zipped", goto error
);
10800 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10801 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10802 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10803 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10804 bmap
= isl_basic_map_cow(bmap
);
10805 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10808 bmap
->dim
= isl_space_zip(bmap
->dim
);
10813 isl_basic_map_free(bmap
);
10817 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10818 * (A -> C) -> (B -> D).
10820 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10827 if (!isl_map_can_zip(map
))
10828 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10831 map
= isl_map_cow(map
);
10835 for (i
= 0; i
< map
->n
; ++i
) {
10836 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10841 map
->dim
= isl_space_zip(map
->dim
);
10851 /* Can we apply isl_basic_map_curry to "bmap"?
10852 * That is, does it have a nested relation in its domain?
10854 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10859 return isl_space_can_curry(bmap
->dim
);
10862 /* Can we apply isl_map_curry to "map"?
10863 * That is, does it have a nested relation in its domain?
10865 int isl_map_can_curry(__isl_keep isl_map
*map
)
10870 return isl_space_can_curry(map
->dim
);
10873 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10876 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10882 if (!isl_basic_map_can_curry(bmap
))
10883 isl_die(bmap
->ctx
, isl_error_invalid
,
10884 "basic map cannot be curried", goto error
);
10885 bmap
= isl_basic_map_cow(bmap
);
10888 bmap
->dim
= isl_space_curry(bmap
->dim
);
10893 isl_basic_map_free(bmap
);
10897 /* Given a map (A -> B) -> C, return the corresponding map
10900 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10907 if (!isl_map_can_curry(map
))
10908 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10911 map
= isl_map_cow(map
);
10915 for (i
= 0; i
< map
->n
; ++i
) {
10916 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10921 map
->dim
= isl_space_curry(map
->dim
);
10931 /* Can we apply isl_basic_map_uncurry to "bmap"?
10932 * That is, does it have a nested relation in its domain?
10934 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
10939 return isl_space_can_uncurry(bmap
->dim
);
10942 /* Can we apply isl_map_uncurry to "map"?
10943 * That is, does it have a nested relation in its domain?
10945 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
10950 return isl_space_can_uncurry(map
->dim
);
10953 /* Given a basic map A -> (B -> C), return the corresponding basic map
10956 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
10962 if (!isl_basic_map_can_uncurry(bmap
))
10963 isl_die(bmap
->ctx
, isl_error_invalid
,
10964 "basic map cannot be uncurried",
10965 return isl_basic_map_free(bmap
));
10966 bmap
= isl_basic_map_cow(bmap
);
10969 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
10971 return isl_basic_map_free(bmap
);
10975 /* Given a map A -> (B -> C), return the corresponding map
10978 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
10985 if (!isl_map_can_uncurry(map
))
10986 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
10987 return isl_map_free(map
));
10989 map
= isl_map_cow(map
);
10993 for (i
= 0; i
< map
->n
; ++i
) {
10994 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
10996 return isl_map_free(map
);
10999 map
->dim
= isl_space_uncurry(map
->dim
);
11001 return isl_map_free(map
);
11006 /* Construct a basic map mapping the domain of the affine expression
11007 * to a one-dimensional range prescribed by the affine expression.
11009 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11013 isl_local_space
*ls
;
11014 isl_basic_map
*bmap
;
11019 ls
= isl_aff_get_local_space(aff
);
11020 bmap
= isl_basic_map_from_local_space(ls
);
11021 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11022 k
= isl_basic_map_alloc_equality(bmap
);
11026 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11027 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11028 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11029 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11030 aff
->v
->size
- (pos
+ 1));
11033 bmap
= isl_basic_map_finalize(bmap
);
11037 isl_basic_map_free(bmap
);
11041 /* Construct a map mapping the domain of the affine expression
11042 * to a one-dimensional range prescribed by the affine expression.
11044 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11046 isl_basic_map
*bmap
;
11048 bmap
= isl_basic_map_from_aff(aff
);
11049 return isl_map_from_basic_map(bmap
);
11052 /* Construct a basic map mapping the domain the multi-affine expression
11053 * to its range, with each dimension in the range equated to the
11054 * corresponding affine expression.
11056 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11057 __isl_take isl_multi_aff
*maff
)
11061 isl_basic_map
*bmap
;
11066 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11067 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11068 "invalid space", return isl_multi_aff_free(maff
));
11070 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11071 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11073 for (i
= 0; i
< maff
->n
; ++i
) {
11075 isl_basic_map
*bmap_i
;
11077 aff
= isl_aff_copy(maff
->p
[i
]);
11078 bmap_i
= isl_basic_map_from_aff(aff
);
11080 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11083 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11085 isl_multi_aff_free(maff
);
11089 /* Construct a map mapping the domain the multi-affine expression
11090 * to its range, with each dimension in the range equated to the
11091 * corresponding affine expression.
11093 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11095 isl_basic_map
*bmap
;
11097 bmap
= isl_basic_map_from_multi_aff(maff
);
11098 return isl_map_from_basic_map(bmap
);
11101 /* Construct a basic map mapping a domain in the given space to
11102 * to an n-dimensional range, with n the number of elements in the list,
11103 * where each coordinate in the range is prescribed by the
11104 * corresponding affine expression.
11105 * The domains of all affine expressions in the list are assumed to match
11108 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11109 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11113 isl_basic_map
*bmap
;
11118 dim
= isl_space_from_domain(domain_dim
);
11119 bmap
= isl_basic_map_universe(dim
);
11121 for (i
= 0; i
< list
->n
; ++i
) {
11123 isl_basic_map
*bmap_i
;
11125 aff
= isl_aff_copy(list
->p
[i
]);
11126 bmap_i
= isl_basic_map_from_aff(aff
);
11128 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11131 isl_aff_list_free(list
);
11135 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11136 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11138 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11141 /* Construct a basic map where the given dimensions are equal to each other.
11143 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11144 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11146 isl_basic_map
*bmap
= NULL
;
11152 if (pos1
>= isl_space_dim(space
, type1
))
11153 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11154 "index out of bounds", goto error
);
11155 if (pos2
>= isl_space_dim(space
, type2
))
11156 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11157 "index out of bounds", goto error
);
11159 if (type1
== type2
&& pos1
== pos2
)
11160 return isl_basic_map_universe(space
);
11162 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11163 i
= isl_basic_map_alloc_equality(bmap
);
11166 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11167 pos1
+= isl_basic_map_offset(bmap
, type1
);
11168 pos2
+= isl_basic_map_offset(bmap
, type2
);
11169 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11170 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11171 bmap
= isl_basic_map_finalize(bmap
);
11172 isl_space_free(space
);
11175 isl_space_free(space
);
11176 isl_basic_map_free(bmap
);
11180 /* Add a constraint imposing that the given two dimensions are equal.
11182 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11183 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11187 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11189 bmap
= isl_basic_map_intersect(bmap
, eq
);
11194 /* Add a constraint imposing that the given two dimensions are equal.
11196 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11197 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11199 isl_basic_map
*bmap
;
11201 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11203 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11208 /* Add a constraint imposing that the given two dimensions have opposite values.
11210 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
11211 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11213 isl_basic_map
*bmap
= NULL
;
11219 if (pos1
>= isl_map_dim(map
, type1
))
11220 isl_die(map
->ctx
, isl_error_invalid
,
11221 "index out of bounds", goto error
);
11222 if (pos2
>= isl_map_dim(map
, type2
))
11223 isl_die(map
->ctx
, isl_error_invalid
,
11224 "index out of bounds", goto error
);
11226 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11227 i
= isl_basic_map_alloc_equality(bmap
);
11230 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11231 pos1
+= isl_basic_map_offset(bmap
, type1
);
11232 pos2
+= isl_basic_map_offset(bmap
, type2
);
11233 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11234 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11235 bmap
= isl_basic_map_finalize(bmap
);
11237 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11241 isl_basic_map_free(bmap
);
11246 /* Add a constraint imposing that the value of the first dimension is
11247 * greater than or equal to that of the second.
11249 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11250 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11253 isl_local_space
*ls
;
11258 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
11259 isl_die(bmap
->ctx
, isl_error_invalid
,
11260 "index out of bounds", return isl_basic_map_free(bmap
));
11261 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
11262 isl_die(bmap
->ctx
, isl_error_invalid
,
11263 "index out of bounds", return isl_basic_map_free(bmap
));
11265 if (type1
== type2
&& pos1
== pos2
)
11268 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
11269 c
= isl_inequality_alloc(ls
);
11270 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11271 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11272 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11277 /* Construct a basic map where the value of the first dimension is
11278 * greater than that of the second.
11280 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
11281 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11283 isl_basic_map
*bmap
= NULL
;
11289 if (pos1
>= isl_space_dim(space
, type1
))
11290 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11291 "index out of bounds", goto error
);
11292 if (pos2
>= isl_space_dim(space
, type2
))
11293 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11294 "index out of bounds", goto error
);
11296 if (type1
== type2
&& pos1
== pos2
)
11297 return isl_basic_map_empty(space
);
11299 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
11300 i
= isl_basic_map_alloc_inequality(bmap
);
11303 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11304 pos1
+= isl_basic_map_offset(bmap
, type1
);
11305 pos2
+= isl_basic_map_offset(bmap
, type2
);
11306 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11307 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11308 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11309 bmap
= isl_basic_map_finalize(bmap
);
11313 isl_space_free(space
);
11314 isl_basic_map_free(bmap
);
11318 /* Add a constraint imposing that the value of the first dimension is
11319 * greater than that of the second.
11321 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
11322 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11326 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11328 bmap
= isl_basic_map_intersect(bmap
, gt
);
11333 /* Add a constraint imposing that the value of the first dimension is
11334 * greater than that of the second.
11336 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
11337 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11339 isl_basic_map
*bmap
;
11341 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11343 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11348 /* Add a constraint imposing that the value of the first dimension is
11349 * smaller than that of the second.
11351 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11352 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11354 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11357 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11361 isl_local_space
*ls
;
11366 if (!isl_basic_map_divs_known(bmap
))
11367 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11368 "some divs are unknown", return NULL
);
11370 ls
= isl_basic_map_get_local_space(bmap
);
11371 div
= isl_local_space_get_div(ls
, pos
);
11372 isl_local_space_free(ls
);
11377 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11380 return isl_basic_map_get_div(bset
, pos
);
11383 /* Plug in "subs" for dimension "type", "pos" of "bset".
11385 * Let i be the dimension to replace and let "subs" be of the form
11389 * Any integer division with a non-zero coefficient for i,
11391 * floor((a i + g)/m)
11395 * floor((a f + d g)/(m d))
11397 * Constraints of the form
11405 * We currently require that "subs" is an integral expression.
11406 * Handling rational expressions may require us to add stride constraints
11407 * as we do in isl_basic_set_preimage_multi_aff.
11409 __isl_give isl_basic_set
*isl_basic_set_substitute(
11410 __isl_take isl_basic_set
*bset
,
11411 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11417 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11420 bset
= isl_basic_set_cow(bset
);
11421 if (!bset
|| !subs
)
11424 ctx
= isl_basic_set_get_ctx(bset
);
11425 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11426 isl_die(ctx
, isl_error_invalid
,
11427 "spaces don't match", goto error
);
11428 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11429 isl_die(ctx
, isl_error_unsupported
,
11430 "cannot handle divs yet", goto error
);
11431 if (!isl_int_is_one(subs
->v
->el
[0]))
11432 isl_die(ctx
, isl_error_invalid
,
11433 "can only substitute integer expressions", goto error
);
11435 pos
+= isl_basic_set_offset(bset
, type
);
11439 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11440 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11442 isl_int_set(v
, bset
->eq
[i
][pos
]);
11443 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11444 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11445 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11448 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11449 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11451 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11452 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11453 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11454 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11457 for (i
= 0; i
< bset
->n_div
; ++i
) {
11458 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11460 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11461 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11462 isl_seq_combine(bset
->div
[i
] + 1,
11463 subs
->v
->el
[0], bset
->div
[i
] + 1,
11464 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11465 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11470 bset
= isl_basic_set_simplify(bset
);
11471 return isl_basic_set_finalize(bset
);
11473 isl_basic_set_free(bset
);
11477 /* Plug in "subs" for dimension "type", "pos" of "set".
11479 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11480 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11484 if (set
&& isl_set_plain_is_empty(set
))
11487 set
= isl_set_cow(set
);
11491 for (i
= set
->n
- 1; i
>= 0; --i
) {
11492 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11493 if (remove_if_empty(set
, i
) < 0)
11503 /* Check if the range of "ma" is compatible with the domain or range
11504 * (depending on "type") of "bmap".
11505 * Return -1 if anything is wrong.
11507 static int check_basic_map_compatible_range_multi_aff(
11508 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
11509 __isl_keep isl_multi_aff
*ma
)
11512 isl_space
*ma_space
;
11514 ma_space
= isl_multi_aff_get_space(ma
);
11515 m
= isl_space_tuple_match(bmap
->dim
, type
, ma_space
, isl_dim_out
);
11516 isl_space_free(ma_space
);
11518 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11519 "spaces don't match", return -1);
11523 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
11524 * coefficients before the transformed range of dimensions,
11525 * the "n_after" coefficients after the transformed range of dimensions
11526 * and the coefficients of the other divs in "bmap".
11528 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
11529 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
11534 isl_local_space
*ls
;
11539 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11543 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
11544 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
11545 for (i
= 0; i
< n_div
; ++i
) {
11546 int o_bmap
= 0, o_ls
= 0;
11548 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
11549 o_bmap
+= 1 + 1 + n_param
;
11550 o_ls
+= 1 + 1 + n_param
;
11551 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
11552 o_bmap
+= n_before
;
11553 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11554 ls
->div
->row
[i
] + o_ls
, n_set
);
11557 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
11559 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11560 ls
->div
->row
[i
] + o_ls
, n_div
);
11563 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
11564 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
11568 isl_local_space_free(ls
);
11571 isl_local_space_free(ls
);
11575 /* How many stride constraints does "ma" enforce?
11576 * That is, how many of the affine expressions have a denominator
11577 * different from one?
11579 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11584 for (i
= 0; i
< ma
->n
; ++i
)
11585 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11591 /* For each affine expression in ma of the form
11593 * x_i = (f_i y + h_i)/m_i
11595 * with m_i different from one, add a constraint to "bmap"
11598 * f_i y + h_i = m_i alpha_i
11600 * with alpha_i an additional existentially quantified variable.
11602 static __isl_give isl_basic_map
*add_ma_strides(
11603 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
11604 int n_before
, int n_after
)
11613 total
= isl_basic_map_total_dim(bmap
);
11614 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
11615 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
11616 n_div
= isl_multi_aff_dim(ma
, isl_dim_div
);
11617 for (i
= 0; i
< ma
->n
; ++i
) {
11618 int o_bmap
= 0, o_ma
= 1;
11620 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11622 div
= isl_basic_map_alloc_div(bmap
);
11623 k
= isl_basic_map_alloc_equality(bmap
);
11624 if (div
< 0 || k
< 0)
11626 isl_int_set_si(bmap
->div
[div
][0], 0);
11627 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11628 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
11629 o_bmap
+= 1 + n_param
;
11630 o_ma
+= 1 + n_param
;
11631 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
11632 o_bmap
+= n_before
;
11633 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11634 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
11637 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
11639 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11640 ma
->p
[i
]->v
->el
+ o_ma
, n_div
);
11643 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
11644 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11650 isl_basic_map_free(bmap
);
11654 /* Replace the domain or range space (depending on "type) of "space" by "set".
11656 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
11657 enum isl_dim_type type
, __isl_take isl_space
*set
)
11659 if (type
== isl_dim_in
) {
11660 space
= isl_space_range(space
);
11661 space
= isl_space_map_from_domain_and_range(set
, space
);
11663 space
= isl_space_domain(space
);
11664 space
= isl_space_map_from_domain_and_range(space
, set
);
11670 /* Compute the preimage of the domain or range (depending on "type")
11671 * of "bmap" under the function represented by "ma".
11672 * In other words, plug in "ma" in the domain or range of "bmap".
11673 * The result is a basic map that lives in the same space as "bmap"
11674 * except that the domain or range has been replaced by
11675 * the domain space of "ma".
11677 * If bmap is represented by
11679 * A(p) + S u + B x + T v + C(divs) >= 0,
11681 * where u and x are input and output dimensions if type == isl_dim_out
11682 * while x and v are input and output dimensions if type == isl_dim_in,
11683 * and ma is represented by
11685 * x = D(p) + F(y) + G(divs')
11687 * then the result is
11689 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
11691 * The divs in the input set are similarly adjusted.
11694 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
11698 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
11699 * B_i G(divs') + c_i(divs))/n_i)
11701 * If bmap is not a rational map and if F(y) involves any denominators
11703 * x_i = (f_i y + h_i)/m_i
11705 * then additional constraints are added to ensure that we only
11706 * map back integer points. That is we enforce
11708 * f_i y + h_i = m_i alpha_i
11710 * with alpha_i an additional existentially quantified variable.
11712 * We first copy over the divs from "ma".
11713 * Then we add the modified constraints and divs from "bmap".
11714 * Finally, we add the stride constraints, if needed.
11716 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
11717 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
11718 __isl_take isl_multi_aff
*ma
)
11722 isl_basic_map
*res
= NULL
;
11723 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
11724 isl_int f
, c1
, c2
, g
;
11725 int rational
, strides
;
11732 ma
= isl_multi_aff_align_divs(ma
);
11735 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
11738 if (type
== isl_dim_in
) {
11740 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
11742 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
11745 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
11746 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11748 space
= isl_multi_aff_get_domain_space(ma
);
11749 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
11750 rational
= isl_basic_map_is_rational(bmap
);
11751 strides
= rational
? 0 : multi_aff_strides(ma
);
11752 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
11753 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
11755 res
= isl_basic_map_set_rational(res
);
11757 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
11758 if (isl_basic_map_alloc_div(res
) < 0)
11761 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
11764 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
11765 k
= isl_basic_map_alloc_equality(res
);
11768 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
11769 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11772 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11773 k
= isl_basic_map_alloc_inequality(res
);
11776 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
11777 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11780 for (i
= 0; i
< bmap
->n_div
; ++i
) {
11781 if (isl_int_is_zero(bmap
->div
[i
][0])) {
11782 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11785 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
11786 n_before
, n_after
, n_div_ma
, n_div_bmap
,
11791 res
= add_ma_strides(res
, ma
, n_before
, n_after
);
11797 isl_basic_map_free(bmap
);
11798 isl_multi_aff_free(ma
);
11799 res
= isl_basic_set_simplify(res
);
11800 return isl_basic_map_finalize(res
);
11806 isl_basic_map_free(bmap
);
11807 isl_multi_aff_free(ma
);
11808 isl_basic_map_free(res
);
11812 /* Compute the preimage of "bset" under the function represented by "ma".
11813 * In other words, plug in "ma" in "bset". The result is a basic set
11814 * that lives in the domain space of "ma".
11816 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11817 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11819 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
11822 /* Check if the range of "ma" is compatible with the domain or range
11823 * (depending on "type") of "map".
11824 * Return -1 if anything is wrong.
11826 static int check_map_compatible_range_multi_aff(
11827 __isl_keep isl_map
*map
, enum isl_dim_type type
,
11828 __isl_keep isl_multi_aff
*ma
)
11831 isl_space
*ma_space
;
11833 ma_space
= isl_multi_aff_get_space(ma
);
11834 m
= isl_space_tuple_match(map
->dim
, type
, ma_space
, isl_dim_out
);
11835 isl_space_free(ma_space
);
11837 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11838 "spaces don't match", return -1);
11842 /* Compute the preimage of the domain or range (depending on "type")
11843 * of "map" under the function represented by "ma".
11844 * In other words, plug in "ma" in the domain or range of "map".
11845 * The result is a map that lives in the same space as "map"
11846 * except that the domain or range has been replaced by
11847 * the domain space of "ma".
11849 * The parameters are assumed to have been aligned.
11851 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
11852 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11857 map
= isl_map_cow(map
);
11858 ma
= isl_multi_aff_align_divs(ma
);
11861 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
11864 for (i
= 0; i
< map
->n
; ++i
) {
11865 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
11866 isl_multi_aff_copy(ma
));
11871 space
= isl_multi_aff_get_domain_space(ma
);
11872 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
11874 isl_space_free(map
->dim
);
11879 isl_multi_aff_free(ma
);
11881 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
11882 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
11885 isl_multi_aff_free(ma
);
11890 /* Compute the preimage of the domain or range (depending on "type")
11891 * of "map" under the function represented by "ma".
11892 * In other words, plug in "ma" in the domain or range of "map".
11893 * The result is a map that lives in the same space as "map"
11894 * except that the domain or range has been replaced by
11895 * the domain space of "ma".
11897 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
11898 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11903 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11904 return map_preimage_multi_aff(map
, type
, ma
);
11906 if (!isl_space_has_named_params(map
->dim
) ||
11907 !isl_space_has_named_params(ma
->space
))
11908 isl_die(map
->ctx
, isl_error_invalid
,
11909 "unaligned unnamed parameters", goto error
);
11910 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
11911 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
11913 return map_preimage_multi_aff(map
, type
, ma
);
11915 isl_multi_aff_free(ma
);
11916 return isl_map_free(map
);
11919 /* Compute the preimage of "set" under the function represented by "ma".
11920 * In other words, plug in "ma" "set". The result is a set
11921 * that lives in the domain space of "ma".
11923 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11924 __isl_take isl_multi_aff
*ma
)
11926 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
11929 /* Compute the preimage of the domain of "map" under the function
11930 * represented by "ma".
11931 * In other words, plug in "ma" in the domain of "map".
11932 * The result is a map that lives in the same space as "map"
11933 * except that the domain has been replaced by the domain space of "ma".
11935 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
11936 __isl_take isl_multi_aff
*ma
)
11938 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
11941 /* Compute the preimage of "set" under the function represented by "pma".
11942 * In other words, plug in "pma" in "set. The result is a set
11943 * that lives in the domain space of "pma".
11945 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11946 __isl_take isl_pw_multi_aff
*pma
)
11955 isl_pw_multi_aff_free(pma
);
11956 res
= isl_set_empty(isl_set_get_space(set
));
11961 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11962 isl_multi_aff_copy(pma
->p
[0].maff
));
11963 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
11965 for (i
= 1; i
< pma
->n
; ++i
) {
11968 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
11969 isl_multi_aff_copy(pma
->p
[i
].maff
));
11970 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
11971 res
= isl_set_union(res
, res_i
);
11974 isl_pw_multi_aff_free(pma
);
11978 isl_pw_multi_aff_free(pma
);
11983 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
11984 __isl_take isl_pw_multi_aff
*pma
)
11989 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
11990 return set_preimage_pw_multi_aff(set
, pma
);
11992 if (!isl_space_has_named_params(set
->dim
) ||
11993 !isl_space_has_named_params(pma
->dim
))
11994 isl_die(set
->ctx
, isl_error_invalid
,
11995 "unaligned unnamed parameters", goto error
);
11996 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
11997 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
11999 return set_preimage_pw_multi_aff(set
, pma
);
12001 isl_pw_multi_aff_free(pma
);
12002 return isl_set_free(set
);