6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
18 /* Maps dst positions to src positions */
24 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
27 struct isl_dim_map
*dim_map
;
28 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
29 sizeof(struct isl_dim_map
) + len
* sizeof(int));
32 dim_map
->len
= 1 + len
;
34 for (i
= 0; i
< len
; ++i
)
35 dim_map
->pos
[1 + i
] = -1;
39 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
42 case isl_dim_param
: return dim
->nparam
;
43 case isl_dim_in
: return dim
->n_in
;
44 case isl_dim_out
: return dim
->n_out
;
45 case isl_dim_all
: return dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
49 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
52 case isl_dim_param
: return 1;
53 case isl_dim_in
: return 1 + dim
->nparam
;
54 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
58 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
59 enum isl_dim_type type
, unsigned dst_pos
)
67 src_pos
= pos(dim
, type
);
68 for (i
= 0; i
< n(dim
, type
); ++i
)
69 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
72 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
73 struct isl_basic_map
*bmap
, unsigned dst_pos
)
78 if (!dim_map
|| !bmap
)
81 src_pos
= 1 + isl_dim_total(bmap
->dim
);
82 for (i
= 0; i
< bmap
->n_div
; ++i
)
83 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
86 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
90 for (i
= 0; i
< dim_map
->len
; ++i
)
91 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
92 fprintf(stderr
, "\n");
95 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
96 enum isl_dim_type type
)
101 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
102 case isl_dim_div
: return bmap
->n_div
;
103 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
107 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
109 return n(map
->dim
, type
);
112 unsigned isl_set_dim(const struct isl_set
*set
, enum isl_dim_type type
)
114 return n(set
->dim
, type
);
117 unsigned isl_basic_map_offset(struct isl_basic_map
*bmap
,
118 enum isl_dim_type type
)
120 struct isl_dim
*dim
= bmap
->dim
;
122 case isl_dim_param
: return 1;
123 case isl_dim_in
: return 1 + dim
->nparam
;
124 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
125 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
129 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
131 return pos(map
->dim
, type
);
134 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
135 enum isl_dim_type type
)
137 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
140 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
142 return bset
->dim
->n_out
;
145 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
147 return bset
->dim
->nparam
;
150 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
152 return isl_dim_total(bset
->dim
) + bset
->n_div
;
155 unsigned isl_set_n_dim(const struct isl_set
*set
)
157 return set
->dim
->n_out
;
160 unsigned isl_set_n_param(const struct isl_set
*set
)
162 return set
->dim
->nparam
;
165 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
167 return bmap
->dim
->n_in
;
170 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
172 return bmap
->dim
->n_out
;
175 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
177 return bmap
->dim
->nparam
;
180 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
185 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
187 return isl_dim_total(bmap
->dim
) + bmap
->n_div
;
190 unsigned isl_map_n_in(const struct isl_map
*map
)
192 return map
->dim
->n_in
;
195 unsigned isl_map_n_out(const struct isl_map
*map
)
197 return map
->dim
->n_out
;
200 unsigned isl_map_n_param(const struct isl_map
*map
)
202 return map
->dim
->nparam
;
205 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
207 return map
->dim
->n_in
== set
->dim
->n_out
&&
208 map
->dim
->nparam
== set
->dim
->nparam
;
211 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
212 struct isl_basic_set
*bset
)
214 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
215 bmap
->dim
->nparam
== bset
->dim
->nparam
;
218 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
219 struct isl_basic_set
*bset
)
221 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
222 bmap
->dim
->nparam
== bset
->dim
->nparam
;
225 struct isl_dim
*isl_basic_map_get_dim(struct isl_basic_map
*bmap
)
229 return isl_dim_copy(bmap
->dim
);
232 struct isl_dim
*isl_basic_set_get_dim(struct isl_basic_set
*bset
)
236 return isl_dim_copy(bset
->dim
);
239 struct isl_dim
*isl_map_get_dim(struct isl_map
*map
)
243 return isl_dim_copy(map
->dim
);
246 struct isl_dim
*isl_set_get_dim(struct isl_set
*set
)
250 return isl_dim_copy(set
->dim
);
253 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
254 struct isl_basic_map
*bmap
, unsigned extra
,
255 unsigned n_eq
, unsigned n_ineq
)
258 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
260 bmap
->block
= isl_blk_alloc(ctx
, (n_ineq
+ n_eq
) * row_size
);
261 if (isl_blk_is_error(bmap
->block
)) {
266 bmap
->ineq
= isl_alloc_array(ctx
, isl_int
*, n_ineq
+ n_eq
);
268 isl_blk_free(ctx
, bmap
->block
);
274 bmap
->block2
= isl_blk_empty();
277 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
278 if (isl_blk_is_error(bmap
->block2
)) {
280 isl_blk_free(ctx
, bmap
->block
);
285 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
287 isl_blk_free(ctx
, bmap
->block2
);
289 isl_blk_free(ctx
, bmap
->block
);
295 for (i
= 0; i
< n_ineq
+ n_eq
; ++i
)
296 bmap
->ineq
[i
] = bmap
->block
.data
+ i
* row_size
;
298 for (i
= 0; i
< extra
; ++i
)
299 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
305 bmap
->c_size
= n_eq
+ n_ineq
;
306 bmap
->eq
= bmap
->ineq
+ n_ineq
;
315 isl_basic_map_free(bmap
);
319 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
320 unsigned nparam
, unsigned dim
, unsigned extra
,
321 unsigned n_eq
, unsigned n_ineq
)
323 struct isl_basic_map
*bmap
;
324 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
325 return (struct isl_basic_set
*)bmap
;
328 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
329 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
331 struct isl_basic_map
*bmap
;
334 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
335 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
336 return (struct isl_basic_set
*)bmap
;
339 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
340 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
342 struct isl_basic_map
*bmap
;
346 bmap
= isl_alloc_type(dim
->ctx
, struct isl_basic_map
);
351 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
357 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
358 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
359 unsigned n_eq
, unsigned n_ineq
)
361 struct isl_basic_map
*bmap
;
364 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
368 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
372 static void dup_constraints(
373 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
376 unsigned total
= isl_basic_map_total_dim(src
);
378 for (i
= 0; i
< src
->n_eq
; ++i
) {
379 int j
= isl_basic_map_alloc_equality(dst
);
380 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
383 for (i
= 0; i
< src
->n_ineq
; ++i
) {
384 int j
= isl_basic_map_alloc_inequality(dst
);
385 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
388 for (i
= 0; i
< src
->n_div
; ++i
) {
389 int j
= isl_basic_map_alloc_div(dst
);
390 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
392 ISL_F_SET(dst
, ISL_BASIC_SET_FINAL
);
395 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
397 struct isl_basic_map
*dup
;
401 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
402 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
405 dup_constraints(dup
, bmap
);
406 dup
->flags
= bmap
->flags
;
407 dup
->sample
= isl_vec_copy(bmap
->sample
);
411 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
413 struct isl_basic_map
*dup
;
415 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
416 return (struct isl_basic_set
*)dup
;
419 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
424 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
428 return isl_basic_set_dup(bset
);
431 struct isl_set
*isl_set_copy(struct isl_set
*set
)
440 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
445 if (ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
449 return isl_basic_map_dup(bmap
);
452 struct isl_map
*isl_map_copy(struct isl_map
*map
)
461 void isl_basic_map_free(struct isl_basic_map
*bmap
)
469 isl_ctx_deref(bmap
->ctx
);
471 isl_blk_free(bmap
->ctx
, bmap
->block2
);
473 isl_blk_free(bmap
->ctx
, bmap
->block
);
474 isl_vec_free(bmap
->sample
);
475 isl_dim_free(bmap
->dim
);
479 void isl_basic_set_free(struct isl_basic_set
*bset
)
481 isl_basic_map_free((struct isl_basic_map
*)bset
);
484 static int room_for_con(struct isl_basic_map
*bmap
, unsigned n
)
486 return bmap
->n_eq
+ bmap
->n_ineq
+ n
<= bmap
->c_size
;
489 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
495 isl_assert(ctx
, room_for_con(bmap
, 1), return -1);
496 isl_assert(ctx
, (bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
<= bmap
->c_size
,
498 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
499 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
500 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
501 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
502 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
503 if ((bmap
->eq
- bmap
->ineq
) + bmap
->n_eq
== bmap
->c_size
) {
505 int j
= isl_basic_map_alloc_inequality(bmap
);
509 bmap
->ineq
[j
] = bmap
->ineq
[bmap
->n_ineq
- 1];
510 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
517 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] + 1 + isl_basic_map_total_dim(bmap
),
518 bmap
->extra
- bmap
->n_div
);
522 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
524 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
527 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
531 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
536 int isl_basic_set_free_equality(struct isl_basic_set
*bset
, unsigned n
)
538 return isl_basic_map_free_equality((struct isl_basic_map
*)bset
, n
);
541 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
546 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
548 if (pos
!= bmap
->n_eq
- 1) {
550 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
551 bmap
->eq
[bmap
->n_eq
- 1] = t
;
557 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
559 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
562 void isl_basic_map_inequality_to_equality(
563 struct isl_basic_map
*bmap
, unsigned pos
)
568 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
569 bmap
->ineq
[bmap
->n_ineq
- 1] = bmap
->eq
[-1];
574 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
575 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
576 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
577 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
580 static int room_for_ineq(struct isl_basic_map
*bmap
, unsigned n
)
582 return bmap
->n_ineq
+ n
<= bmap
->eq
- bmap
->ineq
;
585 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
591 isl_assert(ctx
, room_for_ineq(bmap
, 1), return -1);
592 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
593 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
594 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
595 ISL_F_CLR(bmap
, ISL_BASIC_MAP_ALL_EQUALITIES
);
596 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
597 1 + isl_basic_map_total_dim(bmap
),
598 bmap
->extra
- bmap
->n_div
);
599 return bmap
->n_ineq
++;
602 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
604 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
607 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
611 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
616 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
618 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
621 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
626 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
628 if (pos
!= bmap
->n_ineq
- 1) {
630 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
631 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
632 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
638 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
640 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
643 __isl_give isl_basic_set
*isl_basic_set_add_eq(__isl_take isl_basic_set
*bset
,
648 bset
= isl_basic_set_extend_constraints(bset
, 1, 0);
651 k
= isl_basic_set_alloc_equality(bset
);
654 isl_seq_cpy(bset
->eq
[k
], eq
, 1 + isl_basic_set_total_dim(bset
));
657 isl_basic_set_free(bset
);
661 __isl_give isl_basic_set
*isl_basic_set_add_ineq(__isl_take isl_basic_set
*bset
,
666 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
669 k
= isl_basic_set_alloc_inequality(bset
);
672 isl_seq_cpy(bset
->ineq
[k
], ineq
, 1 + isl_basic_set_total_dim(bset
));
675 isl_basic_set_free(bset
);
679 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
683 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
684 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
685 1 + 1 + isl_basic_map_total_dim(bmap
),
686 bmap
->extra
- bmap
->n_div
);
687 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
688 return bmap
->n_div
++;
691 int isl_basic_set_alloc_div(struct isl_basic_set
*bset
)
693 return isl_basic_map_alloc_div((struct isl_basic_map
*)bset
);
696 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
700 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
705 int isl_basic_set_free_div(struct isl_basic_set
*bset
, unsigned n
)
707 return isl_basic_map_free_div((struct isl_basic_map
*)bset
, n
);
710 /* Copy constraint from src to dst, putting the vars of src at offset
711 * dim_off in dst and the divs of src at offset div_off in dst.
712 * If both sets are actually map, then dim_off applies to the input
715 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
716 struct isl_basic_map
*src_map
, isl_int
*src
,
717 unsigned in_off
, unsigned out_off
, unsigned div_off
)
719 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
720 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
721 unsigned src_in
= isl_basic_map_n_in(src_map
);
722 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
723 unsigned src_out
= isl_basic_map_n_out(src_map
);
724 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
725 isl_int_set(dst
[0], src
[0]);
726 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
727 if (dst_nparam
> src_nparam
)
728 isl_seq_clr(dst
+1+src_nparam
,
729 dst_nparam
- src_nparam
);
730 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
731 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
733 isl_min(dst_in
-in_off
, src_in
));
734 if (dst_in
-in_off
> src_in
)
735 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
736 dst_in
- in_off
- src_in
);
737 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
738 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
739 src
+1+src_nparam
+src_in
,
740 isl_min(dst_out
-out_off
, src_out
));
741 if (dst_out
-out_off
> src_out
)
742 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
743 dst_out
- out_off
- src_out
);
744 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
745 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
746 src
+1+src_nparam
+src_in
+src_out
,
747 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
748 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
749 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
750 div_off
+src_map
->n_div
,
751 dst_map
->n_div
- div_off
- src_map
->n_div
);
754 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
755 struct isl_basic_map
*src_map
, isl_int
*src
,
756 unsigned in_off
, unsigned out_off
, unsigned div_off
)
758 isl_int_set(dst
[0], src
[0]);
759 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
762 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
763 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
768 if (!bmap1
|| !bmap2
)
771 div_off
= bmap1
->n_div
;
773 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
774 int i1
= isl_basic_map_alloc_equality(bmap1
);
777 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
778 i_pos
, o_pos
, div_off
);
781 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
782 int i1
= isl_basic_map_alloc_inequality(bmap1
);
785 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
786 i_pos
, o_pos
, div_off
);
789 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
790 int i1
= isl_basic_map_alloc_div(bmap1
);
793 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
794 i_pos
, o_pos
, div_off
);
797 isl_basic_map_free(bmap2
);
802 isl_basic_map_free(bmap1
);
803 isl_basic_map_free(bmap2
);
807 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
808 struct isl_dim_map
*dim_map
)
812 for (i
= 0; i
< dim_map
->len
; ++i
) {
813 if (dim_map
->pos
[i
] < 0)
814 isl_int_set_si(dst
[i
], 0);
816 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
820 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
821 struct isl_dim_map
*dim_map
)
823 isl_int_set(dst
[0], src
[0]);
824 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
827 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
828 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
832 if (!src
|| !dst
|| !dim_map
)
835 for (i
= 0; i
< src
->n_eq
; ++i
) {
836 int i1
= isl_basic_map_alloc_equality(dst
);
839 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
842 for (i
= 0; i
< src
->n_ineq
; ++i
) {
843 int i1
= isl_basic_map_alloc_inequality(dst
);
846 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
849 for (i
= 0; i
< src
->n_div
; ++i
) {
850 int i1
= isl_basic_map_alloc_div(dst
);
853 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
857 isl_basic_map_free(src
);
862 isl_basic_map_free(src
);
863 isl_basic_map_free(dst
);
867 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
868 struct isl_basic_set
*bset2
, unsigned pos
)
870 return (struct isl_basic_set
*)
871 add_constraints((struct isl_basic_map
*)bset1
,
872 (struct isl_basic_map
*)bset2
, 0, pos
);
875 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
876 struct isl_dim
*dim
, unsigned extra
,
877 unsigned n_eq
, unsigned n_ineq
)
879 struct isl_basic_map
*ext
;
889 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
890 base
->extra
>= base
->n_div
+ extra
;
892 if (dims_ok
&& room_for_con(base
, n_eq
+ n_ineq
) &&
893 room_for_ineq(base
, n_ineq
)) {
898 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
899 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
900 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
901 extra
+= base
->extra
;
903 n_ineq
+= base
->n_ineq
;
905 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
911 ext
->sample
= isl_vec_copy(base
->sample
);
913 ext
= add_constraints(ext
, base
, 0, 0);
916 ISL_F_CLR(ext
, ISL_BASIC_SET_FINAL
);
923 isl_basic_map_free(base
);
927 struct isl_basic_set
*isl_basic_set_extend_dim(struct isl_basic_set
*base
,
928 struct isl_dim
*dim
, unsigned extra
,
929 unsigned n_eq
, unsigned n_ineq
)
931 return (struct isl_basic_set
*)
932 isl_basic_map_extend_dim((struct isl_basic_map
*)base
, dim
,
933 extra
, n_eq
, n_ineq
);
936 struct isl_basic_map
*isl_basic_map_extend_constraints(
937 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
941 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
945 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
946 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
947 unsigned n_eq
, unsigned n_ineq
)
949 struct isl_basic_map
*bmap
;
954 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
958 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
962 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
963 unsigned nparam
, unsigned dim
, unsigned extra
,
964 unsigned n_eq
, unsigned n_ineq
)
966 return (struct isl_basic_set
*)
967 isl_basic_map_extend((struct isl_basic_map
*)base
,
968 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
971 struct isl_basic_set
*isl_basic_set_extend_constraints(
972 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
974 return (struct isl_basic_set
*)
975 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
979 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
981 return (struct isl_basic_set
*)
982 isl_basic_map_cow((struct isl_basic_map
*)bset
);
985 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
992 bmap
= isl_basic_map_dup(bmap
);
994 ISL_F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
998 struct isl_set
*isl_set_cow(struct isl_set
*set
)
1006 return isl_set_dup(set
);
1009 struct isl_map
*isl_map_cow(struct isl_map
*map
)
1017 return isl_map_dup(map
);
1020 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
1021 unsigned a_len
, unsigned b_len
)
1023 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
1024 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
1025 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
1028 struct isl_basic_set
*isl_basic_set_swap_vars(
1029 struct isl_basic_set
*bset
, unsigned n
)
1039 nparam
= isl_basic_set_n_param(bset
);
1040 dim
= isl_basic_set_n_dim(bset
);
1041 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
1046 bset
= isl_basic_set_cow(bset
);
1050 blk
= isl_blk_alloc(bset
->ctx
, dim
);
1051 if (isl_blk_is_error(blk
))
1054 for (i
= 0; i
< bset
->n_eq
; ++i
)
1056 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
1058 for (i
= 0; i
< bset
->n_ineq
; ++i
)
1060 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
1062 for (i
= 0; i
< bset
->n_div
; ++i
)
1064 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
1066 isl_blk_free(bset
->ctx
, blk
);
1068 ISL_F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
1072 isl_basic_set_free(bset
);
1076 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
1079 set
= isl_set_cow(set
);
1083 for (i
= 0; i
< set
->n
; ++i
) {
1084 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
1090 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1094 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
1100 total
= isl_basic_map_total_dim(bmap
);
1101 isl_basic_map_free_div(bmap
, bmap
->n_div
);
1102 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
1104 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
1106 isl_basic_map_alloc_equality(bmap
);
1110 isl_int_set_si(bmap
->eq
[i
][0], 1);
1111 isl_seq_clr(bmap
->eq
[i
]+1, total
);
1112 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
1113 return isl_basic_map_finalize(bmap
);
1115 isl_basic_map_free(bmap
);
1119 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1121 return (struct isl_basic_set
*)
1122 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1125 void isl_basic_map_swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1128 unsigned off
= isl_dim_total(bmap
->dim
);
1129 isl_int
*t
= bmap
->div
[a
];
1130 bmap
->div
[a
] = bmap
->div
[b
];
1133 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1134 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1136 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1137 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1139 for (i
= 0; i
< bmap
->n_div
; ++i
)
1140 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1141 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1144 /* Eliminate the specified n dimensions starting at first from the
1145 * constraints using Fourier-Motzkin, The dimensions themselves
1148 struct isl_set
*isl_set_eliminate_dims(struct isl_set
*set
,
1149 unsigned first
, unsigned n
)
1159 set
= isl_set_cow(set
);
1162 isl_assert(set
->ctx
, first
+n
<= isl_set_n_dim(set
), goto error
);
1163 nparam
= isl_set_n_param(set
);
1165 for (i
= 0; i
< set
->n
; ++i
) {
1166 set
->p
[i
] = isl_basic_set_eliminate_vars(set
->p
[i
],
1177 /* Project out n dimensions starting at first using Fourier-Motzkin */
1178 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1179 unsigned first
, unsigned n
)
1181 set
= isl_set_eliminate_dims(set
, first
, n
);
1182 set
= isl_set_drop_dims(set
, first
, n
);
1186 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1188 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1196 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1205 set
= isl_set_cow(set
);
1209 for (i
= 0; i
< set
->n
; ++i
) {
1210 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1220 struct isl_basic_map
*isl_basic_map_remove(struct isl_basic_map
*bmap
,
1221 enum isl_dim_type type
, unsigned first
, unsigned n
)
1225 isl_assert(bmap
->ctx
, first
+ n
<= isl_basic_map_dim(bmap
, type
),
1229 bmap
= isl_basic_map_eliminate_vars(bmap
,
1230 isl_basic_map_offset(bmap
, type
) - 1 + first
, n
);
1233 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
) && type
== isl_dim_div
)
1235 bmap
= isl_basic_map_drop(bmap
, type
, first
, n
);
1238 isl_basic_map_free(bmap
);
1242 __isl_give isl_basic_set
*isl_basic_set_remove(__isl_take isl_basic_set
*bset
,
1243 enum isl_dim_type type
, unsigned first
, unsigned n
)
1245 return (isl_basic_set
*)
1246 isl_basic_map_remove((isl_basic_map
*)bset
, type
, first
, n
);
1249 struct isl_map
*isl_map_remove(struct isl_map
*map
,
1250 enum isl_dim_type type
, unsigned first
, unsigned n
)
1257 map
= isl_map_cow(map
);
1260 isl_assert(map
->ctx
, first
+ n
<= isl_map_dim(map
, type
), goto error
);
1262 for (i
= 0; i
< map
->n
; ++i
) {
1263 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1264 isl_basic_map_offset(map
->p
[i
], type
) - 1 + first
, n
);
1268 map
= isl_map_drop(map
, type
, first
, n
);
1275 /* Project out n inputs starting at first using Fourier-Motzkin */
1276 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1277 unsigned first
, unsigned n
)
1279 return isl_map_remove(map
, isl_dim_in
, first
, n
);
1282 /* Project out n dimensions starting at first using Fourier-Motzkin */
1283 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1284 unsigned first
, unsigned n
)
1286 unsigned nparam
= isl_basic_set_n_param(bset
);
1287 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1288 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1292 static void dump_term(struct isl_basic_map
*bmap
,
1293 isl_int c
, int pos
, FILE *out
)
1296 unsigned in
= isl_basic_map_n_in(bmap
);
1297 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1298 unsigned nparam
= isl_basic_map_n_param(bmap
);
1300 isl_int_print(out
, c
, 0);
1302 if (!isl_int_is_one(c
))
1303 isl_int_print(out
, c
, 0);
1304 if (pos
< 1 + nparam
) {
1305 name
= isl_dim_get_name(bmap
->dim
,
1306 isl_dim_param
, pos
- 1);
1308 fprintf(out
, "%s", name
);
1310 fprintf(out
, "p%d", pos
- 1);
1311 } else if (pos
< 1 + nparam
+ in
)
1312 fprintf(out
, "i%d", pos
- 1 - nparam
);
1313 else if (pos
< 1 + nparam
+ dim
)
1314 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1316 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1320 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1321 int sign
, FILE *out
)
1325 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1329 for (i
= 0, first
= 1; i
< len
; ++i
) {
1330 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1333 fprintf(out
, " + ");
1335 isl_int_abs(v
, c
[i
]);
1336 dump_term(bmap
, v
, i
, out
);
1343 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1344 const char *op
, FILE *out
, int indent
)
1348 fprintf(out
, "%*s", indent
, "");
1350 dump_constraint_sign(bmap
, c
, 1, out
);
1351 fprintf(out
, " %s ", op
);
1352 dump_constraint_sign(bmap
, c
, -1, out
);
1356 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1357 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1359 fprintf(out
, "%*s", indent
, "");
1360 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1365 static void dump_constraints(struct isl_basic_map
*bmap
,
1366 isl_int
**c
, unsigned n
,
1367 const char *op
, FILE *out
, int indent
)
1371 for (i
= 0; i
< n
; ++i
)
1372 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1375 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1379 unsigned total
= isl_basic_map_total_dim(bmap
);
1381 for (j
= 0; j
< 1 + total
; ++j
) {
1382 if (isl_int_is_zero(exp
[j
]))
1384 if (!first
&& isl_int_is_pos(exp
[j
]))
1386 dump_term(bmap
, exp
[j
], j
, out
);
1391 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1395 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1396 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1398 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1399 fprintf(out
, "%*s", indent
, "");
1400 fprintf(out
, "e%d = [(", i
);
1401 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1403 isl_int_print(out
, bmap
->div
[i
][0], 0);
1404 fprintf(out
, "]\n");
1408 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1411 fprintf(out
, "null basic set\n");
1415 fprintf(out
, "%*s", indent
, "");
1416 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1417 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1418 bset
->extra
, bset
->flags
);
1419 dump((struct isl_basic_map
*)bset
, out
, indent
);
1422 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1425 fprintf(out
, "null basic map\n");
1429 fprintf(out
, "%*s", indent
, "");
1430 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1431 "flags: %x, n_name: %d\n",
1433 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1434 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1435 dump(bmap
, out
, indent
);
1438 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1443 total
= isl_basic_map_total_dim(bmap
);
1444 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1445 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1446 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1447 ISL_F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1451 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1453 struct isl_set
*set
;
1457 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1458 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1459 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1460 sizeof(struct isl_set
) +
1461 (n
- 1) * sizeof(struct isl_basic_set
*));
1465 set
->ctx
= dim
->ctx
;
1466 isl_ctx_ref(set
->ctx
);
1478 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1479 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1481 struct isl_set
*set
;
1482 struct isl_dim
*dims
;
1484 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1488 set
= isl_set_alloc_dim(dims
, n
, flags
);
1492 /* Make sure "map" has room for at least "n" more basic maps.
1494 struct isl_map
*isl_map_grow(struct isl_map
*map
, int n
)
1497 struct isl_map
*grown
= NULL
;
1501 isl_assert(map
->ctx
, n
>= 0, goto error
);
1502 if (map
->n
+ n
<= map
->size
)
1504 grown
= isl_map_alloc_dim(isl_map_get_dim(map
), map
->n
+ n
, map
->flags
);
1507 for (i
= 0; i
< map
->n
; ++i
) {
1508 grown
->p
[i
] = isl_basic_map_copy(map
->p
[i
]);
1516 isl_map_free(grown
);
1521 /* Make sure "set" has room for at least "n" more basic sets.
1523 struct isl_set
*isl_set_grow(struct isl_set
*set
, int n
)
1525 return (struct isl_set
*)isl_map_grow((struct isl_map
*)set
, n
);
1528 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1531 struct isl_set
*dup
;
1536 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1539 for (i
= 0; i
< set
->n
; ++i
)
1540 dup
= isl_set_add(dup
, isl_basic_set_copy(set
->p
[i
]));
1544 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1546 struct isl_set
*set
;
1551 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1553 isl_basic_set_free(bset
);
1556 return isl_set_add(set
, bset
);
1559 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1561 struct isl_map
*map
;
1566 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1568 isl_basic_map_free(bmap
);
1571 return isl_map_add(map
, bmap
);
1574 struct isl_set
*isl_set_add(struct isl_set
*set
, struct isl_basic_set
*bset
)
1576 return (struct isl_set
*)isl_map_add((struct isl_map
*)set
,
1577 (struct isl_basic_map
*)bset
);
1580 void isl_set_free(struct isl_set
*set
)
1590 isl_ctx_deref(set
->ctx
);
1591 for (i
= 0; i
< set
->n
; ++i
)
1592 isl_basic_set_free(set
->p
[i
]);
1593 isl_dim_free(set
->dim
);
1597 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1602 fprintf(out
, "null set\n");
1606 fprintf(out
, "%*s", indent
, "");
1607 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1608 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1610 for (i
= 0; i
< set
->n
; ++i
) {
1611 fprintf(out
, "%*s", indent
, "");
1612 fprintf(out
, "basic set %d:\n", i
);
1613 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1617 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1622 fprintf(out
, "null map\n");
1626 fprintf(out
, "%*s", indent
, "");
1627 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1628 "flags: %x, n_name: %d\n",
1629 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1630 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1631 for (i
= 0; i
< map
->n
; ++i
) {
1632 fprintf(out
, "%*s", indent
, "");
1633 fprintf(out
, "basic map %d:\n", i
);
1634 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1638 struct isl_basic_map
*isl_basic_map_intersect_domain(
1639 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1641 struct isl_basic_map
*bmap_domain
;
1642 struct isl_dim
*dim
;
1647 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1648 bset
->dim
, isl_dim_param
), goto error
);
1650 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1651 isl_assert(bset
->ctx
,
1652 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1654 bmap
= isl_basic_map_cow(bmap
);
1655 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1656 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1659 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1660 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1661 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1663 bmap
= isl_basic_map_simplify(bmap
);
1664 return isl_basic_map_finalize(bmap
);
1666 isl_basic_map_free(bmap
);
1667 isl_basic_set_free(bset
);
1671 struct isl_basic_map
*isl_basic_map_intersect_range(
1672 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1674 struct isl_basic_map
*bmap_range
;
1679 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1680 bset
->dim
, isl_dim_param
), goto error
);
1682 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1683 isl_assert(bset
->ctx
,
1684 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1686 bmap
= isl_basic_map_cow(bmap
);
1687 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1688 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1691 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1692 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1694 bmap
= isl_basic_map_simplify(bmap
);
1695 return isl_basic_map_finalize(bmap
);
1697 isl_basic_map_free(bmap
);
1698 isl_basic_set_free(bset
);
1702 static int basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
1708 total
= 1 + isl_basic_map_total_dim(bmap
);
1709 if (total
!= vec
->size
)
1714 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
1715 isl_seq_inner_product(vec
->el
, bmap
->eq
[i
], total
, &s
);
1716 if (!isl_int_is_zero(s
)) {
1722 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
1723 isl_seq_inner_product(vec
->el
, bmap
->ineq
[i
], total
, &s
);
1724 if (isl_int_is_neg(s
)) {
1735 int isl_basic_set_contains(struct isl_basic_set
*bset
, struct isl_vec
*vec
)
1737 return basic_map_contains((struct isl_basic_map
*)bset
, vec
);
1740 struct isl_basic_map
*isl_basic_map_intersect(
1741 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1743 struct isl_vec
*sample
= NULL
;
1745 if (!bmap1
|| !bmap2
)
1748 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1749 bmap2
->dim
, isl_dim_param
), goto error
);
1750 if (isl_dim_total(bmap1
->dim
) ==
1751 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1752 isl_dim_total(bmap2
->dim
) !=
1753 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1754 return isl_basic_map_intersect(bmap2
, bmap1
);
1756 if (isl_dim_total(bmap2
->dim
) !=
1757 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1758 isl_assert(bmap1
->ctx
,
1759 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1761 if (bmap1
->sample
&&
1762 basic_map_contains(bmap1
, bmap1
->sample
) > 0 &&
1763 basic_map_contains(bmap2
, bmap1
->sample
) > 0)
1764 sample
= isl_vec_copy(bmap1
->sample
);
1765 else if (bmap2
->sample
&&
1766 basic_map_contains(bmap1
, bmap2
->sample
) > 0 &&
1767 basic_map_contains(bmap2
, bmap2
->sample
) > 0)
1768 sample
= isl_vec_copy(bmap2
->sample
);
1770 bmap1
= isl_basic_map_cow(bmap1
);
1771 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1772 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1775 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1778 isl_vec_free(bmap1
->sample
);
1779 bmap1
->sample
= sample
;
1782 bmap1
= isl_basic_map_simplify(bmap1
);
1783 return isl_basic_map_finalize(bmap1
);
1786 isl_vec_free(sample
);
1787 isl_basic_map_free(bmap1
);
1788 isl_basic_map_free(bmap2
);
1792 struct isl_basic_set
*isl_basic_set_intersect(
1793 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1795 return (struct isl_basic_set
*)
1796 isl_basic_map_intersect(
1797 (struct isl_basic_map
*)bset1
,
1798 (struct isl_basic_map
*)bset2
);
1801 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1804 struct isl_map
*result
;
1810 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1811 map2
->dim
, isl_dim_param
), goto error
);
1812 if (isl_dim_total(map1
->dim
) ==
1813 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1814 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1815 return isl_map_intersect(map2
, map1
);
1817 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1818 isl_assert(map1
->ctx
,
1819 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1821 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1822 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
1823 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
1825 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1826 map1
->n
* map2
->n
, flags
);
1829 for (i
= 0; i
< map1
->n
; ++i
)
1830 for (j
= 0; j
< map2
->n
; ++j
) {
1831 struct isl_basic_map
*part
;
1832 part
= isl_basic_map_intersect(
1833 isl_basic_map_copy(map1
->p
[i
]),
1834 isl_basic_map_copy(map2
->p
[j
]));
1835 if (isl_basic_map_is_empty(part
))
1836 isl_basic_map_free(part
);
1838 result
= isl_map_add(result
, part
);
1851 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1853 return (struct isl_set
*)
1854 isl_map_intersect((struct isl_map
*)set1
,
1855 (struct isl_map
*)set2
);
1858 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
1860 struct isl_dim
*dim
;
1861 struct isl_basic_set
*bset
;
1866 bmap
= isl_basic_map_cow(bmap
);
1869 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
1870 in
= isl_basic_map_n_in(bmap
);
1871 bset
= isl_basic_set_from_basic_map(bmap
);
1872 bset
= isl_basic_set_swap_vars(bset
, in
);
1873 return isl_basic_map_from_basic_set(bset
, dim
);
1876 /* Turn final n dimensions into existentially quantified variables.
1878 struct isl_basic_set
*isl_basic_set_project_out(struct isl_basic_set
*bset
,
1879 enum isl_dim_type type
, unsigned first
, unsigned n
)
1889 isl_assert(bset
->ctx
, type
== isl_dim_set
, goto error
);
1890 isl_assert(bset
->ctx
, first
+ n
== isl_basic_set_n_dim(bset
), goto error
);
1895 if (ISL_F_ISSET(bset
, ISL_BASIC_SET_RATIONAL
))
1896 return isl_basic_set_remove(bset
, type
, first
, n
);
1898 bset
= isl_basic_set_cow(bset
);
1900 row_size
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
1901 old
= bset
->block2
.data
;
1902 bset
->block2
= isl_blk_extend(bset
->ctx
, bset
->block2
,
1903 (bset
->extra
+ n
) * (1 + row_size
));
1904 if (!bset
->block2
.data
)
1906 new_div
= isl_alloc_array(ctx
, isl_int
*, bset
->extra
+ n
);
1909 for (i
= 0; i
< n
; ++i
) {
1910 new_div
[i
] = bset
->block2
.data
+
1911 (bset
->extra
+ i
) * (1 + row_size
);
1912 isl_seq_clr(new_div
[i
], 1 + row_size
);
1914 for (i
= 0; i
< bset
->extra
; ++i
)
1915 new_div
[n
+ i
] = bset
->block2
.data
+ (bset
->div
[i
] - old
);
1917 bset
->div
= new_div
;
1920 bset
->dim
= isl_dim_drop_outputs(bset
->dim
,
1921 isl_basic_set_n_dim(bset
) - n
, n
);
1924 bset
= isl_basic_set_simplify(bset
);
1925 bset
= isl_basic_set_drop_redundant_divs(bset
);
1926 return isl_basic_set_finalize(bset
);
1928 isl_basic_set_free(bset
);
1932 /* Turn final n dimensions into existentially quantified variables.
1934 __isl_give isl_set
*isl_set_project_out(__isl_take isl_set
*set
,
1935 enum isl_dim_type type
, unsigned first
, unsigned n
)
1942 isl_assert(set
->ctx
, type
== isl_dim_set
, goto error
);
1943 isl_assert(set
->ctx
, first
+ n
== isl_set_n_dim(set
), goto error
);
1948 set
= isl_set_cow(set
);
1951 set
->dim
= isl_dim_drop_outputs(set
->dim
, first
, n
);
1952 for (i
= 0; i
< set
->n
; ++i
) {
1953 set
->p
[i
] = isl_basic_set_project_out(set
->p
[i
], type
, first
, n
);
1958 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
1965 static struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
1969 for (i
= 0; i
< n
; ++i
) {
1970 j
= isl_basic_map_alloc_div(bmap
);
1973 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
1977 isl_basic_map_free(bmap
);
1981 struct isl_basic_map
*isl_basic_map_apply_range(
1982 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1984 struct isl_dim
*dim_result
= NULL
;
1985 struct isl_basic_map
*bmap
;
1986 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
1987 struct isl_dim_map
*dim_map1
, *dim_map2
;
1989 if (!bmap1
|| !bmap2
)
1992 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
1993 isl_dim_copy(bmap2
->dim
));
1995 n_in
= isl_basic_map_n_in(bmap1
);
1996 n_out
= isl_basic_map_n_out(bmap2
);
1997 n
= isl_basic_map_n_out(bmap1
);
1998 nparam
= isl_basic_map_n_param(bmap1
);
2000 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
2001 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2002 dim_map2
= isl_dim_map_alloc(bmap1
->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
= 0);
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_out
, pos
+= n_in
);
2007 isl_dim_map_div(dim_map1
, bmap1
, pos
+= 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_in
, pos
);
2012 bmap
= isl_basic_map_alloc_dim(dim_result
,
2013 bmap1
->n_div
+ bmap2
->n_div
+ n
,
2014 bmap1
->n_eq
+ bmap2
->n_eq
,
2015 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2016 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2017 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2018 bmap
= add_divs(bmap
, n
);
2019 bmap
= isl_basic_map_simplify(bmap
);
2020 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
2021 return isl_basic_map_finalize(bmap
);
2023 isl_basic_map_free(bmap1
);
2024 isl_basic_map_free(bmap2
);
2028 struct isl_basic_set
*isl_basic_set_apply(
2029 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
2034 isl_assert(bset
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
2037 return (struct isl_basic_set
*)
2038 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
2040 isl_basic_set_free(bset
);
2041 isl_basic_map_free(bmap
);
2045 struct isl_basic_map
*isl_basic_map_apply_domain(
2046 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2048 if (!bmap1
|| !bmap2
)
2051 isl_assert(bmap1
->ctx
,
2052 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
2053 isl_assert(bmap1
->ctx
,
2054 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
2057 bmap1
= isl_basic_map_reverse(bmap1
);
2058 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
2059 return isl_basic_map_reverse(bmap1
);
2061 isl_basic_map_free(bmap1
);
2062 isl_basic_map_free(bmap2
);
2066 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2067 * A \cap B -> f(A) + f(B)
2069 struct isl_basic_map
*isl_basic_map_sum(
2070 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
2072 unsigned n_in
, n_out
, nparam
, total
, pos
;
2073 struct isl_basic_map
*bmap
= NULL
;
2074 struct isl_dim_map
*dim_map1
, *dim_map2
;
2077 if (!bmap1
|| !bmap2
)
2080 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
2083 nparam
= isl_basic_map_n_param(bmap1
);
2084 n_in
= isl_basic_map_n_in(bmap1
);
2085 n_out
= isl_basic_map_n_out(bmap1
);
2087 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
2088 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
2089 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
2090 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
2091 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
2092 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
2093 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
2094 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
2095 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
2096 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
2097 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
2099 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
2100 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
2101 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
2102 bmap1
->n_ineq
+ bmap2
->n_ineq
);
2103 for (i
= 0; i
< n_out
; ++i
) {
2104 int j
= isl_basic_map_alloc_equality(bmap
);
2107 isl_seq_clr(bmap
->eq
[j
], 1+total
);
2108 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
2109 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
2110 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
2112 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
2113 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
2114 bmap
= add_divs(bmap
, 2 * n_out
);
2116 bmap
= isl_basic_map_simplify(bmap
);
2117 return isl_basic_map_finalize(bmap
);
2119 isl_basic_map_free(bmap
);
2120 isl_basic_map_free(bmap1
);
2121 isl_basic_map_free(bmap2
);
2125 /* Given two maps A -> f(A) and B -> g(B), construct a map
2126 * A \cap B -> f(A) + f(B)
2128 struct isl_map
*isl_map_sum(struct isl_map
*map1
, struct isl_map
*map2
)
2130 struct isl_map
*result
;
2136 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2138 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2139 map1
->n
* map2
->n
, 0);
2142 for (i
= 0; i
< map1
->n
; ++i
)
2143 for (j
= 0; j
< map2
->n
; ++j
) {
2144 struct isl_basic_map
*part
;
2145 part
= isl_basic_map_sum(
2146 isl_basic_map_copy(map1
->p
[i
]),
2147 isl_basic_map_copy(map2
->p
[j
]));
2148 if (isl_basic_map_is_empty(part
))
2149 isl_basic_map_free(part
);
2151 result
= isl_map_add(result
, part
);
2164 /* Given a basic map A -> f(A), construct A -> -f(A).
2166 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
2171 bmap
= isl_basic_map_cow(bmap
);
2175 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
2176 off
= isl_basic_map_offset(bmap
, isl_dim_out
);
2177 for (i
= 0; i
< bmap
->n_eq
; ++i
)
2178 for (j
= 0; j
< n
; ++j
)
2179 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
2180 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
2181 for (j
= 0; j
< n
; ++j
)
2182 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
2183 for (i
= 0; i
< bmap
->n_div
; ++i
)
2184 for (j
= 0; j
< n
; ++j
)
2185 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
2186 return isl_basic_map_finalize(bmap
);
2189 /* Given a map A -> f(A), construct A -> -f(A).
2191 struct isl_map
*isl_map_neg(struct isl_map
*map
)
2195 map
= isl_map_cow(map
);
2199 for (i
= 0; i
< map
->n
; ++i
) {
2200 map
->p
[i
] = isl_basic_map_neg(map
->p
[i
]);
2211 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2212 * A -> floor(f(A)/d).
2214 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
2217 unsigned n_in
, n_out
, nparam
, total
, pos
;
2218 struct isl_basic_map
*result
= NULL
;
2219 struct isl_dim_map
*dim_map
;
2225 nparam
= isl_basic_map_n_param(bmap
);
2226 n_in
= isl_basic_map_n_in(bmap
);
2227 n_out
= isl_basic_map_n_out(bmap
);
2229 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
2230 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
2231 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
2232 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
2233 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
2234 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
2236 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
2237 bmap
->n_div
+ n_out
,
2238 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
2239 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
2240 result
= add_divs(result
, n_out
);
2241 for (i
= 0; i
< n_out
; ++i
) {
2243 j
= isl_basic_map_alloc_inequality(result
);
2246 isl_seq_clr(result
->ineq
[j
], 1+total
);
2247 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2248 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
2249 j
= isl_basic_map_alloc_inequality(result
);
2252 isl_seq_clr(result
->ineq
[j
], 1+total
);
2253 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
2254 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
2255 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
2258 result
= isl_basic_map_simplify(result
);
2259 return isl_basic_map_finalize(result
);
2261 isl_basic_map_free(result
);
2265 /* Given a map A -> f(A) and an integer d, construct a map
2266 * A -> floor(f(A)/d).
2268 struct isl_map
*isl_map_floordiv(struct isl_map
*map
, isl_int d
)
2272 map
= isl_map_cow(map
);
2276 ISL_F_CLR(map
, ISL_MAP_DISJOINT
);
2277 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
2278 for (i
= 0; i
< map
->n
; ++i
) {
2279 map
->p
[i
] = isl_basic_map_floordiv(map
->p
[i
], d
);
2290 static struct isl_basic_map
*var_equal(struct isl_basic_map
*bmap
, unsigned pos
)
2296 i
= isl_basic_map_alloc_equality(bmap
);
2299 nparam
= isl_basic_map_n_param(bmap
);
2300 n_in
= isl_basic_map_n_in(bmap
);
2301 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2302 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
2303 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
2304 return isl_basic_map_finalize(bmap
);
2306 isl_basic_map_free(bmap
);
2310 /* Add a constraints to "bmap" expressing i_pos < o_pos
2312 static struct isl_basic_map
*var_less(struct isl_basic_map
*bmap
, unsigned pos
)
2318 i
= isl_basic_map_alloc_inequality(bmap
);
2321 nparam
= isl_basic_map_n_param(bmap
);
2322 n_in
= isl_basic_map_n_in(bmap
);
2323 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2324 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2325 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
2326 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
2327 return isl_basic_map_finalize(bmap
);
2329 isl_basic_map_free(bmap
);
2333 /* Add a constraints to "bmap" expressing i_pos > o_pos
2335 static struct isl_basic_map
*var_more(struct isl_basic_map
*bmap
, unsigned pos
)
2341 i
= isl_basic_map_alloc_inequality(bmap
);
2344 nparam
= isl_basic_map_n_param(bmap
);
2345 n_in
= isl_basic_map_n_in(bmap
);
2346 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
2347 isl_int_set_si(bmap
->ineq
[i
][0], -1);
2348 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
2349 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
2350 return isl_basic_map_finalize(bmap
);
2352 isl_basic_map_free(bmap
);
2356 struct isl_basic_map
*isl_basic_map_equal(struct isl_dim
*dim
, unsigned n_equal
)
2359 struct isl_basic_map
*bmap
;
2360 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_equal
, 0);
2363 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2364 bmap
= var_equal(bmap
, i
);
2365 return isl_basic_map_finalize(bmap
);
2368 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2370 struct isl_basic_map
*isl_basic_map_less_at(struct isl_dim
*dim
, unsigned pos
)
2373 struct isl_basic_map
*bmap
;
2374 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2377 for (i
= 0; i
< pos
&& bmap
; ++i
)
2378 bmap
= var_equal(bmap
, i
);
2380 bmap
= var_less(bmap
, pos
);
2381 return isl_basic_map_finalize(bmap
);
2384 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2386 struct isl_basic_map
*isl_basic_map_more_at(struct isl_dim
*dim
, unsigned pos
)
2389 struct isl_basic_map
*bmap
;
2390 bmap
= isl_basic_map_alloc_dim(dim
, 0, pos
, 1);
2393 for (i
= 0; i
< pos
&& bmap
; ++i
)
2394 bmap
= var_equal(bmap
, i
);
2396 bmap
= var_more(bmap
, pos
);
2397 return isl_basic_map_finalize(bmap
);
2400 static __isl_give isl_map
*map_lex_lte(__isl_take isl_dim
*dims
, int equal
)
2402 struct isl_map
*map
;
2409 map
= isl_map_alloc_dim(isl_dim_copy(dims
), dim
+ equal
, ISL_MAP_DISJOINT
);
2411 for (i
= 0; i
< dim
; ++i
)
2412 map
= isl_map_add(map
,
2413 isl_basic_map_less_at(isl_dim_copy(dims
), i
));
2415 map
= isl_map_add(map
,
2416 isl_basic_map_equal(isl_dim_copy(dims
), dim
));
2422 __isl_give isl_map
*isl_map_lex_lt(__isl_take isl_dim
*set_dim
)
2424 return map_lex_lte(isl_dim_map(set_dim
), 0);
2427 __isl_give isl_map
*isl_map_lex_le(__isl_take isl_dim
*set_dim
)
2429 return map_lex_lte(isl_dim_map(set_dim
), 1);
2432 static __isl_give isl_map
*map_lex_gte(__isl_take isl_dim
*dims
, int equal
)
2434 struct isl_map
*map
;
2441 map
= isl_map_alloc_dim(isl_dim_copy(dims
), dim
+ equal
, ISL_MAP_DISJOINT
);
2443 for (i
= 0; i
< dim
; ++i
)
2444 map
= isl_map_add(map
,
2445 isl_basic_map_more_at(isl_dim_copy(dims
), i
));
2447 map
= isl_map_add(map
,
2448 isl_basic_map_equal(isl_dim_copy(dims
), dim
));
2454 __isl_give isl_map
*isl_map_lex_gt(__isl_take isl_dim
*set_dim
)
2456 return map_lex_gte(isl_dim_map(set_dim
), 0);
2459 __isl_give isl_map
*isl_map_lex_ge(__isl_take isl_dim
*set_dim
)
2461 return map_lex_gte(isl_dim_map(set_dim
), 1);
2464 struct isl_basic_map
*isl_basic_map_from_basic_set(
2465 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
2467 struct isl_basic_map
*bmap
;
2469 bset
= isl_basic_set_cow(bset
);
2473 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
2474 isl_dim_free(bset
->dim
);
2475 bmap
= (struct isl_basic_map
*) bset
;
2477 return isl_basic_map_finalize(bmap
);
2479 isl_basic_set_free(bset
);
2484 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
2488 if (bmap
->dim
->n_in
== 0)
2489 return (struct isl_basic_set
*)bmap
;
2490 bmap
= isl_basic_map_cow(bmap
);
2493 bmap
->dim
= isl_dim_cow(bmap
->dim
);
2496 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
2497 bmap
->dim
->n_in
= 0;
2498 bmap
= isl_basic_map_finalize(bmap
);
2499 return (struct isl_basic_set
*)bmap
;
2501 isl_basic_map_free(bmap
);
2505 /* For a div d = floor(f/m), add the constraints
2508 * -(f-(n-1)) + m d >= 0
2510 * Note that the second constraint is the negation of
2514 static int add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
2517 unsigned total
= isl_basic_map_total_dim(bmap
);
2518 unsigned div_pos
= 1 + total
- bmap
->n_div
+ div
;
2520 i
= isl_basic_map_alloc_inequality(bmap
);
2523 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
]+1, 1+total
);
2524 isl_int_neg(bmap
->ineq
[i
][div_pos
], bmap
->div
[div
][0]);
2526 j
= isl_basic_map_alloc_inequality(bmap
);
2529 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
2530 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][div_pos
]);
2531 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
2535 struct isl_basic_set
*isl_basic_map_underlying_set(
2536 struct isl_basic_map
*bmap
)
2540 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
2541 return (struct isl_basic_set
*)bmap
;
2542 bmap
= isl_basic_map_cow(bmap
);
2545 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
2548 bmap
->extra
-= bmap
->n_div
;
2550 bmap
= isl_basic_map_finalize(bmap
);
2551 return (struct isl_basic_set
*)bmap
;
2556 __isl_give isl_basic_set
*isl_basic_set_underlying_set(
2557 __isl_take isl_basic_set
*bset
)
2559 return isl_basic_map_underlying_set((isl_basic_map
*)bset
);
2562 struct isl_basic_map
*isl_basic_map_overlying_set(
2563 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
2565 struct isl_basic_map
*bmap
;
2566 struct isl_ctx
*ctx
;
2573 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
2574 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
2575 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
2577 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
2578 isl_basic_map_free(like
);
2579 return (struct isl_basic_map
*)bset
;
2581 bset
= isl_basic_set_cow(bset
);
2584 total
= bset
->dim
->n_out
+ bset
->extra
;
2585 bmap
= (struct isl_basic_map
*)bset
;
2586 isl_dim_free(bmap
->dim
);
2587 bmap
->dim
= isl_dim_copy(like
->dim
);
2590 bmap
->n_div
= like
->n_div
;
2591 bmap
->extra
+= like
->n_div
;
2594 ltotal
= total
- bmap
->extra
+ like
->extra
;
2597 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
2598 bmap
->extra
* (1 + 1 + total
));
2599 if (isl_blk_is_error(bmap
->block2
))
2601 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
2605 for (i
= 0; i
< bmap
->extra
; ++i
)
2606 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
2607 for (i
= 0; i
< like
->n_div
; ++i
) {
2608 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
2609 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
2611 bmap
= isl_basic_map_extend_constraints(bmap
,
2612 0, 2 * like
->n_div
);
2613 for (i
= 0; i
< like
->n_div
; ++i
) {
2614 if (isl_int_is_zero(bmap
->div
[i
][0]))
2616 if (add_div_constraints(bmap
, i
) < 0)
2620 isl_basic_map_free(like
);
2621 bmap
= isl_basic_map_simplify(bmap
);
2622 bmap
= isl_basic_map_finalize(bmap
);
2625 isl_basic_map_free(like
);
2626 isl_basic_set_free(bset
);
2630 struct isl_basic_set
*isl_basic_set_from_underlying_set(
2631 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
2633 return (struct isl_basic_set
*)
2634 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
2637 struct isl_set
*isl_set_from_underlying_set(
2638 struct isl_set
*set
, struct isl_basic_set
*like
)
2644 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
2646 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
2647 isl_basic_set_free(like
);
2650 set
= isl_set_cow(set
);
2653 for (i
= 0; i
< set
->n
; ++i
) {
2654 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
2655 isl_basic_set_copy(like
));
2659 isl_dim_free(set
->dim
);
2660 set
->dim
= isl_dim_copy(like
->dim
);
2663 isl_basic_set_free(like
);
2666 isl_basic_set_free(like
);
2671 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
2675 map
= isl_map_cow(map
);
2678 map
->dim
= isl_dim_cow(map
->dim
);
2682 for (i
= 1; i
< map
->n
; ++i
)
2683 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
2685 for (i
= 0; i
< map
->n
; ++i
) {
2686 map
->p
[i
] = (struct isl_basic_map
*)
2687 isl_basic_map_underlying_set(map
->p
[i
]);
2692 map
->dim
= isl_dim_underlying(map
->dim
, 0);
2694 isl_dim_free(map
->dim
);
2695 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
2699 return (struct isl_set
*)map
;
2705 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
2707 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
2710 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
2712 struct isl_basic_set
*domain
;
2717 n_in
= isl_basic_map_n_in(bmap
);
2718 n_out
= isl_basic_map_n_out(bmap
);
2719 domain
= isl_basic_set_from_basic_map(bmap
);
2720 return isl_basic_set_project_out(domain
, isl_dim_set
, n_in
, n_out
);
2723 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
2725 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
2728 struct isl_set
*isl_map_range(struct isl_map
*map
)
2731 struct isl_set
*set
;
2735 map
= isl_map_cow(map
);
2739 set
= (struct isl_set
*) map
;
2740 if (set
->dim
->n_in
!= 0) {
2741 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
2745 for (i
= 0; i
< map
->n
; ++i
) {
2746 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
2750 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
2751 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
2758 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
2761 struct isl_map
*map
= NULL
;
2763 set
= isl_set_cow(set
);
2766 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
2767 map
= (struct isl_map
*)set
;
2768 for (i
= 0; i
< set
->n
; ++i
) {
2769 map
->p
[i
] = isl_basic_map_from_basic_set(
2770 set
->p
[i
], isl_dim_copy(dim
));
2774 isl_dim_free(map
->dim
);
2783 struct isl_map
*isl_map_from_range(struct isl_set
*set
)
2785 return (struct isl_map
*)set
;
2788 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
2791 struct isl_set
*set
= NULL
;
2795 map
= isl_map_cow(map
);
2798 map
->dim
= isl_dim_cow(map
->dim
);
2801 map
->dim
->n_out
+= map
->dim
->n_in
;
2803 set
= (struct isl_set
*)map
;
2804 for (i
= 0; i
< map
->n
; ++i
) {
2805 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
2815 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2817 struct isl_map
*map
;
2821 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
2822 map
= isl_alloc(dim
->ctx
, struct isl_map
,
2823 sizeof(struct isl_map
) +
2824 (n
- 1) * sizeof(struct isl_basic_map
*));
2828 map
->ctx
= dim
->ctx
;
2829 isl_ctx_ref(map
->ctx
);
2841 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
2842 unsigned nparam
, unsigned in
, unsigned out
, int n
,
2845 struct isl_map
*map
;
2846 struct isl_dim
*dims
;
2848 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
2852 map
= isl_map_alloc_dim(dims
, n
, flags
);
2856 struct isl_basic_map
*isl_basic_map_empty(struct isl_dim
*dim
)
2858 struct isl_basic_map
*bmap
;
2859 bmap
= isl_basic_map_alloc_dim(dim
, 0, 1, 0);
2860 bmap
= isl_basic_map_set_to_empty(bmap
);
2864 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
2866 struct isl_basic_set
*bset
;
2867 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
2868 bset
= isl_basic_set_set_to_empty(bset
);
2872 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
2874 struct isl_basic_map
*bmap
;
2877 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2878 bmap
= isl_basic_map_set_to_empty(bmap
);
2882 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
2884 struct isl_basic_map
*bmap
;
2887 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2888 bmap
= isl_basic_map_set_to_empty(bmap
);
2892 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
2894 struct isl_basic_set
*bset
;
2897 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2898 bset
= isl_basic_set_set_to_empty(bset
);
2902 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
2904 struct isl_basic_map
*bmap
;
2905 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
2909 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
2911 struct isl_basic_set
*bset
;
2912 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
2916 __isl_give isl_basic_map
*isl_basic_map_universe_like(
2917 __isl_keep isl_basic_map
*model
)
2921 return isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2924 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
2928 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2931 __isl_give isl_basic_set
*isl_basic_set_universe_like_set(
2932 __isl_keep isl_set
*model
)
2936 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2939 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
2941 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2944 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
2948 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2951 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
2955 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2958 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
2960 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2963 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
2967 return isl_set_empty(isl_dim_copy(model
->dim
));
2970 struct isl_map
*isl_map_universe(struct isl_dim
*dim
)
2972 struct isl_map
*map
;
2975 map
= isl_map_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2976 map
= isl_map_add(map
, isl_basic_map_universe(dim
));
2980 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
2982 struct isl_set
*set
;
2985 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2986 set
= isl_set_add(set
, isl_basic_set_universe(dim
));
2990 __isl_give isl_set
*isl_set_universe_like(__isl_keep isl_set
*model
)
2994 return isl_set_universe(isl_dim_copy(model
->dim
));
2997 struct isl_map
*isl_map_dup(struct isl_map
*map
)
3000 struct isl_map
*dup
;
3004 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
3005 for (i
= 0; i
< map
->n
; ++i
)
3006 dup
= isl_map_add(dup
, isl_basic_map_copy(map
->p
[i
]));
3010 struct isl_map
*isl_map_add(struct isl_map
*map
, struct isl_basic_map
*bmap
)
3014 if (isl_basic_map_fast_is_empty(bmap
)) {
3015 isl_basic_map_free(bmap
);
3018 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
3019 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
3020 map
->p
[map
->n
] = bmap
;
3022 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3028 isl_basic_map_free(bmap
);
3032 void isl_map_free(struct isl_map
*map
)
3042 isl_ctx_deref(map
->ctx
);
3043 for (i
= 0; i
< map
->n
; ++i
)
3044 isl_basic_map_free(map
->p
[i
]);
3045 isl_dim_free(map
->dim
);
3049 struct isl_map
*isl_map_extend(struct isl_map
*base
,
3050 unsigned nparam
, unsigned n_in
, unsigned n_out
)
3054 base
= isl_map_cow(base
);
3058 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
3061 for (i
= 0; i
< base
->n
; ++i
) {
3062 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
3063 isl_dim_copy(base
->dim
), 0, 0, 0);
3073 struct isl_set
*isl_set_extend(struct isl_set
*base
,
3074 unsigned nparam
, unsigned dim
)
3076 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
3080 static struct isl_basic_map
*isl_basic_map_fix_pos(struct isl_basic_map
*bmap
,
3081 unsigned pos
, int value
)
3085 bmap
= isl_basic_map_cow(bmap
);
3086 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
3087 j
= isl_basic_map_alloc_equality(bmap
);
3090 isl_seq_clr(bmap
->eq
[j
] + 1, isl_basic_map_total_dim(bmap
));
3091 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
3092 isl_int_set_si(bmap
->eq
[j
][0], value
);
3093 bmap
= isl_basic_map_simplify(bmap
);
3094 return isl_basic_map_finalize(bmap
);
3096 isl_basic_map_free(bmap
);
3100 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
3101 enum isl_dim_type type
, unsigned pos
, int value
)
3105 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
3106 return isl_basic_map_fix_pos(bmap
, isl_basic_map_offset(bmap
, type
) + pos
,
3109 isl_basic_map_free(bmap
);
3113 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
3114 enum isl_dim_type type
, unsigned pos
, int value
)
3116 return (struct isl_basic_set
*)
3117 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3121 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
3122 unsigned input
, int value
)
3124 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
3127 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
3128 unsigned dim
, int value
)
3130 return (struct isl_basic_set
*)
3131 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
3132 isl_dim_set
, dim
, value
);
3135 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
3136 enum isl_dim_type type
, unsigned pos
, int value
)
3140 map
= isl_map_cow(map
);
3144 isl_assert(map
->ctx
, pos
< isl_map_dim(map
, type
), goto error
);
3145 for (i
= 0; i
< map
->n
; ++i
) {
3146 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
3150 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3157 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
3158 unsigned input
, int value
)
3160 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
3163 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
3165 return (struct isl_set
*)
3166 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
3169 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
3170 unsigned dim
, isl_int value
)
3174 bset
= isl_basic_set_cow(bset
);
3175 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
3176 j
= isl_basic_set_alloc_inequality(bset
);
3179 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
3180 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
3181 isl_int_neg(bset
->ineq
[j
][0], value
);
3182 bset
= isl_basic_set_simplify(bset
);
3183 return isl_basic_set_finalize(bset
);
3185 isl_basic_set_free(bset
);
3189 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
3194 set
= isl_set_cow(set
);
3198 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
3199 for (i
= 0; i
< set
->n
; ++i
) {
3200 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
3210 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
3214 map
= isl_map_cow(map
);
3218 map
->dim
= isl_dim_reverse(map
->dim
);
3221 for (i
= 0; i
< map
->n
; ++i
) {
3222 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
3226 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
3233 static struct isl_map
*isl_basic_map_partial_lexopt(
3234 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3235 struct isl_set
**empty
, int max
)
3239 if (bmap
->ctx
->pip
== ISL_PIP_PIP
)
3240 return isl_pip_basic_map_lexopt(bmap
, dom
, empty
, max
);
3242 return isl_tab_basic_map_partial_lexopt(bmap
, dom
, empty
, max
);
3244 isl_basic_map_free(bmap
);
3245 isl_basic_set_free(dom
);
3251 struct isl_map
*isl_basic_map_partial_lexmax(
3252 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3253 struct isl_set
**empty
)
3255 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 1);
3258 struct isl_map
*isl_basic_map_partial_lexmin(
3259 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
3260 struct isl_set
**empty
)
3262 return isl_basic_map_partial_lexopt(bmap
, dom
, empty
, 0);
3265 struct isl_set
*isl_basic_set_partial_lexmin(
3266 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3267 struct isl_set
**empty
)
3269 return (struct isl_set
*)
3270 isl_basic_map_partial_lexmin((struct isl_basic_map
*)bset
,
3274 struct isl_set
*isl_basic_set_partial_lexmax(
3275 struct isl_basic_set
*bset
, struct isl_basic_set
*dom
,
3276 struct isl_set
**empty
)
3278 return (struct isl_set
*)
3279 isl_basic_map_partial_lexmax((struct isl_basic_map
*)bset
,
3283 __isl_give isl_map
*isl_basic_map_lexmin(__isl_take isl_basic_map
*bmap
)
3285 struct isl_basic_set
*dom
= NULL
;
3286 struct isl_map
*min
;
3287 struct isl_dim
*dom_dim
;
3291 dom_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
3292 dom
= isl_basic_set_universe(dom_dim
);
3293 return isl_basic_map_partial_lexmin(bmap
, dom
, NULL
);
3295 isl_basic_map_free(bmap
);
3299 __isl_give isl_set
*isl_basic_set_lexmin(__isl_take isl_basic_set
*bset
)
3301 return (isl_set
*)isl_basic_map_lexmin((isl_basic_map
*)bset
);
3304 static struct isl_map
*isl_map_reset_dim(struct isl_map
*map
,
3305 struct isl_dim
*dim
)
3312 for (i
= 0; i
< map
->n
; ++i
) {
3313 isl_dim_free(map
->p
[i
]->dim
);
3314 map
->p
[i
]->dim
= isl_dim_copy(dim
);
3316 isl_dim_free(map
->dim
);
3326 static struct isl_set
*isl_set_reset_dim(struct isl_set
*set
,
3327 struct isl_dim
*dim
)
3329 return (struct isl_set
*) isl_map_reset_dim((struct isl_map
*)set
, dim
);
3332 /* Apply a preimage specified by "mat" on the parameters of "bset".
3333 * bset is assumed to have only parameters and divs.
3335 static struct isl_basic_set
*basic_set_parameter_preimage(
3336 struct isl_basic_set
*bset
, struct isl_mat
*mat
)
3343 bset
->dim
= isl_dim_cow(bset
->dim
);
3347 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3349 isl_assert(bset
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3351 bset
->dim
->nparam
= 0;
3352 bset
->dim
->n_out
= nparam
;
3353 bset
= isl_basic_set_preimage(bset
, mat
);
3355 bset
->dim
->nparam
= bset
->dim
->n_out
;
3356 bset
->dim
->n_out
= 0;
3361 isl_basic_set_free(bset
);
3365 /* Apply a preimage specified by "mat" on the parameters of "set".
3366 * set is assumed to have only parameters and divs.
3368 static struct isl_set
*set_parameter_preimage(
3369 struct isl_set
*set
, struct isl_mat
*mat
)
3371 struct isl_dim
*dim
= NULL
;
3377 dim
= isl_dim_copy(set
->dim
);
3378 dim
= isl_dim_cow(dim
);
3382 nparam
= isl_set_dim(set
, isl_dim_param
);
3384 isl_assert(set
->ctx
, mat
->n_row
== 1 + nparam
, goto error
);
3387 dim
->n_out
= nparam
;
3388 isl_set_reset_dim(set
, dim
);
3389 set
= isl_set_preimage(set
, mat
);
3392 dim
= isl_dim_copy(set
->dim
);
3393 dim
= isl_dim_cow(dim
);
3396 dim
->nparam
= dim
->n_out
;
3398 isl_set_reset_dim(set
, dim
);
3408 /* Intersect the basic set "bset" with the affine space specified by the
3409 * equalities in "eq".
3411 static struct isl_basic_set
*basic_set_append_equalities(
3412 struct isl_basic_set
*bset
, struct isl_mat
*eq
)
3420 bset
= isl_basic_set_extend_dim(bset
, isl_dim_copy(bset
->dim
), 0,
3425 len
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
3426 for (i
= 0; i
< eq
->n_row
; ++i
) {
3427 k
= isl_basic_set_alloc_equality(bset
);
3430 isl_seq_cpy(bset
->eq
[k
], eq
->row
[i
], eq
->n_col
);
3431 isl_seq_clr(bset
->eq
[k
] + eq
->n_col
, len
- eq
->n_col
);
3438 isl_basic_set_free(bset
);
3442 /* Intersect the set "set" with the affine space specified by the
3443 * equalities in "eq".
3445 static struct isl_set
*set_append_equalities(struct isl_set
*set
,
3453 for (i
= 0; i
< set
->n
; ++i
) {
3454 set
->p
[i
] = basic_set_append_equalities(set
->p
[i
],
3467 /* Project the given basic set onto its parameter domain, possibly introducing
3468 * new, explicit, existential variables in the constraints.
3469 * The input has parameters and (possibly implicit) existential variables.
3470 * The output has the same parameters, but only
3471 * explicit existentially quantified variables.
3473 * The actual projection is performed by pip, but pip doesn't seem
3474 * to like equalities very much, so we first remove the equalities
3475 * among the parameters by performing a variable compression on
3476 * the parameters. Afterward, an inverse transformation is performed
3477 * and the equalities among the parameters are inserted back in.
3479 static struct isl_set
*parameter_compute_divs(struct isl_basic_set
*bset
)
3483 struct isl_mat
*T
, *T2
;
3484 struct isl_set
*set
;
3485 unsigned nparam
, n_div
;
3487 bset
= isl_basic_set_cow(bset
);
3491 if (bset
->n_eq
== 0)
3492 return isl_basic_set_lexmin(bset
);
3494 isl_basic_set_gauss(bset
, NULL
);
3496 nparam
= isl_basic_set_dim(bset
, isl_dim_param
);
3497 n_div
= isl_basic_set_dim(bset
, isl_dim_div
);
3499 for (i
= 0, j
= n_div
- 1; i
< bset
->n_eq
&& j
>= 0; --j
) {
3500 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ j
]))
3503 if (i
== bset
->n_eq
)
3504 return isl_basic_set_lexmin(bset
);
3506 eq
= isl_mat_sub_alloc(bset
->ctx
, bset
->eq
, i
, bset
->n_eq
- i
,
3508 eq
= isl_mat_cow(eq
);
3509 T
= isl_mat_variable_compression(isl_mat_copy(eq
), &T2
);
3510 bset
= basic_set_parameter_preimage(bset
, T
);
3512 set
= isl_basic_set_lexmin(bset
);
3513 set
= set_parameter_preimage(set
, T2
);
3514 set
= set_append_equalities(set
, eq
);
3518 /* Compute an explicit representation for all the existentially
3519 * quantified variables.
3520 * The input and output dimensions are first turned into parameters.
3521 * compute_divs then returns a map with the same parameters and
3522 * no input or output dimensions and the dimension specification
3523 * is reset to that of the input.
3525 static struct isl_map
*compute_divs(struct isl_basic_map
*bmap
)
3527 struct isl_basic_set
*bset
;
3528 struct isl_set
*set
;
3529 struct isl_map
*map
;
3530 struct isl_dim
*dim
, *orig_dim
= NULL
;
3535 bmap
= isl_basic_map_cow(bmap
);
3539 nparam
= isl_basic_map_dim(bmap
, isl_dim_param
);
3540 n_in
= isl_basic_map_dim(bmap
, isl_dim_in
);
3541 n_out
= isl_basic_map_dim(bmap
, isl_dim_out
);
3542 dim
= isl_dim_set_alloc(bmap
->ctx
, nparam
+ n_in
+ n_out
, 0);
3546 orig_dim
= bmap
->dim
;
3548 bset
= (struct isl_basic_set
*)bmap
;
3550 set
= parameter_compute_divs(bset
);
3551 map
= (struct isl_map
*)set
;
3552 map
= isl_map_reset_dim(map
, orig_dim
);
3556 isl_basic_map_free(bmap
);
3560 static int basic_map_divs_known(__isl_keep isl_basic_map
*bmap
)
3568 off
= isl_dim_total(bmap
->dim
);
3569 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3570 if (isl_int_is_zero(bmap
->div
[i
][0]))
3572 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
3578 static int map_divs_known(__isl_keep isl_map
*map
)
3585 for (i
= 0; i
< map
->n
; ++i
) {
3586 int known
= basic_map_divs_known(map
->p
[i
]);
3594 /* If bmap contains any unknown divs, then compute explicit
3595 * expressions for them. However, this computation may be
3596 * quite expensive, so first try to remove divs that aren't
3599 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
3603 struct isl_map
*map
;
3605 known
= basic_map_divs_known(bmap
);
3609 return isl_map_from_basic_map(bmap
);
3611 bmap
= isl_basic_map_drop_redundant_divs(bmap
);
3613 known
= basic_map_divs_known(bmap
);
3617 return isl_map_from_basic_map(bmap
);
3619 map
= compute_divs(bmap
);
3622 isl_basic_map_free(bmap
);
3626 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
3630 struct isl_map
*res
;
3637 known
= map_divs_known(map
);
3645 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
3646 for (i
= 1 ; i
< map
->n
; ++i
) {
3648 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
3649 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
3650 res
= isl_map_union_disjoint(res
, r2
);
3652 res
= isl_map_union(res
, r2
);
3659 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
3661 return (struct isl_set
*)
3662 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
3665 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
3667 return (struct isl_set
*)
3668 isl_map_compute_divs((struct isl_map
*)set
);
3671 struct isl_set
*isl_map_domain(struct isl_map
*map
)
3674 struct isl_set
*set
;
3679 map
= isl_map_cow(map
);
3683 set
= (struct isl_set
*)map
;
3684 set
->dim
= isl_dim_domain(set
->dim
);
3687 for (i
= 0; i
< map
->n
; ++i
) {
3688 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
3692 ISL_F_CLR(set
, ISL_MAP_DISJOINT
);
3693 ISL_F_CLR(set
, ISL_SET_NORMALIZED
);
3700 struct isl_map
*isl_map_union_disjoint(
3701 struct isl_map
*map1
, struct isl_map
*map2
)
3705 struct isl_map
*map
= NULL
;
3719 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3721 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
3722 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
3723 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3725 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
3726 map1
->n
+ map2
->n
, flags
);
3729 for (i
= 0; i
< map1
->n
; ++i
) {
3730 map
= isl_map_add(map
,
3731 isl_basic_map_copy(map1
->p
[i
]));
3735 for (i
= 0; i
< map2
->n
; ++i
) {
3736 map
= isl_map_add(map
,
3737 isl_basic_map_copy(map2
->p
[i
]));
3751 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
3753 map1
= isl_map_union_disjoint(map1
, map2
);
3757 ISL_F_CLR(map1
, ISL_MAP_DISJOINT
);
3761 struct isl_set
*isl_set_union_disjoint(
3762 struct isl_set
*set1
, struct isl_set
*set2
)
3764 return (struct isl_set
*)
3765 isl_map_union_disjoint(
3766 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3769 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
3771 return (struct isl_set
*)
3772 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3775 struct isl_map
*isl_map_intersect_range(
3776 struct isl_map
*map
, struct isl_set
*set
)
3779 struct isl_map
*result
;
3785 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
) &&
3786 ISL_F_ISSET(set
, ISL_MAP_DISJOINT
))
3787 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
3789 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
3790 map
->n
* set
->n
, flags
);
3793 for (i
= 0; i
< map
->n
; ++i
)
3794 for (j
= 0; j
< set
->n
; ++j
) {
3795 result
= isl_map_add(result
,
3796 isl_basic_map_intersect_range(
3797 isl_basic_map_copy(map
->p
[i
]),
3798 isl_basic_set_copy(set
->p
[j
])));
3811 struct isl_map
*isl_map_intersect_domain(
3812 struct isl_map
*map
, struct isl_set
*set
)
3814 return isl_map_reverse(
3815 isl_map_intersect_range(isl_map_reverse(map
), set
));
3818 struct isl_map
*isl_map_apply_domain(
3819 struct isl_map
*map1
, struct isl_map
*map2
)
3823 map1
= isl_map_reverse(map1
);
3824 map1
= isl_map_apply_range(map1
, map2
);
3825 return isl_map_reverse(map1
);
3832 struct isl_map
*isl_map_apply_range(
3833 struct isl_map
*map1
, struct isl_map
*map2
)
3835 struct isl_dim
*dim_result
;
3836 struct isl_map
*result
;
3842 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
3843 isl_dim_copy(map2
->dim
));
3845 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
3848 for (i
= 0; i
< map1
->n
; ++i
)
3849 for (j
= 0; j
< map2
->n
; ++j
) {
3850 result
= isl_map_add(result
,
3851 isl_basic_map_apply_range(
3852 isl_basic_map_copy(map1
->p
[i
]),
3853 isl_basic_map_copy(map2
->p
[j
])));
3859 if (result
&& result
->n
<= 1)
3860 ISL_F_SET(result
, ISL_MAP_DISJOINT
);
3869 * returns range - domain
3871 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
3873 struct isl_basic_set
*bset
;
3880 dim
= isl_basic_map_n_in(bmap
);
3881 nparam
= isl_basic_map_n_param(bmap
);
3882 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
3883 bset
= isl_basic_set_from_basic_map(bmap
);
3884 bset
= isl_basic_set_cow(bset
);
3885 bset
= isl_basic_set_extend(bset
, nparam
, 3*dim
, 0, dim
, 0);
3886 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
3887 for (i
= 0; i
< dim
; ++i
) {
3888 int j
= isl_basic_map_alloc_equality(
3889 (struct isl_basic_map
*)bset
);
3892 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
3893 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
3894 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
3895 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
3897 return isl_basic_set_project_out(bset
, isl_dim_set
, dim
, 2*dim
);
3899 isl_basic_map_free(bmap
);
3904 * returns range - domain
3906 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
3909 struct isl_set
*result
;
3914 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
3915 result
= isl_set_alloc(map
->ctx
, isl_map_n_param(map
),
3916 isl_map_n_in(map
), map
->n
, map
->flags
);
3919 for (i
= 0; i
< map
->n
; ++i
)
3920 result
= isl_set_add(result
,
3921 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
3929 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
3931 struct isl_basic_map
*bmap
;
3939 nparam
= dims
->nparam
;
3941 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
3945 for (i
= 0; i
< dim
; ++i
) {
3946 int j
= isl_basic_map_alloc_equality(bmap
);
3949 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3950 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
3951 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
3953 return isl_basic_map_finalize(bmap
);
3955 isl_basic_map_free(bmap
);
3959 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
3961 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3964 return basic_map_identity(dim
);
3967 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
3969 if (!model
|| !model
->dim
)
3971 isl_assert(model
->ctx
,
3972 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3973 return basic_map_identity(isl_dim_copy(model
->dim
));
3976 static struct isl_map
*map_identity(struct isl_dim
*dim
)
3978 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
3979 return isl_map_add(map
, basic_map_identity(isl_dim_copy(dim
)));
3982 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
3984 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3987 return map_identity(dim
);
3990 struct isl_map
*isl_map_identity_like(struct isl_map
*model
)
3992 if (!model
|| !model
->dim
)
3994 isl_assert(model
->ctx
,
3995 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3996 return map_identity(isl_dim_copy(model
->dim
));
3999 struct isl_map
*isl_map_identity_like_basic_map(struct isl_basic_map
*model
)
4001 if (!model
|| !model
->dim
)
4003 isl_assert(model
->ctx
,
4004 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
4005 return map_identity(isl_dim_copy(model
->dim
));
4008 /* Construct a basic set with all set dimensions having only non-negative
4011 struct isl_basic_set
*isl_basic_set_positive_orthant(struct isl_dim
*dims
)
4016 struct isl_basic_set
*bset
;
4020 nparam
= dims
->nparam
;
4022 bset
= isl_basic_set_alloc_dim(dims
, 0, 0, dim
);
4025 for (i
= 0; i
< dim
; ++i
) {
4026 int k
= isl_basic_set_alloc_inequality(bset
);
4029 isl_seq_clr(bset
->ineq
[k
], 1 + isl_basic_set_total_dim(bset
));
4030 isl_int_set_si(bset
->ineq
[k
][1 + nparam
+ i
], 1);
4034 isl_basic_set_free(bset
);
4038 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
4040 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
4043 int isl_set_is_subset(struct isl_set
*set1
, struct isl_set
*set2
)
4045 return isl_map_is_subset(
4046 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4049 int isl_basic_map_is_subset(
4050 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4053 struct isl_map
*map1
;
4054 struct isl_map
*map2
;
4056 if (!bmap1
|| !bmap2
)
4059 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
4060 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
4062 is_subset
= isl_map_is_subset(map1
, map2
);
4070 int isl_basic_map_is_equal(
4071 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4075 if (!bmap1
|| !bmap2
)
4077 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
4080 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
4084 int isl_basic_set_is_equal(
4085 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
4087 return isl_basic_map_is_equal(
4088 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
4091 int isl_map_is_empty(struct isl_map
*map
)
4098 for (i
= 0; i
< map
->n
; ++i
) {
4099 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
4108 int isl_map_fast_is_empty(struct isl_map
*map
)
4113 int isl_set_is_empty(struct isl_set
*set
)
4115 return isl_map_is_empty((struct isl_map
*)set
);
4118 /* Return 1 if "bmap" contains a single element.
4120 int isl_basic_map_is_singleton(__isl_keep isl_basic_map
*bmap
)
4128 return bmap
->n_eq
== isl_basic_map_total_dim(bmap
);
4131 /* Return 1 if "map" contains a single element.
4133 int isl_map_is_singleton(__isl_keep isl_map
*map
)
4140 return isl_basic_map_is_singleton(map
->p
[0]);
4143 /* Given a singleton basic map, extract the single element
4146 static __isl_give isl_vec
*singleton_extract_point(__isl_keep isl_basic_map
*bmap
)
4150 struct isl_vec
*point
;
4156 dim
= isl_basic_map_total_dim(bmap
);
4157 isl_assert(bmap
->ctx
, bmap
->n_eq
== dim
, return NULL
);
4158 point
= isl_vec_alloc(bmap
->ctx
, 1 + dim
);
4164 isl_int_set_si(point
->el
[0], 1);
4165 for (j
= 0; j
< bmap
->n_eq
; ++j
) {
4167 int i
= dim
- 1 - j
;
4168 isl_assert(bmap
->ctx
,
4169 isl_seq_first_non_zero(bmap
->eq
[j
] + 1, i
) == -1,
4171 isl_assert(bmap
->ctx
,
4172 isl_int_is_one(bmap
->eq
[j
][1 + i
]) ||
4173 isl_int_is_negone(bmap
->eq
[j
][1 + i
]),
4175 isl_assert(bmap
->ctx
,
4176 isl_seq_first_non_zero(bmap
->eq
[j
]+1+i
+1, dim
-i
-1) == -1,
4179 isl_int_gcd(m
, point
->el
[0], bmap
->eq
[j
][1 + i
]);
4180 isl_int_divexact(m
, bmap
->eq
[j
][1 + i
], m
);
4182 isl_seq_scale(point
->el
, point
->el
, m
, 1 + i
);
4183 isl_int_divexact(m
, point
->el
[0], bmap
->eq
[j
][1 + i
]);
4185 isl_int_mul(point
->el
[1 + i
], m
, bmap
->eq
[j
][0]);
4192 isl_vec_free(point
);
4196 /* Return 1 if "bmap" contains the point "point".
4197 * "bmap" is assumed to have known divs.
4198 * The point is first extended with the divs and then passed
4199 * to basic_map_contains.
4201 static int basic_map_contains_point(__isl_keep isl_basic_map
*bmap
,
4202 __isl_keep isl_vec
*point
)
4205 struct isl_vec
*vec
;
4209 if (!bmap
|| !point
)
4211 if (bmap
->n_div
== 0)
4212 return basic_map_contains(bmap
, point
);
4214 dim
= isl_basic_map_total_dim(bmap
) - bmap
->n_div
;
4215 vec
= isl_vec_alloc(bmap
->ctx
, 1 + dim
+ bmap
->n_div
);
4219 isl_seq_cpy(vec
->el
, point
->el
, point
->size
);
4220 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4221 isl_seq_inner_product(bmap
->div
[i
] + 1, vec
->el
,
4222 1 + dim
+ i
, &vec
->el
[1+dim
+i
]);
4223 isl_int_fdiv_q(vec
->el
[1+dim
+i
], vec
->el
[1+dim
+i
],
4227 contains
= basic_map_contains(bmap
, vec
);
4233 /* Return 1 is the singleton map "map1" is a subset of "map2",
4234 * i.e., if the single element of "map1" is also an element of "map2".
4236 static int map_is_singleton_subset(__isl_keep isl_map
*map1
,
4237 __isl_keep isl_map
*map2
)
4241 struct isl_vec
*point
;
4248 point
= singleton_extract_point(map1
->p
[0]);
4252 for (i
= 0; i
< map2
->n
; ++i
) {
4253 is_subset
= basic_map_contains_point(map2
->p
[i
], point
);
4258 isl_vec_free(point
);
4262 int isl_map_is_subset(struct isl_map
*map1
, struct isl_map
*map2
)
4265 struct isl_map
*diff
;
4270 if (isl_map_is_empty(map1
))
4273 if (isl_map_is_empty(map2
))
4276 if (isl_map_fast_is_universe(map2
))
4279 map2
= isl_map_compute_divs(isl_map_copy(map2
));
4280 if (isl_map_is_singleton(map1
)) {
4281 is_subset
= map_is_singleton_subset(map1
, map2
);
4285 diff
= isl_map_subtract(isl_map_copy(map1
), map2
);
4289 is_subset
= isl_map_is_empty(diff
);
4295 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
4301 is_subset
= isl_map_is_subset(map1
, map2
);
4304 is_subset
= isl_map_is_subset(map2
, map1
);
4308 int isl_basic_map_is_strict_subset(
4309 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4313 if (!bmap1
|| !bmap2
)
4315 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
4318 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
4319 if (is_subset
== -1)
4324 int isl_map_is_strict_subset(struct isl_map
*map1
, struct isl_map
*map2
)
4330 is_subset
= isl_map_is_subset(map1
, map2
);
4333 is_subset
= isl_map_is_subset(map2
, map1
);
4334 if (is_subset
== -1)
4339 int isl_set_is_strict_subset(__isl_keep isl_set
*set1
, __isl_keep isl_set
*set2
)
4341 return isl_map_is_strict_subset((isl_map
*)set1
, (isl_map
*)set2
);
4344 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
4348 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
4351 int isl_basic_set_is_universe(struct isl_basic_set
*bset
)
4355 return bset
->n_eq
== 0 && bset
->n_ineq
== 0;
4358 int isl_map_fast_is_universe(__isl_keep isl_map
*map
)
4363 return map
->n
== 1 && isl_basic_map_is_universe(map
->p
[0]);
4366 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
4368 struct isl_basic_set
*bset
= NULL
;
4369 struct isl_vec
*sample
= NULL
;
4376 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
4379 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
4380 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
4381 copy
= isl_basic_map_convex_hull(copy
);
4382 empty
= ISL_F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
4383 isl_basic_map_free(copy
);
4387 total
= 1 + isl_basic_map_total_dim(bmap
);
4388 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
4389 int contains
= basic_map_contains(bmap
, bmap
->sample
);
4395 isl_vec_free(bmap
->sample
);
4396 bmap
->sample
= NULL
;
4397 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
4400 sample
= isl_basic_set_sample_vec(bset
);
4403 empty
= sample
->size
== 0;
4404 isl_vec_free(bmap
->sample
);
4405 bmap
->sample
= sample
;
4407 ISL_F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
4412 int isl_basic_map_fast_is_empty(struct isl_basic_map
*bmap
)
4416 return ISL_F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
);
4419 int isl_basic_set_fast_is_empty(struct isl_basic_set
*bset
)
4423 return ISL_F_ISSET(bset
, ISL_BASIC_SET_EMPTY
);
4426 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
4428 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
4431 struct isl_map
*isl_basic_map_union(
4432 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
4434 struct isl_map
*map
;
4435 if (!bmap1
|| !bmap2
)
4438 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
4440 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
4443 map
= isl_map_add(map
, bmap1
);
4444 map
= isl_map_add(map
, bmap2
);
4447 isl_basic_map_free(bmap1
);
4448 isl_basic_map_free(bmap2
);
4452 struct isl_set
*isl_basic_set_union(
4453 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
4455 return (struct isl_set
*)isl_basic_map_union(
4456 (struct isl_basic_map
*)bset1
,
4457 (struct isl_basic_map
*)bset2
);
4460 /* Order divs such that any div only depends on previous divs */
4461 struct isl_basic_map
*isl_basic_map_order_divs(struct isl_basic_map
*bmap
)
4464 unsigned off
= isl_dim_total(bmap
->dim
);
4466 for (i
= 0; i
< bmap
->n_div
; ++i
) {
4468 if (isl_int_is_zero(bmap
->div
[i
][0]))
4470 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
4474 isl_basic_map_swap_div(bmap
, i
, i
+ pos
);
4480 struct isl_basic_set
*isl_basic_set_order_divs(struct isl_basic_set
*bset
)
4482 return (struct isl_basic_set
*)
4483 isl_basic_map_order_divs((struct isl_basic_map
*)bset
);
4486 /* Look for a div in dst that corresponds to the div "div" in src.
4487 * The divs before "div" in src and dst are assumed to be the same.
4489 * Returns -1 if no corresponding div was found and the position
4490 * of the corresponding div in dst otherwise.
4492 static int find_div(struct isl_basic_map
*dst
,
4493 struct isl_basic_map
*src
, unsigned div
)
4497 unsigned total
= isl_dim_total(src
->dim
);
4499 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
4500 for (i
= div
; i
< dst
->n_div
; ++i
)
4501 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
4502 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
4503 dst
->n_div
- div
) == -1)
4508 struct isl_basic_map
*isl_basic_map_align_divs(
4509 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
4512 unsigned total
= isl_dim_total(src
->dim
);
4517 if (src
->n_div
== 0)
4520 for (i
= 0; i
< src
->n_div
; ++i
)
4521 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
4523 src
= isl_basic_map_order_divs(src
);
4524 dst
= isl_basic_map_cow(dst
);
4525 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
4526 src
->n_div
, 0, 2 * src
->n_div
);
4529 for (i
= 0; i
< src
->n_div
; ++i
) {
4530 int j
= find_div(dst
, src
, i
);
4532 j
= isl_basic_map_alloc_div(dst
);
4535 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
4536 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
4537 if (add_div_constraints(dst
, j
) < 0)
4541 isl_basic_map_swap_div(dst
, i
, j
);
4545 isl_basic_map_free(dst
);
4549 struct isl_basic_set
*isl_basic_set_align_divs(
4550 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
4552 return (struct isl_basic_set
*)isl_basic_map_align_divs(
4553 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
4556 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
4564 map
= isl_map_compute_divs(map
);
4565 map
= isl_map_cow(map
);
4569 for (i
= 1; i
< map
->n
; ++i
)
4570 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
4571 for (i
= 1; i
< map
->n
; ++i
)
4572 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
4574 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4578 struct isl_set
*isl_set_align_divs(struct isl_set
*set
)
4580 return (struct isl_set
*)isl_map_align_divs((struct isl_map
*)set
);
4583 static struct isl_map
*add_cut_constraint(struct isl_map
*dst
,
4584 struct isl_basic_map
*src
, isl_int
*c
,
4585 unsigned len
, int oppose
)
4587 struct isl_basic_map
*copy
= NULL
;
4592 copy
= isl_basic_map_copy(src
);
4593 copy
= isl_basic_map_cow(copy
);
4596 copy
= isl_basic_map_extend_constraints(copy
, 0, 1);
4597 k
= isl_basic_map_alloc_inequality(copy
);
4601 isl_seq_neg(copy
->ineq
[k
], c
, len
);
4603 isl_seq_cpy(copy
->ineq
[k
], c
, len
);
4604 total
= 1 + isl_basic_map_total_dim(copy
);
4605 isl_seq_clr(copy
->ineq
[k
]+len
, total
- len
);
4606 isl_inequality_negate(copy
, k
);
4607 copy
= isl_basic_map_simplify(copy
);
4608 copy
= isl_basic_map_finalize(copy
);
4609 is_empty
= isl_basic_map_is_empty(copy
);
4613 dst
= isl_map_add(dst
, copy
);
4615 isl_basic_map_free(copy
);
4618 isl_basic_map_free(copy
);
4623 static struct isl_map
*subtract(struct isl_map
*map
, struct isl_basic_map
*bmap
)
4627 struct isl_map
*rest
= NULL
;
4629 unsigned total
= isl_basic_map_total_dim(bmap
);
4631 map
= isl_map_cow(map
);
4636 if (ISL_F_ISSET(map
, ISL_MAP_DISJOINT
))
4637 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
4639 max
= map
->n
* (2 * bmap
->n_eq
+ bmap
->n_ineq
);
4640 rest
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), max
, flags
);
4644 for (i
= 0; i
< map
->n
; ++i
) {
4645 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], bmap
);
4650 for (j
= 0; j
< map
->n
; ++j
)
4651 map
->p
[j
] = isl_basic_map_cow(map
->p
[j
]);
4653 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
4654 for (j
= 0; j
< map
->n
; ++j
) {
4655 rest
= add_cut_constraint(rest
,
4656 map
->p
[j
], bmap
->eq
[i
], 1+total
, 0);
4660 rest
= add_cut_constraint(rest
,
4661 map
->p
[j
], bmap
->eq
[i
], 1+total
, 1);
4665 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4669 k
= isl_basic_map_alloc_equality(map
->p
[j
]);
4672 isl_seq_cpy(map
->p
[j
]->eq
[k
], bmap
->eq
[i
], 1+total
);
4673 isl_seq_clr(map
->p
[j
]->eq
[k
]+1+total
,
4674 map
->p
[j
]->n_div
- bmap
->n_div
);
4678 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4679 for (j
= 0; j
< map
->n
; ++j
) {
4680 rest
= add_cut_constraint(rest
,
4681 map
->p
[j
], bmap
->ineq
[i
], 1+total
, 0);
4685 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
4689 k
= isl_basic_map_alloc_inequality(map
->p
[j
]);
4692 isl_seq_cpy(map
->p
[j
]->ineq
[k
], bmap
->ineq
[i
], 1+total
);
4693 isl_seq_clr(map
->p
[j
]->ineq
[k
]+1+total
,
4694 map
->p
[j
]->n_div
- bmap
->n_div
);
4706 struct isl_map
*isl_map_subtract(struct isl_map
*map1
, struct isl_map
*map2
)
4712 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
4714 if (isl_map_is_empty(map2
)) {
4719 map1
= isl_map_compute_divs(map1
);
4720 map2
= isl_map_compute_divs(map2
);
4724 map1
= isl_map_remove_empty_parts(map1
);
4725 map2
= isl_map_remove_empty_parts(map2
);
4727 for (i
= 0; map1
&& i
< map2
->n
; ++i
)
4728 map1
= subtract(map1
, map2
->p
[i
]);
4738 struct isl_set
*isl_set_subtract(struct isl_set
*set1
, struct isl_set
*set2
)
4740 return (struct isl_set
*)
4742 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
4745 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
4749 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
4750 map
= isl_map_intersect_domain(map
, set
);
4751 set
= isl_map_range(map
);
4759 /* There is no need to cow as removing empty parts doesn't change
4760 * the meaning of the set.
4762 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
4769 for (i
= map
->n
-1; i
>= 0; --i
) {
4770 if (!ISL_F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
4772 isl_basic_map_free(map
->p
[i
]);
4773 if (i
!= map
->n
-1) {
4774 ISL_F_CLR(map
, ISL_MAP_NORMALIZED
);
4775 map
->p
[i
] = map
->p
[map
->n
-1];
4783 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
4785 return (struct isl_set
*)
4786 isl_map_remove_empty_parts((struct isl_map
*)set
);
4789 struct isl_basic_map
*isl_map_copy_basic_map(struct isl_map
*map
)
4791 struct isl_basic_map
*bmap
;
4792 if (!map
|| map
->n
== 0)
4794 bmap
= map
->p
[map
->n
-1];
4795 isl_assert(map
->ctx
, ISL_F_ISSET(bmap
, ISL_BASIC_SET_FINAL
), return NULL
);
4796 return isl_basic_map_copy(bmap
);
4799 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
4801 return (struct isl_basic_set
*)
4802 isl_map_copy_basic_map((struct isl_map
*)set
);
4805 struct isl_map
*isl_map_drop_basic_map(struct isl_map
*map
,
4806 struct isl_basic_map
*bmap
)
4812 for (i
= map
->n
-1; i
>= 0; --i
) {
4813 if (map
->p
[i
] != bmap
)
4815 map
= isl_map_cow(map
);
4818 isl_basic_map_free(map
->p
[i
]);
4819 if (i
!= map
->n
-1) {
4820 ISL_F_CLR(map
, ISL_SET_NORMALIZED
);
4821 map
->p
[i
] = map
->p
[map
->n
-1];
4826 isl_basic_map_free(bmap
);
4830 isl_basic_map_free(bmap
);
4834 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
4835 struct isl_basic_set
*bset
)
4837 return (struct isl_set
*)isl_map_drop_basic_map((struct isl_map
*)set
,
4838 (struct isl_basic_map
*)bset
);
4841 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4842 * for any common value of the parameters and dimensions preceding dim
4843 * in both basic sets, the values of dimension pos in bset1 are
4844 * smaller or larger than those in bset2.
4847 * 1 if bset1 follows bset2
4848 * -1 if bset1 precedes bset2
4849 * 0 if bset1 and bset2 are incomparable
4850 * -2 if some error occurred.
4852 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
4853 struct isl_basic_set
*bset2
, int pos
)
4855 struct isl_dim
*dims
;
4856 struct isl_basic_map
*bmap1
= NULL
;
4857 struct isl_basic_map
*bmap2
= NULL
;
4858 struct isl_ctx
*ctx
;
4859 struct isl_vec
*obj
;
4862 unsigned dim1
, dim2
;
4864 enum isl_lp_result res
;
4867 if (!bset1
|| !bset2
)
4870 nparam
= isl_basic_set_n_param(bset1
);
4871 dim1
= isl_basic_set_n_dim(bset1
);
4872 dim2
= isl_basic_set_n_dim(bset2
);
4873 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
4874 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
4875 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
4876 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
4877 if (!bmap1
|| !bmap2
)
4879 bmap1
= isl_basic_map_cow(bmap1
);
4880 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
4881 pos
, (dim1
- pos
) + (dim2
- pos
),
4882 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
4883 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
4886 total
= isl_basic_map_total_dim(bmap1
);
4888 obj
= isl_vec_alloc(ctx
, 1 + total
);
4889 isl_seq_clr(obj
->block
.data
, 1 + total
);
4890 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
], 1);
4891 isl_int_set_si(obj
->block
.data
[1+nparam
+pos
+(dim1
-pos
)], -1);
4896 res
= isl_basic_map_solve_lp(bmap1
, 0, obj
->block
.data
, ctx
->one
,
4898 if (res
== isl_lp_empty
)
4900 else if (res
== isl_lp_ok
&& isl_int_is_pos(num
))
4902 else if ((res
== isl_lp_ok
&& isl_int_is_neg(num
)) ||
4903 res
== isl_lp_unbounded
)
4909 isl_basic_map_free(bmap1
);
4913 isl_basic_map_free(bmap1
);
4914 isl_basic_map_free(bmap2
);
4918 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
4919 unsigned pos
, isl_int
*val
)
4927 total
= isl_basic_map_total_dim(bmap
);
4928 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
4929 for (; d
+1 > pos
; --d
)
4930 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
4934 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
4936 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
4938 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
4941 isl_int_neg(*val
, bmap
->eq
[i
][0]);
4947 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
4948 unsigned pos
, isl_int
*val
)
4960 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
4963 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
4964 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
4965 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
4966 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4970 isl_int_set(*val
, v
);
4976 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set
*bset
,
4977 unsigned pos
, isl_int
*val
)
4979 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map
*)bset
,
4983 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
4986 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
4989 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
4990 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
4992 if (pos
>= isl_basic_map_dim(bmap
, type
))
4994 return isl_basic_map_fast_has_fixed_var(bmap
,
4995 isl_basic_map_offset(bmap
, type
) - 1 + pos
, val
);
4998 int isl_map_fast_is_fixed(struct isl_map
*map
,
4999 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
5001 if (pos
>= isl_map_dim(map
, type
))
5003 return isl_map_fast_has_fixed_var(map
,
5004 map_offset(map
, type
) - 1 + pos
, val
);
5007 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5008 * then return this fixed value in *val.
5010 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set
*bset
, unsigned dim
,
5013 return isl_basic_set_fast_has_fixed_var(bset
,
5014 isl_basic_set_n_param(bset
) + dim
, val
);
5017 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5018 * then return this fixed value in *val.
5020 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
5022 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
5025 /* Check if input variable in has fixed value and if so and if val is not NULL,
5026 * then return this fixed value in *val.
5028 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
5030 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
5033 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5034 * and if val is not NULL, then return this lower bound in *val.
5036 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
5037 unsigned dim
, isl_int
*val
)
5039 int i
, i_eq
= -1, i_ineq
= -1;
5046 total
= isl_basic_set_total_dim(bset
);
5047 nparam
= isl_basic_set_n_param(bset
);
5048 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5049 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
5055 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5056 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
5058 if (i_eq
!= -1 || i_ineq
!= -1)
5062 if (i_eq
== -1 && i_ineq
== -1)
5064 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
5065 /* The coefficient should always be one due to normalization. */
5066 if (!isl_int_is_one(c
[1+nparam
+dim
]))
5068 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
5070 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
5071 total
- nparam
- dim
- 1) != -1)
5074 isl_int_neg(*val
, c
[0]);
5078 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
5079 unsigned dim
, isl_int
*val
)
5091 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5095 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
5097 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
5098 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
5100 if (fixed
== 1 && isl_int_ne(tmp
, v
))
5104 isl_int_set(*val
, v
);
5115 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
5117 const struct constraint
*c1
= (const struct constraint
*)p1
;
5118 const struct constraint
*c2
= (const struct constraint
*)p2
;
5119 unsigned size
= isl_min(c1
->size
, c2
->size
);
5120 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
5123 static struct isl_basic_map
*isl_basic_map_sort_constraints(
5124 struct isl_basic_map
*bmap
)
5127 struct constraint
*c
;
5132 total
= isl_basic_map_total_dim(bmap
);
5133 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
5136 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
5138 c
[i
].c
= bmap
->ineq
[i
];
5140 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
5141 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
5142 bmap
->ineq
[i
] = c
[i
].c
;
5146 isl_basic_map_free(bmap
);
5150 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
5154 if (ISL_F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
5156 bmap
= isl_basic_map_convex_hull(bmap
);
5157 bmap
= isl_basic_map_sort_constraints(bmap
);
5158 ISL_F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
5162 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
5164 return (struct isl_basic_set
*)isl_basic_map_normalize(
5165 (struct isl_basic_map
*)bset
);
5168 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
5169 const struct isl_basic_map
*bmap2
)
5176 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
5177 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
5178 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
5179 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5180 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
5181 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
5182 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
5183 ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
5185 if (ISL_F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
5187 if (ISL_F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
5189 if (bmap1
->n_eq
!= bmap2
->n_eq
)
5190 return bmap1
->n_eq
- bmap2
->n_eq
;
5191 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
5192 return bmap1
->n_ineq
- bmap2
->n_ineq
;
5193 if (bmap1
->n_div
!= bmap2
->n_div
)
5194 return bmap1
->n_div
- bmap2
->n_div
;
5195 total
= isl_basic_map_total_dim(bmap1
);
5196 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
5197 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
5201 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
5202 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
5206 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
5207 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
5214 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
5215 struct isl_basic_map
*bmap2
)
5217 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
5220 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
5222 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
5223 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
5225 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
5228 /* We normalize in place, but if anything goes wrong we need
5229 * to return NULL, so we need to make sure we don't change the
5230 * meaning of any possible other copies of map.
5232 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
5235 struct isl_basic_map
*bmap
;
5239 if (ISL_F_ISSET(map
, ISL_MAP_NORMALIZED
))
5241 for (i
= 0; i
< map
->n
; ++i
) {
5242 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
5245 isl_basic_map_free(map
->p
[i
]);
5248 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
5249 ISL_F_SET(map
, ISL_MAP_NORMALIZED
);
5250 map
= isl_map_remove_empty_parts(map
);
5253 for (i
= map
->n
- 1; i
>= 1; --i
) {
5254 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
5256 isl_basic_map_free(map
->p
[i
-1]);
5257 for (j
= i
; j
< map
->n
; ++j
)
5258 map
->p
[j
-1] = map
->p
[j
];
5268 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
5270 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
5273 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
5283 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
5286 map1
= isl_map_copy(map1
);
5287 map2
= isl_map_copy(map2
);
5288 map1
= isl_map_normalize(map1
);
5289 map2
= isl_map_normalize(map2
);
5292 equal
= map1
->n
== map2
->n
;
5293 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
5294 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
5307 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
5309 return isl_map_fast_is_equal((struct isl_map
*)set1
,
5310 (struct isl_map
*)set2
);
5313 /* Return an interval that ranges from min to max (inclusive)
5315 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
5316 isl_int min
, isl_int max
)
5319 struct isl_basic_set
*bset
= NULL
;
5321 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
5325 k
= isl_basic_set_alloc_inequality(bset
);
5328 isl_int_set_si(bset
->ineq
[k
][1], 1);
5329 isl_int_neg(bset
->ineq
[k
][0], min
);
5331 k
= isl_basic_set_alloc_inequality(bset
);
5334 isl_int_set_si(bset
->ineq
[k
][1], -1);
5335 isl_int_set(bset
->ineq
[k
][0], max
);
5339 isl_basic_set_free(bset
);
5343 /* Return the Cartesian product of the basic sets in list (in the given order).
5345 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
5353 struct isl_basic_set
*product
= NULL
;
5357 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
5358 isl_assert(list
->ctx
, list
->p
[0], goto error
);
5359 nparam
= isl_basic_set_n_param(list
->p
[0]);
5360 dim
= isl_basic_set_n_dim(list
->p
[0]);
5361 extra
= list
->p
[0]->n_div
;
5362 n_eq
= list
->p
[0]->n_eq
;
5363 n_ineq
= list
->p
[0]->n_ineq
;
5364 for (i
= 1; i
< list
->n
; ++i
) {
5365 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
5366 isl_assert(list
->ctx
,
5367 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
5368 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
5369 extra
+= list
->p
[i
]->n_div
;
5370 n_eq
+= list
->p
[i
]->n_eq
;
5371 n_ineq
+= list
->p
[i
]->n_ineq
;
5373 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
5378 for (i
= 0; i
< list
->n
; ++i
) {
5379 isl_basic_set_add_constraints(product
,
5380 isl_basic_set_copy(list
->p
[i
]), dim
);
5381 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
5383 isl_basic_set_list_free(list
);
5386 isl_basic_set_free(product
);
5387 isl_basic_set_list_free(list
);
5391 struct isl_basic_map
*isl_basic_map_product(
5392 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
5394 struct isl_dim
*dim_result
= NULL
;
5395 struct isl_basic_map
*bmap
;
5396 unsigned in1
, in2
, out1
, out2
, nparam
, total
, pos
;
5397 struct isl_dim_map
*dim_map1
, *dim_map2
;
5399 if (!bmap1
|| !bmap2
)
5402 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
5403 bmap2
->dim
, isl_dim_param
), goto error
);
5404 dim_result
= isl_dim_product(isl_dim_copy(bmap1
->dim
),
5405 isl_dim_copy(bmap2
->dim
));
5407 in1
= isl_basic_map_n_in(bmap1
);
5408 in2
= isl_basic_map_n_in(bmap2
);
5409 out1
= isl_basic_map_n_out(bmap1
);
5410 out2
= isl_basic_map_n_out(bmap2
);
5411 nparam
= isl_basic_map_n_param(bmap1
);
5413 total
= nparam
+ in1
+ in2
+ out1
+ out2
+ bmap1
->n_div
+ bmap2
->n_div
;
5414 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
5415 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
5416 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
5417 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
5418 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
5419 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
+= in1
);
5420 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= in2
);
5421 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= out1
);
5422 isl_dim_map_div(dim_map1
, bmap1
, pos
+= out2
);
5423 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
5425 bmap
= isl_basic_map_alloc_dim(dim_result
,
5426 bmap1
->n_div
+ bmap2
->n_div
,
5427 bmap1
->n_eq
+ bmap2
->n_eq
,
5428 bmap1
->n_ineq
+ bmap2
->n_ineq
);
5429 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
5430 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
5431 bmap
= isl_basic_map_simplify(bmap
);
5432 return isl_basic_map_finalize(bmap
);
5434 isl_basic_map_free(bmap1
);
5435 isl_basic_map_free(bmap2
);
5439 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5441 struct isl_map
*isl_map_product(struct isl_map
*map1
, struct isl_map
*map2
)
5444 struct isl_map
*result
;
5450 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
5451 map2
->dim
, isl_dim_param
), goto error
);
5453 if (ISL_F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
5454 ISL_F_ISSET(map2
, ISL_MAP_DISJOINT
))
5455 ISL_FL_SET(flags
, ISL_MAP_DISJOINT
);
5457 result
= isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1
->dim
),
5458 isl_dim_copy(map2
->dim
)),
5459 map1
->n
* map2
->n
, flags
);
5462 for (i
= 0; i
< map1
->n
; ++i
)
5463 for (j
= 0; j
< map2
->n
; ++j
) {
5464 struct isl_basic_map
*part
;
5465 part
= isl_basic_map_product(
5466 isl_basic_map_copy(map1
->p
[i
]),
5467 isl_basic_map_copy(map2
->p
[j
]));
5468 if (isl_basic_map_is_empty(part
))
5469 isl_basic_map_free(part
);
5471 result
= isl_map_add(result
, part
);
5484 /* Given two set A and B, construct its Cartesian product A x B.
5486 struct isl_set
*isl_set_product(struct isl_set
*set1
, struct isl_set
*set2
)
5488 return (struct isl_set
*)isl_map_product((struct isl_map
*)set1
,
5489 (struct isl_map
*)set2
);
5492 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
5495 uint32_t hash
= isl_hash_init();
5500 bset
= isl_basic_set_copy(bset
);
5501 bset
= isl_basic_set_normalize(bset
);
5504 total
= isl_basic_set_total_dim(bset
);
5505 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
5506 for (i
= 0; i
< bset
->n_eq
; ++i
) {
5508 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
5509 isl_hash_hash(hash
, c_hash
);
5511 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
5512 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
5514 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
5515 isl_hash_hash(hash
, c_hash
);
5517 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
5518 for (i
= 0; i
< bset
->n_div
; ++i
) {
5520 if (isl_int_is_zero(bset
->div
[i
][0]))
5522 isl_hash_byte(hash
, i
& 0xFF);
5523 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
5524 isl_hash_hash(hash
, c_hash
);
5526 isl_basic_set_free(bset
);
5530 uint32_t isl_set_get_hash(struct isl_set
*set
)
5537 set
= isl_set_copy(set
);
5538 set
= isl_set_normalize(set
);
5542 hash
= isl_hash_init();
5543 for (i
= 0; i
< set
->n
; ++i
) {
5545 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
5546 isl_hash_hash(hash
, bset_hash
);
5554 /* Check if the value for dimension dim is completely determined
5555 * by the values of the other parameters and variables.
5556 * That is, check if dimension dim is involved in an equality.
5558 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
5565 nparam
= isl_basic_set_n_param(bset
);
5566 for (i
= 0; i
< bset
->n_eq
; ++i
)
5567 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
5572 /* Check if the value for dimension dim is completely determined
5573 * by the values of the other parameters and variables.
5574 * That is, check if dimension dim is involved in an equality
5575 * for each of the subsets.
5577 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
5583 for (i
= 0; i
< set
->n
; ++i
) {
5585 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);
5592 int isl_map_foreach_basic_map(__isl_keep isl_map
*map
,
5593 int (*fn
)(__isl_take isl_basic_map
*bmap
, void *user
), void *user
)
5600 for (i
= 0; i
< map
->n
; ++i
)
5601 if (fn(isl_basic_map_copy(map
->p
[i
]), user
) < 0)
5607 int isl_set_foreach_basic_set(__isl_keep isl_set
*set
,
5608 int (*fn
)(__isl_take isl_basic_set
*bset
, void *user
), void *user
)
5615 for (i
= 0; i
< set
->n
; ++i
)
5616 if (fn(isl_basic_set_copy(set
->p
[i
]), user
) < 0)
5622 __isl_give isl_map
*isl_set_lifting(__isl_take isl_set
*set
)
5624 struct isl_dim
*dim
;
5625 struct isl_basic_map
*bmap
;
5632 set
= isl_set_align_divs(set
);
5637 dim
= isl_set_get_dim(set
);
5638 if (set
->n
== 0 || set
->p
[0]->n_div
== 0) {
5640 return isl_map_identity(dim
);
5643 n_div
= set
->p
[0]->n_div
;
5644 dim
= isl_dim_map(dim
);
5645 n_param
= isl_dim_size(dim
, isl_dim_param
);
5646 n_set
= isl_dim_size(dim
, isl_dim_in
);
5647 dim
= isl_dim_extend(dim
, n_param
, n_set
, n_set
+ n_div
);
5648 bmap
= isl_basic_map_alloc_dim(dim
, 0, n_set
, 2 * n_div
);
5649 for (i
= 0; i
< n_set
; ++i
)
5650 bmap
= var_equal(bmap
, i
);
5652 total
= n_param
+ n_set
+ n_set
+ n_div
;
5653 for (i
= 0; i
< n_div
; ++i
) {
5654 k
= isl_basic_map_alloc_inequality(bmap
);
5657 isl_seq_cpy(bmap
->ineq
[k
], set
->p
[0]->div
[i
]+1, 1+n_param
);
5658 isl_seq_clr(bmap
->ineq
[k
]+1+n_param
, n_set
);
5659 isl_seq_cpy(bmap
->ineq
[k
]+1+n_param
+n_set
,
5660 set
->p
[0]->div
[i
]+1+1+n_param
, n_set
+ n_div
);
5661 isl_int_neg(bmap
->ineq
[k
][1+n_param
+n_set
+n_set
+i
],
5662 set
->p
[0]->div
[i
][0]);
5664 l
= isl_basic_map_alloc_inequality(bmap
);
5667 isl_seq_neg(bmap
->ineq
[l
], bmap
->ineq
[k
], 1 + total
);
5668 isl_int_add(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0],
5669 set
->p
[0]->div
[i
][0]);
5670 isl_int_sub_ui(bmap
->ineq
[l
][0], bmap
->ineq
[l
][0], 1);
5674 return isl_map_from_basic_map(bmap
);
5677 isl_basic_map_free(bmap
);
5681 int isl_basic_set_size(__isl_keep isl_basic_set
*bset
)
5689 dim
= isl_basic_set_total_dim(bset
);
5690 size
+= bset
->n_eq
* (1 + dim
);
5691 size
+= bset
->n_ineq
* (1 + dim
);
5692 size
+= bset
->n_div
* (2 + dim
);
5697 int isl_set_size(__isl_keep isl_set
*set
)
5705 for (i
= 0; i
< set
->n
; ++i
)
5706 size
+= isl_basic_set_size(set
->p
[i
]);