6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
18 /* Maps dst positions to src positions */
24 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
27 struct isl_dim_map
*dim_map
;
28 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
29 sizeof(struct isl_dim_map
) + len
* sizeof(int));
32 dim_map
->len
= 1 + len
;
34 for (i
= 0; i
< len
; ++i
)
35 dim_map
->pos
[1 + i
] = -1;
39 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
42 case isl_dim_param
: return dim
->nparam
;
43 case isl_dim_in
: return dim
->n_in
;
44 case isl_dim_out
: return dim
->n_out
;
45 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
49 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
52 case isl_dim_param
: return 1;
53 case isl_dim_in
: return 1 + dim
->nparam
;
54 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
58 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
59 enum isl_dim_type type
, unsigned dst_pos
)
67 src_pos
= pos(dim
, type
);
68 for (i
= 0; i
< n(dim
, type
); ++i
)
69 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
72 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
73 struct isl_basic_map
*bmap
, unsigned dst_pos
)
78 if (!dim_map
|| !bmap
)
81 src_pos
= 1 + isl_dim_total(bmap
->dim
);
82 for (i
= 0; i
< bmap
->n_div
; ++i
)
83 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
86 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
90 for (i
= 0; i
< dim_map
->len
; ++i
)
91 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
92 fprintf(stderr
, "\n");
95 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
96 enum isl_dim_type type
)
98 struct isl_dim
*dim
= bmap
->dim
;
102 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
103 case isl_dim_div
: return bmap
->n_div
;
104 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
108 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
110 return n(map
->dim
, type
);
113 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
115 return n(set
->dim
, type
);
118 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
119 enum isl_dim_type type
)
121 struct isl_dim
*dim
= bmap
->dim
;
123 case isl_dim_param
: return 1;
124 case isl_dim_in
: return 1 + dim
->nparam
;
125 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
126 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
130 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
132 return pos(map
->dim
, type
);
135 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
136 enum isl_dim_type type
)
138 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
141 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
143 return bset
->dim
->n_out
;
146 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
148 return bset
->dim
->nparam
;
151 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
153 return isl_dim_total(bset
->dim
) + bset
->n_div
;
156 unsigned isl_set_n_dim(const struct isl_set
*set
)
158 return set
->dim
->n_out
;
161 unsigned isl_set_n_param(const struct isl_set
*set
)
163 return set
->dim
->nparam
;
166 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
168 return bmap
->dim
->n_in
;
171 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
173 return bmap
->dim
->n_out
;
176 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
178 return bmap
->dim
->nparam
;
181 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
186 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
188 return isl_dim_total(bmap
->dim
) + bmap
->n_div
;
191 unsigned isl_map_n_in(const struct isl_map
*map
)
193 return map
->dim
->n_in
;
196 unsigned isl_map_n_out(const struct isl_map
*map
)
198 return map
->dim
->n_out
;
201 unsigned isl_map_n_param(const struct isl_map
*map
)
203 return map
->dim
->nparam
;
206 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
208 return map
->dim
->n_in
== set
->dim
->n_out
&&
209 map
->dim
->nparam
== set
->dim
->nparam
;
212 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
213 struct isl_basic_set
*bset
)
215 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
216 bmap
->dim
->nparam
== bset
->dim
->nparam
;
219 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
220 struct isl_basic_set
*bset
)
222 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
223 bmap
->dim
->nparam
== bset
->dim
->nparam
;
226 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
230 return isl_dim_copy(bmap
->dim
);
233 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
237 return isl_dim_copy(bset
->dim
);
240 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
244 return isl_dim_copy(map
->dim
);
247 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
251 return isl_dim_copy(set
->dim
);
254 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
255 struct isl_basic_map
*bmap
, unsigned extra
,
256 unsigned n_eq
, unsigned n_ineq
)
259 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
261 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
262 if (isl_blk_is_error(bmap
->block
)) {
267 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
269 isl_blk_free(ctx
, bmap
->block
);
275 bmap
->block2
= isl_blk_empty();
278 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
279 if (isl_blk_is_error(bmap
->block2
)) {
281 isl_blk_free(ctx
, bmap
->block
);
286 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
288 isl_blk_free(ctx
, bmap
->block2
);
290 isl_blk_free(ctx
, bmap
->block
);
296 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
297 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
299 for (i
= 0; i
< extra
; ++i
)
300 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
306 bmap
->c_size
= n_eq
+ n_ineq
;
307 bmap
->eq
= bmap
->ineq
+ n_ineq
;
316 isl_basic_map_free(bmap
);
320 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
321 unsigned nparam
, unsigned dim
, unsigned extra
,
322 unsigned n_eq
, unsigned n_ineq
)
324 struct isl_basic_map
*bmap
;
325 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
326 return (struct isl_basic_set
*)bmap
;
329 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
330 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
332 struct isl_basic_map
*bmap
;
335 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
336 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
337 return (struct isl_basic_set
*)bmap
;
340 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
341 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
343 struct isl_basic_map
*bmap
;
347 bmap
= isl_alloc_type(dim
->ctx
, struct isl_basic_map
);
352 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
358 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
359 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
360 unsigned n_eq
, unsigned n_ineq
)
362 struct isl_basic_map
*bmap
;
365 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
369 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
373 static void dup_constraints(
374 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
377 unsigned total
= isl_basic_map_total_dim(src
);
379 for (i
= 0; i
< src
->n_eq
; ++i
) {
380 int j
= isl_basic_map_alloc_equality(dst
);
381 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
384 for (i
= 0; i
< src
->n_ineq
; ++i
) {
385 int j
= isl_basic_map_alloc_inequality(dst
);
386 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
389 for (i
= 0; i
< src
->n_div
; ++i
) {
390 int j
= isl_basic_map_alloc_div(dst
);
391 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
393 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
396 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
398 struct isl_basic_map
*dup
;
402 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
403 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
406 dup_constraints(dup
, bmap
);
407 dup
->flags
= bmap
->flags
;
408 dup
->sample
= isl_vec_copy(bmap
->sample
);
412 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
414 struct isl_basic_map
*dup
;
416 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
417 return (struct isl_basic_set
*)dup
;
420 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
425 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
429 return isl_basic_set_dup(bset
);
432 struct isl_set
*isl_set_copy(struct isl_set
*set
)
441 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
446 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
450 return isl_basic_map_dup(bmap
);
453 struct isl_map
*isl_map_copy(struct isl_map
*map
)
462 void isl_basic_map_free(struct isl_basic_map
*bmap
)
470 isl_ctx_deref(bmap
->ctx
);
472 isl_blk_free(bmap
->ctx
, bmap
->block2
);
474 isl_blk_free(bmap
->ctx
, bmap
->block
);
475 isl_vec_free(bmap
->sample
);
476 isl_dim_free(bmap
->dim
);
480 void isl_basic_set_free(struct isl_basic_set
*bset
)
482 isl_basic_map_free((struct isl_basic_map
*)bset
);
485 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
487 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
490 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
496 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
497 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
499 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
500 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
501 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
502 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
503 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
504 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
506 int j
= isl_basic_map_alloc_inequality(bmap
);
510 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
511 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
518 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
519 bmap
->extra
- bmap
->n_div
);
523 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
525 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
528 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
532 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
537 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
539 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
542 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
547 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
549 if (pos
!= bmap
->n_eq
- 1) {
551 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
552 bmap
->eq
[bmap
->n_eq
- 1] = t
;
558 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
560 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
563 void isl_basic_map_inequality_to_equality(
564 struct isl_basic_map
*bmap
, unsigned pos
)
569 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
570 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
575 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
576 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
577 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
578 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
581 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
583 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
586 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
592 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
593 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
594 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
595 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
596 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
597 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
598 1 + isl_basic_map_total_dim(bmap
),
599 bmap
->extra
- bmap
->n_div
);
600 return bmap
->n_ineq
++;
603 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
605 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
608 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
612 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
617 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
619 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
622 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
627 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
629 if (pos
!= bmap
->n_ineq
- 1) {
631 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
632 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
633 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
639 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
641 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
644 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
648 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
649 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
650 1 + 1 + isl_basic_map_total_dim(bmap
),
651 bmap
->extra
- bmap
->n_div
);
652 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
653 return bmap
->n_div
++;
656 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
658 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
661 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
665 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
670 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
672 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
675 /* Copy constraint from src to dst, putting the vars of src at offset
676 * dim_off in dst and the divs of src at offset div_off in dst.
677 * If both sets are actually map, then dim_off applies to the input
680 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
681 struct isl_basic_map
*src_map
, isl_int
*src
,
682 unsigned in_off
, unsigned out_off
, unsigned div_off
)
684 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
685 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
686 unsigned src_in
= isl_basic_map_n_in(src_map
);
687 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
688 unsigned src_out
= isl_basic_map_n_out(src_map
);
689 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
690 isl_int_set(dst
[0], src
[0]);
691 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
692 if (dst_nparam
> src_nparam
)
693 isl_seq_clr(dst
+1+src_nparam
,
694 dst_nparam
- src_nparam
);
695 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
696 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
698 isl_min(dst_in
-in_off
, src_in
));
699 if (dst_in
-in_off
> src_in
)
700 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
701 dst_in
- in_off
- src_in
);
702 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
703 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
704 src
+1+src_nparam
+src_in
,
705 isl_min(dst_out
-out_off
, src_out
));
706 if (dst_out
-out_off
> src_out
)
707 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
708 dst_out
- out_off
- src_out
);
709 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
710 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
711 src
+1+src_nparam
+src_in
+src_out
,
712 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
713 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
714 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
715 div_off
+src_map
->n_div
,
716 dst_map
->n_div
- div_off
- src_map
->n_div
);
719 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
720 struct isl_basic_map
*src_map
, isl_int
*src
,
721 unsigned in_off
, unsigned out_off
, unsigned div_off
)
723 isl_int_set(dst
[0], src
[0]);
724 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
727 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
728 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
733 if (!bmap1
|| !bmap2
)
736 div_off
= bmap1
->n_div
;
738 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
739 int i1
= isl_basic_map_alloc_equality(bmap1
);
742 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
743 i_pos
, o_pos
, div_off
);
746 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
747 int i1
= isl_basic_map_alloc_inequality(bmap1
);
750 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
751 i_pos
, o_pos
, div_off
);
754 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
755 int i1
= isl_basic_map_alloc_div(bmap1
);
758 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
759 i_pos
, o_pos
, div_off
);
762 isl_basic_map_free(bmap2
);
767 isl_basic_map_free(bmap1
);
768 isl_basic_map_free(bmap2
);
772 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
773 struct isl_dim_map
*dim_map
)
777 for (i
= 0; i
< dim_map
->len
; ++i
) {
778 if (dim_map
->pos
[i
] < 0)
779 isl_int_set_si(dst
[i
], 0);
781 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
785 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
786 struct isl_dim_map
*dim_map
)
788 isl_int_set(dst
[0], src
[0]);
789 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
792 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
793 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
797 if (!src
|| !dst
|| !dim_map
)
800 for (i
= 0; i
< src
->n_eq
; ++i
) {
801 int i1
= isl_basic_map_alloc_equality(dst
);
804 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
807 for (i
= 0; i
< src
->n_ineq
; ++i
) {
808 int i1
= isl_basic_map_alloc_inequality(dst
);
811 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
814 for (i
= 0; i
< src
->n_div
; ++i
) {
815 int i1
= isl_basic_map_alloc_div(dst
);
818 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
822 isl_basic_map_free(src
);
827 isl_basic_map_free(src
);
828 isl_basic_map_free(dst
);
832 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
833 struct isl_basic_set
*bset2
, unsigned pos
)
835 return (struct isl_basic_set
*)
836 add_constraints((struct isl_basic_map
*)bset1
,
837 (struct isl_basic_map
*)bset2
, 0, pos
);
840 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
841 struct isl_dim
*dim
, unsigned extra
,
842 unsigned n_eq
, unsigned n_ineq
)
844 struct isl_basic_map
*ext
;
854 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
855 base
->extra
>= base
->n_div
+ extra
;
857 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
858 room_for_ineq(base
, n_ineq
)) {
863 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
864 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
865 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
866 extra
+= base
->extra
;
868 n_ineq
+= base
->n_ineq
;
870 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
876 ext
->sample
= isl_vec_copy(base
->sample
);
878 ext
= add_constraints(ext
, base
, 0, 0);
881 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
888 isl_basic_map_free(base
);
892 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
893 struct isl_dim
*dim
, unsigned extra
,
894 unsigned n_eq
, unsigned n_ineq
)
896 return (struct isl_basic_set
*)
897 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
898 extra
, n_eq
, n_ineq
);
901 struct isl_basic_map
*isl_basic_map_extend_constraints(
902 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
906 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
910 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
911 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
912 unsigned n_eq
, unsigned n_ineq
)
914 struct isl_basic_map
*bmap
;
919 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
923 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
927 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
928 unsigned nparam
, unsigned dim
, unsigned extra
,
929 unsigned n_eq
, unsigned n_ineq
)
931 return (struct isl_basic_set
*)
932 isl_basic_map_extend((struct isl_basic_map
*)base
,
933 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
936 struct isl_basic_set
*isl_basic_set_extend_constraints(
937 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
939 return (struct isl_basic_set
*)
940 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
944 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
946 return (struct isl_basic_set
*)
947 isl_basic_map_cow((struct isl_basic_map
*)bset
);
950 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
957 bmap
= isl_basic_map_dup(bmap
);
959 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
963 struct isl_set
*isl_set_cow(struct isl_set
*set
)
971 return isl_set_dup(set
);
974 struct isl_map
*isl_map_cow(struct isl_map
*map
)
982 return isl_map_dup(map
);
985 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
986 unsigned a_len
, unsigned b_len
)
988 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
989 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
990 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
993 struct isl_basic_set
*isl_basic_set_swap_vars(
994 struct isl_basic_set
*bset
, unsigned n
)
1004 nparam
= isl_basic_set_n_param(bset
);
1005 dim
= isl_basic_set_n_dim(bset
);
1006 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1011 bset
= isl_basic_set_cow(bset
);
1015 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1016 if (isl_blk_is_error(blk
))
1019 for (i
= 0; i
< bset
->n_eq
; ++i
)
1021 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1023 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1025 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1027 for (i
= 0; i
< bset
->n_div
; ++i
)
1029 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1031 isl_blk_free(bset
->ctx
, blk
);
1033 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1037 isl_basic_set_free(bset
);
1041 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1044 set
= isl_set_cow(set
);
1048 for (i
= 0; i
< set
->n
; ++i
) {
1049 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1055 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1059 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1065 total
= isl_basic_map_total_dim(bmap
);
1066 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1067 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1069 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1071 isl_basic_map_alloc_equality(bmap
);
1075 isl_int_set_si(bmap
->eq
[i
][0], 1);
1076 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1077 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1078 return isl_basic_map_finalize(bmap
);
1080 isl_basic_map_free(bmap
);
1084 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1086 return (struct isl_basic_set
*)
1087 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1090 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1093 unsigned off
= isl_dim_total(bmap
->dim
);
1094 isl_int
*t
= bmap
->div
[a
];
1095 bmap
->div
[a
] = bmap
->div
[b
];
1098 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1099 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1101 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1102 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1104 for (i
= 0; i
< bmap
->n_div
; ++i
)
1105 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1106 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1109 /* Eliminate the specified n dimensions starting at first from the
1110 * constraints using Fourier-Motzkin, The dimensions themselves
1113 struct isl_set
*isl_set_eliminate_dims(struct isl_set
*set
,
1114 unsigned first
, unsigned n
)
1124 set
= isl_set_cow(set
);
1127 isl_assert(set
->ctx
, first
+n
<= isl_set_n_dim(set
), goto error
);
1128 nparam
= isl_set_n_param(set
);
1130 for (i
= 0; i
< set
->n
; ++i
) {
1131 set
->p
[i
] = isl_basic_set_eliminate_vars(set
->p
[i
],
1142 /* Project out n dimensions starting at first using Fourier-Motzkin */
1143 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1144 unsigned first
, unsigned n
)
1146 set
= isl_set_eliminate_dims(set
, first
, n
);
1147 set
= isl_set_drop_dims(set
, first
, n
);
1151 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1153 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1161 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1170 set
= isl_set_cow(set
);
1174 for (i
= 0; i
< set
->n
; ++i
) {
1175 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1185 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1186 enum isl_dim_type type
, unsigned first
, unsigned n
)
1190 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1194 bmap
= isl_basic_map_eliminate_vars(bmap
,
1195 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1198 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1200 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1203 isl_basic_map_free(bmap
);
1207 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1208 enum isl_dim_type type
, unsigned first
, unsigned n
)
1216 map
= isl_map_cow(map
);
1219 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1221 for (i
= 0; i
< map
->n
; ++i
) {
1222 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1223 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1227 map
= isl_map_drop(map
, type
, first
, n
);
1234 /* Project out n inputs starting at first using Fourier-Motzkin */
1235 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1236 unsigned first
, unsigned n
)
1238 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1241 /* Project out n dimensions starting at first using Fourier-Motzkin */
1242 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1243 unsigned first
, unsigned n
)
1245 unsigned nparam
= isl_basic_set_n_param(bset
);
1246 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1247 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1251 static void dump_term(struct isl_basic_map
*bmap
,
1252 isl_int c
, int pos
, FILE *out
)
1255 unsigned in
= isl_basic_map_n_in(bmap
);
1256 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1257 unsigned nparam
= isl_basic_map_n_param(bmap
);
1259 isl_int_print(out
, c
, 0);
1261 if (!isl_int_is_one(c
))
1262 isl_int_print(out
, c
, 0);
1263 if (pos
< 1 + nparam
) {
1264 name
= isl_dim_get_name(bmap
->dim
,
1265 isl_dim_param
, pos
- 1);
1267 fprintf(out
, "%s", name
);
1269 fprintf(out
, "p%d", pos
- 1);
1270 } else if (pos
< 1 + nparam
+ in
)
1271 fprintf(out
, "i%d", pos
- 1 - nparam
);
1272 else if (pos
< 1 + nparam
+ dim
)
1273 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1275 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1279 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1280 int sign
, FILE *out
)
1284 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1288 for (i
= 0, first
= 1; i
< len
; ++i
) {
1289 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1292 fprintf(out
, " + ");
1294 isl_int_abs(v
, c
[i
]);
1295 dump_term(bmap
, v
, i
, out
);
1302 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1303 const char *op
, FILE *out
, int indent
)
1307 fprintf(out
, "%*s", indent
, "");
1309 dump_constraint_sign(bmap
, c
, 1, out
);
1310 fprintf(out
, " %s ", op
);
1311 dump_constraint_sign(bmap
, c
, -1, out
);
1315 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1316 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1318 fprintf(out
, "%*s", indent
, "");
1319 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1324 static void dump_constraints(struct isl_basic_map
*bmap
,
1325 isl_int
**c
, unsigned n
,
1326 const char *op
, FILE *out
, int indent
)
1330 for (i
= 0; i
< n
; ++i
)
1331 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1334 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1338 unsigned total
= isl_basic_map_total_dim(bmap
);
1340 for (j
= 0; j
< 1 + total
; ++j
) {
1341 if (isl_int_is_zero(exp
[j
]))
1343 if (!first
&& isl_int_is_pos(exp
[j
]))
1345 dump_term(bmap
, exp
[j
], j
, out
);
1350 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1354 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1355 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1357 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1358 fprintf(out
, "%*s", indent
, "");
1359 fprintf(out
, "e%d = [(", i
);
1360 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1362 isl_int_print(out
, bmap
->div
[i
][0], 0);
1363 fprintf(out
, "]\n");
1367 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1370 fprintf(out
, "null basic set\n");
1374 fprintf(out
, "%*s", indent
, "");
1375 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1376 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1377 bset
->extra
, bset
->flags
);
1378 dump((struct isl_basic_map
*)bset
, out
, indent
);
1381 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1384 fprintf(out
, "null basic map\n");
1388 fprintf(out
, "%*s", indent
, "");
1389 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1390 "flags: %x, n_name: %d\n",
1392 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1393 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1394 dump(bmap
, out
, indent
);
1397 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1402 total
= isl_basic_map_total_dim(bmap
);
1403 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1404 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1405 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1406 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1410 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1412 struct isl_set
*set
;
1416 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1417 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1418 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1419 sizeof(struct isl_set
) +
1420 n
* sizeof(struct isl_basic_set
*));
1424 set
->ctx
= dim
->ctx
;
1425 isl_ctx_ref(set
->ctx
);
1437 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1438 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1440 struct isl_set
*set
;
1441 struct isl_dim
*dims
;
1443 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1447 set
= isl_set_alloc_dim(dims
, n
, flags
);
1451 /* Make sure "map" has room for at least "n" more basic maps.
1453 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1456 struct isl_map
*grown
= NULL
;
1460 isl_assert(map
->ctx
, n
>= 0, goto error
);
1461 if (map
->n
+ n
<= map
->size
)
1463 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1466 for (i
= 0; i
< map
->n
; ++i
) {
1467 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1475 isl_map_free(grown
);
1480 /* Make sure "set" has room for at least "n" more basic sets.
1482 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1484 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1487 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1490 struct isl_set
*dup
;
1495 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1498 for (i
= 0; i
< set
->n
; ++i
)
1499 dup
= isl_set_add(dup
, isl_basic_set_copy(set
->p
[i
]));
1503 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1505 struct isl_set
*set
;
1510 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1512 isl_basic_set_free(bset
);
1515 return isl_set_add(set
, bset
);
1518 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1520 struct isl_map
*map
;
1525 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1527 isl_basic_map_free(bmap
);
1530 return isl_map_add(map
, bmap
);
1533 struct isl_set
*isl_set_add(struct isl_set
*set
, struct isl_basic_set
*bset
)
1535 return (struct isl_set
*)isl_map_add((struct isl_map
*)set
,
1536 (struct isl_basic_map
*)bset
);
1539 void isl_set_free(struct isl_set
*set
)
1549 isl_ctx_deref(set
->ctx
);
1550 for (i
= 0; i
< set
->n
; ++i
)
1551 isl_basic_set_free(set
->p
[i
]);
1552 isl_dim_free(set
->dim
);
1556 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1561 fprintf(out
, "null set\n");
1565 fprintf(out
, "%*s", indent
, "");
1566 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1567 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1569 for (i
= 0; i
< set
->n
; ++i
) {
1570 fprintf(out
, "%*s", indent
, "");
1571 fprintf(out
, "basic set %d:\n", i
);
1572 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1576 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1581 fprintf(out
, "null map\n");
1585 fprintf(out
, "%*s", indent
, "");
1586 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1587 "flags: %x, n_name: %d\n",
1588 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1589 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1590 for (i
= 0; i
< map
->n
; ++i
) {
1591 fprintf(out
, "%*s", indent
, "");
1592 fprintf(out
, "basic map %d:\n", i
);
1593 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1597 struct isl_basic_map
*isl_basic_map_intersect_domain(
1598 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1600 struct isl_basic_map
*bmap_domain
;
1601 struct isl_dim
*dim
;
1606 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1607 bset
->dim
, isl_dim_param
), goto error
);
1609 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1610 isl_assert(bset
->ctx
,
1611 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1613 bmap
= isl_basic_map_cow(bmap
);
1614 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1615 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1618 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1619 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1620 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1622 bmap
= isl_basic_map_simplify(bmap
);
1623 return isl_basic_map_finalize(bmap
);
1625 isl_basic_map_free(bmap
);
1626 isl_basic_set_free(bset
);
1630 struct isl_basic_map
*isl_basic_map_intersect_range(
1631 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1633 struct isl_basic_map
*bmap_range
;
1638 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1639 bset
->dim
, isl_dim_param
), goto error
);
1641 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1642 isl_assert(bset
->ctx
,
1643 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1645 bmap
= isl_basic_map_cow(bmap
);
1646 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1647 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1650 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1651 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1653 bmap
= isl_basic_map_simplify(bmap
);
1654 return isl_basic_map_finalize(bmap
);
1656 isl_basic_map_free(bmap
);
1657 isl_basic_set_free(bset
);
1661 static int basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1667 total
= 1 + isl_basic_map_total_dim(bmap
);
1668 if (total
!= vec
->size
)
1673 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1674 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1675 if (!isl_int_is_zero(s
)) {
1681 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1682 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1683 if (isl_int_is_neg(s
)) {
1694 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1696 return basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1699 struct isl_basic_map
*isl_basic_map_intersect(
1700 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1702 struct isl_vec
*sample
= NULL
;
1704 if (!bmap1
|| !bmap2
)
1707 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1708 bmap2
->dim
, isl_dim_param
), goto error
);
1709 if (isl_dim_total(bmap1
->dim
) ==
1710 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1711 isl_dim_total(bmap2
->dim
) !=
1712 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1713 return isl_basic_map_intersect(bmap2
, bmap1
);
1715 if (isl_dim_total(bmap2
->dim
) !=
1716 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1717 isl_assert(bmap1
->ctx
,
1718 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1720 if (bmap1
->sample
&&
1721 basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1722 basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1723 sample
= isl_vec_copy(bmap1
->sample
);
1724 else if (bmap2
->sample
&&
1725 basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1726 basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1727 sample
= isl_vec_copy(bmap2
->sample
);
1729 bmap1
= isl_basic_map_cow(bmap1
);
1730 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1731 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1734 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1737 isl_vec_free(bmap1
->sample
);
1738 bmap1
->sample
= sample
;
1741 bmap1
= isl_basic_map_simplify(bmap1
);
1742 return isl_basic_map_finalize(bmap1
);
1745 isl_vec_free(sample
);
1746 isl_basic_map_free(bmap1
);
1747 isl_basic_map_free(bmap2
);
1751 struct isl_basic_set
*isl_basic_set_intersect(
1752 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1754 return (struct isl_basic_set
*)
1755 isl_basic_map_intersect(
1756 (struct isl_basic_map
*)bset1
,
1757 (struct isl_basic_map
*)bset2
);
1760 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1763 struct isl_map
*result
;
1769 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1770 map2
->dim
, isl_dim_param
), goto error
);
1771 if (isl_dim_total(map1
->dim
) ==
1772 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1773 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1774 return isl_map_intersect(map2
, map1
);
1776 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1777 isl_assert(map1
->ctx
,
1778 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1780 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1781 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
1782 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
1784 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1785 map1
->n
* map2
->n
, flags
);
1788 for (i
= 0; i
< map1
->n
; ++i
)
1789 for (j
= 0; j
< map2
->n
; ++j
) {
1790 struct isl_basic_map
*part
;
1791 part
= isl_basic_map_intersect(
1792 isl_basic_map_copy(map1
->p
[i
]),
1793 isl_basic_map_copy(map2
->p
[j
]));
1794 if (isl_basic_map_is_empty(part
))
1795 isl_basic_map_free(part
);
1797 result
= isl_map_add(result
, part
);
1810 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1812 return (struct isl_set
*)
1813 isl_map_intersect((struct isl_map
*)set1
,
1814 (struct isl_map
*)set2
);
1817 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
1819 struct isl_dim
*dim
;
1820 struct isl_basic_set
*bset
;
1825 bmap
= isl_basic_map_cow(bmap
);
1828 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
1829 in
= isl_basic_map_n_in(bmap
);
1830 bset
= isl_basic_set_from_basic_map(bmap
);
1831 bset
= isl_basic_set_swap_vars(bset
, in
);
1832 return isl_basic_map_from_basic_set(bset
, dim
);
1835 /* Turn final n dimensions into existentially quantified variables.
1837 struct isl_basic_set
*isl_basic_set_project_out(
1838 struct isl_basic_set
*bset
, unsigned n
, unsigned flags
)
1848 isl_assert(bset
->ctx
, n
<= isl_basic_set_n_dim(bset
), goto error
);
1853 bset
= isl_basic_set_cow(bset
);
1855 row_size
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
1856 old
= bset
->block2
.data
;
1857 bset
->block2
= isl_blk_extend(bset
->ctx
, bset
->block2
,
1858 (bset
->extra
+ n
) * (1 + row_size
));
1859 if (!bset
->block2
.data
)
1861 new_div
= isl_alloc_array(ctx
, isl_int
*, bset
->extra
+ n
);
1864 for (i
= 0; i
< n
; ++i
) {
1865 new_div
[i
] = bset
->block2
.data
+
1866 (bset
->extra
+ i
) * (1 + row_size
);
1867 isl_seq_clr(new_div
[i
], 1 + row_size
);
1869 for (i
= 0; i
< bset
->extra
; ++i
)
1870 new_div
[n
+ i
] = bset
->block2
.data
+ (bset
->div
[i
] - old
);
1872 bset
->div
= new_div
;
1875 bset
->dim
= isl_dim_drop_outputs(bset
->dim
,
1876 isl_basic_set_n_dim(bset
) - n
, n
);
1879 bset
= isl_basic_set_simplify(bset
);
1880 bset
= isl_basic_set_drop_redundant_divs(bset
);
1881 return isl_basic_set_finalize(bset
);
1883 isl_basic_set_free(bset
);
1887 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
1891 for (i
= 0; i
< n
; ++i
) {
1892 j
= isl_basic_map_alloc_div(bmap
);
1895 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
1899 isl_basic_map_free(bmap
);
1903 struct isl_basic_map
*isl_basic_map_apply_range(
1904 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1906 struct isl_dim
*dim_result
= NULL
;
1907 struct isl_basic_map
*bmap
;
1908 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
1909 struct isl_dim_map
*dim_map1
, *dim_map2
;
1911 if (!bmap1
|| !bmap2
)
1914 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
1915 isl_dim_copy(bmap2
->dim
));
1917 n_in
= isl_basic_map_n_in(bmap1
);
1918 n_out
= isl_basic_map_n_out(bmap2
);
1919 n
= isl_basic_map_n_out(bmap1
);
1920 nparam
= isl_basic_map_n_param(bmap1
);
1922 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
1923 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1924 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1925 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
1926 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
1927 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
1928 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
1929 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
1930 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
1931 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
1932 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
1934 bmap
= isl_basic_map_alloc_dim(dim_result
,
1935 bmap1
->n_div
+ bmap2
->n_div
+ n
,
1936 bmap1
->n_eq
+ bmap2
->n_eq
,
1937 bmap1
->n_ineq
+ bmap2
->n_ineq
);
1938 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
1939 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
1940 bmap
= add_divs(bmap
, n
);
1941 bmap
= isl_basic_map_simplify(bmap
);
1942 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
1943 return isl_basic_map_finalize(bmap
);
1945 isl_basic_map_free(bmap1
);
1946 isl_basic_map_free(bmap2
);
1950 struct isl_basic_set
*isl_basic_set_apply(
1951 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
1956 isl_assert(set
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
1959 return (struct isl_basic_set
*)
1960 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
1962 isl_basic_set_free(bset
);
1963 isl_basic_map_free(bmap
);
1967 struct isl_basic_map
*isl_basic_map_apply_domain(
1968 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1970 if (!bmap1
|| !bmap2
)
1974 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
1976 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
1979 bmap1
= isl_basic_map_reverse(bmap1
);
1980 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
1981 return isl_basic_map_reverse(bmap1
);
1983 isl_basic_map_free(bmap1
);
1984 isl_basic_map_free(bmap2
);
1988 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1989 * A \cap B -> f(A) + f(B)
1991 struct isl_basic_map
*isl_basic_map_sum(
1992 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1994 unsigned n_in
, n_out
, nparam
, total
, pos
;
1995 struct isl_basic_map
*bmap
= NULL
;
1996 struct isl_dim_map
*dim_map1
, *dim_map2
;
1999 if (!bmap1
|| !bmap2
)
2002 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2005 nparam
= isl_basic_map_n_param(bmap1
);
2006 n_in
= isl_basic_map_n_in(bmap1
);
2007 n_out
= isl_basic_map_n_out(bmap1
);
2009 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2010 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2011 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2012 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2013 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2014 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2015 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2016 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2017 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2018 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2019 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2021 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2022 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2023 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2024 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2025 for (i
= 0; i
< n_out
; ++i
) {
2026 int j
= isl_basic_map_alloc_equality(bmap
);
2029 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2030 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2031 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2032 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2034 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2035 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2036 bmap
= add_divs(bmap
, 2 * n_out
);
2038 bmap
= isl_basic_map_simplify(bmap
);
2039 return isl_basic_map_finalize(bmap
);
2041 isl_basic_map_free(bmap
);
2042 isl_basic_map_free(bmap1
);
2043 isl_basic_map_free(bmap2
);
2047 /* Given a basic map A -> f(A), construct A -> -f(A).
2049 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2054 bmap
= isl_basic_map_cow(bmap
);
2058 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2059 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2060 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2061 for (j
= 0; j
< n
; ++j
)
2062 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2063 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2064 for (j
= 0; j
< n
; ++j
)
2065 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2066 for (i
= 0; i
< bmap
->n_div
; ++i
)
2067 for (j
= 0; j
< n
; ++j
)
2068 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2069 return isl_basic_map_finalize(bmap
);
2072 /* Given a map A -> f(A), construct A -> -f(A).
2074 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2078 map
= isl_map_cow(map
);
2082 for (i
= 0; i
< map
->n
; ++i
) {
2083 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2094 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2095 * A -> floor(f(A)/d).
2097 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2100 unsigned n_in
, n_out
, nparam
, total
, pos
;
2101 struct isl_basic_map
*result
= NULL
;
2102 struct isl_dim_map
*dim_map
;
2108 nparam
= isl_basic_map_n_param(bmap
);
2109 n_in
= isl_basic_map_n_in(bmap
);
2110 n_out
= isl_basic_map_n_out(bmap
);
2112 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2113 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2114 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2115 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2116 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2117 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2119 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2120 bmap
->n_div
+ n_out
,
2121 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2122 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2123 result
= add_divs(result
, n_out
);
2124 for (i
= 0; i
< n_out
; ++i
) {
2126 j
= isl_basic_map_alloc_inequality(result
);
2129 isl_seq_clr(result
->ineq
[j
], 1+total
);
2130 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2131 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2132 j
= isl_basic_map_alloc_inequality(result
);
2135 isl_seq_clr(result
->ineq
[j
], 1+total
);
2136 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2137 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2138 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2141 result
= isl_basic_map_simplify(result
);
2142 return isl_basic_map_finalize(result
);
2144 isl_basic_map_free(result
);
2148 /* Given a map A -> f(A) and an integer d, construct a map
2149 * A -> floor(f(A)/d).
2151 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2155 map
= isl_map_cow(map
);
2159 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2160 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2161 for (i
= 0; i
< map
->n
; ++i
) {
2162 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2173 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2179 i
= isl_basic_map_alloc_equality(bmap
);
2182 nparam
= isl_basic_map_n_param(bmap
);
2183 n_in
= isl_basic_map_n_in(bmap
);
2184 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2185 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2186 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2187 return isl_basic_map_finalize(bmap
);
2189 isl_basic_map_free(bmap
);
2193 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2199 i
= isl_basic_map_alloc_inequality(bmap
);
2202 nparam
= isl_basic_map_n_param(bmap
);
2203 n_in
= isl_basic_map_n_in(bmap
);
2204 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2205 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2206 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2207 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2208 return isl_basic_map_finalize(bmap
);
2210 isl_basic_map_free(bmap
);
2214 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2220 i
= isl_basic_map_alloc_inequality(bmap
);
2223 nparam
= isl_basic_map_n_param(bmap
);
2224 n_in
= isl_basic_map_n_in(bmap
);
2225 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2226 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2227 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2228 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2229 return isl_basic_map_finalize(bmap
);
2231 isl_basic_map_free(bmap
);
2235 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2238 struct isl_basic_map
*bmap
;
2239 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2242 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2243 bmap
= var_equal(bmap
, i
);
2244 return isl_basic_map_finalize(bmap
);
2247 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2250 struct isl_basic_map
*bmap
;
2251 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2254 for (i
= 0; i
< pos
&& bmap
; ++i
)
2255 bmap
= var_equal(bmap
, i
);
2257 bmap
= var_less(bmap
, pos
);
2258 return isl_basic_map_finalize(bmap
);
2261 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2264 struct isl_basic_map
*bmap
;
2265 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2268 for (i
= 0; i
< pos
&& bmap
; ++i
)
2269 bmap
= var_equal(bmap
, i
);
2271 bmap
= var_more(bmap
, pos
);
2272 return isl_basic_map_finalize(bmap
);
2275 struct isl_basic_map
*isl_basic_map_from_basic_set(
2276 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
2278 struct isl_basic_map
*bmap
;
2280 bset
= isl_basic_set_cow(bset
);
2284 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
2285 isl_dim_free(bset
->dim
);
2286 bmap
= (struct isl_basic_map
*) bset
;
2288 return isl_basic_map_finalize(bmap
);
2290 isl_basic_set_free(bset
);
2295 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
2299 if (bmap
->dim
->n_in
== 0)
2300 return (struct isl_basic_set
*)bmap
;
2301 bmap
= isl_basic_map_cow(bmap
);
2304 bmap
->dim
= isl_dim_cow(bmap
->dim
);
2307 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
2308 bmap
->dim
->n_in
= 0;
2309 bmap
= isl_basic_map_finalize(bmap
);
2310 return (struct isl_basic_set
*)bmap
;
2312 isl_basic_map_free(bmap
);
2316 /* For a div d = floor(f/m), add the constraints
2319 * -(f-(n-1)) + m d >= 0
2321 * Note that the second constraint is the negation of
2325 static int add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
2328 unsigned total
= isl_basic_map_total_dim(bmap
);
2329 unsigned div_pos
= 1 + total
- bmap
->n_div
+ div
;
2331 i
= isl_basic_map_alloc_inequality(bmap
);
2334 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
]+1, 1+total
);
2335 isl_int_neg(bmap
->ineq
[i
][div_pos
], bmap
->div
[div
][0]);
2337 j
= isl_basic_map_alloc_inequality(bmap
);
2340 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
2341 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][div_pos
]);
2342 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
2346 struct isl_basic_set
*isl_basic_map_underlying_set(
2347 struct isl_basic_map
*bmap
)
2351 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
2352 return (struct isl_basic_set
*)bmap
;
2353 bmap
= isl_basic_map_cow(bmap
);
2356 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
2359 bmap
->extra
-= bmap
->n_div
;
2361 bmap
= isl_basic_map_finalize(bmap
);
2362 return (struct isl_basic_set
*)bmap
;
2367 struct isl_basic_map
*isl_basic_map_overlying_set(
2368 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
2370 struct isl_basic_map
*bmap
;
2371 struct isl_ctx
*ctx
;
2378 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
2379 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
2380 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
2382 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
2383 isl_basic_map_free(like
);
2384 return (struct isl_basic_map
*)bset
;
2386 bset
= isl_basic_set_cow(bset
);
2389 total
= bset
->dim
->n_out
+ bset
->extra
;
2390 bmap
= (struct isl_basic_map
*)bset
;
2391 isl_dim_free(bmap
->dim
);
2392 bmap
->dim
= isl_dim_copy(like
->dim
);
2395 bmap
->n_div
= like
->n_div
;
2396 bmap
->extra
+= like
->n_div
;
2399 ltotal
= total
- bmap
->extra
+ like
->extra
;
2402 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
2403 bmap
->extra
* (1 + 1 + total
));
2404 if (isl_blk_is_error(bmap
->block2
))
2406 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
2410 for (i
= 0; i
< bmap
->extra
; ++i
)
2411 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
2412 for (i
= 0; i
< like
->n_div
; ++i
) {
2413 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
2414 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
2416 bmap
= isl_basic_map_extend_constraints(bmap
,
2417 0, 2 * like
->n_div
);
2418 for (i
= 0; i
< like
->n_div
; ++i
) {
2419 if (isl_int_is_zero(bmap
->div
[i
][0]))
2421 if (add_div_constraints(bmap
, i
) < 0)
2425 isl_basic_map_free(like
);
2426 bmap
= isl_basic_map_simplify(bmap
);
2427 bmap
= isl_basic_map_finalize(bmap
);
2430 isl_basic_map_free(like
);
2431 isl_basic_set_free(bset
);
2435 struct isl_basic_set
*isl_basic_set_from_underlying_set(
2436 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
2438 return (struct isl_basic_set
*)
2439 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
2442 struct isl_set
*isl_set_from_underlying_set(
2443 struct isl_set
*set
, struct isl_basic_set
*like
)
2449 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
2451 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
2452 isl_basic_set_free(like
);
2455 set
= isl_set_cow(set
);
2458 for (i
= 0; i
< set
->n
; ++i
) {
2459 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
2460 isl_basic_set_copy(like
));
2464 isl_dim_free(set
->dim
);
2465 set
->dim
= isl_dim_copy(like
->dim
);
2468 isl_basic_set_free(like
);
2471 isl_basic_set_free(like
);
2476 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
2480 map
= isl_map_cow(map
);
2483 map
->dim
= isl_dim_cow(map
->dim
);
2487 for (i
= 1; i
< map
->n
; ++i
)
2488 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
2490 for (i
= 0; i
< map
->n
; ++i
) {
2491 map
->p
[i
] = (struct isl_basic_map
*)
2492 isl_basic_map_underlying_set(map
->p
[i
]);
2497 map
->dim
= isl_dim_underlying(map
->dim
, 0);
2499 isl_dim_free(map
->dim
);
2500 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
2504 return (struct isl_set
*)map
;
2510 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
2512 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
2515 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
2517 struct isl_basic_set
*domain
;
2521 n_out
= isl_basic_map_n_out(bmap
);
2522 domain
= isl_basic_set_from_basic_map(bmap
);
2523 return isl_basic_set_project_out(domain
, n_out
, 0);
2526 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
2528 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
2531 struct isl_set
*isl_map_range(struct isl_map
*map
)
2534 struct isl_set
*set
;
2538 map
= isl_map_cow(map
);
2542 set
= (struct isl_set
*) map
;
2543 if (set
->dim
->n_in
!= 0) {
2544 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
2548 for (i
= 0; i
< map
->n
; ++i
) {
2549 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
2553 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
2554 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
2561 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
2564 struct isl_map
*map
= NULL
;
2566 set
= isl_set_cow(set
);
2569 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
2570 map
= (struct isl_map
*)set
;
2571 for (i
= 0; i
< set
->n
; ++i
) {
2572 map
->p
[i
] = isl_basic_map_from_basic_set(
2573 set
->p
[i
], isl_dim_copy(dim
));
2577 isl_dim_free(map
->dim
);
2586 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
2588 return (struct isl_map
*)set
;
2591 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
2594 struct isl_set
*set
= NULL
;
2598 map
= isl_map_cow(map
);
2601 map
->dim
= isl_dim_cow(map
->dim
);
2604 map
->dim
->n_out
+= map
->dim
->n_in
;
2606 set
= (struct isl_set
*)map
;
2607 for (i
= 0; i
< map
->n
; ++i
) {
2608 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
2618 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2620 struct isl_map
*map
;
2624 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
2625 map
= isl_alloc(dim
->ctx
, struct isl_map
,
2626 sizeof(struct isl_map
) +
2627 n
* sizeof(struct isl_basic_map
*));
2631 map
->ctx
= dim
->ctx
;
2632 isl_ctx_ref(map
->ctx
);
2644 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
2645 unsigned nparam
, unsigned in
, unsigned out
, int n
,
2648 struct isl_map
*map
;
2649 struct isl_dim
*dims
;
2651 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
2655 map
= isl_map_alloc_dim(dims
, n
, flags
);
2659 struct isl_basic_map
*isl_basic_map_empty(struct isl_ctx
*ctx
,
2660 unsigned nparam
, unsigned in
, unsigned out
)
2662 struct isl_basic_map
*bmap
;
2663 bmap
= isl_basic_map_alloc(ctx
, nparam
, in
, out
, 0, 1, 0);
2664 bmap
= isl_basic_map_set_to_empty(bmap
);
2668 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
2670 struct isl_basic_set
*bset
;
2671 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
2672 bset
= isl_basic_set_set_to_empty(bset
);
2676 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
2678 struct isl_basic_map
*bmap
;
2681 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2682 bmap
= isl_basic_map_set_to_empty(bmap
);
2686 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
2688 struct isl_basic_map
*bmap
;
2691 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2692 bmap
= isl_basic_map_set_to_empty(bmap
);
2696 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
2698 struct isl_basic_set
*bset
;
2701 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2702 bset
= isl_basic_set_set_to_empty(bset
);
2706 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
2708 struct isl_basic_map
*bmap
;
2709 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
2713 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
2715 struct isl_basic_set
*bset
;
2716 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
2720 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
2724 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2727 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
2729 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2732 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
2736 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2739 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
2743 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2746 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
2748 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2751 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
2755 return isl_set_empty(isl_dim_copy(model
->dim
));
2758 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
2760 struct isl_map
*map
;
2763 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2764 map
= isl_map_add(map
, isl_basic_map_universe(dim
));
2768 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
2770 struct isl_set
*set
;
2773 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2774 set
= isl_set_add(set
, isl_basic_set_universe(dim
));
2778 struct isl_map
*isl_map_dup(struct isl_map
*map
)
2781 struct isl_map
*dup
;
2785 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
2786 for (i
= 0; i
< map
->n
; ++i
)
2787 dup
= isl_map_add(dup
, isl_basic_map_copy(map
->p
[i
]));
2791 struct isl_map
*isl_map_add(struct isl_map
*map
, struct isl_basic_map
*bmap
)
2795 if (isl_basic_map_fast_is_empty(bmap
)) {
2796 isl_basic_map_free(bmap
);
2799 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
2800 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
2801 map
->p
[map
->n
] = bmap
;
2803 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2809 isl_basic_map_free(bmap
);
2813 void isl_map_free(struct isl_map
*map
)
2823 isl_ctx_deref(map
->ctx
);
2824 for (i
= 0; i
< map
->n
; ++i
)
2825 isl_basic_map_free(map
->p
[i
]);
2826 isl_dim_free(map
->dim
);
2830 struct isl_map
*isl_map_extend(struct isl_map
*base
,
2831 unsigned nparam
, unsigned n_in
, unsigned n_out
)
2835 base
= isl_map_cow(base
);
2839 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
2842 for (i
= 0; i
< base
->n
; ++i
) {
2843 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
2844 isl_dim_copy(base
->dim
), 0, 0, 0);
2854 struct isl_set
*isl_set_extend(struct isl_set
*base
,
2855 unsigned nparam
, unsigned dim
)
2857 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
2861 static struct isl_basic_map
*isl_basic_map_fix_pos(struct isl_basic_map
*bmap
,
2862 unsigned pos
, int value
)
2866 bmap
= isl_basic_map_cow(bmap
);
2867 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
2868 j
= isl_basic_map_alloc_equality(bmap
);
2871 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
2872 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
2873 isl_int_set_si(bmap
->eq
[j
][0], value
);
2874 bmap
= isl_basic_map_simplify(bmap
);
2875 return isl_basic_map_finalize(bmap
);
2877 isl_basic_map_free(bmap
);
2881 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
2882 enum isl_dim_type type
, unsigned pos
, int value
)
2886 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
2887 return isl_basic_map_fix_pos(bmap
, isl_basic_map_offset(bmap
, type
) + pos
,
2890 isl_basic_map_free(bmap
);
2894 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
2895 enum isl_dim_type type
, unsigned pos
, int value
)
2897 return (struct isl_basic_set
*)
2898 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2902 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
2903 unsigned input
, int value
)
2905 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
2908 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
2909 unsigned dim
, int value
)
2911 return (struct isl_basic_set
*)
2912 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2913 isl_dim_set
, dim
, value
);
2916 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
2917 enum isl_dim_type type
, unsigned pos
, int value
)
2921 map
= isl_map_cow(map
);
2925 isl_assert(ctx
, pos
< isl_map_dim(map
, type
), goto error
);
2926 for (i
= 0; i
< map
->n
; ++i
) {
2927 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
2931 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2938 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
2939 unsigned input
, int value
)
2941 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
2944 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
2946 return (struct isl_set
*)
2947 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
2950 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
2951 unsigned dim
, isl_int value
)
2956 bset
= isl_basic_set_cow(bset
);
2957 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
2958 j
= isl_basic_set_alloc_inequality(bset
);
2961 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
2962 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
2963 isl_int_neg(bset
->ineq
[j
][0], value
);
2964 bset
= isl_basic_set_simplify(bset
);
2965 return isl_basic_set_finalize(bset
);
2967 isl_basic_set_free(bset
);
2971 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
2976 set
= isl_set_cow(set
);
2980 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
2981 for (i
= 0; i
< set
->n
; ++i
) {
2982 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
2992 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
2997 map
= isl_map_cow(map
);
3001 map
->dim
= isl_dim_reverse(map
->dim
);
3004 for (i
= 0; i
< map
->n
; ++i
) {
3005 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
3009 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3016 static struct isl_map
*isl_basic_map_partial_lexopt(
3017 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3018 struct isl_set
**empty
, int max
)
3022 if (bmap
->ctx
->pip
== ISL_PIP_PIP
)
3023 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
3025 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
3027 isl_basic_map_free(bmap
);
3028 isl_basic_set_free(dom
);
3034 struct isl_map
*isl_basic_map_partial_lexmax(
3035 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3036 struct isl_set
**empty
)
3038 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
3041 struct isl_map
*isl_basic_map_partial_lexmin(
3042 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3043 struct isl_set
**empty
)
3045 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
3048 struct isl_set
*isl_basic_set_partial_lexmin(
3049 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3050 struct isl_set
**empty
)
3052 return (struct isl_set
*)
3053 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
3057 struct isl_set
*isl_basic_set_partial_lexmax(
3058 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3059 struct isl_set
**empty
)
3061 return (struct isl_set
*)
3062 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
3066 struct isl_set
*isl_basic_set_lexmin(struct isl_basic_set
*bset
)
3068 struct isl_basic_map
*bmap
= NULL
;
3069 struct isl_basic_set
*dom
= NULL
;
3070 struct isl_map
*min
;
3071 struct isl_dim
*param_dim
;
3075 bmap
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
3078 param_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
3079 dom
= isl_basic_set_universe(param_dim
);
3082 min
= isl_basic_map_partial_lexmin(bmap
, dom
, NULL
);
3083 return isl_map_range(min
);
3085 isl_basic_map_free(bmap
);
3089 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
3090 struct isl_dim
*dim
)
3097 for (i
= 0; i
< map
->n
; ++i
) {
3098 isl_dim_free(map
->p
[i
]->dim
);
3099 map
->p
[i
]->dim
= isl_dim_copy(dim
);
3101 isl_dim_free(map
->dim
);
3111 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
3112 struct isl_dim
*dim
)
3114 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3117 /* Apply a preimage specified by "mat" on the parameters of "bset".
3118 * bset is assumed to have only parameters and divs.
3120 static struct isl_basic_set
*basic_set_parameter_preimage(
3121 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
3128 bset
->dim
= isl_dim_cow(bset
->dim
);
3132 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3134 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3136 bset
->dim
->nparam
= 0;
3137 bset
->dim
->n_out
= nparam
;
3138 bset
= isl_basic_set_preimage(bset
, mat
);
3140 bset
->dim
->nparam
= bset
->dim
->n_out
;
3141 bset
->dim
->n_out
= 0;
3146 isl_basic_set_free(bset
);
3150 /* Apply a preimage specified by "mat" on the parameters of "set".
3151 * set is assumed to have only parameters and divs.
3153 static struct isl_set
*set_parameter_preimage(
3154 struct isl_set
*set
, struct isl_mat
*mat
)
3156 struct isl_dim
*dim
= NULL
;
3162 dim
= isl_dim_copy(set
->dim
);
3163 dim
= isl_dim_cow(dim
);
3167 nparam
= isl_set_dim(set
, isl_dim_param
);
3169 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3172 dim
->n_out
= nparam
;
3173 isl_set_reset_dim(set
, dim
);
3174 set
= isl_set_preimage(set
, mat
);
3177 dim
= isl_dim_copy(set
->dim
);
3178 dim
= isl_dim_cow(dim
);
3181 dim
->nparam
= dim
->n_out
;
3183 isl_set_reset_dim(set
, dim
);
3193 /* Intersect the basic set "bset" with the affine space specified by the
3194 * equalities in "eq".
3196 static struct isl_basic_set
*basic_set_append_equalities(
3197 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
3205 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
3210 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
3211 for (i
= 0; i
< eq
->n_row
; ++i
) {
3212 k
= isl_basic_set_alloc_equality(bset
);
3215 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
3216 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
3223 isl_basic_set_free(bset
);
3227 /* Intersect the set "set" with the affine space specified by the
3228 * equalities in "eq".
3230 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
3238 for (i
= 0; i
< set
->n
; ++i
) {
3239 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
3252 /* Project the given basic set onto its parameter domain, possibly introducing
3253 * new, explicit, existential variables in the constraints.
3254 * The input has parameters and (possibly implicit) existential variables.
3255 * The output has the same parameters, but only
3256 * explicit existentially quantified variables.
3258 * The actual projection is performed by pip, but pip doesn't seem
3259 * to like equalities very much, so we first remove the equalities
3260 * among the parameters by performing a variable compression on
3261 * the parameters. Afterward, an inverse transformation is performed
3262 * and the equalities among the parameters are inserted back in.
3264 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
3268 struct isl_mat
*T
, *T2
;
3269 struct isl_set
*set
;
3270 unsigned nparam
, n_div
;
3272 bset
= isl_basic_set_cow(bset
);
3276 if (bset
->n_eq
== 0)
3277 return isl_basic_set_lexmin(bset
);
3279 isl_basic_set_gauss(bset
, NULL
);
3281 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3282 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
3284 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
3285 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
3288 if (i
== bset
->n_eq
)
3289 return isl_basic_set_lexmin(bset
);
3291 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
3293 eq
= isl_mat_cow(eq
);
3294 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
3295 bset
= basic_set_parameter_preimage(bset
, T
);
3297 set
= isl_basic_set_lexmin(bset
);
3298 set
= set_parameter_preimage(set
, T2
);
3299 set
= set_append_equalities(set
, eq
);
3303 /* Compute an explicit representation for all the existentially
3304 * quantified variables.
3305 * The input and output dimensions are first turned into parameters.
3306 * compute_divs then returns a map with the same parameters and
3307 * no input or output dimensions and the dimension specification
3308 * is reset to that of the input.
3310 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
3312 struct isl_basic_set
*bset
;
3313 struct isl_set
*set
;
3314 struct isl_map
*map
;
3315 struct isl_dim
*dim
, *orig_dim
= NULL
;
3320 bmap
= isl_basic_map_cow(bmap
);
3324 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3325 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3326 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3327 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
3331 orig_dim
= bmap
->dim
;
3333 bset
= (struct isl_basic_set
*)bmap
;
3335 set
= parameter_compute_divs(bset
);
3336 map
= (struct isl_map
*)set
;
3337 map
= isl_map_reset_dim(map
, orig_dim
);
3341 isl_basic_map_free(bmap
);
3345 /* If bmap contains any unknown divs, then compute explicit
3346 * expressions for them. However, this computation may be
3347 * quite expensive, so first try to remove divs that aren't
3350 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
3357 off
= isl_dim_total(bmap
->dim
);
3358 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3359 if (isl_int_is_zero(bmap
->div
[i
][0]))
3361 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
3364 if (i
== bmap
->n_div
)
3365 return isl_map_from_basic_map(bmap
);
3366 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3369 for (i
= 0; i
< bmap
->n_div
; ++i
)
3370 if (isl_int_is_zero(bmap
->div
[i
][0]))
3372 if (i
== bmap
->n_div
)
3373 return isl_map_from_basic_map(bmap
);
3374 struct isl_map
*map
= compute_divs(bmap
);
3377 isl_basic_map_free(bmap
);
3381 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
3384 struct isl_map
*res
;
3390 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
3391 for (i
= 1 ; i
< map
->n
; ++i
) {
3393 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
3394 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
3395 res
= isl_map_union_disjoint(res
, r2
);
3397 res
= isl_map_union(res
, r2
);
3404 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
3406 return (struct isl_set
*)
3407 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
3410 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
3412 return (struct isl_set
*)
3413 isl_map_compute_divs((struct isl_map
*)set
);
3416 struct isl_set
*isl_map_domain(struct isl_map
*map
)
3419 struct isl_set
*set
;
3424 map
= isl_map_cow(map
);
3428 set
= (struct isl_set
*)map
;
3429 set
->dim
= isl_dim_domain(set
->dim
);
3432 for (i
= 0; i
< map
->n
; ++i
) {
3433 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
3437 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3438 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3445 struct isl_map
*isl_map_union_disjoint(
3446 struct isl_map
*map1
, struct isl_map
*map2
)
3450 struct isl_map
*map
= NULL
;
3464 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3466 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3467 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3468 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3470 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3471 map1
->n
+ map2
->n
, flags
);
3474 for (i
= 0; i
< map1
->n
; ++i
) {
3475 map
= isl_map_add(map
,
3476 isl_basic_map_copy(map1
->p
[i
]));
3480 for (i
= 0; i
< map2
->n
; ++i
) {
3481 map
= isl_map_add(map
,
3482 isl_basic_map_copy(map2
->p
[i
]));
3496 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
3498 map1
= isl_map_union_disjoint(map1
, map2
);
3502 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
3506 struct isl_set
*isl_set_union_disjoint(
3507 struct isl_set
*set1
, struct isl_set
*set2
)
3509 return (struct isl_set
*)
3510 isl_map_union_disjoint(
3511 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3514 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
3516 return (struct isl_set
*)
3517 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3520 struct isl_map
*isl_map_intersect_range(
3521 struct isl_map
*map
, struct isl_set
*set
)
3524 struct isl_map
*result
;
3530 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
3531 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
3532 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3534 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
3535 map
->n
* set
->n
, flags
);
3538 for (i
= 0; i
< map
->n
; ++i
)
3539 for (j
= 0; j
< set
->n
; ++j
) {
3540 result
= isl_map_add(result
,
3541 isl_basic_map_intersect_range(
3542 isl_basic_map_copy(map
->p
[i
]),
3543 isl_basic_set_copy(set
->p
[j
])));
3556 struct isl_map
*isl_map_intersect_domain(
3557 struct isl_map
*map
, struct isl_set
*set
)
3559 return isl_map_reverse(
3560 isl_map_intersect_range(isl_map_reverse(map
), set
));
3563 struct isl_map
*isl_map_apply_domain(
3564 struct isl_map
*map1
, struct isl_map
*map2
)
3568 map1
= isl_map_reverse(map1
);
3569 map1
= isl_map_apply_range(map1
, map2
);
3570 return isl_map_reverse(map1
);
3577 struct isl_map
*isl_map_apply_range(
3578 struct isl_map
*map1
, struct isl_map
*map2
)
3580 struct isl_dim
*dim_result
;
3581 struct isl_map
*result
;
3590 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
3591 isl_dim_copy(map2
->dim
));
3593 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
3596 for (i
= 0; i
< map1
->n
; ++i
)
3597 for (j
= 0; j
< map2
->n
; ++j
) {
3598 result
= isl_map_add(result
,
3599 isl_basic_map_apply_range(
3600 isl_basic_map_copy(map1
->p
[i
]),
3601 isl_basic_map_copy(map2
->p
[j
])));
3607 if (result
&& result
->n
<= 1)
3608 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
3617 * returns range - domain
3619 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
3621 struct isl_basic_set
*bset
;
3628 dim
= isl_basic_map_n_in(bmap
);
3629 nparam
= isl_basic_map_n_param(bmap
);
3630 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
3631 bset
= isl_basic_set_from_basic_map(bmap
);
3632 bset
= isl_basic_set_cow(bset
);
3633 bset
= isl_basic_set_extend(bset
, nparam
, 3*dim
, 0, dim
, 0);
3634 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
3635 for (i
= 0; i
< dim
; ++i
) {
3636 int j
= isl_basic_map_alloc_equality(
3637 (struct isl_basic_map
*)bset
);
3640 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
3641 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
3642 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
3643 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
3645 return isl_basic_set_project_out(bset
, 2*dim
, 0);
3647 isl_basic_map_free(bmap
);
3652 * returns range - domain
3654 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
3657 struct isl_set
*result
;
3662 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
3663 result
= isl_set_alloc(map
->ctx
, isl_map_n_param(map
),
3664 isl_map_n_in(map
), map
->n
, map
->flags
);
3667 for (i
= 0; i
< map
->n
; ++i
)
3668 result
= isl_set_add(result
,
3669 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
3677 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
3679 struct isl_basic_map
*bmap
;
3687 nparam
= dims
->nparam
;
3689 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
3693 for (i
= 0; i
< dim
; ++i
) {
3694 int j
= isl_basic_map_alloc_equality(bmap
);
3697 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3698 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
3699 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
3701 return isl_basic_map_finalize(bmap
);
3703 isl_basic_map_free(bmap
);
3707 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
3709 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3712 return basic_map_identity(dim
);
3715 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
3717 if (!model
|| !model
->dim
)
3719 isl_assert(model
->ctx
,
3720 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3721 return basic_map_identity(isl_dim_copy(model
->dim
));
3724 static struct isl_map
*map_identity(struct isl_dim
*dim
)
3726 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
3727 return isl_map_add(map
, basic_map_identity(isl_dim_copy(dim
)));
3730 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
3732 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3735 return map_identity(dim
);
3738 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
3740 if (!model
|| !model
->dim
)
3742 isl_assert(model
->ctx
,
3743 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3744 return map_identity(isl_dim_copy(model
->dim
));
3747 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
3749 if (!model
|| !model
->dim
)
3751 isl_assert(model
->ctx
,
3752 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3753 return map_identity(isl_dim_copy(model
->dim
));
3756 /* Construct a basic set with all set dimensions having only non-negative
3759 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
3764 struct isl_basic_set
*bset
;
3768 nparam
= dims
->nparam
;
3770 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
3773 for (i
= 0; i
< dim
; ++i
) {
3774 int k
= isl_basic_set_alloc_inequality(bset
);
3777 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
3778 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
3782 isl_basic_set_free(bset
);
3786 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
3788 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3791 int isl_set_is_subset(struct isl_set
*set1
, struct isl_set
*set2
)
3793 return isl_map_is_subset(
3794 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3797 int isl_basic_map_is_subset(
3798 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3801 struct isl_map
*map1
;
3802 struct isl_map
*map2
;
3804 if (!bmap1
|| !bmap2
)
3807 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
3808 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
3810 is_subset
= isl_map_is_subset(map1
, map2
);
3818 int isl_basic_map_is_equal(
3819 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3823 if (!bmap1
|| !bmap2
)
3825 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3828 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3832 int isl_basic_set_is_equal(
3833 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3835 return isl_basic_map_is_equal(
3836 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
3839 int isl_map_is_empty(struct isl_map
*map
)
3846 for (i
= 0; i
< map
->n
; ++i
) {
3847 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
3856 int isl_map_fast_is_empty(struct isl_map
*map
)
3861 int isl_set_is_empty(struct isl_set
*set
)
3863 return isl_map_is_empty((struct isl_map
*)set
);
3866 int isl_map_is_subset(struct isl_map
*map1
, struct isl_map
*map2
)
3870 struct isl_map
*diff
;
3875 if (isl_map_is_empty(map1
))
3878 if (isl_map_is_empty(map2
))
3881 diff
= isl_map_subtract(isl_map_copy(map1
), isl_map_copy(map2
));
3885 is_subset
= isl_map_is_empty(diff
);
3891 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
3897 is_subset
= isl_map_is_subset(map1
, map2
);
3900 is_subset
= isl_map_is_subset(map2
, map1
);
3904 int isl_basic_map_is_strict_subset(
3905 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3909 if (!bmap1
|| !bmap2
)
3911 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3914 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3915 if (is_subset
== -1)
3920 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
3926 is_subset
= isl_map_is_subset(map1
, map2
);
3929 is_subset
= isl_map_is_subset(map2
, map1
);
3930 if (is_subset
== -1)
3935 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
3939 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
3942 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
3946 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
3949 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
3951 struct isl_basic_set
*bset
= NULL
;
3952 struct isl_vec
*sample
= NULL
;
3959 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
3962 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
3963 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
3964 copy
= isl_basic_map_convex_hull(copy
);
3965 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
3966 isl_basic_map_free(copy
);
3970 total
= 1 + isl_basic_map_total_dim(bmap
);
3971 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
3972 int contains
= basic_map_contains(bmap
, bmap
->sample
);
3978 isl_vec_free(bmap
->sample
);
3979 bmap
->sample
= NULL
;
3980 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
3983 sample
= isl_basic_set_sample(bset
);
3986 empty
= sample
->size
== 0;
3987 isl_vec_free(bmap
->sample
);
3988 bmap
->sample
= sample
;
3990 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
3995 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
3999 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
4002 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
4006 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
4009 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
4011 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
4014 struct isl_map
*isl_basic_map_union(
4015 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4017 struct isl_map
*map
;
4018 if (!bmap1
|| !bmap2
)
4021 isl_assert(map1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
4023 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
4026 map
= isl_map_add(map
, bmap1
);
4027 map
= isl_map_add(map
, bmap2
);
4030 isl_basic_map_free(bmap1
);
4031 isl_basic_map_free(bmap2
);
4035 struct isl_set
*isl_basic_set_union(
4036 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
4038 return (struct isl_set
*)isl_basic_map_union(
4039 (struct isl_basic_map
*)bset1
,
4040 (struct isl_basic_map
*)bset2
);
4043 /* Order divs such that any div only depends on previous divs */
4044 static struct isl_basic_map
*order_divs(struct isl_basic_map
*bmap
)
4047 unsigned off
= isl_dim_total(bmap
->dim
);
4049 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4051 if (isl_int_is_zero(bmap
->div
[i
][0]))
4053 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
4057 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
4063 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
4065 return (struct isl_basic_set
*)order_divs((struct isl_basic_map
*)bset
);
4068 /* Look for a div in dst that corresponds to the div "div" in src.
4069 * The divs before "div" in src and dst are assumed to be the same.
4071 * Returns -1 if no corresponding div was found and the position
4072 * of the corresponding div in dst otherwise.
4074 static int find_div(struct isl_basic_map
*dst
,
4075 struct isl_basic_map
*src
, unsigned div
)
4079 unsigned total
= isl_dim_total(src
->dim
);
4081 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
4082 for (i
= div
; i
< dst
->n_div
; ++i
)
4083 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
4084 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
4085 dst
->n_div
- div
) == -1)
4090 struct isl_basic_map
*isl_basic_map_align_divs(
4091 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
4094 unsigned total
= isl_dim_total(src
->dim
);
4099 if (src
->n_div
== 0)
4102 for (i
= 0; i
< src
->n_div
; ++i
)
4103 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
4105 src
= order_divs(src
);
4106 dst
= isl_basic_map_cow(dst
);
4107 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
4108 src
->n_div
, 0, 2 * src
->n_div
);
4111 for (i
= 0; i
< src
->n_div
; ++i
) {
4112 int j
= find_div(dst
, src
, i
);
4114 j
= isl_basic_map_alloc_div(dst
);
4117 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
4118 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
4119 if (add_div_constraints(dst
, j
) < 0)
4123 isl_basic_map_swap_div(dst
, i
, j
);
4127 isl_basic_map_free(dst
);
4131 struct isl_basic_set
*isl_basic_set_align_divs(
4132 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
4134 return (struct isl_basic_set
*)isl_basic_map_align_divs(
4135 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
4138 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
4142 map
= isl_map_compute_divs(map
);
4143 map
= isl_map_cow(map
);
4147 for (i
= 1; i
< map
->n
; ++i
)
4148 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
4149 for (i
= 1; i
< map
->n
; ++i
)
4150 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
4152 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4156 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
4158 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
4161 static struct isl_map
*add_cut_constraint(struct isl_map
*dst
,
4162 struct isl_basic_map
*src
, isl_int
*c
,
4163 unsigned len
, int oppose
)
4165 struct isl_basic_map
*copy
= NULL
;
4170 copy
= isl_basic_map_copy(src
);
4171 copy
= isl_basic_map_cow(copy
);
4174 copy
= isl_basic_map_extend_constraints(copy
, 0, 1);
4175 k
= isl_basic_map_alloc_inequality(copy
);
4179 isl_seq_neg(copy
->ineq
[k
], c
, len
);
4181 isl_seq_cpy(copy
->ineq
[k
], c
, len
);
4182 total
= 1 + isl_basic_map_total_dim(copy
);
4183 isl_seq_clr(copy
->ineq
[k
]+len
, total
- len
);
4184 isl_inequality_negate(copy
, k
);
4185 copy
= isl_basic_map_simplify(copy
);
4186 copy
= isl_basic_map_finalize(copy
);
4187 is_empty
= isl_basic_map_is_empty(copy
);
4191 dst
= isl_map_add(dst
, copy
);
4193 isl_basic_map_free(copy
);
4196 isl_basic_map_free(copy
);
4201 static struct isl_map
*subtract(struct isl_map
*map
, struct isl_basic_map
*bmap
)
4205 struct isl_map
*rest
= NULL
;
4207 unsigned total
= isl_basic_map_total_dim(bmap
);
4214 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4215 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4217 max
= map
->n
* (2 * bmap
->n_eq
+ bmap
->n_ineq
);
4218 rest
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), max
, flags
);
4222 for (i
= 0; i
< map
->n
; ++i
) {
4223 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], bmap
);
4228 for (j
= 0; j
< map
->n
; ++j
)
4229 map
->p
[j
] = isl_basic_map_cow(map
->p
[j
]);
4231 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
4232 for (j
= 0; j
< map
->n
; ++j
) {
4233 rest
= add_cut_constraint(rest
,
4234 map
->p
[j
], bmap
->eq
[i
], 1+total
, 0);
4238 rest
= add_cut_constraint(rest
,
4239 map
->p
[j
], bmap
->eq
[i
], 1+total
, 1);
4243 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4247 k
= isl_basic_map_alloc_equality(map
->p
[j
]);
4250 isl_seq_cpy(map
->p
[j
]->eq
[k
], bmap
->eq
[i
], 1+total
);
4251 isl_seq_clr(map
->p
[j
]->eq
[k
]+1+total
,
4252 map
->p
[j
]->n_div
- bmap
->n_div
);
4256 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4257 for (j
= 0; j
< map
->n
; ++j
) {
4258 rest
= add_cut_constraint(rest
,
4259 map
->p
[j
], bmap
->ineq
[i
], 1+total
, 0);
4263 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4267 k
= isl_basic_map_alloc_inequality(map
->p
[j
]);
4270 isl_seq_cpy(map
->p
[j
]->ineq
[k
], bmap
->ineq
[i
], 1+total
);
4271 isl_seq_clr(map
->p
[j
]->ineq
[k
]+1+total
,
4272 map
->p
[j
]->n_div
- bmap
->n_div
);
4284 struct isl_map
*isl_map_subtract(struct isl_map
*map1
, struct isl_map
*map2
)
4290 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4292 if (isl_map_is_empty(map2
)) {
4297 map1
= isl_map_compute_divs(map1
);
4298 map2
= isl_map_compute_divs(map2
);
4302 for (i
= 0; map1
&& i
< map2
->n
; ++i
)
4303 map1
= subtract(map1
, map2
->p
[i
]);
4313 struct isl_set
*isl_set_subtract(struct isl_set
*set1
, struct isl_set
*set2
)
4315 return (struct isl_set
*)
4317 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4320 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
4324 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
4325 map
= isl_map_intersect_domain(map
, set
);
4326 set
= isl_map_range(map
);
4334 /* There is no need to cow as removing empty parts doesn't change
4335 * the meaning of the set.
4337 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
4344 for (i
= map
->n
-1; i
>= 0; --i
) {
4345 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
4347 isl_basic_map_free(map
->p
[i
]);
4348 if (i
!= map
->n
-1) {
4349 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4350 map
->p
[i
] = map
->p
[map
->n
-1];
4358 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
4360 return (struct isl_set
*)
4361 isl_map_remove_empty_parts((struct isl_map
*)set
);
4364 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
4366 struct isl_basic_map
*bmap
;
4367 if (!map
|| map
->n
== 0)
4369 bmap
= map
->p
[map
->n
-1];
4370 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
4371 return isl_basic_map_copy(bmap
);
4374 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
4376 (struct isl_basic_set
*)isl_map_copy_basic_map((struct isl_map
*)set
);
4379 struct isl_map
*isl_map_drop_basic_map(struct isl_map
*map
,
4380 struct isl_basic_map
*bmap
)
4386 for (i
= map
->n
-1; i
>= 0; --i
) {
4387 if (map
->p
[i
] != bmap
)
4389 map
= isl_map_cow(map
);
4392 isl_basic_map_free(map
->p
[i
]);
4393 if (i
!= map
->n
-1) {
4394 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
4395 map
->p
[i
] = map
->p
[map
->n
-1];
4400 isl_basic_map_free(bmap
);
4404 isl_basic_map_free(bmap
);
4408 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
4409 struct isl_basic_set
*bset
)
4411 (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
4412 (struct isl_basic_map
*)bset
);
4415 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4416 * for any common value of the parameters and dimensions preceding dim
4417 * in both basic sets, the values of dimension pos in bset1 are
4418 * smaller or larger than those in bset2.
4421 * 1 if bset1 follows bset2
4422 * -1 if bset1 precedes bset2
4423 * 0 if bset1 and bset2 are incomparable
4424 * -2 if some error occurred.
4426 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
4427 struct isl_basic_set
*bset2
, int pos
)
4429 struct isl_dim
*dims
;
4430 struct isl_basic_map
*bmap1
= NULL
;
4431 struct isl_basic_map
*bmap2
= NULL
;
4432 struct isl_ctx
*ctx
;
4433 struct isl_vec
*obj
;
4436 unsigned dim1
, dim2
;
4438 enum isl_lp_result res
;
4441 if (!bset1
|| !bset2
)
4444 nparam
= isl_basic_set_n_param(bset1
);
4445 dim1
= isl_basic_set_n_dim(bset1
);
4446 dim2
= isl_basic_set_n_dim(bset2
);
4447 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
4448 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
4449 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
4450 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
4451 if (!bmap1
|| !bmap2
)
4453 bmap1
= isl_basic_map_cow(bmap1
);
4454 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
4455 pos
, (dim1
- pos
) + (dim2
- pos
),
4456 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
4457 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
4460 total
= isl_basic_map_total_dim(bmap1
);
4462 obj
= isl_vec_alloc(ctx
, 1 + total
);
4463 isl_seq_clr(obj
->block
.data
, 1 + total
);
4464 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
4465 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
4470 res
= isl_basic_map_solve_lp(bmap1
, 0, obj
->block
.data
, ctx
->one
,
4472 if (res
== isl_lp_empty
)
4474 else if (res
== isl_lp_ok
&& isl_int_is_pos(num
))
4476 else if ((res
== isl_lp_ok
&& isl_int_is_neg(num
)) ||
4477 res
== isl_lp_unbounded
)
4483 isl_basic_map_free(bmap1
);
4487 isl_basic_map_free(bmap1
);
4488 isl_basic_map_free(bmap2
);
4492 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
4493 unsigned pos
, isl_int
*val
)
4501 total
= isl_basic_map_total_dim(bmap
);
4502 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
4503 for (; d
+1 > pos
; --d
)
4504 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
4508 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
4510 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
4512 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
4515 isl_int_neg(*val
, bmap
->eq
[i
][0]);
4521 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
4522 unsigned pos
, isl_int
*val
)
4534 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
4537 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
4538 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
4539 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
4540 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4544 isl_int_set(*val
, v
);
4550 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
4551 unsigned pos
, isl_int
*val
)
4553 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
4557 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
4560 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
4563 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
4564 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
4566 if (pos
>= isl_basic_map_dim(bmap
, type
))
4568 return isl_basic_map_fast_has_fixed_var(bmap
,
4569 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
4572 int isl_map_fast_is_fixed(struct isl_map
*map
,
4573 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
4575 if (pos
>= isl_map_dim(map
, type
))
4577 return isl_map_fast_has_fixed_var(map
,
4578 map_offset(map
, type
) - 1 + pos
, val
);
4581 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4582 * then return this fixed value in *val.
4584 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
4587 return isl_basic_set_fast_has_fixed_var(bset
,
4588 isl_basic_set_n_param(bset
) + dim
, val
);
4591 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4592 * then return this fixed value in *val.
4594 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
4596 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
4599 /* Check if input variable in has fixed value and if so and if val is not NULL,
4600 * then return this fixed value in *val.
4602 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
4604 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
4607 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4608 * and if val is not NULL, then return this lower bound in *val.
4610 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
4611 unsigned dim
, isl_int
*val
)
4613 int i
, i_eq
= -1, i_ineq
= -1;
4620 total
= isl_basic_set_total_dim(bset
);
4621 nparam
= isl_basic_set_n_param(bset
);
4622 for (i
= 0; i
< bset
->n_eq
; ++i
) {
4623 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
4629 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
4630 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
4632 if (i_eq
!= -1 || i_ineq
!= -1)
4636 if (i_eq
== -1 && i_ineq
== -1)
4638 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
4639 /* The coefficient should always be one due to normalization. */
4640 if (!isl_int_is_one(c
[1+nparam
+dim
]))
4642 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
4644 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
4645 total
- nparam
- dim
- 1) != -1)
4648 isl_int_neg(*val
, c
[0]);
4652 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
4653 unsigned dim
, isl_int
*val
)
4665 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4669 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4671 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
4672 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
4674 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4678 isl_int_set(*val
, v
);
4689 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
4691 const struct constraint
*c1
= (const struct constraint
*)p1
;
4692 const struct constraint
*c2
= (const struct constraint
*)p2
;
4693 unsigned size
= isl_min(c1
->size
, c2
->size
);
4694 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
4697 static struct isl_basic_map
*isl_basic_map_sort_constraints(
4698 struct isl_basic_map
*bmap
)
4701 struct constraint
*c
;
4706 total
= isl_basic_map_total_dim(bmap
);
4707 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
4710 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4712 c
[i
].c
= bmap
->ineq
[i
];
4714 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
4715 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4716 bmap
->ineq
[i
] = c
[i
].c
;
4720 isl_basic_map_free(bmap
);
4724 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
4728 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
4730 bmap
= isl_basic_map_convex_hull(bmap
);
4731 bmap
= isl_basic_map_sort_constraints(bmap
);
4732 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4736 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
4738 return (struct isl_basic_set
*)isl_basic_map_normalize(
4739 (struct isl_basic_map
*)bset
);
4742 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
4743 const struct isl_basic_map
*bmap2
)
4750 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
4751 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
4752 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
4753 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4754 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
4755 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4756 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
4757 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4759 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
4761 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4763 if (bmap1
->n_eq
!= bmap2
->n_eq
)
4764 return bmap1
->n_eq
- bmap2
->n_eq
;
4765 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
4766 return bmap1
->n_ineq
- bmap2
->n_ineq
;
4767 if (bmap1
->n_div
!= bmap2
->n_div
)
4768 return bmap1
->n_div
- bmap2
->n_div
;
4769 total
= isl_basic_map_total_dim(bmap1
);
4770 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
4771 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
4775 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
4776 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
4780 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
4781 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
4788 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
4789 struct isl_basic_map
*bmap2
)
4791 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
4794 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
4796 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
4797 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
4799 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
4802 /* We normalize in place, but if anything goes wrong we need
4803 * to return NULL, so we need to make sure we don't change the
4804 * meaning of any possible other copies of map.
4806 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
4809 struct isl_basic_map
*bmap
;
4813 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
4815 for (i
= 0; i
< map
->n
; ++i
) {
4816 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
4819 isl_basic_map_free(map
->p
[i
]);
4822 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
4823 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
4824 map
= isl_map_remove_empty_parts(map
);
4827 for (i
= map
->n
- 1; i
>= 1; --i
) {
4828 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
4830 isl_basic_map_free(map
->p
[i
-1]);
4831 for (j
= i
; j
< map
->n
; ++j
)
4832 map
->p
[j
-1] = map
->p
[j
];
4842 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
4844 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
4847 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
4857 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
4860 map1
= isl_map_copy(map1
);
4861 map2
= isl_map_copy(map2
);
4862 map1
= isl_map_normalize(map1
);
4863 map2
= isl_map_normalize(map2
);
4866 equal
= map1
->n
== map2
->n
;
4867 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
4868 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
4881 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
4883 return isl_map_fast_is_equal((struct isl_map
*)set1
,
4884 (struct isl_map
*)set2
);
4887 /* Return an interval that ranges from min to max (inclusive)
4889 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
4890 isl_int min
, isl_int max
)
4893 struct isl_basic_set
*bset
= NULL
;
4895 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
4899 k
= isl_basic_set_alloc_inequality(bset
);
4902 isl_int_set_si(bset
->ineq
[k
][1], 1);
4903 isl_int_neg(bset
->ineq
[k
][0], min
);
4905 k
= isl_basic_set_alloc_inequality(bset
);
4908 isl_int_set_si(bset
->ineq
[k
][1], -1);
4909 isl_int_set(bset
->ineq
[k
][0], max
);
4913 isl_basic_set_free(bset
);
4917 /* Return the Cartesian product of the basic sets in list (in the given order).
4919 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
4927 struct isl_basic_set
*product
= NULL
;
4931 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
4932 isl_assert(list
->ctx
, list
->p
[0], goto error
);
4933 nparam
= isl_basic_set_n_param(list
->p
[0]);
4934 dim
= isl_basic_set_n_dim(list
->p
[0]);
4935 extra
= list
->p
[0]->n_div
;
4936 n_eq
= list
->p
[0]->n_eq
;
4937 n_ineq
= list
->p
[0]->n_ineq
;
4938 for (i
= 1; i
< list
->n
; ++i
) {
4939 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
4940 isl_assert(list
->ctx
,
4941 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
4942 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4943 extra
+= list
->p
[i
]->n_div
;
4944 n_eq
+= list
->p
[i
]->n_eq
;
4945 n_ineq
+= list
->p
[i
]->n_ineq
;
4947 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
4952 for (i
= 0; i
< list
->n
; ++i
) {
4953 isl_basic_set_add_constraints(product
,
4954 isl_basic_set_copy(list
->p
[i
]), dim
);
4955 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4957 isl_basic_set_list_free(list
);
4960 isl_basic_set_free(product
);
4961 isl_basic_set_list_free(list
);
4965 struct isl_basic_map
*isl_basic_map_product(
4966 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4968 struct isl_dim
*dim_result
= NULL
;
4969 struct isl_basic_map
*bmap
;
4970 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
4971 struct isl_dim_map
*dim_map1
, *dim_map2
;
4973 if (!bmap1
|| !bmap2
)
4976 isl_assert(map1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
4977 bmap2
->dim
, isl_dim_param
), goto error
);
4978 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
4979 isl_dim_copy(bmap2
->dim
));
4981 in1
= isl_basic_map_n_in(bmap1
);
4982 in2
= isl_basic_map_n_in(bmap2
);
4983 out1
= isl_basic_map_n_out(bmap1
);
4984 out2
= isl_basic_map_n_out(bmap2
);
4985 nparam
= isl_basic_map_n_param(bmap1
);
4987 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
4988 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4989 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4990 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4991 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4992 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4993 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
4994 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
4995 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
4996 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
4997 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4999 bmap
= isl_basic_map_alloc_dim(dim_result
,
5000 bmap1
->n_div
+ bmap2
->n_div
,
5001 bmap1
->n_eq
+ bmap2
->n_eq
,
5002 bmap1
->n_ineq
+ bmap2
->n_ineq
);
5003 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
5004 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
5005 bmap
= isl_basic_map_simplify(bmap
);
5006 return isl_basic_map_finalize(bmap
);
5008 isl_basic_map_free(bmap1
);
5009 isl_basic_map_free(bmap2
);
5013 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5015 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
5018 struct isl_map
*result
;
5024 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
5025 map2
->dim
, isl_dim_param
), goto error
);
5027 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5028 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5029 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5031 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
5032 isl_dim_copy(map2
->dim
)),
5033 map1
->n
* map2
->n
, flags
);
5036 for (i
= 0; i
< map1
->n
; ++i
)
5037 for (j
= 0; j
< map2
->n
; ++j
) {
5038 struct isl_basic_map
*part
;
5039 part
= isl_basic_map_product(
5040 isl_basic_map_copy(map1
->p
[i
]),
5041 isl_basic_map_copy(map2
->p
[j
]));
5042 if (isl_basic_map_is_empty(part
))
5043 isl_basic_map_free(part
);
5045 result
= isl_map_add(result
, part
);
5058 /* Given two set A and B, construct its Cartesian product A x B.
5060 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
5062 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
5063 (struct isl_map
*)set2
);
5066 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
5074 bset
= isl_basic_set_copy(bset
);
5075 bset
= isl_basic_set_normalize(bset
);
5078 total
= isl_basic_set_total_dim(bset
);
5079 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
5080 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5082 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
5083 isl_hash_hash(hash
, c_hash
);
5085 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
5086 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5088 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
5089 isl_hash_hash(hash
, c_hash
);
5091 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
5092 for (i
= 0; i
< bset
->n_div
; ++i
) {
5094 if (isl_int_is_zero(bset
->div
[i
][0]))
5096 isl_hash_byte(hash
, i
& 0xFF);
5097 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
5098 isl_hash_hash(hash
, c_hash
);
5100 isl_basic_set_free(bset
);
5104 uint32_t isl_set_get_hash(struct isl_set
*set
)
5111 set
= isl_set_copy(set
);
5112 set
= isl_set_normalize(set
);
5116 hash
= isl_hash_init();
5117 for (i
= 0; i
< set
->n
; ++i
) {
5119 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
5120 isl_hash_hash(hash
, bset_hash
);
5128 /* Check if the value for dimension dim is completely determined
5129 * by the values of the other parameters and variables.
5130 * That is, check if dimension dim is involved in an equality.
5132 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
5139 nparam
= isl_basic_set_n_param(bset
);
5140 for (i
= 0; i
< bset
->n_eq
; ++i
)
5141 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
5146 /* Check if the value for dimension dim is completely determined
5147 * by the values of the other parameters and variables.
5148 * That is, check if dimension dim is involved in an equality
5149 * for each of the subsets.
5151 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
5157 for (i
= 0; i
< set
->n
; ++i
) {
5159 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);