6 #include "isl_equalities.h"
12 #include "isl_map_private.h"
13 #include "isl_map_piplib.h"
14 #include "isl_sample.h"
18 /* Maps dst positions to src positions */
24 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
27 struct isl_dim_map *dim_map;
28 dim_map = isl_alloc(ctx, struct isl_dim_map,
29 sizeof(struct isl_dim_map) + len * sizeof(int));
32 dim_map->len = 1 + len;
34 for (i = 0; i < len; ++i)
35 dim_map->pos[1 + i] = -1;
39 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
42 case isl_dim_param: return dim->nparam;
43 case isl_dim_in: return dim->n_in;
44 case isl_dim_out: return dim->n_out;
45 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
49 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
52 case isl_dim_param: return 1;
53 case isl_dim_in: return 1 + dim->nparam;
54 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
58 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
59 enum isl_dim_type type, unsigned dst_pos)
67 src_pos = pos(dim, type);
68 for (i = 0; i < n(dim, type); ++i)
69 dim_map->pos[1 + dst_pos + i] = src_pos + i;
72 static void isl_dim_map_div(struct isl_dim_map *dim_map,
73 struct isl_basic_map *bmap, unsigned dst_pos)
78 if (!dim_map || !bmap)
81 src_pos = 1 + isl_dim_total(bmap->dim);
82 for (i = 0; i < bmap->n_div; ++i)
83 dim_map->pos[1 + dst_pos + i] = src_pos + i;
86 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
90 for (i = 0; i < dim_map->len; ++i)
91 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
92 fprintf(stderr, "\n");
95 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
96 enum isl_dim_type type)
101 case isl_dim_out: return isl_dim_size(bmap->dim, type);
102 case isl_dim_div: return bmap->n_div;
103 case isl_dim_all: return isl_basic_map_total_dim(bmap);
107 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
109 return n(map->dim, type);
112 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
114 return n(set->dim, type);
117 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
118 enum isl_dim_type type)
120 struct isl_dim *dim = bmap->dim;
122 case isl_dim_param: return 1;
123 case isl_dim_in: return 1 + dim->nparam;
124 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
125 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
129 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
131 return pos(map->dim, type);
134 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
135 enum isl_dim_type type)
137 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
140 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
142 return bset->dim->n_out;
145 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
147 return bset->dim->nparam;
150 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
152 return isl_dim_total(bset->dim) + bset->n_div;
155 unsigned isl_set_n_dim(const struct isl_set *set)
157 return set->dim->n_out;
160 unsigned isl_set_n_param(const struct isl_set *set)
162 return set->dim->nparam;
165 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
167 return bmap->dim->n_in;
170 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
172 return bmap->dim->n_out;
175 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
177 return bmap->dim->nparam;
180 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
185 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
187 return isl_dim_total(bmap->dim) + bmap->n_div;
190 unsigned isl_map_n_in(const struct isl_map *map)
192 return map->dim->n_in;
195 unsigned isl_map_n_out(const struct isl_map *map)
197 return map->dim->n_out;
200 unsigned isl_map_n_param(const struct isl_map *map)
202 return map->dim->nparam;
205 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
207 return map->dim->n_in == set->dim->n_out &&
208 map->dim->nparam == set->dim->nparam;
211 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
214 return bmap->dim->n_in == bset->dim->n_out &&
215 bmap->dim->nparam == bset->dim->nparam;
218 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
219 struct isl_basic_set *bset)
221 return bmap->dim->n_out == bset->dim->n_out &&
222 bmap->dim->nparam == bset->dim->nparam;
225 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
229 return isl_dim_copy(bmap->dim);
232 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
236 return isl_dim_copy(bset->dim);
239 struct isl_dim *isl_map_get_dim(struct isl_map *map)
243 return isl_dim_copy(map->dim);
246 struct isl_dim *isl_set_get_dim(struct isl_set *set)
250 return isl_dim_copy(set->dim);
253 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
254 struct isl_basic_map *bmap, unsigned extra,
255 unsigned n_eq, unsigned n_ineq)
258 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
260 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
261 if (isl_blk_is_error(bmap->block)) {
266 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
268 isl_blk_free(ctx, bmap->block);
274 bmap->block2 = isl_blk_empty();
277 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
278 if (isl_blk_is_error(bmap->block2)) {
280 isl_blk_free(ctx, bmap->block);
285 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
287 isl_blk_free(ctx, bmap->block2);
289 isl_blk_free(ctx, bmap->block);
295 for (i = 0; i < n_ineq + n_eq; ++i)
296 bmap->ineq[i] = bmap->block.data + i * row_size;
298 for (i = 0; i < extra; ++i)
299 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
305 bmap->c_size = n_eq + n_ineq;
306 bmap->eq = bmap->ineq + n_ineq;
315 isl_basic_map_free(bmap);
319 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
320 unsigned nparam, unsigned dim, unsigned extra,
321 unsigned n_eq, unsigned n_ineq)
323 struct isl_basic_map *bmap;
324 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
325 return (struct isl_basic_set *)bmap;
328 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
329 unsigned extra, unsigned n_eq, unsigned n_ineq)
331 struct isl_basic_map *bmap;
334 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
335 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
336 return (struct isl_basic_set *)bmap;
339 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
340 unsigned extra, unsigned n_eq, unsigned n_ineq)
342 struct isl_basic_map *bmap;
346 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
351 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
357 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
358 unsigned nparam, unsigned in, unsigned out, unsigned extra,
359 unsigned n_eq, unsigned n_ineq)
361 struct isl_basic_map *bmap;
364 dim = isl_dim_alloc(ctx, nparam, in, out);
368 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
372 static void dup_constraints(
373 struct isl_basic_map *dst, struct isl_basic_map *src)
376 unsigned total = isl_basic_map_total_dim(src);
378 for (i = 0; i < src->n_eq; ++i) {
379 int j = isl_basic_map_alloc_equality(dst);
380 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
383 for (i = 0; i < src->n_ineq; ++i) {
384 int j = isl_basic_map_alloc_inequality(dst);
385 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
388 for (i = 0; i < src->n_div; ++i) {
389 int j = isl_basic_map_alloc_div(dst);
390 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
392 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
395 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
397 struct isl_basic_map *dup;
401 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
402 bmap->n_div, bmap->n_eq, bmap->n_ineq);
405 dup_constraints(dup, bmap);
406 dup->flags = bmap->flags;
407 dup->sample = isl_vec_copy(bmap->sample);
411 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
413 struct isl_basic_map *dup;
415 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
416 return (struct isl_basic_set *)dup;
419 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
424 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
428 return isl_basic_set_dup(bset);
431 struct isl_set *isl_set_copy(struct isl_set *set)
440 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
445 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
449 return isl_basic_map_dup(bmap);
452 struct isl_map *isl_map_copy(struct isl_map *map)
461 void isl_basic_map_free(struct isl_basic_map *bmap)
469 isl_ctx_deref(bmap->ctx);
471 isl_blk_free(bmap->ctx, bmap->block2);
473 isl_blk_free(bmap->ctx, bmap->block);
474 isl_vec_free(bmap->sample);
475 isl_dim_free(bmap->dim);
479 void isl_basic_set_free(struct isl_basic_set *bset)
481 isl_basic_map_free((struct isl_basic_map *)bset);
484 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
486 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
489 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
495 isl_assert(ctx, room_for_con(bmap, 1), return -1);
496 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
498 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
499 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
500 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
501 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
502 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
503 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
505 int j = isl_basic_map_alloc_inequality(bmap);
509 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
510 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
517 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
518 bmap->extra - bmap->n_div);
522 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
524 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
527 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
531 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
536 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
538 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
541 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
546 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
548 if (pos != bmap->n_eq - 1) {
550 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
551 bmap->eq[bmap->n_eq - 1] = t;
557 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
559 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
562 void isl_basic_map_inequality_to_equality(
563 struct isl_basic_map *bmap, unsigned pos)
568 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
569 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
574 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
575 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
576 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
577 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
580 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
582 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
585 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
591 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
592 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
593 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
594 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
595 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
596 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
597 1 + isl_basic_map_total_dim(bmap),
598 bmap->extra - bmap->n_div);
599 return bmap->n_ineq++;
602 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
604 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
607 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
611 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
616 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
618 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
621 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
626 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
628 if (pos != bmap->n_ineq - 1) {
630 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
631 bmap->ineq[bmap->n_ineq - 1] = t;
632 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
638 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
640 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
643 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
647 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
648 isl_seq_clr(bmap->div[bmap->n_div] +
649 1 + 1 + isl_basic_map_total_dim(bmap),
650 bmap->extra - bmap->n_div);
651 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
652 return bmap->n_div++;
655 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
657 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
660 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
664 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
669 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
671 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
674 /* Copy constraint from src to dst, putting the vars of src at offset
675 * dim_off in dst and the divs of src at offset div_off in dst.
676 * If both sets are actually map, then dim_off applies to the input
679 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
680 struct isl_basic_map *src_map, isl_int *src,
681 unsigned in_off, unsigned out_off, unsigned div_off)
683 unsigned src_nparam = isl_basic_map_n_param(src_map);
684 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
685 unsigned src_in = isl_basic_map_n_in(src_map);
686 unsigned dst_in = isl_basic_map_n_in(dst_map);
687 unsigned src_out = isl_basic_map_n_out(src_map);
688 unsigned dst_out = isl_basic_map_n_out(dst_map);
689 isl_int_set(dst[0], src[0]);
690 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
691 if (dst_nparam > src_nparam)
692 isl_seq_clr(dst+1+src_nparam,
693 dst_nparam - src_nparam);
694 isl_seq_clr(dst+1+dst_nparam, in_off);
695 isl_seq_cpy(dst+1+dst_nparam+in_off,
697 isl_min(dst_in-in_off, src_in));
698 if (dst_in-in_off > src_in)
699 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
700 dst_in - in_off - src_in);
701 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
702 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
703 src+1+src_nparam+src_in,
704 isl_min(dst_out-out_off, src_out));
705 if (dst_out-out_off > src_out)
706 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
707 dst_out - out_off - src_out);
708 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
709 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
710 src+1+src_nparam+src_in+src_out,
711 isl_min(dst_map->extra-div_off, src_map->n_div));
712 if (dst_map->n_div-div_off > src_map->n_div)
713 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
714 div_off+src_map->n_div,
715 dst_map->n_div - div_off - src_map->n_div);
718 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
719 struct isl_basic_map *src_map, isl_int *src,
720 unsigned in_off, unsigned out_off, unsigned div_off)
722 isl_int_set(dst[0], src[0]);
723 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
726 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
727 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
732 if (!bmap1 || !bmap2)
735 div_off = bmap1->n_div;
737 for (i = 0; i < bmap2->n_eq; ++i) {
738 int i1 = isl_basic_map_alloc_equality(bmap1);
741 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
742 i_pos, o_pos, div_off);
745 for (i = 0; i < bmap2->n_ineq; ++i) {
746 int i1 = isl_basic_map_alloc_inequality(bmap1);
749 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
750 i_pos, o_pos, div_off);
753 for (i = 0; i < bmap2->n_div; ++i) {
754 int i1 = isl_basic_map_alloc_div(bmap1);
757 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
758 i_pos, o_pos, div_off);
761 isl_basic_map_free(bmap2);
766 isl_basic_map_free(bmap1);
767 isl_basic_map_free(bmap2);
771 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
772 struct isl_dim_map *dim_map)
776 for (i = 0; i < dim_map->len; ++i) {
777 if (dim_map->pos[i] < 0)
778 isl_int_set_si(dst[i], 0);
780 isl_int_set(dst[i], src[dim_map->pos[i]]);
784 static void copy_div_dim_map(isl_int *dst, isl_int *src,
785 struct isl_dim_map *dim_map)
787 isl_int_set(dst[0], src[0]);
788 copy_constraint_dim_map(dst+1, src+1, dim_map);
791 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
792 struct isl_basic_map *src, struct isl_dim_map *dim_map)
796 if (!src || !dst || !dim_map)
799 for (i = 0; i < src->n_eq; ++i) {
800 int i1 = isl_basic_map_alloc_equality(dst);
803 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
806 for (i = 0; i < src->n_ineq; ++i) {
807 int i1 = isl_basic_map_alloc_inequality(dst);
810 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
813 for (i = 0; i < src->n_div; ++i) {
814 int i1 = isl_basic_map_alloc_div(dst);
817 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
821 isl_basic_map_free(src);
826 isl_basic_map_free(src);
827 isl_basic_map_free(dst);
831 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
832 struct isl_basic_set *bset2, unsigned pos)
834 return (struct isl_basic_set *)
835 add_constraints((struct isl_basic_map *)bset1,
836 (struct isl_basic_map *)bset2, 0, pos);
839 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
840 struct isl_dim *dim, unsigned extra,
841 unsigned n_eq, unsigned n_ineq)
843 struct isl_basic_map *ext;
853 dims_ok = isl_dim_equal(base->dim, dim) &&
854 base->extra >= base->n_div + extra;
856 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
857 room_for_ineq(base, n_ineq)) {
862 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
863 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
864 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
865 extra += base->extra;
867 n_ineq += base->n_ineq;
869 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
875 ext->sample = isl_vec_copy(base->sample);
877 ext = add_constraints(ext, base, 0, 0);
880 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
887 isl_basic_map_free(base);
891 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
892 struct isl_dim *dim, unsigned extra,
893 unsigned n_eq, unsigned n_ineq)
895 return (struct isl_basic_set *)
896 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
897 extra, n_eq, n_ineq);
900 struct isl_basic_map *isl_basic_map_extend_constraints(
901 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
905 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
909 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
910 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
911 unsigned n_eq, unsigned n_ineq)
913 struct isl_basic_map *bmap;
918 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
922 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
926 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
927 unsigned nparam, unsigned dim, unsigned extra,
928 unsigned n_eq, unsigned n_ineq)
930 return (struct isl_basic_set *)
931 isl_basic_map_extend((struct isl_basic_map *)base,
932 nparam, 0, dim, extra, n_eq, n_ineq);
935 struct isl_basic_set *isl_basic_set_extend_constraints(
936 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
938 return (struct isl_basic_set *)
939 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
943 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
945 return (struct isl_basic_set *)
946 isl_basic_map_cow((struct isl_basic_map *)bset);
949 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
956 bmap = isl_basic_map_dup(bmap);
958 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
962 struct isl_set *isl_set_cow(struct isl_set *set)
970 return isl_set_dup(set);
973 struct isl_map *isl_map_cow(struct isl_map *map)
981 return isl_map_dup(map);
984 static void swap_vars(struct isl_blk blk, isl_int *a,
985 unsigned a_len, unsigned b_len)
987 isl_seq_cpy(blk.data, a+a_len, b_len);
988 isl_seq_cpy(blk.data+b_len, a, a_len);
989 isl_seq_cpy(a, blk.data, b_len+a_len);
992 struct isl_basic_set *isl_basic_set_swap_vars(
993 struct isl_basic_set *bset, unsigned n)
1003 nparam = isl_basic_set_n_param(bset);
1004 dim = isl_basic_set_n_dim(bset);
1005 isl_assert(bset->ctx, n <= dim, goto error);
1010 bset = isl_basic_set_cow(bset);
1014 blk = isl_blk_alloc(bset->ctx, dim);
1015 if (isl_blk_is_error(blk))
1018 for (i = 0; i < bset->n_eq; ++i)
1020 bset->eq[i]+1+nparam, n, dim - n);
1022 for (i = 0; i < bset->n_ineq; ++i)
1024 bset->ineq[i]+1+nparam, n, dim - n);
1026 for (i = 0; i < bset->n_div; ++i)
1028 bset->div[i]+1+1+nparam, n, dim - n);
1030 isl_blk_free(bset->ctx, blk);
1032 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1036 isl_basic_set_free(bset);
1040 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1043 set = isl_set_cow(set);
1047 for (i = 0; i < set->n; ++i) {
1048 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1054 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1058 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1064 total = isl_basic_map_total_dim(bmap);
1065 isl_basic_map_free_div(bmap, bmap->n_div);
1066 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1068 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1070 isl_basic_map_alloc_equality(bmap);
1074 isl_int_set_si(bmap->eq[i][0], 1);
1075 isl_seq_clr(bmap->eq[i]+1, total);
1076 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1077 return isl_basic_map_finalize(bmap);
1079 isl_basic_map_free(bmap);
1083 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1085 return (struct isl_basic_set *)
1086 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1089 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1092 unsigned off = isl_dim_total(bmap->dim);
1093 isl_int *t = bmap->div[a];
1094 bmap->div[a] = bmap->div[b];
1097 for (i = 0; i < bmap->n_eq; ++i)
1098 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1100 for (i = 0; i < bmap->n_ineq; ++i)
1101 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1103 for (i = 0; i < bmap->n_div; ++i)
1104 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1105 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1108 /* Eliminate the specified n dimensions starting at first from the
1109 * constraints using Fourier-Motzkin, The dimensions themselves
1112 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1113 unsigned first, unsigned n)
1123 set = isl_set_cow(set);
1126 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1127 nparam = isl_set_n_param(set);
1129 for (i = 0; i < set->n; ++i) {
1130 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1141 /* Project out n dimensions starting at first using Fourier-Motzkin */
1142 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1143 unsigned first, unsigned n)
1145 set = isl_set_eliminate_dims(set, first, n);
1146 set = isl_set_drop_dims(set, first, n);
1150 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1152 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1160 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1169 set = isl_set_cow(set);
1173 for (i = 0; i < set->n; ++i) {
1174 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1184 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1185 enum isl_dim_type type, unsigned first, unsigned n)
1189 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1193 bmap = isl_basic_map_eliminate_vars(bmap,
1194 isl_basic_map_offset(bmap, type) - 1 + first, n);
1197 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1199 bmap = isl_basic_map_drop(bmap, type, first, n);
1202 isl_basic_map_free(bmap);
1206 struct isl_map *isl_map_remove(struct isl_map *map,
1207 enum isl_dim_type type, unsigned first, unsigned n)
1214 map = isl_map_cow(map);
1217 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1219 for (i = 0; i < map->n; ++i) {
1220 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1221 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1225 map = isl_map_drop(map, type, first, n);
1232 /* Project out n inputs starting at first using Fourier-Motzkin */
1233 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1234 unsigned first, unsigned n)
1236 return isl_map_remove(map, isl_dim_in, first, n);
1239 /* Project out n dimensions starting at first using Fourier-Motzkin */
1240 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1241 unsigned first, unsigned n)
1243 unsigned nparam = isl_basic_set_n_param(bset);
1244 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1245 bset = isl_basic_set_drop_dims(bset, first, n);
1249 static void dump_term(struct isl_basic_map *bmap,
1250 isl_int c, int pos, FILE *out)
1253 unsigned in = isl_basic_map_n_in(bmap);
1254 unsigned dim = in + isl_basic_map_n_out(bmap);
1255 unsigned nparam = isl_basic_map_n_param(bmap);
1257 isl_int_print(out, c, 0);
1259 if (!isl_int_is_one(c))
1260 isl_int_print(out, c, 0);
1261 if (pos < 1 + nparam) {
1262 name = isl_dim_get_name(bmap->dim,
1263 isl_dim_param, pos - 1);
1265 fprintf(out, "%s", name);
1267 fprintf(out, "p%d", pos - 1);
1268 } else if (pos < 1 + nparam + in)
1269 fprintf(out, "i%d", pos - 1 - nparam);
1270 else if (pos < 1 + nparam + dim)
1271 fprintf(out, "o%d", pos - 1 - nparam - in);
1273 fprintf(out, "e%d", pos - 1 - nparam - dim);
1277 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1278 int sign, FILE *out)
1282 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1286 for (i = 0, first = 1; i < len; ++i) {
1287 if (isl_int_sgn(c[i]) * sign <= 0)
1290 fprintf(out, " + ");
1292 isl_int_abs(v, c[i]);
1293 dump_term(bmap, v, i, out);
1300 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1301 const char *op, FILE *out, int indent)
1305 fprintf(out, "%*s", indent, "");
1307 dump_constraint_sign(bmap, c, 1, out);
1308 fprintf(out, " %s ", op);
1309 dump_constraint_sign(bmap, c, -1, out);
1313 for (i = bmap->n_div; i < bmap->extra; ++i) {
1314 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1316 fprintf(out, "%*s", indent, "");
1317 fprintf(out, "ERROR: unused div coefficient not zero\n");
1322 static void dump_constraints(struct isl_basic_map *bmap,
1323 isl_int **c, unsigned n,
1324 const char *op, FILE *out, int indent)
1328 for (i = 0; i < n; ++i)
1329 dump_constraint(bmap, c[i], op, out, indent);
1332 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1336 unsigned total = isl_basic_map_total_dim(bmap);
1338 for (j = 0; j < 1 + total; ++j) {
1339 if (isl_int_is_zero(exp[j]))
1341 if (!first && isl_int_is_pos(exp[j]))
1343 dump_term(bmap, exp[j], j, out);
1348 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1352 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1353 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1355 for (i = 0; i < bmap->n_div; ++i) {
1356 fprintf(out, "%*s", indent, "");
1357 fprintf(out, "e%d = [(", i);
1358 dump_affine(bmap, bmap->div[i]+1, out);
1360 isl_int_print(out, bmap->div[i][0], 0);
1361 fprintf(out, "]\n");
1365 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1368 fprintf(out, "null basic set\n");
1372 fprintf(out, "%*s", indent, "");
1373 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1374 bset->ref, bset->dim->nparam, bset->dim->n_out,
1375 bset->extra, bset->flags);
1376 dump((struct isl_basic_map *)bset, out, indent);
1379 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1382 fprintf(out, "null basic map\n");
1386 fprintf(out, "%*s", indent, "");
1387 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1388 "flags: %x, n_name: %d\n",
1390 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1391 bmap->extra, bmap->flags, bmap->dim->n_name);
1392 dump(bmap, out, indent);
1395 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1400 total = isl_basic_map_total_dim(bmap);
1401 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1402 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1403 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1404 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1408 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1410 struct isl_set *set;
1414 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1415 isl_assert(dim->ctx, n >= 0, return NULL);
1416 set = isl_alloc(dim->ctx, struct isl_set,
1417 sizeof(struct isl_set) +
1418 (n - 1) * sizeof(struct isl_basic_set *));
1422 set->ctx = dim->ctx;
1423 isl_ctx_ref(set->ctx);
1435 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1436 unsigned nparam, unsigned dim, int n, unsigned flags)
1438 struct isl_set *set;
1439 struct isl_dim *dims;
1441 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1445 set = isl_set_alloc_dim(dims, n, flags);
1449 /* Make sure "map" has room for at least "n" more basic maps.
1451 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1454 struct isl_map *grown = NULL;
1458 isl_assert(map->ctx, n >= 0, goto error);
1459 if (map->n + n <= map->size)
1461 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1464 for (i = 0; i < map->n; ++i) {
1465 grown->p[i] = isl_basic_map_copy(map->p[i]);
1473 isl_map_free(grown);
1478 /* Make sure "set" has room for at least "n" more basic sets.
1480 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1482 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1485 struct isl_set *isl_set_dup(struct isl_set *set)
1488 struct isl_set *dup;
1493 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1496 for (i = 0; i < set->n; ++i)
1497 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1501 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1503 struct isl_set *set;
1508 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1510 isl_basic_set_free(bset);
1513 return isl_set_add(set, bset);
1516 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1518 struct isl_map *map;
1523 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1525 isl_basic_map_free(bmap);
1528 return isl_map_add(map, bmap);
1531 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1533 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1534 (struct isl_basic_map *)bset);
1537 void isl_set_free(struct isl_set *set)
1547 isl_ctx_deref(set->ctx);
1548 for (i = 0; i < set->n; ++i)
1549 isl_basic_set_free(set->p[i]);
1550 isl_dim_free(set->dim);
1554 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1559 fprintf(out, "null set\n");
1563 fprintf(out, "%*s", indent, "");
1564 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1565 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1567 for (i = 0; i < set->n; ++i) {
1568 fprintf(out, "%*s", indent, "");
1569 fprintf(out, "basic set %d:\n", i);
1570 isl_basic_set_dump(set->p[i], out, indent+4);
1574 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1579 fprintf(out, "null map\n");
1583 fprintf(out, "%*s", indent, "");
1584 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1585 "flags: %x, n_name: %d\n",
1586 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1587 map->dim->n_out, map->flags, map->dim->n_name);
1588 for (i = 0; i < map->n; ++i) {
1589 fprintf(out, "%*s", indent, "");
1590 fprintf(out, "basic map %d:\n", i);
1591 isl_basic_map_dump(map->p[i], out, indent+4);
1595 struct isl_basic_map *isl_basic_map_intersect_domain(
1596 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1598 struct isl_basic_map *bmap_domain;
1599 struct isl_dim *dim;
1604 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1605 bset->dim, isl_dim_param), goto error);
1607 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1608 isl_assert(bset->ctx,
1609 isl_basic_map_compatible_domain(bmap, bset), goto error);
1611 bmap = isl_basic_map_cow(bmap);
1612 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1613 bset->n_div, bset->n_eq, bset->n_ineq);
1616 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1617 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1618 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1620 bmap = isl_basic_map_simplify(bmap);
1621 return isl_basic_map_finalize(bmap);
1623 isl_basic_map_free(bmap);
1624 isl_basic_set_free(bset);
1628 struct isl_basic_map *isl_basic_map_intersect_range(
1629 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1631 struct isl_basic_map *bmap_range;
1636 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1637 bset->dim, isl_dim_param), goto error);
1639 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1640 isl_assert(bset->ctx,
1641 isl_basic_map_compatible_range(bmap, bset), goto error);
1643 bmap = isl_basic_map_cow(bmap);
1644 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1645 bset->n_div, bset->n_eq, bset->n_ineq);
1648 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1649 bmap = add_constraints(bmap, bmap_range, 0, 0);
1651 bmap = isl_basic_map_simplify(bmap);
1652 return isl_basic_map_finalize(bmap);
1654 isl_basic_map_free(bmap);
1655 isl_basic_set_free(bset);
1659 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1665 total = 1 + isl_basic_map_total_dim(bmap);
1666 if (total != vec->size)
1671 for (i = 0; i < bmap->n_eq; ++i) {
1672 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1673 if (!isl_int_is_zero(s)) {
1679 for (i = 0; i < bmap->n_ineq; ++i) {
1680 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1681 if (isl_int_is_neg(s)) {
1692 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1694 return basic_map_contains((struct isl_basic_map *)bset, vec);
1697 struct isl_basic_map *isl_basic_map_intersect(
1698 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1700 struct isl_vec *sample = NULL;
1702 if (!bmap1 || !bmap2)
1705 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1706 bmap2->dim, isl_dim_param), goto error);
1707 if (isl_dim_total(bmap1->dim) ==
1708 isl_dim_size(bmap1->dim, isl_dim_param) &&
1709 isl_dim_total(bmap2->dim) !=
1710 isl_dim_size(bmap2->dim, isl_dim_param))
1711 return isl_basic_map_intersect(bmap2, bmap1);
1713 if (isl_dim_total(bmap2->dim) !=
1714 isl_dim_size(bmap2->dim, isl_dim_param))
1715 isl_assert(bmap1->ctx,
1716 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1718 if (bmap1->sample &&
1719 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1720 basic_map_contains(bmap2, bmap1->sample) > 0)
1721 sample = isl_vec_copy(bmap1->sample);
1722 else if (bmap2->sample &&
1723 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1724 basic_map_contains(bmap2, bmap2->sample) > 0)
1725 sample = isl_vec_copy(bmap2->sample);
1727 bmap1 = isl_basic_map_cow(bmap1);
1728 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1729 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1732 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1735 isl_vec_free(bmap1->sample);
1736 bmap1->sample = sample;
1739 bmap1 = isl_basic_map_simplify(bmap1);
1740 return isl_basic_map_finalize(bmap1);
1743 isl_vec_free(sample);
1744 isl_basic_map_free(bmap1);
1745 isl_basic_map_free(bmap2);
1749 struct isl_basic_set *isl_basic_set_intersect(
1750 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1752 return (struct isl_basic_set *)
1753 isl_basic_map_intersect(
1754 (struct isl_basic_map *)bset1,
1755 (struct isl_basic_map *)bset2);
1758 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1761 struct isl_map *result;
1767 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1768 map2->dim, isl_dim_param), goto error);
1769 if (isl_dim_total(map1->dim) ==
1770 isl_dim_size(map1->dim, isl_dim_param) &&
1771 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1772 return isl_map_intersect(map2, map1);
1774 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1775 isl_assert(map1->ctx,
1776 isl_dim_equal(map1->dim, map2->dim), goto error);
1778 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1779 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1780 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1782 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1783 map1->n * map2->n, flags);
1786 for (i = 0; i < map1->n; ++i)
1787 for (j = 0; j < map2->n; ++j) {
1788 struct isl_basic_map *part;
1789 part = isl_basic_map_intersect(
1790 isl_basic_map_copy(map1->p[i]),
1791 isl_basic_map_copy(map2->p[j]));
1792 if (isl_basic_map_is_empty(part))
1793 isl_basic_map_free(part);
1795 result = isl_map_add(result, part);
1808 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1810 return (struct isl_set *)
1811 isl_map_intersect((struct isl_map *)set1,
1812 (struct isl_map *)set2);
1815 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1817 struct isl_dim *dim;
1818 struct isl_basic_set *bset;
1823 bmap = isl_basic_map_cow(bmap);
1826 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1827 in = isl_basic_map_n_in(bmap);
1828 bset = isl_basic_set_from_basic_map(bmap);
1829 bset = isl_basic_set_swap_vars(bset, in);
1830 return isl_basic_map_from_basic_set(bset, dim);
1833 /* Turn final n dimensions into existentially quantified variables.
1835 struct isl_basic_set *isl_basic_set_project_out(
1836 struct isl_basic_set *bset, unsigned n, unsigned flags)
1846 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1851 bset = isl_basic_set_cow(bset);
1853 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1854 old = bset->block2.data;
1855 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1856 (bset->extra + n) * (1 + row_size));
1857 if (!bset->block2.data)
1859 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1862 for (i = 0; i < n; ++i) {
1863 new_div[i] = bset->block2.data +
1864 (bset->extra + i) * (1 + row_size);
1865 isl_seq_clr(new_div[i], 1 + row_size);
1867 for (i = 0; i < bset->extra; ++i)
1868 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1870 bset->div = new_div;
1873 bset->dim = isl_dim_drop_outputs(bset->dim,
1874 isl_basic_set_n_dim(bset) - n, n);
1877 bset = isl_basic_set_simplify(bset);
1878 bset = isl_basic_set_drop_redundant_divs(bset);
1879 return isl_basic_set_finalize(bset);
1881 isl_basic_set_free(bset);
1885 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1889 for (i = 0; i < n; ++i) {
1890 j = isl_basic_map_alloc_div(bmap);
1893 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1897 isl_basic_map_free(bmap);
1901 struct isl_basic_map *isl_basic_map_apply_range(
1902 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1904 struct isl_dim *dim_result = NULL;
1905 struct isl_basic_map *bmap;
1906 unsigned n_in, n_out, n, nparam, total, pos;
1907 struct isl_dim_map *dim_map1, *dim_map2;
1909 if (!bmap1 || !bmap2)
1912 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1913 isl_dim_copy(bmap2->dim));
1915 n_in = isl_basic_map_n_in(bmap1);
1916 n_out = isl_basic_map_n_out(bmap2);
1917 n = isl_basic_map_n_out(bmap1);
1918 nparam = isl_basic_map_n_param(bmap1);
1920 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1921 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1922 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1923 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1924 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1925 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1926 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1927 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1928 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1929 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1930 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1932 bmap = isl_basic_map_alloc_dim(dim_result,
1933 bmap1->n_div + bmap2->n_div + n,
1934 bmap1->n_eq + bmap2->n_eq,
1935 bmap1->n_ineq + bmap2->n_ineq);
1936 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1937 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1938 bmap = add_divs(bmap, n);
1939 bmap = isl_basic_map_simplify(bmap);
1940 bmap = isl_basic_map_drop_redundant_divs(bmap);
1941 return isl_basic_map_finalize(bmap);
1943 isl_basic_map_free(bmap1);
1944 isl_basic_map_free(bmap2);
1948 struct isl_basic_set *isl_basic_set_apply(
1949 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1954 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
1957 return (struct isl_basic_set *)
1958 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1960 isl_basic_set_free(bset);
1961 isl_basic_map_free(bmap);
1965 struct isl_basic_map *isl_basic_map_apply_domain(
1966 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1968 if (!bmap1 || !bmap2)
1971 isl_assert(bmap1->ctx,
1972 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1973 isl_assert(bmap1->ctx,
1974 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1977 bmap1 = isl_basic_map_reverse(bmap1);
1978 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1979 return isl_basic_map_reverse(bmap1);
1981 isl_basic_map_free(bmap1);
1982 isl_basic_map_free(bmap2);
1986 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1987 * A \cap B -> f(A) + f(B)
1989 struct isl_basic_map *isl_basic_map_sum(
1990 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1992 unsigned n_in, n_out, nparam, total, pos;
1993 struct isl_basic_map *bmap = NULL;
1994 struct isl_dim_map *dim_map1, *dim_map2;
1997 if (!bmap1 || !bmap2)
2000 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2003 nparam = isl_basic_map_n_param(bmap1);
2004 n_in = isl_basic_map_n_in(bmap1);
2005 n_out = isl_basic_map_n_out(bmap1);
2007 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2008 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2009 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2010 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2011 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2012 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2013 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2014 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2015 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2016 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2017 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2019 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2020 bmap1->n_div + bmap2->n_div + 2 * n_out,
2021 bmap1->n_eq + bmap2->n_eq + n_out,
2022 bmap1->n_ineq + bmap2->n_ineq);
2023 for (i = 0; i < n_out; ++i) {
2024 int j = isl_basic_map_alloc_equality(bmap);
2027 isl_seq_clr(bmap->eq[j], 1+total);
2028 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2029 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2030 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2032 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2033 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2034 bmap = add_divs(bmap, 2 * n_out);
2036 bmap = isl_basic_map_simplify(bmap);
2037 return isl_basic_map_finalize(bmap);
2039 isl_basic_map_free(bmap);
2040 isl_basic_map_free(bmap1);
2041 isl_basic_map_free(bmap2);
2045 /* Given two maps A -> f(A) and B -> g(B), construct a map
2046 * A \cap B -> f(A) + f(B)
2048 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2050 struct isl_map *result;
2056 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2058 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2059 map1->n * map2->n, 0);
2062 for (i = 0; i < map1->n; ++i)
2063 for (j = 0; j < map2->n; ++j) {
2064 struct isl_basic_map *part;
2065 part = isl_basic_map_sum(
2066 isl_basic_map_copy(map1->p[i]),
2067 isl_basic_map_copy(map2->p[j]));
2068 if (isl_basic_map_is_empty(part))
2069 isl_basic_map_free(part);
2071 result = isl_map_add(result, part);
2084 /* Given a basic map A -> f(A), construct A -> -f(A).
2086 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2091 bmap = isl_basic_map_cow(bmap);
2095 n = isl_basic_map_dim(bmap, isl_dim_out);
2096 off = isl_basic_map_offset(bmap, isl_dim_out);
2097 for (i = 0; i < bmap->n_eq; ++i)
2098 for (j = 0; j < n; ++j)
2099 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2100 for (i = 0; i < bmap->n_ineq; ++i)
2101 for (j = 0; j < n; ++j)
2102 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2103 for (i = 0; i < bmap->n_div; ++i)
2104 for (j = 0; j < n; ++j)
2105 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2106 return isl_basic_map_finalize(bmap);
2109 /* Given a map A -> f(A), construct A -> -f(A).
2111 struct isl_map *isl_map_neg(struct isl_map *map)
2115 map = isl_map_cow(map);
2119 for (i = 0; i < map->n; ++i) {
2120 map->p[i] = isl_basic_map_neg(map->p[i]);
2131 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2132 * A -> floor(f(A)/d).
2134 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2137 unsigned n_in, n_out, nparam, total, pos;
2138 struct isl_basic_map *result = NULL;
2139 struct isl_dim_map *dim_map;
2145 nparam = isl_basic_map_n_param(bmap);
2146 n_in = isl_basic_map_n_in(bmap);
2147 n_out = isl_basic_map_n_out(bmap);
2149 total = nparam + n_in + n_out + bmap->n_div + n_out;
2150 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2151 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2152 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2153 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2154 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2156 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2157 bmap->n_div + n_out,
2158 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2159 result = add_constraints_dim_map(result, bmap, dim_map);
2160 result = add_divs(result, n_out);
2161 for (i = 0; i < n_out; ++i) {
2163 j = isl_basic_map_alloc_inequality(result);
2166 isl_seq_clr(result->ineq[j], 1+total);
2167 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2168 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2169 j = isl_basic_map_alloc_inequality(result);
2172 isl_seq_clr(result->ineq[j], 1+total);
2173 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2174 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2175 isl_int_sub_ui(result->ineq[j][0], d, 1);
2178 result = isl_basic_map_simplify(result);
2179 return isl_basic_map_finalize(result);
2181 isl_basic_map_free(result);
2185 /* Given a map A -> f(A) and an integer d, construct a map
2186 * A -> floor(f(A)/d).
2188 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2192 map = isl_map_cow(map);
2196 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2197 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2198 for (i = 0; i < map->n; ++i) {
2199 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2210 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2216 i = isl_basic_map_alloc_equality(bmap);
2219 nparam = isl_basic_map_n_param(bmap);
2220 n_in = isl_basic_map_n_in(bmap);
2221 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2222 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2223 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2224 return isl_basic_map_finalize(bmap);
2226 isl_basic_map_free(bmap);
2230 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2236 i = isl_basic_map_alloc_inequality(bmap);
2239 nparam = isl_basic_map_n_param(bmap);
2240 n_in = isl_basic_map_n_in(bmap);
2241 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2242 isl_int_set_si(bmap->ineq[i][0], -1);
2243 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2244 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2245 return isl_basic_map_finalize(bmap);
2247 isl_basic_map_free(bmap);
2251 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2257 i = isl_basic_map_alloc_inequality(bmap);
2260 nparam = isl_basic_map_n_param(bmap);
2261 n_in = isl_basic_map_n_in(bmap);
2262 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2263 isl_int_set_si(bmap->ineq[i][0], -1);
2264 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2265 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2266 return isl_basic_map_finalize(bmap);
2268 isl_basic_map_free(bmap);
2272 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2275 struct isl_basic_map *bmap;
2276 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2279 for (i = 0; i < n_equal && bmap; ++i)
2280 bmap = var_equal(bmap, i);
2281 return isl_basic_map_finalize(bmap);
2284 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2287 struct isl_basic_map *bmap;
2288 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2291 for (i = 0; i < pos && bmap; ++i)
2292 bmap = var_equal(bmap, i);
2294 bmap = var_less(bmap, pos);
2295 return isl_basic_map_finalize(bmap);
2298 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2301 struct isl_basic_map *bmap;
2302 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2305 for (i = 0; i < pos && bmap; ++i)
2306 bmap = var_equal(bmap, i);
2308 bmap = var_more(bmap, pos);
2309 return isl_basic_map_finalize(bmap);
2312 struct isl_basic_map *isl_basic_map_from_basic_set(
2313 struct isl_basic_set *bset, struct isl_dim *dim)
2315 struct isl_basic_map *bmap;
2317 bset = isl_basic_set_cow(bset);
2321 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2322 isl_dim_free(bset->dim);
2323 bmap = (struct isl_basic_map *) bset;
2325 return isl_basic_map_finalize(bmap);
2327 isl_basic_set_free(bset);
2332 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2336 if (bmap->dim->n_in == 0)
2337 return (struct isl_basic_set *)bmap;
2338 bmap = isl_basic_map_cow(bmap);
2341 bmap->dim = isl_dim_cow(bmap->dim);
2344 bmap->dim->n_out += bmap->dim->n_in;
2345 bmap->dim->n_in = 0;
2346 bmap = isl_basic_map_finalize(bmap);
2347 return (struct isl_basic_set *)bmap;
2349 isl_basic_map_free(bmap);
2353 /* For a div d = floor(f/m), add the constraints
2356 * -(f-(n-1)) + m d >= 0
2358 * Note that the second constraint is the negation of
2362 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2365 unsigned total = isl_basic_map_total_dim(bmap);
2366 unsigned div_pos = 1 + total - bmap->n_div + div;
2368 i = isl_basic_map_alloc_inequality(bmap);
2371 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2372 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2374 j = isl_basic_map_alloc_inequality(bmap);
2377 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2378 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2379 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2383 struct isl_basic_set *isl_basic_map_underlying_set(
2384 struct isl_basic_map *bmap)
2388 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2389 return (struct isl_basic_set *)bmap;
2390 bmap = isl_basic_map_cow(bmap);
2393 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2396 bmap->extra -= bmap->n_div;
2398 bmap = isl_basic_map_finalize(bmap);
2399 return (struct isl_basic_set *)bmap;
2404 struct isl_basic_map *isl_basic_map_overlying_set(
2405 struct isl_basic_set *bset, struct isl_basic_map *like)
2407 struct isl_basic_map *bmap;
2408 struct isl_ctx *ctx;
2415 isl_assert(ctx, bset->n_div == 0, goto error);
2416 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2417 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2419 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2420 isl_basic_map_free(like);
2421 return (struct isl_basic_map *)bset;
2423 bset = isl_basic_set_cow(bset);
2426 total = bset->dim->n_out + bset->extra;
2427 bmap = (struct isl_basic_map *)bset;
2428 isl_dim_free(bmap->dim);
2429 bmap->dim = isl_dim_copy(like->dim);
2432 bmap->n_div = like->n_div;
2433 bmap->extra += like->n_div;
2436 ltotal = total - bmap->extra + like->extra;
2439 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2440 bmap->extra * (1 + 1 + total));
2441 if (isl_blk_is_error(bmap->block2))
2443 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2447 for (i = 0; i < bmap->extra; ++i)
2448 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2449 for (i = 0; i < like->n_div; ++i) {
2450 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2451 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2453 bmap = isl_basic_map_extend_constraints(bmap,
2454 0, 2 * like->n_div);
2455 for (i = 0; i < like->n_div; ++i) {
2456 if (isl_int_is_zero(bmap->div[i][0]))
2458 if (add_div_constraints(bmap, i) < 0)
2462 isl_basic_map_free(like);
2463 bmap = isl_basic_map_simplify(bmap);
2464 bmap = isl_basic_map_finalize(bmap);
2467 isl_basic_map_free(like);
2468 isl_basic_set_free(bset);
2472 struct isl_basic_set *isl_basic_set_from_underlying_set(
2473 struct isl_basic_set *bset, struct isl_basic_set *like)
2475 return (struct isl_basic_set *)
2476 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2479 struct isl_set *isl_set_from_underlying_set(
2480 struct isl_set *set, struct isl_basic_set *like)
2486 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2488 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2489 isl_basic_set_free(like);
2492 set = isl_set_cow(set);
2495 for (i = 0; i < set->n; ++i) {
2496 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2497 isl_basic_set_copy(like));
2501 isl_dim_free(set->dim);
2502 set->dim = isl_dim_copy(like->dim);
2505 isl_basic_set_free(like);
2508 isl_basic_set_free(like);
2513 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2517 map = isl_map_cow(map);
2520 map->dim = isl_dim_cow(map->dim);
2524 for (i = 1; i < map->n; ++i)
2525 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2527 for (i = 0; i < map->n; ++i) {
2528 map->p[i] = (struct isl_basic_map *)
2529 isl_basic_map_underlying_set(map->p[i]);
2534 map->dim = isl_dim_underlying(map->dim, 0);
2536 isl_dim_free(map->dim);
2537 map->dim = isl_dim_copy(map->p[0]->dim);
2541 return (struct isl_set *)map;
2547 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2549 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2552 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2554 struct isl_basic_set *domain;
2558 n_out = isl_basic_map_n_out(bmap);
2559 domain = isl_basic_set_from_basic_map(bmap);
2560 return isl_basic_set_project_out(domain, n_out, 0);
2563 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2565 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2568 struct isl_set *isl_map_range(struct isl_map *map)
2571 struct isl_set *set;
2575 map = isl_map_cow(map);
2579 set = (struct isl_set *) map;
2580 if (set->dim->n_in != 0) {
2581 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2585 for (i = 0; i < map->n; ++i) {
2586 set->p[i] = isl_basic_map_range(map->p[i]);
2590 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2591 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2598 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2601 struct isl_map *map = NULL;
2603 set = isl_set_cow(set);
2606 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2607 map = (struct isl_map *)set;
2608 for (i = 0; i < set->n; ++i) {
2609 map->p[i] = isl_basic_map_from_basic_set(
2610 set->p[i], isl_dim_copy(dim));
2614 isl_dim_free(map->dim);
2623 struct isl_map *isl_map_from_range(struct isl_set *set)
2625 return (struct isl_map *)set;
2628 struct isl_set *isl_set_from_map(struct isl_map *map)
2631 struct isl_set *set = NULL;
2635 map = isl_map_cow(map);
2638 map->dim = isl_dim_cow(map->dim);
2641 map->dim->n_out += map->dim->n_in;
2643 set = (struct isl_set *)map;
2644 for (i = 0; i < map->n; ++i) {
2645 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2655 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2657 struct isl_map *map;
2661 isl_assert(dim->ctx, n >= 0, return NULL);
2662 map = isl_alloc(dim->ctx, struct isl_map,
2663 sizeof(struct isl_map) +
2664 (n - 1) * sizeof(struct isl_basic_map *));
2668 map->ctx = dim->ctx;
2669 isl_ctx_ref(map->ctx);
2681 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2682 unsigned nparam, unsigned in, unsigned out, int n,
2685 struct isl_map *map;
2686 struct isl_dim *dims;
2688 dims = isl_dim_alloc(ctx, nparam, in, out);
2692 map = isl_map_alloc_dim(dims, n, flags);
2696 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
2698 struct isl_basic_map *bmap;
2699 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
2700 bmap = isl_basic_map_set_to_empty(bmap);
2704 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2706 struct isl_basic_set *bset;
2707 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2708 bset = isl_basic_set_set_to_empty(bset);
2712 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2714 struct isl_basic_map *bmap;
2717 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2718 bmap = isl_basic_map_set_to_empty(bmap);
2722 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2724 struct isl_basic_map *bmap;
2727 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2728 bmap = isl_basic_map_set_to_empty(bmap);
2732 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2734 struct isl_basic_set *bset;
2737 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2738 bset = isl_basic_set_set_to_empty(bset);
2742 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2744 struct isl_basic_map *bmap;
2745 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2749 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2751 struct isl_basic_set *bset;
2752 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2756 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2760 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2763 struct isl_map *isl_map_empty(struct isl_dim *dim)
2765 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2768 struct isl_map *isl_map_empty_like(struct isl_map *model)
2772 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2775 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2779 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2782 struct isl_set *isl_set_empty(struct isl_dim *dim)
2784 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2787 struct isl_set *isl_set_empty_like(struct isl_set *model)
2791 return isl_set_empty(isl_dim_copy(model->dim));
2794 struct isl_map *isl_map_universe(struct isl_dim *dim)
2796 struct isl_map *map;
2799 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2800 map = isl_map_add(map, isl_basic_map_universe(dim));
2804 struct isl_set *isl_set_universe(struct isl_dim *dim)
2806 struct isl_set *set;
2809 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2810 set = isl_set_add(set, isl_basic_set_universe(dim));
2814 struct isl_map *isl_map_dup(struct isl_map *map)
2817 struct isl_map *dup;
2821 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2822 for (i = 0; i < map->n; ++i)
2823 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2827 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2831 if (isl_basic_map_fast_is_empty(bmap)) {
2832 isl_basic_map_free(bmap);
2835 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2836 isl_assert(map->ctx, map->n < map->size, goto error);
2837 map->p[map->n] = bmap;
2839 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2845 isl_basic_map_free(bmap);
2849 void isl_map_free(struct isl_map *map)
2859 isl_ctx_deref(map->ctx);
2860 for (i = 0; i < map->n; ++i)
2861 isl_basic_map_free(map->p[i]);
2862 isl_dim_free(map->dim);
2866 struct isl_map *isl_map_extend(struct isl_map *base,
2867 unsigned nparam, unsigned n_in, unsigned n_out)
2871 base = isl_map_cow(base);
2875 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2878 for (i = 0; i < base->n; ++i) {
2879 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2880 isl_dim_copy(base->dim), 0, 0, 0);
2890 struct isl_set *isl_set_extend(struct isl_set *base,
2891 unsigned nparam, unsigned dim)
2893 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2897 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2898 unsigned pos, int value)
2902 bmap = isl_basic_map_cow(bmap);
2903 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2904 j = isl_basic_map_alloc_equality(bmap);
2907 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
2908 isl_int_set_si(bmap->eq[j][pos], -1);
2909 isl_int_set_si(bmap->eq[j][0], value);
2910 bmap = isl_basic_map_simplify(bmap);
2911 return isl_basic_map_finalize(bmap);
2913 isl_basic_map_free(bmap);
2917 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2918 enum isl_dim_type type, unsigned pos, int value)
2922 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2923 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2926 isl_basic_map_free(bmap);
2930 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2931 enum isl_dim_type type, unsigned pos, int value)
2933 return (struct isl_basic_set *)
2934 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2938 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2939 unsigned input, int value)
2941 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2944 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2945 unsigned dim, int value)
2947 return (struct isl_basic_set *)
2948 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2949 isl_dim_set, dim, value);
2952 struct isl_map *isl_map_fix_si(struct isl_map *map,
2953 enum isl_dim_type type, unsigned pos, int value)
2957 map = isl_map_cow(map);
2961 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
2962 for (i = 0; i < map->n; ++i) {
2963 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2967 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2974 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2975 unsigned input, int value)
2977 return isl_map_fix_si(map, isl_dim_in, input, value);
2980 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2982 return (struct isl_set *)
2983 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2986 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2987 unsigned dim, isl_int value)
2991 bset = isl_basic_set_cow(bset);
2992 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2993 j = isl_basic_set_alloc_inequality(bset);
2996 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2997 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2998 isl_int_neg(bset->ineq[j][0], value);
2999 bset = isl_basic_set_simplify(bset);
3000 return isl_basic_set_finalize(bset);
3002 isl_basic_set_free(bset);
3006 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3011 set = isl_set_cow(set);
3015 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3016 for (i = 0; i < set->n; ++i) {
3017 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3027 struct isl_map *isl_map_reverse(struct isl_map *map)
3031 map = isl_map_cow(map);
3035 map->dim = isl_dim_reverse(map->dim);
3038 for (i = 0; i < map->n; ++i) {
3039 map->p[i] = isl_basic_map_reverse(map->p[i]);
3043 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3050 static struct isl_map *isl_basic_map_partial_lexopt(
3051 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3052 struct isl_set **empty, int max)
3056 if (bmap->ctx->pip == ISL_PIP_PIP)
3057 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3059 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3061 isl_basic_map_free(bmap);
3062 isl_basic_set_free(dom);
3068 struct isl_map *isl_basic_map_partial_lexmax(
3069 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3070 struct isl_set **empty)
3072 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3075 struct isl_map *isl_basic_map_partial_lexmin(
3076 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3077 struct isl_set **empty)
3079 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3082 struct isl_set *isl_basic_set_partial_lexmin(
3083 struct isl_basic_set *bset, struct isl_basic_set *dom,
3084 struct isl_set **empty)
3086 return (struct isl_set *)
3087 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3091 struct isl_set *isl_basic_set_partial_lexmax(
3092 struct isl_basic_set *bset, struct isl_basic_set *dom,
3093 struct isl_set **empty)
3095 return (struct isl_set *)
3096 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3100 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
3102 struct isl_basic_map *bmap = NULL;
3103 struct isl_basic_set *dom = NULL;
3104 struct isl_map *min;
3105 struct isl_dim *param_dim;
3109 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
3112 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3113 dom = isl_basic_set_universe(param_dim);
3116 min = isl_basic_map_partial_lexmin(bmap, dom, NULL);
3117 return isl_map_range(min);
3119 isl_basic_map_free(bmap);
3123 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3124 struct isl_dim *dim)
3131 for (i = 0; i < map->n; ++i) {
3132 isl_dim_free(map->p[i]->dim);
3133 map->p[i]->dim = isl_dim_copy(dim);
3135 isl_dim_free(map->dim);
3145 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3146 struct isl_dim *dim)
3148 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3151 /* Apply a preimage specified by "mat" on the parameters of "bset".
3152 * bset is assumed to have only parameters and divs.
3154 static struct isl_basic_set *basic_set_parameter_preimage(
3155 struct isl_basic_set *bset, struct isl_mat *mat)
3162 bset->dim = isl_dim_cow(bset->dim);
3166 nparam = isl_basic_set_dim(bset, isl_dim_param);
3168 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3170 bset->dim->nparam = 0;
3171 bset->dim->n_out = nparam;
3172 bset = isl_basic_set_preimage(bset, mat);
3174 bset->dim->nparam = bset->dim->n_out;
3175 bset->dim->n_out = 0;
3180 isl_basic_set_free(bset);
3184 /* Apply a preimage specified by "mat" on the parameters of "set".
3185 * set is assumed to have only parameters and divs.
3187 static struct isl_set *set_parameter_preimage(
3188 struct isl_set *set, struct isl_mat *mat)
3190 struct isl_dim *dim = NULL;
3196 dim = isl_dim_copy(set->dim);
3197 dim = isl_dim_cow(dim);
3201 nparam = isl_set_dim(set, isl_dim_param);
3203 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3206 dim->n_out = nparam;
3207 isl_set_reset_dim(set, dim);
3208 set = isl_set_preimage(set, mat);
3211 dim = isl_dim_copy(set->dim);
3212 dim = isl_dim_cow(dim);
3215 dim->nparam = dim->n_out;
3217 isl_set_reset_dim(set, dim);
3227 /* Intersect the basic set "bset" with the affine space specified by the
3228 * equalities in "eq".
3230 static struct isl_basic_set *basic_set_append_equalities(
3231 struct isl_basic_set *bset, struct isl_mat *eq)
3239 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3244 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3245 for (i = 0; i < eq->n_row; ++i) {
3246 k = isl_basic_set_alloc_equality(bset);
3249 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3250 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3257 isl_basic_set_free(bset);
3261 /* Intersect the set "set" with the affine space specified by the
3262 * equalities in "eq".
3264 static struct isl_set *set_append_equalities(struct isl_set *set,
3272 for (i = 0; i < set->n; ++i) {
3273 set->p[i] = basic_set_append_equalities(set->p[i],
3286 /* Project the given basic set onto its parameter domain, possibly introducing
3287 * new, explicit, existential variables in the constraints.
3288 * The input has parameters and (possibly implicit) existential variables.
3289 * The output has the same parameters, but only
3290 * explicit existentially quantified variables.
3292 * The actual projection is performed by pip, but pip doesn't seem
3293 * to like equalities very much, so we first remove the equalities
3294 * among the parameters by performing a variable compression on
3295 * the parameters. Afterward, an inverse transformation is performed
3296 * and the equalities among the parameters are inserted back in.
3298 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3302 struct isl_mat *T, *T2;
3303 struct isl_set *set;
3304 unsigned nparam, n_div;
3306 bset = isl_basic_set_cow(bset);
3310 if (bset->n_eq == 0)
3311 return isl_basic_set_lexmin(bset);
3313 isl_basic_set_gauss(bset, NULL);
3315 nparam = isl_basic_set_dim(bset, isl_dim_param);
3316 n_div = isl_basic_set_dim(bset, isl_dim_div);
3318 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3319 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3322 if (i == bset->n_eq)
3323 return isl_basic_set_lexmin(bset);
3325 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3327 eq = isl_mat_cow(eq);
3328 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3329 bset = basic_set_parameter_preimage(bset, T);
3331 set = isl_basic_set_lexmin(bset);
3332 set = set_parameter_preimage(set, T2);
3333 set = set_append_equalities(set, eq);
3337 /* Compute an explicit representation for all the existentially
3338 * quantified variables.
3339 * The input and output dimensions are first turned into parameters.
3340 * compute_divs then returns a map with the same parameters and
3341 * no input or output dimensions and the dimension specification
3342 * is reset to that of the input.
3344 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3346 struct isl_basic_set *bset;
3347 struct isl_set *set;
3348 struct isl_map *map;
3349 struct isl_dim *dim, *orig_dim = NULL;
3354 bmap = isl_basic_map_cow(bmap);
3358 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3359 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3360 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3361 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3365 orig_dim = bmap->dim;
3367 bset = (struct isl_basic_set *)bmap;
3369 set = parameter_compute_divs(bset);
3370 map = (struct isl_map *)set;
3371 map = isl_map_reset_dim(map, orig_dim);
3375 isl_basic_map_free(bmap);
3379 /* If bmap contains any unknown divs, then compute explicit
3380 * expressions for them. However, this computation may be
3381 * quite expensive, so first try to remove divs that aren't
3384 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3391 off = isl_dim_total(bmap->dim);
3392 for (i = 0; i < bmap->n_div; ++i) {
3393 if (isl_int_is_zero(bmap->div[i][0]))
3395 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3398 if (i == bmap->n_div)
3399 return isl_map_from_basic_map(bmap);
3400 bmap = isl_basic_map_drop_redundant_divs(bmap);
3403 for (i = 0; i < bmap->n_div; ++i)
3404 if (isl_int_is_zero(bmap->div[i][0]))
3406 if (i == bmap->n_div)
3407 return isl_map_from_basic_map(bmap);
3408 struct isl_map *map = compute_divs(bmap);
3411 isl_basic_map_free(bmap);
3415 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3418 struct isl_map *res;
3424 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3425 for (i = 1 ; i < map->n; ++i) {
3427 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3428 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3429 res = isl_map_union_disjoint(res, r2);
3431 res = isl_map_union(res, r2);
3438 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3440 return (struct isl_set *)
3441 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3444 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3446 return (struct isl_set *)
3447 isl_map_compute_divs((struct isl_map *)set);
3450 struct isl_set *isl_map_domain(struct isl_map *map)
3453 struct isl_set *set;
3458 map = isl_map_cow(map);
3462 set = (struct isl_set *)map;
3463 set->dim = isl_dim_domain(set->dim);
3466 for (i = 0; i < map->n; ++i) {
3467 set->p[i] = isl_basic_map_domain(map->p[i]);
3471 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3472 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3479 struct isl_map *isl_map_union_disjoint(
3480 struct isl_map *map1, struct isl_map *map2)
3484 struct isl_map *map = NULL;
3498 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3500 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3501 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3502 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3504 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3505 map1->n + map2->n, flags);
3508 for (i = 0; i < map1->n; ++i) {
3509 map = isl_map_add(map,
3510 isl_basic_map_copy(map1->p[i]));
3514 for (i = 0; i < map2->n; ++i) {
3515 map = isl_map_add(map,
3516 isl_basic_map_copy(map2->p[i]));
3530 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3532 map1 = isl_map_union_disjoint(map1, map2);
3536 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3540 struct isl_set *isl_set_union_disjoint(
3541 struct isl_set *set1, struct isl_set *set2)
3543 return (struct isl_set *)
3544 isl_map_union_disjoint(
3545 (struct isl_map *)set1, (struct isl_map *)set2);
3548 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3550 return (struct isl_set *)
3551 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3554 struct isl_map *isl_map_intersect_range(
3555 struct isl_map *map, struct isl_set *set)
3558 struct isl_map *result;
3564 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3565 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3566 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3568 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3569 map->n * set->n, flags);
3572 for (i = 0; i < map->n; ++i)
3573 for (j = 0; j < set->n; ++j) {
3574 result = isl_map_add(result,
3575 isl_basic_map_intersect_range(
3576 isl_basic_map_copy(map->p[i]),
3577 isl_basic_set_copy(set->p[j])));
3590 struct isl_map *isl_map_intersect_domain(
3591 struct isl_map *map, struct isl_set *set)
3593 return isl_map_reverse(
3594 isl_map_intersect_range(isl_map_reverse(map), set));
3597 struct isl_map *isl_map_apply_domain(
3598 struct isl_map *map1, struct isl_map *map2)
3602 map1 = isl_map_reverse(map1);
3603 map1 = isl_map_apply_range(map1, map2);
3604 return isl_map_reverse(map1);
3611 struct isl_map *isl_map_apply_range(
3612 struct isl_map *map1, struct isl_map *map2)
3614 struct isl_dim *dim_result;
3615 struct isl_map *result;
3621 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3622 isl_dim_copy(map2->dim));
3624 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3627 for (i = 0; i < map1->n; ++i)
3628 for (j = 0; j < map2->n; ++j) {
3629 result = isl_map_add(result,
3630 isl_basic_map_apply_range(
3631 isl_basic_map_copy(map1->p[i]),
3632 isl_basic_map_copy(map2->p[j])));
3638 if (result && result->n <= 1)
3639 ISL_F_SET(result, ISL_MAP_DISJOINT);
3648 * returns range - domain
3650 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3652 struct isl_basic_set *bset;
3659 dim = isl_basic_map_n_in(bmap);
3660 nparam = isl_basic_map_n_param(bmap);
3661 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3662 bset = isl_basic_set_from_basic_map(bmap);
3663 bset = isl_basic_set_cow(bset);
3664 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3665 bset = isl_basic_set_swap_vars(bset, 2*dim);
3666 for (i = 0; i < dim; ++i) {
3667 int j = isl_basic_map_alloc_equality(
3668 (struct isl_basic_map *)bset);
3671 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3672 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3673 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3674 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3676 return isl_basic_set_project_out(bset, 2*dim, 0);
3678 isl_basic_map_free(bmap);
3683 * returns range - domain
3685 struct isl_set *isl_map_deltas(struct isl_map *map)
3688 struct isl_set *result;
3693 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3694 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3695 isl_map_n_in(map), map->n, map->flags);
3698 for (i = 0; i < map->n; ++i)
3699 result = isl_set_add(result,
3700 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3708 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3710 struct isl_basic_map *bmap;
3718 nparam = dims->nparam;
3720 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3724 for (i = 0; i < dim; ++i) {
3725 int j = isl_basic_map_alloc_equality(bmap);
3728 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3729 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3730 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3732 return isl_basic_map_finalize(bmap);
3734 isl_basic_map_free(bmap);
3738 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3740 struct isl_dim *dim = isl_dim_map(set_dim);
3743 return basic_map_identity(dim);
3746 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3748 if (!model || !model->dim)
3750 isl_assert(model->ctx,
3751 model->dim->n_in == model->dim->n_out, return NULL);
3752 return basic_map_identity(isl_dim_copy(model->dim));
3755 static struct isl_map *map_identity(struct isl_dim *dim)
3757 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3758 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3761 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3763 struct isl_dim *dim = isl_dim_map(set_dim);
3766 return map_identity(dim);
3769 struct isl_map *isl_map_identity_like(struct isl_map *model)
3771 if (!model || !model->dim)
3773 isl_assert(model->ctx,
3774 model->dim->n_in == model->dim->n_out, return NULL);
3775 return map_identity(isl_dim_copy(model->dim));
3778 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
3780 if (!model || !model->dim)
3782 isl_assert(model->ctx,
3783 model->dim->n_in == model->dim->n_out, return NULL);
3784 return map_identity(isl_dim_copy(model->dim));
3787 /* Construct a basic set with all set dimensions having only non-negative
3790 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
3795 struct isl_basic_set *bset;
3799 nparam = dims->nparam;
3801 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
3804 for (i = 0; i < dim; ++i) {
3805 int k = isl_basic_set_alloc_inequality(bset);
3808 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
3809 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
3813 isl_basic_set_free(bset);
3817 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3819 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3822 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3824 return isl_map_is_subset(
3825 (struct isl_map *)set1, (struct isl_map *)set2);
3828 int isl_basic_map_is_subset(
3829 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3832 struct isl_map *map1;
3833 struct isl_map *map2;
3835 if (!bmap1 || !bmap2)
3838 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3839 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3841 is_subset = isl_map_is_subset(map1, map2);
3849 int isl_basic_map_is_equal(
3850 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3854 if (!bmap1 || !bmap2)
3856 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3859 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3863 int isl_basic_set_is_equal(
3864 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3866 return isl_basic_map_is_equal(
3867 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3870 int isl_map_is_empty(struct isl_map *map)
3877 for (i = 0; i < map->n; ++i) {
3878 is_empty = isl_basic_map_is_empty(map->p[i]);
3887 int isl_map_fast_is_empty(struct isl_map *map)
3892 int isl_set_is_empty(struct isl_set *set)
3894 return isl_map_is_empty((struct isl_map *)set);
3897 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3900 struct isl_map *diff;
3905 if (isl_map_is_empty(map1))
3908 if (isl_map_is_empty(map2))
3911 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3915 is_subset = isl_map_is_empty(diff);
3921 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3927 is_subset = isl_map_is_subset(map1, map2);
3930 is_subset = isl_map_is_subset(map2, map1);
3934 int isl_basic_map_is_strict_subset(
3935 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3939 if (!bmap1 || !bmap2)
3941 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3944 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3945 if (is_subset == -1)
3950 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
3956 is_subset = isl_map_is_subset(map1, map2);
3959 is_subset = isl_map_is_subset(map2, map1);
3960 if (is_subset == -1)
3965 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3969 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3972 int isl_basic_set_is_universe(struct isl_basic_set *bset)
3976 return bset->n_eq == 0 && bset->n_ineq == 0;
3979 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3981 struct isl_basic_set *bset = NULL;
3982 struct isl_vec *sample = NULL;
3989 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3992 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3993 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3994 copy = isl_basic_map_convex_hull(copy);
3995 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3996 isl_basic_map_free(copy);
4000 total = 1 + isl_basic_map_total_dim(bmap);
4001 if (bmap->sample && bmap->sample->size == total) {
4002 int contains = basic_map_contains(bmap, bmap->sample);
4008 isl_vec_free(bmap->sample);
4009 bmap->sample = NULL;
4010 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4013 sample = isl_basic_set_sample(bset);
4016 empty = sample->size == 0;
4017 isl_vec_free(bmap->sample);
4018 bmap->sample = sample;
4020 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4025 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4029 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4032 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4036 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4039 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4041 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4044 struct isl_map *isl_basic_map_union(
4045 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4047 struct isl_map *map;
4048 if (!bmap1 || !bmap2)
4051 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4053 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4056 map = isl_map_add(map, bmap1);
4057 map = isl_map_add(map, bmap2);
4060 isl_basic_map_free(bmap1);
4061 isl_basic_map_free(bmap2);
4065 struct isl_set *isl_basic_set_union(
4066 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4068 return (struct isl_set *)isl_basic_map_union(
4069 (struct isl_basic_map *)bset1,
4070 (struct isl_basic_map *)bset2);
4073 /* Order divs such that any div only depends on previous divs */
4074 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4077 unsigned off = isl_dim_total(bmap->dim);
4079 for (i = 0; i < bmap->n_div; ++i) {
4081 if (isl_int_is_zero(bmap->div[i][0]))
4083 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4087 isl_basic_map_swap_div(bmap, i, i + pos);
4093 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4095 return (struct isl_basic_set *)
4096 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4099 /* Look for a div in dst that corresponds to the div "div" in src.
4100 * The divs before "div" in src and dst are assumed to be the same.
4102 * Returns -1 if no corresponding div was found and the position
4103 * of the corresponding div in dst otherwise.
4105 static int find_div(struct isl_basic_map *dst,
4106 struct isl_basic_map *src, unsigned div)
4110 unsigned total = isl_dim_total(src->dim);
4112 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4113 for (i = div; i < dst->n_div; ++i)
4114 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4115 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4116 dst->n_div - div) == -1)
4121 struct isl_basic_map *isl_basic_map_align_divs(
4122 struct isl_basic_map *dst, struct isl_basic_map *src)
4125 unsigned total = isl_dim_total(src->dim);
4130 if (src->n_div == 0)
4133 for (i = 0; i < src->n_div; ++i)
4134 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4136 src = isl_basic_map_order_divs(src);
4137 dst = isl_basic_map_cow(dst);
4138 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4139 src->n_div, 0, 2 * src->n_div);
4142 for (i = 0; i < src->n_div; ++i) {
4143 int j = find_div(dst, src, i);
4145 j = isl_basic_map_alloc_div(dst);
4148 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4149 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4150 if (add_div_constraints(dst, j) < 0)
4154 isl_basic_map_swap_div(dst, i, j);
4158 isl_basic_map_free(dst);
4162 struct isl_basic_set *isl_basic_set_align_divs(
4163 struct isl_basic_set *dst, struct isl_basic_set *src)
4165 return (struct isl_basic_set *)isl_basic_map_align_divs(
4166 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4169 struct isl_map *isl_map_align_divs(struct isl_map *map)
4173 map = isl_map_compute_divs(map);
4174 map = isl_map_cow(map);
4178 for (i = 1; i < map->n; ++i)
4179 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4180 for (i = 1; i < map->n; ++i)
4181 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4183 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4187 struct isl_set *isl_set_align_divs(struct isl_set *set)
4189 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4192 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4193 struct isl_basic_map *src, isl_int *c,
4194 unsigned len, int oppose)
4196 struct isl_basic_map *copy = NULL;
4201 copy = isl_basic_map_copy(src);
4202 copy = isl_basic_map_cow(copy);
4205 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4206 k = isl_basic_map_alloc_inequality(copy);
4210 isl_seq_neg(copy->ineq[k], c, len);
4212 isl_seq_cpy(copy->ineq[k], c, len);
4213 total = 1 + isl_basic_map_total_dim(copy);
4214 isl_seq_clr(copy->ineq[k]+len, total - len);
4215 isl_inequality_negate(copy, k);
4216 copy = isl_basic_map_simplify(copy);
4217 copy = isl_basic_map_finalize(copy);
4218 is_empty = isl_basic_map_is_empty(copy);
4222 dst = isl_map_add(dst, copy);
4224 isl_basic_map_free(copy);
4227 isl_basic_map_free(copy);
4232 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4236 struct isl_map *rest = NULL;
4238 unsigned total = isl_basic_map_total_dim(bmap);
4245 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4246 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4248 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4249 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4253 for (i = 0; i < map->n; ++i) {
4254 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4259 for (j = 0; j < map->n; ++j)
4260 map->p[j] = isl_basic_map_cow(map->p[j]);
4262 for (i = 0; i < bmap->n_eq; ++i) {
4263 for (j = 0; j < map->n; ++j) {
4264 rest = add_cut_constraint(rest,
4265 map->p[j], bmap->eq[i], 1+total, 0);
4269 rest = add_cut_constraint(rest,
4270 map->p[j], bmap->eq[i], 1+total, 1);
4274 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4278 k = isl_basic_map_alloc_equality(map->p[j]);
4281 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4282 isl_seq_clr(map->p[j]->eq[k]+1+total,
4283 map->p[j]->n_div - bmap->n_div);
4287 for (i = 0; i < bmap->n_ineq; ++i) {
4288 for (j = 0; j < map->n; ++j) {
4289 rest = add_cut_constraint(rest,
4290 map->p[j], bmap->ineq[i], 1+total, 0);
4294 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4298 k = isl_basic_map_alloc_inequality(map->p[j]);
4301 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4302 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4303 map->p[j]->n_div - bmap->n_div);
4315 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4321 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4323 if (isl_map_is_empty(map2)) {
4328 map1 = isl_map_compute_divs(map1);
4329 map2 = isl_map_compute_divs(map2);
4333 for (i = 0; map1 && i < map2->n; ++i)
4334 map1 = subtract(map1, map2->p[i]);
4344 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4346 return (struct isl_set *)
4348 (struct isl_map *)set1, (struct isl_map *)set2);
4351 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4355 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4356 map = isl_map_intersect_domain(map, set);
4357 set = isl_map_range(map);
4365 /* There is no need to cow as removing empty parts doesn't change
4366 * the meaning of the set.
4368 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4375 for (i = map->n-1; i >= 0; --i) {
4376 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4378 isl_basic_map_free(map->p[i]);
4379 if (i != map->n-1) {
4380 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4381 map->p[i] = map->p[map->n-1];
4389 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4391 return (struct isl_set *)
4392 isl_map_remove_empty_parts((struct isl_map *)set);
4395 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4397 struct isl_basic_map *bmap;
4398 if (!map || map->n == 0)
4400 bmap = map->p[map->n-1];
4401 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4402 return isl_basic_map_copy(bmap);
4405 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4407 return (struct isl_basic_set *)
4408 isl_map_copy_basic_map((struct isl_map *)set);
4411 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
4412 struct isl_basic_map *bmap)
4418 for (i = map->n-1; i >= 0; --i) {
4419 if (map->p[i] != bmap)
4421 map = isl_map_cow(map);
4424 isl_basic_map_free(map->p[i]);
4425 if (i != map->n-1) {
4426 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4427 map->p[i] = map->p[map->n-1];
4432 isl_basic_map_free(bmap);
4436 isl_basic_map_free(bmap);
4440 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4441 struct isl_basic_set *bset)
4443 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4444 (struct isl_basic_map *)bset);
4447 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4448 * for any common value of the parameters and dimensions preceding dim
4449 * in both basic sets, the values of dimension pos in bset1 are
4450 * smaller or larger than those in bset2.
4453 * 1 if bset1 follows bset2
4454 * -1 if bset1 precedes bset2
4455 * 0 if bset1 and bset2 are incomparable
4456 * -2 if some error occurred.
4458 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4459 struct isl_basic_set *bset2, int pos)
4461 struct isl_dim *dims;
4462 struct isl_basic_map *bmap1 = NULL;
4463 struct isl_basic_map *bmap2 = NULL;
4464 struct isl_ctx *ctx;
4465 struct isl_vec *obj;
4468 unsigned dim1, dim2;
4470 enum isl_lp_result res;
4473 if (!bset1 || !bset2)
4476 nparam = isl_basic_set_n_param(bset1);
4477 dim1 = isl_basic_set_n_dim(bset1);
4478 dim2 = isl_basic_set_n_dim(bset2);
4479 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4480 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4481 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4482 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4483 if (!bmap1 || !bmap2)
4485 bmap1 = isl_basic_map_cow(bmap1);
4486 bmap1 = isl_basic_map_extend(bmap1, nparam,
4487 pos, (dim1 - pos) + (dim2 - pos),
4488 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4489 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4492 total = isl_basic_map_total_dim(bmap1);
4494 obj = isl_vec_alloc(ctx, 1 + total);
4495 isl_seq_clr(obj->block.data, 1 + total);
4496 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4497 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4502 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4504 if (res == isl_lp_empty)
4506 else if (res == isl_lp_ok && isl_int_is_pos(num))
4508 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4509 res == isl_lp_unbounded)
4515 isl_basic_map_free(bmap1);
4519 isl_basic_map_free(bmap1);
4520 isl_basic_map_free(bmap2);
4524 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4525 unsigned pos, isl_int *val)
4533 total = isl_basic_map_total_dim(bmap);
4534 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4535 for (; d+1 > pos; --d)
4536 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4540 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4542 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4544 if (!isl_int_is_one(bmap->eq[i][1+d]))
4547 isl_int_neg(*val, bmap->eq[i][0]);
4553 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4554 unsigned pos, isl_int *val)
4566 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4569 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4570 for (i = 1; fixed == 1 && i < map->n; ++i) {
4571 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4572 if (fixed == 1 && isl_int_ne(tmp, v))
4576 isl_int_set(*val, v);
4582 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
4583 unsigned pos, isl_int *val)
4585 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
4589 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4592 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4595 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4596 enum isl_dim_type type, unsigned pos, isl_int *val)
4598 if (pos >= isl_basic_map_dim(bmap, type))
4600 return isl_basic_map_fast_has_fixed_var(bmap,
4601 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4604 int isl_map_fast_is_fixed(struct isl_map *map,
4605 enum isl_dim_type type, unsigned pos, isl_int *val)
4607 if (pos >= isl_map_dim(map, type))
4609 return isl_map_fast_has_fixed_var(map,
4610 map_offset(map, type) - 1 + pos, val);
4613 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4614 * then return this fixed value in *val.
4616 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
4619 return isl_basic_set_fast_has_fixed_var(bset,
4620 isl_basic_set_n_param(bset) + dim, val);
4623 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4624 * then return this fixed value in *val.
4626 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4628 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4631 /* Check if input variable in has fixed value and if so and if val is not NULL,
4632 * then return this fixed value in *val.
4634 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4636 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4639 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4640 * and if val is not NULL, then return this lower bound in *val.
4642 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4643 unsigned dim, isl_int *val)
4645 int i, i_eq = -1, i_ineq = -1;
4652 total = isl_basic_set_total_dim(bset);
4653 nparam = isl_basic_set_n_param(bset);
4654 for (i = 0; i < bset->n_eq; ++i) {
4655 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4661 for (i = 0; i < bset->n_ineq; ++i) {
4662 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4664 if (i_eq != -1 || i_ineq != -1)
4668 if (i_eq == -1 && i_ineq == -1)
4670 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4671 /* The coefficient should always be one due to normalization. */
4672 if (!isl_int_is_one(c[1+nparam+dim]))
4674 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4676 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4677 total - nparam - dim - 1) != -1)
4680 isl_int_neg(*val, c[0]);
4684 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4685 unsigned dim, isl_int *val)
4697 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4701 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4703 for (i = 1; fixed == 1 && i < set->n; ++i) {
4704 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4706 if (fixed == 1 && isl_int_ne(tmp, v))
4710 isl_int_set(*val, v);
4721 static int qsort_constraint_cmp(const void *p1, const void *p2)
4723 const struct constraint *c1 = (const struct constraint *)p1;
4724 const struct constraint *c2 = (const struct constraint *)p2;
4725 unsigned size = isl_min(c1->size, c2->size);
4726 return isl_seq_cmp(c1->c, c2->c, size);
4729 static struct isl_basic_map *isl_basic_map_sort_constraints(
4730 struct isl_basic_map *bmap)
4733 struct constraint *c;
4738 total = isl_basic_map_total_dim(bmap);
4739 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4742 for (i = 0; i < bmap->n_ineq; ++i) {
4744 c[i].c = bmap->ineq[i];
4746 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4747 for (i = 0; i < bmap->n_ineq; ++i)
4748 bmap->ineq[i] = c[i].c;
4752 isl_basic_map_free(bmap);
4756 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4760 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4762 bmap = isl_basic_map_convex_hull(bmap);
4763 bmap = isl_basic_map_sort_constraints(bmap);
4764 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4768 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4770 return (struct isl_basic_set *)isl_basic_map_normalize(
4771 (struct isl_basic_map *)bset);
4774 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4775 const struct isl_basic_map *bmap2)
4782 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4783 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4784 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4785 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4786 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4787 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4788 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4789 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4791 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4793 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4795 if (bmap1->n_eq != bmap2->n_eq)
4796 return bmap1->n_eq - bmap2->n_eq;
4797 if (bmap1->n_ineq != bmap2->n_ineq)
4798 return bmap1->n_ineq - bmap2->n_ineq;
4799 if (bmap1->n_div != bmap2->n_div)
4800 return bmap1->n_div - bmap2->n_div;
4801 total = isl_basic_map_total_dim(bmap1);
4802 for (i = 0; i < bmap1->n_eq; ++i) {
4803 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4807 for (i = 0; i < bmap1->n_ineq; ++i) {
4808 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4812 for (i = 0; i < bmap1->n_div; ++i) {
4813 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4820 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4821 struct isl_basic_map *bmap2)
4823 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4826 static int qsort_bmap_cmp(const void *p1, const void *p2)
4828 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4829 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4831 return isl_basic_map_fast_cmp(bmap1, bmap2);
4834 /* We normalize in place, but if anything goes wrong we need
4835 * to return NULL, so we need to make sure we don't change the
4836 * meaning of any possible other copies of map.
4838 struct isl_map *isl_map_normalize(struct isl_map *map)
4841 struct isl_basic_map *bmap;
4845 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4847 for (i = 0; i < map->n; ++i) {
4848 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4851 isl_basic_map_free(map->p[i]);
4854 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4855 ISL_F_SET(map, ISL_MAP_NORMALIZED);
4856 map = isl_map_remove_empty_parts(map);
4859 for (i = map->n - 1; i >= 1; --i) {
4860 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4862 isl_basic_map_free(map->p[i-1]);
4863 for (j = i; j < map->n; ++j)
4864 map->p[j-1] = map->p[j];
4874 struct isl_set *isl_set_normalize(struct isl_set *set)
4876 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4879 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4889 if (!isl_dim_equal(map1->dim, map2->dim))
4892 map1 = isl_map_copy(map1);
4893 map2 = isl_map_copy(map2);
4894 map1 = isl_map_normalize(map1);
4895 map2 = isl_map_normalize(map2);
4898 equal = map1->n == map2->n;
4899 for (i = 0; equal && i < map1->n; ++i) {
4900 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4913 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4915 return isl_map_fast_is_equal((struct isl_map *)set1,
4916 (struct isl_map *)set2);
4919 /* Return an interval that ranges from min to max (inclusive)
4921 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4922 isl_int min, isl_int max)
4925 struct isl_basic_set *bset = NULL;
4927 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4931 k = isl_basic_set_alloc_inequality(bset);
4934 isl_int_set_si(bset->ineq[k][1], 1);
4935 isl_int_neg(bset->ineq[k][0], min);
4937 k = isl_basic_set_alloc_inequality(bset);
4940 isl_int_set_si(bset->ineq[k][1], -1);
4941 isl_int_set(bset->ineq[k][0], max);
4945 isl_basic_set_free(bset);
4949 /* Return the Cartesian product of the basic sets in list (in the given order).
4951 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4959 struct isl_basic_set *product = NULL;
4963 isl_assert(list->ctx, list->n > 0, goto error);
4964 isl_assert(list->ctx, list->p[0], goto error);
4965 nparam = isl_basic_set_n_param(list->p[0]);
4966 dim = isl_basic_set_n_dim(list->p[0]);
4967 extra = list->p[0]->n_div;
4968 n_eq = list->p[0]->n_eq;
4969 n_ineq = list->p[0]->n_ineq;
4970 for (i = 1; i < list->n; ++i) {
4971 isl_assert(list->ctx, list->p[i], goto error);
4972 isl_assert(list->ctx,
4973 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4974 dim += isl_basic_set_n_dim(list->p[i]);
4975 extra += list->p[i]->n_div;
4976 n_eq += list->p[i]->n_eq;
4977 n_ineq += list->p[i]->n_ineq;
4979 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4984 for (i = 0; i < list->n; ++i) {
4985 isl_basic_set_add_constraints(product,
4986 isl_basic_set_copy(list->p[i]), dim);
4987 dim += isl_basic_set_n_dim(list->p[i]);
4989 isl_basic_set_list_free(list);
4992 isl_basic_set_free(product);
4993 isl_basic_set_list_free(list);
4997 struct isl_basic_map *isl_basic_map_product(
4998 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5000 struct isl_dim *dim_result = NULL;
5001 struct isl_basic_map *bmap;
5002 unsigned in1, in2, out1, out2, nparam, total, pos;
5003 struct isl_dim_map *dim_map1, *dim_map2;
5005 if (!bmap1 || !bmap2)
5008 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5009 bmap2->dim, isl_dim_param), goto error);
5010 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5011 isl_dim_copy(bmap2->dim));
5013 in1 = isl_basic_map_n_in(bmap1);
5014 in2 = isl_basic_map_n_in(bmap2);
5015 out1 = isl_basic_map_n_out(bmap1);
5016 out2 = isl_basic_map_n_out(bmap2);
5017 nparam = isl_basic_map_n_param(bmap1);
5019 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5020 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5021 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5022 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5023 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5024 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5025 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5026 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5027 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5028 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5029 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5031 bmap = isl_basic_map_alloc_dim(dim_result,
5032 bmap1->n_div + bmap2->n_div,
5033 bmap1->n_eq + bmap2->n_eq,
5034 bmap1->n_ineq + bmap2->n_ineq);
5035 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5036 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5037 bmap = isl_basic_map_simplify(bmap);
5038 return isl_basic_map_finalize(bmap);
5040 isl_basic_map_free(bmap1);
5041 isl_basic_map_free(bmap2);
5045 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5047 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5050 struct isl_map *result;
5056 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5057 map2->dim, isl_dim_param), goto error);
5059 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5060 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5061 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5063 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5064 isl_dim_copy(map2->dim)),
5065 map1->n * map2->n, flags);
5068 for (i = 0; i < map1->n; ++i)
5069 for (j = 0; j < map2->n; ++j) {
5070 struct isl_basic_map *part;
5071 part = isl_basic_map_product(
5072 isl_basic_map_copy(map1->p[i]),
5073 isl_basic_map_copy(map2->p[j]));
5074 if (isl_basic_map_is_empty(part))
5075 isl_basic_map_free(part);
5077 result = isl_map_add(result, part);
5090 /* Given two set A and B, construct its Cartesian product A x B.
5092 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5094 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5095 (struct isl_map *)set2);
5098 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5101 uint32_t hash = isl_hash_init();
5106 bset = isl_basic_set_copy(bset);
5107 bset = isl_basic_set_normalize(bset);
5110 total = isl_basic_set_total_dim(bset);
5111 isl_hash_byte(hash, bset->n_eq & 0xFF);
5112 for (i = 0; i < bset->n_eq; ++i) {
5114 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5115 isl_hash_hash(hash, c_hash);
5117 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5118 for (i = 0; i < bset->n_ineq; ++i) {
5120 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5121 isl_hash_hash(hash, c_hash);
5123 isl_hash_byte(hash, bset->n_div & 0xFF);
5124 for (i = 0; i < bset->n_div; ++i) {
5126 if (isl_int_is_zero(bset->div[i][0]))
5128 isl_hash_byte(hash, i & 0xFF);
5129 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5130 isl_hash_hash(hash, c_hash);
5132 isl_basic_set_free(bset);
5136 uint32_t isl_set_get_hash(struct isl_set *set)
5143 set = isl_set_copy(set);
5144 set = isl_set_normalize(set);
5148 hash = isl_hash_init();
5149 for (i = 0; i < set->n; ++i) {
5151 bset_hash = isl_basic_set_get_hash(set->p[i]);
5152 isl_hash_hash(hash, bset_hash);
5160 /* Check if the value for dimension dim is completely determined
5161 * by the values of the other parameters and variables.
5162 * That is, check if dimension dim is involved in an equality.
5164 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5171 nparam = isl_basic_set_n_param(bset);
5172 for (i = 0; i < bset->n_eq; ++i)
5173 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5178 /* Check if the value for dimension dim is completely determined
5179 * by the values of the other parameters and variables.
5180 * That is, check if dimension dim is involved in an equality
5181 * for each of the subsets.
5183 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5189 for (i = 0; i < set->n; ++i) {
5191 unique = isl_basic_set_dim_is_unique(set->p[i], dim);