11 #include "isl_map_private.h"
12 #include "isl_map_piplib.h"
13 #include "isl_sample.h"
16 /* Maps dst positions to src positions */
22 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
25 struct isl_dim_map
*dim_map
;
26 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
27 sizeof(struct isl_dim_map
) + len
* sizeof(int));
30 dim_map
->len
= 1 + len
;
32 for (i
= 0; i
< len
; ++i
)
33 dim_map
->pos
[1 + i
] = -1;
37 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
40 case isl_dim_param
: return dim
->nparam
;
41 case isl_dim_in
: return dim
->n_in
;
42 case isl_dim_out
: return dim
->n_out
;
43 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
47 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
50 case isl_dim_param
: return 1;
51 case isl_dim_in
: return 1 + dim
->nparam
;
52 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
56 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
57 enum isl_dim_type type
, unsigned dst_pos
)
65 src_pos
= pos(dim
, type
);
66 for (i
= 0; i
< n(dim
, type
); ++i
)
67 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
70 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
71 struct isl_basic_map
*bmap
, unsigned dst_pos
)
76 if (!dim_map
|| !bmap
)
79 src_pos
= 1 + isl_dim_total(bmap
->dim
);
80 for (i
= 0; i
< bmap
->n_div
; ++i
)
81 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
84 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
88 for (i
= 0; i
< dim_map
->len
; ++i
)
89 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
90 fprintf(stderr
, "\n");
93 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
94 enum isl_dim_type type
)
96 struct isl_dim
*dim
= bmap
->dim
;
100 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
101 case isl_dim_div
: return bmap
->n_div
;
102 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
106 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
108 return n(map
->dim
, type
);
111 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
113 return n(set
->dim
, type
);
116 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
117 enum isl_dim_type type
)
119 struct isl_dim
*dim
= bmap
->dim
;
121 case isl_dim_param
: return 1;
122 case isl_dim_in
: return 1 + dim
->nparam
;
123 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
124 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
128 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
130 return pos(map
->dim
, type
);
133 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
134 enum isl_dim_type type
)
136 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
139 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
141 return bset
->dim
->n_out
;
144 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
146 return bset
->dim
->nparam
;
149 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
151 return isl_dim_total(bset
->dim
) + bset
->n_div
;
154 unsigned isl_set_n_dim(const struct isl_set
*set
)
156 return set
->dim
->n_out
;
159 unsigned isl_set_n_param(const struct isl_set
*set
)
161 return set
->dim
->nparam
;
164 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
166 return bmap
->dim
->n_in
;
169 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
171 return bmap
->dim
->n_out
;
174 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
176 return bmap
->dim
->nparam
;
179 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
184 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
186 return isl_dim_total(bmap
->dim
) + bmap
->n_div
;
189 unsigned isl_map_n_in(const struct isl_map
*map
)
191 return map
->dim
->n_in
;
194 unsigned isl_map_n_out(const struct isl_map
*map
)
196 return map
->dim
->n_out
;
199 unsigned isl_map_n_param(const struct isl_map
*map
)
201 return map
->dim
->nparam
;
204 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
206 return map
->dim
->n_in
== set
->dim
->n_out
&&
207 map
->dim
->nparam
== set
->dim
->nparam
;
210 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
211 struct isl_basic_set
*bset
)
213 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
214 bmap
->dim
->nparam
== bset
->dim
->nparam
;
217 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
218 struct isl_basic_set
*bset
)
220 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
221 bmap
->dim
->nparam
== bset
->dim
->nparam
;
224 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
228 return isl_dim_copy(bmap
->dim
);
231 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
235 return isl_dim_copy(bset
->dim
);
238 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
242 return isl_dim_copy(map
->dim
);
245 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
249 return isl_dim_copy(set
->dim
);
252 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
253 struct isl_basic_map
*bmap
, unsigned extra
,
254 unsigned n_eq
, unsigned n_ineq
)
257 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
259 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
260 if (isl_blk_is_error(bmap
->block
)) {
265 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
267 isl_blk_free(ctx
, bmap
->block
);
273 bmap
->block2
= isl_blk_empty();
276 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
277 if (isl_blk_is_error(bmap
->block2
)) {
279 isl_blk_free(ctx
, bmap
->block
);
284 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
286 isl_blk_free(ctx
, bmap
->block2
);
288 isl_blk_free(ctx
, bmap
->block
);
294 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
295 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
297 for (i
= 0; i
< extra
; ++i
)
298 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
304 bmap
->c_size
= n_eq
+ n_ineq
;
305 bmap
->eq
= bmap
->ineq
+ n_ineq
;
314 isl_basic_map_free(bmap
);
318 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
319 unsigned nparam
, unsigned dim
, unsigned extra
,
320 unsigned n_eq
, unsigned n_ineq
)
322 struct isl_basic_map
*bmap
;
323 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
324 return (struct isl_basic_set
*)bmap
;
327 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
328 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
330 struct isl_basic_map
*bmap
;
333 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
334 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
335 return (struct isl_basic_set
*)bmap
;
338 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
339 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
341 struct isl_basic_map
*bmap
;
345 bmap
= isl_alloc_type(dim
->ctx
, struct isl_basic_map
);
350 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
356 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
357 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
358 unsigned n_eq
, unsigned n_ineq
)
360 struct isl_basic_map
*bmap
;
363 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
367 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
371 static void dup_constraints(
372 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
375 unsigned total
= isl_basic_map_total_dim(src
);
377 for (i
= 0; i
< src
->n_eq
; ++i
) {
378 int j
= isl_basic_map_alloc_equality(dst
);
379 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
382 for (i
= 0; i
< src
->n_ineq
; ++i
) {
383 int j
= isl_basic_map_alloc_inequality(dst
);
384 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
387 for (i
= 0; i
< src
->n_div
; ++i
) {
388 int j
= isl_basic_map_alloc_div(dst
);
389 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
391 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
394 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
396 struct isl_basic_map
*dup
;
400 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
401 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
404 dup_constraints(dup
, bmap
);
405 dup
->flags
= bmap
->flags
;
406 dup
->sample
= isl_vec_copy(bmap
->sample
);
410 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
412 struct isl_basic_map
*dup
;
414 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
415 return (struct isl_basic_set
*)dup
;
418 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
423 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
427 return isl_basic_set_dup(bset
);
430 struct isl_set
*isl_set_copy(struct isl_set
*set
)
439 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
444 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
448 return isl_basic_map_dup(bmap
);
451 struct isl_map
*isl_map_copy(struct isl_map
*map
)
460 void isl_basic_map_free(struct isl_basic_map
*bmap
)
468 isl_ctx_deref(bmap
->ctx
);
470 isl_blk_free(bmap
->ctx
, bmap
->block2
);
472 isl_blk_free(bmap
->ctx
, bmap
->block
);
473 isl_vec_free(bmap
->sample
);
474 isl_dim_free(bmap
->dim
);
478 void isl_basic_set_free(struct isl_basic_set
*bset
)
480 isl_basic_map_free((struct isl_basic_map
*)bset
);
483 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
485 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
488 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
494 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
495 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
497 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
498 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
499 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
500 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
501 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
502 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
504 int j
= isl_basic_map_alloc_inequality(bmap
);
508 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
509 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
516 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
517 bmap
->extra
- bmap
->n_div
);
521 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
523 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
526 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
530 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
535 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
537 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
540 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
545 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
547 if (pos
!= bmap
->n_eq
- 1) {
549 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
550 bmap
->eq
[bmap
->n_eq
- 1] = t
;
556 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
558 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
561 void isl_basic_map_inequality_to_equality(
562 struct isl_basic_map
*bmap
, unsigned pos
)
567 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
568 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
573 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
574 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
575 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
576 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
579 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
581 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
584 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
590 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
591 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
592 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
593 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
594 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
595 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
596 1 + isl_basic_map_total_dim(bmap
),
597 bmap
->extra
- bmap
->n_div
);
598 return bmap
->n_ineq
++;
601 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
603 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
606 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
610 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
615 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
617 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
620 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
625 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
627 if (pos
!= bmap
->n_ineq
- 1) {
629 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
630 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
631 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
637 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
639 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
642 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
646 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
647 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
648 1 + 1 + isl_basic_map_total_dim(bmap
),
649 bmap
->extra
- bmap
->n_div
);
650 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
651 return bmap
->n_div
++;
654 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
656 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
659 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
663 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
668 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
670 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
673 /* Copy constraint from src to dst, putting the vars of src at offset
674 * dim_off in dst and the divs of src at offset div_off in dst.
675 * If both sets are actually map, then dim_off applies to the input
678 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
679 struct isl_basic_map
*src_map
, isl_int
*src
,
680 unsigned in_off
, unsigned out_off
, unsigned div_off
)
682 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
683 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
684 unsigned src_in
= isl_basic_map_n_in(src_map
);
685 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
686 unsigned src_out
= isl_basic_map_n_out(src_map
);
687 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
688 isl_int_set(dst
[0], src
[0]);
689 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
690 if (dst_nparam
> src_nparam
)
691 isl_seq_clr(dst
+1+src_nparam
,
692 dst_nparam
- src_nparam
);
693 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
694 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
696 isl_min(dst_in
-in_off
, src_in
));
697 if (dst_in
-in_off
> src_in
)
698 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
699 dst_in
- in_off
- src_in
);
700 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
701 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
702 src
+1+src_nparam
+src_in
,
703 isl_min(dst_out
-out_off
, src_out
));
704 if (dst_out
-out_off
> src_out
)
705 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
706 dst_out
- out_off
- src_out
);
707 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
708 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
709 src
+1+src_nparam
+src_in
+src_out
,
710 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
711 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
712 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
713 div_off
+src_map
->n_div
,
714 dst_map
->n_div
- div_off
- src_map
->n_div
);
717 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
718 struct isl_basic_map
*src_map
, isl_int
*src
,
719 unsigned in_off
, unsigned out_off
, unsigned div_off
)
721 isl_int_set(dst
[0], src
[0]);
722 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
725 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
726 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
731 if (!bmap1
|| !bmap2
)
734 div_off
= bmap1
->n_div
;
736 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
737 int i1
= isl_basic_map_alloc_equality(bmap1
);
740 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
741 i_pos
, o_pos
, div_off
);
744 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
745 int i1
= isl_basic_map_alloc_inequality(bmap1
);
748 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
749 i_pos
, o_pos
, div_off
);
752 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
753 int i1
= isl_basic_map_alloc_div(bmap1
);
756 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
757 i_pos
, o_pos
, div_off
);
760 isl_basic_map_free(bmap2
);
765 isl_basic_map_free(bmap1
);
766 isl_basic_map_free(bmap2
);
770 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
771 struct isl_dim_map
*dim_map
)
775 for (i
= 0; i
< dim_map
->len
; ++i
) {
776 if (dim_map
->pos
[i
] < 0)
777 isl_int_set_si(dst
[i
], 0);
779 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
783 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
784 struct isl_dim_map
*dim_map
)
786 isl_int_set(dst
[0], src
[0]);
787 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
790 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
791 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
795 if (!src
|| !dst
|| !dim_map
)
798 for (i
= 0; i
< src
->n_eq
; ++i
) {
799 int i1
= isl_basic_map_alloc_equality(dst
);
802 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
805 for (i
= 0; i
< src
->n_ineq
; ++i
) {
806 int i1
= isl_basic_map_alloc_inequality(dst
);
809 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
812 for (i
= 0; i
< src
->n_div
; ++i
) {
813 int i1
= isl_basic_map_alloc_div(dst
);
816 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
820 isl_basic_map_free(src
);
825 isl_basic_map_free(src
);
826 isl_basic_map_free(dst
);
830 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
831 struct isl_basic_set
*bset2
, unsigned pos
)
833 return (struct isl_basic_set
*)
834 add_constraints((struct isl_basic_map
*)bset1
,
835 (struct isl_basic_map
*)bset2
, 0, pos
);
838 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
839 struct isl_dim
*dim
, unsigned extra
,
840 unsigned n_eq
, unsigned n_ineq
)
842 struct isl_basic_map
*ext
;
852 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
853 base
->extra
>= base
->n_div
+ extra
;
855 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
856 room_for_ineq(base
, n_ineq
)) {
861 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
862 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
863 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
864 extra
+= base
->extra
;
866 n_ineq
+= base
->n_ineq
;
868 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
874 ext
= add_constraints(ext
, base
, 0, 0);
877 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
884 isl_basic_map_free(base
);
888 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
889 struct isl_dim
*dim
, unsigned extra
,
890 unsigned n_eq
, unsigned n_ineq
)
892 return (struct isl_basic_set
*)
893 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
894 extra
, n_eq
, n_ineq
);
897 struct isl_basic_map
*isl_basic_map_extend_constraints(
898 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
902 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
906 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
907 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
908 unsigned n_eq
, unsigned n_ineq
)
910 struct isl_basic_map
*bmap
;
915 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
919 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
923 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
924 unsigned nparam
, unsigned dim
, unsigned extra
,
925 unsigned n_eq
, unsigned n_ineq
)
927 return (struct isl_basic_set
*)
928 isl_basic_map_extend((struct isl_basic_map
*)base
,
929 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
932 struct isl_basic_set
*isl_basic_set_extend_constraints(
933 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
935 return (struct isl_basic_set
*)
936 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
940 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
942 return (struct isl_basic_set
*)
943 isl_basic_map_cow((struct isl_basic_map
*)bset
);
946 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
953 bmap
= isl_basic_map_dup(bmap
);
955 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
959 struct isl_set
*isl_set_cow(struct isl_set
*set
)
967 return isl_set_dup(set
);
970 struct isl_map
*isl_map_cow(struct isl_map
*map
)
978 return isl_map_dup(map
);
981 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
982 unsigned a_len
, unsigned b_len
)
984 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
985 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
986 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
989 struct isl_basic_set
*isl_basic_set_swap_vars(
990 struct isl_basic_set
*bset
, unsigned n
)
1000 nparam
= isl_basic_set_n_param(bset
);
1001 dim
= isl_basic_set_n_dim(bset
);
1002 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1007 bset
= isl_basic_set_cow(bset
);
1011 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1012 if (isl_blk_is_error(blk
))
1015 for (i
= 0; i
< bset
->n_eq
; ++i
)
1017 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1019 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1021 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1023 for (i
= 0; i
< bset
->n_div
; ++i
)
1025 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1027 isl_blk_free(bset
->ctx
, blk
);
1029 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1033 isl_basic_set_free(bset
);
1037 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1040 set
= isl_set_cow(set
);
1044 for (i
= 0; i
< set
->n
; ++i
) {
1045 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1051 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1055 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1061 total
= isl_basic_map_total_dim(bmap
);
1062 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1063 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1065 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1067 isl_basic_map_alloc_equality(bmap
);
1071 isl_int_set_si(bmap
->eq
[i
][0], 1);
1072 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1073 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1074 return isl_basic_map_finalize(bmap
);
1076 isl_basic_map_free(bmap
);
1080 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1082 return (struct isl_basic_set
*)
1083 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1086 static void swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1089 unsigned off
= isl_dim_total(bmap
->dim
);
1090 isl_int
*t
= bmap
->div
[a
];
1091 bmap
->div
[a
] = bmap
->div
[b
];
1094 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1095 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1097 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1098 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1100 for (i
= 0; i
< bmap
->n_div
; ++i
)
1101 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1102 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1105 /* Eliminate the specified n dimensions starting at first from the
1106 * constraints using Fourier-Motzkin, The dimensions themselves
1109 struct isl_set
*isl_set_eliminate_dims(struct isl_set
*set
,
1110 unsigned first
, unsigned n
)
1120 set
= isl_set_cow(set
);
1123 isl_assert(set
->ctx
, first
+n
<= isl_set_n_dim(set
), goto error
);
1124 nparam
= isl_set_n_param(set
);
1126 for (i
= 0; i
< set
->n
; ++i
) {
1127 set
->p
[i
] = isl_basic_set_eliminate_vars(set
->p
[i
],
1138 /* Project out n dimensions starting at first using Fourier-Motzkin */
1139 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1140 unsigned first
, unsigned n
)
1142 set
= isl_set_eliminate_dims(set
, first
, n
);
1143 set
= isl_set_drop_dims(set
, first
, n
);
1147 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1149 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1157 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1166 set
= isl_set_cow(set
);
1170 for (i
= 0; i
< set
->n
; ++i
) {
1171 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1181 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1182 enum isl_dim_type type
, unsigned first
, unsigned n
)
1186 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1190 bmap
= isl_basic_map_eliminate_vars(bmap
,
1191 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1192 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1195 isl_basic_map_free(bmap
);
1199 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1200 enum isl_dim_type type
, unsigned first
, unsigned n
)
1208 map
= isl_map_cow(map
);
1211 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1213 for (i
= 0; i
< map
->n
; ++i
) {
1214 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1215 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1219 map
= isl_map_drop(map
, type
, first
, n
);
1226 /* Project out n inputs starting at first using Fourier-Motzkin */
1227 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1228 unsigned first
, unsigned n
)
1230 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1233 /* Project out n dimensions starting at first using Fourier-Motzkin */
1234 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1235 unsigned first
, unsigned n
)
1237 unsigned nparam
= isl_basic_set_n_param(bset
);
1238 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1239 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1243 static void dump_term(struct isl_basic_map
*bmap
,
1244 isl_int c
, int pos
, FILE *out
)
1247 unsigned in
= isl_basic_map_n_in(bmap
);
1248 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1249 unsigned nparam
= isl_basic_map_n_param(bmap
);
1251 isl_int_print(out
, c
, 0);
1253 if (!isl_int_is_one(c
))
1254 isl_int_print(out
, c
, 0);
1255 if (pos
< 1 + nparam
) {
1256 name
= isl_dim_get_name(bmap
->dim
,
1257 isl_dim_param
, pos
- 1);
1259 fprintf(out
, "%s", name
);
1261 fprintf(out
, "p%d", pos
- 1);
1262 } else if (pos
< 1 + nparam
+ in
)
1263 fprintf(out
, "i%d", pos
- 1 - nparam
);
1264 else if (pos
< 1 + nparam
+ dim
)
1265 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1267 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1271 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1272 int sign
, FILE *out
)
1276 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1280 for (i
= 0, first
= 1; i
< len
; ++i
) {
1281 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1284 fprintf(out
, " + ");
1286 isl_int_abs(v
, c
[i
]);
1287 dump_term(bmap
, v
, i
, out
);
1294 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1295 const char *op
, FILE *out
, int indent
)
1299 fprintf(out
, "%*s", indent
, "");
1301 dump_constraint_sign(bmap
, c
, 1, out
);
1302 fprintf(out
, " %s ", op
);
1303 dump_constraint_sign(bmap
, c
, -1, out
);
1307 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1308 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1310 fprintf(out
, "%*s", indent
, "");
1311 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1316 static void dump_constraints(struct isl_basic_map
*bmap
,
1317 isl_int
**c
, unsigned n
,
1318 const char *op
, FILE *out
, int indent
)
1322 for (i
= 0; i
< n
; ++i
)
1323 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1326 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1330 unsigned total
= isl_basic_map_total_dim(bmap
);
1332 for (j
= 0; j
< 1 + total
; ++j
) {
1333 if (isl_int_is_zero(exp
[j
]))
1335 if (!first
&& isl_int_is_pos(exp
[j
]))
1337 dump_term(bmap
, exp
[j
], j
, out
);
1342 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1346 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1347 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1349 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1350 fprintf(out
, "%*s", indent
, "");
1351 fprintf(out
, "e%d = [(", i
);
1352 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1354 isl_int_print(out
, bmap
->div
[i
][0], 0);
1355 fprintf(out
, "]\n");
1359 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1362 fprintf(out
, "null basic set\n");
1366 fprintf(out
, "%*s", indent
, "");
1367 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1368 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1369 bset
->extra
, bset
->flags
);
1370 dump((struct isl_basic_map
*)bset
, out
, indent
);
1373 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1376 fprintf(out
, "null basic map\n");
1380 fprintf(out
, "%*s", indent
, "");
1381 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1382 "flags: %x, n_name: %d\n",
1384 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1385 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1386 dump(bmap
, out
, indent
);
1389 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1394 total
= isl_basic_map_total_dim(bmap
);
1395 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1396 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1397 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1398 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1402 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1404 struct isl_set
*set
;
1408 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1409 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1410 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1411 sizeof(struct isl_set
) +
1412 n
* sizeof(struct isl_basic_set
*));
1416 set
->ctx
= dim
->ctx
;
1417 isl_ctx_ref(set
->ctx
);
1429 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1430 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1432 struct isl_set
*set
;
1433 struct isl_dim
*dims
;
1435 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1439 set
= isl_set_alloc_dim(dims
, n
, flags
);
1443 /* Make sure "map" has room for at least "n" more basic maps.
1445 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1448 struct isl_map
*grown
= NULL
;
1452 isl_assert(map
->ctx
, n
>= 0, goto error
);
1453 if (map
->n
+ n
<= map
->size
)
1455 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1458 for (i
= 0; i
< map
->n
; ++i
) {
1459 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1467 isl_map_free(grown
);
1472 /* Make sure "set" has room for at least "n" more basic sets.
1474 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1476 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1479 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1482 struct isl_set
*dup
;
1487 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1490 for (i
= 0; i
< set
->n
; ++i
)
1491 dup
= isl_set_add(dup
, isl_basic_set_copy(set
->p
[i
]));
1495 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1497 struct isl_set
*set
;
1502 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1504 isl_basic_set_free(bset
);
1507 return isl_set_add(set
, bset
);
1510 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1512 struct isl_map
*map
;
1517 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1519 isl_basic_map_free(bmap
);
1522 return isl_map_add(map
, bmap
);
1525 struct isl_set
*isl_set_add(struct isl_set
*set
, struct isl_basic_set
*bset
)
1527 return (struct isl_set
*)isl_map_add((struct isl_map
*)set
,
1528 (struct isl_basic_map
*)bset
);
1531 void isl_set_free(struct isl_set
*set
)
1541 isl_ctx_deref(set
->ctx
);
1542 for (i
= 0; i
< set
->n
; ++i
)
1543 isl_basic_set_free(set
->p
[i
]);
1544 isl_dim_free(set
->dim
);
1548 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1553 fprintf(out
, "null set\n");
1557 fprintf(out
, "%*s", indent
, "");
1558 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1559 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1561 for (i
= 0; i
< set
->n
; ++i
) {
1562 fprintf(out
, "%*s", indent
, "");
1563 fprintf(out
, "basic set %d:\n", i
);
1564 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1568 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1573 fprintf(out
, "null map\n");
1577 fprintf(out
, "%*s", indent
, "");
1578 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1579 "flags: %x, n_name: %d\n",
1580 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1581 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1582 for (i
= 0; i
< map
->n
; ++i
) {
1583 fprintf(out
, "%*s", indent
, "");
1584 fprintf(out
, "basic map %d:\n", i
);
1585 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1589 struct isl_basic_map
*isl_basic_map_intersect_domain(
1590 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1592 struct isl_basic_map
*bmap_domain
;
1593 struct isl_dim
*dim
;
1598 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1599 bset
->dim
, isl_dim_param
), goto error
);
1601 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1602 isl_assert(bset
->ctx
,
1603 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1605 bmap
= isl_basic_map_cow(bmap
);
1606 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1607 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1610 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1611 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1612 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1614 bmap
= isl_basic_map_simplify(bmap
);
1615 return isl_basic_map_finalize(bmap
);
1617 isl_basic_map_free(bmap
);
1618 isl_basic_set_free(bset
);
1622 struct isl_basic_map
*isl_basic_map_intersect_range(
1623 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1625 struct isl_basic_map
*bmap_range
;
1630 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1631 bset
->dim
, isl_dim_param
), goto error
);
1633 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1634 isl_assert(bset
->ctx
,
1635 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1637 bmap
= isl_basic_map_cow(bmap
);
1638 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1639 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1642 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1643 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1645 bmap
= isl_basic_map_simplify(bmap
);
1646 return isl_basic_map_finalize(bmap
);
1648 isl_basic_map_free(bmap
);
1649 isl_basic_set_free(bset
);
1653 static int basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1659 total
= 1 + isl_basic_map_total_dim(bmap
);
1660 if (total
!= vec
->size
)
1665 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1666 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1667 if (!isl_int_is_zero(s
)) {
1673 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1674 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1675 if (isl_int_is_neg(s
)) {
1686 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1688 return basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1691 struct isl_basic_map
*isl_basic_map_intersect(
1692 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1694 struct isl_vec
*sample
= NULL
;
1696 if (!bmap1
|| !bmap2
)
1699 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1700 bmap2
->dim
, isl_dim_param
), goto error
);
1701 if (isl_dim_total(bmap1
->dim
) ==
1702 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1703 isl_dim_total(bmap2
->dim
) !=
1704 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1705 return isl_basic_map_intersect(bmap2
, bmap1
);
1707 if (isl_dim_total(bmap2
->dim
) !=
1708 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1709 isl_assert(bmap1
->ctx
,
1710 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1712 if (bmap1
->sample
&&
1713 basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1714 basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1715 sample
= isl_vec_copy(bmap1
->sample
);
1716 else if (bmap2
->sample
&&
1717 basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1718 basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1719 sample
= isl_vec_copy(bmap2
->sample
);
1721 bmap1
= isl_basic_map_cow(bmap1
);
1722 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1723 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1726 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1729 isl_vec_free(bmap1
->sample
);
1730 bmap1
->sample
= sample
;
1733 bmap1
= isl_basic_map_simplify(bmap1
);
1734 return isl_basic_map_finalize(bmap1
);
1737 isl_vec_free(sample
);
1738 isl_basic_map_free(bmap1
);
1739 isl_basic_map_free(bmap2
);
1743 struct isl_basic_set
*isl_basic_set_intersect(
1744 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1746 return (struct isl_basic_set
*)
1747 isl_basic_map_intersect(
1748 (struct isl_basic_map
*)bset1
,
1749 (struct isl_basic_map
*)bset2
);
1752 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1755 struct isl_map
*result
;
1761 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1762 map2
->dim
, isl_dim_param
), goto error
);
1763 if (isl_dim_total(map1
->dim
) ==
1764 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1765 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1766 return isl_map_intersect(map2
, map1
);
1768 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1769 isl_assert(map1
->ctx
,
1770 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1772 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1773 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
1774 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
1776 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1777 map1
->n
* map2
->n
, flags
);
1780 for (i
= 0; i
< map1
->n
; ++i
)
1781 for (j
= 0; j
< map2
->n
; ++j
) {
1782 struct isl_basic_map
*part
;
1783 part
= isl_basic_map_intersect(
1784 isl_basic_map_copy(map1
->p
[i
]),
1785 isl_basic_map_copy(map2
->p
[j
]));
1786 if (isl_basic_map_is_empty(part
))
1787 isl_basic_map_free(part
);
1789 result
= isl_map_add(result
, part
);
1802 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1804 return (struct isl_set
*)
1805 isl_map_intersect((struct isl_map
*)set1
,
1806 (struct isl_map
*)set2
);
1809 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
1811 struct isl_dim
*dim
;
1812 struct isl_basic_set
*bset
;
1817 bmap
= isl_basic_map_cow(bmap
);
1820 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
1821 in
= isl_basic_map_n_in(bmap
);
1822 bset
= isl_basic_set_from_basic_map(bmap
);
1823 bset
= isl_basic_set_swap_vars(bset
, in
);
1824 return isl_basic_map_from_basic_set(bset
, dim
);
1827 /* Turn final n dimensions into existentially quantified variables.
1829 struct isl_basic_set
*isl_basic_set_project_out(
1830 struct isl_basic_set
*bset
, unsigned n
, unsigned flags
)
1840 isl_assert(bset
->ctx
, n
<= isl_basic_set_n_dim(bset
), goto error
);
1845 bset
= isl_basic_set_cow(bset
);
1847 row_size
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
1848 old
= bset
->block2
.data
;
1849 bset
->block2
= isl_blk_extend(bset
->ctx
, bset
->block2
,
1850 (bset
->extra
+ n
) * (1 + row_size
));
1851 if (!bset
->block2
.data
)
1853 new_div
= isl_alloc_array(ctx
, isl_int
*, bset
->extra
+ n
);
1856 for (i
= 0; i
< n
; ++i
) {
1857 new_div
[i
] = bset
->block2
.data
+
1858 (bset
->extra
+ i
) * (1 + row_size
);
1859 isl_seq_clr(new_div
[i
], 1 + row_size
);
1861 for (i
= 0; i
< bset
->extra
; ++i
)
1862 new_div
[n
+ i
] = bset
->block2
.data
+ (bset
->div
[i
] - old
);
1864 bset
->div
= new_div
;
1867 bset
->dim
= isl_dim_drop_outputs(bset
->dim
,
1868 isl_basic_set_n_dim(bset
) - n
, n
);
1871 bset
= isl_basic_set_simplify(bset
);
1872 return isl_basic_set_finalize(bset
);
1874 isl_basic_set_free(bset
);
1878 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
1882 for (i
= 0; i
< n
; ++i
) {
1883 j
= isl_basic_map_alloc_div(bmap
);
1886 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
1890 isl_basic_map_free(bmap
);
1894 struct isl_basic_map
*isl_basic_map_apply_range(
1895 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1897 struct isl_dim
*dim_result
= NULL
;
1898 struct isl_basic_map
*bmap
;
1899 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
1900 struct isl_dim_map
*dim_map1
, *dim_map2
;
1902 if (!bmap1
|| !bmap2
)
1905 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
1906 isl_dim_copy(bmap2
->dim
));
1908 n_in
= isl_basic_map_n_in(bmap1
);
1909 n_out
= isl_basic_map_n_out(bmap2
);
1910 n
= isl_basic_map_n_out(bmap1
);
1911 nparam
= isl_basic_map_n_param(bmap1
);
1913 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
1914 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1915 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1916 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
1917 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
1918 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
1919 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
1920 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
1921 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
1922 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
1923 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
1925 bmap
= isl_basic_map_alloc_dim(dim_result
,
1926 bmap1
->n_div
+ bmap2
->n_div
+ n
,
1927 bmap1
->n_eq
+ bmap2
->n_eq
,
1928 bmap1
->n_ineq
+ bmap2
->n_ineq
);
1929 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
1930 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
1931 bmap
= add_divs(bmap
, n
);
1932 bmap
= isl_basic_map_simplify(bmap
);
1933 return isl_basic_map_finalize(bmap
);
1935 isl_basic_map_free(bmap1
);
1936 isl_basic_map_free(bmap2
);
1940 struct isl_basic_set
*isl_basic_set_apply(
1941 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
1946 isl_assert(set
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
1949 return (struct isl_basic_set
*)
1950 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
1952 isl_basic_set_free(bset
);
1953 isl_basic_map_free(bmap
);
1957 struct isl_basic_map
*isl_basic_map_apply_domain(
1958 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1960 if (!bmap1
|| !bmap2
)
1964 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
1966 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
1969 bmap1
= isl_basic_map_reverse(bmap1
);
1970 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
1971 return isl_basic_map_reverse(bmap1
);
1973 isl_basic_map_free(bmap1
);
1974 isl_basic_map_free(bmap2
);
1978 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1979 * A \cap B -> f(A) + f(B)
1981 struct isl_basic_map
*isl_basic_map_sum(
1982 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1984 unsigned n_in
, n_out
, nparam
, total
, pos
;
1985 struct isl_basic_map
*bmap
= NULL
;
1986 struct isl_dim_map
*dim_map1
, *dim_map2
;
1989 if (!bmap1
|| !bmap2
)
1992 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
1995 nparam
= isl_basic_map_n_param(bmap1
);
1996 n_in
= isl_basic_map_n_in(bmap1
);
1997 n_out
= isl_basic_map_n_out(bmap1
);
1999 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2000 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2001 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2002 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2003 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2004 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2005 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2006 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2007 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2008 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2009 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2011 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2012 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2013 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2014 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2015 for (i
= 0; i
< n_out
; ++i
) {
2016 int j
= isl_basic_map_alloc_equality(bmap
);
2019 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2020 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2021 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2022 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2024 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2025 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2026 bmap
= add_divs(bmap
, 2 * n_out
);
2028 bmap
= isl_basic_map_simplify(bmap
);
2029 return isl_basic_map_finalize(bmap
);
2031 isl_basic_map_free(bmap
);
2032 isl_basic_map_free(bmap1
);
2033 isl_basic_map_free(bmap2
);
2037 /* Given a basic map A -> f(A), construct A -> -f(A).
2039 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2044 bmap
= isl_basic_map_cow(bmap
);
2048 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2049 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2050 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2051 for (j
= 0; j
< n
; ++j
)
2052 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2053 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2054 for (j
= 0; j
< n
; ++j
)
2055 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2056 for (i
= 0; i
< bmap
->n_div
; ++i
)
2057 for (j
= 0; j
< n
; ++j
)
2058 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2059 return isl_basic_map_finalize(bmap
);
2062 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2063 * A -> floor(f(A)/d).
2065 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2068 unsigned n_in
, n_out
, nparam
, total
, pos
;
2069 struct isl_basic_map
*result
= NULL
;
2070 struct isl_dim_map
*dim_map
;
2076 nparam
= isl_basic_map_n_param(bmap
);
2077 n_in
= isl_basic_map_n_in(bmap
);
2078 n_out
= isl_basic_map_n_out(bmap
);
2080 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2081 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2082 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2083 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2084 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2085 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2087 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2088 bmap
->n_div
+ n_out
,
2089 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2090 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2091 result
= add_divs(result
, n_out
);
2092 for (i
= 0; i
< n_out
; ++i
) {
2094 j
= isl_basic_map_alloc_inequality(result
);
2097 isl_seq_clr(result
->ineq
[j
], 1+total
);
2098 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2099 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2100 j
= isl_basic_map_alloc_inequality(result
);
2103 isl_seq_clr(result
->ineq
[j
], 1+total
);
2104 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2105 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2106 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2109 result
= isl_basic_map_simplify(result
);
2110 return isl_basic_map_finalize(result
);
2112 isl_basic_map_free(result
);
2116 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2122 i
= isl_basic_map_alloc_equality(bmap
);
2125 nparam
= isl_basic_map_n_param(bmap
);
2126 n_in
= isl_basic_map_n_in(bmap
);
2127 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2128 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2129 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2130 return isl_basic_map_finalize(bmap
);
2132 isl_basic_map_free(bmap
);
2136 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2142 i
= isl_basic_map_alloc_inequality(bmap
);
2145 nparam
= isl_basic_map_n_param(bmap
);
2146 n_in
= isl_basic_map_n_in(bmap
);
2147 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2148 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2149 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2150 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2151 return isl_basic_map_finalize(bmap
);
2153 isl_basic_map_free(bmap
);
2157 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2163 i
= isl_basic_map_alloc_inequality(bmap
);
2166 nparam
= isl_basic_map_n_param(bmap
);
2167 n_in
= isl_basic_map_n_in(bmap
);
2168 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2169 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2170 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2171 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2172 return isl_basic_map_finalize(bmap
);
2174 isl_basic_map_free(bmap
);
2178 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2181 struct isl_basic_map
*bmap
;
2182 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2185 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2186 bmap
= var_equal(bmap
, i
);
2187 return isl_basic_map_finalize(bmap
);
2190 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2193 struct isl_basic_map
*bmap
;
2194 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2197 for (i
= 0; i
< pos
&& bmap
; ++i
)
2198 bmap
= var_equal(bmap
, i
);
2200 bmap
= var_less(bmap
, pos
);
2201 return isl_basic_map_finalize(bmap
);
2204 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2207 struct isl_basic_map
*bmap
;
2208 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2211 for (i
= 0; i
< pos
&& bmap
; ++i
)
2212 bmap
= var_equal(bmap
, i
);
2214 bmap
= var_more(bmap
, pos
);
2215 return isl_basic_map_finalize(bmap
);
2218 struct isl_basic_map
*isl_basic_map_from_basic_set(
2219 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
2221 struct isl_basic_map
*bmap
;
2223 bset
= isl_basic_set_cow(bset
);
2227 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
2228 isl_dim_free(bset
->dim
);
2229 bmap
= (struct isl_basic_map
*) bset
;
2231 return isl_basic_map_finalize(bmap
);
2233 isl_basic_set_free(bset
);
2238 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
2242 if (bmap
->dim
->n_in
== 0)
2243 return (struct isl_basic_set
*)bmap
;
2244 bmap
= isl_basic_map_cow(bmap
);
2247 bmap
->dim
= isl_dim_cow(bmap
->dim
);
2250 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
2251 bmap
->dim
->n_in
= 0;
2252 bmap
= isl_basic_map_finalize(bmap
);
2253 return (struct isl_basic_set
*)bmap
;
2255 isl_basic_map_free(bmap
);
2259 /* For a div d = floor(f/m), add the constraints
2262 * -(f-(n-1)) + m d >= 0
2264 * Note that the second constraint is the negation of
2268 static int add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
2271 unsigned total
= isl_basic_map_total_dim(bmap
);
2272 unsigned div_pos
= 1 + total
- bmap
->n_div
+ div
;
2274 i
= isl_basic_map_alloc_inequality(bmap
);
2277 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
]+1, 1+total
);
2278 isl_int_neg(bmap
->ineq
[i
][div_pos
], bmap
->div
[div
][0]);
2280 j
= isl_basic_map_alloc_inequality(bmap
);
2283 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
2284 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][div_pos
]);
2285 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
2289 struct isl_basic_set
*isl_basic_map_underlying_set(
2290 struct isl_basic_map
*bmap
)
2294 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
2295 return (struct isl_basic_set
*)bmap
;
2296 bmap
= isl_basic_map_cow(bmap
);
2299 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
2302 bmap
->extra
-= bmap
->n_div
;
2304 bmap
= isl_basic_map_finalize(bmap
);
2305 return (struct isl_basic_set
*)bmap
;
2310 struct isl_basic_map
*isl_basic_map_overlying_set(
2311 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
2313 struct isl_basic_map
*bmap
;
2314 struct isl_ctx
*ctx
;
2321 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
2322 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
2323 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
2325 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
2326 isl_basic_map_free(like
);
2327 return (struct isl_basic_map
*)bset
;
2329 bset
= isl_basic_set_cow(bset
);
2332 total
= bset
->dim
->n_out
+ bset
->extra
;
2333 bmap
= (struct isl_basic_map
*)bset
;
2334 isl_dim_free(bmap
->dim
);
2335 bmap
->dim
= isl_dim_copy(like
->dim
);
2338 bmap
->n_div
= like
->n_div
;
2339 bmap
->extra
+= like
->n_div
;
2342 ltotal
= total
- bmap
->extra
+ like
->extra
;
2345 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
2346 bmap
->extra
* (1 + 1 + total
));
2347 if (isl_blk_is_error(bmap
->block2
))
2349 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
2353 for (i
= 0; i
< bmap
->extra
; ++i
)
2354 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
2355 for (i
= 0; i
< like
->n_div
; ++i
) {
2356 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
2357 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
2359 bmap
= isl_basic_map_extend_constraints(bmap
,
2360 0, 2 * like
->n_div
);
2361 for (i
= 0; i
< like
->n_div
; ++i
) {
2362 if (isl_int_is_zero(bmap
->div
[i
][0]))
2364 if (add_div_constraints(bmap
, i
) < 0)
2368 isl_basic_map_free(like
);
2369 bmap
= isl_basic_map_simplify(bmap
);
2370 bmap
= isl_basic_map_finalize(bmap
);
2373 isl_basic_map_free(like
);
2374 isl_basic_set_free(bset
);
2378 struct isl_basic_set
*isl_basic_set_from_underlying_set(
2379 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
2381 return (struct isl_basic_set
*)
2382 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
2385 struct isl_set
*isl_set_from_underlying_set(
2386 struct isl_set
*set
, struct isl_basic_set
*like
)
2392 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
2394 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
2395 isl_basic_set_free(like
);
2398 set
= isl_set_cow(set
);
2401 for (i
= 0; i
< set
->n
; ++i
) {
2402 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
2403 isl_basic_set_copy(like
));
2407 isl_dim_free(set
->dim
);
2408 set
->dim
= isl_dim_copy(like
->dim
);
2411 isl_basic_set_free(like
);
2414 isl_basic_set_free(like
);
2419 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
2423 map
= isl_map_cow(map
);
2426 map
->dim
= isl_dim_cow(map
->dim
);
2430 for (i
= 1; i
< map
->n
; ++i
)
2431 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
2433 for (i
= 0; i
< map
->n
; ++i
) {
2434 map
->p
[i
] = (struct isl_basic_map
*)
2435 isl_basic_map_underlying_set(map
->p
[i
]);
2440 map
->dim
= isl_dim_underlying(map
->dim
, 0);
2442 isl_dim_free(map
->dim
);
2443 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
2447 return (struct isl_set
*)map
;
2453 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
2455 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
2458 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
2460 struct isl_basic_set
*domain
;
2464 n_out
= isl_basic_map_n_out(bmap
);
2465 domain
= isl_basic_set_from_basic_map(bmap
);
2466 return isl_basic_set_project_out(domain
, n_out
, 0);
2469 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
2471 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
2474 struct isl_set
*isl_map_range(struct isl_map
*map
)
2477 struct isl_set
*set
;
2481 map
= isl_map_cow(map
);
2485 set
= (struct isl_set
*) map
;
2486 if (set
->dim
->n_in
!= 0) {
2487 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
2491 for (i
= 0; i
< map
->n
; ++i
) {
2492 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
2496 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
2497 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
2504 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
2507 struct isl_map
*map
= NULL
;
2509 set
= isl_set_cow(set
);
2512 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
2513 map
= (struct isl_map
*)set
;
2514 for (i
= 0; i
< set
->n
; ++i
) {
2515 map
->p
[i
] = isl_basic_map_from_basic_set(
2516 set
->p
[i
], isl_dim_copy(dim
));
2520 isl_dim_free(map
->dim
);
2529 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
2531 return (struct isl_map
*)set
;
2534 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
2537 struct isl_set
*set
= NULL
;
2541 map
= isl_map_cow(map
);
2544 map
->dim
= isl_dim_cow(map
->dim
);
2547 map
->dim
->n_out
+= map
->dim
->n_in
;
2549 set
= (struct isl_set
*)map
;
2550 for (i
= 0; i
< map
->n
; ++i
) {
2551 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
2561 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2563 struct isl_map
*map
;
2567 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
2568 map
= isl_alloc(dim
->ctx
, struct isl_map
,
2569 sizeof(struct isl_map
) +
2570 n
* sizeof(struct isl_basic_map
*));
2574 map
->ctx
= dim
->ctx
;
2575 isl_ctx_ref(map
->ctx
);
2587 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
2588 unsigned nparam
, unsigned in
, unsigned out
, int n
,
2591 struct isl_map
*map
;
2592 struct isl_dim
*dims
;
2594 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
2598 map
= isl_map_alloc_dim(dims
, n
, flags
);
2602 struct isl_basic_map
*isl_basic_map_empty(struct isl_ctx
*ctx
,
2603 unsigned nparam
, unsigned in
, unsigned out
)
2605 struct isl_basic_map
*bmap
;
2606 bmap
= isl_basic_map_alloc(ctx
, nparam
, in
, out
, 0, 1, 0);
2607 bmap
= isl_basic_map_set_to_empty(bmap
);
2611 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
2613 struct isl_basic_set
*bset
;
2614 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
2615 bset
= isl_basic_set_set_to_empty(bset
);
2619 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
2621 struct isl_basic_map
*bmap
;
2624 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2625 bmap
= isl_basic_map_set_to_empty(bmap
);
2629 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
2631 struct isl_basic_map
*bmap
;
2634 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2635 bmap
= isl_basic_map_set_to_empty(bmap
);
2639 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
2641 struct isl_basic_set
*bset
;
2644 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2645 bset
= isl_basic_set_set_to_empty(bset
);
2649 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
2651 struct isl_basic_map
*bmap
;
2652 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
2656 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
2658 struct isl_basic_set
*bset
;
2659 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
2663 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
2667 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2670 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
2672 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2675 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
2679 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2682 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
2686 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2689 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
2691 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2694 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
2698 return isl_set_empty(isl_dim_copy(model
->dim
));
2701 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
2703 struct isl_map
*map
;
2706 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2707 map
= isl_map_add(map
, isl_basic_map_universe(dim
));
2711 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
2713 struct isl_set
*set
;
2716 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2717 set
= isl_set_add(set
, isl_basic_set_universe(dim
));
2721 struct isl_map
*isl_map_dup(struct isl_map
*map
)
2724 struct isl_map
*dup
;
2728 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
2729 for (i
= 0; i
< map
->n
; ++i
)
2730 dup
= isl_map_add(dup
, isl_basic_map_copy(map
->p
[i
]));
2734 struct isl_map
*isl_map_add(struct isl_map
*map
, struct isl_basic_map
*bmap
)
2738 if (isl_basic_map_fast_is_empty(bmap
)) {
2739 isl_basic_map_free(bmap
);
2742 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
2743 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
2744 map
->p
[map
->n
] = bmap
;
2746 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2752 isl_basic_map_free(bmap
);
2756 void isl_map_free(struct isl_map
*map
)
2766 isl_ctx_deref(map
->ctx
);
2767 for (i
= 0; i
< map
->n
; ++i
)
2768 isl_basic_map_free(map
->p
[i
]);
2769 isl_dim_free(map
->dim
);
2773 struct isl_map
*isl_map_extend(struct isl_map
*base
,
2774 unsigned nparam
, unsigned n_in
, unsigned n_out
)
2778 base
= isl_map_cow(base
);
2782 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
2785 for (i
= 0; i
< base
->n
; ++i
) {
2786 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
2787 isl_dim_copy(base
->dim
), 0, 0, 0);
2797 struct isl_set
*isl_set_extend(struct isl_set
*base
,
2798 unsigned nparam
, unsigned dim
)
2800 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
2804 static struct isl_basic_map
*isl_basic_map_fix_pos(struct isl_basic_map
*bmap
,
2805 unsigned pos
, int value
)
2809 bmap
= isl_basic_map_cow(bmap
);
2810 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
2811 j
= isl_basic_map_alloc_equality(bmap
);
2814 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
2815 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
2816 isl_int_set_si(bmap
->eq
[j
][0], value
);
2817 bmap
= isl_basic_map_simplify(bmap
);
2818 return isl_basic_map_finalize(bmap
);
2820 isl_basic_map_free(bmap
);
2824 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
2825 enum isl_dim_type type
, unsigned pos
, int value
)
2829 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
2830 return isl_basic_map_fix_pos(bmap
, isl_basic_map_offset(bmap
, type
) + pos
,
2833 isl_basic_map_free(bmap
);
2837 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
2838 enum isl_dim_type type
, unsigned pos
, int value
)
2840 return (struct isl_basic_set
*)
2841 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2845 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
2846 unsigned input
, int value
)
2848 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
2851 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
2852 unsigned dim
, int value
)
2854 return (struct isl_basic_set
*)
2855 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2856 isl_dim_set
, dim
, value
);
2859 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
2860 enum isl_dim_type type
, unsigned pos
, int value
)
2864 map
= isl_map_cow(map
);
2868 isl_assert(ctx
, pos
< isl_map_dim(map
, type
), goto error
);
2869 for (i
= 0; i
< map
->n
; ++i
) {
2870 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
2874 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2881 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
2882 unsigned input
, int value
)
2884 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
2887 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
2889 return (struct isl_set
*)
2890 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
2893 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
2894 unsigned dim
, isl_int value
)
2899 bset
= isl_basic_set_cow(bset
);
2900 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
2901 j
= isl_basic_set_alloc_inequality(bset
);
2904 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
2905 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
2906 isl_int_neg(bset
->ineq
[j
][0], value
);
2907 bset
= isl_basic_set_simplify(bset
);
2908 return isl_basic_set_finalize(bset
);
2910 isl_basic_set_free(bset
);
2914 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
2919 set
= isl_set_cow(set
);
2923 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
2924 for (i
= 0; i
< set
->n
; ++i
) {
2925 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
2935 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
2940 map
= isl_map_cow(map
);
2944 map
->dim
= isl_dim_reverse(map
->dim
);
2947 for (i
= 0; i
< map
->n
; ++i
) {
2948 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
2952 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2959 static struct isl_map
*isl_basic_map_partial_lexopt(
2960 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2961 struct isl_set
**empty
, int max
)
2963 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
2966 struct isl_map
*isl_basic_map_partial_lexmax(
2967 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2968 struct isl_set
**empty
)
2970 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
2973 struct isl_map
*isl_basic_map_partial_lexmin(
2974 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2975 struct isl_set
**empty
)
2977 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
2980 struct isl_set
*isl_basic_set_partial_lexmin(
2981 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
2982 struct isl_set
**empty
)
2984 return (struct isl_set
*)
2985 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
2989 struct isl_set
*isl_basic_set_partial_lexmax(
2990 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
2991 struct isl_set
**empty
)
2993 return (struct isl_set
*)
2994 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
2998 struct isl_set
*isl_basic_set_lexmin(struct isl_basic_set
*bset
)
3000 struct isl_basic_map
*bmap
= NULL
;
3001 struct isl_basic_set
*dom
= NULL
;
3002 struct isl_map
*min
;
3003 struct isl_dim
*param_dim
;
3007 bmap
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
3010 param_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
3011 dom
= isl_basic_set_universe(param_dim
);
3014 min
= isl_basic_map_partial_lexmin(bmap
, dom
, NULL
);
3015 return isl_map_range(min
);
3017 isl_basic_map_free(bmap
);
3021 /* If bmap contains any unknown divs, then compute explicit
3022 * expressions for them. However, this computation may be
3023 * quite expensive, so first try to remove divs that aren't
3026 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
3033 off
= isl_dim_total(bmap
->dim
);
3034 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3035 if (isl_int_is_zero(bmap
->div
[i
][0]))
3037 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
3040 if (i
== bmap
->n_div
)
3041 return isl_map_from_basic_map(bmap
);
3042 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3045 for (i
= 0; i
< bmap
->n_div
; ++i
)
3046 if (isl_int_is_zero(bmap
->div
[i
][0]))
3048 if (i
== bmap
->n_div
)
3049 return isl_map_from_basic_map(bmap
);
3050 struct isl_map
*map
= isl_pip_basic_map_compute_divs(bmap
);
3053 isl_basic_map_free(bmap
);
3057 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
3060 struct isl_map
*res
;
3066 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
3067 for (i
= 1 ; i
< map
->n
; ++i
) {
3069 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
3070 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
3071 res
= isl_map_union_disjoint(res
, r2
);
3073 res
= isl_map_union(res
, r2
);
3080 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
3082 return (struct isl_set
*)
3083 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
3086 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
3088 return (struct isl_set
*)
3089 isl_map_compute_divs((struct isl_map
*)set
);
3092 struct isl_set
*isl_map_domain(struct isl_map
*map
)
3095 struct isl_set
*set
;
3100 map
= isl_map_cow(map
);
3104 set
= (struct isl_set
*)map
;
3105 set
->dim
= isl_dim_domain(set
->dim
);
3108 for (i
= 0; i
< map
->n
; ++i
) {
3109 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
3113 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3114 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3121 struct isl_map
*isl_map_union_disjoint(
3122 struct isl_map
*map1
, struct isl_map
*map2
)
3126 struct isl_map
*map
= NULL
;
3140 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3142 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3143 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3144 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3146 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3147 map1
->n
+ map2
->n
, flags
);
3150 for (i
= 0; i
< map1
->n
; ++i
) {
3151 map
= isl_map_add(map
,
3152 isl_basic_map_copy(map1
->p
[i
]));
3156 for (i
= 0; i
< map2
->n
; ++i
) {
3157 map
= isl_map_add(map
,
3158 isl_basic_map_copy(map2
->p
[i
]));
3172 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
3174 map1
= isl_map_union_disjoint(map1
, map2
);
3178 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
3182 struct isl_set
*isl_set_union_disjoint(
3183 struct isl_set
*set1
, struct isl_set
*set2
)
3185 return (struct isl_set
*)
3186 isl_map_union_disjoint(
3187 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3190 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
3192 return (struct isl_set
*)
3193 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3196 struct isl_map
*isl_map_intersect_range(
3197 struct isl_map
*map
, struct isl_set
*set
)
3200 struct isl_map
*result
;
3206 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
3207 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
3208 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3210 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
3211 map
->n
* set
->n
, flags
);
3214 for (i
= 0; i
< map
->n
; ++i
)
3215 for (j
= 0; j
< set
->n
; ++j
) {
3216 result
= isl_map_add(result
,
3217 isl_basic_map_intersect_range(
3218 isl_basic_map_copy(map
->p
[i
]),
3219 isl_basic_set_copy(set
->p
[j
])));
3232 struct isl_map
*isl_map_intersect_domain(
3233 struct isl_map
*map
, struct isl_set
*set
)
3235 return isl_map_reverse(
3236 isl_map_intersect_range(isl_map_reverse(map
), set
));
3239 struct isl_map
*isl_map_apply_domain(
3240 struct isl_map
*map1
, struct isl_map
*map2
)
3244 map1
= isl_map_reverse(map1
);
3245 map1
= isl_map_apply_range(map1
, map2
);
3246 return isl_map_reverse(map1
);
3253 struct isl_map
*isl_map_apply_range(
3254 struct isl_map
*map1
, struct isl_map
*map2
)
3256 struct isl_dim
*dim_result
;
3257 struct isl_map
*result
;
3266 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
3267 isl_dim_copy(map2
->dim
));
3269 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
3272 for (i
= 0; i
< map1
->n
; ++i
)
3273 for (j
= 0; j
< map2
->n
; ++j
) {
3274 result
= isl_map_add(result
,
3275 isl_basic_map_apply_range(
3276 isl_basic_map_copy(map1
->p
[i
]),
3277 isl_basic_map_copy(map2
->p
[j
])));
3283 if (result
&& result
->n
<= 1)
3284 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
3293 * returns range - domain
3295 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
3297 struct isl_basic_set
*bset
;
3304 dim
= isl_basic_map_n_in(bmap
);
3305 nparam
= isl_basic_map_n_param(bmap
);
3306 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
3307 bset
= isl_basic_set_from_basic_map(bmap
);
3308 bset
= isl_basic_set_cow(bset
);
3309 bset
= isl_basic_set_extend(bset
, nparam
, 3*dim
, 0, dim
, 0);
3310 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
3311 for (i
= 0; i
< dim
; ++i
) {
3312 int j
= isl_basic_map_alloc_equality(
3313 (struct isl_basic_map
*)bset
);
3316 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
3317 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
3318 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
3319 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
3321 return isl_basic_set_project_out(bset
, 2*dim
, 0);
3323 isl_basic_map_free(bmap
);
3328 * returns range - domain
3330 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
3333 struct isl_set
*result
;
3338 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
3339 result
= isl_set_alloc(map
->ctx
, isl_map_n_param(map
),
3340 isl_map_n_in(map
), map
->n
, map
->flags
);
3343 for (i
= 0; i
< map
->n
; ++i
)
3344 result
= isl_set_add(result
,
3345 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
3353 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
3355 struct isl_basic_map
*bmap
;
3363 nparam
= dims
->nparam
;
3365 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
3369 for (i
= 0; i
< dim
; ++i
) {
3370 int j
= isl_basic_map_alloc_equality(bmap
);
3373 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3374 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
3375 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
3377 return isl_basic_map_finalize(bmap
);
3379 isl_basic_map_free(bmap
);
3383 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
3385 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3388 return basic_map_identity(dim
);
3391 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
3393 if (!model
|| !model
->dim
)
3395 isl_assert(model
->ctx
,
3396 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3397 return basic_map_identity(isl_dim_copy(model
->dim
));
3400 static struct isl_map
*map_identity(struct isl_dim
*dim
)
3402 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
3403 return isl_map_add(map
, basic_map_identity(isl_dim_copy(dim
)));
3406 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
3408 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3411 return map_identity(dim
);
3414 struct isl_map
*isl_map_identity_like(struct isl_basic_map
*model
)
3416 if (!model
|| !model
->dim
)
3418 isl_assert(model
->ctx
,
3419 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3420 return map_identity(isl_dim_copy(model
->dim
));
3423 /* Construct a basic set with all set dimensions having only non-negative
3426 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
3431 struct isl_basic_set
*bset
;
3435 nparam
= dims
->nparam
;
3437 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
3440 for (i
= 0; i
< dim
; ++i
) {
3441 int k
= isl_basic_set_alloc_inequality(bset
);
3444 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
3445 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
3449 isl_basic_set_free(bset
);
3453 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
3455 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3458 int isl_set_is_subset(struct isl_set
*set1
, struct isl_set
*set2
)
3460 return isl_map_is_subset(
3461 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3464 int isl_basic_map_is_subset(
3465 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3468 struct isl_map
*map1
;
3469 struct isl_map
*map2
;
3471 if (!bmap1
|| !bmap2
)
3474 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
3475 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
3477 is_subset
= isl_map_is_subset(map1
, map2
);
3485 int isl_basic_map_is_equal(
3486 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3490 if (!bmap1
|| !bmap2
)
3492 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3495 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3499 int isl_basic_set_is_equal(
3500 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3502 return isl_basic_map_is_equal(
3503 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
3506 int isl_map_is_empty(struct isl_map
*map
)
3513 for (i
= 0; i
< map
->n
; ++i
) {
3514 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
3523 int isl_map_fast_is_empty(struct isl_map
*map
)
3528 int isl_set_is_empty(struct isl_set
*set
)
3530 return isl_map_is_empty((struct isl_map
*)set
);
3533 int isl_map_is_subset(struct isl_map
*map1
, struct isl_map
*map2
)
3537 struct isl_map
*diff
;
3542 if (isl_map_is_empty(map1
))
3545 if (isl_map_is_empty(map2
))
3548 diff
= isl_map_subtract(isl_map_copy(map1
), isl_map_copy(map2
));
3552 is_subset
= isl_map_is_empty(diff
);
3558 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
3564 is_subset
= isl_map_is_subset(map1
, map2
);
3567 is_subset
= isl_map_is_subset(map2
, map1
);
3571 int isl_basic_map_is_strict_subset(
3572 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3576 if (!bmap1
|| !bmap2
)
3578 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3581 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3582 if (is_subset
== -1)
3587 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
3591 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
3594 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
3598 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
3601 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
3603 struct isl_basic_set
*bset
= NULL
;
3604 struct isl_vec
*sample
= NULL
;
3611 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
3614 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
3615 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
3616 copy
= isl_basic_map_convex_hull(copy
);
3617 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
3618 isl_basic_map_free(copy
);
3622 total
= 1 + isl_basic_map_total_dim(bmap
);
3623 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
3624 int contains
= basic_map_contains(bmap
, bmap
->sample
);
3630 isl_vec_free(bmap
->sample
);
3631 bmap
->sample
= NULL
;
3632 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
3635 sample
= isl_basic_set_sample(bset
);
3638 empty
= sample
->size
== 0;
3639 isl_vec_free(bmap
->sample
);
3640 bmap
->sample
= sample
;
3642 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
3647 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
3651 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
3654 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
3658 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
3661 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
3663 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
3666 struct isl_map
*isl_basic_map_union(
3667 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3669 struct isl_map
*map
;
3670 if (!bmap1
|| !bmap2
)
3673 isl_assert(map1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3675 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
3678 map
= isl_map_add(map
, bmap1
);
3679 map
= isl_map_add(map
, bmap2
);
3682 isl_basic_map_free(bmap1
);
3683 isl_basic_map_free(bmap2
);
3687 struct isl_set
*isl_basic_set_union(
3688 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3690 return (struct isl_set
*)isl_basic_map_union(
3691 (struct isl_basic_map
*)bset1
,
3692 (struct isl_basic_map
*)bset2
);
3695 /* Order divs such that any div only depends on previous divs */
3696 static struct isl_basic_map
*order_divs(struct isl_basic_map
*bmap
)
3699 unsigned off
= isl_dim_total(bmap
->dim
);
3701 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3703 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
3707 swap_div(bmap
, i
, i
+ pos
);
3713 /* Look for a div in dst that corresponds to the div "div" in src.
3714 * The divs before "div" in src and dst are assumed to be the same.
3716 * Returns -1 if no corresponding div was found and the position
3717 * of the corresponding div in dst otherwise.
3719 static int find_div(struct isl_basic_map
*dst
,
3720 struct isl_basic_map
*src
, unsigned div
)
3724 unsigned total
= isl_dim_total(src
->dim
);
3726 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
3727 for (i
= div
; i
< dst
->n_div
; ++i
)
3728 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
3729 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
3730 dst
->n_div
- div
) == -1)
3735 struct isl_basic_map
*isl_basic_map_align_divs(
3736 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
3739 unsigned total
= isl_dim_total(src
->dim
);
3744 if (src
->n_div
== 0)
3747 for (i
= 0; i
< src
->n_div
; ++i
)
3748 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
3750 src
= order_divs(src
);
3751 dst
= isl_basic_map_cow(dst
);
3752 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
3753 src
->n_div
, 0, 2 * src
->n_div
);
3756 for (i
= 0; i
< src
->n_div
; ++i
) {
3757 int j
= find_div(dst
, src
, i
);
3759 j
= isl_basic_map_alloc_div(dst
);
3762 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
3763 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
3764 if (add_div_constraints(dst
, j
) < 0)
3768 swap_div(dst
, i
, j
);
3772 isl_basic_map_free(dst
);
3776 struct isl_basic_set
*isl_basic_set_align_divs(
3777 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
3779 return (struct isl_basic_set
*)isl_basic_map_align_divs(
3780 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
3783 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
3787 map
= isl_map_compute_divs(map
);
3788 map
= isl_map_cow(map
);
3792 for (i
= 1; i
< map
->n
; ++i
)
3793 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
3794 for (i
= 1; i
< map
->n
; ++i
)
3795 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
3797 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3801 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
3803 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
3806 static struct isl_map
*add_cut_constraint(struct isl_map
*dst
,
3807 struct isl_basic_map
*src
, isl_int
*c
,
3808 unsigned len
, int oppose
)
3810 struct isl_basic_map
*copy
= NULL
;
3815 copy
= isl_basic_map_copy(src
);
3816 copy
= isl_basic_map_cow(copy
);
3819 copy
= isl_basic_map_extend_constraints(copy
, 0, 1);
3820 k
= isl_basic_map_alloc_inequality(copy
);
3824 isl_seq_neg(copy
->ineq
[k
], c
, len
);
3826 isl_seq_cpy(copy
->ineq
[k
], c
, len
);
3827 total
= 1 + isl_basic_map_total_dim(copy
);
3828 isl_seq_clr(copy
->ineq
[k
]+len
, total
- len
);
3829 isl_inequality_negate(copy
, k
);
3830 copy
= isl_basic_map_simplify(copy
);
3831 copy
= isl_basic_map_finalize(copy
);
3832 is_empty
= isl_basic_map_is_empty(copy
);
3836 dst
= isl_map_add(dst
, copy
);
3838 isl_basic_map_free(copy
);
3841 isl_basic_map_free(copy
);
3846 static struct isl_map
*subtract(struct isl_map
*map
, struct isl_basic_map
*bmap
)
3850 struct isl_map
*rest
= NULL
;
3852 unsigned total
= isl_basic_map_total_dim(bmap
);
3859 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
3860 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3862 max
= map
->n
* (2 * bmap
->n_eq
+ bmap
->n_ineq
);
3863 rest
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), max
, flags
);
3867 for (i
= 0; i
< map
->n
; ++i
) {
3868 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], bmap
);
3873 for (j
= 0; j
< map
->n
; ++j
)
3874 map
->p
[j
] = isl_basic_map_cow(map
->p
[j
]);
3876 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3877 for (j
= 0; j
< map
->n
; ++j
) {
3878 rest
= add_cut_constraint(rest
,
3879 map
->p
[j
], bmap
->eq
[i
], 1+total
, 0);
3883 rest
= add_cut_constraint(rest
,
3884 map
->p
[j
], bmap
->eq
[i
], 1+total
, 1);
3888 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
3892 k
= isl_basic_map_alloc_equality(map
->p
[j
]);
3895 isl_seq_cpy(map
->p
[j
]->eq
[k
], bmap
->eq
[i
], 1+total
);
3896 isl_seq_clr(map
->p
[j
]->eq
[k
]+1+total
,
3897 map
->p
[j
]->n_div
- bmap
->n_div
);
3901 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3902 for (j
= 0; j
< map
->n
; ++j
) {
3903 rest
= add_cut_constraint(rest
,
3904 map
->p
[j
], bmap
->ineq
[i
], 1+total
, 0);
3908 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
3912 k
= isl_basic_map_alloc_inequality(map
->p
[j
]);
3915 isl_seq_cpy(map
->p
[j
]->ineq
[k
], bmap
->ineq
[i
], 1+total
);
3916 isl_seq_clr(map
->p
[j
]->ineq
[k
]+1+total
,
3917 map
->p
[j
]->n_div
- bmap
->n_div
);
3929 struct isl_map
*isl_map_subtract(struct isl_map
*map1
, struct isl_map
*map2
)
3935 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3937 if (isl_map_is_empty(map2
)) {
3942 map1
= isl_map_compute_divs(map1
);
3943 map2
= isl_map_compute_divs(map2
);
3947 for (i
= 0; map1
&& i
< map2
->n
; ++i
)
3948 map1
= subtract(map1
, map2
->p
[i
]);
3958 struct isl_set
*isl_set_subtract(struct isl_set
*set1
, struct isl_set
*set2
)
3960 return (struct isl_set
*)
3962 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3965 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
3969 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
3970 map
= isl_map_intersect_domain(map
, set
);
3971 set
= isl_map_range(map
);
3979 /* There is no need to cow as removing empty parts doesn't change
3980 * the meaning of the set.
3982 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
3989 for (i
= map
->n
-1; i
>= 0; --i
) {
3990 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
3992 isl_basic_map_free(map
->p
[i
]);
3993 if (i
!= map
->n
-1) {
3994 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3995 map
->p
[i
] = map
->p
[map
->n
-1];
4003 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
4005 return (struct isl_set
*)
4006 isl_map_remove_empty_parts((struct isl_map
*)set
);
4009 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
4011 struct isl_basic_map
*bmap
;
4012 if (!map
|| map
->n
== 0)
4014 bmap
= map
->p
[map
->n
-1];
4015 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
4016 return isl_basic_map_copy(bmap
);
4019 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
4021 (struct isl_basic_set
*)isl_map_copy_basic_map((struct isl_map
*)set
);
4024 struct isl_map
*isl_map_drop_basic_map(struct isl_map
*map
,
4025 struct isl_basic_map
*bmap
)
4031 for (i
= map
->n
-1; i
>= 0; --i
) {
4032 if (map
->p
[i
] != bmap
)
4034 map
= isl_map_cow(map
);
4037 isl_basic_map_free(map
->p
[i
]);
4038 if (i
!= map
->n
-1) {
4039 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
4040 map
->p
[i
] = map
->p
[map
->n
-1];
4045 isl_basic_map_free(bmap
);
4049 isl_basic_map_free(bmap
);
4053 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
4054 struct isl_basic_set
*bset
)
4056 (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
4057 (struct isl_basic_map
*)bset
);
4060 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4061 * for any common value of the parameters and dimensions preceding dim
4062 * in both basic sets, the values of dimension pos in bset1 are
4063 * smaller or larger than those in bset2.
4066 * 1 if bset1 follows bset2
4067 * -1 if bset1 precedes bset2
4068 * 0 if bset1 and bset2 are incomparable
4069 * -2 if some error occurred.
4071 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
4072 struct isl_basic_set
*bset2
, int pos
)
4074 struct isl_dim
*dims
;
4075 struct isl_basic_map
*bmap1
= NULL
;
4076 struct isl_basic_map
*bmap2
= NULL
;
4077 struct isl_ctx
*ctx
;
4078 struct isl_vec
*obj
;
4081 unsigned dim1
, dim2
;
4083 enum isl_lp_result res
;
4086 if (!bset1
|| !bset2
)
4089 nparam
= isl_basic_set_n_param(bset1
);
4090 dim1
= isl_basic_set_n_dim(bset1
);
4091 dim2
= isl_basic_set_n_dim(bset2
);
4092 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
4093 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
4094 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
4095 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
4096 if (!bmap1
|| !bmap2
)
4098 bmap1
= isl_basic_map_cow(bmap1
);
4099 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
4100 pos
, (dim1
- pos
) + (dim2
- pos
),
4101 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
4102 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
4105 total
= isl_basic_map_total_dim(bmap1
);
4107 obj
= isl_vec_alloc(ctx
, 1 + total
);
4108 isl_seq_clr(obj
->block
.data
, 1 + total
);
4109 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
4110 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
4115 res
= isl_solve_lp(bmap1
, 0, obj
->block
.data
, ctx
->one
, &num
, &den
);
4116 if (res
== isl_lp_empty
)
4118 else if (res
== isl_lp_ok
&& isl_int_is_pos(num
))
4120 else if ((res
== isl_lp_ok
&& isl_int_is_neg(num
)) ||
4121 res
== isl_lp_unbounded
)
4127 isl_basic_map_free(bmap1
);
4131 isl_basic_map_free(bmap1
);
4132 isl_basic_map_free(bmap2
);
4136 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
4137 unsigned pos
, isl_int
*val
)
4145 total
= isl_basic_map_total_dim(bmap
);
4146 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
4147 for (; d
+1 > pos
; --d
)
4148 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
4152 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
4154 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
4156 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
4159 isl_int_neg(*val
, bmap
->eq
[i
][0]);
4165 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
4166 unsigned pos
, isl_int
*val
)
4178 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
4181 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
4182 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
4183 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
4184 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4188 isl_int_set(*val
, v
);
4194 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
4195 unsigned pos
, isl_int
*val
)
4197 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
4201 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
4204 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
4207 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
4208 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
4210 if (pos
>= isl_basic_map_dim(bmap
, type
))
4212 return isl_basic_map_fast_has_fixed_var(bmap
,
4213 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
4216 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4217 * then return this fixed value in *val.
4219 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
4222 return isl_basic_set_fast_has_fixed_var(bset
,
4223 isl_basic_set_n_param(bset
) + dim
, val
);
4226 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4227 * then return this fixed value in *val.
4229 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
4231 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
4234 /* Check if input variable in has fixed value and if so and if val is not NULL,
4235 * then return this fixed value in *val.
4237 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
4239 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
4242 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4243 * and if val is not NULL, then return this lower bound in *val.
4245 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
4246 unsigned dim
, isl_int
*val
)
4248 int i
, i_eq
= -1, i_ineq
= -1;
4255 total
= isl_basic_set_total_dim(bset
);
4256 nparam
= isl_basic_set_n_param(bset
);
4257 for (i
= 0; i
< bset
->n_eq
; ++i
) {
4258 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
4264 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
4265 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
4267 if (i_eq
!= -1 || i_ineq
!= -1)
4271 if (i_eq
== -1 && i_ineq
== -1)
4273 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
4274 /* The coefficient should always be one due to normalization. */
4275 if (!isl_int_is_one(c
[1+nparam
+dim
]))
4277 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
4279 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
4280 total
- nparam
- dim
- 1) != -1)
4283 isl_int_neg(*val
, c
[0]);
4287 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
4288 unsigned dim
, isl_int
*val
)
4300 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4304 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4306 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
4307 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
4309 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4313 isl_int_set(*val
, v
);
4324 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
4326 const struct constraint
*c1
= (const struct constraint
*)p1
;
4327 const struct constraint
*c2
= (const struct constraint
*)p2
;
4328 unsigned size
= isl_min(c1
->size
, c2
->size
);
4329 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
4332 static struct isl_basic_map
*isl_basic_map_sort_constraints(
4333 struct isl_basic_map
*bmap
)
4336 struct constraint
*c
;
4341 total
= isl_basic_map_total_dim(bmap
);
4342 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
4345 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4347 c
[i
].c
= bmap
->ineq
[i
];
4349 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
4350 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4351 bmap
->ineq
[i
] = c
[i
].c
;
4355 isl_basic_map_free(bmap
);
4359 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
4363 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
4365 bmap
= isl_basic_map_convex_hull(bmap
);
4366 bmap
= isl_basic_map_sort_constraints(bmap
);
4367 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4371 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
4373 return (struct isl_basic_set
*)isl_basic_map_normalize(
4374 (struct isl_basic_map
*)bset
);
4377 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
4378 const struct isl_basic_map
*bmap2
)
4385 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
4386 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
4387 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
4388 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4389 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
4390 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4391 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
4392 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4394 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
4396 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4398 if (bmap1
->n_eq
!= bmap2
->n_eq
)
4399 return bmap1
->n_eq
- bmap2
->n_eq
;
4400 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
4401 return bmap1
->n_ineq
- bmap2
->n_ineq
;
4402 if (bmap1
->n_div
!= bmap2
->n_div
)
4403 return bmap1
->n_div
- bmap2
->n_div
;
4404 total
= isl_basic_map_total_dim(bmap1
);
4405 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
4406 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
4410 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
4411 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
4415 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
4416 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
4423 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
4424 struct isl_basic_map
*bmap2
)
4426 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
4429 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
4431 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
4432 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
4434 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
4437 /* We normalize in place, but if anything goes wrong we need
4438 * to return NULL, so we need to make sure we don't change the
4439 * meaning of any possible other copies of map.
4441 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
4444 struct isl_basic_map
*bmap
;
4448 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
4450 for (i
= 0; i
< map
->n
; ++i
) {
4451 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
4454 isl_basic_map_free(map
->p
[i
]);
4457 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
4458 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
4459 map
= isl_map_remove_empty_parts(map
);
4462 for (i
= map
->n
- 1; i
>= 1; --i
) {
4463 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
4465 isl_basic_map_free(map
->p
[i
-1]);
4466 for (j
= i
; j
< map
->n
; ++j
)
4467 map
->p
[j
-1] = map
->p
[j
];
4477 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
4479 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
4482 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
4492 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
4495 map1
= isl_map_copy(map1
);
4496 map2
= isl_map_copy(map2
);
4497 map1
= isl_map_normalize(map1
);
4498 map2
= isl_map_normalize(map2
);
4501 equal
= map1
->n
== map2
->n
;
4502 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
4503 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
4516 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
4518 return isl_map_fast_is_equal((struct isl_map
*)set1
,
4519 (struct isl_map
*)set2
);
4522 /* Return an interval that ranges from min to max (inclusive)
4524 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
4525 isl_int min
, isl_int max
)
4528 struct isl_basic_set
*bset
= NULL
;
4530 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
4534 k
= isl_basic_set_alloc_inequality(bset
);
4537 isl_int_set_si(bset
->ineq
[k
][1], 1);
4538 isl_int_neg(bset
->ineq
[k
][0], min
);
4540 k
= isl_basic_set_alloc_inequality(bset
);
4543 isl_int_set_si(bset
->ineq
[k
][1], -1);
4544 isl_int_set(bset
->ineq
[k
][0], max
);
4548 isl_basic_set_free(bset
);
4552 /* Return the Cartesian product of the basic sets in list (in the given order).
4554 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
4562 struct isl_basic_set
*product
= NULL
;
4566 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
4567 isl_assert(list
->ctx
, list
->p
[0], goto error
);
4568 nparam
= isl_basic_set_n_param(list
->p
[0]);
4569 dim
= isl_basic_set_n_dim(list
->p
[0]);
4570 extra
= list
->p
[0]->n_div
;
4571 n_eq
= list
->p
[0]->n_eq
;
4572 n_ineq
= list
->p
[0]->n_ineq
;
4573 for (i
= 1; i
< list
->n
; ++i
) {
4574 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
4575 isl_assert(list
->ctx
,
4576 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
4577 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4578 extra
+= list
->p
[i
]->n_div
;
4579 n_eq
+= list
->p
[i
]->n_eq
;
4580 n_ineq
+= list
->p
[i
]->n_ineq
;
4582 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
4587 for (i
= 0; i
< list
->n
; ++i
) {
4588 isl_basic_set_add_constraints(product
,
4589 isl_basic_set_copy(list
->p
[i
]), dim
);
4590 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4592 isl_basic_set_list_free(list
);
4595 isl_basic_set_free(product
);
4596 isl_basic_set_list_free(list
);
4600 struct isl_basic_map
*isl_basic_map_product(
4601 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4603 struct isl_dim
*dim_result
= NULL
;
4604 struct isl_basic_map
*bmap
;
4605 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
4606 struct isl_dim_map
*dim_map1
, *dim_map2
;
4608 if (!bmap1
|| !bmap2
)
4611 isl_assert(map1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
4612 bmap2
->dim
, isl_dim_param
), goto error
);
4613 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
4614 isl_dim_copy(bmap2
->dim
));
4616 in1
= isl_basic_map_n_in(bmap1
);
4617 in2
= isl_basic_map_n_in(bmap2
);
4618 out1
= isl_basic_map_n_out(bmap1
);
4619 out2
= isl_basic_map_n_out(bmap2
);
4620 nparam
= isl_basic_map_n_param(bmap1
);
4622 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
4623 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4624 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4625 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4626 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4627 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4628 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
4629 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
4630 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
4631 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
4632 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4634 bmap
= isl_basic_map_alloc_dim(dim_result
,
4635 bmap1
->n_div
+ bmap2
->n_div
,
4636 bmap1
->n_eq
+ bmap2
->n_eq
,
4637 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4638 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4639 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4640 bmap
= isl_basic_map_simplify(bmap
);
4641 return isl_basic_map_finalize(bmap
);
4643 isl_basic_map_free(bmap1
);
4644 isl_basic_map_free(bmap2
);
4648 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4650 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
4653 struct isl_map
*result
;
4659 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
4660 map2
->dim
, isl_dim_param
), goto error
);
4662 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
4663 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
4664 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4666 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
4667 isl_dim_copy(map2
->dim
)),
4668 map1
->n
* map2
->n
, flags
);
4671 for (i
= 0; i
< map1
->n
; ++i
)
4672 for (j
= 0; j
< map2
->n
; ++j
) {
4673 struct isl_basic_map
*part
;
4674 part
= isl_basic_map_product(
4675 isl_basic_map_copy(map1
->p
[i
]),
4676 isl_basic_map_copy(map2
->p
[j
]));
4677 if (isl_basic_map_is_empty(part
))
4678 isl_basic_map_free(part
);
4680 result
= isl_map_add(result
, part
);
4693 /* Given two set A and B, construct its Cartesian product A x B.
4695 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
4697 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
4698 (struct isl_map
*)set2
);
4701 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
4709 bset
= isl_basic_set_copy(bset
);
4710 bset
= isl_basic_set_normalize(bset
);
4713 total
= isl_basic_set_total_dim(bset
);
4714 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
4715 for (i
= 0; i
< bset
->n_eq
; ++i
) {
4717 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
4718 isl_hash_hash(hash
, c_hash
);
4720 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
4721 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
4723 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
4724 isl_hash_hash(hash
, c_hash
);
4726 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
4727 for (i
= 0; i
< bset
->n_div
; ++i
) {
4729 if (isl_int_is_zero(bset
->div
[i
][0]))
4731 isl_hash_byte(hash
, i
& 0xFF);
4732 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
4733 isl_hash_hash(hash
, c_hash
);
4735 isl_basic_set_free(bset
);
4739 uint32_t isl_set_get_hash(struct isl_set
*set
)
4746 set
= isl_set_copy(set
);
4747 set
= isl_set_normalize(set
);
4751 hash
= isl_hash_init();
4752 for (i
= 0; i
< set
->n
; ++i
) {
4754 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
4755 isl_hash_hash(hash
, bset_hash
);
4763 /* Check if the value for dimension dim is completely determined
4764 * by the values of the other parameters and variables.
4765 * That is, check if dimension dim is involved in an equality.
4767 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
4774 nparam
= isl_basic_set_n_param(bset
);
4775 for (i
= 0; i
< bset
->n_eq
; ++i
)
4776 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
4781 /* Check if the value for dimension dim is completely determined
4782 * by the values of the other parameters and variables.
4783 * That is, check if dimension dim is involved in an equality
4784 * for each of the subsets.
4786 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
4792 for (i
= 0; i
< set
->n
; ++i
) {
4794 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);