2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
4 * Copyright 2012-2013 Ecole Normale Superieure
6 * Use of this software is governed by the MIT license
8 * Written by Sven Verdoolaege, K.U.Leuven, Departement
9 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
10 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
11 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
12 * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
16 #include <isl_ctx_private.h>
17 #include <isl_map_private.h>
19 #include "isl_space_private.h"
20 #include "isl_equalities.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
31 #include <isl_dim_map.h>
32 #include <isl_local_space_private.h>
33 #include <isl_aff_private.h>
34 #include <isl_options_private.h>
35 #include <isl_morph.h>
36 #include <isl_val_private.h>
38 static unsigned n(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
41 case isl_dim_param
: return dim
->nparam
;
42 case isl_dim_in
: return dim
->n_in
;
43 case isl_dim_out
: return dim
->n_out
;
44 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
49 static unsigned pos(__isl_keep isl_space
*dim
, enum isl_dim_type type
)
52 case isl_dim_param
: return 1;
53 case isl_dim_in
: return 1 + dim
->nparam
;
54 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
59 unsigned isl_basic_map_dim(__isl_keep isl_basic_map
*bmap
,
60 enum isl_dim_type type
)
65 case isl_dim_cst
: return 1;
68 case isl_dim_out
: return isl_space_dim(bmap
->dim
, type
);
69 case isl_dim_div
: return bmap
->n_div
;
70 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
75 unsigned isl_map_dim(__isl_keep isl_map
*map
, enum isl_dim_type type
)
77 return map
? n(map
->dim
, type
) : 0;
80 unsigned isl_set_dim(__isl_keep isl_set
*set
, enum isl_dim_type type
)
82 return set
? n(set
->dim
, type
) : 0;
85 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
86 enum isl_dim_type type
)
88 isl_space
*dim
= bmap
->dim
;
90 case isl_dim_cst
: return 0;
91 case isl_dim_param
: return 1;
92 case isl_dim_in
: return 1 + dim
->nparam
;
93 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
94 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
99 unsigned isl_basic_set_offset(struct isl_basic_set
*bset
,
100 enum isl_dim_type type
)
102 return isl_basic_map_offset(bset
, type
);
105 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
107 return pos(map
->dim
, type
);
110 unsigned isl_basic_set_dim(__isl_keep isl_basic_set
*bset
,
111 enum isl_dim_type type
)
113 return isl_basic_map_dim(bset
, type
);
116 unsigned isl_basic_set_n_dim(__isl_keep isl_basic_set
*bset
)
118 return isl_basic_set_dim(bset
, isl_dim_set
);
121 unsigned isl_basic_set_n_param(__isl_keep isl_basic_set
*bset
)
123 return isl_basic_set_dim(bset
, isl_dim_param
);
126 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
130 return isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->n_div
;
133 unsigned isl_set_n_dim(__isl_keep isl_set
*set
)
135 return isl_set_dim(set
, isl_dim_set
);
138 unsigned isl_set_n_param(__isl_keep isl_set
*set
)
140 return isl_set_dim(set
, isl_dim_param
);
143 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
145 return bmap
? bmap
->dim
->n_in
: 0;
148 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
150 return bmap
? bmap
->dim
->n_out
: 0;
153 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
155 return bmap
? bmap
->dim
->nparam
: 0;
158 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
160 return bmap
? bmap
->n_div
: 0;
163 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
165 return bmap
? isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->n_div
: 0;
168 unsigned isl_map_n_in(const struct isl_map
*map
)
170 return map
? map
->dim
->n_in
: 0;
173 unsigned isl_map_n_out(const struct isl_map
*map
)
175 return map
? map
->dim
->n_out
: 0;
178 unsigned isl_map_n_param(const struct isl_map
*map
)
180 return map
? map
->dim
->nparam
: 0;
183 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
188 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
191 return isl_space_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
194 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
195 struct isl_basic_set
*bset
)
200 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
203 return isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
206 int isl_map_compatible_range(__isl_keep isl_map
*map
, __isl_keep isl_set
*set
)
211 m
= isl_space_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
214 return isl_space_tuple_match(map
->dim
, isl_dim_out
, set
->dim
, isl_dim_set
);
217 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
218 struct isl_basic_set
*bset
)
223 m
= isl_space_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
226 return isl_space_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
229 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
231 return bmap
? bmap
->ctx
: NULL
;
234 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
236 return bset
? bset
->ctx
: NULL
;
239 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
241 return map
? map
->ctx
: NULL
;
244 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
246 return set
? set
->ctx
: NULL
;
249 __isl_give isl_space
*isl_basic_map_get_space(__isl_keep isl_basic_map
*bmap
)
253 return isl_space_copy(bmap
->dim
);
256 __isl_give isl_space
*isl_basic_set_get_space(__isl_keep isl_basic_set
*bset
)
260 return isl_space_copy(bset
->dim
);
263 /* Extract the divs in "bmap" as a matrix.
265 __isl_give isl_mat
*isl_basic_map_get_divs(__isl_keep isl_basic_map
*bmap
)
276 ctx
= isl_basic_map_get_ctx(bmap
);
277 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
278 cols
= 1 + 1 + total
+ bmap
->n_div
;
279 div
= isl_mat_alloc(ctx
, bmap
->n_div
, cols
);
283 for (i
= 0; i
< bmap
->n_div
; ++i
)
284 isl_seq_cpy(div
->row
[i
], bmap
->div
[i
], cols
);
289 /* Extract the divs in "bset" as a matrix.
291 __isl_give isl_mat
*isl_basic_set_get_divs(__isl_keep isl_basic_set
*bset
)
293 return isl_basic_map_get_divs(bset
);
296 __isl_give isl_local_space
*isl_basic_map_get_local_space(
297 __isl_keep isl_basic_map
*bmap
)
304 div
= isl_basic_map_get_divs(bmap
);
305 return isl_local_space_alloc_div(isl_space_copy(bmap
->dim
), div
);
308 __isl_give isl_local_space
*isl_basic_set_get_local_space(
309 __isl_keep isl_basic_set
*bset
)
311 return isl_basic_map_get_local_space(bset
);
314 __isl_give isl_basic_map
*isl_basic_map_from_local_space(
315 __isl_take isl_local_space
*ls
)
324 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
325 bmap
= isl_basic_map_alloc_space(isl_local_space_get_space(ls
),
326 n_div
, 0, 2 * n_div
);
328 for (i
= 0; i
< n_div
; ++i
)
329 if (isl_basic_map_alloc_div(bmap
) < 0)
332 for (i
= 0; i
< n_div
; ++i
) {
333 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
334 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
338 isl_local_space_free(ls
);
341 isl_local_space_free(ls
);
342 isl_basic_map_free(bmap
);
346 __isl_give isl_basic_set
*isl_basic_set_from_local_space(
347 __isl_take isl_local_space
*ls
)
349 return isl_basic_map_from_local_space(ls
);
352 __isl_give isl_space
*isl_map_get_space(__isl_keep isl_map
*map
)
356 return isl_space_copy(map
->dim
);
359 __isl_give isl_space
*isl_set_get_space(__isl_keep isl_set
*set
)
363 return isl_space_copy(set
->dim
);
366 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
367 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
369 bmap
= isl_basic_map_cow(bmap
);
372 bmap
->dim
= isl_space_set_tuple_name(bmap
->dim
, type
, s
);
375 bmap
= isl_basic_map_finalize(bmap
);
378 isl_basic_map_free(bmap
);
382 __isl_give isl_basic_set
*isl_basic_set_set_tuple_name(
383 __isl_take isl_basic_set
*bset
, const char *s
)
385 return isl_basic_map_set_tuple_name(bset
, isl_dim_set
, s
);
388 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map
*bmap
,
389 enum isl_dim_type type
)
391 return bmap
? isl_space_get_tuple_name(bmap
->dim
, type
) : NULL
;
394 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
395 enum isl_dim_type type
, const char *s
)
399 map
= isl_map_cow(map
);
403 map
->dim
= isl_space_set_tuple_name(map
->dim
, type
, s
);
407 for (i
= 0; i
< map
->n
; ++i
) {
408 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
419 /* Does the input or output tuple have a name?
421 int isl_map_has_tuple_name(__isl_keep isl_map
*map
, enum isl_dim_type type
)
423 return map
? isl_space_has_tuple_name(map
->dim
, type
) : -1;
426 const char *isl_map_get_tuple_name(__isl_keep isl_map
*map
,
427 enum isl_dim_type type
)
429 return map
? isl_space_get_tuple_name(map
->dim
, type
) : NULL
;
432 __isl_give isl_set
*isl_set_set_tuple_name(__isl_take isl_set
*set
,
435 return (isl_set
*)isl_map_set_tuple_name((isl_map
*)set
, isl_dim_set
, s
);
438 __isl_give isl_map
*isl_map_set_tuple_id(__isl_take isl_map
*map
,
439 enum isl_dim_type type
, __isl_take isl_id
*id
)
441 map
= isl_map_cow(map
);
443 return isl_id_free(id
);
445 map
->dim
= isl_space_set_tuple_id(map
->dim
, type
, id
);
447 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
450 __isl_give isl_set
*isl_set_set_tuple_id(__isl_take isl_set
*set
,
451 __isl_take isl_id
*id
)
453 return isl_map_set_tuple_id(set
, isl_dim_set
, id
);
456 __isl_give isl_map
*isl_map_reset_tuple_id(__isl_take isl_map
*map
,
457 enum isl_dim_type type
)
459 map
= isl_map_cow(map
);
463 map
->dim
= isl_space_reset_tuple_id(map
->dim
, type
);
465 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
468 __isl_give isl_set
*isl_set_reset_tuple_id(__isl_take isl_set
*set
)
470 return isl_map_reset_tuple_id(set
, isl_dim_set
);
473 int isl_map_has_tuple_id(__isl_keep isl_map
*map
, enum isl_dim_type type
)
475 return map
? isl_space_has_tuple_id(map
->dim
, type
) : -1;
478 __isl_give isl_id
*isl_map_get_tuple_id(__isl_keep isl_map
*map
,
479 enum isl_dim_type type
)
481 return map
? isl_space_get_tuple_id(map
->dim
, type
) : NULL
;
484 int isl_set_has_tuple_id(__isl_keep isl_set
*set
)
486 return isl_map_has_tuple_id(set
, isl_dim_set
);
489 __isl_give isl_id
*isl_set_get_tuple_id(__isl_keep isl_set
*set
)
491 return isl_map_get_tuple_id(set
, isl_dim_set
);
494 /* Does the set tuple have a name?
496 int isl_set_has_tuple_name(__isl_keep isl_set
*set
)
498 return set
? isl_space_has_tuple_name(set
->dim
, isl_dim_set
) : -1;
502 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set
*bset
)
504 return bset
? isl_space_get_tuple_name(bset
->dim
, isl_dim_set
) : NULL
;
507 const char *isl_set_get_tuple_name(__isl_keep isl_set
*set
)
509 return set
? isl_space_get_tuple_name(set
->dim
, isl_dim_set
) : NULL
;
512 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map
*bmap
,
513 enum isl_dim_type type
, unsigned pos
)
515 return bmap
? isl_space_get_dim_name(bmap
->dim
, type
, pos
) : NULL
;
518 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set
*bset
,
519 enum isl_dim_type type
, unsigned pos
)
521 return bset
? isl_space_get_dim_name(bset
->dim
, type
, pos
) : NULL
;
524 /* Does the given dimension have a name?
526 int isl_map_has_dim_name(__isl_keep isl_map
*map
,
527 enum isl_dim_type type
, unsigned pos
)
529 return map
? isl_space_has_dim_name(map
->dim
, type
, pos
) : -1;
532 const char *isl_map_get_dim_name(__isl_keep isl_map
*map
,
533 enum isl_dim_type type
, unsigned pos
)
535 return map
? isl_space_get_dim_name(map
->dim
, type
, pos
) : NULL
;
538 const char *isl_set_get_dim_name(__isl_keep isl_set
*set
,
539 enum isl_dim_type type
, unsigned pos
)
541 return set
? isl_space_get_dim_name(set
->dim
, type
, pos
) : NULL
;
544 /* Does the given dimension have a name?
546 int isl_set_has_dim_name(__isl_keep isl_set
*set
,
547 enum isl_dim_type type
, unsigned pos
)
549 return set
? isl_space_has_dim_name(set
->dim
, type
, pos
) : -1;
552 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
553 __isl_take isl_basic_map
*bmap
,
554 enum isl_dim_type type
, unsigned pos
, const char *s
)
556 bmap
= isl_basic_map_cow(bmap
);
559 bmap
->dim
= isl_space_set_dim_name(bmap
->dim
, type
, pos
, s
);
562 return isl_basic_map_finalize(bmap
);
564 isl_basic_map_free(bmap
);
568 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
569 enum isl_dim_type type
, unsigned pos
, const char *s
)
573 map
= isl_map_cow(map
);
577 map
->dim
= isl_space_set_dim_name(map
->dim
, type
, pos
, s
);
581 for (i
= 0; i
< map
->n
; ++i
) {
582 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
593 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
594 __isl_take isl_basic_set
*bset
,
595 enum isl_dim_type type
, unsigned pos
, const char *s
)
597 return (isl_basic_set
*)isl_basic_map_set_dim_name(
598 (isl_basic_map
*)bset
, type
, pos
, s
);
601 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
602 enum isl_dim_type type
, unsigned pos
, const char *s
)
604 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
607 int isl_basic_map_has_dim_id(__isl_keep isl_basic_map
*bmap
,
608 enum isl_dim_type type
, unsigned pos
)
610 return bmap
? isl_space_has_dim_id(bmap
->dim
, type
, pos
) : -1;
613 __isl_give isl_id
*isl_basic_set_get_dim_id(__isl_keep isl_basic_set
*bset
,
614 enum isl_dim_type type
, unsigned pos
)
616 return bset
? isl_space_get_dim_id(bset
->dim
, type
, pos
) : NULL
;
619 int isl_map_has_dim_id(__isl_keep isl_map
*map
,
620 enum isl_dim_type type
, unsigned pos
)
622 return map
? isl_space_has_dim_id(map
->dim
, type
, pos
) : -1;
625 __isl_give isl_id
*isl_map_get_dim_id(__isl_keep isl_map
*map
,
626 enum isl_dim_type type
, unsigned pos
)
628 return map
? isl_space_get_dim_id(map
->dim
, type
, pos
) : NULL
;
631 int isl_set_has_dim_id(__isl_keep isl_set
*set
,
632 enum isl_dim_type type
, unsigned pos
)
634 return isl_map_has_dim_id(set
, type
, pos
);
637 __isl_give isl_id
*isl_set_get_dim_id(__isl_keep isl_set
*set
,
638 enum isl_dim_type type
, unsigned pos
)
640 return isl_map_get_dim_id(set
, type
, pos
);
643 __isl_give isl_map
*isl_map_set_dim_id(__isl_take isl_map
*map
,
644 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
646 map
= isl_map_cow(map
);
648 return isl_id_free(id
);
650 map
->dim
= isl_space_set_dim_id(map
->dim
, type
, pos
, id
);
652 return isl_map_reset_space(map
, isl_space_copy(map
->dim
));
655 __isl_give isl_set
*isl_set_set_dim_id(__isl_take isl_set
*set
,
656 enum isl_dim_type type
, unsigned pos
, __isl_take isl_id
*id
)
658 return isl_map_set_dim_id(set
, type
, pos
, id
);
661 int isl_map_find_dim_by_id(__isl_keep isl_map
*map
, enum isl_dim_type type
,
662 __isl_keep isl_id
*id
)
666 return isl_space_find_dim_by_id(map
->dim
, type
, id
);
669 int isl_set_find_dim_by_id(__isl_keep isl_set
*set
, enum isl_dim_type type
,
670 __isl_keep isl_id
*id
)
672 return isl_map_find_dim_by_id(set
, type
, id
);
675 int isl_map_find_dim_by_name(__isl_keep isl_map
*map
, enum isl_dim_type type
,
680 return isl_space_find_dim_by_name(map
->dim
, type
, name
);
683 int isl_set_find_dim_by_name(__isl_keep isl_set
*set
, enum isl_dim_type type
,
686 return isl_map_find_dim_by_name(set
, type
, name
);
689 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
693 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
696 int isl_basic_set_is_rational(__isl_keep isl_basic_set
*bset
)
698 return isl_basic_map_is_rational(bset
);
701 /* Does "bmap" contain any rational points?
703 * If "bmap" has an equality for each dimension, equating the dimension
704 * to an integer constant, then it has no rational points, even if it
705 * is marked as rational.
707 int isl_basic_map_has_rational(__isl_keep isl_basic_map
*bmap
)
709 int has_rational
= 1;
714 if (isl_basic_map_plain_is_empty(bmap
))
716 if (!isl_basic_map_is_rational(bmap
))
718 bmap
= isl_basic_map_copy(bmap
);
719 bmap
= isl_basic_map_implicit_equalities(bmap
);
722 total
= isl_basic_map_total_dim(bmap
);
723 if (bmap
->n_eq
== total
) {
725 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
726 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1, total
);
729 if (!isl_int_is_one(bmap
->eq
[i
][1 + j
]) &&
730 !isl_int_is_negone(bmap
->eq
[i
][1 + j
]))
732 j
= isl_seq_first_non_zero(bmap
->eq
[i
] + 1 + j
+ 1,
740 isl_basic_map_free(bmap
);
745 /* Does "map" contain any rational points?
747 int isl_map_has_rational(__isl_keep isl_map
*map
)
754 for (i
= 0; i
< map
->n
; ++i
) {
755 has_rational
= isl_basic_map_has_rational(map
->p
[i
]);
756 if (has_rational
< 0)
764 /* Does "set" contain any rational points?
766 int isl_set_has_rational(__isl_keep isl_set
*set
)
768 return isl_map_has_rational(set
);
771 /* Is this basic set a parameter domain?
773 int isl_basic_set_is_params(__isl_keep isl_basic_set
*bset
)
777 return isl_space_is_params(bset
->dim
);
780 /* Is this set a parameter domain?
782 int isl_set_is_params(__isl_keep isl_set
*set
)
786 return isl_space_is_params(set
->dim
);
789 /* Is this map actually a parameter domain?
790 * Users should never call this function. Outside of isl,
791 * a map can never be a parameter domain.
793 int isl_map_is_params(__isl_keep isl_map
*map
)
797 return isl_space_is_params(map
->dim
);
800 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
801 struct isl_basic_map
*bmap
, unsigned extra
,
802 unsigned n_eq
, unsigned n_ineq
)
805 size_t row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + extra
;
810 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
811 if (isl_blk_is_error(bmap
->block
))
814 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
815 if ((n_ineq
+ n_eq
) && !bmap
->ineq
)
819 bmap
->block2
= isl_blk_empty();
822 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
823 if (isl_blk_is_error(bmap
->block2
))
826 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
831 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
832 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
834 for (i
= 0; i
< extra
; ++i
)
835 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
839 bmap
->c_size
= n_eq
+ n_ineq
;
840 bmap
->eq
= bmap
->ineq
+ n_ineq
;
849 isl_basic_map_free(bmap
);
853 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
854 unsigned nparam
, unsigned dim
, unsigned extra
,
855 unsigned n_eq
, unsigned n_ineq
)
857 struct isl_basic_map
*bmap
;
860 space
= isl_space_set_alloc(ctx
, nparam
, dim
);
864 bmap
= isl_basic_map_alloc_space(space
, extra
, n_eq
, n_ineq
);
865 return (struct isl_basic_set
*)bmap
;
868 struct isl_basic_set
*isl_basic_set_alloc_space(__isl_take isl_space
*dim
,
869 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
871 struct isl_basic_map
*bmap
;
874 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
875 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
876 return (struct isl_basic_set
*)bmap
;
882 struct isl_basic_map
*isl_basic_map_alloc_space(__isl_take isl_space
*dim
,
883 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
885 struct isl_basic_map
*bmap
;
889 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
894 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
900 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
901 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
902 unsigned n_eq
, unsigned n_ineq
)
904 struct isl_basic_map
*bmap
;
907 dim
= isl_space_alloc(ctx
, nparam
, in
, out
);
911 bmap
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
915 static void dup_constraints(
916 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
919 unsigned total
= isl_basic_map_total_dim(src
);
921 for (i
= 0; i
< src
->n_eq
; ++i
) {
922 int j
= isl_basic_map_alloc_equality(dst
);
923 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
926 for (i
= 0; i
< src
->n_ineq
; ++i
) {
927 int j
= isl_basic_map_alloc_inequality(dst
);
928 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
931 for (i
= 0; i
< src
->n_div
; ++i
) {
932 int j
= isl_basic_map_alloc_div(dst
);
933 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
935 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
938 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
940 struct isl_basic_map
*dup
;
944 dup
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
945 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
948 dup_constraints(dup
, bmap
);
949 dup
->flags
= bmap
->flags
;
950 dup
->sample
= isl_vec_copy(bmap
->sample
);
954 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
956 struct isl_basic_map
*dup
;
958 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
959 return (struct isl_basic_set
*)dup
;
962 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
967 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
971 return isl_basic_set_dup(bset
);
974 struct isl_set
*isl_set_copy(struct isl_set
*set
)
983 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
988 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
992 bmap
= isl_basic_map_dup(bmap
);
994 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
998 struct isl_map
*isl_map_copy(struct isl_map
*map
)
1007 void *isl_basic_map_free(__isl_take isl_basic_map
*bmap
)
1012 if (--bmap
->ref
> 0)
1015 isl_ctx_deref(bmap
->ctx
);
1017 isl_blk_free(bmap
->ctx
, bmap
->block2
);
1019 isl_blk_free(bmap
->ctx
, bmap
->block
);
1020 isl_vec_free(bmap
->sample
);
1021 isl_space_free(bmap
->dim
);
1027 void *isl_basic_set_free(struct isl_basic_set
*bset
)
1029 return isl_basic_map_free((struct isl_basic_map
*)bset
);
1032 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
1034 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
1037 __isl_give isl_map
*isl_map_align_params_map_map_and(
1038 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
,
1039 __isl_give isl_map
*(*fn
)(__isl_take isl_map
*map1
,
1040 __isl_take isl_map
*map2
))
1044 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1045 return fn(map1
, map2
);
1046 if (!isl_space_has_named_params(map1
->dim
) ||
1047 !isl_space_has_named_params(map2
->dim
))
1048 isl_die(map1
->ctx
, isl_error_invalid
,
1049 "unaligned unnamed parameters", goto error
);
1050 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1051 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1052 return fn(map1
, map2
);
1059 int isl_map_align_params_map_map_and_test(__isl_keep isl_map
*map1
,
1060 __isl_keep isl_map
*map2
,
1061 int (*fn
)(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
))
1067 if (isl_space_match(map1
->dim
, isl_dim_param
, map2
->dim
, isl_dim_param
))
1068 return fn(map1
, map2
);
1069 if (!isl_space_has_named_params(map1
->dim
) ||
1070 !isl_space_has_named_params(map2
->dim
))
1071 isl_die(map1
->ctx
, isl_error_invalid
,
1072 "unaligned unnamed parameters", return -1);
1073 map1
= isl_map_copy(map1
);
1074 map2
= isl_map_copy(map2
);
1075 map1
= isl_map_align_params(map1
, isl_map_get_space(map2
));
1076 map2
= isl_map_align_params(map2
, isl_map_get_space(map1
));
1083 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
1085 struct isl_ctx
*ctx
;
1089 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
1090 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
1092 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1093 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1094 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1095 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1096 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1097 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
1099 int j
= isl_basic_map_alloc_inequality(bmap
);
1103 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1104 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1111 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
1112 bmap
->extra
- bmap
->n_div
);
1113 return bmap
->n_eq
++;
1116 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
1118 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
1121 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
1125 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
1130 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
1132 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
1135 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
1140 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
1142 if (pos
!= bmap
->n_eq
- 1) {
1144 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
1145 bmap
->eq
[bmap
->n_eq
- 1] = t
;
1151 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
1153 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
1156 /* Turn inequality "pos" of "bmap" into an equality.
1158 * In particular, we move the inequality in front of the equalities
1159 * and move the last inequality in the position of the moved inequality.
1160 * Note that isl_tab_make_equalities_explicit depends on this particular
1161 * change in the ordering of the constraints.
1163 void isl_basic_map_inequality_to_equality(
1164 struct isl_basic_map
*bmap
, unsigned pos
)
1168 t
= bmap
->ineq
[pos
];
1169 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1170 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
1175 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1176 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1177 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1178 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1181 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
1183 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
1186 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
1188 struct isl_ctx
*ctx
;
1192 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
1193 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
1194 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
1195 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1196 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
1197 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
1198 1 + isl_basic_map_total_dim(bmap
),
1199 bmap
->extra
- bmap
->n_div
);
1200 return bmap
->n_ineq
++;
1203 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
1205 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
1208 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
1212 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
1217 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
1219 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
1222 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
1227 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1229 if (pos
!= bmap
->n_ineq
- 1) {
1230 t
= bmap
->ineq
[pos
];
1231 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
1232 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
1233 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1239 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
1241 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
1244 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
1249 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
1252 k
= isl_basic_map_alloc_equality(bmap
);
1255 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
1258 isl_basic_map_free(bmap
);
1262 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
1265 return (isl_basic_set
*)
1266 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
1269 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
1274 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
1277 k
= isl_basic_map_alloc_inequality(bmap
);
1280 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
1283 isl_basic_map_free(bmap
);
1287 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
1290 return (isl_basic_set
*)
1291 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
1294 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
1298 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
1299 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
1300 1 + 1 + isl_basic_map_total_dim(bmap
),
1301 bmap
->extra
- bmap
->n_div
);
1302 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
1303 return bmap
->n_div
++;
1306 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
1308 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
1311 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
1315 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
1320 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
1322 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
1325 /* Copy constraint from src to dst, putting the vars of src at offset
1326 * dim_off in dst and the divs of src at offset div_off in dst.
1327 * If both sets are actually map, then dim_off applies to the input
1330 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1331 struct isl_basic_map
*src_map
, isl_int
*src
,
1332 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1334 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
1335 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
1336 unsigned src_in
= isl_basic_map_n_in(src_map
);
1337 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
1338 unsigned src_out
= isl_basic_map_n_out(src_map
);
1339 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
1340 isl_int_set(dst
[0], src
[0]);
1341 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
1342 if (dst_nparam
> src_nparam
)
1343 isl_seq_clr(dst
+1+src_nparam
,
1344 dst_nparam
- src_nparam
);
1345 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
1346 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
1348 isl_min(dst_in
-in_off
, src_in
));
1349 if (dst_in
-in_off
> src_in
)
1350 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
1351 dst_in
- in_off
- src_in
);
1352 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
1353 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
1354 src
+1+src_nparam
+src_in
,
1355 isl_min(dst_out
-out_off
, src_out
));
1356 if (dst_out
-out_off
> src_out
)
1357 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
1358 dst_out
- out_off
- src_out
);
1359 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
1360 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
1361 src
+1+src_nparam
+src_in
+src_out
,
1362 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
1363 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
1364 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
1365 div_off
+src_map
->n_div
,
1366 dst_map
->n_div
- div_off
- src_map
->n_div
);
1369 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
1370 struct isl_basic_map
*src_map
, isl_int
*src
,
1371 unsigned in_off
, unsigned out_off
, unsigned div_off
)
1373 isl_int_set(dst
[0], src
[0]);
1374 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
1377 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
1378 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
1383 if (!bmap1
|| !bmap2
)
1386 div_off
= bmap1
->n_div
;
1388 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
1389 int i1
= isl_basic_map_alloc_equality(bmap1
);
1392 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
1393 i_pos
, o_pos
, div_off
);
1396 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
1397 int i1
= isl_basic_map_alloc_inequality(bmap1
);
1400 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
1401 i_pos
, o_pos
, div_off
);
1404 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
1405 int i1
= isl_basic_map_alloc_div(bmap1
);
1408 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
1409 i_pos
, o_pos
, div_off
);
1412 isl_basic_map_free(bmap2
);
1417 isl_basic_map_free(bmap1
);
1418 isl_basic_map_free(bmap2
);
1422 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1423 struct isl_basic_set
*bset2
, unsigned pos
)
1425 return (struct isl_basic_set
*)
1426 add_constraints((struct isl_basic_map
*)bset1
,
1427 (struct isl_basic_map
*)bset2
, 0, pos
);
1430 struct isl_basic_map
*isl_basic_map_extend_space(struct isl_basic_map
*base
,
1431 __isl_take isl_space
*dim
, unsigned extra
,
1432 unsigned n_eq
, unsigned n_ineq
)
1434 struct isl_basic_map
*ext
;
1444 dims_ok
= isl_space_is_equal(base
->dim
, dim
) &&
1445 base
->extra
>= base
->n_div
+ extra
;
1447 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1448 room_for_ineq(base
, n_ineq
)) {
1449 isl_space_free(dim
);
1453 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1454 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1455 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1456 extra
+= base
->extra
;
1458 n_ineq
+= base
->n_ineq
;
1460 ext
= isl_basic_map_alloc_space(dim
, extra
, n_eq
, n_ineq
);
1466 ext
->sample
= isl_vec_copy(base
->sample
);
1467 flags
= base
->flags
;
1468 ext
= add_constraints(ext
, base
, 0, 0);
1471 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1477 isl_space_free(dim
);
1478 isl_basic_map_free(base
);
1482 struct isl_basic_set
*isl_basic_set_extend_space(struct isl_basic_set
*base
,
1483 __isl_take isl_space
*dim
, unsigned extra
,
1484 unsigned n_eq
, unsigned n_ineq
)
1486 return (struct isl_basic_set
*)
1487 isl_basic_map_extend_space((struct isl_basic_map
*)base
, dim
,
1488 extra
, n_eq
, n_ineq
);
1491 struct isl_basic_map
*isl_basic_map_extend_constraints(
1492 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1496 return isl_basic_map_extend_space(base
, isl_space_copy(base
->dim
),
1500 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1501 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1502 unsigned n_eq
, unsigned n_ineq
)
1504 struct isl_basic_map
*bmap
;
1509 dim
= isl_space_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1513 bmap
= isl_basic_map_extend_space(base
, dim
, extra
, n_eq
, n_ineq
);
1516 isl_basic_map_free(base
);
1520 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1521 unsigned nparam
, unsigned dim
, unsigned extra
,
1522 unsigned n_eq
, unsigned n_ineq
)
1524 return (struct isl_basic_set
*)
1525 isl_basic_map_extend((struct isl_basic_map
*)base
,
1526 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1529 struct isl_basic_set
*isl_basic_set_extend_constraints(
1530 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1532 return (struct isl_basic_set
*)
1533 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1537 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1539 return (struct isl_basic_set
*)
1540 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1543 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1548 if (bmap
->ref
> 1) {
1550 bmap
= isl_basic_map_dup(bmap
);
1553 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1557 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1565 return isl_set_dup(set
);
1568 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1576 return isl_map_dup(map
);
1579 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1580 unsigned a_len
, unsigned b_len
)
1582 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1583 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1584 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1587 static __isl_give isl_basic_map
*isl_basic_map_swap_vars(
1588 __isl_take isl_basic_map
*bmap
, unsigned pos
, unsigned n1
, unsigned n2
)
1596 isl_assert(bmap
->ctx
,
1597 pos
+ n1
+ n2
<= 1 + isl_basic_map_total_dim(bmap
), goto error
);
1599 if (n1
== 0 || n2
== 0)
1602 bmap
= isl_basic_map_cow(bmap
);
1606 blk
= isl_blk_alloc(bmap
->ctx
, n1
+ n2
);
1607 if (isl_blk_is_error(blk
))
1610 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1612 bmap
->eq
[i
] + pos
, n1
, n2
);
1614 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1616 bmap
->ineq
[i
] + pos
, n1
, n2
);
1618 for (i
= 0; i
< bmap
->n_div
; ++i
)
1620 bmap
->div
[i
]+1 + pos
, n1
, n2
);
1622 isl_blk_free(bmap
->ctx
, blk
);
1624 ISL_F_CLR(bmap
, ISL_BASIC_SET_NORMALIZED
);
1625 bmap
= isl_basic_map_gauss(bmap
, NULL
);
1626 return isl_basic_map_finalize(bmap
);
1628 isl_basic_map_free(bmap
);
1632 static __isl_give isl_basic_set
*isl_basic_set_swap_vars(
1633 __isl_take isl_basic_set
*bset
, unsigned n
)
1641 nparam
= isl_basic_set_n_param(bset
);
1642 dim
= isl_basic_set_n_dim(bset
);
1643 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1645 return isl_basic_map_swap_vars(bset
, 1 + nparam
, n
, dim
- n
);
1647 isl_basic_set_free(bset
);
1651 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1657 total
= isl_basic_map_total_dim(bmap
);
1658 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1659 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1661 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1663 i
= isl_basic_map_alloc_equality(bmap
);
1667 isl_int_set_si(bmap
->eq
[i
][0], 1);
1668 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1669 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1670 isl_vec_free(bmap
->sample
);
1671 bmap
->sample
= NULL
;
1672 return isl_basic_map_finalize(bmap
);
1674 isl_basic_map_free(bmap
);
1678 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1680 return (struct isl_basic_set
*)
1681 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1684 /* Swap divs "a" and "b" in "bmap" (without modifying any of the constraints
1687 static void swap_div(__isl_keep isl_basic_map
*bmap
, int a
, int b
)
1689 isl_int
*t
= bmap
->div
[a
];
1690 bmap
->div
[a
] = bmap
->div
[b
];
1694 /* Swap divs "a" and "b" in "bmap" and adjust the constraints and
1695 * div definitions accordingly.
1697 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1700 unsigned off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
1702 swap_div(bmap
, a
, b
);
1704 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1705 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1707 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1708 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1710 for (i
= 0; i
< bmap
->n_div
; ++i
)
1711 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1712 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1715 /* Eliminate the specified n dimensions starting at first from the
1716 * constraints, without removing the dimensions from the space.
1717 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1719 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1720 enum isl_dim_type type
, unsigned first
, unsigned n
)
1729 if (first
+ n
> isl_map_dim(map
, type
) || first
+ n
< first
)
1730 isl_die(map
->ctx
, isl_error_invalid
,
1731 "index out of bounds", goto error
);
1733 map
= isl_map_cow(map
);
1737 for (i
= 0; i
< map
->n
; ++i
) {
1738 map
->p
[i
] = isl_basic_map_eliminate(map
->p
[i
], type
, first
, n
);
1748 /* Eliminate the specified n dimensions starting at first from the
1749 * constraints, without removing the dimensions from the space.
1750 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1752 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1753 enum isl_dim_type type
, unsigned first
, unsigned n
)
1755 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1758 /* Eliminate the specified n dimensions starting at first from the
1759 * constraints, without removing the dimensions from the space.
1760 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1762 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1763 unsigned first
, unsigned n
)
1765 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1768 __isl_give isl_basic_map
*isl_basic_map_remove_divs(
1769 __isl_take isl_basic_map
*bmap
)
1773 bmap
= isl_basic_map_eliminate_vars(bmap
,
1774 isl_space_dim(bmap
->dim
, isl_dim_all
), bmap
->n_div
);
1778 return isl_basic_map_finalize(bmap
);
1781 __isl_give isl_basic_set
*isl_basic_set_remove_divs(
1782 __isl_take isl_basic_set
*bset
)
1784 return (struct isl_basic_set
*)isl_basic_map_remove_divs(
1785 (struct isl_basic_map
*)bset
);
1788 __isl_give isl_map
*isl_map_remove_divs(__isl_take isl_map
*map
)
1797 map
= isl_map_cow(map
);
1801 for (i
= 0; i
< map
->n
; ++i
) {
1802 map
->p
[i
] = isl_basic_map_remove_divs(map
->p
[i
]);
1812 __isl_give isl_set
*isl_set_remove_divs(__isl_take isl_set
*set
)
1814 return isl_map_remove_divs(set
);
1817 struct isl_basic_map
*isl_basic_map_remove_dims(struct isl_basic_map
*bmap
,
1818 enum isl_dim_type type
, unsigned first
, unsigned n
)
1822 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1824 if (n
== 0 && !isl_space_is_named_or_nested(bmap
->dim
, type
))
1826 bmap
= isl_basic_map_eliminate_vars(bmap
,
1827 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1830 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1832 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1835 isl_basic_map_free(bmap
);
1839 /* Return true if the definition of the given div (recursively) involves
1840 * any of the given variables.
1842 static int div_involves_vars(__isl_keep isl_basic_map
*bmap
, int div
,
1843 unsigned first
, unsigned n
)
1846 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
1848 if (isl_int_is_zero(bmap
->div
[div
][0]))
1850 if (isl_seq_first_non_zero(bmap
->div
[div
] + 1 + first
, n
) >= 0)
1853 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
1854 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
1856 if (div_involves_vars(bmap
, i
, first
, n
))
1863 /* Try and add a lower and/or upper bound on "div" to "bmap"
1864 * based on inequality "i".
1865 * "total" is the total number of variables (excluding the divs).
1866 * "v" is a temporary object that can be used during the calculations.
1867 * If "lb" is set, then a lower bound should be constructed.
1868 * If "ub" is set, then an upper bound should be constructed.
1870 * The calling function has already checked that the inequality does not
1871 * reference "div", but we still need to check that the inequality is
1872 * of the right form. We'll consider the case where we want to construct
1873 * a lower bound. The construction of upper bounds is similar.
1875 * Let "div" be of the form
1877 * q = floor((a + f(x))/d)
1879 * We essentially check if constraint "i" is of the form
1883 * so that we can use it to derive a lower bound on "div".
1884 * However, we allow a slightly more general form
1888 * with the condition that the coefficients of g(x) - f(x) are all
1890 * Rewriting this constraint as
1894 * adding a + f(x) to both sides and dividing by d, we obtain
1896 * (a + f(x))/d >= (a-b)/d + (f(x)-g(x))/d
1898 * Taking the floor on both sides, we obtain
1900 * q >= floor((a-b)/d) + (f(x)-g(x))/d
1904 * (g(x)-f(x))/d + ceil((b-a)/d) + q >= 0
1906 * In the case of an upper bound, we construct the constraint
1908 * (g(x)+f(x))/d + floor((b+a)/d) - q >= 0
1911 static __isl_give isl_basic_map
*insert_bounds_on_div_from_ineq(
1912 __isl_take isl_basic_map
*bmap
, int div
, int i
,
1913 unsigned total
, isl_int v
, int lb
, int ub
)
1917 for (j
= 0; (lb
|| ub
) && j
< total
+ bmap
->n_div
; ++j
) {
1919 isl_int_sub(v
, bmap
->ineq
[i
][1 + j
],
1920 bmap
->div
[div
][1 + 1 + j
]);
1921 lb
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1924 isl_int_add(v
, bmap
->ineq
[i
][1 + j
],
1925 bmap
->div
[div
][1 + 1 + j
]);
1926 ub
= isl_int_is_divisible_by(v
, bmap
->div
[div
][0]);
1932 bmap
= isl_basic_map_extend_constraints(bmap
, 0, lb
+ ub
);
1934 int k
= isl_basic_map_alloc_inequality(bmap
);
1937 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1938 isl_int_sub(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1939 bmap
->div
[div
][1 + j
]);
1940 isl_int_cdiv_q(bmap
->ineq
[k
][j
],
1941 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1943 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], 1);
1946 int k
= isl_basic_map_alloc_inequality(bmap
);
1949 for (j
= 0; j
< 1 + total
+ bmap
->n_div
; ++j
) {
1950 isl_int_add(bmap
->ineq
[k
][j
], bmap
->ineq
[i
][j
],
1951 bmap
->div
[div
][1 + j
]);
1952 isl_int_fdiv_q(bmap
->ineq
[k
][j
],
1953 bmap
->ineq
[k
][j
], bmap
->div
[div
][0]);
1955 isl_int_set_si(bmap
->ineq
[k
][1 + total
+ div
], -1);
1960 isl_basic_map_free(bmap
);
1964 /* This function is called right before "div" is eliminated from "bmap"
1965 * using Fourier-Motzkin.
1966 * Look through the constraints of "bmap" for constraints on the argument
1967 * of the integer division and use them to construct constraints on the
1968 * integer division itself. These constraints can then be combined
1969 * during the Fourier-Motzkin elimination.
1970 * Note that it is only useful to introduce lower bounds on "div"
1971 * if "bmap" already contains upper bounds on "div" as the newly
1972 * introduce lower bounds can then be combined with the pre-existing
1973 * upper bounds. Similarly for upper bounds.
1974 * We therefore first check if "bmap" contains any lower and/or upper bounds
1977 * It is interesting to note that the introduction of these constraints
1978 * can indeed lead to more accurate results, even when compared to
1979 * deriving constraints on the argument of "div" from constraints on "div".
1980 * Consider, for example, the set
1982 * { [i,j,k] : 3 + i + 2j >= 0 and 2 * [(i+2j)/4] <= k }
1984 * The second constraint can be rewritten as
1986 * 2 * [(-i-2j+3)/4] + k >= 0
1988 * from which we can derive
1990 * -i - 2j + 3 >= -2k
1996 * Combined with the first constraint, we obtain
1998 * -3 <= 3 + 2k or k >= -3
2000 * If, on the other hand we derive a constraint on [(i+2j)/4] from
2001 * the first constraint, we obtain
2003 * [(i + 2j)/4] >= [-3/4] = -1
2005 * Combining this constraint with the second constraint, we obtain
2009 static __isl_give isl_basic_map
*insert_bounds_on_div(
2010 __isl_take isl_basic_map
*bmap
, int div
)
2013 int check_lb
, check_ub
;
2020 if (isl_int_is_zero(bmap
->div
[div
][0]))
2023 total
= isl_space_dim(bmap
->dim
, isl_dim_all
);
2027 for (i
= 0; (!check_lb
|| !check_ub
) && i
< bmap
->n_ineq
; ++i
) {
2028 int s
= isl_int_sgn(bmap
->ineq
[i
][1 + total
+ div
]);
2035 if (!check_lb
&& !check_ub
)
2040 for (i
= 0; bmap
&& i
< bmap
->n_ineq
; ++i
) {
2041 if (!isl_int_is_zero(bmap
->ineq
[i
][1 + total
+ div
]))
2044 bmap
= insert_bounds_on_div_from_ineq(bmap
, div
, i
, total
, v
,
2045 check_lb
, check_ub
);
2053 /* Remove all divs (recursively) involving any of the given dimensions
2054 * in their definitions.
2056 __isl_give isl_basic_map
*isl_basic_map_remove_divs_involving_dims(
2057 __isl_take isl_basic_map
*bmap
,
2058 enum isl_dim_type type
, unsigned first
, unsigned n
)
2064 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2066 first
+= isl_basic_map_offset(bmap
, type
);
2068 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2069 if (!div_involves_vars(bmap
, i
, first
, n
))
2071 bmap
= insert_bounds_on_div(bmap
, i
);
2072 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2080 isl_basic_map_free(bmap
);
2084 __isl_give isl_basic_set
*isl_basic_set_remove_divs_involving_dims(
2085 __isl_take isl_basic_set
*bset
,
2086 enum isl_dim_type type
, unsigned first
, unsigned n
)
2088 return isl_basic_map_remove_divs_involving_dims(bset
, type
, first
, n
);
2091 __isl_give isl_map
*isl_map_remove_divs_involving_dims(__isl_take isl_map
*map
,
2092 enum isl_dim_type type
, unsigned first
, unsigned n
)
2101 map
= isl_map_cow(map
);
2105 for (i
= 0; i
< map
->n
; ++i
) {
2106 map
->p
[i
] = isl_basic_map_remove_divs_involving_dims(map
->p
[i
],
2117 __isl_give isl_set
*isl_set_remove_divs_involving_dims(__isl_take isl_set
*set
,
2118 enum isl_dim_type type
, unsigned first
, unsigned n
)
2120 return (isl_set
*)isl_map_remove_divs_involving_dims((isl_map
*)set
,
2124 /* Does the desciption of "bmap" depend on the specified dimensions?
2125 * We also check whether the dimensions appear in any of the div definitions.
2126 * In principle there is no need for this check. If the dimensions appear
2127 * in a div definition, they also appear in the defining constraints of that
2130 int isl_basic_map_involves_dims(__isl_keep isl_basic_map
*bmap
,
2131 enum isl_dim_type type
, unsigned first
, unsigned n
)
2138 if (first
+ n
> isl_basic_map_dim(bmap
, type
))
2139 isl_die(bmap
->ctx
, isl_error_invalid
,
2140 "index out of bounds", return -1);
2142 first
+= isl_basic_map_offset(bmap
, type
);
2143 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2144 if (isl_seq_first_non_zero(bmap
->eq
[i
] + first
, n
) >= 0)
2146 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2147 if (isl_seq_first_non_zero(bmap
->ineq
[i
] + first
, n
) >= 0)
2149 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2150 if (isl_int_is_zero(bmap
->div
[i
][0]))
2152 if (isl_seq_first_non_zero(bmap
->div
[i
] + 1 + first
, n
) >= 0)
2159 int isl_map_involves_dims(__isl_keep isl_map
*map
,
2160 enum isl_dim_type type
, unsigned first
, unsigned n
)
2167 if (first
+ n
> isl_map_dim(map
, type
))
2168 isl_die(map
->ctx
, isl_error_invalid
,
2169 "index out of bounds", return -1);
2171 for (i
= 0; i
< map
->n
; ++i
) {
2172 int involves
= isl_basic_map_involves_dims(map
->p
[i
],
2174 if (involves
< 0 || involves
)
2181 int isl_basic_set_involves_dims(__isl_keep isl_basic_set
*bset
,
2182 enum isl_dim_type type
, unsigned first
, unsigned n
)
2184 return isl_basic_map_involves_dims(bset
, type
, first
, n
);
2187 int isl_set_involves_dims(__isl_keep isl_set
*set
,
2188 enum isl_dim_type type
, unsigned first
, unsigned n
)
2190 return isl_map_involves_dims(set
, type
, first
, n
);
2193 /* Return true if the definition of the given div is unknown or depends
2196 static int div_is_unknown(__isl_keep isl_basic_map
*bmap
, int div
)
2199 unsigned div_offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
2201 if (isl_int_is_zero(bmap
->div
[div
][0]))
2204 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2205 if (isl_int_is_zero(bmap
->div
[div
][1 + div_offset
+ i
]))
2207 if (div_is_unknown(bmap
, i
))
2214 /* Remove all divs that are unknown or defined in terms of unknown divs.
2216 __isl_give isl_basic_map
*isl_basic_map_remove_unknown_divs(
2217 __isl_take isl_basic_map
*bmap
)
2224 for (i
= bmap
->n_div
- 1; i
>= 0; --i
) {
2225 if (!div_is_unknown(bmap
, i
))
2227 bmap
= isl_basic_map_remove_dims(bmap
, isl_dim_div
, i
, 1);
2236 /* Remove all divs that are unknown or defined in terms of unknown divs.
2238 __isl_give isl_basic_set
*isl_basic_set_remove_unknown_divs(
2239 __isl_take isl_basic_set
*bset
)
2241 return isl_basic_map_remove_unknown_divs(bset
);
2244 __isl_give isl_map
*isl_map_remove_unknown_divs(__isl_take isl_map
*map
)
2253 map
= isl_map_cow(map
);
2257 for (i
= 0; i
< map
->n
; ++i
) {
2258 map
->p
[i
] = isl_basic_map_remove_unknown_divs(map
->p
[i
]);
2268 __isl_give isl_set
*isl_set_remove_unknown_divs(__isl_take isl_set
*set
)
2270 return (isl_set
*)isl_map_remove_unknown_divs((isl_map
*)set
);
2273 __isl_give isl_basic_set
*isl_basic_set_remove_dims(
2274 __isl_take isl_basic_set
*bset
,
2275 enum isl_dim_type type
, unsigned first
, unsigned n
)
2277 return (isl_basic_set
*)
2278 isl_basic_map_remove_dims((isl_basic_map
*)bset
, type
, first
, n
);
2281 struct isl_map
*isl_map_remove_dims(struct isl_map
*map
,
2282 enum isl_dim_type type
, unsigned first
, unsigned n
)
2289 map
= isl_map_cow(map
);
2292 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2294 for (i
= 0; i
< map
->n
; ++i
) {
2295 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
2296 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
2300 map
= isl_map_drop(map
, type
, first
, n
);
2307 __isl_give isl_set
*isl_set_remove_dims(__isl_take isl_set
*bset
,
2308 enum isl_dim_type type
, unsigned first
, unsigned n
)
2310 return (isl_set
*)isl_map_remove_dims((isl_map
*)bset
, type
, first
, n
);
2313 /* Project out n inputs starting at first using Fourier-Motzkin */
2314 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
2315 unsigned first
, unsigned n
)
2317 return isl_map_remove_dims(map
, isl_dim_in
, first
, n
);
2320 static void dump_term(struct isl_basic_map
*bmap
,
2321 isl_int c
, int pos
, FILE *out
)
2324 unsigned in
= isl_basic_map_n_in(bmap
);
2325 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
2326 unsigned nparam
= isl_basic_map_n_param(bmap
);
2328 isl_int_print(out
, c
, 0);
2330 if (!isl_int_is_one(c
))
2331 isl_int_print(out
, c
, 0);
2332 if (pos
< 1 + nparam
) {
2333 name
= isl_space_get_dim_name(bmap
->dim
,
2334 isl_dim_param
, pos
- 1);
2336 fprintf(out
, "%s", name
);
2338 fprintf(out
, "p%d", pos
- 1);
2339 } else if (pos
< 1 + nparam
+ in
)
2340 fprintf(out
, "i%d", pos
- 1 - nparam
);
2341 else if (pos
< 1 + nparam
+ dim
)
2342 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
2344 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
2348 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
2349 int sign
, FILE *out
)
2353 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
2357 for (i
= 0, first
= 1; i
< len
; ++i
) {
2358 if (isl_int_sgn(c
[i
]) * sign
<= 0)
2361 fprintf(out
, " + ");
2363 isl_int_abs(v
, c
[i
]);
2364 dump_term(bmap
, v
, i
, out
);
2371 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
2372 const char *op
, FILE *out
, int indent
)
2376 fprintf(out
, "%*s", indent
, "");
2378 dump_constraint_sign(bmap
, c
, 1, out
);
2379 fprintf(out
, " %s ", op
);
2380 dump_constraint_sign(bmap
, c
, -1, out
);
2384 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
2385 if (isl_int_is_zero(c
[1+isl_space_dim(bmap
->dim
, isl_dim_all
)+i
]))
2387 fprintf(out
, "%*s", indent
, "");
2388 fprintf(out
, "ERROR: unused div coefficient not zero\n");
2393 static void dump_constraints(struct isl_basic_map
*bmap
,
2394 isl_int
**c
, unsigned n
,
2395 const char *op
, FILE *out
, int indent
)
2399 for (i
= 0; i
< n
; ++i
)
2400 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
2403 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
2407 unsigned total
= isl_basic_map_total_dim(bmap
);
2409 for (j
= 0; j
< 1 + total
; ++j
) {
2410 if (isl_int_is_zero(exp
[j
]))
2412 if (!first
&& isl_int_is_pos(exp
[j
]))
2414 dump_term(bmap
, exp
[j
], j
, out
);
2419 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
2423 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
2424 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
2426 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2427 fprintf(out
, "%*s", indent
, "");
2428 fprintf(out
, "e%d = [(", i
);
2429 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
2431 isl_int_print(out
, bmap
->div
[i
][0], 0);
2432 fprintf(out
, "]\n");
2436 void isl_basic_set_print_internal(struct isl_basic_set
*bset
,
2437 FILE *out
, int indent
)
2440 fprintf(out
, "null basic set\n");
2444 fprintf(out
, "%*s", indent
, "");
2445 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
2446 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
2447 bset
->extra
, bset
->flags
);
2448 dump((struct isl_basic_map
*)bset
, out
, indent
);
2451 void isl_basic_map_print_internal(struct isl_basic_map
*bmap
,
2452 FILE *out
, int indent
)
2455 fprintf(out
, "null basic map\n");
2459 fprintf(out
, "%*s", indent
, "");
2460 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
2461 "flags: %x, n_name: %d\n",
2463 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
2464 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_id
);
2465 dump(bmap
, out
, indent
);
2468 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
2473 total
= isl_basic_map_total_dim(bmap
);
2474 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
2475 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
2476 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
2477 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2481 __isl_give isl_set
*isl_set_alloc_space(__isl_take isl_space
*dim
, int n
,
2484 struct isl_set
*set
;
2488 isl_assert(dim
->ctx
, dim
->n_in
== 0, goto error
);
2489 isl_assert(dim
->ctx
, n
>= 0, goto error
);
2490 set
= isl_alloc(dim
->ctx
, struct isl_set
,
2491 sizeof(struct isl_set
) +
2492 (n
- 1) * sizeof(struct isl_basic_set
*));
2496 set
->ctx
= dim
->ctx
;
2497 isl_ctx_ref(set
->ctx
);
2505 isl_space_free(dim
);
2509 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
2510 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
2512 struct isl_set
*set
;
2515 dims
= isl_space_alloc(ctx
, nparam
, 0, dim
);
2519 set
= isl_set_alloc_space(dims
, n
, flags
);
2523 /* Make sure "map" has room for at least "n" more basic maps.
2525 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
2528 struct isl_map
*grown
= NULL
;
2532 isl_assert(map
->ctx
, n
>= 0, goto error
);
2533 if (map
->n
+ n
<= map
->size
)
2535 grown
= isl_map_alloc_space(isl_map_get_space(map
), map
->n
+ n
, map
->flags
);
2538 for (i
= 0; i
< map
->n
; ++i
) {
2539 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
2547 isl_map_free(grown
);
2552 /* Make sure "set" has room for at least "n" more basic sets.
2554 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
2556 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
2559 struct isl_set
*isl_set_dup(struct isl_set
*set
)
2562 struct isl_set
*dup
;
2567 dup
= isl_set_alloc_space(isl_space_copy(set
->dim
), set
->n
, set
->flags
);
2570 for (i
= 0; i
< set
->n
; ++i
)
2571 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
2575 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
2577 return isl_map_from_basic_map(bset
);
2580 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
2582 struct isl_map
*map
;
2587 map
= isl_map_alloc_space(isl_space_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
2588 return isl_map_add_basic_map(map
, bmap
);
2591 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
2592 __isl_take isl_basic_set
*bset
)
2594 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
2595 (struct isl_basic_map
*)bset
);
2598 void *isl_set_free(__isl_take isl_set
*set
)
2608 isl_ctx_deref(set
->ctx
);
2609 for (i
= 0; i
< set
->n
; ++i
)
2610 isl_basic_set_free(set
->p
[i
]);
2611 isl_space_free(set
->dim
);
2617 void isl_set_print_internal(struct isl_set
*set
, FILE *out
, int indent
)
2622 fprintf(out
, "null set\n");
2626 fprintf(out
, "%*s", indent
, "");
2627 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2628 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
2630 for (i
= 0; i
< set
->n
; ++i
) {
2631 fprintf(out
, "%*s", indent
, "");
2632 fprintf(out
, "basic set %d:\n", i
);
2633 isl_basic_set_print_internal(set
->p
[i
], out
, indent
+4);
2637 void isl_map_print_internal(struct isl_map
*map
, FILE *out
, int indent
)
2642 fprintf(out
, "null map\n");
2646 fprintf(out
, "%*s", indent
, "");
2647 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2648 "flags: %x, n_name: %d\n",
2649 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
2650 map
->dim
->n_out
, map
->flags
, map
->dim
->n_id
);
2651 for (i
= 0; i
< map
->n
; ++i
) {
2652 fprintf(out
, "%*s", indent
, "");
2653 fprintf(out
, "basic map %d:\n", i
);
2654 isl_basic_map_print_internal(map
->p
[i
], out
, indent
+4);
2658 struct isl_basic_map
*isl_basic_map_intersect_domain(
2659 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2661 struct isl_basic_map
*bmap_domain
;
2666 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2667 bset
->dim
, isl_dim_param
), goto error
);
2669 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2670 isl_assert(bset
->ctx
,
2671 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
2673 bmap
= isl_basic_map_cow(bmap
);
2676 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2677 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2678 bmap_domain
= isl_basic_map_from_domain(bset
);
2679 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
2681 bmap
= isl_basic_map_simplify(bmap
);
2682 return isl_basic_map_finalize(bmap
);
2684 isl_basic_map_free(bmap
);
2685 isl_basic_set_free(bset
);
2689 struct isl_basic_map
*isl_basic_map_intersect_range(
2690 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
2692 struct isl_basic_map
*bmap_range
;
2697 isl_assert(bset
->ctx
, isl_space_match(bmap
->dim
, isl_dim_param
,
2698 bset
->dim
, isl_dim_param
), goto error
);
2700 if (isl_space_dim(bset
->dim
, isl_dim_set
) != 0)
2701 isl_assert(bset
->ctx
,
2702 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
2704 if (isl_basic_set_is_universe(bset
)) {
2705 isl_basic_set_free(bset
);
2709 bmap
= isl_basic_map_cow(bmap
);
2712 bmap
= isl_basic_map_extend_space(bmap
, isl_space_copy(bmap
->dim
),
2713 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
2714 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_space_copy(bset
->dim
));
2715 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
2717 bmap
= isl_basic_map_simplify(bmap
);
2718 return isl_basic_map_finalize(bmap
);
2720 isl_basic_map_free(bmap
);
2721 isl_basic_set_free(bset
);
2725 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
2734 total
= 1 + isl_basic_map_total_dim(bmap
);
2735 if (total
!= vec
->size
)
2740 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
2741 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
2742 if (!isl_int_is_zero(s
)) {
2748 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
2749 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
2750 if (isl_int_is_neg(s
)) {
2761 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
2763 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
2766 struct isl_basic_map
*isl_basic_map_intersect(
2767 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2769 struct isl_vec
*sample
= NULL
;
2771 if (!bmap1
|| !bmap2
)
2774 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
2775 bmap2
->dim
, isl_dim_param
), goto error
);
2776 if (isl_space_dim(bmap1
->dim
, isl_dim_all
) ==
2777 isl_space_dim(bmap1
->dim
, isl_dim_param
) &&
2778 isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2779 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2780 return isl_basic_map_intersect(bmap2
, bmap1
);
2782 if (isl_space_dim(bmap2
->dim
, isl_dim_all
) !=
2783 isl_space_dim(bmap2
->dim
, isl_dim_param
))
2784 isl_assert(bmap1
->ctx
,
2785 isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
2787 if (bmap1
->sample
&&
2788 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
2789 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
2790 sample
= isl_vec_copy(bmap1
->sample
);
2791 else if (bmap2
->sample
&&
2792 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
2793 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
2794 sample
= isl_vec_copy(bmap2
->sample
);
2796 bmap1
= isl_basic_map_cow(bmap1
);
2799 bmap1
= isl_basic_map_extend_space(bmap1
, isl_space_copy(bmap1
->dim
),
2800 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
2801 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
2804 isl_vec_free(sample
);
2806 isl_vec_free(bmap1
->sample
);
2807 bmap1
->sample
= sample
;
2810 bmap1
= isl_basic_map_simplify(bmap1
);
2811 return isl_basic_map_finalize(bmap1
);
2814 isl_vec_free(sample
);
2815 isl_basic_map_free(bmap1
);
2816 isl_basic_map_free(bmap2
);
2820 struct isl_basic_set
*isl_basic_set_intersect(
2821 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
2823 return (struct isl_basic_set
*)
2824 isl_basic_map_intersect(
2825 (struct isl_basic_map
*)bset1
,
2826 (struct isl_basic_map
*)bset2
);
2829 __isl_give isl_basic_set
*isl_basic_set_intersect_params(
2830 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
2832 return isl_basic_set_intersect(bset1
, bset2
);
2835 /* Special case of isl_map_intersect, where both map1 and map2
2836 * are convex, without any divs and such that either map1 or map2
2837 * contains a single constraint. This constraint is then simply
2838 * added to the other map.
2840 static __isl_give isl_map
*map_intersect_add_constraint(
2841 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2843 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2844 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2845 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2846 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2848 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2849 return isl_map_intersect(map2
, map1
);
2851 isl_assert(map2
->ctx
,
2852 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2854 map1
= isl_map_cow(map1
);
2857 if (isl_map_plain_is_empty(map1
)) {
2861 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2862 if (map2
->p
[0]->n_eq
== 1)
2863 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2865 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2866 map2
->p
[0]->ineq
[0]);
2868 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2869 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2873 if (isl_basic_map_plain_is_empty(map1
->p
[0])) {
2874 isl_basic_map_free(map1
->p
[0]);
2887 /* map2 may be either a parameter domain or a map living in the same
2890 static __isl_give isl_map
*map_intersect_internal(__isl_take isl_map
*map1
,
2891 __isl_take isl_map
*map2
)
2900 if ((isl_map_plain_is_empty(map1
) ||
2901 isl_map_plain_is_universe(map2
)) &&
2902 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2906 if ((isl_map_plain_is_empty(map2
) ||
2907 isl_map_plain_is_universe(map1
)) &&
2908 isl_space_is_equal(map1
->dim
, map2
->dim
)) {
2913 if (map1
->n
== 1 && map2
->n
== 1 &&
2914 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2915 isl_space_is_equal(map1
->dim
, map2
->dim
) &&
2916 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2917 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2918 return map_intersect_add_constraint(map1
, map2
);
2920 if (isl_space_dim(map2
->dim
, isl_dim_all
) !=
2921 isl_space_dim(map2
->dim
, isl_dim_param
))
2922 isl_assert(map1
->ctx
,
2923 isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
2925 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2926 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2927 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2929 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
2930 map1
->n
* map2
->n
, flags
);
2933 for (i
= 0; i
< map1
->n
; ++i
)
2934 for (j
= 0; j
< map2
->n
; ++j
) {
2935 struct isl_basic_map
*part
;
2936 part
= isl_basic_map_intersect(
2937 isl_basic_map_copy(map1
->p
[i
]),
2938 isl_basic_map_copy(map2
->p
[j
]));
2939 if (isl_basic_map_is_empty(part
) < 0)
2940 part
= isl_basic_map_free(part
);
2941 result
= isl_map_add_basic_map(result
, part
);
2954 static __isl_give isl_map
*map_intersect(__isl_take isl_map
*map1
,
2955 __isl_take isl_map
*map2
)
2959 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
2960 isl_die(isl_map_get_ctx(map1
), isl_error_invalid
,
2961 "spaces don't match", goto error
);
2962 return map_intersect_internal(map1
, map2
);
2969 __isl_give isl_map
*isl_map_intersect(__isl_take isl_map
*map1
,
2970 __isl_take isl_map
*map2
)
2972 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect
);
2975 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2977 return (struct isl_set
*)
2978 isl_map_intersect((struct isl_map
*)set1
,
2979 (struct isl_map
*)set2
);
2982 /* map_intersect_internal accepts intersections
2983 * with parameter domains, so we can just call that function.
2985 static __isl_give isl_map
*map_intersect_params(__isl_take isl_map
*map
,
2986 __isl_take isl_set
*params
)
2988 return map_intersect_internal(map
, params
);
2991 __isl_give isl_map
*isl_map_intersect_params(__isl_take isl_map
*map1
,
2992 __isl_take isl_map
*map2
)
2994 return isl_map_align_params_map_map_and(map1
, map2
, &map_intersect_params
);
2997 __isl_give isl_set
*isl_set_intersect_params(__isl_take isl_set
*set
,
2998 __isl_take isl_set
*params
)
3000 return isl_map_intersect_params(set
, params
);
3003 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
3006 struct isl_basic_set
*bset
;
3011 bmap
= isl_basic_map_cow(bmap
);
3014 dim
= isl_space_reverse(isl_space_copy(bmap
->dim
));
3015 in
= isl_basic_map_n_in(bmap
);
3016 bset
= isl_basic_set_from_basic_map(bmap
);
3017 bset
= isl_basic_set_swap_vars(bset
, in
);
3018 return isl_basic_map_from_basic_set(bset
, dim
);
3021 static __isl_give isl_basic_map
*basic_map_space_reset(
3022 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
)
3028 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
3031 space
= isl_basic_map_get_space(bmap
);
3032 space
= isl_space_reset(space
, type
);
3033 bmap
= isl_basic_map_reset_space(bmap
, space
);
3037 __isl_give isl_basic_map
*isl_basic_map_insert_dims(
3038 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
3039 unsigned pos
, unsigned n
)
3042 struct isl_basic_map
*res
;
3043 struct isl_dim_map
*dim_map
;
3044 unsigned total
, off
;
3045 enum isl_dim_type t
;
3048 return basic_map_space_reset(bmap
, type
);
3053 res_dim
= isl_space_insert_dims(isl_basic_map_get_space(bmap
), type
, pos
, n
);
3055 total
= isl_basic_map_total_dim(bmap
) + n
;
3056 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3058 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3060 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3062 unsigned size
= isl_basic_map_dim(bmap
, t
);
3063 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3065 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3066 pos
, size
- pos
, off
+ pos
+ n
);
3068 off
+= isl_space_dim(res_dim
, t
);
3070 isl_dim_map_div(dim_map
, bmap
, off
);
3072 res
= isl_basic_map_alloc_space(res_dim
,
3073 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3074 if (isl_basic_map_is_rational(bmap
))
3075 res
= isl_basic_map_set_rational(res
);
3076 if (isl_basic_map_plain_is_empty(bmap
)) {
3077 isl_basic_map_free(bmap
);
3079 return isl_basic_map_set_to_empty(res
);
3081 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3082 return isl_basic_map_finalize(res
);
3085 __isl_give isl_basic_set
*isl_basic_set_insert_dims(
3086 __isl_take isl_basic_set
*bset
,
3087 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3089 return isl_basic_map_insert_dims(bset
, type
, pos
, n
);
3092 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
3093 enum isl_dim_type type
, unsigned n
)
3097 return isl_basic_map_insert_dims(bmap
, type
,
3098 isl_basic_map_dim(bmap
, type
), n
);
3101 __isl_give isl_basic_set
*isl_basic_set_add_dims(__isl_take isl_basic_set
*bset
,
3102 enum isl_dim_type type
, unsigned n
)
3106 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
3107 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
3109 isl_basic_set_free(bset
);
3113 static __isl_give isl_map
*map_space_reset(__isl_take isl_map
*map
,
3114 enum isl_dim_type type
)
3118 if (!map
|| !isl_space_is_named_or_nested(map
->dim
, type
))
3121 space
= isl_map_get_space(map
);
3122 space
= isl_space_reset(space
, type
);
3123 map
= isl_map_reset_space(map
, space
);
3127 __isl_give isl_map
*isl_map_insert_dims(__isl_take isl_map
*map
,
3128 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3133 return map_space_reset(map
, type
);
3135 map
= isl_map_cow(map
);
3139 map
->dim
= isl_space_insert_dims(map
->dim
, type
, pos
, n
);
3143 for (i
= 0; i
< map
->n
; ++i
) {
3144 map
->p
[i
] = isl_basic_map_insert_dims(map
->p
[i
], type
, pos
, n
);
3155 __isl_give isl_set
*isl_set_insert_dims(__isl_take isl_set
*set
,
3156 enum isl_dim_type type
, unsigned pos
, unsigned n
)
3158 return isl_map_insert_dims(set
, type
, pos
, n
);
3161 __isl_give isl_map
*isl_map_add_dims(__isl_take isl_map
*map
,
3162 enum isl_dim_type type
, unsigned n
)
3166 return isl_map_insert_dims(map
, type
, isl_map_dim(map
, type
), n
);
3169 __isl_give isl_set
*isl_set_add_dims(__isl_take isl_set
*set
,
3170 enum isl_dim_type type
, unsigned n
)
3174 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
3175 return (isl_set
*)isl_map_add_dims((isl_map
*)set
, type
, n
);
3181 __isl_give isl_basic_map
*isl_basic_map_move_dims(
3182 __isl_take isl_basic_map
*bmap
,
3183 enum isl_dim_type dst_type
, unsigned dst_pos
,
3184 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3186 struct isl_dim_map
*dim_map
;
3187 struct isl_basic_map
*res
;
3188 enum isl_dim_type t
;
3189 unsigned total
, off
;
3196 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
3199 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3202 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
3204 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
3205 pos(bmap
->dim
, src_type
) + src_pos
+
3206 ((src_type
< dst_type
) ? n
: 0)) {
3207 bmap
= isl_basic_map_cow(bmap
);
3211 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3212 src_type
, src_pos
, n
);
3216 bmap
= isl_basic_map_finalize(bmap
);
3221 total
= isl_basic_map_total_dim(bmap
);
3222 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3225 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3226 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3227 if (t
== dst_type
) {
3228 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3231 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
3234 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3235 dst_pos
, size
- dst_pos
, off
);
3236 off
+= size
- dst_pos
;
3237 } else if (t
== src_type
) {
3238 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3241 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3242 src_pos
+ n
, size
- src_pos
- n
, off
);
3243 off
+= size
- src_pos
- n
;
3245 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3249 isl_dim_map_div(dim_map
, bmap
, off
);
3251 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3252 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3253 bmap
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3257 bmap
->dim
= isl_space_move_dims(bmap
->dim
, dst_type
, dst_pos
,
3258 src_type
, src_pos
, n
);
3262 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
3263 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3264 bmap
= isl_basic_map_finalize(bmap
);
3268 isl_basic_map_free(bmap
);
3272 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
3273 enum isl_dim_type dst_type
, unsigned dst_pos
,
3274 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3276 return (isl_basic_set
*)isl_basic_map_move_dims(
3277 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3280 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
3281 enum isl_dim_type dst_type
, unsigned dst_pos
,
3282 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3286 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
3287 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
3288 src_type
, src_pos
, n
);
3294 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
3295 enum isl_dim_type dst_type
, unsigned dst_pos
,
3296 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
3305 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
3308 if (dst_type
== src_type
&& dst_pos
== src_pos
)
3311 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
3313 map
= isl_map_cow(map
);
3317 map
->dim
= isl_space_move_dims(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
3321 for (i
= 0; i
< map
->n
; ++i
) {
3322 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
3324 src_type
, src_pos
, n
);
3335 /* Move the specified dimensions to the last columns right before
3336 * the divs. Don't change the dimension specification of bmap.
3337 * That's the responsibility of the caller.
3339 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
3340 enum isl_dim_type type
, unsigned first
, unsigned n
)
3342 struct isl_dim_map
*dim_map
;
3343 struct isl_basic_map
*res
;
3344 enum isl_dim_type t
;
3345 unsigned total
, off
;
3349 if (pos(bmap
->dim
, type
) + first
+ n
==
3350 1 + isl_space_dim(bmap
->dim
, isl_dim_all
))
3353 total
= isl_basic_map_total_dim(bmap
);
3354 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3357 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
3358 unsigned size
= isl_space_dim(bmap
->dim
, t
);
3360 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3363 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3364 first
, n
, total
- bmap
->n_div
- n
);
3365 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
3366 first
+ n
, size
- (first
+ n
), off
);
3367 off
+= size
- (first
+ n
);
3369 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
3373 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
3375 res
= isl_basic_map_alloc_space(isl_basic_map_get_space(bmap
),
3376 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
3377 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
3381 /* Insert "n" rows in the divs of "bmap".
3383 * The number of columns is not changed, which means that the last
3384 * dimensions of "bmap" are being reintepreted as the new divs.
3385 * The space of "bmap" is not adjusted, however, which means
3386 * that "bmap" is left in an inconsistent state. Removing "n" dimensions
3387 * from the space of "bmap" is the responsibility of the caller.
3389 static __isl_give isl_basic_map
*insert_div_rows(__isl_take isl_basic_map
*bmap
,
3397 bmap
= isl_basic_map_cow(bmap
);
3401 row_size
= 1 + isl_space_dim(bmap
->dim
, isl_dim_all
) + bmap
->extra
;
3402 old
= bmap
->block2
.data
;
3403 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
3404 (bmap
->extra
+ n
) * (1 + row_size
));
3405 if (!bmap
->block2
.data
)
3406 return isl_basic_map_free(bmap
);
3407 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
3409 return isl_basic_map_free(bmap
);
3410 for (i
= 0; i
< n
; ++i
) {
3411 new_div
[i
] = bmap
->block2
.data
+
3412 (bmap
->extra
+ i
) * (1 + row_size
);
3413 isl_seq_clr(new_div
[i
], 1 + row_size
);
3415 for (i
= 0; i
< bmap
->extra
; ++i
)
3416 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
3418 bmap
->div
= new_div
;
3425 /* Turn the n dimensions of type type, starting at first
3426 * into existentially quantified variables.
3428 __isl_give isl_basic_map
*isl_basic_map_project_out(
3429 __isl_take isl_basic_map
*bmap
,
3430 enum isl_dim_type type
, unsigned first
, unsigned n
)
3433 return basic_map_space_reset(bmap
, type
);
3438 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
3439 return isl_basic_map_remove_dims(bmap
, type
, first
, n
);
3441 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
3444 bmap
= move_last(bmap
, type
, first
, n
);
3445 bmap
= isl_basic_map_cow(bmap
);
3446 bmap
= insert_div_rows(bmap
, n
);
3450 bmap
->dim
= isl_space_drop_dims(bmap
->dim
, type
, first
, n
);
3453 bmap
= isl_basic_map_simplify(bmap
);
3454 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3455 return isl_basic_map_finalize(bmap
);
3457 isl_basic_map_free(bmap
);
3461 /* Turn the n dimensions of type type, starting at first
3462 * into existentially quantified variables.
3464 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
3465 enum isl_dim_type type
, unsigned first
, unsigned n
)
3467 return (isl_basic_set
*)isl_basic_map_project_out(
3468 (isl_basic_map
*)bset
, type
, first
, n
);
3471 /* Turn the n dimensions of type type, starting at first
3472 * into existentially quantified variables.
3474 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
3475 enum isl_dim_type type
, unsigned first
, unsigned n
)
3483 return map_space_reset(map
, type
);
3485 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
3487 map
= isl_map_cow(map
);
3491 map
->dim
= isl_space_drop_dims(map
->dim
, type
, first
, n
);
3495 for (i
= 0; i
< map
->n
; ++i
) {
3496 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
3507 /* Turn the n dimensions of type type, starting at first
3508 * into existentially quantified variables.
3510 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
3511 enum isl_dim_type type
, unsigned first
, unsigned n
)
3513 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
3516 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
3520 for (i
= 0; i
< n
; ++i
) {
3521 j
= isl_basic_map_alloc_div(bmap
);
3524 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
3528 isl_basic_map_free(bmap
);
3532 struct isl_basic_map
*isl_basic_map_apply_range(
3533 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3535 isl_space
*dim_result
= NULL
;
3536 struct isl_basic_map
*bmap
;
3537 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
3538 struct isl_dim_map
*dim_map1
, *dim_map2
;
3540 if (!bmap1
|| !bmap2
)
3542 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
3543 bmap2
->dim
, isl_dim_param
))
3544 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3545 "parameters don't match", goto error
);
3546 if (!isl_space_tuple_match(bmap1
->dim
, isl_dim_out
,
3547 bmap2
->dim
, isl_dim_in
))
3548 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
3549 "spaces don't match", goto error
);
3551 dim_result
= isl_space_join(isl_space_copy(bmap1
->dim
),
3552 isl_space_copy(bmap2
->dim
));
3554 n_in
= isl_basic_map_n_in(bmap1
);
3555 n_out
= isl_basic_map_n_out(bmap2
);
3556 n
= isl_basic_map_n_out(bmap1
);
3557 nparam
= isl_basic_map_n_param(bmap1
);
3559 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
3560 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3561 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3562 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3563 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
3564 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3565 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
3566 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
3567 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3568 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3569 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3571 bmap
= isl_basic_map_alloc_space(dim_result
,
3572 bmap1
->n_div
+ bmap2
->n_div
+ n
,
3573 bmap1
->n_eq
+ bmap2
->n_eq
,
3574 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3575 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3576 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3577 bmap
= add_divs(bmap
, n
);
3578 bmap
= isl_basic_map_simplify(bmap
);
3579 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3580 return isl_basic_map_finalize(bmap
);
3582 isl_basic_map_free(bmap1
);
3583 isl_basic_map_free(bmap2
);
3587 struct isl_basic_set
*isl_basic_set_apply(
3588 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
3593 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
3596 return (struct isl_basic_set
*)
3597 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
3599 isl_basic_set_free(bset
);
3600 isl_basic_map_free(bmap
);
3604 struct isl_basic_map
*isl_basic_map_apply_domain(
3605 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3607 if (!bmap1
|| !bmap2
)
3610 isl_assert(bmap1
->ctx
,
3611 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
3612 isl_assert(bmap1
->ctx
,
3613 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
3616 bmap1
= isl_basic_map_reverse(bmap1
);
3617 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
3618 return isl_basic_map_reverse(bmap1
);
3620 isl_basic_map_free(bmap1
);
3621 isl_basic_map_free(bmap2
);
3625 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
3626 * A \cap B -> f(A) + f(B)
3628 struct isl_basic_map
*isl_basic_map_sum(
3629 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3631 unsigned n_in
, n_out
, nparam
, total
, pos
;
3632 struct isl_basic_map
*bmap
= NULL
;
3633 struct isl_dim_map
*dim_map1
, *dim_map2
;
3636 if (!bmap1
|| !bmap2
)
3639 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
),
3642 nparam
= isl_basic_map_n_param(bmap1
);
3643 n_in
= isl_basic_map_n_in(bmap1
);
3644 n_out
= isl_basic_map_n_out(bmap1
);
3646 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
3647 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
3648 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
3649 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
3650 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
3651 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
3652 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
3653 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
3654 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
3655 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
3656 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
3658 bmap
= isl_basic_map_alloc_space(isl_space_copy(bmap1
->dim
),
3659 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
3660 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
3661 bmap1
->n_ineq
+ bmap2
->n_ineq
);
3662 for (i
= 0; i
< n_out
; ++i
) {
3663 int j
= isl_basic_map_alloc_equality(bmap
);
3666 isl_seq_clr(bmap
->eq
[j
], 1+total
);
3667 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
3668 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
3669 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
3671 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
3672 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
3673 bmap
= add_divs(bmap
, 2 * n_out
);
3675 bmap
= isl_basic_map_simplify(bmap
);
3676 return isl_basic_map_finalize(bmap
);
3678 isl_basic_map_free(bmap
);
3679 isl_basic_map_free(bmap1
);
3680 isl_basic_map_free(bmap2
);
3684 /* Given two maps A -> f(A) and B -> g(B), construct a map
3685 * A \cap B -> f(A) + f(B)
3687 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
3689 struct isl_map
*result
;
3695 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
3697 result
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
3698 map1
->n
* map2
->n
, 0);
3701 for (i
= 0; i
< map1
->n
; ++i
)
3702 for (j
= 0; j
< map2
->n
; ++j
) {
3703 struct isl_basic_map
*part
;
3704 part
= isl_basic_map_sum(
3705 isl_basic_map_copy(map1
->p
[i
]),
3706 isl_basic_map_copy(map2
->p
[j
]));
3707 if (isl_basic_map_is_empty(part
))
3708 isl_basic_map_free(part
);
3710 result
= isl_map_add_basic_map(result
, part
);
3723 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
3724 __isl_take isl_set
*set2
)
3726 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
3729 /* Given a basic map A -> f(A), construct A -> -f(A).
3731 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
3736 bmap
= isl_basic_map_cow(bmap
);
3740 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
3741 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
3742 for (i
= 0; i
< bmap
->n_eq
; ++i
)
3743 for (j
= 0; j
< n
; ++j
)
3744 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
3745 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
3746 for (j
= 0; j
< n
; ++j
)
3747 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
3748 for (i
= 0; i
< bmap
->n_div
; ++i
)
3749 for (j
= 0; j
< n
; ++j
)
3750 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
3751 bmap
= isl_basic_map_gauss(bmap
, NULL
);
3752 return isl_basic_map_finalize(bmap
);
3755 __isl_give isl_basic_set
*isl_basic_set_neg(__isl_take isl_basic_set
*bset
)
3757 return isl_basic_map_neg(bset
);
3760 /* Given a map A -> f(A), construct A -> -f(A).
3762 struct isl_map
*isl_map_neg(struct isl_map
*map
)
3766 map
= isl_map_cow(map
);
3770 for (i
= 0; i
< map
->n
; ++i
) {
3771 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
3782 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
3784 return (isl_set
*)isl_map_neg((isl_map
*)set
);
3787 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3788 * A -> floor(f(A)/d).
3790 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
3793 unsigned n_in
, n_out
, nparam
, total
, pos
;
3794 struct isl_basic_map
*result
= NULL
;
3795 struct isl_dim_map
*dim_map
;
3801 nparam
= isl_basic_map_n_param(bmap
);
3802 n_in
= isl_basic_map_n_in(bmap
);
3803 n_out
= isl_basic_map_n_out(bmap
);
3805 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
3806 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
3807 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
3808 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
3809 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
3810 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
3812 result
= isl_basic_map_alloc_space(isl_space_copy(bmap
->dim
),
3813 bmap
->n_div
+ n_out
,
3814 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
3815 result
= isl_basic_map_add_constraints_dim_map(result
, bmap
, dim_map
);
3816 result
= add_divs(result
, n_out
);
3817 for (i
= 0; i
< n_out
; ++i
) {
3819 j
= isl_basic_map_alloc_inequality(result
);
3822 isl_seq_clr(result
->ineq
[j
], 1+total
);
3823 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3824 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
3825 j
= isl_basic_map_alloc_inequality(result
);
3828 isl_seq_clr(result
->ineq
[j
], 1+total
);
3829 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
3830 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
3831 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
3834 result
= isl_basic_map_simplify(result
);
3835 return isl_basic_map_finalize(result
);
3837 isl_basic_map_free(result
);
3841 /* Given a map A -> f(A) and an integer d, construct a map
3842 * A -> floor(f(A)/d).
3844 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
3848 map
= isl_map_cow(map
);
3852 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
3853 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3854 for (i
= 0; i
< map
->n
; ++i
) {
3855 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
3866 /* Given a map A -> f(A) and an integer d, construct a map
3867 * A -> floor(f(A)/d).
3869 __isl_give isl_map
*isl_map_floordiv_val(__isl_take isl_map
*map
,
3870 __isl_take isl_val
*d
)
3874 if (!isl_val_is_int(d
))
3875 isl_die(isl_val_get_ctx(d
), isl_error_invalid
,
3876 "expecting integer denominator", goto error
);
3877 map
= isl_map_floordiv(map
, d
->n
);
3886 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
3892 i
= isl_basic_map_alloc_equality(bmap
);
3895 nparam
= isl_basic_map_n_param(bmap
);
3896 n_in
= isl_basic_map_n_in(bmap
);
3897 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3898 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
3899 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
3900 return isl_basic_map_finalize(bmap
);
3902 isl_basic_map_free(bmap
);
3906 /* Add a constraints to "bmap" expressing i_pos < o_pos
3908 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
3914 i
= isl_basic_map_alloc_inequality(bmap
);
3917 nparam
= isl_basic_map_n_param(bmap
);
3918 n_in
= isl_basic_map_n_in(bmap
);
3919 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3920 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3921 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3922 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3923 return isl_basic_map_finalize(bmap
);
3925 isl_basic_map_free(bmap
);
3929 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3931 static __isl_give isl_basic_map
*var_less_or_equal(
3932 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3938 i
= isl_basic_map_alloc_inequality(bmap
);
3941 nparam
= isl_basic_map_n_param(bmap
);
3942 n_in
= isl_basic_map_n_in(bmap
);
3943 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3944 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
3945 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
3946 return isl_basic_map_finalize(bmap
);
3948 isl_basic_map_free(bmap
);
3952 /* Add a constraints to "bmap" expressing i_pos > o_pos
3954 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
3960 i
= isl_basic_map_alloc_inequality(bmap
);
3963 nparam
= isl_basic_map_n_param(bmap
);
3964 n_in
= isl_basic_map_n_in(bmap
);
3965 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3966 isl_int_set_si(bmap
->ineq
[i
][0], -1);
3967 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3968 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3969 return isl_basic_map_finalize(bmap
);
3971 isl_basic_map_free(bmap
);
3975 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3977 static __isl_give isl_basic_map
*var_more_or_equal(
3978 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3984 i
= isl_basic_map_alloc_inequality(bmap
);
3987 nparam
= isl_basic_map_n_param(bmap
);
3988 n_in
= isl_basic_map_n_in(bmap
);
3989 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3990 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3991 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3992 return isl_basic_map_finalize(bmap
);
3994 isl_basic_map_free(bmap
);
3998 __isl_give isl_basic_map
*isl_basic_map_equal(
3999 __isl_take isl_space
*dim
, unsigned n_equal
)
4002 struct isl_basic_map
*bmap
;
4003 bmap
= isl_basic_map_alloc_space(dim
, 0, n_equal
, 0);
4006 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
4007 bmap
= var_equal(bmap
, i
);
4008 return isl_basic_map_finalize(bmap
);
4011 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
4013 __isl_give isl_basic_map
*isl_basic_map_less_at(__isl_take isl_space
*dim
,
4017 struct isl_basic_map
*bmap
;
4018 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4021 for (i
= 0; i
< pos
&& bmap
; ++i
)
4022 bmap
= var_equal(bmap
, i
);
4024 bmap
= var_less(bmap
, pos
);
4025 return isl_basic_map_finalize(bmap
);
4028 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
4030 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
4031 __isl_take isl_space
*dim
, unsigned pos
)
4034 isl_basic_map
*bmap
;
4036 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4037 for (i
= 0; i
< pos
; ++i
)
4038 bmap
= var_equal(bmap
, i
);
4039 bmap
= var_less_or_equal(bmap
, pos
);
4040 return isl_basic_map_finalize(bmap
);
4043 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
4045 __isl_give isl_basic_map
*isl_basic_map_more_at(__isl_take isl_space
*dim
,
4049 struct isl_basic_map
*bmap
;
4050 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4053 for (i
= 0; i
< pos
&& bmap
; ++i
)
4054 bmap
= var_equal(bmap
, i
);
4056 bmap
= var_more(bmap
, pos
);
4057 return isl_basic_map_finalize(bmap
);
4060 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
4062 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
4063 __isl_take isl_space
*dim
, unsigned pos
)
4066 isl_basic_map
*bmap
;
4068 bmap
= isl_basic_map_alloc_space(dim
, 0, pos
, 1);
4069 for (i
= 0; i
< pos
; ++i
)
4070 bmap
= var_equal(bmap
, i
);
4071 bmap
= var_more_or_equal(bmap
, pos
);
4072 return isl_basic_map_finalize(bmap
);
4075 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_space
*dims
,
4076 unsigned n
, int equal
)
4078 struct isl_map
*map
;
4081 if (n
== 0 && equal
)
4082 return isl_map_universe(dims
);
4084 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4086 for (i
= 0; i
+ 1 < n
; ++i
)
4087 map
= isl_map_add_basic_map(map
,
4088 isl_basic_map_less_at(isl_space_copy(dims
), i
));
4091 map
= isl_map_add_basic_map(map
,
4092 isl_basic_map_less_or_equal_at(dims
, n
- 1));
4094 map
= isl_map_add_basic_map(map
,
4095 isl_basic_map_less_at(dims
, n
- 1));
4097 isl_space_free(dims
);
4102 static __isl_give isl_map
*map_lex_lte(__isl_take isl_space
*dims
, int equal
)
4106 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
4109 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_space
*dim
, unsigned n
)
4111 return map_lex_lte_first(dim
, n
, 0);
4114 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_space
*dim
, unsigned n
)
4116 return map_lex_lte_first(dim
, n
, 1);
4119 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_space
*set_dim
)
4121 return map_lex_lte(isl_space_map_from_set(set_dim
), 0);
4124 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_space
*set_dim
)
4126 return map_lex_lte(isl_space_map_from_set(set_dim
), 1);
4129 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_space
*dims
,
4130 unsigned n
, int equal
)
4132 struct isl_map
*map
;
4135 if (n
== 0 && equal
)
4136 return isl_map_universe(dims
);
4138 map
= isl_map_alloc_space(isl_space_copy(dims
), n
, ISL_MAP_DISJOINT
);
4140 for (i
= 0; i
+ 1 < n
; ++i
)
4141 map
= isl_map_add_basic_map(map
,
4142 isl_basic_map_more_at(isl_space_copy(dims
), i
));
4145 map
= isl_map_add_basic_map(map
,
4146 isl_basic_map_more_or_equal_at(dims
, n
- 1));
4148 map
= isl_map_add_basic_map(map
,
4149 isl_basic_map_more_at(dims
, n
- 1));
4151 isl_space_free(dims
);
4156 static __isl_give isl_map
*map_lex_gte(__isl_take isl_space
*dims
, int equal
)
4160 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
4163 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_space
*dim
, unsigned n
)
4165 return map_lex_gte_first(dim
, n
, 0);
4168 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_space
*dim
, unsigned n
)
4170 return map_lex_gte_first(dim
, n
, 1);
4173 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_space
*set_dim
)
4175 return map_lex_gte(isl_space_map_from_set(set_dim
), 0);
4178 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_space
*set_dim
)
4180 return map_lex_gte(isl_space_map_from_set(set_dim
), 1);
4183 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
4184 __isl_take isl_set
*set2
)
4187 map
= isl_map_lex_le(isl_set_get_space(set1
));
4188 map
= isl_map_intersect_domain(map
, set1
);
4189 map
= isl_map_intersect_range(map
, set2
);
4193 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
4194 __isl_take isl_set
*set2
)
4197 map
= isl_map_lex_lt(isl_set_get_space(set1
));
4198 map
= isl_map_intersect_domain(map
, set1
);
4199 map
= isl_map_intersect_range(map
, set2
);
4203 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
4204 __isl_take isl_set
*set2
)
4207 map
= isl_map_lex_ge(isl_set_get_space(set1
));
4208 map
= isl_map_intersect_domain(map
, set1
);
4209 map
= isl_map_intersect_range(map
, set2
);
4213 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
4214 __isl_take isl_set
*set2
)
4217 map
= isl_map_lex_gt(isl_set_get_space(set1
));
4218 map
= isl_map_intersect_domain(map
, set1
);
4219 map
= isl_map_intersect_range(map
, set2
);
4223 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
4224 __isl_take isl_map
*map2
)
4227 map
= isl_map_lex_le(isl_space_range(isl_map_get_space(map1
)));
4228 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4229 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4233 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
4234 __isl_take isl_map
*map2
)
4237 map
= isl_map_lex_lt(isl_space_range(isl_map_get_space(map1
)));
4238 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4239 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4243 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
4244 __isl_take isl_map
*map2
)
4247 map
= isl_map_lex_ge(isl_space_range(isl_map_get_space(map1
)));
4248 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4249 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4253 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
4254 __isl_take isl_map
*map2
)
4257 map
= isl_map_lex_gt(isl_space_range(isl_map_get_space(map1
)));
4258 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
4259 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
4263 __isl_give isl_basic_map
*isl_basic_map_from_basic_set(
4264 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4266 struct isl_basic_map
*bmap
;
4268 bset
= isl_basic_set_cow(bset
);
4272 isl_assert(bset
->ctx
, isl_space_compatible(bset
->dim
, dim
), goto error
);
4273 isl_space_free(bset
->dim
);
4274 bmap
= (struct isl_basic_map
*) bset
;
4276 return isl_basic_map_finalize(bmap
);
4278 isl_basic_set_free(bset
);
4279 isl_space_free(dim
);
4283 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
4287 if (bmap
->dim
->n_in
== 0)
4288 return (struct isl_basic_set
*)bmap
;
4289 bmap
= isl_basic_map_cow(bmap
);
4292 bmap
->dim
= isl_space_as_set_space(bmap
->dim
);
4295 bmap
= isl_basic_map_finalize(bmap
);
4296 return (struct isl_basic_set
*)bmap
;
4298 isl_basic_map_free(bmap
);
4302 /* For a div d = floor(f/m), add the constraint
4306 static int add_upper_div_constraint(__isl_keep isl_basic_map
*bmap
,
4307 unsigned pos
, isl_int
*div
)
4310 unsigned total
= isl_basic_map_total_dim(bmap
);
4312 i
= isl_basic_map_alloc_inequality(bmap
);
4315 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4316 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
4321 /* For a div d = floor(f/m), add the constraint
4323 * -(f-(n-1)) + m d >= 0
4325 static int add_lower_div_constraint(__isl_keep isl_basic_map
*bmap
,
4326 unsigned pos
, isl_int
*div
)
4329 unsigned total
= isl_basic_map_total_dim(bmap
);
4331 i
= isl_basic_map_alloc_inequality(bmap
);
4334 isl_seq_neg(bmap
->ineq
[i
], div
+ 1, 1 + total
);
4335 isl_int_set(bmap
->ineq
[i
][1 + pos
], div
[0]);
4336 isl_int_add(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], bmap
->ineq
[i
][1 + pos
]);
4337 isl_int_sub_ui(bmap
->ineq
[i
][0], bmap
->ineq
[i
][0], 1);
4342 /* For a div d = floor(f/m), add the constraints
4345 * -(f-(n-1)) + m d >= 0
4347 * Note that the second constraint is the negation of
4351 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
4352 unsigned pos
, isl_int
*div
)
4354 if (add_upper_div_constraint(bmap
, pos
, div
) < 0)
4356 if (add_lower_div_constraint(bmap
, pos
, div
) < 0)
4361 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
4362 unsigned pos
, isl_int
*div
)
4364 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
4368 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
4370 unsigned total
= isl_basic_map_total_dim(bmap
);
4371 unsigned div_pos
= total
- bmap
->n_div
+ div
;
4373 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
4377 /* Add the div constraint of sign "sign" for div "div" of "bmap".
4379 * In particular, if this div is of the form d = floor(f/m),
4380 * then add the constraint
4384 * if sign < 0 or the constraint
4386 * -(f-(n-1)) + m d >= 0
4390 int isl_basic_map_add_div_constraint(__isl_keep isl_basic_map
*bmap
,
4391 unsigned div
, int sign
)
4399 total
= isl_basic_map_total_dim(bmap
);
4400 div_pos
= total
- bmap
->n_div
+ div
;
4403 return add_upper_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4405 return add_lower_div_constraint(bmap
, div_pos
, bmap
->div
[div
]);
4408 int isl_basic_set_add_div_constraints(struct isl_basic_set
*bset
, unsigned div
)
4410 return isl_basic_map_add_div_constraints(bset
, div
);
4413 struct isl_basic_set
*isl_basic_map_underlying_set(
4414 struct isl_basic_map
*bmap
)
4418 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
4420 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_in
) &&
4421 !isl_space_is_named_or_nested(bmap
->dim
, isl_dim_out
))
4422 return (struct isl_basic_set
*)bmap
;
4423 bmap
= isl_basic_map_cow(bmap
);
4426 bmap
->dim
= isl_space_underlying(bmap
->dim
, bmap
->n_div
);
4429 bmap
->extra
-= bmap
->n_div
;
4431 bmap
= isl_basic_map_finalize(bmap
);
4432 return (struct isl_basic_set
*)bmap
;
4434 isl_basic_map_free(bmap
);
4438 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
4439 __isl_take isl_basic_set
*bset
)
4441 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
4444 struct isl_basic_map
*isl_basic_map_overlying_set(
4445 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
4447 struct isl_basic_map
*bmap
;
4448 struct isl_ctx
*ctx
;
4455 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
4456 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
4457 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
4459 if (isl_space_is_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
4460 isl_basic_map_free(like
);
4461 return (struct isl_basic_map
*)bset
;
4463 bset
= isl_basic_set_cow(bset
);
4466 total
= bset
->dim
->n_out
+ bset
->extra
;
4467 bmap
= (struct isl_basic_map
*)bset
;
4468 isl_space_free(bmap
->dim
);
4469 bmap
->dim
= isl_space_copy(like
->dim
);
4472 bmap
->n_div
= like
->n_div
;
4473 bmap
->extra
+= like
->n_div
;
4477 ltotal
= total
- bmap
->extra
+ like
->extra
;
4480 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
4481 bmap
->extra
* (1 + 1 + total
));
4482 if (isl_blk_is_error(bmap
->block2
))
4484 div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*, bmap
->extra
);
4488 for (i
= 0; i
< bmap
->extra
; ++i
)
4489 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
4490 for (i
= 0; i
< like
->n_div
; ++i
) {
4491 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
4492 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
4494 bmap
= isl_basic_map_extend_constraints(bmap
,
4495 0, 2 * like
->n_div
);
4496 for (i
= 0; i
< like
->n_div
; ++i
) {
4499 if (isl_int_is_zero(bmap
->div
[i
][0]))
4501 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
4502 bmap
= isl_basic_map_free(bmap
);
4505 isl_basic_map_free(like
);
4506 bmap
= isl_basic_map_simplify(bmap
);
4507 bmap
= isl_basic_map_finalize(bmap
);
4510 isl_basic_map_free(like
);
4511 isl_basic_set_free(bset
);
4515 struct isl_basic_set
*isl_basic_set_from_underlying_set(
4516 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
4518 return (struct isl_basic_set
*)
4519 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
4522 struct isl_set
*isl_set_from_underlying_set(
4523 struct isl_set
*set
, struct isl_basic_set
*like
)
4529 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
4531 if (isl_space_is_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
4532 isl_basic_set_free(like
);
4535 set
= isl_set_cow(set
);
4538 for (i
= 0; i
< set
->n
; ++i
) {
4539 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
4540 isl_basic_set_copy(like
));
4544 isl_space_free(set
->dim
);
4545 set
->dim
= isl_space_copy(like
->dim
);
4548 isl_basic_set_free(like
);
4551 isl_basic_set_free(like
);
4556 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
4560 map
= isl_map_cow(map
);
4563 map
->dim
= isl_space_cow(map
->dim
);
4567 for (i
= 1; i
< map
->n
; ++i
)
4568 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
4570 for (i
= 0; i
< map
->n
; ++i
) {
4571 map
->p
[i
] = (struct isl_basic_map
*)
4572 isl_basic_map_underlying_set(map
->p
[i
]);
4577 map
->dim
= isl_space_underlying(map
->dim
, 0);
4579 isl_space_free(map
->dim
);
4580 map
->dim
= isl_space_copy(map
->p
[0]->dim
);
4584 return (struct isl_set
*)map
;
4590 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
4592 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
4595 __isl_give isl_basic_map
*isl_basic_map_reset_space(
4596 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*dim
)
4598 bmap
= isl_basic_map_cow(bmap
);
4602 isl_space_free(bmap
->dim
);
4605 bmap
= isl_basic_map_finalize(bmap
);
4609 isl_basic_map_free(bmap
);
4610 isl_space_free(dim
);
4614 __isl_give isl_basic_set
*isl_basic_set_reset_space(
4615 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*dim
)
4617 return (isl_basic_set
*)isl_basic_map_reset_space((isl_basic_map
*)bset
,
4621 __isl_give isl_map
*isl_map_reset_space(__isl_take isl_map
*map
,
4622 __isl_take isl_space
*dim
)
4626 map
= isl_map_cow(map
);
4630 for (i
= 0; i
< map
->n
; ++i
) {
4631 map
->p
[i
] = isl_basic_map_reset_space(map
->p
[i
],
4632 isl_space_copy(dim
));
4636 isl_space_free(map
->dim
);
4642 isl_space_free(dim
);
4646 __isl_give isl_set
*isl_set_reset_space(__isl_take isl_set
*set
,
4647 __isl_take isl_space
*dim
)
4649 return (struct isl_set
*) isl_map_reset_space((struct isl_map
*)set
, dim
);
4652 /* Compute the parameter domain of the given basic set.
4654 __isl_give isl_basic_set
*isl_basic_set_params(__isl_take isl_basic_set
*bset
)
4659 if (isl_basic_set_is_params(bset
))
4662 n
= isl_basic_set_dim(bset
, isl_dim_set
);
4663 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
4664 space
= isl_basic_set_get_space(bset
);
4665 space
= isl_space_params(space
);
4666 bset
= isl_basic_set_reset_space(bset
, space
);
4670 /* Construct a zero-dimensional basic set with the given parameter domain.
4672 __isl_give isl_basic_set
*isl_basic_set_from_params(
4673 __isl_take isl_basic_set
*bset
)
4676 space
= isl_basic_set_get_space(bset
);
4677 space
= isl_space_set_from_params(space
);
4678 bset
= isl_basic_set_reset_space(bset
, space
);
4682 /* Compute the parameter domain of the given set.
4684 __isl_give isl_set
*isl_set_params(__isl_take isl_set
*set
)
4689 if (isl_set_is_params(set
))
4692 n
= isl_set_dim(set
, isl_dim_set
);
4693 set
= isl_set_project_out(set
, isl_dim_set
, 0, n
);
4694 space
= isl_set_get_space(set
);
4695 space
= isl_space_params(space
);
4696 set
= isl_set_reset_space(set
, space
);
4700 /* Construct a zero-dimensional set with the given parameter domain.
4702 __isl_give isl_set
*isl_set_from_params(__isl_take isl_set
*set
)
4705 space
= isl_set_get_space(set
);
4706 space
= isl_space_set_from_params(space
);
4707 set
= isl_set_reset_space(set
, space
);
4711 /* Compute the parameter domain of the given map.
4713 __isl_give isl_set
*isl_map_params(__isl_take isl_map
*map
)
4718 n
= isl_map_dim(map
, isl_dim_in
);
4719 map
= isl_map_project_out(map
, isl_dim_in
, 0, n
);
4720 n
= isl_map_dim(map
, isl_dim_out
);
4721 map
= isl_map_project_out(map
, isl_dim_out
, 0, n
);
4722 space
= isl_map_get_space(map
);
4723 space
= isl_space_params(space
);
4724 map
= isl_map_reset_space(map
, space
);
4728 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
4731 struct isl_basic_set
*domain
;
4737 dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
4739 n_in
= isl_basic_map_n_in(bmap
);
4740 n_out
= isl_basic_map_n_out(bmap
);
4741 domain
= isl_basic_set_from_basic_map(bmap
);
4742 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
4744 domain
= isl_basic_set_reset_space(domain
, dim
);
4749 int isl_basic_map_may_be_set(__isl_keep isl_basic_map
*bmap
)
4753 return isl_space_may_be_set(bmap
->dim
);
4756 /* Is this basic map actually a set?
4757 * Users should never call this function. Outside of isl,
4758 * the type should indicate whether something is a set or a map.
4760 int isl_basic_map_is_set(__isl_keep isl_basic_map
*bmap
)
4764 return isl_space_is_set(bmap
->dim
);
4767 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
4771 if (isl_basic_map_is_set(bmap
))
4773 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
4776 __isl_give isl_basic_map
*isl_basic_map_domain_map(
4777 __isl_take isl_basic_map
*bmap
)
4781 isl_basic_map
*domain
;
4782 int nparam
, n_in
, n_out
;
4785 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4786 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4787 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4789 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
4790 domain
= isl_basic_map_universe(dim
);
4792 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4793 bmap
= isl_basic_map_apply_range(bmap
, domain
);
4794 bmap
= isl_basic_map_extend_constraints(bmap
, n_in
, 0);
4796 total
= isl_basic_map_total_dim(bmap
);
4798 for (i
= 0; i
< n_in
; ++i
) {
4799 k
= isl_basic_map_alloc_equality(bmap
);
4802 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4803 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], -1);
4804 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4807 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4808 return isl_basic_map_finalize(bmap
);
4810 isl_basic_map_free(bmap
);
4814 __isl_give isl_basic_map
*isl_basic_map_range_map(
4815 __isl_take isl_basic_map
*bmap
)
4819 isl_basic_map
*range
;
4820 int nparam
, n_in
, n_out
;
4823 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4824 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4825 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4827 dim
= isl_space_from_range(isl_space_range(isl_basic_map_get_space(bmap
)));
4828 range
= isl_basic_map_universe(dim
);
4830 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
4831 bmap
= isl_basic_map_apply_range(bmap
, range
);
4832 bmap
= isl_basic_map_extend_constraints(bmap
, n_out
, 0);
4834 total
= isl_basic_map_total_dim(bmap
);
4836 for (i
= 0; i
< n_out
; ++i
) {
4837 k
= isl_basic_map_alloc_equality(bmap
);
4840 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
4841 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ i
], -1);
4842 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n_in
+ n_out
+ i
], 1);
4845 bmap
= isl_basic_map_gauss(bmap
, NULL
);
4846 return isl_basic_map_finalize(bmap
);
4848 isl_basic_map_free(bmap
);
4852 int isl_map_may_be_set(__isl_keep isl_map
*map
)
4856 return isl_space_may_be_set(map
->dim
);
4859 /* Is this map actually a set?
4860 * Users should never call this function. Outside of isl,
4861 * the type should indicate whether something is a set or a map.
4863 int isl_map_is_set(__isl_keep isl_map
*map
)
4867 return isl_space_is_set(map
->dim
);
4870 struct isl_set
*isl_map_range(struct isl_map
*map
)
4873 struct isl_set
*set
;
4877 if (isl_map_is_set(map
))
4878 return (isl_set
*)map
;
4880 map
= isl_map_cow(map
);
4884 set
= (struct isl_set
*) map
;
4885 set
->dim
= isl_space_range(set
->dim
);
4888 for (i
= 0; i
< map
->n
; ++i
) {
4889 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
4893 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4894 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4901 __isl_give isl_map
*isl_map_domain_map(__isl_take isl_map
*map
)
4904 isl_space
*domain_dim
;
4906 map
= isl_map_cow(map
);
4910 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
4911 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4912 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
4915 for (i
= 0; i
< map
->n
; ++i
) {
4916 map
->p
[i
] = isl_basic_map_domain_map(map
->p
[i
]);
4920 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4921 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4928 __isl_give isl_map
*isl_map_range_map(__isl_take isl_map
*map
)
4931 isl_space
*range_dim
;
4933 map
= isl_map_cow(map
);
4937 range_dim
= isl_space_range(isl_map_get_space(map
));
4938 range_dim
= isl_space_from_range(range_dim
);
4939 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
4940 map
->dim
= isl_space_join(map
->dim
, range_dim
);
4943 for (i
= 0; i
< map
->n
; ++i
) {
4944 map
->p
[i
] = isl_basic_map_range_map(map
->p
[i
]);
4948 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
4949 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4956 __isl_give isl_map
*isl_map_from_set(__isl_take isl_set
*set
,
4957 __isl_take isl_space
*dim
)
4960 struct isl_map
*map
= NULL
;
4962 set
= isl_set_cow(set
);
4965 isl_assert(set
->ctx
, isl_space_compatible(set
->dim
, dim
), goto error
);
4966 map
= (struct isl_map
*)set
;
4967 for (i
= 0; i
< set
->n
; ++i
) {
4968 map
->p
[i
] = isl_basic_map_from_basic_set(
4969 set
->p
[i
], isl_space_copy(dim
));
4973 isl_space_free(map
->dim
);
4977 isl_space_free(dim
);
4982 __isl_give isl_basic_map
*isl_basic_map_from_domain(
4983 __isl_take isl_basic_set
*bset
)
4985 return isl_basic_map_reverse(isl_basic_map_from_range(bset
));
4988 __isl_give isl_basic_map
*isl_basic_map_from_range(
4989 __isl_take isl_basic_set
*bset
)
4992 space
= isl_basic_set_get_space(bset
);
4993 space
= isl_space_from_range(space
);
4994 bset
= isl_basic_set_reset_space(bset
, space
);
4995 return (isl_basic_map
*)bset
;
4998 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
5001 space
= isl_set_get_space(set
);
5002 space
= isl_space_from_range(space
);
5003 set
= isl_set_reset_space(set
, space
);
5004 return (struct isl_map
*)set
;
5007 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
5009 return isl_map_reverse(isl_map_from_range(set
));
5012 __isl_give isl_basic_map
*isl_basic_map_from_domain_and_range(
5013 __isl_take isl_basic_set
*domain
, __isl_take isl_basic_set
*range
)
5015 return isl_basic_map_apply_range(isl_basic_map_reverse(domain
), range
);
5018 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
5019 __isl_take isl_set
*range
)
5021 return isl_map_apply_range(isl_map_reverse(domain
), range
);
5024 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
5027 struct isl_set
*set
= NULL
;
5031 map
= isl_map_cow(map
);
5034 map
->dim
= isl_space_as_set_space(map
->dim
);
5037 set
= (struct isl_set
*)map
;
5038 for (i
= 0; i
< map
->n
; ++i
) {
5039 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
5049 __isl_give isl_map
*isl_map_alloc_space(__isl_take isl_space
*dim
, int n
,
5052 struct isl_map
*map
;
5057 isl_die(dim
->ctx
, isl_error_internal
,
5058 "negative number of basic maps", goto error
);
5059 map
= isl_alloc(dim
->ctx
, struct isl_map
,
5060 sizeof(struct isl_map
) +
5061 (n
- 1) * sizeof(struct isl_basic_map
*));
5065 map
->ctx
= dim
->ctx
;
5066 isl_ctx_ref(map
->ctx
);
5074 isl_space_free(dim
);
5078 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
5079 unsigned nparam
, unsigned in
, unsigned out
, int n
,
5082 struct isl_map
*map
;
5085 dims
= isl_space_alloc(ctx
, nparam
, in
, out
);
5089 map
= isl_map_alloc_space(dims
, n
, flags
);
5093 __isl_give isl_basic_map
*isl_basic_map_empty(__isl_take isl_space
*dim
)
5095 struct isl_basic_map
*bmap
;
5096 bmap
= isl_basic_map_alloc_space(dim
, 0, 1, 0);
5097 bmap
= isl_basic_map_set_to_empty(bmap
);
5101 __isl_give isl_basic_set
*isl_basic_set_empty(__isl_take isl_space
*dim
)
5103 struct isl_basic_set
*bset
;
5104 bset
= isl_basic_set_alloc_space(dim
, 0, 1, 0);
5105 bset
= isl_basic_set_set_to_empty(bset
);
5109 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
5111 struct isl_basic_map
*bmap
;
5114 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5115 bmap
= isl_basic_map_set_to_empty(bmap
);
5119 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
5121 struct isl_basic_map
*bmap
;
5124 bmap
= isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5125 bmap
= isl_basic_map_set_to_empty(bmap
);
5129 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
5131 struct isl_basic_set
*bset
;
5134 bset
= isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 1, 0);
5135 bset
= isl_basic_set_set_to_empty(bset
);
5139 __isl_give isl_basic_map
*isl_basic_map_universe(__isl_take isl_space
*dim
)
5141 struct isl_basic_map
*bmap
;
5142 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, 0);
5143 bmap
= isl_basic_map_finalize(bmap
);
5147 __isl_give isl_basic_set
*isl_basic_set_universe(__isl_take isl_space
*dim
)
5149 struct isl_basic_set
*bset
;
5150 bset
= isl_basic_set_alloc_space(dim
, 0, 0, 0);
5151 bset
= isl_basic_set_finalize(bset
);
5155 __isl_give isl_basic_map
*isl_basic_map_nat_universe(__isl_take isl_space
*dim
)
5158 unsigned total
= isl_space_dim(dim
, isl_dim_all
);
5159 isl_basic_map
*bmap
;
5161 bmap
= isl_basic_map_alloc_space(dim
, 0, 0, total
);
5162 for (i
= 0; i
< total
; ++i
) {
5163 int k
= isl_basic_map_alloc_inequality(bmap
);
5166 isl_seq_clr(bmap
->ineq
[k
], 1 + total
);
5167 isl_int_set_si(bmap
->ineq
[k
][1 + i
], 1);
5171 isl_basic_map_free(bmap
);
5175 __isl_give isl_basic_set
*isl_basic_set_nat_universe(__isl_take isl_space
*dim
)
5177 return isl_basic_map_nat_universe(dim
);
5180 __isl_give isl_map
*isl_map_nat_universe(__isl_take isl_space
*dim
)
5182 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim
));
5185 __isl_give isl_set
*isl_set_nat_universe(__isl_take isl_space
*dim
)
5187 return isl_map_nat_universe(dim
);
5190 __isl_give isl_basic_map
*isl_basic_map_universe_like(
5191 __isl_keep isl_basic_map
*model
)
5195 return isl_basic_map_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5198 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
5202 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5205 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
5206 __isl_keep isl_set
*model
)
5210 return isl_basic_set_alloc_space(isl_space_copy(model
->dim
), 0, 0, 0);
5213 __isl_give isl_map
*isl_map_empty(__isl_take isl_space
*dim
)
5215 return isl_map_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5218 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
5222 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5225 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
5229 return isl_map_alloc_space(isl_space_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
5232 __isl_give isl_set
*isl_set_empty(__isl_take isl_space
*dim
)
5234 return isl_set_alloc_space(dim
, 0, ISL_MAP_DISJOINT
);
5237 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
5241 return isl_set_empty(isl_space_copy(model
->dim
));
5244 __isl_give isl_map
*isl_map_universe(__isl_take isl_space
*dim
)
5246 struct isl_map
*map
;
5249 map
= isl_map_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5250 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
5254 __isl_give isl_set
*isl_set_universe(__isl_take isl_space
*dim
)
5256 struct isl_set
*set
;
5259 set
= isl_set_alloc_space(isl_space_copy(dim
), 1, ISL_MAP_DISJOINT
);
5260 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
5264 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
5268 return isl_set_universe(isl_space_copy(model
->dim
));
5271 struct isl_map
*isl_map_dup(struct isl_map
*map
)
5274 struct isl_map
*dup
;
5278 dup
= isl_map_alloc_space(isl_space_copy(map
->dim
), map
->n
, map
->flags
);
5279 for (i
= 0; i
< map
->n
; ++i
)
5280 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
5284 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
5285 __isl_take isl_basic_map
*bmap
)
5289 if (isl_basic_map_plain_is_empty(bmap
)) {
5290 isl_basic_map_free(bmap
);
5293 isl_assert(map
->ctx
, isl_space_is_equal(map
->dim
, bmap
->dim
), goto error
);
5294 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
5295 map
->p
[map
->n
] = bmap
;
5297 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5303 isl_basic_map_free(bmap
);
5307 void *isl_map_free(struct isl_map
*map
)
5317 isl_ctx_deref(map
->ctx
);
5318 for (i
= 0; i
< map
->n
; ++i
)
5319 isl_basic_map_free(map
->p
[i
]);
5320 isl_space_free(map
->dim
);
5326 struct isl_map
*isl_map_extend(struct isl_map
*base
,
5327 unsigned nparam
, unsigned n_in
, unsigned n_out
)
5331 base
= isl_map_cow(base
);
5335 base
->dim
= isl_space_extend(base
->dim
, nparam
, n_in
, n_out
);
5338 for (i
= 0; i
< base
->n
; ++i
) {
5339 base
->p
[i
] = isl_basic_map_extend_space(base
->p
[i
],
5340 isl_space_copy(base
->dim
), 0, 0, 0);
5350 struct isl_set
*isl_set_extend(struct isl_set
*base
,
5351 unsigned nparam
, unsigned dim
)
5353 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
5357 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
5358 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
5362 bmap
= isl_basic_map_cow(bmap
);
5363 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5364 j
= isl_basic_map_alloc_equality(bmap
);
5367 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5368 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5369 isl_int_set_si(bmap
->eq
[j
][0], value
);
5370 bmap
= isl_basic_map_simplify(bmap
);
5371 return isl_basic_map_finalize(bmap
);
5373 isl_basic_map_free(bmap
);
5377 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
5378 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
5382 bmap
= isl_basic_map_cow(bmap
);
5383 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
5384 j
= isl_basic_map_alloc_equality(bmap
);
5387 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
5388 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
5389 isl_int_set(bmap
->eq
[j
][0], value
);
5390 bmap
= isl_basic_map_simplify(bmap
);
5391 return isl_basic_map_finalize(bmap
);
5393 isl_basic_map_free(bmap
);
5397 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
5398 enum isl_dim_type type
, unsigned pos
, int value
)
5402 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5403 return isl_basic_map_fix_pos_si(bmap
,
5404 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5406 isl_basic_map_free(bmap
);
5410 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
5411 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5415 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5416 return isl_basic_map_fix_pos(bmap
,
5417 isl_basic_map_offset(bmap
, type
) + pos
, value
);
5419 isl_basic_map_free(bmap
);
5423 /* Fix the value of the variable at position "pos" of type "type" of "bmap"
5424 * to be equal to "v".
5426 __isl_give isl_basic_map
*isl_basic_map_fix_val(__isl_take isl_basic_map
*bmap
,
5427 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5431 if (!isl_val_is_int(v
))
5432 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5433 "expecting integer value", goto error
);
5434 if (pos
>= isl_basic_map_dim(bmap
, type
))
5435 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
5436 "index out of bounds", goto error
);
5437 pos
+= isl_basic_map_offset(bmap
, type
);
5438 bmap
= isl_basic_map_fix_pos(bmap
, pos
, v
->n
);
5442 isl_basic_map_free(bmap
);
5447 /* Fix the value of the variable at position "pos" of type "type" of "bset"
5448 * to be equal to "v".
5450 __isl_give isl_basic_set
*isl_basic_set_fix_val(__isl_take isl_basic_set
*bset
,
5451 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5453 return isl_basic_map_fix_val(bset
, type
, pos
, v
);
5456 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
5457 enum isl_dim_type type
, unsigned pos
, int value
)
5459 return (struct isl_basic_set
*)
5460 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5464 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
5465 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5467 return (struct isl_basic_set
*)
5468 isl_basic_map_fix((struct isl_basic_map
*)bset
,
5472 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
5473 unsigned input
, int value
)
5475 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
5478 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
5479 unsigned dim
, int value
)
5481 return (struct isl_basic_set
*)
5482 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
5483 isl_dim_set
, dim
, value
);
5486 static int remove_if_empty(__isl_keep isl_map
*map
, int i
)
5488 int empty
= isl_basic_map_plain_is_empty(map
->p
[i
]);
5495 isl_basic_map_free(map
->p
[i
]);
5496 if (i
!= map
->n
- 1) {
5497 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5498 map
->p
[i
] = map
->p
[map
->n
- 1];
5505 /* Perform "fn" on each basic map of "map", where we may not be holding
5506 * the only reference to "map".
5507 * In particular, "fn" should be a semantics preserving operation
5508 * that we want to apply to all copies of "map". We therefore need
5509 * to be careful not to modify "map" in a way that breaks "map"
5510 * in case anything goes wrong.
5512 __isl_give isl_map
*isl_map_inline_foreach_basic_map(__isl_take isl_map
*map
,
5513 __isl_give isl_basic_map
*(*fn
)(__isl_take isl_basic_map
*bmap
))
5515 struct isl_basic_map
*bmap
;
5521 for (i
= map
->n
- 1; i
>= 0; --i
) {
5522 bmap
= isl_basic_map_copy(map
->p
[i
]);
5526 isl_basic_map_free(map
->p
[i
]);
5528 if (remove_if_empty(map
, i
) < 0)
5538 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
5539 enum isl_dim_type type
, unsigned pos
, int value
)
5543 map
= isl_map_cow(map
);
5547 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5548 for (i
= map
->n
- 1; i
>= 0; --i
) {
5549 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
5550 if (remove_if_empty(map
, i
) < 0)
5553 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5560 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
5561 enum isl_dim_type type
, unsigned pos
, int value
)
5563 return (struct isl_set
*)
5564 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
5567 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
5568 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5572 map
= isl_map_cow(map
);
5576 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5577 for (i
= 0; i
< map
->n
; ++i
) {
5578 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
5582 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5589 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
5590 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5592 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
5595 /* Fix the value of the variable at position "pos" of type "type" of "map"
5596 * to be equal to "v".
5598 __isl_give isl_map
*isl_map_fix_val(__isl_take isl_map
*map
,
5599 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5603 map
= isl_map_cow(map
);
5607 if (!isl_val_is_int(v
))
5608 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5609 "expecting integer value", goto error
);
5610 if (pos
>= isl_map_dim(map
, type
))
5611 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
5612 "index out of bounds", goto error
);
5613 for (i
= map
->n
- 1; i
>= 0; --i
) {
5614 map
->p
[i
] = isl_basic_map_fix_val(map
->p
[i
], type
, pos
,
5616 if (remove_if_empty(map
, i
) < 0)
5619 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5628 /* Fix the value of the variable at position "pos" of type "type" of "set"
5629 * to be equal to "v".
5631 __isl_give isl_set
*isl_set_fix_val(__isl_take isl_set
*set
,
5632 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*v
)
5634 return isl_map_fix_val(set
, type
, pos
, v
);
5637 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
5638 unsigned input
, int value
)
5640 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
5643 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
5645 return (struct isl_set
*)
5646 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
5649 static __isl_give isl_basic_map
*basic_map_bound_si(
5650 __isl_take isl_basic_map
*bmap
,
5651 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5657 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
5658 pos
+= isl_basic_map_offset(bmap
, type
);
5659 bmap
= isl_basic_map_cow(bmap
);
5660 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5661 j
= isl_basic_map_alloc_inequality(bmap
);
5664 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5666 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5667 isl_int_set_si(bmap
->ineq
[j
][0], value
);
5669 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5670 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
5672 bmap
= isl_basic_map_simplify(bmap
);
5673 return isl_basic_map_finalize(bmap
);
5675 isl_basic_map_free(bmap
);
5679 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
5680 __isl_take isl_basic_map
*bmap
,
5681 enum isl_dim_type type
, unsigned pos
, int value
)
5683 return basic_map_bound_si(bmap
, type
, pos
, value
, 0);
5686 /* Constrain the values of the given dimension to be no greater than "value".
5688 __isl_give isl_basic_map
*isl_basic_map_upper_bound_si(
5689 __isl_take isl_basic_map
*bmap
,
5690 enum isl_dim_type type
, unsigned pos
, int value
)
5692 return basic_map_bound_si(bmap
, type
, pos
, value
, 1);
5695 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
5696 unsigned dim
, isl_int value
)
5700 bset
= isl_basic_set_cow(bset
);
5701 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
5702 j
= isl_basic_set_alloc_inequality(bset
);
5705 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
5706 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
5707 isl_int_neg(bset
->ineq
[j
][0], value
);
5708 bset
= isl_basic_set_simplify(bset
);
5709 return isl_basic_set_finalize(bset
);
5711 isl_basic_set_free(bset
);
5715 static __isl_give isl_map
*map_bound_si(__isl_take isl_map
*map
,
5716 enum isl_dim_type type
, unsigned pos
, int value
, int upper
)
5720 map
= isl_map_cow(map
);
5724 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
5725 for (i
= 0; i
< map
->n
; ++i
) {
5726 map
->p
[i
] = basic_map_bound_si(map
->p
[i
],
5727 type
, pos
, value
, upper
);
5731 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5738 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
5739 enum isl_dim_type type
, unsigned pos
, int value
)
5741 return map_bound_si(map
, type
, pos
, value
, 0);
5744 __isl_give isl_map
*isl_map_upper_bound_si(__isl_take isl_map
*map
,
5745 enum isl_dim_type type
, unsigned pos
, int value
)
5747 return map_bound_si(map
, type
, pos
, value
, 1);
5750 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
5751 enum isl_dim_type type
, unsigned pos
, int value
)
5753 return (struct isl_set
*)
5754 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
5757 __isl_give isl_set
*isl_set_upper_bound_si(__isl_take isl_set
*set
,
5758 enum isl_dim_type type
, unsigned pos
, int value
)
5760 return isl_map_upper_bound_si(set
, type
, pos
, value
);
5763 /* Bound the given variable of "bmap" from below (or above is "upper"
5764 * is set) to "value".
5766 static __isl_give isl_basic_map
*basic_map_bound(
5767 __isl_take isl_basic_map
*bmap
,
5768 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5774 if (pos
>= isl_basic_map_dim(bmap
, type
))
5775 isl_die(bmap
->ctx
, isl_error_invalid
,
5776 "index out of bounds", goto error
);
5777 pos
+= isl_basic_map_offset(bmap
, type
);
5778 bmap
= isl_basic_map_cow(bmap
);
5779 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
5780 j
= isl_basic_map_alloc_inequality(bmap
);
5783 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5785 isl_int_set_si(bmap
->ineq
[j
][pos
], -1);
5786 isl_int_set(bmap
->ineq
[j
][0], value
);
5788 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
5789 isl_int_neg(bmap
->ineq
[j
][0], value
);
5791 bmap
= isl_basic_map_simplify(bmap
);
5792 return isl_basic_map_finalize(bmap
);
5794 isl_basic_map_free(bmap
);
5798 /* Bound the given variable of "map" from below (or above is "upper"
5799 * is set) to "value".
5801 static __isl_give isl_map
*map_bound(__isl_take isl_map
*map
,
5802 enum isl_dim_type type
, unsigned pos
, isl_int value
, int upper
)
5806 map
= isl_map_cow(map
);
5810 if (pos
>= isl_map_dim(map
, type
))
5811 isl_die(map
->ctx
, isl_error_invalid
,
5812 "index out of bounds", goto error
);
5813 for (i
= map
->n
- 1; i
>= 0; --i
) {
5814 map
->p
[i
] = basic_map_bound(map
->p
[i
], type
, pos
, value
, upper
);
5815 if (remove_if_empty(map
, i
) < 0)
5818 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5825 __isl_give isl_map
*isl_map_lower_bound(__isl_take isl_map
*map
,
5826 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5828 return map_bound(map
, type
, pos
, value
, 0);
5831 __isl_give isl_map
*isl_map_upper_bound(__isl_take isl_map
*map
,
5832 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5834 return map_bound(map
, type
, pos
, value
, 1);
5837 __isl_give isl_set
*isl_set_lower_bound(__isl_take isl_set
*set
,
5838 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5840 return isl_map_lower_bound(set
, type
, pos
, value
);
5843 __isl_give isl_set
*isl_set_upper_bound(__isl_take isl_set
*set
,
5844 enum isl_dim_type type
, unsigned pos
, isl_int value
)
5846 return isl_map_upper_bound(set
, type
, pos
, value
);
5849 /* Force the values of the variable at position "pos" of type "type" of "set"
5850 * to be no smaller than "value".
5852 __isl_give isl_set
*isl_set_lower_bound_val(__isl_take isl_set
*set
,
5853 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5857 if (!isl_val_is_int(value
))
5858 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5859 "expecting integer value", goto error
);
5860 set
= isl_set_lower_bound(set
, type
, pos
, value
->n
);
5861 isl_val_free(value
);
5864 isl_val_free(value
);
5869 /* Force the values of the variable at position "pos" of type "type" of "set"
5870 * to be no greater than "value".
5872 __isl_give isl_set
*isl_set_upper_bound_val(__isl_take isl_set
*set
,
5873 enum isl_dim_type type
, unsigned pos
, __isl_take isl_val
*value
)
5877 if (!isl_val_is_int(value
))
5878 isl_die(isl_set_get_ctx(set
), isl_error_invalid
,
5879 "expecting integer value", goto error
);
5880 set
= isl_set_upper_bound(set
, type
, pos
, value
->n
);
5881 isl_val_free(value
);
5884 isl_val_free(value
);
5889 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
5894 set
= isl_set_cow(set
);
5898 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
5899 for (i
= 0; i
< set
->n
; ++i
) {
5900 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
5910 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
5914 map
= isl_map_cow(map
);
5918 map
->dim
= isl_space_reverse(map
->dim
);
5921 for (i
= 0; i
< map
->n
; ++i
) {
5922 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
5926 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5933 static struct isl_map
*isl_basic_map_partial_lexopt(
5934 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5935 struct isl_set
**empty
, int max
)
5939 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
5940 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
5942 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
5944 isl_basic_map_free(bmap
);
5945 isl_basic_set_free(dom
);
5951 struct isl_map
*isl_basic_map_partial_lexmax(
5952 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5953 struct isl_set
**empty
)
5955 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
5958 struct isl_map
*isl_basic_map_partial_lexmin(
5959 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
5960 struct isl_set
**empty
)
5962 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
5965 struct isl_set
*isl_basic_set_partial_lexmin(
5966 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5967 struct isl_set
**empty
)
5969 return (struct isl_set
*)
5970 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
5974 struct isl_set
*isl_basic_set_partial_lexmax(
5975 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
5976 struct isl_set
**empty
)
5978 return (struct isl_set
*)
5979 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
5983 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmin_pw_multi_aff(
5984 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5985 __isl_give isl_set
**empty
)
5987 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 0);
5990 __isl_give isl_pw_multi_aff
*isl_basic_map_partial_lexmax_pw_multi_aff(
5991 __isl_take isl_basic_map
*bmap
, __isl_take isl_basic_set
*dom
,
5992 __isl_give isl_set
**empty
)
5994 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, empty
, 1);
5997 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmin_pw_multi_aff(
5998 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
5999 __isl_give isl_set
**empty
)
6001 return isl_basic_map_partial_lexmin_pw_multi_aff(bset
, dom
, empty
);
6004 __isl_give isl_pw_multi_aff
*isl_basic_set_partial_lexmax_pw_multi_aff(
6005 __isl_take isl_basic_set
*bset
, __isl_take isl_basic_set
*dom
,
6006 __isl_give isl_set
**empty
)
6008 return isl_basic_map_partial_lexmax_pw_multi_aff(bset
, dom
, empty
);
6011 __isl_give isl_pw_multi_aff
*isl_basic_map_lexopt_pw_multi_aff(
6012 __isl_take isl_basic_map
*bmap
, int max
)
6014 isl_basic_set
*dom
= NULL
;
6015 isl_space
*dom_space
;
6019 dom_space
= isl_space_domain(isl_space_copy(bmap
->dim
));
6020 dom
= isl_basic_set_universe(dom_space
);
6021 return isl_basic_map_partial_lexopt_pw_multi_aff(bmap
, dom
, NULL
, max
);
6023 isl_basic_map_free(bmap
);
6027 __isl_give isl_pw_multi_aff
*isl_basic_map_lexmin_pw_multi_aff(
6028 __isl_take isl_basic_map
*bmap
)
6030 return isl_basic_map_lexopt_pw_multi_aff(bmap
, 0);
6034 #define TYPE isl_pw_multi_aff
6036 #define SUFFIX _pw_multi_aff
6038 #define EMPTY isl_pw_multi_aff_empty
6040 #define ADD isl_pw_multi_aff_union_add
6041 #include "isl_map_lexopt_templ.c"
6043 /* Given a map "map", compute the lexicographically minimal
6044 * (or maximal) image element for each domain element in dom,
6045 * in the form of an isl_pw_multi_aff.
6046 * Set *empty to those elements in dom that do not have an image element.
6048 * We first compute the lexicographically minimal or maximal element
6049 * in the first basic map. This results in a partial solution "res"
6050 * and a subset "todo" of dom that still need to be handled.
6051 * We then consider each of the remaining maps in "map" and successively
6052 * update both "res" and "todo".
6054 static __isl_give isl_pw_multi_aff
*isl_map_partial_lexopt_aligned_pw_multi_aff(
6055 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6056 __isl_give isl_set
**empty
, int max
)
6059 isl_pw_multi_aff
*res
;
6065 if (isl_map_plain_is_empty(map
)) {
6070 return isl_pw_multi_aff_from_map(map
);
6073 res
= basic_map_partial_lexopt_pw_multi_aff(
6074 isl_basic_map_copy(map
->p
[0]),
6075 isl_set_copy(dom
), &todo
, max
);
6077 for (i
= 1; i
< map
->n
; ++i
) {
6078 isl_pw_multi_aff
*res_i
;
6081 res_i
= basic_map_partial_lexopt_pw_multi_aff(
6082 isl_basic_map_copy(map
->p
[i
]),
6083 isl_set_copy(dom
), &todo_i
, max
);
6086 res
= isl_pw_multi_aff_union_lexmax(res
, res_i
);
6088 res
= isl_pw_multi_aff_union_lexmin(res
, res_i
);
6090 todo
= isl_set_intersect(todo
, todo_i
);
6111 #define TYPE isl_map
6115 #define EMPTY isl_map_empty
6117 #define ADD isl_map_union_disjoint
6118 #include "isl_map_lexopt_templ.c"
6120 /* Given a map "map", compute the lexicographically minimal
6121 * (or maximal) image element for each domain element in dom.
6122 * Set *empty to those elements in dom that do not have an image element.
6124 * We first compute the lexicographically minimal or maximal element
6125 * in the first basic map. This results in a partial solution "res"
6126 * and a subset "todo" of dom that still need to be handled.
6127 * We then consider each of the remaining maps in "map" and successively
6128 * update both "res" and "todo".
6130 * Let res^k and todo^k be the results after k steps and let i = k + 1.
6131 * Assume we are computing the lexicographical maximum.
6132 * We first compute the lexicographically maximal element in basic map i.
6133 * This results in a partial solution res_i and a subset todo_i.
6134 * Then we combine these results with those obtain for the first k basic maps
6135 * to obtain a result that is valid for the first k+1 basic maps.
6136 * In particular, the set where there is no solution is the set where
6137 * there is no solution for the first k basic maps and also no solution
6138 * for the ith basic map, i.e.,
6140 * todo^i = todo^k * todo_i
6142 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
6143 * solutions, arbitrarily breaking ties in favor of res^k.
6144 * That is, when res^k(a) >= res_i(a), we pick res^k and
6145 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
6146 * the lexicographic order.)
6147 * In practice, we compute
6149 * res^k * (res_i . "<=")
6153 * res_i * (res^k . "<")
6155 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
6156 * where only one of res^k and res_i provides a solution and we simply pick
6163 * Note that we only compute these intersections when dom(res^k) intersects
6164 * dom(res_i). Otherwise, the only effect of these intersections is to
6165 * potentially break up res^k and res_i into smaller pieces.
6166 * We want to avoid such splintering as much as possible.
6167 * In fact, an earlier implementation of this function would look for
6168 * better results in the domain of res^k and for extra results in todo^k,
6169 * but this would always result in a splintering according to todo^k,
6170 * even when the domain of basic map i is disjoint from the domains of
6171 * the previous basic maps.
6173 static __isl_give isl_map
*isl_map_partial_lexopt_aligned(
6174 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6175 __isl_give isl_set
**empty
, int max
)
6178 struct isl_map
*res
;
6179 struct isl_set
*todo
;
6184 if (isl_map_plain_is_empty(map
)) {
6192 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
6193 isl_set_copy(dom
), &todo
, max
);
6195 for (i
= 1; i
< map
->n
; ++i
) {
6199 isl_space
*dim
= isl_space_range(isl_map_get_space(res
));
6201 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
6202 isl_set_copy(dom
), &todo_i
, max
);
6205 lt
= isl_map_lex_lt(isl_space_copy(dim
));
6206 le
= isl_map_lex_le(dim
);
6208 lt
= isl_map_lex_gt(isl_space_copy(dim
));
6209 le
= isl_map_lex_ge(dim
);
6211 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
6212 lt
= isl_map_intersect(lt
, isl_map_copy(res_i
));
6213 le
= isl_map_apply_range(isl_map_copy(res_i
), le
);
6214 le
= isl_map_intersect(le
, isl_map_copy(res
));
6216 if (!isl_map_is_empty(lt
) || !isl_map_is_empty(le
)) {
6217 res
= isl_map_intersect_domain(res
,
6218 isl_set_copy(todo_i
));
6219 res_i
= isl_map_intersect_domain(res_i
,
6220 isl_set_copy(todo
));
6223 res
= isl_map_union_disjoint(res
, res_i
);
6224 res
= isl_map_union_disjoint(res
, lt
);
6225 res
= isl_map_union_disjoint(res
, le
);
6227 todo
= isl_set_intersect(todo
, todo_i
);
6247 __isl_give isl_map
*isl_map_partial_lexmax(
6248 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6249 __isl_give isl_set
**empty
)
6251 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
6254 __isl_give isl_map
*isl_map_partial_lexmin(
6255 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
6256 __isl_give isl_set
**empty
)
6258 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
6261 __isl_give isl_set
*isl_set_partial_lexmin(
6262 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6263 __isl_give isl_set
**empty
)
6265 return (struct isl_set
*)
6266 isl_map_partial_lexmin((struct isl_map
*)set
,
6270 __isl_give isl_set
*isl_set_partial_lexmax(
6271 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
6272 __isl_give isl_set
**empty
)
6274 return (struct isl_set
*)
6275 isl_map_partial_lexmax((struct isl_map
*)set
,
6279 /* Compute the lexicographic minimum (or maximum if "max" is set)
6280 * of "bmap" over its domain.
6282 * Since we are not interested in the part of the domain space where
6283 * there is no solution, we initialize the domain to those constraints
6284 * of "bmap" that only involve the parameters and the input dimensions.
6285 * This relieves the parametric programming engine from detecting those
6286 * inequalities and transferring them to the context. More importantly,
6287 * it ensures that those inequalities are transferred first and not
6288 * intermixed with inequalities that actually split the domain.
6290 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
6294 isl_basic_map
*copy
;
6297 n_div
= isl_basic_map_dim(bmap
, isl_dim_div
);
6298 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6299 copy
= isl_basic_map_copy(bmap
);
6300 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6301 isl_dim_div
, 0, n_div
);
6302 copy
= isl_basic_map_drop_constraints_involving_dims(copy
,
6303 isl_dim_out
, 0, n_out
);
6304 dom
= isl_basic_map_domain(copy
);
6305 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
6308 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
6310 return isl_basic_map_lexopt(bmap
, 0);
6313 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
6315 return isl_basic_map_lexopt(bmap
, 1);
6318 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
6320 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
6323 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
6325 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
6328 /* Extract the first and only affine expression from list
6329 * and then add it to *pwaff with the given dom.
6330 * This domain is known to be disjoint from other domains
6331 * because of the way isl_basic_map_foreach_lexmax works.
6333 static int update_dim_opt(__isl_take isl_basic_set
*dom
,
6334 __isl_take isl_aff_list
*list
, void *user
)
6336 isl_ctx
*ctx
= isl_basic_set_get_ctx(dom
);
6338 isl_pw_aff
**pwaff
= user
;
6339 isl_pw_aff
*pwaff_i
;
6343 if (isl_aff_list_n_aff(list
) != 1)
6344 isl_die(ctx
, isl_error_internal
,
6345 "expecting single element list", goto error
);
6347 aff
= isl_aff_list_get_aff(list
, 0);
6348 pwaff_i
= isl_pw_aff_alloc(isl_set_from_basic_set(dom
), aff
);
6350 *pwaff
= isl_pw_aff_add_disjoint(*pwaff
, pwaff_i
);
6352 isl_aff_list_free(list
);
6356 isl_basic_set_free(dom
);
6357 isl_aff_list_free(list
);
6361 /* Given a basic map with one output dimension, compute the minimum or
6362 * maximum of that dimension as an isl_pw_aff.
6364 * The isl_pw_aff is constructed by having isl_basic_map_foreach_lexopt
6365 * call update_dim_opt on each leaf of the result.
6367 static __isl_give isl_pw_aff
*basic_map_dim_opt(__isl_keep isl_basic_map
*bmap
,
6370 isl_space
*dim
= isl_basic_map_get_space(bmap
);
6374 dim
= isl_space_from_domain(isl_space_domain(dim
));
6375 dim
= isl_space_add_dims(dim
, isl_dim_out
, 1);
6376 pwaff
= isl_pw_aff_empty(dim
);
6378 r
= isl_basic_map_foreach_lexopt(bmap
, max
, &update_dim_opt
, &pwaff
);
6380 return isl_pw_aff_free(pwaff
);
6385 /* Compute the minimum or maximum of the given output dimension
6386 * as a function of the parameters and the input dimensions,
6387 * but independently of the other output dimensions.
6389 * We first project out the other output dimension and then compute
6390 * the "lexicographic" maximum in each basic map, combining the results
6391 * using isl_pw_aff_union_max.
6393 static __isl_give isl_pw_aff
*map_dim_opt(__isl_take isl_map
*map
, int pos
,
6400 n_out
= isl_map_dim(map
, isl_dim_out
);
6401 map
= isl_map_project_out(map
, isl_dim_out
, pos
+ 1, n_out
- (pos
+ 1));
6402 map
= isl_map_project_out(map
, isl_dim_out
, 0, pos
);
6407 isl_space
*dim
= isl_map_get_space(map
);
6408 dim
= isl_space_domain(isl_space_from_range(dim
));
6410 return isl_pw_aff_empty(dim
);
6413 pwaff
= basic_map_dim_opt(map
->p
[0], max
);
6414 for (i
= 1; i
< map
->n
; ++i
) {
6415 isl_pw_aff
*pwaff_i
;
6417 pwaff_i
= basic_map_dim_opt(map
->p
[i
], max
);
6418 pwaff
= isl_pw_aff_union_opt(pwaff
, pwaff_i
, max
);
6426 /* Compute the maximum of the given output dimension as a function of the
6427 * parameters and input dimensions, but independently of
6428 * the other output dimensions.
6430 __isl_give isl_pw_aff
*isl_map_dim_max(__isl_take isl_map
*map
, int pos
)
6432 return map_dim_opt(map
, pos
, 1);
6435 /* Compute the minimum or maximum of the given set dimension
6436 * as a function of the parameters,
6437 * but independently of the other set dimensions.
6439 static __isl_give isl_pw_aff
*set_dim_opt(__isl_take isl_set
*set
, int pos
,
6442 return map_dim_opt(set
, pos
, max
);
6445 /* Compute the maximum of the given set dimension as a function of the
6446 * parameters, but independently of the other set dimensions.
6448 __isl_give isl_pw_aff
*isl_set_dim_max(__isl_take isl_set
*set
, int pos
)
6450 return set_dim_opt(set
, pos
, 1);
6453 /* Compute the minimum of the given set dimension as a function of the
6454 * parameters, but independently of the other set dimensions.
6456 __isl_give isl_pw_aff
*isl_set_dim_min(__isl_take isl_set
*set
, int pos
)
6458 return set_dim_opt(set
, pos
, 0);
6461 /* Apply a preimage specified by "mat" on the parameters of "bset".
6462 * bset is assumed to have only parameters and divs.
6464 static struct isl_basic_set
*basic_set_parameter_preimage(
6465 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
6472 bset
->dim
= isl_space_cow(bset
->dim
);
6476 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6478 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6480 bset
->dim
->nparam
= 0;
6481 bset
->dim
->n_out
= nparam
;
6482 bset
= isl_basic_set_preimage(bset
, mat
);
6484 bset
->dim
->nparam
= bset
->dim
->n_out
;
6485 bset
->dim
->n_out
= 0;
6490 isl_basic_set_free(bset
);
6494 /* Apply a preimage specified by "mat" on the parameters of "set".
6495 * set is assumed to have only parameters and divs.
6497 static struct isl_set
*set_parameter_preimage(
6498 struct isl_set
*set
, struct isl_mat
*mat
)
6500 isl_space
*dim
= NULL
;
6506 dim
= isl_space_copy(set
->dim
);
6507 dim
= isl_space_cow(dim
);
6511 nparam
= isl_set_dim(set
, isl_dim_param
);
6513 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
6516 dim
->n_out
= nparam
;
6517 isl_set_reset_space(set
, dim
);
6518 set
= isl_set_preimage(set
, mat
);
6521 dim
= isl_space_copy(set
->dim
);
6522 dim
= isl_space_cow(dim
);
6525 dim
->nparam
= dim
->n_out
;
6527 isl_set_reset_space(set
, dim
);
6530 isl_space_free(dim
);
6537 /* Intersect the basic set "bset" with the affine space specified by the
6538 * equalities in "eq".
6540 static struct isl_basic_set
*basic_set_append_equalities(
6541 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
6549 bset
= isl_basic_set_extend_space(bset
, isl_space_copy(bset
->dim
), 0,
6554 len
= 1 + isl_space_dim(bset
->dim
, isl_dim_all
) + bset
->extra
;
6555 for (i
= 0; i
< eq
->n_row
; ++i
) {
6556 k
= isl_basic_set_alloc_equality(bset
);
6559 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
6560 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
6564 bset
= isl_basic_set_gauss(bset
, NULL
);
6565 bset
= isl_basic_set_finalize(bset
);
6570 isl_basic_set_free(bset
);
6574 /* Intersect the set "set" with the affine space specified by the
6575 * equalities in "eq".
6577 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
6585 for (i
= 0; i
< set
->n
; ++i
) {
6586 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
6599 /* Given a basic set "bset" that only involves parameters and existentially
6600 * quantified variables, return the index of the first equality
6601 * that only involves parameters. If there is no such equality then
6602 * return bset->n_eq.
6604 * This function assumes that isl_basic_set_gauss has been called on "bset".
6606 static int first_parameter_equality(__isl_keep isl_basic_set
*bset
)
6609 unsigned nparam
, n_div
;
6614 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6615 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
6617 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
6618 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
6625 /* Compute an explicit representation for the existentially quantified
6626 * variables in "bset" by computing the "minimal value" of the set
6627 * variables. Since there are no set variables, the computation of
6628 * the minimal value essentially computes an explicit representation
6629 * of the non-empty part(s) of "bset".
6631 * The input only involves parameters and existentially quantified variables.
6632 * All equalities among parameters have been removed.
6634 * Since the existentially quantified variables in the result are in general
6635 * going to be different from those in the input, we first replace
6636 * them by the minimal number of variables based on their equalities.
6637 * This should simplify the parametric integer programming.
6639 static __isl_give isl_set
*base_compute_divs(__isl_take isl_basic_set
*bset
)
6641 isl_morph
*morph1
, *morph2
;
6647 if (bset
->n_eq
== 0)
6648 return isl_basic_set_lexmin(bset
);
6650 morph1
= isl_basic_set_parameter_compression(bset
);
6651 bset
= isl_morph_basic_set(isl_morph_copy(morph1
), bset
);
6652 bset
= isl_basic_set_lift(bset
);
6653 morph2
= isl_basic_set_variable_compression(bset
, isl_dim_set
);
6654 bset
= isl_morph_basic_set(morph2
, bset
);
6655 n
= isl_basic_set_dim(bset
, isl_dim_set
);
6656 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, 0, n
);
6658 set
= isl_basic_set_lexmin(bset
);
6660 set
= isl_morph_set(isl_morph_inverse(morph1
), set
);
6665 /* Project the given basic set onto its parameter domain, possibly introducing
6666 * new, explicit, existential variables in the constraints.
6667 * The input has parameters and (possibly implicit) existential variables.
6668 * The output has the same parameters, but only
6669 * explicit existentially quantified variables.
6671 * The actual projection is performed by pip, but pip doesn't seem
6672 * to like equalities very much, so we first remove the equalities
6673 * among the parameters by performing a variable compression on
6674 * the parameters. Afterward, an inverse transformation is performed
6675 * and the equalities among the parameters are inserted back in.
6677 * The variable compression on the parameters may uncover additional
6678 * equalities that were only implicit before. We therefore check
6679 * if there are any new parameter equalities in the result and
6680 * if so recurse. The removal of parameter equalities is required
6681 * for the parameter compression performed by base_compute_divs.
6683 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
6687 struct isl_mat
*T
, *T2
;
6688 struct isl_set
*set
;
6691 bset
= isl_basic_set_cow(bset
);
6695 if (bset
->n_eq
== 0)
6696 return base_compute_divs(bset
);
6698 bset
= isl_basic_set_gauss(bset
, NULL
);
6701 if (isl_basic_set_plain_is_empty(bset
))
6702 return isl_set_from_basic_set(bset
);
6704 i
= first_parameter_equality(bset
);
6705 if (i
== bset
->n_eq
)
6706 return base_compute_divs(bset
);
6708 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
6709 eq
= isl_mat_sub_alloc6(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
6711 eq
= isl_mat_cow(eq
);
6712 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
6713 if (T
&& T
->n_col
== 0) {
6717 bset
= isl_basic_set_set_to_empty(bset
);
6718 return isl_set_from_basic_set(bset
);
6720 bset
= basic_set_parameter_preimage(bset
, T
);
6722 i
= first_parameter_equality(bset
);
6725 else if (i
== bset
->n_eq
)
6726 set
= base_compute_divs(bset
);
6728 set
= parameter_compute_divs(bset
);
6729 set
= set_parameter_preimage(set
, T2
);
6730 set
= set_append_equalities(set
, eq
);
6734 /* Insert the divs from "ls" before those of "bmap".
6736 * The number of columns is not changed, which means that the last
6737 * dimensions of "bmap" are being reintepreted as the divs from "ls".
6738 * The caller is responsible for removing the same number of dimensions
6739 * from the space of "bmap".
6741 static __isl_give isl_basic_map
*insert_divs_from_local_space(
6742 __isl_take isl_basic_map
*bmap
, __isl_keep isl_local_space
*ls
)
6748 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6752 old_n_div
= bmap
->n_div
;
6753 bmap
= insert_div_rows(bmap
, n_div
);
6757 for (i
= 0; i
< n_div
; ++i
) {
6758 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], ls
->div
->n_col
);
6759 isl_seq_clr(bmap
->div
[i
] + ls
->div
->n_col
, old_n_div
);
6765 /* Replace the space of "bmap" by the space and divs of "ls".
6767 * If "ls" has any divs, then we simplify the result since we may
6768 * have discovered some additional equalities that could simplify
6769 * the div expressions.
6771 static __isl_give isl_basic_map
*basic_replace_space_by_local_space(
6772 __isl_take isl_basic_map
*bmap
, __isl_take isl_local_space
*ls
)
6776 bmap
= isl_basic_map_cow(bmap
);
6780 n_div
= isl_local_space_dim(ls
, isl_dim_div
);
6781 bmap
= insert_divs_from_local_space(bmap
, ls
);
6785 isl_space_free(bmap
->dim
);
6786 bmap
->dim
= isl_local_space_get_space(ls
);
6790 isl_local_space_free(ls
);
6792 bmap
= isl_basic_map_simplify(bmap
);
6793 bmap
= isl_basic_map_finalize(bmap
);
6796 isl_basic_map_free(bmap
);
6797 isl_local_space_free(ls
);
6801 /* Replace the space of "map" by the space and divs of "ls".
6803 static __isl_give isl_map
*replace_space_by_local_space(__isl_take isl_map
*map
,
6804 __isl_take isl_local_space
*ls
)
6808 map
= isl_map_cow(map
);
6812 for (i
= 0; i
< map
->n
; ++i
) {
6813 map
->p
[i
] = basic_replace_space_by_local_space(map
->p
[i
],
6814 isl_local_space_copy(ls
));
6818 isl_space_free(map
->dim
);
6819 map
->dim
= isl_local_space_get_space(ls
);
6823 isl_local_space_free(ls
);
6826 isl_local_space_free(ls
);
6831 /* Compute an explicit representation for the existentially
6832 * quantified variables for which do not know any explicit representation yet.
6834 * We first sort the existentially quantified variables so that the
6835 * existentially quantified variables for which we already have an explicit
6836 * representation are placed before those for which we do not.
6837 * The input dimensions, the output dimensions and the existentially
6838 * quantified variables for which we already have an explicit
6839 * representation are then turned into parameters.
6840 * compute_divs returns a map with the same parameters and
6841 * no input or output dimensions and the dimension specification
6842 * is reset to that of the input, including the existentially quantified
6843 * variables for which we already had an explicit representation.
6845 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
6847 struct isl_basic_set
*bset
;
6848 struct isl_set
*set
;
6849 struct isl_map
*map
;
6851 isl_local_space
*ls
;
6858 bmap
= isl_basic_map_sort_divs(bmap
);
6859 bmap
= isl_basic_map_cow(bmap
);
6863 for (n_known
= 0; n_known
< bmap
->n_div
; ++n_known
)
6864 if (isl_int_is_zero(bmap
->div
[n_known
][0]))
6867 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
6868 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
6869 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
6870 dim
= isl_space_set_alloc(bmap
->ctx
,
6871 nparam
+ n_in
+ n_out
+ n_known
, 0);
6875 ls
= isl_basic_map_get_local_space(bmap
);
6876 ls
= isl_local_space_drop_dims(ls
, isl_dim_div
,
6877 n_known
, bmap
->n_div
- n_known
);
6879 for (i
= n_known
; i
< bmap
->n_div
; ++i
)
6880 swap_div(bmap
, i
- n_known
, i
);
6881 bmap
->n_div
-= n_known
;
6882 bmap
->extra
-= n_known
;
6884 bmap
= isl_basic_map_reset_space(bmap
, dim
);
6885 bset
= (struct isl_basic_set
*)bmap
;
6887 set
= parameter_compute_divs(bset
);
6888 map
= (struct isl_map
*)set
;
6889 map
= replace_space_by_local_space(map
, ls
);
6893 isl_basic_map_free(bmap
);
6897 int isl_basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
6905 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
6906 for (i
= 0; i
< bmap
->n_div
; ++i
) {
6907 if (isl_int_is_zero(bmap
->div
[i
][0]))
6909 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
6915 static int map_divs_known(__isl_keep isl_map
*map
)
6922 for (i
= 0; i
< map
->n
; ++i
) {
6923 int known
= isl_basic_map_divs_known(map
->p
[i
]);
6931 /* If bmap contains any unknown divs, then compute explicit
6932 * expressions for them. However, this computation may be
6933 * quite expensive, so first try to remove divs that aren't
6936 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
6939 struct isl_map
*map
;
6941 known
= isl_basic_map_divs_known(bmap
);
6945 return isl_map_from_basic_map(bmap
);
6947 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
6949 known
= isl_basic_map_divs_known(bmap
);
6953 return isl_map_from_basic_map(bmap
);
6955 map
= compute_divs(bmap
);
6958 isl_basic_map_free(bmap
);
6962 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
6966 struct isl_map
*res
;
6973 known
= map_divs_known(map
);
6981 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
6982 for (i
= 1 ; i
< map
->n
; ++i
) {
6984 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
6985 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
6986 res
= isl_map_union_disjoint(res
, r2
);
6988 res
= isl_map_union(res
, r2
);
6995 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
6997 return (struct isl_set
*)
6998 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
7001 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
7003 return (struct isl_set
*)
7004 isl_map_compute_divs((struct isl_map
*)set
);
7007 struct isl_set
*isl_map_domain(struct isl_map
*map
)
7010 struct isl_set
*set
;
7015 map
= isl_map_cow(map
);
7019 set
= (struct isl_set
*)map
;
7020 set
->dim
= isl_space_domain(set
->dim
);
7023 for (i
= 0; i
< map
->n
; ++i
) {
7024 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
7028 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
7029 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
7036 /* Return the union of "map1" and "map2", where we assume for now that
7037 * "map1" and "map2" are disjoint. Note that the basic maps inside
7038 * "map1" or "map2" may not be disjoint from each other.
7039 * Also note that this function is also called from isl_map_union,
7040 * which takes care of handling the situation where "map1" and "map2"
7041 * may not be disjoint.
7043 * If one of the inputs is empty, we can simply return the other input.
7044 * Similarly, if one of the inputs is universal, then it is equal to the union.
7046 static __isl_give isl_map
*map_union_disjoint(__isl_take isl_map
*map1
,
7047 __isl_take isl_map
*map2
)
7051 struct isl_map
*map
= NULL
;
7066 is_universe
= isl_map_plain_is_universe(map1
);
7067 if (is_universe
< 0)
7074 is_universe
= isl_map_plain_is_universe(map2
);
7075 if (is_universe
< 0)
7082 isl_assert(map1
->ctx
, isl_space_is_equal(map1
->dim
, map2
->dim
), goto error
);
7084 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
7085 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
7086 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7088 map
= isl_map_alloc_space(isl_space_copy(map1
->dim
),
7089 map1
->n
+ map2
->n
, flags
);
7092 for (i
= 0; i
< map1
->n
; ++i
) {
7093 map
= isl_map_add_basic_map(map
,
7094 isl_basic_map_copy(map1
->p
[i
]));
7098 for (i
= 0; i
< map2
->n
; ++i
) {
7099 map
= isl_map_add_basic_map(map
,
7100 isl_basic_map_copy(map2
->p
[i
]));
7114 __isl_give isl_map
*isl_map_union_disjoint(__isl_take isl_map
*map1
,
7115 __isl_take isl_map
*map2
)
7117 return isl_map_align_params_map_map_and(map1
, map2
, &map_union_disjoint
);
7120 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
7122 map1
= isl_map_union_disjoint(map1
, map2
);
7126 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
7130 struct isl_set
*isl_set_union_disjoint(
7131 struct isl_set
*set1
, struct isl_set
*set2
)
7133 return (struct isl_set
*)
7134 isl_map_union_disjoint(
7135 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
7138 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
7140 return (struct isl_set
*)
7141 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7144 /* Apply "fn" to pairs of elements from "map" and "set" and collect
7147 * "map" and "set" are assumed to be compatible and non-NULL.
7149 static __isl_give isl_map
*map_intersect_set(__isl_take isl_map
*map
,
7150 __isl_take isl_set
*set
,
7151 __isl_give isl_basic_map
*fn(__isl_take isl_basic_map
*bmap
,
7152 __isl_take isl_basic_set
*bset
))
7155 struct isl_map
*result
;
7158 if (isl_set_plain_is_universe(set
)) {
7163 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
7164 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
7165 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
7167 result
= isl_map_alloc_space(isl_space_copy(map
->dim
),
7168 map
->n
* set
->n
, flags
);
7169 for (i
= 0; result
&& i
< map
->n
; ++i
)
7170 for (j
= 0; j
< set
->n
; ++j
) {
7171 result
= isl_map_add_basic_map(result
,
7172 fn(isl_basic_map_copy(map
->p
[i
]),
7173 isl_basic_set_copy(set
->p
[j
])));
7183 static __isl_give isl_map
*map_intersect_range(__isl_take isl_map
*map
,
7184 __isl_take isl_set
*set
)
7189 if (!isl_map_compatible_range(map
, set
))
7190 isl_die(set
->ctx
, isl_error_invalid
,
7191 "incompatible spaces", goto error
);
7193 return map_intersect_set(map
, set
, &isl_basic_map_intersect_range
);
7200 __isl_give isl_map
*isl_map_intersect_range(__isl_take isl_map
*map
,
7201 __isl_take isl_set
*set
)
7203 return isl_map_align_params_map_map_and(map
, set
, &map_intersect_range
);
7206 static __isl_give isl_map
*map_intersect_domain(__isl_take isl_map
*map
,
7207 __isl_take isl_set
*set
)
7212 if (!isl_map_compatible_domain(map
, set
))
7213 isl_die(set
->ctx
, isl_error_invalid
,
7214 "incompatible spaces", goto error
);
7216 return map_intersect_set(map
, set
, &isl_basic_map_intersect_domain
);
7223 __isl_give isl_map
*isl_map_intersect_domain(__isl_take isl_map
*map
,
7224 __isl_take isl_set
*set
)
7226 return isl_map_align_params_map_map_and(map
, set
,
7227 &map_intersect_domain
);
7230 static __isl_give isl_map
*map_apply_domain(__isl_take isl_map
*map1
,
7231 __isl_take isl_map
*map2
)
7235 map1
= isl_map_reverse(map1
);
7236 map1
= isl_map_apply_range(map1
, map2
);
7237 return isl_map_reverse(map1
);
7244 __isl_give isl_map
*isl_map_apply_domain(__isl_take isl_map
*map1
,
7245 __isl_take isl_map
*map2
)
7247 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_domain
);
7250 static __isl_give isl_map
*map_apply_range(__isl_take isl_map
*map1
,
7251 __isl_take isl_map
*map2
)
7253 isl_space
*dim_result
;
7254 struct isl_map
*result
;
7260 dim_result
= isl_space_join(isl_space_copy(map1
->dim
),
7261 isl_space_copy(map2
->dim
));
7263 result
= isl_map_alloc_space(dim_result
, map1
->n
* map2
->n
, 0);
7266 for (i
= 0; i
< map1
->n
; ++i
)
7267 for (j
= 0; j
< map2
->n
; ++j
) {
7268 result
= isl_map_add_basic_map(result
,
7269 isl_basic_map_apply_range(
7270 isl_basic_map_copy(map1
->p
[i
]),
7271 isl_basic_map_copy(map2
->p
[j
])));
7277 if (result
&& result
->n
<= 1)
7278 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
7286 __isl_give isl_map
*isl_map_apply_range(__isl_take isl_map
*map1
,
7287 __isl_take isl_map
*map2
)
7289 return isl_map_align_params_map_map_and(map1
, map2
, &map_apply_range
);
7293 * returns range - domain
7295 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
7297 isl_space
*dims
, *target_dim
;
7298 struct isl_basic_set
*bset
;
7305 isl_assert(bmap
->ctx
, isl_space_tuple_match(bmap
->dim
, isl_dim_in
,
7306 bmap
->dim
, isl_dim_out
),
7308 target_dim
= isl_space_domain(isl_basic_map_get_space(bmap
));
7309 dim
= isl_basic_map_n_in(bmap
);
7310 nparam
= isl_basic_map_n_param(bmap
);
7311 bset
= isl_basic_set_from_basic_map(bmap
);
7312 bset
= isl_basic_set_cow(bset
);
7313 dims
= isl_basic_set_get_space(bset
);
7314 dims
= isl_space_add_dims(dims
, isl_dim_set
, dim
);
7315 bset
= isl_basic_set_extend_space(bset
, dims
, 0, dim
, 0);
7316 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
7317 for (i
= 0; i
< dim
; ++i
) {
7318 int j
= isl_basic_map_alloc_equality(
7319 (struct isl_basic_map
*)bset
);
7321 bset
= isl_basic_set_free(bset
);
7324 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
7325 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
7326 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
7327 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
7329 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
7330 bset
= isl_basic_set_reset_space(bset
, target_dim
);
7333 isl_basic_map_free(bmap
);
7338 * returns range - domain
7340 __isl_give isl_set
*isl_map_deltas(__isl_take isl_map
*map
)
7344 struct isl_set
*result
;
7349 isl_assert(map
->ctx
, isl_space_tuple_match(map
->dim
, isl_dim_in
,
7350 map
->dim
, isl_dim_out
),
7352 dim
= isl_map_get_space(map
);
7353 dim
= isl_space_domain(dim
);
7354 result
= isl_set_alloc_space(dim
, map
->n
, 0);
7357 for (i
= 0; i
< map
->n
; ++i
)
7358 result
= isl_set_add_basic_set(result
,
7359 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
7368 * returns [domain -> range] -> range - domain
7370 __isl_give isl_basic_map
*isl_basic_map_deltas_map(
7371 __isl_take isl_basic_map
*bmap
)
7375 isl_basic_map
*domain
;
7379 if (!isl_space_tuple_match(bmap
->dim
, isl_dim_in
, bmap
->dim
, isl_dim_out
))
7380 isl_die(bmap
->ctx
, isl_error_invalid
,
7381 "domain and range don't match", goto error
);
7383 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
7384 n
= isl_basic_map_dim(bmap
, isl_dim_in
);
7386 dim
= isl_space_from_range(isl_space_domain(isl_basic_map_get_space(bmap
)));
7387 domain
= isl_basic_map_universe(dim
);
7389 bmap
= isl_basic_map_from_domain(isl_basic_map_wrap(bmap
));
7390 bmap
= isl_basic_map_apply_range(bmap
, domain
);
7391 bmap
= isl_basic_map_extend_constraints(bmap
, n
, 0);
7393 total
= isl_basic_map_total_dim(bmap
);
7395 for (i
= 0; i
< n
; ++i
) {
7396 k
= isl_basic_map_alloc_equality(bmap
);
7399 isl_seq_clr(bmap
->eq
[k
], 1 + total
);
7400 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ i
], 1);
7401 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ i
], -1);
7402 isl_int_set_si(bmap
->eq
[k
][1 + nparam
+ n
+ n
+ i
], 1);
7405 bmap
= isl_basic_map_gauss(bmap
, NULL
);
7406 return isl_basic_map_finalize(bmap
);
7408 isl_basic_map_free(bmap
);
7413 * returns [domain -> range] -> range - domain
7415 __isl_give isl_map
*isl_map_deltas_map(__isl_take isl_map
*map
)
7418 isl_space
*domain_dim
;
7423 if (!isl_space_tuple_match(map
->dim
, isl_dim_in
, map
->dim
, isl_dim_out
))
7424 isl_die(map
->ctx
, isl_error_invalid
,
7425 "domain and range don't match", goto error
);
7427 map
= isl_map_cow(map
);
7431 domain_dim
= isl_space_from_range(isl_space_domain(isl_map_get_space(map
)));
7432 map
->dim
= isl_space_from_domain(isl_space_wrap(map
->dim
));
7433 map
->dim
= isl_space_join(map
->dim
, domain_dim
);
7436 for (i
= 0; i
< map
->n
; ++i
) {
7437 map
->p
[i
] = isl_basic_map_deltas_map(map
->p
[i
]);
7441 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
7448 static __isl_give isl_basic_map
*basic_map_identity(__isl_take isl_space
*dims
)
7450 struct isl_basic_map
*bmap
;
7458 nparam
= dims
->nparam
;
7460 bmap
= isl_basic_map_alloc_space(dims
, 0, dim
, 0);
7464 for (i
= 0; i
< dim
; ++i
) {
7465 int j
= isl_basic_map_alloc_equality(bmap
);
7468 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
7469 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
7470 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
7472 return isl_basic_map_finalize(bmap
);
7474 isl_basic_map_free(bmap
);
7478 __isl_give isl_basic_map
*isl_basic_map_identity(__isl_take isl_space
*dim
)
7482 if (dim
->n_in
!= dim
->n_out
)
7483 isl_die(dim
->ctx
, isl_error_invalid
,
7484 "number of input and output dimensions needs to be "
7485 "the same", goto error
);
7486 return basic_map_identity(dim
);
7488 isl_space_free(dim
);
7492 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
7494 if (!model
|| !model
->dim
)
7496 return isl_basic_map_identity(isl_space_copy(model
->dim
));
7499 __isl_give isl_map
*isl_map_identity(__isl_take isl_space
*dim
)
7501 return isl_map_from_basic_map(isl_basic_map_identity(dim
));
7504 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
7506 if (!model
|| !model
->dim
)
7508 return isl_map_identity(isl_space_copy(model
->dim
));
7511 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
7513 if (!model
|| !model
->dim
)
7515 return isl_map_identity(isl_space_copy(model
->dim
));
7518 __isl_give isl_map
*isl_set_identity(__isl_take isl_set
*set
)
7520 isl_space
*dim
= isl_set_get_space(set
);
7522 id
= isl_map_identity(isl_space_map_from_set(dim
));
7523 return isl_map_intersect_range(id
, set
);
7526 /* Construct a basic set with all set dimensions having only non-negative
7529 __isl_give isl_basic_set
*isl_basic_set_positive_orthant(
7530 __isl_take isl_space
*space
)
7535 struct isl_basic_set
*bset
;
7539 nparam
= space
->nparam
;
7541 bset
= isl_basic_set_alloc_space(space
, 0, 0, dim
);
7544 for (i
= 0; i
< dim
; ++i
) {
7545 int k
= isl_basic_set_alloc_inequality(bset
);
7548 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
7549 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
7553 isl_basic_set_free(bset
);
7557 /* Construct the half-space x_pos >= 0.
7559 static __isl_give isl_basic_set
*nonneg_halfspace(__isl_take isl_space
*dim
,
7563 isl_basic_set
*nonneg
;
7565 nonneg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7566 k
= isl_basic_set_alloc_inequality(nonneg
);
7569 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
7570 isl_int_set_si(nonneg
->ineq
[k
][pos
], 1);
7572 return isl_basic_set_finalize(nonneg
);
7574 isl_basic_set_free(nonneg
);
7578 /* Construct the half-space x_pos <= -1.
7580 static __isl_give isl_basic_set
*neg_halfspace(__isl_take isl_space
*dim
, int pos
)
7585 neg
= isl_basic_set_alloc_space(dim
, 0, 0, 1);
7586 k
= isl_basic_set_alloc_inequality(neg
);
7589 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
7590 isl_int_set_si(neg
->ineq
[k
][0], -1);
7591 isl_int_set_si(neg
->ineq
[k
][pos
], -1);
7593 return isl_basic_set_finalize(neg
);
7595 isl_basic_set_free(neg
);
7599 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
7600 enum isl_dim_type type
, unsigned first
, unsigned n
)
7603 isl_basic_set
*nonneg
;
7611 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
7613 for (i
= 0; i
< n
; ++i
) {
7614 nonneg
= nonneg_halfspace(isl_set_get_space(set
),
7615 pos(set
->dim
, type
) + first
+ i
);
7616 neg
= neg_halfspace(isl_set_get_space(set
),
7617 pos(set
->dim
, type
) + first
+ i
);
7619 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
7628 static int foreach_orthant(__isl_take isl_set
*set
, int *signs
, int first
,
7629 int len
, int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7636 if (isl_set_plain_is_empty(set
)) {
7641 return fn(set
, signs
, user
);
7644 half
= isl_set_from_basic_set(nonneg_halfspace(isl_set_get_space(set
),
7646 half
= isl_set_intersect(half
, isl_set_copy(set
));
7647 if (foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
) < 0)
7651 half
= isl_set_from_basic_set(neg_halfspace(isl_set_get_space(set
),
7653 half
= isl_set_intersect(half
, set
);
7654 return foreach_orthant(half
, signs
, first
+ 1, len
, fn
, user
);
7660 /* Call "fn" on the intersections of "set" with each of the orthants
7661 * (except for obviously empty intersections). The orthant is identified
7662 * by the signs array, with each entry having value 1 or -1 according
7663 * to the sign of the corresponding variable.
7665 int isl_set_foreach_orthant(__isl_keep isl_set
*set
,
7666 int (*fn
)(__isl_take isl_set
*orthant
, int *signs
, void *user
),
7676 if (isl_set_plain_is_empty(set
))
7679 nparam
= isl_set_dim(set
, isl_dim_param
);
7680 nvar
= isl_set_dim(set
, isl_dim_set
);
7682 signs
= isl_alloc_array(set
->ctx
, int, nparam
+ nvar
);
7684 r
= foreach_orthant(isl_set_copy(set
), signs
, 0, nparam
+ nvar
,
7692 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
7694 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
7697 int isl_basic_map_is_subset(
7698 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7701 struct isl_map
*map1
;
7702 struct isl_map
*map2
;
7704 if (!bmap1
|| !bmap2
)
7707 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
7708 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
7710 is_subset
= isl_map_is_subset(map1
, map2
);
7718 int isl_basic_set_is_subset(__isl_keep isl_basic_set
*bset1
,
7719 __isl_keep isl_basic_set
*bset2
)
7721 return isl_basic_map_is_subset(bset1
, bset2
);
7724 int isl_basic_map_is_equal(
7725 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7729 if (!bmap1
|| !bmap2
)
7731 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7734 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7738 int isl_basic_set_is_equal(
7739 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7741 return isl_basic_map_is_equal(
7742 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
7745 int isl_map_is_empty(struct isl_map
*map
)
7752 for (i
= 0; i
< map
->n
; ++i
) {
7753 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
7762 int isl_map_plain_is_empty(__isl_keep isl_map
*map
)
7764 return map
? map
->n
== 0 : -1;
7767 int isl_map_fast_is_empty(__isl_keep isl_map
*map
)
7769 return isl_map_plain_is_empty(map
);
7772 int isl_set_plain_is_empty(struct isl_set
*set
)
7774 return set
? set
->n
== 0 : -1;
7777 int isl_set_fast_is_empty(__isl_keep isl_set
*set
)
7779 return isl_set_plain_is_empty(set
);
7782 int isl_set_is_empty(struct isl_set
*set
)
7784 return isl_map_is_empty((struct isl_map
*)set
);
7787 int isl_map_has_equal_space(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7792 return isl_space_is_equal(map1
->dim
, map2
->dim
);
7795 int isl_set_has_equal_space(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7800 return isl_space_is_equal(set1
->dim
, set2
->dim
);
7803 static int map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7809 is_subset
= isl_map_is_subset(map1
, map2
);
7812 is_subset
= isl_map_is_subset(map2
, map1
);
7816 int isl_map_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
7818 return isl_map_align_params_map_map_and_test(map1
, map2
, &map_is_equal
);
7821 int isl_basic_map_is_strict_subset(
7822 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7826 if (!bmap1
|| !bmap2
)
7828 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
7831 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
7832 if (is_subset
== -1)
7837 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
7843 is_subset
= isl_map_is_subset(map1
, map2
);
7846 is_subset
= isl_map_is_subset(map2
, map1
);
7847 if (is_subset
== -1)
7852 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
7854 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
7857 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
7861 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
7864 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
7868 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
7871 int isl_map_plain_is_universe(__isl_keep isl_map
*map
)
7878 for (i
= 0; i
< map
->n
; ++i
) {
7879 int r
= isl_basic_map_is_universe(map
->p
[i
]);
7887 int isl_set_plain_is_universe(__isl_keep isl_set
*set
)
7889 return isl_map_plain_is_universe((isl_map
*) set
);
7892 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
7894 return isl_set_plain_is_universe(set
);
7897 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
7899 struct isl_basic_set
*bset
= NULL
;
7900 struct isl_vec
*sample
= NULL
;
7907 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
7910 if (isl_basic_map_is_universe(bmap
))
7913 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
7914 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
7915 copy
= isl_basic_map_remove_redundancies(copy
);
7916 empty
= isl_basic_map_plain_is_empty(copy
);
7917 isl_basic_map_free(copy
);
7921 total
= 1 + isl_basic_map_total_dim(bmap
);
7922 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
7923 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
7929 isl_vec_free(bmap
->sample
);
7930 bmap
->sample
= NULL
;
7931 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
7934 sample
= isl_basic_set_sample_vec(bset
);
7937 empty
= sample
->size
== 0;
7938 isl_vec_free(bmap
->sample
);
7939 bmap
->sample
= sample
;
7941 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
7946 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map
*bmap
)
7950 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
7953 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map
*bmap
)
7955 return isl_basic_map_plain_is_empty(bmap
);
7958 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set
*bset
)
7962 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
7965 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set
*bset
)
7967 return isl_basic_set_plain_is_empty(bset
);
7970 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
7972 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
7975 struct isl_map
*isl_basic_map_union(
7976 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
7978 struct isl_map
*map
;
7979 if (!bmap1
|| !bmap2
)
7982 isl_assert(bmap1
->ctx
, isl_space_is_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
7984 map
= isl_map_alloc_space(isl_space_copy(bmap1
->dim
), 2, 0);
7987 map
= isl_map_add_basic_map(map
, bmap1
);
7988 map
= isl_map_add_basic_map(map
, bmap2
);
7991 isl_basic_map_free(bmap1
);
7992 isl_basic_map_free(bmap2
);
7996 struct isl_set
*isl_basic_set_union(
7997 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
7999 return (struct isl_set
*)isl_basic_map_union(
8000 (struct isl_basic_map
*)bset1
,
8001 (struct isl_basic_map
*)bset2
);
8004 /* Order divs such that any div only depends on previous divs */
8005 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
8013 off
= isl_space_dim(bmap
->dim
, isl_dim_all
);
8015 for (i
= 0; i
< bmap
->n_div
; ++i
) {
8017 if (isl_int_is_zero(bmap
->div
[i
][0]))
8019 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
8023 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
8029 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
8031 return (struct isl_basic_set
*)
8032 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
8035 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
8042 for (i
= 0; i
< map
->n
; ++i
) {
8043 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
8054 /* Apply the expansion computed by isl_merge_divs.
8055 * The expansion itself is given by "exp" while the resulting
8056 * list of divs is given by "div".
8058 __isl_give isl_basic_set
*isl_basic_set_expand_divs(
8059 __isl_take isl_basic_set
*bset
, __isl_take isl_mat
*div
, int *exp
)
8064 bset
= isl_basic_set_cow(bset
);
8068 if (div
->n_row
< bset
->n_div
)
8069 isl_die(isl_mat_get_ctx(div
), isl_error_invalid
,
8070 "not an expansion", goto error
);
8072 n_div
= bset
->n_div
;
8073 bset
= isl_basic_map_extend_space(bset
, isl_space_copy(bset
->dim
),
8074 div
->n_row
- n_div
, 0,
8075 2 * (div
->n_row
- n_div
));
8077 for (i
= n_div
; i
< div
->n_row
; ++i
)
8078 if (isl_basic_set_alloc_div(bset
) < 0)
8082 for (i
= div
->n_row
- 1; i
>= 0; --i
) {
8083 if (j
>= 0 && exp
[j
] == i
) {
8085 isl_basic_map_swap_div(bset
, i
, j
);
8088 isl_seq_cpy(bset
->div
[i
], div
->row
[i
], div
->n_col
);
8089 if (isl_basic_map_add_div_constraints(bset
, i
) < 0)
8097 isl_basic_set_free(bset
);
8102 /* Look for a div in dst that corresponds to the div "div" in src.
8103 * The divs before "div" in src and dst are assumed to be the same.
8105 * Returns -1 if no corresponding div was found and the position
8106 * of the corresponding div in dst otherwise.
8108 static int find_div(struct isl_basic_map
*dst
,
8109 struct isl_basic_map
*src
, unsigned div
)
8113 unsigned total
= isl_space_dim(src
->dim
, isl_dim_all
);
8115 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
8116 for (i
= div
; i
< dst
->n_div
; ++i
)
8117 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
8118 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
8119 dst
->n_div
- div
) == -1)
8124 struct isl_basic_map
*isl_basic_map_align_divs(
8125 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
8133 if (src
->n_div
== 0)
8136 for (i
= 0; i
< src
->n_div
; ++i
)
8137 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
8139 src
= isl_basic_map_order_divs(src
);
8140 dst
= isl_basic_map_cow(dst
);
8143 dst
= isl_basic_map_extend_space(dst
, isl_space_copy(dst
->dim
),
8144 src
->n_div
, 0, 2 * src
->n_div
);
8147 total
= isl_space_dim(src
->dim
, isl_dim_all
);
8148 for (i
= 0; i
< src
->n_div
; ++i
) {
8149 int j
= find_div(dst
, src
, i
);
8151 j
= isl_basic_map_alloc_div(dst
);
8154 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
8155 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
8156 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
8160 isl_basic_map_swap_div(dst
, i
, j
);
8164 isl_basic_map_free(dst
);
8168 struct isl_basic_set
*isl_basic_set_align_divs(
8169 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
8171 return (struct isl_basic_set
*)isl_basic_map_align_divs(
8172 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
8175 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
8183 map
= isl_map_compute_divs(map
);
8184 map
= isl_map_cow(map
);
8188 for (i
= 1; i
< map
->n
; ++i
)
8189 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
8190 for (i
= 1; i
< map
->n
; ++i
) {
8191 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
8193 return isl_map_free(map
);
8196 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
8200 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
8202 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
8205 static __isl_give isl_set
*set_apply( __isl_take isl_set
*set
,
8206 __isl_take isl_map
*map
)
8210 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
8211 map
= isl_map_intersect_domain(map
, set
);
8212 set
= isl_map_range(map
);
8220 __isl_give isl_set
*isl_set_apply( __isl_take isl_set
*set
,
8221 __isl_take isl_map
*map
)
8223 return isl_map_align_params_map_map_and(set
, map
, &set_apply
);
8226 /* There is no need to cow as removing empty parts doesn't change
8227 * the meaning of the set.
8229 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
8236 for (i
= map
->n
- 1; i
>= 0; --i
)
8237 remove_if_empty(map
, i
);
8242 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
8244 return (struct isl_set
*)
8245 isl_map_remove_empty_parts((struct isl_map
*)set
);
8248 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
8250 struct isl_basic_map
*bmap
;
8251 if (!map
|| map
->n
== 0)
8253 bmap
= map
->p
[map
->n
-1];
8254 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
8255 return isl_basic_map_copy(bmap
);
8258 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
8260 return (struct isl_basic_set
*)
8261 isl_map_copy_basic_map((struct isl_map
*)set
);
8264 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
8265 __isl_keep isl_basic_map
*bmap
)
8271 for (i
= map
->n
-1; i
>= 0; --i
) {
8272 if (map
->p
[i
] != bmap
)
8274 map
= isl_map_cow(map
);
8277 isl_basic_map_free(map
->p
[i
]);
8278 if (i
!= map
->n
-1) {
8279 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
8280 map
->p
[i
] = map
->p
[map
->n
-1];
8291 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
8292 struct isl_basic_set
*bset
)
8294 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
8295 (struct isl_basic_map
*)bset
);
8298 /* Given two basic sets bset1 and bset2, compute the maximal difference
8299 * between the values of dimension pos in bset1 and those in bset2
8300 * for any common value of the parameters and dimensions preceding pos.
8302 static enum isl_lp_result
basic_set_maximal_difference_at(
8303 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
8304 int pos
, isl_int
*opt
)
8307 struct isl_basic_map
*bmap1
= NULL
;
8308 struct isl_basic_map
*bmap2
= NULL
;
8309 struct isl_ctx
*ctx
;
8310 struct isl_vec
*obj
;
8313 unsigned dim1
, dim2
;
8314 enum isl_lp_result res
;
8316 if (!bset1
|| !bset2
)
8317 return isl_lp_error
;
8319 nparam
= isl_basic_set_n_param(bset1
);
8320 dim1
= isl_basic_set_n_dim(bset1
);
8321 dim2
= isl_basic_set_n_dim(bset2
);
8322 dims
= isl_space_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
8323 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
8324 dims
= isl_space_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
8325 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
8326 if (!bmap1
|| !bmap2
)
8328 bmap1
= isl_basic_map_cow(bmap1
);
8329 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
8330 pos
, (dim1
- pos
) + (dim2
- pos
),
8331 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
8332 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
8335 total
= isl_basic_map_total_dim(bmap1
);
8337 obj
= isl_vec_alloc(ctx
, 1 + total
);
8340 isl_seq_clr(obj
->block
.data
, 1 + total
);
8341 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
8342 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
8343 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
8345 isl_basic_map_free(bmap1
);
8349 isl_basic_map_free(bmap2
);
8351 isl_basic_map_free(bmap1
);
8352 return isl_lp_error
;
8355 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
8356 * for any common value of the parameters and dimensions preceding pos
8357 * in both basic sets, the values of dimension pos in bset1 are
8358 * smaller or larger than those in bset2.
8361 * 1 if bset1 follows bset2
8362 * -1 if bset1 precedes bset2
8363 * 0 if bset1 and bset2 are incomparable
8364 * -2 if some error occurred.
8366 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
8367 struct isl_basic_set
*bset2
, int pos
)
8370 enum isl_lp_result res
;
8375 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8377 if (res
== isl_lp_empty
)
8379 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8380 res
== isl_lp_unbounded
)
8382 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8391 /* Given two basic sets bset1 and bset2, check whether
8392 * for any common value of the parameters and dimensions preceding pos
8393 * there is a value of dimension pos in bset1 that is larger
8394 * than a value of the same dimension in bset2.
8397 * 1 if there exists such a pair
8398 * 0 if there is no such pair, but there is a pair of equal values
8400 * -2 if some error occurred.
8402 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
8403 __isl_keep isl_basic_set
*bset2
, int pos
)
8406 enum isl_lp_result res
;
8411 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
8413 if (res
== isl_lp_empty
)
8415 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
8416 res
== isl_lp_unbounded
)
8418 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
8420 else if (res
== isl_lp_ok
)
8429 /* Given two sets set1 and set2, check whether
8430 * for any common value of the parameters and dimensions preceding pos
8431 * there is a value of dimension pos in set1 that is larger
8432 * than a value of the same dimension in set2.
8435 * 1 if there exists such a pair
8436 * 0 if there is no such pair, but there is a pair of equal values
8438 * -2 if some error occurred.
8440 int isl_set_follows_at(__isl_keep isl_set
*set1
,
8441 __isl_keep isl_set
*set2
, int pos
)
8449 for (i
= 0; i
< set1
->n
; ++i
)
8450 for (j
= 0; j
< set2
->n
; ++j
) {
8452 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
8453 if (f
== 1 || f
== -2)
8462 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map
*bmap
,
8463 unsigned pos
, isl_int
*val
)
8471 total
= isl_basic_map_total_dim(bmap
);
8472 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
8473 for (; d
+1 > pos
; --d
)
8474 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
8478 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
8480 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
8482 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
8485 isl_int_neg(*val
, bmap
->eq
[i
][0]);
8491 static int isl_map_plain_has_fixed_var(__isl_keep isl_map
*map
,
8492 unsigned pos
, isl_int
*val
)
8504 return isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, val
);
8507 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[0], pos
, &v
);
8508 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
8509 fixed
= isl_basic_map_plain_has_fixed_var(map
->p
[i
], pos
, &tmp
);
8510 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8514 isl_int_set(*val
, v
);
8520 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set
*bset
,
8521 unsigned pos
, isl_int
*val
)
8523 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map
*)bset
,
8527 static int isl_set_plain_has_fixed_var(__isl_keep isl_set
*set
, unsigned pos
,
8530 return isl_map_plain_has_fixed_var((struct isl_map
*)set
, pos
, val
);
8533 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map
*bmap
,
8534 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8536 if (pos
>= isl_basic_map_dim(bmap
, type
))
8538 return isl_basic_map_plain_has_fixed_var(bmap
,
8539 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
8542 /* If "bmap" obviously lies on a hyperplane where the given dimension
8543 * has a fixed value, then return that value.
8544 * Otherwise return NaN.
8546 __isl_give isl_val
*isl_basic_map_plain_get_val_if_fixed(
8547 __isl_keep isl_basic_map
*bmap
,
8548 enum isl_dim_type type
, unsigned pos
)
8556 ctx
= isl_basic_map_get_ctx(bmap
);
8557 v
= isl_val_alloc(ctx
);
8560 fixed
= isl_basic_map_plain_is_fixed(bmap
, type
, pos
, &v
->n
);
8562 return isl_val_free(v
);
8564 isl_int_set_si(v
->d
, 1);
8568 return isl_val_nan(ctx
);
8571 int isl_map_plain_is_fixed(__isl_keep isl_map
*map
,
8572 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8574 if (pos
>= isl_map_dim(map
, type
))
8576 return isl_map_plain_has_fixed_var(map
,
8577 map_offset(map
, type
) - 1 + pos
, val
);
8580 /* If "map" obviously lies on a hyperplane where the given dimension
8581 * has a fixed value, then return that value.
8582 * Otherwise return NaN.
8584 __isl_give isl_val
*isl_map_plain_get_val_if_fixed(__isl_keep isl_map
*map
,
8585 enum isl_dim_type type
, unsigned pos
)
8593 ctx
= isl_map_get_ctx(map
);
8594 v
= isl_val_alloc(ctx
);
8597 fixed
= isl_map_plain_is_fixed(map
, type
, pos
, &v
->n
);
8599 return isl_val_free(v
);
8601 isl_int_set_si(v
->d
, 1);
8605 return isl_val_nan(ctx
);
8608 /* If "set" obviously lies on a hyperplane where the given dimension
8609 * has a fixed value, then return that value.
8610 * Otherwise return NaN.
8612 __isl_give isl_val
*isl_set_plain_get_val_if_fixed(__isl_keep isl_set
*set
,
8613 enum isl_dim_type type
, unsigned pos
)
8615 return isl_map_plain_get_val_if_fixed(set
, type
, pos
);
8618 int isl_set_plain_is_fixed(__isl_keep isl_set
*set
,
8619 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8621 return isl_map_plain_is_fixed(set
, type
, pos
, val
);
8624 int isl_map_fast_is_fixed(__isl_keep isl_map
*map
,
8625 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
8627 return isl_map_plain_is_fixed(map
, type
, pos
, val
);
8630 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8631 * then return this fixed value in *val.
8633 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set
*bset
,
8634 unsigned dim
, isl_int
*val
)
8636 return isl_basic_set_plain_has_fixed_var(bset
,
8637 isl_basic_set_n_param(bset
) + dim
, val
);
8640 /* Check if dimension dim has fixed value and if so and if val is not NULL,
8641 * then return this fixed value in *val.
8643 int isl_set_plain_dim_is_fixed(__isl_keep isl_set
*set
,
8644 unsigned dim
, isl_int
*val
)
8646 return isl_set_plain_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
8649 int isl_set_fast_dim_is_fixed(__isl_keep isl_set
*set
,
8650 unsigned dim
, isl_int
*val
)
8652 return isl_set_plain_dim_is_fixed(set
, dim
, val
);
8655 /* Check if input variable in has fixed value and if so and if val is not NULL,
8656 * then return this fixed value in *val.
8658 int isl_map_plain_input_is_fixed(__isl_keep isl_map
*map
,
8659 unsigned in
, isl_int
*val
)
8661 return isl_map_plain_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
8664 /* Check if dimension dim has an (obvious) fixed lower bound and if so
8665 * and if val is not NULL, then return this lower bound in *val.
8667 int isl_basic_set_plain_dim_has_fixed_lower_bound(
8668 __isl_keep isl_basic_set
*bset
, unsigned dim
, isl_int
*val
)
8670 int i
, i_eq
= -1, i_ineq
= -1;
8677 total
= isl_basic_set_total_dim(bset
);
8678 nparam
= isl_basic_set_n_param(bset
);
8679 for (i
= 0; i
< bset
->n_eq
; ++i
) {
8680 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
8686 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
8687 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
8689 if (i_eq
!= -1 || i_ineq
!= -1)
8693 if (i_eq
== -1 && i_ineq
== -1)
8695 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
8696 /* The coefficient should always be one due to normalization. */
8697 if (!isl_int_is_one(c
[1+nparam
+dim
]))
8699 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
8701 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
8702 total
- nparam
- dim
- 1) != -1)
8705 isl_int_neg(*val
, c
[0]);
8709 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set
*set
,
8710 unsigned dim
, isl_int
*val
)
8722 return isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8726 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[0],
8728 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
8729 fixed
= isl_basic_set_plain_dim_has_fixed_lower_bound(set
->p
[i
],
8731 if (fixed
== 1 && isl_int_ne(tmp
, v
))
8735 isl_int_set(*val
, v
);
8746 /* uset_gist depends on constraints without existentially quantified
8747 * variables sorting first.
8749 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
8751 const struct constraint
*c1
= (const struct constraint
*)p1
;
8752 const struct constraint
*c2
= (const struct constraint
*)p2
;
8754 unsigned size
= isl_min(c1
->size
, c2
->size
);
8756 l1
= isl_seq_last_non_zero(c1
->c
+ 1, size
);
8757 l2
= isl_seq_last_non_zero(c2
->c
+ 1, size
);
8762 return isl_seq_cmp(c1
->c
+ 1, c2
->c
+ 1, size
);
8765 static struct isl_basic_map
*isl_basic_map_sort_constraints(
8766 struct isl_basic_map
*bmap
)
8769 struct constraint
*c
;
8774 if (bmap
->n_ineq
== 0)
8776 total
= isl_basic_map_total_dim(bmap
);
8777 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
8780 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
8782 c
[i
].c
= bmap
->ineq
[i
];
8784 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
8785 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
8786 bmap
->ineq
[i
] = c
[i
].c
;
8790 isl_basic_map_free(bmap
);
8794 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
8795 __isl_take isl_basic_set
*bset
)
8797 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
8798 (struct isl_basic_map
*)bset
);
8801 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
8805 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
8807 bmap
= isl_basic_map_remove_redundancies(bmap
);
8808 bmap
= isl_basic_map_sort_constraints(bmap
);
8810 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
8814 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
8816 return (struct isl_basic_set
*)isl_basic_map_normalize(
8817 (struct isl_basic_map
*)bset
);
8820 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map
*bmap1
,
8821 const __isl_keep isl_basic_map
*bmap2
)
8828 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) !=
8829 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_RATIONAL
))
8830 return ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_RATIONAL
) ? -1 : 1;
8831 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
8832 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
8833 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
8834 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8835 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
8836 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
8837 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
8838 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8840 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
8842 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
8844 if (bmap1
->n_eq
!= bmap2
->n_eq
)
8845 return bmap1
->n_eq
- bmap2
->n_eq
;
8846 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
8847 return bmap1
->n_ineq
- bmap2
->n_ineq
;
8848 if (bmap1
->n_div
!= bmap2
->n_div
)
8849 return bmap1
->n_div
- bmap2
->n_div
;
8850 total
= isl_basic_map_total_dim(bmap1
);
8851 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
8852 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
8856 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
8857 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
8861 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
8862 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
8869 int isl_basic_set_plain_cmp(const __isl_keep isl_basic_set
*bset1
,
8870 const __isl_keep isl_basic_set
*bset2
)
8872 return isl_basic_map_plain_cmp(bset1
, bset2
);
8875 int isl_set_plain_cmp(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
8881 if (set1
->n
!= set2
->n
)
8882 return set1
->n
- set2
->n
;
8884 for (i
= 0; i
< set1
->n
; ++i
) {
8885 cmp
= isl_basic_set_plain_cmp(set1
->p
[i
], set2
->p
[i
]);
8893 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map
*bmap1
,
8894 __isl_keep isl_basic_map
*bmap2
)
8896 return isl_basic_map_plain_cmp(bmap1
, bmap2
) == 0;
8899 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set
*bset1
,
8900 __isl_keep isl_basic_set
*bset2
)
8902 return isl_basic_map_plain_is_equal((isl_basic_map
*)bset1
,
8903 (isl_basic_map
*)bset2
);
8906 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
8908 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
8909 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
8911 return isl_basic_map_plain_cmp(bmap1
, bmap2
);
8914 /* We normalize in place, but if anything goes wrong we need
8915 * to return NULL, so we need to make sure we don't change the
8916 * meaning of any possible other copies of map.
8918 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
8921 struct isl_basic_map
*bmap
;
8925 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
8927 for (i
= 0; i
< map
->n
; ++i
) {
8928 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
8931 isl_basic_map_free(map
->p
[i
]);
8934 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
8935 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
8936 map
= isl_map_remove_empty_parts(map
);
8939 for (i
= map
->n
- 1; i
>= 1; --i
) {
8940 if (!isl_basic_map_plain_is_equal(map
->p
[i
-1], map
->p
[i
]))
8942 isl_basic_map_free(map
->p
[i
-1]);
8943 for (j
= i
; j
< map
->n
; ++j
)
8944 map
->p
[j
-1] = map
->p
[j
];
8954 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
8956 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
8959 int isl_map_plain_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8969 if (!isl_space_is_equal(map1
->dim
, map2
->dim
))
8972 map1
= isl_map_copy(map1
);
8973 map2
= isl_map_copy(map2
);
8974 map1
= isl_map_normalize(map1
);
8975 map2
= isl_map_normalize(map2
);
8978 equal
= map1
->n
== map2
->n
;
8979 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
8980 equal
= isl_basic_map_plain_is_equal(map1
->p
[i
], map2
->p
[i
]);
8993 int isl_map_fast_is_equal(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
8995 return isl_map_plain_is_equal(map1
, map2
);
8998 int isl_set_plain_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9000 return isl_map_plain_is_equal((struct isl_map
*)set1
,
9001 (struct isl_map
*)set2
);
9004 int isl_set_fast_is_equal(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
9006 return isl_set_plain_is_equal(set1
, set2
);
9009 /* Return an interval that ranges from min to max (inclusive)
9011 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
9012 isl_int min
, isl_int max
)
9015 struct isl_basic_set
*bset
= NULL
;
9017 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
9021 k
= isl_basic_set_alloc_inequality(bset
);
9024 isl_int_set_si(bset
->ineq
[k
][1], 1);
9025 isl_int_neg(bset
->ineq
[k
][0], min
);
9027 k
= isl_basic_set_alloc_inequality(bset
);
9030 isl_int_set_si(bset
->ineq
[k
][1], -1);
9031 isl_int_set(bset
->ineq
[k
][0], max
);
9035 isl_basic_set_free(bset
);
9039 /* Return the Cartesian product of the basic sets in list (in the given order).
9041 __isl_give isl_basic_set
*isl_basic_set_list_product(
9042 __isl_take
struct isl_basic_set_list
*list
)
9050 struct isl_basic_set
*product
= NULL
;
9054 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
9055 isl_assert(list
->ctx
, list
->p
[0], goto error
);
9056 nparam
= isl_basic_set_n_param(list
->p
[0]);
9057 dim
= isl_basic_set_n_dim(list
->p
[0]);
9058 extra
= list
->p
[0]->n_div
;
9059 n_eq
= list
->p
[0]->n_eq
;
9060 n_ineq
= list
->p
[0]->n_ineq
;
9061 for (i
= 1; i
< list
->n
; ++i
) {
9062 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
9063 isl_assert(list
->ctx
,
9064 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
9065 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9066 extra
+= list
->p
[i
]->n_div
;
9067 n_eq
+= list
->p
[i
]->n_eq
;
9068 n_ineq
+= list
->p
[i
]->n_ineq
;
9070 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
9075 for (i
= 0; i
< list
->n
; ++i
) {
9076 isl_basic_set_add_constraints(product
,
9077 isl_basic_set_copy(list
->p
[i
]), dim
);
9078 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
9080 isl_basic_set_list_free(list
);
9083 isl_basic_set_free(product
);
9084 isl_basic_set_list_free(list
);
9088 struct isl_basic_map
*isl_basic_map_product(
9089 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
9091 isl_space
*dim_result
= NULL
;
9092 struct isl_basic_map
*bmap
;
9093 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
9094 struct isl_dim_map
*dim_map1
, *dim_map2
;
9096 if (!bmap1
|| !bmap2
)
9099 isl_assert(bmap1
->ctx
, isl_space_match(bmap1
->dim
, isl_dim_param
,
9100 bmap2
->dim
, isl_dim_param
), goto error
);
9101 dim_result
= isl_space_product(isl_space_copy(bmap1
->dim
),
9102 isl_space_copy(bmap2
->dim
));
9104 in1
= isl_basic_map_n_in(bmap1
);
9105 in2
= isl_basic_map_n_in(bmap2
);
9106 out1
= isl_basic_map_n_out(bmap1
);
9107 out2
= isl_basic_map_n_out(bmap2
);
9108 nparam
= isl_basic_map_n_param(bmap1
);
9110 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9111 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9112 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9113 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9114 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9115 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9116 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9117 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9118 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9119 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9120 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9122 bmap
= isl_basic_map_alloc_space(dim_result
,
9123 bmap1
->n_div
+ bmap2
->n_div
,
9124 bmap1
->n_eq
+ bmap2
->n_eq
,
9125 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9126 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9127 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9128 bmap
= isl_basic_map_simplify(bmap
);
9129 return isl_basic_map_finalize(bmap
);
9131 isl_basic_map_free(bmap1
);
9132 isl_basic_map_free(bmap2
);
9136 __isl_give isl_basic_map
*isl_basic_map_flat_product(
9137 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9139 isl_basic_map
*prod
;
9141 prod
= isl_basic_map_product(bmap1
, bmap2
);
9142 prod
= isl_basic_map_flatten(prod
);
9146 __isl_give isl_basic_set
*isl_basic_set_flat_product(
9147 __isl_take isl_basic_set
*bset1
, __isl_take isl_basic_set
*bset2
)
9149 return isl_basic_map_flat_range_product(bset1
, bset2
);
9152 __isl_give isl_basic_map
*isl_basic_map_domain_product(
9153 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9155 isl_space
*space_result
= NULL
;
9156 isl_basic_map
*bmap
;
9157 unsigned in1
, in2
, out
, nparam
, total
, pos
;
9158 struct isl_dim_map
*dim_map1
, *dim_map2
;
9160 if (!bmap1
|| !bmap2
)
9163 space_result
= isl_space_domain_product(isl_space_copy(bmap1
->dim
),
9164 isl_space_copy(bmap2
->dim
));
9166 in1
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9167 in2
= isl_basic_map_dim(bmap2
, isl_dim_in
);
9168 out
= isl_basic_map_dim(bmap1
, isl_dim_out
);
9169 nparam
= isl_basic_map_dim(bmap1
, isl_dim_param
);
9171 total
= nparam
+ in1
+ in2
+ out
+ bmap1
->n_div
+ bmap2
->n_div
;
9172 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9173 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9174 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9175 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9176 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9177 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
9178 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
9179 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
);
9180 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out
);
9181 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9183 bmap
= isl_basic_map_alloc_space(space_result
,
9184 bmap1
->n_div
+ bmap2
->n_div
,
9185 bmap1
->n_eq
+ bmap2
->n_eq
,
9186 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9187 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9188 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9189 bmap
= isl_basic_map_simplify(bmap
);
9190 return isl_basic_map_finalize(bmap
);
9192 isl_basic_map_free(bmap1
);
9193 isl_basic_map_free(bmap2
);
9197 __isl_give isl_basic_map
*isl_basic_map_range_product(
9198 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9200 isl_space
*dim_result
= NULL
;
9201 isl_basic_map
*bmap
;
9202 unsigned in
, out1
, out2
, nparam
, total
, pos
;
9203 struct isl_dim_map
*dim_map1
, *dim_map2
;
9205 if (!bmap1
|| !bmap2
)
9208 if (!isl_space_match(bmap1
->dim
, isl_dim_param
,
9209 bmap2
->dim
, isl_dim_param
))
9210 isl_die(isl_basic_map_get_ctx(bmap1
), isl_error_invalid
,
9211 "parameters don't match", goto error
);
9213 dim_result
= isl_space_range_product(isl_space_copy(bmap1
->dim
),
9214 isl_space_copy(bmap2
->dim
));
9216 in
= isl_basic_map_dim(bmap1
, isl_dim_in
);
9217 out1
= isl_basic_map_n_out(bmap1
);
9218 out2
= isl_basic_map_n_out(bmap2
);
9219 nparam
= isl_basic_map_n_param(bmap1
);
9221 total
= nparam
+ in
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
9222 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9223 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
9224 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
9225 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
9226 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
9227 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
9228 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in
);
9229 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
9230 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
9231 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
9233 bmap
= isl_basic_map_alloc_space(dim_result
,
9234 bmap1
->n_div
+ bmap2
->n_div
,
9235 bmap1
->n_eq
+ bmap2
->n_eq
,
9236 bmap1
->n_ineq
+ bmap2
->n_ineq
);
9237 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
9238 bmap
= isl_basic_map_add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
9239 bmap
= isl_basic_map_simplify(bmap
);
9240 return isl_basic_map_finalize(bmap
);
9242 isl_basic_map_free(bmap1
);
9243 isl_basic_map_free(bmap2
);
9247 __isl_give isl_basic_map
*isl_basic_map_flat_range_product(
9248 __isl_take isl_basic_map
*bmap1
, __isl_take isl_basic_map
*bmap2
)
9250 isl_basic_map
*prod
;
9252 prod
= isl_basic_map_range_product(bmap1
, bmap2
);
9253 prod
= isl_basic_map_flatten_range(prod
);
9257 static __isl_give isl_map
*map_product(__isl_take isl_map
*map1
,
9258 __isl_take isl_map
*map2
,
9259 __isl_give isl_space
*(*dim_product
)(__isl_take isl_space
*left
,
9260 __isl_take isl_space
*right
),
9261 __isl_give isl_basic_map
*(*basic_map_product
)(
9262 __isl_take isl_basic_map
*left
, __isl_take isl_basic_map
*right
))
9265 struct isl_map
*result
;
9271 isl_assert(map1
->ctx
, isl_space_match(map1
->dim
, isl_dim_param
,
9272 map2
->dim
, isl_dim_param
), goto error
);
9274 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
9275 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
9276 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
9278 result
= isl_map_alloc_space(dim_product(isl_space_copy(map1
->dim
),
9279 isl_space_copy(map2
->dim
)),
9280 map1
->n
* map2
->n
, flags
);
9283 for (i
= 0; i
< map1
->n
; ++i
)
9284 for (j
= 0; j
< map2
->n
; ++j
) {
9285 struct isl_basic_map
*part
;
9286 part
= basic_map_product(isl_basic_map_copy(map1
->p
[i
]),
9287 isl_basic_map_copy(map2
->p
[j
]));
9288 if (isl_basic_map_is_empty(part
))
9289 isl_basic_map_free(part
);
9291 result
= isl_map_add_basic_map(result
, part
);
9304 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
9306 static __isl_give isl_map
*map_product_aligned(__isl_take isl_map
*map1
,
9307 __isl_take isl_map
*map2
)
9309 return map_product(map1
, map2
, &isl_space_product
, &isl_basic_map_product
);
9312 __isl_give isl_map
*isl_map_product(__isl_take isl_map
*map1
,
9313 __isl_take isl_map
*map2
)
9315 return isl_map_align_params_map_map_and(map1
, map2
, &map_product_aligned
);
9318 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
9320 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
9321 __isl_take isl_map
*map2
)
9325 prod
= isl_map_product(map1
, map2
);
9326 prod
= isl_map_flatten(prod
);
9330 /* Given two set A and B, construct its Cartesian product A x B.
9332 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
9334 return isl_map_range_product(set1
, set2
);
9337 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
9338 __isl_take isl_set
*set2
)
9340 return isl_map_flat_range_product(set1
, set2
);
9343 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> (B * D)
9345 static __isl_give isl_map
*map_domain_product_aligned(__isl_take isl_map
*map1
,
9346 __isl_take isl_map
*map2
)
9348 return map_product(map1
, map2
, &isl_space_domain_product
,
9349 &isl_basic_map_domain_product
);
9352 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
9354 static __isl_give isl_map
*map_range_product_aligned(__isl_take isl_map
*map1
,
9355 __isl_take isl_map
*map2
)
9357 return map_product(map1
, map2
, &isl_space_range_product
,
9358 &isl_basic_map_range_product
);
9361 __isl_give isl_map
*isl_map_domain_product(__isl_take isl_map
*map1
,
9362 __isl_take isl_map
*map2
)
9364 return isl_map_align_params_map_map_and(map1
, map2
,
9365 &map_domain_product_aligned
);
9368 __isl_give isl_map
*isl_map_range_product(__isl_take isl_map
*map1
,
9369 __isl_take isl_map
*map2
)
9371 return isl_map_align_params_map_map_and(map1
, map2
,
9372 &map_range_product_aligned
);
9375 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B * D)
9377 __isl_give isl_map
*isl_map_flat_domain_product(__isl_take isl_map
*map1
,
9378 __isl_take isl_map
*map2
)
9382 prod
= isl_map_domain_product(map1
, map2
);
9383 prod
= isl_map_flatten_domain(prod
);
9387 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
9389 __isl_give isl_map
*isl_map_flat_range_product(__isl_take isl_map
*map1
,
9390 __isl_take isl_map
*map2
)
9394 prod
= isl_map_range_product(map1
, map2
);
9395 prod
= isl_map_flatten_range(prod
);
9399 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map
*bmap
)
9402 uint32_t hash
= isl_hash_init();
9407 bmap
= isl_basic_map_copy(bmap
);
9408 bmap
= isl_basic_map_normalize(bmap
);
9411 total
= isl_basic_map_total_dim(bmap
);
9412 isl_hash_byte(hash
, bmap
->n_eq
& 0xFF);
9413 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
9415 c_hash
= isl_seq_get_hash(bmap
->eq
[i
], 1 + total
);
9416 isl_hash_hash(hash
, c_hash
);
9418 isl_hash_byte(hash
, bmap
->n_ineq
& 0xFF);
9419 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9421 c_hash
= isl_seq_get_hash(bmap
->ineq
[i
], 1 + total
);
9422 isl_hash_hash(hash
, c_hash
);
9424 isl_hash_byte(hash
, bmap
->n_div
& 0xFF);
9425 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9427 if (isl_int_is_zero(bmap
->div
[i
][0]))
9429 isl_hash_byte(hash
, i
& 0xFF);
9430 c_hash
= isl_seq_get_hash(bmap
->div
[i
], 1 + 1 + total
);
9431 isl_hash_hash(hash
, c_hash
);
9433 isl_basic_map_free(bmap
);
9437 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set
*bset
)
9439 return isl_basic_map_get_hash((isl_basic_map
*)bset
);
9442 uint32_t isl_map_get_hash(__isl_keep isl_map
*map
)
9449 map
= isl_map_copy(map
);
9450 map
= isl_map_normalize(map
);
9454 hash
= isl_hash_init();
9455 for (i
= 0; i
< map
->n
; ++i
) {
9457 bmap_hash
= isl_basic_map_get_hash(map
->p
[i
]);
9458 isl_hash_hash(hash
, bmap_hash
);
9466 uint32_t isl_set_get_hash(__isl_keep isl_set
*set
)
9468 return isl_map_get_hash((isl_map
*)set
);
9471 /* Check if the value for dimension dim is completely determined
9472 * by the values of the other parameters and variables.
9473 * That is, check if dimension dim is involved in an equality.
9475 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
9482 nparam
= isl_basic_set_n_param(bset
);
9483 for (i
= 0; i
< bset
->n_eq
; ++i
)
9484 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
9489 /* Check if the value for dimension dim is completely determined
9490 * by the values of the other parameters and variables.
9491 * That is, check if dimension dim is involved in an equality
9492 * for each of the subsets.
9494 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
9500 for (i
= 0; i
< set
->n
; ++i
) {
9502 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
9509 int isl_set_n_basic_set(__isl_keep isl_set
*set
)
9511 return set
? set
->n
: 0;
9514 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
9515 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
9522 for (i
= 0; i
< map
->n
; ++i
)
9523 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
9529 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
9530 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
9537 for (i
= 0; i
< set
->n
; ++i
)
9538 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
9544 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
9551 bset
= isl_basic_set_cow(bset
);
9555 dim
= isl_basic_set_get_space(bset
);
9556 dim
= isl_space_lift(dim
, bset
->n_div
);
9559 isl_space_free(bset
->dim
);
9561 bset
->extra
-= bset
->n_div
;
9564 bset
= isl_basic_set_finalize(bset
);
9568 isl_basic_set_free(bset
);
9572 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
9578 set
= isl_set_align_divs(set
);
9583 set
= isl_set_cow(set
);
9587 n_div
= set
->p
[0]->n_div
;
9588 dim
= isl_set_get_space(set
);
9589 dim
= isl_space_lift(dim
, n_div
);
9592 isl_space_free(set
->dim
);
9595 for (i
= 0; i
< set
->n
; ++i
) {
9596 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
9607 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
9610 struct isl_basic_map
*bmap
;
9617 set
= isl_set_align_divs(set
);
9622 dim
= isl_set_get_space(set
);
9623 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
9625 return isl_map_identity(isl_space_map_from_set(dim
));
9628 n_div
= set
->p
[0]->n_div
;
9629 dim
= isl_space_map_from_set(dim
);
9630 n_param
= isl_space_dim(dim
, isl_dim_param
);
9631 n_set
= isl_space_dim(dim
, isl_dim_in
);
9632 dim
= isl_space_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
9633 bmap
= isl_basic_map_alloc_space(dim
, 0, n_set
, 2 * n_div
);
9634 for (i
= 0; i
< n_set
; ++i
)
9635 bmap
= var_equal(bmap
, i
);
9637 total
= n_param
+ n_set
+ n_set
+ n_div
;
9638 for (i
= 0; i
< n_div
; ++i
) {
9639 k
= isl_basic_map_alloc_inequality(bmap
);
9642 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
9643 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
9644 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
9645 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
9646 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
9647 set
->p
[0]->div
[i
][0]);
9649 l
= isl_basic_map_alloc_inequality(bmap
);
9652 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
9653 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
9654 set
->p
[0]->div
[i
][0]);
9655 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
9659 bmap
= isl_basic_map_simplify(bmap
);
9660 bmap
= isl_basic_map_finalize(bmap
);
9661 return isl_map_from_basic_map(bmap
);
9664 isl_basic_map_free(bmap
);
9668 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
9676 dim
= isl_basic_set_total_dim(bset
);
9677 size
+= bset
->n_eq
* (1 + dim
);
9678 size
+= bset
->n_ineq
* (1 + dim
);
9679 size
+= bset
->n_div
* (2 + dim
);
9684 int isl_set_size(__isl_keep isl_set
*set
)
9692 for (i
= 0; i
< set
->n
; ++i
)
9693 size
+= isl_basic_set_size(set
->p
[i
]);
9698 /* Check if there is any lower bound (if lower == 0) and/or upper
9699 * bound (if upper == 0) on the specified dim.
9701 static int basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9702 enum isl_dim_type type
, unsigned pos
, int lower
, int upper
)
9709 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
9711 pos
+= isl_basic_map_offset(bmap
, type
);
9713 for (i
= 0; i
< bmap
->n_div
; ++i
) {
9714 if (isl_int_is_zero(bmap
->div
[i
][0]))
9716 if (!isl_int_is_zero(bmap
->div
[i
][1 + pos
]))
9720 for (i
= 0; i
< bmap
->n_eq
; ++i
)
9721 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
9724 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
9725 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
9732 return lower
&& upper
;
9735 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
9736 enum isl_dim_type type
, unsigned pos
)
9738 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 0);
9741 int isl_basic_map_dim_has_lower_bound(__isl_keep isl_basic_map
*bmap
,
9742 enum isl_dim_type type
, unsigned pos
)
9744 return basic_map_dim_is_bounded(bmap
, type
, pos
, 0, 1);
9747 int isl_basic_map_dim_has_upper_bound(__isl_keep isl_basic_map
*bmap
,
9748 enum isl_dim_type type
, unsigned pos
)
9750 return basic_map_dim_is_bounded(bmap
, type
, pos
, 1, 0);
9753 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
9754 enum isl_dim_type type
, unsigned pos
)
9761 for (i
= 0; i
< map
->n
; ++i
) {
9763 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
9764 if (bounded
< 0 || !bounded
)
9771 /* Return 1 if the specified dim is involved in both an upper bound
9772 * and a lower bound.
9774 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
9775 enum isl_dim_type type
, unsigned pos
)
9777 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
9780 /* Does "map" have a bound (according to "fn") for any of its basic maps?
9782 static int has_any_bound(__isl_keep isl_map
*map
,
9783 enum isl_dim_type type
, unsigned pos
,
9784 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9785 enum isl_dim_type type
, unsigned pos
))
9792 for (i
= 0; i
< map
->n
; ++i
) {
9794 bounded
= fn(map
->p
[i
], type
, pos
);
9795 if (bounded
< 0 || bounded
)
9802 /* Return 1 if the specified dim is involved in any lower bound.
9804 int isl_set_dim_has_any_lower_bound(__isl_keep isl_set
*set
,
9805 enum isl_dim_type type
, unsigned pos
)
9807 return has_any_bound(set
, type
, pos
,
9808 &isl_basic_map_dim_has_lower_bound
);
9811 /* Return 1 if the specified dim is involved in any upper bound.
9813 int isl_set_dim_has_any_upper_bound(__isl_keep isl_set
*set
,
9814 enum isl_dim_type type
, unsigned pos
)
9816 return has_any_bound(set
, type
, pos
,
9817 &isl_basic_map_dim_has_upper_bound
);
9820 /* Does "map" have a bound (according to "fn") for all of its basic maps?
9822 static int has_bound(__isl_keep isl_map
*map
,
9823 enum isl_dim_type type
, unsigned pos
,
9824 int (*fn
)(__isl_keep isl_basic_map
*bmap
,
9825 enum isl_dim_type type
, unsigned pos
))
9832 for (i
= 0; i
< map
->n
; ++i
) {
9834 bounded
= fn(map
->p
[i
], type
, pos
);
9835 if (bounded
< 0 || !bounded
)
9842 /* Return 1 if the specified dim has a lower bound (in each of its basic sets).
9844 int isl_set_dim_has_lower_bound(__isl_keep isl_set
*set
,
9845 enum isl_dim_type type
, unsigned pos
)
9847 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_lower_bound
);
9850 /* Return 1 if the specified dim has an upper bound (in each of its basic sets).
9852 int isl_set_dim_has_upper_bound(__isl_keep isl_set
*set
,
9853 enum isl_dim_type type
, unsigned pos
)
9855 return has_bound(set
, type
, pos
, &isl_basic_map_dim_has_upper_bound
);
9858 /* For each of the "n" variables starting at "first", determine
9859 * the sign of the variable and put the results in the first "n"
9860 * elements of the array "signs".
9862 * 1 means that the variable is non-negative
9863 * -1 means that the variable is non-positive
9864 * 0 means the variable attains both positive and negative values.
9866 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
9867 unsigned first
, unsigned n
, int *signs
)
9869 isl_vec
*bound
= NULL
;
9870 struct isl_tab
*tab
= NULL
;
9871 struct isl_tab_undo
*snap
;
9874 if (!bset
|| !signs
)
9877 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
9878 tab
= isl_tab_from_basic_set(bset
, 0);
9882 isl_seq_clr(bound
->el
, bound
->size
);
9883 isl_int_set_si(bound
->el
[0], -1);
9885 snap
= isl_tab_snap(tab
);
9886 for (i
= 0; i
< n
; ++i
) {
9889 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
9890 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9893 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9894 if (isl_tab_rollback(tab
, snap
) < 0)
9902 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
9903 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
9906 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
9907 if (isl_tab_rollback(tab
, snap
) < 0)
9910 signs
[i
] = empty
? -1 : 0;
9914 isl_vec_free(bound
);
9918 isl_vec_free(bound
);
9922 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
9923 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
9925 if (!bset
|| !signs
)
9927 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
9930 first
+= pos(bset
->dim
, type
) - 1;
9931 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
9934 /* Check if the given basic map is obviously single-valued.
9935 * In particular, for each output dimension, check that there is
9936 * an equality that defines the output dimension in terms of
9937 * earlier dimensions.
9939 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9949 total
= 1 + isl_basic_map_total_dim(bmap
);
9950 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
9951 o_out
= isl_basic_map_offset(bmap
, isl_dim_out
);
9953 for (i
= 0; i
< n_out
; ++i
) {
9954 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
9955 if (isl_int_is_zero(bmap
->eq
[j
][o_out
+ i
]))
9957 if (isl_seq_first_non_zero(bmap
->eq
[j
] + o_out
+ i
+ 1,
9958 total
- (o_out
+ i
+ 1)) == -1)
9961 if (j
>= bmap
->n_eq
)
9968 /* Check if the given basic map is single-valued.
9973 * and check if the result is a subset of the identity mapping.
9975 int isl_basic_map_is_single_valued(__isl_keep isl_basic_map
*bmap
)
9978 isl_basic_map
*test
;
9982 sv
= isl_basic_map_plain_is_single_valued(bmap
);
9986 test
= isl_basic_map_reverse(isl_basic_map_copy(bmap
));
9987 test
= isl_basic_map_apply_range(test
, isl_basic_map_copy(bmap
));
9989 space
= isl_basic_map_get_space(bmap
);
9990 space
= isl_space_map_from_set(isl_space_range(space
));
9991 id
= isl_basic_map_identity(space
);
9993 sv
= isl_basic_map_is_subset(test
, id
);
9995 isl_basic_map_free(test
);
9996 isl_basic_map_free(id
);
10001 /* Check if the given map is obviously single-valued.
10003 int isl_map_plain_is_single_valued(__isl_keep isl_map
*map
)
10012 return isl_basic_map_plain_is_single_valued(map
->p
[0]);
10015 /* Check if the given map is single-valued.
10016 * We simply compute
10020 * and check if the result is a subset of the identity mapping.
10022 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
10029 sv
= isl_map_plain_is_single_valued(map
);
10033 test
= isl_map_reverse(isl_map_copy(map
));
10034 test
= isl_map_apply_range(test
, isl_map_copy(map
));
10036 dim
= isl_space_map_from_set(isl_space_range(isl_map_get_space(map
)));
10037 id
= isl_map_identity(dim
);
10039 sv
= isl_map_is_subset(test
, id
);
10041 isl_map_free(test
);
10047 int isl_map_is_injective(__isl_keep isl_map
*map
)
10051 map
= isl_map_copy(map
);
10052 map
= isl_map_reverse(map
);
10053 in
= isl_map_is_single_valued(map
);
10059 /* Check if the given map is obviously injective.
10061 int isl_map_plain_is_injective(__isl_keep isl_map
*map
)
10065 map
= isl_map_copy(map
);
10066 map
= isl_map_reverse(map
);
10067 in
= isl_map_plain_is_single_valued(map
);
10073 int isl_map_is_bijective(__isl_keep isl_map
*map
)
10077 sv
= isl_map_is_single_valued(map
);
10081 return isl_map_is_injective(map
);
10084 int isl_set_is_singleton(__isl_keep isl_set
*set
)
10086 return isl_map_is_single_valued((isl_map
*)set
);
10089 int isl_map_is_translation(__isl_keep isl_map
*map
)
10094 delta
= isl_map_deltas(isl_map_copy(map
));
10095 ok
= isl_set_is_singleton(delta
);
10096 isl_set_free(delta
);
10101 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
10103 if (isl_seq_first_non_zero(p
, pos
) != -1)
10105 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
10110 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
10119 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
10122 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
10123 ovar
= isl_space_offset(bset
->dim
, isl_dim_set
);
10124 for (j
= 0; j
< nvar
; ++j
) {
10125 int lower
= 0, upper
= 0;
10126 for (i
= 0; i
< bset
->n_eq
; ++i
) {
10127 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
10129 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
10133 if (i
< bset
->n_eq
)
10135 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
10136 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
10138 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
10140 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
10145 if (!lower
|| !upper
)
10152 int isl_set_is_box(__isl_keep isl_set
*set
)
10159 return isl_basic_set_is_box(set
->p
[0]);
10162 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
10167 return isl_space_is_wrapping(bset
->dim
);
10170 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
10175 return isl_space_is_wrapping(set
->dim
);
10178 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
10180 bmap
= isl_basic_map_cow(bmap
);
10184 bmap
->dim
= isl_space_wrap(bmap
->dim
);
10188 bmap
= isl_basic_map_finalize(bmap
);
10190 return (isl_basic_set
*)bmap
;
10192 isl_basic_map_free(bmap
);
10196 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
10200 map
= isl_map_cow(map
);
10204 for (i
= 0; i
< map
->n
; ++i
) {
10205 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
10209 map
->dim
= isl_space_wrap(map
->dim
);
10213 return (isl_set
*)map
;
10219 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
10221 bset
= isl_basic_set_cow(bset
);
10225 bset
->dim
= isl_space_unwrap(bset
->dim
);
10229 bset
= isl_basic_set_finalize(bset
);
10231 return (isl_basic_map
*)bset
;
10233 isl_basic_set_free(bset
);
10237 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
10244 if (!isl_set_is_wrapping(set
))
10245 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
10248 set
= isl_set_cow(set
);
10252 for (i
= 0; i
< set
->n
; ++i
) {
10253 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
10258 set
->dim
= isl_space_unwrap(set
->dim
);
10262 return (isl_map
*)set
;
10268 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
10269 enum isl_dim_type type
)
10274 if (!isl_space_is_named_or_nested(bmap
->dim
, type
))
10277 bmap
= isl_basic_map_cow(bmap
);
10281 bmap
->dim
= isl_space_reset(bmap
->dim
, type
);
10285 bmap
= isl_basic_map_finalize(bmap
);
10289 isl_basic_map_free(bmap
);
10293 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
10294 enum isl_dim_type type
)
10301 if (!isl_space_is_named_or_nested(map
->dim
, type
))
10304 map
= isl_map_cow(map
);
10308 for (i
= 0; i
< map
->n
; ++i
) {
10309 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
10313 map
->dim
= isl_space_reset(map
->dim
, type
);
10323 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
10328 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
10331 bmap
= isl_basic_map_cow(bmap
);
10335 bmap
->dim
= isl_space_flatten(bmap
->dim
);
10339 bmap
= isl_basic_map_finalize(bmap
);
10343 isl_basic_map_free(bmap
);
10347 __isl_give isl_basic_set
*isl_basic_set_flatten(__isl_take isl_basic_set
*bset
)
10349 return (isl_basic_set
*)isl_basic_map_flatten((isl_basic_map
*)bset
);
10352 __isl_give isl_basic_map
*isl_basic_map_flatten_domain(
10353 __isl_take isl_basic_map
*bmap
)
10358 if (!bmap
->dim
->nested
[0])
10361 bmap
= isl_basic_map_cow(bmap
);
10365 bmap
->dim
= isl_space_flatten_domain(bmap
->dim
);
10369 bmap
= isl_basic_map_finalize(bmap
);
10373 isl_basic_map_free(bmap
);
10377 __isl_give isl_basic_map
*isl_basic_map_flatten_range(
10378 __isl_take isl_basic_map
*bmap
)
10383 if (!bmap
->dim
->nested
[1])
10386 bmap
= isl_basic_map_cow(bmap
);
10390 bmap
->dim
= isl_space_flatten_range(bmap
->dim
);
10394 bmap
= isl_basic_map_finalize(bmap
);
10398 isl_basic_map_free(bmap
);
10402 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
10409 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
10412 map
= isl_map_cow(map
);
10416 for (i
= 0; i
< map
->n
; ++i
) {
10417 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
10421 map
->dim
= isl_space_flatten(map
->dim
);
10431 __isl_give isl_set
*isl_set_flatten(__isl_take isl_set
*set
)
10433 return (isl_set
*)isl_map_flatten((isl_map
*)set
);
10436 __isl_give isl_map
*isl_set_flatten_map(__isl_take isl_set
*set
)
10438 isl_space
*dim
, *flat_dim
;
10441 dim
= isl_set_get_space(set
);
10442 flat_dim
= isl_space_flatten(isl_space_copy(dim
));
10443 map
= isl_map_identity(isl_space_join(isl_space_reverse(dim
), flat_dim
));
10444 map
= isl_map_intersect_domain(map
, set
);
10449 __isl_give isl_map
*isl_map_flatten_domain(__isl_take isl_map
*map
)
10456 if (!map
->dim
->nested
[0])
10459 map
= isl_map_cow(map
);
10463 for (i
= 0; i
< map
->n
; ++i
) {
10464 map
->p
[i
] = isl_basic_map_flatten_domain(map
->p
[i
]);
10468 map
->dim
= isl_space_flatten_domain(map
->dim
);
10478 __isl_give isl_map
*isl_map_flatten_range(__isl_take isl_map
*map
)
10485 if (!map
->dim
->nested
[1])
10488 map
= isl_map_cow(map
);
10492 for (i
= 0; i
< map
->n
; ++i
) {
10493 map
->p
[i
] = isl_basic_map_flatten_range(map
->p
[i
]);
10497 map
->dim
= isl_space_flatten_range(map
->dim
);
10507 /* Reorder the dimensions of "bmap" according to the given dim_map
10508 * and set the dimension specification to "dim".
10510 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
10511 __isl_take isl_space
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
10513 isl_basic_map
*res
;
10516 bmap
= isl_basic_map_cow(bmap
);
10517 if (!bmap
|| !dim
|| !dim_map
)
10520 flags
= bmap
->flags
;
10521 ISL_FL_CLR(flags
, ISL_BASIC_MAP_FINAL
);
10522 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED
);
10523 ISL_FL_CLR(flags
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
10524 res
= isl_basic_map_alloc_space(dim
,
10525 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
10526 res
= isl_basic_map_add_constraints_dim_map(res
, bmap
, dim_map
);
10528 res
->flags
= flags
;
10529 res
= isl_basic_map_finalize(res
);
10533 isl_basic_map_free(bmap
);
10534 isl_space_free(dim
);
10538 /* Reorder the dimensions of "map" according to given reordering.
10540 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
10541 __isl_take isl_reordering
*r
)
10544 struct isl_dim_map
*dim_map
;
10546 map
= isl_map_cow(map
);
10547 dim_map
= isl_dim_map_from_reordering(r
);
10548 if (!map
|| !r
|| !dim_map
)
10551 for (i
= 0; i
< map
->n
; ++i
) {
10552 struct isl_dim_map
*dim_map_i
;
10554 dim_map_i
= isl_dim_map_extend(dim_map
, map
->p
[i
]);
10556 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
10557 isl_space_copy(r
->dim
), dim_map_i
);
10563 map
= isl_map_reset_space(map
, isl_space_copy(r
->dim
));
10565 isl_reordering_free(r
);
10571 isl_reordering_free(r
);
10575 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
10576 __isl_take isl_reordering
*r
)
10578 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);
10581 __isl_give isl_map
*isl_map_align_params(__isl_take isl_map
*map
,
10582 __isl_take isl_space
*model
)
10586 if (!map
|| !model
)
10589 ctx
= isl_space_get_ctx(model
);
10590 if (!isl_space_has_named_params(model
))
10591 isl_die(ctx
, isl_error_invalid
,
10592 "model has unnamed parameters", goto error
);
10593 if (!isl_space_has_named_params(map
->dim
))
10594 isl_die(ctx
, isl_error_invalid
,
10595 "relation has unnamed parameters", goto error
);
10596 if (!isl_space_match(map
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10597 isl_reordering
*exp
;
10599 model
= isl_space_drop_dims(model
, isl_dim_in
,
10600 0, isl_space_dim(model
, isl_dim_in
));
10601 model
= isl_space_drop_dims(model
, isl_dim_out
,
10602 0, isl_space_dim(model
, isl_dim_out
));
10603 exp
= isl_parameter_alignment_reordering(map
->dim
, model
);
10604 exp
= isl_reordering_extend_space(exp
, isl_map_get_space(map
));
10605 map
= isl_map_realign(map
, exp
);
10608 isl_space_free(model
);
10611 isl_space_free(model
);
10616 __isl_give isl_set
*isl_set_align_params(__isl_take isl_set
*set
,
10617 __isl_take isl_space
*model
)
10619 return isl_map_align_params(set
, model
);
10622 /* Align the parameters of "bmap" to those of "model", introducing
10623 * additional parameters if needed.
10625 __isl_give isl_basic_map
*isl_basic_map_align_params(
10626 __isl_take isl_basic_map
*bmap
, __isl_take isl_space
*model
)
10630 if (!bmap
|| !model
)
10633 ctx
= isl_space_get_ctx(model
);
10634 if (!isl_space_has_named_params(model
))
10635 isl_die(ctx
, isl_error_invalid
,
10636 "model has unnamed parameters", goto error
);
10637 if (!isl_space_has_named_params(bmap
->dim
))
10638 isl_die(ctx
, isl_error_invalid
,
10639 "relation has unnamed parameters", goto error
);
10640 if (!isl_space_match(bmap
->dim
, isl_dim_param
, model
, isl_dim_param
)) {
10641 isl_reordering
*exp
;
10642 struct isl_dim_map
*dim_map
;
10644 model
= isl_space_drop_dims(model
, isl_dim_in
,
10645 0, isl_space_dim(model
, isl_dim_in
));
10646 model
= isl_space_drop_dims(model
, isl_dim_out
,
10647 0, isl_space_dim(model
, isl_dim_out
));
10648 exp
= isl_parameter_alignment_reordering(bmap
->dim
, model
);
10649 exp
= isl_reordering_extend_space(exp
,
10650 isl_basic_map_get_space(bmap
));
10651 dim_map
= isl_dim_map_from_reordering(exp
);
10652 bmap
= isl_basic_map_realign(bmap
,
10653 exp
? isl_space_copy(exp
->dim
) : NULL
,
10654 isl_dim_map_extend(dim_map
, bmap
));
10655 isl_reordering_free(exp
);
10659 isl_space_free(model
);
10662 isl_space_free(model
);
10663 isl_basic_map_free(bmap
);
10667 /* Align the parameters of "bset" to those of "model", introducing
10668 * additional parameters if needed.
10670 __isl_give isl_basic_set
*isl_basic_set_align_params(
10671 __isl_take isl_basic_set
*bset
, __isl_take isl_space
*model
)
10673 return isl_basic_map_align_params(bset
, model
);
10676 __isl_give isl_mat
*isl_basic_map_equalities_matrix(
10677 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10678 enum isl_dim_type c2
, enum isl_dim_type c3
,
10679 enum isl_dim_type c4
, enum isl_dim_type c5
)
10681 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10682 struct isl_mat
*mat
;
10688 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_eq
,
10689 isl_basic_map_total_dim(bmap
) + 1);
10692 for (i
= 0; i
< bmap
->n_eq
; ++i
)
10693 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10694 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10695 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10696 isl_int_set(mat
->row
[i
][pos
],
10697 bmap
->eq
[i
][off
+ k
]);
10705 __isl_give isl_mat
*isl_basic_map_inequalities_matrix(
10706 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type c1
,
10707 enum isl_dim_type c2
, enum isl_dim_type c3
,
10708 enum isl_dim_type c4
, enum isl_dim_type c5
)
10710 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10711 struct isl_mat
*mat
;
10717 mat
= isl_mat_alloc(bmap
->ctx
, bmap
->n_ineq
,
10718 isl_basic_map_total_dim(bmap
) + 1);
10721 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
10722 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10723 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10724 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10725 isl_int_set(mat
->row
[i
][pos
],
10726 bmap
->ineq
[i
][off
+ k
]);
10734 __isl_give isl_basic_map
*isl_basic_map_from_constraint_matrices(
10735 __isl_take isl_space
*dim
,
10736 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10737 enum isl_dim_type c2
, enum isl_dim_type c3
,
10738 enum isl_dim_type c4
, enum isl_dim_type c5
)
10740 enum isl_dim_type c
[5] = { c1
, c2
, c3
, c4
, c5
};
10741 isl_basic_map
*bmap
;
10747 if (!dim
|| !eq
|| !ineq
)
10750 if (eq
->n_col
!= ineq
->n_col
)
10751 isl_die(dim
->ctx
, isl_error_invalid
,
10752 "equalities and inequalities matrices should have "
10753 "same number of columns", goto error
);
10755 total
= 1 + isl_space_dim(dim
, isl_dim_all
);
10757 if (eq
->n_col
< total
)
10758 isl_die(dim
->ctx
, isl_error_invalid
,
10759 "number of columns too small", goto error
);
10761 extra
= eq
->n_col
- total
;
10763 bmap
= isl_basic_map_alloc_space(isl_space_copy(dim
), extra
,
10764 eq
->n_row
, ineq
->n_row
);
10767 for (i
= 0; i
< extra
; ++i
) {
10768 k
= isl_basic_map_alloc_div(bmap
);
10771 isl_int_set_si(bmap
->div
[k
][0], 0);
10773 for (i
= 0; i
< eq
->n_row
; ++i
) {
10774 l
= isl_basic_map_alloc_equality(bmap
);
10777 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10778 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10779 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10780 isl_int_set(bmap
->eq
[l
][off
+ k
],
10786 for (i
= 0; i
< ineq
->n_row
; ++i
) {
10787 l
= isl_basic_map_alloc_inequality(bmap
);
10790 for (j
= 0, pos
= 0; j
< 5; ++j
) {
10791 int off
= isl_basic_map_offset(bmap
, c
[j
]);
10792 for (k
= 0; k
< isl_basic_map_dim(bmap
, c
[j
]); ++k
) {
10793 isl_int_set(bmap
->ineq
[l
][off
+ k
],
10794 ineq
->row
[i
][pos
]);
10800 isl_space_free(dim
);
10802 isl_mat_free(ineq
);
10804 bmap
= isl_basic_map_simplify(bmap
);
10805 return isl_basic_map_finalize(bmap
);
10807 isl_space_free(dim
);
10809 isl_mat_free(ineq
);
10813 __isl_give isl_mat
*isl_basic_set_equalities_matrix(
10814 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10815 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10817 return isl_basic_map_equalities_matrix((isl_basic_map
*)bset
,
10818 c1
, c2
, c3
, c4
, isl_dim_in
);
10821 __isl_give isl_mat
*isl_basic_set_inequalities_matrix(
10822 __isl_keep isl_basic_set
*bset
, enum isl_dim_type c1
,
10823 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10825 return isl_basic_map_inequalities_matrix((isl_basic_map
*)bset
,
10826 c1
, c2
, c3
, c4
, isl_dim_in
);
10829 __isl_give isl_basic_set
*isl_basic_set_from_constraint_matrices(
10830 __isl_take isl_space
*dim
,
10831 __isl_take isl_mat
*eq
, __isl_take isl_mat
*ineq
, enum isl_dim_type c1
,
10832 enum isl_dim_type c2
, enum isl_dim_type c3
, enum isl_dim_type c4
)
10834 return (isl_basic_set
*)
10835 isl_basic_map_from_constraint_matrices(dim
, eq
, ineq
,
10836 c1
, c2
, c3
, c4
, isl_dim_in
);
10839 int isl_basic_map_can_zip(__isl_keep isl_basic_map
*bmap
)
10844 return isl_space_can_zip(bmap
->dim
);
10847 int isl_map_can_zip(__isl_keep isl_map
*map
)
10852 return isl_space_can_zip(map
->dim
);
10855 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
10856 * (A -> C) -> (B -> D).
10858 __isl_give isl_basic_map
*isl_basic_map_zip(__isl_take isl_basic_map
*bmap
)
10867 if (!isl_basic_map_can_zip(bmap
))
10868 isl_die(bmap
->ctx
, isl_error_invalid
,
10869 "basic map cannot be zipped", goto error
);
10870 pos
= isl_basic_map_offset(bmap
, isl_dim_in
) +
10871 isl_space_dim(bmap
->dim
->nested
[0], isl_dim_in
);
10872 n1
= isl_space_dim(bmap
->dim
->nested
[0], isl_dim_out
);
10873 n2
= isl_space_dim(bmap
->dim
->nested
[1], isl_dim_in
);
10874 bmap
= isl_basic_map_cow(bmap
);
10875 bmap
= isl_basic_map_swap_vars(bmap
, pos
, n1
, n2
);
10878 bmap
->dim
= isl_space_zip(bmap
->dim
);
10883 isl_basic_map_free(bmap
);
10887 /* Given a map (A -> B) -> (C -> D), return the corresponding map
10888 * (A -> C) -> (B -> D).
10890 __isl_give isl_map
*isl_map_zip(__isl_take isl_map
*map
)
10897 if (!isl_map_can_zip(map
))
10898 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be zipped",
10901 map
= isl_map_cow(map
);
10905 for (i
= 0; i
< map
->n
; ++i
) {
10906 map
->p
[i
] = isl_basic_map_zip(map
->p
[i
]);
10911 map
->dim
= isl_space_zip(map
->dim
);
10921 /* Can we apply isl_basic_map_curry to "bmap"?
10922 * That is, does it have a nested relation in its domain?
10924 int isl_basic_map_can_curry(__isl_keep isl_basic_map
*bmap
)
10929 return isl_space_can_curry(bmap
->dim
);
10932 /* Can we apply isl_map_curry to "map"?
10933 * That is, does it have a nested relation in its domain?
10935 int isl_map_can_curry(__isl_keep isl_map
*map
)
10940 return isl_space_can_curry(map
->dim
);
10943 /* Given a basic map (A -> B) -> C, return the corresponding basic map
10946 __isl_give isl_basic_map
*isl_basic_map_curry(__isl_take isl_basic_map
*bmap
)
10952 if (!isl_basic_map_can_curry(bmap
))
10953 isl_die(bmap
->ctx
, isl_error_invalid
,
10954 "basic map cannot be curried", goto error
);
10955 bmap
= isl_basic_map_cow(bmap
);
10958 bmap
->dim
= isl_space_curry(bmap
->dim
);
10963 isl_basic_map_free(bmap
);
10967 /* Given a map (A -> B) -> C, return the corresponding map
10970 __isl_give isl_map
*isl_map_curry(__isl_take isl_map
*map
)
10977 if (!isl_map_can_curry(map
))
10978 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be curried",
10981 map
= isl_map_cow(map
);
10985 for (i
= 0; i
< map
->n
; ++i
) {
10986 map
->p
[i
] = isl_basic_map_curry(map
->p
[i
]);
10991 map
->dim
= isl_space_curry(map
->dim
);
11001 /* Can we apply isl_basic_map_uncurry to "bmap"?
11002 * That is, does it have a nested relation in its domain?
11004 int isl_basic_map_can_uncurry(__isl_keep isl_basic_map
*bmap
)
11009 return isl_space_can_uncurry(bmap
->dim
);
11012 /* Can we apply isl_map_uncurry to "map"?
11013 * That is, does it have a nested relation in its domain?
11015 int isl_map_can_uncurry(__isl_keep isl_map
*map
)
11020 return isl_space_can_uncurry(map
->dim
);
11023 /* Given a basic map A -> (B -> C), return the corresponding basic map
11026 __isl_give isl_basic_map
*isl_basic_map_uncurry(__isl_take isl_basic_map
*bmap
)
11032 if (!isl_basic_map_can_uncurry(bmap
))
11033 isl_die(bmap
->ctx
, isl_error_invalid
,
11034 "basic map cannot be uncurried",
11035 return isl_basic_map_free(bmap
));
11036 bmap
= isl_basic_map_cow(bmap
);
11039 bmap
->dim
= isl_space_uncurry(bmap
->dim
);
11041 return isl_basic_map_free(bmap
);
11045 /* Given a map A -> (B -> C), return the corresponding map
11048 __isl_give isl_map
*isl_map_uncurry(__isl_take isl_map
*map
)
11055 if (!isl_map_can_uncurry(map
))
11056 isl_die(map
->ctx
, isl_error_invalid
, "map cannot be uncurried",
11057 return isl_map_free(map
));
11059 map
= isl_map_cow(map
);
11063 for (i
= 0; i
< map
->n
; ++i
) {
11064 map
->p
[i
] = isl_basic_map_uncurry(map
->p
[i
]);
11066 return isl_map_free(map
);
11069 map
->dim
= isl_space_uncurry(map
->dim
);
11071 return isl_map_free(map
);
11076 /* Construct a basic map mapping the domain of the affine expression
11077 * to a one-dimensional range prescribed by the affine expression.
11079 __isl_give isl_basic_map
*isl_basic_map_from_aff(__isl_take isl_aff
*aff
)
11083 isl_local_space
*ls
;
11084 isl_basic_map
*bmap
;
11089 ls
= isl_aff_get_local_space(aff
);
11090 bmap
= isl_basic_map_from_local_space(ls
);
11091 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
11092 k
= isl_basic_map_alloc_equality(bmap
);
11096 pos
= isl_basic_map_offset(bmap
, isl_dim_out
);
11097 isl_seq_cpy(bmap
->eq
[k
], aff
->v
->el
+ 1, pos
);
11098 isl_int_neg(bmap
->eq
[k
][pos
], aff
->v
->el
[0]);
11099 isl_seq_cpy(bmap
->eq
[k
] + pos
+ 1, aff
->v
->el
+ 1 + pos
,
11100 aff
->v
->size
- (pos
+ 1));
11103 bmap
= isl_basic_map_finalize(bmap
);
11107 isl_basic_map_free(bmap
);
11111 /* Construct a map mapping the domain of the affine expression
11112 * to a one-dimensional range prescribed by the affine expression.
11114 __isl_give isl_map
*isl_map_from_aff(__isl_take isl_aff
*aff
)
11116 isl_basic_map
*bmap
;
11118 bmap
= isl_basic_map_from_aff(aff
);
11119 return isl_map_from_basic_map(bmap
);
11122 /* Construct a basic map mapping the domain the multi-affine expression
11123 * to its range, with each dimension in the range equated to the
11124 * corresponding affine expression.
11126 __isl_give isl_basic_map
*isl_basic_map_from_multi_aff(
11127 __isl_take isl_multi_aff
*maff
)
11131 isl_basic_map
*bmap
;
11136 if (isl_space_dim(maff
->space
, isl_dim_out
) != maff
->n
)
11137 isl_die(isl_multi_aff_get_ctx(maff
), isl_error_internal
,
11138 "invalid space", return isl_multi_aff_free(maff
));
11140 space
= isl_space_domain(isl_multi_aff_get_space(maff
));
11141 bmap
= isl_basic_map_universe(isl_space_from_domain(space
));
11143 for (i
= 0; i
< maff
->n
; ++i
) {
11145 isl_basic_map
*bmap_i
;
11147 aff
= isl_aff_copy(maff
->p
[i
]);
11148 bmap_i
= isl_basic_map_from_aff(aff
);
11150 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11153 bmap
= isl_basic_map_reset_space(bmap
, isl_multi_aff_get_space(maff
));
11155 isl_multi_aff_free(maff
);
11159 /* Construct a map mapping the domain the multi-affine expression
11160 * to its range, with each dimension in the range equated to the
11161 * corresponding affine expression.
11163 __isl_give isl_map
*isl_map_from_multi_aff(__isl_take isl_multi_aff
*maff
)
11165 isl_basic_map
*bmap
;
11167 bmap
= isl_basic_map_from_multi_aff(maff
);
11168 return isl_map_from_basic_map(bmap
);
11171 /* Construct a basic map mapping a domain in the given space to
11172 * to an n-dimensional range, with n the number of elements in the list,
11173 * where each coordinate in the range is prescribed by the
11174 * corresponding affine expression.
11175 * The domains of all affine expressions in the list are assumed to match
11178 __isl_give isl_basic_map
*isl_basic_map_from_aff_list(
11179 __isl_take isl_space
*domain_dim
, __isl_take isl_aff_list
*list
)
11183 isl_basic_map
*bmap
;
11188 dim
= isl_space_from_domain(domain_dim
);
11189 bmap
= isl_basic_map_universe(dim
);
11191 for (i
= 0; i
< list
->n
; ++i
) {
11193 isl_basic_map
*bmap_i
;
11195 aff
= isl_aff_copy(list
->p
[i
]);
11196 bmap_i
= isl_basic_map_from_aff(aff
);
11198 bmap
= isl_basic_map_flat_range_product(bmap
, bmap_i
);
11201 isl_aff_list_free(list
);
11205 __isl_give isl_set
*isl_set_equate(__isl_take isl_set
*set
,
11206 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11208 return isl_map_equate(set
, type1
, pos1
, type2
, pos2
);
11211 /* Construct a basic map where the given dimensions are equal to each other.
11213 static __isl_give isl_basic_map
*equator(__isl_take isl_space
*space
,
11214 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11216 isl_basic_map
*bmap
= NULL
;
11222 if (pos1
>= isl_space_dim(space
, type1
))
11223 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11224 "index out of bounds", goto error
);
11225 if (pos2
>= isl_space_dim(space
, type2
))
11226 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11227 "index out of bounds", goto error
);
11229 if (type1
== type2
&& pos1
== pos2
)
11230 return isl_basic_map_universe(space
);
11232 bmap
= isl_basic_map_alloc_space(isl_space_copy(space
), 0, 1, 0);
11233 i
= isl_basic_map_alloc_equality(bmap
);
11236 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11237 pos1
+= isl_basic_map_offset(bmap
, type1
);
11238 pos2
+= isl_basic_map_offset(bmap
, type2
);
11239 isl_int_set_si(bmap
->eq
[i
][pos1
], -1);
11240 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11241 bmap
= isl_basic_map_finalize(bmap
);
11242 isl_space_free(space
);
11245 isl_space_free(space
);
11246 isl_basic_map_free(bmap
);
11250 /* Add a constraint imposing that the given two dimensions are equal.
11252 __isl_give isl_basic_map
*isl_basic_map_equate(__isl_take isl_basic_map
*bmap
,
11253 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11257 eq
= equator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11259 bmap
= isl_basic_map_intersect(bmap
, eq
);
11264 /* Add a constraint imposing that the given two dimensions are equal.
11266 __isl_give isl_map
*isl_map_equate(__isl_take isl_map
*map
,
11267 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11269 isl_basic_map
*bmap
;
11271 bmap
= equator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11273 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11278 /* Add a constraint imposing that the given two dimensions have opposite values.
11280 __isl_give isl_map
*isl_map_oppose(__isl_take isl_map
*map
,
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_map_dim(map
, type1
))
11290 isl_die(map
->ctx
, isl_error_invalid
,
11291 "index out of bounds", goto error
);
11292 if (pos2
>= isl_map_dim(map
, type2
))
11293 isl_die(map
->ctx
, isl_error_invalid
,
11294 "index out of bounds", goto error
);
11296 bmap
= isl_basic_map_alloc_space(isl_map_get_space(map
), 0, 1, 0);
11297 i
= isl_basic_map_alloc_equality(bmap
);
11300 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11301 pos1
+= isl_basic_map_offset(bmap
, type1
);
11302 pos2
+= isl_basic_map_offset(bmap
, type2
);
11303 isl_int_set_si(bmap
->eq
[i
][pos1
], 1);
11304 isl_int_set_si(bmap
->eq
[i
][pos2
], 1);
11305 bmap
= isl_basic_map_finalize(bmap
);
11307 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11311 isl_basic_map_free(bmap
);
11316 /* Add a constraint imposing that the value of the first dimension is
11317 * greater than or equal to that of the second.
11319 __isl_give isl_basic_map
*isl_basic_map_order_ge(__isl_take isl_basic_map
*bmap
,
11320 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11323 isl_local_space
*ls
;
11328 if (pos1
>= isl_basic_map_dim(bmap
, type1
))
11329 isl_die(bmap
->ctx
, isl_error_invalid
,
11330 "index out of bounds", return isl_basic_map_free(bmap
));
11331 if (pos2
>= isl_basic_map_dim(bmap
, type2
))
11332 isl_die(bmap
->ctx
, isl_error_invalid
,
11333 "index out of bounds", return isl_basic_map_free(bmap
));
11335 if (type1
== type2
&& pos1
== pos2
)
11338 ls
= isl_local_space_from_space(isl_basic_map_get_space(bmap
));
11339 c
= isl_inequality_alloc(ls
);
11340 c
= isl_constraint_set_coefficient_si(c
, type1
, pos1
, 1);
11341 c
= isl_constraint_set_coefficient_si(c
, type2
, pos2
, -1);
11342 bmap
= isl_basic_map_add_constraint(bmap
, c
);
11347 /* Construct a basic map where the value of the first dimension is
11348 * greater than that of the second.
11350 static __isl_give isl_basic_map
*greator(__isl_take isl_space
*space
,
11351 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11353 isl_basic_map
*bmap
= NULL
;
11359 if (pos1
>= isl_space_dim(space
, type1
))
11360 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11361 "index out of bounds", goto error
);
11362 if (pos2
>= isl_space_dim(space
, type2
))
11363 isl_die(isl_space_get_ctx(space
), isl_error_invalid
,
11364 "index out of bounds", goto error
);
11366 if (type1
== type2
&& pos1
== pos2
)
11367 return isl_basic_map_empty(space
);
11369 bmap
= isl_basic_map_alloc_space(space
, 0, 0, 1);
11370 i
= isl_basic_map_alloc_inequality(bmap
);
11373 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
11374 pos1
+= isl_basic_map_offset(bmap
, type1
);
11375 pos2
+= isl_basic_map_offset(bmap
, type2
);
11376 isl_int_set_si(bmap
->ineq
[i
][pos1
], 1);
11377 isl_int_set_si(bmap
->ineq
[i
][pos2
], -1);
11378 isl_int_set_si(bmap
->ineq
[i
][0], -1);
11379 bmap
= isl_basic_map_finalize(bmap
);
11383 isl_space_free(space
);
11384 isl_basic_map_free(bmap
);
11388 /* Add a constraint imposing that the value of the first dimension is
11389 * greater than that of the second.
11391 __isl_give isl_basic_map
*isl_basic_map_order_gt(__isl_take isl_basic_map
*bmap
,
11392 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11396 gt
= greator(isl_basic_map_get_space(bmap
), type1
, pos1
, type2
, pos2
);
11398 bmap
= isl_basic_map_intersect(bmap
, gt
);
11403 /* Add a constraint imposing that the value of the first dimension is
11404 * greater than that of the second.
11406 __isl_give isl_map
*isl_map_order_gt(__isl_take isl_map
*map
,
11407 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11409 isl_basic_map
*bmap
;
11411 bmap
= greator(isl_map_get_space(map
), type1
, pos1
, type2
, pos2
);
11413 map
= isl_map_intersect(map
, isl_map_from_basic_map(bmap
));
11418 /* Add a constraint imposing that the value of the first dimension is
11419 * smaller than that of the second.
11421 __isl_give isl_map
*isl_map_order_lt(__isl_take isl_map
*map
,
11422 enum isl_dim_type type1
, int pos1
, enum isl_dim_type type2
, int pos2
)
11424 return isl_map_order_gt(map
, type2
, pos2
, type1
, pos1
);
11427 __isl_give isl_aff
*isl_basic_map_get_div(__isl_keep isl_basic_map
*bmap
,
11431 isl_local_space
*ls
;
11436 if (!isl_basic_map_divs_known(bmap
))
11437 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11438 "some divs are unknown", return NULL
);
11440 ls
= isl_basic_map_get_local_space(bmap
);
11441 div
= isl_local_space_get_div(ls
, pos
);
11442 isl_local_space_free(ls
);
11447 __isl_give isl_aff
*isl_basic_set_get_div(__isl_keep isl_basic_set
*bset
,
11450 return isl_basic_map_get_div(bset
, pos
);
11453 /* Plug in "subs" for dimension "type", "pos" of "bset".
11455 * Let i be the dimension to replace and let "subs" be of the form
11459 * Any integer division with a non-zero coefficient for i,
11461 * floor((a i + g)/m)
11465 * floor((a f + d g)/(m d))
11467 * Constraints of the form
11475 * We currently require that "subs" is an integral expression.
11476 * Handling rational expressions may require us to add stride constraints
11477 * as we do in isl_basic_set_preimage_multi_aff.
11479 __isl_give isl_basic_set
*isl_basic_set_substitute(
11480 __isl_take isl_basic_set
*bset
,
11481 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11487 if (bset
&& isl_basic_set_plain_is_empty(bset
))
11490 bset
= isl_basic_set_cow(bset
);
11491 if (!bset
|| !subs
)
11494 ctx
= isl_basic_set_get_ctx(bset
);
11495 if (!isl_space_is_equal(bset
->dim
, subs
->ls
->dim
))
11496 isl_die(ctx
, isl_error_invalid
,
11497 "spaces don't match", goto error
);
11498 if (isl_local_space_dim(subs
->ls
, isl_dim_div
) != 0)
11499 isl_die(ctx
, isl_error_unsupported
,
11500 "cannot handle divs yet", goto error
);
11501 if (!isl_int_is_one(subs
->v
->el
[0]))
11502 isl_die(ctx
, isl_error_invalid
,
11503 "can only substitute integer expressions", goto error
);
11505 pos
+= isl_basic_set_offset(bset
, type
);
11509 for (i
= 0; i
< bset
->n_eq
; ++i
) {
11510 if (isl_int_is_zero(bset
->eq
[i
][pos
]))
11512 isl_int_set(v
, bset
->eq
[i
][pos
]);
11513 isl_int_set_si(bset
->eq
[i
][pos
], 0);
11514 isl_seq_combine(bset
->eq
[i
], subs
->v
->el
[0], bset
->eq
[i
],
11515 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11518 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
11519 if (isl_int_is_zero(bset
->ineq
[i
][pos
]))
11521 isl_int_set(v
, bset
->ineq
[i
][pos
]);
11522 isl_int_set_si(bset
->ineq
[i
][pos
], 0);
11523 isl_seq_combine(bset
->ineq
[i
], subs
->v
->el
[0], bset
->ineq
[i
],
11524 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11527 for (i
= 0; i
< bset
->n_div
; ++i
) {
11528 if (isl_int_is_zero(bset
->div
[i
][1 + pos
]))
11530 isl_int_set(v
, bset
->div
[i
][1 + pos
]);
11531 isl_int_set_si(bset
->div
[i
][1 + pos
], 0);
11532 isl_seq_combine(bset
->div
[i
] + 1,
11533 subs
->v
->el
[0], bset
->div
[i
] + 1,
11534 v
, subs
->v
->el
+ 1, subs
->v
->size
- 1);
11535 isl_int_mul(bset
->div
[i
][0], bset
->div
[i
][0], subs
->v
->el
[0]);
11540 bset
= isl_basic_set_simplify(bset
);
11541 return isl_basic_set_finalize(bset
);
11543 isl_basic_set_free(bset
);
11547 /* Plug in "subs" for dimension "type", "pos" of "set".
11549 __isl_give isl_set
*isl_set_substitute(__isl_take isl_set
*set
,
11550 enum isl_dim_type type
, unsigned pos
, __isl_keep isl_aff
*subs
)
11554 if (set
&& isl_set_plain_is_empty(set
))
11557 set
= isl_set_cow(set
);
11561 for (i
= set
->n
- 1; i
>= 0; --i
) {
11562 set
->p
[i
] = isl_basic_set_substitute(set
->p
[i
], type
, pos
, subs
);
11563 if (remove_if_empty(set
, i
) < 0)
11573 /* Check if the range of "ma" is compatible with the domain or range
11574 * (depending on "type") of "bmap".
11575 * Return -1 if anything is wrong.
11577 static int check_basic_map_compatible_range_multi_aff(
11578 __isl_keep isl_basic_map
*bmap
, enum isl_dim_type type
,
11579 __isl_keep isl_multi_aff
*ma
)
11582 isl_space
*ma_space
;
11584 ma_space
= isl_multi_aff_get_space(ma
);
11585 m
= isl_space_tuple_match(bmap
->dim
, type
, ma_space
, isl_dim_out
);
11586 isl_space_free(ma_space
);
11588 isl_die(isl_basic_map_get_ctx(bmap
), isl_error_invalid
,
11589 "spaces don't match", return -1);
11593 /* Copy the divs from "ma" to "bmap", adding zeros for the "n_before"
11594 * coefficients before the transformed range of dimensions,
11595 * the "n_after" coefficients after the transformed range of dimensions
11596 * and the coefficients of the other divs in "bmap".
11598 static int set_ma_divs(__isl_keep isl_basic_map
*bmap
,
11599 __isl_keep isl_multi_aff
*ma
, int n_before
, int n_after
, int n_div
)
11604 isl_local_space
*ls
;
11609 ls
= isl_aff_get_domain_local_space(ma
->p
[0]);
11613 n_param
= isl_local_space_dim(ls
, isl_dim_param
);
11614 n_set
= isl_local_space_dim(ls
, isl_dim_set
);
11615 for (i
= 0; i
< n_div
; ++i
) {
11616 int o_bmap
= 0, o_ls
= 0;
11618 isl_seq_cpy(bmap
->div
[i
], ls
->div
->row
[i
], 1 + 1 + n_param
);
11619 o_bmap
+= 1 + 1 + n_param
;
11620 o_ls
+= 1 + 1 + n_param
;
11621 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_before
);
11622 o_bmap
+= n_before
;
11623 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11624 ls
->div
->row
[i
] + o_ls
, n_set
);
11627 isl_seq_clr(bmap
->div
[i
] + o_bmap
, n_after
);
11629 isl_seq_cpy(bmap
->div
[i
] + o_bmap
,
11630 ls
->div
->row
[i
] + o_ls
, n_div
);
11633 isl_seq_clr(bmap
->div
[i
] + o_bmap
, bmap
->n_div
- n_div
);
11634 if (isl_basic_set_add_div_constraints(bmap
, i
) < 0)
11638 isl_local_space_free(ls
);
11641 isl_local_space_free(ls
);
11645 /* How many stride constraints does "ma" enforce?
11646 * That is, how many of the affine expressions have a denominator
11647 * different from one?
11649 static int multi_aff_strides(__isl_keep isl_multi_aff
*ma
)
11654 for (i
= 0; i
< ma
->n
; ++i
)
11655 if (!isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11661 /* For each affine expression in ma of the form
11663 * x_i = (f_i y + h_i)/m_i
11665 * with m_i different from one, add a constraint to "bmap"
11668 * f_i y + h_i = m_i alpha_i
11670 * with alpha_i an additional existentially quantified variable.
11672 static __isl_give isl_basic_map
*add_ma_strides(
11673 __isl_take isl_basic_map
*bmap
, __isl_keep isl_multi_aff
*ma
,
11674 int n_before
, int n_after
)
11683 total
= isl_basic_map_total_dim(bmap
);
11684 n_param
= isl_multi_aff_dim(ma
, isl_dim_param
);
11685 n_in
= isl_multi_aff_dim(ma
, isl_dim_in
);
11686 n_div
= isl_multi_aff_dim(ma
, isl_dim_div
);
11687 for (i
= 0; i
< ma
->n
; ++i
) {
11688 int o_bmap
= 0, o_ma
= 1;
11690 if (isl_int_is_one(ma
->p
[i
]->v
->el
[0]))
11692 div
= isl_basic_map_alloc_div(bmap
);
11693 k
= isl_basic_map_alloc_equality(bmap
);
11694 if (div
< 0 || k
< 0)
11696 isl_int_set_si(bmap
->div
[div
][0], 0);
11697 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11698 ma
->p
[i
]->v
->el
+ o_ma
, 1 + n_param
);
11699 o_bmap
+= 1 + n_param
;
11700 o_ma
+= 1 + n_param
;
11701 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_before
);
11702 o_bmap
+= n_before
;
11703 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11704 ma
->p
[i
]->v
->el
+ o_ma
, n_in
);
11707 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, n_after
);
11709 isl_seq_cpy(bmap
->eq
[k
] + o_bmap
,
11710 ma
->p
[i
]->v
->el
+ o_ma
, n_div
);
11713 isl_seq_clr(bmap
->eq
[k
] + o_bmap
, 1 + total
- o_bmap
);
11714 isl_int_neg(bmap
->eq
[k
][1 + total
], ma
->p
[i
]->v
->el
[0]);
11720 isl_basic_map_free(bmap
);
11724 /* Replace the domain or range space (depending on "type) of "space" by "set".
11726 static __isl_give isl_space
*isl_space_set(__isl_take isl_space
*space
,
11727 enum isl_dim_type type
, __isl_take isl_space
*set
)
11729 if (type
== isl_dim_in
) {
11730 space
= isl_space_range(space
);
11731 space
= isl_space_map_from_domain_and_range(set
, space
);
11733 space
= isl_space_domain(space
);
11734 space
= isl_space_map_from_domain_and_range(space
, set
);
11740 /* Compute the preimage of the domain or range (depending on "type")
11741 * of "bmap" under the function represented by "ma".
11742 * In other words, plug in "ma" in the domain or range of "bmap".
11743 * The result is a basic map that lives in the same space as "bmap"
11744 * except that the domain or range has been replaced by
11745 * the domain space of "ma".
11747 * If bmap is represented by
11749 * A(p) + S u + B x + T v + C(divs) >= 0,
11751 * where u and x are input and output dimensions if type == isl_dim_out
11752 * while x and v are input and output dimensions if type == isl_dim_in,
11753 * and ma is represented by
11755 * x = D(p) + F(y) + G(divs')
11757 * then the result is
11759 * A(p) + B D(p) + S u + B F(y) + T v + B G(divs') + C(divs) >= 0
11761 * The divs in the input set are similarly adjusted.
11764 * floor((a_i(p) + s u + b_i x + t v + c_i(divs))/n_i)
11768 * floor((a_i(p) + b_i D(p) + s u + b_i F(y) + t v +
11769 * B_i G(divs') + c_i(divs))/n_i)
11771 * If bmap is not a rational map and if F(y) involves any denominators
11773 * x_i = (f_i y + h_i)/m_i
11775 * then additional constraints are added to ensure that we only
11776 * map back integer points. That is we enforce
11778 * f_i y + h_i = m_i alpha_i
11780 * with alpha_i an additional existentially quantified variable.
11782 * We first copy over the divs from "ma".
11783 * Then we add the modified constraints and divs from "bmap".
11784 * Finally, we add the stride constraints, if needed.
11786 __isl_give isl_basic_map
*isl_basic_map_preimage_multi_aff(
11787 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
,
11788 __isl_take isl_multi_aff
*ma
)
11792 isl_basic_map
*res
= NULL
;
11793 int n_before
, n_after
, n_div_bmap
, n_div_ma
;
11794 isl_int f
, c1
, c2
, g
;
11795 int rational
, strides
;
11802 ma
= isl_multi_aff_align_divs(ma
);
11805 if (check_basic_map_compatible_range_multi_aff(bmap
, type
, ma
) < 0)
11808 if (type
== isl_dim_in
) {
11810 n_after
= isl_basic_map_dim(bmap
, isl_dim_out
);
11812 n_before
= isl_basic_map_dim(bmap
, isl_dim_in
);
11815 n_div_bmap
= isl_basic_map_dim(bmap
, isl_dim_div
);
11816 n_div_ma
= ma
->n
? isl_aff_dim(ma
->p
[0], isl_dim_div
) : 0;
11818 space
= isl_multi_aff_get_domain_space(ma
);
11819 space
= isl_space_set(isl_basic_map_get_space(bmap
), type
, space
);
11820 rational
= isl_basic_map_is_rational(bmap
);
11821 strides
= rational
? 0 : multi_aff_strides(ma
);
11822 res
= isl_basic_map_alloc_space(space
, n_div_ma
+ n_div_bmap
+ strides
,
11823 bmap
->n_eq
+ strides
, bmap
->n_ineq
+ 2 * n_div_ma
);
11825 res
= isl_basic_map_set_rational(res
);
11827 for (i
= 0; i
< n_div_ma
+ n_div_bmap
; ++i
)
11828 if (isl_basic_map_alloc_div(res
) < 0)
11831 if (set_ma_divs(res
, ma
, n_before
, n_after
, n_div_ma
) < 0)
11834 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
11835 k
= isl_basic_map_alloc_equality(res
);
11838 isl_seq_preimage(res
->eq
[k
], bmap
->eq
[i
], ma
, n_before
,
11839 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11842 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
11843 k
= isl_basic_map_alloc_inequality(res
);
11846 isl_seq_preimage(res
->ineq
[k
], bmap
->ineq
[i
], ma
, n_before
,
11847 n_after
, n_div_ma
, n_div_bmap
, f
, c1
, c2
, g
, 0);
11850 for (i
= 0; i
< bmap
->n_div
; ++i
) {
11851 if (isl_int_is_zero(bmap
->div
[i
][0])) {
11852 isl_int_set_si(res
->div
[n_div_ma
+ i
][0], 0);
11855 isl_seq_preimage(res
->div
[n_div_ma
+ i
], bmap
->div
[i
], ma
,
11856 n_before
, n_after
, n_div_ma
, n_div_bmap
,
11861 res
= add_ma_strides(res
, ma
, n_before
, n_after
);
11867 isl_basic_map_free(bmap
);
11868 isl_multi_aff_free(ma
);
11869 res
= isl_basic_set_simplify(res
);
11870 return isl_basic_map_finalize(res
);
11876 isl_basic_map_free(bmap
);
11877 isl_multi_aff_free(ma
);
11878 isl_basic_map_free(res
);
11882 /* Compute the preimage of "bset" under the function represented by "ma".
11883 * In other words, plug in "ma" in "bset". The result is a basic set
11884 * that lives in the domain space of "ma".
11886 __isl_give isl_basic_set
*isl_basic_set_preimage_multi_aff(
11887 __isl_take isl_basic_set
*bset
, __isl_take isl_multi_aff
*ma
)
11889 return isl_basic_map_preimage_multi_aff(bset
, isl_dim_set
, ma
);
11892 /* Check if the range of "ma" is compatible with the domain or range
11893 * (depending on "type") of "map".
11894 * Return -1 if anything is wrong.
11896 static int check_map_compatible_range_multi_aff(
11897 __isl_keep isl_map
*map
, enum isl_dim_type type
,
11898 __isl_keep isl_multi_aff
*ma
)
11901 isl_space
*ma_space
;
11903 ma_space
= isl_multi_aff_get_space(ma
);
11904 m
= isl_space_tuple_match(map
->dim
, type
, ma_space
, isl_dim_out
);
11905 isl_space_free(ma_space
);
11907 isl_die(isl_map_get_ctx(map
), isl_error_invalid
,
11908 "spaces don't match", return -1);
11912 /* Compute the preimage of the domain or range (depending on "type")
11913 * of "map" under the function represented by "ma".
11914 * In other words, plug in "ma" in the domain or range of "map".
11915 * The result is a map that lives in the same space as "map"
11916 * except that the domain or range has been replaced by
11917 * the domain space of "ma".
11919 * The parameters are assumed to have been aligned.
11921 static __isl_give isl_map
*map_preimage_multi_aff(__isl_take isl_map
*map
,
11922 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11927 map
= isl_map_cow(map
);
11928 ma
= isl_multi_aff_align_divs(ma
);
11931 if (check_map_compatible_range_multi_aff(map
, type
, ma
) < 0)
11934 for (i
= 0; i
< map
->n
; ++i
) {
11935 map
->p
[i
] = isl_basic_map_preimage_multi_aff(map
->p
[i
], type
,
11936 isl_multi_aff_copy(ma
));
11941 space
= isl_multi_aff_get_domain_space(ma
);
11942 space
= isl_space_set(isl_map_get_space(map
), type
, space
);
11944 isl_space_free(map
->dim
);
11949 isl_multi_aff_free(ma
);
11951 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
11952 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
11955 isl_multi_aff_free(ma
);
11960 /* Compute the preimage of the domain or range (depending on "type")
11961 * of "map" under the function represented by "ma".
11962 * In other words, plug in "ma" in the domain or range of "map".
11963 * The result is a map that lives in the same space as "map"
11964 * except that the domain or range has been replaced by
11965 * the domain space of "ma".
11967 __isl_give isl_map
*isl_map_preimage_multi_aff(__isl_take isl_map
*map
,
11968 enum isl_dim_type type
, __isl_take isl_multi_aff
*ma
)
11973 if (isl_space_match(map
->dim
, isl_dim_param
, ma
->space
, isl_dim_param
))
11974 return map_preimage_multi_aff(map
, type
, ma
);
11976 if (!isl_space_has_named_params(map
->dim
) ||
11977 !isl_space_has_named_params(ma
->space
))
11978 isl_die(map
->ctx
, isl_error_invalid
,
11979 "unaligned unnamed parameters", goto error
);
11980 map
= isl_map_align_params(map
, isl_multi_aff_get_space(ma
));
11981 ma
= isl_multi_aff_align_params(ma
, isl_map_get_space(map
));
11983 return map_preimage_multi_aff(map
, type
, ma
);
11985 isl_multi_aff_free(ma
);
11986 return isl_map_free(map
);
11989 /* Compute the preimage of "set" under the function represented by "ma".
11990 * In other words, plug in "ma" "set". The result is a set
11991 * that lives in the domain space of "ma".
11993 __isl_give isl_set
*isl_set_preimage_multi_aff(__isl_take isl_set
*set
,
11994 __isl_take isl_multi_aff
*ma
)
11996 return isl_map_preimage_multi_aff(set
, isl_dim_set
, ma
);
11999 /* Compute the preimage of the domain of "map" under the function
12000 * represented by "ma".
12001 * In other words, plug in "ma" in the domain of "map".
12002 * The result is a map that lives in the same space as "map"
12003 * except that the domain has been replaced by the domain space of "ma".
12005 __isl_give isl_map
*isl_map_preimage_domain_multi_aff(__isl_take isl_map
*map
,
12006 __isl_take isl_multi_aff
*ma
)
12008 return isl_map_preimage_multi_aff(map
, isl_dim_in
, ma
);
12011 /* Compute the preimage of "set" under the function represented by "pma".
12012 * In other words, plug in "pma" in "set. The result is a set
12013 * that lives in the domain space of "pma".
12015 static __isl_give isl_set
*set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12016 __isl_take isl_pw_multi_aff
*pma
)
12025 isl_pw_multi_aff_free(pma
);
12026 res
= isl_set_empty(isl_set_get_space(set
));
12031 res
= isl_set_preimage_multi_aff(isl_set_copy(set
),
12032 isl_multi_aff_copy(pma
->p
[0].maff
));
12033 res
= isl_set_intersect(res
, isl_set_copy(pma
->p
[0].set
));
12035 for (i
= 1; i
< pma
->n
; ++i
) {
12038 res_i
= isl_set_preimage_multi_aff(isl_set_copy(set
),
12039 isl_multi_aff_copy(pma
->p
[i
].maff
));
12040 res_i
= isl_set_intersect(res_i
, isl_set_copy(pma
->p
[i
].set
));
12041 res
= isl_set_union(res
, res_i
);
12044 isl_pw_multi_aff_free(pma
);
12048 isl_pw_multi_aff_free(pma
);
12053 __isl_give isl_set
*isl_set_preimage_pw_multi_aff(__isl_take isl_set
*set
,
12054 __isl_take isl_pw_multi_aff
*pma
)
12059 if (isl_space_match(set
->dim
, isl_dim_param
, pma
->dim
, isl_dim_param
))
12060 return set_preimage_pw_multi_aff(set
, pma
);
12062 if (!isl_space_has_named_params(set
->dim
) ||
12063 !isl_space_has_named_params(pma
->dim
))
12064 isl_die(set
->ctx
, isl_error_invalid
,
12065 "unaligned unnamed parameters", goto error
);
12066 set
= isl_set_align_params(set
, isl_pw_multi_aff_get_space(pma
));
12067 pma
= isl_pw_multi_aff_align_params(pma
, isl_set_get_space(set
));
12069 return set_preimage_pw_multi_aff(set
, pma
);
12071 isl_pw_multi_aff_free(pma
);
12072 return isl_set_free(set
);