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 bset
= isl_basic_set_gauss(bset
, NULL
);
1240 return isl_basic_set_finalize(bset
);
1242 isl_basic_set_free(bset
);
1246 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1249 set
= isl_set_cow(set
);
1253 for (i
= 0; i
< set
->n
; ++i
) {
1254 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1260 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1264 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1270 total
= isl_basic_map_total_dim(bmap
);
1271 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1272 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1274 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1276 i
= isl_basic_map_alloc_equality(bmap
);
1280 isl_int_set_si(bmap
->eq
[i
][0], 1);
1281 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1282 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1283 isl_vec_free(bmap
->sample
);
1284 bmap
->sample
= NULL
;
1285 return isl_basic_map_finalize(bmap
);
1287 isl_basic_map_free(bmap
);
1291 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1293 return (struct isl_basic_set
*)
1294 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1297 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1300 unsigned off
= isl_dim_total(bmap
->dim
);
1301 isl_int
*t
= bmap
->div
[a
];
1302 bmap
->div
[a
] = bmap
->div
[b
];
1305 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1306 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1308 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1309 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1311 for (i
= 0; i
< bmap
->n_div
; ++i
)
1312 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1313 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1316 /* Eliminate the specified n dimensions starting at first from the
1317 * constraints using Fourier-Motzkin. The dimensions themselves
1320 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1321 enum isl_dim_type type
, unsigned first
, unsigned n
)
1330 map
= isl_map_cow(map
);
1333 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1334 first
+= pos(map
->dim
, type
) - 1;
1336 for (i
= 0; i
< map
->n
; ++i
) {
1337 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1347 /* Eliminate the specified n dimensions starting at first from the
1348 * constraints using Fourier-Motzkin. The dimensions themselves
1351 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1352 enum isl_dim_type type
, unsigned first
, unsigned n
)
1354 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1357 /* Eliminate the specified n dimensions starting at first from the
1358 * constraints using Fourier-Motzkin. The dimensions themselves
1361 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1362 unsigned first
, unsigned n
)
1364 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1367 /* Project out n dimensions starting at first using Fourier-Motzkin */
1368 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1369 unsigned first
, unsigned n
)
1371 set
= isl_set_eliminate_dims(set
, first
, n
);
1372 set
= isl_set_drop_dims(set
, first
, n
);
1376 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1378 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1386 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1395 set
= isl_set_cow(set
);
1399 for (i
= 0; i
< set
->n
; ++i
) {
1400 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1410 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1411 enum isl_dim_type type
, unsigned first
, unsigned n
)
1415 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1419 bmap
= isl_basic_map_eliminate_vars(bmap
,
1420 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1423 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1425 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1428 isl_basic_map_free(bmap
);
1432 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1433 enum isl_dim_type type
, unsigned first
, unsigned n
)
1435 return (isl_basic_set
*)
1436 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1439 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1440 enum isl_dim_type type
, unsigned first
, unsigned n
)
1447 map
= isl_map_cow(map
);
1450 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1452 for (i
= 0; i
< map
->n
; ++i
) {
1453 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1454 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1458 map
= isl_map_drop(map
, type
, first
, n
);
1465 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1466 enum isl_dim_type type
, unsigned first
, unsigned n
)
1468 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1471 /* Project out n inputs starting at first using Fourier-Motzkin */
1472 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1473 unsigned first
, unsigned n
)
1475 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1478 /* Project out n dimensions starting at first using Fourier-Motzkin */
1479 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1480 unsigned first
, unsigned n
)
1482 unsigned nparam
= isl_basic_set_n_param(bset
);
1483 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1484 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1488 static void dump_term(struct isl_basic_map
*bmap
,
1489 isl_int c
, int pos
, FILE *out
)
1492 unsigned in
= isl_basic_map_n_in(bmap
);
1493 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1494 unsigned nparam
= isl_basic_map_n_param(bmap
);
1496 isl_int_print(out
, c
, 0);
1498 if (!isl_int_is_one(c
))
1499 isl_int_print(out
, c
, 0);
1500 if (pos
< 1 + nparam
) {
1501 name
= isl_dim_get_name(bmap
->dim
,
1502 isl_dim_param
, pos
- 1);
1504 fprintf(out
, "%s", name
);
1506 fprintf(out
, "p%d", pos
- 1);
1507 } else if (pos
< 1 + nparam
+ in
)
1508 fprintf(out
, "i%d", pos
- 1 - nparam
);
1509 else if (pos
< 1 + nparam
+ dim
)
1510 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1512 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1516 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1517 int sign
, FILE *out
)
1521 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1525 for (i
= 0, first
= 1; i
< len
; ++i
) {
1526 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1529 fprintf(out
, " + ");
1531 isl_int_abs(v
, c
[i
]);
1532 dump_term(bmap
, v
, i
, out
);
1539 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1540 const char *op
, FILE *out
, int indent
)
1544 fprintf(out
, "%*s", indent
, "");
1546 dump_constraint_sign(bmap
, c
, 1, out
);
1547 fprintf(out
, " %s ", op
);
1548 dump_constraint_sign(bmap
, c
, -1, out
);
1552 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1553 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1555 fprintf(out
, "%*s", indent
, "");
1556 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1561 static void dump_constraints(struct isl_basic_map
*bmap
,
1562 isl_int
**c
, unsigned n
,
1563 const char *op
, FILE *out
, int indent
)
1567 for (i
= 0; i
< n
; ++i
)
1568 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1571 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1575 unsigned total
= isl_basic_map_total_dim(bmap
);
1577 for (j
= 0; j
< 1 + total
; ++j
) {
1578 if (isl_int_is_zero(exp
[j
]))
1580 if (!first
&& isl_int_is_pos(exp
[j
]))
1582 dump_term(bmap
, exp
[j
], j
, out
);
1587 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1591 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1592 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1594 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1595 fprintf(out
, "%*s", indent
, "");
1596 fprintf(out
, "e%d = [(", i
);
1597 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1599 isl_int_print(out
, bmap
->div
[i
][0], 0);
1600 fprintf(out
, "]\n");
1604 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1607 fprintf(out
, "null basic set\n");
1611 fprintf(out
, "%*s", indent
, "");
1612 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1613 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1614 bset
->extra
, bset
->flags
);
1615 dump((struct isl_basic_map
*)bset
, out
, indent
);
1618 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1621 fprintf(out
, "null basic map\n");
1625 fprintf(out
, "%*s", indent
, "");
1626 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1627 "flags: %x, n_name: %d\n",
1629 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1630 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1631 dump(bmap
, out
, indent
);
1634 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1639 total
= isl_basic_map_total_dim(bmap
);
1640 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1641 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1642 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1643 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1647 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1649 struct isl_set
*set
;
1653 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1654 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1655 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1656 sizeof(struct isl_set
) +
1657 (n
- 1) * sizeof(struct isl_basic_set
*));
1661 set
->ctx
= dim
->ctx
;
1662 isl_ctx_ref(set
->ctx
);
1674 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1675 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1677 struct isl_set
*set
;
1678 struct isl_dim
*dims
;
1680 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1684 set
= isl_set_alloc_dim(dims
, n
, flags
);
1688 /* Make sure "map" has room for at least "n" more basic maps.
1690 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1693 struct isl_map
*grown
= NULL
;
1697 isl_assert(map
->ctx
, n
>= 0, goto error
);
1698 if (map
->n
+ n
<= map
->size
)
1700 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1703 for (i
= 0; i
< map
->n
; ++i
) {
1704 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1712 isl_map_free(grown
);
1717 /* Make sure "set" has room for at least "n" more basic sets.
1719 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1721 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1724 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1727 struct isl_set
*dup
;
1732 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1735 for (i
= 0; i
< set
->n
; ++i
)
1736 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1740 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1742 struct isl_set
*set
;
1747 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1749 isl_basic_set_free(bset
);
1752 return isl_set_add_basic_set(set
, bset
);
1755 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1757 struct isl_map
*map
;
1762 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1764 isl_basic_map_free(bmap
);
1767 return isl_map_add_basic_map(map
, bmap
);
1770 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1771 __isl_take isl_basic_set
*bset
)
1773 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1774 (struct isl_basic_map
*)bset
);
1777 void isl_set_free(struct isl_set
*set
)
1787 isl_ctx_deref(set
->ctx
);
1788 for (i
= 0; i
< set
->n
; ++i
)
1789 isl_basic_set_free(set
->p
[i
]);
1790 isl_dim_free(set
->dim
);
1794 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1799 fprintf(out
, "null set\n");
1803 fprintf(out
, "%*s", indent
, "");
1804 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1805 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1807 for (i
= 0; i
< set
->n
; ++i
) {
1808 fprintf(out
, "%*s", indent
, "");
1809 fprintf(out
, "basic set %d:\n", i
);
1810 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1814 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1819 fprintf(out
, "null map\n");
1823 fprintf(out
, "%*s", indent
, "");
1824 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1825 "flags: %x, n_name: %d\n",
1826 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1827 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1828 for (i
= 0; i
< map
->n
; ++i
) {
1829 fprintf(out
, "%*s", indent
, "");
1830 fprintf(out
, "basic map %d:\n", i
);
1831 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1835 struct isl_basic_map
*isl_basic_map_intersect_domain(
1836 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1838 struct isl_basic_map
*bmap_domain
;
1839 struct isl_dim
*dim
;
1844 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1845 bset
->dim
, isl_dim_param
), goto error
);
1847 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1848 isl_assert(bset
->ctx
,
1849 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1851 bmap
= isl_basic_map_cow(bmap
);
1854 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1855 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1856 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1857 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1858 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1860 bmap
= isl_basic_map_simplify(bmap
);
1861 return isl_basic_map_finalize(bmap
);
1863 isl_basic_map_free(bmap
);
1864 isl_basic_set_free(bset
);
1868 struct isl_basic_map
*isl_basic_map_intersect_range(
1869 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1871 struct isl_basic_map
*bmap_range
;
1876 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1877 bset
->dim
, isl_dim_param
), goto error
);
1879 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1880 isl_assert(bset
->ctx
,
1881 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1883 bmap
= isl_basic_map_cow(bmap
);
1886 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1887 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1888 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1889 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1891 bmap
= isl_basic_map_simplify(bmap
);
1892 return isl_basic_map_finalize(bmap
);
1894 isl_basic_map_free(bmap
);
1895 isl_basic_set_free(bset
);
1899 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1905 total
= 1 + isl_basic_map_total_dim(bmap
);
1906 if (total
!= vec
->size
)
1911 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1912 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1913 if (!isl_int_is_zero(s
)) {
1919 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1920 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1921 if (isl_int_is_neg(s
)) {
1932 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1934 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1937 struct isl_basic_map
*isl_basic_map_intersect(
1938 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1940 struct isl_vec
*sample
= NULL
;
1942 if (!bmap1
|| !bmap2
)
1945 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1946 bmap2
->dim
, isl_dim_param
), goto error
);
1947 if (isl_dim_total(bmap1
->dim
) ==
1948 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1949 isl_dim_total(bmap2
->dim
) !=
1950 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1951 return isl_basic_map_intersect(bmap2
, bmap1
);
1953 if (isl_dim_total(bmap2
->dim
) !=
1954 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1955 isl_assert(bmap1
->ctx
,
1956 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1958 if (bmap1
->sample
&&
1959 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1960 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1961 sample
= isl_vec_copy(bmap1
->sample
);
1962 else if (bmap2
->sample
&&
1963 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1964 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1965 sample
= isl_vec_copy(bmap2
->sample
);
1967 bmap1
= isl_basic_map_cow(bmap1
);
1970 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1971 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1972 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1975 isl_vec_free(sample
);
1977 isl_vec_free(bmap1
->sample
);
1978 bmap1
->sample
= sample
;
1981 bmap1
= isl_basic_map_simplify(bmap1
);
1982 return isl_basic_map_finalize(bmap1
);
1985 isl_vec_free(sample
);
1986 isl_basic_map_free(bmap1
);
1987 isl_basic_map_free(bmap2
);
1991 struct isl_basic_set
*isl_basic_set_intersect(
1992 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1994 return (struct isl_basic_set
*)
1995 isl_basic_map_intersect(
1996 (struct isl_basic_map
*)bset1
,
1997 (struct isl_basic_map
*)bset2
);
2000 /* Special case of isl_map_intersect, where both map1 and map2
2001 * are convex, without any divs and such that either map1 or map2
2002 * contains a single constraint. This constraint is then simply
2003 * added to the other map.
2005 static __isl_give isl_map
*map_intersect_add_constraint(
2006 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
2008 struct isl_basic_map
*bmap1
;
2009 struct isl_basic_map
*bmap2
;
2011 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
2012 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
2013 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2014 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
2016 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
2017 return isl_map_intersect(map2
, map1
);
2019 isl_assert(map2
->ctx
,
2020 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
2022 map1
= isl_map_cow(map1
);
2025 if (isl_map_fast_is_empty(map1
)) {
2029 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
2030 if (map2
->p
[0]->n_eq
== 1)
2031 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
2033 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
2034 map2
->p
[0]->ineq
[0]);
2036 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
2037 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
2041 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
2042 isl_basic_map_free(map1
->p
[0]);
2055 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
2058 struct isl_map
*result
;
2064 if (isl_map_fast_is_empty(map1
)) {
2068 if (isl_map_fast_is_empty(map2
)) {
2073 if (map1
->n
== 1 && map2
->n
== 1 &&
2074 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
2075 isl_dim_equal(map1
->dim
, map2
->dim
) &&
2076 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
2077 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
2078 return map_intersect_add_constraint(map1
, map2
);
2079 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
2080 map2
->dim
, isl_dim_param
), goto error
);
2081 if (isl_dim_total(map1
->dim
) ==
2082 isl_dim_size(map1
->dim
, isl_dim_param
) &&
2083 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2084 return isl_map_intersect(map2
, map1
);
2086 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
2087 isl_assert(map1
->ctx
,
2088 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2090 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2091 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
2092 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
2094 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2095 map1
->n
* map2
->n
, flags
);
2098 for (i
= 0; i
< map1
->n
; ++i
)
2099 for (j
= 0; j
< map2
->n
; ++j
) {
2100 struct isl_basic_map
*part
;
2101 part
= isl_basic_map_intersect(
2102 isl_basic_map_copy(map1
->p
[i
]),
2103 isl_basic_map_copy(map2
->p
[j
]));
2104 if (isl_basic_map_is_empty(part
))
2105 isl_basic_map_free(part
);
2107 result
= isl_map_add_basic_map(result
, part
);
2120 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
2122 return (struct isl_set
*)
2123 isl_map_intersect((struct isl_map
*)set1
,
2124 (struct isl_map
*)set2
);
2127 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2129 struct isl_dim
*dim
;
2130 struct isl_basic_set
*bset
;
2135 bmap
= isl_basic_map_cow(bmap
);
2138 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2139 in
= isl_basic_map_n_in(bmap
);
2140 bset
= isl_basic_set_from_basic_map(bmap
);
2141 bset
= isl_basic_set_swap_vars(bset
, in
);
2142 return isl_basic_map_from_basic_set(bset
, dim
);
2145 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2146 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2148 struct isl_dim
*res_dim
;
2149 struct isl_basic_map
*res
;
2150 struct isl_dim_map
*dim_map
;
2151 unsigned total
, off
;
2152 enum isl_dim_type t
;
2160 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2162 total
= isl_basic_map_total_dim(bmap
) + n
;
2163 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2165 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2167 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2169 unsigned size
= isl_basic_map_dim(bmap
, t
);
2170 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2172 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2173 pos
, size
- pos
, off
+ pos
+ n
);
2175 off
+= isl_dim_size(res_dim
, t
);
2177 isl_dim_map_div(dim_map
, bmap
, off
);
2179 res
= isl_basic_map_alloc_dim(res_dim
,
2180 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2181 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2182 res
= isl_basic_map_simplify(res
);
2183 return isl_basic_map_finalize(res
);
2186 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2187 enum isl_dim_type type
, unsigned n
)
2191 return isl_basic_map_insert(bmap
, type
,
2192 isl_basic_map_dim(bmap
, type
), n
);
2195 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2196 enum isl_dim_type type
, unsigned n
)
2200 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2201 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2203 isl_basic_set_free(bset
);
2207 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2208 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2215 map
= isl_map_cow(map
);
2219 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2223 for (i
= 0; i
< map
->n
; ++i
) {
2224 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2235 __isl_give isl_set
*isl_set_insert(__isl_take isl_set
*set
,
2236 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2238 return (isl_set
*)isl_map_insert((isl_map
*)set
, type
, pos
, n
);
2241 __isl_give isl_map
*isl_map_add(__isl_take isl_map
*map
,
2242 enum isl_dim_type type
, unsigned n
)
2246 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2249 __isl_give isl_set
*isl_set_add(__isl_take isl_set
*set
,
2250 enum isl_dim_type type
, unsigned n
)
2254 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2255 return (isl_set
*)isl_map_add((isl_map
*)set
, type
, n
);
2261 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2262 __isl_take isl_basic_map
*bmap
,
2263 enum isl_dim_type dst_type
, unsigned dst_pos
,
2264 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2267 struct isl_dim_map
*dim_map
;
2268 struct isl_basic_map
*res
;
2269 enum isl_dim_type t
;
2270 unsigned total
, off
;
2277 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2280 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2283 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2285 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2286 pos(bmap
->dim
, src_type
) + src_pos
+
2287 ((src_type
< dst_type
) ? n
: 0)) {
2288 bmap
= isl_basic_map_cow(bmap
);
2292 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2293 src_type
, src_pos
, n
);
2297 bmap
= isl_basic_map_finalize(bmap
);
2302 total
= isl_basic_map_total_dim(bmap
);
2303 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2306 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2307 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2308 if (t
== dst_type
) {
2309 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2312 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2315 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2316 dst_pos
, size
- dst_pos
, off
);
2317 off
+= size
- dst_pos
;
2318 } else if (t
== src_type
) {
2319 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2322 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2323 src_pos
+ n
, size
- src_pos
- n
, off
);
2324 off
+= size
- src_pos
- n
;
2326 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2330 isl_dim_map_div(dim_map
, bmap
, off
);
2332 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2333 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2334 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2336 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2337 src_type
, src_pos
, n
);
2341 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2342 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2343 bmap
= isl_basic_map_finalize(bmap
);
2347 isl_basic_map_free(bmap
);
2351 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2352 enum isl_dim_type dst_type
, unsigned dst_pos
,
2353 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2355 return (isl_basic_set
*)isl_basic_map_move_dims(
2356 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2359 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2360 enum isl_dim_type dst_type
, unsigned dst_pos
,
2361 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2365 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2366 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2367 src_type
, src_pos
, n
);
2373 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2374 enum isl_dim_type dst_type
, unsigned dst_pos
,
2375 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2384 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2387 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2390 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2392 map
= isl_map_cow(map
);
2396 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2400 for (i
= 0; i
< map
->n
; ++i
) {
2401 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2403 src_type
, src_pos
, n
);
2414 /* Move the specified dimensions to the last columns right before
2415 * the divs. Don't change the dimension specification of bmap.
2416 * That's the responsibility of the caller.
2418 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2419 enum isl_dim_type type
, unsigned first
, unsigned n
)
2421 struct isl_dim_map
*dim_map
;
2422 struct isl_basic_map
*res
;
2423 enum isl_dim_type t
;
2424 unsigned total
, off
;
2428 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2431 total
= isl_basic_map_total_dim(bmap
);
2432 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2435 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2436 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2438 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2441 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2442 first
, n
, total
- bmap
->n_div
- n
);
2443 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2444 first
+ n
, size
- (first
+ n
), off
);
2445 off
+= size
- (first
+ n
);
2447 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2451 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2453 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2454 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2455 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2459 /* Turn the n dimensions of type type, starting at first
2460 * into existentially quantified variables.
2462 __isl_give isl_basic_map
*isl_basic_map_project_out(
2463 __isl_take isl_basic_map
*bmap
,
2464 enum isl_dim_type type
, unsigned first
, unsigned n
)
2477 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2478 return isl_basic_map_remove(bmap
, type
, first
, n
);
2480 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2483 bmap
= move_last(bmap
, type
, first
, n
);
2484 bmap
= isl_basic_map_cow(bmap
);
2488 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2489 old
= bmap
->block2
.data
;
2490 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2491 (bmap
->extra
+ n
) * (1 + row_size
));
2492 if (!bmap
->block2
.data
)
2494 new_div
= isl_alloc_array(bmap
->ctx
, isl_int
*, bmap
->extra
+ n
);
2497 for (i
= 0; i
< n
; ++i
) {
2498 new_div
[i
] = bmap
->block2
.data
+
2499 (bmap
->extra
+ i
) * (1 + row_size
);
2500 isl_seq_clr(new_div
[i
], 1 + row_size
);
2502 for (i
= 0; i
< bmap
->extra
; ++i
)
2503 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2505 bmap
->div
= new_div
;
2509 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2512 bmap
= isl_basic_map_simplify(bmap
);
2513 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2514 return isl_basic_map_finalize(bmap
);
2516 isl_basic_map_free(bmap
);
2520 /* Turn the n dimensions of type type, starting at first
2521 * into existentially quantified variables.
2523 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2524 enum isl_dim_type type
, unsigned first
, unsigned n
)
2526 return (isl_basic_set
*)isl_basic_map_project_out(
2527 (isl_basic_map
*)bset
, type
, first
, n
);
2530 /* Turn the n dimensions of type type, starting at first
2531 * into existentially quantified variables.
2533 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2534 enum isl_dim_type type
, unsigned first
, unsigned n
)
2544 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2546 map
= isl_map_cow(map
);
2550 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2554 for (i
= 0; i
< map
->n
; ++i
) {
2555 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2566 /* Turn the n dimensions of type type, starting at first
2567 * into existentially quantified variables.
2569 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2570 enum isl_dim_type type
, unsigned first
, unsigned n
)
2572 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2575 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2579 for (i
= 0; i
< n
; ++i
) {
2580 j
= isl_basic_map_alloc_div(bmap
);
2583 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2587 isl_basic_map_free(bmap
);
2591 struct isl_basic_map
*isl_basic_map_apply_range(
2592 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2594 struct isl_dim
*dim_result
= NULL
;
2595 struct isl_basic_map
*bmap
;
2596 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2597 struct isl_dim_map
*dim_map1
, *dim_map2
;
2599 if (!bmap1
|| !bmap2
)
2602 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2603 isl_dim_copy(bmap2
->dim
));
2605 n_in
= isl_basic_map_n_in(bmap1
);
2606 n_out
= isl_basic_map_n_out(bmap2
);
2607 n
= isl_basic_map_n_out(bmap1
);
2608 nparam
= isl_basic_map_n_param(bmap1
);
2610 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2611 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2612 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2613 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2614 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2615 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2616 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2617 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2618 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2619 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2620 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2622 bmap
= isl_basic_map_alloc_dim(dim_result
,
2623 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2624 bmap1
->n_eq
+ bmap2
->n_eq
,
2625 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2626 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2627 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2628 bmap
= add_divs(bmap
, n
);
2629 bmap
= isl_basic_map_simplify(bmap
);
2630 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2631 return isl_basic_map_finalize(bmap
);
2633 isl_basic_map_free(bmap1
);
2634 isl_basic_map_free(bmap2
);
2638 struct isl_basic_set
*isl_basic_set_apply(
2639 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2644 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2647 return (struct isl_basic_set
*)
2648 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2650 isl_basic_set_free(bset
);
2651 isl_basic_map_free(bmap
);
2655 struct isl_basic_map
*isl_basic_map_apply_domain(
2656 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2658 if (!bmap1
|| !bmap2
)
2661 isl_assert(bmap1
->ctx
,
2662 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2663 isl_assert(bmap1
->ctx
,
2664 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2667 bmap1
= isl_basic_map_reverse(bmap1
);
2668 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2669 return isl_basic_map_reverse(bmap1
);
2671 isl_basic_map_free(bmap1
);
2672 isl_basic_map_free(bmap2
);
2676 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2677 * A \cap B -> f(A) + f(B)
2679 struct isl_basic_map
*isl_basic_map_sum(
2680 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2682 unsigned n_in
, n_out
, nparam
, total
, pos
;
2683 struct isl_basic_map
*bmap
= NULL
;
2684 struct isl_dim_map
*dim_map1
, *dim_map2
;
2687 if (!bmap1
|| !bmap2
)
2690 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2693 nparam
= isl_basic_map_n_param(bmap1
);
2694 n_in
= isl_basic_map_n_in(bmap1
);
2695 n_out
= isl_basic_map_n_out(bmap1
);
2697 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2698 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2699 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2700 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2701 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2702 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2703 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2704 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2705 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2706 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2707 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2709 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2710 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2711 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2712 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2713 for (i
= 0; i
< n_out
; ++i
) {
2714 int j
= isl_basic_map_alloc_equality(bmap
);
2717 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2718 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2719 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2720 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2722 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2723 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2724 bmap
= add_divs(bmap
, 2 * n_out
);
2726 bmap
= isl_basic_map_simplify(bmap
);
2727 return isl_basic_map_finalize(bmap
);
2729 isl_basic_map_free(bmap
);
2730 isl_basic_map_free(bmap1
);
2731 isl_basic_map_free(bmap2
);
2735 /* Given two maps A -> f(A) and B -> g(B), construct a map
2736 * A \cap B -> f(A) + f(B)
2738 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2740 struct isl_map
*result
;
2746 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2748 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2749 map1
->n
* map2
->n
, 0);
2752 for (i
= 0; i
< map1
->n
; ++i
)
2753 for (j
= 0; j
< map2
->n
; ++j
) {
2754 struct isl_basic_map
*part
;
2755 part
= isl_basic_map_sum(
2756 isl_basic_map_copy(map1
->p
[i
]),
2757 isl_basic_map_copy(map2
->p
[j
]));
2758 if (isl_basic_map_is_empty(part
))
2759 isl_basic_map_free(part
);
2761 result
= isl_map_add_basic_map(result
, part
);
2774 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2775 __isl_take isl_set
*set2
)
2777 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2780 /* Given a basic map A -> f(A), construct A -> -f(A).
2782 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2787 bmap
= isl_basic_map_cow(bmap
);
2791 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2792 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2793 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2794 for (j
= 0; j
< n
; ++j
)
2795 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2796 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2797 for (j
= 0; j
< n
; ++j
)
2798 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2799 for (i
= 0; i
< bmap
->n_div
; ++i
)
2800 for (j
= 0; j
< n
; ++j
)
2801 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2802 return isl_basic_map_finalize(bmap
);
2805 /* Given a map A -> f(A), construct A -> -f(A).
2807 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2811 map
= isl_map_cow(map
);
2815 for (i
= 0; i
< map
->n
; ++i
) {
2816 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2827 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2829 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2832 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2833 * A -> floor(f(A)/d).
2835 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2838 unsigned n_in
, n_out
, nparam
, total
, pos
;
2839 struct isl_basic_map
*result
= NULL
;
2840 struct isl_dim_map
*dim_map
;
2846 nparam
= isl_basic_map_n_param(bmap
);
2847 n_in
= isl_basic_map_n_in(bmap
);
2848 n_out
= isl_basic_map_n_out(bmap
);
2850 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2851 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2852 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2853 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2854 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2855 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2857 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2858 bmap
->n_div
+ n_out
,
2859 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2860 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2861 result
= add_divs(result
, n_out
);
2862 for (i
= 0; i
< n_out
; ++i
) {
2864 j
= isl_basic_map_alloc_inequality(result
);
2867 isl_seq_clr(result
->ineq
[j
], 1+total
);
2868 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2869 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2870 j
= isl_basic_map_alloc_inequality(result
);
2873 isl_seq_clr(result
->ineq
[j
], 1+total
);
2874 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2875 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2876 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2879 result
= isl_basic_map_simplify(result
);
2880 return isl_basic_map_finalize(result
);
2882 isl_basic_map_free(result
);
2886 /* Given a map A -> f(A) and an integer d, construct a map
2887 * A -> floor(f(A)/d).
2889 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2893 map
= isl_map_cow(map
);
2897 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2898 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2899 for (i
= 0; i
< map
->n
; ++i
) {
2900 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2911 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2917 i
= isl_basic_map_alloc_equality(bmap
);
2920 nparam
= isl_basic_map_n_param(bmap
);
2921 n_in
= isl_basic_map_n_in(bmap
);
2922 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2923 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2924 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2925 return isl_basic_map_finalize(bmap
);
2927 isl_basic_map_free(bmap
);
2931 /* Add a constraints to "bmap" expressing i_pos < o_pos
2933 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2939 i
= isl_basic_map_alloc_inequality(bmap
);
2942 nparam
= isl_basic_map_n_param(bmap
);
2943 n_in
= isl_basic_map_n_in(bmap
);
2944 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2945 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2946 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2947 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2948 return isl_basic_map_finalize(bmap
);
2950 isl_basic_map_free(bmap
);
2954 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2956 static __isl_give isl_basic_map
*var_less_or_equal(
2957 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2963 i
= isl_basic_map_alloc_inequality(bmap
);
2966 nparam
= isl_basic_map_n_param(bmap
);
2967 n_in
= isl_basic_map_n_in(bmap
);
2968 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2969 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2970 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2971 return isl_basic_map_finalize(bmap
);
2973 isl_basic_map_free(bmap
);
2977 /* Add a constraints to "bmap" expressing i_pos > o_pos
2979 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2985 i
= isl_basic_map_alloc_inequality(bmap
);
2988 nparam
= isl_basic_map_n_param(bmap
);
2989 n_in
= isl_basic_map_n_in(bmap
);
2990 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2991 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2992 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2993 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2994 return isl_basic_map_finalize(bmap
);
2996 isl_basic_map_free(bmap
);
3000 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3002 static __isl_give isl_basic_map
*var_more_or_equal(
3003 __isl_take isl_basic_map
*bmap
, unsigned pos
)
3009 i
= isl_basic_map_alloc_inequality(bmap
);
3012 nparam
= isl_basic_map_n_param(bmap
);
3013 n_in
= isl_basic_map_n_in(bmap
);
3014 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
3015 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
3016 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
3017 return isl_basic_map_finalize(bmap
);
3019 isl_basic_map_free(bmap
);
3023 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
3026 struct isl_basic_map
*bmap
;
3027 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
3030 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
3031 bmap
= var_equal(bmap
, i
);
3032 return isl_basic_map_finalize(bmap
);
3035 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3037 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
3040 struct isl_basic_map
*bmap
;
3041 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3044 for (i
= 0; i
< pos
&& bmap
; ++i
)
3045 bmap
= var_equal(bmap
, i
);
3047 bmap
= var_less(bmap
, pos
);
3048 return isl_basic_map_finalize(bmap
);
3051 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3053 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
3054 __isl_take isl_dim
*dim
, unsigned pos
)
3057 isl_basic_map
*bmap
;
3059 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3060 for (i
= 0; i
< pos
; ++i
)
3061 bmap
= var_equal(bmap
, i
);
3062 bmap
= var_less_or_equal(bmap
, pos
);
3063 return isl_basic_map_finalize(bmap
);
3066 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3068 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
3071 struct isl_basic_map
*bmap
;
3072 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3075 for (i
= 0; i
< pos
&& bmap
; ++i
)
3076 bmap
= var_equal(bmap
, i
);
3078 bmap
= var_more(bmap
, pos
);
3079 return isl_basic_map_finalize(bmap
);
3082 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3084 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
3085 __isl_take isl_dim
*dim
, unsigned pos
)
3088 isl_basic_map
*bmap
;
3090 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
3091 for (i
= 0; i
< pos
; ++i
)
3092 bmap
= var_equal(bmap
, i
);
3093 bmap
= var_more_or_equal(bmap
, pos
);
3094 return isl_basic_map_finalize(bmap
);
3097 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
3098 unsigned n
, int equal
)
3100 struct isl_map
*map
;
3103 if (n
== 0 && equal
)
3104 return isl_map_universe(dims
);
3106 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3108 for (i
= 0; i
+ 1 < n
; ++i
)
3109 map
= isl_map_add_basic_map(map
,
3110 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
3113 map
= isl_map_add_basic_map(map
,
3114 isl_basic_map_less_or_equal_at(dims
, n
- 1));
3116 map
= isl_map_add_basic_map(map
,
3117 isl_basic_map_less_at(dims
, n
- 1));
3124 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
3128 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
3131 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
3133 return map_lex_lte_first(dim
, n
, 0);
3136 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
3138 return map_lex_lte_first(dim
, n
, 1);
3141 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3143 return map_lex_lte(isl_dim_map(set_dim
), 0);
3146 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3148 return map_lex_lte(isl_dim_map(set_dim
), 1);
3151 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3152 unsigned n
, int equal
)
3154 struct isl_map
*map
;
3157 if (n
== 0 && equal
)
3158 return isl_map_universe(dims
);
3160 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3162 for (i
= 0; i
+ 1 < n
; ++i
)
3163 map
= isl_map_add_basic_map(map
,
3164 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3167 map
= isl_map_add_basic_map(map
,
3168 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3170 map
= isl_map_add_basic_map(map
,
3171 isl_basic_map_more_at(dims
, n
- 1));
3178 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3182 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3185 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3187 return map_lex_gte_first(dim
, n
, 0);
3190 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3192 return map_lex_gte_first(dim
, n
, 1);
3195 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3197 return map_lex_gte(isl_dim_map(set_dim
), 0);
3200 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3202 return map_lex_gte(isl_dim_map(set_dim
), 1);
3205 __isl_give isl_map
*isl_set_lex_le_set(__isl_take isl_set
*set1
,
3206 __isl_take isl_set
*set2
)
3209 map
= isl_map_lex_le(isl_set_get_dim(set1
));
3210 map
= isl_map_intersect_domain(map
, set1
);
3211 map
= isl_map_intersect_range(map
, set2
);
3215 __isl_give isl_map
*isl_set_lex_lt_set(__isl_take isl_set
*set1
,
3216 __isl_take isl_set
*set2
)
3219 map
= isl_map_lex_lt(isl_set_get_dim(set1
));
3220 map
= isl_map_intersect_domain(map
, set1
);
3221 map
= isl_map_intersect_range(map
, set2
);
3225 __isl_give isl_map
*isl_set_lex_ge_set(__isl_take isl_set
*set1
,
3226 __isl_take isl_set
*set2
)
3229 map
= isl_map_lex_ge(isl_set_get_dim(set1
));
3230 map
= isl_map_intersect_domain(map
, set1
);
3231 map
= isl_map_intersect_range(map
, set2
);
3235 __isl_give isl_map
*isl_set_lex_gt_set(__isl_take isl_set
*set1
,
3236 __isl_take isl_set
*set2
)
3239 map
= isl_map_lex_gt(isl_set_get_dim(set1
));
3240 map
= isl_map_intersect_domain(map
, set1
);
3241 map
= isl_map_intersect_range(map
, set2
);
3245 __isl_give isl_map
*isl_map_lex_le_map(__isl_take isl_map
*map1
,
3246 __isl_take isl_map
*map2
)
3249 map
= isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1
)));
3250 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3251 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3255 __isl_give isl_map
*isl_map_lex_lt_map(__isl_take isl_map
*map1
,
3256 __isl_take isl_map
*map2
)
3259 map
= isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1
)));
3260 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3261 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3265 __isl_give isl_map
*isl_map_lex_ge_map(__isl_take isl_map
*map1
,
3266 __isl_take isl_map
*map2
)
3269 map
= isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1
)));
3270 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3271 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3275 __isl_give isl_map
*isl_map_lex_gt_map(__isl_take isl_map
*map1
,
3276 __isl_take isl_map
*map2
)
3279 map
= isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1
)));
3280 map
= isl_map_apply_domain(map
, isl_map_reverse(map1
));
3281 map
= isl_map_apply_range(map
, isl_map_reverse(map2
));
3285 struct isl_basic_map
*isl_basic_map_from_basic_set(
3286 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3288 struct isl_basic_map
*bmap
;
3290 bset
= isl_basic_set_cow(bset
);
3294 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3295 isl_dim_free(bset
->dim
);
3296 bmap
= (struct isl_basic_map
*) bset
;
3298 return isl_basic_map_finalize(bmap
);
3300 isl_basic_set_free(bset
);
3305 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3309 if (bmap
->dim
->n_in
== 0)
3310 return (struct isl_basic_set
*)bmap
;
3311 bmap
= isl_basic_map_cow(bmap
);
3314 bmap
->dim
= isl_dim_as_set_dim(bmap
->dim
);
3317 bmap
= isl_basic_map_finalize(bmap
);
3318 return (struct isl_basic_set
*)bmap
;
3320 isl_basic_map_free(bmap
);
3324 /* For a div d = floor(f/m), add the constraints
3327 * -(f-(n-1)) + m d >= 0
3329 * Note that the second constraint is the negation of
3333 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3334 unsigned pos
, isl_int
*div
)
3337 unsigned total
= isl_basic_map_total_dim(bmap
);
3339 i
= isl_basic_map_alloc_inequality(bmap
);
3342 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3343 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3345 j
= isl_basic_map_alloc_inequality(bmap
);
3348 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3349 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3350 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3354 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3355 unsigned pos
, isl_int
*div
)
3357 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3361 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3363 unsigned total
= isl_basic_map_total_dim(bmap
);
3364 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3366 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3370 struct isl_basic_set
*isl_basic_map_underlying_set(
3371 struct isl_basic_map
*bmap
)
3375 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 &&
3376 bmap
->n_div
== 0 && !isl_dim_get_tuple_name(bmap
->dim
, isl_dim_out
))
3377 return (struct isl_basic_set
*)bmap
;
3378 bmap
= isl_basic_map_cow(bmap
);
3381 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3384 bmap
->extra
-= bmap
->n_div
;
3386 bmap
= isl_basic_map_finalize(bmap
);
3387 return (struct isl_basic_set
*)bmap
;
3392 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3393 __isl_take isl_basic_set
*bset
)
3395 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3398 struct isl_basic_map
*isl_basic_map_overlying_set(
3399 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3401 struct isl_basic_map
*bmap
;
3402 struct isl_ctx
*ctx
;
3409 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3410 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3411 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3413 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3414 isl_basic_map_free(like
);
3415 return (struct isl_basic_map
*)bset
;
3417 bset
= isl_basic_set_cow(bset
);
3420 total
= bset
->dim
->n_out
+ bset
->extra
;
3421 bmap
= (struct isl_basic_map
*)bset
;
3422 isl_dim_free(bmap
->dim
);
3423 bmap
->dim
= isl_dim_copy(like
->dim
);
3426 bmap
->n_div
= like
->n_div
;
3427 bmap
->extra
+= like
->n_div
;
3430 ltotal
= total
- bmap
->extra
+ like
->extra
;
3433 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3434 bmap
->extra
* (1 + 1 + total
));
3435 if (isl_blk_is_error(bmap
->block2
))
3437 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3441 for (i
= 0; i
< bmap
->extra
; ++i
)
3442 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3443 for (i
= 0; i
< like
->n_div
; ++i
) {
3444 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3445 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3447 bmap
= isl_basic_map_extend_constraints(bmap
,
3448 0, 2 * like
->n_div
);
3449 for (i
= 0; i
< like
->n_div
; ++i
) {
3450 if (isl_int_is_zero(bmap
->div
[i
][0]))
3452 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3456 isl_basic_map_free(like
);
3457 bmap
= isl_basic_map_simplify(bmap
);
3458 bmap
= isl_basic_map_finalize(bmap
);
3461 isl_basic_map_free(like
);
3462 isl_basic_set_free(bset
);
3466 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3467 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3469 return (struct isl_basic_set
*)
3470 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3473 struct isl_set
*isl_set_from_underlying_set(
3474 struct isl_set
*set
, struct isl_basic_set
*like
)
3480 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3482 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3483 isl_basic_set_free(like
);
3486 set
= isl_set_cow(set
);
3489 for (i
= 0; i
< set
->n
; ++i
) {
3490 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3491 isl_basic_set_copy(like
));
3495 isl_dim_free(set
->dim
);
3496 set
->dim
= isl_dim_copy(like
->dim
);
3499 isl_basic_set_free(like
);
3502 isl_basic_set_free(like
);
3507 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3511 map
= isl_map_cow(map
);
3514 map
->dim
= isl_dim_cow(map
->dim
);
3518 for (i
= 1; i
< map
->n
; ++i
)
3519 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3521 for (i
= 0; i
< map
->n
; ++i
) {
3522 map
->p
[i
] = (struct isl_basic_map
*)
3523 isl_basic_map_underlying_set(map
->p
[i
]);
3528 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3530 isl_dim_free(map
->dim
);
3531 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3535 return (struct isl_set
*)map
;
3541 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3543 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3546 static __isl_give isl_basic_map
*isl_basic_map_reset_dim(
3547 __isl_take isl_basic_map
*bmap
, __isl_take isl_dim
*dim
)
3549 bmap
= isl_basic_map_cow(bmap
);
3553 isl_dim_free(bmap
->dim
);
3556 bmap
= isl_basic_map_finalize(bmap
);
3560 isl_basic_map_free(bmap
);
3565 static __isl_give isl_basic_set
*isl_basic_set_reset_dim(
3566 __isl_take isl_basic_set
*bset
, __isl_take isl_dim
*dim
)
3568 return (isl_basic_set
*)isl_basic_map_reset_dim((isl_basic_map
*)bset
,
3572 __isl_give isl_map
*isl_map_reset_dim(__isl_take isl_map
*map
,
3573 __isl_take isl_dim
*dim
)
3577 map
= isl_map_cow(map
);
3581 for (i
= 0; i
< map
->n
; ++i
) {
3582 map
->p
[i
] = isl_basic_map_reset_dim(map
->p
[i
],
3587 isl_dim_free(map
->dim
);
3597 __isl_give isl_set
*isl_set_reset_dim(__isl_take isl_set
*set
,
3598 __isl_take isl_dim
*dim
)
3600 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3603 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3606 struct isl_basic_set
*domain
;
3612 dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
3614 n_in
= isl_basic_map_n_in(bmap
);
3615 n_out
= isl_basic_map_n_out(bmap
);
3616 domain
= isl_basic_set_from_basic_map(bmap
);
3617 domain
= isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3619 domain
= isl_basic_set_reset_dim(domain
, dim
);
3624 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3626 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3629 struct isl_set
*isl_map_range(struct isl_map
*map
)
3632 struct isl_set
*set
;
3636 if (isl_map_dim(map
, isl_dim_in
) == 0)
3637 return (isl_set
*)map
;
3639 map
= isl_map_cow(map
);
3643 set
= (struct isl_set
*) map
;
3644 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3647 for (i
= 0; i
< map
->n
; ++i
) {
3648 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3652 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3653 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3660 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3663 struct isl_map
*map
= NULL
;
3665 set
= isl_set_cow(set
);
3668 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3669 map
= (struct isl_map
*)set
;
3670 for (i
= 0; i
< set
->n
; ++i
) {
3671 map
->p
[i
] = isl_basic_map_from_basic_set(
3672 set
->p
[i
], isl_dim_copy(dim
));
3676 isl_dim_free(map
->dim
);
3685 __isl_give isl_basic_map
*isl_basic_map_from_range(
3686 __isl_take isl_basic_set
*bset
)
3688 return (isl_basic_map
*)bset
;
3691 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3693 return (struct isl_map
*)set
;
3696 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3698 return isl_map_reverse(isl_map_from_range(set
));
3701 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3702 __isl_take isl_set
*range
)
3704 return isl_map_apply_range(isl_map_from_domain(domain
),
3705 isl_map_from_range(range
));
3708 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3711 struct isl_set
*set
= NULL
;
3715 map
= isl_map_cow(map
);
3718 map
->dim
= isl_dim_as_set_dim(map
->dim
);
3721 set
= (struct isl_set
*)map
;
3722 for (i
= 0; i
< map
->n
; ++i
) {
3723 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3733 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3735 struct isl_map
*map
;
3739 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3740 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3741 sizeof(struct isl_map
) +
3742 (n
- 1) * sizeof(struct isl_basic_map
*));
3746 map
->ctx
= dim
->ctx
;
3747 isl_ctx_ref(map
->ctx
);
3759 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
3760 unsigned nparam
, unsigned in
, unsigned out
, int n
,
3763 struct isl_map
*map
;
3764 struct isl_dim
*dims
;
3766 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
3770 map
= isl_map_alloc_dim(dims
, n
, flags
);
3774 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
3776 struct isl_basic_map
*bmap
;
3777 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
3778 bmap
= isl_basic_map_set_to_empty(bmap
);
3782 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
3784 struct isl_basic_set
*bset
;
3785 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
3786 bset
= isl_basic_set_set_to_empty(bset
);
3790 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
3792 struct isl_basic_map
*bmap
;
3795 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3796 bmap
= isl_basic_map_set_to_empty(bmap
);
3800 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
3802 struct isl_basic_map
*bmap
;
3805 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3806 bmap
= isl_basic_map_set_to_empty(bmap
);
3810 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
3812 struct isl_basic_set
*bset
;
3815 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3816 bset
= isl_basic_set_set_to_empty(bset
);
3820 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
3822 struct isl_basic_map
*bmap
;
3823 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
3827 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
3829 struct isl_basic_set
*bset
;
3830 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
3834 __isl_give isl_basic_map
*isl_basic_map_universe_like(
3835 __isl_keep isl_basic_map
*model
)
3839 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3842 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
3846 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3849 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
3850 __isl_keep isl_set
*model
)
3854 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3857 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
3859 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3862 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
3866 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3869 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
3873 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3876 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
3878 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3881 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
3885 return isl_set_empty(isl_dim_copy(model
->dim
));
3888 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
3890 struct isl_map
*map
;
3893 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3894 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
3898 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
3900 struct isl_set
*set
;
3903 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3904 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
3908 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
3912 return isl_set_universe(isl_dim_copy(model
->dim
));
3915 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3918 struct isl_map
*dup
;
3922 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3923 for (i
= 0; i
< map
->n
; ++i
)
3924 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
3928 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
3929 __isl_take isl_basic_map
*bmap
)
3933 if (isl_basic_map_fast_is_empty(bmap
)) {
3934 isl_basic_map_free(bmap
);
3937 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3938 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3939 map
->p
[map
->n
] = bmap
;
3941 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3947 isl_basic_map_free(bmap
);
3951 void isl_map_free(struct isl_map
*map
)
3961 isl_ctx_deref(map
->ctx
);
3962 for (i
= 0; i
< map
->n
; ++i
)
3963 isl_basic_map_free(map
->p
[i
]);
3964 isl_dim_free(map
->dim
);
3968 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3969 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3973 base
= isl_map_cow(base
);
3977 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3980 for (i
= 0; i
< base
->n
; ++i
) {
3981 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3982 isl_dim_copy(base
->dim
), 0, 0, 0);
3992 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3993 unsigned nparam
, unsigned dim
)
3995 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3999 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
4000 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
4004 bmap
= isl_basic_map_cow(bmap
);
4005 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4006 j
= isl_basic_map_alloc_equality(bmap
);
4009 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4010 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4011 isl_int_set_si(bmap
->eq
[j
][0], value
);
4012 bmap
= isl_basic_map_simplify(bmap
);
4013 return isl_basic_map_finalize(bmap
);
4015 isl_basic_map_free(bmap
);
4019 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
4020 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
4024 bmap
= isl_basic_map_cow(bmap
);
4025 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
4026 j
= isl_basic_map_alloc_equality(bmap
);
4029 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
4030 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
4031 isl_int_set(bmap
->eq
[j
][0], value
);
4032 bmap
= isl_basic_map_simplify(bmap
);
4033 return isl_basic_map_finalize(bmap
);
4035 isl_basic_map_free(bmap
);
4039 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
4040 enum isl_dim_type type
, unsigned pos
, int value
)
4044 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4045 return isl_basic_map_fix_pos_si(bmap
,
4046 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4048 isl_basic_map_free(bmap
);
4052 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
4053 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4057 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4058 return isl_basic_map_fix_pos(bmap
,
4059 isl_basic_map_offset(bmap
, type
) + pos
, value
);
4061 isl_basic_map_free(bmap
);
4065 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
4066 enum isl_dim_type type
, unsigned pos
, int value
)
4068 return (struct isl_basic_set
*)
4069 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4073 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
4074 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4076 return (struct isl_basic_set
*)
4077 isl_basic_map_fix((struct isl_basic_map
*)bset
,
4081 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
4082 unsigned input
, int value
)
4084 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
4087 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
4088 unsigned dim
, int value
)
4090 return (struct isl_basic_set
*)
4091 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
4092 isl_dim_set
, dim
, value
);
4095 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
4096 enum isl_dim_type type
, unsigned pos
, int value
)
4100 map
= isl_map_cow(map
);
4104 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4105 for (i
= 0; i
< map
->n
; ++i
) {
4106 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
4110 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4117 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
4118 enum isl_dim_type type
, unsigned pos
, int value
)
4120 return (struct isl_set
*)
4121 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
4124 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
4125 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4129 map
= isl_map_cow(map
);
4133 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4134 for (i
= 0; i
< map
->n
; ++i
) {
4135 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
4139 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4146 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
4147 enum isl_dim_type type
, unsigned pos
, isl_int value
)
4149 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
4152 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
4153 unsigned input
, int value
)
4155 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
4158 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
4160 return (struct isl_set
*)
4161 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
4164 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
4165 __isl_take isl_basic_map
*bmap
,
4166 enum isl_dim_type type
, unsigned pos
, int value
)
4172 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
4173 pos
+= isl_basic_map_offset(bmap
, type
);
4174 bmap
= isl_basic_map_cow(bmap
);
4175 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
4176 j
= isl_basic_map_alloc_inequality(bmap
);
4179 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4180 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
4181 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
4182 bmap
= isl_basic_map_simplify(bmap
);
4183 return isl_basic_map_finalize(bmap
);
4185 isl_basic_map_free(bmap
);
4189 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
4190 unsigned dim
, isl_int value
)
4194 bset
= isl_basic_set_cow(bset
);
4195 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
4196 j
= isl_basic_set_alloc_inequality(bset
);
4199 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
4200 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
4201 isl_int_neg(bset
->ineq
[j
][0], value
);
4202 bset
= isl_basic_set_simplify(bset
);
4203 return isl_basic_set_finalize(bset
);
4205 isl_basic_set_free(bset
);
4209 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
4210 enum isl_dim_type type
, unsigned pos
, int value
)
4214 map
= isl_map_cow(map
);
4218 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
4219 for (i
= 0; i
< map
->n
; ++i
) {
4220 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
4225 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4232 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
4233 enum isl_dim_type type
, unsigned pos
, int value
)
4235 return (struct isl_set
*)
4236 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
4239 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
4244 set
= isl_set_cow(set
);
4248 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
4249 for (i
= 0; i
< set
->n
; ++i
) {
4250 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
4260 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
4264 map
= isl_map_cow(map
);
4268 map
->dim
= isl_dim_reverse(map
->dim
);
4271 for (i
= 0; i
< map
->n
; ++i
) {
4272 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
4276 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4283 static struct isl_map
*isl_basic_map_partial_lexopt(
4284 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4285 struct isl_set
**empty
, int max
)
4289 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
4290 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4292 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4294 isl_basic_map_free(bmap
);
4295 isl_basic_set_free(dom
);
4301 struct isl_map
*isl_basic_map_partial_lexmax(
4302 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4303 struct isl_set
**empty
)
4305 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4308 struct isl_map
*isl_basic_map_partial_lexmin(
4309 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4310 struct isl_set
**empty
)
4312 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4315 struct isl_set
*isl_basic_set_partial_lexmin(
4316 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4317 struct isl_set
**empty
)
4319 return (struct isl_set
*)
4320 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4324 struct isl_set
*isl_basic_set_partial_lexmax(
4325 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4326 struct isl_set
**empty
)
4328 return (struct isl_set
*)
4329 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4333 /* Given a basic map "bmap", compute the lexicograhically minimal
4334 * (or maximal) image element for each domain element in dom.
4335 * Set *empty to those elements in dom that do not have an image element.
4337 * We first make sure the basic sets in dom are disjoint and then
4338 * simply collect the results over each of the basic sets separately.
4339 * We could probably improve the efficiency a bit by moving the union
4340 * domain down into the parametric integer programming.
4342 static __isl_give isl_map
*basic_map_partial_lexopt(
4343 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4344 __isl_give isl_set
**empty
, int max
)
4347 struct isl_map
*res
;
4349 dom
= isl_set_make_disjoint(dom
);
4353 if (isl_set_fast_is_empty(dom
)) {
4354 res
= isl_map_empty_like_basic_map(bmap
);
4355 *empty
= isl_set_empty_like(dom
);
4357 isl_basic_map_free(bmap
);
4361 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4362 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4364 for (i
= 1; i
< dom
->n
; ++i
) {
4365 struct isl_map
*res_i
;
4366 struct isl_set
*empty_i
;
4368 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4369 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4371 res
= isl_map_union_disjoint(res
, res_i
);
4372 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4376 isl_basic_map_free(bmap
);
4381 isl_basic_map_free(bmap
);
4385 /* Given a map "map", compute the lexicograhically minimal
4386 * (or maximal) image element for each domain element in dom.
4387 * Set *empty to those elements in dom that do not have an image element.
4389 * We first compute the lexicographically minimal or maximal element
4390 * in the first basic map. This results in a partial solution "res"
4391 * and a subset "todo" of dom that still need to be handled.
4392 * We then consider each of the remaining maps in "map" and successively
4393 * improve both "res" and "todo".
4395 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4396 * Assume we are computing the lexicographical maximum.
4397 * We first intersect basic map i with a relation that maps elements
4398 * to elements that are lexicographically larger than the image elements
4399 * in res^k and the compute the maximum image element of this intersection.
4400 * The result ("better") corresponds to those image elements in basic map i
4401 * that are better than what we had before. The remainder ("keep") are the
4402 * domain elements for which the image element in res_k was better.
4403 * We also compute the lexicographical maximum of basic map i in todo^k.
4404 * res^i is the result of the operation + better + those elements in
4405 * res^k that we should keep
4406 * todo^i is the remainder of the maximum operation on todo^k.
4408 static __isl_give isl_map
*isl_map_partial_lexopt(
4409 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4410 __isl_give isl_set
**empty
, int max
)
4413 struct isl_map
*res
;
4414 struct isl_set
*todo
;
4419 if (isl_map_fast_is_empty(map
)) {
4427 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4428 isl_set_copy(dom
), &todo
, max
);
4430 for (i
= 1; i
< map
->n
; ++i
) {
4432 struct isl_map
*better
;
4433 struct isl_set
*keep
;
4434 struct isl_map
*res_i
;
4435 struct isl_set
*todo_i
;
4436 struct isl_dim
*dim
= isl_map_get_dim(res
);
4438 dim
= isl_dim_range(dim
);
4440 lt
= isl_map_lex_lt(dim
);
4442 lt
= isl_map_lex_gt(dim
);
4443 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4444 lt
= isl_map_intersect(lt
,
4445 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4446 better
= isl_map_partial_lexopt(lt
,
4447 isl_map_domain(isl_map_copy(res
)),
4450 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4451 todo
, &todo_i
, max
);
4453 res
= isl_map_intersect_domain(res
, keep
);
4454 res
= isl_map_union_disjoint(res
, res_i
);
4455 res
= isl_map_union_disjoint(res
, better
);
4476 __isl_give isl_map
*isl_map_partial_lexmax(
4477 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4478 __isl_give isl_set
**empty
)
4480 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4483 __isl_give isl_map
*isl_map_partial_lexmin(
4484 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4485 __isl_give isl_set
**empty
)
4487 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4490 __isl_give isl_set
*isl_set_partial_lexmin(
4491 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4492 __isl_give isl_set
**empty
)
4494 return (struct isl_set
*)
4495 isl_map_partial_lexmin((struct isl_map
*)set
,
4499 __isl_give isl_set
*isl_set_partial_lexmax(
4500 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4501 __isl_give isl_set
**empty
)
4503 return (struct isl_set
*)
4504 isl_map_partial_lexmax((struct isl_map
*)set
,
4508 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4510 struct isl_basic_set
*dom
= NULL
;
4511 struct isl_dim
*dom_dim
;
4515 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4516 dom
= isl_basic_set_universe(dom_dim
);
4517 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4519 isl_basic_map_free(bmap
);
4523 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4525 return isl_basic_map_lexopt(bmap
, 0);
4528 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4530 return isl_basic_map_lexopt(bmap
, 1);
4533 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4535 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4538 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4540 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4543 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4545 struct isl_set
*dom
= NULL
;
4546 struct isl_dim
*dom_dim
;
4550 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4551 dom
= isl_set_universe(dom_dim
);
4552 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4558 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4560 return isl_map_lexopt(map
, 0);
4563 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4565 return isl_map_lexopt(map
, 1);
4568 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4570 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4573 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4575 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4578 /* Apply a preimage specified by "mat" on the parameters of "bset".
4579 * bset is assumed to have only parameters and divs.
4581 static struct isl_basic_set
*basic_set_parameter_preimage(
4582 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4589 bset
->dim
= isl_dim_cow(bset
->dim
);
4593 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4595 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4597 bset
->dim
->nparam
= 0;
4598 bset
->dim
->n_out
= nparam
;
4599 bset
= isl_basic_set_preimage(bset
, mat
);
4601 bset
->dim
->nparam
= bset
->dim
->n_out
;
4602 bset
->dim
->n_out
= 0;
4607 isl_basic_set_free(bset
);
4611 /* Apply a preimage specified by "mat" on the parameters of "set".
4612 * set is assumed to have only parameters and divs.
4614 static struct isl_set
*set_parameter_preimage(
4615 struct isl_set
*set
, struct isl_mat
*mat
)
4617 struct isl_dim
*dim
= NULL
;
4623 dim
= isl_dim_copy(set
->dim
);
4624 dim
= isl_dim_cow(dim
);
4628 nparam
= isl_set_dim(set
, isl_dim_param
);
4630 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4633 dim
->n_out
= nparam
;
4634 isl_set_reset_dim(set
, dim
);
4635 set
= isl_set_preimage(set
, mat
);
4638 dim
= isl_dim_copy(set
->dim
);
4639 dim
= isl_dim_cow(dim
);
4642 dim
->nparam
= dim
->n_out
;
4644 isl_set_reset_dim(set
, dim
);
4654 /* Intersect the basic set "bset" with the affine space specified by the
4655 * equalities in "eq".
4657 static struct isl_basic_set
*basic_set_append_equalities(
4658 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4666 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4671 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4672 for (i
= 0; i
< eq
->n_row
; ++i
) {
4673 k
= isl_basic_set_alloc_equality(bset
);
4676 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4677 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4681 bset
= isl_basic_set_gauss(bset
, NULL
);
4682 bset
= isl_basic_set_finalize(bset
);
4687 isl_basic_set_free(bset
);
4691 /* Intersect the set "set" with the affine space specified by the
4692 * equalities in "eq".
4694 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4702 for (i
= 0; i
< set
->n
; ++i
) {
4703 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4716 /* Project the given basic set onto its parameter domain, possibly introducing
4717 * new, explicit, existential variables in the constraints.
4718 * The input has parameters and (possibly implicit) existential variables.
4719 * The output has the same parameters, but only
4720 * explicit existentially quantified variables.
4722 * The actual projection is performed by pip, but pip doesn't seem
4723 * to like equalities very much, so we first remove the equalities
4724 * among the parameters by performing a variable compression on
4725 * the parameters. Afterward, an inverse transformation is performed
4726 * and the equalities among the parameters are inserted back in.
4728 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4732 struct isl_mat
*T
, *T2
;
4733 struct isl_set
*set
;
4734 unsigned nparam
, n_div
;
4736 bset
= isl_basic_set_cow(bset
);
4740 if (bset
->n_eq
== 0)
4741 return isl_basic_set_lexmin(bset
);
4743 isl_basic_set_gauss(bset
, NULL
);
4745 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4746 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
4748 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
4749 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
4752 if (i
== bset
->n_eq
)
4753 return isl_basic_set_lexmin(bset
);
4755 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
4757 eq
= isl_mat_cow(eq
);
4758 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
4759 if (T
&& T
->n_col
== 0) {
4763 bset
= isl_basic_set_set_to_empty(bset
);
4764 return isl_set_from_basic_set(bset
);
4766 bset
= basic_set_parameter_preimage(bset
, T
);
4768 set
= isl_basic_set_lexmin(bset
);
4769 set
= set_parameter_preimage(set
, T2
);
4770 set
= set_append_equalities(set
, eq
);
4774 /* Compute an explicit representation for all the existentially
4775 * quantified variables.
4776 * The input and output dimensions are first turned into parameters.
4777 * compute_divs then returns a map with the same parameters and
4778 * no input or output dimensions and the dimension specification
4779 * is reset to that of the input.
4781 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
4783 struct isl_basic_set
*bset
;
4784 struct isl_set
*set
;
4785 struct isl_map
*map
;
4786 struct isl_dim
*dim
, *orig_dim
= NULL
;
4791 bmap
= isl_basic_map_cow(bmap
);
4795 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4796 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4797 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4798 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
4802 orig_dim
= bmap
->dim
;
4804 bset
= (struct isl_basic_set
*)bmap
;
4806 set
= parameter_compute_divs(bset
);
4807 map
= (struct isl_map
*)set
;
4808 map
= isl_map_reset_dim(map
, orig_dim
);
4812 isl_basic_map_free(bmap
);
4816 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
4824 off
= isl_dim_total(bmap
->dim
);
4825 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4826 if (isl_int_is_zero(bmap
->div
[i
][0]))
4828 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
4834 static int map_divs_known(__isl_keep isl_map
*map
)
4841 for (i
= 0; i
< map
->n
; ++i
) {
4842 int known
= basic_map_divs_known(map
->p
[i
]);
4850 /* If bmap contains any unknown divs, then compute explicit
4851 * expressions for them. However, this computation may be
4852 * quite expensive, so first try to remove divs that aren't
4855 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
4859 struct isl_map
*map
;
4861 known
= basic_map_divs_known(bmap
);
4865 return isl_map_from_basic_map(bmap
);
4867 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4869 known
= basic_map_divs_known(bmap
);
4873 return isl_map_from_basic_map(bmap
);
4875 map
= compute_divs(bmap
);
4878 isl_basic_map_free(bmap
);
4882 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
4886 struct isl_map
*res
;
4893 known
= map_divs_known(map
);
4901 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
4902 for (i
= 1 ; i
< map
->n
; ++i
) {
4904 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
4905 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4906 res
= isl_map_union_disjoint(res
, r2
);
4908 res
= isl_map_union(res
, r2
);
4915 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
4917 return (struct isl_set
*)
4918 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
4921 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
4923 return (struct isl_set
*)
4924 isl_map_compute_divs((struct isl_map
*)set
);
4927 struct isl_set
*isl_map_domain(struct isl_map
*map
)
4930 struct isl_set
*set
;
4935 map
= isl_map_cow(map
);
4939 set
= (struct isl_set
*)map
;
4940 set
->dim
= isl_dim_domain(set
->dim
);
4943 for (i
= 0; i
< map
->n
; ++i
) {
4944 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
4948 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4949 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4956 struct isl_map
*isl_map_union_disjoint(
4957 struct isl_map
*map1
, struct isl_map
*map2
)
4961 struct isl_map
*map
= NULL
;
4975 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4977 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
4978 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
4979 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4981 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
4982 map1
->n
+ map2
->n
, flags
);
4985 for (i
= 0; i
< map1
->n
; ++i
) {
4986 map
= isl_map_add_basic_map(map
,
4987 isl_basic_map_copy(map1
->p
[i
]));
4991 for (i
= 0; i
< map2
->n
; ++i
) {
4992 map
= isl_map_add_basic_map(map
,
4993 isl_basic_map_copy(map2
->p
[i
]));
5007 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
5009 map1
= isl_map_union_disjoint(map1
, map2
);
5013 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
5017 struct isl_set
*isl_set_union_disjoint(
5018 struct isl_set
*set1
, struct isl_set
*set2
)
5020 return (struct isl_set
*)
5021 isl_map_union_disjoint(
5022 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
5025 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
5027 return (struct isl_set
*)
5028 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5031 struct isl_map
*isl_map_intersect_range(
5032 struct isl_map
*map
, struct isl_set
*set
)
5035 struct isl_map
*result
;
5041 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
5042 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
5043 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5045 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
5046 map
->n
* set
->n
, flags
);
5049 for (i
= 0; i
< map
->n
; ++i
)
5050 for (j
= 0; j
< set
->n
; ++j
) {
5051 result
= isl_map_add_basic_map(result
,
5052 isl_basic_map_intersect_range(
5053 isl_basic_map_copy(map
->p
[i
]),
5054 isl_basic_set_copy(set
->p
[j
])));
5067 struct isl_map
*isl_map_intersect_domain(
5068 struct isl_map
*map
, struct isl_set
*set
)
5070 return isl_map_reverse(
5071 isl_map_intersect_range(isl_map_reverse(map
), set
));
5074 struct isl_map
*isl_map_apply_domain(
5075 struct isl_map
*map1
, struct isl_map
*map2
)
5079 map1
= isl_map_reverse(map1
);
5080 map1
= isl_map_apply_range(map1
, map2
);
5081 return isl_map_reverse(map1
);
5088 struct isl_map
*isl_map_apply_range(
5089 struct isl_map
*map1
, struct isl_map
*map2
)
5091 struct isl_dim
*dim_result
;
5092 struct isl_map
*result
;
5098 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
5099 isl_dim_copy(map2
->dim
));
5101 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
5104 for (i
= 0; i
< map1
->n
; ++i
)
5105 for (j
= 0; j
< map2
->n
; ++j
) {
5106 result
= isl_map_add_basic_map(result
,
5107 isl_basic_map_apply_range(
5108 isl_basic_map_copy(map1
->p
[i
]),
5109 isl_basic_map_copy(map2
->p
[j
])));
5115 if (result
&& result
->n
<= 1)
5116 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
5125 * returns range - domain
5127 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
5129 isl_dim
*dims
, *target_dim
;
5130 struct isl_basic_set
*bset
;
5137 isl_assert(bmap
->ctx
, isl_dim_tuple_match(bmap
->dim
, isl_dim_in
,
5138 bmap
->dim
, isl_dim_out
),
5140 target_dim
= isl_dim_domain(isl_basic_map_get_dim(bmap
));
5141 dim
= isl_basic_map_n_in(bmap
);
5142 nparam
= isl_basic_map_n_param(bmap
);
5143 bset
= isl_basic_set_from_basic_map(bmap
);
5144 bset
= isl_basic_set_cow(bset
);
5145 dims
= isl_basic_set_get_dim(bset
);
5146 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
5147 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
5148 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
5149 for (i
= 0; i
< dim
; ++i
) {
5150 int j
= isl_basic_map_alloc_equality(
5151 (struct isl_basic_map
*)bset
);
5154 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
5155 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
5156 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
5157 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
5159 bset
= isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
5160 bset
= isl_basic_set_reset_dim(bset
, target_dim
);
5163 isl_basic_map_free(bmap
);
5168 * returns range - domain
5170 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
5174 struct isl_set
*result
;
5179 isl_assert(map
->ctx
, isl_dim_tuple_match(map
->dim
, isl_dim_in
,
5180 map
->dim
, isl_dim_out
),
5182 dim
= isl_map_get_dim(map
);
5183 dim
= isl_dim_domain(dim
);
5184 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
5187 for (i
= 0; i
< map
->n
; ++i
)
5188 result
= isl_set_add_basic_set(result
,
5189 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
5197 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
5199 struct isl_basic_map
*bmap
;
5207 nparam
= dims
->nparam
;
5209 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
5213 for (i
= 0; i
< dim
; ++i
) {
5214 int j
= isl_basic_map_alloc_equality(bmap
);
5217 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
5218 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
5219 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
5221 return isl_basic_map_finalize(bmap
);
5223 isl_basic_map_free(bmap
);
5227 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
5229 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5232 return basic_map_identity(dim
);
5235 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
5237 if (!model
|| !model
->dim
)
5239 isl_assert(model
->ctx
,
5240 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5241 return basic_map_identity(isl_dim_copy(model
->dim
));
5244 static struct isl_map
*map_identity(struct isl_dim
*dim
)
5246 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
5247 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
5250 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
5252 struct isl_dim
*dim
= isl_dim_map(set_dim
);
5255 return map_identity(dim
);
5258 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
5260 if (!model
|| !model
->dim
)
5262 isl_assert(model
->ctx
,
5263 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5264 return map_identity(isl_dim_copy(model
->dim
));
5267 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
5269 if (!model
|| !model
->dim
)
5271 isl_assert(model
->ctx
,
5272 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5273 return map_identity(isl_dim_copy(model
->dim
));
5276 /* Construct a basic set with all set dimensions having only non-negative
5279 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5284 struct isl_basic_set
*bset
;
5288 nparam
= dims
->nparam
;
5290 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5293 for (i
= 0; i
< dim
; ++i
) {
5294 int k
= isl_basic_set_alloc_inequality(bset
);
5297 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5298 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5302 isl_basic_set_free(bset
);
5306 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5307 enum isl_dim_type type
, unsigned first
, unsigned n
)
5310 isl_basic_set
*nonneg
= NULL
;
5311 isl_basic_set
*neg
= NULL
;
5318 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5320 for (i
= 0; i
< n
; ++i
) {
5324 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5325 k
= isl_basic_set_alloc_inequality(nonneg
);
5328 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5329 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5331 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5332 k
= isl_basic_set_alloc_inequality(neg
);
5335 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5336 isl_int_set_si(neg
->ineq
[k
][0], -1);
5337 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5339 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5344 isl_basic_set_free(nonneg
);
5345 isl_basic_set_free(neg
);
5350 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5352 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5355 int isl_basic_map_is_subset(
5356 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5359 struct isl_map
*map1
;
5360 struct isl_map
*map2
;
5362 if (!bmap1
|| !bmap2
)
5365 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5366 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5368 is_subset
= isl_map_is_subset(map1
, map2
);
5376 int isl_basic_map_is_equal(
5377 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5381 if (!bmap1
|| !bmap2
)
5383 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5386 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5390 int isl_basic_set_is_equal(
5391 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5393 return isl_basic_map_is_equal(
5394 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5397 int isl_map_is_empty(struct isl_map
*map
)
5404 for (i
= 0; i
< map
->n
; ++i
) {
5405 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5414 int isl_map_fast_is_empty(struct isl_map
*map
)
5416 return map
? map
->n
== 0 : -1;
5419 int isl_set_fast_is_empty(struct isl_set
*set
)
5421 return set
? set
->n
== 0 : -1;
5424 int isl_set_is_empty(struct isl_set
*set
)
5426 return isl_map_is_empty((struct isl_map
*)set
);
5429 int isl_map_has_equal_dim(__isl_keep isl_map
*map1
, __isl_keep isl_map
*map2
)
5434 return isl_dim_equal(map1
->dim
, map2
->dim
);
5437 int isl_set_has_equal_dim(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5442 return isl_dim_equal(set1
->dim
, set2
->dim
);
5445 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5451 is_subset
= isl_map_is_subset(map1
, map2
);
5454 is_subset
= isl_map_is_subset(map2
, map1
);
5458 int isl_basic_map_is_strict_subset(
5459 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5463 if (!bmap1
|| !bmap2
)
5465 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5468 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5469 if (is_subset
== -1)
5474 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5480 is_subset
= isl_map_is_subset(map1
, map2
);
5483 is_subset
= isl_map_is_subset(map2
, map1
);
5484 if (is_subset
== -1)
5489 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5491 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5494 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5498 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5501 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5505 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5508 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5515 for (i
= 0; i
< map
->n
; ++i
) {
5516 int r
= isl_basic_map_is_universe(map
->p
[i
]);
5524 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5526 return isl_map_fast_is_universe((isl_map
*) set
);
5529 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5531 struct isl_basic_set
*bset
= NULL
;
5532 struct isl_vec
*sample
= NULL
;
5539 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5542 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5543 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5544 copy
= isl_basic_map_remove_redundancies(copy
);
5545 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5546 isl_basic_map_free(copy
);
5550 total
= 1 + isl_basic_map_total_dim(bmap
);
5551 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5552 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5558 isl_vec_free(bmap
->sample
);
5559 bmap
->sample
= NULL
;
5560 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5563 sample
= isl_basic_set_sample_vec(bset
);
5566 empty
= sample
->size
== 0;
5567 isl_vec_free(bmap
->sample
);
5568 bmap
->sample
= sample
;
5570 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5575 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5579 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5582 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5586 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5589 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5591 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5594 struct isl_map
*isl_basic_map_union(
5595 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5597 struct isl_map
*map
;
5598 if (!bmap1
|| !bmap2
)
5601 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5603 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5606 map
= isl_map_add_basic_map(map
, bmap1
);
5607 map
= isl_map_add_basic_map(map
, bmap2
);
5610 isl_basic_map_free(bmap1
);
5611 isl_basic_map_free(bmap2
);
5615 struct isl_set
*isl_basic_set_union(
5616 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5618 return (struct isl_set
*)isl_basic_map_union(
5619 (struct isl_basic_map
*)bset1
,
5620 (struct isl_basic_map
*)bset2
);
5623 /* Order divs such that any div only depends on previous divs */
5624 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5632 off
= isl_dim_total(bmap
->dim
);
5634 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5636 if (isl_int_is_zero(bmap
->div
[i
][0]))
5638 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5642 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5648 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5650 return (struct isl_basic_set
*)
5651 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5654 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5661 for (i
= 0; i
< map
->n
; ++i
) {
5662 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5673 /* Look for a div in dst that corresponds to the div "div" in src.
5674 * The divs before "div" in src and dst are assumed to be the same.
5676 * Returns -1 if no corresponding div was found and the position
5677 * of the corresponding div in dst otherwise.
5679 static int find_div(struct isl_basic_map
*dst
,
5680 struct isl_basic_map
*src
, unsigned div
)
5684 unsigned total
= isl_dim_total(src
->dim
);
5686 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5687 for (i
= div
; i
< dst
->n_div
; ++i
)
5688 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5689 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5690 dst
->n_div
- div
) == -1)
5695 struct isl_basic_map
*isl_basic_map_align_divs(
5696 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5699 unsigned total
= isl_dim_total(src
->dim
);
5704 if (src
->n_div
== 0)
5707 for (i
= 0; i
< src
->n_div
; ++i
)
5708 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5710 src
= isl_basic_map_order_divs(src
);
5711 dst
= isl_basic_map_cow(dst
);
5712 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5713 src
->n_div
, 0, 2 * src
->n_div
);
5716 for (i
= 0; i
< src
->n_div
; ++i
) {
5717 int j
= find_div(dst
, src
, i
);
5719 j
= isl_basic_map_alloc_div(dst
);
5722 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5723 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5724 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5728 isl_basic_map_swap_div(dst
, i
, j
);
5732 isl_basic_map_free(dst
);
5736 struct isl_basic_set
*isl_basic_set_align_divs(
5737 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
5739 return (struct isl_basic_set
*)isl_basic_map_align_divs(
5740 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
5743 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
5751 map
= isl_map_compute_divs(map
);
5752 map
= isl_map_cow(map
);
5756 for (i
= 1; i
< map
->n
; ++i
)
5757 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
5758 for (i
= 1; i
< map
->n
; ++i
)
5759 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
5761 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5765 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
5767 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
5770 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
5774 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
5775 map
= isl_map_intersect_domain(map
, set
);
5776 set
= isl_map_range(map
);
5784 /* There is no need to cow as removing empty parts doesn't change
5785 * the meaning of the set.
5787 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
5794 for (i
= map
->n
-1; i
>= 0; --i
) {
5795 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
5797 isl_basic_map_free(map
->p
[i
]);
5798 if (i
!= map
->n
-1) {
5799 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5800 map
->p
[i
] = map
->p
[map
->n
-1];
5808 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
5810 return (struct isl_set
*)
5811 isl_map_remove_empty_parts((struct isl_map
*)set
);
5814 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
5816 struct isl_basic_map
*bmap
;
5817 if (!map
|| map
->n
== 0)
5819 bmap
= map
->p
[map
->n
-1];
5820 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
5821 return isl_basic_map_copy(bmap
);
5824 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
5826 return (struct isl_basic_set
*)
5827 isl_map_copy_basic_map((struct isl_map
*)set
);
5830 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
5831 __isl_keep isl_basic_map
*bmap
)
5837 for (i
= map
->n
-1; i
>= 0; --i
) {
5838 if (map
->p
[i
] != bmap
)
5840 map
= isl_map_cow(map
);
5843 isl_basic_map_free(map
->p
[i
]);
5844 if (i
!= map
->n
-1) {
5845 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
5846 map
->p
[i
] = map
->p
[map
->n
-1];
5857 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
5858 struct isl_basic_set
*bset
)
5860 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
5861 (struct isl_basic_map
*)bset
);
5864 /* Given two basic sets bset1 and bset2, compute the maximal difference
5865 * between the values of dimension pos in bset1 and those in bset2
5866 * for any common value of the parameters and dimensions preceding pos.
5868 static enum isl_lp_result
basic_set_maximal_difference_at(
5869 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
5870 int pos
, isl_int
*opt
)
5872 struct isl_dim
*dims
;
5873 struct isl_basic_map
*bmap1
= NULL
;
5874 struct isl_basic_map
*bmap2
= NULL
;
5875 struct isl_ctx
*ctx
;
5876 struct isl_vec
*obj
;
5879 unsigned dim1
, dim2
;
5880 enum isl_lp_result res
;
5882 if (!bset1
|| !bset2
)
5883 return isl_lp_error
;
5885 nparam
= isl_basic_set_n_param(bset1
);
5886 dim1
= isl_basic_set_n_dim(bset1
);
5887 dim2
= isl_basic_set_n_dim(bset2
);
5888 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
5889 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
5890 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
5891 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
5892 if (!bmap1
|| !bmap2
)
5894 bmap1
= isl_basic_map_cow(bmap1
);
5895 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
5896 pos
, (dim1
- pos
) + (dim2
- pos
),
5897 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
5898 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
5901 total
= isl_basic_map_total_dim(bmap1
);
5903 obj
= isl_vec_alloc(ctx
, 1 + total
);
5904 isl_seq_clr(obj
->block
.data
, 1 + total
);
5905 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
5906 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
5909 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
5911 isl_basic_map_free(bmap1
);
5915 isl_basic_map_free(bmap1
);
5916 isl_basic_map_free(bmap2
);
5917 return isl_lp_error
;
5920 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5921 * for any common value of the parameters and dimensions preceding pos
5922 * in both basic sets, the values of dimension pos in bset1 are
5923 * smaller or larger than those in bset2.
5926 * 1 if bset1 follows bset2
5927 * -1 if bset1 precedes bset2
5928 * 0 if bset1 and bset2 are incomparable
5929 * -2 if some error occurred.
5931 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
5932 struct isl_basic_set
*bset2
, int pos
)
5935 enum isl_lp_result res
;
5940 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5942 if (res
== isl_lp_empty
)
5944 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5945 res
== isl_lp_unbounded
)
5947 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5956 /* Given two basic sets bset1 and bset2, check whether
5957 * for any common value of the parameters and dimensions preceding pos
5958 * there is a value of dimension pos in bset1 that is larger
5959 * than a value of the same dimension in bset2.
5962 * 1 if there exists such a pair
5963 * 0 if there is no such pair, but there is a pair of equal values
5965 * -2 if some error occurred.
5967 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
5968 __isl_keep isl_basic_set
*bset2
, int pos
)
5971 enum isl_lp_result res
;
5976 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5978 if (res
== isl_lp_empty
)
5980 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5981 res
== isl_lp_unbounded
)
5983 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5985 else if (res
== isl_lp_ok
)
5994 /* Given two sets set1 and set2, check whether
5995 * for any common value of the parameters and dimensions preceding pos
5996 * there is a value of dimension pos in set1 that is larger
5997 * than a value of the same dimension in set2.
6000 * 1 if there exists such a pair
6001 * 0 if there is no such pair, but there is a pair of equal values
6003 * -2 if some error occurred.
6005 int isl_set_follows_at(__isl_keep isl_set
*set1
,
6006 __isl_keep isl_set
*set2
, int pos
)
6014 for (i
= 0; i
< set1
->n
; ++i
)
6015 for (j
= 0; j
< set2
->n
; ++j
) {
6017 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
6018 if (f
== 1 || f
== -2)
6027 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
6028 unsigned pos
, isl_int
*val
)
6036 total
= isl_basic_map_total_dim(bmap
);
6037 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
6038 for (; d
+1 > pos
; --d
)
6039 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
6043 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
6045 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
6047 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
6050 isl_int_neg(*val
, bmap
->eq
[i
][0]);
6056 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
6057 unsigned pos
, isl_int
*val
)
6069 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
6072 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
6073 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
6074 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
6075 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6079 isl_int_set(*val
, v
);
6085 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
6086 unsigned pos
, isl_int
*val
)
6088 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
6092 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
6095 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
6098 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
6099 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6101 if (pos
>= isl_basic_map_dim(bmap
, type
))
6103 return isl_basic_map_fast_has_fixed_var(bmap
,
6104 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
6107 int isl_map_fast_is_fixed(struct isl_map
*map
,
6108 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
6110 if (pos
>= isl_map_dim(map
, type
))
6112 return isl_map_fast_has_fixed_var(map
,
6113 map_offset(map
, type
) - 1 + pos
, val
);
6116 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6117 * then return this fixed value in *val.
6119 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
6122 return isl_basic_set_fast_has_fixed_var(bset
,
6123 isl_basic_set_n_param(bset
) + dim
, val
);
6126 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6127 * then return this fixed value in *val.
6129 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
6131 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
6134 /* Check if input variable in has fixed value and if so and if val is not NULL,
6135 * then return this fixed value in *val.
6137 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
6139 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
6142 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6143 * and if val is not NULL, then return this lower bound in *val.
6145 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
6146 unsigned dim
, isl_int
*val
)
6148 int i
, i_eq
= -1, i_ineq
= -1;
6155 total
= isl_basic_set_total_dim(bset
);
6156 nparam
= isl_basic_set_n_param(bset
);
6157 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6158 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
6164 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6165 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
6167 if (i_eq
!= -1 || i_ineq
!= -1)
6171 if (i_eq
== -1 && i_ineq
== -1)
6173 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
6174 /* The coefficient should always be one due to normalization. */
6175 if (!isl_int_is_one(c
[1+nparam
+dim
]))
6177 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
6179 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
6180 total
- nparam
- dim
- 1) != -1)
6183 isl_int_neg(*val
, c
[0]);
6187 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
6188 unsigned dim
, isl_int
*val
)
6200 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6204 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
6206 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
6207 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
6209 if (fixed
== 1 && isl_int_ne(tmp
, v
))
6213 isl_int_set(*val
, v
);
6224 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
6226 const struct constraint
*c1
= (const struct constraint
*)p1
;
6227 const struct constraint
*c2
= (const struct constraint
*)p2
;
6228 unsigned size
= isl_min(c1
->size
, c2
->size
);
6229 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
6232 static struct isl_basic_map
*isl_basic_map_sort_constraints(
6233 struct isl_basic_map
*bmap
)
6236 struct constraint
*c
;
6241 total
= isl_basic_map_total_dim(bmap
);
6242 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
6245 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6247 c
[i
].c
= bmap
->ineq
[i
];
6249 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
6250 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
6251 bmap
->ineq
[i
] = c
[i
].c
;
6255 isl_basic_map_free(bmap
);
6259 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
6260 __isl_take isl_basic_set
*bset
)
6262 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
6263 (struct isl_basic_map
*)bset
);
6266 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
6270 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
6272 bmap
= isl_basic_map_remove_redundancies(bmap
);
6273 bmap
= isl_basic_map_sort_constraints(bmap
);
6274 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
6278 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
6280 return (struct isl_basic_set
*)isl_basic_map_normalize(
6281 (struct isl_basic_map
*)bset
);
6284 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map
*bmap1
,
6285 const __isl_keep isl_basic_map
*bmap2
)
6292 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
6293 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
6294 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
6295 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6296 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
6297 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
6298 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6299 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6301 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6303 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6305 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6306 return bmap1
->n_eq
- bmap2
->n_eq
;
6307 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6308 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6309 if (bmap1
->n_div
!= bmap2
->n_div
)
6310 return bmap1
->n_div
- bmap2
->n_div
;
6311 total
= isl_basic_map_total_dim(bmap1
);
6312 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6313 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6317 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6318 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6322 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6323 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6330 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map
*bmap1
,
6331 __isl_keep isl_basic_map
*bmap2
)
6333 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6336 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6337 __isl_keep isl_basic_set
*bset2
)
6339 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6340 (isl_basic_map
*)bset2
);
6343 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6345 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6346 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6348 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6351 /* We normalize in place, but if anything goes wrong we need
6352 * to return NULL, so we need to make sure we don't change the
6353 * meaning of any possible other copies of map.
6355 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6358 struct isl_basic_map
*bmap
;
6362 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6364 for (i
= 0; i
< map
->n
; ++i
) {
6365 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6368 isl_basic_map_free(map
->p
[i
]);
6371 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6372 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6373 map
= isl_map_remove_empty_parts(map
);
6376 for (i
= map
->n
- 1; i
>= 1; --i
) {
6377 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6379 isl_basic_map_free(map
->p
[i
-1]);
6380 for (j
= i
; j
< map
->n
; ++j
)
6381 map
->p
[j
-1] = map
->p
[j
];
6391 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6393 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6396 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6406 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6409 map1
= isl_map_copy(map1
);
6410 map2
= isl_map_copy(map2
);
6411 map1
= isl_map_normalize(map1
);
6412 map2
= isl_map_normalize(map2
);
6415 equal
= map1
->n
== map2
->n
;
6416 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6417 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6430 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6432 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6433 (struct isl_map
*)set2
);
6436 /* Return an interval that ranges from min to max (inclusive)
6438 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6439 isl_int min
, isl_int max
)
6442 struct isl_basic_set
*bset
= NULL
;
6444 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6448 k
= isl_basic_set_alloc_inequality(bset
);
6451 isl_int_set_si(bset
->ineq
[k
][1], 1);
6452 isl_int_neg(bset
->ineq
[k
][0], min
);
6454 k
= isl_basic_set_alloc_inequality(bset
);
6457 isl_int_set_si(bset
->ineq
[k
][1], -1);
6458 isl_int_set(bset
->ineq
[k
][0], max
);
6462 isl_basic_set_free(bset
);
6466 /* Return the Cartesian product of the basic sets in list (in the given order).
6468 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6476 struct isl_basic_set
*product
= NULL
;
6480 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6481 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6482 nparam
= isl_basic_set_n_param(list
->p
[0]);
6483 dim
= isl_basic_set_n_dim(list
->p
[0]);
6484 extra
= list
->p
[0]->n_div
;
6485 n_eq
= list
->p
[0]->n_eq
;
6486 n_ineq
= list
->p
[0]->n_ineq
;
6487 for (i
= 1; i
< list
->n
; ++i
) {
6488 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6489 isl_assert(list
->ctx
,
6490 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6491 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6492 extra
+= list
->p
[i
]->n_div
;
6493 n_eq
+= list
->p
[i
]->n_eq
;
6494 n_ineq
+= list
->p
[i
]->n_ineq
;
6496 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6501 for (i
= 0; i
< list
->n
; ++i
) {
6502 isl_basic_set_add_constraints(product
,
6503 isl_basic_set_copy(list
->p
[i
]), dim
);
6504 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6506 isl_basic_set_list_free(list
);
6509 isl_basic_set_free(product
);
6510 isl_basic_set_list_free(list
);
6514 struct isl_basic_map
*isl_basic_map_product(
6515 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6517 struct isl_dim
*dim_result
= NULL
;
6518 struct isl_basic_map
*bmap
;
6519 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6520 struct isl_dim_map
*dim_map1
, *dim_map2
;
6522 if (!bmap1
|| !bmap2
)
6525 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6526 bmap2
->dim
, isl_dim_param
), goto error
);
6527 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6528 isl_dim_copy(bmap2
->dim
));
6530 in1
= isl_basic_map_n_in(bmap1
);
6531 in2
= isl_basic_map_n_in(bmap2
);
6532 out1
= isl_basic_map_n_out(bmap1
);
6533 out2
= isl_basic_map_n_out(bmap2
);
6534 nparam
= isl_basic_map_n_param(bmap1
);
6536 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6537 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6538 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6539 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6540 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6541 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6542 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6543 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6544 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6545 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6546 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6548 bmap
= isl_basic_map_alloc_dim(dim_result
,
6549 bmap1
->n_div
+ bmap2
->n_div
,
6550 bmap1
->n_eq
+ bmap2
->n_eq
,
6551 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6552 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6553 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6554 bmap
= isl_basic_map_simplify(bmap
);
6555 return isl_basic_map_finalize(bmap
);
6557 isl_basic_map_free(bmap1
);
6558 isl_basic_map_free(bmap2
);
6562 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6564 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6567 struct isl_map
*result
;
6573 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6574 map2
->dim
, isl_dim_param
), goto error
);
6576 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6577 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6578 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6580 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6581 isl_dim_copy(map2
->dim
)),
6582 map1
->n
* map2
->n
, flags
);
6585 for (i
= 0; i
< map1
->n
; ++i
)
6586 for (j
= 0; j
< map2
->n
; ++j
) {
6587 struct isl_basic_map
*part
;
6588 part
= isl_basic_map_product(
6589 isl_basic_map_copy(map1
->p
[i
]),
6590 isl_basic_map_copy(map2
->p
[j
]));
6591 if (isl_basic_map_is_empty(part
))
6592 isl_basic_map_free(part
);
6594 result
= isl_map_add_basic_map(result
, part
);
6607 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6609 __isl_give isl_map
*isl_map_flat_product(__isl_take isl_map
*map1
,
6610 __isl_take isl_map
*map2
)
6614 prod
= isl_map_product(map1
, map2
);
6615 prod
= isl_map_flatten(prod
);
6619 /* Given two set A and B, construct its Cartesian product A x B.
6621 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6623 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6624 (struct isl_map
*)set2
);
6627 __isl_give isl_set
*isl_set_flat_product(__isl_take isl_set
*set1
,
6628 __isl_take isl_set
*set2
)
6630 return (isl_set
*)isl_map_flat_product((isl_map
*)set1
, (isl_map
*)set2
);
6633 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6636 uint32_t hash
= isl_hash_init();
6641 bset
= isl_basic_set_copy(bset
);
6642 bset
= isl_basic_set_normalize(bset
);
6645 total
= isl_basic_set_total_dim(bset
);
6646 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6647 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6649 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6650 isl_hash_hash(hash
, c_hash
);
6652 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6653 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6655 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6656 isl_hash_hash(hash
, c_hash
);
6658 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6659 for (i
= 0; i
< bset
->n_div
; ++i
) {
6661 if (isl_int_is_zero(bset
->div
[i
][0]))
6663 isl_hash_byte(hash
, i
& 0xFF);
6664 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6665 isl_hash_hash(hash
, c_hash
);
6667 isl_basic_set_free(bset
);
6671 uint32_t isl_set_get_hash(struct isl_set
*set
)
6678 set
= isl_set_copy(set
);
6679 set
= isl_set_normalize(set
);
6683 hash
= isl_hash_init();
6684 for (i
= 0; i
< set
->n
; ++i
) {
6686 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6687 isl_hash_hash(hash
, bset_hash
);
6695 /* Check if the value for dimension dim is completely determined
6696 * by the values of the other parameters and variables.
6697 * That is, check if dimension dim is involved in an equality.
6699 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6706 nparam
= isl_basic_set_n_param(bset
);
6707 for (i
= 0; i
< bset
->n_eq
; ++i
)
6708 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6713 /* Check if the value for dimension dim is completely determined
6714 * by the values of the other parameters and variables.
6715 * That is, check if dimension dim is involved in an equality
6716 * for each of the subsets.
6718 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6724 for (i
= 0; i
< set
->n
; ++i
) {
6726 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6733 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
6734 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
6741 for (i
= 0; i
< map
->n
; ++i
)
6742 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
6748 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
6749 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
6756 for (i
= 0; i
< set
->n
; ++i
)
6757 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
6763 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
6765 struct isl_dim
*dim
;
6770 if (bset
->n_div
== 0)
6773 bset
= isl_basic_set_cow(bset
);
6777 dim
= isl_basic_set_get_dim(bset
);
6778 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
6781 isl_dim_free(bset
->dim
);
6785 bset
= isl_basic_set_finalize(bset
);
6789 isl_basic_set_free(bset
);
6793 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
6796 struct isl_dim
*dim
;
6799 set
= isl_set_align_divs(set
);
6803 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
6806 set
= isl_set_cow(set
);
6810 n_div
= set
->p
[0]->n_div
;
6811 dim
= isl_set_get_dim(set
);
6812 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
6815 isl_dim_free(set
->dim
);
6818 for (i
= 0; i
< set
->n
; ++i
) {
6819 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
6830 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
6832 struct isl_dim
*dim
;
6833 struct isl_basic_map
*bmap
;
6840 set
= isl_set_align_divs(set
);
6845 dim
= isl_set_get_dim(set
);
6846 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
6848 return isl_map_identity(dim
);
6851 n_div
= set
->p
[0]->n_div
;
6852 dim
= isl_dim_map(dim
);
6853 n_param
= isl_dim_size(dim
, isl_dim_param
);
6854 n_set
= isl_dim_size(dim
, isl_dim_in
);
6855 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
6856 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
6857 for (i
= 0; i
< n_set
; ++i
)
6858 bmap
= var_equal(bmap
, i
);
6860 total
= n_param
+ n_set
+ n_set
+ n_div
;
6861 for (i
= 0; i
< n_div
; ++i
) {
6862 k
= isl_basic_map_alloc_inequality(bmap
);
6865 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
6866 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
6867 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
6868 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
6869 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
6870 set
->p
[0]->div
[i
][0]);
6872 l
= isl_basic_map_alloc_inequality(bmap
);
6875 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
6876 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
6877 set
->p
[0]->div
[i
][0]);
6878 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
6882 return isl_map_from_basic_map(bmap
);
6885 isl_basic_map_free(bmap
);
6889 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
6897 dim
= isl_basic_set_total_dim(bset
);
6898 size
+= bset
->n_eq
* (1 + dim
);
6899 size
+= bset
->n_ineq
* (1 + dim
);
6900 size
+= bset
->n_div
* (2 + dim
);
6905 int isl_set_size(__isl_keep isl_set
*set
)
6913 for (i
= 0; i
< set
->n
; ++i
)
6914 size
+= isl_basic_set_size(set
->p
[i
]);
6919 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
6920 enum isl_dim_type type
, unsigned pos
)
6928 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
6930 pos
+= isl_basic_map_offset(bmap
, type
);
6932 for (i
= 0; i
< bmap
->n_eq
; ++i
)
6933 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
6937 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6938 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
6945 return lower
&& upper
;
6948 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
6949 enum isl_dim_type type
, unsigned pos
)
6956 for (i
= 0; i
< map
->n
; ++i
) {
6958 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
6959 if (bounded
< 0 || !bounded
)
6966 /* Return 1 if the specified dim is involved in both an upper bound
6967 * and a lower bound.
6969 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
6970 enum isl_dim_type type
, unsigned pos
)
6972 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
6975 /* For each of the "n" variables starting at "first", determine
6976 * the sign of the variable and put the results in the first "n"
6977 * elements of the array "signs".
6979 * 1 means that the variable is non-negative
6980 * -1 means that the variable is non-positive
6981 * 0 means the variable attains both positive and negative values.
6983 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
6984 unsigned first
, unsigned n
, int *signs
)
6986 isl_vec
*bound
= NULL
;
6987 struct isl_tab
*tab
= NULL
;
6988 struct isl_tab_undo
*snap
;
6991 if (!bset
|| !signs
)
6994 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
6995 tab
= isl_tab_from_basic_set(bset
);
6999 isl_seq_clr(bound
->el
, bound
->size
);
7000 isl_int_set_si(bound
->el
[0], -1);
7002 snap
= isl_tab_snap(tab
);
7003 for (i
= 0; i
< n
; ++i
) {
7006 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
7007 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7010 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7011 if (isl_tab_rollback(tab
, snap
) < 0)
7019 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
7020 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
7023 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
7024 if (isl_tab_rollback(tab
, snap
) < 0)
7027 signs
[i
] = empty
? -1 : 0;
7031 isl_vec_free(bound
);
7035 isl_vec_free(bound
);
7039 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
7040 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
7042 if (!bset
|| !signs
)
7044 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
7047 first
+= pos(bset
->dim
, type
) - 1;
7048 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
7051 /* Check if the given map is single-valued.
7056 * and check if the result is a subset of the identity mapping.
7058 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
7064 test
= isl_map_reverse(isl_map_copy(map
));
7065 test
= isl_map_apply_range(test
, isl_map_copy(map
));
7067 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
7069 sv
= isl_map_is_subset(test
, id
);
7077 int isl_map_is_bijective(__isl_keep isl_map
*map
)
7081 sv
= isl_map_is_single_valued(map
);
7085 map
= isl_map_copy(map
);
7086 map
= isl_map_reverse(map
);
7087 sv
= isl_map_is_single_valued(map
);
7093 int isl_set_is_singleton(__isl_keep isl_set
*set
)
7095 return isl_map_is_single_valued((isl_map
*)set
);
7098 int isl_map_is_translation(__isl_keep isl_map
*map
)
7103 delta
= isl_map_deltas(isl_map_copy(map
));
7104 ok
= isl_set_is_singleton(delta
);
7105 isl_set_free(delta
);
7110 static int unique(isl_int
*p
, unsigned pos
, unsigned len
)
7112 if (isl_seq_first_non_zero(p
, pos
) != -1)
7114 if (isl_seq_first_non_zero(p
+ pos
+ 1, len
- pos
- 1) != -1)
7119 int isl_basic_set_is_box(__isl_keep isl_basic_set
*bset
)
7128 if (isl_basic_set_dim(bset
, isl_dim_div
) != 0)
7131 nvar
= isl_basic_set_dim(bset
, isl_dim_set
);
7132 ovar
= isl_dim_offset(bset
->dim
, isl_dim_set
);
7133 for (j
= 0; j
< nvar
; ++j
) {
7134 int lower
= 0, upper
= 0;
7135 for (i
= 0; i
< bset
->n_eq
; ++i
) {
7136 if (isl_int_is_zero(bset
->eq
[i
][1 + ovar
+ j
]))
7138 if (!unique(bset
->eq
[i
] + 1 + ovar
, j
, nvar
))
7144 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
7145 if (isl_int_is_zero(bset
->ineq
[i
][1 + ovar
+ j
]))
7147 if (!unique(bset
->ineq
[i
] + 1 + ovar
, j
, nvar
))
7149 if (isl_int_is_pos(bset
->ineq
[i
][1 + ovar
+ j
]))
7154 if (!lower
|| !upper
)
7161 int isl_set_is_box(__isl_keep isl_set
*set
)
7168 return isl_basic_set_is_box(set
->p
[0]);
7171 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set
*bset
)
7176 return isl_dim_is_wrapping(bset
->dim
);
7179 int isl_set_is_wrapping(__isl_keep isl_set
*set
)
7184 return isl_dim_is_wrapping(set
->dim
);
7187 __isl_give isl_basic_set
*isl_basic_map_wrap(__isl_take isl_basic_map
*bmap
)
7189 bmap
= isl_basic_map_cow(bmap
);
7193 bmap
->dim
= isl_dim_wrap(bmap
->dim
);
7197 bmap
= isl_basic_map_finalize(bmap
);
7199 return (isl_basic_set
*)bmap
;
7201 isl_basic_map_free(bmap
);
7205 __isl_give isl_set
*isl_map_wrap(__isl_take isl_map
*map
)
7209 map
= isl_map_cow(map
);
7213 for (i
= 0; i
< map
->n
; ++i
) {
7214 map
->p
[i
] = (isl_basic_map
*)isl_basic_map_wrap(map
->p
[i
]);
7218 map
->dim
= isl_dim_wrap(map
->dim
);
7222 return (isl_set
*)map
;
7228 __isl_give isl_basic_map
*isl_basic_set_unwrap(__isl_take isl_basic_set
*bset
)
7230 bset
= isl_basic_set_cow(bset
);
7234 bset
->dim
= isl_dim_unwrap(bset
->dim
);
7238 bset
= isl_basic_set_finalize(bset
);
7240 return (isl_basic_map
*)bset
;
7242 isl_basic_set_free(bset
);
7246 __isl_give isl_map
*isl_set_unwrap(__isl_take isl_set
*set
)
7253 if (!isl_set_is_wrapping(set
))
7254 isl_die(set
->ctx
, isl_error_invalid
, "not a wrapping set",
7257 set
= isl_set_cow(set
);
7261 for (i
= 0; i
< set
->n
; ++i
) {
7262 set
->p
[i
] = (isl_basic_set
*)isl_basic_set_unwrap(set
->p
[i
]);
7267 set
->dim
= isl_dim_unwrap(set
->dim
);
7271 return (isl_map
*)set
;
7277 __isl_give isl_basic_map
*isl_basic_map_reset(__isl_take isl_basic_map
*bmap
,
7278 enum isl_dim_type type
)
7283 if (!isl_dim_is_named_or_nested(bmap
->dim
, type
))
7286 bmap
= isl_basic_map_cow(bmap
);
7290 bmap
->dim
= isl_dim_reset(bmap
->dim
, type
);
7294 bmap
= isl_basic_map_finalize(bmap
);
7298 isl_basic_map_free(bmap
);
7302 __isl_give isl_map
*isl_map_reset(__isl_take isl_map
*map
,
7303 enum isl_dim_type type
)
7310 if (!isl_dim_is_named_or_nested(map
->dim
, type
))
7313 map
= isl_map_cow(map
);
7317 for (i
= 0; i
< map
->n
; ++i
) {
7318 map
->p
[i
] = isl_basic_map_reset(map
->p
[i
], type
);
7322 map
->dim
= isl_dim_reset(map
->dim
, type
);
7332 __isl_give isl_basic_map
*isl_basic_map_flatten(__isl_take isl_basic_map
*bmap
)
7337 if (!bmap
->dim
->nested
[0] && !bmap
->dim
->nested
[1])
7340 bmap
= isl_basic_map_cow(bmap
);
7344 bmap
->dim
= isl_dim_flatten(bmap
->dim
);
7348 bmap
= isl_basic_map_finalize(bmap
);
7352 isl_basic_map_free(bmap
);
7356 __isl_give isl_map
*isl_map_flatten(__isl_take isl_map
*map
)
7363 if (!map
->dim
->nested
[0] && !map
->dim
->nested
[1])
7366 map
= isl_map_cow(map
);
7370 for (i
= 0; i
< map
->n
; ++i
) {
7371 map
->p
[i
] = isl_basic_map_flatten(map
->p
[i
]);
7375 map
->dim
= isl_dim_flatten(map
->dim
);
7385 /* Extend the given dim_map with mappings for the divs in bmap.
7387 static __isl_give
struct isl_dim_map
*extend_dim_map(
7388 __isl_keep
struct isl_dim_map
*dim_map
,
7389 __isl_keep isl_basic_map
*bmap
)
7392 struct isl_dim_map
*res
;
7395 offset
= isl_basic_map_offset(bmap
, isl_dim_div
);
7397 res
= isl_dim_map_alloc(bmap
->ctx
, dim_map
->len
- 1 + bmap
->n_div
);
7401 for (i
= 0; i
< dim_map
->len
; ++i
)
7402 res
->pos
[i
] = dim_map
->pos
[i
];
7403 for (i
= 0; i
< bmap
->n_div
; ++i
)
7404 res
->pos
[dim_map
->len
+ i
] = offset
+ i
;
7409 /* Extract a dim_map from a reordering.
7410 * We essentially need to reverse the mapping, and add an offset
7411 * of 1 for the constant term.
7413 __isl_give
struct isl_dim_map
*isl_dim_map_from_reordering(
7414 __isl_keep isl_reordering
*exp
)
7417 struct isl_dim_map
*dim_map
;
7422 dim_map
= isl_dim_map_alloc(exp
->dim
->ctx
, isl_dim_total(exp
->dim
));
7426 for (i
= 0; i
< exp
->len
; ++i
)
7427 dim_map
->pos
[1 + exp
->pos
[i
]] = 1 + i
;
7432 /* Reorder the dimensions of "bmap" according to the given dim_map
7433 * and set the dimension specification to "dim".
7435 __isl_give isl_basic_map
*isl_basic_map_realign(__isl_take isl_basic_map
*bmap
,
7436 __isl_take isl_dim
*dim
, __isl_take
struct isl_dim_map
*dim_map
)
7440 bmap
= isl_basic_map_cow(bmap
);
7441 if (!bmap
|| !dim
|| !dim_map
)
7444 res
= isl_basic_map_alloc_dim(dim
,
7445 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
7446 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
7447 res
= isl_basic_map_finalize(res
);
7451 isl_basic_map_free(bmap
);
7456 /* Reorder the dimensions of "map" according to given reordering.
7458 __isl_give isl_map
*isl_map_realign(__isl_take isl_map
*map
,
7459 __isl_take isl_reordering
*r
)
7462 struct isl_dim_map
*dim_map
;
7464 map
= isl_map_cow(map
);
7465 dim_map
= isl_dim_map_from_reordering(r
);
7466 if (!map
|| !r
|| !dim_map
)
7469 for (i
= 0; i
< map
->n
; ++i
) {
7470 struct isl_dim_map
*dim_map_i
;
7472 dim_map_i
= extend_dim_map(dim_map
, map
->p
[i
]);
7474 map
->p
[i
] = isl_basic_map_realign(map
->p
[i
],
7475 isl_dim_copy(r
->dim
), dim_map_i
);
7481 map
= isl_map_reset_dim(map
, isl_dim_copy(r
->dim
));
7483 isl_reordering_free(r
);
7489 isl_reordering_free(r
);
7493 __isl_give isl_set
*isl_set_realign(__isl_take isl_set
*set
,
7494 __isl_take isl_reordering
*r
)
7496 return (isl_set
*)isl_map_realign((isl_map
*)set
, r
);