6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
18 /* Maps dst positions to src positions */
24 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
27 struct isl_dim_map
*dim_map
;
28 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
29 sizeof(struct isl_dim_map
) + len
* sizeof(int));
32 dim_map
->len
= 1 + len
;
34 for (i
= 0; i
< len
; ++i
)
35 dim_map
->pos
[1 + i
] = -1;
39 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
42 case isl_dim_param
: return dim
->nparam
;
43 case isl_dim_in
: return dim
->n_in
;
44 case isl_dim_out
: return dim
->n_out
;
45 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
49 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
52 case isl_dim_param
: return 1;
53 case isl_dim_in
: return 1 + dim
->nparam
;
54 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
58 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
59 enum isl_dim_type type
, unsigned dst_pos
)
67 src_pos
= pos(dim
, type
);
68 for (i
= 0; i
< n(dim
, type
); ++i
)
69 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
72 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
73 struct isl_basic_map
*bmap
, unsigned dst_pos
)
78 if (!dim_map
|| !bmap
)
81 src_pos
= 1 + isl_dim_total(bmap
->dim
);
82 for (i
= 0; i
< bmap
->n_div
; ++i
)
83 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
86 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
90 for (i
= 0; i
< dim_map
->len
; ++i
)
91 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
92 fprintf(stderr
, "\n");
95 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
96 enum isl_dim_type type
)
101 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
102 case isl_dim_div
: return bmap
->n_div
;
103 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
107 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
109 return n(map
->dim
, type
);
112 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
114 return n(set
->dim
, type
);
117 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
118 enum isl_dim_type type
)
120 struct isl_dim
*dim
= bmap
->dim
;
122 case isl_dim_param
: return 1;
123 case isl_dim_in
: return 1 + dim
->nparam
;
124 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
125 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
129 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
131 return pos(map
->dim
, type
);
134 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
135 enum isl_dim_type type
)
137 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
140 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
142 return bset
->dim
->n_out
;
145 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
147 return bset
->dim
->nparam
;
150 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
152 return isl_dim_total(bset
->dim
) + bset
->n_div
;
155 unsigned isl_set_n_dim(const struct isl_set
*set
)
157 return set
->dim
->n_out
;
160 unsigned isl_set_n_param(const struct isl_set
*set
)
162 return set
->dim
->nparam
;
165 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
167 return bmap
->dim
->n_in
;
170 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
172 return bmap
->dim
->n_out
;
175 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
177 return bmap
->dim
->nparam
;
180 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
185 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
187 return isl_dim_total(bmap
->dim
) + bmap
->n_div
;
190 unsigned isl_map_n_in(const struct isl_map
*map
)
192 return map
->dim
->n_in
;
195 unsigned isl_map_n_out(const struct isl_map
*map
)
197 return map
->dim
->n_out
;
200 unsigned isl_map_n_param(const struct isl_map
*map
)
202 return map
->dim
->nparam
;
205 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
207 return map
->dim
->n_in
== set
->dim
->n_out
&&
208 map
->dim
->nparam
== set
->dim
->nparam
;
211 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
212 struct isl_basic_set
*bset
)
214 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
215 bmap
->dim
->nparam
== bset
->dim
->nparam
;
218 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
219 struct isl_basic_set
*bset
)
221 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
222 bmap
->dim
->nparam
== bset
->dim
->nparam
;
225 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
229 return isl_dim_copy(bmap
->dim
);
232 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
236 return isl_dim_copy(bset
->dim
);
239 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
243 return isl_dim_copy(map
->dim
);
246 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
250 return isl_dim_copy(set
->dim
);
253 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
254 struct isl_basic_map
*bmap
, unsigned extra
,
255 unsigned n_eq
, unsigned n_ineq
)
258 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
260 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
261 if (isl_blk_is_error(bmap
->block
)) {
266 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
268 isl_blk_free(ctx
, bmap
->block
);
274 bmap
->block2
= isl_blk_empty();
277 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
278 if (isl_blk_is_error(bmap
->block2
)) {
280 isl_blk_free(ctx
, bmap
->block
);
285 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
287 isl_blk_free(ctx
, bmap
->block2
);
289 isl_blk_free(ctx
, bmap
->block
);
295 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
296 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
298 for (i
= 0; i
< extra
; ++i
)
299 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
305 bmap
->c_size
= n_eq
+ n_ineq
;
306 bmap
->eq
= bmap
->ineq
+ n_ineq
;
315 isl_basic_map_free(bmap
);
319 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
320 unsigned nparam
, unsigned dim
, unsigned extra
,
321 unsigned n_eq
, unsigned n_ineq
)
323 struct isl_basic_map
*bmap
;
324 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
325 return (struct isl_basic_set
*)bmap
;
328 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
329 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
331 struct isl_basic_map
*bmap
;
334 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
335 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
336 return (struct isl_basic_set
*)bmap
;
339 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
340 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
342 struct isl_basic_map
*bmap
;
346 bmap
= isl_alloc_type(dim
->ctx
, struct isl_basic_map
);
351 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
357 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
358 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
359 unsigned n_eq
, unsigned n_ineq
)
361 struct isl_basic_map
*bmap
;
364 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
368 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
372 static void dup_constraints(
373 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
376 unsigned total
= isl_basic_map_total_dim(src
);
378 for (i
= 0; i
< src
->n_eq
; ++i
) {
379 int j
= isl_basic_map_alloc_equality(dst
);
380 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
383 for (i
= 0; i
< src
->n_ineq
; ++i
) {
384 int j
= isl_basic_map_alloc_inequality(dst
);
385 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
388 for (i
= 0; i
< src
->n_div
; ++i
) {
389 int j
= isl_basic_map_alloc_div(dst
);
390 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
392 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
395 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
397 struct isl_basic_map
*dup
;
401 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
402 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
405 dup_constraints(dup
, bmap
);
406 dup
->flags
= bmap
->flags
;
407 dup
->sample
= isl_vec_copy(bmap
->sample
);
411 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
413 struct isl_basic_map
*dup
;
415 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
416 return (struct isl_basic_set
*)dup
;
419 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
424 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
428 return isl_basic_set_dup(bset
);
431 struct isl_set
*isl_set_copy(struct isl_set
*set
)
440 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
445 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
449 return isl_basic_map_dup(bmap
);
452 struct isl_map
*isl_map_copy(struct isl_map
*map
)
461 void isl_basic_map_free(struct isl_basic_map
*bmap
)
469 isl_ctx_deref(bmap
->ctx
);
471 isl_blk_free(bmap
->ctx
, bmap
->block2
);
473 isl_blk_free(bmap
->ctx
, bmap
->block
);
474 isl_vec_free(bmap
->sample
);
475 isl_dim_free(bmap
->dim
);
479 void isl_basic_set_free(struct isl_basic_set
*bset
)
481 isl_basic_map_free((struct isl_basic_map
*)bset
);
484 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
486 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
489 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
495 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
496 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
498 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
499 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
500 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
501 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
502 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
503 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
505 int j
= isl_basic_map_alloc_inequality(bmap
);
509 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
510 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
517 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
518 bmap
->extra
- bmap
->n_div
);
522 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
524 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
527 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
531 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
536 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
538 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
541 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
546 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
548 if (pos
!= bmap
->n_eq
- 1) {
550 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
551 bmap
->eq
[bmap
->n_eq
- 1] = t
;
557 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
559 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
562 void isl_basic_map_inequality_to_equality(
563 struct isl_basic_map
*bmap
, unsigned pos
)
568 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
569 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
574 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
575 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
576 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
577 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
580 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
582 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
585 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
591 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
592 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
593 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
594 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
595 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
596 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
597 1 + isl_basic_map_total_dim(bmap
),
598 bmap
->extra
- bmap
->n_div
);
599 return bmap
->n_ineq
++;
602 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
604 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
607 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
611 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
616 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
618 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
621 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
626 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
628 if (pos
!= bmap
->n_ineq
- 1) {
630 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
631 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
632 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
638 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
640 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
643 __isl_give isl_basic_map
*isl_basic_map_add_eq(__isl_take isl_basic_map
*bmap
,
648 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
651 k
= isl_basic_map_alloc_equality(bmap
);
654 isl_seq_cpy(bmap
->eq
[k
], eq
, 1 + isl_basic_map_total_dim(bmap
));
657 isl_basic_map_free(bmap
);
661 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
664 return (isl_basic_set
*)
665 isl_basic_map_add_eq((isl_basic_map
*)bset
, eq
);
668 __isl_give isl_basic_map
*isl_basic_map_add_ineq(__isl_take isl_basic_map
*bmap
,
673 bmap
= isl_basic_map_extend_constraints(bmap
, 0, 1);
676 k
= isl_basic_map_alloc_inequality(bmap
);
679 isl_seq_cpy(bmap
->ineq
[k
], ineq
, 1 + isl_basic_map_total_dim(bmap
));
682 isl_basic_map_free(bmap
);
686 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
689 return (isl_basic_set
*)
690 isl_basic_map_add_ineq((isl_basic_map
*)bset
, ineq
);
693 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
697 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
698 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
699 1 + 1 + isl_basic_map_total_dim(bmap
),
700 bmap
->extra
- bmap
->n_div
);
701 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
702 return bmap
->n_div
++;
705 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
707 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
710 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
714 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
719 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
721 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
724 /* Copy constraint from src to dst, putting the vars of src at offset
725 * dim_off in dst and the divs of src at offset div_off in dst.
726 * If both sets are actually map, then dim_off applies to the input
729 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
730 struct isl_basic_map
*src_map
, isl_int
*src
,
731 unsigned in_off
, unsigned out_off
, unsigned div_off
)
733 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
734 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
735 unsigned src_in
= isl_basic_map_n_in(src_map
);
736 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
737 unsigned src_out
= isl_basic_map_n_out(src_map
);
738 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
739 isl_int_set(dst
[0], src
[0]);
740 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
741 if (dst_nparam
> src_nparam
)
742 isl_seq_clr(dst
+1+src_nparam
,
743 dst_nparam
- src_nparam
);
744 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
745 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
747 isl_min(dst_in
-in_off
, src_in
));
748 if (dst_in
-in_off
> src_in
)
749 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
750 dst_in
- in_off
- src_in
);
751 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
752 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
753 src
+1+src_nparam
+src_in
,
754 isl_min(dst_out
-out_off
, src_out
));
755 if (dst_out
-out_off
> src_out
)
756 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
757 dst_out
- out_off
- src_out
);
758 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
759 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
760 src
+1+src_nparam
+src_in
+src_out
,
761 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
762 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
763 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
764 div_off
+src_map
->n_div
,
765 dst_map
->n_div
- div_off
- src_map
->n_div
);
768 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
769 struct isl_basic_map
*src_map
, isl_int
*src
,
770 unsigned in_off
, unsigned out_off
, unsigned div_off
)
772 isl_int_set(dst
[0], src
[0]);
773 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
776 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
777 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
782 if (!bmap1
|| !bmap2
)
785 div_off
= bmap1
->n_div
;
787 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
788 int i1
= isl_basic_map_alloc_equality(bmap1
);
791 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
792 i_pos
, o_pos
, div_off
);
795 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
796 int i1
= isl_basic_map_alloc_inequality(bmap1
);
799 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
800 i_pos
, o_pos
, div_off
);
803 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
804 int i1
= isl_basic_map_alloc_div(bmap1
);
807 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
808 i_pos
, o_pos
, div_off
);
811 isl_basic_map_free(bmap2
);
816 isl_basic_map_free(bmap1
);
817 isl_basic_map_free(bmap2
);
821 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
822 struct isl_dim_map
*dim_map
)
826 for (i
= 0; i
< dim_map
->len
; ++i
) {
827 if (dim_map
->pos
[i
] < 0)
828 isl_int_set_si(dst
[i
], 0);
830 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
834 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
835 struct isl_dim_map
*dim_map
)
837 isl_int_set(dst
[0], src
[0]);
838 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
841 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
842 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
846 if (!src
|| !dst
|| !dim_map
)
849 for (i
= 0; i
< src
->n_eq
; ++i
) {
850 int i1
= isl_basic_map_alloc_equality(dst
);
853 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
856 for (i
= 0; i
< src
->n_ineq
; ++i
) {
857 int i1
= isl_basic_map_alloc_inequality(dst
);
860 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
863 for (i
= 0; i
< src
->n_div
; ++i
) {
864 int i1
= isl_basic_map_alloc_div(dst
);
867 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
871 isl_basic_map_free(src
);
876 isl_basic_map_free(src
);
877 isl_basic_map_free(dst
);
881 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
882 struct isl_basic_set
*bset2
, unsigned pos
)
884 return (struct isl_basic_set
*)
885 add_constraints((struct isl_basic_map
*)bset1
,
886 (struct isl_basic_map
*)bset2
, 0, pos
);
889 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
890 struct isl_dim
*dim
, unsigned extra
,
891 unsigned n_eq
, unsigned n_ineq
)
893 struct isl_basic_map
*ext
;
903 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
904 base
->extra
>= base
->n_div
+ extra
;
906 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
907 room_for_ineq(base
, n_ineq
)) {
912 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
913 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
914 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
915 extra
+= base
->extra
;
917 n_ineq
+= base
->n_ineq
;
919 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
925 ext
->sample
= isl_vec_copy(base
->sample
);
927 ext
= add_constraints(ext
, base
, 0, 0);
930 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
937 isl_basic_map_free(base
);
941 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
942 struct isl_dim
*dim
, unsigned extra
,
943 unsigned n_eq
, unsigned n_ineq
)
945 return (struct isl_basic_set
*)
946 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
947 extra
, n_eq
, n_ineq
);
950 struct isl_basic_map
*isl_basic_map_extend_constraints(
951 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
955 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
959 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
960 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
961 unsigned n_eq
, unsigned n_ineq
)
963 struct isl_basic_map
*bmap
;
968 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
972 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
976 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
977 unsigned nparam
, unsigned dim
, unsigned extra
,
978 unsigned n_eq
, unsigned n_ineq
)
980 return (struct isl_basic_set
*)
981 isl_basic_map_extend((struct isl_basic_map
*)base
,
982 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
985 struct isl_basic_set
*isl_basic_set_extend_constraints(
986 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
988 return (struct isl_basic_set
*)
989 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
993 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
995 return (struct isl_basic_set
*)
996 isl_basic_map_cow((struct isl_basic_map
*)bset
);
999 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
1004 if (bmap
->ref
> 1) {
1006 bmap
= isl_basic_map_dup(bmap
);
1008 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
1012 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1020 return isl_set_dup(set
);
1023 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1031 return isl_map_dup(map
);
1034 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1035 unsigned a_len
, unsigned b_len
)
1037 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1038 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1039 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1042 struct isl_basic_set
*isl_basic_set_swap_vars(
1043 struct isl_basic_set
*bset
, unsigned n
)
1053 nparam
= isl_basic_set_n_param(bset
);
1054 dim
= isl_basic_set_n_dim(bset
);
1055 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1060 bset
= isl_basic_set_cow(bset
);
1064 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1065 if (isl_blk_is_error(blk
))
1068 for (i
= 0; i
< bset
->n_eq
; ++i
)
1070 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1072 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1074 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1076 for (i
= 0; i
< bset
->n_div
; ++i
)
1078 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1080 isl_blk_free(bset
->ctx
, blk
);
1082 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1083 return isl_basic_set_gauss(bset
, NULL
);
1085 isl_basic_set_free(bset
);
1089 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1092 set
= isl_set_cow(set
);
1096 for (i
= 0; i
< set
->n
; ++i
) {
1097 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1103 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1107 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1113 total
= isl_basic_map_total_dim(bmap
);
1114 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1115 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1117 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1119 isl_basic_map_alloc_equality(bmap
);
1123 isl_int_set_si(bmap
->eq
[i
][0], 1);
1124 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1125 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1126 return isl_basic_map_finalize(bmap
);
1128 isl_basic_map_free(bmap
);
1132 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1134 return (struct isl_basic_set
*)
1135 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1138 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1141 unsigned off
= isl_dim_total(bmap
->dim
);
1142 isl_int
*t
= bmap
->div
[a
];
1143 bmap
->div
[a
] = bmap
->div
[b
];
1146 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1147 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1149 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1150 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1152 for (i
= 0; i
< bmap
->n_div
; ++i
)
1153 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1154 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1157 /* Eliminate the specified n dimensions starting at first from the
1158 * constraints using Fourier-Motzkin, The dimensions themselves
1161 struct isl_set
*isl_set_eliminate_dims(struct isl_set
*set
,
1162 unsigned first
, unsigned n
)
1172 set
= isl_set_cow(set
);
1175 isl_assert(set
->ctx
, first
+n
<= isl_set_n_dim(set
), goto error
);
1176 nparam
= isl_set_n_param(set
);
1178 for (i
= 0; i
< set
->n
; ++i
) {
1179 set
->p
[i
] = isl_basic_set_eliminate_vars(set
->p
[i
],
1190 /* Project out n dimensions starting at first using Fourier-Motzkin */
1191 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1192 unsigned first
, unsigned n
)
1194 set
= isl_set_eliminate_dims(set
, first
, n
);
1195 set
= isl_set_drop_dims(set
, first
, n
);
1199 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1201 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1209 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1218 set
= isl_set_cow(set
);
1222 for (i
= 0; i
< set
->n
; ++i
) {
1223 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1233 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1234 enum isl_dim_type type
, unsigned first
, unsigned n
)
1238 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1242 bmap
= isl_basic_map_eliminate_vars(bmap
,
1243 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1246 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1248 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1251 isl_basic_map_free(bmap
);
1255 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1256 enum isl_dim_type type
, unsigned first
, unsigned n
)
1258 return (isl_basic_set
*)
1259 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1262 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1263 enum isl_dim_type type
, unsigned first
, unsigned n
)
1270 map
= isl_map_cow(map
);
1273 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1275 for (i
= 0; i
< map
->n
; ++i
) {
1276 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1277 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1281 map
= isl_map_drop(map
, type
, first
, n
);
1288 __isl_give isl_set
*isl_set_remove(__isl_take isl_set
*bset
,
1289 enum isl_dim_type type
, unsigned first
, unsigned n
)
1291 return (isl_set
*)isl_map_remove((isl_map
*)bset
, type
, first
, n
);
1294 /* Project out n inputs starting at first using Fourier-Motzkin */
1295 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1296 unsigned first
, unsigned n
)
1298 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1301 /* Project out n dimensions starting at first using Fourier-Motzkin */
1302 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1303 unsigned first
, unsigned n
)
1305 unsigned nparam
= isl_basic_set_n_param(bset
);
1306 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1307 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1311 static void dump_term(struct isl_basic_map
*bmap
,
1312 isl_int c
, int pos
, FILE *out
)
1315 unsigned in
= isl_basic_map_n_in(bmap
);
1316 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1317 unsigned nparam
= isl_basic_map_n_param(bmap
);
1319 isl_int_print(out
, c
, 0);
1321 if (!isl_int_is_one(c
))
1322 isl_int_print(out
, c
, 0);
1323 if (pos
< 1 + nparam
) {
1324 name
= isl_dim_get_name(bmap
->dim
,
1325 isl_dim_param
, pos
- 1);
1327 fprintf(out
, "%s", name
);
1329 fprintf(out
, "p%d", pos
- 1);
1330 } else if (pos
< 1 + nparam
+ in
)
1331 fprintf(out
, "i%d", pos
- 1 - nparam
);
1332 else if (pos
< 1 + nparam
+ dim
)
1333 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1335 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1339 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1340 int sign
, FILE *out
)
1344 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1348 for (i
= 0, first
= 1; i
< len
; ++i
) {
1349 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1352 fprintf(out
, " + ");
1354 isl_int_abs(v
, c
[i
]);
1355 dump_term(bmap
, v
, i
, out
);
1362 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1363 const char *op
, FILE *out
, int indent
)
1367 fprintf(out
, "%*s", indent
, "");
1369 dump_constraint_sign(bmap
, c
, 1, out
);
1370 fprintf(out
, " %s ", op
);
1371 dump_constraint_sign(bmap
, c
, -1, out
);
1375 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1376 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1378 fprintf(out
, "%*s", indent
, "");
1379 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1384 static void dump_constraints(struct isl_basic_map
*bmap
,
1385 isl_int
**c
, unsigned n
,
1386 const char *op
, FILE *out
, int indent
)
1390 for (i
= 0; i
< n
; ++i
)
1391 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1394 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1398 unsigned total
= isl_basic_map_total_dim(bmap
);
1400 for (j
= 0; j
< 1 + total
; ++j
) {
1401 if (isl_int_is_zero(exp
[j
]))
1403 if (!first
&& isl_int_is_pos(exp
[j
]))
1405 dump_term(bmap
, exp
[j
], j
, out
);
1410 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1414 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1415 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1417 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1418 fprintf(out
, "%*s", indent
, "");
1419 fprintf(out
, "e%d = [(", i
);
1420 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1422 isl_int_print(out
, bmap
->div
[i
][0], 0);
1423 fprintf(out
, "]\n");
1427 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1430 fprintf(out
, "null basic set\n");
1434 fprintf(out
, "%*s", indent
, "");
1435 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1436 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1437 bset
->extra
, bset
->flags
);
1438 dump((struct isl_basic_map
*)bset
, out
, indent
);
1441 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1444 fprintf(out
, "null basic map\n");
1448 fprintf(out
, "%*s", indent
, "");
1449 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1450 "flags: %x, n_name: %d\n",
1452 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1453 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1454 dump(bmap
, out
, indent
);
1457 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1462 total
= isl_basic_map_total_dim(bmap
);
1463 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1464 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1465 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1466 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1470 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1472 struct isl_set
*set
;
1476 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1477 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1478 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1479 sizeof(struct isl_set
) +
1480 (n
- 1) * sizeof(struct isl_basic_set
*));
1484 set
->ctx
= dim
->ctx
;
1485 isl_ctx_ref(set
->ctx
);
1497 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1498 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1500 struct isl_set
*set
;
1501 struct isl_dim
*dims
;
1503 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1507 set
= isl_set_alloc_dim(dims
, n
, flags
);
1511 /* Make sure "map" has room for at least "n" more basic maps.
1513 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1516 struct isl_map
*grown
= NULL
;
1520 isl_assert(map
->ctx
, n
>= 0, goto error
);
1521 if (map
->n
+ n
<= map
->size
)
1523 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1526 for (i
= 0; i
< map
->n
; ++i
) {
1527 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1535 isl_map_free(grown
);
1540 /* Make sure "set" has room for at least "n" more basic sets.
1542 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1544 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1547 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1550 struct isl_set
*dup
;
1555 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1558 for (i
= 0; i
< set
->n
; ++i
)
1559 dup
= isl_set_add(dup
, isl_basic_set_copy(set
->p
[i
]));
1563 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1565 struct isl_set
*set
;
1570 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1572 isl_basic_set_free(bset
);
1575 return isl_set_add(set
, bset
);
1578 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1580 struct isl_map
*map
;
1585 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1587 isl_basic_map_free(bmap
);
1590 return isl_map_add(map
, bmap
);
1593 struct isl_set
*isl_set_add(struct isl_set
*set
, struct isl_basic_set
*bset
)
1595 return (struct isl_set
*)isl_map_add((struct isl_map
*)set
,
1596 (struct isl_basic_map
*)bset
);
1599 void isl_set_free(struct isl_set
*set
)
1609 isl_ctx_deref(set
->ctx
);
1610 for (i
= 0; i
< set
->n
; ++i
)
1611 isl_basic_set_free(set
->p
[i
]);
1612 isl_dim_free(set
->dim
);
1616 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1621 fprintf(out
, "null set\n");
1625 fprintf(out
, "%*s", indent
, "");
1626 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1627 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1629 for (i
= 0; i
< set
->n
; ++i
) {
1630 fprintf(out
, "%*s", indent
, "");
1631 fprintf(out
, "basic set %d:\n", i
);
1632 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1636 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1641 fprintf(out
, "null map\n");
1645 fprintf(out
, "%*s", indent
, "");
1646 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1647 "flags: %x, n_name: %d\n",
1648 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1649 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1650 for (i
= 0; i
< map
->n
; ++i
) {
1651 fprintf(out
, "%*s", indent
, "");
1652 fprintf(out
, "basic map %d:\n", i
);
1653 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1657 struct isl_basic_map
*isl_basic_map_intersect_domain(
1658 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1660 struct isl_basic_map
*bmap_domain
;
1661 struct isl_dim
*dim
;
1666 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1667 bset
->dim
, isl_dim_param
), goto error
);
1669 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1670 isl_assert(bset
->ctx
,
1671 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1673 bmap
= isl_basic_map_cow(bmap
);
1674 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1675 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1678 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1679 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1680 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1682 bmap
= isl_basic_map_simplify(bmap
);
1683 return isl_basic_map_finalize(bmap
);
1685 isl_basic_map_free(bmap
);
1686 isl_basic_set_free(bset
);
1690 struct isl_basic_map
*isl_basic_map_intersect_range(
1691 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1693 struct isl_basic_map
*bmap_range
;
1698 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1699 bset
->dim
, isl_dim_param
), goto error
);
1701 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1702 isl_assert(bset
->ctx
,
1703 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1705 bmap
= isl_basic_map_cow(bmap
);
1706 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1707 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1710 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1711 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1713 bmap
= isl_basic_map_simplify(bmap
);
1714 return isl_basic_map_finalize(bmap
);
1716 isl_basic_map_free(bmap
);
1717 isl_basic_set_free(bset
);
1721 int isl_basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1727 total
= 1 + isl_basic_map_total_dim(bmap
);
1728 if (total
!= vec
->size
)
1733 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1734 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1735 if (!isl_int_is_zero(s
)) {
1741 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1742 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1743 if (isl_int_is_neg(s
)) {
1754 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1756 return isl_basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1759 struct isl_basic_map
*isl_basic_map_intersect(
1760 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1762 struct isl_vec
*sample
= NULL
;
1764 if (!bmap1
|| !bmap2
)
1767 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1768 bmap2
->dim
, isl_dim_param
), goto error
);
1769 if (isl_dim_total(bmap1
->dim
) ==
1770 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1771 isl_dim_total(bmap2
->dim
) !=
1772 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1773 return isl_basic_map_intersect(bmap2
, bmap1
);
1775 if (isl_dim_total(bmap2
->dim
) !=
1776 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1777 isl_assert(bmap1
->ctx
,
1778 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1780 if (bmap1
->sample
&&
1781 isl_basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1782 isl_basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1783 sample
= isl_vec_copy(bmap1
->sample
);
1784 else if (bmap2
->sample
&&
1785 isl_basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1786 isl_basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1787 sample
= isl_vec_copy(bmap2
->sample
);
1789 bmap1
= isl_basic_map_cow(bmap1
);
1790 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1791 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1794 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1797 isl_vec_free(bmap1
->sample
);
1798 bmap1
->sample
= sample
;
1801 bmap1
= isl_basic_map_simplify(bmap1
);
1802 return isl_basic_map_finalize(bmap1
);
1805 isl_vec_free(sample
);
1806 isl_basic_map_free(bmap1
);
1807 isl_basic_map_free(bmap2
);
1811 struct isl_basic_set
*isl_basic_set_intersect(
1812 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1814 return (struct isl_basic_set
*)
1815 isl_basic_map_intersect(
1816 (struct isl_basic_map
*)bset1
,
1817 (struct isl_basic_map
*)bset2
);
1820 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1823 struct isl_map
*result
;
1829 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1830 map2
->dim
, isl_dim_param
), goto error
);
1831 if (isl_dim_total(map1
->dim
) ==
1832 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1833 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1834 return isl_map_intersect(map2
, map1
);
1836 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1837 isl_assert(map1
->ctx
,
1838 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1840 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1841 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
1842 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
1844 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1845 map1
->n
* map2
->n
, flags
);
1848 for (i
= 0; i
< map1
->n
; ++i
)
1849 for (j
= 0; j
< map2
->n
; ++j
) {
1850 struct isl_basic_map
*part
;
1851 part
= isl_basic_map_intersect(
1852 isl_basic_map_copy(map1
->p
[i
]),
1853 isl_basic_map_copy(map2
->p
[j
]));
1854 if (isl_basic_map_is_empty(part
))
1855 isl_basic_map_free(part
);
1857 result
= isl_map_add(result
, part
);
1870 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1872 return (struct isl_set
*)
1873 isl_map_intersect((struct isl_map
*)set1
,
1874 (struct isl_map
*)set2
);
1877 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
1879 struct isl_dim
*dim
;
1880 struct isl_basic_set
*bset
;
1885 bmap
= isl_basic_map_cow(bmap
);
1888 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
1889 in
= isl_basic_map_n_in(bmap
);
1890 bset
= isl_basic_set_from_basic_map(bmap
);
1891 bset
= isl_basic_set_swap_vars(bset
, in
);
1892 return isl_basic_map_from_basic_set(bset
, dim
);
1895 /* Turn final n dimensions into existentially quantified variables.
1897 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
1898 enum isl_dim_type type
, unsigned first
, unsigned n
)
1908 isl_assert(bset
->ctx
, type
== isl_dim_set
, goto error
);
1909 isl_assert(bset
->ctx
, first
+ n
== isl_basic_set_n_dim(bset
), goto error
);
1914 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_RATIONAL
))
1915 return isl_basic_set_remove(bset
, type
, first
, n
);
1917 bset
= isl_basic_set_cow(bset
);
1919 row_size
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
1920 old
= bset
->block2
.data
;
1921 bset
->block2
= isl_blk_extend(bset
->ctx
, bset
->block2
,
1922 (bset
->extra
+ n
) * (1 + row_size
));
1923 if (!bset
->block2
.data
)
1925 new_div
= isl_alloc_array(ctx
, isl_int
*, bset
->extra
+ n
);
1928 for (i
= 0; i
< n
; ++i
) {
1929 new_div
[i
] = bset
->block2
.data
+
1930 (bset
->extra
+ i
) * (1 + row_size
);
1931 isl_seq_clr(new_div
[i
], 1 + row_size
);
1933 for (i
= 0; i
< bset
->extra
; ++i
)
1934 new_div
[n
+ i
] = bset
->block2
.data
+ (bset
->div
[i
] - old
);
1936 bset
->div
= new_div
;
1939 bset
->dim
= isl_dim_drop_outputs(bset
->dim
,
1940 isl_basic_set_n_dim(bset
) - n
, n
);
1943 bset
= isl_basic_set_simplify(bset
);
1944 bset
= isl_basic_set_drop_redundant_divs(bset
);
1945 return isl_basic_set_finalize(bset
);
1947 isl_basic_set_free(bset
);
1951 /* Turn final n dimensions into existentially quantified variables.
1953 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
1954 enum isl_dim_type type
, unsigned first
, unsigned n
)
1961 isl_assert(set
->ctx
, type
== isl_dim_set
, goto error
);
1962 isl_assert(set
->ctx
, first
+ n
== isl_set_n_dim(set
), goto error
);
1967 set
= isl_set_cow(set
);
1970 set
->dim
= isl_dim_drop_outputs(set
->dim
, first
, n
);
1971 for (i
= 0; i
< set
->n
; ++i
) {
1972 set
->p
[i
] = isl_basic_set_project_out(set
->p
[i
], type
, first
, n
);
1977 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1984 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
1988 for (i
= 0; i
< n
; ++i
) {
1989 j
= isl_basic_map_alloc_div(bmap
);
1992 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
1996 isl_basic_map_free(bmap
);
2000 struct isl_basic_map
*isl_basic_map_apply_range(
2001 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2003 struct isl_dim
*dim_result
= NULL
;
2004 struct isl_basic_map
*bmap
;
2005 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
2006 struct isl_dim_map
*dim_map1
, *dim_map2
;
2008 if (!bmap1
|| !bmap2
)
2011 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
2012 isl_dim_copy(bmap2
->dim
));
2014 n_in
= isl_basic_map_n_in(bmap1
);
2015 n_out
= isl_basic_map_n_out(bmap2
);
2016 n
= isl_basic_map_n_out(bmap1
);
2017 nparam
= isl_basic_map_n_param(bmap1
);
2019 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2020 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2021 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2022 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2023 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
2024 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2025 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
2026 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
2027 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2028 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2029 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2031 bmap
= isl_basic_map_alloc_dim(dim_result
,
2032 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2033 bmap1
->n_eq
+ bmap2
->n_eq
,
2034 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2035 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2036 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2037 bmap
= add_divs(bmap
, n
);
2038 bmap
= isl_basic_map_simplify(bmap
);
2039 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2040 return isl_basic_map_finalize(bmap
);
2042 isl_basic_map_free(bmap1
);
2043 isl_basic_map_free(bmap2
);
2047 struct isl_basic_set
*isl_basic_set_apply(
2048 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2053 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2056 return (struct isl_basic_set
*)
2057 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2059 isl_basic_set_free(bset
);
2060 isl_basic_map_free(bmap
);
2064 struct isl_basic_map
*isl_basic_map_apply_domain(
2065 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2067 if (!bmap1
|| !bmap2
)
2070 isl_assert(bmap1
->ctx
,
2071 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2072 isl_assert(bmap1
->ctx
,
2073 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2076 bmap1
= isl_basic_map_reverse(bmap1
);
2077 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2078 return isl_basic_map_reverse(bmap1
);
2080 isl_basic_map_free(bmap1
);
2081 isl_basic_map_free(bmap2
);
2085 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2086 * A \cap B -> f(A) + f(B)
2088 struct isl_basic_map
*isl_basic_map_sum(
2089 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2091 unsigned n_in
, n_out
, nparam
, total
, pos
;
2092 struct isl_basic_map
*bmap
= NULL
;
2093 struct isl_dim_map
*dim_map1
, *dim_map2
;
2096 if (!bmap1
|| !bmap2
)
2099 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2102 nparam
= isl_basic_map_n_param(bmap1
);
2103 n_in
= isl_basic_map_n_in(bmap1
);
2104 n_out
= isl_basic_map_n_out(bmap1
);
2106 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2107 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2108 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2109 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2110 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2111 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2112 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2113 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2114 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2115 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2116 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2118 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2119 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2120 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2121 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2122 for (i
= 0; i
< n_out
; ++i
) {
2123 int j
= isl_basic_map_alloc_equality(bmap
);
2126 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2127 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2128 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2129 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2131 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2132 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2133 bmap
= add_divs(bmap
, 2 * n_out
);
2135 bmap
= isl_basic_map_simplify(bmap
);
2136 return isl_basic_map_finalize(bmap
);
2138 isl_basic_map_free(bmap
);
2139 isl_basic_map_free(bmap1
);
2140 isl_basic_map_free(bmap2
);
2144 /* Given two maps A -> f(A) and B -> g(B), construct a map
2145 * A \cap B -> f(A) + f(B)
2147 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2149 struct isl_map
*result
;
2155 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2157 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2158 map1
->n
* map2
->n
, 0);
2161 for (i
= 0; i
< map1
->n
; ++i
)
2162 for (j
= 0; j
< map2
->n
; ++j
) {
2163 struct isl_basic_map
*part
;
2164 part
= isl_basic_map_sum(
2165 isl_basic_map_copy(map1
->p
[i
]),
2166 isl_basic_map_copy(map2
->p
[j
]));
2167 if (isl_basic_map_is_empty(part
))
2168 isl_basic_map_free(part
);
2170 result
= isl_map_add(result
, part
);
2183 /* Given a basic map A -> f(A), construct A -> -f(A).
2185 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2190 bmap
= isl_basic_map_cow(bmap
);
2194 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2195 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2196 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2197 for (j
= 0; j
< n
; ++j
)
2198 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2199 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2200 for (j
= 0; j
< n
; ++j
)
2201 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2202 for (i
= 0; i
< bmap
->n_div
; ++i
)
2203 for (j
= 0; j
< n
; ++j
)
2204 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2205 return isl_basic_map_finalize(bmap
);
2208 /* Given a map A -> f(A), construct A -> -f(A).
2210 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2214 map
= isl_map_cow(map
);
2218 for (i
= 0; i
< map
->n
; ++i
) {
2219 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2230 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2231 * A -> floor(f(A)/d).
2233 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2236 unsigned n_in
, n_out
, nparam
, total
, pos
;
2237 struct isl_basic_map
*result
= NULL
;
2238 struct isl_dim_map
*dim_map
;
2244 nparam
= isl_basic_map_n_param(bmap
);
2245 n_in
= isl_basic_map_n_in(bmap
);
2246 n_out
= isl_basic_map_n_out(bmap
);
2248 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2249 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2250 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2251 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2252 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2253 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2255 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2256 bmap
->n_div
+ n_out
,
2257 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2258 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2259 result
= add_divs(result
, n_out
);
2260 for (i
= 0; i
< n_out
; ++i
) {
2262 j
= isl_basic_map_alloc_inequality(result
);
2265 isl_seq_clr(result
->ineq
[j
], 1+total
);
2266 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2267 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2268 j
= isl_basic_map_alloc_inequality(result
);
2271 isl_seq_clr(result
->ineq
[j
], 1+total
);
2272 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2273 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2274 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2277 result
= isl_basic_map_simplify(result
);
2278 return isl_basic_map_finalize(result
);
2280 isl_basic_map_free(result
);
2284 /* Given a map A -> f(A) and an integer d, construct a map
2285 * A -> floor(f(A)/d).
2287 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2291 map
= isl_map_cow(map
);
2295 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2296 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2297 for (i
= 0; i
< map
->n
; ++i
) {
2298 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2309 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2315 i
= isl_basic_map_alloc_equality(bmap
);
2318 nparam
= isl_basic_map_n_param(bmap
);
2319 n_in
= isl_basic_map_n_in(bmap
);
2320 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2321 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2322 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2323 return isl_basic_map_finalize(bmap
);
2325 isl_basic_map_free(bmap
);
2329 /* Add a constraints to "bmap" expressing i_pos < o_pos
2331 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2337 i
= isl_basic_map_alloc_inequality(bmap
);
2340 nparam
= isl_basic_map_n_param(bmap
);
2341 n_in
= isl_basic_map_n_in(bmap
);
2342 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2343 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2344 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2345 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2346 return isl_basic_map_finalize(bmap
);
2348 isl_basic_map_free(bmap
);
2352 /* Add a constraints to "bmap" expressing i_pos > o_pos
2354 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2360 i
= isl_basic_map_alloc_inequality(bmap
);
2363 nparam
= isl_basic_map_n_param(bmap
);
2364 n_in
= isl_basic_map_n_in(bmap
);
2365 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2366 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2367 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2368 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2369 return isl_basic_map_finalize(bmap
);
2371 isl_basic_map_free(bmap
);
2375 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2378 struct isl_basic_map
*bmap
;
2379 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2382 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2383 bmap
= var_equal(bmap
, i
);
2384 return isl_basic_map_finalize(bmap
);
2387 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2389 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2392 struct isl_basic_map
*bmap
;
2393 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2396 for (i
= 0; i
< pos
&& bmap
; ++i
)
2397 bmap
= var_equal(bmap
, i
);
2399 bmap
= var_less(bmap
, pos
);
2400 return isl_basic_map_finalize(bmap
);
2403 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2405 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2408 struct isl_basic_map
*bmap
;
2409 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2412 for (i
= 0; i
< pos
&& bmap
; ++i
)
2413 bmap
= var_equal(bmap
, i
);
2415 bmap
= var_more(bmap
, pos
);
2416 return isl_basic_map_finalize(bmap
);
2419 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
2421 struct isl_map
*map
;
2428 map
= isl_map_alloc_dim(isl_dim_copy(dims
), dim
+ equal
, ISL_MAP_DISJOINT
);
2430 for (i
= 0; i
< dim
; ++i
)
2431 map
= isl_map_add(map
,
2432 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
2434 map
= isl_map_add(map
,
2435 isl_basic_map_equal(isl_dim_copy(dims
), dim
));
2441 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
2443 return map_lex_lte(isl_dim_map(set_dim
), 0);
2446 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
2448 return map_lex_lte(isl_dim_map(set_dim
), 1);
2451 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
2453 struct isl_map
*map
;
2460 map
= isl_map_alloc_dim(isl_dim_copy(dims
), dim
+ equal
, ISL_MAP_DISJOINT
);
2462 for (i
= 0; i
< dim
; ++i
)
2463 map
= isl_map_add(map
,
2464 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
2466 map
= isl_map_add(map
,
2467 isl_basic_map_equal(isl_dim_copy(dims
), dim
));
2473 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
2475 return map_lex_gte(isl_dim_map(set_dim
), 0);
2478 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
2480 return map_lex_gte(isl_dim_map(set_dim
), 1);
2483 struct isl_basic_map
*isl_basic_map_from_basic_set(
2484 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
2486 struct isl_basic_map
*bmap
;
2488 bset
= isl_basic_set_cow(bset
);
2492 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
2493 isl_dim_free(bset
->dim
);
2494 bmap
= (struct isl_basic_map
*) bset
;
2496 return isl_basic_map_finalize(bmap
);
2498 isl_basic_set_free(bset
);
2503 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
2507 if (bmap
->dim
->n_in
== 0)
2508 return (struct isl_basic_set
*)bmap
;
2509 bmap
= isl_basic_map_cow(bmap
);
2512 bmap
->dim
= isl_dim_cow(bmap
->dim
);
2515 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
2516 bmap
->dim
->n_in
= 0;
2517 bmap
= isl_basic_map_finalize(bmap
);
2518 return (struct isl_basic_set
*)bmap
;
2520 isl_basic_map_free(bmap
);
2524 /* For a div d = floor(f/m), add the constraints
2527 * -(f-(n-1)) + m d >= 0
2529 * Note that the second constraint is the negation of
2533 static int add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
2536 unsigned total
= isl_basic_map_total_dim(bmap
);
2537 unsigned div_pos
= 1 + total
- bmap
->n_div
+ div
;
2539 i
= isl_basic_map_alloc_inequality(bmap
);
2542 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
]+1, 1+total
);
2543 isl_int_neg(bmap
->ineq
[i
][div_pos
], bmap
->div
[div
][0]);
2545 j
= isl_basic_map_alloc_inequality(bmap
);
2548 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
2549 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][div_pos
]);
2550 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
2554 struct isl_basic_set
*isl_basic_map_underlying_set(
2555 struct isl_basic_map
*bmap
)
2559 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
2560 return (struct isl_basic_set
*)bmap
;
2561 bmap
= isl_basic_map_cow(bmap
);
2564 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
2567 bmap
->extra
-= bmap
->n_div
;
2569 bmap
= isl_basic_map_finalize(bmap
);
2570 return (struct isl_basic_set
*)bmap
;
2575 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
2576 __isl_take isl_basic_set
*bset
)
2578 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
2581 struct isl_basic_map
*isl_basic_map_overlying_set(
2582 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
2584 struct isl_basic_map
*bmap
;
2585 struct isl_ctx
*ctx
;
2592 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
2593 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
2594 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
2596 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
2597 isl_basic_map_free(like
);
2598 return (struct isl_basic_map
*)bset
;
2600 bset
= isl_basic_set_cow(bset
);
2603 total
= bset
->dim
->n_out
+ bset
->extra
;
2604 bmap
= (struct isl_basic_map
*)bset
;
2605 isl_dim_free(bmap
->dim
);
2606 bmap
->dim
= isl_dim_copy(like
->dim
);
2609 bmap
->n_div
= like
->n_div
;
2610 bmap
->extra
+= like
->n_div
;
2613 ltotal
= total
- bmap
->extra
+ like
->extra
;
2616 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
2617 bmap
->extra
* (1 + 1 + total
));
2618 if (isl_blk_is_error(bmap
->block2
))
2620 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
2624 for (i
= 0; i
< bmap
->extra
; ++i
)
2625 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
2626 for (i
= 0; i
< like
->n_div
; ++i
) {
2627 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
2628 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
2630 bmap
= isl_basic_map_extend_constraints(bmap
,
2631 0, 2 * like
->n_div
);
2632 for (i
= 0; i
< like
->n_div
; ++i
) {
2633 if (isl_int_is_zero(bmap
->div
[i
][0]))
2635 if (add_div_constraints(bmap
, i
) < 0)
2639 isl_basic_map_free(like
);
2640 bmap
= isl_basic_map_simplify(bmap
);
2641 bmap
= isl_basic_map_finalize(bmap
);
2644 isl_basic_map_free(like
);
2645 isl_basic_set_free(bset
);
2649 struct isl_basic_set
*isl_basic_set_from_underlying_set(
2650 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
2652 return (struct isl_basic_set
*)
2653 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
2656 struct isl_set
*isl_set_from_underlying_set(
2657 struct isl_set
*set
, struct isl_basic_set
*like
)
2663 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
2665 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
2666 isl_basic_set_free(like
);
2669 set
= isl_set_cow(set
);
2672 for (i
= 0; i
< set
->n
; ++i
) {
2673 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
2674 isl_basic_set_copy(like
));
2678 isl_dim_free(set
->dim
);
2679 set
->dim
= isl_dim_copy(like
->dim
);
2682 isl_basic_set_free(like
);
2685 isl_basic_set_free(like
);
2690 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
2694 map
= isl_map_cow(map
);
2697 map
->dim
= isl_dim_cow(map
->dim
);
2701 for (i
= 1; i
< map
->n
; ++i
)
2702 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
2704 for (i
= 0; i
< map
->n
; ++i
) {
2705 map
->p
[i
] = (struct isl_basic_map
*)
2706 isl_basic_map_underlying_set(map
->p
[i
]);
2711 map
->dim
= isl_dim_underlying(map
->dim
, 0);
2713 isl_dim_free(map
->dim
);
2714 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
2718 return (struct isl_set
*)map
;
2724 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
2726 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
2729 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
2731 struct isl_basic_set
*domain
;
2736 n_in
= isl_basic_map_n_in(bmap
);
2737 n_out
= isl_basic_map_n_out(bmap
);
2738 domain
= isl_basic_set_from_basic_map(bmap
);
2739 return isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
2742 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
2744 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
2747 struct isl_set
*isl_map_range(struct isl_map
*map
)
2750 struct isl_set
*set
;
2754 map
= isl_map_cow(map
);
2758 set
= (struct isl_set
*) map
;
2759 if (set
->dim
->n_in
!= 0) {
2760 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
2764 for (i
= 0; i
< map
->n
; ++i
) {
2765 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
2769 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
2770 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
2777 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
2780 struct isl_map
*map
= NULL
;
2782 set
= isl_set_cow(set
);
2785 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
2786 map
= (struct isl_map
*)set
;
2787 for (i
= 0; i
< set
->n
; ++i
) {
2788 map
->p
[i
] = isl_basic_map_from_basic_set(
2789 set
->p
[i
], isl_dim_copy(dim
));
2793 isl_dim_free(map
->dim
);
2802 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
2804 return (struct isl_map
*)set
;
2807 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
2810 struct isl_set
*set
= NULL
;
2814 map
= isl_map_cow(map
);
2817 map
->dim
= isl_dim_cow(map
->dim
);
2820 map
->dim
->n_out
+= map
->dim
->n_in
;
2822 set
= (struct isl_set
*)map
;
2823 for (i
= 0; i
< map
->n
; ++i
) {
2824 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
2834 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2836 struct isl_map
*map
;
2840 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
2841 map
= isl_alloc(dim
->ctx
, struct isl_map
,
2842 sizeof(struct isl_map
) +
2843 (n
- 1) * sizeof(struct isl_basic_map
*));
2847 map
->ctx
= dim
->ctx
;
2848 isl_ctx_ref(map
->ctx
);
2860 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
2861 unsigned nparam
, unsigned in
, unsigned out
, int n
,
2864 struct isl_map
*map
;
2865 struct isl_dim
*dims
;
2867 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
2871 map
= isl_map_alloc_dim(dims
, n
, flags
);
2875 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
2877 struct isl_basic_map
*bmap
;
2878 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
2879 bmap
= isl_basic_map_set_to_empty(bmap
);
2883 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
2885 struct isl_basic_set
*bset
;
2886 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
2887 bset
= isl_basic_set_set_to_empty(bset
);
2891 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
2893 struct isl_basic_map
*bmap
;
2896 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2897 bmap
= isl_basic_map_set_to_empty(bmap
);
2901 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
2903 struct isl_basic_map
*bmap
;
2906 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2907 bmap
= isl_basic_map_set_to_empty(bmap
);
2911 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
2913 struct isl_basic_set
*bset
;
2916 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2917 bset
= isl_basic_set_set_to_empty(bset
);
2921 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
2923 struct isl_basic_map
*bmap
;
2924 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
2928 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
2930 struct isl_basic_set
*bset
;
2931 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
2935 __isl_give isl_basic_map
*isl_basic_map_universe_like(
2936 __isl_keep isl_basic_map
*model
)
2940 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2943 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
2947 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2950 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
2951 __isl_keep isl_set
*model
)
2955 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2958 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
2960 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2963 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
2967 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2970 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
2974 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2977 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
2979 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2982 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
2986 return isl_set_empty(isl_dim_copy(model
->dim
));
2989 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
2991 struct isl_map
*map
;
2994 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2995 map
= isl_map_add(map
, isl_basic_map_universe(dim
));
2999 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
3001 struct isl_set
*set
;
3004 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
3005 set
= isl_set_add(set
, isl_basic_set_universe(dim
));
3009 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
3013 return isl_set_universe(isl_dim_copy(model
->dim
));
3016 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3019 struct isl_map
*dup
;
3023 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3024 for (i
= 0; i
< map
->n
; ++i
)
3025 dup
= isl_map_add(dup
, isl_basic_map_copy(map
->p
[i
]));
3029 struct isl_map
*isl_map_add(struct isl_map
*map
, struct isl_basic_map
*bmap
)
3033 if (isl_basic_map_fast_is_empty(bmap
)) {
3034 isl_basic_map_free(bmap
);
3037 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3038 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3039 map
->p
[map
->n
] = bmap
;
3041 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3047 isl_basic_map_free(bmap
);
3051 void isl_map_free(struct isl_map
*map
)
3061 isl_ctx_deref(map
->ctx
);
3062 for (i
= 0; i
< map
->n
; ++i
)
3063 isl_basic_map_free(map
->p
[i
]);
3064 isl_dim_free(map
->dim
);
3068 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3069 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3073 base
= isl_map_cow(base
);
3077 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3080 for (i
= 0; i
< base
->n
; ++i
) {
3081 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3082 isl_dim_copy(base
->dim
), 0, 0, 0);
3092 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3093 unsigned nparam
, unsigned dim
)
3095 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3099 static struct isl_basic_map
*isl_basic_map_fix_pos_si(
3100 struct isl_basic_map
*bmap
, unsigned pos
, int value
)
3104 bmap
= isl_basic_map_cow(bmap
);
3105 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3106 j
= isl_basic_map_alloc_equality(bmap
);
3109 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3110 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3111 isl_int_set_si(bmap
->eq
[j
][0], value
);
3112 bmap
= isl_basic_map_simplify(bmap
);
3113 return isl_basic_map_finalize(bmap
);
3115 isl_basic_map_free(bmap
);
3119 static __isl_give isl_basic_map
*isl_basic_map_fix_pos(
3120 __isl_take isl_basic_map
*bmap
, unsigned pos
, isl_int value
)
3124 bmap
= isl_basic_map_cow(bmap
);
3125 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3126 j
= isl_basic_map_alloc_equality(bmap
);
3129 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3130 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3131 isl_int_set(bmap
->eq
[j
][0], value
);
3132 bmap
= isl_basic_map_simplify(bmap
);
3133 return isl_basic_map_finalize(bmap
);
3135 isl_basic_map_free(bmap
);
3139 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
3140 enum isl_dim_type type
, unsigned pos
, int value
)
3144 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3145 return isl_basic_map_fix_pos_si(bmap
,
3146 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3148 isl_basic_map_free(bmap
);
3152 __isl_give isl_basic_map
*isl_basic_map_fix(__isl_take isl_basic_map
*bmap
,
3153 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3157 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3158 return isl_basic_map_fix_pos(bmap
,
3159 isl_basic_map_offset(bmap
, type
) + pos
, value
);
3161 isl_basic_map_free(bmap
);
3165 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
3166 enum isl_dim_type type
, unsigned pos
, int value
)
3168 return (struct isl_basic_set
*)
3169 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3173 __isl_give isl_basic_set
*isl_basic_set_fix(__isl_take isl_basic_set
*bset
,
3174 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3176 return (struct isl_basic_set
*)
3177 isl_basic_map_fix((struct isl_basic_map
*)bset
,
3181 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
3182 unsigned input
, int value
)
3184 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
3187 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
3188 unsigned dim
, int value
)
3190 return (struct isl_basic_set
*)
3191 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3192 isl_dim_set
, dim
, value
);
3195 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
3196 enum isl_dim_type type
, unsigned pos
, int value
)
3200 map
= isl_map_cow(map
);
3204 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3205 for (i
= 0; i
< map
->n
; ++i
) {
3206 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
3210 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3217 __isl_give isl_map
*isl_map_fix(__isl_take isl_map
*map
,
3218 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3222 map
= isl_map_cow(map
);
3226 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3227 for (i
= 0; i
< map
->n
; ++i
) {
3228 map
->p
[i
] = isl_basic_map_fix(map
->p
[i
], type
, pos
, value
);
3232 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3239 __isl_give isl_set
*isl_set_fix(__isl_take isl_set
*set
,
3240 enum isl_dim_type type
, unsigned pos
, isl_int value
)
3242 return (struct isl_set
*)isl_map_fix((isl_map
*)set
, type
, pos
, value
);
3245 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
3246 unsigned input
, int value
)
3248 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
3251 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
3253 return (struct isl_set
*)
3254 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
3257 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
3258 unsigned dim
, isl_int value
)
3262 bset
= isl_basic_set_cow(bset
);
3263 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
3264 j
= isl_basic_set_alloc_inequality(bset
);
3267 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
3268 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
3269 isl_int_neg(bset
->ineq
[j
][0], value
);
3270 bset
= isl_basic_set_simplify(bset
);
3271 return isl_basic_set_finalize(bset
);
3273 isl_basic_set_free(bset
);
3277 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
3282 set
= isl_set_cow(set
);
3286 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
3287 for (i
= 0; i
< set
->n
; ++i
) {
3288 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
3298 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
3302 map
= isl_map_cow(map
);
3306 map
->dim
= isl_dim_reverse(map
->dim
);
3309 for (i
= 0; i
< map
->n
; ++i
) {
3310 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
3314 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3321 static struct isl_map
*isl_basic_map_partial_lexopt(
3322 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3323 struct isl_set
**empty
, int max
)
3327 if (bmap
->ctx
->opt
->pip
== ISL_PIP_PIP
)
3328 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
3330 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
3332 isl_basic_map_free(bmap
);
3333 isl_basic_set_free(dom
);
3339 struct isl_map
*isl_basic_map_partial_lexmax(
3340 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3341 struct isl_set
**empty
)
3343 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
3346 struct isl_map
*isl_basic_map_partial_lexmin(
3347 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3348 struct isl_set
**empty
)
3350 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
3353 struct isl_set
*isl_basic_set_partial_lexmin(
3354 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3355 struct isl_set
**empty
)
3357 return (struct isl_set
*)
3358 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
3362 struct isl_set
*isl_basic_set_partial_lexmax(
3363 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3364 struct isl_set
**empty
)
3366 return (struct isl_set
*)
3367 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
3371 __isl_give isl_map
*isl_basic_map_lexopt(__isl_take isl_basic_map
*bmap
, int max
)
3373 struct isl_basic_set
*dom
= NULL
;
3374 struct isl_dim
*dom_dim
;
3378 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
3379 dom
= isl_basic_set_universe(dom_dim
);
3380 return isl_basic_map_partial_lexopt(bmap
, dom
, NULL
, max
);
3382 isl_basic_map_free(bmap
);
3386 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
3388 return isl_basic_map_lexopt(bmap
, 0);
3391 __isl_give isl_map
*isl_basic_map_lexmax(__isl_take isl_basic_map
*bmap
)
3393 return isl_basic_map_lexopt(bmap
, 1);
3396 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
3398 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
3401 __isl_give isl_set
*isl_basic_set_lexmax(__isl_take isl_basic_set
*bset
)
3403 return (isl_set
*)isl_basic_map_lexmax((isl_basic_map
*)bset
);
3406 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
3407 struct isl_dim
*dim
)
3414 for (i
= 0; i
< map
->n
; ++i
) {
3415 isl_dim_free(map
->p
[i
]->dim
);
3416 map
->p
[i
]->dim
= isl_dim_copy(dim
);
3418 isl_dim_free(map
->dim
);
3428 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
3429 struct isl_dim
*dim
)
3431 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3434 /* Apply a preimage specified by "mat" on the parameters of "bset".
3435 * bset is assumed to have only parameters and divs.
3437 static struct isl_basic_set
*basic_set_parameter_preimage(
3438 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
3445 bset
->dim
= isl_dim_cow(bset
->dim
);
3449 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3451 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3453 bset
->dim
->nparam
= 0;
3454 bset
->dim
->n_out
= nparam
;
3455 bset
= isl_basic_set_preimage(bset
, mat
);
3457 bset
->dim
->nparam
= bset
->dim
->n_out
;
3458 bset
->dim
->n_out
= 0;
3463 isl_basic_set_free(bset
);
3467 /* Apply a preimage specified by "mat" on the parameters of "set".
3468 * set is assumed to have only parameters and divs.
3470 static struct isl_set
*set_parameter_preimage(
3471 struct isl_set
*set
, struct isl_mat
*mat
)
3473 struct isl_dim
*dim
= NULL
;
3479 dim
= isl_dim_copy(set
->dim
);
3480 dim
= isl_dim_cow(dim
);
3484 nparam
= isl_set_dim(set
, isl_dim_param
);
3486 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3489 dim
->n_out
= nparam
;
3490 isl_set_reset_dim(set
, dim
);
3491 set
= isl_set_preimage(set
, mat
);
3494 dim
= isl_dim_copy(set
->dim
);
3495 dim
= isl_dim_cow(dim
);
3498 dim
->nparam
= dim
->n_out
;
3500 isl_set_reset_dim(set
, dim
);
3510 /* Intersect the basic set "bset" with the affine space specified by the
3511 * equalities in "eq".
3513 static struct isl_basic_set
*basic_set_append_equalities(
3514 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
3522 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
3527 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
3528 for (i
= 0; i
< eq
->n_row
; ++i
) {
3529 k
= isl_basic_set_alloc_equality(bset
);
3532 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
3533 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
3540 isl_basic_set_free(bset
);
3544 /* Intersect the set "set" with the affine space specified by the
3545 * equalities in "eq".
3547 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
3555 for (i
= 0; i
< set
->n
; ++i
) {
3556 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
3569 /* Project the given basic set onto its parameter domain, possibly introducing
3570 * new, explicit, existential variables in the constraints.
3571 * The input has parameters and (possibly implicit) existential variables.
3572 * The output has the same parameters, but only
3573 * explicit existentially quantified variables.
3575 * The actual projection is performed by pip, but pip doesn't seem
3576 * to like equalities very much, so we first remove the equalities
3577 * among the parameters by performing a variable compression on
3578 * the parameters. Afterward, an inverse transformation is performed
3579 * and the equalities among the parameters are inserted back in.
3581 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
3585 struct isl_mat
*T
, *T2
;
3586 struct isl_set
*set
;
3587 unsigned nparam
, n_div
;
3589 bset
= isl_basic_set_cow(bset
);
3593 if (bset
->n_eq
== 0)
3594 return isl_basic_set_lexmin(bset
);
3596 isl_basic_set_gauss(bset
, NULL
);
3598 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3599 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
3601 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
3602 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
3605 if (i
== bset
->n_eq
)
3606 return isl_basic_set_lexmin(bset
);
3608 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
3610 eq
= isl_mat_cow(eq
);
3611 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
3612 bset
= basic_set_parameter_preimage(bset
, T
);
3614 set
= isl_basic_set_lexmin(bset
);
3615 set
= set_parameter_preimage(set
, T2
);
3616 set
= set_append_equalities(set
, eq
);
3620 /* Compute an explicit representation for all the existentially
3621 * quantified variables.
3622 * The input and output dimensions are first turned into parameters.
3623 * compute_divs then returns a map with the same parameters and
3624 * no input or output dimensions and the dimension specification
3625 * is reset to that of the input.
3627 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
3629 struct isl_basic_set
*bset
;
3630 struct isl_set
*set
;
3631 struct isl_map
*map
;
3632 struct isl_dim
*dim
, *orig_dim
= NULL
;
3637 bmap
= isl_basic_map_cow(bmap
);
3641 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3642 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3643 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3644 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
3648 orig_dim
= bmap
->dim
;
3650 bset
= (struct isl_basic_set
*)bmap
;
3652 set
= parameter_compute_divs(bset
);
3653 map
= (struct isl_map
*)set
;
3654 map
= isl_map_reset_dim(map
, orig_dim
);
3658 isl_basic_map_free(bmap
);
3662 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
3670 off
= isl_dim_total(bmap
->dim
);
3671 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3672 if (isl_int_is_zero(bmap
->div
[i
][0]))
3674 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
3680 static int map_divs_known(__isl_keep isl_map
*map
)
3687 for (i
= 0; i
< map
->n
; ++i
) {
3688 int known
= basic_map_divs_known(map
->p
[i
]);
3696 /* If bmap contains any unknown divs, then compute explicit
3697 * expressions for them. However, this computation may be
3698 * quite expensive, so first try to remove divs that aren't
3701 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
3705 struct isl_map
*map
;
3707 known
= basic_map_divs_known(bmap
);
3711 return isl_map_from_basic_map(bmap
);
3713 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3715 known
= basic_map_divs_known(bmap
);
3719 return isl_map_from_basic_map(bmap
);
3721 map
= compute_divs(bmap
);
3724 isl_basic_map_free(bmap
);
3728 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
3732 struct isl_map
*res
;
3739 known
= map_divs_known(map
);
3747 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
3748 for (i
= 1 ; i
< map
->n
; ++i
) {
3750 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
3751 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
3752 res
= isl_map_union_disjoint(res
, r2
);
3754 res
= isl_map_union(res
, r2
);
3761 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
3763 return (struct isl_set
*)
3764 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
3767 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
3769 return (struct isl_set
*)
3770 isl_map_compute_divs((struct isl_map
*)set
);
3773 struct isl_set
*isl_map_domain(struct isl_map
*map
)
3776 struct isl_set
*set
;
3781 map
= isl_map_cow(map
);
3785 set
= (struct isl_set
*)map
;
3786 set
->dim
= isl_dim_domain(set
->dim
);
3789 for (i
= 0; i
< map
->n
; ++i
) {
3790 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
3794 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3795 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3802 struct isl_map
*isl_map_union_disjoint(
3803 struct isl_map
*map1
, struct isl_map
*map2
)
3807 struct isl_map
*map
= NULL
;
3821 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3823 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3824 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3825 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3827 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3828 map1
->n
+ map2
->n
, flags
);
3831 for (i
= 0; i
< map1
->n
; ++i
) {
3832 map
= isl_map_add(map
,
3833 isl_basic_map_copy(map1
->p
[i
]));
3837 for (i
= 0; i
< map2
->n
; ++i
) {
3838 map
= isl_map_add(map
,
3839 isl_basic_map_copy(map2
->p
[i
]));
3853 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
3855 map1
= isl_map_union_disjoint(map1
, map2
);
3859 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
3863 struct isl_set
*isl_set_union_disjoint(
3864 struct isl_set
*set1
, struct isl_set
*set2
)
3866 return (struct isl_set
*)
3867 isl_map_union_disjoint(
3868 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3871 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
3873 return (struct isl_set
*)
3874 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3877 struct isl_map
*isl_map_intersect_range(
3878 struct isl_map
*map
, struct isl_set
*set
)
3881 struct isl_map
*result
;
3887 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
3888 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
3889 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3891 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
3892 map
->n
* set
->n
, flags
);
3895 for (i
= 0; i
< map
->n
; ++i
)
3896 for (j
= 0; j
< set
->n
; ++j
) {
3897 result
= isl_map_add(result
,
3898 isl_basic_map_intersect_range(
3899 isl_basic_map_copy(map
->p
[i
]),
3900 isl_basic_set_copy(set
->p
[j
])));
3913 struct isl_map
*isl_map_intersect_domain(
3914 struct isl_map
*map
, struct isl_set
*set
)
3916 return isl_map_reverse(
3917 isl_map_intersect_range(isl_map_reverse(map
), set
));
3920 struct isl_map
*isl_map_apply_domain(
3921 struct isl_map
*map1
, struct isl_map
*map2
)
3925 map1
= isl_map_reverse(map1
);
3926 map1
= isl_map_apply_range(map1
, map2
);
3927 return isl_map_reverse(map1
);
3934 struct isl_map
*isl_map_apply_range(
3935 struct isl_map
*map1
, struct isl_map
*map2
)
3937 struct isl_dim
*dim_result
;
3938 struct isl_map
*result
;
3944 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
3945 isl_dim_copy(map2
->dim
));
3947 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
3950 for (i
= 0; i
< map1
->n
; ++i
)
3951 for (j
= 0; j
< map2
->n
; ++j
) {
3952 result
= isl_map_add(result
,
3953 isl_basic_map_apply_range(
3954 isl_basic_map_copy(map1
->p
[i
]),
3955 isl_basic_map_copy(map2
->p
[j
])));
3961 if (result
&& result
->n
<= 1)
3962 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
3971 * returns range - domain
3973 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
3975 struct isl_basic_set
*bset
;
3982 dim
= isl_basic_map_n_in(bmap
);
3983 nparam
= isl_basic_map_n_param(bmap
);
3984 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
3985 bset
= isl_basic_set_from_basic_map(bmap
);
3986 bset
= isl_basic_set_cow(bset
);
3987 bset
= isl_basic_set_extend(bset
, nparam
, 3*dim
, 0, dim
, 0);
3988 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
3989 for (i
= 0; i
< dim
; ++i
) {
3990 int j
= isl_basic_map_alloc_equality(
3991 (struct isl_basic_map
*)bset
);
3994 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
3995 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
3996 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
3997 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
3999 return isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
4001 isl_basic_map_free(bmap
);
4006 * returns range - domain
4008 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
4011 struct isl_set
*result
;
4016 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
4017 result
= isl_set_alloc(map
->ctx
, isl_map_n_param(map
),
4018 isl_map_n_in(map
), map
->n
, map
->flags
);
4021 for (i
= 0; i
< map
->n
; ++i
)
4022 result
= isl_set_add(result
,
4023 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
4031 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
4033 struct isl_basic_map
*bmap
;
4041 nparam
= dims
->nparam
;
4043 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
4047 for (i
= 0; i
< dim
; ++i
) {
4048 int j
= isl_basic_map_alloc_equality(bmap
);
4051 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
4052 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
4053 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
4055 return isl_basic_map_finalize(bmap
);
4057 isl_basic_map_free(bmap
);
4061 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
4063 struct isl_dim
*dim
= isl_dim_map(set_dim
);
4066 return basic_map_identity(dim
);
4069 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
4071 if (!model
|| !model
->dim
)
4073 isl_assert(model
->ctx
,
4074 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4075 return basic_map_identity(isl_dim_copy(model
->dim
));
4078 static struct isl_map
*map_identity(struct isl_dim
*dim
)
4080 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
4081 return isl_map_add(map
, basic_map_identity(isl_dim_copy(dim
)));
4084 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
4086 struct isl_dim
*dim
= isl_dim_map(set_dim
);
4089 return map_identity(dim
);
4092 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
4094 if (!model
|| !model
->dim
)
4096 isl_assert(model
->ctx
,
4097 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4098 return map_identity(isl_dim_copy(model
->dim
));
4101 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
4103 if (!model
|| !model
->dim
)
4105 isl_assert(model
->ctx
,
4106 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4107 return map_identity(isl_dim_copy(model
->dim
));
4110 /* Construct a basic set with all set dimensions having only non-negative
4113 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
4118 struct isl_basic_set
*bset
;
4122 nparam
= dims
->nparam
;
4124 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
4127 for (i
= 0; i
< dim
; ++i
) {
4128 int k
= isl_basic_set_alloc_inequality(bset
);
4131 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
4132 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
4136 isl_basic_set_free(bset
);
4140 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
4142 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
4145 int isl_set_is_subset(struct isl_set
*set1
, struct isl_set
*set2
)
4147 return isl_map_is_subset(
4148 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4151 int isl_basic_map_is_subset(
4152 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4155 struct isl_map
*map1
;
4156 struct isl_map
*map2
;
4158 if (!bmap1
|| !bmap2
)
4161 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
4162 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
4164 is_subset
= isl_map_is_subset(map1
, map2
);
4172 int isl_basic_map_is_equal(
4173 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4177 if (!bmap1
|| !bmap2
)
4179 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
4182 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
4186 int isl_basic_set_is_equal(
4187 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
4189 return isl_basic_map_is_equal(
4190 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
4193 int isl_map_is_empty(struct isl_map
*map
)
4200 for (i
= 0; i
< map
->n
; ++i
) {
4201 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
4210 int isl_map_fast_is_empty(struct isl_map
*map
)
4215 int isl_set_is_empty(struct isl_set
*set
)
4217 return isl_map_is_empty((struct isl_map
*)set
);
4220 /* Return 1 if "bmap" contains a single element.
4222 int isl_basic_map_is_singleton(__isl_keep isl_basic_map
*bmap
)
4230 return bmap
->n_eq
== isl_basic_map_total_dim(bmap
);
4233 /* Return 1 if "map" contains a single element.
4235 int isl_map_is_singleton(__isl_keep isl_map
*map
)
4242 return isl_basic_map_is_singleton(map
->p
[0]);
4245 /* Given a singleton basic map, extract the single element
4248 static __isl_give isl_vec
*singleton_extract_point(__isl_keep isl_basic_map
*bmap
)
4252 struct isl_vec
*point
;
4258 dim
= isl_basic_map_total_dim(bmap
);
4259 isl_assert(bmap
->ctx
, bmap
->n_eq
== dim
, return NULL
);
4260 point
= isl_vec_alloc(bmap
->ctx
, 1 + dim
);
4266 isl_int_set_si(point
->el
[0], 1);
4267 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
4269 int i
= dim
- 1 - j
;
4270 isl_assert(bmap
->ctx
,
4271 isl_seq_first_non_zero(bmap
->eq
[j
] + 1, i
) == -1,
4273 isl_assert(bmap
->ctx
,
4274 isl_int_is_one(bmap
->eq
[j
][1 + i
]) ||
4275 isl_int_is_negone(bmap
->eq
[j
][1 + i
]),
4277 isl_assert(bmap
->ctx
,
4278 isl_seq_first_non_zero(bmap
->eq
[j
]+1+i
+1, dim
-i
-1) == -1,
4281 isl_int_gcd(m
, point
->el
[0], bmap
->eq
[j
][1 + i
]);
4282 isl_int_divexact(m
, bmap
->eq
[j
][1 + i
], m
);
4284 isl_seq_scale(point
->el
, point
->el
, m
, 1 + i
);
4285 isl_int_divexact(m
, point
->el
[0], bmap
->eq
[j
][1 + i
]);
4287 isl_int_mul(point
->el
[1 + i
], m
, bmap
->eq
[j
][0]);
4294 isl_vec_free(point
);
4298 /* Return 1 if "bmap" contains the point "point".
4299 * "bmap" is assumed to have known divs.
4300 * The point is first extended with the divs and then passed
4301 * to basic_map_contains.
4303 static int basic_map_contains_point(__isl_keep isl_basic_map
*bmap
,
4304 __isl_keep isl_vec
*point
)
4307 struct isl_vec
*vec
;
4311 if (!bmap
|| !point
)
4313 if (bmap
->n_div
== 0)
4314 return isl_basic_map_contains(bmap
, point
);
4316 dim
= isl_basic_map_total_dim(bmap
) - bmap
->n_div
;
4317 vec
= isl_vec_alloc(bmap
->ctx
, 1 + dim
+ bmap
->n_div
);
4321 isl_seq_cpy(vec
->el
, point
->el
, point
->size
);
4322 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4323 isl_seq_inner_product(bmap
->div
[i
] + 1, vec
->el
,
4324 1 + dim
+ i
, &vec
->el
[1+dim
+i
]);
4325 isl_int_fdiv_q(vec
->el
[1+dim
+i
], vec
->el
[1+dim
+i
],
4329 contains
= isl_basic_map_contains(bmap
, vec
);
4335 /* Return 1 is the singleton map "map1" is a subset of "map2",
4336 * i.e., if the single element of "map1" is also an element of "map2".
4338 static int map_is_singleton_subset(__isl_keep isl_map
*map1
,
4339 __isl_keep isl_map
*map2
)
4343 struct isl_vec
*point
;
4350 point
= singleton_extract_point(map1
->p
[0]);
4354 for (i
= 0; i
< map2
->n
; ++i
) {
4355 is_subset
= basic_map_contains_point(map2
->p
[i
], point
);
4360 isl_vec_free(point
);
4364 int isl_map_is_subset(struct isl_map
*map1
, struct isl_map
*map2
)
4367 struct isl_map
*diff
;
4372 if (isl_map_is_empty(map1
))
4375 if (isl_map_is_empty(map2
))
4378 if (isl_map_fast_is_universe(map2
))
4381 map2
= isl_map_compute_divs(isl_map_copy(map2
));
4382 if (isl_map_is_singleton(map1
)) {
4383 is_subset
= map_is_singleton_subset(map1
, map2
);
4387 diff
= isl_map_subtract(isl_map_copy(map1
), map2
);
4391 is_subset
= isl_map_is_empty(diff
);
4397 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
4403 is_subset
= isl_map_is_subset(map1
, map2
);
4406 is_subset
= isl_map_is_subset(map2
, map1
);
4410 int isl_basic_map_is_strict_subset(
4411 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4415 if (!bmap1
|| !bmap2
)
4417 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
4420 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
4421 if (is_subset
== -1)
4426 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
4432 is_subset
= isl_map_is_subset(map1
, map2
);
4435 is_subset
= isl_map_is_subset(map2
, map1
);
4436 if (is_subset
== -1)
4441 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
4443 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
4446 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
4450 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
4453 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
4457 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
4460 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
4465 return map
->n
== 1 && isl_basic_map_is_universe(map
->p
[0]);
4468 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
4470 struct isl_basic_set
*bset
= NULL
;
4471 struct isl_vec
*sample
= NULL
;
4478 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
4481 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
4482 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
4483 copy
= isl_basic_map_convex_hull(copy
);
4484 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
4485 isl_basic_map_free(copy
);
4489 total
= 1 + isl_basic_map_total_dim(bmap
);
4490 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
4491 int contains
= isl_basic_map_contains(bmap
, bmap
->sample
);
4497 isl_vec_free(bmap
->sample
);
4498 bmap
->sample
= NULL
;
4499 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
4502 sample
= isl_basic_set_sample_vec(bset
);
4505 empty
= sample
->size
== 0;
4506 isl_vec_free(bmap
->sample
);
4507 bmap
->sample
= sample
;
4509 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
4514 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
4518 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
4521 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
4525 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
4528 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
4530 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
4533 struct isl_map
*isl_basic_map_union(
4534 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4536 struct isl_map
*map
;
4537 if (!bmap1
|| !bmap2
)
4540 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
4542 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
4545 map
= isl_map_add(map
, bmap1
);
4546 map
= isl_map_add(map
, bmap2
);
4549 isl_basic_map_free(bmap1
);
4550 isl_basic_map_free(bmap2
);
4554 struct isl_set
*isl_basic_set_union(
4555 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
4557 return (struct isl_set
*)isl_basic_map_union(
4558 (struct isl_basic_map
*)bset1
,
4559 (struct isl_basic_map
*)bset2
);
4562 /* Order divs such that any div only depends on previous divs */
4563 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
4566 unsigned off
= isl_dim_total(bmap
->dim
);
4568 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4570 if (isl_int_is_zero(bmap
->div
[i
][0]))
4572 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
4576 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
4582 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
4584 return (struct isl_basic_set
*)
4585 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
4588 /* Look for a div in dst that corresponds to the div "div" in src.
4589 * The divs before "div" in src and dst are assumed to be the same.
4591 * Returns -1 if no corresponding div was found and the position
4592 * of the corresponding div in dst otherwise.
4594 static int find_div(struct isl_basic_map
*dst
,
4595 struct isl_basic_map
*src
, unsigned div
)
4599 unsigned total
= isl_dim_total(src
->dim
);
4601 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
4602 for (i
= div
; i
< dst
->n_div
; ++i
)
4603 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
4604 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
4605 dst
->n_div
- div
) == -1)
4610 struct isl_basic_map
*isl_basic_map_align_divs(
4611 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
4614 unsigned total
= isl_dim_total(src
->dim
);
4619 if (src
->n_div
== 0)
4622 for (i
= 0; i
< src
->n_div
; ++i
)
4623 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
4625 src
= isl_basic_map_order_divs(src
);
4626 dst
= isl_basic_map_cow(dst
);
4627 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
4628 src
->n_div
, 0, 2 * src
->n_div
);
4631 for (i
= 0; i
< src
->n_div
; ++i
) {
4632 int j
= find_div(dst
, src
, i
);
4634 j
= isl_basic_map_alloc_div(dst
);
4637 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
4638 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
4639 if (add_div_constraints(dst
, j
) < 0)
4643 isl_basic_map_swap_div(dst
, i
, j
);
4647 isl_basic_map_free(dst
);
4651 struct isl_basic_set
*isl_basic_set_align_divs(
4652 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
4654 return (struct isl_basic_set
*)isl_basic_map_align_divs(
4655 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
4658 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
4666 map
= isl_map_compute_divs(map
);
4667 map
= isl_map_cow(map
);
4671 for (i
= 1; i
< map
->n
; ++i
)
4672 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
4673 for (i
= 1; i
< map
->n
; ++i
)
4674 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
4676 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4680 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
4682 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
4685 static struct isl_map
*add_cut_constraint(struct isl_map
*dst
,
4686 struct isl_basic_map
*src
, isl_int
*c
,
4687 unsigned len
, int oppose
)
4689 struct isl_basic_map
*copy
= NULL
;
4694 copy
= isl_basic_map_copy(src
);
4695 copy
= isl_basic_map_cow(copy
);
4698 copy
= isl_basic_map_extend_constraints(copy
, 0, 1);
4699 k
= isl_basic_map_alloc_inequality(copy
);
4703 isl_seq_neg(copy
->ineq
[k
], c
, len
);
4705 isl_seq_cpy(copy
->ineq
[k
], c
, len
);
4706 total
= 1 + isl_basic_map_total_dim(copy
);
4707 isl_seq_clr(copy
->ineq
[k
]+len
, total
- len
);
4708 isl_inequality_negate(copy
, k
);
4709 copy
= isl_basic_map_simplify(copy
);
4710 copy
= isl_basic_map_finalize(copy
);
4711 is_empty
= isl_basic_map_is_empty(copy
);
4715 dst
= isl_map_add(dst
, copy
);
4717 isl_basic_map_free(copy
);
4720 isl_basic_map_free(copy
);
4725 static struct isl_map
*subtract(struct isl_map
*map
, struct isl_basic_map
*bmap
)
4729 struct isl_map
*rest
= NULL
;
4731 unsigned total
= isl_basic_map_total_dim(bmap
);
4733 map
= isl_map_cow(map
);
4738 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4739 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4741 max
= map
->n
* (2 * bmap
->n_eq
+ bmap
->n_ineq
);
4742 rest
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), max
, flags
);
4746 for (i
= 0; i
< map
->n
; ++i
) {
4747 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], bmap
);
4752 for (j
= 0; j
< map
->n
; ++j
)
4753 map
->p
[j
] = isl_basic_map_cow(map
->p
[j
]);
4755 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
4756 for (j
= 0; j
< map
->n
; ++j
) {
4757 rest
= add_cut_constraint(rest
,
4758 map
->p
[j
], bmap
->eq
[i
], 1+total
, 0);
4762 rest
= add_cut_constraint(rest
,
4763 map
->p
[j
], bmap
->eq
[i
], 1+total
, 1);
4767 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4771 k
= isl_basic_map_alloc_equality(map
->p
[j
]);
4774 isl_seq_cpy(map
->p
[j
]->eq
[k
], bmap
->eq
[i
], 1+total
);
4775 isl_seq_clr(map
->p
[j
]->eq
[k
]+1+total
,
4776 map
->p
[j
]->n_div
- bmap
->n_div
);
4780 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4781 for (j
= 0; j
< map
->n
; ++j
) {
4782 rest
= add_cut_constraint(rest
,
4783 map
->p
[j
], bmap
->ineq
[i
], 1+total
, 0);
4787 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4791 k
= isl_basic_map_alloc_inequality(map
->p
[j
]);
4794 isl_seq_cpy(map
->p
[j
]->ineq
[k
], bmap
->ineq
[i
], 1+total
);
4795 isl_seq_clr(map
->p
[j
]->ineq
[k
]+1+total
,
4796 map
->p
[j
]->n_div
- bmap
->n_div
);
4808 struct isl_map
*isl_map_subtract(struct isl_map
*map1
, struct isl_map
*map2
)
4814 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4816 if (isl_map_is_empty(map2
)) {
4821 map1
= isl_map_compute_divs(map1
);
4822 map2
= isl_map_compute_divs(map2
);
4826 map1
= isl_map_remove_empty_parts(map1
);
4827 map2
= isl_map_remove_empty_parts(map2
);
4829 for (i
= 0; map1
&& i
< map2
->n
; ++i
)
4830 map1
= subtract(map1
, map2
->p
[i
]);
4840 struct isl_set
*isl_set_subtract(struct isl_set
*set1
, struct isl_set
*set2
)
4842 return (struct isl_set
*)
4844 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4847 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
4851 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
4852 map
= isl_map_intersect_domain(map
, set
);
4853 set
= isl_map_range(map
);
4861 /* There is no need to cow as removing empty parts doesn't change
4862 * the meaning of the set.
4864 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
4871 for (i
= map
->n
-1; i
>= 0; --i
) {
4872 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
4874 isl_basic_map_free(map
->p
[i
]);
4875 if (i
!= map
->n
-1) {
4876 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4877 map
->p
[i
] = map
->p
[map
->n
-1];
4885 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
4887 return (struct isl_set
*)
4888 isl_map_remove_empty_parts((struct isl_map
*)set
);
4891 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
4893 struct isl_basic_map
*bmap
;
4894 if (!map
|| map
->n
== 0)
4896 bmap
= map
->p
[map
->n
-1];
4897 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
4898 return isl_basic_map_copy(bmap
);
4901 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
4903 return (struct isl_basic_set
*)
4904 isl_map_copy_basic_map((struct isl_map
*)set
);
4907 __isl_give isl_map
*isl_map_drop_basic_map(__isl_take isl_map
*map
,
4908 __isl_keep isl_basic_map
*bmap
)
4914 for (i
= map
->n
-1; i
>= 0; --i
) {
4915 if (map
->p
[i
] != bmap
)
4917 map
= isl_map_cow(map
);
4920 isl_basic_map_free(map
->p
[i
]);
4921 if (i
!= map
->n
-1) {
4922 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
4923 map
->p
[i
] = map
->p
[map
->n
-1];
4934 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
4935 struct isl_basic_set
*bset
)
4937 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
4938 (struct isl_basic_map
*)bset
);
4941 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4942 * for any common value of the parameters and dimensions preceding dim
4943 * in both basic sets, the values of dimension pos in bset1 are
4944 * smaller or larger than those in bset2.
4947 * 1 if bset1 follows bset2
4948 * -1 if bset1 precedes bset2
4949 * 0 if bset1 and bset2 are incomparable
4950 * -2 if some error occurred.
4952 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
4953 struct isl_basic_set
*bset2
, int pos
)
4955 struct isl_dim
*dims
;
4956 struct isl_basic_map
*bmap1
= NULL
;
4957 struct isl_basic_map
*bmap2
= NULL
;
4958 struct isl_ctx
*ctx
;
4959 struct isl_vec
*obj
;
4962 unsigned dim1
, dim2
;
4964 enum isl_lp_result res
;
4967 if (!bset1
|| !bset2
)
4970 nparam
= isl_basic_set_n_param(bset1
);
4971 dim1
= isl_basic_set_n_dim(bset1
);
4972 dim2
= isl_basic_set_n_dim(bset2
);
4973 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
4974 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
4975 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
4976 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
4977 if (!bmap1
|| !bmap2
)
4979 bmap1
= isl_basic_map_cow(bmap1
);
4980 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
4981 pos
, (dim1
- pos
) + (dim2
- pos
),
4982 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
4983 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
4986 total
= isl_basic_map_total_dim(bmap1
);
4988 obj
= isl_vec_alloc(ctx
, 1 + total
);
4989 isl_seq_clr(obj
->block
.data
, 1 + total
);
4990 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
4991 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
4996 res
= isl_basic_map_solve_lp(bmap1
, 0, obj
->block
.data
, ctx
->one
,
4998 if (res
== isl_lp_empty
)
5000 else if (res
== isl_lp_ok
&& isl_int_is_pos(num
))
5002 else if ((res
== isl_lp_ok
&& isl_int_is_neg(num
)) ||
5003 res
== isl_lp_unbounded
)
5009 isl_basic_map_free(bmap1
);
5013 isl_basic_map_free(bmap1
);
5014 isl_basic_map_free(bmap2
);
5018 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
5019 unsigned pos
, isl_int
*val
)
5027 total
= isl_basic_map_total_dim(bmap
);
5028 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
5029 for (; d
+1 > pos
; --d
)
5030 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
5034 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
5036 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
5038 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
5041 isl_int_neg(*val
, bmap
->eq
[i
][0]);
5047 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
5048 unsigned pos
, isl_int
*val
)
5060 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
5063 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
5064 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
5065 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
5066 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5070 isl_int_set(*val
, v
);
5076 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
5077 unsigned pos
, isl_int
*val
)
5079 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
5083 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
5086 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
5089 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
5090 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5092 if (pos
>= isl_basic_map_dim(bmap
, type
))
5094 return isl_basic_map_fast_has_fixed_var(bmap
,
5095 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
5098 int isl_map_fast_is_fixed(struct isl_map
*map
,
5099 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5101 if (pos
>= isl_map_dim(map
, type
))
5103 return isl_map_fast_has_fixed_var(map
,
5104 map_offset(map
, type
) - 1 + pos
, val
);
5107 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5108 * then return this fixed value in *val.
5110 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
5113 return isl_basic_set_fast_has_fixed_var(bset
,
5114 isl_basic_set_n_param(bset
) + dim
, val
);
5117 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5118 * then return this fixed value in *val.
5120 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
5122 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
5125 /* Check if input variable in has fixed value and if so and if val is not NULL,
5126 * then return this fixed value in *val.
5128 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
5130 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
5133 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5134 * and if val is not NULL, then return this lower bound in *val.
5136 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
5137 unsigned dim
, isl_int
*val
)
5139 int i
, i_eq
= -1, i_ineq
= -1;
5146 total
= isl_basic_set_total_dim(bset
);
5147 nparam
= isl_basic_set_n_param(bset
);
5148 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5149 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
5155 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5156 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
5158 if (i_eq
!= -1 || i_ineq
!= -1)
5162 if (i_eq
== -1 && i_ineq
== -1)
5164 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
5165 /* The coefficient should always be one due to normalization. */
5166 if (!isl_int_is_one(c
[1+nparam
+dim
]))
5168 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
5170 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
5171 total
- nparam
- dim
- 1) != -1)
5174 isl_int_neg(*val
, c
[0]);
5178 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
5179 unsigned dim
, isl_int
*val
)
5191 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5195 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5197 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
5198 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
5200 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5204 isl_int_set(*val
, v
);
5215 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
5217 const struct constraint
*c1
= (const struct constraint
*)p1
;
5218 const struct constraint
*c2
= (const struct constraint
*)p2
;
5219 unsigned size
= isl_min(c1
->size
, c2
->size
);
5220 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
5223 static struct isl_basic_map
*isl_basic_map_sort_constraints(
5224 struct isl_basic_map
*bmap
)
5227 struct constraint
*c
;
5232 total
= isl_basic_map_total_dim(bmap
);
5233 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
5236 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
5238 c
[i
].c
= bmap
->ineq
[i
];
5240 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
5241 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
5242 bmap
->ineq
[i
] = c
[i
].c
;
5246 isl_basic_map_free(bmap
);
5250 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
5254 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
5256 bmap
= isl_basic_map_convex_hull(bmap
);
5257 bmap
= isl_basic_map_sort_constraints(bmap
);
5258 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
5262 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
5264 return (struct isl_basic_set
*)isl_basic_map_normalize(
5265 (struct isl_basic_map
*)bset
);
5268 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
5269 const struct isl_basic_map
*bmap2
)
5276 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
5277 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
5278 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
5279 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5280 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
5281 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5282 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
5283 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
5285 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
5287 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
5289 if (bmap1
->n_eq
!= bmap2
->n_eq
)
5290 return bmap1
->n_eq
- bmap2
->n_eq
;
5291 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
5292 return bmap1
->n_ineq
- bmap2
->n_ineq
;
5293 if (bmap1
->n_div
!= bmap2
->n_div
)
5294 return bmap1
->n_div
- bmap2
->n_div
;
5295 total
= isl_basic_map_total_dim(bmap1
);
5296 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
5297 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
5301 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
5302 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
5306 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
5307 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
5314 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
5315 struct isl_basic_map
*bmap2
)
5317 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
5320 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
5322 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
5323 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
5325 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
5328 /* We normalize in place, but if anything goes wrong we need
5329 * to return NULL, so we need to make sure we don't change the
5330 * meaning of any possible other copies of map.
5332 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
5335 struct isl_basic_map
*bmap
;
5339 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
5341 for (i
= 0; i
< map
->n
; ++i
) {
5342 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
5345 isl_basic_map_free(map
->p
[i
]);
5348 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
5349 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
5350 map
= isl_map_remove_empty_parts(map
);
5353 for (i
= map
->n
- 1; i
>= 1; --i
) {
5354 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
5356 isl_basic_map_free(map
->p
[i
-1]);
5357 for (j
= i
; j
< map
->n
; ++j
)
5358 map
->p
[j
-1] = map
->p
[j
];
5368 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
5370 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
5373 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5383 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
5386 map1
= isl_map_copy(map1
);
5387 map2
= isl_map_copy(map2
);
5388 map1
= isl_map_normalize(map1
);
5389 map2
= isl_map_normalize(map2
);
5392 equal
= map1
->n
== map2
->n
;
5393 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
5394 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
5407 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5409 return isl_map_fast_is_equal((struct isl_map
*)set1
,
5410 (struct isl_map
*)set2
);
5413 /* Return an interval that ranges from min to max (inclusive)
5415 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
5416 isl_int min
, isl_int max
)
5419 struct isl_basic_set
*bset
= NULL
;
5421 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
5425 k
= isl_basic_set_alloc_inequality(bset
);
5428 isl_int_set_si(bset
->ineq
[k
][1], 1);
5429 isl_int_neg(bset
->ineq
[k
][0], min
);
5431 k
= isl_basic_set_alloc_inequality(bset
);
5434 isl_int_set_si(bset
->ineq
[k
][1], -1);
5435 isl_int_set(bset
->ineq
[k
][0], max
);
5439 isl_basic_set_free(bset
);
5443 /* Return the Cartesian product of the basic sets in list (in the given order).
5445 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
5453 struct isl_basic_set
*product
= NULL
;
5457 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
5458 isl_assert(list
->ctx
, list
->p
[0], goto error
);
5459 nparam
= isl_basic_set_n_param(list
->p
[0]);
5460 dim
= isl_basic_set_n_dim(list
->p
[0]);
5461 extra
= list
->p
[0]->n_div
;
5462 n_eq
= list
->p
[0]->n_eq
;
5463 n_ineq
= list
->p
[0]->n_ineq
;
5464 for (i
= 1; i
< list
->n
; ++i
) {
5465 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
5466 isl_assert(list
->ctx
,
5467 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
5468 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
5469 extra
+= list
->p
[i
]->n_div
;
5470 n_eq
+= list
->p
[i
]->n_eq
;
5471 n_ineq
+= list
->p
[i
]->n_ineq
;
5473 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
5478 for (i
= 0; i
< list
->n
; ++i
) {
5479 isl_basic_set_add_constraints(product
,
5480 isl_basic_set_copy(list
->p
[i
]), dim
);
5481 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
5483 isl_basic_set_list_free(list
);
5486 isl_basic_set_free(product
);
5487 isl_basic_set_list_free(list
);
5491 struct isl_basic_map
*isl_basic_map_product(
5492 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5494 struct isl_dim
*dim_result
= NULL
;
5495 struct isl_basic_map
*bmap
;
5496 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
5497 struct isl_dim_map
*dim_map1
, *dim_map2
;
5499 if (!bmap1
|| !bmap2
)
5502 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
5503 bmap2
->dim
, isl_dim_param
), goto error
);
5504 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
5505 isl_dim_copy(bmap2
->dim
));
5507 in1
= isl_basic_map_n_in(bmap1
);
5508 in2
= isl_basic_map_n_in(bmap2
);
5509 out1
= isl_basic_map_n_out(bmap1
);
5510 out2
= isl_basic_map_n_out(bmap2
);
5511 nparam
= isl_basic_map_n_param(bmap1
);
5513 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
5514 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
5515 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
5516 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
5517 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
5518 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
5519 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
5520 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
5521 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
5522 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
5523 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
5525 bmap
= isl_basic_map_alloc_dim(dim_result
,
5526 bmap1
->n_div
+ bmap2
->n_div
,
5527 bmap1
->n_eq
+ bmap2
->n_eq
,
5528 bmap1
->n_ineq
+ bmap2
->n_ineq
);
5529 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
5530 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
5531 bmap
= isl_basic_map_simplify(bmap
);
5532 return isl_basic_map_finalize(bmap
);
5534 isl_basic_map_free(bmap1
);
5535 isl_basic_map_free(bmap2
);
5539 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5541 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
5544 struct isl_map
*result
;
5550 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
5551 map2
->dim
, isl_dim_param
), goto error
);
5553 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5554 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5555 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5557 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
5558 isl_dim_copy(map2
->dim
)),
5559 map1
->n
* map2
->n
, flags
);
5562 for (i
= 0; i
< map1
->n
; ++i
)
5563 for (j
= 0; j
< map2
->n
; ++j
) {
5564 struct isl_basic_map
*part
;
5565 part
= isl_basic_map_product(
5566 isl_basic_map_copy(map1
->p
[i
]),
5567 isl_basic_map_copy(map2
->p
[j
]));
5568 if (isl_basic_map_is_empty(part
))
5569 isl_basic_map_free(part
);
5571 result
= isl_map_add(result
, part
);
5584 /* Given two set A and B, construct its Cartesian product A x B.
5586 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
5588 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
5589 (struct isl_map
*)set2
);
5592 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
5595 uint32_t hash
= isl_hash_init();
5600 bset
= isl_basic_set_copy(bset
);
5601 bset
= isl_basic_set_normalize(bset
);
5604 total
= isl_basic_set_total_dim(bset
);
5605 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
5606 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5608 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
5609 isl_hash_hash(hash
, c_hash
);
5611 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
5612 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5614 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
5615 isl_hash_hash(hash
, c_hash
);
5617 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
5618 for (i
= 0; i
< bset
->n_div
; ++i
) {
5620 if (isl_int_is_zero(bset
->div
[i
][0]))
5622 isl_hash_byte(hash
, i
& 0xFF);
5623 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
5624 isl_hash_hash(hash
, c_hash
);
5626 isl_basic_set_free(bset
);
5630 uint32_t isl_set_get_hash(struct isl_set
*set
)
5637 set
= isl_set_copy(set
);
5638 set
= isl_set_normalize(set
);
5642 hash
= isl_hash_init();
5643 for (i
= 0; i
< set
->n
; ++i
) {
5645 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
5646 isl_hash_hash(hash
, bset_hash
);
5654 /* Check if the value for dimension dim is completely determined
5655 * by the values of the other parameters and variables.
5656 * That is, check if dimension dim is involved in an equality.
5658 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
5665 nparam
= isl_basic_set_n_param(bset
);
5666 for (i
= 0; i
< bset
->n_eq
; ++i
)
5667 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
5672 /* Check if the value for dimension dim is completely determined
5673 * by the values of the other parameters and variables.
5674 * That is, check if dimension dim is involved in an equality
5675 * for each of the subsets.
5677 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
5683 for (i
= 0; i
< set
->n
; ++i
) {
5685 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
5692 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
5693 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
5700 for (i
= 0; i
< map
->n
; ++i
)
5701 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
5707 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
5708 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
5715 for (i
= 0; i
< set
->n
; ++i
)
5716 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
5722 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
5724 struct isl_dim
*dim
;
5725 struct isl_basic_map
*bmap
;
5732 set
= isl_set_align_divs(set
);
5737 dim
= isl_set_get_dim(set
);
5738 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
5740 return isl_map_identity(dim
);
5743 n_div
= set
->p
[0]->n_div
;
5744 dim
= isl_dim_map(dim
);
5745 n_param
= isl_dim_size(dim
, isl_dim_param
);
5746 n_set
= isl_dim_size(dim
, isl_dim_in
);
5747 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
5748 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
5749 for (i
= 0; i
< n_set
; ++i
)
5750 bmap
= var_equal(bmap
, i
);
5752 total
= n_param
+ n_set
+ n_set
+ n_div
;
5753 for (i
= 0; i
< n_div
; ++i
) {
5754 k
= isl_basic_map_alloc_inequality(bmap
);
5757 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
5758 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
5759 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
5760 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
5761 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
5762 set
->p
[0]->div
[i
][0]);
5764 l
= isl_basic_map_alloc_inequality(bmap
);
5767 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
5768 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
5769 set
->p
[0]->div
[i
][0]);
5770 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
5774 return isl_map_from_basic_map(bmap
);
5777 isl_basic_map_free(bmap
);
5781 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
5789 dim
= isl_basic_set_total_dim(bset
);
5790 size
+= bset
->n_eq
* (1 + dim
);
5791 size
+= bset
->n_ineq
* (1 + dim
);
5792 size
+= bset
->n_div
* (2 + dim
);
5797 int isl_set_size(__isl_keep isl_set
*set
)
5805 for (i
= 0; i
< set
->n
; ++i
)
5806 size
+= isl_basic_set_size(set
->p
[i
]);