2 * Copyright 2008-2009 Katholieke Universiteit Leuven
4 * Use of this software is governed by the GNU LGPLv2.1 license
6 * Written by Sven Verdoolaege, K.U.Leuven, Departement
7 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
15 #include "isl_equalities.h"
21 #include "isl_map_private.h"
22 #include "isl_map_piplib.h"
23 #include "isl_sample.h"
27 /* Maps dst positions to src positions */
33 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
36 struct isl_dim_map
*dim_map
;
37 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
38 sizeof(struct isl_dim_map
) + len
* sizeof(int));
41 dim_map
->len
= 1 + len
;
43 for (i
= 0; i
< len
; ++i
)
44 dim_map
->pos
[1 + i
] = -1;
48 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
51 case isl_dim_param
: return dim
->nparam
;
52 case isl_dim_in
: return dim
->n_in
;
53 case isl_dim_out
: return dim
->n_out
;
54 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
58 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
61 case isl_dim_param
: return 1;
62 case isl_dim_in
: return 1 + dim
->nparam
;
63 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
67 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
68 enum isl_dim_type type
, unsigned dst_pos
)
76 src_pos
= pos(dim
, type
);
77 for (i
= 0; i
< n(dim
, type
); ++i
)
78 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
81 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
82 struct isl_basic_map
*bmap
, unsigned dst_pos
)
87 if (!dim_map
|| !bmap
)
90 src_pos
= 1 + isl_dim_total(bmap
->dim
);
91 for (i
= 0; i
< bmap
->n_div
; ++i
)
92 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
95 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
99 for (i
= 0; i
< dim_map
->len
; ++i
)
100 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
101 fprintf(stderr
, "\n");
104 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
105 enum isl_dim_type type
)
110 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
111 case isl_dim_div
: return bmap
->n_div
;
112 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
116 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
118 return n(map
->dim
, type
);
121 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
123 return n(set
->dim
, type
);
126 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
127 enum isl_dim_type type
)
129 struct isl_dim
*dim
= bmap
->dim
;
131 case isl_dim_param
: return 1;
132 case isl_dim_in
: return 1 + dim
->nparam
;
133 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
134 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
138 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
140 return pos(map
->dim
, type
);
143 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
144 enum isl_dim_type type
)
146 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
149 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
151 return bset
->dim
->n_out
;
154 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
156 return bset
->dim
->nparam
;
159 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
161 return isl_dim_total(bset
->dim
) + bset
->n_div
;
164 unsigned isl_set_n_dim(const struct isl_set
*set
)
166 return set
->dim
->n_out
;
169 unsigned isl_set_n_param(const struct isl_set
*set
)
171 return set
->dim
->nparam
;
174 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
176 return bmap
->dim
->n_in
;
179 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
181 return bmap
->dim
->n_out
;
184 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
186 return bmap
->dim
->nparam
;
189 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
194 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
196 return isl_dim_total(bmap
->dim
) + bmap
->n_div
;
199 unsigned isl_map_n_in(const struct isl_map
*map
)
201 return map
->dim
->n_in
;
204 unsigned isl_map_n_out(const struct isl_map
*map
)
206 return map
->dim
->n_out
;
209 unsigned isl_map_n_param(const struct isl_map
*map
)
211 return map
->dim
->nparam
;
214 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
216 return map
->dim
->n_in
== set
->dim
->n_out
&&
217 map
->dim
->nparam
== set
->dim
->nparam
;
220 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
221 struct isl_basic_set
*bset
)
223 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
224 bmap
->dim
->nparam
== bset
->dim
->nparam
;
227 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
228 struct isl_basic_set
*bset
)
230 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
231 bmap
->dim
->nparam
== bset
->dim
->nparam
;
234 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
238 return isl_dim_copy(bmap
->dim
);
241 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
245 return isl_dim_copy(bset
->dim
);
248 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
252 return isl_dim_copy(map
->dim
);
255 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
259 return isl_dim_copy(set
->dim
);
262 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
263 struct isl_basic_map
*bmap
, unsigned extra
,
264 unsigned n_eq
, unsigned n_ineq
)
267 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
269 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
270 if (isl_blk_is_error(bmap
->block
)) {
275 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
277 isl_blk_free(ctx
, bmap
->block
);
283 bmap
->block2
= isl_blk_empty();
286 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
287 if (isl_blk_is_error(bmap
->block2
)) {
289 isl_blk_free(ctx
, bmap
->block
);
294 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
296 isl_blk_free(ctx
, bmap
->block2
);
298 isl_blk_free(ctx
, bmap
->block
);
304 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
305 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
307 for (i
= 0; i
< extra
; ++i
)
308 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
314 bmap
->c_size
= n_eq
+ n_ineq
;
315 bmap
->eq
= bmap
->ineq
+ n_ineq
;
324 isl_basic_map_free(bmap
);
328 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
329 unsigned nparam
, unsigned dim
, unsigned extra
,
330 unsigned n_eq
, unsigned n_ineq
)
332 struct isl_basic_map
*bmap
;
333 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
334 return (struct isl_basic_set
*)bmap
;
337 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
338 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
340 struct isl_basic_map
*bmap
;
343 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
344 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
345 return (struct isl_basic_set
*)bmap
;
348 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
349 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
351 struct isl_basic_map
*bmap
;
355 bmap
= isl_alloc_type(dim
->ctx
, struct isl_basic_map
);
360 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
366 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
367 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
368 unsigned n_eq
, unsigned n_ineq
)
370 struct isl_basic_map
*bmap
;
373 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
377 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
381 static void dup_constraints(
382 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
385 unsigned total
= isl_basic_map_total_dim(src
);
387 for (i
= 0; i
< src
->n_eq
; ++i
) {
388 int j
= isl_basic_map_alloc_equality(dst
);
389 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
392 for (i
= 0; i
< src
->n_ineq
; ++i
) {
393 int j
= isl_basic_map_alloc_inequality(dst
);
394 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
397 for (i
= 0; i
< src
->n_div
; ++i
) {
398 int j
= isl_basic_map_alloc_div(dst
);
399 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
401 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
404 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
406 struct isl_basic_map
*dup
;
410 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
411 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
414 dup_constraints(dup
, bmap
);
415 dup
->flags
= bmap
->flags
;
416 dup
->sample
= isl_vec_copy(bmap
->sample
);
420 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
422 struct isl_basic_map
*dup
;
424 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
425 return (struct isl_basic_set
*)dup
;
428 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
433 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
437 return isl_basic_set_dup(bset
);
440 struct isl_set
*isl_set_copy(struct isl_set
*set
)
449 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
454 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
458 return isl_basic_map_dup(bmap
);
461 struct isl_map
*isl_map_copy(struct isl_map
*map
)
470 void isl_basic_map_free(struct isl_basic_map
*bmap
)
478 isl_ctx_deref(bmap
->ctx
);
480 isl_blk_free(bmap
->ctx
, bmap
->block2
);
482 isl_blk_free(bmap
->ctx
, bmap
->block
);
483 isl_vec_free(bmap
->sample
);
484 isl_dim_free(bmap
->dim
);
488 void isl_basic_set_free(struct isl_basic_set
*bset
)
490 isl_basic_map_free((struct isl_basic_map
*)bset
);
493 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
495 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
498 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
504 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
505 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
507 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
508 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
509 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
510 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
511 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
512 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
514 int j
= isl_basic_map_alloc_inequality(bmap
);
518 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
519 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
526 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
527 bmap
->extra
- bmap
->n_div
);
531 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
533 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
536 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
540 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
545 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
547 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
550 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
555 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
557 if (pos
!= bmap
->n_eq
- 1) {
559 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
560 bmap
->eq
[bmap
->n_eq
- 1] = t
;
566 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
568 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
571 void isl_basic_map_inequality_to_equality(
572 struct isl_basic_map
*bmap
, unsigned pos
)
577 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
578 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
583 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
584 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
585 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
586 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
589 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
591 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
594 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
600 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
601 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
602 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
603 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
604 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
605 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
606 1 + isl_basic_map_total_dim(bmap
),
607 bmap
->extra
- bmap
->n_div
);
608 return bmap
->n_ineq
++;
611 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
613 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
616 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
620 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
625 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
627 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
630 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
635 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
637 if (pos
!= bmap
->n_ineq
- 1) {
639 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
640 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
641 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
647 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
649 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
652 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
657 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
660 k
= isl_basic_map_alloc_equality(bmap
);
663 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
666 isl_basic_map_free(bmap
);
670 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
673 return (isl_basic_set
*)
674 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
677 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
682 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
685 k
= isl_basic_map_alloc_inequality(bmap
);
688 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
691 isl_basic_map_free(bmap
);
695 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
698 return (isl_basic_set
*)
699 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
702 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
706 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
707 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
708 1 + 1 + isl_basic_map_total_dim(bmap
),
709 bmap
->extra
- bmap
->n_div
);
710 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
711 return bmap
->n_div
++;
714 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
716 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
719 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
723 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
728 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
730 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
733 /* Copy constraint from src to dst, putting the vars of src at offset
734 * dim_off in dst and the divs of src at offset div_off in dst.
735 * If both sets are actually map, then dim_off applies to the input
738 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
739 struct isl_basic_map
*src_map
, isl_int
*src
,
740 unsigned in_off
, unsigned out_off
, unsigned div_off
)
742 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
743 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
744 unsigned src_in
= isl_basic_map_n_in(src_map
);
745 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
746 unsigned src_out
= isl_basic_map_n_out(src_map
);
747 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
748 isl_int_set(dst
[0], src
[0]);
749 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
750 if (dst_nparam
> src_nparam
)
751 isl_seq_clr(dst
+1+src_nparam
,
752 dst_nparam
- src_nparam
);
753 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
754 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
756 isl_min(dst_in
-in_off
, src_in
));
757 if (dst_in
-in_off
> src_in
)
758 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
759 dst_in
- in_off
- src_in
);
760 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
761 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
762 src
+1+src_nparam
+src_in
,
763 isl_min(dst_out
-out_off
, src_out
));
764 if (dst_out
-out_off
> src_out
)
765 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
766 dst_out
- out_off
- src_out
);
767 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
768 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
769 src
+1+src_nparam
+src_in
+src_out
,
770 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
771 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
772 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
773 div_off
+src_map
->n_div
,
774 dst_map
->n_div
- div_off
- src_map
->n_div
);
777 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
778 struct isl_basic_map
*src_map
, isl_int
*src
,
779 unsigned in_off
, unsigned out_off
, unsigned div_off
)
781 isl_int_set(dst
[0], src
[0]);
782 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
785 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
786 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
791 if (!bmap1
|| !bmap2
)
794 div_off
= bmap1
->n_div
;
796 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
797 int i1
= isl_basic_map_alloc_equality(bmap1
);
800 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
801 i_pos
, o_pos
, div_off
);
804 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
805 int i1
= isl_basic_map_alloc_inequality(bmap1
);
808 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
809 i_pos
, o_pos
, div_off
);
812 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
813 int i1
= isl_basic_map_alloc_div(bmap1
);
816 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
817 i_pos
, o_pos
, div_off
);
820 isl_basic_map_free(bmap2
);
825 isl_basic_map_free(bmap1
);
826 isl_basic_map_free(bmap2
);
830 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
831 struct isl_dim_map
*dim_map
)
835 for (i
= 0; i
< dim_map
->len
; ++i
) {
836 if (dim_map
->pos
[i
] < 0)
837 isl_int_set_si(dst
[i
], 0);
839 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
843 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
844 struct isl_dim_map
*dim_map
)
846 isl_int_set(dst
[0], src
[0]);
847 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
850 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
851 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
855 if (!src
|| !dst
|| !dim_map
)
858 for (i
= 0; i
< src
->n_eq
; ++i
) {
859 int i1
= isl_basic_map_alloc_equality(dst
);
862 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
865 for (i
= 0; i
< src
->n_ineq
; ++i
) {
866 int i1
= isl_basic_map_alloc_inequality(dst
);
869 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
872 for (i
= 0; i
< src
->n_div
; ++i
) {
873 int i1
= isl_basic_map_alloc_div(dst
);
876 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
880 isl_basic_map_free(src
);
885 isl_basic_map_free(src
);
886 isl_basic_map_free(dst
);
890 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
891 struct isl_basic_set
*bset2
, unsigned pos
)
893 return (struct isl_basic_set
*)
894 add_constraints((struct isl_basic_map
*)bset1
,
895 (struct isl_basic_map
*)bset2
, 0, pos
);
898 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
899 struct isl_dim
*dim
, unsigned extra
,
900 unsigned n_eq
, unsigned n_ineq
)
902 struct isl_basic_map
*ext
;
912 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
913 base
->extra
>= base
->n_div
+ extra
;
915 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
916 room_for_ineq(base
, n_ineq
)) {
921 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
922 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
923 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
924 extra
+= base
->extra
;
926 n_ineq
+= base
->n_ineq
;
928 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
934 ext
->sample
= isl_vec_copy(base
->sample
);
936 ext
= add_constraints(ext
, base
, 0, 0);
939 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
946 isl_basic_map_free(base
);
950 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
951 struct isl_dim
*dim
, unsigned extra
,
952 unsigned n_eq
, unsigned n_ineq
)
954 return (struct isl_basic_set
*)
955 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
956 extra
, n_eq
, n_ineq
);
959 struct isl_basic_map
*isl_basic_map_extend_constraints(
960 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
964 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
968 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
969 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
970 unsigned n_eq
, unsigned n_ineq
)
972 struct isl_basic_map
*bmap
;
977 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
981 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
985 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
986 unsigned nparam
, unsigned dim
, unsigned extra
,
987 unsigned n_eq
, unsigned n_ineq
)
989 return (struct isl_basic_set
*)
990 isl_basic_map_extend((struct isl_basic_map
*)base
,
991 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
994 struct isl_basic_set
*isl_basic_set_extend_constraints(
995 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
997 return (struct isl_basic_set
*)
998 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1002 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1004 return (struct isl_basic_set
*)
1005 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1008 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1013 if (bmap
->ref
> 1) {
1015 bmap
= isl_basic_map_dup(bmap
);
1017 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1021 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1029 return isl_set_dup(set
);
1032 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1040 return isl_map_dup(map
);
1043 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1044 unsigned a_len
, unsigned b_len
)
1046 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1047 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1048 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1051 struct isl_basic_set
*isl_basic_set_swap_vars(
1052 struct isl_basic_set
*bset
, unsigned n
)
1062 nparam
= isl_basic_set_n_param(bset
);
1063 dim
= isl_basic_set_n_dim(bset
);
1064 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1069 bset
= isl_basic_set_cow(bset
);
1073 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1074 if (isl_blk_is_error(blk
))
1077 for (i
= 0; i
< bset
->n_eq
; ++i
)
1079 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1081 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1083 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1085 for (i
= 0; i
< bset
->n_div
; ++i
)
1087 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1089 isl_blk_free(bset
->ctx
, blk
);
1091 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1092 return isl_basic_set_gauss(bset
, NULL
);
1094 isl_basic_set_free(bset
);
1098 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1101 set
= isl_set_cow(set
);
1105 for (i
= 0; i
< set
->n
; ++i
) {
1106 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1112 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1116 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1122 total
= isl_basic_map_total_dim(bmap
);
1123 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1124 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1126 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1128 isl_basic_map_alloc_equality(bmap
);
1132 isl_int_set_si(bmap
->eq
[i
][0], 1);
1133 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1134 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1135 return isl_basic_map_finalize(bmap
);
1137 isl_basic_map_free(bmap
);
1141 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1143 return (struct isl_basic_set
*)
1144 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1147 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1150 unsigned off
= isl_dim_total(bmap
->dim
);
1151 isl_int
*t
= bmap
->div
[a
];
1152 bmap
->div
[a
] = bmap
->div
[b
];
1155 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1156 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1158 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1159 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1161 for (i
= 0; i
< bmap
->n_div
; ++i
)
1162 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1163 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1166 /* Eliminate the specified n dimensions starting at first from the
1167 * constraints using Fourier-Motzkin, The dimensions themselves
1170 struct isl_set
*isl_set_eliminate_dims(struct isl_set
*set
,
1171 unsigned first
, unsigned n
)
1181 set
= isl_set_cow(set
);
1184 isl_assert(set
->ctx
, first
+n
<= isl_set_n_dim(set
), goto error
);
1185 nparam
= isl_set_n_param(set
);
1187 for (i
= 0; i
< set
->n
; ++i
) {
1188 set
->p
[i
] = isl_basic_set_eliminate_vars(set
->p
[i
],
1199 /* Project out n dimensions starting at first using Fourier-Motzkin */
1200 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1201 unsigned first
, unsigned n
)
1203 set
= isl_set_eliminate_dims(set
, first
, n
);
1204 set
= isl_set_drop_dims(set
, first
, n
);
1208 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1210 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1218 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1227 set
= isl_set_cow(set
);
1231 for (i
= 0; i
< set
->n
; ++i
) {
1232 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1242 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1243 enum isl_dim_type type
, unsigned first
, unsigned n
)
1247 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1251 bmap
= isl_basic_map_eliminate_vars(bmap
,
1252 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1255 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1257 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1260 isl_basic_map_free(bmap
);
1264 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1265 enum isl_dim_type type
, unsigned first
, unsigned n
)
1267 return (isl_basic_set
*)
1268 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1271 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1272 enum isl_dim_type type
, unsigned first
, unsigned n
)
1279 map
= isl_map_cow(map
);
1282 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1284 for (i
= 0; i
< map
->n
; ++i
) {
1285 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1286 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1290 map
= isl_map_drop(map
, type
, first
, n
);
1297 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1298 enum isl_dim_type type
, unsigned first
, unsigned n
)
1300 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1303 /* Project out n inputs starting at first using Fourier-Motzkin */
1304 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1305 unsigned first
, unsigned n
)
1307 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1310 /* Project out n dimensions starting at first using Fourier-Motzkin */
1311 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1312 unsigned first
, unsigned n
)
1314 unsigned nparam
= isl_basic_set_n_param(bset
);
1315 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1316 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1320 static void dump_term(struct isl_basic_map
*bmap
,
1321 isl_int c
, int pos
, FILE *out
)
1324 unsigned in
= isl_basic_map_n_in(bmap
);
1325 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1326 unsigned nparam
= isl_basic_map_n_param(bmap
);
1328 isl_int_print(out
, c
, 0);
1330 if (!isl_int_is_one(c
))
1331 isl_int_print(out
, c
, 0);
1332 if (pos
< 1 + nparam
) {
1333 name
= isl_dim_get_name(bmap
->dim
,
1334 isl_dim_param
, pos
- 1);
1336 fprintf(out
, "%s", name
);
1338 fprintf(out
, "p%d", pos
- 1);
1339 } else if (pos
< 1 + nparam
+ in
)
1340 fprintf(out
, "i%d", pos
- 1 - nparam
);
1341 else if (pos
< 1 + nparam
+ dim
)
1342 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1344 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1348 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1349 int sign
, FILE *out
)
1353 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1357 for (i
= 0, first
= 1; i
< len
; ++i
) {
1358 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1361 fprintf(out
, " + ");
1363 isl_int_abs(v
, c
[i
]);
1364 dump_term(bmap
, v
, i
, out
);
1371 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1372 const char *op
, FILE *out
, int indent
)
1376 fprintf(out
, "%*s", indent
, "");
1378 dump_constraint_sign(bmap
, c
, 1, out
);
1379 fprintf(out
, " %s ", op
);
1380 dump_constraint_sign(bmap
, c
, -1, out
);
1384 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1385 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1387 fprintf(out
, "%*s", indent
, "");
1388 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1393 static void dump_constraints(struct isl_basic_map
*bmap
,
1394 isl_int
**c
, unsigned n
,
1395 const char *op
, FILE *out
, int indent
)
1399 for (i
= 0; i
< n
; ++i
)
1400 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1403 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1407 unsigned total
= isl_basic_map_total_dim(bmap
);
1409 for (j
= 0; j
< 1 + total
; ++j
) {
1410 if (isl_int_is_zero(exp
[j
]))
1412 if (!first
&& isl_int_is_pos(exp
[j
]))
1414 dump_term(bmap
, exp
[j
], j
, out
);
1419 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1423 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1424 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1426 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1427 fprintf(out
, "%*s", indent
, "");
1428 fprintf(out
, "e%d = [(", i
);
1429 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1431 isl_int_print(out
, bmap
->div
[i
][0], 0);
1432 fprintf(out
, "]\n");
1436 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1439 fprintf(out
, "null basic set\n");
1443 fprintf(out
, "%*s", indent
, "");
1444 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1445 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1446 bset
->extra
, bset
->flags
);
1447 dump((struct isl_basic_map
*)bset
, out
, indent
);
1450 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1453 fprintf(out
, "null basic map\n");
1457 fprintf(out
, "%*s", indent
, "");
1458 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1459 "flags: %x, n_name: %d\n",
1461 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1462 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1463 dump(bmap
, out
, indent
);
1466 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1471 total
= isl_basic_map_total_dim(bmap
);
1472 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1473 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1474 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1475 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1479 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1481 struct isl_set
*set
;
1485 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1486 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1487 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1488 sizeof(struct isl_set
) +
1489 (n
- 1) * sizeof(struct isl_basic_set
*));
1493 set
->ctx
= dim
->ctx
;
1494 isl_ctx_ref(set
->ctx
);
1506 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1507 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1509 struct isl_set
*set
;
1510 struct isl_dim
*dims
;
1512 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1516 set
= isl_set_alloc_dim(dims
, n
, flags
);
1520 /* Make sure "map" has room for at least "n" more basic maps.
1522 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1525 struct isl_map
*grown
= NULL
;
1529 isl_assert(map
->ctx
, n
>= 0, goto error
);
1530 if (map
->n
+ n
<= map
->size
)
1532 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1535 for (i
= 0; i
< map
->n
; ++i
) {
1536 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1544 isl_map_free(grown
);
1549 /* Make sure "set" has room for at least "n" more basic sets.
1551 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1553 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1556 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1559 struct isl_set
*dup
;
1564 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1567 for (i
= 0; i
< set
->n
; ++i
)
1568 dup
= isl_set_add(dup
, isl_basic_set_copy(set
->p
[i
]));
1572 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1574 struct isl_set
*set
;
1579 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1581 isl_basic_set_free(bset
);
1584 return isl_set_add(set
, bset
);
1587 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1589 struct isl_map
*map
;
1594 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1596 isl_basic_map_free(bmap
);
1599 return isl_map_add(map
, bmap
);
1602 struct isl_set
*isl_set_add(struct isl_set
*set
, struct isl_basic_set
*bset
)
1604 return (struct isl_set
*)isl_map_add((struct isl_map
*)set
,
1605 (struct isl_basic_map
*)bset
);
1608 void isl_set_free(struct isl_set
*set
)
1618 isl_ctx_deref(set
->ctx
);
1619 for (i
= 0; i
< set
->n
; ++i
)
1620 isl_basic_set_free(set
->p
[i
]);
1621 isl_dim_free(set
->dim
);
1625 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1630 fprintf(out
, "null set\n");
1634 fprintf(out
, "%*s", indent
, "");
1635 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1636 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1638 for (i
= 0; i
< set
->n
; ++i
) {
1639 fprintf(out
, "%*s", indent
, "");
1640 fprintf(out
, "basic set %d:\n", i
);
1641 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1645 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1650 fprintf(out
, "null map\n");
1654 fprintf(out
, "%*s", indent
, "");
1655 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1656 "flags: %x, n_name: %d\n",
1657 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1658 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1659 for (i
= 0; i
< map
->n
; ++i
) {
1660 fprintf(out
, "%*s", indent
, "");
1661 fprintf(out
, "basic map %d:\n", i
);
1662 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1666 struct isl_basic_map
*isl_basic_map_intersect_domain(
1667 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1669 struct isl_basic_map
*bmap_domain
;
1670 struct isl_dim
*dim
;
1675 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1676 bset
->dim
, isl_dim_param
), goto error
);
1678 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1679 isl_assert(bset
->ctx
,
1680 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1682 bmap
= isl_basic_map_cow(bmap
);
1683 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1684 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1687 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1688 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1689 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1691 bmap
= isl_basic_map_simplify(bmap
);
1692 return isl_basic_map_finalize(bmap
);
1694 isl_basic_map_free(bmap
);
1695 isl_basic_set_free(bset
);
1699 struct isl_basic_map
*isl_basic_map_intersect_range(
1700 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1702 struct isl_basic_map
*bmap_range
;
1707 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1708 bset
->dim
, isl_dim_param
), goto error
);
1710 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1711 isl_assert(bset
->ctx
,
1712 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1714 bmap
= isl_basic_map_cow(bmap
);
1715 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1716 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1719 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1720 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1722 bmap
= isl_basic_map_simplify(bmap
);
1723 return isl_basic_map_finalize(bmap
);
1725 isl_basic_map_free(bmap
);
1726 isl_basic_set_free(bset
);
1730 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1736 total
= 1 + isl_basic_map_total_dim(bmap
);
1737 if (total
!= vec
->size
)
1742 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1743 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1744 if (!isl_int_is_zero(s
)) {
1750 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1751 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1752 if (isl_int_is_neg(s
)) {
1763 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1765 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1768 struct isl_basic_map
*isl_basic_map_intersect(
1769 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1771 struct isl_vec
*sample
= NULL
;
1773 if (!bmap1
|| !bmap2
)
1776 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1777 bmap2
->dim
, isl_dim_param
), goto error
);
1778 if (isl_dim_total(bmap1
->dim
) ==
1779 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1780 isl_dim_total(bmap2
->dim
) !=
1781 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1782 return isl_basic_map_intersect(bmap2
, bmap1
);
1784 if (isl_dim_total(bmap2
->dim
) !=
1785 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1786 isl_assert(bmap1
->ctx
,
1787 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1789 if (bmap1
->sample
&&
1790 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1791 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1792 sample
= isl_vec_copy(bmap1
->sample
);
1793 else if (bmap2
->sample
&&
1794 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1795 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1796 sample
= isl_vec_copy(bmap2
->sample
);
1798 bmap1
= isl_basic_map_cow(bmap1
);
1799 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1800 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1803 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1806 isl_vec_free(bmap1
->sample
);
1807 bmap1
->sample
= sample
;
1810 bmap1
= isl_basic_map_simplify(bmap1
);
1811 return isl_basic_map_finalize(bmap1
);
1814 isl_vec_free(sample
);
1815 isl_basic_map_free(bmap1
);
1816 isl_basic_map_free(bmap2
);
1820 struct isl_basic_set
*isl_basic_set_intersect(
1821 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1823 return (struct isl_basic_set
*)
1824 isl_basic_map_intersect(
1825 (struct isl_basic_map
*)bset1
,
1826 (struct isl_basic_map
*)bset2
);
1829 /* Special case of isl_map_intersect, where both map1 and map2
1830 * are convex, without any divs and such that either map1 or map2
1831 * contains a single constraint. This constraint is then simply
1832 * added to the other map.
1834 static __isl_give isl_map
*map_intersect_add_constraint(
1835 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
1837 struct isl_basic_map
*bmap1
;
1838 struct isl_basic_map
*bmap2
;
1840 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
1841 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
1842 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1843 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1845 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
1846 return isl_map_intersect(map2
, map1
);
1848 isl_assert(map2
->ctx
,
1849 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
1851 map1
= isl_map_cow(map1
);
1854 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
1855 if (map2
->p
[0]->n_eq
== 1)
1856 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
1858 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
1859 map2
->p
[0]->ineq
[0]);
1861 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
1862 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
1875 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1878 struct isl_map
*result
;
1884 if (map1
->n
== 1 && map2
->n
== 1 &&
1885 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
1886 isl_dim_equal(map1
->dim
, map2
->dim
) &&
1887 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
1888 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
1889 return map_intersect_add_constraint(map1
, map2
);
1890 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1891 map2
->dim
, isl_dim_param
), goto error
);
1892 if (isl_dim_total(map1
->dim
) ==
1893 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1894 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1895 return isl_map_intersect(map2
, map1
);
1897 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1898 isl_assert(map1
->ctx
,
1899 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1901 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1902 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
1903 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
1905 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1906 map1
->n
* map2
->n
, flags
);
1909 for (i
= 0; i
< map1
->n
; ++i
)
1910 for (j
= 0; j
< map2
->n
; ++j
) {
1911 struct isl_basic_map
*part
;
1912 part
= isl_basic_map_intersect(
1913 isl_basic_map_copy(map1
->p
[i
]),
1914 isl_basic_map_copy(map2
->p
[j
]));
1915 if (isl_basic_map_is_empty(part
))
1916 isl_basic_map_free(part
);
1918 result
= isl_map_add(result
, part
);
1931 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1933 return (struct isl_set
*)
1934 isl_map_intersect((struct isl_map
*)set1
,
1935 (struct isl_map
*)set2
);
1938 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
1940 struct isl_dim
*dim
;
1941 struct isl_basic_set
*bset
;
1946 bmap
= isl_basic_map_cow(bmap
);
1949 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
1950 in
= isl_basic_map_n_in(bmap
);
1951 bset
= isl_basic_set_from_basic_map(bmap
);
1952 bset
= isl_basic_set_swap_vars(bset
, in
);
1953 return isl_basic_map_from_basic_set(bset
, dim
);
1956 /* Turn final n dimensions into existentially quantified variables.
1958 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
1959 enum isl_dim_type type
, unsigned first
, unsigned n
)
1969 isl_assert(bset
->ctx
, type
== isl_dim_set
, goto error
);
1970 isl_assert(bset
->ctx
, first
+ n
== isl_basic_set_n_dim(bset
), goto error
);
1975 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_RATIONAL
))
1976 return isl_basic_set_remove(bset
, type
, first
, n
);
1978 bset
= isl_basic_set_cow(bset
);
1980 row_size
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
1981 old
= bset
->block2
.data
;
1982 bset
->block2
= isl_blk_extend(bset
->ctx
, bset
->block2
,
1983 (bset
->extra
+ n
) * (1 + row_size
));
1984 if (!bset
->block2
.data
)
1986 new_div
= isl_alloc_array(ctx
, isl_int
*, bset
->extra
+ n
);
1989 for (i
= 0; i
< n
; ++i
) {
1990 new_div
[i
] = bset
->block2
.data
+
1991 (bset
->extra
+ i
) * (1 + row_size
);
1992 isl_seq_clr(new_div
[i
], 1 + row_size
);
1994 for (i
= 0; i
< bset
->extra
; ++i
)
1995 new_div
[n
+ i
] = bset
->block2
.data
+ (bset
->div
[i
] - old
);
1997 bset
->div
= new_div
;
2000 bset
->dim
= isl_dim_drop_outputs(bset
->dim
,
2001 isl_basic_set_n_dim(bset
) - n
, n
);
2004 bset
= isl_basic_set_simplify(bset
);
2005 bset
= isl_basic_set_drop_redundant_divs(bset
);
2006 return isl_basic_set_finalize(bset
);
2008 isl_basic_set_free(bset
);
2012 /* Turn final n dimensions into existentially quantified variables.
2014 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2015 enum isl_dim_type type
, unsigned first
, unsigned n
)
2022 isl_assert(set
->ctx
, type
== isl_dim_set
, goto error
);
2023 isl_assert(set
->ctx
, first
+ n
== isl_set_n_dim(set
), goto error
);
2028 set
= isl_set_cow(set
);
2031 set
->dim
= isl_dim_drop_outputs(set
->dim
, first
, n
);
2032 for (i
= 0; i
< set
->n
; ++i
) {
2033 set
->p
[i
] = isl_basic_set_project_out(set
->p
[i
], type
, first
, n
);
2038 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
2045 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2049 for (i
= 0; i
< n
; ++i
) {
2050 j
= isl_basic_map_alloc_div(bmap
);
2053 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2057 isl_basic_map_free(bmap
);
2061 struct isl_basic_map
*isl_basic_map_apply_range(
2062 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2064 struct isl_dim
*dim_result
= NULL
;
2065 struct isl_basic_map
*bmap
;
2066 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2067 struct isl_dim_map
*dim_map1
, *dim_map2
;
2069 if (!bmap1
|| !bmap2
)
2072 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2073 isl_dim_copy(bmap2
->dim
));
2075 n_in
= isl_basic_map_n_in(bmap1
);
2076 n_out
= isl_basic_map_n_out(bmap2
);
2077 n
= isl_basic_map_n_out(bmap1
);
2078 nparam
= isl_basic_map_n_param(bmap1
);
2080 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2081 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2082 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2083 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2084 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2085 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2086 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2087 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2088 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2089 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2090 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2092 bmap
= isl_basic_map_alloc_dim(dim_result
,
2093 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2094 bmap1
->n_eq
+ bmap2
->n_eq
,
2095 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2096 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2097 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2098 bmap
= add_divs(bmap
, n
);
2099 bmap
= isl_basic_map_simplify(bmap
);
2100 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2101 return isl_basic_map_finalize(bmap
);
2103 isl_basic_map_free(bmap1
);
2104 isl_basic_map_free(bmap2
);
2108 struct isl_basic_set
*isl_basic_set_apply(
2109 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2114 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2117 return (struct isl_basic_set
*)
2118 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2120 isl_basic_set_free(bset
);
2121 isl_basic_map_free(bmap
);
2125 struct isl_basic_map
*isl_basic_map_apply_domain(
2126 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2128 if (!bmap1
|| !bmap2
)
2131 isl_assert(bmap1
->ctx
,
2132 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2133 isl_assert(bmap1
->ctx
,
2134 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2137 bmap1
= isl_basic_map_reverse(bmap1
);
2138 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2139 return isl_basic_map_reverse(bmap1
);
2141 isl_basic_map_free(bmap1
);
2142 isl_basic_map_free(bmap2
);
2146 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2147 * A \cap B -> f(A) + f(B)
2149 struct isl_basic_map
*isl_basic_map_sum(
2150 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2152 unsigned n_in
, n_out
, nparam
, total
, pos
;
2153 struct isl_basic_map
*bmap
= NULL
;
2154 struct isl_dim_map
*dim_map1
, *dim_map2
;
2157 if (!bmap1
|| !bmap2
)
2160 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2163 nparam
= isl_basic_map_n_param(bmap1
);
2164 n_in
= isl_basic_map_n_in(bmap1
);
2165 n_out
= isl_basic_map_n_out(bmap1
);
2167 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2168 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2169 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2170 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2171 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2172 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2173 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2174 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2175 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2176 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2177 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2179 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2180 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2181 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2182 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2183 for (i
= 0; i
< n_out
; ++i
) {
2184 int j
= isl_basic_map_alloc_equality(bmap
);
2187 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2188 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2189 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2190 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2192 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2193 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2194 bmap
= add_divs(bmap
, 2 * n_out
);
2196 bmap
= isl_basic_map_simplify(bmap
);
2197 return isl_basic_map_finalize(bmap
);
2199 isl_basic_map_free(bmap
);
2200 isl_basic_map_free(bmap1
);
2201 isl_basic_map_free(bmap2
);
2205 /* Given two maps A -> f(A) and B -> g(B), construct a map
2206 * A \cap B -> f(A) + f(B)
2208 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2210 struct isl_map
*result
;
2216 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2218 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2219 map1
->n
* map2
->n
, 0);
2222 for (i
= 0; i
< map1
->n
; ++i
)
2223 for (j
= 0; j
< map2
->n
; ++j
) {
2224 struct isl_basic_map
*part
;
2225 part
= isl_basic_map_sum(
2226 isl_basic_map_copy(map1
->p
[i
]),
2227 isl_basic_map_copy(map2
->p
[j
]));
2228 if (isl_basic_map_is_empty(part
))
2229 isl_basic_map_free(part
);
2231 result
= isl_map_add(result
, part
);
2244 /* Given a basic map A -> f(A), construct A -> -f(A).
2246 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2251 bmap
= isl_basic_map_cow(bmap
);
2255 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2256 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2257 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2258 for (j
= 0; j
< n
; ++j
)
2259 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2260 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2261 for (j
= 0; j
< n
; ++j
)
2262 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2263 for (i
= 0; i
< bmap
->n_div
; ++i
)
2264 for (j
= 0; j
< n
; ++j
)
2265 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2266 return isl_basic_map_finalize(bmap
);
2269 /* Given a map A -> f(A), construct A -> -f(A).
2271 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2275 map
= isl_map_cow(map
);
2279 for (i
= 0; i
< map
->n
; ++i
) {
2280 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2291 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2292 * A -> floor(f(A)/d).
2294 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2297 unsigned n_in
, n_out
, nparam
, total
, pos
;
2298 struct isl_basic_map
*result
= NULL
;
2299 struct isl_dim_map
*dim_map
;
2305 nparam
= isl_basic_map_n_param(bmap
);
2306 n_in
= isl_basic_map_n_in(bmap
);
2307 n_out
= isl_basic_map_n_out(bmap
);
2309 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2310 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2311 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2312 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2313 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2314 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2316 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2317 bmap
->n_div
+ n_out
,
2318 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2319 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2320 result
= add_divs(result
, n_out
);
2321 for (i
= 0; i
< n_out
; ++i
) {
2323 j
= isl_basic_map_alloc_inequality(result
);
2326 isl_seq_clr(result
->ineq
[j
], 1+total
);
2327 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2328 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2329 j
= isl_basic_map_alloc_inequality(result
);
2332 isl_seq_clr(result
->ineq
[j
], 1+total
);
2333 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2334 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2335 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2338 result
= isl_basic_map_simplify(result
);
2339 return isl_basic_map_finalize(result
);
2341 isl_basic_map_free(result
);
2345 /* Given a map A -> f(A) and an integer d, construct a map
2346 * A -> floor(f(A)/d).
2348 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2352 map
= isl_map_cow(map
);
2356 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2357 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2358 for (i
= 0; i
< map
->n
; ++i
) {
2359 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2370 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2376 i
= isl_basic_map_alloc_equality(bmap
);
2379 nparam
= isl_basic_map_n_param(bmap
);
2380 n_in
= isl_basic_map_n_in(bmap
);
2381 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2382 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2383 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2384 return isl_basic_map_finalize(bmap
);
2386 isl_basic_map_free(bmap
);
2390 /* Add a constraints to "bmap" expressing i_pos < o_pos
2392 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2398 i
= isl_basic_map_alloc_inequality(bmap
);
2401 nparam
= isl_basic_map_n_param(bmap
);
2402 n_in
= isl_basic_map_n_in(bmap
);
2403 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2404 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2405 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2406 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2407 return isl_basic_map_finalize(bmap
);
2409 isl_basic_map_free(bmap
);
2413 /* Add a constraints to "bmap" expressing i_pos > o_pos
2415 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2421 i
= isl_basic_map_alloc_inequality(bmap
);
2424 nparam
= isl_basic_map_n_param(bmap
);
2425 n_in
= isl_basic_map_n_in(bmap
);
2426 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2427 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2428 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2429 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2430 return isl_basic_map_finalize(bmap
);
2432 isl_basic_map_free(bmap
);
2436 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2439 struct isl_basic_map
*bmap
;
2440 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2443 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2444 bmap
= var_equal(bmap
, i
);
2445 return isl_basic_map_finalize(bmap
);
2448 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2450 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2453 struct isl_basic_map
*bmap
;
2454 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2457 for (i
= 0; i
< pos
&& bmap
; ++i
)
2458 bmap
= var_equal(bmap
, i
);
2460 bmap
= var_less(bmap
, pos
);
2461 return isl_basic_map_finalize(bmap
);
2464 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2466 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2469 struct isl_basic_map
*bmap
;
2470 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2473 for (i
= 0; i
< pos
&& bmap
; ++i
)
2474 bmap
= var_equal(bmap
, i
);
2476 bmap
= var_more(bmap
, pos
);
2477 return isl_basic_map_finalize(bmap
);
2480 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
2482 struct isl_map
*map
;
2489 map
= isl_map_alloc_dim(isl_dim_copy(dims
), dim
+ equal
, ISL_MAP_DISJOINT
);
2491 for (i
= 0; i
< dim
; ++i
)
2492 map
= isl_map_add(map
,
2493 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
2495 map
= isl_map_add(map
,
2496 isl_basic_map_equal(isl_dim_copy(dims
), dim
));
2502 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
2504 return map_lex_lte(isl_dim_map(set_dim
), 0);
2507 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
2509 return map_lex_lte(isl_dim_map(set_dim
), 1);
2512 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
2514 struct isl_map
*map
;
2521 map
= isl_map_alloc_dim(isl_dim_copy(dims
), dim
+ equal
, ISL_MAP_DISJOINT
);
2523 for (i
= 0; i
< dim
; ++i
)
2524 map
= isl_map_add(map
,
2525 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
2527 map
= isl_map_add(map
,
2528 isl_basic_map_equal(isl_dim_copy(dims
), dim
));
2534 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
2536 return map_lex_gte(isl_dim_map(set_dim
), 0);
2539 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
2541 return map_lex_gte(isl_dim_map(set_dim
), 1);
2544 struct isl_basic_map
*isl_basic_map_from_basic_set(
2545 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
2547 struct isl_basic_map
*bmap
;
2549 bset
= isl_basic_set_cow(bset
);
2553 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
2554 isl_dim_free(bset
->dim
);
2555 bmap
= (struct isl_basic_map
*) bset
;
2557 return isl_basic_map_finalize(bmap
);
2559 isl_basic_set_free(bset
);
2564 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
2568 if (bmap
->dim
->n_in
== 0)
2569 return (struct isl_basic_set
*)bmap
;
2570 bmap
= isl_basic_map_cow(bmap
);
2573 bmap
->dim
= isl_dim_cow(bmap
->dim
);
2576 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
2577 bmap
->dim
->n_in
= 0;
2578 bmap
= isl_basic_map_finalize(bmap
);
2579 return (struct isl_basic_set
*)bmap
;
2581 isl_basic_map_free(bmap
);
2585 /* For a div d = floor(f/m), add the constraints
2588 * -(f-(n-1)) + m d >= 0
2590 * Note that the second constraint is the negation of
2594 static int add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
2597 unsigned total
= isl_basic_map_total_dim(bmap
);
2598 unsigned div_pos
= 1 + total
- bmap
->n_div
+ div
;
2600 i
= isl_basic_map_alloc_inequality(bmap
);
2603 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
]+1, 1+total
);
2604 isl_int_neg(bmap
->ineq
[i
][div_pos
], bmap
->div
[div
][0]);
2606 j
= isl_basic_map_alloc_inequality(bmap
);
2609 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
2610 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][div_pos
]);
2611 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
2615 struct isl_basic_set
*isl_basic_map_underlying_set(
2616 struct isl_basic_map
*bmap
)
2620 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
2621 return (struct isl_basic_set
*)bmap
;
2622 bmap
= isl_basic_map_cow(bmap
);
2625 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
2628 bmap
->extra
-= bmap
->n_div
;
2630 bmap
= isl_basic_map_finalize(bmap
);
2631 return (struct isl_basic_set
*)bmap
;
2636 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
2637 __isl_take isl_basic_set
*bset
)
2639 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
2642 struct isl_basic_map
*isl_basic_map_overlying_set(
2643 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
2645 struct isl_basic_map
*bmap
;
2646 struct isl_ctx
*ctx
;
2653 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
2654 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
2655 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
2657 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
2658 isl_basic_map_free(like
);
2659 return (struct isl_basic_map
*)bset
;
2661 bset
= isl_basic_set_cow(bset
);
2664 total
= bset
->dim
->n_out
+ bset
->extra
;
2665 bmap
= (struct isl_basic_map
*)bset
;
2666 isl_dim_free(bmap
->dim
);
2667 bmap
->dim
= isl_dim_copy(like
->dim
);
2670 bmap
->n_div
= like
->n_div
;
2671 bmap
->extra
+= like
->n_div
;
2674 ltotal
= total
- bmap
->extra
+ like
->extra
;
2677 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
2678 bmap
->extra
* (1 + 1 + total
));
2679 if (isl_blk_is_error(bmap
->block2
))
2681 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
2685 for (i
= 0; i
< bmap
->extra
; ++i
)
2686 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
2687 for (i
= 0; i
< like
->n_div
; ++i
) {
2688 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
2689 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
2691 bmap
= isl_basic_map_extend_constraints(bmap
,
2692 0, 2 * like
->n_div
);
2693 for (i
= 0; i
< like
->n_div
; ++i
) {
2694 if (isl_int_is_zero(bmap
->div
[i
][0]))
2696 if (add_div_constraints(bmap
, i
) < 0)
2700 isl_basic_map_free(like
);
2701 bmap
= isl_basic_map_simplify(bmap
);
2702 bmap
= isl_basic_map_finalize(bmap
);
2705 isl_basic_map_free(like
);
2706 isl_basic_set_free(bset
);
2710 struct isl_basic_set
*isl_basic_set_from_underlying_set(
2711 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
2713 return (struct isl_basic_set
*)
2714 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
2717 struct isl_set
*isl_set_from_underlying_set(
2718 struct isl_set
*set
, struct isl_basic_set
*like
)
2724 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
2726 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
2727 isl_basic_set_free(like
);
2730 set
= isl_set_cow(set
);
2733 for (i
= 0; i
< set
->n
; ++i
) {
2734 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
2735 isl_basic_set_copy(like
));
2739 isl_dim_free(set
->dim
);
2740 set
->dim
= isl_dim_copy(like
->dim
);
2743 isl_basic_set_free(like
);
2746 isl_basic_set_free(like
);
2751 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
2755 map
= isl_map_cow(map
);
2758 map
->dim
= isl_dim_cow(map
->dim
);
2762 for (i
= 1; i
< map
->n
; ++i
)
2763 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
2765 for (i
= 0; i
< map
->n
; ++i
) {
2766 map
->p
[i
] = (struct isl_basic_map
*)
2767 isl_basic_map_underlying_set(map
->p
[i
]);
2772 map
->dim
= isl_dim_underlying(map
->dim
, 0);
2774 isl_dim_free(map
->dim
);
2775 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
2779 return (struct isl_set
*)map
;
2785 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
2787 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
2790 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
2792 struct isl_basic_set
*domain
;
2797 n_in
= isl_basic_map_n_in(bmap
);
2798 n_out
= isl_basic_map_n_out(bmap
);
2799 domain
= isl_basic_set_from_basic_map(bmap
);
2800 return isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
2803 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
2805 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
2808 struct isl_set
*isl_map_range(struct isl_map
*map
)
2811 struct isl_set
*set
;
2815 map
= isl_map_cow(map
);
2819 set
= (struct isl_set
*) map
;
2820 if (set
->dim
->n_in
!= 0) {
2821 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
2825 for (i
= 0; i
< map
->n
; ++i
) {
2826 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
2830 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
2831 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
2838 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
2841 struct isl_map
*map
= NULL
;
2843 set
= isl_set_cow(set
);
2846 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
2847 map
= (struct isl_map
*)set
;
2848 for (i
= 0; i
< set
->n
; ++i
) {
2849 map
->p
[i
] = isl_basic_map_from_basic_set(
2850 set
->p
[i
], isl_dim_copy(dim
));
2854 isl_dim_free(map
->dim
);
2863 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
2865 return (struct isl_map
*)set
;
2868 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
2871 struct isl_set
*set
= NULL
;
2875 map
= isl_map_cow(map
);
2878 map
->dim
= isl_dim_cow(map
->dim
);
2881 map
->dim
->n_out
+= map
->dim
->n_in
;
2883 set
= (struct isl_set
*)map
;
2884 for (i
= 0; i
< map
->n
; ++i
) {
2885 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
2895 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2897 struct isl_map
*map
;
2901 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
2902 map
= isl_alloc(dim
->ctx
, struct isl_map
,
2903 sizeof(struct isl_map
) +
2904 (n
- 1) * sizeof(struct isl_basic_map
*));
2908 map
->ctx
= dim
->ctx
;
2909 isl_ctx_ref(map
->ctx
);
2921 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
2922 unsigned nparam
, unsigned in
, unsigned out
, int n
,
2925 struct isl_map
*map
;
2926 struct isl_dim
*dims
;
2928 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
2932 map
= isl_map_alloc_dim(dims
, n
, flags
);
2936 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
2938 struct isl_basic_map
*bmap
;
2939 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
2940 bmap
= isl_basic_map_set_to_empty(bmap
);
2944 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
2946 struct isl_basic_set
*bset
;
2947 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
2948 bset
= isl_basic_set_set_to_empty(bset
);
2952 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
2954 struct isl_basic_map
*bmap
;
2957 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2958 bmap
= isl_basic_map_set_to_empty(bmap
);
2962 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
2964 struct isl_basic_map
*bmap
;
2967 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2968 bmap
= isl_basic_map_set_to_empty(bmap
);
2972 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
2974 struct isl_basic_set
*bset
;
2977 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2978 bset
= isl_basic_set_set_to_empty(bset
);
2982 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
2984 struct isl_basic_map
*bmap
;
2985 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
2989 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
2991 struct isl_basic_set
*bset
;
2992 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
2996 __isl_give isl_basic_map
*isl_basic_map_universe_like(
2997 __isl_keep isl_basic_map
*model
)
3001 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3004 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
3008 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3011 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
3012 __isl_keep isl_set
*model
)
3016 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3019 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
3021 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3024 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
3028 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3031 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
3035 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3038 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
3040 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3043 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
3047 return isl_set_empty(isl_dim_copy(model
->dim
));
3050 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
3052 struct isl_map
*map
;
3055 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3056 map
= isl_map_add(map
, isl_basic_map_universe(dim
));
3060 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
3062 struct isl_set
*set
;
3065 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3066 set
= isl_set_add(set
, isl_basic_set_universe(dim
));
3070 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
3074 return isl_set_universe(isl_dim_copy(model
->dim
));
3077 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3080 struct isl_map
*dup
;
3084 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3085 for (i
= 0; i
< map
->n
; ++i
)
3086 dup
= isl_map_add(dup
, isl_basic_map_copy(map
->p
[i
]));
3090 struct isl_map
*isl_map_add(struct isl_map
*map
, struct isl_basic_map
*bmap
)
3094 if (isl_basic_map_fast_is_empty(bmap
)) {
3095 isl_basic_map_free(bmap
);
3098 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3099 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3100 map
->p
[map
->n
] = bmap
;
3102 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3108 isl_basic_map_free(bmap
);
3112 void isl_map_free(struct isl_map
*map
)
3122 isl_ctx_deref(map
->ctx
);
3123 for (i
= 0; i
< map
->n
; ++i
)
3124 isl_basic_map_free(map
->p
[i
]);
3125 isl_dim_free(map
->dim
);
3129 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3130 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3134 base
= isl_map_cow(base
);
3138 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3141 for (i
= 0; i
< base
->n
; ++i
) {
3142 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3143 isl_dim_copy(base
->dim
), 0, 0, 0);
3153 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3154 unsigned nparam
, unsigned dim
)
3156 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3160 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
3161 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
3165 bmap
= isl_basic_map_cow(bmap
);
3166 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3167 j
= isl_basic_map_alloc_equality(bmap
);
3170 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3171 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3172 isl_int_set_si(bmap
->eq
[j
][0], value
);
3173 bmap
= isl_basic_map_simplify(bmap
);
3174 return isl_basic_map_finalize(bmap
);
3176 isl_basic_map_free(bmap
);
3180 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
3181 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
3185 bmap
= isl_basic_map_cow(bmap
);
3186 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3187 j
= isl_basic_map_alloc_equality(bmap
);
3190 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3191 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3192 isl_int_set(bmap
->eq
[j
][0], value
);
3193 bmap
= isl_basic_map_simplify(bmap
);
3194 return isl_basic_map_finalize(bmap
);
3196 isl_basic_map_free(bmap
);
3200 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
3201 enum isl_dim_type type
, unsigned pos
, int value
)
3205 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3206 return isl_basic_map_fix_pos_si(bmap
,
3207 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3209 isl_basic_map_free(bmap
);
3213 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
3214 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3218 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3219 return isl_basic_map_fix_pos(bmap
,
3220 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3222 isl_basic_map_free(bmap
);
3226 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
3227 enum isl_dim_type type
, unsigned pos
, int value
)
3229 return (struct isl_basic_set
*)
3230 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3234 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
3235 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3237 return (struct isl_basic_set
*)
3238 isl_basic_map_fix((struct isl_basic_map
*)bset
,
3242 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
3243 unsigned input
, int value
)
3245 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
3248 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
3249 unsigned dim
, int value
)
3251 return (struct isl_basic_set
*)
3252 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3253 isl_dim_set
, dim
, value
);
3256 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
3257 enum isl_dim_type type
, unsigned pos
, int value
)
3261 map
= isl_map_cow(map
);
3265 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3266 for (i
= 0; i
< map
->n
; ++i
) {
3267 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
3271 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3278 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
3279 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3283 map
= isl_map_cow(map
);
3287 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3288 for (i
= 0; i
< map
->n
; ++i
) {
3289 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
3293 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3300 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
3301 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3303 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
3306 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
3307 unsigned input
, int value
)
3309 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
3312 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
3314 return (struct isl_set
*)
3315 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
3318 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
3319 unsigned dim
, isl_int value
)
3323 bset
= isl_basic_set_cow(bset
);
3324 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
3325 j
= isl_basic_set_alloc_inequality(bset
);
3328 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
3329 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
3330 isl_int_neg(bset
->ineq
[j
][0], value
);
3331 bset
= isl_basic_set_simplify(bset
);
3332 return isl_basic_set_finalize(bset
);
3334 isl_basic_set_free(bset
);
3338 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
3343 set
= isl_set_cow(set
);
3347 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
3348 for (i
= 0; i
< set
->n
; ++i
) {
3349 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
3359 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
3363 map
= isl_map_cow(map
);
3367 map
->dim
= isl_dim_reverse(map
->dim
);
3370 for (i
= 0; i
< map
->n
; ++i
) {
3371 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
3375 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3382 static struct isl_map
*isl_basic_map_partial_lexopt(
3383 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3384 struct isl_set
**empty
, int max
)
3388 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
3389 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
3391 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
3393 isl_basic_map_free(bmap
);
3394 isl_basic_set_free(dom
);
3400 struct isl_map
*isl_basic_map_partial_lexmax(
3401 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3402 struct isl_set
**empty
)
3404 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
3407 struct isl_map
*isl_basic_map_partial_lexmin(
3408 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3409 struct isl_set
**empty
)
3411 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
3414 struct isl_set
*isl_basic_set_partial_lexmin(
3415 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3416 struct isl_set
**empty
)
3418 return (struct isl_set
*)
3419 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
3423 struct isl_set
*isl_basic_set_partial_lexmax(
3424 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3425 struct isl_set
**empty
)
3427 return (struct isl_set
*)
3428 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
3432 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
3434 struct isl_basic_set
*dom
= NULL
;
3435 struct isl_dim
*dom_dim
;
3439 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
3440 dom
= isl_basic_set_universe(dom_dim
);
3441 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
3443 isl_basic_map_free(bmap
);
3447 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
3449 return isl_basic_map_lexopt(bmap
, 0);
3452 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
3454 return isl_basic_map_lexopt(bmap
, 1);
3457 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
3459 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
3462 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
3464 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
3467 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
3468 struct isl_dim
*dim
)
3475 for (i
= 0; i
< map
->n
; ++i
) {
3476 isl_dim_free(map
->p
[i
]->dim
);
3477 map
->p
[i
]->dim
= isl_dim_copy(dim
);
3479 isl_dim_free(map
->dim
);
3489 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
3490 struct isl_dim
*dim
)
3492 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3495 /* Apply a preimage specified by "mat" on the parameters of "bset".
3496 * bset is assumed to have only parameters and divs.
3498 static struct isl_basic_set
*basic_set_parameter_preimage(
3499 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
3506 bset
->dim
= isl_dim_cow(bset
->dim
);
3510 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3512 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3514 bset
->dim
->nparam
= 0;
3515 bset
->dim
->n_out
= nparam
;
3516 bset
= isl_basic_set_preimage(bset
, mat
);
3518 bset
->dim
->nparam
= bset
->dim
->n_out
;
3519 bset
->dim
->n_out
= 0;
3524 isl_basic_set_free(bset
);
3528 /* Apply a preimage specified by "mat" on the parameters of "set".
3529 * set is assumed to have only parameters and divs.
3531 static struct isl_set
*set_parameter_preimage(
3532 struct isl_set
*set
, struct isl_mat
*mat
)
3534 struct isl_dim
*dim
= NULL
;
3540 dim
= isl_dim_copy(set
->dim
);
3541 dim
= isl_dim_cow(dim
);
3545 nparam
= isl_set_dim(set
, isl_dim_param
);
3547 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3550 dim
->n_out
= nparam
;
3551 isl_set_reset_dim(set
, dim
);
3552 set
= isl_set_preimage(set
, mat
);
3555 dim
= isl_dim_copy(set
->dim
);
3556 dim
= isl_dim_cow(dim
);
3559 dim
->nparam
= dim
->n_out
;
3561 isl_set_reset_dim(set
, dim
);
3571 /* Intersect the basic set "bset" with the affine space specified by the
3572 * equalities in "eq".
3574 static struct isl_basic_set
*basic_set_append_equalities(
3575 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
3583 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
3588 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
3589 for (i
= 0; i
< eq
->n_row
; ++i
) {
3590 k
= isl_basic_set_alloc_equality(bset
);
3593 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
3594 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
3601 isl_basic_set_free(bset
);
3605 /* Intersect the set "set" with the affine space specified by the
3606 * equalities in "eq".
3608 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
3616 for (i
= 0; i
< set
->n
; ++i
) {
3617 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
3630 /* Project the given basic set onto its parameter domain, possibly introducing
3631 * new, explicit, existential variables in the constraints.
3632 * The input has parameters and (possibly implicit) existential variables.
3633 * The output has the same parameters, but only
3634 * explicit existentially quantified variables.
3636 * The actual projection is performed by pip, but pip doesn't seem
3637 * to like equalities very much, so we first remove the equalities
3638 * among the parameters by performing a variable compression on
3639 * the parameters. Afterward, an inverse transformation is performed
3640 * and the equalities among the parameters are inserted back in.
3642 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
3646 struct isl_mat
*T
, *T2
;
3647 struct isl_set
*set
;
3648 unsigned nparam
, n_div
;
3650 bset
= isl_basic_set_cow(bset
);
3654 if (bset
->n_eq
== 0)
3655 return isl_basic_set_lexmin(bset
);
3657 isl_basic_set_gauss(bset
, NULL
);
3659 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3660 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
3662 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
3663 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
3666 if (i
== bset
->n_eq
)
3667 return isl_basic_set_lexmin(bset
);
3669 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
3671 eq
= isl_mat_cow(eq
);
3672 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
3673 bset
= basic_set_parameter_preimage(bset
, T
);
3675 set
= isl_basic_set_lexmin(bset
);
3676 set
= set_parameter_preimage(set
, T2
);
3677 set
= set_append_equalities(set
, eq
);
3681 /* Compute an explicit representation for all the existentially
3682 * quantified variables.
3683 * The input and output dimensions are first turned into parameters.
3684 * compute_divs then returns a map with the same parameters and
3685 * no input or output dimensions and the dimension specification
3686 * is reset to that of the input.
3688 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
3690 struct isl_basic_set
*bset
;
3691 struct isl_set
*set
;
3692 struct isl_map
*map
;
3693 struct isl_dim
*dim
, *orig_dim
= NULL
;
3698 bmap
= isl_basic_map_cow(bmap
);
3702 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3703 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3704 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3705 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
3709 orig_dim
= bmap
->dim
;
3711 bset
= (struct isl_basic_set
*)bmap
;
3713 set
= parameter_compute_divs(bset
);
3714 map
= (struct isl_map
*)set
;
3715 map
= isl_map_reset_dim(map
, orig_dim
);
3719 isl_basic_map_free(bmap
);
3723 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
3731 off
= isl_dim_total(bmap
->dim
);
3732 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3733 if (isl_int_is_zero(bmap
->div
[i
][0]))
3735 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
3741 static int map_divs_known(__isl_keep isl_map
*map
)
3748 for (i
= 0; i
< map
->n
; ++i
) {
3749 int known
= basic_map_divs_known(map
->p
[i
]);
3757 /* If bmap contains any unknown divs, then compute explicit
3758 * expressions for them. However, this computation may be
3759 * quite expensive, so first try to remove divs that aren't
3762 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
3766 struct isl_map
*map
;
3768 known
= basic_map_divs_known(bmap
);
3772 return isl_map_from_basic_map(bmap
);
3774 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3776 known
= basic_map_divs_known(bmap
);
3780 return isl_map_from_basic_map(bmap
);
3782 map
= compute_divs(bmap
);
3785 isl_basic_map_free(bmap
);
3789 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
3793 struct isl_map
*res
;
3800 known
= map_divs_known(map
);
3808 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
3809 for (i
= 1 ; i
< map
->n
; ++i
) {
3811 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
3812 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
3813 res
= isl_map_union_disjoint(res
, r2
);
3815 res
= isl_map_union(res
, r2
);
3822 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
3824 return (struct isl_set
*)
3825 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
3828 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
3830 return (struct isl_set
*)
3831 isl_map_compute_divs((struct isl_map
*)set
);
3834 struct isl_set
*isl_map_domain(struct isl_map
*map
)
3837 struct isl_set
*set
;
3842 map
= isl_map_cow(map
);
3846 set
= (struct isl_set
*)map
;
3847 set
->dim
= isl_dim_domain(set
->dim
);
3850 for (i
= 0; i
< map
->n
; ++i
) {
3851 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
3855 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3856 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3863 struct isl_map
*isl_map_union_disjoint(
3864 struct isl_map
*map1
, struct isl_map
*map2
)
3868 struct isl_map
*map
= NULL
;
3882 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3884 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3885 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3886 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3888 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3889 map1
->n
+ map2
->n
, flags
);
3892 for (i
= 0; i
< map1
->n
; ++i
) {
3893 map
= isl_map_add(map
,
3894 isl_basic_map_copy(map1
->p
[i
]));
3898 for (i
= 0; i
< map2
->n
; ++i
) {
3899 map
= isl_map_add(map
,
3900 isl_basic_map_copy(map2
->p
[i
]));
3914 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
3916 map1
= isl_map_union_disjoint(map1
, map2
);
3920 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
3924 struct isl_set
*isl_set_union_disjoint(
3925 struct isl_set
*set1
, struct isl_set
*set2
)
3927 return (struct isl_set
*)
3928 isl_map_union_disjoint(
3929 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3932 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
3934 return (struct isl_set
*)
3935 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3938 struct isl_map
*isl_map_intersect_range(
3939 struct isl_map
*map
, struct isl_set
*set
)
3942 struct isl_map
*result
;
3948 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
3949 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
3950 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3952 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
3953 map
->n
* set
->n
, flags
);
3956 for (i
= 0; i
< map
->n
; ++i
)
3957 for (j
= 0; j
< set
->n
; ++j
) {
3958 result
= isl_map_add(result
,
3959 isl_basic_map_intersect_range(
3960 isl_basic_map_copy(map
->p
[i
]),
3961 isl_basic_set_copy(set
->p
[j
])));
3974 struct isl_map
*isl_map_intersect_domain(
3975 struct isl_map
*map
, struct isl_set
*set
)
3977 return isl_map_reverse(
3978 isl_map_intersect_range(isl_map_reverse(map
), set
));
3981 struct isl_map
*isl_map_apply_domain(
3982 struct isl_map
*map1
, struct isl_map
*map2
)
3986 map1
= isl_map_reverse(map1
);
3987 map1
= isl_map_apply_range(map1
, map2
);
3988 return isl_map_reverse(map1
);
3995 struct isl_map
*isl_map_apply_range(
3996 struct isl_map
*map1
, struct isl_map
*map2
)
3998 struct isl_dim
*dim_result
;
3999 struct isl_map
*result
;
4005 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
4006 isl_dim_copy(map2
->dim
));
4008 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
4011 for (i
= 0; i
< map1
->n
; ++i
)
4012 for (j
= 0; j
< map2
->n
; ++j
) {
4013 result
= isl_map_add(result
,
4014 isl_basic_map_apply_range(
4015 isl_basic_map_copy(map1
->p
[i
]),
4016 isl_basic_map_copy(map2
->p
[j
])));
4022 if (result
&& result
->n
<= 1)
4023 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
4032 * returns range - domain
4034 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
4036 struct isl_basic_set
*bset
;
4043 dim
= isl_basic_map_n_in(bmap
);
4044 nparam
= isl_basic_map_n_param(bmap
);
4045 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
4046 bset
= isl_basic_set_from_basic_map(bmap
);
4047 bset
= isl_basic_set_cow(bset
);
4048 bset
= isl_basic_set_extend(bset
, nparam
, 3*dim
, 0, dim
, 0);
4049 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
4050 for (i
= 0; i
< dim
; ++i
) {
4051 int j
= isl_basic_map_alloc_equality(
4052 (struct isl_basic_map
*)bset
);
4055 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
4056 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
4057 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
4058 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
4060 return isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
4062 isl_basic_map_free(bmap
);
4067 * returns range - domain
4069 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
4072 struct isl_set
*result
;
4077 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
4078 result
= isl_set_alloc(map
->ctx
, isl_map_n_param(map
),
4079 isl_map_n_in(map
), map
->n
, map
->flags
);
4082 for (i
= 0; i
< map
->n
; ++i
)
4083 result
= isl_set_add(result
,
4084 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
4092 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
4094 struct isl_basic_map
*bmap
;
4102 nparam
= dims
->nparam
;
4104 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
4108 for (i
= 0; i
< dim
; ++i
) {
4109 int j
= isl_basic_map_alloc_equality(bmap
);
4112 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4113 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
4114 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
4116 return isl_basic_map_finalize(bmap
);
4118 isl_basic_map_free(bmap
);
4122 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
4124 struct isl_dim
*dim
= isl_dim_map(set_dim
);
4127 return basic_map_identity(dim
);
4130 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
4132 if (!model
|| !model
->dim
)
4134 isl_assert(model
->ctx
,
4135 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4136 return basic_map_identity(isl_dim_copy(model
->dim
));
4139 static struct isl_map
*map_identity(struct isl_dim
*dim
)
4141 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
4142 return isl_map_add(map
, basic_map_identity(isl_dim_copy(dim
)));
4145 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
4147 struct isl_dim
*dim
= isl_dim_map(set_dim
);
4150 return map_identity(dim
);
4153 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
4155 if (!model
|| !model
->dim
)
4157 isl_assert(model
->ctx
,
4158 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4159 return map_identity(isl_dim_copy(model
->dim
));
4162 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
4164 if (!model
|| !model
->dim
)
4166 isl_assert(model
->ctx
,
4167 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4168 return map_identity(isl_dim_copy(model
->dim
));
4171 /* Construct a basic set with all set dimensions having only non-negative
4174 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
4179 struct isl_basic_set
*bset
;
4183 nparam
= dims
->nparam
;
4185 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
4188 for (i
= 0; i
< dim
; ++i
) {
4189 int k
= isl_basic_set_alloc_inequality(bset
);
4192 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
4193 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
4197 isl_basic_set_free(bset
);
4201 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
4203 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
4206 int isl_basic_map_is_subset(
4207 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4210 struct isl_map
*map1
;
4211 struct isl_map
*map2
;
4213 if (!bmap1
|| !bmap2
)
4216 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
4217 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
4219 is_subset
= isl_map_is_subset(map1
, map2
);
4227 int isl_basic_map_is_equal(
4228 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4232 if (!bmap1
|| !bmap2
)
4234 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
4237 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
4241 int isl_basic_set_is_equal(
4242 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
4244 return isl_basic_map_is_equal(
4245 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
4248 int isl_map_is_empty(struct isl_map
*map
)
4255 for (i
= 0; i
< map
->n
; ++i
) {
4256 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
4265 int isl_map_fast_is_empty(struct isl_map
*map
)
4270 int isl_set_is_empty(struct isl_set
*set
)
4272 return isl_map_is_empty((struct isl_map
*)set
);
4275 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
4281 is_subset
= isl_map_is_subset(map1
, map2
);
4284 is_subset
= isl_map_is_subset(map2
, map1
);
4288 int isl_basic_map_is_strict_subset(
4289 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4293 if (!bmap1
|| !bmap2
)
4295 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
4298 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
4299 if (is_subset
== -1)
4304 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
4310 is_subset
= isl_map_is_subset(map1
, map2
);
4313 is_subset
= isl_map_is_subset(map2
, map1
);
4314 if (is_subset
== -1)
4319 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
4321 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
4324 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
4328 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
4331 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
4335 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
4338 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
4343 return map
->n
== 1 && isl_basic_map_is_universe(map
->p
[0]);
4346 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
4348 struct isl_basic_set
*bset
= NULL
;
4349 struct isl_vec
*sample
= NULL
;
4356 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
4359 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
4360 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
4361 copy
= isl_basic_map_convex_hull(copy
);
4362 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
4363 isl_basic_map_free(copy
);
4367 total
= 1 + isl_basic_map_total_dim(bmap
);
4368 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
4369 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
4375 isl_vec_free(bmap
->sample
);
4376 bmap
->sample
= NULL
;
4377 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
4380 sample
= isl_basic_set_sample_vec(bset
);
4383 empty
= sample
->size
== 0;
4384 isl_vec_free(bmap
->sample
);
4385 bmap
->sample
= sample
;
4387 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
4392 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
4396 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
4399 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
4403 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
4406 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
4408 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
4411 struct isl_map
*isl_basic_map_union(
4412 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4414 struct isl_map
*map
;
4415 if (!bmap1
|| !bmap2
)
4418 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
4420 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
4423 map
= isl_map_add(map
, bmap1
);
4424 map
= isl_map_add(map
, bmap2
);
4427 isl_basic_map_free(bmap1
);
4428 isl_basic_map_free(bmap2
);
4432 struct isl_set
*isl_basic_set_union(
4433 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
4435 return (struct isl_set
*)isl_basic_map_union(
4436 (struct isl_basic_map
*)bset1
,
4437 (struct isl_basic_map
*)bset2
);
4440 /* Order divs such that any div only depends on previous divs */
4441 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
4444 unsigned off
= isl_dim_total(bmap
->dim
);
4446 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4448 if (isl_int_is_zero(bmap
->div
[i
][0]))
4450 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
4454 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
4460 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
4462 return (struct isl_basic_set
*)
4463 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
4466 /* Look for a div in dst that corresponds to the div "div" in src.
4467 * The divs before "div" in src and dst are assumed to be the same.
4469 * Returns -1 if no corresponding div was found and the position
4470 * of the corresponding div in dst otherwise.
4472 static int find_div(struct isl_basic_map
*dst
,
4473 struct isl_basic_map
*src
, unsigned div
)
4477 unsigned total
= isl_dim_total(src
->dim
);
4479 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
4480 for (i
= div
; i
< dst
->n_div
; ++i
)
4481 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
4482 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
4483 dst
->n_div
- div
) == -1)
4488 struct isl_basic_map
*isl_basic_map_align_divs(
4489 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
4492 unsigned total
= isl_dim_total(src
->dim
);
4497 if (src
->n_div
== 0)
4500 for (i
= 0; i
< src
->n_div
; ++i
)
4501 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
4503 src
= isl_basic_map_order_divs(src
);
4504 dst
= isl_basic_map_cow(dst
);
4505 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
4506 src
->n_div
, 0, 2 * src
->n_div
);
4509 for (i
= 0; i
< src
->n_div
; ++i
) {
4510 int j
= find_div(dst
, src
, i
);
4512 j
= isl_basic_map_alloc_div(dst
);
4515 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
4516 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
4517 if (add_div_constraints(dst
, j
) < 0)
4521 isl_basic_map_swap_div(dst
, i
, j
);
4525 isl_basic_map_free(dst
);
4529 struct isl_basic_set
*isl_basic_set_align_divs(
4530 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
4532 return (struct isl_basic_set
*)isl_basic_map_align_divs(
4533 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
4536 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
4544 map
= isl_map_compute_divs(map
);
4545 map
= isl_map_cow(map
);
4549 for (i
= 1; i
< map
->n
; ++i
)
4550 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
4551 for (i
= 1; i
< map
->n
; ++i
)
4552 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
4554 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4558 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
4560 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
4563 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
4567 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
4568 map
= isl_map_intersect_domain(map
, set
);
4569 set
= isl_map_range(map
);
4577 /* There is no need to cow as removing empty parts doesn't change
4578 * the meaning of the set.
4580 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
4587 for (i
= map
->n
-1; i
>= 0; --i
) {
4588 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
4590 isl_basic_map_free(map
->p
[i
]);
4591 if (i
!= map
->n
-1) {
4592 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4593 map
->p
[i
] = map
->p
[map
->n
-1];
4601 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
4603 return (struct isl_set
*)
4604 isl_map_remove_empty_parts((struct isl_map
*)set
);
4607 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
4609 struct isl_basic_map
*bmap
;
4610 if (!map
|| map
->n
== 0)
4612 bmap
= map
->p
[map
->n
-1];
4613 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
4614 return isl_basic_map_copy(bmap
);
4617 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
4619 return (struct isl_basic_set
*)
4620 isl_map_copy_basic_map((struct isl_map
*)set
);
4623 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
4624 __isl_keep isl_basic_map
*bmap
)
4630 for (i
= map
->n
-1; i
>= 0; --i
) {
4631 if (map
->p
[i
] != bmap
)
4633 map
= isl_map_cow(map
);
4636 isl_basic_map_free(map
->p
[i
]);
4637 if (i
!= map
->n
-1) {
4638 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
4639 map
->p
[i
] = map
->p
[map
->n
-1];
4650 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
4651 struct isl_basic_set
*bset
)
4653 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
4654 (struct isl_basic_map
*)bset
);
4657 /* Given two basic sets bset1 and bset2, compute the maximal difference
4658 * between the values of dimension pos in bset1 and those in bset2
4659 * for any common value of the parameters and dimensions preceding pos.
4661 static enum isl_lp_result
basic_set_maximal_difference_at(
4662 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
4663 int pos
, isl_int
*opt
)
4665 struct isl_dim
*dims
;
4666 struct isl_basic_map
*bmap1
= NULL
;
4667 struct isl_basic_map
*bmap2
= NULL
;
4668 struct isl_ctx
*ctx
;
4669 struct isl_vec
*obj
;
4672 unsigned dim1
, dim2
;
4673 enum isl_lp_result res
;
4675 if (!bset1
|| !bset2
)
4676 return isl_lp_error
;
4678 nparam
= isl_basic_set_n_param(bset1
);
4679 dim1
= isl_basic_set_n_dim(bset1
);
4680 dim2
= isl_basic_set_n_dim(bset2
);
4681 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
4682 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
4683 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
4684 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
4685 if (!bmap1
|| !bmap2
)
4687 bmap1
= isl_basic_map_cow(bmap1
);
4688 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
4689 pos
, (dim1
- pos
) + (dim2
- pos
),
4690 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
4691 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
4694 total
= isl_basic_map_total_dim(bmap1
);
4696 obj
= isl_vec_alloc(ctx
, 1 + total
);
4697 isl_seq_clr(obj
->block
.data
, 1 + total
);
4698 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
4699 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
4702 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
4704 isl_basic_map_free(bmap1
);
4708 isl_basic_map_free(bmap1
);
4709 isl_basic_map_free(bmap2
);
4710 return isl_lp_error
;
4713 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4714 * for any common value of the parameters and dimensions preceding pos
4715 * in both basic sets, the values of dimension pos in bset1 are
4716 * smaller or larger than those in bset2.
4719 * 1 if bset1 follows bset2
4720 * -1 if bset1 precedes bset2
4721 * 0 if bset1 and bset2 are incomparable
4722 * -2 if some error occurred.
4724 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
4725 struct isl_basic_set
*bset2
, int pos
)
4728 enum isl_lp_result res
;
4733 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
4735 if (res
== isl_lp_empty
)
4737 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
4738 res
== isl_lp_unbounded
)
4740 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
4749 /* Given two basic sets bset1 and bset2, check whether
4750 * for any common value of the parameters and dimensions preceding pos
4751 * there is a value of dimension pos in bset1 that is larger
4752 * than a value of the same dimension in bset2.
4755 * 1 if there exists such a pair
4756 * 0 if there is no such pair, but there is a pair of equal values
4758 * -2 if some error occurred.
4760 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
4761 __isl_keep isl_basic_set
*bset2
, int pos
)
4764 enum isl_lp_result res
;
4769 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
4771 if (res
== isl_lp_empty
)
4773 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
4774 res
== isl_lp_unbounded
)
4776 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
4778 else if (res
== isl_lp_ok
)
4787 /* Given two sets set1 and set2, check whether
4788 * for any common value of the parameters and dimensions preceding pos
4789 * there is a value of dimension pos in set1 that is larger
4790 * than a value of the same dimension in set2.
4793 * 1 if there exists such a pair
4794 * 0 if there is no such pair, but there is a pair of equal values
4796 * -2 if some error occurred.
4798 int isl_set_follows_at(__isl_keep isl_set
*set1
,
4799 __isl_keep isl_set
*set2
, int pos
)
4807 for (i
= 0; i
< set1
->n
; ++i
)
4808 for (j
= 0; j
< set2
->n
; ++j
) {
4810 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
4811 if (f
== 1 || f
== -2)
4820 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
4821 unsigned pos
, isl_int
*val
)
4829 total
= isl_basic_map_total_dim(bmap
);
4830 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
4831 for (; d
+1 > pos
; --d
)
4832 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
4836 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
4838 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
4840 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
4843 isl_int_neg(*val
, bmap
->eq
[i
][0]);
4849 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
4850 unsigned pos
, isl_int
*val
)
4862 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
4865 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
4866 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
4867 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
4868 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4872 isl_int_set(*val
, v
);
4878 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
4879 unsigned pos
, isl_int
*val
)
4881 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
4885 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
4888 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
4891 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
4892 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
4894 if (pos
>= isl_basic_map_dim(bmap
, type
))
4896 return isl_basic_map_fast_has_fixed_var(bmap
,
4897 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
4900 int isl_map_fast_is_fixed(struct isl_map
*map
,
4901 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
4903 if (pos
>= isl_map_dim(map
, type
))
4905 return isl_map_fast_has_fixed_var(map
,
4906 map_offset(map
, type
) - 1 + pos
, val
);
4909 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4910 * then return this fixed value in *val.
4912 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
4915 return isl_basic_set_fast_has_fixed_var(bset
,
4916 isl_basic_set_n_param(bset
) + dim
, val
);
4919 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4920 * then return this fixed value in *val.
4922 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
4924 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
4927 /* Check if input variable in has fixed value and if so and if val is not NULL,
4928 * then return this fixed value in *val.
4930 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
4932 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
4935 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4936 * and if val is not NULL, then return this lower bound in *val.
4938 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
4939 unsigned dim
, isl_int
*val
)
4941 int i
, i_eq
= -1, i_ineq
= -1;
4948 total
= isl_basic_set_total_dim(bset
);
4949 nparam
= isl_basic_set_n_param(bset
);
4950 for (i
= 0; i
< bset
->n_eq
; ++i
) {
4951 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
4957 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
4958 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
4960 if (i_eq
!= -1 || i_ineq
!= -1)
4964 if (i_eq
== -1 && i_ineq
== -1)
4966 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
4967 /* The coefficient should always be one due to normalization. */
4968 if (!isl_int_is_one(c
[1+nparam
+dim
]))
4970 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
4972 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
4973 total
- nparam
- dim
- 1) != -1)
4976 isl_int_neg(*val
, c
[0]);
4980 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
4981 unsigned dim
, isl_int
*val
)
4993 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4997 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4999 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
5000 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
5002 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5006 isl_int_set(*val
, v
);
5017 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
5019 const struct constraint
*c1
= (const struct constraint
*)p1
;
5020 const struct constraint
*c2
= (const struct constraint
*)p2
;
5021 unsigned size
= isl_min(c1
->size
, c2
->size
);
5022 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
5025 static struct isl_basic_map
*isl_basic_map_sort_constraints(
5026 struct isl_basic_map
*bmap
)
5029 struct constraint
*c
;
5034 total
= isl_basic_map_total_dim(bmap
);
5035 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
5038 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
5040 c
[i
].c
= bmap
->ineq
[i
];
5042 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
5043 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
5044 bmap
->ineq
[i
] = c
[i
].c
;
5048 isl_basic_map_free(bmap
);
5052 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
5056 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
5058 bmap
= isl_basic_map_convex_hull(bmap
);
5059 bmap
= isl_basic_map_sort_constraints(bmap
);
5060 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
5064 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
5066 return (struct isl_basic_set
*)isl_basic_map_normalize(
5067 (struct isl_basic_map
*)bset
);
5070 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
5071 const struct isl_basic_map
*bmap2
)
5078 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
5079 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
5080 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
5081 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5082 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
5083 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5084 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
5085 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
5087 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
5089 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
5091 if (bmap1
->n_eq
!= bmap2
->n_eq
)
5092 return bmap1
->n_eq
- bmap2
->n_eq
;
5093 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
5094 return bmap1
->n_ineq
- bmap2
->n_ineq
;
5095 if (bmap1
->n_div
!= bmap2
->n_div
)
5096 return bmap1
->n_div
- bmap2
->n_div
;
5097 total
= isl_basic_map_total_dim(bmap1
);
5098 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
5099 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
5103 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
5104 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
5108 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
5109 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
5116 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
5117 struct isl_basic_map
*bmap2
)
5119 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
5122 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
5124 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
5125 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
5127 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
5130 /* We normalize in place, but if anything goes wrong we need
5131 * to return NULL, so we need to make sure we don't change the
5132 * meaning of any possible other copies of map.
5134 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
5137 struct isl_basic_map
*bmap
;
5141 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
5143 for (i
= 0; i
< map
->n
; ++i
) {
5144 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
5147 isl_basic_map_free(map
->p
[i
]);
5150 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
5151 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
5152 map
= isl_map_remove_empty_parts(map
);
5155 for (i
= map
->n
- 1; i
>= 1; --i
) {
5156 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
5158 isl_basic_map_free(map
->p
[i
-1]);
5159 for (j
= i
; j
< map
->n
; ++j
)
5160 map
->p
[j
-1] = map
->p
[j
];
5170 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
5172 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
5175 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5185 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
5188 map1
= isl_map_copy(map1
);
5189 map2
= isl_map_copy(map2
);
5190 map1
= isl_map_normalize(map1
);
5191 map2
= isl_map_normalize(map2
);
5194 equal
= map1
->n
== map2
->n
;
5195 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
5196 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
5209 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5211 return isl_map_fast_is_equal((struct isl_map
*)set1
,
5212 (struct isl_map
*)set2
);
5215 /* Return an interval that ranges from min to max (inclusive)
5217 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
5218 isl_int min
, isl_int max
)
5221 struct isl_basic_set
*bset
= NULL
;
5223 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
5227 k
= isl_basic_set_alloc_inequality(bset
);
5230 isl_int_set_si(bset
->ineq
[k
][1], 1);
5231 isl_int_neg(bset
->ineq
[k
][0], min
);
5233 k
= isl_basic_set_alloc_inequality(bset
);
5236 isl_int_set_si(bset
->ineq
[k
][1], -1);
5237 isl_int_set(bset
->ineq
[k
][0], max
);
5241 isl_basic_set_free(bset
);
5245 /* Return the Cartesian product of the basic sets in list (in the given order).
5247 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
5255 struct isl_basic_set
*product
= NULL
;
5259 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
5260 isl_assert(list
->ctx
, list
->p
[0], goto error
);
5261 nparam
= isl_basic_set_n_param(list
->p
[0]);
5262 dim
= isl_basic_set_n_dim(list
->p
[0]);
5263 extra
= list
->p
[0]->n_div
;
5264 n_eq
= list
->p
[0]->n_eq
;
5265 n_ineq
= list
->p
[0]->n_ineq
;
5266 for (i
= 1; i
< list
->n
; ++i
) {
5267 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
5268 isl_assert(list
->ctx
,
5269 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
5270 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
5271 extra
+= list
->p
[i
]->n_div
;
5272 n_eq
+= list
->p
[i
]->n_eq
;
5273 n_ineq
+= list
->p
[i
]->n_ineq
;
5275 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
5280 for (i
= 0; i
< list
->n
; ++i
) {
5281 isl_basic_set_add_constraints(product
,
5282 isl_basic_set_copy(list
->p
[i
]), dim
);
5283 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
5285 isl_basic_set_list_free(list
);
5288 isl_basic_set_free(product
);
5289 isl_basic_set_list_free(list
);
5293 struct isl_basic_map
*isl_basic_map_product(
5294 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5296 struct isl_dim
*dim_result
= NULL
;
5297 struct isl_basic_map
*bmap
;
5298 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
5299 struct isl_dim_map
*dim_map1
, *dim_map2
;
5301 if (!bmap1
|| !bmap2
)
5304 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
5305 bmap2
->dim
, isl_dim_param
), goto error
);
5306 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
5307 isl_dim_copy(bmap2
->dim
));
5309 in1
= isl_basic_map_n_in(bmap1
);
5310 in2
= isl_basic_map_n_in(bmap2
);
5311 out1
= isl_basic_map_n_out(bmap1
);
5312 out2
= isl_basic_map_n_out(bmap2
);
5313 nparam
= isl_basic_map_n_param(bmap1
);
5315 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
5316 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
5317 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
5318 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
5319 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
5320 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
5321 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
5322 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
5323 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
5324 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
5325 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
5327 bmap
= isl_basic_map_alloc_dim(dim_result
,
5328 bmap1
->n_div
+ bmap2
->n_div
,
5329 bmap1
->n_eq
+ bmap2
->n_eq
,
5330 bmap1
->n_ineq
+ bmap2
->n_ineq
);
5331 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
5332 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
5333 bmap
= isl_basic_map_simplify(bmap
);
5334 return isl_basic_map_finalize(bmap
);
5336 isl_basic_map_free(bmap1
);
5337 isl_basic_map_free(bmap2
);
5341 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5343 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
5346 struct isl_map
*result
;
5352 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
5353 map2
->dim
, isl_dim_param
), goto error
);
5355 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5356 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5357 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5359 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
5360 isl_dim_copy(map2
->dim
)),
5361 map1
->n
* map2
->n
, flags
);
5364 for (i
= 0; i
< map1
->n
; ++i
)
5365 for (j
= 0; j
< map2
->n
; ++j
) {
5366 struct isl_basic_map
*part
;
5367 part
= isl_basic_map_product(
5368 isl_basic_map_copy(map1
->p
[i
]),
5369 isl_basic_map_copy(map2
->p
[j
]));
5370 if (isl_basic_map_is_empty(part
))
5371 isl_basic_map_free(part
);
5373 result
= isl_map_add(result
, part
);
5386 /* Given two set A and B, construct its Cartesian product A x B.
5388 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
5390 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
5391 (struct isl_map
*)set2
);
5394 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
5397 uint32_t hash
= isl_hash_init();
5402 bset
= isl_basic_set_copy(bset
);
5403 bset
= isl_basic_set_normalize(bset
);
5406 total
= isl_basic_set_total_dim(bset
);
5407 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
5408 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5410 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
5411 isl_hash_hash(hash
, c_hash
);
5413 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
5414 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5416 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
5417 isl_hash_hash(hash
, c_hash
);
5419 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
5420 for (i
= 0; i
< bset
->n_div
; ++i
) {
5422 if (isl_int_is_zero(bset
->div
[i
][0]))
5424 isl_hash_byte(hash
, i
& 0xFF);
5425 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
5426 isl_hash_hash(hash
, c_hash
);
5428 isl_basic_set_free(bset
);
5432 uint32_t isl_set_get_hash(struct isl_set
*set
)
5439 set
= isl_set_copy(set
);
5440 set
= isl_set_normalize(set
);
5444 hash
= isl_hash_init();
5445 for (i
= 0; i
< set
->n
; ++i
) {
5447 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
5448 isl_hash_hash(hash
, bset_hash
);
5456 /* Check if the value for dimension dim is completely determined
5457 * by the values of the other parameters and variables.
5458 * That is, check if dimension dim is involved in an equality.
5460 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
5467 nparam
= isl_basic_set_n_param(bset
);
5468 for (i
= 0; i
< bset
->n_eq
; ++i
)
5469 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
5474 /* Check if the value for dimension dim is completely determined
5475 * by the values of the other parameters and variables.
5476 * That is, check if dimension dim is involved in an equality
5477 * for each of the subsets.
5479 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
5485 for (i
= 0; i
< set
->n
; ++i
) {
5487 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
5494 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
5495 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
5502 for (i
= 0; i
< map
->n
; ++i
)
5503 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
5509 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
5510 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
5517 for (i
= 0; i
< set
->n
; ++i
)
5518 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
5524 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
5526 struct isl_dim
*dim
;
5527 struct isl_basic_map
*bmap
;
5534 set
= isl_set_align_divs(set
);
5539 dim
= isl_set_get_dim(set
);
5540 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
5542 return isl_map_identity(dim
);
5545 n_div
= set
->p
[0]->n_div
;
5546 dim
= isl_dim_map(dim
);
5547 n_param
= isl_dim_size(dim
, isl_dim_param
);
5548 n_set
= isl_dim_size(dim
, isl_dim_in
);
5549 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
5550 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
5551 for (i
= 0; i
< n_set
; ++i
)
5552 bmap
= var_equal(bmap
, i
);
5554 total
= n_param
+ n_set
+ n_set
+ n_div
;
5555 for (i
= 0; i
< n_div
; ++i
) {
5556 k
= isl_basic_map_alloc_inequality(bmap
);
5559 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
5560 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
5561 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
5562 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
5563 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
5564 set
->p
[0]->div
[i
][0]);
5566 l
= isl_basic_map_alloc_inequality(bmap
);
5569 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
5570 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
5571 set
->p
[0]->div
[i
][0]);
5572 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
5576 return isl_map_from_basic_map(bmap
);
5579 isl_basic_map_free(bmap
);
5583 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
5591 dim
= isl_basic_set_total_dim(bset
);
5592 size
+= bset
->n_eq
* (1 + dim
);
5593 size
+= bset
->n_ineq
* (1 + dim
);
5594 size
+= bset
->n_div
* (2 + dim
);
5599 int isl_set_size(__isl_keep isl_set
*set
)
5607 for (i
= 0; i
< set
->n
; ++i
)
5608 size
+= isl_basic_set_size(set
->p
[i
]);