2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include "isl_sample.h"
30 /* Maps dst positions to src positions */
36 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
39 struct isl_dim_map
*dim_map
;
40 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
41 sizeof(struct isl_dim_map
) + len
* sizeof(int));
44 dim_map
->len
= 1 + len
;
46 for (i
= 0; i
< len
; ++i
)
47 dim_map
->pos
[1 + i
] = -1;
51 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
54 case isl_dim_param
: return dim
->nparam
;
55 case isl_dim_in
: return dim
->n_in
;
56 case isl_dim_out
: return dim
->n_out
;
57 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
62 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
65 case isl_dim_param
: return 1;
66 case isl_dim_in
: return 1 + dim
->nparam
;
67 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
72 static void isl_dim_map_dim_range(struct isl_dim_map
*dim_map
,
73 struct isl_dim
*dim
, enum isl_dim_type type
,
74 unsigned first
, unsigned n
, unsigned dst_pos
)
82 src_pos
= pos(dim
, type
);
83 for (i
= 0; i
< n
; ++i
)
84 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ first
+ i
;
87 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
88 enum isl_dim_type type
, unsigned dst_pos
)
90 isl_dim_map_dim_range(dim_map
, dim
, type
, 0, n(dim
, type
), dst_pos
);
93 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
94 struct isl_basic_map
*bmap
, unsigned dst_pos
)
99 if (!dim_map
|| !bmap
)
102 src_pos
= 1 + isl_dim_total(bmap
->dim
);
103 for (i
= 0; i
< bmap
->n_div
; ++i
)
104 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
107 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
111 for (i
= 0; i
< dim_map
->len
; ++i
)
112 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
113 fprintf(stderr
, "\n");
116 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
117 enum isl_dim_type type
)
122 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
123 case isl_dim_div
: return bmap
->n_div
;
124 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
129 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
131 return map
? n(map
->dim
, type
) : 0;
134 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
136 return set
? n(set
->dim
, type
) : 0;
139 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
140 enum isl_dim_type type
)
142 struct isl_dim
*dim
= bmap
->dim
;
144 case isl_dim_param
: return 1;
145 case isl_dim_in
: return 1 + dim
->nparam
;
146 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
147 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
152 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
154 return pos(map
->dim
, type
);
157 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
158 enum isl_dim_type type
)
160 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
163 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
165 return bset
->dim
->n_out
;
168 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
170 return bset
->dim
->nparam
;
173 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
175 return isl_dim_total(bset
->dim
) + bset
->n_div
;
178 unsigned isl_set_n_dim(const struct isl_set
*set
)
180 return set
->dim
->n_out
;
183 unsigned isl_set_n_param(const struct isl_set
*set
)
185 return set
->dim
->nparam
;
188 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
190 return bmap
->dim
->n_in
;
193 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
195 return bmap
->dim
->n_out
;
198 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
200 return bmap
->dim
->nparam
;
203 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
208 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
210 return isl_dim_total(bmap
->dim
) + bmap
->n_div
;
213 unsigned isl_map_n_in(const struct isl_map
*map
)
215 return map
->dim
->n_in
;
218 unsigned isl_map_n_out(const struct isl_map
*map
)
220 return map
->dim
->n_out
;
223 unsigned isl_map_n_param(const struct isl_map
*map
)
225 return map
->dim
->nparam
;
228 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
230 return map
->dim
->n_in
== set
->dim
->n_out
&&
231 map
->dim
->nparam
== set
->dim
->nparam
;
234 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
235 struct isl_basic_set
*bset
)
237 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
238 bmap
->dim
->nparam
== bset
->dim
->nparam
;
241 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
242 struct isl_basic_set
*bset
)
244 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
245 bmap
->dim
->nparam
== bset
->dim
->nparam
;
248 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
252 return isl_dim_copy(bmap
->dim
);
255 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
259 return isl_dim_copy(bset
->dim
);
262 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
266 return isl_dim_copy(map
->dim
);
269 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
273 return isl_dim_copy(set
->dim
);
276 int isl_basic_map_is_rational(__isl_keep isl_basic_map
*bmap
)
280 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
);
283 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
284 struct isl_basic_map
*bmap
, unsigned extra
,
285 unsigned n_eq
, unsigned n_ineq
)
288 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
290 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
291 if (isl_blk_is_error(bmap
->block
)) {
296 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
298 isl_blk_free(ctx
, bmap
->block
);
304 bmap
->block2
= isl_blk_empty();
307 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
308 if (isl_blk_is_error(bmap
->block2
)) {
310 isl_blk_free(ctx
, bmap
->block
);
315 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
317 isl_blk_free(ctx
, bmap
->block2
);
319 isl_blk_free(ctx
, bmap
->block
);
325 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
326 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
328 for (i
= 0; i
< extra
; ++i
)
329 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
335 bmap
->c_size
= n_eq
+ n_ineq
;
336 bmap
->eq
= bmap
->ineq
+ n_ineq
;
346 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
347 unsigned nparam
, unsigned dim
, unsigned extra
,
348 unsigned n_eq
, unsigned n_ineq
)
350 struct isl_basic_map
*bmap
;
351 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
352 return (struct isl_basic_set
*)bmap
;
355 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
356 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
358 struct isl_basic_map
*bmap
;
361 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
362 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
363 return (struct isl_basic_set
*)bmap
;
366 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
367 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
369 struct isl_basic_map
*bmap
;
373 bmap
= isl_alloc_type(dim
->ctx
, struct isl_basic_map
);
378 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
384 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
385 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
386 unsigned n_eq
, unsigned n_ineq
)
388 struct isl_basic_map
*bmap
;
391 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
395 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
399 static void dup_constraints(
400 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
403 unsigned total
= isl_basic_map_total_dim(src
);
405 for (i
= 0; i
< src
->n_eq
; ++i
) {
406 int j
= isl_basic_map_alloc_equality(dst
);
407 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
410 for (i
= 0; i
< src
->n_ineq
; ++i
) {
411 int j
= isl_basic_map_alloc_inequality(dst
);
412 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
415 for (i
= 0; i
< src
->n_div
; ++i
) {
416 int j
= isl_basic_map_alloc_div(dst
);
417 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
419 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
422 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
424 struct isl_basic_map
*dup
;
428 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
429 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
432 dup_constraints(dup
, bmap
);
433 dup
->flags
= bmap
->flags
;
434 dup
->sample
= isl_vec_copy(bmap
->sample
);
438 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
440 struct isl_basic_map
*dup
;
442 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
443 return (struct isl_basic_set
*)dup
;
446 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
451 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
455 return isl_basic_set_dup(bset
);
458 struct isl_set
*isl_set_copy(struct isl_set
*set
)
467 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
472 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
476 bmap
= isl_basic_map_dup(bmap
);
478 ISL_F_SET(bmap
, ISL_BASIC_SET_FINAL
);
482 struct isl_map
*isl_map_copy(struct isl_map
*map
)
491 void isl_basic_map_free(struct isl_basic_map
*bmap
)
499 isl_ctx_deref(bmap
->ctx
);
501 isl_blk_free(bmap
->ctx
, bmap
->block2
);
503 isl_blk_free(bmap
->ctx
, bmap
->block
);
504 isl_vec_free(bmap
->sample
);
505 isl_dim_free(bmap
->dim
);
509 void isl_basic_set_free(struct isl_basic_set
*bset
)
511 isl_basic_map_free((struct isl_basic_map
*)bset
);
514 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
516 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
519 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
525 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
526 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
528 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
529 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
530 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
531 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
532 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
533 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
535 int j
= isl_basic_map_alloc_inequality(bmap
);
539 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
540 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
547 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
548 bmap
->extra
- bmap
->n_div
);
552 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
554 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
557 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
561 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
566 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
568 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
571 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
576 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
578 if (pos
!= bmap
->n_eq
- 1) {
580 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
581 bmap
->eq
[bmap
->n_eq
- 1] = t
;
587 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
589 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
592 void isl_basic_map_inequality_to_equality(
593 struct isl_basic_map
*bmap
, unsigned pos
)
598 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
599 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
604 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
605 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
606 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
607 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
610 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
612 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
615 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
621 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
622 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
623 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
624 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
625 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
626 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
627 1 + isl_basic_map_total_dim(bmap
),
628 bmap
->extra
- bmap
->n_div
);
629 return bmap
->n_ineq
++;
632 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
634 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
637 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
641 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
646 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
648 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
651 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
656 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
658 if (pos
!= bmap
->n_ineq
- 1) {
660 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
661 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
662 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
668 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
670 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
673 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
678 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
681 k
= isl_basic_map_alloc_equality(bmap
);
684 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
687 isl_basic_map_free(bmap
);
691 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
694 return (isl_basic_set
*)
695 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
698 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
703 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
706 k
= isl_basic_map_alloc_inequality(bmap
);
709 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
712 isl_basic_map_free(bmap
);
716 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
719 return (isl_basic_set
*)
720 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
723 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
727 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
728 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
729 1 + 1 + isl_basic_map_total_dim(bmap
),
730 bmap
->extra
- bmap
->n_div
);
731 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
732 return bmap
->n_div
++;
735 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
737 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
740 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
744 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
749 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
751 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
754 /* Copy constraint from src to dst, putting the vars of src at offset
755 * dim_off in dst and the divs of src at offset div_off in dst.
756 * If both sets are actually map, then dim_off applies to the input
759 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
760 struct isl_basic_map
*src_map
, isl_int
*src
,
761 unsigned in_off
, unsigned out_off
, unsigned div_off
)
763 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
764 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
765 unsigned src_in
= isl_basic_map_n_in(src_map
);
766 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
767 unsigned src_out
= isl_basic_map_n_out(src_map
);
768 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
769 isl_int_set(dst
[0], src
[0]);
770 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
771 if (dst_nparam
> src_nparam
)
772 isl_seq_clr(dst
+1+src_nparam
,
773 dst_nparam
- src_nparam
);
774 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
775 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
777 isl_min(dst_in
-in_off
, src_in
));
778 if (dst_in
-in_off
> src_in
)
779 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
780 dst_in
- in_off
- src_in
);
781 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
782 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
783 src
+1+src_nparam
+src_in
,
784 isl_min(dst_out
-out_off
, src_out
));
785 if (dst_out
-out_off
> src_out
)
786 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
787 dst_out
- out_off
- src_out
);
788 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
789 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
790 src
+1+src_nparam
+src_in
+src_out
,
791 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
792 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
793 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
794 div_off
+src_map
->n_div
,
795 dst_map
->n_div
- div_off
- src_map
->n_div
);
798 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
799 struct isl_basic_map
*src_map
, isl_int
*src
,
800 unsigned in_off
, unsigned out_off
, unsigned div_off
)
802 isl_int_set(dst
[0], src
[0]);
803 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
806 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
807 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
812 if (!bmap1
|| !bmap2
)
815 div_off
= bmap1
->n_div
;
817 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
818 int i1
= isl_basic_map_alloc_equality(bmap1
);
821 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
822 i_pos
, o_pos
, div_off
);
825 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
826 int i1
= isl_basic_map_alloc_inequality(bmap1
);
829 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
830 i_pos
, o_pos
, div_off
);
833 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
834 int i1
= isl_basic_map_alloc_div(bmap1
);
837 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
838 i_pos
, o_pos
, div_off
);
841 isl_basic_map_free(bmap2
);
846 isl_basic_map_free(bmap1
);
847 isl_basic_map_free(bmap2
);
851 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
852 struct isl_dim_map
*dim_map
)
856 for (i
= 0; i
< dim_map
->len
; ++i
) {
857 if (dim_map
->pos
[i
] < 0)
858 isl_int_set_si(dst
[i
], 0);
860 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
864 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
865 struct isl_dim_map
*dim_map
)
867 isl_int_set(dst
[0], src
[0]);
868 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
871 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
872 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
876 if (!src
|| !dst
|| !dim_map
)
879 for (i
= 0; i
< src
->n_eq
; ++i
) {
880 int i1
= isl_basic_map_alloc_equality(dst
);
883 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
886 for (i
= 0; i
< src
->n_ineq
; ++i
) {
887 int i1
= isl_basic_map_alloc_inequality(dst
);
890 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
893 for (i
= 0; i
< src
->n_div
; ++i
) {
894 int i1
= isl_basic_map_alloc_div(dst
);
897 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
901 isl_basic_map_free(src
);
906 isl_basic_map_free(src
);
907 isl_basic_map_free(dst
);
911 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
912 struct isl_basic_set
*bset2
, unsigned pos
)
914 return (struct isl_basic_set
*)
915 add_constraints((struct isl_basic_map
*)bset1
,
916 (struct isl_basic_map
*)bset2
, 0, pos
);
919 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
920 struct isl_dim
*dim
, unsigned extra
,
921 unsigned n_eq
, unsigned n_ineq
)
923 struct isl_basic_map
*ext
;
933 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
934 base
->extra
>= base
->n_div
+ extra
;
936 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
937 room_for_ineq(base
, n_ineq
)) {
942 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
943 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
944 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
945 extra
+= base
->extra
;
947 n_ineq
+= base
->n_ineq
;
949 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
955 ext
->sample
= isl_vec_copy(base
->sample
);
957 ext
= add_constraints(ext
, base
, 0, 0);
960 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
967 isl_basic_map_free(base
);
971 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
972 struct isl_dim
*dim
, unsigned extra
,
973 unsigned n_eq
, unsigned n_ineq
)
975 return (struct isl_basic_set
*)
976 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
977 extra
, n_eq
, n_ineq
);
980 struct isl_basic_map
*isl_basic_map_extend_constraints(
981 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
985 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
989 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
990 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
991 unsigned n_eq
, unsigned n_ineq
)
993 struct isl_basic_map
*bmap
;
998 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
1002 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
1006 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
1007 unsigned nparam
, unsigned dim
, unsigned extra
,
1008 unsigned n_eq
, unsigned n_ineq
)
1010 return (struct isl_basic_set
*)
1011 isl_basic_map_extend((struct isl_basic_map
*)base
,
1012 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
1015 struct isl_basic_set
*isl_basic_set_extend_constraints(
1016 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
1018 return (struct isl_basic_set
*)
1019 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
1023 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
1025 return (struct isl_basic_set
*)
1026 isl_basic_map_cow((struct isl_basic_map
*)bset
);
1029 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1034 if (bmap
->ref
> 1) {
1036 bmap
= isl_basic_map_dup(bmap
);
1038 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1042 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1050 return isl_set_dup(set
);
1053 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1061 return isl_map_dup(map
);
1064 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1065 unsigned a_len
, unsigned b_len
)
1067 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1068 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1069 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1072 struct isl_basic_set
*isl_basic_set_swap_vars(
1073 struct isl_basic_set
*bset
, unsigned n
)
1083 nparam
= isl_basic_set_n_param(bset
);
1084 dim
= isl_basic_set_n_dim(bset
);
1085 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1090 bset
= isl_basic_set_cow(bset
);
1094 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1095 if (isl_blk_is_error(blk
))
1098 for (i
= 0; i
< bset
->n_eq
; ++i
)
1100 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1102 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1104 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1106 for (i
= 0; i
< bset
->n_div
; ++i
)
1108 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1110 isl_blk_free(bset
->ctx
, blk
);
1112 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1113 return isl_basic_set_gauss(bset
, NULL
);
1115 isl_basic_set_free(bset
);
1119 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1122 set
= isl_set_cow(set
);
1126 for (i
= 0; i
< set
->n
; ++i
) {
1127 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1133 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1137 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1143 total
= isl_basic_map_total_dim(bmap
);
1144 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1145 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1147 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1149 i
= isl_basic_map_alloc_equality(bmap
);
1153 isl_int_set_si(bmap
->eq
[i
][0], 1);
1154 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1155 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1156 isl_vec_free(bmap
->sample
);
1157 bmap
->sample
= NULL
;
1158 return isl_basic_map_finalize(bmap
);
1160 isl_basic_map_free(bmap
);
1164 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1166 return (struct isl_basic_set
*)
1167 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1170 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1173 unsigned off
= isl_dim_total(bmap
->dim
);
1174 isl_int
*t
= bmap
->div
[a
];
1175 bmap
->div
[a
] = bmap
->div
[b
];
1178 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1179 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1181 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1182 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1184 for (i
= 0; i
< bmap
->n_div
; ++i
)
1185 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1186 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1189 /* Eliminate the specified n dimensions starting at first from the
1190 * constraints using Fourier-Motzkin. The dimensions themselves
1193 __isl_give isl_map
*isl_map_eliminate(__isl_take isl_map
*map
,
1194 enum isl_dim_type type
, unsigned first
, unsigned n
)
1203 map
= isl_map_cow(map
);
1206 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1207 first
+= pos(map
->dim
, type
) - 1;
1209 for (i
= 0; i
< map
->n
; ++i
) {
1210 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
], first
, n
);
1220 /* Eliminate the specified n dimensions starting at first from the
1221 * constraints using Fourier-Motzkin. The dimensions themselves
1224 __isl_give isl_set
*isl_set_eliminate(__isl_take isl_set
*set
,
1225 enum isl_dim_type type
, unsigned first
, unsigned n
)
1227 return (isl_set
*)isl_map_eliminate((isl_map
*)set
, type
, first
, n
);
1230 /* Eliminate the specified n dimensions starting at first from the
1231 * constraints using Fourier-Motzkin. The dimensions themselves
1234 __isl_give isl_set
*isl_set_eliminate_dims(__isl_take isl_set
*set
,
1235 unsigned first
, unsigned n
)
1237 return isl_set_eliminate(set
, isl_dim_set
, first
, n
);
1240 /* Project out n dimensions starting at first using Fourier-Motzkin */
1241 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1242 unsigned first
, unsigned n
)
1244 set
= isl_set_eliminate_dims(set
, first
, n
);
1245 set
= isl_set_drop_dims(set
, first
, n
);
1249 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1251 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1259 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1268 set
= isl_set_cow(set
);
1272 for (i
= 0; i
< set
->n
; ++i
) {
1273 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1283 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1284 enum isl_dim_type type
, unsigned first
, unsigned n
)
1288 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1292 bmap
= isl_basic_map_eliminate_vars(bmap
,
1293 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1296 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1298 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1301 isl_basic_map_free(bmap
);
1305 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1306 enum isl_dim_type type
, unsigned first
, unsigned n
)
1308 return (isl_basic_set
*)
1309 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1312 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1313 enum isl_dim_type type
, unsigned first
, unsigned n
)
1320 map
= isl_map_cow(map
);
1323 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1325 for (i
= 0; i
< map
->n
; ++i
) {
1326 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1327 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1331 map
= isl_map_drop(map
, type
, first
, n
);
1338 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1339 enum isl_dim_type type
, unsigned first
, unsigned n
)
1341 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1344 /* Project out n inputs starting at first using Fourier-Motzkin */
1345 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1346 unsigned first
, unsigned n
)
1348 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1351 /* Project out n dimensions starting at first using Fourier-Motzkin */
1352 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1353 unsigned first
, unsigned n
)
1355 unsigned nparam
= isl_basic_set_n_param(bset
);
1356 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1357 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1361 static void dump_term(struct isl_basic_map
*bmap
,
1362 isl_int c
, int pos
, FILE *out
)
1365 unsigned in
= isl_basic_map_n_in(bmap
);
1366 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1367 unsigned nparam
= isl_basic_map_n_param(bmap
);
1369 isl_int_print(out
, c
, 0);
1371 if (!isl_int_is_one(c
))
1372 isl_int_print(out
, c
, 0);
1373 if (pos
< 1 + nparam
) {
1374 name
= isl_dim_get_name(bmap
->dim
,
1375 isl_dim_param
, pos
- 1);
1377 fprintf(out
, "%s", name
);
1379 fprintf(out
, "p%d", pos
- 1);
1380 } else if (pos
< 1 + nparam
+ in
)
1381 fprintf(out
, "i%d", pos
- 1 - nparam
);
1382 else if (pos
< 1 + nparam
+ dim
)
1383 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1385 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1389 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1390 int sign
, FILE *out
)
1394 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1398 for (i
= 0, first
= 1; i
< len
; ++i
) {
1399 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1402 fprintf(out
, " + ");
1404 isl_int_abs(v
, c
[i
]);
1405 dump_term(bmap
, v
, i
, out
);
1412 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1413 const char *op
, FILE *out
, int indent
)
1417 fprintf(out
, "%*s", indent
, "");
1419 dump_constraint_sign(bmap
, c
, 1, out
);
1420 fprintf(out
, " %s ", op
);
1421 dump_constraint_sign(bmap
, c
, -1, out
);
1425 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1426 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1428 fprintf(out
, "%*s", indent
, "");
1429 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1434 static void dump_constraints(struct isl_basic_map
*bmap
,
1435 isl_int
**c
, unsigned n
,
1436 const char *op
, FILE *out
, int indent
)
1440 for (i
= 0; i
< n
; ++i
)
1441 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1444 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1448 unsigned total
= isl_basic_map_total_dim(bmap
);
1450 for (j
= 0; j
< 1 + total
; ++j
) {
1451 if (isl_int_is_zero(exp
[j
]))
1453 if (!first
&& isl_int_is_pos(exp
[j
]))
1455 dump_term(bmap
, exp
[j
], j
, out
);
1460 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1464 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1465 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1467 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1468 fprintf(out
, "%*s", indent
, "");
1469 fprintf(out
, "e%d = [(", i
);
1470 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1472 isl_int_print(out
, bmap
->div
[i
][0], 0);
1473 fprintf(out
, "]\n");
1477 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1480 fprintf(out
, "null basic set\n");
1484 fprintf(out
, "%*s", indent
, "");
1485 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1486 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1487 bset
->extra
, bset
->flags
);
1488 dump((struct isl_basic_map
*)bset
, out
, indent
);
1491 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1494 fprintf(out
, "null basic map\n");
1498 fprintf(out
, "%*s", indent
, "");
1499 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1500 "flags: %x, n_name: %d\n",
1502 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1503 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1504 dump(bmap
, out
, indent
);
1507 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1512 total
= isl_basic_map_total_dim(bmap
);
1513 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1514 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1515 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1516 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1520 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1522 struct isl_set
*set
;
1526 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1527 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1528 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1529 sizeof(struct isl_set
) +
1530 (n
- 1) * sizeof(struct isl_basic_set
*));
1534 set
->ctx
= dim
->ctx
;
1535 isl_ctx_ref(set
->ctx
);
1547 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1548 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1550 struct isl_set
*set
;
1551 struct isl_dim
*dims
;
1553 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1557 set
= isl_set_alloc_dim(dims
, n
, flags
);
1561 /* Make sure "map" has room for at least "n" more basic maps.
1563 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1566 struct isl_map
*grown
= NULL
;
1570 isl_assert(map
->ctx
, n
>= 0, goto error
);
1571 if (map
->n
+ n
<= map
->size
)
1573 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1576 for (i
= 0; i
< map
->n
; ++i
) {
1577 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1585 isl_map_free(grown
);
1590 /* Make sure "set" has room for at least "n" more basic sets.
1592 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1594 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1597 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1600 struct isl_set
*dup
;
1605 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1608 for (i
= 0; i
< set
->n
; ++i
)
1609 dup
= isl_set_add_basic_set(dup
, isl_basic_set_copy(set
->p
[i
]));
1613 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1615 struct isl_set
*set
;
1620 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1622 isl_basic_set_free(bset
);
1625 return isl_set_add_basic_set(set
, bset
);
1628 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1630 struct isl_map
*map
;
1635 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1637 isl_basic_map_free(bmap
);
1640 return isl_map_add_basic_map(map
, bmap
);
1643 __isl_give isl_set
*isl_set_add_basic_set(__isl_take isl_set
*set
,
1644 __isl_take isl_basic_set
*bset
)
1646 return (struct isl_set
*)isl_map_add_basic_map((struct isl_map
*)set
,
1647 (struct isl_basic_map
*)bset
);
1650 void isl_set_free(struct isl_set
*set
)
1660 isl_ctx_deref(set
->ctx
);
1661 for (i
= 0; i
< set
->n
; ++i
)
1662 isl_basic_set_free(set
->p
[i
]);
1663 isl_dim_free(set
->dim
);
1667 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1672 fprintf(out
, "null set\n");
1676 fprintf(out
, "%*s", indent
, "");
1677 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1678 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1680 for (i
= 0; i
< set
->n
; ++i
) {
1681 fprintf(out
, "%*s", indent
, "");
1682 fprintf(out
, "basic set %d:\n", i
);
1683 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1687 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1692 fprintf(out
, "null map\n");
1696 fprintf(out
, "%*s", indent
, "");
1697 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1698 "flags: %x, n_name: %d\n",
1699 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1700 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1701 for (i
= 0; i
< map
->n
; ++i
) {
1702 fprintf(out
, "%*s", indent
, "");
1703 fprintf(out
, "basic map %d:\n", i
);
1704 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1708 struct isl_basic_map
*isl_basic_map_intersect_domain(
1709 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1711 struct isl_basic_map
*bmap_domain
;
1712 struct isl_dim
*dim
;
1717 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1718 bset
->dim
, isl_dim_param
), goto error
);
1720 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1721 isl_assert(bset
->ctx
,
1722 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1724 bmap
= isl_basic_map_cow(bmap
);
1725 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1726 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1729 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1730 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1731 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1733 bmap
= isl_basic_map_simplify(bmap
);
1734 return isl_basic_map_finalize(bmap
);
1736 isl_basic_map_free(bmap
);
1737 isl_basic_set_free(bset
);
1741 struct isl_basic_map
*isl_basic_map_intersect_range(
1742 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1744 struct isl_basic_map
*bmap_range
;
1749 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1750 bset
->dim
, isl_dim_param
), goto error
);
1752 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1753 isl_assert(bset
->ctx
,
1754 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1756 bmap
= isl_basic_map_cow(bmap
);
1757 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1758 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1761 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1762 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1764 bmap
= isl_basic_map_simplify(bmap
);
1765 return isl_basic_map_finalize(bmap
);
1767 isl_basic_map_free(bmap
);
1768 isl_basic_set_free(bset
);
1772 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1778 total
= 1 + isl_basic_map_total_dim(bmap
);
1779 if (total
!= vec
->size
)
1784 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1785 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1786 if (!isl_int_is_zero(s
)) {
1792 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1793 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1794 if (isl_int_is_neg(s
)) {
1805 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1807 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1810 struct isl_basic_map
*isl_basic_map_intersect(
1811 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1813 struct isl_vec
*sample
= NULL
;
1815 if (!bmap1
|| !bmap2
)
1818 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1819 bmap2
->dim
, isl_dim_param
), goto error
);
1820 if (isl_dim_total(bmap1
->dim
) ==
1821 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1822 isl_dim_total(bmap2
->dim
) !=
1823 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1824 return isl_basic_map_intersect(bmap2
, bmap1
);
1826 if (isl_dim_total(bmap2
->dim
) !=
1827 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1828 isl_assert(bmap1
->ctx
,
1829 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1831 if (bmap1
->sample
&&
1832 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1833 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1834 sample
= isl_vec_copy(bmap1
->sample
);
1835 else if (bmap2
->sample
&&
1836 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1837 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1838 sample
= isl_vec_copy(bmap2
->sample
);
1840 bmap1
= isl_basic_map_cow(bmap1
);
1841 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1842 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1845 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1848 isl_vec_free(bmap1
->sample
);
1849 bmap1
->sample
= sample
;
1852 bmap1
= isl_basic_map_simplify(bmap1
);
1853 return isl_basic_map_finalize(bmap1
);
1856 isl_vec_free(sample
);
1857 isl_basic_map_free(bmap1
);
1858 isl_basic_map_free(bmap2
);
1862 struct isl_basic_set
*isl_basic_set_intersect(
1863 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1865 return (struct isl_basic_set
*)
1866 isl_basic_map_intersect(
1867 (struct isl_basic_map
*)bset1
,
1868 (struct isl_basic_map
*)bset2
);
1871 /* Special case of isl_map_intersect, where both map1 and map2
1872 * are convex, without any divs and such that either map1 or map2
1873 * contains a single constraint. This constraint is then simply
1874 * added to the other map.
1876 static __isl_give isl_map
*map_intersect_add_constraint(
1877 __isl_take isl_map
*map1
, __isl_take isl_map
*map2
)
1879 struct isl_basic_map
*bmap1
;
1880 struct isl_basic_map
*bmap2
;
1882 isl_assert(map1
->ctx
, map1
->n
== 1, goto error
);
1883 isl_assert(map2
->ctx
, map1
->n
== 1, goto error
);
1884 isl_assert(map1
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1885 isl_assert(map2
->ctx
, map1
->p
[0]->n_div
== 0, goto error
);
1887 if (map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
!= 1)
1888 return isl_map_intersect(map2
, map1
);
1890 isl_assert(map2
->ctx
,
1891 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1, goto error
);
1893 map1
= isl_map_cow(map1
);
1896 if (isl_map_fast_is_empty(map1
)) {
1900 map1
->p
[0] = isl_basic_map_cow(map1
->p
[0]);
1901 if (map2
->p
[0]->n_eq
== 1)
1902 map1
->p
[0] = isl_basic_map_add_eq(map1
->p
[0], map2
->p
[0]->eq
[0]);
1904 map1
->p
[0] = isl_basic_map_add_ineq(map1
->p
[0],
1905 map2
->p
[0]->ineq
[0]);
1907 map1
->p
[0] = isl_basic_map_simplify(map1
->p
[0]);
1908 map1
->p
[0] = isl_basic_map_finalize(map1
->p
[0]);
1912 if (isl_basic_map_fast_is_empty(map1
->p
[0])) {
1913 isl_basic_map_free(map1
->p
[0]);
1926 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1929 struct isl_map
*result
;
1935 if (isl_map_fast_is_empty(map1
)) {
1939 if (isl_map_fast_is_empty(map2
)) {
1944 if (map1
->n
== 1 && map2
->n
== 1 &&
1945 map1
->p
[0]->n_div
== 0 && map2
->p
[0]->n_div
== 0 &&
1946 isl_dim_equal(map1
->dim
, map2
->dim
) &&
1947 (map1
->p
[0]->n_eq
+ map1
->p
[0]->n_ineq
== 1 ||
1948 map2
->p
[0]->n_eq
+ map2
->p
[0]->n_ineq
== 1))
1949 return map_intersect_add_constraint(map1
, map2
);
1950 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1951 map2
->dim
, isl_dim_param
), goto error
);
1952 if (isl_dim_total(map1
->dim
) ==
1953 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1954 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1955 return isl_map_intersect(map2
, map1
);
1957 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1958 isl_assert(map1
->ctx
,
1959 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1961 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1962 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
1963 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
1965 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1966 map1
->n
* map2
->n
, flags
);
1969 for (i
= 0; i
< map1
->n
; ++i
)
1970 for (j
= 0; j
< map2
->n
; ++j
) {
1971 struct isl_basic_map
*part
;
1972 part
= isl_basic_map_intersect(
1973 isl_basic_map_copy(map1
->p
[i
]),
1974 isl_basic_map_copy(map2
->p
[j
]));
1975 if (isl_basic_map_is_empty(part
))
1976 isl_basic_map_free(part
);
1978 result
= isl_map_add_basic_map(result
, part
);
1991 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1993 return (struct isl_set
*)
1994 isl_map_intersect((struct isl_map
*)set1
,
1995 (struct isl_map
*)set2
);
1998 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
2000 struct isl_dim
*dim
;
2001 struct isl_basic_set
*bset
;
2006 bmap
= isl_basic_map_cow(bmap
);
2009 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
2010 in
= isl_basic_map_n_in(bmap
);
2011 bset
= isl_basic_set_from_basic_map(bmap
);
2012 bset
= isl_basic_set_swap_vars(bset
, in
);
2013 return isl_basic_map_from_basic_set(bset
, dim
);
2016 __isl_give isl_basic_map
*isl_basic_map_insert(__isl_take isl_basic_map
*bmap
,
2017 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2019 struct isl_dim
*res_dim
;
2020 struct isl_basic_map
*res
;
2021 struct isl_dim_map
*dim_map
;
2022 unsigned total
, off
;
2023 enum isl_dim_type t
;
2031 res_dim
= isl_dim_insert(isl_basic_map_get_dim(bmap
), type
, pos
, n
);
2033 total
= isl_basic_map_total_dim(bmap
) + n
;
2034 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2036 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2038 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2040 unsigned size
= isl_basic_map_dim(bmap
, t
);
2041 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2043 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2044 pos
, size
- pos
, off
+ pos
+ n
);
2046 off
+= isl_dim_size(res_dim
, t
);
2048 isl_dim_map_div(dim_map
, bmap
, off
);
2050 res
= isl_basic_map_alloc_dim(res_dim
,
2051 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2052 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2053 res
= isl_basic_map_simplify(res
);
2054 return isl_basic_map_finalize(res
);
2057 __isl_give isl_basic_map
*isl_basic_map_add(__isl_take isl_basic_map
*bmap
,
2058 enum isl_dim_type type
, unsigned n
)
2062 return isl_basic_map_insert(bmap
, type
,
2063 isl_basic_map_dim(bmap
, type
), n
);
2066 __isl_give isl_basic_set
*isl_basic_set_add(__isl_take isl_basic_set
*bset
,
2067 enum isl_dim_type type
, unsigned n
)
2071 isl_assert(bset
->ctx
, type
!= isl_dim_in
, goto error
);
2072 return (isl_basic_set
*)isl_basic_map_add((isl_basic_map
*)bset
, type
, n
);
2074 isl_basic_set_free(bset
);
2078 __isl_give isl_map
*isl_map_insert(__isl_take isl_map
*map
,
2079 enum isl_dim_type type
, unsigned pos
, unsigned n
)
2086 map
= isl_map_cow(map
);
2090 map
->dim
= isl_dim_insert(map
->dim
, type
, pos
, n
);
2094 for (i
= 0; i
< map
->n
; ++i
) {
2095 map
->p
[i
] = isl_basic_map_insert(map
->p
[i
], type
, pos
, n
);
2106 __isl_give isl_map
*isl_map_add(__isl_take isl_map
*map
,
2107 enum isl_dim_type type
, unsigned n
)
2111 return isl_map_insert(map
, type
, isl_map_dim(map
, type
), n
);
2114 __isl_give isl_set
*isl_set_add(__isl_take isl_set
*set
,
2115 enum isl_dim_type type
, unsigned n
)
2119 isl_assert(set
->ctx
, type
!= isl_dim_in
, goto error
);
2120 return (isl_set
*)isl_map_add((isl_map
*)set
, type
, n
);
2126 __isl_give isl_basic_map
*isl_basic_map_move_dims(
2127 __isl_take isl_basic_map
*bmap
,
2128 enum isl_dim_type dst_type
, unsigned dst_pos
,
2129 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2132 struct isl_dim_map
*dim_map
;
2133 struct isl_basic_map
*res
;
2134 enum isl_dim_type t
;
2135 unsigned total
, off
;
2142 isl_assert(bmap
->ctx
, src_pos
+ n
<= isl_basic_map_dim(bmap
, src_type
),
2145 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2148 isl_assert(bmap
->ctx
, dst_type
!= src_type
, goto error
);
2150 if (pos(bmap
->dim
, dst_type
) + dst_pos
==
2151 pos(bmap
->dim
, src_type
) + src_pos
+
2152 ((src_type
< dst_type
) ? n
: 0)) {
2153 bmap
= isl_basic_map_cow(bmap
);
2157 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2158 src_type
, src_pos
, n
);
2162 bmap
= isl_basic_map_finalize(bmap
);
2167 total
= isl_basic_map_total_dim(bmap
);
2168 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2171 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2172 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2173 if (t
== dst_type
) {
2174 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2177 isl_dim_map_dim_range(dim_map
, bmap
->dim
, src_type
,
2180 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2181 dst_pos
, size
- dst_pos
, off
);
2182 off
+= size
- dst_pos
;
2183 } else if (t
== src_type
) {
2184 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2187 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2188 src_pos
+ n
, size
- src_pos
- n
, off
);
2189 off
+= size
- src_pos
- n
;
2191 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2195 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2197 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2198 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2199 bmap
= add_constraints_dim_map(res
, bmap
, dim_map
);
2201 bmap
->dim
= isl_dim_move(bmap
->dim
, dst_type
, dst_pos
,
2202 src_type
, src_pos
, n
);
2206 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
2207 bmap
= isl_basic_map_gauss(bmap
, NULL
);
2208 bmap
= isl_basic_map_finalize(bmap
);
2212 isl_basic_map_free(bmap
);
2216 __isl_give isl_basic_set
*isl_basic_set_move_dims(__isl_take isl_basic_set
*bset
,
2217 enum isl_dim_type dst_type
, unsigned dst_pos
,
2218 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2220 return (isl_basic_set
*)isl_basic_map_move_dims(
2221 (isl_basic_map
*)bset
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2224 __isl_give isl_set
*isl_set_move_dims(__isl_take isl_set
*set
,
2225 enum isl_dim_type dst_type
, unsigned dst_pos
,
2226 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2230 isl_assert(set
->ctx
, dst_type
!= isl_dim_in
, goto error
);
2231 return (isl_set
*)isl_map_move_dims((isl_map
*)set
, dst_type
, dst_pos
,
2232 src_type
, src_pos
, n
);
2238 __isl_give isl_map
*isl_map_move_dims(__isl_take isl_map
*map
,
2239 enum isl_dim_type dst_type
, unsigned dst_pos
,
2240 enum isl_dim_type src_type
, unsigned src_pos
, unsigned n
)
2249 isl_assert(map
->ctx
, src_pos
+ n
<= isl_map_dim(map
, src_type
),
2252 if (dst_type
== src_type
&& dst_pos
== src_pos
)
2255 isl_assert(map
->ctx
, dst_type
!= src_type
, goto error
);
2257 map
= isl_map_cow(map
);
2261 map
->dim
= isl_dim_move(map
->dim
, dst_type
, dst_pos
, src_type
, src_pos
, n
);
2265 for (i
= 0; i
< map
->n
; ++i
) {
2266 map
->p
[i
] = isl_basic_map_move_dims(map
->p
[i
],
2268 src_type
, src_pos
, n
);
2279 /* Move the specified dimensions to the last columns right before
2280 * the divs. Don't change the dimension specification of bmap.
2281 * That's the responsibility of the caller.
2283 static __isl_give isl_basic_map
*move_last(__isl_take isl_basic_map
*bmap
,
2284 enum isl_dim_type type
, unsigned first
, unsigned n
)
2286 struct isl_dim_map
*dim_map
;
2287 struct isl_basic_map
*res
;
2288 enum isl_dim_type t
;
2289 unsigned total
, off
;
2293 if (pos(bmap
->dim
, type
) + first
+ n
== 1 + isl_dim_total(bmap
->dim
))
2296 total
= isl_basic_map_total_dim(bmap
);
2297 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2300 for (t
= isl_dim_param
; t
<= isl_dim_out
; ++t
) {
2301 unsigned size
= isl_dim_size(bmap
->dim
, t
);
2303 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2306 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2307 first
, n
, total
- bmap
->n_div
- n
);
2308 isl_dim_map_dim_range(dim_map
, bmap
->dim
, t
,
2309 first
+ n
, size
- (first
+ n
), off
);
2310 off
+= size
- (first
+ n
);
2312 isl_dim_map_dim(dim_map
, bmap
->dim
, t
, off
);
2316 isl_dim_map_div(dim_map
, bmap
, off
+ n
);
2318 res
= isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap
),
2319 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
2320 res
= add_constraints_dim_map(res
, bmap
, dim_map
);
2324 /* Turn the n dimensions of type type, starting at first
2325 * into existentially quantified variables.
2327 __isl_give isl_basic_map
*isl_basic_map_project_out(
2328 __isl_take isl_basic_map
*bmap
,
2329 enum isl_dim_type type
, unsigned first
, unsigned n
)
2342 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
))
2343 return isl_basic_map_remove(bmap
, type
, first
, n
);
2345 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
2348 bmap
= move_last(bmap
, type
, first
, n
);
2349 bmap
= isl_basic_map_cow(bmap
);
2351 row_size
= 1 + isl_dim_total(bmap
->dim
) + bmap
->extra
;
2352 old
= bmap
->block2
.data
;
2353 bmap
->block2
= isl_blk_extend(bmap
->ctx
, bmap
->block2
,
2354 (bmap
->extra
+ n
) * (1 + row_size
));
2355 if (!bmap
->block2
.data
)
2357 new_div
= isl_alloc_array(ctx
, isl_int
*, bmap
->extra
+ n
);
2360 for (i
= 0; i
< n
; ++i
) {
2361 new_div
[i
] = bmap
->block2
.data
+
2362 (bmap
->extra
+ i
) * (1 + row_size
);
2363 isl_seq_clr(new_div
[i
], 1 + row_size
);
2365 for (i
= 0; i
< bmap
->extra
; ++i
)
2366 new_div
[n
+ i
] = bmap
->block2
.data
+ (bmap
->div
[i
] - old
);
2368 bmap
->div
= new_div
;
2372 bmap
->dim
= isl_dim_drop(bmap
->dim
, type
, first
, n
);
2375 bmap
= isl_basic_map_simplify(bmap
);
2376 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2377 return isl_basic_map_finalize(bmap
);
2379 isl_basic_map_free(bmap
);
2383 /* Turn the n dimensions of type type, starting at first
2384 * into existentially quantified variables.
2386 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
2387 enum isl_dim_type type
, unsigned first
, unsigned n
)
2389 return (isl_basic_set
*)isl_basic_map_project_out(
2390 (isl_basic_map
*)bset
, type
, first
, n
);
2393 /* Turn the n dimensions of type type, starting at first
2394 * into existentially quantified variables.
2396 __isl_give isl_map
*isl_map_project_out(__isl_take isl_map
*map
,
2397 enum isl_dim_type type
, unsigned first
, unsigned n
)
2407 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
2409 map
= isl_map_cow(map
);
2413 map
->dim
= isl_dim_drop(map
->dim
, type
, first
, n
);
2417 for (i
= 0; i
< map
->n
; ++i
) {
2418 map
->p
[i
] = isl_basic_map_project_out(map
->p
[i
], type
, first
, n
);
2429 /* Turn the n dimensions of type type, starting at first
2430 * into existentially quantified variables.
2432 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
2433 enum isl_dim_type type
, unsigned first
, unsigned n
)
2435 return (isl_set
*)isl_map_project_out((isl_map
*)set
, type
, first
, n
);
2438 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
2442 for (i
= 0; i
< n
; ++i
) {
2443 j
= isl_basic_map_alloc_div(bmap
);
2446 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
2450 isl_basic_map_free(bmap
);
2454 struct isl_basic_map
*isl_basic_map_apply_range(
2455 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2457 struct isl_dim
*dim_result
= NULL
;
2458 struct isl_basic_map
*bmap
;
2459 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2460 struct isl_dim_map
*dim_map1
, *dim_map2
;
2462 if (!bmap1
|| !bmap2
)
2465 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2466 isl_dim_copy(bmap2
->dim
));
2468 n_in
= isl_basic_map_n_in(bmap1
);
2469 n_out
= isl_basic_map_n_out(bmap2
);
2470 n
= isl_basic_map_n_out(bmap1
);
2471 nparam
= isl_basic_map_n_param(bmap1
);
2473 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2474 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2475 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2476 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2477 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2478 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2479 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2480 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2481 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2482 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2483 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2485 bmap
= isl_basic_map_alloc_dim(dim_result
,
2486 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2487 bmap1
->n_eq
+ bmap2
->n_eq
,
2488 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2489 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2490 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2491 bmap
= add_divs(bmap
, n
);
2492 bmap
= isl_basic_map_simplify(bmap
);
2493 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2494 return isl_basic_map_finalize(bmap
);
2496 isl_basic_map_free(bmap1
);
2497 isl_basic_map_free(bmap2
);
2501 struct isl_basic_set
*isl_basic_set_apply(
2502 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2507 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2510 return (struct isl_basic_set
*)
2511 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2513 isl_basic_set_free(bset
);
2514 isl_basic_map_free(bmap
);
2518 struct isl_basic_map
*isl_basic_map_apply_domain(
2519 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2521 if (!bmap1
|| !bmap2
)
2524 isl_assert(bmap1
->ctx
,
2525 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2526 isl_assert(bmap1
->ctx
,
2527 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2530 bmap1
= isl_basic_map_reverse(bmap1
);
2531 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2532 return isl_basic_map_reverse(bmap1
);
2534 isl_basic_map_free(bmap1
);
2535 isl_basic_map_free(bmap2
);
2539 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2540 * A \cap B -> f(A) + f(B)
2542 struct isl_basic_map
*isl_basic_map_sum(
2543 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2545 unsigned n_in
, n_out
, nparam
, total
, pos
;
2546 struct isl_basic_map
*bmap
= NULL
;
2547 struct isl_dim_map
*dim_map1
, *dim_map2
;
2550 if (!bmap1
|| !bmap2
)
2553 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2556 nparam
= isl_basic_map_n_param(bmap1
);
2557 n_in
= isl_basic_map_n_in(bmap1
);
2558 n_out
= isl_basic_map_n_out(bmap1
);
2560 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2561 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2562 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2563 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2564 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2565 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2566 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2567 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2568 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2569 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2570 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2572 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2573 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2574 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2575 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2576 for (i
= 0; i
< n_out
; ++i
) {
2577 int j
= isl_basic_map_alloc_equality(bmap
);
2580 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2581 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2582 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2583 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2585 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2586 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2587 bmap
= add_divs(bmap
, 2 * n_out
);
2589 bmap
= isl_basic_map_simplify(bmap
);
2590 return isl_basic_map_finalize(bmap
);
2592 isl_basic_map_free(bmap
);
2593 isl_basic_map_free(bmap1
);
2594 isl_basic_map_free(bmap2
);
2598 /* Given two maps A -> f(A) and B -> g(B), construct a map
2599 * A \cap B -> f(A) + f(B)
2601 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2603 struct isl_map
*result
;
2609 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2611 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2612 map1
->n
* map2
->n
, 0);
2615 for (i
= 0; i
< map1
->n
; ++i
)
2616 for (j
= 0; j
< map2
->n
; ++j
) {
2617 struct isl_basic_map
*part
;
2618 part
= isl_basic_map_sum(
2619 isl_basic_map_copy(map1
->p
[i
]),
2620 isl_basic_map_copy(map2
->p
[j
]));
2621 if (isl_basic_map_is_empty(part
))
2622 isl_basic_map_free(part
);
2624 result
= isl_map_add_basic_map(result
, part
);
2637 __isl_give isl_set
*isl_set_sum(__isl_take isl_set
*set1
,
2638 __isl_take isl_set
*set2
)
2640 return (isl_set
*)isl_map_sum((isl_map
*)set1
, (isl_map
*)set2
);
2643 /* Given a basic map A -> f(A), construct A -> -f(A).
2645 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2650 bmap
= isl_basic_map_cow(bmap
);
2654 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2655 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2656 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2657 for (j
= 0; j
< n
; ++j
)
2658 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2659 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2660 for (j
= 0; j
< n
; ++j
)
2661 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2662 for (i
= 0; i
< bmap
->n_div
; ++i
)
2663 for (j
= 0; j
< n
; ++j
)
2664 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2665 return isl_basic_map_finalize(bmap
);
2668 /* Given a map A -> f(A), construct A -> -f(A).
2670 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2674 map
= isl_map_cow(map
);
2678 for (i
= 0; i
< map
->n
; ++i
) {
2679 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2690 __isl_give isl_set
*isl_set_neg(__isl_take isl_set
*set
)
2692 return (isl_set
*)isl_map_neg((isl_map
*)set
);
2695 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2696 * A -> floor(f(A)/d).
2698 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2701 unsigned n_in
, n_out
, nparam
, total
, pos
;
2702 struct isl_basic_map
*result
= NULL
;
2703 struct isl_dim_map
*dim_map
;
2709 nparam
= isl_basic_map_n_param(bmap
);
2710 n_in
= isl_basic_map_n_in(bmap
);
2711 n_out
= isl_basic_map_n_out(bmap
);
2713 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2714 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2715 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2716 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2717 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2718 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2720 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2721 bmap
->n_div
+ n_out
,
2722 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2723 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2724 result
= add_divs(result
, n_out
);
2725 for (i
= 0; i
< n_out
; ++i
) {
2727 j
= isl_basic_map_alloc_inequality(result
);
2730 isl_seq_clr(result
->ineq
[j
], 1+total
);
2731 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2732 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2733 j
= isl_basic_map_alloc_inequality(result
);
2736 isl_seq_clr(result
->ineq
[j
], 1+total
);
2737 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2738 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2739 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2742 result
= isl_basic_map_simplify(result
);
2743 return isl_basic_map_finalize(result
);
2745 isl_basic_map_free(result
);
2749 /* Given a map A -> f(A) and an integer d, construct a map
2750 * A -> floor(f(A)/d).
2752 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2756 map
= isl_map_cow(map
);
2760 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2761 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2762 for (i
= 0; i
< map
->n
; ++i
) {
2763 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2774 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2780 i
= isl_basic_map_alloc_equality(bmap
);
2783 nparam
= isl_basic_map_n_param(bmap
);
2784 n_in
= isl_basic_map_n_in(bmap
);
2785 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2786 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2787 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2788 return isl_basic_map_finalize(bmap
);
2790 isl_basic_map_free(bmap
);
2794 /* Add a constraints to "bmap" expressing i_pos < o_pos
2796 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2802 i
= isl_basic_map_alloc_inequality(bmap
);
2805 nparam
= isl_basic_map_n_param(bmap
);
2806 n_in
= isl_basic_map_n_in(bmap
);
2807 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2808 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2809 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2810 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2811 return isl_basic_map_finalize(bmap
);
2813 isl_basic_map_free(bmap
);
2817 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2819 static __isl_give isl_basic_map
*var_less_or_equal(
2820 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2826 i
= isl_basic_map_alloc_inequality(bmap
);
2829 nparam
= isl_basic_map_n_param(bmap
);
2830 n_in
= isl_basic_map_n_in(bmap
);
2831 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2832 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2833 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2834 return isl_basic_map_finalize(bmap
);
2836 isl_basic_map_free(bmap
);
2840 /* Add a constraints to "bmap" expressing i_pos > o_pos
2842 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2848 i
= isl_basic_map_alloc_inequality(bmap
);
2851 nparam
= isl_basic_map_n_param(bmap
);
2852 n_in
= isl_basic_map_n_in(bmap
);
2853 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2854 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2855 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2856 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2857 return isl_basic_map_finalize(bmap
);
2859 isl_basic_map_free(bmap
);
2863 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2865 static __isl_give isl_basic_map
*var_more_or_equal(
2866 __isl_take isl_basic_map
*bmap
, unsigned pos
)
2872 i
= isl_basic_map_alloc_inequality(bmap
);
2875 nparam
= isl_basic_map_n_param(bmap
);
2876 n_in
= isl_basic_map_n_in(bmap
);
2877 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2878 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2879 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2880 return isl_basic_map_finalize(bmap
);
2882 isl_basic_map_free(bmap
);
2886 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2889 struct isl_basic_map
*bmap
;
2890 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2893 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2894 bmap
= var_equal(bmap
, i
);
2895 return isl_basic_map_finalize(bmap
);
2898 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2900 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2903 struct isl_basic_map
*bmap
;
2904 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2907 for (i
= 0; i
< pos
&& bmap
; ++i
)
2908 bmap
= var_equal(bmap
, i
);
2910 bmap
= var_less(bmap
, pos
);
2911 return isl_basic_map_finalize(bmap
);
2914 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2916 __isl_give isl_basic_map
*isl_basic_map_less_or_equal_at(
2917 __isl_take isl_dim
*dim
, unsigned pos
)
2920 isl_basic_map
*bmap
;
2922 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2923 for (i
= 0; i
< pos
; ++i
)
2924 bmap
= var_equal(bmap
, i
);
2925 bmap
= var_less_or_equal(bmap
, pos
);
2926 return isl_basic_map_finalize(bmap
);
2929 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2931 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2934 struct isl_basic_map
*bmap
;
2935 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2938 for (i
= 0; i
< pos
&& bmap
; ++i
)
2939 bmap
= var_equal(bmap
, i
);
2941 bmap
= var_more(bmap
, pos
);
2942 return isl_basic_map_finalize(bmap
);
2945 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
2947 __isl_give isl_basic_map
*isl_basic_map_more_or_equal_at(
2948 __isl_take isl_dim
*dim
, unsigned pos
)
2951 isl_basic_map
*bmap
;
2953 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2954 for (i
= 0; i
< pos
; ++i
)
2955 bmap
= var_equal(bmap
, i
);
2956 bmap
= var_more_or_equal(bmap
, pos
);
2957 return isl_basic_map_finalize(bmap
);
2960 static __isl_give isl_map
*map_lex_lte_first(__isl_take isl_dim
*dims
,
2961 unsigned n
, int equal
)
2963 struct isl_map
*map
;
2966 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
2968 for (i
= 0; i
+ 1 < n
; ++i
)
2969 map
= isl_map_add_basic_map(map
,
2970 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
2973 map
= isl_map_add_basic_map(map
,
2974 isl_basic_map_less_or_equal_at(dims
, n
- 1));
2976 map
= isl_map_add_basic_map(map
,
2977 isl_basic_map_less_at(dims
, n
- 1));
2984 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
2988 return map_lex_lte_first(dims
, dims
->n_out
, equal
);
2991 __isl_give isl_map
*isl_map_lex_lt_first(__isl_take isl_dim
*dim
, unsigned n
)
2993 return map_lex_lte_first(dim
, n
, 0);
2996 __isl_give isl_map
*isl_map_lex_le_first(__isl_take isl_dim
*dim
, unsigned n
)
2998 return map_lex_lte_first(dim
, n
, 1);
3001 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
3003 return map_lex_lte(isl_dim_map(set_dim
), 0);
3006 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
3008 return map_lex_lte(isl_dim_map(set_dim
), 1);
3011 static __isl_give isl_map
*map_lex_gte_first(__isl_take isl_dim
*dims
,
3012 unsigned n
, int equal
)
3014 struct isl_map
*map
;
3017 map
= isl_map_alloc_dim(isl_dim_copy(dims
), n
, ISL_MAP_DISJOINT
);
3019 for (i
= 0; i
+ 1 < n
; ++i
)
3020 map
= isl_map_add_basic_map(map
,
3021 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
3024 map
= isl_map_add_basic_map(map
,
3025 isl_basic_map_more_or_equal_at(dims
, n
- 1));
3027 map
= isl_map_add_basic_map(map
,
3028 isl_basic_map_more_at(dims
, n
- 1));
3035 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
3039 return map_lex_gte_first(dims
, dims
->n_out
, equal
);
3042 __isl_give isl_map
*isl_map_lex_gt_first(__isl_take isl_dim
*dim
, unsigned n
)
3044 return map_lex_gte_first(dim
, n
, 0);
3047 __isl_give isl_map
*isl_map_lex_ge_first(__isl_take isl_dim
*dim
, unsigned n
)
3049 return map_lex_gte_first(dim
, n
, 1);
3052 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
3054 return map_lex_gte(isl_dim_map(set_dim
), 0);
3057 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
3059 return map_lex_gte(isl_dim_map(set_dim
), 1);
3062 struct isl_basic_map
*isl_basic_map_from_basic_set(
3063 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
3065 struct isl_basic_map
*bmap
;
3067 bset
= isl_basic_set_cow(bset
);
3071 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
3072 isl_dim_free(bset
->dim
);
3073 bmap
= (struct isl_basic_map
*) bset
;
3075 return isl_basic_map_finalize(bmap
);
3077 isl_basic_set_free(bset
);
3082 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
3086 if (bmap
->dim
->n_in
== 0)
3087 return (struct isl_basic_set
*)bmap
;
3088 bmap
= isl_basic_map_cow(bmap
);
3091 bmap
->dim
= isl_dim_cow(bmap
->dim
);
3094 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
3095 bmap
->dim
->n_in
= 0;
3096 bmap
= isl_basic_map_finalize(bmap
);
3097 return (struct isl_basic_set
*)bmap
;
3099 isl_basic_map_free(bmap
);
3103 /* For a div d = floor(f/m), add the constraints
3106 * -(f-(n-1)) + m d >= 0
3108 * Note that the second constraint is the negation of
3112 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map
*bmap
,
3113 unsigned pos
, isl_int
*div
)
3116 unsigned total
= isl_basic_map_total_dim(bmap
);
3118 i
= isl_basic_map_alloc_inequality(bmap
);
3121 isl_seq_cpy(bmap
->ineq
[i
], div
+ 1, 1 + total
);
3122 isl_int_neg(bmap
->ineq
[i
][1 + pos
], div
[0]);
3124 j
= isl_basic_map_alloc_inequality(bmap
);
3127 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
3128 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][1 + pos
]);
3129 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
3133 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set
*bset
,
3134 unsigned pos
, isl_int
*div
)
3136 return isl_basic_map_add_div_constraints_var((isl_basic_map
*)bset
,
3140 int isl_basic_map_add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
3142 unsigned total
= isl_basic_map_total_dim(bmap
);
3143 unsigned div_pos
= total
- bmap
->n_div
+ div
;
3145 return isl_basic_map_add_div_constraints_var(bmap
, div_pos
,
3149 struct isl_basic_set
*isl_basic_map_underlying_set(
3150 struct isl_basic_map
*bmap
)
3154 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
3155 return (struct isl_basic_set
*)bmap
;
3156 bmap
= isl_basic_map_cow(bmap
);
3159 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
3162 bmap
->extra
-= bmap
->n_div
;
3164 bmap
= isl_basic_map_finalize(bmap
);
3165 return (struct isl_basic_set
*)bmap
;
3170 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
3171 __isl_take isl_basic_set
*bset
)
3173 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
3176 struct isl_basic_map
*isl_basic_map_overlying_set(
3177 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
3179 struct isl_basic_map
*bmap
;
3180 struct isl_ctx
*ctx
;
3187 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
3188 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
3189 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
3191 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
3192 isl_basic_map_free(like
);
3193 return (struct isl_basic_map
*)bset
;
3195 bset
= isl_basic_set_cow(bset
);
3198 total
= bset
->dim
->n_out
+ bset
->extra
;
3199 bmap
= (struct isl_basic_map
*)bset
;
3200 isl_dim_free(bmap
->dim
);
3201 bmap
->dim
= isl_dim_copy(like
->dim
);
3204 bmap
->n_div
= like
->n_div
;
3205 bmap
->extra
+= like
->n_div
;
3208 ltotal
= total
- bmap
->extra
+ like
->extra
;
3211 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
3212 bmap
->extra
* (1 + 1 + total
));
3213 if (isl_blk_is_error(bmap
->block2
))
3215 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
3219 for (i
= 0; i
< bmap
->extra
; ++i
)
3220 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
3221 for (i
= 0; i
< like
->n_div
; ++i
) {
3222 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
3223 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
3225 bmap
= isl_basic_map_extend_constraints(bmap
,
3226 0, 2 * like
->n_div
);
3227 for (i
= 0; i
< like
->n_div
; ++i
) {
3228 if (isl_int_is_zero(bmap
->div
[i
][0]))
3230 if (isl_basic_map_add_div_constraints(bmap
, i
) < 0)
3234 isl_basic_map_free(like
);
3235 bmap
= isl_basic_map_simplify(bmap
);
3236 bmap
= isl_basic_map_finalize(bmap
);
3239 isl_basic_map_free(like
);
3240 isl_basic_set_free(bset
);
3244 struct isl_basic_set
*isl_basic_set_from_underlying_set(
3245 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
3247 return (struct isl_basic_set
*)
3248 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
3251 struct isl_set
*isl_set_from_underlying_set(
3252 struct isl_set
*set
, struct isl_basic_set
*like
)
3258 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
3260 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
3261 isl_basic_set_free(like
);
3264 set
= isl_set_cow(set
);
3267 for (i
= 0; i
< set
->n
; ++i
) {
3268 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
3269 isl_basic_set_copy(like
));
3273 isl_dim_free(set
->dim
);
3274 set
->dim
= isl_dim_copy(like
->dim
);
3277 isl_basic_set_free(like
);
3280 isl_basic_set_free(like
);
3285 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
3289 map
= isl_map_cow(map
);
3292 map
->dim
= isl_dim_cow(map
->dim
);
3296 for (i
= 1; i
< map
->n
; ++i
)
3297 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
3299 for (i
= 0; i
< map
->n
; ++i
) {
3300 map
->p
[i
] = (struct isl_basic_map
*)
3301 isl_basic_map_underlying_set(map
->p
[i
]);
3306 map
->dim
= isl_dim_underlying(map
->dim
, 0);
3308 isl_dim_free(map
->dim
);
3309 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
3313 return (struct isl_set
*)map
;
3319 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
3321 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
3324 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
3326 struct isl_basic_set
*domain
;
3331 n_in
= isl_basic_map_n_in(bmap
);
3332 n_out
= isl_basic_map_n_out(bmap
);
3333 domain
= isl_basic_set_from_basic_map(bmap
);
3334 return isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
3337 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
3339 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
3342 struct isl_set
*isl_map_range(struct isl_map
*map
)
3345 struct isl_set
*set
;
3349 if (isl_map_dim(map
, isl_dim_in
) == 0)
3350 return (isl_set
*)map
;
3352 map
= isl_map_cow(map
);
3356 set
= (struct isl_set
*) map
;
3357 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
3360 for (i
= 0; i
< map
->n
; ++i
) {
3361 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
3365 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3366 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3373 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
3376 struct isl_map
*map
= NULL
;
3378 set
= isl_set_cow(set
);
3381 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
3382 map
= (struct isl_map
*)set
;
3383 for (i
= 0; i
< set
->n
; ++i
) {
3384 map
->p
[i
] = isl_basic_map_from_basic_set(
3385 set
->p
[i
], isl_dim_copy(dim
));
3389 isl_dim_free(map
->dim
);
3398 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
3400 return (struct isl_map
*)set
;
3403 __isl_give isl_map
*isl_map_from_domain(__isl_take isl_set
*set
)
3405 return isl_map_reverse(isl_map_from_range(set
));;
3408 __isl_give isl_map
*isl_map_from_domain_and_range(__isl_take isl_set
*domain
,
3409 __isl_take isl_set
*range
)
3411 return isl_map_product(isl_map_from_domain(domain
),
3412 isl_map_from_range(range
));
3415 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
3418 struct isl_set
*set
= NULL
;
3422 map
= isl_map_cow(map
);
3425 map
->dim
= isl_dim_cow(map
->dim
);
3428 map
->dim
->n_out
+= map
->dim
->n_in
;
3430 set
= (struct isl_set
*)map
;
3431 for (i
= 0; i
< map
->n
; ++i
) {
3432 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
3442 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
3444 struct isl_map
*map
;
3448 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
3449 map
= isl_alloc(dim
->ctx
, struct isl_map
,
3450 sizeof(struct isl_map
) +
3451 (n
- 1) * sizeof(struct isl_basic_map
*));
3455 map
->ctx
= dim
->ctx
;
3456 isl_ctx_ref(map
->ctx
);
3468 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
3469 unsigned nparam
, unsigned in
, unsigned out
, int n
,
3472 struct isl_map
*map
;
3473 struct isl_dim
*dims
;
3475 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
3479 map
= isl_map_alloc_dim(dims
, n
, flags
);
3483 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
3485 struct isl_basic_map
*bmap
;
3486 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
3487 bmap
= isl_basic_map_set_to_empty(bmap
);
3491 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
3493 struct isl_basic_set
*bset
;
3494 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
3495 bset
= isl_basic_set_set_to_empty(bset
);
3499 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
3501 struct isl_basic_map
*bmap
;
3504 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3505 bmap
= isl_basic_map_set_to_empty(bmap
);
3509 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
3511 struct isl_basic_map
*bmap
;
3514 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3515 bmap
= isl_basic_map_set_to_empty(bmap
);
3519 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
3521 struct isl_basic_set
*bset
;
3524 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
3525 bset
= isl_basic_set_set_to_empty(bset
);
3529 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
3531 struct isl_basic_map
*bmap
;
3532 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
3536 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
3538 struct isl_basic_set
*bset
;
3539 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
3543 __isl_give isl_basic_map
*isl_basic_map_universe_like(
3544 __isl_keep isl_basic_map
*model
)
3548 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3551 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
3555 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3558 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
3559 __isl_keep isl_set
*model
)
3563 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
3566 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
3568 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3571 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
3575 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3578 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
3582 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
3585 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
3587 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
3590 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
3594 return isl_set_empty(isl_dim_copy(model
->dim
));
3597 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
3599 struct isl_map
*map
;
3602 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3603 map
= isl_map_add_basic_map(map
, isl_basic_map_universe(dim
));
3607 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
3609 struct isl_set
*set
;
3612 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3613 set
= isl_set_add_basic_set(set
, isl_basic_set_universe(dim
));
3617 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
3621 return isl_set_universe(isl_dim_copy(model
->dim
));
3624 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3627 struct isl_map
*dup
;
3631 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3632 for (i
= 0; i
< map
->n
; ++i
)
3633 dup
= isl_map_add_basic_map(dup
, isl_basic_map_copy(map
->p
[i
]));
3637 __isl_give isl_map
*isl_map_add_basic_map(__isl_take isl_map
*map
,
3638 __isl_take isl_basic_map
*bmap
)
3642 if (isl_basic_map_fast_is_empty(bmap
)) {
3643 isl_basic_map_free(bmap
);
3646 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3647 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3648 map
->p
[map
->n
] = bmap
;
3650 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3656 isl_basic_map_free(bmap
);
3660 void isl_map_free(struct isl_map
*map
)
3670 isl_ctx_deref(map
->ctx
);
3671 for (i
= 0; i
< map
->n
; ++i
)
3672 isl_basic_map_free(map
->p
[i
]);
3673 isl_dim_free(map
->dim
);
3677 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3678 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3682 base
= isl_map_cow(base
);
3686 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3689 for (i
= 0; i
< base
->n
; ++i
) {
3690 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3691 isl_dim_copy(base
->dim
), 0, 0, 0);
3701 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3702 unsigned nparam
, unsigned dim
)
3704 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3708 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
3709 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
3713 bmap
= isl_basic_map_cow(bmap
);
3714 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3715 j
= isl_basic_map_alloc_equality(bmap
);
3718 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3719 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3720 isl_int_set_si(bmap
->eq
[j
][0], value
);
3721 bmap
= isl_basic_map_simplify(bmap
);
3722 return isl_basic_map_finalize(bmap
);
3724 isl_basic_map_free(bmap
);
3728 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
3729 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
3733 bmap
= isl_basic_map_cow(bmap
);
3734 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3735 j
= isl_basic_map_alloc_equality(bmap
);
3738 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3739 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3740 isl_int_set(bmap
->eq
[j
][0], value
);
3741 bmap
= isl_basic_map_simplify(bmap
);
3742 return isl_basic_map_finalize(bmap
);
3744 isl_basic_map_free(bmap
);
3748 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
3749 enum isl_dim_type type
, unsigned pos
, int value
)
3753 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3754 return isl_basic_map_fix_pos_si(bmap
,
3755 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3757 isl_basic_map_free(bmap
);
3761 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
3762 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3766 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3767 return isl_basic_map_fix_pos(bmap
,
3768 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3770 isl_basic_map_free(bmap
);
3774 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
3775 enum isl_dim_type type
, unsigned pos
, int value
)
3777 return (struct isl_basic_set
*)
3778 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3782 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
3783 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3785 return (struct isl_basic_set
*)
3786 isl_basic_map_fix((struct isl_basic_map
*)bset
,
3790 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
3791 unsigned input
, int value
)
3793 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
3796 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
3797 unsigned dim
, int value
)
3799 return (struct isl_basic_set
*)
3800 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3801 isl_dim_set
, dim
, value
);
3804 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
3805 enum isl_dim_type type
, unsigned pos
, int value
)
3809 map
= isl_map_cow(map
);
3813 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3814 for (i
= 0; i
< map
->n
; ++i
) {
3815 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
3819 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3826 __isl_give isl_set
*isl_set_fix_si(__isl_take isl_set
*set
,
3827 enum isl_dim_type type
, unsigned pos
, int value
)
3829 return (struct isl_set
*)
3830 isl_map_fix_si((struct isl_map
*)set
, type
, pos
, value
);
3833 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
3834 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3838 map
= isl_map_cow(map
);
3842 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3843 for (i
= 0; i
< map
->n
; ++i
) {
3844 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
3848 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3855 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
3856 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3858 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
3861 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
3862 unsigned input
, int value
)
3864 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
3867 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
3869 return (struct isl_set
*)
3870 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
3873 __isl_give isl_basic_map
*isl_basic_map_lower_bound_si(
3874 __isl_take isl_basic_map
*bmap
,
3875 enum isl_dim_type type
, unsigned pos
, int value
)
3881 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3882 pos
+= isl_basic_map_offset(bmap
, type
);
3883 bmap
= isl_basic_map_cow(bmap
);
3884 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
3885 j
= isl_basic_map_alloc_inequality(bmap
);
3888 isl_seq_clr(bmap
->ineq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3889 isl_int_set_si(bmap
->ineq
[j
][pos
], 1);
3890 isl_int_set_si(bmap
->ineq
[j
][0], -value
);
3891 bmap
= isl_basic_map_simplify(bmap
);
3892 return isl_basic_map_finalize(bmap
);
3894 isl_basic_map_free(bmap
);
3898 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
3899 unsigned dim
, isl_int value
)
3903 bset
= isl_basic_set_cow(bset
);
3904 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
3905 j
= isl_basic_set_alloc_inequality(bset
);
3908 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
3909 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
3910 isl_int_neg(bset
->ineq
[j
][0], value
);
3911 bset
= isl_basic_set_simplify(bset
);
3912 return isl_basic_set_finalize(bset
);
3914 isl_basic_set_free(bset
);
3918 __isl_give isl_map
*isl_map_lower_bound_si(__isl_take isl_map
*map
,
3919 enum isl_dim_type type
, unsigned pos
, int value
)
3923 map
= isl_map_cow(map
);
3927 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3928 for (i
= 0; i
< map
->n
; ++i
) {
3929 map
->p
[i
] = isl_basic_map_lower_bound_si(map
->p
[i
],
3934 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3941 __isl_give isl_set
*isl_set_lower_bound_si(__isl_take isl_set
*set
,
3942 enum isl_dim_type type
, unsigned pos
, int value
)
3944 return (struct isl_set
*)
3945 isl_map_lower_bound_si((struct isl_map
*)set
, type
, pos
, value
);
3948 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
3953 set
= isl_set_cow(set
);
3957 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
3958 for (i
= 0; i
< set
->n
; ++i
) {
3959 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
3969 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
3973 map
= isl_map_cow(map
);
3977 map
->dim
= isl_dim_reverse(map
->dim
);
3980 for (i
= 0; i
< map
->n
; ++i
) {
3981 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
3985 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3992 static struct isl_map
*isl_basic_map_partial_lexopt(
3993 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3994 struct isl_set
**empty
, int max
)
3998 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
3999 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
4001 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
4003 isl_basic_map_free(bmap
);
4004 isl_basic_set_free(dom
);
4010 struct isl_map
*isl_basic_map_partial_lexmax(
4011 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4012 struct isl_set
**empty
)
4014 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
4017 struct isl_map
*isl_basic_map_partial_lexmin(
4018 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
4019 struct isl_set
**empty
)
4021 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
4024 struct isl_set
*isl_basic_set_partial_lexmin(
4025 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4026 struct isl_set
**empty
)
4028 return (struct isl_set
*)
4029 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
4033 struct isl_set
*isl_basic_set_partial_lexmax(
4034 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
4035 struct isl_set
**empty
)
4037 return (struct isl_set
*)
4038 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
4042 /* Given a basic map "bmap", compute the lexicograhically minimal
4043 * (or maximal) image element for each domain element in dom.
4044 * Set *empty to those elements in dom that do not have an image element.
4046 * We first make sure the basic sets in dom are disjoint and then
4047 * simply collect the results over each of the basic sets separately.
4048 * We could probably improve the efficiency a bit by moving the union
4049 * domain down into the parametric integer programming.
4051 static __isl_give isl_map
*basic_map_partial_lexopt(
4052 __isl_take isl_basic_map
*bmap
, __isl_take isl_set
*dom
,
4053 __isl_give isl_set
**empty
, int max
)
4056 struct isl_map
*res
;
4058 dom
= isl_set_make_disjoint(dom
);
4062 if (isl_set_fast_is_empty(dom
)) {
4063 res
= isl_map_empty_like_basic_map(bmap
);
4064 *empty
= isl_set_empty_like(dom
);
4066 isl_basic_map_free(bmap
);
4070 res
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4071 isl_basic_set_copy(dom
->p
[0]), empty
, max
);
4073 for (i
= 1; i
< dom
->n
; ++i
) {
4074 struct isl_map
*res_i
;
4075 struct isl_set
*empty_i
;
4077 res_i
= isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap
),
4078 isl_basic_set_copy(dom
->p
[i
]), &empty_i
, max
);
4080 res
= isl_map_union_disjoint(res
, res_i
);
4081 *empty
= isl_set_union_disjoint(*empty
, empty_i
);
4085 isl_basic_map_free(bmap
);
4090 isl_basic_map_free(bmap
);
4094 /* Given a map "map", compute the lexicograhically minimal
4095 * (or maximal) image element for each domain element in dom.
4096 * Set *empty to those elements in dom that do not have an image element.
4098 * We first compute the lexicographically minimal or maximal element
4099 * in the first basic map. This results in a partial solution "res"
4100 * and a subset "todo" of dom that still need to be handled.
4101 * We then consider each of the remaining maps in "map" and successively
4102 * improve both "res" and "todo".
4104 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4105 * Assume we are computing the lexicographical maximum.
4106 * We first intersect basic map i with a relation that maps elements
4107 * to elements that are lexicographically larger than the image elements
4108 * in res^k and the compute the maximum image element of this intersection.
4109 * The result ("better") corresponds to those image elements in basic map i
4110 * that are better than what we had before. The remainder ("keep") are the
4111 * domain elements for which the image element in res_k was better.
4112 * We also compute the lexicographical maximum of basic map i in todo^k.
4113 * res^i is the result of the operation + better + those elements in
4114 * res^k that we should keep
4115 * todo^i is the remainder of the maximum operation on todo^k.
4117 static __isl_give isl_map
*isl_map_partial_lexopt(
4118 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4119 __isl_give isl_set
**empty
, int max
)
4122 struct isl_map
*res
;
4123 struct isl_set
*todo
;
4128 if (isl_map_fast_is_empty(map
)) {
4136 res
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[0]),
4137 isl_set_copy(dom
), &todo
, max
);
4139 for (i
= 1; i
< map
->n
; ++i
) {
4141 struct isl_map
*better
;
4142 struct isl_set
*keep
;
4143 struct isl_map
*res_i
;
4144 struct isl_set
*todo_i
;
4145 struct isl_dim
*dim
= isl_map_get_dim(res
);
4147 dim
= isl_dim_range(dim
);
4149 lt
= isl_map_lex_lt(dim
);
4151 lt
= isl_map_lex_gt(dim
);
4152 lt
= isl_map_apply_range(isl_map_copy(res
), lt
);
4153 lt
= isl_map_intersect(lt
,
4154 isl_map_from_basic_map(isl_basic_map_copy(map
->p
[i
])));
4155 better
= isl_map_partial_lexopt(lt
,
4156 isl_map_domain(isl_map_copy(res
)),
4159 res_i
= basic_map_partial_lexopt(isl_basic_map_copy(map
->p
[i
]),
4160 todo
, &todo_i
, max
);
4162 res
= isl_map_intersect_domain(res
, keep
);
4163 res
= isl_map_union_disjoint(res
, res_i
);
4164 res
= isl_map_union_disjoint(res
, better
);
4185 __isl_give isl_map
*isl_map_partial_lexmax(
4186 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4187 __isl_give isl_set
**empty
)
4189 return isl_map_partial_lexopt(map
, dom
, empty
, 1);
4192 __isl_give isl_map
*isl_map_partial_lexmin(
4193 __isl_take isl_map
*map
, __isl_take isl_set
*dom
,
4194 __isl_give isl_set
**empty
)
4196 return isl_map_partial_lexopt(map
, dom
, empty
, 0);
4199 __isl_give isl_set
*isl_set_partial_lexmin(
4200 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4201 __isl_give isl_set
**empty
)
4203 return (struct isl_set
*)
4204 isl_map_partial_lexmin((struct isl_map
*)set
,
4208 __isl_give isl_set
*isl_set_partial_lexmax(
4209 __isl_take isl_set
*set
, __isl_take isl_set
*dom
,
4210 __isl_give isl_set
**empty
)
4212 return (struct isl_set
*)
4213 isl_map_partial_lexmax((struct isl_map
*)set
,
4217 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
4219 struct isl_basic_set
*dom
= NULL
;
4220 struct isl_dim
*dom_dim
;
4224 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
4225 dom
= isl_basic_set_universe(dom_dim
);
4226 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
4228 isl_basic_map_free(bmap
);
4232 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
4234 return isl_basic_map_lexopt(bmap
, 0);
4237 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
4239 return isl_basic_map_lexopt(bmap
, 1);
4242 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
4244 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
4247 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
4249 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
4252 __isl_give isl_map
*isl_map_lexopt(__isl_take isl_map
*map
, int max
)
4254 struct isl_set
*dom
= NULL
;
4255 struct isl_dim
*dom_dim
;
4259 dom_dim
= isl_dim_domain(isl_dim_copy(map
->dim
));
4260 dom
= isl_set_universe(dom_dim
);
4261 return isl_map_partial_lexopt(map
, dom
, NULL
, max
);
4267 __isl_give isl_map
*isl_map_lexmin(__isl_take isl_map
*map
)
4269 return isl_map_lexopt(map
, 0);
4272 __isl_give isl_map
*isl_map_lexmax(__isl_take isl_map
*map
)
4274 return isl_map_lexopt(map
, 1);
4277 __isl_give isl_set
*isl_set_lexmin(__isl_take isl_set
*set
)
4279 return (isl_set
*)isl_map_lexmin((isl_map
*)set
);
4282 __isl_give isl_set
*isl_set_lexmax(__isl_take isl_set
*set
)
4284 return (isl_set
*)isl_map_lexmax((isl_map
*)set
);
4287 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
4288 struct isl_dim
*dim
)
4295 for (i
= 0; i
< map
->n
; ++i
) {
4296 isl_dim_free(map
->p
[i
]->dim
);
4297 map
->p
[i
]->dim
= isl_dim_copy(dim
);
4299 isl_dim_free(map
->dim
);
4309 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
4310 struct isl_dim
*dim
)
4312 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
4315 /* Apply a preimage specified by "mat" on the parameters of "bset".
4316 * bset is assumed to have only parameters and divs.
4318 static struct isl_basic_set
*basic_set_parameter_preimage(
4319 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
4326 bset
->dim
= isl_dim_cow(bset
->dim
);
4330 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4332 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4334 bset
->dim
->nparam
= 0;
4335 bset
->dim
->n_out
= nparam
;
4336 bset
= isl_basic_set_preimage(bset
, mat
);
4338 bset
->dim
->nparam
= bset
->dim
->n_out
;
4339 bset
->dim
->n_out
= 0;
4344 isl_basic_set_free(bset
);
4348 /* Apply a preimage specified by "mat" on the parameters of "set".
4349 * set is assumed to have only parameters and divs.
4351 static struct isl_set
*set_parameter_preimage(
4352 struct isl_set
*set
, struct isl_mat
*mat
)
4354 struct isl_dim
*dim
= NULL
;
4360 dim
= isl_dim_copy(set
->dim
);
4361 dim
= isl_dim_cow(dim
);
4365 nparam
= isl_set_dim(set
, isl_dim_param
);
4367 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
4370 dim
->n_out
= nparam
;
4371 isl_set_reset_dim(set
, dim
);
4372 set
= isl_set_preimage(set
, mat
);
4375 dim
= isl_dim_copy(set
->dim
);
4376 dim
= isl_dim_cow(dim
);
4379 dim
->nparam
= dim
->n_out
;
4381 isl_set_reset_dim(set
, dim
);
4391 /* Intersect the basic set "bset" with the affine space specified by the
4392 * equalities in "eq".
4394 static struct isl_basic_set
*basic_set_append_equalities(
4395 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
4403 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
4408 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
4409 for (i
= 0; i
< eq
->n_row
; ++i
) {
4410 k
= isl_basic_set_alloc_equality(bset
);
4413 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
4414 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
4418 bset
= isl_basic_set_gauss(bset
, NULL
);
4419 bset
= isl_basic_set_finalize(bset
);
4424 isl_basic_set_free(bset
);
4428 /* Intersect the set "set" with the affine space specified by the
4429 * equalities in "eq".
4431 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
4439 for (i
= 0; i
< set
->n
; ++i
) {
4440 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
4453 /* Project the given basic set onto its parameter domain, possibly introducing
4454 * new, explicit, existential variables in the constraints.
4455 * The input has parameters and (possibly implicit) existential variables.
4456 * The output has the same parameters, but only
4457 * explicit existentially quantified variables.
4459 * The actual projection is performed by pip, but pip doesn't seem
4460 * to like equalities very much, so we first remove the equalities
4461 * among the parameters by performing a variable compression on
4462 * the parameters. Afterward, an inverse transformation is performed
4463 * and the equalities among the parameters are inserted back in.
4465 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
4469 struct isl_mat
*T
, *T2
;
4470 struct isl_set
*set
;
4471 unsigned nparam
, n_div
;
4473 bset
= isl_basic_set_cow(bset
);
4477 if (bset
->n_eq
== 0)
4478 return isl_basic_set_lexmin(bset
);
4480 isl_basic_set_gauss(bset
, NULL
);
4482 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
4483 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
4485 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
4486 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
4489 if (i
== bset
->n_eq
)
4490 return isl_basic_set_lexmin(bset
);
4492 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
4494 eq
= isl_mat_cow(eq
);
4495 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
4496 if (T
&& T
->n_col
== 0) {
4500 bset
= isl_basic_set_set_to_empty(bset
);
4501 return isl_set_from_basic_set(bset
);
4503 bset
= basic_set_parameter_preimage(bset
, T
);
4505 set
= isl_basic_set_lexmin(bset
);
4506 set
= set_parameter_preimage(set
, T2
);
4507 set
= set_append_equalities(set
, eq
);
4511 /* Compute an explicit representation for all the existentially
4512 * quantified variables.
4513 * The input and output dimensions are first turned into parameters.
4514 * compute_divs then returns a map with the same parameters and
4515 * no input or output dimensions and the dimension specification
4516 * is reset to that of the input.
4518 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
4520 struct isl_basic_set
*bset
;
4521 struct isl_set
*set
;
4522 struct isl_map
*map
;
4523 struct isl_dim
*dim
, *orig_dim
= NULL
;
4528 bmap
= isl_basic_map_cow(bmap
);
4532 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
4533 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
4534 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
4535 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
4539 orig_dim
= bmap
->dim
;
4541 bset
= (struct isl_basic_set
*)bmap
;
4543 set
= parameter_compute_divs(bset
);
4544 map
= (struct isl_map
*)set
;
4545 map
= isl_map_reset_dim(map
, orig_dim
);
4549 isl_basic_map_free(bmap
);
4553 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
4561 off
= isl_dim_total(bmap
->dim
);
4562 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4563 if (isl_int_is_zero(bmap
->div
[i
][0]))
4565 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
4571 static int map_divs_known(__isl_keep isl_map
*map
)
4578 for (i
= 0; i
< map
->n
; ++i
) {
4579 int known
= basic_map_divs_known(map
->p
[i
]);
4587 /* If bmap contains any unknown divs, then compute explicit
4588 * expressions for them. However, this computation may be
4589 * quite expensive, so first try to remove divs that aren't
4592 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
4596 struct isl_map
*map
;
4598 known
= basic_map_divs_known(bmap
);
4602 return isl_map_from_basic_map(bmap
);
4604 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
4606 known
= basic_map_divs_known(bmap
);
4610 return isl_map_from_basic_map(bmap
);
4612 map
= compute_divs(bmap
);
4615 isl_basic_map_free(bmap
);
4619 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
4623 struct isl_map
*res
;
4630 known
= map_divs_known(map
);
4638 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
4639 for (i
= 1 ; i
< map
->n
; ++i
) {
4641 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
4642 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4643 res
= isl_map_union_disjoint(res
, r2
);
4645 res
= isl_map_union(res
, r2
);
4652 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
4654 return (struct isl_set
*)
4655 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
4658 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
4660 return (struct isl_set
*)
4661 isl_map_compute_divs((struct isl_map
*)set
);
4664 struct isl_set
*isl_map_domain(struct isl_map
*map
)
4667 struct isl_set
*set
;
4672 map
= isl_map_cow(map
);
4676 set
= (struct isl_set
*)map
;
4677 set
->dim
= isl_dim_domain(set
->dim
);
4680 for (i
= 0; i
< map
->n
; ++i
) {
4681 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
4685 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
4686 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
4693 struct isl_map
*isl_map_union_disjoint(
4694 struct isl_map
*map1
, struct isl_map
*map2
)
4698 struct isl_map
*map
= NULL
;
4712 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4714 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
4715 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
4716 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4718 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
4719 map1
->n
+ map2
->n
, flags
);
4722 for (i
= 0; i
< map1
->n
; ++i
) {
4723 map
= isl_map_add_basic_map(map
,
4724 isl_basic_map_copy(map1
->p
[i
]));
4728 for (i
= 0; i
< map2
->n
; ++i
) {
4729 map
= isl_map_add_basic_map(map
,
4730 isl_basic_map_copy(map2
->p
[i
]));
4744 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
4746 map1
= isl_map_union_disjoint(map1
, map2
);
4750 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
4754 struct isl_set
*isl_set_union_disjoint(
4755 struct isl_set
*set1
, struct isl_set
*set2
)
4757 return (struct isl_set
*)
4758 isl_map_union_disjoint(
4759 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4762 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
4764 return (struct isl_set
*)
4765 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
4768 struct isl_map
*isl_map_intersect_range(
4769 struct isl_map
*map
, struct isl_set
*set
)
4772 struct isl_map
*result
;
4778 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
4779 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
4780 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4782 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
4783 map
->n
* set
->n
, flags
);
4786 for (i
= 0; i
< map
->n
; ++i
)
4787 for (j
= 0; j
< set
->n
; ++j
) {
4788 result
= isl_map_add_basic_map(result
,
4789 isl_basic_map_intersect_range(
4790 isl_basic_map_copy(map
->p
[i
]),
4791 isl_basic_set_copy(set
->p
[j
])));
4804 struct isl_map
*isl_map_intersect_domain(
4805 struct isl_map
*map
, struct isl_set
*set
)
4807 return isl_map_reverse(
4808 isl_map_intersect_range(isl_map_reverse(map
), set
));
4811 struct isl_map
*isl_map_apply_domain(
4812 struct isl_map
*map1
, struct isl_map
*map2
)
4816 map1
= isl_map_reverse(map1
);
4817 map1
= isl_map_apply_range(map1
, map2
);
4818 return isl_map_reverse(map1
);
4825 struct isl_map
*isl_map_apply_range(
4826 struct isl_map
*map1
, struct isl_map
*map2
)
4828 struct isl_dim
*dim_result
;
4829 struct isl_map
*result
;
4835 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
4836 isl_dim_copy(map2
->dim
));
4838 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
4841 for (i
= 0; i
< map1
->n
; ++i
)
4842 for (j
= 0; j
< map2
->n
; ++j
) {
4843 result
= isl_map_add_basic_map(result
,
4844 isl_basic_map_apply_range(
4845 isl_basic_map_copy(map1
->p
[i
]),
4846 isl_basic_map_copy(map2
->p
[j
])));
4852 if (result
&& result
->n
<= 1)
4853 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
4862 * returns range - domain
4864 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
4867 struct isl_basic_set
*bset
;
4874 dim
= isl_basic_map_n_in(bmap
);
4875 nparam
= isl_basic_map_n_param(bmap
);
4876 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
4877 bset
= isl_basic_set_from_basic_map(bmap
);
4878 bset
= isl_basic_set_cow(bset
);
4879 dims
= isl_basic_set_get_dim(bset
);
4880 dims
= isl_dim_add(dims
, isl_dim_set
, dim
);
4881 bset
= isl_basic_set_extend_dim(bset
, dims
, 0, dim
, 0);
4882 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
4883 for (i
= 0; i
< dim
; ++i
) {
4884 int j
= isl_basic_map_alloc_equality(
4885 (struct isl_basic_map
*)bset
);
4888 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
4889 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
4890 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
4891 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
4893 return isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
4895 isl_basic_map_free(bmap
);
4900 * returns range - domain
4902 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
4906 struct isl_set
*result
;
4911 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
4912 dim
= isl_map_get_dim(map
);
4913 dim
= isl_dim_domain(dim
);
4914 result
= isl_set_alloc_dim(dim
, map
->n
, map
->flags
);
4917 for (i
= 0; i
< map
->n
; ++i
)
4918 result
= isl_set_add_basic_set(result
,
4919 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
4927 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
4929 struct isl_basic_map
*bmap
;
4937 nparam
= dims
->nparam
;
4939 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
4943 for (i
= 0; i
< dim
; ++i
) {
4944 int j
= isl_basic_map_alloc_equality(bmap
);
4947 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4948 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
4949 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
4951 return isl_basic_map_finalize(bmap
);
4953 isl_basic_map_free(bmap
);
4957 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
4959 struct isl_dim
*dim
= isl_dim_map(set_dim
);
4962 return basic_map_identity(dim
);
4965 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
4967 if (!model
|| !model
->dim
)
4969 isl_assert(model
->ctx
,
4970 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4971 return basic_map_identity(isl_dim_copy(model
->dim
));
4974 static struct isl_map
*map_identity(struct isl_dim
*dim
)
4976 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
4977 return isl_map_add_basic_map(map
, basic_map_identity(isl_dim_copy(dim
)));
4980 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
4982 struct isl_dim
*dim
= isl_dim_map(set_dim
);
4985 return map_identity(dim
);
4988 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
4990 if (!model
|| !model
->dim
)
4992 isl_assert(model
->ctx
,
4993 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4994 return map_identity(isl_dim_copy(model
->dim
));
4997 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
4999 if (!model
|| !model
->dim
)
5001 isl_assert(model
->ctx
,
5002 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
5003 return map_identity(isl_dim_copy(model
->dim
));
5006 /* Construct a basic set with all set dimensions having only non-negative
5009 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
5014 struct isl_basic_set
*bset
;
5018 nparam
= dims
->nparam
;
5020 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
5023 for (i
= 0; i
< dim
; ++i
) {
5024 int k
= isl_basic_set_alloc_inequality(bset
);
5027 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
5028 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
5032 isl_basic_set_free(bset
);
5036 __isl_give isl_set
*isl_set_split_dims(__isl_take isl_set
*set
,
5037 enum isl_dim_type type
, unsigned first
, unsigned n
)
5040 isl_basic_set
*nonneg
= NULL
;
5041 isl_basic_set
*neg
= NULL
;
5048 isl_assert(set
->ctx
, first
+ n
<= isl_set_dim(set
, type
), goto error
);
5050 for (i
= 0; i
< n
; ++i
) {
5054 nonneg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5055 k
= isl_basic_set_alloc_inequality(nonneg
);
5058 isl_seq_clr(nonneg
->ineq
[k
], 1 + isl_basic_set_total_dim(nonneg
));
5059 isl_int_set_si(nonneg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], 1);
5061 neg
= isl_basic_set_alloc_dim(isl_set_get_dim(set
), 0, 0, 1);
5062 k
= isl_basic_set_alloc_inequality(neg
);
5065 isl_seq_clr(neg
->ineq
[k
], 1 + isl_basic_set_total_dim(neg
));
5066 isl_int_set_si(neg
->ineq
[k
][0], -1);
5067 isl_int_set_si(neg
->ineq
[k
][pos(set
->dim
, type
) + first
+ i
], -1);
5069 set
= isl_set_intersect(set
, isl_basic_set_union(nonneg
, neg
));
5074 isl_basic_set_free(nonneg
);
5075 isl_basic_set_free(neg
);
5080 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5082 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
5085 int isl_basic_map_is_subset(
5086 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5089 struct isl_map
*map1
;
5090 struct isl_map
*map2
;
5092 if (!bmap1
|| !bmap2
)
5095 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
5096 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
5098 is_subset
= isl_map_is_subset(map1
, map2
);
5106 int isl_basic_map_is_equal(
5107 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5111 if (!bmap1
|| !bmap2
)
5113 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5116 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5120 int isl_basic_set_is_equal(
5121 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5123 return isl_basic_map_is_equal(
5124 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
5127 int isl_map_is_empty(struct isl_map
*map
)
5134 for (i
= 0; i
< map
->n
; ++i
) {
5135 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
5144 int isl_map_fast_is_empty(struct isl_map
*map
)
5149 int isl_set_fast_is_empty(struct isl_set
*set
)
5154 int isl_set_is_empty(struct isl_set
*set
)
5156 return isl_map_is_empty((struct isl_map
*)set
);
5159 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5165 is_subset
= isl_map_is_subset(map1
, map2
);
5168 is_subset
= isl_map_is_subset(map2
, map1
);
5172 int isl_basic_map_is_strict_subset(
5173 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5177 if (!bmap1
|| !bmap2
)
5179 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
5182 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
5183 if (is_subset
== -1)
5188 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
5194 is_subset
= isl_map_is_subset(map1
, map2
);
5197 is_subset
= isl_map_is_subset(map2
, map1
);
5198 if (is_subset
== -1)
5203 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
5205 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
5208 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
5212 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
5215 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
5219 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
5222 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
5227 return map
->n
== 1 && isl_basic_map_is_universe(map
->p
[0]);
5230 int isl_set_fast_is_universe(__isl_keep isl_set
*set
)
5232 return isl_map_fast_is_universe((isl_map
*) set
);
5235 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
5237 struct isl_basic_set
*bset
= NULL
;
5238 struct isl_vec
*sample
= NULL
;
5245 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
5248 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
5249 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
5250 copy
= isl_basic_map_convex_hull(copy
);
5251 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
5252 isl_basic_map_free(copy
);
5256 total
= 1 + isl_basic_map_total_dim(bmap
);
5257 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
5258 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
5264 isl_vec_free(bmap
->sample
);
5265 bmap
->sample
= NULL
;
5266 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
5269 sample
= isl_basic_set_sample_vec(bset
);
5272 empty
= sample
->size
== 0;
5273 isl_vec_free(bmap
->sample
);
5274 bmap
->sample
= sample
;
5276 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
5281 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
5285 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
5288 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
5292 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
5295 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
5297 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
5300 struct isl_map
*isl_basic_map_union(
5301 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5303 struct isl_map
*map
;
5304 if (!bmap1
|| !bmap2
)
5307 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
5309 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
5312 map
= isl_map_add_basic_map(map
, bmap1
);
5313 map
= isl_map_add_basic_map(map
, bmap2
);
5316 isl_basic_map_free(bmap1
);
5317 isl_basic_map_free(bmap2
);
5321 struct isl_set
*isl_basic_set_union(
5322 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
5324 return (struct isl_set
*)isl_basic_map_union(
5325 (struct isl_basic_map
*)bset1
,
5326 (struct isl_basic_map
*)bset2
);
5329 /* Order divs such that any div only depends on previous divs */
5330 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
5333 unsigned off
= isl_dim_total(bmap
->dim
);
5335 for (i
= 0; i
< bmap
->n_div
; ++i
) {
5337 if (isl_int_is_zero(bmap
->div
[i
][0]))
5339 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
5343 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
5349 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
5351 return (struct isl_basic_set
*)
5352 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
5355 __isl_give isl_map
*isl_map_order_divs(__isl_take isl_map
*map
)
5362 for (i
= 0; i
< map
->n
; ++i
) {
5363 map
->p
[i
] = isl_basic_map_order_divs(map
->p
[i
]);
5374 /* Look for a div in dst that corresponds to the div "div" in src.
5375 * The divs before "div" in src and dst are assumed to be the same.
5377 * Returns -1 if no corresponding div was found and the position
5378 * of the corresponding div in dst otherwise.
5380 static int find_div(struct isl_basic_map
*dst
,
5381 struct isl_basic_map
*src
, unsigned div
)
5385 unsigned total
= isl_dim_total(src
->dim
);
5387 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
5388 for (i
= div
; i
< dst
->n_div
; ++i
)
5389 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
5390 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
5391 dst
->n_div
- div
) == -1)
5396 struct isl_basic_map
*isl_basic_map_align_divs(
5397 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
5400 unsigned total
= isl_dim_total(src
->dim
);
5405 if (src
->n_div
== 0)
5408 for (i
= 0; i
< src
->n_div
; ++i
)
5409 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
5411 src
= isl_basic_map_order_divs(src
);
5412 dst
= isl_basic_map_cow(dst
);
5413 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
5414 src
->n_div
, 0, 2 * src
->n_div
);
5417 for (i
= 0; i
< src
->n_div
; ++i
) {
5418 int j
= find_div(dst
, src
, i
);
5420 j
= isl_basic_map_alloc_div(dst
);
5423 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
5424 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
5425 if (isl_basic_map_add_div_constraints(dst
, j
) < 0)
5429 isl_basic_map_swap_div(dst
, i
, j
);
5433 isl_basic_map_free(dst
);
5437 struct isl_basic_set
*isl_basic_set_align_divs(
5438 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
5440 return (struct isl_basic_set
*)isl_basic_map_align_divs(
5441 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
5444 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
5452 map
= isl_map_compute_divs(map
);
5453 map
= isl_map_cow(map
);
5457 for (i
= 1; i
< map
->n
; ++i
)
5458 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
5459 for (i
= 1; i
< map
->n
; ++i
)
5460 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
5462 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5466 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
5468 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
5471 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
5475 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
5476 map
= isl_map_intersect_domain(map
, set
);
5477 set
= isl_map_range(map
);
5485 /* There is no need to cow as removing empty parts doesn't change
5486 * the meaning of the set.
5488 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
5495 for (i
= map
->n
-1; i
>= 0; --i
) {
5496 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
5498 isl_basic_map_free(map
->p
[i
]);
5499 if (i
!= map
->n
-1) {
5500 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
5501 map
->p
[i
] = map
->p
[map
->n
-1];
5509 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
5511 return (struct isl_set
*)
5512 isl_map_remove_empty_parts((struct isl_map
*)set
);
5515 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
5517 struct isl_basic_map
*bmap
;
5518 if (!map
|| map
->n
== 0)
5520 bmap
= map
->p
[map
->n
-1];
5521 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
5522 return isl_basic_map_copy(bmap
);
5525 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
5527 return (struct isl_basic_set
*)
5528 isl_map_copy_basic_map((struct isl_map
*)set
);
5531 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
5532 __isl_keep isl_basic_map
*bmap
)
5538 for (i
= map
->n
-1; i
>= 0; --i
) {
5539 if (map
->p
[i
] != bmap
)
5541 map
= isl_map_cow(map
);
5544 isl_basic_map_free(map
->p
[i
]);
5545 if (i
!= map
->n
-1) {
5546 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
5547 map
->p
[i
] = map
->p
[map
->n
-1];
5558 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
5559 struct isl_basic_set
*bset
)
5561 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
5562 (struct isl_basic_map
*)bset
);
5565 /* Given two basic sets bset1 and bset2, compute the maximal difference
5566 * between the values of dimension pos in bset1 and those in bset2
5567 * for any common value of the parameters and dimensions preceding pos.
5569 static enum isl_lp_result
basic_set_maximal_difference_at(
5570 __isl_keep isl_basic_set
*bset1
, __isl_keep isl_basic_set
*bset2
,
5571 int pos
, isl_int
*opt
)
5573 struct isl_dim
*dims
;
5574 struct isl_basic_map
*bmap1
= NULL
;
5575 struct isl_basic_map
*bmap2
= NULL
;
5576 struct isl_ctx
*ctx
;
5577 struct isl_vec
*obj
;
5580 unsigned dim1
, dim2
;
5581 enum isl_lp_result res
;
5583 if (!bset1
|| !bset2
)
5584 return isl_lp_error
;
5586 nparam
= isl_basic_set_n_param(bset1
);
5587 dim1
= isl_basic_set_n_dim(bset1
);
5588 dim2
= isl_basic_set_n_dim(bset2
);
5589 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
5590 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
5591 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
5592 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
5593 if (!bmap1
|| !bmap2
)
5595 bmap1
= isl_basic_map_cow(bmap1
);
5596 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
5597 pos
, (dim1
- pos
) + (dim2
- pos
),
5598 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
5599 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
5602 total
= isl_basic_map_total_dim(bmap1
);
5604 obj
= isl_vec_alloc(ctx
, 1 + total
);
5605 isl_seq_clr(obj
->block
.data
, 1 + total
);
5606 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
5607 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
5610 res
= isl_basic_map_solve_lp(bmap1
, 1, obj
->block
.data
, ctx
->one
,
5612 isl_basic_map_free(bmap1
);
5616 isl_basic_map_free(bmap1
);
5617 isl_basic_map_free(bmap2
);
5618 return isl_lp_error
;
5621 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5622 * for any common value of the parameters and dimensions preceding pos
5623 * in both basic sets, the values of dimension pos in bset1 are
5624 * smaller or larger than those in bset2.
5627 * 1 if bset1 follows bset2
5628 * -1 if bset1 precedes bset2
5629 * 0 if bset1 and bset2 are incomparable
5630 * -2 if some error occurred.
5632 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
5633 struct isl_basic_set
*bset2
, int pos
)
5636 enum isl_lp_result res
;
5641 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5643 if (res
== isl_lp_empty
)
5645 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5646 res
== isl_lp_unbounded
)
5648 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5657 /* Given two basic sets bset1 and bset2, check whether
5658 * for any common value of the parameters and dimensions preceding pos
5659 * there is a value of dimension pos in bset1 that is larger
5660 * than a value of the same dimension in bset2.
5663 * 1 if there exists such a pair
5664 * 0 if there is no such pair, but there is a pair of equal values
5666 * -2 if some error occurred.
5668 int isl_basic_set_follows_at(__isl_keep isl_basic_set
*bset1
,
5669 __isl_keep isl_basic_set
*bset2
, int pos
)
5672 enum isl_lp_result res
;
5677 res
= basic_set_maximal_difference_at(bset1
, bset2
, pos
, &opt
);
5679 if (res
== isl_lp_empty
)
5681 else if ((res
== isl_lp_ok
&& isl_int_is_pos(opt
)) ||
5682 res
== isl_lp_unbounded
)
5684 else if (res
== isl_lp_ok
&& isl_int_is_neg(opt
))
5686 else if (res
== isl_lp_ok
)
5695 /* Given two sets set1 and set2, check whether
5696 * for any common value of the parameters and dimensions preceding pos
5697 * there is a value of dimension pos in set1 that is larger
5698 * than a value of the same dimension in set2.
5701 * 1 if there exists such a pair
5702 * 0 if there is no such pair, but there is a pair of equal values
5704 * -2 if some error occurred.
5706 int isl_set_follows_at(__isl_keep isl_set
*set1
,
5707 __isl_keep isl_set
*set2
, int pos
)
5715 for (i
= 0; i
< set1
->n
; ++i
)
5716 for (j
= 0; j
< set2
->n
; ++j
) {
5718 f
= isl_basic_set_follows_at(set1
->p
[i
], set2
->p
[j
], pos
);
5719 if (f
== 1 || f
== -2)
5728 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
5729 unsigned pos
, isl_int
*val
)
5737 total
= isl_basic_map_total_dim(bmap
);
5738 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
5739 for (; d
+1 > pos
; --d
)
5740 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
5744 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
5746 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
5748 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
5751 isl_int_neg(*val
, bmap
->eq
[i
][0]);
5757 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
5758 unsigned pos
, isl_int
*val
)
5770 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
5773 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
5774 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
5775 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
5776 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5780 isl_int_set(*val
, v
);
5786 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
5787 unsigned pos
, isl_int
*val
)
5789 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
5793 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
5796 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
5799 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
5800 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5802 if (pos
>= isl_basic_map_dim(bmap
, type
))
5804 return isl_basic_map_fast_has_fixed_var(bmap
,
5805 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
5808 int isl_map_fast_is_fixed(struct isl_map
*map
,
5809 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5811 if (pos
>= isl_map_dim(map
, type
))
5813 return isl_map_fast_has_fixed_var(map
,
5814 map_offset(map
, type
) - 1 + pos
, val
);
5817 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5818 * then return this fixed value in *val.
5820 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
5823 return isl_basic_set_fast_has_fixed_var(bset
,
5824 isl_basic_set_n_param(bset
) + dim
, val
);
5827 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5828 * then return this fixed value in *val.
5830 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
5832 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
5835 /* Check if input variable in has fixed value and if so and if val is not NULL,
5836 * then return this fixed value in *val.
5838 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
5840 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
5843 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5844 * and if val is not NULL, then return this lower bound in *val.
5846 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
5847 unsigned dim
, isl_int
*val
)
5849 int i
, i_eq
= -1, i_ineq
= -1;
5856 total
= isl_basic_set_total_dim(bset
);
5857 nparam
= isl_basic_set_n_param(bset
);
5858 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5859 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
5865 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5866 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
5868 if (i_eq
!= -1 || i_ineq
!= -1)
5872 if (i_eq
== -1 && i_ineq
== -1)
5874 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
5875 /* The coefficient should always be one due to normalization. */
5876 if (!isl_int_is_one(c
[1+nparam
+dim
]))
5878 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
5880 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
5881 total
- nparam
- dim
- 1) != -1)
5884 isl_int_neg(*val
, c
[0]);
5888 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
5889 unsigned dim
, isl_int
*val
)
5901 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5905 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5907 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
5908 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
5910 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5914 isl_int_set(*val
, v
);
5925 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
5927 const struct constraint
*c1
= (const struct constraint
*)p1
;
5928 const struct constraint
*c2
= (const struct constraint
*)p2
;
5929 unsigned size
= isl_min(c1
->size
, c2
->size
);
5930 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
5933 static struct isl_basic_map
*isl_basic_map_sort_constraints(
5934 struct isl_basic_map
*bmap
)
5937 struct constraint
*c
;
5942 total
= isl_basic_map_total_dim(bmap
);
5943 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
5946 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
5948 c
[i
].c
= bmap
->ineq
[i
];
5950 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
5951 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
5952 bmap
->ineq
[i
] = c
[i
].c
;
5956 isl_basic_map_free(bmap
);
5960 __isl_give isl_basic_set
*isl_basic_set_sort_constraints(
5961 __isl_take isl_basic_set
*bset
)
5963 return (struct isl_basic_set
*)isl_basic_map_sort_constraints(
5964 (struct isl_basic_map
*)bset
);
5967 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
5971 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
5973 bmap
= isl_basic_map_convex_hull(bmap
);
5974 bmap
= isl_basic_map_sort_constraints(bmap
);
5975 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
5979 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
5981 return (struct isl_basic_set
*)isl_basic_map_normalize(
5982 (struct isl_basic_map
*)bset
);
5985 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
5986 const struct isl_basic_map
*bmap2
)
5993 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
5994 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
5995 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
5996 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5997 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
5998 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5999 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
6000 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6002 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
6004 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
6006 if (bmap1
->n_eq
!= bmap2
->n_eq
)
6007 return bmap1
->n_eq
- bmap2
->n_eq
;
6008 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
6009 return bmap1
->n_ineq
- bmap2
->n_ineq
;
6010 if (bmap1
->n_div
!= bmap2
->n_div
)
6011 return bmap1
->n_div
- bmap2
->n_div
;
6012 total
= isl_basic_map_total_dim(bmap1
);
6013 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
6014 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
6018 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
6019 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
6023 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
6024 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
6031 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
6032 struct isl_basic_map
*bmap2
)
6034 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
6037 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set
*bset1
,
6038 __isl_keep isl_basic_set
*bset2
)
6040 return isl_basic_map_fast_is_equal((isl_basic_map
*)bset1
,
6041 (isl_basic_map
*)bset2
);
6044 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
6046 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
6047 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
6049 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
6052 /* We normalize in place, but if anything goes wrong we need
6053 * to return NULL, so we need to make sure we don't change the
6054 * meaning of any possible other copies of map.
6056 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
6059 struct isl_basic_map
*bmap
;
6063 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
6065 for (i
= 0; i
< map
->n
; ++i
) {
6066 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
6069 isl_basic_map_free(map
->p
[i
]);
6072 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
6073 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
6074 map
= isl_map_remove_empty_parts(map
);
6077 for (i
= map
->n
- 1; i
>= 1; --i
) {
6078 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
6080 isl_basic_map_free(map
->p
[i
-1]);
6081 for (j
= i
; j
< map
->n
; ++j
)
6082 map
->p
[j
-1] = map
->p
[j
];
6092 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
6094 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
6097 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
6107 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
6110 map1
= isl_map_copy(map1
);
6111 map2
= isl_map_copy(map2
);
6112 map1
= isl_map_normalize(map1
);
6113 map2
= isl_map_normalize(map2
);
6116 equal
= map1
->n
== map2
->n
;
6117 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
6118 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
6131 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
6133 return isl_map_fast_is_equal((struct isl_map
*)set1
,
6134 (struct isl_map
*)set2
);
6137 /* Return an interval that ranges from min to max (inclusive)
6139 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
6140 isl_int min
, isl_int max
)
6143 struct isl_basic_set
*bset
= NULL
;
6145 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
6149 k
= isl_basic_set_alloc_inequality(bset
);
6152 isl_int_set_si(bset
->ineq
[k
][1], 1);
6153 isl_int_neg(bset
->ineq
[k
][0], min
);
6155 k
= isl_basic_set_alloc_inequality(bset
);
6158 isl_int_set_si(bset
->ineq
[k
][1], -1);
6159 isl_int_set(bset
->ineq
[k
][0], max
);
6163 isl_basic_set_free(bset
);
6167 /* Return the Cartesian product of the basic sets in list (in the given order).
6169 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
6177 struct isl_basic_set
*product
= NULL
;
6181 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
6182 isl_assert(list
->ctx
, list
->p
[0], goto error
);
6183 nparam
= isl_basic_set_n_param(list
->p
[0]);
6184 dim
= isl_basic_set_n_dim(list
->p
[0]);
6185 extra
= list
->p
[0]->n_div
;
6186 n_eq
= list
->p
[0]->n_eq
;
6187 n_ineq
= list
->p
[0]->n_ineq
;
6188 for (i
= 1; i
< list
->n
; ++i
) {
6189 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
6190 isl_assert(list
->ctx
,
6191 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
6192 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6193 extra
+= list
->p
[i
]->n_div
;
6194 n_eq
+= list
->p
[i
]->n_eq
;
6195 n_ineq
+= list
->p
[i
]->n_ineq
;
6197 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
6202 for (i
= 0; i
< list
->n
; ++i
) {
6203 isl_basic_set_add_constraints(product
,
6204 isl_basic_set_copy(list
->p
[i
]), dim
);
6205 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
6207 isl_basic_set_list_free(list
);
6210 isl_basic_set_free(product
);
6211 isl_basic_set_list_free(list
);
6215 struct isl_basic_map
*isl_basic_map_product(
6216 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
6218 struct isl_dim
*dim_result
= NULL
;
6219 struct isl_basic_map
*bmap
;
6220 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
6221 struct isl_dim_map
*dim_map1
, *dim_map2
;
6223 if (!bmap1
|| !bmap2
)
6226 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
6227 bmap2
->dim
, isl_dim_param
), goto error
);
6228 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
6229 isl_dim_copy(bmap2
->dim
));
6231 in1
= isl_basic_map_n_in(bmap1
);
6232 in2
= isl_basic_map_n_in(bmap2
);
6233 out1
= isl_basic_map_n_out(bmap1
);
6234 out2
= isl_basic_map_n_out(bmap2
);
6235 nparam
= isl_basic_map_n_param(bmap1
);
6237 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
6238 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6239 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
6240 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
6241 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
6242 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
6243 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
6244 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
6245 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
6246 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
6247 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
6249 bmap
= isl_basic_map_alloc_dim(dim_result
,
6250 bmap1
->n_div
+ bmap2
->n_div
,
6251 bmap1
->n_eq
+ bmap2
->n_eq
,
6252 bmap1
->n_ineq
+ bmap2
->n_ineq
);
6253 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
6254 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
6255 bmap
= isl_basic_map_simplify(bmap
);
6256 return isl_basic_map_finalize(bmap
);
6258 isl_basic_map_free(bmap1
);
6259 isl_basic_map_free(bmap2
);
6263 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6265 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
6268 struct isl_map
*result
;
6274 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
6275 map2
->dim
, isl_dim_param
), goto error
);
6277 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
6278 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
6279 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
6281 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
6282 isl_dim_copy(map2
->dim
)),
6283 map1
->n
* map2
->n
, flags
);
6286 for (i
= 0; i
< map1
->n
; ++i
)
6287 for (j
= 0; j
< map2
->n
; ++j
) {
6288 struct isl_basic_map
*part
;
6289 part
= isl_basic_map_product(
6290 isl_basic_map_copy(map1
->p
[i
]),
6291 isl_basic_map_copy(map2
->p
[j
]));
6292 if (isl_basic_map_is_empty(part
))
6293 isl_basic_map_free(part
);
6295 result
= isl_map_add_basic_map(result
, part
);
6308 /* Given two set A and B, construct its Cartesian product A x B.
6310 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
6312 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
6313 (struct isl_map
*)set2
);
6316 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
6319 uint32_t hash
= isl_hash_init();
6324 bset
= isl_basic_set_copy(bset
);
6325 bset
= isl_basic_set_normalize(bset
);
6328 total
= isl_basic_set_total_dim(bset
);
6329 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
6330 for (i
= 0; i
< bset
->n_eq
; ++i
) {
6332 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
6333 isl_hash_hash(hash
, c_hash
);
6335 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
6336 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
6338 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
6339 isl_hash_hash(hash
, c_hash
);
6341 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
6342 for (i
= 0; i
< bset
->n_div
; ++i
) {
6344 if (isl_int_is_zero(bset
->div
[i
][0]))
6346 isl_hash_byte(hash
, i
& 0xFF);
6347 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
6348 isl_hash_hash(hash
, c_hash
);
6350 isl_basic_set_free(bset
);
6354 uint32_t isl_set_get_hash(struct isl_set
*set
)
6361 set
= isl_set_copy(set
);
6362 set
= isl_set_normalize(set
);
6366 hash
= isl_hash_init();
6367 for (i
= 0; i
< set
->n
; ++i
) {
6369 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
6370 isl_hash_hash(hash
, bset_hash
);
6378 /* Check if the value for dimension dim is completely determined
6379 * by the values of the other parameters and variables.
6380 * That is, check if dimension dim is involved in an equality.
6382 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
6389 nparam
= isl_basic_set_n_param(bset
);
6390 for (i
= 0; i
< bset
->n_eq
; ++i
)
6391 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
6396 /* Check if the value for dimension dim is completely determined
6397 * by the values of the other parameters and variables.
6398 * That is, check if dimension dim is involved in an equality
6399 * for each of the subsets.
6401 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
6407 for (i
= 0; i
< set
->n
; ++i
) {
6409 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
6416 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
6417 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
6424 for (i
= 0; i
< map
->n
; ++i
)
6425 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
6431 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
6432 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
6439 for (i
= 0; i
< set
->n
; ++i
)
6440 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
6446 __isl_give isl_basic_set
*isl_basic_set_lift(__isl_take isl_basic_set
*bset
)
6448 struct isl_dim
*dim
;
6453 if (bset
->n_div
== 0)
6456 bset
= isl_basic_set_cow(bset
);
6460 dim
= isl_basic_set_get_dim(bset
);
6461 dim
= isl_dim_add(dim
, isl_dim_set
, bset
->n_div
);
6464 isl_dim_free(bset
->dim
);
6468 bset
= isl_basic_set_finalize(bset
);
6472 isl_basic_set_free(bset
);
6476 __isl_give isl_set
*isl_set_lift(__isl_take isl_set
*set
)
6479 struct isl_dim
*dim
;
6482 set
= isl_set_align_divs(set
);
6486 if (set
->n
== 0 || set
->p
[0]->n_div
== 0)
6489 set
= isl_set_cow(set
);
6493 n_div
= set
->p
[0]->n_div
;
6494 dim
= isl_set_get_dim(set
);
6495 dim
= isl_dim_add(dim
, isl_dim_set
, n_div
);
6498 isl_dim_free(set
->dim
);
6501 for (i
= 0; i
< set
->n
; ++i
) {
6502 set
->p
[i
] = isl_basic_set_lift(set
->p
[i
]);
6513 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
6515 struct isl_dim
*dim
;
6516 struct isl_basic_map
*bmap
;
6523 set
= isl_set_align_divs(set
);
6528 dim
= isl_set_get_dim(set
);
6529 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
6531 return isl_map_identity(dim
);
6534 n_div
= set
->p
[0]->n_div
;
6535 dim
= isl_dim_map(dim
);
6536 n_param
= isl_dim_size(dim
, isl_dim_param
);
6537 n_set
= isl_dim_size(dim
, isl_dim_in
);
6538 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
6539 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
6540 for (i
= 0; i
< n_set
; ++i
)
6541 bmap
= var_equal(bmap
, i
);
6543 total
= n_param
+ n_set
+ n_set
+ n_div
;
6544 for (i
= 0; i
< n_div
; ++i
) {
6545 k
= isl_basic_map_alloc_inequality(bmap
);
6548 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
6549 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
6550 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
6551 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
6552 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
6553 set
->p
[0]->div
[i
][0]);
6555 l
= isl_basic_map_alloc_inequality(bmap
);
6558 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
6559 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
6560 set
->p
[0]->div
[i
][0]);
6561 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
6565 return isl_map_from_basic_map(bmap
);
6568 isl_basic_map_free(bmap
);
6572 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
6580 dim
= isl_basic_set_total_dim(bset
);
6581 size
+= bset
->n_eq
* (1 + dim
);
6582 size
+= bset
->n_ineq
* (1 + dim
);
6583 size
+= bset
->n_div
* (2 + dim
);
6588 int isl_set_size(__isl_keep isl_set
*set
)
6596 for (i
= 0; i
< set
->n
; ++i
)
6597 size
+= isl_basic_set_size(set
->p
[i
]);
6602 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map
*bmap
,
6603 enum isl_dim_type type
, unsigned pos
)
6611 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), return -1);
6613 pos
+= isl_basic_map_offset(bmap
, type
);
6615 for (i
= 0; i
< bmap
->n_eq
; ++i
)
6616 if (!isl_int_is_zero(bmap
->eq
[i
][pos
]))
6620 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
6621 int sgn
= isl_int_sgn(bmap
->ineq
[i
][pos
]);
6628 return lower
&& upper
;
6631 int isl_map_dim_is_bounded(__isl_keep isl_map
*map
,
6632 enum isl_dim_type type
, unsigned pos
)
6639 for (i
= 0; i
< map
->n
; ++i
) {
6641 bounded
= isl_basic_map_dim_is_bounded(map
->p
[i
], type
, pos
);
6642 if (bounded
< 0 || !bounded
)
6649 /* Return 1 if the specified dim is involved in both an upper bound
6650 * and a lower bound.
6652 int isl_set_dim_is_bounded(__isl_keep isl_set
*set
,
6653 enum isl_dim_type type
, unsigned pos
)
6655 return isl_map_dim_is_bounded((isl_map
*)set
, type
, pos
);
6658 /* For each of the "n" variables starting at "first", determine
6659 * the sign of the variable and put the results in the first "n"
6660 * elements of the array "signs".
6662 * 1 means that the variable is non-negative
6663 * -1 means that the variable is non-positive
6664 * 0 means the variable attains both positive and negative values.
6666 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set
*bset
,
6667 unsigned first
, unsigned n
, int *signs
)
6669 isl_vec
*bound
= NULL
;
6670 struct isl_tab
*tab
= NULL
;
6671 struct isl_tab_undo
*snap
;
6674 if (!bset
|| !signs
)
6677 bound
= isl_vec_alloc(bset
->ctx
, 1 + isl_basic_set_total_dim(bset
));
6678 tab
= isl_tab_from_basic_set(bset
);
6682 isl_seq_clr(bound
->el
, bound
->size
);
6683 isl_int_set_si(bound
->el
[0], -1);
6685 snap
= isl_tab_snap(tab
);
6686 for (i
= 0; i
< n
; ++i
) {
6689 isl_int_set_si(bound
->el
[1 + first
+ i
], -1);
6690 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6693 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6694 if (isl_tab_rollback(tab
, snap
) < 0)
6702 isl_int_set_si(bound
->el
[1 + first
+ i
], 1);
6703 if (isl_tab_add_ineq(tab
, bound
->el
) < 0)
6706 isl_int_set_si(bound
->el
[1 + first
+ i
], 0);
6707 if (isl_tab_rollback(tab
, snap
) < 0)
6710 signs
[i
] = empty
? -1 : 0;
6714 isl_vec_free(bound
);
6718 isl_vec_free(bound
);
6722 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set
*bset
,
6723 enum isl_dim_type type
, unsigned first
, unsigned n
, int *signs
)
6725 if (!bset
|| !signs
)
6727 isl_assert(bset
->ctx
, first
+ n
<= isl_basic_set_dim(bset
, type
),
6730 first
+= pos(bset
->dim
, type
) - 1;
6731 return isl_basic_set_vars_get_sign(bset
, first
, n
, signs
);
6734 /* Check if the given map is single-valued.
6739 * and check if the result is a subset of the identity mapping.
6741 int isl_map_is_single_valued(__isl_keep isl_map
*map
)
6747 test
= isl_map_reverse(isl_map_copy(map
));
6748 test
= isl_map_apply_range(test
, isl_map_copy(map
));
6750 id
= isl_map_identity(isl_dim_range(isl_map_get_dim(map
)));
6752 sv
= isl_map_is_subset(test
, id
);