6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
17 /* Maps dst positions to src positions */
23 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
26 struct isl_dim_map
*dim_map
;
27 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
28 sizeof(struct isl_dim_map
) + len
* sizeof(int));
31 dim_map
->len
= 1 + len
;
33 for (i
= 0; i
< len
; ++i
)
34 dim_map
->pos
[1 + i
] = -1;
38 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
41 case isl_dim_param
: return dim
->nparam
;
42 case isl_dim_in
: return dim
->n_in
;
43 case isl_dim_out
: return dim
->n_out
;
44 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
48 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
51 case isl_dim_param
: return 1;
52 case isl_dim_in
: return 1 + dim
->nparam
;
53 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
57 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
58 enum isl_dim_type type
, unsigned dst_pos
)
66 src_pos
= pos(dim
, type
);
67 for (i
= 0; i
< n(dim
, type
); ++i
)
68 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
71 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
72 struct isl_basic_map
*bmap
, unsigned dst_pos
)
77 if (!dim_map
|| !bmap
)
80 src_pos
= 1 + isl_dim_total(bmap
->dim
);
81 for (i
= 0; i
< bmap
->n_div
; ++i
)
82 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
85 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
89 for (i
= 0; i
< dim_map
->len
; ++i
)
90 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
91 fprintf(stderr
, "\n");
94 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
95 enum isl_dim_type type
)
97 struct isl_dim
*dim
= bmap
->dim
;
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 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
647 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
648 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
649 1 + 1 + isl_basic_map_total_dim(bmap
),
650 bmap
->extra
- bmap
->n_div
);
651 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
652 return bmap
->n_div
++;
655 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
657 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
660 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
664 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
669 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
671 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
674 /* Copy constraint from src to dst, putting the vars of src at offset
675 * dim_off in dst and the divs of src at offset div_off in dst.
676 * If both sets are actually map, then dim_off applies to the input
679 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
680 struct isl_basic_map
*src_map
, isl_int
*src
,
681 unsigned in_off
, unsigned out_off
, unsigned div_off
)
683 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
684 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
685 unsigned src_in
= isl_basic_map_n_in(src_map
);
686 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
687 unsigned src_out
= isl_basic_map_n_out(src_map
);
688 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
689 isl_int_set(dst
[0], src
[0]);
690 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
691 if (dst_nparam
> src_nparam
)
692 isl_seq_clr(dst
+1+src_nparam
,
693 dst_nparam
- src_nparam
);
694 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
695 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
697 isl_min(dst_in
-in_off
, src_in
));
698 if (dst_in
-in_off
> src_in
)
699 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
700 dst_in
- in_off
- src_in
);
701 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
702 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
703 src
+1+src_nparam
+src_in
,
704 isl_min(dst_out
-out_off
, src_out
));
705 if (dst_out
-out_off
> src_out
)
706 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
707 dst_out
- out_off
- src_out
);
708 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
709 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
710 src
+1+src_nparam
+src_in
+src_out
,
711 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
712 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
713 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
714 div_off
+src_map
->n_div
,
715 dst_map
->n_div
- div_off
- src_map
->n_div
);
718 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
719 struct isl_basic_map
*src_map
, isl_int
*src
,
720 unsigned in_off
, unsigned out_off
, unsigned div_off
)
722 isl_int_set(dst
[0], src
[0]);
723 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
726 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
727 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
732 if (!bmap1
|| !bmap2
)
735 div_off
= bmap1
->n_div
;
737 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
738 int i1
= isl_basic_map_alloc_equality(bmap1
);
741 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
742 i_pos
, o_pos
, div_off
);
745 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
746 int i1
= isl_basic_map_alloc_inequality(bmap1
);
749 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
750 i_pos
, o_pos
, div_off
);
753 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
754 int i1
= isl_basic_map_alloc_div(bmap1
);
757 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
758 i_pos
, o_pos
, div_off
);
761 isl_basic_map_free(bmap2
);
766 isl_basic_map_free(bmap1
);
767 isl_basic_map_free(bmap2
);
771 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
772 struct isl_dim_map
*dim_map
)
776 for (i
= 0; i
< dim_map
->len
; ++i
) {
777 if (dim_map
->pos
[i
] < 0)
778 isl_int_set_si(dst
[i
], 0);
780 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
784 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
785 struct isl_dim_map
*dim_map
)
787 isl_int_set(dst
[0], src
[0]);
788 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
791 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
792 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
796 if (!src
|| !dst
|| !dim_map
)
799 for (i
= 0; i
< src
->n_eq
; ++i
) {
800 int i1
= isl_basic_map_alloc_equality(dst
);
803 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
806 for (i
= 0; i
< src
->n_ineq
; ++i
) {
807 int i1
= isl_basic_map_alloc_inequality(dst
);
810 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
813 for (i
= 0; i
< src
->n_div
; ++i
) {
814 int i1
= isl_basic_map_alloc_div(dst
);
817 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
821 isl_basic_map_free(src
);
826 isl_basic_map_free(src
);
827 isl_basic_map_free(dst
);
831 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
832 struct isl_basic_set
*bset2
, unsigned pos
)
834 return (struct isl_basic_set
*)
835 add_constraints((struct isl_basic_map
*)bset1
,
836 (struct isl_basic_map
*)bset2
, 0, pos
);
839 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
840 struct isl_dim
*dim
, unsigned extra
,
841 unsigned n_eq
, unsigned n_ineq
)
843 struct isl_basic_map
*ext
;
853 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
854 base
->extra
>= base
->n_div
+ extra
;
856 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
857 room_for_ineq(base
, n_ineq
)) {
862 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
863 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
864 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
865 extra
+= base
->extra
;
867 n_ineq
+= base
->n_ineq
;
869 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
875 ext
= add_constraints(ext
, base
, 0, 0);
878 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
885 isl_basic_map_free(base
);
889 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
890 struct isl_dim
*dim
, unsigned extra
,
891 unsigned n_eq
, unsigned n_ineq
)
893 return (struct isl_basic_set
*)
894 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
895 extra
, n_eq
, n_ineq
);
898 struct isl_basic_map
*isl_basic_map_extend_constraints(
899 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
903 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
907 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
908 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
909 unsigned n_eq
, unsigned n_ineq
)
911 struct isl_basic_map
*bmap
;
916 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
920 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
924 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
925 unsigned nparam
, unsigned dim
, unsigned extra
,
926 unsigned n_eq
, unsigned n_ineq
)
928 return (struct isl_basic_set
*)
929 isl_basic_map_extend((struct isl_basic_map
*)base
,
930 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
933 struct isl_basic_set
*isl_basic_set_extend_constraints(
934 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
936 return (struct isl_basic_set
*)
937 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
941 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
943 return (struct isl_basic_set
*)
944 isl_basic_map_cow((struct isl_basic_map
*)bset
);
947 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
954 bmap
= isl_basic_map_dup(bmap
);
956 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
960 struct isl_set
*isl_set_cow(struct isl_set
*set
)
968 return isl_set_dup(set
);
971 struct isl_map
*isl_map_cow(struct isl_map
*map
)
979 return isl_map_dup(map
);
982 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
983 unsigned a_len
, unsigned b_len
)
985 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
986 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
987 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
990 struct isl_basic_set
*isl_basic_set_swap_vars(
991 struct isl_basic_set
*bset
, unsigned n
)
1001 nparam
= isl_basic_set_n_param(bset
);
1002 dim
= isl_basic_set_n_dim(bset
);
1003 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1008 bset
= isl_basic_set_cow(bset
);
1012 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1013 if (isl_blk_is_error(blk
))
1016 for (i
= 0; i
< bset
->n_eq
; ++i
)
1018 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1020 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1022 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1024 for (i
= 0; i
< bset
->n_div
; ++i
)
1026 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1028 isl_blk_free(bset
->ctx
, blk
);
1030 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1034 isl_basic_set_free(bset
);
1038 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1041 set
= isl_set_cow(set
);
1045 for (i
= 0; i
< set
->n
; ++i
) {
1046 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1052 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1056 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1062 total
= isl_basic_map_total_dim(bmap
);
1063 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1064 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1066 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1068 isl_basic_map_alloc_equality(bmap
);
1072 isl_int_set_si(bmap
->eq
[i
][0], 1);
1073 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1074 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1075 return isl_basic_map_finalize(bmap
);
1077 isl_basic_map_free(bmap
);
1081 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1083 return (struct isl_basic_set
*)
1084 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1087 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1090 unsigned off
= isl_dim_total(bmap
->dim
);
1091 isl_int
*t
= bmap
->div
[a
];
1092 bmap
->div
[a
] = bmap
->div
[b
];
1095 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1096 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1098 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1099 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1101 for (i
= 0; i
< bmap
->n_div
; ++i
)
1102 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1103 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1106 /* Eliminate the specified n dimensions starting at first from the
1107 * constraints using Fourier-Motzkin, The dimensions themselves
1110 struct isl_set
*isl_set_eliminate_dims(struct isl_set
*set
,
1111 unsigned first
, unsigned n
)
1121 set
= isl_set_cow(set
);
1124 isl_assert(set
->ctx
, first
+n
<= isl_set_n_dim(set
), goto error
);
1125 nparam
= isl_set_n_param(set
);
1127 for (i
= 0; i
< set
->n
; ++i
) {
1128 set
->p
[i
] = isl_basic_set_eliminate_vars(set
->p
[i
],
1139 /* Project out n dimensions starting at first using Fourier-Motzkin */
1140 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1141 unsigned first
, unsigned n
)
1143 set
= isl_set_eliminate_dims(set
, first
, n
);
1144 set
= isl_set_drop_dims(set
, first
, n
);
1148 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1150 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1158 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1167 set
= isl_set_cow(set
);
1171 for (i
= 0; i
< set
->n
; ++i
) {
1172 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1182 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1183 enum isl_dim_type type
, unsigned first
, unsigned n
)
1187 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1191 bmap
= isl_basic_map_eliminate_vars(bmap
,
1192 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1193 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1196 isl_basic_map_free(bmap
);
1200 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1201 enum isl_dim_type type
, unsigned first
, unsigned n
)
1209 map
= isl_map_cow(map
);
1212 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1214 for (i
= 0; i
< map
->n
; ++i
) {
1215 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1216 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1220 map
= isl_map_drop(map
, type
, first
, n
);
1227 /* Project out n inputs starting at first using Fourier-Motzkin */
1228 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1229 unsigned first
, unsigned n
)
1231 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1234 /* Project out n dimensions starting at first using Fourier-Motzkin */
1235 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1236 unsigned first
, unsigned n
)
1238 unsigned nparam
= isl_basic_set_n_param(bset
);
1239 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1240 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1244 static void dump_term(struct isl_basic_map
*bmap
,
1245 isl_int c
, int pos
, FILE *out
)
1248 unsigned in
= isl_basic_map_n_in(bmap
);
1249 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1250 unsigned nparam
= isl_basic_map_n_param(bmap
);
1252 isl_int_print(out
, c
, 0);
1254 if (!isl_int_is_one(c
))
1255 isl_int_print(out
, c
, 0);
1256 if (pos
< 1 + nparam
) {
1257 name
= isl_dim_get_name(bmap
->dim
,
1258 isl_dim_param
, pos
- 1);
1260 fprintf(out
, "%s", name
);
1262 fprintf(out
, "p%d", pos
- 1);
1263 } else if (pos
< 1 + nparam
+ in
)
1264 fprintf(out
, "i%d", pos
- 1 - nparam
);
1265 else if (pos
< 1 + nparam
+ dim
)
1266 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1268 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1272 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1273 int sign
, FILE *out
)
1277 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1281 for (i
= 0, first
= 1; i
< len
; ++i
) {
1282 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1285 fprintf(out
, " + ");
1287 isl_int_abs(v
, c
[i
]);
1288 dump_term(bmap
, v
, i
, out
);
1295 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1296 const char *op
, FILE *out
, int indent
)
1300 fprintf(out
, "%*s", indent
, "");
1302 dump_constraint_sign(bmap
, c
, 1, out
);
1303 fprintf(out
, " %s ", op
);
1304 dump_constraint_sign(bmap
, c
, -1, out
);
1308 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1309 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1311 fprintf(out
, "%*s", indent
, "");
1312 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1317 static void dump_constraints(struct isl_basic_map
*bmap
,
1318 isl_int
**c
, unsigned n
,
1319 const char *op
, FILE *out
, int indent
)
1323 for (i
= 0; i
< n
; ++i
)
1324 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1327 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1331 unsigned total
= isl_basic_map_total_dim(bmap
);
1333 for (j
= 0; j
< 1 + total
; ++j
) {
1334 if (isl_int_is_zero(exp
[j
]))
1336 if (!first
&& isl_int_is_pos(exp
[j
]))
1338 dump_term(bmap
, exp
[j
], j
, out
);
1343 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1347 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1348 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1350 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1351 fprintf(out
, "%*s", indent
, "");
1352 fprintf(out
, "e%d = [(", i
);
1353 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1355 isl_int_print(out
, bmap
->div
[i
][0], 0);
1356 fprintf(out
, "]\n");
1360 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1363 fprintf(out
, "null basic set\n");
1367 fprintf(out
, "%*s", indent
, "");
1368 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1369 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1370 bset
->extra
, bset
->flags
);
1371 dump((struct isl_basic_map
*)bset
, out
, indent
);
1374 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1377 fprintf(out
, "null basic map\n");
1381 fprintf(out
, "%*s", indent
, "");
1382 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1383 "flags: %x, n_name: %d\n",
1385 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1386 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1387 dump(bmap
, out
, indent
);
1390 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1395 total
= isl_basic_map_total_dim(bmap
);
1396 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1397 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1398 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1399 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1403 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1405 struct isl_set
*set
;
1409 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1410 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1411 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1412 sizeof(struct isl_set
) +
1413 n
* sizeof(struct isl_basic_set
*));
1417 set
->ctx
= dim
->ctx
;
1418 isl_ctx_ref(set
->ctx
);
1430 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1431 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1433 struct isl_set
*set
;
1434 struct isl_dim
*dims
;
1436 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1440 set
= isl_set_alloc_dim(dims
, n
, flags
);
1444 /* Make sure "map" has room for at least "n" more basic maps.
1446 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1449 struct isl_map
*grown
= NULL
;
1453 isl_assert(map
->ctx
, n
>= 0, goto error
);
1454 if (map
->n
+ n
<= map
->size
)
1456 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1459 for (i
= 0; i
< map
->n
; ++i
) {
1460 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1468 isl_map_free(grown
);
1473 /* Make sure "set" has room for at least "n" more basic sets.
1475 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1477 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1480 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1483 struct isl_set
*dup
;
1488 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1491 for (i
= 0; i
< set
->n
; ++i
)
1492 dup
= isl_set_add(dup
, isl_basic_set_copy(set
->p
[i
]));
1496 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1498 struct isl_set
*set
;
1503 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1505 isl_basic_set_free(bset
);
1508 return isl_set_add(set
, bset
);
1511 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1513 struct isl_map
*map
;
1518 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1520 isl_basic_map_free(bmap
);
1523 return isl_map_add(map
, bmap
);
1526 struct isl_set
*isl_set_add(struct isl_set
*set
, struct isl_basic_set
*bset
)
1528 return (struct isl_set
*)isl_map_add((struct isl_map
*)set
,
1529 (struct isl_basic_map
*)bset
);
1532 void isl_set_free(struct isl_set
*set
)
1542 isl_ctx_deref(set
->ctx
);
1543 for (i
= 0; i
< set
->n
; ++i
)
1544 isl_basic_set_free(set
->p
[i
]);
1545 isl_dim_free(set
->dim
);
1549 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1554 fprintf(out
, "null set\n");
1558 fprintf(out
, "%*s", indent
, "");
1559 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1560 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1562 for (i
= 0; i
< set
->n
; ++i
) {
1563 fprintf(out
, "%*s", indent
, "");
1564 fprintf(out
, "basic set %d:\n", i
);
1565 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1569 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1574 fprintf(out
, "null map\n");
1578 fprintf(out
, "%*s", indent
, "");
1579 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1580 "flags: %x, n_name: %d\n",
1581 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1582 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1583 for (i
= 0; i
< map
->n
; ++i
) {
1584 fprintf(out
, "%*s", indent
, "");
1585 fprintf(out
, "basic map %d:\n", i
);
1586 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1590 struct isl_basic_map
*isl_basic_map_intersect_domain(
1591 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1593 struct isl_basic_map
*bmap_domain
;
1594 struct isl_dim
*dim
;
1599 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1600 bset
->dim
, isl_dim_param
), goto error
);
1602 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1603 isl_assert(bset
->ctx
,
1604 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1606 bmap
= isl_basic_map_cow(bmap
);
1607 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1608 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1611 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1612 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1613 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1615 bmap
= isl_basic_map_simplify(bmap
);
1616 return isl_basic_map_finalize(bmap
);
1618 isl_basic_map_free(bmap
);
1619 isl_basic_set_free(bset
);
1623 struct isl_basic_map
*isl_basic_map_intersect_range(
1624 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1626 struct isl_basic_map
*bmap_range
;
1631 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1632 bset
->dim
, isl_dim_param
), goto error
);
1634 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1635 isl_assert(bset
->ctx
,
1636 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1638 bmap
= isl_basic_map_cow(bmap
);
1639 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1640 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1643 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1644 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1646 bmap
= isl_basic_map_simplify(bmap
);
1647 return isl_basic_map_finalize(bmap
);
1649 isl_basic_map_free(bmap
);
1650 isl_basic_set_free(bset
);
1654 static int basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1660 total
= 1 + isl_basic_map_total_dim(bmap
);
1661 if (total
!= vec
->size
)
1666 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1667 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1668 if (!isl_int_is_zero(s
)) {
1674 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1675 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1676 if (isl_int_is_neg(s
)) {
1687 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1689 return basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1692 struct isl_basic_map
*isl_basic_map_intersect(
1693 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1695 struct isl_vec
*sample
= NULL
;
1697 if (!bmap1
|| !bmap2
)
1700 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1701 bmap2
->dim
, isl_dim_param
), goto error
);
1702 if (isl_dim_total(bmap1
->dim
) ==
1703 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1704 isl_dim_total(bmap2
->dim
) !=
1705 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1706 return isl_basic_map_intersect(bmap2
, bmap1
);
1708 if (isl_dim_total(bmap2
->dim
) !=
1709 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1710 isl_assert(bmap1
->ctx
,
1711 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1713 if (bmap1
->sample
&&
1714 basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1715 basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1716 sample
= isl_vec_copy(bmap1
->sample
);
1717 else if (bmap2
->sample
&&
1718 basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1719 basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1720 sample
= isl_vec_copy(bmap2
->sample
);
1722 bmap1
= isl_basic_map_cow(bmap1
);
1723 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1724 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1727 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1730 isl_vec_free(bmap1
->sample
);
1731 bmap1
->sample
= sample
;
1734 bmap1
= isl_basic_map_simplify(bmap1
);
1735 return isl_basic_map_finalize(bmap1
);
1738 isl_vec_free(sample
);
1739 isl_basic_map_free(bmap1
);
1740 isl_basic_map_free(bmap2
);
1744 struct isl_basic_set
*isl_basic_set_intersect(
1745 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1747 return (struct isl_basic_set
*)
1748 isl_basic_map_intersect(
1749 (struct isl_basic_map
*)bset1
,
1750 (struct isl_basic_map
*)bset2
);
1753 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1756 struct isl_map
*result
;
1762 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1763 map2
->dim
, isl_dim_param
), goto error
);
1764 if (isl_dim_total(map1
->dim
) ==
1765 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1766 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1767 return isl_map_intersect(map2
, map1
);
1769 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1770 isl_assert(map1
->ctx
,
1771 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1773 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1774 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
1775 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
1777 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1778 map1
->n
* map2
->n
, flags
);
1781 for (i
= 0; i
< map1
->n
; ++i
)
1782 for (j
= 0; j
< map2
->n
; ++j
) {
1783 struct isl_basic_map
*part
;
1784 part
= isl_basic_map_intersect(
1785 isl_basic_map_copy(map1
->p
[i
]),
1786 isl_basic_map_copy(map2
->p
[j
]));
1787 if (isl_basic_map_is_empty(part
))
1788 isl_basic_map_free(part
);
1790 result
= isl_map_add(result
, part
);
1803 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1805 return (struct isl_set
*)
1806 isl_map_intersect((struct isl_map
*)set1
,
1807 (struct isl_map
*)set2
);
1810 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
1812 struct isl_dim
*dim
;
1813 struct isl_basic_set
*bset
;
1818 bmap
= isl_basic_map_cow(bmap
);
1821 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
1822 in
= isl_basic_map_n_in(bmap
);
1823 bset
= isl_basic_set_from_basic_map(bmap
);
1824 bset
= isl_basic_set_swap_vars(bset
, in
);
1825 return isl_basic_map_from_basic_set(bset
, dim
);
1828 /* Turn final n dimensions into existentially quantified variables.
1830 struct isl_basic_set
*isl_basic_set_project_out(
1831 struct isl_basic_set
*bset
, unsigned n
, unsigned flags
)
1841 isl_assert(bset
->ctx
, n
<= isl_basic_set_n_dim(bset
), goto error
);
1846 bset
= isl_basic_set_cow(bset
);
1848 row_size
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
1849 old
= bset
->block2
.data
;
1850 bset
->block2
= isl_blk_extend(bset
->ctx
, bset
->block2
,
1851 (bset
->extra
+ n
) * (1 + row_size
));
1852 if (!bset
->block2
.data
)
1854 new_div
= isl_alloc_array(ctx
, isl_int
*, bset
->extra
+ n
);
1857 for (i
= 0; i
< n
; ++i
) {
1858 new_div
[i
] = bset
->block2
.data
+
1859 (bset
->extra
+ i
) * (1 + row_size
);
1860 isl_seq_clr(new_div
[i
], 1 + row_size
);
1862 for (i
= 0; i
< bset
->extra
; ++i
)
1863 new_div
[n
+ i
] = bset
->block2
.data
+ (bset
->div
[i
] - old
);
1865 bset
->div
= new_div
;
1868 bset
->dim
= isl_dim_drop_outputs(bset
->dim
,
1869 isl_basic_set_n_dim(bset
) - n
, n
);
1872 bset
= isl_basic_set_simplify(bset
);
1873 return isl_basic_set_finalize(bset
);
1875 isl_basic_set_free(bset
);
1879 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
1883 for (i
= 0; i
< n
; ++i
) {
1884 j
= isl_basic_map_alloc_div(bmap
);
1887 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
1891 isl_basic_map_free(bmap
);
1895 struct isl_basic_map
*isl_basic_map_apply_range(
1896 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1898 struct isl_dim
*dim_result
= NULL
;
1899 struct isl_basic_map
*bmap
;
1900 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
1901 struct isl_dim_map
*dim_map1
, *dim_map2
;
1903 if (!bmap1
|| !bmap2
)
1906 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
1907 isl_dim_copy(bmap2
->dim
));
1909 n_in
= isl_basic_map_n_in(bmap1
);
1910 n_out
= isl_basic_map_n_out(bmap2
);
1911 n
= isl_basic_map_n_out(bmap1
);
1912 nparam
= isl_basic_map_n_param(bmap1
);
1914 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
1915 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1916 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1917 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
1918 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
1919 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
1920 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
1921 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
1922 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
1923 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
1924 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
1926 bmap
= isl_basic_map_alloc_dim(dim_result
,
1927 bmap1
->n_div
+ bmap2
->n_div
+ n
,
1928 bmap1
->n_eq
+ bmap2
->n_eq
,
1929 bmap1
->n_ineq
+ bmap2
->n_ineq
);
1930 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
1931 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
1932 bmap
= add_divs(bmap
, n
);
1933 bmap
= isl_basic_map_simplify(bmap
);
1934 return isl_basic_map_finalize(bmap
);
1936 isl_basic_map_free(bmap1
);
1937 isl_basic_map_free(bmap2
);
1941 struct isl_basic_set
*isl_basic_set_apply(
1942 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
1947 isl_assert(set
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
1950 return (struct isl_basic_set
*)
1951 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
1953 isl_basic_set_free(bset
);
1954 isl_basic_map_free(bmap
);
1958 struct isl_basic_map
*isl_basic_map_apply_domain(
1959 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1961 if (!bmap1
|| !bmap2
)
1965 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
1967 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
1970 bmap1
= isl_basic_map_reverse(bmap1
);
1971 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
1972 return isl_basic_map_reverse(bmap1
);
1974 isl_basic_map_free(bmap1
);
1975 isl_basic_map_free(bmap2
);
1979 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1980 * A \cap B -> f(A) + f(B)
1982 struct isl_basic_map
*isl_basic_map_sum(
1983 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1985 unsigned n_in
, n_out
, nparam
, total
, pos
;
1986 struct isl_basic_map
*bmap
= NULL
;
1987 struct isl_dim_map
*dim_map1
, *dim_map2
;
1990 if (!bmap1
|| !bmap2
)
1993 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
1996 nparam
= isl_basic_map_n_param(bmap1
);
1997 n_in
= isl_basic_map_n_in(bmap1
);
1998 n_out
= isl_basic_map_n_out(bmap1
);
2000 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2001 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2002 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2003 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2004 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2005 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2006 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2007 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2008 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2009 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2010 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2012 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2013 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2014 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2015 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2016 for (i
= 0; i
< n_out
; ++i
) {
2017 int j
= isl_basic_map_alloc_equality(bmap
);
2020 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2021 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2022 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2023 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2025 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2026 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2027 bmap
= add_divs(bmap
, 2 * n_out
);
2029 bmap
= isl_basic_map_simplify(bmap
);
2030 return isl_basic_map_finalize(bmap
);
2032 isl_basic_map_free(bmap
);
2033 isl_basic_map_free(bmap1
);
2034 isl_basic_map_free(bmap2
);
2038 /* Given a basic map A -> f(A), construct A -> -f(A).
2040 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2045 bmap
= isl_basic_map_cow(bmap
);
2049 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2050 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2051 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2052 for (j
= 0; j
< n
; ++j
)
2053 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2054 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2055 for (j
= 0; j
< n
; ++j
)
2056 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2057 for (i
= 0; i
< bmap
->n_div
; ++i
)
2058 for (j
= 0; j
< n
; ++j
)
2059 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2060 return isl_basic_map_finalize(bmap
);
2063 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2064 * A -> floor(f(A)/d).
2066 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2069 unsigned n_in
, n_out
, nparam
, total
, pos
;
2070 struct isl_basic_map
*result
= NULL
;
2071 struct isl_dim_map
*dim_map
;
2077 nparam
= isl_basic_map_n_param(bmap
);
2078 n_in
= isl_basic_map_n_in(bmap
);
2079 n_out
= isl_basic_map_n_out(bmap
);
2081 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2082 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2083 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2084 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2085 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2086 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2088 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2089 bmap
->n_div
+ n_out
,
2090 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2091 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2092 result
= add_divs(result
, n_out
);
2093 for (i
= 0; i
< n_out
; ++i
) {
2095 j
= isl_basic_map_alloc_inequality(result
);
2098 isl_seq_clr(result
->ineq
[j
], 1+total
);
2099 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2100 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2101 j
= isl_basic_map_alloc_inequality(result
);
2104 isl_seq_clr(result
->ineq
[j
], 1+total
);
2105 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2106 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2107 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2110 result
= isl_basic_map_simplify(result
);
2111 return isl_basic_map_finalize(result
);
2113 isl_basic_map_free(result
);
2117 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2123 i
= isl_basic_map_alloc_equality(bmap
);
2126 nparam
= isl_basic_map_n_param(bmap
);
2127 n_in
= isl_basic_map_n_in(bmap
);
2128 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2129 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2130 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2131 return isl_basic_map_finalize(bmap
);
2133 isl_basic_map_free(bmap
);
2137 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2143 i
= isl_basic_map_alloc_inequality(bmap
);
2146 nparam
= isl_basic_map_n_param(bmap
);
2147 n_in
= isl_basic_map_n_in(bmap
);
2148 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2149 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2150 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2151 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2152 return isl_basic_map_finalize(bmap
);
2154 isl_basic_map_free(bmap
);
2158 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2164 i
= isl_basic_map_alloc_inequality(bmap
);
2167 nparam
= isl_basic_map_n_param(bmap
);
2168 n_in
= isl_basic_map_n_in(bmap
);
2169 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2170 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2171 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2172 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2173 return isl_basic_map_finalize(bmap
);
2175 isl_basic_map_free(bmap
);
2179 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2182 struct isl_basic_map
*bmap
;
2183 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2186 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2187 bmap
= var_equal(bmap
, i
);
2188 return isl_basic_map_finalize(bmap
);
2191 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2194 struct isl_basic_map
*bmap
;
2195 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2198 for (i
= 0; i
< pos
&& bmap
; ++i
)
2199 bmap
= var_equal(bmap
, i
);
2201 bmap
= var_less(bmap
, pos
);
2202 return isl_basic_map_finalize(bmap
);
2205 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2208 struct isl_basic_map
*bmap
;
2209 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2212 for (i
= 0; i
< pos
&& bmap
; ++i
)
2213 bmap
= var_equal(bmap
, i
);
2215 bmap
= var_more(bmap
, pos
);
2216 return isl_basic_map_finalize(bmap
);
2219 struct isl_basic_map
*isl_basic_map_from_basic_set(
2220 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
2222 struct isl_basic_map
*bmap
;
2224 bset
= isl_basic_set_cow(bset
);
2228 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
2229 isl_dim_free(bset
->dim
);
2230 bmap
= (struct isl_basic_map
*) bset
;
2232 return isl_basic_map_finalize(bmap
);
2234 isl_basic_set_free(bset
);
2239 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
2243 if (bmap
->dim
->n_in
== 0)
2244 return (struct isl_basic_set
*)bmap
;
2245 bmap
= isl_basic_map_cow(bmap
);
2248 bmap
->dim
= isl_dim_cow(bmap
->dim
);
2251 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
2252 bmap
->dim
->n_in
= 0;
2253 bmap
= isl_basic_map_finalize(bmap
);
2254 return (struct isl_basic_set
*)bmap
;
2256 isl_basic_map_free(bmap
);
2260 /* For a div d = floor(f/m), add the constraints
2263 * -(f-(n-1)) + m d >= 0
2265 * Note that the second constraint is the negation of
2269 static int add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
2272 unsigned total
= isl_basic_map_total_dim(bmap
);
2273 unsigned div_pos
= 1 + total
- bmap
->n_div
+ div
;
2275 i
= isl_basic_map_alloc_inequality(bmap
);
2278 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
]+1, 1+total
);
2279 isl_int_neg(bmap
->ineq
[i
][div_pos
], bmap
->div
[div
][0]);
2281 j
= isl_basic_map_alloc_inequality(bmap
);
2284 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
2285 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][div_pos
]);
2286 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
2290 struct isl_basic_set
*isl_basic_map_underlying_set(
2291 struct isl_basic_map
*bmap
)
2295 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
2296 return (struct isl_basic_set
*)bmap
;
2297 bmap
= isl_basic_map_cow(bmap
);
2300 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
2303 bmap
->extra
-= bmap
->n_div
;
2305 bmap
= isl_basic_map_finalize(bmap
);
2306 return (struct isl_basic_set
*)bmap
;
2311 struct isl_basic_map
*isl_basic_map_overlying_set(
2312 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
2314 struct isl_basic_map
*bmap
;
2315 struct isl_ctx
*ctx
;
2322 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
2323 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
2324 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
2326 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
2327 isl_basic_map_free(like
);
2328 return (struct isl_basic_map
*)bset
;
2330 bset
= isl_basic_set_cow(bset
);
2333 total
= bset
->dim
->n_out
+ bset
->extra
;
2334 bmap
= (struct isl_basic_map
*)bset
;
2335 isl_dim_free(bmap
->dim
);
2336 bmap
->dim
= isl_dim_copy(like
->dim
);
2339 bmap
->n_div
= like
->n_div
;
2340 bmap
->extra
+= like
->n_div
;
2343 ltotal
= total
- bmap
->extra
+ like
->extra
;
2346 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
2347 bmap
->extra
* (1 + 1 + total
));
2348 if (isl_blk_is_error(bmap
->block2
))
2350 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
2354 for (i
= 0; i
< bmap
->extra
; ++i
)
2355 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
2356 for (i
= 0; i
< like
->n_div
; ++i
) {
2357 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
2358 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
2360 bmap
= isl_basic_map_extend_constraints(bmap
,
2361 0, 2 * like
->n_div
);
2362 for (i
= 0; i
< like
->n_div
; ++i
) {
2363 if (isl_int_is_zero(bmap
->div
[i
][0]))
2365 if (add_div_constraints(bmap
, i
) < 0)
2369 isl_basic_map_free(like
);
2370 bmap
= isl_basic_map_simplify(bmap
);
2371 bmap
= isl_basic_map_finalize(bmap
);
2374 isl_basic_map_free(like
);
2375 isl_basic_set_free(bset
);
2379 struct isl_basic_set
*isl_basic_set_from_underlying_set(
2380 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
2382 return (struct isl_basic_set
*)
2383 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
2386 struct isl_set
*isl_set_from_underlying_set(
2387 struct isl_set
*set
, struct isl_basic_set
*like
)
2393 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
2395 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
2396 isl_basic_set_free(like
);
2399 set
= isl_set_cow(set
);
2402 for (i
= 0; i
< set
->n
; ++i
) {
2403 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
2404 isl_basic_set_copy(like
));
2408 isl_dim_free(set
->dim
);
2409 set
->dim
= isl_dim_copy(like
->dim
);
2412 isl_basic_set_free(like
);
2415 isl_basic_set_free(like
);
2420 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
2424 map
= isl_map_cow(map
);
2427 map
->dim
= isl_dim_cow(map
->dim
);
2431 for (i
= 1; i
< map
->n
; ++i
)
2432 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
2434 for (i
= 0; i
< map
->n
; ++i
) {
2435 map
->p
[i
] = (struct isl_basic_map
*)
2436 isl_basic_map_underlying_set(map
->p
[i
]);
2441 map
->dim
= isl_dim_underlying(map
->dim
, 0);
2443 isl_dim_free(map
->dim
);
2444 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
2448 return (struct isl_set
*)map
;
2454 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
2456 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
2459 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
2461 struct isl_basic_set
*domain
;
2465 n_out
= isl_basic_map_n_out(bmap
);
2466 domain
= isl_basic_set_from_basic_map(bmap
);
2467 return isl_basic_set_project_out(domain
, n_out
, 0);
2470 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
2472 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
2475 struct isl_set
*isl_map_range(struct isl_map
*map
)
2478 struct isl_set
*set
;
2482 map
= isl_map_cow(map
);
2486 set
= (struct isl_set
*) map
;
2487 if (set
->dim
->n_in
!= 0) {
2488 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
2492 for (i
= 0; i
< map
->n
; ++i
) {
2493 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
2497 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
2498 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
2505 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
2508 struct isl_map
*map
= NULL
;
2510 set
= isl_set_cow(set
);
2513 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
2514 map
= (struct isl_map
*)set
;
2515 for (i
= 0; i
< set
->n
; ++i
) {
2516 map
->p
[i
] = isl_basic_map_from_basic_set(
2517 set
->p
[i
], isl_dim_copy(dim
));
2521 isl_dim_free(map
->dim
);
2530 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
2532 return (struct isl_map
*)set
;
2535 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
2538 struct isl_set
*set
= NULL
;
2542 map
= isl_map_cow(map
);
2545 map
->dim
= isl_dim_cow(map
->dim
);
2548 map
->dim
->n_out
+= map
->dim
->n_in
;
2550 set
= (struct isl_set
*)map
;
2551 for (i
= 0; i
< map
->n
; ++i
) {
2552 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
2562 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2564 struct isl_map
*map
;
2568 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
2569 map
= isl_alloc(dim
->ctx
, struct isl_map
,
2570 sizeof(struct isl_map
) +
2571 n
* sizeof(struct isl_basic_map
*));
2575 map
->ctx
= dim
->ctx
;
2576 isl_ctx_ref(map
->ctx
);
2588 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
2589 unsigned nparam
, unsigned in
, unsigned out
, int n
,
2592 struct isl_map
*map
;
2593 struct isl_dim
*dims
;
2595 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
2599 map
= isl_map_alloc_dim(dims
, n
, flags
);
2603 struct isl_basic_map
*isl_basic_map_empty(struct isl_ctx
*ctx
,
2604 unsigned nparam
, unsigned in
, unsigned out
)
2606 struct isl_basic_map
*bmap
;
2607 bmap
= isl_basic_map_alloc(ctx
, nparam
, in
, out
, 0, 1, 0);
2608 bmap
= isl_basic_map_set_to_empty(bmap
);
2612 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
2614 struct isl_basic_set
*bset
;
2615 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
2616 bset
= isl_basic_set_set_to_empty(bset
);
2620 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
2622 struct isl_basic_map
*bmap
;
2625 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2626 bmap
= isl_basic_map_set_to_empty(bmap
);
2630 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
2632 struct isl_basic_map
*bmap
;
2635 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2636 bmap
= isl_basic_map_set_to_empty(bmap
);
2640 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
2642 struct isl_basic_set
*bset
;
2645 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2646 bset
= isl_basic_set_set_to_empty(bset
);
2650 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
2652 struct isl_basic_map
*bmap
;
2653 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
2657 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
2659 struct isl_basic_set
*bset
;
2660 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
2664 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
2668 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2671 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
2673 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2676 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
2680 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2683 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
2687 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2690 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
2692 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2695 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
2699 return isl_set_empty(isl_dim_copy(model
->dim
));
2702 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
2704 struct isl_map
*map
;
2707 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2708 map
= isl_map_add(map
, isl_basic_map_universe(dim
));
2712 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
2714 struct isl_set
*set
;
2717 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2718 set
= isl_set_add(set
, isl_basic_set_universe(dim
));
2722 struct isl_map
*isl_map_dup(struct isl_map
*map
)
2725 struct isl_map
*dup
;
2729 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
2730 for (i
= 0; i
< map
->n
; ++i
)
2731 dup
= isl_map_add(dup
, isl_basic_map_copy(map
->p
[i
]));
2735 struct isl_map
*isl_map_add(struct isl_map
*map
, struct isl_basic_map
*bmap
)
2739 if (isl_basic_map_fast_is_empty(bmap
)) {
2740 isl_basic_map_free(bmap
);
2743 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
2744 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
2745 map
->p
[map
->n
] = bmap
;
2747 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2753 isl_basic_map_free(bmap
);
2757 void isl_map_free(struct isl_map
*map
)
2767 isl_ctx_deref(map
->ctx
);
2768 for (i
= 0; i
< map
->n
; ++i
)
2769 isl_basic_map_free(map
->p
[i
]);
2770 isl_dim_free(map
->dim
);
2774 struct isl_map
*isl_map_extend(struct isl_map
*base
,
2775 unsigned nparam
, unsigned n_in
, unsigned n_out
)
2779 base
= isl_map_cow(base
);
2783 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
2786 for (i
= 0; i
< base
->n
; ++i
) {
2787 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
2788 isl_dim_copy(base
->dim
), 0, 0, 0);
2798 struct isl_set
*isl_set_extend(struct isl_set
*base
,
2799 unsigned nparam
, unsigned dim
)
2801 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
2805 static struct isl_basic_map
*isl_basic_map_fix_pos(struct isl_basic_map
*bmap
,
2806 unsigned pos
, int value
)
2810 bmap
= isl_basic_map_cow(bmap
);
2811 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
2812 j
= isl_basic_map_alloc_equality(bmap
);
2815 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
2816 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
2817 isl_int_set_si(bmap
->eq
[j
][0], value
);
2818 bmap
= isl_basic_map_simplify(bmap
);
2819 return isl_basic_map_finalize(bmap
);
2821 isl_basic_map_free(bmap
);
2825 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
2826 enum isl_dim_type type
, unsigned pos
, int value
)
2830 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
2831 return isl_basic_map_fix_pos(bmap
, isl_basic_map_offset(bmap
, type
) + pos
,
2834 isl_basic_map_free(bmap
);
2838 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
2839 enum isl_dim_type type
, unsigned pos
, int value
)
2841 return (struct isl_basic_set
*)
2842 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2846 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
2847 unsigned input
, int value
)
2849 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
2852 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
2853 unsigned dim
, int value
)
2855 return (struct isl_basic_set
*)
2856 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2857 isl_dim_set
, dim
, value
);
2860 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
2861 enum isl_dim_type type
, unsigned pos
, int value
)
2865 map
= isl_map_cow(map
);
2869 isl_assert(ctx
, pos
< isl_map_dim(map
, type
), goto error
);
2870 for (i
= 0; i
< map
->n
; ++i
) {
2871 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
2875 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2882 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
2883 unsigned input
, int value
)
2885 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
2888 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
2890 return (struct isl_set
*)
2891 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
2894 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
2895 unsigned dim
, isl_int value
)
2900 bset
= isl_basic_set_cow(bset
);
2901 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
2902 j
= isl_basic_set_alloc_inequality(bset
);
2905 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
2906 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
2907 isl_int_neg(bset
->ineq
[j
][0], value
);
2908 bset
= isl_basic_set_simplify(bset
);
2909 return isl_basic_set_finalize(bset
);
2911 isl_basic_set_free(bset
);
2915 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
2920 set
= isl_set_cow(set
);
2924 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
2925 for (i
= 0; i
< set
->n
; ++i
) {
2926 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
2936 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
2941 map
= isl_map_cow(map
);
2945 map
->dim
= isl_dim_reverse(map
->dim
);
2948 for (i
= 0; i
< map
->n
; ++i
) {
2949 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
2953 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2960 static struct isl_map
*isl_basic_map_partial_lexopt(
2961 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2962 struct isl_set
**empty
, int max
)
2964 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
2967 struct isl_map
*isl_basic_map_partial_lexmax(
2968 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2969 struct isl_set
**empty
)
2971 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
2974 struct isl_map
*isl_basic_map_partial_lexmin(
2975 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2976 struct isl_set
**empty
)
2978 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
2981 struct isl_set
*isl_basic_set_partial_lexmin(
2982 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
2983 struct isl_set
**empty
)
2985 return (struct isl_set
*)
2986 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
2990 struct isl_set
*isl_basic_set_partial_lexmax(
2991 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
2992 struct isl_set
**empty
)
2994 return (struct isl_set
*)
2995 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
2999 struct isl_set
*isl_basic_set_lexmin(struct isl_basic_set
*bset
)
3001 struct isl_basic_map
*bmap
= NULL
;
3002 struct isl_basic_set
*dom
= NULL
;
3003 struct isl_map
*min
;
3004 struct isl_dim
*param_dim
;
3008 bmap
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
3011 param_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
3012 dom
= isl_basic_set_universe(param_dim
);
3015 min
= isl_basic_map_partial_lexmin(bmap
, dom
, NULL
);
3016 return isl_map_range(min
);
3018 isl_basic_map_free(bmap
);
3022 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
3023 struct isl_dim
*dim
)
3030 for (i
= 0; i
< map
->n
; ++i
) {
3031 isl_dim_free(map
->p
[i
]->dim
);
3032 map
->p
[i
]->dim
= isl_dim_copy(dim
);
3034 isl_dim_free(map
->dim
);
3044 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
3045 struct isl_dim
*dim
)
3047 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3050 /* Apply a preimage specified by "mat" on the parameters of "bset".
3051 * bset is assumed to have only parameters and divs.
3053 static struct isl_basic_set
*basic_set_parameter_preimage(
3054 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
3061 bset
->dim
= isl_dim_cow(bset
->dim
);
3065 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3067 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3069 bset
->dim
->nparam
= 0;
3070 bset
->dim
->n_out
= nparam
;
3071 bset
= isl_basic_set_preimage(bset
, mat
);
3073 bset
->dim
->nparam
= bset
->dim
->n_out
;
3074 bset
->dim
->n_out
= 0;
3079 isl_basic_set_free(bset
);
3083 /* Apply a preimage specified by "mat" on the parameters of "set".
3084 * set is assumed to have only parameters and divs.
3086 static struct isl_set
*set_parameter_preimage(
3087 struct isl_set
*set
, struct isl_mat
*mat
)
3089 struct isl_dim
*dim
= NULL
;
3095 dim
= isl_dim_copy(set
->dim
);
3096 dim
= isl_dim_cow(dim
);
3100 nparam
= isl_set_dim(set
, isl_dim_param
);
3102 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3105 dim
->n_out
= nparam
;
3106 isl_set_reset_dim(set
, dim
);
3107 set
= isl_set_preimage(set
, mat
);
3110 dim
= isl_dim_copy(set
->dim
);
3111 dim
= isl_dim_cow(dim
);
3114 dim
->nparam
= dim
->n_out
;
3116 isl_set_reset_dim(set
, dim
);
3126 /* Intersect the basic set "bset" with the affine space specified by the
3127 * equalities in "eq".
3129 static struct isl_basic_set
*basic_set_append_equalities(
3130 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
3138 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
3143 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
3144 for (i
= 0; i
< eq
->n_row
; ++i
) {
3145 k
= isl_basic_set_alloc_equality(bset
);
3148 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
3149 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
3156 isl_basic_set_free(bset
);
3160 /* Intersect the set "set" with the affine space specified by the
3161 * equalities in "eq".
3163 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
3171 for (i
= 0; i
< set
->n
; ++i
) {
3172 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
3185 /* Project the given basic set onto its parameter domain, possibly introducing
3186 * new, explicit, existential variables in the constraints.
3187 * The input has parameters and (possibly implicit) existential variables.
3188 * The output has the same parameters, but only
3189 * explicit existentially quantified variables.
3191 * The actual projection is performed by pip, but pip doesn't seem
3192 * to like equalities very much, so we first remove the equalities
3193 * among the parameters by performing a variable compression on
3194 * the parameters. Afterward, an inverse transformation is performed
3195 * and the equalities among the parameters are inserted back in.
3197 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
3201 struct isl_mat
*T
, *T2
;
3202 struct isl_set
*set
;
3203 unsigned nparam
, n_div
;
3205 bset
= isl_basic_set_cow(bset
);
3209 if (bset
->n_eq
== 0)
3210 return isl_basic_set_lexmin(bset
);
3212 isl_basic_set_gauss(bset
, NULL
);
3214 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3215 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
3217 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
3218 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
3221 if (i
== bset
->n_eq
)
3222 return isl_basic_set_lexmin(bset
);
3224 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
3226 eq
= isl_mat_cow(eq
);
3227 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
3228 bset
= basic_set_parameter_preimage(bset
, T
);
3230 set
= isl_basic_set_lexmin(bset
);
3231 set
= set_parameter_preimage(set
, T2
);
3232 set
= set_append_equalities(set
, eq
);
3236 /* Compute an explicit representation for all the existentially
3237 * quantified variables.
3238 * The input and output dimensions are first turned into parameters.
3239 * compute_divs then returns a map with the same parameters and
3240 * no input or output dimensions and the dimension specification
3241 * is reset to that of the input.
3243 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
3245 struct isl_basic_set
*bset
;
3246 struct isl_set
*set
;
3247 struct isl_map
*map
;
3248 struct isl_dim
*dim
, *orig_dim
= NULL
;
3253 bmap
= isl_basic_map_cow(bmap
);
3257 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3258 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3259 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3260 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
3264 orig_dim
= bmap
->dim
;
3266 bset
= (struct isl_basic_set
*)bmap
;
3268 set
= parameter_compute_divs(bset
);
3269 map
= (struct isl_map
*)set
;
3270 map
= isl_map_reset_dim(map
, orig_dim
);
3274 isl_basic_map_free(bmap
);
3278 /* If bmap contains any unknown divs, then compute explicit
3279 * expressions for them. However, this computation may be
3280 * quite expensive, so first try to remove divs that aren't
3283 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
3290 off
= isl_dim_total(bmap
->dim
);
3291 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3292 if (isl_int_is_zero(bmap
->div
[i
][0]))
3294 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
3297 if (i
== bmap
->n_div
)
3298 return isl_map_from_basic_map(bmap
);
3299 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3302 for (i
= 0; i
< bmap
->n_div
; ++i
)
3303 if (isl_int_is_zero(bmap
->div
[i
][0]))
3305 if (i
== bmap
->n_div
)
3306 return isl_map_from_basic_map(bmap
);
3307 struct isl_map
*map
= compute_divs(bmap
);
3310 isl_basic_map_free(bmap
);
3314 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
3317 struct isl_map
*res
;
3323 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
3324 for (i
= 1 ; i
< map
->n
; ++i
) {
3326 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
3327 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
3328 res
= isl_map_union_disjoint(res
, r2
);
3330 res
= isl_map_union(res
, r2
);
3337 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
3339 return (struct isl_set
*)
3340 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
3343 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
3345 return (struct isl_set
*)
3346 isl_map_compute_divs((struct isl_map
*)set
);
3349 struct isl_set
*isl_map_domain(struct isl_map
*map
)
3352 struct isl_set
*set
;
3357 map
= isl_map_cow(map
);
3361 set
= (struct isl_set
*)map
;
3362 set
->dim
= isl_dim_domain(set
->dim
);
3365 for (i
= 0; i
< map
->n
; ++i
) {
3366 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
3370 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3371 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3378 struct isl_map
*isl_map_union_disjoint(
3379 struct isl_map
*map1
, struct isl_map
*map2
)
3383 struct isl_map
*map
= NULL
;
3397 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3399 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3400 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3401 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3403 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3404 map1
->n
+ map2
->n
, flags
);
3407 for (i
= 0; i
< map1
->n
; ++i
) {
3408 map
= isl_map_add(map
,
3409 isl_basic_map_copy(map1
->p
[i
]));
3413 for (i
= 0; i
< map2
->n
; ++i
) {
3414 map
= isl_map_add(map
,
3415 isl_basic_map_copy(map2
->p
[i
]));
3429 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
3431 map1
= isl_map_union_disjoint(map1
, map2
);
3435 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
3439 struct isl_set
*isl_set_union_disjoint(
3440 struct isl_set
*set1
, struct isl_set
*set2
)
3442 return (struct isl_set
*)
3443 isl_map_union_disjoint(
3444 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3447 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
3449 return (struct isl_set
*)
3450 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3453 struct isl_map
*isl_map_intersect_range(
3454 struct isl_map
*map
, struct isl_set
*set
)
3457 struct isl_map
*result
;
3463 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
3464 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
3465 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3467 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
3468 map
->n
* set
->n
, flags
);
3471 for (i
= 0; i
< map
->n
; ++i
)
3472 for (j
= 0; j
< set
->n
; ++j
) {
3473 result
= isl_map_add(result
,
3474 isl_basic_map_intersect_range(
3475 isl_basic_map_copy(map
->p
[i
]),
3476 isl_basic_set_copy(set
->p
[j
])));
3489 struct isl_map
*isl_map_intersect_domain(
3490 struct isl_map
*map
, struct isl_set
*set
)
3492 return isl_map_reverse(
3493 isl_map_intersect_range(isl_map_reverse(map
), set
));
3496 struct isl_map
*isl_map_apply_domain(
3497 struct isl_map
*map1
, struct isl_map
*map2
)
3501 map1
= isl_map_reverse(map1
);
3502 map1
= isl_map_apply_range(map1
, map2
);
3503 return isl_map_reverse(map1
);
3510 struct isl_map
*isl_map_apply_range(
3511 struct isl_map
*map1
, struct isl_map
*map2
)
3513 struct isl_dim
*dim_result
;
3514 struct isl_map
*result
;
3523 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
3524 isl_dim_copy(map2
->dim
));
3526 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
3529 for (i
= 0; i
< map1
->n
; ++i
)
3530 for (j
= 0; j
< map2
->n
; ++j
) {
3531 result
= isl_map_add(result
,
3532 isl_basic_map_apply_range(
3533 isl_basic_map_copy(map1
->p
[i
]),
3534 isl_basic_map_copy(map2
->p
[j
])));
3540 if (result
&& result
->n
<= 1)
3541 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
3550 * returns range - domain
3552 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
3554 struct isl_basic_set
*bset
;
3561 dim
= isl_basic_map_n_in(bmap
);
3562 nparam
= isl_basic_map_n_param(bmap
);
3563 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
3564 bset
= isl_basic_set_from_basic_map(bmap
);
3565 bset
= isl_basic_set_cow(bset
);
3566 bset
= isl_basic_set_extend(bset
, nparam
, 3*dim
, 0, dim
, 0);
3567 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
3568 for (i
= 0; i
< dim
; ++i
) {
3569 int j
= isl_basic_map_alloc_equality(
3570 (struct isl_basic_map
*)bset
);
3573 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
3574 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
3575 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
3576 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
3578 return isl_basic_set_project_out(bset
, 2*dim
, 0);
3580 isl_basic_map_free(bmap
);
3585 * returns range - domain
3587 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
3590 struct isl_set
*result
;
3595 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
3596 result
= isl_set_alloc(map
->ctx
, isl_map_n_param(map
),
3597 isl_map_n_in(map
), map
->n
, map
->flags
);
3600 for (i
= 0; i
< map
->n
; ++i
)
3601 result
= isl_set_add(result
,
3602 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
3610 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
3612 struct isl_basic_map
*bmap
;
3620 nparam
= dims
->nparam
;
3622 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
3626 for (i
= 0; i
< dim
; ++i
) {
3627 int j
= isl_basic_map_alloc_equality(bmap
);
3630 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3631 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
3632 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
3634 return isl_basic_map_finalize(bmap
);
3636 isl_basic_map_free(bmap
);
3640 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
3642 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3645 return basic_map_identity(dim
);
3648 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
3650 if (!model
|| !model
->dim
)
3652 isl_assert(model
->ctx
,
3653 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3654 return basic_map_identity(isl_dim_copy(model
->dim
));
3657 static struct isl_map
*map_identity(struct isl_dim
*dim
)
3659 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
3660 return isl_map_add(map
, basic_map_identity(isl_dim_copy(dim
)));
3663 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
3665 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3668 return map_identity(dim
);
3671 struct isl_map
*isl_map_identity_like(struct isl_basic_map
*model
)
3673 if (!model
|| !model
->dim
)
3675 isl_assert(model
->ctx
,
3676 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3677 return map_identity(isl_dim_copy(model
->dim
));
3680 /* Construct a basic set with all set dimensions having only non-negative
3683 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
3688 struct isl_basic_set
*bset
;
3692 nparam
= dims
->nparam
;
3694 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
3697 for (i
= 0; i
< dim
; ++i
) {
3698 int k
= isl_basic_set_alloc_inequality(bset
);
3701 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
3702 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
3706 isl_basic_set_free(bset
);
3710 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
3712 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3715 int isl_set_is_subset(struct isl_set
*set1
, struct isl_set
*set2
)
3717 return isl_map_is_subset(
3718 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3721 int isl_basic_map_is_subset(
3722 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3725 struct isl_map
*map1
;
3726 struct isl_map
*map2
;
3728 if (!bmap1
|| !bmap2
)
3731 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
3732 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
3734 is_subset
= isl_map_is_subset(map1
, map2
);
3742 int isl_basic_map_is_equal(
3743 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3747 if (!bmap1
|| !bmap2
)
3749 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3752 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3756 int isl_basic_set_is_equal(
3757 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3759 return isl_basic_map_is_equal(
3760 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
3763 int isl_map_is_empty(struct isl_map
*map
)
3770 for (i
= 0; i
< map
->n
; ++i
) {
3771 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
3780 int isl_map_fast_is_empty(struct isl_map
*map
)
3785 int isl_set_is_empty(struct isl_set
*set
)
3787 return isl_map_is_empty((struct isl_map
*)set
);
3790 int isl_map_is_subset(struct isl_map
*map1
, struct isl_map
*map2
)
3794 struct isl_map
*diff
;
3799 if (isl_map_is_empty(map1
))
3802 if (isl_map_is_empty(map2
))
3805 diff
= isl_map_subtract(isl_map_copy(map1
), isl_map_copy(map2
));
3809 is_subset
= isl_map_is_empty(diff
);
3815 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
3821 is_subset
= isl_map_is_subset(map1
, map2
);
3824 is_subset
= isl_map_is_subset(map2
, map1
);
3828 int isl_basic_map_is_strict_subset(
3829 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3833 if (!bmap1
|| !bmap2
)
3835 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3838 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3839 if (is_subset
== -1)
3844 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
3848 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
3851 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
3855 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
3858 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
3860 struct isl_basic_set
*bset
= NULL
;
3861 struct isl_vec
*sample
= NULL
;
3868 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
3871 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
3872 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
3873 copy
= isl_basic_map_convex_hull(copy
);
3874 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
3875 isl_basic_map_free(copy
);
3879 total
= 1 + isl_basic_map_total_dim(bmap
);
3880 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
3881 int contains
= basic_map_contains(bmap
, bmap
->sample
);
3887 isl_vec_free(bmap
->sample
);
3888 bmap
->sample
= NULL
;
3889 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
3892 sample
= isl_basic_set_sample(bset
);
3895 empty
= sample
->size
== 0;
3896 isl_vec_free(bmap
->sample
);
3897 bmap
->sample
= sample
;
3899 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
3904 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
3908 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
3911 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
3915 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
3918 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
3920 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
3923 struct isl_map
*isl_basic_map_union(
3924 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3926 struct isl_map
*map
;
3927 if (!bmap1
|| !bmap2
)
3930 isl_assert(map1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3932 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
3935 map
= isl_map_add(map
, bmap1
);
3936 map
= isl_map_add(map
, bmap2
);
3939 isl_basic_map_free(bmap1
);
3940 isl_basic_map_free(bmap2
);
3944 struct isl_set
*isl_basic_set_union(
3945 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3947 return (struct isl_set
*)isl_basic_map_union(
3948 (struct isl_basic_map
*)bset1
,
3949 (struct isl_basic_map
*)bset2
);
3952 /* Order divs such that any div only depends on previous divs */
3953 static struct isl_basic_map
*order_divs(struct isl_basic_map
*bmap
)
3956 unsigned off
= isl_dim_total(bmap
->dim
);
3958 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3960 if (isl_int_is_zero(bmap
->div
[i
][0]))
3962 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
3966 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
3972 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
3974 return (struct isl_basic_set
*)order_divs((struct isl_basic_map
*)bset
);
3977 /* Look for a div in dst that corresponds to the div "div" in src.
3978 * The divs before "div" in src and dst are assumed to be the same.
3980 * Returns -1 if no corresponding div was found and the position
3981 * of the corresponding div in dst otherwise.
3983 static int find_div(struct isl_basic_map
*dst
,
3984 struct isl_basic_map
*src
, unsigned div
)
3988 unsigned total
= isl_dim_total(src
->dim
);
3990 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
3991 for (i
= div
; i
< dst
->n_div
; ++i
)
3992 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
3993 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
3994 dst
->n_div
- div
) == -1)
3999 struct isl_basic_map
*isl_basic_map_align_divs(
4000 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
4003 unsigned total
= isl_dim_total(src
->dim
);
4008 if (src
->n_div
== 0)
4011 for (i
= 0; i
< src
->n_div
; ++i
)
4012 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
4014 src
= order_divs(src
);
4015 dst
= isl_basic_map_cow(dst
);
4016 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
4017 src
->n_div
, 0, 2 * src
->n_div
);
4020 for (i
= 0; i
< src
->n_div
; ++i
) {
4021 int j
= find_div(dst
, src
, i
);
4023 j
= isl_basic_map_alloc_div(dst
);
4026 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
4027 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
4028 if (add_div_constraints(dst
, j
) < 0)
4032 isl_basic_map_swap_div(dst
, i
, j
);
4036 isl_basic_map_free(dst
);
4040 struct isl_basic_set
*isl_basic_set_align_divs(
4041 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
4043 return (struct isl_basic_set
*)isl_basic_map_align_divs(
4044 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
4047 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
4051 map
= isl_map_compute_divs(map
);
4052 map
= isl_map_cow(map
);
4056 for (i
= 1; i
< map
->n
; ++i
)
4057 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
4058 for (i
= 1; i
< map
->n
; ++i
)
4059 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
4061 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4065 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
4067 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
4070 static struct isl_map
*add_cut_constraint(struct isl_map
*dst
,
4071 struct isl_basic_map
*src
, isl_int
*c
,
4072 unsigned len
, int oppose
)
4074 struct isl_basic_map
*copy
= NULL
;
4079 copy
= isl_basic_map_copy(src
);
4080 copy
= isl_basic_map_cow(copy
);
4083 copy
= isl_basic_map_extend_constraints(copy
, 0, 1);
4084 k
= isl_basic_map_alloc_inequality(copy
);
4088 isl_seq_neg(copy
->ineq
[k
], c
, len
);
4090 isl_seq_cpy(copy
->ineq
[k
], c
, len
);
4091 total
= 1 + isl_basic_map_total_dim(copy
);
4092 isl_seq_clr(copy
->ineq
[k
]+len
, total
- len
);
4093 isl_inequality_negate(copy
, k
);
4094 copy
= isl_basic_map_simplify(copy
);
4095 copy
= isl_basic_map_finalize(copy
);
4096 is_empty
= isl_basic_map_is_empty(copy
);
4100 dst
= isl_map_add(dst
, copy
);
4102 isl_basic_map_free(copy
);
4105 isl_basic_map_free(copy
);
4110 static struct isl_map
*subtract(struct isl_map
*map
, struct isl_basic_map
*bmap
)
4114 struct isl_map
*rest
= NULL
;
4116 unsigned total
= isl_basic_map_total_dim(bmap
);
4123 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4124 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4126 max
= map
->n
* (2 * bmap
->n_eq
+ bmap
->n_ineq
);
4127 rest
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), max
, flags
);
4131 for (i
= 0; i
< map
->n
; ++i
) {
4132 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], bmap
);
4137 for (j
= 0; j
< map
->n
; ++j
)
4138 map
->p
[j
] = isl_basic_map_cow(map
->p
[j
]);
4140 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
4141 for (j
= 0; j
< map
->n
; ++j
) {
4142 rest
= add_cut_constraint(rest
,
4143 map
->p
[j
], bmap
->eq
[i
], 1+total
, 0);
4147 rest
= add_cut_constraint(rest
,
4148 map
->p
[j
], bmap
->eq
[i
], 1+total
, 1);
4152 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4156 k
= isl_basic_map_alloc_equality(map
->p
[j
]);
4159 isl_seq_cpy(map
->p
[j
]->eq
[k
], bmap
->eq
[i
], 1+total
);
4160 isl_seq_clr(map
->p
[j
]->eq
[k
]+1+total
,
4161 map
->p
[j
]->n_div
- bmap
->n_div
);
4165 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4166 for (j
= 0; j
< map
->n
; ++j
) {
4167 rest
= add_cut_constraint(rest
,
4168 map
->p
[j
], bmap
->ineq
[i
], 1+total
, 0);
4172 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4176 k
= isl_basic_map_alloc_inequality(map
->p
[j
]);
4179 isl_seq_cpy(map
->p
[j
]->ineq
[k
], bmap
->ineq
[i
], 1+total
);
4180 isl_seq_clr(map
->p
[j
]->ineq
[k
]+1+total
,
4181 map
->p
[j
]->n_div
- bmap
->n_div
);
4193 struct isl_map
*isl_map_subtract(struct isl_map
*map1
, struct isl_map
*map2
)
4199 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4201 if (isl_map_is_empty(map2
)) {
4206 map1
= isl_map_compute_divs(map1
);
4207 map2
= isl_map_compute_divs(map2
);
4211 for (i
= 0; map1
&& i
< map2
->n
; ++i
)
4212 map1
= subtract(map1
, map2
->p
[i
]);
4222 struct isl_set
*isl_set_subtract(struct isl_set
*set1
, struct isl_set
*set2
)
4224 return (struct isl_set
*)
4226 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4229 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
4233 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
4234 map
= isl_map_intersect_domain(map
, set
);
4235 set
= isl_map_range(map
);
4243 /* There is no need to cow as removing empty parts doesn't change
4244 * the meaning of the set.
4246 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
4253 for (i
= map
->n
-1; i
>= 0; --i
) {
4254 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
4256 isl_basic_map_free(map
->p
[i
]);
4257 if (i
!= map
->n
-1) {
4258 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4259 map
->p
[i
] = map
->p
[map
->n
-1];
4267 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
4269 return (struct isl_set
*)
4270 isl_map_remove_empty_parts((struct isl_map
*)set
);
4273 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
4275 struct isl_basic_map
*bmap
;
4276 if (!map
|| map
->n
== 0)
4278 bmap
= map
->p
[map
->n
-1];
4279 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
4280 return isl_basic_map_copy(bmap
);
4283 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
4285 (struct isl_basic_set
*)isl_map_copy_basic_map((struct isl_map
*)set
);
4288 struct isl_map
*isl_map_drop_basic_map(struct isl_map
*map
,
4289 struct isl_basic_map
*bmap
)
4295 for (i
= map
->n
-1; i
>= 0; --i
) {
4296 if (map
->p
[i
] != bmap
)
4298 map
= isl_map_cow(map
);
4301 isl_basic_map_free(map
->p
[i
]);
4302 if (i
!= map
->n
-1) {
4303 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
4304 map
->p
[i
] = map
->p
[map
->n
-1];
4309 isl_basic_map_free(bmap
);
4313 isl_basic_map_free(bmap
);
4317 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
4318 struct isl_basic_set
*bset
)
4320 (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
4321 (struct isl_basic_map
*)bset
);
4324 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4325 * for any common value of the parameters and dimensions preceding dim
4326 * in both basic sets, the values of dimension pos in bset1 are
4327 * smaller or larger than those in bset2.
4330 * 1 if bset1 follows bset2
4331 * -1 if bset1 precedes bset2
4332 * 0 if bset1 and bset2 are incomparable
4333 * -2 if some error occurred.
4335 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
4336 struct isl_basic_set
*bset2
, int pos
)
4338 struct isl_dim
*dims
;
4339 struct isl_basic_map
*bmap1
= NULL
;
4340 struct isl_basic_map
*bmap2
= NULL
;
4341 struct isl_ctx
*ctx
;
4342 struct isl_vec
*obj
;
4345 unsigned dim1
, dim2
;
4347 enum isl_lp_result res
;
4350 if (!bset1
|| !bset2
)
4353 nparam
= isl_basic_set_n_param(bset1
);
4354 dim1
= isl_basic_set_n_dim(bset1
);
4355 dim2
= isl_basic_set_n_dim(bset2
);
4356 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
4357 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
4358 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
4359 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
4360 if (!bmap1
|| !bmap2
)
4362 bmap1
= isl_basic_map_cow(bmap1
);
4363 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
4364 pos
, (dim1
- pos
) + (dim2
- pos
),
4365 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
4366 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
4369 total
= isl_basic_map_total_dim(bmap1
);
4371 obj
= isl_vec_alloc(ctx
, 1 + total
);
4372 isl_seq_clr(obj
->block
.data
, 1 + total
);
4373 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
4374 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
4379 res
= isl_solve_lp(bmap1
, 0, obj
->block
.data
, ctx
->one
, &num
, &den
);
4380 if (res
== isl_lp_empty
)
4382 else if (res
== isl_lp_ok
&& isl_int_is_pos(num
))
4384 else if ((res
== isl_lp_ok
&& isl_int_is_neg(num
)) ||
4385 res
== isl_lp_unbounded
)
4391 isl_basic_map_free(bmap1
);
4395 isl_basic_map_free(bmap1
);
4396 isl_basic_map_free(bmap2
);
4400 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
4401 unsigned pos
, isl_int
*val
)
4409 total
= isl_basic_map_total_dim(bmap
);
4410 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
4411 for (; d
+1 > pos
; --d
)
4412 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
4416 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
4418 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
4420 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
4423 isl_int_neg(*val
, bmap
->eq
[i
][0]);
4429 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
4430 unsigned pos
, isl_int
*val
)
4442 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
4445 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
4446 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
4447 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
4448 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4452 isl_int_set(*val
, v
);
4458 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
4459 unsigned pos
, isl_int
*val
)
4461 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
4465 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
4468 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
4471 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
4472 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
4474 if (pos
>= isl_basic_map_dim(bmap
, type
))
4476 return isl_basic_map_fast_has_fixed_var(bmap
,
4477 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
4480 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4481 * then return this fixed value in *val.
4483 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
4486 return isl_basic_set_fast_has_fixed_var(bset
,
4487 isl_basic_set_n_param(bset
) + dim
, val
);
4490 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4491 * then return this fixed value in *val.
4493 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
4495 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
4498 /* Check if input variable in has fixed value and if so and if val is not NULL,
4499 * then return this fixed value in *val.
4501 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
4503 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
4506 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4507 * and if val is not NULL, then return this lower bound in *val.
4509 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
4510 unsigned dim
, isl_int
*val
)
4512 int i
, i_eq
= -1, i_ineq
= -1;
4519 total
= isl_basic_set_total_dim(bset
);
4520 nparam
= isl_basic_set_n_param(bset
);
4521 for (i
= 0; i
< bset
->n_eq
; ++i
) {
4522 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
4528 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
4529 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
4531 if (i_eq
!= -1 || i_ineq
!= -1)
4535 if (i_eq
== -1 && i_ineq
== -1)
4537 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
4538 /* The coefficient should always be one due to normalization. */
4539 if (!isl_int_is_one(c
[1+nparam
+dim
]))
4541 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
4543 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
4544 total
- nparam
- dim
- 1) != -1)
4547 isl_int_neg(*val
, c
[0]);
4551 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
4552 unsigned dim
, isl_int
*val
)
4564 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4568 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4570 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
4571 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
4573 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4577 isl_int_set(*val
, v
);
4588 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
4590 const struct constraint
*c1
= (const struct constraint
*)p1
;
4591 const struct constraint
*c2
= (const struct constraint
*)p2
;
4592 unsigned size
= isl_min(c1
->size
, c2
->size
);
4593 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
4596 static struct isl_basic_map
*isl_basic_map_sort_constraints(
4597 struct isl_basic_map
*bmap
)
4600 struct constraint
*c
;
4605 total
= isl_basic_map_total_dim(bmap
);
4606 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
4609 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4611 c
[i
].c
= bmap
->ineq
[i
];
4613 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
4614 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4615 bmap
->ineq
[i
] = c
[i
].c
;
4619 isl_basic_map_free(bmap
);
4623 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
4627 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
4629 bmap
= isl_basic_map_convex_hull(bmap
);
4630 bmap
= isl_basic_map_sort_constraints(bmap
);
4631 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4635 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
4637 return (struct isl_basic_set
*)isl_basic_map_normalize(
4638 (struct isl_basic_map
*)bset
);
4641 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
4642 const struct isl_basic_map
*bmap2
)
4649 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
4650 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
4651 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
4652 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4653 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
4654 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4655 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
4656 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4658 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
4660 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4662 if (bmap1
->n_eq
!= bmap2
->n_eq
)
4663 return bmap1
->n_eq
- bmap2
->n_eq
;
4664 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
4665 return bmap1
->n_ineq
- bmap2
->n_ineq
;
4666 if (bmap1
->n_div
!= bmap2
->n_div
)
4667 return bmap1
->n_div
- bmap2
->n_div
;
4668 total
= isl_basic_map_total_dim(bmap1
);
4669 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
4670 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
4674 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
4675 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
4679 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
4680 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
4687 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
4688 struct isl_basic_map
*bmap2
)
4690 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
4693 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
4695 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
4696 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
4698 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
4701 /* We normalize in place, but if anything goes wrong we need
4702 * to return NULL, so we need to make sure we don't change the
4703 * meaning of any possible other copies of map.
4705 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
4708 struct isl_basic_map
*bmap
;
4712 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
4714 for (i
= 0; i
< map
->n
; ++i
) {
4715 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
4718 isl_basic_map_free(map
->p
[i
]);
4721 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
4722 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
4723 map
= isl_map_remove_empty_parts(map
);
4726 for (i
= map
->n
- 1; i
>= 1; --i
) {
4727 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
4729 isl_basic_map_free(map
->p
[i
-1]);
4730 for (j
= i
; j
< map
->n
; ++j
)
4731 map
->p
[j
-1] = map
->p
[j
];
4741 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
4743 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
4746 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
4756 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
4759 map1
= isl_map_copy(map1
);
4760 map2
= isl_map_copy(map2
);
4761 map1
= isl_map_normalize(map1
);
4762 map2
= isl_map_normalize(map2
);
4765 equal
= map1
->n
== map2
->n
;
4766 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
4767 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
4780 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
4782 return isl_map_fast_is_equal((struct isl_map
*)set1
,
4783 (struct isl_map
*)set2
);
4786 /* Return an interval that ranges from min to max (inclusive)
4788 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
4789 isl_int min
, isl_int max
)
4792 struct isl_basic_set
*bset
= NULL
;
4794 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
4798 k
= isl_basic_set_alloc_inequality(bset
);
4801 isl_int_set_si(bset
->ineq
[k
][1], 1);
4802 isl_int_neg(bset
->ineq
[k
][0], min
);
4804 k
= isl_basic_set_alloc_inequality(bset
);
4807 isl_int_set_si(bset
->ineq
[k
][1], -1);
4808 isl_int_set(bset
->ineq
[k
][0], max
);
4812 isl_basic_set_free(bset
);
4816 /* Return the Cartesian product of the basic sets in list (in the given order).
4818 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
4826 struct isl_basic_set
*product
= NULL
;
4830 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
4831 isl_assert(list
->ctx
, list
->p
[0], goto error
);
4832 nparam
= isl_basic_set_n_param(list
->p
[0]);
4833 dim
= isl_basic_set_n_dim(list
->p
[0]);
4834 extra
= list
->p
[0]->n_div
;
4835 n_eq
= list
->p
[0]->n_eq
;
4836 n_ineq
= list
->p
[0]->n_ineq
;
4837 for (i
= 1; i
< list
->n
; ++i
) {
4838 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
4839 isl_assert(list
->ctx
,
4840 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
4841 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4842 extra
+= list
->p
[i
]->n_div
;
4843 n_eq
+= list
->p
[i
]->n_eq
;
4844 n_ineq
+= list
->p
[i
]->n_ineq
;
4846 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
4851 for (i
= 0; i
< list
->n
; ++i
) {
4852 isl_basic_set_add_constraints(product
,
4853 isl_basic_set_copy(list
->p
[i
]), dim
);
4854 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4856 isl_basic_set_list_free(list
);
4859 isl_basic_set_free(product
);
4860 isl_basic_set_list_free(list
);
4864 struct isl_basic_map
*isl_basic_map_product(
4865 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4867 struct isl_dim
*dim_result
= NULL
;
4868 struct isl_basic_map
*bmap
;
4869 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
4870 struct isl_dim_map
*dim_map1
, *dim_map2
;
4872 if (!bmap1
|| !bmap2
)
4875 isl_assert(map1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
4876 bmap2
->dim
, isl_dim_param
), goto error
);
4877 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
4878 isl_dim_copy(bmap2
->dim
));
4880 in1
= isl_basic_map_n_in(bmap1
);
4881 in2
= isl_basic_map_n_in(bmap2
);
4882 out1
= isl_basic_map_n_out(bmap1
);
4883 out2
= isl_basic_map_n_out(bmap2
);
4884 nparam
= isl_basic_map_n_param(bmap1
);
4886 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
4887 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4888 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
4889 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
4890 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
4891 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
4892 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
4893 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
4894 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
4895 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
4896 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
4898 bmap
= isl_basic_map_alloc_dim(dim_result
,
4899 bmap1
->n_div
+ bmap2
->n_div
,
4900 bmap1
->n_eq
+ bmap2
->n_eq
,
4901 bmap1
->n_ineq
+ bmap2
->n_ineq
);
4902 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
4903 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
4904 bmap
= isl_basic_map_simplify(bmap
);
4905 return isl_basic_map_finalize(bmap
);
4907 isl_basic_map_free(bmap1
);
4908 isl_basic_map_free(bmap2
);
4912 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4914 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
4917 struct isl_map
*result
;
4923 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
4924 map2
->dim
, isl_dim_param
), goto error
);
4926 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
4927 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
4928 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4930 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
4931 isl_dim_copy(map2
->dim
)),
4932 map1
->n
* map2
->n
, flags
);
4935 for (i
= 0; i
< map1
->n
; ++i
)
4936 for (j
= 0; j
< map2
->n
; ++j
) {
4937 struct isl_basic_map
*part
;
4938 part
= isl_basic_map_product(
4939 isl_basic_map_copy(map1
->p
[i
]),
4940 isl_basic_map_copy(map2
->p
[j
]));
4941 if (isl_basic_map_is_empty(part
))
4942 isl_basic_map_free(part
);
4944 result
= isl_map_add(result
, part
);
4957 /* Given two set A and B, construct its Cartesian product A x B.
4959 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
4961 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
4962 (struct isl_map
*)set2
);
4965 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
4973 bset
= isl_basic_set_copy(bset
);
4974 bset
= isl_basic_set_normalize(bset
);
4977 total
= isl_basic_set_total_dim(bset
);
4978 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
4979 for (i
= 0; i
< bset
->n_eq
; ++i
) {
4981 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
4982 isl_hash_hash(hash
, c_hash
);
4984 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
4985 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
4987 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
4988 isl_hash_hash(hash
, c_hash
);
4990 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
4991 for (i
= 0; i
< bset
->n_div
; ++i
) {
4993 if (isl_int_is_zero(bset
->div
[i
][0]))
4995 isl_hash_byte(hash
, i
& 0xFF);
4996 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
4997 isl_hash_hash(hash
, c_hash
);
4999 isl_basic_set_free(bset
);
5003 uint32_t isl_set_get_hash(struct isl_set
*set
)
5010 set
= isl_set_copy(set
);
5011 set
= isl_set_normalize(set
);
5015 hash
= isl_hash_init();
5016 for (i
= 0; i
< set
->n
; ++i
) {
5018 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
5019 isl_hash_hash(hash
, bset_hash
);
5027 /* Check if the value for dimension dim is completely determined
5028 * by the values of the other parameters and variables.
5029 * That is, check if dimension dim is involved in an equality.
5031 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
5038 nparam
= isl_basic_set_n_param(bset
);
5039 for (i
= 0; i
< bset
->n_eq
; ++i
)
5040 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
5045 /* Check if the value for dimension dim is completely determined
5046 * by the values of the other parameters and variables.
5047 * That is, check if dimension dim is involved in an equality
5048 * for each of the subsets.
5050 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
5056 for (i
= 0; i
< set
->n
; ++i
) {
5058 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);