2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
41 struct isl_dim_map
*dim_map
;
42 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
43 sizeof(struct isl_dim_map
) + len
* sizeof(int));
46 dim_map
->len
= 1 + len
;
48 for (i
= 0; i
< len
; ++i
)
49 dim_map
->pos
[1 + i
] = -1;
53 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
56 case isl_dim_param
: return dim
->nparam
;
57 case isl_dim_in
: return dim
->n_in
;
58 case isl_dim_out
: return dim
->n_out
;
59 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
64 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
67 case isl_dim_param
: return 1;
68 case isl_dim_in
: return 1 + dim
->nparam
;
69 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
74 static void isl_dim_map_dim_range(struct isl_dim_map
*dim_map
,
75 struct isl_dim
*dim
, enum isl_dim_type type
,
76 unsigned first
, unsigned n
, unsigned dst_pos
)
84 src_pos
= pos(dim
, type
);
85 for (i
= 0; i
< n
; ++i
)
86 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ first
+ i
;
89 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
90 enum isl_dim_type type
, unsigned dst_pos
)
92 isl_dim_map_dim_range(dim_map
, dim
, type
, 0, n(dim
, type
), dst_pos
);
95 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
96 struct isl_basic_map
*bmap
, unsigned dst_pos
)
101 if (!dim_map
|| !bmap
)
104 src_pos
= 1 + isl_dim_total(bmap
->dim
);
105 for (i
= 0; i
< bmap
->n_div
; ++i
)
106 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
109 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
113 for (i
= 0; i
< dim_map
->len
; ++i
)
114 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
115 fprintf(stderr
, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
119 enum isl_dim_type type
)
126 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
127 case isl_dim_div
: return bmap
->n_div
;
128 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
133 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
135 return map
? n(map
->dim
, type
) : 0;
138 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
140 return set
? n(set
->dim
, type
) : 0;
143 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
144 enum isl_dim_type type
)
146 struct isl_dim
*dim
= bmap
->dim
;
148 case isl_dim_param
: return 1;
149 case isl_dim_in
: return 1 + dim
->nparam
;
150 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
151 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
156 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
158 return pos(map
->dim
, type
);
161 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
162 enum isl_dim_type type
)
164 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
167 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
169 return isl_basic_set_dim(bset
, isl_dim_set
);
172 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
174 return isl_basic_set_dim(bset
, isl_dim_param
);
177 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
179 return isl_dim_total(bset
->dim
) + bset
->n_div
;
182 unsigned isl_set_n_dim(const struct isl_set
*set
)
184 return isl_set_dim(set
, isl_dim_set
);
187 unsigned isl_set_n_param(const struct isl_set
*set
)
189 return isl_set_dim(set
, isl_dim_param
);
192 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
194 return bmap
? bmap
->dim
->n_in
: 0;
197 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
199 return bmap
? bmap
->dim
->n_out
: 0;
202 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
204 return bmap
? bmap
->dim
->nparam
: 0;
207 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
209 return bmap
? bmap
->n_div
: 0;
212 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
214 return bmap
? isl_dim_total(bmap
->dim
) + bmap
->n_div
: 0;
217 unsigned isl_map_n_in(const struct isl_map
*map
)
219 return map
->dim
->n_in
;
222 unsigned isl_map_n_out(const struct isl_map
*map
)
224 return map
->dim
->n_out
;
227 unsigned isl_map_n_param(const struct isl_map
*map
)
229 return map
->dim
->nparam
;
232 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
237 m
= isl_dim_match(map
->dim
, isl_dim_param
, set
->dim
, isl_dim_param
);
240 return isl_dim_tuple_match(map
->dim
, isl_dim_in
, set
->dim
, isl_dim_set
);
243 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
244 struct isl_basic_set
*bset
)
249 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
252 return isl_dim_tuple_match(bmap
->dim
, isl_dim_in
, bset
->dim
, isl_dim_set
);
255 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
256 struct isl_basic_set
*bset
)
261 m
= isl_dim_match(bmap
->dim
, isl_dim_param
, bset
->dim
, isl_dim_param
);
264 return isl_dim_tuple_match(bmap
->dim
, isl_dim_out
, bset
->dim
, isl_dim_set
);
267 isl_ctx
*isl_basic_map_get_ctx(__isl_keep isl_basic_map
*bmap
)
269 return bmap
? bmap
->ctx
: NULL
;
272 isl_ctx
*isl_basic_set_get_ctx(__isl_keep isl_basic_set
*bset
)
274 return bset
? bset
->ctx
: NULL
;
277 isl_ctx
*isl_map_get_ctx(__isl_keep isl_map
*map
)
279 return map
? map
->ctx
: NULL
;
282 isl_ctx
*isl_set_get_ctx(__isl_keep isl_set
*set
)
284 return set
? set
->ctx
: NULL
;
287 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
291 return isl_dim_copy(bmap
->dim
);
294 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
298 return isl_dim_copy(bset
->dim
);
301 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
305 return isl_dim_copy(map
->dim
);
308 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
312 return isl_dim_copy(set
->dim
);
315 __isl_give isl_basic_map
*isl_basic_map_set_tuple_name(
316 __isl_take isl_basic_map
*bmap
, enum isl_dim_type type
, const char *s
)
318 bmap
= isl_basic_map_cow(bmap
);
321 bmap
->dim
= isl_dim_set_tuple_name(bmap
->dim
, type
, s
);
326 isl_basic_map_free(bmap
);
330 __isl_give isl_map
*isl_map_set_tuple_name(__isl_take isl_map
*map
,
331 enum isl_dim_type type
, const char *s
)
335 map
= isl_map_cow(map
);
339 map
->dim
= isl_dim_set_tuple_name(map
->dim
, type
, s
);
343 for (i
= 0; i
< map
->n
; ++i
) {
344 map
->p
[i
] = isl_basic_map_set_tuple_name(map
->p
[i
], type
, s
);
355 __isl_give isl_basic_map
*isl_basic_map_set_dim_name(
356 __isl_take isl_basic_map
*bmap
,
357 enum isl_dim_type type
, unsigned pos
, const char *s
)
361 bmap
->dim
= isl_dim_set_name(bmap
->dim
, type
, pos
, s
);
366 isl_basic_map_free(bmap
);
370 __isl_give isl_map
*isl_map_set_dim_name(__isl_take isl_map
*map
,
371 enum isl_dim_type type
, unsigned pos
, const char *s
)
378 map
->dim
= isl_dim_set_name(map
->dim
, type
, pos
, s
);
382 for (i
= 0; i
< map
->n
; ++i
) {
383 map
->p
[i
] = isl_basic_map_set_dim_name(map
->p
[i
], type
, pos
, s
);
394 __isl_give isl_basic_set
*isl_basic_set_set_dim_name(
395 __isl_take isl_basic_set
*bset
,
396 enum isl_dim_type type
, unsigned pos
, const char *s
)
398 return (isl_basic_set
*)isl_basic_map_set_dim_name(
399 (isl_basic_map
*)bset
, type
, pos
, s
);
402 __isl_give isl_set
*isl_set_set_dim_name(__isl_take isl_set
*set
,
403 enum isl_dim_type type
, unsigned pos
, const char *s
)
405 return (isl_set
*)isl_map_set_dim_name((isl_map
*)set
, type
, pos
, s
);
408 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
412 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
415 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
416 struct isl_basic_map
*bmap
, unsigned extra
,
417 unsigned n_eq
, unsigned n_ineq
)
420 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
425 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
426 if (isl_blk_is_error(bmap
->block
))
429 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
434 bmap
->block2
= isl_blk_empty();
437 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
438 if (isl_blk_is_error(bmap
->block2
))
441 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
446 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
447 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
449 for (i
= 0; i
< extra
; ++i
)
450 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
454 bmap
->c_size
= n_eq
+ n_ineq
;
455 bmap
->eq
= bmap
->ineq
+ n_ineq
;
464 isl_basic_map_free(bmap
);
468 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
469 unsigned nparam
, unsigned dim
, unsigned extra
,
470 unsigned n_eq
, unsigned n_ineq
)
472 struct isl_basic_map
*bmap
;
473 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
474 return (struct isl_basic_set
*)bmap
;
477 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
478 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
480 struct isl_basic_map
*bmap
;
483 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
484 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
485 return (struct isl_basic_set
*)bmap
;
488 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
489 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
491 struct isl_basic_map
*bmap
;
495 bmap
= isl_calloc_type(dim
->ctx
, struct isl_basic_map
);
500 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
506 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
507 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
508 unsigned n_eq
, unsigned n_ineq
)
510 struct isl_basic_map
*bmap
;
513 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
517 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
521 static void dup_constraints(
522 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
525 unsigned total
= isl_basic_map_total_dim(src
);
527 for (i
= 0; i
< src
->n_eq
; ++i
) {
528 int j
= isl_basic_map_alloc_equality(dst
);
529 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
532 for (i
= 0; i
< src
->n_ineq
; ++i
) {
533 int j
= isl_basic_map_alloc_inequality(dst
);
534 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
537 for (i
= 0; i
< src
->n_div
; ++i
) {
538 int j
= isl_basic_map_alloc_div(dst
);
539 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
541 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
544 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
546 struct isl_basic_map
*dup
;
550 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
551 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
554 dup_constraints(dup
, bmap
);
555 dup
->flags
= bmap
->flags
;
556 dup
->sample
= isl_vec_copy(bmap
->sample
);
560 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
562 struct isl_basic_map
*dup
;
564 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
565 return (struct isl_basic_set
*)dup
;
568 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
573 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
577 return isl_basic_set_dup(bset
);
580 struct isl_set
*isl_set_copy(struct isl_set
*set
)
589 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
594 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
598 bmap
= isl_basic_map_dup(bmap
);
600 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
604 struct isl_map
*isl_map_copy(struct isl_map
*map
)
613 void isl_basic_map_free(struct isl_basic_map
*bmap
)
621 isl_ctx_deref(bmap
->ctx
);
623 isl_blk_free(bmap
->ctx
, bmap
->block2
);
625 isl_blk_free(bmap
->ctx
, bmap
->block
);
626 isl_vec_free(bmap
->sample
);
627 isl_dim_free(bmap
->dim
);
631 void isl_basic_set_free(struct isl_basic_set
*bset
)
633 isl_basic_map_free((struct isl_basic_map
*)bset
);
636 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
638 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
641 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
647 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
648 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
650 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
651 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
652 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
653 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
654 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
655 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
657 int j
= isl_basic_map_alloc_inequality(bmap
);
661 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
662 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
669 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
670 bmap
->extra
- bmap
->n_div
);
674 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
676 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
679 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
683 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
688 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
690 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
693 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
698 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
700 if (pos
!= bmap
->n_eq
- 1) {
702 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
703 bmap
->eq
[bmap
->n_eq
- 1] = t
;
709 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
711 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
714 void isl_basic_map_inequality_to_equality(
715 struct isl_basic_map
*bmap
, unsigned pos
)
720 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
721 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
726 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
727 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
728 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
729 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
732 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
734 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
737 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
743 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
744 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
745 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
746 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
747 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
748 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
749 1 + isl_basic_map_total_dim(bmap
),
750 bmap
->extra
- bmap
->n_div
);
751 return bmap
->n_ineq
++;
754 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
756 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
759 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
763 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
768 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
770 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
773 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
778 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
780 if (pos
!= bmap
->n_ineq
- 1) {
782 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
783 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
784 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
790 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
792 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
795 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
800 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
803 k
= isl_basic_map_alloc_equality(bmap
);
806 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
809 isl_basic_map_free(bmap
);
813 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
816 return (isl_basic_set
*)
817 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
820 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
825 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
828 k
= isl_basic_map_alloc_inequality(bmap
);
831 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
834 isl_basic_map_free(bmap
);
838 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
841 return (isl_basic_set
*)
842 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
845 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
849 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
850 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
851 1 + 1 + isl_basic_map_total_dim(bmap
),
852 bmap
->extra
- bmap
->n_div
);
853 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
854 return bmap
->n_div
++;
857 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
859 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
862 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
866 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
871 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
873 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
876 /* Copy constraint from src to dst, putting the vars of src at offset
877 * dim_off in dst and the divs of src at offset div_off in dst.
878 * If both sets are actually map, then dim_off applies to the input
881 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
882 struct isl_basic_map
*src_map
, isl_int
*src
,
883 unsigned in_off
, unsigned out_off
, unsigned div_off
)
885 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
886 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
887 unsigned src_in
= isl_basic_map_n_in(src_map
);
888 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
889 unsigned src_out
= isl_basic_map_n_out(src_map
);
890 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
891 isl_int_set(dst
[0], src
[0]);
892 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
893 if (dst_nparam
> src_nparam
)
894 isl_seq_clr(dst
+1+src_nparam
,
895 dst_nparam
- src_nparam
);
896 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
897 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
899 isl_min(dst_in
-in_off
, src_in
));
900 if (dst_in
-in_off
> src_in
)
901 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
902 dst_in
- in_off
- src_in
);
903 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
904 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
905 src
+1+src_nparam
+src_in
,
906 isl_min(dst_out
-out_off
, src_out
));
907 if (dst_out
-out_off
> src_out
)
908 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
909 dst_out
- out_off
- src_out
);
910 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
911 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
912 src
+1+src_nparam
+src_in
+src_out
,
913 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
914 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
915 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
916 div_off
+src_map
->n_div
,
917 dst_map
->n_div
- div_off
- src_map
->n_div
);
920 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
921 struct isl_basic_map
*src_map
, isl_int
*src
,
922 unsigned in_off
, unsigned out_off
, unsigned div_off
)
924 isl_int_set(dst
[0], src
[0]);
925 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
928 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
929 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
934 if (!bmap1
|| !bmap2
)
937 div_off
= bmap1
->n_div
;
939 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
940 int i1
= isl_basic_map_alloc_equality(bmap1
);
943 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
944 i_pos
, o_pos
, div_off
);
947 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
948 int i1
= isl_basic_map_alloc_inequality(bmap1
);
951 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
952 i_pos
, o_pos
, div_off
);
955 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
956 int i1
= isl_basic_map_alloc_div(bmap1
);
959 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
960 i_pos
, o_pos
, div_off
);
963 isl_basic_map_free(bmap2
);
968 isl_basic_map_free(bmap1
);
969 isl_basic_map_free(bmap2
);
973 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
974 struct isl_dim_map
*dim_map
)
978 for (i
= 0; i
< dim_map
->len
; ++i
) {
979 if (dim_map
->pos
[i
] < 0)
980 isl_int_set_si(dst
[i
], 0);
982 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
986 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
987 struct isl_dim_map
*dim_map
)
989 isl_int_set(dst
[0], src
[0]);
990 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
993 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
994 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
998 if (!src
|| !dst
|| !dim_map
)
1001 for (i
= 0; i
< src
->n_eq
; ++i
) {
1002 int i1
= isl_basic_map_alloc_equality(dst
);
1005 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
1008 for (i
= 0; i
< src
->n_ineq
; ++i
) {
1009 int i1
= isl_basic_map_alloc_inequality(dst
);
1012 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
1015 for (i
= 0; i
< src
->n_div
; ++i
) {
1016 int i1
= isl_basic_map_alloc_div(dst
);
1019 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
1023 isl_basic_map_free(src
);
1028 isl_basic_map_free(src
);
1029 isl_basic_map_free(dst
);
1033 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
1034 struct isl_basic_set
*bset2
, unsigned pos
)
1036 return (struct isl_basic_set
*)
1037 add_constraints((struct isl_basic_map
*)bset1
,
1038 (struct isl_basic_map
*)bset2
, 0, pos
);
1041 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
1042 struct isl_dim
*dim
, unsigned extra
,
1043 unsigned n_eq
, unsigned n_ineq
)
1045 struct isl_basic_map
*ext
;
1055 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
1056 base
->extra
>= base
->n_div
+ extra
;
1058 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
1059 room_for_ineq(base
, n_ineq
)) {
1064 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
1065 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
1066 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
1067 extra
+= base
->extra
;
1069 n_ineq
+= base
->n_ineq
;
1071 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
1077 ext
->sample
= isl_vec_copy(base
->sample
);
1078 flags
= base
->flags
;
1079 ext
= add_constraints(ext
, base
, 0, 0);
1082 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
1089 isl_basic_map_free(base
);
1093 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
1094 struct isl_dim
*dim
, unsigned extra
,
1095 unsigned n_eq
, unsigned n_ineq
)
1097 return (struct isl_basic_set
*)
1098 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
1099 extra
, n_eq
, n_ineq
);
1102 struct isl_basic_map
*isl_basic_map_extend_constraints(
1103 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
1107 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
1111 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
1112 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
1113 unsigned n_eq
, unsigned n_ineq
)
1115 struct isl_basic_map
*bmap
;
1116 struct isl_dim
*dim
;
1120 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1124 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1127 isl_basic_map_free(base
);
1131 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1132 unsigned nparam
, unsigned dim
, unsigned extra
,
1133 unsigned n_eq
, unsigned n_ineq
)
1135 return (struct isl_basic_set
*)
1136 isl_basic_map_extend((struct isl_basic_map
*)base
,
1137 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1140 struct isl_basic_set
*isl_basic_set_extend_constraints(
1141 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1143 return (struct isl_basic_set
*)
1144 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1148 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1150 return (struct isl_basic_set
*)
1151 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1154 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1159 if (bmap
->ref
> 1) {
1161 bmap
= isl_basic_map_dup(bmap
);
1164 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1168 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1176 return isl_set_dup(set
);
1179 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1187 return isl_map_dup(map
);
1190 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1191 unsigned a_len
, unsigned b_len
)
1193 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1194 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1195 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1198 struct isl_basic_set
*isl_basic_set_swap_vars(
1199 struct isl_basic_set
*bset
, unsigned n
)
1209 nparam
= isl_basic_set_n_param(bset
);
1210 dim
= isl_basic_set_n_dim(bset
);
1211 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1216 bset
= isl_basic_set_cow(bset
);
1220 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1221 if (isl_blk_is_error(blk
))
1224 for (i
= 0; i
< bset
->n_eq
; ++i
)
1226 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1228 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1230 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1232 for (i
= 0; i
< bset
->n_div
; ++i
)
1234 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1236 isl_blk_free(bset
->ctx
, blk
);
1238 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1239 return isl_basic_set_gauss(bset
, NULL
);
1241 isl_basic_set_free(bset
);
1245 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1248 set
= isl_set_cow(set
);
1252 for (i
= 0; i
< set
->n
; ++i
) {
1253 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1259 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1263 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1269 total
= isl_basic_map_total_dim(bmap
);
1270 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1271 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1273 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1275 i
= isl_basic_map_alloc_equality(bmap
);
1279 isl_int_set_si(bmap
->eq
[i
][0], 1);
1280 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1281 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1282 isl_vec_free(bmap
->sample
);
1283 bmap
->sample
= NULL
;
1284 return isl_basic_map_finalize(bmap
);
1286 isl_basic_map_free(bmap
);
1290 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1292 return (struct isl_basic_set
*)
1293 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1296 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1299 unsigned off
= isl_dim_total(bmap
->dim
);
1300 isl_int
*t
= bmap
->div
[a
];
1301 bmap
->div
[a
] = bmap
->div
[b
];
1304 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1305 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1307 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1308 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1310 for (i
= 0; i
< bmap
->n_div
; ++i
)
1311 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1312 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1315 /* Eliminate the specified n dimensions starting at first from the
1316 * constraints using Fourier-Motzkin. The dimensions themselves
1319 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1320 enum isl_dim_type type
, unsigned first
, unsigned n
)
1329 map
= isl_map_cow(map
);
1332 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1333 first
+= pos(map
->dim
, type
) - 1;
1335 for (i
= 0; i
< map
->n
; ++i
) {
1336 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1346 /* Eliminate the specified n dimensions starting at first from the
1347 * constraints using Fourier-Motzkin. The dimensions themselves
1350 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1351 enum isl_dim_type type
, unsigned first
, unsigned n
)
1353 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1356 /* Eliminate the specified n dimensions starting at first from the
1357 * constraints using Fourier-Motzkin. The dimensions themselves
1360 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1361 unsigned first
, unsigned n
)
1363 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1366 /* Project out n dimensions starting at first using Fourier-Motzkin */
1367 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1368 unsigned first
, unsigned n
)
1370 set
= isl_set_eliminate_dims(set
, first
, n
);
1371 set
= isl_set_drop_dims(set
, first
, n
);
1375 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1377 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1385 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1394 set
= isl_set_cow(set
);
1398 for (i
= 0; i
< set
->n
; ++i
) {
1399 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1409 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1410 enum isl_dim_type type
, unsigned first
, unsigned n
)
1414 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1418 bmap
= isl_basic_map_eliminate_vars(bmap
,
1419 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1422 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1424 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1427 isl_basic_map_free(bmap
);
1431 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1432 enum isl_dim_type type
, unsigned first
, unsigned n
)
1434 return (isl_basic_set
*)
1435 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1438 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1439 enum isl_dim_type type
, unsigned first
, unsigned n
)
1446 map
= isl_map_cow(map
);
1449 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1451 for (i
= 0; i
< map
->n
; ++i
) {
1452 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1453 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1457 map
= isl_map_drop(map
, type
, first
, n
);
1464 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1465 enum isl_dim_type type
, unsigned first
, unsigned n
)
1467 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1470 /* Project out n inputs starting at first using Fourier-Motzkin */
1471 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1472 unsigned first
, unsigned n
)
1474 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1477 /* Project out n dimensions starting at first using Fourier-Motzkin */
1478 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1479 unsigned first
, unsigned n
)
1481 unsigned nparam
= isl_basic_set_n_param(bset
);
1482 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1483 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1487 static void dump_term(struct isl_basic_map
*bmap
,
1488 isl_int c
, int pos
, FILE *out
)
1491 unsigned in
= isl_basic_map_n_in(bmap
);
1492 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1493 unsigned nparam
= isl_basic_map_n_param(bmap
);
1495 isl_int_print(out
, c
, 0);
1497 if (!isl_int_is_one(c
))
1498 isl_int_print(out
, c
, 0);
1499 if (pos
< 1 + nparam
) {
1500 name
= isl_dim_get_name(bmap
->dim
,
1501 isl_dim_param
, pos
- 1);
1503 fprintf(out
, "%s", name
);
1505 fprintf(out
, "p%d", pos
- 1);
1506 } else if (pos
< 1 + nparam
+ in
)
1507 fprintf(out
, "i%d", pos
- 1 - nparam
);
1508 else if (pos
< 1 + nparam
+ dim
)
1509 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1511 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1515 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1516 int sign
, FILE *out
)
1520 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1524 for (i
= 0, first
= 1; i
< len
; ++i
) {
1525 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1528 fprintf(out
, " + ");
1530 isl_int_abs(v
, c
[i
]);
1531 dump_term(bmap
, v
, i
, out
);
1538 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1539 const char *op
, FILE *out
, int indent
)
1543 fprintf(out
, "%*s", indent
, "");
1545 dump_constraint_sign(bmap
, c
, 1, out
);
1546 fprintf(out
, " %s ", op
);
1547 dump_constraint_sign(bmap
, c
, -1, out
);
1551 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1552 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1554 fprintf(out
, "%*s", indent
, "");
1555 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1560 static void dump_constraints(struct isl_basic_map
*bmap
,
1561 isl_int
**c
, unsigned n
,
1562 const char *op
, FILE *out
, int indent
)
1566 for (i
= 0; i
< n
; ++i
)
1567 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1570 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1574 unsigned total
= isl_basic_map_total_dim(bmap
);
1576 for (j
= 0; j
< 1 + total
; ++j
) {
1577 if (isl_int_is_zero(exp
[j
]))
1579 if (!first
&& isl_int_is_pos(exp
[j
]))
1581 dump_term(bmap
, exp
[j
], j
, out
);
1586 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1590 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1591 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1593 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1594 fprintf(out
, "%*s", indent
, "");
1595 fprintf(out
, "e%d = [(", i
);
1596 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1598 isl_int_print(out
, bmap
->div
[i
][0], 0);
1599 fprintf(out
, "]\n");
1603 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1606 fprintf(out
, "null basic set\n");
1610 fprintf(out
, "%*s", indent
, "");
1611 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1612 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1613 bset
->extra
, bset
->flags
);
1614 dump((struct isl_basic_map
*)bset
, out
, indent
);
1617 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1620 fprintf(out
, "null basic map\n");
1624 fprintf(out
, "%*s", indent
, "");
1625 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1626 "flags: %x, n_name: %d\n",
1628 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1629 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1630 dump(bmap
, out
, indent
);
1633 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1638 total
= isl_basic_map_total_dim(bmap
);
1639 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1640 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1641 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1642 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1646 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1648 struct isl_set
*set
;
1652 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1653 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1654 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1655 sizeof(struct isl_set
) +
1656 (n
- 1) * sizeof(struct isl_basic_set
*));
1660 set
->ctx
= dim
->ctx
;
1661 isl_ctx_ref(set
->ctx
);
1673 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1674 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1676 struct isl_set
*set
;
1677 struct isl_dim
*dims
;
1679 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1683 set
= isl_set_alloc_dim(dims
, n
, flags
);
1687 /* Make sure "map" has room for at least "n" more basic maps.
1689 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1692 struct isl_map
*grown
= NULL
;
1696 isl_assert(map
->ctx
, n
>= 0, goto error
);
1697 if (map
->n
+ n
<= map
->size
)
1699 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1702 for (i
= 0; i
< map
->n
; ++i
) {
1703 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1711 isl_map_free(grown
);
1716 /* Make sure "set" has room for at least "n" more basic sets.
1718 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1720 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1723 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1726 struct isl_set
*dup
;
1731 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1734 for (i
= 0; i
< set
->n
; ++i
)
1735 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1739 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1741 struct isl_set
*set
;
1746 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1748 isl_basic_set_free(bset
);
1751 return isl_set_add_basic_set(set
, bset
);
1754 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1756 struct isl_map
*map
;
1761 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1763 isl_basic_map_free(bmap
);
1766 return isl_map_add_basic_map(map
, bmap
);
1769 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1770 __isl_take isl_basic_set
*bset
)
1772 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1773 (struct isl_basic_map
*)bset
);
1776 void isl_set_free(struct isl_set
*set
)
1786 isl_ctx_deref(set
->ctx
);
1787 for (i
= 0; i
< set
->n
; ++i
)
1788 isl_basic_set_free(set
->p
[i
]);
1789 isl_dim_free(set
->dim
);
1793 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1798 fprintf(out
, "null set\n");
1802 fprintf(out
, "%*s", indent
, "");
1803 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1804 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1806 for (i
= 0; i
< set
->n
; ++i
) {
1807 fprintf(out
, "%*s", indent
, "");
1808 fprintf(out
, "basic set %d:\n", i
);
1809 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1813 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1818 fprintf(out
, "null map\n");
1822 fprintf(out
, "%*s", indent
, "");
1823 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1824 "flags: %x, n_name: %d\n",
1825 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1826 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1827 for (i
= 0; i
< map
->n
; ++i
) {
1828 fprintf(out
, "%*s", indent
, "");
1829 fprintf(out
, "basic map %d:\n", i
);
1830 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1834 struct isl_basic_map
*isl_basic_map_intersect_domain(
1835 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1837 struct isl_basic_map
*bmap_domain
;
1838 struct isl_dim
*dim
;
1843 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1844 bset
->dim
, isl_dim_param
), goto error
);
1846 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1847 isl_assert(bset
->ctx
,
1848 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1850 bmap
= isl_basic_map_cow(bmap
);
1853 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1854 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1855 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1856 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1857 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1859 bmap
= isl_basic_map_simplify(bmap
);
1860 return isl_basic_map_finalize(bmap
);
1862 isl_basic_map_free(bmap
);
1863 isl_basic_set_free(bset
);
1867 struct isl_basic_map
*isl_basic_map_intersect_range(
1868 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1870 struct isl_basic_map
*bmap_range
;
1875 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1876 bset
->dim
, isl_dim_param
), goto error
);
1878 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1879 isl_assert(bset
->ctx
,
1880 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1882 bmap
= isl_basic_map_cow(bmap
);
1885 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1886 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1887 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1888 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1890 bmap
= isl_basic_map_simplify(bmap
);
1891 return isl_basic_map_finalize(bmap
);
1893 isl_basic_map_free(bmap
);
1894 isl_basic_set_free(bset
);
1898 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1904 total
= 1 + isl_basic_map_total_dim(bmap
);
1905 if (total
!= vec
->size
)
1910 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1911 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1912 if (!isl_int_is_zero(s
)) {
1918 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1919 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1920 if (isl_int_is_neg(s
)) {
1931 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1933 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1936 struct isl_basic_map
*isl_basic_map_intersect(
1937 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1939 struct isl_vec
*sample
= NULL
;
1941 if (!bmap1
|| !bmap2
)
1944 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1945 bmap2
->dim
, isl_dim_param
), goto error
);
1946 if (isl_dim_total(bmap1
->dim
) ==
1947 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1948 isl_dim_total(bmap2
->dim
) !=
1949 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1950 return isl_basic_map_intersect(bmap2
, bmap1
);
1952 if (isl_dim_total(bmap2
->dim
) !=
1953 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1954 isl_assert(bmap1
->ctx
,
1955 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1957 if (bmap1
->sample
&&
1958 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1959 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1960 sample
= isl_vec_copy(bmap1
->sample
);
1961 else if (bmap2
->sample
&&
1962 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1963 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1964 sample
= isl_vec_copy(bmap2
->sample
);
1966 bmap1
= isl_basic_map_cow(bmap1
);
1969 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1970 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1971 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1974 isl_vec_free(sample
);
1976 isl_vec_free(bmap1
->sample
);
1977 bmap1
->sample
= sample
;
1980 bmap1
= isl_basic_map_simplify(bmap1
);
1981 return isl_basic_map_finalize(bmap1
);
1984 isl_vec_free(sample
);
1985 isl_basic_map_free(bmap1
);
1986 isl_basic_map_free(bmap2
);
1990 struct isl_basic_set
*isl_basic_set_intersect(
1991 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1993 return (struct isl_basic_set
*)
1994 isl_basic_map_intersect(
1995 (struct isl_basic_map
*)bset1
,
1996 (struct isl_basic_map
*)bset2
);
1999 /* Special case of isl_map_intersect, where both map1 and map2
2000 * are convex, without any divs and such that either map1 or map2
2001 * contains a single constraint. This constraint is then simply
2002 * added to the other map.
2004 static __isl_give isl_map
*map_intersect_add_constraint(
2005 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2007 struct isl_basic_map
*bmap1
;
2008 struct isl_basic_map
*bmap2
;
2010 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2011 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2012 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2013 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2015 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2016 return isl_map_intersect(map2
, map1
);
2018 isl_assert(map2
->ctx
,
2019 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2021 map1
= isl_map_cow(map1
);
2024 if (isl_map_fast_is_empty(map1
)) {
2028 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2029 if (map2
->p
[0]->n_eq
== 1)
2030 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2032 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2033 map2
->p
[0]->ineq
[0]);
2035 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2036 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2040 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2041 isl_basic_map_free(map1
->p
[0]);
2054 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2057 struct isl_map
*result
;
2063 if (isl_map_fast_is_empty(map1
)) {
2067 if (isl_map_fast_is_empty(map2
)) {
2072 if (map1
->n
== 1 && map2
->n
== 1 &&
2073 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2074 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2075 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2076 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2077 return map_intersect_add_constraint(map1
, map2
);
2078 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2079 map2
->dim
, isl_dim_param
), goto error
);
2080 if (isl_dim_total(map1
->dim
) ==
2081 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2082 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2083 return isl_map_intersect(map2
, map1
);
2085 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2086 isl_assert(map1
->ctx
,
2087 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2089 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2090 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2091 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2093 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2094 map1
->n
* map2
->n
, flags
);
2097 for (i
= 0; i
< map1
->n
; ++i
)
2098 for (j
= 0; j
< map2
->n
; ++j
) {
2099 struct isl_basic_map
*part
;
2100 part
= isl_basic_map_intersect(
2101 isl_basic_map_copy(map1
->p
[i
]),
2102 isl_basic_map_copy(map2
->p
[j
]));
2103 if (isl_basic_map_is_empty(part
))
2104 isl_basic_map_free(part
);
2106 result
= isl_map_add_basic_map(result
, part
);
2119 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2121 return (struct isl_set
*)
2122 isl_map_intersect((struct isl_map
*)set1
,
2123 (struct isl_map
*)set2
);
2126 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2128 struct isl_dim
*dim
;
2129 struct isl_basic_set
*bset
;
2134 bmap
= isl_basic_map_cow(bmap
);
2137 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2138 in
= isl_basic_map_n_in(bmap
);
2139 bset
= isl_basic_set_from_basic_map(bmap
);
2140 bset
= isl_basic_set_swap_vars(bset
, in
);
2141 return isl_basic_map_from_basic_set(bset
, dim
);
2144 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2145 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2147 struct isl_dim
*res_dim
;
2148 struct isl_basic_map
*res
;
2149 struct isl_dim_map
*dim_map
;
2150 unsigned total
, off
;
2151 enum isl_dim_type t
;
2159 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2161 total
= isl_basic_map_total_dim(bmap
) + n
;
2162 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2164 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2166 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2168 unsigned size
= isl_basic_map_dim(bmap
, t
);
2169 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2171 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2172 pos
, size
- pos
, off
+ pos
+ n
);
2174 off
+= isl_dim_size(res_dim
, t
);
2176 isl_dim_map_div(dim_map
, bmap
, off
);
2178 res
= isl_basic_map_alloc_dim(res_dim
,
2179 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2180 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2181 res
= isl_basic_map_simplify(res
);
2182 return isl_basic_map_finalize(res
);
2185 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2186 enum isl_dim_type type
, unsigned n
)
2190 return isl_basic_map_insert(bmap
, type
,
2191 isl_basic_map_dim(bmap
, type
), n
);
2194 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2195 enum isl_dim_type type
, unsigned n
)
2199 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2200 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2202 isl_basic_set_free(bset
);
2206 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2207 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2214 map
= isl_map_cow(map
);
2218 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2222 for (i
= 0; i
< map
->n
; ++i
) {
2223 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2234 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2235 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2237 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2240 __isl_give isl_map
*isl_map_add(__isl_take isl_map
*map
,
2241 enum isl_dim_type type
, unsigned n
)
2245 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2248 __isl_give isl_set
*isl_set_add(__isl_take isl_set
*set
,
2249 enum isl_dim_type type
, unsigned n
)
2253 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2254 return (isl_set
*)isl_map_add((isl_map
*)set
, type
, n
);
2260 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2261 __isl_take isl_basic_map
*bmap
,
2262 enum isl_dim_type dst_type
, unsigned dst_pos
,
2263 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2266 struct isl_dim_map
*dim_map
;
2267 struct isl_basic_map
*res
;
2268 enum isl_dim_type t
;
2269 unsigned total
, off
;
2276 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2279 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2282 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2284 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2285 pos(bmap
->dim
, src_type
) + src_pos
+
2286 ((src_type
< dst_type
) ? n
: 0)) {
2287 bmap
= isl_basic_map_cow(bmap
);
2291 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2292 src_type
, src_pos
, n
);
2296 bmap
= isl_basic_map_finalize(bmap
);
2301 total
= isl_basic_map_total_dim(bmap
);
2302 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2305 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2306 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2307 if (t
== dst_type
) {
2308 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2311 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2314 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2315 dst_pos
, size
- dst_pos
, off
);
2316 off
+= size
- dst_pos
;
2317 } else if (t
== src_type
) {
2318 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2321 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2322 src_pos
+ n
, size
- src_pos
- n
, off
);
2323 off
+= size
- src_pos
- n
;
2325 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2329 isl_dim_map_div(dim_map
, bmap
, off
);
2331 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2332 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2333 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2335 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2336 src_type
, src_pos
, n
);
2340 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2341 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2342 bmap
= isl_basic_map_finalize(bmap
);
2346 isl_basic_map_free(bmap
);
2350 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2351 enum isl_dim_type dst_type
, unsigned dst_pos
,
2352 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2354 return (isl_basic_set
*)isl_basic_map_move_dims(
2355 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2358 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2359 enum isl_dim_type dst_type
, unsigned dst_pos
,
2360 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2364 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2365 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2366 src_type
, src_pos
, n
);
2372 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2373 enum isl_dim_type dst_type
, unsigned dst_pos
,
2374 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2383 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2386 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2389 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2391 map
= isl_map_cow(map
);
2395 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2399 for (i
= 0; i
< map
->n
; ++i
) {
2400 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2402 src_type
, src_pos
, n
);
2413 /* Move the specified dimensions to the last columns right before
2414 * the divs. Don't change the dimension specification of bmap.
2415 * That's the responsibility of the caller.
2417 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2418 enum isl_dim_type type
, unsigned first
, unsigned n
)
2420 struct isl_dim_map
*dim_map
;
2421 struct isl_basic_map
*res
;
2422 enum isl_dim_type t
;
2423 unsigned total
, off
;
2427 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2430 total
= isl_basic_map_total_dim(bmap
);
2431 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2434 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2435 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2437 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2440 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2441 first
, n
, total
- bmap
->n_div
- n
);
2442 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2443 first
+ n
, size
- (first
+ n
), off
);
2444 off
+= size
- (first
+ n
);
2446 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2450 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2452 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2453 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2454 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2458 /* Turn the n dimensions of type type, starting at first
2459 * into existentially quantified variables.
2461 __isl_give isl_basic_map
*isl_basic_map_project_out(
2462 __isl_take isl_basic_map
*bmap
,
2463 enum isl_dim_type type
, unsigned first
, unsigned n
)
2476 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2477 return isl_basic_map_remove(bmap
, type
, first
, n
);
2479 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2482 bmap
= move_last(bmap
, type
, first
, n
);
2483 bmap
= isl_basic_map_cow(bmap
);
2487 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2488 old
= bmap
->block2
.data
;
2489 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2490 (bmap
->extra
+ n
) * (1 + row_size
));
2491 if (!bmap
->block2
.data
)
2493 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2496 for (i
= 0; i
< n
; ++i
) {
2497 new_div
[i
] = bmap
->block2
.data
+
2498 (bmap
->extra
+ i
) * (1 + row_size
);
2499 isl_seq_clr(new_div
[i
], 1 + row_size
);
2501 for (i
= 0; i
< bmap
->extra
; ++i
)
2502 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2504 bmap
->div
= new_div
;
2508 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2511 bmap
= isl_basic_map_simplify(bmap
);
2512 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2513 return isl_basic_map_finalize(bmap
);
2515 isl_basic_map_free(bmap
);
2519 /* Turn the n dimensions of type type, starting at first
2520 * into existentially quantified variables.
2522 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2523 enum isl_dim_type type
, unsigned first
, unsigned n
)
2525 return (isl_basic_set
*)isl_basic_map_project_out(
2526 (isl_basic_map
*)bset
, type
, first
, n
);
2529 /* Turn the n dimensions of type type, starting at first
2530 * into existentially quantified variables.
2532 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2533 enum isl_dim_type type
, unsigned first
, unsigned n
)
2543 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2545 map
= isl_map_cow(map
);
2549 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2553 for (i
= 0; i
< map
->n
; ++i
) {
2554 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2565 /* Turn the n dimensions of type type, starting at first
2566 * into existentially quantified variables.
2568 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2569 enum isl_dim_type type
, unsigned first
, unsigned n
)
2571 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2574 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2578 for (i
= 0; i
< n
; ++i
) {
2579 j
= isl_basic_map_alloc_div(bmap
);
2582 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2586 isl_basic_map_free(bmap
);
2590 struct isl_basic_map
*isl_basic_map_apply_range(
2591 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2593 struct isl_dim
*dim_result
= NULL
;
2594 struct isl_basic_map
*bmap
;
2595 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2596 struct isl_dim_map
*dim_map1
, *dim_map2
;
2598 if (!bmap1
|| !bmap2
)
2601 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2602 isl_dim_copy(bmap2
->dim
));
2604 n_in
= isl_basic_map_n_in(bmap1
);
2605 n_out
= isl_basic_map_n_out(bmap2
);
2606 n
= isl_basic_map_n_out(bmap1
);
2607 nparam
= isl_basic_map_n_param(bmap1
);
2609 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2610 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2611 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2612 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2613 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2614 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2615 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2616 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2617 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2618 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2619 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2621 bmap
= isl_basic_map_alloc_dim(dim_result
,
2622 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2623 bmap1
->n_eq
+ bmap2
->n_eq
,
2624 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2625 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2626 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2627 bmap
= add_divs(bmap
, n
);
2628 bmap
= isl_basic_map_simplify(bmap
);
2629 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2630 return isl_basic_map_finalize(bmap
);
2632 isl_basic_map_free(bmap1
);
2633 isl_basic_map_free(bmap2
);
2637 struct isl_basic_set
*isl_basic_set_apply(
2638 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2643 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2646 return (struct isl_basic_set
*)
2647 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2649 isl_basic_set_free(bset
);
2650 isl_basic_map_free(bmap
);
2654 struct isl_basic_map
*isl_basic_map_apply_domain(
2655 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2657 if (!bmap1
|| !bmap2
)
2660 isl_assert(bmap1
->ctx
,
2661 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2662 isl_assert(bmap1
->ctx
,
2663 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2666 bmap1
= isl_basic_map_reverse(bmap1
);
2667 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2668 return isl_basic_map_reverse(bmap1
);
2670 isl_basic_map_free(bmap1
);
2671 isl_basic_map_free(bmap2
);
2675 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2676 * A \cap B -> f(A) + f(B)
2678 struct isl_basic_map
*isl_basic_map_sum(
2679 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2681 unsigned n_in
, n_out
, nparam
, total
, pos
;
2682 struct isl_basic_map
*bmap
= NULL
;
2683 struct isl_dim_map
*dim_map1
, *dim_map2
;
2686 if (!bmap1
|| !bmap2
)
2689 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2692 nparam
= isl_basic_map_n_param(bmap1
);
2693 n_in
= isl_basic_map_n_in(bmap1
);
2694 n_out
= isl_basic_map_n_out(bmap1
);
2696 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2697 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2698 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2699 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2700 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2701 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2702 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2703 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2704 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2705 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2706 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2708 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2709 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2710 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2711 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2712 for (i
= 0; i
< n_out
; ++i
) {
2713 int j
= isl_basic_map_alloc_equality(bmap
);
2716 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2717 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2718 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2719 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2721 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2722 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2723 bmap
= add_divs(bmap
, 2 * n_out
);
2725 bmap
= isl_basic_map_simplify(bmap
);
2726 return isl_basic_map_finalize(bmap
);
2728 isl_basic_map_free(bmap
);
2729 isl_basic_map_free(bmap1
);
2730 isl_basic_map_free(bmap2
);
2734 /* Given two maps A -> f(A) and B -> g(B), construct a map
2735 * A \cap B -> f(A) + f(B)
2737 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2739 struct isl_map
*result
;
2745 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2747 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2748 map1
->n
* map2
->n
, 0);
2751 for (i
= 0; i
< map1
->n
; ++i
)
2752 for (j
= 0; j
< map2
->n
; ++j
) {
2753 struct isl_basic_map
*part
;
2754 part
= isl_basic_map_sum(
2755 isl_basic_map_copy(map1
->p
[i
]),
2756 isl_basic_map_copy(map2
->p
[j
]));
2757 if (isl_basic_map_is_empty(part
))
2758 isl_basic_map_free(part
);
2760 result
= isl_map_add_basic_map(result
, part
);
2773 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2774 __isl_take isl_set
*set2
)
2776 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2779 /* Given a basic map A -> f(A), construct A -> -f(A).
2781 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2786 bmap
= isl_basic_map_cow(bmap
);
2790 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2791 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2792 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2793 for (j
= 0; j
< n
; ++j
)
2794 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2795 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2796 for (j
= 0; j
< n
; ++j
)
2797 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2798 for (i
= 0; i
< bmap
->n_div
; ++i
)
2799 for (j
= 0; j
< n
; ++j
)
2800 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2801 return isl_basic_map_finalize(bmap
);
2804 /* Given a map A -> f(A), construct A -> -f(A).
2806 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2810 map
= isl_map_cow(map
);
2814 for (i
= 0; i
< map
->n
; ++i
) {
2815 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2826 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2828 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2831 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2832 * A -> floor(f(A)/d).
2834 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2837 unsigned n_in
, n_out
, nparam
, total
, pos
;
2838 struct isl_basic_map
*result
= NULL
;
2839 struct isl_dim_map
*dim_map
;
2845 nparam
= isl_basic_map_n_param(bmap
);
2846 n_in
= isl_basic_map_n_in(bmap
);
2847 n_out
= isl_basic_map_n_out(bmap
);
2849 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2850 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2851 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2852 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2853 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2854 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2856 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2857 bmap
->n_div
+ n_out
,
2858 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2859 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2860 result
= add_divs(result
, n_out
);
2861 for (i
= 0; i
< n_out
; ++i
) {
2863 j
= isl_basic_map_alloc_inequality(result
);
2866 isl_seq_clr(result
->ineq
[j
], 1+total
);
2867 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2868 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2869 j
= isl_basic_map_alloc_inequality(result
);
2872 isl_seq_clr(result
->ineq
[j
], 1+total
);
2873 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2874 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2875 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2878 result
= isl_basic_map_simplify(result
);
2879 return isl_basic_map_finalize(result
);
2881 isl_basic_map_free(result
);
2885 /* Given a map A -> f(A) and an integer d, construct a map
2886 * A -> floor(f(A)/d).
2888 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2892 map
= isl_map_cow(map
);
2896 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2897 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2898 for (i
= 0; i
< map
->n
; ++i
) {
2899 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2910 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2916 i
= isl_basic_map_alloc_equality(bmap
);
2919 nparam
= isl_basic_map_n_param(bmap
);
2920 n_in
= isl_basic_map_n_in(bmap
);
2921 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2922 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2923 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2924 return isl_basic_map_finalize(bmap
);
2926 isl_basic_map_free(bmap
);
2930 /* Add a constraints to "bmap" expressing i_pos < o_pos
2932 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2938 i
= isl_basic_map_alloc_inequality(bmap
);
2941 nparam
= isl_basic_map_n_param(bmap
);
2942 n_in
= isl_basic_map_n_in(bmap
);
2943 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2944 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2945 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2946 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2947 return isl_basic_map_finalize(bmap
);
2949 isl_basic_map_free(bmap
);
2953 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2955 static __isl_give isl_basic_map
*var_less_or_equal(
2956 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2962 i
= isl_basic_map_alloc_inequality(bmap
);
2965 nparam
= isl_basic_map_n_param(bmap
);
2966 n_in
= isl_basic_map_n_in(bmap
);
2967 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2968 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2969 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2970 return isl_basic_map_finalize(bmap
);
2972 isl_basic_map_free(bmap
);
2976 /* Add a constraints to "bmap" expressing i_pos > o_pos
2978 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2984 i
= isl_basic_map_alloc_inequality(bmap
);
2987 nparam
= isl_basic_map_n_param(bmap
);
2988 n_in
= isl_basic_map_n_in(bmap
);
2989 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2990 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2991 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2992 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2993 return isl_basic_map_finalize(bmap
);
2995 isl_basic_map_free(bmap
);
2999 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3001 static __isl_give isl_basic_map
*var_more_or_equal(
3002 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3008 i
= isl_basic_map_alloc_inequality(bmap
);
3011 nparam
= isl_basic_map_n_param(bmap
);
3012 n_in
= isl_basic_map_n_in(bmap
);
3013 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3014 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3015 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3016 return isl_basic_map_finalize(bmap
);
3018 isl_basic_map_free(bmap
);
3022 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3025 struct isl_basic_map
*bmap
;
3026 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3029 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3030 bmap
= var_equal(bmap
, i
);
3031 return isl_basic_map_finalize(bmap
);
3034 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3036 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3039 struct isl_basic_map
*bmap
;
3040 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3043 for (i
= 0; i
< pos
&& bmap
; ++i
)
3044 bmap
= var_equal(bmap
, i
);
3046 bmap
= var_less(bmap
, pos
);
3047 return isl_basic_map_finalize(bmap
);
3050 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3052 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3053 __isl_take isl_dim
*dim
, unsigned pos
)
3056 isl_basic_map
*bmap
;
3058 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3059 for (i
= 0; i
< pos
; ++i
)
3060 bmap
= var_equal(bmap
, i
);
3061 bmap
= var_less_or_equal(bmap
, pos
);
3062 return isl_basic_map_finalize(bmap
);
3065 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3067 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3070 struct isl_basic_map
*bmap
;
3071 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3074 for (i
= 0; i
< pos
&& bmap
; ++i
)
3075 bmap
= var_equal(bmap
, i
);
3077 bmap
= var_more(bmap
, pos
);
3078 return isl_basic_map_finalize(bmap
);
3081 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3083 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3084 __isl_take isl_dim
*dim
, unsigned pos
)
3087 isl_basic_map
*bmap
;
3089 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3090 for (i
= 0; i
< pos
; ++i
)
3091 bmap
= var_equal(bmap
, i
);
3092 bmap
= var_more_or_equal(bmap
, pos
);
3093 return isl_basic_map_finalize(bmap
);
3096 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3097 unsigned n
, int equal
)
3099 struct isl_map
*map
;
3102 if (n
== 0 && equal
)
3103 return isl_map_universe(dims
);
3105 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3107 for (i
= 0; i
+ 1 < n
; ++i
)
3108 map
= isl_map_add_basic_map(map
,
3109 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3112 map
= isl_map_add_basic_map(map
,
3113 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3115 map
= isl_map_add_basic_map(map
,
3116 isl_basic_map_less_at(dims
, n
- 1));
3123 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3127 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3130 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3132 return map_lex_lte_first(dim
, n
, 0);
3135 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3137 return map_lex_lte_first(dim
, n
, 1);
3140 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3142 return map_lex_lte(isl_dim_map(set_dim
), 0);
3145 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3147 return map_lex_lte(isl_dim_map(set_dim
), 1);
3150 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3151 unsigned n
, int equal
)
3153 struct isl_map
*map
;
3156 if (n
== 0 && equal
)
3157 return isl_map_universe(dims
);
3159 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3161 for (i
= 0; i
+ 1 < n
; ++i
)
3162 map
= isl_map_add_basic_map(map
,
3163 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3166 map
= isl_map_add_basic_map(map
,
3167 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3169 map
= isl_map_add_basic_map(map
,
3170 isl_basic_map_more_at(dims
, n
- 1));
3177 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3181 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3184 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3186 return map_lex_gte_first(dim
, n
, 0);
3189 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3191 return map_lex_gte_first(dim
, n
, 1);
3194 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3196 return map_lex_gte(isl_dim_map(set_dim
), 0);
3199 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3201 return map_lex_gte(isl_dim_map(set_dim
), 1);
3204 struct isl_basic_map
*isl_basic_map_from_basic_set(
3205 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3207 struct isl_basic_map
*bmap
;
3209 bset
= isl_basic_set_cow(bset
);
3213 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3214 isl_dim_free(bset
->dim
);
3215 bmap
= (struct isl_basic_map
*) bset
;
3217 return isl_basic_map_finalize(bmap
);
3219 isl_basic_set_free(bset
);
3224 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3228 if (bmap
->dim
->n_in
== 0)
3229 return (struct isl_basic_set
*)bmap
;
3230 bmap
= isl_basic_map_cow(bmap
);
3233 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3236 bmap
= isl_basic_map_finalize(bmap
);
3237 return (struct isl_basic_set
*)bmap
;
3239 isl_basic_map_free(bmap
);
3243 /* For a div d = floor(f/m), add the constraints
3246 * -(f-(n-1)) + m d >= 0
3248 * Note that the second constraint is the negation of
3252 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3253 unsigned pos
, isl_int
*div
)
3256 unsigned total
= isl_basic_map_total_dim(bmap
);
3258 i
= isl_basic_map_alloc_inequality(bmap
);
3261 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3262 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3264 j
= isl_basic_map_alloc_inequality(bmap
);
3267 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3268 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3269 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3273 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3274 unsigned pos
, isl_int
*div
)
3276 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3280 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3282 unsigned total
= isl_basic_map_total_dim(bmap
);
3283 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3285 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3289 struct isl_basic_set
*isl_basic_map_underlying_set(
3290 struct isl_basic_map
*bmap
)
3294 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3295 bmap
->n_div
== 0 && !isl_dim_get_tuple_name(bmap
->dim
, isl_dim_out
))
3296 return (struct isl_basic_set
*)bmap
;
3297 bmap
= isl_basic_map_cow(bmap
);
3300 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3303 bmap
->extra
-= bmap
->n_div
;
3305 bmap
= isl_basic_map_finalize(bmap
);
3306 return (struct isl_basic_set
*)bmap
;
3311 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3312 __isl_take isl_basic_set
*bset
)
3314 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3317 struct isl_basic_map
*isl_basic_map_overlying_set(
3318 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3320 struct isl_basic_map
*bmap
;
3321 struct isl_ctx
*ctx
;
3328 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3329 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3330 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3332 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3333 isl_basic_map_free(like
);
3334 return (struct isl_basic_map
*)bset
;
3336 bset
= isl_basic_set_cow(bset
);
3339 total
= bset
->dim
->n_out
+ bset
->extra
;
3340 bmap
= (struct isl_basic_map
*)bset
;
3341 isl_dim_free(bmap
->dim
);
3342 bmap
->dim
= isl_dim_copy(like
->dim
);
3345 bmap
->n_div
= like
->n_div
;
3346 bmap
->extra
+= like
->n_div
;
3349 ltotal
= total
- bmap
->extra
+ like
->extra
;
3352 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3353 bmap
->extra
* (1 + 1 + total
));
3354 if (isl_blk_is_error(bmap
->block2
))
3356 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3360 for (i
= 0; i
< bmap
->extra
; ++i
)
3361 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3362 for (i
= 0; i
< like
->n_div
; ++i
) {
3363 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3364 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3366 bmap
= isl_basic_map_extend_constraints(bmap
,
3367 0, 2 * like
->n_div
);
3368 for (i
= 0; i
< like
->n_div
; ++i
) {
3369 if (isl_int_is_zero(bmap
->div
[i
][0]))
3371 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3375 isl_basic_map_free(like
);
3376 bmap
= isl_basic_map_simplify(bmap
);
3377 bmap
= isl_basic_map_finalize(bmap
);
3380 isl_basic_map_free(like
);
3381 isl_basic_set_free(bset
);
3385 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3386 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3388 return (struct isl_basic_set
*)
3389 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3392 struct isl_set
*isl_set_from_underlying_set(
3393 struct isl_set
*set
, struct isl_basic_set
*like
)
3399 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3401 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3402 isl_basic_set_free(like
);
3405 set
= isl_set_cow(set
);
3408 for (i
= 0; i
< set
->n
; ++i
) {
3409 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3410 isl_basic_set_copy(like
));
3414 isl_dim_free(set
->dim
);
3415 set
->dim
= isl_dim_copy(like
->dim
);
3418 isl_basic_set_free(like
);
3421 isl_basic_set_free(like
);
3426 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3430 map
= isl_map_cow(map
);
3433 map
->dim
= isl_dim_cow(map
->dim
);
3437 for (i
= 1; i
< map
->n
; ++i
)
3438 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3440 for (i
= 0; i
< map
->n
; ++i
) {
3441 map
->p
[i
] = (struct isl_basic_map
*)
3442 isl_basic_map_underlying_set(map
->p
[i
]);
3447 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3449 isl_dim_free(map
->dim
);
3450 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3454 return (struct isl_set
*)map
;
3460 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3462 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3465 static __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3466 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3468 bmap
= isl_basic_map_cow(bmap
);
3472 isl_dim_free(bmap
->dim
);
3475 bmap
= isl_basic_map_finalize(bmap
);
3479 isl_basic_map_free(bmap
);
3484 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3485 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3487 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3491 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3492 __isl_take isl_dim
*dim
)
3496 map
= isl_map_cow(map
);
3500 for (i
= 0; i
< map
->n
; ++i
) {
3501 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3506 isl_dim_free(map
->dim
);
3516 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3517 __isl_take isl_dim
*dim
)
3519 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3522 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3525 struct isl_basic_set
*domain
;
3531 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3533 n_in
= isl_basic_map_n_in(bmap
);
3534 n_out
= isl_basic_map_n_out(bmap
);
3535 domain
= isl_basic_set_from_basic_map(bmap
);
3536 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3538 domain
= isl_basic_set_reset_dim(domain
, dim
);
3543 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3545 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3548 struct isl_set
*isl_map_range(struct isl_map
*map
)
3551 struct isl_set
*set
;
3555 if (isl_map_dim(map
, isl_dim_in
) == 0)
3556 return (isl_set
*)map
;
3558 map
= isl_map_cow(map
);
3562 set
= (struct isl_set
*) map
;
3563 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3566 for (i
= 0; i
< map
->n
; ++i
) {
3567 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3571 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3572 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3579 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3582 struct isl_map
*map
= NULL
;
3584 set
= isl_set_cow(set
);
3587 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3588 map
= (struct isl_map
*)set
;
3589 for (i
= 0; i
< set
->n
; ++i
) {
3590 map
->p
[i
] = isl_basic_map_from_basic_set(
3591 set
->p
[i
], isl_dim_copy(dim
));
3595 isl_dim_free(map
->dim
);
3604 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3606 return (struct isl_map
*)set
;
3609 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3611 return isl_map_reverse(isl_map_from_range(set
));
3614 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3615 __isl_take isl_set
*range
)
3617 return isl_map_apply_range(isl_map_from_domain(domain
),
3618 isl_map_from_range(range
));
3621 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3624 struct isl_set
*set
= NULL
;
3628 map
= isl_map_cow(map
);
3631 map
->dim
= isl_dim_as_set_dim(map
->dim
);
3634 set
= (struct isl_set
*)map
;
3635 for (i
= 0; i
< map
->n
; ++i
) {
3636 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3646 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3648 struct isl_map
*map
;
3652 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3653 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3654 sizeof(struct isl_map
) +
3655 (n
- 1) * sizeof(struct isl_basic_map
*));
3659 map
->ctx
= dim
->ctx
;
3660 isl_ctx_ref(map
->ctx
);
3672 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
3673 unsigned nparam
, unsigned in
, unsigned out
, int n
,
3676 struct isl_map
*map
;
3677 struct isl_dim
*dims
;
3679 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
3683 map
= isl_map_alloc_dim(dims
, n
, flags
);
3687 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
3689 struct isl_basic_map
*bmap
;
3690 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
3691 bmap
= isl_basic_map_set_to_empty(bmap
);
3695 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
3697 struct isl_basic_set
*bset
;
3698 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
3699 bset
= isl_basic_set_set_to_empty(bset
);
3703 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
3705 struct isl_basic_map
*bmap
;
3708 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3709 bmap
= isl_basic_map_set_to_empty(bmap
);
3713 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
3715 struct isl_basic_map
*bmap
;
3718 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3719 bmap
= isl_basic_map_set_to_empty(bmap
);
3723 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
3725 struct isl_basic_set
*bset
;
3728 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3729 bset
= isl_basic_set_set_to_empty(bset
);
3733 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
3735 struct isl_basic_map
*bmap
;
3736 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
3740 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
3742 struct isl_basic_set
*bset
;
3743 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
3747 __isl_give isl_basic_map
*isl_basic_map_universe_like(
3748 __isl_keep isl_basic_map
*model
)
3752 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3755 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
3759 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3762 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
3763 __isl_keep isl_set
*model
)
3767 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3770 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
3772 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3775 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
3779 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3782 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
3786 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3789 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
3791 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3794 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
3798 return isl_set_empty(isl_dim_copy(model
->dim
));
3801 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
3803 struct isl_map
*map
;
3806 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3807 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
3811 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
3813 struct isl_set
*set
;
3816 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3817 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
3821 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
3825 return isl_set_universe(isl_dim_copy(model
->dim
));
3828 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3831 struct isl_map
*dup
;
3835 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3836 for (i
= 0; i
< map
->n
; ++i
)
3837 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
3841 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
3842 __isl_take isl_basic_map
*bmap
)
3846 if (isl_basic_map_fast_is_empty(bmap
)) {
3847 isl_basic_map_free(bmap
);
3850 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3851 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3852 map
->p
[map
->n
] = bmap
;
3854 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3860 isl_basic_map_free(bmap
);
3864 void isl_map_free(struct isl_map
*map
)
3874 isl_ctx_deref(map
->ctx
);
3875 for (i
= 0; i
< map
->n
; ++i
)
3876 isl_basic_map_free(map
->p
[i
]);
3877 isl_dim_free(map
->dim
);
3881 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3882 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3886 base
= isl_map_cow(base
);
3890 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3893 for (i
= 0; i
< base
->n
; ++i
) {
3894 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3895 isl_dim_copy(base
->dim
), 0, 0, 0);
3905 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3906 unsigned nparam
, unsigned dim
)
3908 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3912 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
3913 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
3917 bmap
= isl_basic_map_cow(bmap
);
3918 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3919 j
= isl_basic_map_alloc_equality(bmap
);
3922 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3923 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3924 isl_int_set_si(bmap
->eq
[j
][0], value
);
3925 bmap
= isl_basic_map_simplify(bmap
);
3926 return isl_basic_map_finalize(bmap
);
3928 isl_basic_map_free(bmap
);
3932 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
3933 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
3937 bmap
= isl_basic_map_cow(bmap
);
3938 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3939 j
= isl_basic_map_alloc_equality(bmap
);
3942 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3943 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3944 isl_int_set(bmap
->eq
[j
][0], value
);
3945 bmap
= isl_basic_map_simplify(bmap
);
3946 return isl_basic_map_finalize(bmap
);
3948 isl_basic_map_free(bmap
);
3952 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
3953 enum isl_dim_type type
, unsigned pos
, int value
)
3957 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3958 return isl_basic_map_fix_pos_si(bmap
,
3959 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3961 isl_basic_map_free(bmap
);
3965 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
3966 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3970 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3971 return isl_basic_map_fix_pos(bmap
,
3972 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3974 isl_basic_map_free(bmap
);
3978 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
3979 enum isl_dim_type type
, unsigned pos
, int value
)
3981 return (struct isl_basic_set
*)
3982 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3986 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
3987 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3989 return (struct isl_basic_set
*)
3990 isl_basic_map_fix((struct isl_basic_map
*)bset
,
3994 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
3995 unsigned input
, int value
)
3997 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4000 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4001 unsigned dim
, int value
)
4003 return (struct isl_basic_set
*)
4004 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4005 isl_dim_set
, dim
, value
);
4008 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4009 enum isl_dim_type type
, unsigned pos
, int value
)
4013 map
= isl_map_cow(map
);
4017 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4018 for (i
= 0; i
< map
->n
; ++i
) {
4019 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4023 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4030 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4031 enum isl_dim_type type
, unsigned pos
, int value
)
4033 return (struct isl_set
*)
4034 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4037 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4038 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4042 map
= isl_map_cow(map
);
4046 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4047 for (i
= 0; i
< map
->n
; ++i
) {
4048 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4052 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4059 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4060 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4062 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4065 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4066 unsigned input
, int value
)
4068 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4071 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4073 return (struct isl_set
*)
4074 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4077 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4078 __isl_take isl_basic_map
*bmap
,
4079 enum isl_dim_type type
, unsigned pos
, int value
)
4085 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4086 pos
+= isl_basic_map_offset(bmap
, type
);
4087 bmap
= isl_basic_map_cow(bmap
);
4088 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4089 j
= isl_basic_map_alloc_inequality(bmap
);
4092 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4093 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4094 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4095 bmap
= isl_basic_map_simplify(bmap
);
4096 return isl_basic_map_finalize(bmap
);
4098 isl_basic_map_free(bmap
);
4102 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4103 unsigned dim
, isl_int value
)
4107 bset
= isl_basic_set_cow(bset
);
4108 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4109 j
= isl_basic_set_alloc_inequality(bset
);
4112 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4113 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4114 isl_int_neg(bset
->ineq
[j
][0], value
);
4115 bset
= isl_basic_set_simplify(bset
);
4116 return isl_basic_set_finalize(bset
);
4118 isl_basic_set_free(bset
);
4122 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4123 enum isl_dim_type type
, unsigned pos
, int value
)
4127 map
= isl_map_cow(map
);
4131 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4132 for (i
= 0; i
< map
->n
; ++i
) {
4133 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4138 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4145 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4146 enum isl_dim_type type
, unsigned pos
, int value
)
4148 return (struct isl_set
*)
4149 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4152 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4157 set
= isl_set_cow(set
);
4161 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4162 for (i
= 0; i
< set
->n
; ++i
) {
4163 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4173 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4177 map
= isl_map_cow(map
);
4181 map
->dim
= isl_dim_reverse(map
->dim
);
4184 for (i
= 0; i
< map
->n
; ++i
) {
4185 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4189 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4196 static struct isl_map
*isl_basic_map_partial_lexopt(
4197 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4198 struct isl_set
**empty
, int max
)
4202 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4203 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4205 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4207 isl_basic_map_free(bmap
);
4208 isl_basic_set_free(dom
);
4214 struct isl_map
*isl_basic_map_partial_lexmax(
4215 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4216 struct isl_set
**empty
)
4218 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4221 struct isl_map
*isl_basic_map_partial_lexmin(
4222 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4223 struct isl_set
**empty
)
4225 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4228 struct isl_set
*isl_basic_set_partial_lexmin(
4229 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4230 struct isl_set
**empty
)
4232 return (struct isl_set
*)
4233 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4237 struct isl_set
*isl_basic_set_partial_lexmax(
4238 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4239 struct isl_set
**empty
)
4241 return (struct isl_set
*)
4242 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4246 /* Given a basic map "bmap", compute the lexicograhically minimal
4247 * (or maximal) image element for each domain element in dom.
4248 * Set *empty to those elements in dom that do not have an image element.
4250 * We first make sure the basic sets in dom are disjoint and then
4251 * simply collect the results over each of the basic sets separately.
4252 * We could probably improve the efficiency a bit by moving the union
4253 * domain down into the parametric integer programming.
4255 static __isl_give isl_map
*basic_map_partial_lexopt(
4256 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4257 __isl_give isl_set
**empty
, int max
)
4260 struct isl_map
*res
;
4262 dom
= isl_set_make_disjoint(dom
);
4266 if (isl_set_fast_is_empty(dom
)) {
4267 res
= isl_map_empty_like_basic_map(bmap
);
4268 *empty
= isl_set_empty_like(dom
);
4270 isl_basic_map_free(bmap
);
4274 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4275 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4277 for (i
= 1; i
< dom
->n
; ++i
) {
4278 struct isl_map
*res_i
;
4279 struct isl_set
*empty_i
;
4281 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4282 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4284 res
= isl_map_union_disjoint(res
, res_i
);
4285 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4289 isl_basic_map_free(bmap
);
4294 isl_basic_map_free(bmap
);
4298 /* Given a map "map", compute the lexicograhically minimal
4299 * (or maximal) image element for each domain element in dom.
4300 * Set *empty to those elements in dom that do not have an image element.
4302 * We first compute the lexicographically minimal or maximal element
4303 * in the first basic map. This results in a partial solution "res"
4304 * and a subset "todo" of dom that still need to be handled.
4305 * We then consider each of the remaining maps in "map" and successively
4306 * improve both "res" and "todo".
4308 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4309 * Assume we are computing the lexicographical maximum.
4310 * We first intersect basic map i with a relation that maps elements
4311 * to elements that are lexicographically larger than the image elements
4312 * in res^k and the compute the maximum image element of this intersection.
4313 * The result ("better") corresponds to those image elements in basic map i
4314 * that are better than what we had before. The remainder ("keep") are the
4315 * domain elements for which the image element in res_k was better.
4316 * We also compute the lexicographical maximum of basic map i in todo^k.
4317 * res^i is the result of the operation + better + those elements in
4318 * res^k that we should keep
4319 * todo^i is the remainder of the maximum operation on todo^k.
4321 static __isl_give isl_map
*isl_map_partial_lexopt(
4322 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4323 __isl_give isl_set
**empty
, int max
)
4326 struct isl_map
*res
;
4327 struct isl_set
*todo
;
4332 if (isl_map_fast_is_empty(map
)) {
4340 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4341 isl_set_copy(dom
), &todo
, max
);
4343 for (i
= 1; i
< map
->n
; ++i
) {
4345 struct isl_map
*better
;
4346 struct isl_set
*keep
;
4347 struct isl_map
*res_i
;
4348 struct isl_set
*todo_i
;
4349 struct isl_dim
*dim
= isl_map_get_dim(res
);
4351 dim
= isl_dim_range(dim
);
4353 lt
= isl_map_lex_lt(dim
);
4355 lt
= isl_map_lex_gt(dim
);
4356 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4357 lt
= isl_map_intersect(lt
,
4358 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4359 better
= isl_map_partial_lexopt(lt
,
4360 isl_map_domain(isl_map_copy(res
)),
4363 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4364 todo
, &todo_i
, max
);
4366 res
= isl_map_intersect_domain(res
, keep
);
4367 res
= isl_map_union_disjoint(res
, res_i
);
4368 res
= isl_map_union_disjoint(res
, better
);
4389 __isl_give isl_map
*isl_map_partial_lexmax(
4390 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4391 __isl_give isl_set
**empty
)
4393 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4396 __isl_give isl_map
*isl_map_partial_lexmin(
4397 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4398 __isl_give isl_set
**empty
)
4400 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4403 __isl_give isl_set
*isl_set_partial_lexmin(
4404 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4405 __isl_give isl_set
**empty
)
4407 return (struct isl_set
*)
4408 isl_map_partial_lexmin((struct isl_map
*)set
,
4412 __isl_give isl_set
*isl_set_partial_lexmax(
4413 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4414 __isl_give isl_set
**empty
)
4416 return (struct isl_set
*)
4417 isl_map_partial_lexmax((struct isl_map
*)set
,
4421 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4423 struct isl_basic_set
*dom
= NULL
;
4424 struct isl_dim
*dom_dim
;
4428 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4429 dom
= isl_basic_set_universe(dom_dim
);
4430 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4432 isl_basic_map_free(bmap
);
4436 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4438 return isl_basic_map_lexopt(bmap
, 0);
4441 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4443 return isl_basic_map_lexopt(bmap
, 1);
4446 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4448 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4451 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4453 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4456 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4458 struct isl_set
*dom
= NULL
;
4459 struct isl_dim
*dom_dim
;
4463 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4464 dom
= isl_set_universe(dom_dim
);
4465 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4471 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4473 return isl_map_lexopt(map
, 0);
4476 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4478 return isl_map_lexopt(map
, 1);
4481 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4483 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4486 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4488 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4491 /* Apply a preimage specified by "mat" on the parameters of "bset".
4492 * bset is assumed to have only parameters and divs.
4494 static struct isl_basic_set
*basic_set_parameter_preimage(
4495 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4502 bset
->dim
= isl_dim_cow(bset
->dim
);
4506 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4508 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4510 bset
->dim
->nparam
= 0;
4511 bset
->dim
->n_out
= nparam
;
4512 bset
= isl_basic_set_preimage(bset
, mat
);
4514 bset
->dim
->nparam
= bset
->dim
->n_out
;
4515 bset
->dim
->n_out
= 0;
4520 isl_basic_set_free(bset
);
4524 /* Apply a preimage specified by "mat" on the parameters of "set".
4525 * set is assumed to have only parameters and divs.
4527 static struct isl_set
*set_parameter_preimage(
4528 struct isl_set
*set
, struct isl_mat
*mat
)
4530 struct isl_dim
*dim
= NULL
;
4536 dim
= isl_dim_copy(set
->dim
);
4537 dim
= isl_dim_cow(dim
);
4541 nparam
= isl_set_dim(set
, isl_dim_param
);
4543 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4546 dim
->n_out
= nparam
;
4547 isl_set_reset_dim(set
, dim
);
4548 set
= isl_set_preimage(set
, mat
);
4551 dim
= isl_dim_copy(set
->dim
);
4552 dim
= isl_dim_cow(dim
);
4555 dim
->nparam
= dim
->n_out
;
4557 isl_set_reset_dim(set
, dim
);
4567 /* Intersect the basic set "bset" with the affine space specified by the
4568 * equalities in "eq".
4570 static struct isl_basic_set
*basic_set_append_equalities(
4571 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4579 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4584 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4585 for (i
= 0; i
< eq
->n_row
; ++i
) {
4586 k
= isl_basic_set_alloc_equality(bset
);
4589 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4590 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4594 bset
= isl_basic_set_gauss(bset
, NULL
);
4595 bset
= isl_basic_set_finalize(bset
);
4600 isl_basic_set_free(bset
);
4604 /* Intersect the set "set" with the affine space specified by the
4605 * equalities in "eq".
4607 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4615 for (i
= 0; i
< set
->n
; ++i
) {
4616 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4629 /* Project the given basic set onto its parameter domain, possibly introducing
4630 * new, explicit, existential variables in the constraints.
4631 * The input has parameters and (possibly implicit) existential variables.
4632 * The output has the same parameters, but only
4633 * explicit existentially quantified variables.
4635 * The actual projection is performed by pip, but pip doesn't seem
4636 * to like equalities very much, so we first remove the equalities
4637 * among the parameters by performing a variable compression on
4638 * the parameters. Afterward, an inverse transformation is performed
4639 * and the equalities among the parameters are inserted back in.
4641 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4645 struct isl_mat
*T
, *T2
;
4646 struct isl_set
*set
;
4647 unsigned nparam
, n_div
;
4649 bset
= isl_basic_set_cow(bset
);
4653 if (bset
->n_eq
== 0)
4654 return isl_basic_set_lexmin(bset
);
4656 isl_basic_set_gauss(bset
, NULL
);
4658 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4659 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
4661 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
4662 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
4665 if (i
== bset
->n_eq
)
4666 return isl_basic_set_lexmin(bset
);
4668 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
4670 eq
= isl_mat_cow(eq
);
4671 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
4672 if (T
&& T
->n_col
== 0) {
4676 bset
= isl_basic_set_set_to_empty(bset
);
4677 return isl_set_from_basic_set(bset
);
4679 bset
= basic_set_parameter_preimage(bset
, T
);
4681 set
= isl_basic_set_lexmin(bset
);
4682 set
= set_parameter_preimage(set
, T2
);
4683 set
= set_append_equalities(set
, eq
);
4687 /* Compute an explicit representation for all the existentially
4688 * quantified variables.
4689 * The input and output dimensions are first turned into parameters.
4690 * compute_divs then returns a map with the same parameters and
4691 * no input or output dimensions and the dimension specification
4692 * is reset to that of the input.
4694 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
4696 struct isl_basic_set
*bset
;
4697 struct isl_set
*set
;
4698 struct isl_map
*map
;
4699 struct isl_dim
*dim
, *orig_dim
= NULL
;
4704 bmap
= isl_basic_map_cow(bmap
);
4708 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4709 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4710 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4711 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
4715 orig_dim
= bmap
->dim
;
4717 bset
= (struct isl_basic_set
*)bmap
;
4719 set
= parameter_compute_divs(bset
);
4720 map
= (struct isl_map
*)set
;
4721 map
= isl_map_reset_dim(map
, orig_dim
);
4725 isl_basic_map_free(bmap
);
4729 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
4737 off
= isl_dim_total(bmap
->dim
);
4738 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4739 if (isl_int_is_zero(bmap
->div
[i
][0]))
4741 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
4747 static int map_divs_known(__isl_keep isl_map
*map
)
4754 for (i
= 0; i
< map
->n
; ++i
) {
4755 int known
= basic_map_divs_known(map
->p
[i
]);
4763 /* If bmap contains any unknown divs, then compute explicit
4764 * expressions for them. However, this computation may be
4765 * quite expensive, so first try to remove divs that aren't
4768 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
4772 struct isl_map
*map
;
4774 known
= basic_map_divs_known(bmap
);
4778 return isl_map_from_basic_map(bmap
);
4780 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4782 known
= basic_map_divs_known(bmap
);
4786 return isl_map_from_basic_map(bmap
);
4788 map
= compute_divs(bmap
);
4791 isl_basic_map_free(bmap
);
4795 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
4799 struct isl_map
*res
;
4806 known
= map_divs_known(map
);
4814 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
4815 for (i
= 1 ; i
< map
->n
; ++i
) {
4817 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
4818 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4819 res
= isl_map_union_disjoint(res
, r2
);
4821 res
= isl_map_union(res
, r2
);
4828 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
4830 return (struct isl_set
*)
4831 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
4834 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
4836 return (struct isl_set
*)
4837 isl_map_compute_divs((struct isl_map
*)set
);
4840 struct isl_set
*isl_map_domain(struct isl_map
*map
)
4843 struct isl_set
*set
;
4848 map
= isl_map_cow(map
);
4852 set
= (struct isl_set
*)map
;
4853 set
->dim
= isl_dim_domain(set
->dim
);
4856 for (i
= 0; i
< map
->n
; ++i
) {
4857 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
4861 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4862 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4869 struct isl_map
*isl_map_union_disjoint(
4870 struct isl_map
*map1
, struct isl_map
*map2
)
4874 struct isl_map
*map
= NULL
;
4888 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4890 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
4891 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
4892 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4894 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
4895 map1
->n
+ map2
->n
, flags
);
4898 for (i
= 0; i
< map1
->n
; ++i
) {
4899 map
= isl_map_add_basic_map(map
,
4900 isl_basic_map_copy(map1
->p
[i
]));
4904 for (i
= 0; i
< map2
->n
; ++i
) {
4905 map
= isl_map_add_basic_map(map
,
4906 isl_basic_map_copy(map2
->p
[i
]));
4920 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
4922 map1
= isl_map_union_disjoint(map1
, map2
);
4926 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
4930 struct isl_set
*isl_set_union_disjoint(
4931 struct isl_set
*set1
, struct isl_set
*set2
)
4933 return (struct isl_set
*)
4934 isl_map_union_disjoint(
4935 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4938 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
4940 return (struct isl_set
*)
4941 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
4944 struct isl_map
*isl_map_intersect_range(
4945 struct isl_map
*map
, struct isl_set
*set
)
4948 struct isl_map
*result
;
4954 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
4955 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
4956 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4958 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
4959 map
->n
* set
->n
, flags
);
4962 for (i
= 0; i
< map
->n
; ++i
)
4963 for (j
= 0; j
< set
->n
; ++j
) {
4964 result
= isl_map_add_basic_map(result
,
4965 isl_basic_map_intersect_range(
4966 isl_basic_map_copy(map
->p
[i
]),
4967 isl_basic_set_copy(set
->p
[j
])));
4980 struct isl_map
*isl_map_intersect_domain(
4981 struct isl_map
*map
, struct isl_set
*set
)
4983 return isl_map_reverse(
4984 isl_map_intersect_range(isl_map_reverse(map
), set
));
4987 struct isl_map
*isl_map_apply_domain(
4988 struct isl_map
*map1
, struct isl_map
*map2
)
4992 map1
= isl_map_reverse(map1
);
4993 map1
= isl_map_apply_range(map1
, map2
);
4994 return isl_map_reverse(map1
);
5001 struct isl_map
*isl_map_apply_range(
5002 struct isl_map
*map1
, struct isl_map
*map2
)
5004 struct isl_dim
*dim_result
;
5005 struct isl_map
*result
;
5011 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5012 isl_dim_copy(map2
->dim
));
5014 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5017 for (i
= 0; i
< map1
->n
; ++i
)
5018 for (j
= 0; j
< map2
->n
; ++j
) {
5019 result
= isl_map_add_basic_map(result
,
5020 isl_basic_map_apply_range(
5021 isl_basic_map_copy(map1
->p
[i
]),
5022 isl_basic_map_copy(map2
->p
[j
])));
5028 if (result
&& result
->n
<= 1)
5029 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5038 * returns range - domain
5040 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5042 isl_dim
*dims
, *target_dim
;
5043 struct isl_basic_set
*bset
;
5050 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5051 bmap
->dim
, isl_dim_out
),
5053 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5054 dim
= isl_basic_map_n_in(bmap
);
5055 nparam
= isl_basic_map_n_param(bmap
);
5056 bset
= isl_basic_set_from_basic_map(bmap
);
5057 bset
= isl_basic_set_cow(bset
);
5058 dims
= isl_basic_set_get_dim(bset
);
5059 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5060 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5061 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5062 for (i
= 0; i
< dim
; ++i
) {
5063 int j
= isl_basic_map_alloc_equality(
5064 (struct isl_basic_map
*)bset
);
5067 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5068 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5069 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5070 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5072 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5073 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5076 isl_basic_map_free(bmap
);
5081 * returns range - domain
5083 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5087 struct isl_set
*result
;
5092 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5093 map
->dim
, isl_dim_out
),
5095 dim
= isl_map_get_dim(map
);
5096 dim
= isl_dim_domain(dim
);
5097 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5100 for (i
= 0; i
< map
->n
; ++i
)
5101 result
= isl_set_add_basic_set(result
,
5102 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5110 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5112 struct isl_basic_map
*bmap
;
5120 nparam
= dims
->nparam
;
5122 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5126 for (i
= 0; i
< dim
; ++i
) {
5127 int j
= isl_basic_map_alloc_equality(bmap
);
5130 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5131 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5132 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5134 return isl_basic_map_finalize(bmap
);
5136 isl_basic_map_free(bmap
);
5140 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5142 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5145 return basic_map_identity(dim
);
5148 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5150 if (!model
|| !model
->dim
)
5152 isl_assert(model
->ctx
,
5153 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5154 return basic_map_identity(isl_dim_copy(model
->dim
));
5157 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5159 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5160 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5163 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5165 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5168 return map_identity(dim
);
5171 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5173 if (!model
|| !model
->dim
)
5175 isl_assert(model
->ctx
,
5176 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5177 return map_identity(isl_dim_copy(model
->dim
));
5180 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5182 if (!model
|| !model
->dim
)
5184 isl_assert(model
->ctx
,
5185 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5186 return map_identity(isl_dim_copy(model
->dim
));
5189 /* Construct a basic set with all set dimensions having only non-negative
5192 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5197 struct isl_basic_set
*bset
;
5201 nparam
= dims
->nparam
;
5203 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5206 for (i
= 0; i
< dim
; ++i
) {
5207 int k
= isl_basic_set_alloc_inequality(bset
);
5210 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5211 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5215 isl_basic_set_free(bset
);
5219 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5220 enum isl_dim_type type
, unsigned first
, unsigned n
)
5223 isl_basic_set
*nonneg
= NULL
;
5224 isl_basic_set
*neg
= NULL
;
5231 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5233 for (i
= 0; i
< n
; ++i
) {
5237 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5238 k
= isl_basic_set_alloc_inequality(nonneg
);
5241 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5242 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5244 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5245 k
= isl_basic_set_alloc_inequality(neg
);
5248 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5249 isl_int_set_si(neg
->ineq
[k
][0], -1);
5250 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5252 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5257 isl_basic_set_free(nonneg
);
5258 isl_basic_set_free(neg
);
5263 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5265 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5268 int isl_basic_map_is_subset(
5269 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5272 struct isl_map
*map1
;
5273 struct isl_map
*map2
;
5275 if (!bmap1
|| !bmap2
)
5278 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5279 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5281 is_subset
= isl_map_is_subset(map1
, map2
);
5289 int isl_basic_map_is_equal(
5290 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5294 if (!bmap1
|| !bmap2
)
5296 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5299 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5303 int isl_basic_set_is_equal(
5304 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5306 return isl_basic_map_is_equal(
5307 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5310 int isl_map_is_empty(struct isl_map
*map
)
5317 for (i
= 0; i
< map
->n
; ++i
) {
5318 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5327 int isl_map_fast_is_empty(struct isl_map
*map
)
5329 return map
? map
->n
== 0 : -1;
5332 int isl_set_fast_is_empty(struct isl_set
*set
)
5334 return set
? set
->n
== 0 : -1;
5337 int isl_set_is_empty(struct isl_set
*set
)
5339 return isl_map_is_empty((struct isl_map
*)set
);
5342 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5347 return isl_dim_equal(map1
->dim
, map2
->dim
);
5350 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5355 return isl_dim_equal(set1
->dim
, set2
->dim
);
5358 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5364 is_subset
= isl_map_is_subset(map1
, map2
);
5367 is_subset
= isl_map_is_subset(map2
, map1
);
5371 int isl_basic_map_is_strict_subset(
5372 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5376 if (!bmap1
|| !bmap2
)
5378 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5381 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5382 if (is_subset
== -1)
5387 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5393 is_subset
= isl_map_is_subset(map1
, map2
);
5396 is_subset
= isl_map_is_subset(map2
, map1
);
5397 if (is_subset
== -1)
5402 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5404 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5407 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5411 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5414 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5418 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5421 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5428 for (i
= 0; i
< map
->n
; ++i
) {
5429 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5437 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5439 return isl_map_fast_is_universe((isl_map
*) set
);
5442 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5444 struct isl_basic_set
*bset
= NULL
;
5445 struct isl_vec
*sample
= NULL
;
5452 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5455 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5456 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5457 copy
= isl_basic_map_remove_redundancies(copy
);
5458 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5459 isl_basic_map_free(copy
);
5463 total
= 1 + isl_basic_map_total_dim(bmap
);
5464 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5465 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5471 isl_vec_free(bmap
->sample
);
5472 bmap
->sample
= NULL
;
5473 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5476 sample
= isl_basic_set_sample_vec(bset
);
5479 empty
= sample
->size
== 0;
5480 isl_vec_free(bmap
->sample
);
5481 bmap
->sample
= sample
;
5483 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5488 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5492 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5495 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5499 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5502 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5504 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5507 struct isl_map
*isl_basic_map_union(
5508 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5510 struct isl_map
*map
;
5511 if (!bmap1
|| !bmap2
)
5514 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5516 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5519 map
= isl_map_add_basic_map(map
, bmap1
);
5520 map
= isl_map_add_basic_map(map
, bmap2
);
5523 isl_basic_map_free(bmap1
);
5524 isl_basic_map_free(bmap2
);
5528 struct isl_set
*isl_basic_set_union(
5529 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5531 return (struct isl_set
*)isl_basic_map_union(
5532 (struct isl_basic_map
*)bset1
,
5533 (struct isl_basic_map
*)bset2
);
5536 /* Order divs such that any div only depends on previous divs */
5537 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5545 off
= isl_dim_total(bmap
->dim
);
5547 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5549 if (isl_int_is_zero(bmap
->div
[i
][0]))
5551 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5555 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5561 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5563 return (struct isl_basic_set
*)
5564 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5567 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5574 for (i
= 0; i
< map
->n
; ++i
) {
5575 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5586 /* Look for a div in dst that corresponds to the div "div" in src.
5587 * The divs before "div" in src and dst are assumed to be the same.
5589 * Returns -1 if no corresponding div was found and the position
5590 * of the corresponding div in dst otherwise.
5592 static int find_div(struct isl_basic_map
*dst
,
5593 struct isl_basic_map
*src
, unsigned div
)
5597 unsigned total
= isl_dim_total(src
->dim
);
5599 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5600 for (i
= div
; i
< dst
->n_div
; ++i
)
5601 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5602 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5603 dst
->n_div
- div
) == -1)
5608 struct isl_basic_map
*isl_basic_map_align_divs(
5609 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5612 unsigned total
= isl_dim_total(src
->dim
);
5617 if (src
->n_div
== 0)
5620 for (i
= 0; i
< src
->n_div
; ++i
)
5621 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5623 src
= isl_basic_map_order_divs(src
);
5624 dst
= isl_basic_map_cow(dst
);
5625 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5626 src
->n_div
, 0, 2 * src
->n_div
);
5629 for (i
= 0; i
< src
->n_div
; ++i
) {
5630 int j
= find_div(dst
, src
, i
);
5632 j
= isl_basic_map_alloc_div(dst
);
5635 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5636 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5637 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5641 isl_basic_map_swap_div(dst
, i
, j
);
5645 isl_basic_map_free(dst
);
5649 struct isl_basic_set
*isl_basic_set_align_divs(
5650 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
5652 return (struct isl_basic_set
*)isl_basic_map_align_divs(
5653 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
5656 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
5664 map
= isl_map_compute_divs(map
);
5665 map
= isl_map_cow(map
);
5669 for (i
= 1; i
< map
->n
; ++i
)
5670 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
5671 for (i
= 1; i
< map
->n
; ++i
)
5672 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
5674 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5678 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
5680 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
5683 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
5687 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
5688 map
= isl_map_intersect_domain(map
, set
);
5689 set
= isl_map_range(map
);
5697 /* There is no need to cow as removing empty parts doesn't change
5698 * the meaning of the set.
5700 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
5707 for (i
= map
->n
-1; i
>= 0; --i
) {
5708 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
5710 isl_basic_map_free(map
->p
[i
]);
5711 if (i
!= map
->n
-1) {
5712 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5713 map
->p
[i
] = map
->p
[map
->n
-1];
5721 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
5723 return (struct isl_set
*)
5724 isl_map_remove_empty_parts((struct isl_map
*)set
);
5727 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
5729 struct isl_basic_map
*bmap
;
5730 if (!map
|| map
->n
== 0)
5732 bmap
= map
->p
[map
->n
-1];
5733 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
5734 return isl_basic_map_copy(bmap
);
5737 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
5739 return (struct isl_basic_set
*)
5740 isl_map_copy_basic_map((struct isl_map
*)set
);
5743 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
5744 __isl_keep isl_basic_map
*bmap
)
5750 for (i
= map
->n
-1; i
>= 0; --i
) {
5751 if (map
->p
[i
] != bmap
)
5753 map
= isl_map_cow(map
);
5756 isl_basic_map_free(map
->p
[i
]);
5757 if (i
!= map
->n
-1) {
5758 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
5759 map
->p
[i
] = map
->p
[map
->n
-1];
5770 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
5771 struct isl_basic_set
*bset
)
5773 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
5774 (struct isl_basic_map
*)bset
);
5777 /* Given two basic sets bset1 and bset2, compute the maximal difference
5778 * between the values of dimension pos in bset1 and those in bset2
5779 * for any common value of the parameters and dimensions preceding pos.
5781 static enum isl_lp_result
basic_set_maximal_difference_at(
5782 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
5783 int pos
, isl_int
*opt
)
5785 struct isl_dim
*dims
;
5786 struct isl_basic_map
*bmap1
= NULL
;
5787 struct isl_basic_map
*bmap2
= NULL
;
5788 struct isl_ctx
*ctx
;
5789 struct isl_vec
*obj
;
5792 unsigned dim1
, dim2
;
5793 enum isl_lp_result res
;
5795 if (!bset1
|| !bset2
)
5796 return isl_lp_error
;
5798 nparam
= isl_basic_set_n_param(bset1
);
5799 dim1
= isl_basic_set_n_dim(bset1
);
5800 dim2
= isl_basic_set_n_dim(bset2
);
5801 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
5802 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
5803 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
5804 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
5805 if (!bmap1
|| !bmap2
)
5807 bmap1
= isl_basic_map_cow(bmap1
);
5808 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
5809 pos
, (dim1
- pos
) + (dim2
- pos
),
5810 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
5811 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
5814 total
= isl_basic_map_total_dim(bmap1
);
5816 obj
= isl_vec_alloc(ctx
, 1 + total
);
5817 isl_seq_clr(obj
->block
.data
, 1 + total
);
5818 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
5819 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
5822 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
5824 isl_basic_map_free(bmap1
);
5828 isl_basic_map_free(bmap1
);
5829 isl_basic_map_free(bmap2
);
5830 return isl_lp_error
;
5833 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5834 * for any common value of the parameters and dimensions preceding pos
5835 * in both basic sets, the values of dimension pos in bset1 are
5836 * smaller or larger than those in bset2.
5839 * 1 if bset1 follows bset2
5840 * -1 if bset1 precedes bset2
5841 * 0 if bset1 and bset2 are incomparable
5842 * -2 if some error occurred.
5844 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
5845 struct isl_basic_set
*bset2
, int pos
)
5848 enum isl_lp_result res
;
5853 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5855 if (res
== isl_lp_empty
)
5857 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5858 res
== isl_lp_unbounded
)
5860 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5869 /* Given two basic sets bset1 and bset2, check whether
5870 * for any common value of the parameters and dimensions preceding pos
5871 * there is a value of dimension pos in bset1 that is larger
5872 * than a value of the same dimension in bset2.
5875 * 1 if there exists such a pair
5876 * 0 if there is no such pair, but there is a pair of equal values
5878 * -2 if some error occurred.
5880 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
5881 __isl_keep isl_basic_set
*bset2
, int pos
)
5884 enum isl_lp_result res
;
5889 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5891 if (res
== isl_lp_empty
)
5893 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5894 res
== isl_lp_unbounded
)
5896 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5898 else if (res
== isl_lp_ok
)
5907 /* Given two sets set1 and set2, check whether
5908 * for any common value of the parameters and dimensions preceding pos
5909 * there is a value of dimension pos in set1 that is larger
5910 * than a value of the same dimension in set2.
5913 * 1 if there exists such a pair
5914 * 0 if there is no such pair, but there is a pair of equal values
5916 * -2 if some error occurred.
5918 int isl_set_follows_at(__isl_keep isl_set
*set1
,
5919 __isl_keep isl_set
*set2
, int pos
)
5927 for (i
= 0; i
< set1
->n
; ++i
)
5928 for (j
= 0; j
< set2
->n
; ++j
) {
5930 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
5931 if (f
== 1 || f
== -2)
5940 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
5941 unsigned pos
, isl_int
*val
)
5949 total
= isl_basic_map_total_dim(bmap
);
5950 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
5951 for (; d
+1 > pos
; --d
)
5952 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
5956 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
5958 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
5960 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
5963 isl_int_neg(*val
, bmap
->eq
[i
][0]);
5969 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
5970 unsigned pos
, isl_int
*val
)
5982 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
5985 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
5986 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
5987 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
5988 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5992 isl_int_set(*val
, v
);
5998 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
5999 unsigned pos
, isl_int
*val
)
6001 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6005 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6008 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6011 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6012 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6014 if (pos
>= isl_basic_map_dim(bmap
, type
))
6016 return isl_basic_map_fast_has_fixed_var(bmap
,
6017 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6020 int isl_map_fast_is_fixed(struct isl_map
*map
,
6021 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6023 if (pos
>= isl_map_dim(map
, type
))
6025 return isl_map_fast_has_fixed_var(map
,
6026 map_offset(map
, type
) - 1 + pos
, val
);
6029 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6030 * then return this fixed value in *val.
6032 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6035 return isl_basic_set_fast_has_fixed_var(bset
,
6036 isl_basic_set_n_param(bset
) + dim
, val
);
6039 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6040 * then return this fixed value in *val.
6042 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6044 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6047 /* Check if input variable in has fixed value and if so and if val is not NULL,
6048 * then return this fixed value in *val.
6050 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6052 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6055 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6056 * and if val is not NULL, then return this lower bound in *val.
6058 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6059 unsigned dim
, isl_int
*val
)
6061 int i
, i_eq
= -1, i_ineq
= -1;
6068 total
= isl_basic_set_total_dim(bset
);
6069 nparam
= isl_basic_set_n_param(bset
);
6070 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6071 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6077 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6078 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6080 if (i_eq
!= -1 || i_ineq
!= -1)
6084 if (i_eq
== -1 && i_ineq
== -1)
6086 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6087 /* The coefficient should always be one due to normalization. */
6088 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6090 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6092 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6093 total
- nparam
- dim
- 1) != -1)
6096 isl_int_neg(*val
, c
[0]);
6100 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6101 unsigned dim
, isl_int
*val
)
6113 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6117 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6119 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6120 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6122 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6126 isl_int_set(*val
, v
);
6137 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6139 const struct constraint
*c1
= (const struct constraint
*)p1
;
6140 const struct constraint
*c2
= (const struct constraint
*)p2
;
6141 unsigned size
= isl_min(c1
->size
, c2
->size
);
6142 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6145 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6146 struct isl_basic_map
*bmap
)
6149 struct constraint
*c
;
6154 total
= isl_basic_map_total_dim(bmap
);
6155 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6158 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6160 c
[i
].c
= bmap
->ineq
[i
];
6162 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6163 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6164 bmap
->ineq
[i
] = c
[i
].c
;
6168 isl_basic_map_free(bmap
);
6172 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6173 __isl_take isl_basic_set
*bset
)
6175 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6176 (struct isl_basic_map
*)bset
);
6179 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6183 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6185 bmap
= isl_basic_map_remove_redundancies(bmap
);
6186 bmap
= isl_basic_map_sort_constraints(bmap
);
6187 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6191 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6193 return (struct isl_basic_set
*)isl_basic_map_normalize(
6194 (struct isl_basic_map
*)bset
);
6197 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6198 const __isl_keep isl_basic_map
*bmap2
)
6205 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6206 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6207 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6208 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6209 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6210 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6211 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6212 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6214 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6216 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6218 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6219 return bmap1
->n_eq
- bmap2
->n_eq
;
6220 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6221 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6222 if (bmap1
->n_div
!= bmap2
->n_div
)
6223 return bmap1
->n_div
- bmap2
->n_div
;
6224 total
= isl_basic_map_total_dim(bmap1
);
6225 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6226 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6230 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6231 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6235 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6236 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6243 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6244 __isl_keep isl_basic_map
*bmap2
)
6246 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6249 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6250 __isl_keep isl_basic_set
*bset2
)
6252 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6253 (isl_basic_map
*)bset2
);
6256 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6258 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6259 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6261 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6264 /* We normalize in place, but if anything goes wrong we need
6265 * to return NULL, so we need to make sure we don't change the
6266 * meaning of any possible other copies of map.
6268 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6271 struct isl_basic_map
*bmap
;
6275 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6277 for (i
= 0; i
< map
->n
; ++i
) {
6278 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6281 isl_basic_map_free(map
->p
[i
]);
6284 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6285 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6286 map
= isl_map_remove_empty_parts(map
);
6289 for (i
= map
->n
- 1; i
>= 1; --i
) {
6290 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6292 isl_basic_map_free(map
->p
[i
-1]);
6293 for (j
= i
; j
< map
->n
; ++j
)
6294 map
->p
[j
-1] = map
->p
[j
];
6304 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6306 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6309 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6319 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6322 map1
= isl_map_copy(map1
);
6323 map2
= isl_map_copy(map2
);
6324 map1
= isl_map_normalize(map1
);
6325 map2
= isl_map_normalize(map2
);
6328 equal
= map1
->n
== map2
->n
;
6329 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6330 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6343 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6345 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6346 (struct isl_map
*)set2
);
6349 /* Return an interval that ranges from min to max (inclusive)
6351 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6352 isl_int min
, isl_int max
)
6355 struct isl_basic_set
*bset
= NULL
;
6357 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6361 k
= isl_basic_set_alloc_inequality(bset
);
6364 isl_int_set_si(bset
->ineq
[k
][1], 1);
6365 isl_int_neg(bset
->ineq
[k
][0], min
);
6367 k
= isl_basic_set_alloc_inequality(bset
);
6370 isl_int_set_si(bset
->ineq
[k
][1], -1);
6371 isl_int_set(bset
->ineq
[k
][0], max
);
6375 isl_basic_set_free(bset
);
6379 /* Return the Cartesian product of the basic sets in list (in the given order).
6381 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6389 struct isl_basic_set
*product
= NULL
;
6393 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6394 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6395 nparam
= isl_basic_set_n_param(list
->p
[0]);
6396 dim
= isl_basic_set_n_dim(list
->p
[0]);
6397 extra
= list
->p
[0]->n_div
;
6398 n_eq
= list
->p
[0]->n_eq
;
6399 n_ineq
= list
->p
[0]->n_ineq
;
6400 for (i
= 1; i
< list
->n
; ++i
) {
6401 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6402 isl_assert(list
->ctx
,
6403 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6404 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6405 extra
+= list
->p
[i
]->n_div
;
6406 n_eq
+= list
->p
[i
]->n_eq
;
6407 n_ineq
+= list
->p
[i
]->n_ineq
;
6409 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6414 for (i
= 0; i
< list
->n
; ++i
) {
6415 isl_basic_set_add_constraints(product
,
6416 isl_basic_set_copy(list
->p
[i
]), dim
);
6417 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6419 isl_basic_set_list_free(list
);
6422 isl_basic_set_free(product
);
6423 isl_basic_set_list_free(list
);
6427 struct isl_basic_map
*isl_basic_map_product(
6428 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6430 struct isl_dim
*dim_result
= NULL
;
6431 struct isl_basic_map
*bmap
;
6432 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6433 struct isl_dim_map
*dim_map1
, *dim_map2
;
6435 if (!bmap1
|| !bmap2
)
6438 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6439 bmap2
->dim
, isl_dim_param
), goto error
);
6440 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6441 isl_dim_copy(bmap2
->dim
));
6443 in1
= isl_basic_map_n_in(bmap1
);
6444 in2
= isl_basic_map_n_in(bmap2
);
6445 out1
= isl_basic_map_n_out(bmap1
);
6446 out2
= isl_basic_map_n_out(bmap2
);
6447 nparam
= isl_basic_map_n_param(bmap1
);
6449 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6450 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6451 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6452 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6453 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6454 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6455 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6456 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6457 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6458 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6459 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6461 bmap
= isl_basic_map_alloc_dim(dim_result
,
6462 bmap1
->n_div
+ bmap2
->n_div
,
6463 bmap1
->n_eq
+ bmap2
->n_eq
,
6464 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6465 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6466 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6467 bmap
= isl_basic_map_simplify(bmap
);
6468 return isl_basic_map_finalize(bmap
);
6470 isl_basic_map_free(bmap1
);
6471 isl_basic_map_free(bmap2
);
6475 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6477 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6480 struct isl_map
*result
;
6486 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6487 map2
->dim
, isl_dim_param
), goto error
);
6489 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6490 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6491 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6493 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6494 isl_dim_copy(map2
->dim
)),
6495 map1
->n
* map2
->n
, flags
);
6498 for (i
= 0; i
< map1
->n
; ++i
)
6499 for (j
= 0; j
< map2
->n
; ++j
) {
6500 struct isl_basic_map
*part
;
6501 part
= isl_basic_map_product(
6502 isl_basic_map_copy(map1
->p
[i
]),
6503 isl_basic_map_copy(map2
->p
[j
]));
6504 if (isl_basic_map_is_empty(part
))
6505 isl_basic_map_free(part
);
6507 result
= isl_map_add_basic_map(result
, part
);
6520 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6522 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
6523 __isl_take isl_map
*map2
)
6527 prod
= isl_map_product(map1
, map2
);
6528 prod
= isl_map_flatten(prod
);
6532 /* Given two set A and B, construct its Cartesian product A x B.
6534 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6536 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6537 (struct isl_map
*)set2
);
6540 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
6541 __isl_take isl_set
*set2
)
6543 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
6546 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6549 uint32_t hash
= isl_hash_init();
6554 bset
= isl_basic_set_copy(bset
);
6555 bset
= isl_basic_set_normalize(bset
);
6558 total
= isl_basic_set_total_dim(bset
);
6559 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6560 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6562 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6563 isl_hash_hash(hash
, c_hash
);
6565 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6566 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6568 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6569 isl_hash_hash(hash
, c_hash
);
6571 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6572 for (i
= 0; i
< bset
->n_div
; ++i
) {
6574 if (isl_int_is_zero(bset
->div
[i
][0]))
6576 isl_hash_byte(hash
, i
& 0xFF);
6577 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6578 isl_hash_hash(hash
, c_hash
);
6580 isl_basic_set_free(bset
);
6584 uint32_t isl_set_get_hash(struct isl_set
*set
)
6591 set
= isl_set_copy(set
);
6592 set
= isl_set_normalize(set
);
6596 hash
= isl_hash_init();
6597 for (i
= 0; i
< set
->n
; ++i
) {
6599 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6600 isl_hash_hash(hash
, bset_hash
);
6608 /* Check if the value for dimension dim is completely determined
6609 * by the values of the other parameters and variables.
6610 * That is, check if dimension dim is involved in an equality.
6612 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6619 nparam
= isl_basic_set_n_param(bset
);
6620 for (i
= 0; i
< bset
->n_eq
; ++i
)
6621 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6626 /* Check if the value for dimension dim is completely determined
6627 * by the values of the other parameters and variables.
6628 * That is, check if dimension dim is involved in an equality
6629 * for each of the subsets.
6631 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6637 for (i
= 0; i
< set
->n
; ++i
) {
6639 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6646 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
6647 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
6654 for (i
= 0; i
< map
->n
; ++i
)
6655 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
6661 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
6662 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
6669 for (i
= 0; i
< set
->n
; ++i
)
6670 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
6676 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
6678 struct isl_dim
*dim
;
6683 if (bset
->n_div
== 0)
6686 bset
= isl_basic_set_cow(bset
);
6690 dim
= isl_basic_set_get_dim(bset
);
6691 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
6694 isl_dim_free(bset
->dim
);
6698 bset
= isl_basic_set_finalize(bset
);
6702 isl_basic_set_free(bset
);
6706 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
6709 struct isl_dim
*dim
;
6712 set
= isl_set_align_divs(set
);
6716 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
6719 set
= isl_set_cow(set
);
6723 n_div
= set
->p
[0]->n_div
;
6724 dim
= isl_set_get_dim(set
);
6725 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
6728 isl_dim_free(set
->dim
);
6731 for (i
= 0; i
< set
->n
; ++i
) {
6732 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
6743 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
6745 struct isl_dim
*dim
;
6746 struct isl_basic_map
*bmap
;
6753 set
= isl_set_align_divs(set
);
6758 dim
= isl_set_get_dim(set
);
6759 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
6761 return isl_map_identity(dim
);
6764 n_div
= set
->p
[0]->n_div
;
6765 dim
= isl_dim_map(dim
);
6766 n_param
= isl_dim_size(dim
, isl_dim_param
);
6767 n_set
= isl_dim_size(dim
, isl_dim_in
);
6768 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
6769 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
6770 for (i
= 0; i
< n_set
; ++i
)
6771 bmap
= var_equal(bmap
, i
);
6773 total
= n_param
+ n_set
+ n_set
+ n_div
;
6774 for (i
= 0; i
< n_div
; ++i
) {
6775 k
= isl_basic_map_alloc_inequality(bmap
);
6778 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
6779 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
6780 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
6781 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
6782 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
6783 set
->p
[0]->div
[i
][0]);
6785 l
= isl_basic_map_alloc_inequality(bmap
);
6788 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
6789 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
6790 set
->p
[0]->div
[i
][0]);
6791 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
6795 return isl_map_from_basic_map(bmap
);
6798 isl_basic_map_free(bmap
);
6802 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
6810 dim
= isl_basic_set_total_dim(bset
);
6811 size
+= bset
->n_eq
* (1 + dim
);
6812 size
+= bset
->n_ineq
* (1 + dim
);
6813 size
+= bset
->n_div
* (2 + dim
);
6818 int isl_set_size(__isl_keep isl_set
*set
)
6826 for (i
= 0; i
< set
->n
; ++i
)
6827 size
+= isl_basic_set_size(set
->p
[i
]);
6832 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
6833 enum isl_dim_type type
, unsigned pos
)
6841 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
6843 pos
+= isl_basic_map_offset(bmap
, type
);
6845 for (i
= 0; i
< bmap
->n_eq
; ++i
)
6846 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
6850 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6851 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
6858 return lower
&& upper
;
6861 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
6862 enum isl_dim_type type
, unsigned pos
)
6869 for (i
= 0; i
< map
->n
; ++i
) {
6871 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
6872 if (bounded
< 0 || !bounded
)
6879 /* Return 1 if the specified dim is involved in both an upper bound
6880 * and a lower bound.
6882 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
6883 enum isl_dim_type type
, unsigned pos
)
6885 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
6888 /* For each of the "n" variables starting at "first", determine
6889 * the sign of the variable and put the results in the first "n"
6890 * elements of the array "signs".
6892 * 1 means that the variable is non-negative
6893 * -1 means that the variable is non-positive
6894 * 0 means the variable attains both positive and negative values.
6896 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
6897 unsigned first
, unsigned n
, int *signs
)
6899 isl_vec
*bound
= NULL
;
6900 struct isl_tab
*tab
= NULL
;
6901 struct isl_tab_undo
*snap
;
6904 if (!bset
|| !signs
)
6907 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
6908 tab
= isl_tab_from_basic_set(bset
);
6912 isl_seq_clr(bound
->el
, bound
->size
);
6913 isl_int_set_si(bound
->el
[0], -1);
6915 snap
= isl_tab_snap(tab
);
6916 for (i
= 0; i
< n
; ++i
) {
6919 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
6920 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6923 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6924 if (isl_tab_rollback(tab
, snap
) < 0)
6932 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
6933 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6936 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6937 if (isl_tab_rollback(tab
, snap
) < 0)
6940 signs
[i
] = empty
? -1 : 0;
6944 isl_vec_free(bound
);
6948 isl_vec_free(bound
);
6952 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
6953 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
6955 if (!bset
|| !signs
)
6957 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
6960 first
+= pos(bset
->dim
, type
) - 1;
6961 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
6964 /* Check if the given map is single-valued.
6969 * and check if the result is a subset of the identity mapping.
6971 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
6977 test
= isl_map_reverse(isl_map_copy(map
));
6978 test
= isl_map_apply_range(test
, isl_map_copy(map
));
6980 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
6982 sv
= isl_map_is_subset(test
, id
);
6990 int isl_map_is_bijective(__isl_keep isl_map
*map
)
6994 sv
= isl_map_is_single_valued(map
);
6998 map
= isl_map_copy(map
);
6999 map
= isl_map_reverse(map
);
7000 sv
= isl_map_is_single_valued(map
);
7006 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7008 return isl_map_is_single_valued((isl_map
*)set
);
7011 int isl_map_is_translation(__isl_keep isl_map
*map
)
7016 delta
= isl_map_deltas(isl_map_copy(map
));
7017 ok
= isl_set_is_singleton(delta
);
7018 isl_set_free(delta
);
7023 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7025 if (isl_seq_first_non_zero(p
, pos
) != -1)
7027 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7032 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7041 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7044 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7045 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7046 for (j
= 0; j
< nvar
; ++j
) {
7047 int lower
= 0, upper
= 0;
7048 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7049 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7051 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7057 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7058 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7060 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7062 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7067 if (!lower
|| !upper
)
7074 int isl_set_is_box(__isl_keep isl_set
*set
)
7081 return isl_basic_set_is_box(set
->p
[0]);
7084 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7089 return isl_dim_is_wrapping(bset
->dim
);
7092 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7097 return isl_dim_is_wrapping(set
->dim
);
7100 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7102 bmap
= isl_basic_map_cow(bmap
);
7106 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7110 bmap
= isl_basic_map_finalize(bmap
);
7112 return (isl_basic_set
*)bmap
;
7114 isl_basic_map_free(bmap
);
7118 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7122 map
= isl_map_cow(map
);
7126 for (i
= 0; i
< map
->n
; ++i
) {
7127 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7131 map
->dim
= isl_dim_wrap(map
->dim
);
7135 return (isl_set
*)map
;
7141 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7143 bset
= isl_basic_set_cow(bset
);
7147 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7151 bset
= isl_basic_set_finalize(bset
);
7153 return (isl_basic_map
*)bset
;
7155 isl_basic_set_free(bset
);
7159 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7166 if (!isl_set_is_wrapping(set
))
7167 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7170 set
= isl_set_cow(set
);
7174 for (i
= 0; i
< set
->n
; ++i
) {
7175 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7180 set
->dim
= isl_dim_unwrap(set
->dim
);
7184 return (isl_map
*)set
;
7190 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7191 enum isl_dim_type type
)
7196 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7199 bmap
= isl_basic_map_cow(bmap
);
7203 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7207 bmap
= isl_basic_map_finalize(bmap
);
7211 isl_basic_map_free(bmap
);
7215 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7216 enum isl_dim_type type
)
7223 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7226 map
= isl_map_cow(map
);
7230 for (i
= 0; i
< map
->n
; ++i
) {
7231 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7235 map
->dim
= isl_dim_reset(map
->dim
, type
);
7245 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7250 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7253 bmap
= isl_basic_map_cow(bmap
);
7257 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7261 bmap
= isl_basic_map_finalize(bmap
);
7265 isl_basic_map_free(bmap
);
7269 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7276 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7279 map
= isl_map_cow(map
);
7283 for (i
= 0; i
< map
->n
; ++i
) {
7284 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7288 map
->dim
= isl_dim_flatten(map
->dim
);
7298 /* Extend the given dim_map with mappings for the divs in bmap.
7300 static __isl_give
struct isl_dim_map
*extend_dim_map(
7301 __isl_keep
struct isl_dim_map
*dim_map
,
7302 __isl_keep isl_basic_map
*bmap
)
7305 struct isl_dim_map
*res
;
7308 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7310 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7314 for (i
= 0; i
< dim_map
->len
; ++i
)
7315 res
->pos
[i
] = dim_map
->pos
[i
];
7316 for (i
= 0; i
< bmap
->n_div
; ++i
)
7317 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7322 /* Extract a dim_map from a reordering.
7323 * We essentially need to reverse the mapping, and add an offset
7324 * of 1 for the constant term.
7326 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7327 __isl_keep isl_reordering
*exp
)
7330 struct isl_dim_map
*dim_map
;
7335 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7339 for (i
= 0; i
< exp
->len
; ++i
)
7340 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7345 /* Reorder the dimensions of "bmap" according to the given dim_map
7346 * and set the dimension specification to "dim".
7348 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7349 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
7353 bmap
= isl_basic_map_cow(bmap
);
7354 if (!bmap
|| !dim
|| !dim_map
)
7357 res
= isl_basic_map_alloc_dim(dim
,
7358 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
7359 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
7360 res
= isl_basic_map_finalize(res
);
7364 isl_basic_map_free(bmap
);
7369 /* Reorder the dimensions of "map" according to given reordering.
7371 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
7372 __isl_take isl_reordering
*r
)
7375 struct isl_dim_map
*dim_map
;
7377 map
= isl_map_cow(map
);
7378 dim_map
= isl_dim_map_from_reordering(r
);
7379 if (!map
|| !r
|| !dim_map
)
7382 for (i
= 0; i
< map
->n
; ++i
) {
7383 struct isl_dim_map
*dim_map_i
;
7385 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
7387 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
7388 isl_dim_copy(r
->dim
), dim_map_i
);
7394 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
7396 isl_reordering_free(r
);
7402 isl_reordering_free(r
);
7406 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
7407 __isl_take isl_reordering
*r
)
7409 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);