11 #include "isl_map_private.h"
12 #include "isl_map_piplib.h"
13 #include "isl_sample.h"
16 /* Maps dst positions to src positions */
22 static struct isl_dim_map
*isl_dim_map_alloc(struct isl_ctx
*ctx
, unsigned len
)
25 struct isl_dim_map
*dim_map
;
26 dim_map
= isl_alloc(ctx
, struct isl_dim_map
,
27 sizeof(struct isl_dim_map
) + len
* sizeof(int));
30 dim_map
->len
= 1 + len
;
32 for (i
= 0; i
< len
; ++i
)
33 dim_map
->pos
[1 + i
] = -1;
37 static unsigned n(struct isl_dim
*dim
, enum isl_dim_type type
)
40 case isl_dim_param
: return dim
->nparam
;
41 case isl_dim_in
: return dim
->n_in
;
42 case isl_dim_out
: return dim
->n_out
;
46 static unsigned pos(struct isl_dim
*dim
, enum isl_dim_type type
)
49 case isl_dim_param
: return 1;
50 case isl_dim_in
: return 1 + dim
->nparam
;
51 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
55 static void isl_dim_map_dim(struct isl_dim_map
*dim_map
, struct isl_dim
*dim
,
56 enum isl_dim_type type
, unsigned dst_pos
)
64 src_pos
= pos(dim
, type
);
65 for (i
= 0; i
< n(dim
, type
); ++i
)
66 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
69 static void isl_dim_map_div(struct isl_dim_map
*dim_map
,
70 struct isl_basic_map
*bmap
, unsigned dst_pos
)
75 if (!dim_map
|| !bmap
)
78 src_pos
= 1 + isl_dim_total(bmap
->dim
);
79 for (i
= 0; i
< bmap
->n_div
; ++i
)
80 dim_map
->pos
[1 + dst_pos
+ i
] = src_pos
+ i
;
83 static void isl_dim_map_dump(struct isl_dim_map
*dim_map
)
87 for (i
= 0; i
< dim_map
->len
; ++i
)
88 fprintf(stderr
, "%d -> %d; ", i
, dim_map
->pos
[i
]);
89 fprintf(stderr
, "\n");
92 unsigned isl_basic_map_dim(const struct isl_basic_map
*bmap
,
93 enum isl_dim_type type
)
95 struct isl_dim
*dim
= bmap
->dim
;
99 case isl_dim_out
: return isl_dim_size(bmap
->dim
, type
);
100 case isl_dim_div
: return bmap
->n_div
;
101 case isl_dim_all
: return isl_basic_map_total_dim(bmap
);
105 unsigned isl_map_dim(const struct isl_map
*map
, enum isl_dim_type type
)
107 return n(map
->dim
, type
);
110 static unsigned basic_map_offset(struct isl_basic_map
*bmap
,
111 enum isl_dim_type type
)
113 struct isl_dim
*dim
= bmap
->dim
;
115 case isl_dim_param
: return 1;
116 case isl_dim_in
: return 1 + dim
->nparam
;
117 case isl_dim_out
: return 1 + dim
->nparam
+ dim
->n_in
;
118 case isl_dim_div
: return 1 + dim
->nparam
+ dim
->n_in
+ dim
->n_out
;
122 static unsigned map_offset(struct isl_map
*map
, enum isl_dim_type type
)
124 return pos(map
->dim
, type
);
127 unsigned isl_basic_set_dim(const struct isl_basic_set
*bset
,
128 enum isl_dim_type type
)
130 return isl_basic_map_dim((const struct isl_basic_map
*)bset
, type
);
133 unsigned isl_basic_set_n_dim(const struct isl_basic_set
*bset
)
135 return bset
->dim
->n_out
;
138 unsigned isl_basic_set_n_param(const struct isl_basic_set
*bset
)
140 return bset
->dim
->nparam
;
143 unsigned isl_basic_set_total_dim(const struct isl_basic_set
*bset
)
145 return isl_dim_total(bset
->dim
) + bset
->n_div
;
148 unsigned isl_set_n_dim(const struct isl_set
*set
)
150 return set
->dim
->n_out
;
153 unsigned isl_set_n_param(const struct isl_set
*set
)
155 return set
->dim
->nparam
;
158 unsigned isl_basic_map_n_in(const struct isl_basic_map
*bmap
)
160 return bmap
->dim
->n_in
;
163 unsigned isl_basic_map_n_out(const struct isl_basic_map
*bmap
)
165 return bmap
->dim
->n_out
;
168 unsigned isl_basic_map_n_param(const struct isl_basic_map
*bmap
)
170 return bmap
->dim
->nparam
;
173 unsigned isl_basic_map_n_div(const struct isl_basic_map
*bmap
)
178 unsigned isl_basic_map_total_dim(const struct isl_basic_map
*bmap
)
180 return isl_dim_total(bmap
->dim
) + bmap
->n_div
;
183 unsigned isl_map_n_in(const struct isl_map
*map
)
185 return map
->dim
->n_in
;
188 unsigned isl_map_n_out(const struct isl_map
*map
)
190 return map
->dim
->n_out
;
193 unsigned isl_map_n_param(const struct isl_map
*map
)
195 return map
->dim
->nparam
;
198 int isl_map_compatible_domain(struct isl_map
*map
, struct isl_set
*set
)
200 return map
->dim
->n_in
== set
->dim
->n_out
&&
201 map
->dim
->nparam
== set
->dim
->nparam
;
204 int isl_basic_map_compatible_domain(struct isl_basic_map
*bmap
,
205 struct isl_basic_set
*bset
)
207 return bmap
->dim
->n_in
== bset
->dim
->n_out
&&
208 bmap
->dim
->nparam
== bset
->dim
->nparam
;
211 int isl_basic_map_compatible_range(struct isl_basic_map
*bmap
,
212 struct isl_basic_set
*bset
)
214 return bmap
->dim
->n_out
== bset
->dim
->n_out
&&
215 bmap
->dim
->nparam
== bset
->dim
->nparam
;
218 static struct isl_basic_map
*basic_map_init(struct isl_ctx
*ctx
,
219 struct isl_basic_map
*bmap
, unsigned extra
,
220 unsigned n_eq
, unsigned n_ineq
)
223 size_t row_size
= 1 + isl_dim_total(bmap
->dim
) + extra
;
225 bmap
->block
= isl_blk_alloc(ctx
, (n_eq
+ n_ineq
) * row_size
);
226 if (isl_blk_is_error(bmap
->block
)) {
231 bmap
->eq
= isl_alloc_array(ctx
, isl_int
*, n_eq
+ n_ineq
);
233 isl_blk_free(ctx
, bmap
->block
);
239 bmap
->block2
= isl_blk_empty();
242 bmap
->block2
= isl_blk_alloc(ctx
, extra
* (1 + row_size
));
243 if (isl_blk_is_error(bmap
->block2
)) {
245 isl_blk_free(ctx
, bmap
->block
);
250 bmap
->div
= isl_alloc_array(ctx
, isl_int
*, extra
);
252 isl_blk_free(ctx
, bmap
->block2
);
254 isl_blk_free(ctx
, bmap
->block
);
260 for (i
= 0; i
< n_eq
+ n_ineq
; ++i
)
261 bmap
->eq
[i
] = bmap
->block
.data
+ i
* row_size
;
263 for (i
= 0; i
< extra
; ++i
)
264 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + row_size
);
270 bmap
->c_size
= n_eq
+ n_ineq
;
271 bmap
->ineq
= bmap
->eq
+ n_eq
;
280 isl_basic_map_free(bmap
);
284 struct isl_basic_set
*isl_basic_set_alloc(struct isl_ctx
*ctx
,
285 unsigned nparam
, unsigned dim
, unsigned extra
,
286 unsigned n_eq
, unsigned n_ineq
)
288 struct isl_basic_map
*bmap
;
289 bmap
= isl_basic_map_alloc(ctx
, nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
290 return (struct isl_basic_set
*)bmap
;
293 struct isl_basic_set
*isl_basic_set_alloc_dim(struct isl_dim
*dim
,
294 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
296 struct isl_basic_map
*bmap
;
299 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
300 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
301 return (struct isl_basic_set
*)bmap
;
304 struct isl_basic_map
*isl_basic_map_alloc_dim(struct isl_dim
*dim
,
305 unsigned extra
, unsigned n_eq
, unsigned n_ineq
)
307 struct isl_basic_map
*bmap
;
311 bmap
= isl_alloc_type(dim
->ctx
, struct isl_basic_map
);
316 return basic_map_init(dim
->ctx
, bmap
, extra
, n_eq
, n_ineq
);
322 struct isl_basic_map
*isl_basic_map_alloc(struct isl_ctx
*ctx
,
323 unsigned nparam
, unsigned in
, unsigned out
, unsigned extra
,
324 unsigned n_eq
, unsigned n_ineq
)
326 struct isl_basic_map
*bmap
;
329 dim
= isl_dim_alloc(ctx
, nparam
, in
, out
);
333 bmap
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
337 static void dup_constraints(
338 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
341 unsigned total
= isl_basic_map_total_dim(src
);
343 for (i
= 0; i
< src
->n_eq
; ++i
) {
344 int j
= isl_basic_map_alloc_equality(dst
);
345 isl_seq_cpy(dst
->eq
[j
], src
->eq
[i
], 1+total
);
348 for (i
= 0; i
< src
->n_ineq
; ++i
) {
349 int j
= isl_basic_map_alloc_inequality(dst
);
350 isl_seq_cpy(dst
->ineq
[j
], src
->ineq
[i
], 1+total
);
353 for (i
= 0; i
< src
->n_div
; ++i
) {
354 int j
= isl_basic_map_alloc_div(dst
);
355 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
);
357 F_SET(dst
, ISL_BASIC_SET_FINAL
);
360 struct isl_basic_map
*isl_basic_map_dup(struct isl_basic_map
*bmap
)
362 struct isl_basic_map
*dup
;
366 dup
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
367 bmap
->n_div
, bmap
->n_eq
, bmap
->n_ineq
);
370 dup
->flags
= bmap
->flags
;
371 dup_constraints(dup
, bmap
);
372 dup
->sample
= isl_vec_copy(bmap
->ctx
, bmap
->sample
);
376 struct isl_basic_set
*isl_basic_set_dup(struct isl_basic_set
*bset
)
378 struct isl_basic_map
*dup
;
380 dup
= isl_basic_map_dup((struct isl_basic_map
*)bset
);
381 return (struct isl_basic_set
*)dup
;
384 struct isl_basic_set
*isl_basic_set_copy(struct isl_basic_set
*bset
)
389 if (F_ISSET(bset
, ISL_BASIC_SET_FINAL
)) {
393 return isl_basic_set_dup(bset
);
396 struct isl_set
*isl_set_copy(struct isl_set
*set
)
405 struct isl_basic_map
*isl_basic_map_copy(struct isl_basic_map
*bmap
)
410 if (F_ISSET(bmap
, ISL_BASIC_SET_FINAL
)) {
414 return isl_basic_map_dup(bmap
);
417 struct isl_map
*isl_map_copy(struct isl_map
*map
)
426 void isl_basic_map_free(struct isl_basic_map
*bmap
)
434 isl_ctx_deref(bmap
->ctx
);
436 isl_blk_free(bmap
->ctx
, bmap
->block2
);
438 isl_blk_free(bmap
->ctx
, bmap
->block
);
439 isl_vec_free(bmap
->ctx
, bmap
->sample
);
440 isl_dim_free(bmap
->dim
);
444 void isl_basic_set_free(struct isl_basic_set
*bset
)
446 isl_basic_map_free((struct isl_basic_map
*)bset
);
449 int isl_basic_map_alloc_equality(struct isl_basic_map
*bmap
)
455 isl_assert(ctx
, bmap
->n_eq
+ bmap
->n_ineq
< bmap
->c_size
, return -1);
456 isl_assert(ctx
, bmap
->eq
+ bmap
->n_eq
<= bmap
->ineq
, return -1);
457 if (bmap
->eq
+ bmap
->n_eq
== bmap
->ineq
) {
459 int j
= isl_basic_map_alloc_inequality(bmap
);
463 bmap
->ineq
[0] = bmap
->ineq
[j
];
468 isl_seq_clr(bmap
->eq
[bmap
->n_eq
] +
469 1 + isl_basic_map_total_dim(bmap
),
470 bmap
->extra
- bmap
->n_div
);
471 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
475 int isl_basic_set_alloc_equality(struct isl_basic_set
*bset
)
477 return isl_basic_map_alloc_equality((struct isl_basic_map
*)bset
);
480 int isl_basic_map_free_equality(struct isl_basic_map
*bmap
, unsigned n
)
484 isl_assert(bmap
->ctx
, n
<= bmap
->n_eq
, return -1);
489 int isl_basic_map_drop_equality(struct isl_basic_map
*bmap
, unsigned pos
)
494 isl_assert(bmap
->ctx
, pos
< bmap
->n_eq
, return -1);
496 if (pos
!= bmap
->n_eq
- 1) {
498 bmap
->eq
[pos
] = bmap
->eq
[bmap
->n_eq
- 1];
499 bmap
->eq
[bmap
->n_eq
- 1] = t
;
505 int isl_basic_set_drop_equality(struct isl_basic_set
*bset
, unsigned pos
)
507 return isl_basic_map_drop_equality((struct isl_basic_map
*)bset
, pos
);
510 void isl_basic_map_inequality_to_equality(
511 struct isl_basic_map
*bmap
, unsigned pos
)
516 bmap
->ineq
[pos
] = bmap
->ineq
[0];
517 bmap
->ineq
[0] = bmap
->eq
[bmap
->n_eq
];
518 bmap
->eq
[bmap
->n_eq
] = t
;
522 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
523 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
526 int isl_basic_map_alloc_inequality(struct isl_basic_map
*bmap
)
532 isl_assert(ctx
, (bmap
->ineq
- bmap
->eq
) + bmap
->n_ineq
< bmap
->c_size
,
534 F_CLR(bmap
, ISL_BASIC_MAP_NO_IMPLICIT
);
535 F_CLR(bmap
, ISL_BASIC_MAP_NO_REDUNDANT
);
536 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
537 isl_seq_clr(bmap
->ineq
[bmap
->n_ineq
] +
538 1 + isl_basic_map_total_dim(bmap
),
539 bmap
->extra
- bmap
->n_div
);
540 return bmap
->n_ineq
++;
543 int isl_basic_set_alloc_inequality(struct isl_basic_set
*bset
)
545 return isl_basic_map_alloc_inequality((struct isl_basic_map
*)bset
);
548 int isl_basic_map_free_inequality(struct isl_basic_map
*bmap
, unsigned n
)
552 isl_assert(bmap
->ctx
, n
<= bmap
->n_ineq
, return -1);
557 int isl_basic_set_free_inequality(struct isl_basic_set
*bset
, unsigned n
)
559 return isl_basic_map_free_inequality((struct isl_basic_map
*)bset
, n
);
562 int isl_basic_map_drop_inequality(struct isl_basic_map
*bmap
, unsigned pos
)
567 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
569 if (pos
!= bmap
->n_ineq
- 1) {
571 bmap
->ineq
[pos
] = bmap
->ineq
[bmap
->n_ineq
- 1];
572 bmap
->ineq
[bmap
->n_ineq
- 1] = t
;
573 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
579 int isl_basic_set_drop_inequality(struct isl_basic_set
*bset
, unsigned pos
)
581 return isl_basic_map_drop_inequality((struct isl_basic_map
*)bset
, pos
);
584 int isl_basic_map_alloc_div(struct isl_basic_map
*bmap
)
588 isl_assert(bmap
->ctx
, bmap
->n_div
< bmap
->extra
, return -1);
589 isl_seq_clr(bmap
->div
[bmap
->n_div
] +
590 1 + 1 + isl_basic_map_total_dim(bmap
),
591 bmap
->extra
- bmap
->n_div
);
592 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED_DIVS
);
593 return bmap
->n_div
++;
596 int isl_basic_map_free_div(struct isl_basic_map
*bmap
, unsigned n
)
600 isl_assert(bmap
->ctx
, n
<= bmap
->n_div
, return -1);
605 /* Copy constraint from src to dst, putting the vars of src at offset
606 * dim_off in dst and the divs of src at offset div_off in dst.
607 * If both sets are actually map, then dim_off applies to the input
610 static void copy_constraint(struct isl_basic_map
*dst_map
, isl_int
*dst
,
611 struct isl_basic_map
*src_map
, isl_int
*src
,
612 unsigned in_off
, unsigned out_off
, unsigned div_off
)
614 unsigned src_nparam
= isl_basic_map_n_param(src_map
);
615 unsigned dst_nparam
= isl_basic_map_n_param(dst_map
);
616 unsigned src_in
= isl_basic_map_n_in(src_map
);
617 unsigned dst_in
= isl_basic_map_n_in(dst_map
);
618 unsigned src_out
= isl_basic_map_n_out(src_map
);
619 unsigned dst_out
= isl_basic_map_n_out(dst_map
);
620 isl_int_set(dst
[0], src
[0]);
621 isl_seq_cpy(dst
+1, src
+1, isl_min(dst_nparam
, src_nparam
));
622 if (dst_nparam
> src_nparam
)
623 isl_seq_clr(dst
+1+src_nparam
,
624 dst_nparam
- src_nparam
);
625 isl_seq_clr(dst
+1+dst_nparam
, in_off
);
626 isl_seq_cpy(dst
+1+dst_nparam
+in_off
,
628 isl_min(dst_in
-in_off
, src_in
));
629 if (dst_in
-in_off
> src_in
)
630 isl_seq_clr(dst
+1+dst_nparam
+in_off
+src_in
,
631 dst_in
- in_off
- src_in
);
632 isl_seq_clr(dst
+1+dst_nparam
+dst_in
, out_off
);
633 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+out_off
,
634 src
+1+src_nparam
+src_in
,
635 isl_min(dst_out
-out_off
, src_out
));
636 if (dst_out
-out_off
> src_out
)
637 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+out_off
+src_out
,
638 dst_out
- out_off
- src_out
);
639 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
, div_off
);
640 isl_seq_cpy(dst
+1+dst_nparam
+dst_in
+dst_out
+div_off
,
641 src
+1+src_nparam
+src_in
+src_out
,
642 isl_min(dst_map
->extra
-div_off
, src_map
->n_div
));
643 if (dst_map
->n_div
-div_off
> src_map
->n_div
)
644 isl_seq_clr(dst
+1+dst_nparam
+dst_in
+dst_out
+
645 div_off
+src_map
->n_div
,
646 dst_map
->n_div
- div_off
- src_map
->n_div
);
649 static void copy_div(struct isl_basic_map
*dst_map
, isl_int
*dst
,
650 struct isl_basic_map
*src_map
, isl_int
*src
,
651 unsigned in_off
, unsigned out_off
, unsigned div_off
)
653 isl_int_set(dst
[0], src
[0]);
654 copy_constraint(dst_map
, dst
+1, src_map
, src
+1, in_off
, out_off
, div_off
);
657 static struct isl_basic_map
*add_constraints(struct isl_basic_map
*bmap1
,
658 struct isl_basic_map
*bmap2
, unsigned i_pos
, unsigned o_pos
)
663 if (!bmap1
|| !bmap2
)
666 div_off
= bmap1
->n_div
;
668 for (i
= 0; i
< bmap2
->n_eq
; ++i
) {
669 int i1
= isl_basic_map_alloc_equality(bmap1
);
672 copy_constraint(bmap1
, bmap1
->eq
[i1
], bmap2
, bmap2
->eq
[i
],
673 i_pos
, o_pos
, div_off
);
676 for (i
= 0; i
< bmap2
->n_ineq
; ++i
) {
677 int i1
= isl_basic_map_alloc_inequality(bmap1
);
680 copy_constraint(bmap1
, bmap1
->ineq
[i1
], bmap2
, bmap2
->ineq
[i
],
681 i_pos
, o_pos
, div_off
);
684 for (i
= 0; i
< bmap2
->n_div
; ++i
) {
685 int i1
= isl_basic_map_alloc_div(bmap1
);
688 copy_div(bmap1
, bmap1
->div
[i1
], bmap2
, bmap2
->div
[i
],
689 i_pos
, o_pos
, div_off
);
692 isl_basic_map_free(bmap2
);
697 isl_basic_map_free(bmap1
);
698 isl_basic_map_free(bmap2
);
702 static void copy_constraint_dim_map(isl_int
*dst
, isl_int
*src
,
703 struct isl_dim_map
*dim_map
)
707 for (i
= 0; i
< dim_map
->len
; ++i
) {
708 if (dim_map
->pos
[i
] < 0)
709 isl_int_set_si(dst
[i
], 0);
711 isl_int_set(dst
[i
], src
[dim_map
->pos
[i
]]);
715 static void copy_div_dim_map(isl_int
*dst
, isl_int
*src
,
716 struct isl_dim_map
*dim_map
)
718 isl_int_set(dst
[0], src
[0]);
719 copy_constraint_dim_map(dst
+1, src
+1, dim_map
);
722 static struct isl_basic_map
*add_constraints_dim_map(struct isl_basic_map
*dst
,
723 struct isl_basic_map
*src
, struct isl_dim_map
*dim_map
)
727 if (!src
|| !dst
|| !dim_map
)
730 for (i
= 0; i
< src
->n_eq
; ++i
) {
731 int i1
= isl_basic_map_alloc_equality(dst
);
734 copy_constraint_dim_map(dst
->eq
[i1
], src
->eq
[i
], dim_map
);
737 for (i
= 0; i
< src
->n_ineq
; ++i
) {
738 int i1
= isl_basic_map_alloc_inequality(dst
);
741 copy_constraint_dim_map(dst
->ineq
[i1
], src
->ineq
[i
], dim_map
);
744 for (i
= 0; i
< src
->n_div
; ++i
) {
745 int i1
= isl_basic_map_alloc_div(dst
);
748 copy_div_dim_map(dst
->div
[i1
], src
->div
[i
], dim_map
);
752 isl_basic_map_free(src
);
757 isl_basic_map_free(src
);
758 isl_basic_map_free(dst
);
762 struct isl_basic_set
*isl_basic_set_add_constraints(struct isl_basic_set
*bset1
,
763 struct isl_basic_set
*bset2
, unsigned pos
)
765 return (struct isl_basic_set
*)
766 add_constraints((struct isl_basic_map
*)bset1
,
767 (struct isl_basic_map
*)bset2
, 0, pos
);
770 struct isl_basic_map
*isl_basic_map_extend_dim(struct isl_basic_map
*base
,
771 struct isl_dim
*dim
, unsigned extra
,
772 unsigned n_eq
, unsigned n_ineq
)
774 struct isl_basic_map
*ext
;
781 base
= isl_basic_map_cow(base
);
785 dims_ok
= isl_dim_equal(base
->dim
, dim
) &&
786 base
->extra
>= base
->n_div
+ extra
;
788 if (dims_ok
&& n_eq
== 0 && n_ineq
== 0) {
793 isl_assert(base
->ctx
, base
->dim
->nparam
<= dim
->nparam
, goto error
);
794 isl_assert(base
->ctx
, base
->dim
->n_in
<= dim
->n_in
, goto error
);
795 isl_assert(base
->ctx
, base
->dim
->n_out
<= dim
->n_out
, goto error
);
796 extra
+= base
->extra
;
798 n_ineq
+= base
->n_ineq
;
800 ext
= isl_basic_map_alloc_dim(dim
, extra
, n_eq
, n_ineq
);
806 ext
= add_constraints(ext
, base
, 0, 0);
809 F_CLR(ext
, ISL_BASIC_SET_FINAL
);
816 isl_basic_map_free(base
);
820 struct isl_basic_map
*isl_basic_map_extend_constraints(
821 struct isl_basic_map
*base
, unsigned n_eq
, unsigned n_ineq
)
825 return isl_basic_map_extend_dim(base
, isl_dim_copy(base
->dim
),
829 struct isl_basic_map
*isl_basic_map_extend(struct isl_basic_map
*base
,
830 unsigned nparam
, unsigned n_in
, unsigned n_out
, unsigned extra
,
831 unsigned n_eq
, unsigned n_ineq
)
833 struct isl_basic_map
*bmap
;
838 dim
= isl_dim_alloc(base
->ctx
, nparam
, n_in
, n_out
);
842 bmap
= isl_basic_map_extend_dim(base
, dim
, extra
, n_eq
, n_ineq
);
846 struct isl_basic_set
*isl_basic_set_extend(struct isl_basic_set
*base
,
847 unsigned nparam
, unsigned dim
, unsigned extra
,
848 unsigned n_eq
, unsigned n_ineq
)
850 return (struct isl_basic_set
*)
851 isl_basic_map_extend((struct isl_basic_map
*)base
,
852 nparam
, 0, dim
, extra
, n_eq
, n_ineq
);
855 struct isl_basic_set
*isl_basic_set_extend_constraints(
856 struct isl_basic_set
*base
, unsigned n_eq
, unsigned n_ineq
)
858 return (struct isl_basic_set
*)
859 isl_basic_map_extend_constraints((struct isl_basic_map
*)base
,
863 struct isl_basic_set
*isl_basic_set_cow(struct isl_basic_set
*bset
)
865 return (struct isl_basic_set
*)
866 isl_basic_map_cow((struct isl_basic_map
*)bset
);
869 struct isl_basic_map
*isl_basic_map_cow(struct isl_basic_map
*bmap
)
876 bmap
= isl_basic_map_dup(bmap
);
878 F_CLR(bmap
, ISL_BASIC_SET_FINAL
);
882 struct isl_set
*isl_set_cow(struct isl_set
*set
)
890 return isl_set_dup(set
);
893 struct isl_map
*isl_map_cow(struct isl_map
*map
)
901 return isl_map_dup(map
);
904 static void swap_vars(struct isl_blk blk
, isl_int
*a
,
905 unsigned a_len
, unsigned b_len
)
907 isl_seq_cpy(blk
.data
, a
+a_len
, b_len
);
908 isl_seq_cpy(blk
.data
+b_len
, a
, a_len
);
909 isl_seq_cpy(a
, blk
.data
, b_len
+a_len
);
912 struct isl_basic_set
*isl_basic_set_swap_vars(
913 struct isl_basic_set
*bset
, unsigned n
)
923 nparam
= isl_basic_set_n_param(bset
);
924 dim
= isl_basic_set_n_dim(bset
);
925 isl_assert(bset
->ctx
, n
<= dim
, goto error
);
930 bset
= isl_basic_set_cow(bset
);
934 blk
= isl_blk_alloc(bset
->ctx
, dim
);
935 if (isl_blk_is_error(blk
))
938 for (i
= 0; i
< bset
->n_eq
; ++i
)
940 bset
->eq
[i
]+1+nparam
, n
, dim
- n
);
942 for (i
= 0; i
< bset
->n_ineq
; ++i
)
944 bset
->ineq
[i
]+1+nparam
, n
, dim
- n
);
946 for (i
= 0; i
< bset
->n_div
; ++i
)
948 bset
->div
[i
]+1+1+nparam
, n
, dim
- n
);
950 isl_blk_free(bset
->ctx
, blk
);
952 F_CLR(bset
, ISL_BASIC_SET_NORMALIZED
);
956 isl_basic_set_free(bset
);
960 struct isl_set
*isl_set_swap_vars(struct isl_set
*set
, unsigned n
)
963 set
= isl_set_cow(set
);
967 for (i
= 0; i
< set
->n
; ++i
) {
968 set
->p
[i
] = isl_basic_set_swap_vars(set
->p
[i
], n
);
974 F_CLR(set
, ISL_SET_NORMALIZED
);
978 struct isl_basic_map
*isl_basic_map_set_to_empty(struct isl_basic_map
*bmap
)
984 total
= isl_basic_map_total_dim(bmap
);
985 isl_basic_map_free_div(bmap
, bmap
->n_div
);
986 isl_basic_map_free_inequality(bmap
, bmap
->n_ineq
);
988 isl_basic_map_free_equality(bmap
, bmap
->n_eq
-1);
990 isl_basic_map_alloc_equality(bmap
);
994 isl_int_set_si(bmap
->eq
[i
][0], 1);
995 isl_seq_clr(bmap
->eq
[i
]+1, total
);
996 F_SET(bmap
, ISL_BASIC_MAP_EMPTY
);
997 return isl_basic_map_finalize(bmap
);
999 isl_basic_map_free(bmap
);
1003 struct isl_basic_set
*isl_basic_set_set_to_empty(struct isl_basic_set
*bset
)
1005 return (struct isl_basic_set
*)
1006 isl_basic_map_set_to_empty((struct isl_basic_map
*)bset
);
1009 static void swap_div(struct isl_basic_map
*bmap
, int a
, int b
)
1012 unsigned off
= isl_dim_total(bmap
->dim
);
1013 isl_int
*t
= bmap
->div
[a
];
1014 bmap
->div
[a
] = bmap
->div
[b
];
1017 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1018 isl_int_swap(bmap
->eq
[i
][1+off
+a
], bmap
->eq
[i
][1+off
+b
]);
1020 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1021 isl_int_swap(bmap
->ineq
[i
][1+off
+a
], bmap
->ineq
[i
][1+off
+b
]);
1023 for (i
= 0; i
< bmap
->n_div
; ++i
)
1024 isl_int_swap(bmap
->div
[i
][1+1+off
+a
], bmap
->div
[i
][1+1+off
+b
]);
1025 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1028 /* Eliminate the specified n dimensions starting at first from the
1029 * constraints using Fourier-Motzkin, The dimensions themselves
1032 struct isl_set
*isl_set_eliminate_dims(struct isl_set
*set
,
1033 unsigned first
, unsigned n
)
1043 set
= isl_set_cow(set
);
1046 isl_assert(set
->ctx
, first
+n
<= isl_set_n_dim(set
), goto error
);
1047 nparam
= isl_set_n_param(set
);
1049 for (i
= 0; i
< set
->n
; ++i
) {
1050 set
->p
[i
] = isl_basic_set_eliminate_vars(set
->p
[i
],
1061 /* Project out n dimensions starting at first using Fourier-Motzkin */
1062 struct isl_set
*isl_set_remove_dims(struct isl_set
*set
,
1063 unsigned first
, unsigned n
)
1065 set
= isl_set_eliminate_dims(set
, first
, n
);
1066 set
= isl_set_drop_dims(set
, first
, n
);
1070 struct isl_basic_set
*isl_basic_set_remove_divs(struct isl_basic_set
*bset
)
1072 bset
= isl_basic_set_eliminate_vars(bset
, isl_dim_total(bset
->dim
),
1080 struct isl_set
*isl_set_remove_divs(struct isl_set
*set
)
1089 set
= isl_set_cow(set
);
1093 for (i
= 0; i
< set
->n
; ++i
) {
1094 set
->p
[i
] = isl_basic_set_remove_divs(set
->p
[i
]);
1104 /* Project out n inputs starting at first using Fourier-Motzkin */
1105 struct isl_map
*isl_map_remove_inputs(struct isl_map
*map
,
1106 unsigned first
, unsigned n
)
1114 map
= isl_map_cow(map
);
1117 nparam
= isl_map_n_param(map
);
1118 isl_assert(map
->ctx
, first
+n
<= isl_map_n_in(map
), goto error
);
1120 for (i
= 0; i
< map
->n
; ++i
) {
1121 map
->p
[i
] = isl_basic_map_eliminate_vars(map
->p
[i
],
1126 map
= isl_map_drop_inputs(map
, first
, n
);
1133 /* Project out n dimensions starting at first using Fourier-Motzkin */
1134 struct isl_basic_set
*isl_basic_set_remove_dims(struct isl_basic_set
*bset
,
1135 unsigned first
, unsigned n
)
1137 unsigned nparam
= isl_basic_set_n_param(bset
);
1138 bset
= isl_basic_set_eliminate_vars(bset
, nparam
+ first
, n
);
1139 bset
= isl_basic_set_drop_dims(bset
, first
, n
);
1143 static void dump_term(struct isl_basic_map
*bmap
,
1144 isl_int c
, int pos
, FILE *out
)
1147 unsigned in
= isl_basic_map_n_in(bmap
);
1148 unsigned dim
= in
+ isl_basic_map_n_out(bmap
);
1149 unsigned nparam
= isl_basic_map_n_param(bmap
);
1151 isl_int_print(out
, c
, 0);
1153 if (!isl_int_is_one(c
))
1154 isl_int_print(out
, c
, 0);
1155 if (pos
< 1 + nparam
) {
1156 name
= isl_dim_get_name(bmap
->dim
,
1157 isl_dim_param
, pos
- 1);
1159 fprintf(out
, "%s", name
);
1161 fprintf(out
, "p%d", pos
- 1);
1162 } else if (pos
< 1 + nparam
+ in
)
1163 fprintf(out
, "i%d", pos
- 1 - nparam
);
1164 else if (pos
< 1 + nparam
+ dim
)
1165 fprintf(out
, "o%d", pos
- 1 - nparam
- in
);
1167 fprintf(out
, "e%d", pos
- 1 - nparam
- dim
);
1171 static void dump_constraint_sign(struct isl_basic_map
*bmap
, isl_int
*c
,
1172 int sign
, FILE *out
)
1176 unsigned len
= 1 + isl_basic_map_total_dim(bmap
);
1180 for (i
= 0, first
= 1; i
< len
; ++i
) {
1181 if (isl_int_sgn(c
[i
]) * sign
<= 0)
1184 fprintf(out
, " + ");
1186 isl_int_abs(v
, c
[i
]);
1187 dump_term(bmap
, v
, i
, out
);
1194 static void dump_constraint(struct isl_basic_map
*bmap
, isl_int
*c
,
1195 const char *op
, FILE *out
, int indent
)
1199 fprintf(out
, "%*s", indent
, "");
1201 dump_constraint_sign(bmap
, c
, 1, out
);
1202 fprintf(out
, " %s ", op
);
1203 dump_constraint_sign(bmap
, c
, -1, out
);
1207 for (i
= bmap
->n_div
; i
< bmap
->extra
; ++i
) {
1208 if (isl_int_is_zero(c
[1+isl_dim_total(bmap
->dim
)+i
]))
1210 fprintf(out
, "%*s", indent
, "");
1211 fprintf(out
, "ERROR: unused div coefficient not zero\n");
1216 static void dump_constraints(struct isl_basic_map
*bmap
,
1217 isl_int
**c
, unsigned n
,
1218 const char *op
, FILE *out
, int indent
)
1222 for (i
= 0; i
< n
; ++i
)
1223 dump_constraint(bmap
, c
[i
], op
, out
, indent
);
1226 static void dump_affine(struct isl_basic_map
*bmap
, isl_int
*exp
, FILE *out
)
1230 unsigned total
= isl_basic_map_total_dim(bmap
);
1232 for (j
= 0; j
< 1 + total
; ++j
) {
1233 if (isl_int_is_zero(exp
[j
]))
1235 if (!first
&& isl_int_is_pos(exp
[j
]))
1237 dump_term(bmap
, exp
[j
], j
, out
);
1242 static void dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1246 dump_constraints(bmap
, bmap
->eq
, bmap
->n_eq
, "=", out
, indent
);
1247 dump_constraints(bmap
, bmap
->ineq
, bmap
->n_ineq
, ">=", out
, indent
);
1249 for (i
= 0; i
< bmap
->n_div
; ++i
) {
1250 fprintf(out
, "%*s", indent
, "");
1251 fprintf(out
, "e%d = [(", i
);
1252 dump_affine(bmap
, bmap
->div
[i
]+1, out
);
1254 isl_int_print(out
, bmap
->div
[i
][0], 0);
1255 fprintf(out
, "]\n");
1259 void isl_basic_set_dump(struct isl_basic_set
*bset
, FILE *out
, int indent
)
1262 fprintf(out
, "null basic set\n");
1266 fprintf(out
, "%*s", indent
, "");
1267 fprintf(out
, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1268 bset
->ref
, bset
->dim
->nparam
, bset
->dim
->n_out
,
1269 bset
->extra
, bset
->flags
);
1270 dump((struct isl_basic_map
*)bset
, out
, indent
);
1273 void isl_basic_map_dump(struct isl_basic_map
*bmap
, FILE *out
, int indent
)
1276 fprintf(out
, "null basic map\n");
1280 fprintf(out
, "%*s", indent
, "");
1281 fprintf(out
, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1282 "flags: %x, n_name: %d\n",
1284 bmap
->dim
->nparam
, bmap
->dim
->n_in
, bmap
->dim
->n_out
,
1285 bmap
->extra
, bmap
->flags
, bmap
->dim
->n_name
);
1286 dump(bmap
, out
, indent
);
1289 int isl_inequality_negate(struct isl_basic_map
*bmap
, unsigned pos
)
1294 total
= isl_basic_map_total_dim(bmap
);
1295 isl_assert(bmap
->ctx
, pos
< bmap
->n_ineq
, return -1);
1296 isl_seq_neg(bmap
->ineq
[pos
], bmap
->ineq
[pos
], 1 + total
);
1297 isl_int_sub_ui(bmap
->ineq
[pos
][0], bmap
->ineq
[pos
][0], 1);
1298 F_CLR(bmap
, ISL_BASIC_MAP_NORMALIZED
);
1302 struct isl_set
*isl_set_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
1304 struct isl_set
*set
;
1308 isl_assert(dim
->ctx
, dim
->n_in
== 0, return NULL
);
1309 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
1310 set
= isl_alloc(dim
->ctx
, struct isl_set
,
1311 sizeof(struct isl_set
) +
1312 n
* sizeof(struct isl_basic_set
*));
1316 set
->ctx
= dim
->ctx
;
1317 isl_ctx_ref(set
->ctx
);
1329 struct isl_set
*isl_set_alloc(struct isl_ctx
*ctx
,
1330 unsigned nparam
, unsigned dim
, int n
, unsigned flags
)
1332 struct isl_set
*set
;
1333 struct isl_dim
*dims
;
1335 dims
= isl_dim_alloc(ctx
, nparam
, 0, dim
);
1339 set
= isl_set_alloc_dim(dims
, n
, flags
);
1343 struct isl_set
*isl_set_dup(struct isl_set
*set
)
1346 struct isl_set
*dup
;
1351 dup
= isl_set_alloc_dim(isl_dim_copy(set
->dim
), set
->n
, set
->flags
);
1354 for (i
= 0; i
< set
->n
; ++i
)
1355 dup
= isl_set_add(dup
, isl_basic_set_copy(set
->p
[i
]));
1359 struct isl_set
*isl_set_from_basic_set(struct isl_basic_set
*bset
)
1361 struct isl_set
*set
;
1366 set
= isl_set_alloc_dim(isl_dim_copy(bset
->dim
), 1, ISL_MAP_DISJOINT
);
1368 isl_basic_set_free(bset
);
1371 return isl_set_add(set
, bset
);
1374 struct isl_map
*isl_map_from_basic_map(struct isl_basic_map
*bmap
)
1376 struct isl_map
*map
;
1381 map
= isl_map_alloc_dim(isl_dim_copy(bmap
->dim
), 1, ISL_MAP_DISJOINT
);
1383 isl_basic_map_free(bmap
);
1386 return isl_map_add(map
, bmap
);
1389 struct isl_set
*isl_set_add(struct isl_set
*set
, struct isl_basic_set
*bset
)
1393 isl_assert(set
->ctx
, isl_dim_equal(set
->dim
, bset
->dim
), goto error
);
1394 isl_assert(set
->ctx
, set
->n
< set
->size
, goto error
);
1395 set
->p
[set
->n
] = bset
;
1402 isl_basic_set_free(bset
);
1406 void isl_set_free(struct isl_set
*set
)
1416 isl_ctx_deref(set
->ctx
);
1417 for (i
= 0; i
< set
->n
; ++i
)
1418 isl_basic_set_free(set
->p
[i
]);
1419 isl_dim_free(set
->dim
);
1423 void isl_set_dump(struct isl_set
*set
, FILE *out
, int indent
)
1428 fprintf(out
, "null set\n");
1432 fprintf(out
, "%*s", indent
, "");
1433 fprintf(out
, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1434 set
->ref
, set
->n
, set
->dim
->nparam
, set
->dim
->n_out
,
1436 for (i
= 0; i
< set
->n
; ++i
) {
1437 fprintf(out
, "%*s", indent
, "");
1438 fprintf(out
, "basic set %d:\n", i
);
1439 isl_basic_set_dump(set
->p
[i
], out
, indent
+4);
1443 void isl_map_dump(struct isl_map
*map
, FILE *out
, int indent
)
1448 fprintf(out
, "null map\n");
1452 fprintf(out
, "%*s", indent
, "");
1453 fprintf(out
, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1454 "flags: %x, n_name: %d\n",
1455 map
->ref
, map
->n
, map
->dim
->nparam
, map
->dim
->n_in
,
1456 map
->dim
->n_out
, map
->flags
, map
->dim
->n_name
);
1457 for (i
= 0; i
< map
->n
; ++i
) {
1458 fprintf(out
, "%*s", indent
, "");
1459 fprintf(out
, "basic map %d:\n", i
);
1460 isl_basic_map_dump(map
->p
[i
], out
, indent
+4);
1464 struct isl_basic_map
*isl_basic_map_intersect_domain(
1465 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1467 struct isl_basic_map
*bmap_domain
;
1468 struct isl_dim
*dim
;
1473 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1474 bset
->dim
, isl_dim_param
), goto error
);
1476 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1477 isl_assert(bset
->ctx
,
1478 isl_basic_map_compatible_domain(bmap
, bset
), goto error
);
1480 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1481 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1484 dim
= isl_dim_reverse(isl_dim_copy(bset
->dim
));
1485 bmap_domain
= isl_basic_map_from_basic_set(bset
, dim
);
1486 bmap
= add_constraints(bmap
, bmap_domain
, 0, 0);
1488 bmap
= isl_basic_map_simplify(bmap
);
1489 return isl_basic_map_finalize(bmap
);
1491 isl_basic_map_free(bmap
);
1492 isl_basic_set_free(bset
);
1496 struct isl_basic_map
*isl_basic_map_intersect_range(
1497 struct isl_basic_map
*bmap
, struct isl_basic_set
*bset
)
1499 struct isl_basic_map
*bmap_range
;
1504 isl_assert(bset
->ctx
, isl_dim_match(bmap
->dim
, isl_dim_param
,
1505 bset
->dim
, isl_dim_param
), goto error
);
1507 if (isl_dim_size(bset
->dim
, isl_dim_set
) != 0)
1508 isl_assert(bset
->ctx
,
1509 isl_basic_map_compatible_range(bmap
, bset
), goto error
);
1511 bmap
= isl_basic_map_extend_dim(bmap
, isl_dim_copy(bmap
->dim
),
1512 bset
->n_div
, bset
->n_eq
, bset
->n_ineq
);
1515 bmap_range
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
1516 bmap
= add_constraints(bmap
, bmap_range
, 0, 0);
1518 bmap
= isl_basic_map_simplify(bmap
);
1519 return isl_basic_map_finalize(bmap
);
1521 isl_basic_map_free(bmap
);
1522 isl_basic_set_free(bset
);
1526 struct isl_basic_map
*isl_basic_map_intersect(
1527 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1529 if (!bmap1
|| !bmap2
)
1532 isl_assert(bmap1
->ctx
, isl_dim_match(bmap1
->dim
, isl_dim_param
,
1533 bmap2
->dim
, isl_dim_param
), goto error
);
1534 if (isl_dim_total(bmap1
->dim
) ==
1535 isl_dim_size(bmap1
->dim
, isl_dim_param
) &&
1536 isl_dim_total(bmap2
->dim
) !=
1537 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1538 return isl_basic_map_intersect(bmap2
, bmap1
);
1540 if (isl_dim_total(bmap2
->dim
) !=
1541 isl_dim_size(bmap2
->dim
, isl_dim_param
))
1542 isl_assert(bmap1
->ctx
,
1543 isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
1545 bmap1
= isl_basic_map_extend_dim(bmap1
, isl_dim_copy(bmap1
->dim
),
1546 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
1549 bmap1
= add_constraints(bmap1
, bmap2
, 0, 0);
1551 bmap1
= isl_basic_map_simplify(bmap1
);
1552 return isl_basic_map_finalize(bmap1
);
1554 isl_basic_map_free(bmap1
);
1555 isl_basic_map_free(bmap2
);
1559 struct isl_basic_set
*isl_basic_set_intersect(
1560 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
1562 return (struct isl_basic_set
*)
1563 isl_basic_map_intersect(
1564 (struct isl_basic_map
*)bset1
,
1565 (struct isl_basic_map
*)bset2
);
1568 struct isl_map
*isl_map_intersect(struct isl_map
*map1
, struct isl_map
*map2
)
1571 struct isl_map
*result
;
1577 isl_assert(map1
->ctx
, isl_dim_match(map1
->dim
, isl_dim_param
,
1578 map2
->dim
, isl_dim_param
), goto error
);
1579 if (isl_dim_total(map1
->dim
) ==
1580 isl_dim_size(map1
->dim
, isl_dim_param
) &&
1581 isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1582 return isl_map_intersect(map2
, map1
);
1584 if (isl_dim_total(map2
->dim
) != isl_dim_size(map2
->dim
, isl_dim_param
))
1585 isl_assert(map1
->ctx
,
1586 isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
1588 if (F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
1589 F_ISSET(map2
, ISL_MAP_DISJOINT
))
1590 FL_SET(flags
, ISL_MAP_DISJOINT
);
1592 result
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
1593 map1
->n
* map2
->n
, flags
);
1596 for (i
= 0; i
< map1
->n
; ++i
)
1597 for (j
= 0; j
< map2
->n
; ++j
) {
1598 struct isl_basic_map
*part
;
1599 part
= isl_basic_map_intersect(
1600 isl_basic_map_copy(map1
->p
[i
]),
1601 isl_basic_map_copy(map2
->p
[j
]));
1602 if (isl_basic_map_is_empty(part
))
1603 isl_basic_map_free(part
);
1605 result
= isl_map_add(result
, part
);
1618 struct isl_set
*isl_set_intersect(struct isl_set
*set1
, struct isl_set
*set2
)
1620 return (struct isl_set
*)
1621 isl_map_intersect((struct isl_map
*)set1
,
1622 (struct isl_map
*)set2
);
1625 struct isl_basic_map
*isl_basic_map_reverse(struct isl_basic_map
*bmap
)
1627 struct isl_dim
*dim
;
1628 struct isl_basic_set
*bset
;
1633 bmap
= isl_basic_map_cow(bmap
);
1636 dim
= isl_dim_reverse(isl_dim_copy(bmap
->dim
));
1637 in
= isl_basic_map_n_in(bmap
);
1638 bset
= isl_basic_set_from_basic_map(bmap
);
1639 bset
= isl_basic_set_swap_vars(bset
, in
);
1640 return isl_basic_map_from_basic_set(bset
, dim
);
1643 /* Turn final n dimensions into existentially quantified variables.
1645 struct isl_basic_set
*isl_basic_set_project_out(
1646 struct isl_basic_set
*bset
, unsigned n
, unsigned flags
)
1656 isl_assert(bset
->ctx
, n
<= isl_basic_set_n_dim(bset
), goto error
);
1661 bset
= isl_basic_set_cow(bset
);
1663 row_size
= 1 + isl_dim_total(bset
->dim
) + bset
->extra
;
1664 old
= bset
->block2
.data
;
1665 bset
->block2
= isl_blk_extend(bset
->ctx
, bset
->block2
,
1666 (bset
->extra
+ n
) * (1 + row_size
));
1667 if (!bset
->block2
.data
)
1669 new_div
= isl_alloc_array(ctx
, isl_int
*, bset
->extra
+ n
);
1672 for (i
= 0; i
< n
; ++i
) {
1673 new_div
[i
] = bset
->block2
.data
+
1674 (bset
->extra
+ i
) * (1 + row_size
);
1675 isl_seq_clr(new_div
[i
], 1 + row_size
);
1677 for (i
= 0; i
< bset
->extra
; ++i
)
1678 new_div
[n
+ i
] = bset
->block2
.data
+ (bset
->div
[i
] - old
);
1680 bset
->div
= new_div
;
1683 bset
->dim
= isl_dim_drop_outputs(bset
->dim
,
1684 isl_basic_set_n_dim(bset
) - n
, n
);
1687 bset
= isl_basic_set_simplify(bset
);
1688 return isl_basic_set_finalize(bset
);
1690 isl_basic_set_free(bset
);
1694 struct isl_basic_map
*add_divs(struct isl_basic_map
*bmap
, unsigned n
)
1698 for (i
= 0; i
< n
; ++i
) {
1699 j
= isl_basic_map_alloc_div(bmap
);
1702 isl_seq_clr(bmap
->div
[j
], 1+1+isl_basic_map_total_dim(bmap
));
1706 isl_basic_map_free(bmap
);
1710 struct isl_basic_map
*isl_basic_map_apply_range(
1711 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1713 struct isl_dim
*dim_result
= NULL
;
1714 struct isl_basic_map
*bmap
;
1715 unsigned n_in
, n_out
, n
, nparam
, total
, pos
;
1716 struct isl_dim_map
*dim_map1
, *dim_map2
;
1718 if (!bmap1
|| !bmap2
)
1721 dim_result
= isl_dim_join(isl_dim_copy(bmap1
->dim
),
1722 isl_dim_copy(bmap2
->dim
));
1724 n_in
= isl_basic_map_n_in(bmap1
);
1725 n_out
= isl_basic_map_n_out(bmap2
);
1726 n
= isl_basic_map_n_out(bmap1
);
1727 nparam
= isl_basic_map_n_param(bmap1
);
1729 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ n
;
1730 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1731 dim_map2
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1732 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
1733 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
= 0);
1734 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
1735 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_in
);
1736 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_out
);
1737 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
1738 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
1739 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
1741 bmap
= isl_basic_map_alloc_dim(dim_result
,
1742 bmap1
->n_div
+ bmap2
->n_div
+ n
,
1743 bmap1
->n_eq
+ bmap2
->n_eq
,
1744 bmap1
->n_ineq
+ bmap2
->n_ineq
);
1745 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
1746 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
1747 bmap
= add_divs(bmap
, n
);
1748 bmap
= isl_basic_map_simplify(bmap
);
1749 return isl_basic_map_finalize(bmap
);
1751 isl_basic_map_free(bmap1
);
1752 isl_basic_map_free(bmap2
);
1756 struct isl_basic_set
*isl_basic_set_apply(
1757 struct isl_basic_set
*bset
, struct isl_basic_map
*bmap
)
1762 isl_assert(set
->ctx
, isl_basic_map_compatible_domain(bmap
, bset
),
1765 return (struct isl_basic_set
*)
1766 isl_basic_map_apply_range((struct isl_basic_map
*)bset
, bmap
);
1768 isl_basic_set_free(bset
);
1769 isl_basic_map_free(bmap
);
1773 struct isl_basic_map
*isl_basic_map_apply_domain(
1774 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1776 if (!bmap1
|| !bmap2
)
1780 isl_basic_map_n_in(bmap1
) == isl_basic_map_n_in(bmap2
), goto error
);
1782 isl_basic_map_n_param(bmap1
) == isl_basic_map_n_param(bmap2
),
1785 bmap1
= isl_basic_map_reverse(bmap1
);
1786 bmap1
= isl_basic_map_apply_range(bmap1
, bmap2
);
1787 return isl_basic_map_reverse(bmap1
);
1789 isl_basic_map_free(bmap1
);
1790 isl_basic_map_free(bmap2
);
1794 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1795 * A \cap B -> f(A) + f(B)
1797 struct isl_basic_map
*isl_basic_map_sum(
1798 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
1800 unsigned n_in
, n_out
, nparam
, total
, pos
;
1801 struct isl_basic_map
*bmap
= NULL
;
1802 struct isl_dim_map
*dim_map1
, *dim_map2
;
1805 if (!bmap1
|| !bmap2
)
1808 isl_assert(bmap1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
),
1811 nparam
= isl_basic_map_n_param(bmap1
);
1812 n_in
= isl_basic_map_n_in(bmap1
);
1813 n_out
= isl_basic_map_n_out(bmap1
);
1815 total
= nparam
+ n_in
+ n_out
+ bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
;
1816 dim_map1
= isl_dim_map_alloc(bmap1
->ctx
, total
);
1817 dim_map2
= isl_dim_map_alloc(bmap2
->ctx
, total
);
1818 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_param
, pos
= 0);
1819 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_param
, pos
);
1820 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_in
, pos
+= nparam
);
1821 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_in
, pos
);
1822 isl_dim_map_div(dim_map1
, bmap1
, pos
+= n_in
+ n_out
);
1823 isl_dim_map_div(dim_map2
, bmap2
, pos
+= bmap1
->n_div
);
1824 isl_dim_map_dim(dim_map1
, bmap1
->dim
, isl_dim_out
, pos
+= bmap2
->n_div
);
1825 isl_dim_map_dim(dim_map2
, bmap2
->dim
, isl_dim_out
, pos
+= n_out
);
1827 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(bmap1
->dim
),
1828 bmap1
->n_div
+ bmap2
->n_div
+ 2 * n_out
,
1829 bmap1
->n_eq
+ bmap2
->n_eq
+ n_out
,
1830 bmap1
->n_ineq
+ bmap2
->n_ineq
);
1831 for (i
= 0; i
< n_out
; ++i
) {
1832 int j
= isl_basic_map_alloc_equality(bmap
);
1835 isl_seq_clr(bmap
->eq
[j
], 1+total
);
1836 isl_int_set_si(bmap
->eq
[j
][1+nparam
+n_in
+i
], -1);
1837 isl_int_set_si(bmap
->eq
[j
][1+pos
+i
], 1);
1838 isl_int_set_si(bmap
->eq
[j
][1+pos
-n_out
+i
], 1);
1840 bmap
= add_constraints_dim_map(bmap
, bmap1
, dim_map1
);
1841 bmap
= add_constraints_dim_map(bmap
, bmap2
, dim_map2
);
1842 bmap
= add_divs(bmap
, 2 * n_out
);
1844 bmap
= isl_basic_map_simplify(bmap
);
1845 return isl_basic_map_finalize(bmap
);
1847 isl_basic_map_free(bmap
);
1848 isl_basic_map_free(bmap1
);
1849 isl_basic_map_free(bmap2
);
1853 /* Given a basic map A -> f(A), construct A -> -f(A).
1855 struct isl_basic_map
*isl_basic_map_neg(struct isl_basic_map
*bmap
)
1860 bmap
= isl_basic_map_cow(bmap
);
1864 n
= isl_basic_map_dim(bmap
, isl_dim_out
);
1865 off
= basic_map_offset(bmap
, isl_dim_out
);
1866 for (i
= 0; i
< bmap
->n_eq
; ++i
)
1867 for (j
= 0; j
< n
; ++j
)
1868 isl_int_neg(bmap
->eq
[i
][off
+j
], bmap
->eq
[i
][off
+j
]);
1869 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
1870 for (j
= 0; j
< n
; ++j
)
1871 isl_int_neg(bmap
->ineq
[i
][off
+j
], bmap
->ineq
[i
][off
+j
]);
1872 for (i
= 0; i
< bmap
->n_div
; ++i
)
1873 for (j
= 0; j
< n
; ++j
)
1874 isl_int_neg(bmap
->div
[i
][1+off
+j
], bmap
->div
[i
][1+off
+j
]);
1875 return isl_basic_map_finalize(bmap
);
1878 /* Given a basic map A -> f(A) and an integer d, construct a basic map
1879 * A -> floor(f(A)/d).
1881 struct isl_basic_map
*isl_basic_map_floordiv(struct isl_basic_map
*bmap
,
1884 unsigned n_in
, n_out
, nparam
, total
, pos
;
1885 struct isl_basic_map
*result
= NULL
;
1886 struct isl_dim_map
*dim_map
;
1892 nparam
= isl_basic_map_n_param(bmap
);
1893 n_in
= isl_basic_map_n_in(bmap
);
1894 n_out
= isl_basic_map_n_out(bmap
);
1896 total
= nparam
+ n_in
+ n_out
+ bmap
->n_div
+ n_out
;
1897 dim_map
= isl_dim_map_alloc(bmap
->ctx
, total
);
1898 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_param
, pos
= 0);
1899 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_in
, pos
+= nparam
);
1900 isl_dim_map_div(dim_map
, bmap
, pos
+= n_in
+ n_out
);
1901 isl_dim_map_dim(dim_map
, bmap
->dim
, isl_dim_out
, pos
+= bmap
->n_div
);
1903 result
= isl_basic_map_alloc_dim(isl_dim_copy(bmap
->dim
),
1904 bmap
->n_div
+ n_out
,
1905 bmap
->n_eq
, bmap
->n_ineq
+ 2 * n_out
);
1906 result
= add_constraints_dim_map(result
, bmap
, dim_map
);
1907 result
= add_divs(result
, n_out
);
1908 for (i
= 0; i
< n_out
; ++i
) {
1910 j
= isl_basic_map_alloc_inequality(result
);
1913 isl_seq_clr(result
->ineq
[j
], 1+total
);
1914 isl_int_neg(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
1915 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], 1);
1916 j
= isl_basic_map_alloc_inequality(result
);
1919 isl_seq_clr(result
->ineq
[j
], 1+total
);
1920 isl_int_set(result
->ineq
[j
][1+nparam
+n_in
+i
], d
);
1921 isl_int_set_si(result
->ineq
[j
][1+pos
+i
], -1);
1922 isl_int_sub_ui(result
->ineq
[j
][0], d
, 1);
1925 result
= isl_basic_map_simplify(result
);
1926 return isl_basic_map_finalize(result
);
1928 isl_basic_map_free(result
);
1932 static struct isl_basic_map
*var_equal(struct isl_ctx
*ctx
,
1933 struct isl_basic_map
*bmap
, unsigned pos
)
1939 i
= isl_basic_map_alloc_equality(bmap
);
1942 nparam
= isl_basic_map_n_param(bmap
);
1943 n_in
= isl_basic_map_n_in(bmap
);
1944 isl_seq_clr(bmap
->eq
[i
], 1 + isl_basic_map_total_dim(bmap
));
1945 isl_int_set_si(bmap
->eq
[i
][1+nparam
+pos
], -1);
1946 isl_int_set_si(bmap
->eq
[i
][1+nparam
+n_in
+pos
], 1);
1947 return isl_basic_map_finalize(bmap
);
1949 isl_basic_map_free(bmap
);
1953 static struct isl_basic_map
*var_more(struct isl_ctx
*ctx
,
1954 struct isl_basic_map
*bmap
, unsigned pos
)
1960 i
= isl_basic_map_alloc_inequality(bmap
);
1963 nparam
= isl_basic_map_n_param(bmap
);
1964 n_in
= isl_basic_map_n_in(bmap
);
1965 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
1966 isl_int_set_si(bmap
->ineq
[i
][0], -1);
1967 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], -1);
1968 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], 1);
1969 return isl_basic_map_finalize(bmap
);
1971 isl_basic_map_free(bmap
);
1975 static struct isl_basic_map
*var_less(struct isl_ctx
*ctx
,
1976 struct isl_basic_map
*bmap
, unsigned pos
)
1982 i
= isl_basic_map_alloc_inequality(bmap
);
1985 nparam
= isl_basic_map_n_param(bmap
);
1986 n_in
= isl_basic_map_n_in(bmap
);
1987 isl_seq_clr(bmap
->ineq
[i
], 1 + isl_basic_map_total_dim(bmap
));
1988 isl_int_set_si(bmap
->ineq
[i
][0], -1);
1989 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+pos
], 1);
1990 isl_int_set_si(bmap
->ineq
[i
][1+nparam
+n_in
+pos
], -1);
1991 return isl_basic_map_finalize(bmap
);
1993 isl_basic_map_free(bmap
);
1997 struct isl_basic_map
*isl_basic_map_equal(struct isl_ctx
*ctx
,
1998 unsigned nparam
, unsigned in
, unsigned out
, unsigned n_equal
)
2001 struct isl_basic_map
*bmap
;
2002 bmap
= isl_basic_map_alloc(ctx
, nparam
, in
, out
, 0, n_equal
, 0);
2005 for (i
= 0; i
< n_equal
&& bmap
; ++i
)
2006 bmap
= var_equal(ctx
, bmap
, i
);
2007 return isl_basic_map_finalize(bmap
);
2010 struct isl_basic_map
*isl_basic_map_less_at(struct isl_ctx
*ctx
,
2011 unsigned nparam
, unsigned in
, unsigned out
, unsigned pos
)
2014 struct isl_basic_map
*bmap
;
2015 bmap
= isl_basic_map_alloc(ctx
, nparam
, in
, out
, 0, pos
, 1);
2018 for (i
= 0; i
< pos
&& bmap
; ++i
)
2019 bmap
= var_equal(ctx
, bmap
, i
);
2021 bmap
= var_less(ctx
, bmap
, pos
);
2022 return isl_basic_map_finalize(bmap
);
2025 struct isl_basic_map
*isl_basic_map_more_at(struct isl_ctx
*ctx
,
2026 unsigned nparam
, unsigned in
, unsigned out
, unsigned pos
)
2029 struct isl_basic_map
*bmap
;
2030 bmap
= isl_basic_map_alloc(ctx
, nparam
, in
, out
, 0, pos
, 1);
2033 for (i
= 0; i
< pos
&& bmap
; ++i
)
2034 bmap
= var_equal(ctx
, bmap
, i
);
2036 bmap
= var_more(ctx
, bmap
, pos
);
2037 return isl_basic_map_finalize(bmap
);
2040 struct isl_basic_map
*isl_basic_map_from_basic_set(
2041 struct isl_basic_set
*bset
, struct isl_dim
*dim
)
2043 struct isl_basic_map
*bmap
;
2045 bset
= isl_basic_set_cow(bset
);
2049 isl_assert(bset
->ctx
, isl_dim_compatible(bset
->dim
, dim
), goto error
);
2050 isl_dim_free(bset
->dim
);
2051 bmap
= (struct isl_basic_map
*) bset
;
2053 return isl_basic_map_finalize(bmap
);
2055 isl_basic_set_free(bset
);
2060 struct isl_basic_set
*isl_basic_set_from_basic_map(struct isl_basic_map
*bmap
)
2064 if (bmap
->dim
->n_in
== 0)
2065 return (struct isl_basic_set
*)bmap
;
2066 bmap
= isl_basic_map_cow(bmap
);
2069 bmap
->dim
= isl_dim_cow(bmap
->dim
);
2072 bmap
->dim
->n_out
+= bmap
->dim
->n_in
;
2073 bmap
->dim
->n_in
= 0;
2074 bmap
= isl_basic_map_finalize(bmap
);
2075 return (struct isl_basic_set
*)bmap
;
2077 isl_basic_map_free(bmap
);
2081 /* For a div d = floor(f/m), add the constraints
2084 * -(f-(n-1)) + m d >= 0
2086 * Note that the second constraint is the negation of
2090 static int add_div_constraints(struct isl_basic_map
*bmap
, unsigned div
)
2093 unsigned total
= isl_basic_map_total_dim(bmap
);
2094 unsigned div_pos
= 1 + total
- bmap
->n_div
+ div
;
2096 i
= isl_basic_map_alloc_inequality(bmap
);
2099 isl_seq_cpy(bmap
->ineq
[i
], bmap
->div
[div
]+1, 1+total
);
2100 isl_int_neg(bmap
->ineq
[i
][div_pos
], bmap
->div
[div
][0]);
2102 j
= isl_basic_map_alloc_inequality(bmap
);
2105 isl_seq_neg(bmap
->ineq
[j
], bmap
->ineq
[i
], 1 + total
);
2106 isl_int_add(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], bmap
->ineq
[j
][div_pos
]);
2107 isl_int_sub_ui(bmap
->ineq
[j
][0], bmap
->ineq
[j
][0], 1);
2111 struct isl_basic_set
*isl_basic_map_underlying_set(
2112 struct isl_basic_map
*bmap
)
2116 if (bmap
->dim
->nparam
== 0 && bmap
->dim
->n_in
== 0 && bmap
->n_div
== 0)
2117 return (struct isl_basic_set
*)bmap
;
2118 bmap
= isl_basic_map_cow(bmap
);
2121 bmap
->dim
= isl_dim_underlying(bmap
->dim
, bmap
->n_div
);
2124 bmap
->extra
-= bmap
->n_div
;
2126 bmap
= isl_basic_map_finalize(bmap
);
2127 return (struct isl_basic_set
*)bmap
;
2132 struct isl_basic_map
*isl_basic_map_overlying_set(
2133 struct isl_basic_set
*bset
, struct isl_basic_map
*like
)
2135 struct isl_basic_map
*bmap
;
2136 struct isl_ctx
*ctx
;
2143 isl_assert(ctx
, bset
->n_div
== 0, goto error
);
2144 isl_assert(ctx
, isl_basic_set_n_param(bset
) == 0, goto error
);
2145 isl_assert(ctx
, bset
->dim
->n_out
== isl_basic_map_total_dim(like
),
2147 if (isl_dim_equal(bset
->dim
, like
->dim
) && like
->n_div
== 0) {
2148 isl_basic_map_free(like
);
2149 return (struct isl_basic_map
*)bset
;
2151 bset
= isl_basic_set_cow(bset
);
2154 total
= bset
->dim
->n_out
+ bset
->extra
;
2155 bmap
= (struct isl_basic_map
*)bset
;
2156 isl_dim_free(bmap
->dim
);
2157 bmap
->dim
= isl_dim_copy(like
->dim
);
2160 bmap
->n_div
= like
->n_div
;
2161 bmap
->extra
+= like
->n_div
;
2164 ltotal
= total
- bmap
->extra
+ like
->extra
;
2167 bmap
->block2
= isl_blk_extend(ctx
, bmap
->block2
,
2168 bmap
->extra
* (1 + 1 + total
));
2169 if (isl_blk_is_error(bmap
->block2
))
2171 bmap
->div
= isl_realloc_array(ctx
, bmap
->div
, isl_int
*,
2175 for (i
= 0; i
< bmap
->extra
; ++i
)
2176 bmap
->div
[i
] = bmap
->block2
.data
+ i
* (1 + 1 + total
);
2177 for (i
= 0; i
< like
->n_div
; ++i
) {
2178 isl_seq_cpy(bmap
->div
[i
], like
->div
[i
], 1 + 1 + ltotal
);
2179 isl_seq_clr(bmap
->div
[i
]+1+1+ltotal
, total
- ltotal
);
2181 bmap
= isl_basic_map_extend_constraints(bmap
,
2182 0, 2 * like
->n_div
);
2183 for (i
= 0; i
< like
->n_div
; ++i
) {
2184 if (isl_int_is_zero(bmap
->div
[i
][0]))
2186 if (add_div_constraints(bmap
, i
) < 0)
2190 isl_basic_map_free(like
);
2191 bmap
= isl_basic_map_simplify(bmap
);
2192 bmap
= isl_basic_map_finalize(bmap
);
2195 isl_basic_map_free(like
);
2196 isl_basic_set_free(bset
);
2200 struct isl_basic_set
*isl_basic_set_from_underlying_set(
2201 struct isl_basic_set
*bset
, struct isl_basic_set
*like
)
2203 return (struct isl_basic_set
*)
2204 isl_basic_map_overlying_set(bset
, (struct isl_basic_map
*)like
);
2207 struct isl_set
*isl_set_from_underlying_set(
2208 struct isl_set
*set
, struct isl_basic_set
*like
)
2214 isl_assert(set
->ctx
, set
->dim
->n_out
== isl_basic_set_total_dim(like
),
2216 if (isl_dim_equal(set
->dim
, like
->dim
) && like
->n_div
== 0) {
2217 isl_basic_set_free(like
);
2220 set
= isl_set_cow(set
);
2223 for (i
= 0; i
< set
->n
; ++i
) {
2224 set
->p
[i
] = isl_basic_set_from_underlying_set(set
->p
[i
],
2225 isl_basic_set_copy(like
));
2229 isl_dim_free(set
->dim
);
2230 set
->dim
= isl_dim_copy(like
->dim
);
2233 isl_basic_set_free(like
);
2236 isl_basic_set_free(like
);
2241 struct isl_set
*isl_map_underlying_set(struct isl_map
*map
)
2245 map
= isl_map_cow(map
);
2248 map
->dim
= isl_dim_cow(map
->dim
);
2252 for (i
= 1; i
< map
->n
; ++i
)
2253 isl_assert(map
->ctx
, map
->p
[0]->n_div
== map
->p
[i
]->n_div
,
2255 for (i
= 0; i
< map
->n
; ++i
) {
2256 map
->p
[i
] = (struct isl_basic_map
*)
2257 isl_basic_map_underlying_set(map
->p
[i
]);
2262 map
->dim
= isl_dim_underlying(map
->dim
, 0);
2264 isl_dim_free(map
->dim
);
2265 map
->dim
= isl_dim_copy(map
->p
[0]->dim
);
2269 return (struct isl_set
*)map
;
2275 struct isl_set
*isl_set_to_underlying_set(struct isl_set
*set
)
2277 return (struct isl_set
*)isl_map_underlying_set((struct isl_map
*)set
);
2280 struct isl_basic_set
*isl_basic_map_domain(struct isl_basic_map
*bmap
)
2282 struct isl_basic_set
*domain
;
2286 n_out
= isl_basic_map_n_out(bmap
);
2287 domain
= isl_basic_set_from_basic_map(bmap
);
2288 return isl_basic_set_project_out(domain
, n_out
, 0);
2291 struct isl_basic_set
*isl_basic_map_range(struct isl_basic_map
*bmap
)
2293 return isl_basic_map_domain(isl_basic_map_reverse(bmap
));
2296 struct isl_set
*isl_map_range(struct isl_map
*map
)
2299 struct isl_set
*set
;
2303 map
= isl_map_cow(map
);
2307 set
= (struct isl_set
*) map
;
2308 if (set
->dim
->n_in
!= 0) {
2309 set
->dim
= isl_dim_drop_inputs(set
->dim
, 0, set
->dim
->n_in
);
2313 for (i
= 0; i
< map
->n
; ++i
) {
2314 set
->p
[i
] = isl_basic_map_range(map
->p
[i
]);
2318 F_CLR(set
, ISL_MAP_DISJOINT
);
2319 F_CLR(set
, ISL_SET_NORMALIZED
);
2326 struct isl_map
*isl_map_from_set(struct isl_set
*set
, struct isl_dim
*dim
)
2329 struct isl_map
*map
= NULL
;
2331 set
= isl_set_cow(set
);
2334 isl_assert(set
->ctx
, isl_dim_compatible(set
->dim
, dim
), goto error
);
2335 map
= (struct isl_map
*)set
;
2336 for (i
= 0; i
< set
->n
; ++i
) {
2337 map
->p
[i
] = isl_basic_map_from_basic_set(
2338 set
->p
[i
], isl_dim_copy(dim
));
2342 isl_dim_free(map
->dim
);
2351 struct isl_set
*isl_set_from_map(struct isl_map
*map
)
2354 struct isl_set
*set
= NULL
;
2358 map
= isl_map_cow(map
);
2361 map
->dim
= isl_dim_cow(map
->dim
);
2364 map
->dim
->n_out
+= map
->dim
->n_in
;
2366 set
= (struct isl_set
*)map
;
2367 for (i
= 0; i
< map
->n
; ++i
) {
2368 set
->p
[i
] = isl_basic_set_from_basic_map(map
->p
[i
]);
2378 struct isl_map
*isl_map_alloc_dim(struct isl_dim
*dim
, int n
, unsigned flags
)
2380 struct isl_map
*map
;
2384 isl_assert(dim
->ctx
, n
>= 0, return NULL
);
2385 map
= isl_alloc(dim
->ctx
, struct isl_map
,
2386 sizeof(struct isl_map
) +
2387 n
* sizeof(struct isl_basic_map
*));
2391 map
->ctx
= dim
->ctx
;
2392 isl_ctx_ref(map
->ctx
);
2404 struct isl_map
*isl_map_alloc(struct isl_ctx
*ctx
,
2405 unsigned nparam
, unsigned in
, unsigned out
, int n
,
2408 struct isl_map
*map
;
2409 struct isl_dim
*dims
;
2411 dims
= isl_dim_alloc(ctx
, nparam
, in
, out
);
2415 map
= isl_map_alloc_dim(dims
, n
, flags
);
2419 struct isl_basic_map
*isl_basic_map_empty(struct isl_ctx
*ctx
,
2420 unsigned nparam
, unsigned in
, unsigned out
)
2422 struct isl_basic_map
*bmap
;
2423 bmap
= isl_basic_map_alloc(ctx
, nparam
, in
, out
, 0, 1, 0);
2424 bmap
= isl_basic_map_set_to_empty(bmap
);
2428 struct isl_basic_set
*isl_basic_set_empty(struct isl_dim
*dim
)
2430 struct isl_basic_set
*bset
;
2431 bset
= isl_basic_set_alloc_dim(dim
, 0, 1, 0);
2432 bset
= isl_basic_set_set_to_empty(bset
);
2436 struct isl_basic_map
*isl_basic_map_empty_like(struct isl_basic_map
*model
)
2438 struct isl_basic_map
*bmap
;
2441 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2442 bmap
= isl_basic_map_set_to_empty(bmap
);
2446 struct isl_basic_map
*isl_basic_map_empty_like_map(struct isl_map
*model
)
2448 struct isl_basic_map
*bmap
;
2451 bmap
= isl_basic_map_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2452 bmap
= isl_basic_map_set_to_empty(bmap
);
2456 struct isl_basic_set
*isl_basic_set_empty_like(struct isl_basic_set
*model
)
2458 struct isl_basic_set
*bset
;
2461 bset
= isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 1, 0);
2462 bset
= isl_basic_set_set_to_empty(bset
);
2466 struct isl_basic_map
*isl_basic_map_universe(struct isl_dim
*dim
)
2468 struct isl_basic_map
*bmap
;
2469 bmap
= isl_basic_map_alloc_dim(dim
, 0, 0, 0);
2473 struct isl_basic_set
*isl_basic_set_universe(struct isl_dim
*dim
)
2475 struct isl_basic_set
*bset
;
2476 bset
= isl_basic_set_alloc_dim(dim
, 0, 0, 0);
2480 struct isl_basic_set
*isl_basic_set_universe_like(struct isl_basic_set
*model
)
2484 return isl_basic_set_alloc_dim(isl_dim_copy(model
->dim
), 0, 0, 0);
2487 struct isl_map
*isl_map_empty(struct isl_dim
*dim
)
2489 return isl_map_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2492 struct isl_map
*isl_map_empty_like(struct isl_map
*model
)
2496 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2499 struct isl_map
*isl_map_empty_like_basic_map(struct isl_basic_map
*model
)
2503 return isl_map_alloc_dim(isl_dim_copy(model
->dim
), 0, ISL_MAP_DISJOINT
);
2506 struct isl_set
*isl_set_empty(struct isl_dim
*dim
)
2508 return isl_set_alloc_dim(dim
, 0, ISL_MAP_DISJOINT
);
2511 struct isl_set
*isl_set_empty_like(struct isl_set
*model
)
2515 return isl_set_empty(isl_dim_copy(model
->dim
));
2518 struct isl_set
*isl_set_universe(struct isl_dim
*dim
)
2520 struct isl_set
*set
;
2523 set
= isl_set_alloc_dim(isl_dim_copy(dim
), 1, ISL_MAP_DISJOINT
);
2524 set
= isl_set_add(set
, isl_basic_set_universe(dim
));
2528 struct isl_map
*isl_map_dup(struct isl_map
*map
)
2531 struct isl_map
*dup
;
2535 dup
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), map
->n
, map
->flags
);
2536 for (i
= 0; i
< map
->n
; ++i
)
2537 dup
= isl_map_add(dup
, isl_basic_map_copy(map
->p
[i
]));
2541 struct isl_map
*isl_map_add(struct isl_map
*map
, struct isl_basic_map
*bmap
)
2545 isl_assert(map
->ctx
, isl_dim_equal(map
->dim
, bmap
->dim
), goto error
);
2546 isl_assert(map
->ctx
, map
->n
< map
->size
, goto error
);
2547 map
->p
[map
->n
] = bmap
;
2549 F_CLR(map
, ISL_MAP_NORMALIZED
);
2555 isl_basic_map_free(bmap
);
2559 void isl_map_free(struct isl_map
*map
)
2569 isl_ctx_deref(map
->ctx
);
2570 for (i
= 0; i
< map
->n
; ++i
)
2571 isl_basic_map_free(map
->p
[i
]);
2572 isl_dim_free(map
->dim
);
2576 struct isl_map
*isl_map_extend(struct isl_map
*base
,
2577 unsigned nparam
, unsigned n_in
, unsigned n_out
)
2581 base
= isl_map_cow(base
);
2585 base
->dim
= isl_dim_extend(base
->dim
, nparam
, n_in
, n_out
);
2588 for (i
= 0; i
< base
->n
; ++i
) {
2589 base
->p
[i
] = isl_basic_map_extend_dim(base
->p
[i
],
2590 isl_dim_copy(base
->dim
), 0, 0, 0);
2600 struct isl_set
*isl_set_extend(struct isl_set
*base
,
2601 unsigned nparam
, unsigned dim
)
2603 return (struct isl_set
*)isl_map_extend((struct isl_map
*)base
,
2607 static struct isl_basic_map
*isl_basic_map_fix_pos(struct isl_basic_map
*bmap
,
2608 unsigned pos
, int value
)
2612 bmap
= isl_basic_map_cow(bmap
);
2613 bmap
= isl_basic_map_extend_constraints(bmap
, 1, 0);
2614 j
= isl_basic_map_alloc_equality(bmap
);
2617 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
2618 isl_int_set_si(bmap
->eq
[j
][pos
], -1);
2619 isl_int_set_si(bmap
->eq
[j
][0], value
);
2620 bmap
= isl_basic_map_simplify(bmap
);
2621 return isl_basic_map_finalize(bmap
);
2623 isl_basic_map_free(bmap
);
2627 struct isl_basic_map
*isl_basic_map_fix_si(struct isl_basic_map
*bmap
,
2628 enum isl_dim_type type
, unsigned pos
, int value
)
2632 isl_assert(bmap
->ctx
, pos
< isl_basic_map_dim(bmap
, type
), goto error
);
2633 return isl_basic_map_fix_pos(bmap
, basic_map_offset(bmap
, type
) + pos
,
2636 isl_basic_map_free(bmap
);
2640 struct isl_basic_set
*isl_basic_set_fix_si(struct isl_basic_set
*bset
,
2641 enum isl_dim_type type
, unsigned pos
, int value
)
2643 return (struct isl_basic_set
*)
2644 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2648 struct isl_basic_map
*isl_basic_map_fix_input_si(struct isl_basic_map
*bmap
,
2649 unsigned input
, int value
)
2651 return isl_basic_map_fix_si(bmap
, isl_dim_in
, input
, value
);
2654 struct isl_basic_set
*isl_basic_set_fix_dim_si(struct isl_basic_set
*bset
,
2655 unsigned dim
, int value
)
2657 return (struct isl_basic_set
*)
2658 isl_basic_map_fix_si((struct isl_basic_map
*)bset
,
2659 isl_dim_set
, dim
, value
);
2662 struct isl_map
*isl_map_fix_si(struct isl_map
*map
,
2663 enum isl_dim_type type
, unsigned pos
, int value
)
2667 map
= isl_map_cow(map
);
2671 isl_assert(ctx
, pos
< isl_map_dim(map
, type
), goto error
);
2672 for (i
= 0; i
< map
->n
; ++i
) {
2673 map
->p
[i
] = isl_basic_map_fix_si(map
->p
[i
], type
, pos
, value
);
2677 F_CLR(map
, ISL_MAP_NORMALIZED
);
2684 struct isl_map
*isl_map_fix_input_si(struct isl_map
*map
,
2685 unsigned input
, int value
)
2687 return isl_map_fix_si(map
, isl_dim_in
, input
, value
);
2690 struct isl_set
*isl_set_fix_dim_si(struct isl_set
*set
, unsigned dim
, int value
)
2692 return (struct isl_set
*)
2693 isl_map_fix_si((struct isl_map
*)set
, isl_dim_set
, dim
, value
);
2696 struct isl_basic_set
*isl_basic_set_lower_bound_dim(struct isl_basic_set
*bset
,
2697 unsigned dim
, isl_int value
)
2702 bset
= isl_basic_set_cow(bset
);
2703 bset
= isl_basic_set_extend_constraints(bset
, 0, 1);
2704 j
= isl_basic_set_alloc_inequality(bset
);
2707 isl_seq_clr(bset
->ineq
[j
], 1 + isl_basic_set_total_dim(bset
));
2708 isl_int_set_si(bset
->ineq
[j
][1 + isl_basic_set_n_param(bset
) + dim
], 1);
2709 isl_int_neg(bset
->ineq
[j
][0], value
);
2710 bset
= isl_basic_set_simplify(bset
);
2711 return isl_basic_set_finalize(bset
);
2713 isl_basic_set_free(bset
);
2717 struct isl_set
*isl_set_lower_bound_dim(struct isl_set
*set
, unsigned dim
,
2722 set
= isl_set_cow(set
);
2726 isl_assert(set
->ctx
, dim
< isl_set_n_dim(set
), goto error
);
2727 for (i
= 0; i
< set
->n
; ++i
) {
2728 set
->p
[i
] = isl_basic_set_lower_bound_dim(set
->p
[i
], dim
, value
);
2738 struct isl_map
*isl_map_reverse(struct isl_map
*map
)
2743 map
= isl_map_cow(map
);
2747 map
->dim
= isl_dim_reverse(map
->dim
);
2750 for (i
= 0; i
< map
->n
; ++i
) {
2751 map
->p
[i
] = isl_basic_map_reverse(map
->p
[i
]);
2755 F_CLR(map
, ISL_MAP_NORMALIZED
);
2762 struct isl_map
*isl_basic_map_lexmax(
2763 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2764 struct isl_set
**empty
)
2766 return isl_pip_basic_map_lexmax(bmap
, dom
, empty
);
2769 struct isl_map
*isl_basic_map_lexmin(
2770 struct isl_basic_map
*bmap
, struct isl_basic_set
*dom
,
2771 struct isl_set
**empty
)
2773 return isl_pip_basic_map_lexmin(bmap
, dom
, empty
);
2776 struct isl_set
*isl_basic_set_lexmin(struct isl_basic_set
*bset
)
2778 struct isl_basic_map
*bmap
= NULL
;
2779 struct isl_basic_set
*dom
= NULL
;
2780 struct isl_map
*min
;
2781 struct isl_dim
*param_dim
;
2785 bmap
= isl_basic_map_from_basic_set(bset
, isl_dim_copy(bset
->dim
));
2788 param_dim
= isl_dim_domain(isl_dim_copy(bmap
->dim
));
2789 dom
= isl_basic_set_universe(param_dim
);
2792 min
= isl_basic_map_lexmin(bmap
, dom
, NULL
);
2793 return isl_map_range(min
);
2795 isl_basic_map_free(bmap
);
2799 struct isl_map
*isl_basic_map_compute_divs(struct isl_basic_map
*bmap
)
2806 off
= isl_dim_total(bmap
->dim
);
2807 for (i
= 0; i
< bmap
->n_div
; ++i
) {
2808 if (isl_int_is_zero(bmap
->div
[i
][0]))
2809 return isl_pip_basic_map_compute_divs(bmap
);
2810 isl_assert(bmap
->ctx
, isl_int_is_zero(bmap
->div
[i
][1+1+off
+i
]),
2813 return isl_map_from_basic_map(bmap
);
2815 isl_basic_map_free(bmap
);
2819 struct isl_map
*isl_map_compute_divs(struct isl_map
*map
)
2822 struct isl_map
*res
;
2828 res
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[0]));
2829 for (i
= 1 ; i
< map
->n
; ++i
) {
2831 r2
= isl_basic_map_compute_divs(isl_basic_map_copy(map
->p
[i
]));
2832 if (F_ISSET(map
, ISL_MAP_DISJOINT
))
2833 res
= isl_map_union_disjoint(res
, r2
);
2835 res
= isl_map_union(res
, r2
);
2842 struct isl_set
*isl_basic_set_compute_divs(struct isl_basic_set
*bset
)
2844 return (struct isl_set
*)
2845 isl_basic_map_compute_divs((struct isl_basic_map
*)bset
);
2848 struct isl_set
*isl_set_compute_divs(struct isl_set
*set
)
2850 return (struct isl_set
*)
2851 isl_map_compute_divs((struct isl_map
*)set
);
2854 struct isl_set
*isl_map_domain(struct isl_map
*map
)
2857 struct isl_set
*set
;
2862 map
= isl_map_cow(map
);
2866 set
= (struct isl_set
*)map
;
2867 set
->dim
= isl_dim_domain(set
->dim
);
2870 for (i
= 0; i
< map
->n
; ++i
) {
2871 set
->p
[i
] = isl_basic_map_domain(map
->p
[i
]);
2875 F_CLR(set
, ISL_MAP_DISJOINT
);
2876 F_CLR(set
, ISL_SET_NORMALIZED
);
2883 struct isl_map
*isl_map_union_disjoint(
2884 struct isl_map
*map1
, struct isl_map
*map2
)
2888 struct isl_map
*map
= NULL
;
2902 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
2904 if (F_ISSET(map1
, ISL_MAP_DISJOINT
) &&
2905 F_ISSET(map2
, ISL_MAP_DISJOINT
))
2906 FL_SET(flags
, ISL_MAP_DISJOINT
);
2908 map
= isl_map_alloc_dim(isl_dim_copy(map1
->dim
),
2909 map1
->n
+ map2
->n
, flags
);
2912 for (i
= 0; i
< map1
->n
; ++i
) {
2913 map
= isl_map_add(map
,
2914 isl_basic_map_copy(map1
->p
[i
]));
2918 for (i
= 0; i
< map2
->n
; ++i
) {
2919 map
= isl_map_add(map
,
2920 isl_basic_map_copy(map2
->p
[i
]));
2934 struct isl_map
*isl_map_union(struct isl_map
*map1
, struct isl_map
*map2
)
2936 map1
= isl_map_union_disjoint(map1
, map2
);
2940 F_CLR(map1
, ISL_MAP_DISJOINT
);
2944 struct isl_set
*isl_set_union_disjoint(
2945 struct isl_set
*set1
, struct isl_set
*set2
)
2947 return (struct isl_set
*)
2948 isl_map_union_disjoint(
2949 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
2952 struct isl_set
*isl_set_union(struct isl_set
*set1
, struct isl_set
*set2
)
2954 return (struct isl_set
*)
2955 isl_map_union((struct isl_map
*)set1
, (struct isl_map
*)set2
);
2958 struct isl_map
*isl_map_intersect_range(
2959 struct isl_map
*map
, struct isl_set
*set
)
2962 struct isl_map
*result
;
2968 if (F_ISSET(map
, ISL_MAP_DISJOINT
) &&
2969 F_ISSET(set
, ISL_MAP_DISJOINT
))
2970 FL_SET(flags
, ISL_MAP_DISJOINT
);
2972 result
= isl_map_alloc_dim(isl_dim_copy(map
->dim
),
2973 map
->n
* set
->n
, flags
);
2976 for (i
= 0; i
< map
->n
; ++i
)
2977 for (j
= 0; j
< set
->n
; ++j
) {
2978 result
= isl_map_add(result
,
2979 isl_basic_map_intersect_range(
2980 isl_basic_map_copy(map
->p
[i
]),
2981 isl_basic_set_copy(set
->p
[j
])));
2994 struct isl_map
*isl_map_intersect_domain(
2995 struct isl_map
*map
, struct isl_set
*set
)
2997 return isl_map_reverse(
2998 isl_map_intersect_range(isl_map_reverse(map
), set
));
3001 struct isl_map
*isl_map_apply_domain(
3002 struct isl_map
*map1
, struct isl_map
*map2
)
3006 map1
= isl_map_reverse(map1
);
3007 map1
= isl_map_apply_range(map1
, map2
);
3008 return isl_map_reverse(map1
);
3015 struct isl_map
*isl_map_apply_range(
3016 struct isl_map
*map1
, struct isl_map
*map2
)
3018 struct isl_dim
*dim_result
;
3019 struct isl_map
*result
;
3028 dim_result
= isl_dim_join(isl_dim_copy(map1
->dim
),
3029 isl_dim_copy(map2
->dim
));
3031 result
= isl_map_alloc_dim(dim_result
, map1
->n
* map2
->n
, 0);
3034 for (i
= 0; i
< map1
->n
; ++i
)
3035 for (j
= 0; j
< map2
->n
; ++j
) {
3036 result
= isl_map_add(result
,
3037 isl_basic_map_apply_range(
3038 isl_basic_map_copy(map1
->p
[i
]),
3039 isl_basic_map_copy(map2
->p
[j
])));
3045 if (result
&& result
->n
<= 1)
3046 F_SET(result
, ISL_MAP_DISJOINT
);
3055 * returns range - domain
3057 struct isl_basic_set
*isl_basic_map_deltas(struct isl_basic_map
*bmap
)
3059 struct isl_basic_set
*bset
;
3066 dim
= isl_basic_map_n_in(bmap
);
3067 nparam
= isl_basic_map_n_param(bmap
);
3068 isl_assert(bmap
->ctx
, dim
== isl_basic_map_n_out(bmap
), goto error
);
3069 bset
= isl_basic_set_from_basic_map(bmap
);
3070 bset
= isl_basic_set_extend(bset
, nparam
, 3*dim
, 0, dim
, 0);
3071 bset
= isl_basic_set_swap_vars(bset
, 2*dim
);
3072 for (i
= 0; i
< dim
; ++i
) {
3073 int j
= isl_basic_map_alloc_equality(
3074 (struct isl_basic_map
*)bset
);
3077 isl_seq_clr(bset
->eq
[j
], 1 + isl_basic_set_total_dim(bset
));
3078 isl_int_set_si(bset
->eq
[j
][1+nparam
+i
], 1);
3079 isl_int_set_si(bset
->eq
[j
][1+nparam
+dim
+i
], 1);
3080 isl_int_set_si(bset
->eq
[j
][1+nparam
+2*dim
+i
], -1);
3082 return isl_basic_set_project_out(bset
, 2*dim
, 0);
3084 isl_basic_map_free(bmap
);
3089 * returns range - domain
3091 struct isl_set
*isl_map_deltas(struct isl_map
*map
)
3094 struct isl_set
*result
;
3099 isl_assert(map
->ctx
, isl_map_n_in(map
) == isl_map_n_out(map
), goto error
);
3100 result
= isl_set_alloc(map
->ctx
, isl_map_n_param(map
),
3101 isl_map_n_in(map
), map
->n
, map
->flags
);
3104 for (i
= 0; i
< map
->n
; ++i
)
3105 result
= isl_set_add(result
,
3106 isl_basic_map_deltas(isl_basic_map_copy(map
->p
[i
])));
3114 static struct isl_basic_map
*basic_map_identity(struct isl_dim
*dims
)
3116 struct isl_basic_map
*bmap
;
3124 nparam
= dims
->nparam
;
3126 bmap
= isl_basic_map_alloc_dim(dims
, 0, dim
, 0);
3130 for (i
= 0; i
< dim
; ++i
) {
3131 int j
= isl_basic_map_alloc_equality(bmap
);
3134 isl_seq_clr(bmap
->eq
[j
], 1 + isl_basic_map_total_dim(bmap
));
3135 isl_int_set_si(bmap
->eq
[j
][1+nparam
+i
], 1);
3136 isl_int_set_si(bmap
->eq
[j
][1+nparam
+dim
+i
], -1);
3138 return isl_basic_map_finalize(bmap
);
3140 isl_basic_map_free(bmap
);
3144 struct isl_basic_map
*isl_basic_map_identity(struct isl_dim
*set_dim
)
3146 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3149 return basic_map_identity(dim
);
3152 struct isl_basic_map
*isl_basic_map_identity_like(struct isl_basic_map
*model
)
3154 if (!model
|| !model
->dim
)
3156 isl_assert(model
->ctx
,
3157 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3158 return basic_map_identity(isl_dim_copy(model
->dim
));
3161 static struct isl_map
*map_identity(struct isl_dim
*dim
)
3163 struct isl_map
*map
= isl_map_alloc_dim(dim
, 1, ISL_MAP_DISJOINT
);
3164 return isl_map_add(map
, basic_map_identity(isl_dim_copy(dim
)));
3167 struct isl_map
*isl_map_identity(struct isl_dim
*set_dim
)
3169 struct isl_dim
*dim
= isl_dim_map(set_dim
);
3172 return map_identity(dim
);
3175 struct isl_map
*isl_map_identity_like(struct isl_basic_map
*model
)
3177 if (!model
|| !model
->dim
)
3179 isl_assert(model
->ctx
,
3180 model
->dim
->n_in
== model
->dim
->n_out
, return NULL
);
3181 return map_identity(isl_dim_copy(model
->dim
));
3184 int isl_set_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
3186 return isl_map_is_equal((struct isl_map
*)set1
, (struct isl_map
*)set2
);
3189 int isl_set_is_subset(struct isl_set
*set1
, struct isl_set
*set2
)
3191 return isl_map_is_subset(
3192 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3195 int isl_basic_map_is_subset(
3196 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3199 struct isl_map
*map1
;
3200 struct isl_map
*map2
;
3202 if (!bmap1
|| !bmap2
)
3205 map1
= isl_map_from_basic_map(isl_basic_map_copy(bmap1
));
3206 map2
= isl_map_from_basic_map(isl_basic_map_copy(bmap2
));
3208 is_subset
= isl_map_is_subset(map1
, map2
);
3216 int isl_basic_map_is_equal(
3217 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3221 if (!bmap1
|| !bmap2
)
3223 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3226 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3230 int isl_basic_set_is_equal(
3231 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3233 return isl_basic_map_is_equal(
3234 (struct isl_basic_map
*)bset1
, (struct isl_basic_map
*)bset2
);
3237 int isl_map_is_empty(struct isl_map
*map
)
3244 for (i
= 0; i
< map
->n
; ++i
) {
3245 is_empty
= isl_basic_map_is_empty(map
->p
[i
]);
3254 int isl_map_fast_is_empty(struct isl_map
*map
)
3259 int isl_set_is_empty(struct isl_set
*set
)
3261 return isl_map_is_empty((struct isl_map
*)set
);
3264 int isl_map_is_subset(struct isl_map
*map1
, struct isl_map
*map2
)
3268 struct isl_map
*diff
;
3273 if (isl_map_is_empty(map1
))
3276 if (isl_map_is_empty(map2
))
3279 diff
= isl_map_subtract(isl_map_copy(map1
), isl_map_copy(map2
));
3283 is_subset
= isl_map_is_empty(diff
);
3289 int isl_map_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
3295 is_subset
= isl_map_is_subset(map1
, map2
);
3298 is_subset
= isl_map_is_subset(map2
, map1
);
3302 int isl_basic_map_is_strict_subset(
3303 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3307 if (!bmap1
|| !bmap2
)
3309 is_subset
= isl_basic_map_is_subset(bmap1
, bmap2
);
3312 is_subset
= isl_basic_map_is_subset(bmap2
, bmap1
);
3313 if (is_subset
== -1)
3318 static int basic_map_contains(struct isl_basic_map
*bmap
, struct isl_vec
*vec
)
3324 total
= 1 + isl_basic_map_total_dim(bmap
);
3325 if (total
!= vec
->size
)
3330 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3331 isl_seq_inner_product(vec
->block
.data
, bmap
->eq
[i
], total
, &s
);
3332 if (!isl_int_is_zero(s
)) {
3338 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3339 isl_seq_inner_product(vec
->block
.data
, bmap
->ineq
[i
], total
, &s
);
3340 if (isl_int_is_neg(s
)) {
3351 int isl_basic_map_is_universe(struct isl_basic_map
*bmap
)
3355 return bmap
->n_eq
== 0 && bmap
->n_ineq
== 0;
3358 int isl_basic_map_is_empty(struct isl_basic_map
*bmap
)
3360 struct isl_basic_set
*bset
= NULL
;
3361 struct isl_vec
*sample
= NULL
;
3368 if (F_ISSET(bmap
, ISL_BASIC_MAP_EMPTY
))
3371 if (F_ISSET(bmap
, ISL_BASIC_MAP_RATIONAL
)) {
3372 struct isl_basic_map
*copy
= isl_basic_map_copy(bmap
);
3373 copy
= isl_basic_map_convex_hull(copy
);
3374 empty
= F_ISSET(copy
, ISL_BASIC_MAP_EMPTY
);
3375 isl_basic_map_free(copy
);
3379 total
= 1 + isl_basic_map_total_dim(bmap
);
3380 if (bmap
->sample
&& bmap
->sample
->size
== total
) {
3381 int contains
= basic_map_contains(bmap
, bmap
->sample
);
3387 bset
= isl_basic_map_underlying_set(isl_basic_map_copy(bmap
));
3390 sample
= isl_basic_set_sample(bset
);
3393 empty
= sample
->size
== 0;
3395 isl_vec_free(bmap
->ctx
, bmap
->sample
);
3396 bmap
->sample
= sample
;
3401 int isl_basic_set_is_empty(struct isl_basic_set
*bset
)
3403 return isl_basic_map_is_empty((struct isl_basic_map
*)bset
);
3406 struct isl_map
*isl_basic_map_union(
3407 struct isl_basic_map
*bmap1
, struct isl_basic_map
*bmap2
)
3409 struct isl_map
*map
;
3410 if (!bmap1
|| !bmap2
)
3413 isl_assert(map1
->ctx
, isl_dim_equal(bmap1
->dim
, bmap2
->dim
), goto error
);
3415 map
= isl_map_alloc_dim(isl_dim_copy(bmap1
->dim
), 2, 0);
3418 map
= isl_map_add(map
, bmap1
);
3419 map
= isl_map_add(map
, bmap2
);
3422 isl_basic_map_free(bmap1
);
3423 isl_basic_map_free(bmap2
);
3427 struct isl_set
*isl_basic_set_union(
3428 struct isl_basic_set
*bset1
, struct isl_basic_set
*bset2
)
3430 return (struct isl_set
*)isl_basic_map_union(
3431 (struct isl_basic_map
*)bset1
,
3432 (struct isl_basic_map
*)bset2
);
3435 /* Order divs such that any div only depends on previous divs */
3436 static struct isl_basic_map
*order_divs(struct isl_basic_map
*bmap
)
3439 unsigned off
= isl_dim_total(bmap
->dim
);
3441 for (i
= 0; i
< bmap
->n_div
; ++i
) {
3443 pos
= isl_seq_first_non_zero(bmap
->div
[i
]+1+1+off
+i
,
3447 swap_div(bmap
, i
, pos
);
3453 /* Look for a div in dst that corresponds to the div "div" in src.
3454 * The divs before "div" in src and dst are assumed to be the same.
3456 * Returns -1 if no corresponding div was found and the position
3457 * of the corresponding div in dst otherwise.
3459 static int find_div(struct isl_basic_map
*dst
,
3460 struct isl_basic_map
*src
, unsigned div
)
3464 unsigned total
= isl_dim_total(src
->dim
);
3466 isl_assert(dst
->ctx
, div
<= dst
->n_div
, return -1);
3467 for (i
= div
; i
< dst
->n_div
; ++i
)
3468 if (isl_seq_eq(dst
->div
[i
], src
->div
[div
], 1+1+total
+div
) &&
3469 isl_seq_first_non_zero(dst
->div
[i
]+1+1+total
+div
,
3470 dst
->n_div
- div
) == -1)
3475 struct isl_basic_map
*isl_basic_map_align_divs(
3476 struct isl_basic_map
*dst
, struct isl_basic_map
*src
)
3479 unsigned total
= isl_dim_total(src
->dim
);
3484 if (src
->n_div
== 0)
3487 for (i
= 0; i
< src
->n_div
; ++i
)
3488 isl_assert(src
->ctx
, !isl_int_is_zero(src
->div
[i
][0]), goto error
);
3490 src
= order_divs(src
);
3491 dst
= isl_basic_map_extend_dim(dst
, isl_dim_copy(dst
->dim
),
3492 src
->n_div
, 0, 2 * src
->n_div
);
3495 for (i
= 0; i
< src
->n_div
; ++i
) {
3496 int j
= find_div(dst
, src
, i
);
3498 j
= isl_basic_map_alloc_div(dst
);
3501 isl_seq_cpy(dst
->div
[j
], src
->div
[i
], 1+1+total
+i
);
3502 isl_seq_clr(dst
->div
[j
]+1+1+total
+i
, dst
->n_div
- i
);
3503 if (add_div_constraints(dst
, j
) < 0)
3507 swap_div(dst
, i
, j
);
3511 isl_basic_map_free(dst
);
3515 struct isl_basic_set
*isl_basic_set_align_divs(
3516 struct isl_basic_set
*dst
, struct isl_basic_set
*src
)
3518 return (struct isl_basic_set
*)isl_basic_map_align_divs(
3519 (struct isl_basic_map
*)dst
, (struct isl_basic_map
*)src
);
3522 struct isl_map
*isl_map_align_divs(struct isl_map
*map
)
3526 map
= isl_map_compute_divs(map
);
3527 map
= isl_map_cow(map
);
3531 for (i
= 1; i
< map
->n
; ++i
)
3532 map
->p
[0] = isl_basic_map_align_divs(map
->p
[0], map
->p
[i
]);
3533 for (i
= 1; i
< map
->n
; ++i
)
3534 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], map
->p
[0]);
3536 F_CLR(map
, ISL_MAP_NORMALIZED
);
3540 static struct isl_map
*add_cut_constraint(struct isl_map
*dst
,
3541 struct isl_basic_map
*src
, isl_int
*c
,
3542 unsigned len
, int oppose
)
3544 struct isl_basic_map
*copy
= NULL
;
3549 copy
= isl_basic_map_copy(src
);
3550 copy
= isl_basic_map_cow(copy
);
3553 copy
= isl_basic_map_extend_constraints(copy
, 0, 1);
3554 k
= isl_basic_map_alloc_inequality(copy
);
3558 isl_seq_neg(copy
->ineq
[k
], c
, len
);
3560 isl_seq_cpy(copy
->ineq
[k
], c
, len
);
3561 total
= 1 + isl_basic_map_total_dim(copy
);
3562 isl_seq_clr(copy
->ineq
[k
]+len
, total
- len
);
3563 isl_inequality_negate(copy
, k
);
3564 copy
= isl_basic_map_simplify(copy
);
3565 copy
= isl_basic_map_finalize(copy
);
3566 is_empty
= isl_basic_map_is_empty(copy
);
3570 dst
= isl_map_add(dst
, copy
);
3572 isl_basic_map_free(copy
);
3575 isl_basic_map_free(copy
);
3580 static struct isl_map
*subtract(struct isl_map
*map
, struct isl_basic_map
*bmap
)
3584 struct isl_map
*rest
= NULL
;
3586 unsigned total
= isl_basic_map_total_dim(bmap
);
3593 if (F_ISSET(map
, ISL_MAP_DISJOINT
))
3594 FL_SET(flags
, ISL_MAP_DISJOINT
);
3596 max
= map
->n
* (2 * bmap
->n_eq
+ bmap
->n_ineq
);
3597 rest
= isl_map_alloc_dim(isl_dim_copy(map
->dim
), max
, flags
);
3601 for (i
= 0; i
< map
->n
; ++i
) {
3602 map
->p
[i
] = isl_basic_map_align_divs(map
->p
[i
], bmap
);
3607 for (j
= 0; j
< map
->n
; ++j
)
3608 map
->p
[j
] = isl_basic_map_cow(map
->p
[j
]);
3610 for (i
= 0; i
< bmap
->n_eq
; ++i
) {
3611 for (j
= 0; j
< map
->n
; ++j
) {
3612 rest
= add_cut_constraint(rest
,
3613 map
->p
[j
], bmap
->eq
[i
], 1+total
, 0);
3617 rest
= add_cut_constraint(rest
,
3618 map
->p
[j
], bmap
->eq
[i
], 1+total
, 1);
3622 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
3626 k
= isl_basic_map_alloc_equality(map
->p
[j
]);
3629 isl_seq_cpy(map
->p
[j
]->eq
[k
], bmap
->eq
[i
], 1+total
);
3630 isl_seq_clr(map
->p
[j
]->eq
[k
]+1+total
,
3631 map
->p
[j
]->n_div
- bmap
->n_div
);
3635 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
3636 for (j
= 0; j
< map
->n
; ++j
) {
3637 rest
= add_cut_constraint(rest
,
3638 map
->p
[j
], bmap
->ineq
[i
], 1+total
, 0);
3642 map
->p
[j
] = isl_basic_map_extend_constraints(map
->p
[j
],
3646 k
= isl_basic_map_alloc_inequality(map
->p
[j
]);
3649 isl_seq_cpy(map
->p
[j
]->ineq
[k
], bmap
->ineq
[i
], 1+total
);
3650 isl_seq_clr(map
->p
[j
]->ineq
[k
]+1+total
,
3651 map
->p
[j
]->n_div
- bmap
->n_div
);
3663 struct isl_map
*isl_map_subtract(struct isl_map
*map1
, struct isl_map
*map2
)
3669 isl_assert(map1
->ctx
, isl_dim_equal(map1
->dim
, map2
->dim
), goto error
);
3671 if (isl_map_is_empty(map2
)) {
3676 map1
= isl_map_compute_divs(map1
);
3677 map2
= isl_map_compute_divs(map2
);
3681 for (i
= 0; map1
&& i
< map2
->n
; ++i
)
3682 map1
= subtract(map1
, map2
->p
[i
]);
3692 struct isl_set
*isl_set_subtract(struct isl_set
*set1
, struct isl_set
*set2
)
3694 return (struct isl_set
*)
3696 (struct isl_map
*)set1
, (struct isl_map
*)set2
);
3699 struct isl_set
*isl_set_apply(struct isl_set
*set
, struct isl_map
*map
)
3703 isl_assert(set
->ctx
, isl_map_compatible_domain(map
, set
), goto error
);
3704 map
= isl_map_intersect_domain(map
, set
);
3705 set
= isl_map_range(map
);
3713 /* There is no need to cow as removing empty parts doesn't change
3714 * the meaning of the set.
3716 struct isl_map
*isl_map_remove_empty_parts(struct isl_map
*map
)
3723 for (i
= map
->n
-1; i
>= 0; --i
) {
3724 if (!F_ISSET(map
->p
[i
], ISL_BASIC_MAP_EMPTY
))
3726 isl_basic_map_free(map
->p
[i
]);
3727 if (i
!= map
->n
-1) {
3728 F_CLR(map
, ISL_MAP_NORMALIZED
);
3729 map
->p
[i
] = map
->p
[map
->n
-1];
3737 struct isl_set
*isl_set_remove_empty_parts(struct isl_set
*set
)
3739 return (struct isl_set
*)
3740 isl_map_remove_empty_parts((struct isl_map
*)set
);
3743 struct isl_basic_set
*isl_set_copy_basic_set(struct isl_set
*set
)
3745 struct isl_basic_set
*bset
;
3746 if (!set
|| set
->n
== 0)
3748 bset
= set
->p
[set
->n
-1];
3749 isl_assert(set
->ctx
, F_ISSET(bset
, ISL_BASIC_SET_FINAL
), return NULL
);
3750 return isl_basic_set_copy(bset
);
3753 struct isl_set
*isl_set_drop_basic_set(struct isl_set
*set
,
3754 struct isl_basic_set
*bset
)
3760 for (i
= set
->n
-1; i
>= 0; --i
) {
3761 if (set
->p
[i
] != bset
)
3763 set
= isl_set_cow(set
);
3766 isl_basic_set_free(set
->p
[i
]);
3767 if (i
!= set
->n
-1) {
3768 F_CLR(set
, ISL_SET_NORMALIZED
);
3769 set
->p
[i
] = set
->p
[set
->n
-1];
3774 isl_basic_set_free(bset
);
3778 isl_basic_set_free(bset
);
3782 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
3783 * for any common value of the parameters and dimensions preceding dim
3784 * in both basic sets, the values of dimension pos in bset1 are
3785 * smaller or larger than those in bset2.
3788 * 1 if bset1 follows bset2
3789 * -1 if bset1 precedes bset2
3790 * 0 if bset1 and bset2 are incomparable
3791 * -2 if some error occurred.
3793 int isl_basic_set_compare_at(struct isl_basic_set
*bset1
,
3794 struct isl_basic_set
*bset2
, int pos
)
3796 struct isl_dim
*dims
;
3797 struct isl_basic_map
*bmap1
= NULL
;
3798 struct isl_basic_map
*bmap2
= NULL
;
3799 struct isl_ctx
*ctx
;
3800 struct isl_vec
*obj
;
3803 unsigned dim1
, dim2
;
3805 enum isl_lp_result res
;
3808 if (!bset1
|| !bset2
)
3811 nparam
= isl_basic_set_n_param(bset1
);
3812 dim1
= isl_basic_set_n_dim(bset1
);
3813 dim2
= isl_basic_set_n_dim(bset2
);
3814 dims
= isl_dim_alloc(bset1
->ctx
, nparam
, pos
, dim1
- pos
);
3815 bmap1
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset1
), dims
);
3816 dims
= isl_dim_alloc(bset2
->ctx
, nparam
, pos
, dim2
- pos
);
3817 bmap2
= isl_basic_map_from_basic_set(isl_basic_set_copy(bset2
), dims
);
3818 if (!bmap1
|| !bmap2
)
3820 bmap1
= isl_basic_map_extend(bmap1
, nparam
,
3821 pos
, (dim1
- pos
) + (dim2
- pos
),
3822 bmap2
->n_div
, bmap2
->n_eq
, bmap2
->n_ineq
);
3823 bmap1
= add_constraints(bmap1
, bmap2
, 0, dim1
- pos
);
3826 total
= isl_basic_map_total_dim(bmap1
);
3828 obj
= isl_vec_alloc(ctx
, total
);
3829 isl_seq_clr(obj
->block
.data
, total
);
3830 isl_int_set_si(obj
->block
.data
[nparam
+pos
], 1);
3831 isl_int_set_si(obj
->block
.data
[nparam
+pos
+(dim1
-pos
)], -1);
3836 res
= isl_solve_lp(bmap1
, 0, obj
->block
.data
, ctx
->one
, &num
, &den
);
3837 if (res
== isl_lp_empty
)
3839 else if (res
== isl_lp_ok
&& isl_int_is_pos(num
))
3841 else if ((res
== isl_lp_ok
&& isl_int_is_neg(num
)) ||
3842 res
== isl_lp_unbounded
)
3848 isl_basic_map_free(bmap1
);
3849 isl_vec_free(ctx
, obj
);
3852 isl_basic_map_free(bmap1
);
3853 isl_basic_map_free(bmap2
);
3857 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map
*bmap
,
3858 unsigned pos
, isl_int
*val
)
3866 total
= isl_basic_map_total_dim(bmap
);
3867 for (i
= 0, d
= total
-1; i
< bmap
->n_eq
&& d
+1 > pos
; ++i
) {
3868 for (; d
+1 > pos
; --d
)
3869 if (!isl_int_is_zero(bmap
->eq
[i
][1+d
]))
3873 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1, d
) != -1)
3875 if (isl_seq_first_non_zero(bmap
->eq
[i
]+1+d
+1, total
-d
-1) != -1)
3877 if (!isl_int_is_one(bmap
->eq
[i
][1+d
]))
3880 isl_int_neg(*val
, bmap
->eq
[i
][0]);
3886 static int isl_map_fast_has_fixed_var(struct isl_map
*map
,
3887 unsigned pos
, isl_int
*val
)
3899 return isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, val
);
3902 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[0], pos
, &v
);
3903 for (i
= 1; fixed
== 1 && i
< map
->n
; ++i
) {
3904 fixed
= isl_basic_map_fast_has_fixed_var(map
->p
[i
], pos
, &tmp
);
3905 if (fixed
== 1 && isl_int_ne(tmp
, v
))
3909 isl_int_set(*val
, v
);
3915 static int isl_set_fast_has_fixed_var(struct isl_set
*set
, unsigned pos
,
3918 return isl_map_fast_has_fixed_var((struct isl_map
*)set
, pos
, val
);
3921 int isl_basic_map_fast_is_fixed(struct isl_basic_map
*bmap
,
3922 enum isl_dim_type type
, unsigned pos
, isl_int
*val
)
3924 if (pos
>= isl_basic_map_dim(bmap
, type
))
3926 return isl_basic_map_fast_has_fixed_var(bmap
,
3927 basic_map_offset(bmap
, type
) - 1 + pos
, val
);
3930 /* Check if dimension dim has fixed value and if so and if val is not NULL,
3931 * then return this fixed value in *val.
3933 int isl_set_fast_dim_is_fixed(struct isl_set
*set
, unsigned dim
, isl_int
*val
)
3935 return isl_set_fast_has_fixed_var(set
, isl_set_n_param(set
) + dim
, val
);
3938 /* Check if input variable in has fixed value and if so and if val is not NULL,
3939 * then return this fixed value in *val.
3941 int isl_map_fast_input_is_fixed(struct isl_map
*map
, unsigned in
, isl_int
*val
)
3943 return isl_map_fast_has_fixed_var(map
, isl_map_n_param(map
) + in
, val
);
3946 /* Check if dimension dim has an (obvious) fixed lower bound and if so
3947 * and if val is not NULL, then return this lower bound in *val.
3949 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set
*bset
,
3950 unsigned dim
, isl_int
*val
)
3952 int i
, i_eq
= -1, i_ineq
= -1;
3959 total
= isl_basic_set_total_dim(bset
);
3960 nparam
= isl_basic_set_n_param(bset
);
3961 for (i
= 0; i
< bset
->n_eq
; ++i
) {
3962 if (isl_int_is_zero(bset
->eq
[i
][1+nparam
+dim
]))
3968 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
3969 if (!isl_int_is_pos(bset
->ineq
[i
][1+nparam
+dim
]))
3971 if (i_eq
!= -1 || i_ineq
!= -1)
3975 if (i_eq
== -1 && i_ineq
== -1)
3977 c
= i_eq
!= -1 ? bset
->eq
[i_eq
] : bset
->ineq
[i_ineq
];
3978 /* The coefficient should always be one due to normalization. */
3979 if (!isl_int_is_one(c
[1+nparam
+dim
]))
3981 if (isl_seq_first_non_zero(c
+1, nparam
+dim
) != -1)
3983 if (isl_seq_first_non_zero(c
+1+nparam
+dim
+1,
3984 total
- nparam
- dim
- 1) != -1)
3987 isl_int_neg(*val
, c
[0]);
3991 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set
*set
,
3992 unsigned dim
, isl_int
*val
)
4004 return isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4008 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[0],
4010 for (i
= 1; fixed
== 1 && i
< set
->n
; ++i
) {
4011 fixed
= isl_basic_set_fast_dim_has_fixed_lower_bound(set
->p
[i
],
4013 if (fixed
== 1 && isl_int_ne(tmp
, v
))
4017 isl_int_set(*val
, v
);
4028 static int qsort_constraint_cmp(const void *p1
, const void *p2
)
4030 const struct constraint
*c1
= (const struct constraint
*)p1
;
4031 const struct constraint
*c2
= (const struct constraint
*)p2
;
4032 unsigned size
= isl_min(c1
->size
, c2
->size
);
4033 return isl_seq_cmp(c1
->c
, c2
->c
, size
);
4036 static struct isl_basic_map
*isl_basic_map_sort_constraints(
4037 struct isl_basic_map
*bmap
)
4040 struct constraint
*c
;
4045 total
= isl_basic_map_total_dim(bmap
);
4046 c
= isl_alloc_array(bmap
->ctx
, struct constraint
, bmap
->n_ineq
);
4049 for (i
= 0; i
< bmap
->n_ineq
; ++i
) {
4051 c
[i
].c
= bmap
->ineq
[i
];
4053 qsort(c
, bmap
->n_ineq
, sizeof(struct constraint
), qsort_constraint_cmp
);
4054 for (i
= 0; i
< bmap
->n_ineq
; ++i
)
4055 bmap
->ineq
[i
] = c
[i
].c
;
4059 isl_basic_map_free(bmap
);
4063 struct isl_basic_map
*isl_basic_map_normalize(struct isl_basic_map
*bmap
)
4067 if (F_ISSET(bmap
, ISL_BASIC_MAP_NORMALIZED
))
4069 bmap
= isl_basic_map_convex_hull(bmap
);
4070 bmap
= isl_basic_map_sort_constraints(bmap
);
4071 F_SET(bmap
, ISL_BASIC_MAP_NORMALIZED
);
4075 struct isl_basic_set
*isl_basic_set_normalize(struct isl_basic_set
*bset
)
4077 return (struct isl_basic_set
*)isl_basic_map_normalize(
4078 (struct isl_basic_map
*)bset
);
4081 static int isl_basic_map_fast_cmp(const struct isl_basic_map
*bmap1
,
4082 const struct isl_basic_map
*bmap2
)
4089 if (isl_basic_map_n_param(bmap1
) != isl_basic_map_n_param(bmap2
))
4090 return isl_basic_map_n_param(bmap1
) - isl_basic_map_n_param(bmap2
);
4091 if (isl_basic_map_n_in(bmap1
) != isl_basic_map_n_in(bmap2
))
4092 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4093 if (isl_basic_map_n_out(bmap1
) != isl_basic_map_n_out(bmap2
))
4094 return isl_basic_map_n_out(bmap1
) - isl_basic_map_n_out(bmap2
);
4095 if (F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
) &&
4096 F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4098 if (F_ISSET(bmap1
, ISL_BASIC_MAP_EMPTY
))
4100 if (F_ISSET(bmap2
, ISL_BASIC_MAP_EMPTY
))
4102 if (bmap1
->n_eq
!= bmap2
->n_eq
)
4103 return bmap1
->n_eq
- bmap2
->n_eq
;
4104 if (bmap1
->n_ineq
!= bmap2
->n_ineq
)
4105 return bmap1
->n_ineq
- bmap2
->n_ineq
;
4106 if (bmap1
->n_div
!= bmap2
->n_div
)
4107 return bmap1
->n_div
- bmap2
->n_div
;
4108 total
= isl_basic_map_total_dim(bmap1
);
4109 for (i
= 0; i
< bmap1
->n_eq
; ++i
) {
4110 cmp
= isl_seq_cmp(bmap1
->eq
[i
], bmap2
->eq
[i
], 1+total
);
4114 for (i
= 0; i
< bmap1
->n_ineq
; ++i
) {
4115 cmp
= isl_seq_cmp(bmap1
->ineq
[i
], bmap2
->ineq
[i
], 1+total
);
4119 for (i
= 0; i
< bmap1
->n_div
; ++i
) {
4120 cmp
= isl_seq_cmp(bmap1
->div
[i
], bmap2
->div
[i
], 1+1+total
);
4127 static int isl_basic_map_fast_is_equal(struct isl_basic_map
*bmap1
,
4128 struct isl_basic_map
*bmap2
)
4130 return isl_basic_map_fast_cmp(bmap1
, bmap2
) == 0;
4133 static int qsort_bmap_cmp(const void *p1
, const void *p2
)
4135 const struct isl_basic_map
*bmap1
= *(const struct isl_basic_map
**)p1
;
4136 const struct isl_basic_map
*bmap2
= *(const struct isl_basic_map
**)p2
;
4138 return isl_basic_map_fast_cmp(bmap1
, bmap2
);
4141 /* We normalize in place, but if anything goes wrong we need
4142 * to return NULL, so we need to make sure we don't change the
4143 * meaning of any possible other copies of map.
4145 struct isl_map
*isl_map_normalize(struct isl_map
*map
)
4148 struct isl_basic_map
*bmap
;
4152 if (F_ISSET(map
, ISL_MAP_NORMALIZED
))
4154 for (i
= 0; i
< map
->n
; ++i
) {
4155 bmap
= isl_basic_map_normalize(isl_basic_map_copy(map
->p
[i
]));
4158 isl_basic_map_free(map
->p
[i
]);
4161 qsort(map
->p
, map
->n
, sizeof(struct isl_basic_map
*), qsort_bmap_cmp
);
4162 F_SET(map
, ISL_MAP_NORMALIZED
);
4163 map
= isl_map_remove_empty_parts(map
);
4166 for (i
= map
->n
- 1; i
>= 1; --i
) {
4167 if (!isl_basic_map_fast_is_equal(map
->p
[i
-1], map
->p
[i
]))
4169 isl_basic_map_free(map
->p
[i
-1]);
4170 for (j
= i
; j
< map
->n
; ++j
)
4171 map
->p
[j
-1] = map
->p
[j
];
4181 struct isl_set
*isl_set_normalize(struct isl_set
*set
)
4183 return (struct isl_set
*)isl_map_normalize((struct isl_map
*)set
);
4186 int isl_map_fast_is_equal(struct isl_map
*map1
, struct isl_map
*map2
)
4196 if (!isl_dim_equal(map1
->dim
, map2
->dim
))
4199 map1
= isl_map_copy(map1
);
4200 map2
= isl_map_copy(map2
);
4201 map1
= isl_map_normalize(map1
);
4202 map2
= isl_map_normalize(map2
);
4205 equal
= map1
->n
== map2
->n
;
4206 for (i
= 0; equal
&& i
< map1
->n
; ++i
) {
4207 equal
= isl_basic_map_fast_is_equal(map1
->p
[i
], map2
->p
[i
]);
4220 int isl_set_fast_is_equal(struct isl_set
*set1
, struct isl_set
*set2
)
4222 return isl_map_fast_is_equal((struct isl_map
*)set1
,
4223 (struct isl_map
*)set2
);
4226 /* Return an interval that ranges from min to max (inclusive)
4228 struct isl_basic_set
*isl_basic_set_interval(struct isl_ctx
*ctx
,
4229 isl_int min
, isl_int max
)
4232 struct isl_basic_set
*bset
= NULL
;
4234 bset
= isl_basic_set_alloc(ctx
, 0, 1, 0, 0, 2);
4238 k
= isl_basic_set_alloc_inequality(bset
);
4241 isl_int_set_si(bset
->ineq
[k
][1], 1);
4242 isl_int_neg(bset
->ineq
[k
][0], min
);
4244 k
= isl_basic_set_alloc_inequality(bset
);
4247 isl_int_set_si(bset
->ineq
[k
][1], -1);
4248 isl_int_set(bset
->ineq
[k
][0], max
);
4252 isl_basic_set_free(bset
);
4256 /* Return the Cartesian product of the basic sets in list (in the given order).
4258 struct isl_basic_set
*isl_basic_set_product(struct isl_basic_set_list
*list
)
4266 struct isl_basic_set
*product
= NULL
;
4270 isl_assert(list
->ctx
, list
->n
> 0, goto error
);
4271 isl_assert(list
->ctx
, list
->p
[0], goto error
);
4272 nparam
= isl_basic_set_n_param(list
->p
[0]);
4273 dim
= isl_basic_set_n_dim(list
->p
[0]);
4274 extra
= list
->p
[0]->n_div
;
4275 n_eq
= list
->p
[0]->n_eq
;
4276 n_ineq
= list
->p
[0]->n_ineq
;
4277 for (i
= 1; i
< list
->n
; ++i
) {
4278 isl_assert(list
->ctx
, list
->p
[i
], goto error
);
4279 isl_assert(list
->ctx
,
4280 nparam
== isl_basic_set_n_param(list
->p
[i
]), goto error
);
4281 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4282 extra
+= list
->p
[i
]->n_div
;
4283 n_eq
+= list
->p
[i
]->n_eq
;
4284 n_ineq
+= list
->p
[i
]->n_ineq
;
4286 product
= isl_basic_set_alloc(list
->ctx
, nparam
, dim
, extra
,
4291 for (i
= 0; i
< list
->n
; ++i
) {
4292 isl_basic_set_add_constraints(product
,
4293 isl_basic_set_copy(list
->p
[i
]), dim
);
4294 dim
+= isl_basic_set_n_dim(list
->p
[i
]);
4296 isl_basic_set_list_free(list
);
4299 isl_basic_set_free(product
);
4300 isl_basic_set_list_free(list
);
4304 uint32_t isl_basic_set_get_hash(struct isl_basic_set
*bset
)
4312 bset
= isl_basic_set_copy(bset
);
4313 bset
= isl_basic_set_normalize(bset
);
4316 total
= isl_basic_set_total_dim(bset
);
4317 isl_hash_byte(hash
, bset
->n_eq
& 0xFF);
4318 for (i
= 0; i
< bset
->n_eq
; ++i
) {
4320 c_hash
= isl_seq_get_hash(bset
->eq
[i
], 1 + total
);
4321 isl_hash_hash(hash
, c_hash
);
4323 isl_hash_byte(hash
, bset
->n_ineq
& 0xFF);
4324 for (i
= 0; i
< bset
->n_ineq
; ++i
) {
4326 c_hash
= isl_seq_get_hash(bset
->ineq
[i
], 1 + total
);
4327 isl_hash_hash(hash
, c_hash
);
4329 isl_hash_byte(hash
, bset
->n_div
& 0xFF);
4330 for (i
= 0; i
< bset
->n_div
; ++i
) {
4332 if (isl_int_is_zero(bset
->div
[i
][0]))
4334 isl_hash_byte(hash
, i
& 0xFF);
4335 c_hash
= isl_seq_get_hash(bset
->div
[i
], 1 + 1 + total
);
4336 isl_hash_hash(hash
, c_hash
);
4338 isl_basic_set_free(bset
);
4342 uint32_t isl_set_get_hash(struct isl_set
*set
)
4349 set
= isl_set_copy(set
);
4350 set
= isl_set_normalize(set
);
4354 hash
= isl_hash_init();
4355 for (i
= 0; i
< set
->n
; ++i
) {
4357 bset_hash
= isl_basic_set_get_hash(set
->p
[i
]);
4358 isl_hash_hash(hash
, bset_hash
);
4366 /* Check if the value for dimension dim is completely determined
4367 * by the values of the other parameters and variables.
4368 * That is, check if dimension dim is involved in an equality.
4370 int isl_basic_set_dim_is_unique(struct isl_basic_set
*bset
, unsigned dim
)
4377 nparam
= isl_basic_set_n_param(bset
);
4378 for (i
= 0; i
< bset
->n_eq
; ++i
)
4379 if (!isl_int_is_zero(bset
->eq
[i
][1 + nparam
+ dim
]))
4384 /* Check if the value for dimension dim is completely determined
4385 * by the values of the other parameters and variables.
4386 * That is, check if dimension dim is involved in an equality
4387 * for each of the subsets.
4389 int isl_set_dim_is_unique(struct isl_set
*set
, unsigned dim
)
4395 for (i
= 0; i
< set
->n
; ++i
) {
4397 unique
= isl_basic_set_dim_is_unique(set
->p
[i
], dim
);