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)
98 struct isl_dim *dim = bmap->dim;
102 case isl_dim_out: return isl_dim_size(bmap->dim, type);
103 case isl_dim_div: return bmap->n_div;
104 case isl_dim_all: return isl_basic_map_total_dim(bmap);
108 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
110 return n(map->dim, type);
113 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
115 return n(set->dim, type);
118 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
119 enum isl_dim_type type)
121 struct isl_dim *dim = bmap->dim;
123 case isl_dim_param: return 1;
124 case isl_dim_in: return 1 + dim->nparam;
125 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
126 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
130 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
132 return pos(map->dim, type);
135 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
136 enum isl_dim_type type)
138 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
141 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
143 return bset->dim->n_out;
146 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
148 return bset->dim->nparam;
151 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
153 return isl_dim_total(bset->dim) + bset->n_div;
156 unsigned isl_set_n_dim(const struct isl_set *set)
158 return set->dim->n_out;
161 unsigned isl_set_n_param(const struct isl_set *set)
163 return set->dim->nparam;
166 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
168 return bmap->dim->n_in;
171 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
173 return bmap->dim->n_out;
176 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
178 return bmap->dim->nparam;
181 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
186 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
188 return isl_dim_total(bmap->dim) + bmap->n_div;
191 unsigned isl_map_n_in(const struct isl_map *map)
193 return map->dim->n_in;
196 unsigned isl_map_n_out(const struct isl_map *map)
198 return map->dim->n_out;
201 unsigned isl_map_n_param(const struct isl_map *map)
203 return map->dim->nparam;
206 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
208 return map->dim->n_in == set->dim->n_out &&
209 map->dim->nparam == set->dim->nparam;
212 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
213 struct isl_basic_set *bset)
215 return bmap->dim->n_in == bset->dim->n_out &&
216 bmap->dim->nparam == bset->dim->nparam;
219 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
220 struct isl_basic_set *bset)
222 return bmap->dim->n_out == bset->dim->n_out &&
223 bmap->dim->nparam == bset->dim->nparam;
226 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
230 return isl_dim_copy(bmap->dim);
233 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
237 return isl_dim_copy(bset->dim);
240 struct isl_dim *isl_map_get_dim(struct isl_map *map)
244 return isl_dim_copy(map->dim);
247 struct isl_dim *isl_set_get_dim(struct isl_set *set)
251 return isl_dim_copy(set->dim);
254 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
255 struct isl_basic_map *bmap, unsigned extra,
256 unsigned n_eq, unsigned n_ineq)
259 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
261 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
262 if (isl_blk_is_error(bmap->block)) {
267 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
269 isl_blk_free(ctx, bmap->block);
275 bmap->block2 = isl_blk_empty();
278 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
279 if (isl_blk_is_error(bmap->block2)) {
281 isl_blk_free(ctx, bmap->block);
286 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
288 isl_blk_free(ctx, bmap->block2);
290 isl_blk_free(ctx, bmap->block);
296 for (i = 0; i < n_ineq + n_eq; ++i)
297 bmap->ineq[i] = bmap->block.data + i * row_size;
299 for (i = 0; i < extra; ++i)
300 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
306 bmap->c_size = n_eq + n_ineq;
307 bmap->eq = bmap->ineq + n_ineq;
316 isl_basic_map_free(bmap);
320 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
321 unsigned nparam, unsigned dim, unsigned extra,
322 unsigned n_eq, unsigned n_ineq)
324 struct isl_basic_map *bmap;
325 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
326 return (struct isl_basic_set *)bmap;
329 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
330 unsigned extra, unsigned n_eq, unsigned n_ineq)
332 struct isl_basic_map *bmap;
335 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
336 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
337 return (struct isl_basic_set *)bmap;
340 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
341 unsigned extra, unsigned n_eq, unsigned n_ineq)
343 struct isl_basic_map *bmap;
347 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
352 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
358 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
359 unsigned nparam, unsigned in, unsigned out, unsigned extra,
360 unsigned n_eq, unsigned n_ineq)
362 struct isl_basic_map *bmap;
365 dim = isl_dim_alloc(ctx, nparam, in, out);
369 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
373 static void dup_constraints(
374 struct isl_basic_map *dst, struct isl_basic_map *src)
377 unsigned total = isl_basic_map_total_dim(src);
379 for (i = 0; i < src->n_eq; ++i) {
380 int j = isl_basic_map_alloc_equality(dst);
381 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
384 for (i = 0; i < src->n_ineq; ++i) {
385 int j = isl_basic_map_alloc_inequality(dst);
386 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
389 for (i = 0; i < src->n_div; ++i) {
390 int j = isl_basic_map_alloc_div(dst);
391 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
393 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
396 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
398 struct isl_basic_map *dup;
402 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
403 bmap->n_div, bmap->n_eq, bmap->n_ineq);
406 dup_constraints(dup, bmap);
407 dup->flags = bmap->flags;
408 dup->sample = isl_vec_copy(bmap->sample);
412 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
414 struct isl_basic_map *dup;
416 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
417 return (struct isl_basic_set *)dup;
420 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
425 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
429 return isl_basic_set_dup(bset);
432 struct isl_set *isl_set_copy(struct isl_set *set)
441 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
446 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
450 return isl_basic_map_dup(bmap);
453 struct isl_map *isl_map_copy(struct isl_map *map)
462 void isl_basic_map_free(struct isl_basic_map *bmap)
470 isl_ctx_deref(bmap->ctx);
472 isl_blk_free(bmap->ctx, bmap->block2);
474 isl_blk_free(bmap->ctx, bmap->block);
475 isl_vec_free(bmap->sample);
476 isl_dim_free(bmap->dim);
480 void isl_basic_set_free(struct isl_basic_set *bset)
482 isl_basic_map_free((struct isl_basic_map *)bset);
485 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
487 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
490 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
496 isl_assert(ctx, room_for_con(bmap, 1), return -1);
497 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
499 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
500 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
501 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
502 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
503 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
504 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
506 int j = isl_basic_map_alloc_inequality(bmap);
510 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
511 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
518 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
519 bmap->extra - bmap->n_div);
523 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
525 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
528 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
532 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
537 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
539 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
542 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
547 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
549 if (pos != bmap->n_eq - 1) {
551 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
552 bmap->eq[bmap->n_eq - 1] = t;
558 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
560 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
563 void isl_basic_map_inequality_to_equality(
564 struct isl_basic_map *bmap, unsigned pos)
569 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
570 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
575 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
576 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
577 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
578 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
581 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
583 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
586 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
592 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
593 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
594 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
595 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
596 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
597 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
598 1 + isl_basic_map_total_dim(bmap),
599 bmap->extra - bmap->n_div);
600 return bmap->n_ineq++;
603 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
605 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
608 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
612 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
617 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
619 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
622 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
627 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
629 if (pos != bmap->n_ineq - 1) {
631 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
632 bmap->ineq[bmap->n_ineq - 1] = t;
633 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
639 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
641 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
644 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
648 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
649 isl_seq_clr(bmap->div[bmap->n_div] +
650 1 + 1 + isl_basic_map_total_dim(bmap),
651 bmap->extra - bmap->n_div);
652 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
653 return bmap->n_div++;
656 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
658 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
661 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
665 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
670 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
672 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
675 /* Copy constraint from src to dst, putting the vars of src at offset
676 * dim_off in dst and the divs of src at offset div_off in dst.
677 * If both sets are actually map, then dim_off applies to the input
680 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
681 struct isl_basic_map *src_map, isl_int *src,
682 unsigned in_off, unsigned out_off, unsigned div_off)
684 unsigned src_nparam = isl_basic_map_n_param(src_map);
685 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
686 unsigned src_in = isl_basic_map_n_in(src_map);
687 unsigned dst_in = isl_basic_map_n_in(dst_map);
688 unsigned src_out = isl_basic_map_n_out(src_map);
689 unsigned dst_out = isl_basic_map_n_out(dst_map);
690 isl_int_set(dst[0], src[0]);
691 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
692 if (dst_nparam > src_nparam)
693 isl_seq_clr(dst+1+src_nparam,
694 dst_nparam - src_nparam);
695 isl_seq_clr(dst+1+dst_nparam, in_off);
696 isl_seq_cpy(dst+1+dst_nparam+in_off,
698 isl_min(dst_in-in_off, src_in));
699 if (dst_in-in_off > src_in)
700 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
701 dst_in - in_off - src_in);
702 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
703 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
704 src+1+src_nparam+src_in,
705 isl_min(dst_out-out_off, src_out));
706 if (dst_out-out_off > src_out)
707 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
708 dst_out - out_off - src_out);
709 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
710 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
711 src+1+src_nparam+src_in+src_out,
712 isl_min(dst_map->extra-div_off, src_map->n_div));
713 if (dst_map->n_div-div_off > src_map->n_div)
714 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
715 div_off+src_map->n_div,
716 dst_map->n_div - div_off - src_map->n_div);
719 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
720 struct isl_basic_map *src_map, isl_int *src,
721 unsigned in_off, unsigned out_off, unsigned div_off)
723 isl_int_set(dst[0], src[0]);
724 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
727 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
728 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
733 if (!bmap1 || !bmap2)
736 div_off = bmap1->n_div;
738 for (i = 0; i < bmap2->n_eq; ++i) {
739 int i1 = isl_basic_map_alloc_equality(bmap1);
742 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
743 i_pos, o_pos, div_off);
746 for (i = 0; i < bmap2->n_ineq; ++i) {
747 int i1 = isl_basic_map_alloc_inequality(bmap1);
750 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
751 i_pos, o_pos, div_off);
754 for (i = 0; i < bmap2->n_div; ++i) {
755 int i1 = isl_basic_map_alloc_div(bmap1);
758 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
759 i_pos, o_pos, div_off);
762 isl_basic_map_free(bmap2);
767 isl_basic_map_free(bmap1);
768 isl_basic_map_free(bmap2);
772 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
773 struct isl_dim_map *dim_map)
777 for (i = 0; i < dim_map->len; ++i) {
778 if (dim_map->pos[i] < 0)
779 isl_int_set_si(dst[i], 0);
781 isl_int_set(dst[i], src[dim_map->pos[i]]);
785 static void copy_div_dim_map(isl_int *dst, isl_int *src,
786 struct isl_dim_map *dim_map)
788 isl_int_set(dst[0], src[0]);
789 copy_constraint_dim_map(dst+1, src+1, dim_map);
792 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
793 struct isl_basic_map *src, struct isl_dim_map *dim_map)
797 if (!src || !dst || !dim_map)
800 for (i = 0; i < src->n_eq; ++i) {
801 int i1 = isl_basic_map_alloc_equality(dst);
804 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
807 for (i = 0; i < src->n_ineq; ++i) {
808 int i1 = isl_basic_map_alloc_inequality(dst);
811 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
814 for (i = 0; i < src->n_div; ++i) {
815 int i1 = isl_basic_map_alloc_div(dst);
818 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
822 isl_basic_map_free(src);
827 isl_basic_map_free(src);
828 isl_basic_map_free(dst);
832 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
833 struct isl_basic_set *bset2, unsigned pos)
835 return (struct isl_basic_set *)
836 add_constraints((struct isl_basic_map *)bset1,
837 (struct isl_basic_map *)bset2, 0, pos);
840 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
841 struct isl_dim *dim, unsigned extra,
842 unsigned n_eq, unsigned n_ineq)
844 struct isl_basic_map *ext;
854 dims_ok = isl_dim_equal(base->dim, dim) &&
855 base->extra >= base->n_div + extra;
857 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
858 room_for_ineq(base, n_ineq)) {
863 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
864 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
865 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
866 extra += base->extra;
868 n_ineq += base->n_ineq;
870 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
876 ext->sample = isl_vec_copy(base->sample);
878 ext = add_constraints(ext, base, 0, 0);
881 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
888 isl_basic_map_free(base);
892 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
893 struct isl_dim *dim, unsigned extra,
894 unsigned n_eq, unsigned n_ineq)
896 return (struct isl_basic_set *)
897 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
898 extra, n_eq, n_ineq);
901 struct isl_basic_map *isl_basic_map_extend_constraints(
902 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
906 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
910 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
911 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
912 unsigned n_eq, unsigned n_ineq)
914 struct isl_basic_map *bmap;
919 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
923 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
927 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
928 unsigned nparam, unsigned dim, unsigned extra,
929 unsigned n_eq, unsigned n_ineq)
931 return (struct isl_basic_set *)
932 isl_basic_map_extend((struct isl_basic_map *)base,
933 nparam, 0, dim, extra, n_eq, n_ineq);
936 struct isl_basic_set *isl_basic_set_extend_constraints(
937 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
939 return (struct isl_basic_set *)
940 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
944 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
946 return (struct isl_basic_set *)
947 isl_basic_map_cow((struct isl_basic_map *)bset);
950 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
957 bmap = isl_basic_map_dup(bmap);
959 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
963 struct isl_set *isl_set_cow(struct isl_set *set)
971 return isl_set_dup(set);
974 struct isl_map *isl_map_cow(struct isl_map *map)
982 return isl_map_dup(map);
985 static void swap_vars(struct isl_blk blk, isl_int *a,
986 unsigned a_len, unsigned b_len)
988 isl_seq_cpy(blk.data, a+a_len, b_len);
989 isl_seq_cpy(blk.data+b_len, a, a_len);
990 isl_seq_cpy(a, blk.data, b_len+a_len);
993 struct isl_basic_set *isl_basic_set_swap_vars(
994 struct isl_basic_set *bset, unsigned n)
1004 nparam = isl_basic_set_n_param(bset);
1005 dim = isl_basic_set_n_dim(bset);
1006 isl_assert(bset->ctx, n <= dim, goto error);
1011 bset = isl_basic_set_cow(bset);
1015 blk = isl_blk_alloc(bset->ctx, dim);
1016 if (isl_blk_is_error(blk))
1019 for (i = 0; i < bset->n_eq; ++i)
1021 bset->eq[i]+1+nparam, n, dim - n);
1023 for (i = 0; i < bset->n_ineq; ++i)
1025 bset->ineq[i]+1+nparam, n, dim - n);
1027 for (i = 0; i < bset->n_div; ++i)
1029 bset->div[i]+1+1+nparam, n, dim - n);
1031 isl_blk_free(bset->ctx, blk);
1033 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1037 isl_basic_set_free(bset);
1041 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1044 set = isl_set_cow(set);
1048 for (i = 0; i < set->n; ++i) {
1049 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1055 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1059 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1065 total = isl_basic_map_total_dim(bmap);
1066 isl_basic_map_free_div(bmap, bmap->n_div);
1067 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1069 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1071 isl_basic_map_alloc_equality(bmap);
1075 isl_int_set_si(bmap->eq[i][0], 1);
1076 isl_seq_clr(bmap->eq[i]+1, total);
1077 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1078 return isl_basic_map_finalize(bmap);
1080 isl_basic_map_free(bmap);
1084 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1086 return (struct isl_basic_set *)
1087 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1090 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1093 unsigned off = isl_dim_total(bmap->dim);
1094 isl_int *t = bmap->div[a];
1095 bmap->div[a] = bmap->div[b];
1098 for (i = 0; i < bmap->n_eq; ++i)
1099 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1101 for (i = 0; i < bmap->n_ineq; ++i)
1102 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1104 for (i = 0; i < bmap->n_div; ++i)
1105 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1106 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1109 /* Eliminate the specified n dimensions starting at first from the
1110 * constraints using Fourier-Motzkin, The dimensions themselves
1113 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1114 unsigned first, unsigned n)
1124 set = isl_set_cow(set);
1127 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1128 nparam = isl_set_n_param(set);
1130 for (i = 0; i < set->n; ++i) {
1131 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1142 /* Project out n dimensions starting at first using Fourier-Motzkin */
1143 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1144 unsigned first, unsigned n)
1146 set = isl_set_eliminate_dims(set, first, n);
1147 set = isl_set_drop_dims(set, first, n);
1151 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1153 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1161 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1170 set = isl_set_cow(set);
1174 for (i = 0; i < set->n; ++i) {
1175 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1185 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1186 enum isl_dim_type type, unsigned first, unsigned n)
1190 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1194 bmap = isl_basic_map_eliminate_vars(bmap,
1195 isl_basic_map_offset(bmap, type) - 1 + first, n);
1198 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1200 bmap = isl_basic_map_drop(bmap, type, first, n);
1203 isl_basic_map_free(bmap);
1207 struct isl_map *isl_map_remove(struct isl_map *map,
1208 enum isl_dim_type type, unsigned first, unsigned n)
1216 map = isl_map_cow(map);
1219 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1221 for (i = 0; i < map->n; ++i) {
1222 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1223 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1227 map = isl_map_drop(map, type, first, n);
1234 /* Project out n inputs starting at first using Fourier-Motzkin */
1235 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1236 unsigned first, unsigned n)
1238 return isl_map_remove(map, isl_dim_in, first, n);
1241 /* Project out n dimensions starting at first using Fourier-Motzkin */
1242 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1243 unsigned first, unsigned n)
1245 unsigned nparam = isl_basic_set_n_param(bset);
1246 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1247 bset = isl_basic_set_drop_dims(bset, first, n);
1251 static void dump_term(struct isl_basic_map *bmap,
1252 isl_int c, int pos, FILE *out)
1255 unsigned in = isl_basic_map_n_in(bmap);
1256 unsigned dim = in + isl_basic_map_n_out(bmap);
1257 unsigned nparam = isl_basic_map_n_param(bmap);
1259 isl_int_print(out, c, 0);
1261 if (!isl_int_is_one(c))
1262 isl_int_print(out, c, 0);
1263 if (pos < 1 + nparam) {
1264 name = isl_dim_get_name(bmap->dim,
1265 isl_dim_param, pos - 1);
1267 fprintf(out, "%s", name);
1269 fprintf(out, "p%d", pos - 1);
1270 } else if (pos < 1 + nparam + in)
1271 fprintf(out, "i%d", pos - 1 - nparam);
1272 else if (pos < 1 + nparam + dim)
1273 fprintf(out, "o%d", pos - 1 - nparam - in);
1275 fprintf(out, "e%d", pos - 1 - nparam - dim);
1279 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1280 int sign, FILE *out)
1284 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1288 for (i = 0, first = 1; i < len; ++i) {
1289 if (isl_int_sgn(c[i]) * sign <= 0)
1292 fprintf(out, " + ");
1294 isl_int_abs(v, c[i]);
1295 dump_term(bmap, v, i, out);
1302 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1303 const char *op, FILE *out, int indent)
1307 fprintf(out, "%*s", indent, "");
1309 dump_constraint_sign(bmap, c, 1, out);
1310 fprintf(out, " %s ", op);
1311 dump_constraint_sign(bmap, c, -1, out);
1315 for (i = bmap->n_div; i < bmap->extra; ++i) {
1316 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1318 fprintf(out, "%*s", indent, "");
1319 fprintf(out, "ERROR: unused div coefficient not zero\n");
1324 static void dump_constraints(struct isl_basic_map *bmap,
1325 isl_int **c, unsigned n,
1326 const char *op, FILE *out, int indent)
1330 for (i = 0; i < n; ++i)
1331 dump_constraint(bmap, c[i], op, out, indent);
1334 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1338 unsigned total = isl_basic_map_total_dim(bmap);
1340 for (j = 0; j < 1 + total; ++j) {
1341 if (isl_int_is_zero(exp[j]))
1343 if (!first && isl_int_is_pos(exp[j]))
1345 dump_term(bmap, exp[j], j, out);
1350 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1354 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1355 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1357 for (i = 0; i < bmap->n_div; ++i) {
1358 fprintf(out, "%*s", indent, "");
1359 fprintf(out, "e%d = [(", i);
1360 dump_affine(bmap, bmap->div[i]+1, out);
1362 isl_int_print(out, bmap->div[i][0], 0);
1363 fprintf(out, "]\n");
1367 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1370 fprintf(out, "null basic set\n");
1374 fprintf(out, "%*s", indent, "");
1375 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1376 bset->ref, bset->dim->nparam, bset->dim->n_out,
1377 bset->extra, bset->flags);
1378 dump((struct isl_basic_map *)bset, out, indent);
1381 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1384 fprintf(out, "null basic map\n");
1388 fprintf(out, "%*s", indent, "");
1389 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1390 "flags: %x, n_name: %d\n",
1392 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1393 bmap->extra, bmap->flags, bmap->dim->n_name);
1394 dump(bmap, out, indent);
1397 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1402 total = isl_basic_map_total_dim(bmap);
1403 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1404 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1405 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1406 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1410 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1412 struct isl_set *set;
1416 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1417 isl_assert(dim->ctx, n >= 0, return NULL);
1418 set = isl_alloc(dim->ctx, struct isl_set,
1419 sizeof(struct isl_set) +
1420 n * sizeof(struct isl_basic_set *));
1424 set->ctx = dim->ctx;
1425 isl_ctx_ref(set->ctx);
1437 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1438 unsigned nparam, unsigned dim, int n, unsigned flags)
1440 struct isl_set *set;
1441 struct isl_dim *dims;
1443 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1447 set = isl_set_alloc_dim(dims, n, flags);
1451 /* Make sure "map" has room for at least "n" more basic maps.
1453 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1456 struct isl_map *grown = NULL;
1460 isl_assert(map->ctx, n >= 0, goto error);
1461 if (map->n + n <= map->size)
1463 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1466 for (i = 0; i < map->n; ++i) {
1467 grown->p[i] = isl_basic_map_copy(map->p[i]);
1475 isl_map_free(grown);
1480 /* Make sure "set" has room for at least "n" more basic sets.
1482 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1484 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1487 struct isl_set *isl_set_dup(struct isl_set *set)
1490 struct isl_set *dup;
1495 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1498 for (i = 0; i < set->n; ++i)
1499 dup = isl_set_add(dup, isl_basic_set_copy(set->p[i]));
1503 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1505 struct isl_set *set;
1510 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1512 isl_basic_set_free(bset);
1515 return isl_set_add(set, bset);
1518 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1520 struct isl_map *map;
1525 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1527 isl_basic_map_free(bmap);
1530 return isl_map_add(map, bmap);
1533 struct isl_set *isl_set_add(struct isl_set *set, struct isl_basic_set *bset)
1535 return (struct isl_set *)isl_map_add((struct isl_map *)set,
1536 (struct isl_basic_map *)bset);
1539 void isl_set_free(struct isl_set *set)
1549 isl_ctx_deref(set->ctx);
1550 for (i = 0; i < set->n; ++i)
1551 isl_basic_set_free(set->p[i]);
1552 isl_dim_free(set->dim);
1556 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1561 fprintf(out, "null set\n");
1565 fprintf(out, "%*s", indent, "");
1566 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1567 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1569 for (i = 0; i < set->n; ++i) {
1570 fprintf(out, "%*s", indent, "");
1571 fprintf(out, "basic set %d:\n", i);
1572 isl_basic_set_dump(set->p[i], out, indent+4);
1576 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1581 fprintf(out, "null map\n");
1585 fprintf(out, "%*s", indent, "");
1586 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1587 "flags: %x, n_name: %d\n",
1588 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1589 map->dim->n_out, map->flags, map->dim->n_name);
1590 for (i = 0; i < map->n; ++i) {
1591 fprintf(out, "%*s", indent, "");
1592 fprintf(out, "basic map %d:\n", i);
1593 isl_basic_map_dump(map->p[i], out, indent+4);
1597 struct isl_basic_map *isl_basic_map_intersect_domain(
1598 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1600 struct isl_basic_map *bmap_domain;
1601 struct isl_dim *dim;
1606 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1607 bset->dim, isl_dim_param), goto error);
1609 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1610 isl_assert(bset->ctx,
1611 isl_basic_map_compatible_domain(bmap, bset), goto error);
1613 bmap = isl_basic_map_cow(bmap);
1614 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1615 bset->n_div, bset->n_eq, bset->n_ineq);
1618 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1619 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1620 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1622 bmap = isl_basic_map_simplify(bmap);
1623 return isl_basic_map_finalize(bmap);
1625 isl_basic_map_free(bmap);
1626 isl_basic_set_free(bset);
1630 struct isl_basic_map *isl_basic_map_intersect_range(
1631 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1633 struct isl_basic_map *bmap_range;
1638 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1639 bset->dim, isl_dim_param), goto error);
1641 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1642 isl_assert(bset->ctx,
1643 isl_basic_map_compatible_range(bmap, bset), goto error);
1645 bmap = isl_basic_map_cow(bmap);
1646 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1647 bset->n_div, bset->n_eq, bset->n_ineq);
1650 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1651 bmap = add_constraints(bmap, bmap_range, 0, 0);
1653 bmap = isl_basic_map_simplify(bmap);
1654 return isl_basic_map_finalize(bmap);
1656 isl_basic_map_free(bmap);
1657 isl_basic_set_free(bset);
1661 static int basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1667 total = 1 + isl_basic_map_total_dim(bmap);
1668 if (total != vec->size)
1673 for (i = 0; i < bmap->n_eq; ++i) {
1674 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1675 if (!isl_int_is_zero(s)) {
1681 for (i = 0; i < bmap->n_ineq; ++i) {
1682 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1683 if (isl_int_is_neg(s)) {
1694 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1696 return basic_map_contains((struct isl_basic_map *)bset, vec);
1699 struct isl_basic_map *isl_basic_map_intersect(
1700 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1702 struct isl_vec *sample = NULL;
1704 if (!bmap1 || !bmap2)
1707 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1708 bmap2->dim, isl_dim_param), goto error);
1709 if (isl_dim_total(bmap1->dim) ==
1710 isl_dim_size(bmap1->dim, isl_dim_param) &&
1711 isl_dim_total(bmap2->dim) !=
1712 isl_dim_size(bmap2->dim, isl_dim_param))
1713 return isl_basic_map_intersect(bmap2, bmap1);
1715 if (isl_dim_total(bmap2->dim) !=
1716 isl_dim_size(bmap2->dim, isl_dim_param))
1717 isl_assert(bmap1->ctx,
1718 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1720 if (bmap1->sample &&
1721 basic_map_contains(bmap1, bmap1->sample) > 0 &&
1722 basic_map_contains(bmap2, bmap1->sample) > 0)
1723 sample = isl_vec_copy(bmap1->sample);
1724 else if (bmap2->sample &&
1725 basic_map_contains(bmap1, bmap2->sample) > 0 &&
1726 basic_map_contains(bmap2, bmap2->sample) > 0)
1727 sample = isl_vec_copy(bmap2->sample);
1729 bmap1 = isl_basic_map_cow(bmap1);
1730 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1731 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1734 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1737 isl_vec_free(bmap1->sample);
1738 bmap1->sample = sample;
1741 bmap1 = isl_basic_map_simplify(bmap1);
1742 return isl_basic_map_finalize(bmap1);
1745 isl_vec_free(sample);
1746 isl_basic_map_free(bmap1);
1747 isl_basic_map_free(bmap2);
1751 struct isl_basic_set *isl_basic_set_intersect(
1752 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1754 return (struct isl_basic_set *)
1755 isl_basic_map_intersect(
1756 (struct isl_basic_map *)bset1,
1757 (struct isl_basic_map *)bset2);
1760 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1763 struct isl_map *result;
1769 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1770 map2->dim, isl_dim_param), goto error);
1771 if (isl_dim_total(map1->dim) ==
1772 isl_dim_size(map1->dim, isl_dim_param) &&
1773 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1774 return isl_map_intersect(map2, map1);
1776 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1777 isl_assert(map1->ctx,
1778 isl_dim_equal(map1->dim, map2->dim), goto error);
1780 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1781 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1782 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1784 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1785 map1->n * map2->n, flags);
1788 for (i = 0; i < map1->n; ++i)
1789 for (j = 0; j < map2->n; ++j) {
1790 struct isl_basic_map *part;
1791 part = isl_basic_map_intersect(
1792 isl_basic_map_copy(map1->p[i]),
1793 isl_basic_map_copy(map2->p[j]));
1794 if (isl_basic_map_is_empty(part))
1795 isl_basic_map_free(part);
1797 result = isl_map_add(result, part);
1810 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1812 return (struct isl_set *)
1813 isl_map_intersect((struct isl_map *)set1,
1814 (struct isl_map *)set2);
1817 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1819 struct isl_dim *dim;
1820 struct isl_basic_set *bset;
1825 bmap = isl_basic_map_cow(bmap);
1828 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1829 in = isl_basic_map_n_in(bmap);
1830 bset = isl_basic_set_from_basic_map(bmap);
1831 bset = isl_basic_set_swap_vars(bset, in);
1832 return isl_basic_map_from_basic_set(bset, dim);
1835 /* Turn final n dimensions into existentially quantified variables.
1837 struct isl_basic_set *isl_basic_set_project_out(
1838 struct isl_basic_set *bset, unsigned n, unsigned flags)
1848 isl_assert(bset->ctx, n <= isl_basic_set_n_dim(bset), goto error);
1853 bset = isl_basic_set_cow(bset);
1855 row_size = 1 + isl_dim_total(bset->dim) + bset->extra;
1856 old = bset->block2.data;
1857 bset->block2 = isl_blk_extend(bset->ctx, bset->block2,
1858 (bset->extra + n) * (1 + row_size));
1859 if (!bset->block2.data)
1861 new_div = isl_alloc_array(ctx, isl_int *, bset->extra + n);
1864 for (i = 0; i < n; ++i) {
1865 new_div[i] = bset->block2.data +
1866 (bset->extra + i) * (1 + row_size);
1867 isl_seq_clr(new_div[i], 1 + row_size);
1869 for (i = 0; i < bset->extra; ++i)
1870 new_div[n + i] = bset->block2.data + (bset->div[i] - old);
1872 bset->div = new_div;
1875 bset->dim = isl_dim_drop_outputs(bset->dim,
1876 isl_basic_set_n_dim(bset) - n, n);
1879 bset = isl_basic_set_simplify(bset);
1880 bset = isl_basic_set_drop_redundant_divs(bset);
1881 return isl_basic_set_finalize(bset);
1883 isl_basic_set_free(bset);
1887 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
1891 for (i = 0; i < n; ++i) {
1892 j = isl_basic_map_alloc_div(bmap);
1895 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
1899 isl_basic_map_free(bmap);
1903 struct isl_basic_map *isl_basic_map_apply_range(
1904 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1906 struct isl_dim *dim_result = NULL;
1907 struct isl_basic_map *bmap;
1908 unsigned n_in, n_out, n, nparam, total, pos;
1909 struct isl_dim_map *dim_map1, *dim_map2;
1911 if (!bmap1 || !bmap2)
1914 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
1915 isl_dim_copy(bmap2->dim));
1917 n_in = isl_basic_map_n_in(bmap1);
1918 n_out = isl_basic_map_n_out(bmap2);
1919 n = isl_basic_map_n_out(bmap1);
1920 nparam = isl_basic_map_n_param(bmap1);
1922 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
1923 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
1924 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
1925 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
1926 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
1927 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
1928 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
1929 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
1930 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
1931 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
1932 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
1934 bmap = isl_basic_map_alloc_dim(dim_result,
1935 bmap1->n_div + bmap2->n_div + n,
1936 bmap1->n_eq + bmap2->n_eq,
1937 bmap1->n_ineq + bmap2->n_ineq);
1938 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
1939 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
1940 bmap = add_divs(bmap, n);
1941 bmap = isl_basic_map_simplify(bmap);
1942 bmap = isl_basic_map_drop_redundant_divs(bmap);
1943 return isl_basic_map_finalize(bmap);
1945 isl_basic_map_free(bmap1);
1946 isl_basic_map_free(bmap2);
1950 struct isl_basic_set *isl_basic_set_apply(
1951 struct isl_basic_set *bset, struct isl_basic_map *bmap)
1956 isl_assert(set->ctx, isl_basic_map_compatible_domain(bmap, bset),
1959 return (struct isl_basic_set *)
1960 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
1962 isl_basic_set_free(bset);
1963 isl_basic_map_free(bmap);
1967 struct isl_basic_map *isl_basic_map_apply_domain(
1968 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1970 if (!bmap1 || !bmap2)
1974 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
1976 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
1979 bmap1 = isl_basic_map_reverse(bmap1);
1980 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
1981 return isl_basic_map_reverse(bmap1);
1983 isl_basic_map_free(bmap1);
1984 isl_basic_map_free(bmap2);
1988 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
1989 * A \cap B -> f(A) + f(B)
1991 struct isl_basic_map *isl_basic_map_sum(
1992 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1994 unsigned n_in, n_out, nparam, total, pos;
1995 struct isl_basic_map *bmap = NULL;
1996 struct isl_dim_map *dim_map1, *dim_map2;
1999 if (!bmap1 || !bmap2)
2002 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2005 nparam = isl_basic_map_n_param(bmap1);
2006 n_in = isl_basic_map_n_in(bmap1);
2007 n_out = isl_basic_map_n_out(bmap1);
2009 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2010 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2011 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2012 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2013 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2014 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2015 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2016 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2017 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2018 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2019 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2021 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2022 bmap1->n_div + bmap2->n_div + 2 * n_out,
2023 bmap1->n_eq + bmap2->n_eq + n_out,
2024 bmap1->n_ineq + bmap2->n_ineq);
2025 for (i = 0; i < n_out; ++i) {
2026 int j = isl_basic_map_alloc_equality(bmap);
2029 isl_seq_clr(bmap->eq[j], 1+total);
2030 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2031 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2032 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2034 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2035 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2036 bmap = add_divs(bmap, 2 * n_out);
2038 bmap = isl_basic_map_simplify(bmap);
2039 return isl_basic_map_finalize(bmap);
2041 isl_basic_map_free(bmap);
2042 isl_basic_map_free(bmap1);
2043 isl_basic_map_free(bmap2);
2047 /* Given a basic map A -> f(A), construct A -> -f(A).
2049 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2054 bmap = isl_basic_map_cow(bmap);
2058 n = isl_basic_map_dim(bmap, isl_dim_out);
2059 off = isl_basic_map_offset(bmap, isl_dim_out);
2060 for (i = 0; i < bmap->n_eq; ++i)
2061 for (j = 0; j < n; ++j)
2062 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2063 for (i = 0; i < bmap->n_ineq; ++i)
2064 for (j = 0; j < n; ++j)
2065 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2066 for (i = 0; i < bmap->n_div; ++i)
2067 for (j = 0; j < n; ++j)
2068 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2069 return isl_basic_map_finalize(bmap);
2072 /* Given a map A -> f(A), construct A -> -f(A).
2074 struct isl_map *isl_map_neg(struct isl_map *map)
2078 map = isl_map_cow(map);
2082 for (i = 0; i < map->n; ++i) {
2083 map->p[i] = isl_basic_map_neg(map->p[i]);
2094 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2095 * A -> floor(f(A)/d).
2097 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2100 unsigned n_in, n_out, nparam, total, pos;
2101 struct isl_basic_map *result = NULL;
2102 struct isl_dim_map *dim_map;
2108 nparam = isl_basic_map_n_param(bmap);
2109 n_in = isl_basic_map_n_in(bmap);
2110 n_out = isl_basic_map_n_out(bmap);
2112 total = nparam + n_in + n_out + bmap->n_div + n_out;
2113 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2114 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2115 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2116 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2117 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2119 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2120 bmap->n_div + n_out,
2121 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2122 result = add_constraints_dim_map(result, bmap, dim_map);
2123 result = add_divs(result, n_out);
2124 for (i = 0; i < n_out; ++i) {
2126 j = isl_basic_map_alloc_inequality(result);
2129 isl_seq_clr(result->ineq[j], 1+total);
2130 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2131 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2132 j = isl_basic_map_alloc_inequality(result);
2135 isl_seq_clr(result->ineq[j], 1+total);
2136 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2137 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2138 isl_int_sub_ui(result->ineq[j][0], d, 1);
2141 result = isl_basic_map_simplify(result);
2142 return isl_basic_map_finalize(result);
2144 isl_basic_map_free(result);
2148 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2154 i = isl_basic_map_alloc_equality(bmap);
2157 nparam = isl_basic_map_n_param(bmap);
2158 n_in = isl_basic_map_n_in(bmap);
2159 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2160 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2161 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2162 return isl_basic_map_finalize(bmap);
2164 isl_basic_map_free(bmap);
2168 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2174 i = isl_basic_map_alloc_inequality(bmap);
2177 nparam = isl_basic_map_n_param(bmap);
2178 n_in = isl_basic_map_n_in(bmap);
2179 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2180 isl_int_set_si(bmap->ineq[i][0], -1);
2181 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2182 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2183 return isl_basic_map_finalize(bmap);
2185 isl_basic_map_free(bmap);
2189 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2195 i = isl_basic_map_alloc_inequality(bmap);
2198 nparam = isl_basic_map_n_param(bmap);
2199 n_in = isl_basic_map_n_in(bmap);
2200 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2201 isl_int_set_si(bmap->ineq[i][0], -1);
2202 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2203 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2204 return isl_basic_map_finalize(bmap);
2206 isl_basic_map_free(bmap);
2210 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2213 struct isl_basic_map *bmap;
2214 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2217 for (i = 0; i < n_equal && bmap; ++i)
2218 bmap = var_equal(bmap, i);
2219 return isl_basic_map_finalize(bmap);
2222 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2225 struct isl_basic_map *bmap;
2226 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2229 for (i = 0; i < pos && bmap; ++i)
2230 bmap = var_equal(bmap, i);
2232 bmap = var_less(bmap, pos);
2233 return isl_basic_map_finalize(bmap);
2236 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2239 struct isl_basic_map *bmap;
2240 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2243 for (i = 0; i < pos && bmap; ++i)
2244 bmap = var_equal(bmap, i);
2246 bmap = var_more(bmap, pos);
2247 return isl_basic_map_finalize(bmap);
2250 struct isl_basic_map *isl_basic_map_from_basic_set(
2251 struct isl_basic_set *bset, struct isl_dim *dim)
2253 struct isl_basic_map *bmap;
2255 bset = isl_basic_set_cow(bset);
2259 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2260 isl_dim_free(bset->dim);
2261 bmap = (struct isl_basic_map *) bset;
2263 return isl_basic_map_finalize(bmap);
2265 isl_basic_set_free(bset);
2270 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2274 if (bmap->dim->n_in == 0)
2275 return (struct isl_basic_set *)bmap;
2276 bmap = isl_basic_map_cow(bmap);
2279 bmap->dim = isl_dim_cow(bmap->dim);
2282 bmap->dim->n_out += bmap->dim->n_in;
2283 bmap->dim->n_in = 0;
2284 bmap = isl_basic_map_finalize(bmap);
2285 return (struct isl_basic_set *)bmap;
2287 isl_basic_map_free(bmap);
2291 /* For a div d = floor(f/m), add the constraints
2294 * -(f-(n-1)) + m d >= 0
2296 * Note that the second constraint is the negation of
2300 static int add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2303 unsigned total = isl_basic_map_total_dim(bmap);
2304 unsigned div_pos = 1 + total - bmap->n_div + div;
2306 i = isl_basic_map_alloc_inequality(bmap);
2309 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2310 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2312 j = isl_basic_map_alloc_inequality(bmap);
2315 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2316 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2317 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2321 struct isl_basic_set *isl_basic_map_underlying_set(
2322 struct isl_basic_map *bmap)
2326 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2327 return (struct isl_basic_set *)bmap;
2328 bmap = isl_basic_map_cow(bmap);
2331 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2334 bmap->extra -= bmap->n_div;
2336 bmap = isl_basic_map_finalize(bmap);
2337 return (struct isl_basic_set *)bmap;
2342 struct isl_basic_map *isl_basic_map_overlying_set(
2343 struct isl_basic_set *bset, struct isl_basic_map *like)
2345 struct isl_basic_map *bmap;
2346 struct isl_ctx *ctx;
2353 isl_assert(ctx, bset->n_div == 0, goto error);
2354 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2355 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2357 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2358 isl_basic_map_free(like);
2359 return (struct isl_basic_map *)bset;
2361 bset = isl_basic_set_cow(bset);
2364 total = bset->dim->n_out + bset->extra;
2365 bmap = (struct isl_basic_map *)bset;
2366 isl_dim_free(bmap->dim);
2367 bmap->dim = isl_dim_copy(like->dim);
2370 bmap->n_div = like->n_div;
2371 bmap->extra += like->n_div;
2374 ltotal = total - bmap->extra + like->extra;
2377 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2378 bmap->extra * (1 + 1 + total));
2379 if (isl_blk_is_error(bmap->block2))
2381 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2385 for (i = 0; i < bmap->extra; ++i)
2386 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2387 for (i = 0; i < like->n_div; ++i) {
2388 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2389 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2391 bmap = isl_basic_map_extend_constraints(bmap,
2392 0, 2 * like->n_div);
2393 for (i = 0; i < like->n_div; ++i) {
2394 if (isl_int_is_zero(bmap->div[i][0]))
2396 if (add_div_constraints(bmap, i) < 0)
2400 isl_basic_map_free(like);
2401 bmap = isl_basic_map_simplify(bmap);
2402 bmap = isl_basic_map_finalize(bmap);
2405 isl_basic_map_free(like);
2406 isl_basic_set_free(bset);
2410 struct isl_basic_set *isl_basic_set_from_underlying_set(
2411 struct isl_basic_set *bset, struct isl_basic_set *like)
2413 return (struct isl_basic_set *)
2414 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2417 struct isl_set *isl_set_from_underlying_set(
2418 struct isl_set *set, struct isl_basic_set *like)
2424 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2426 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2427 isl_basic_set_free(like);
2430 set = isl_set_cow(set);
2433 for (i = 0; i < set->n; ++i) {
2434 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2435 isl_basic_set_copy(like));
2439 isl_dim_free(set->dim);
2440 set->dim = isl_dim_copy(like->dim);
2443 isl_basic_set_free(like);
2446 isl_basic_set_free(like);
2451 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2455 map = isl_map_cow(map);
2458 map->dim = isl_dim_cow(map->dim);
2462 for (i = 1; i < map->n; ++i)
2463 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2465 for (i = 0; i < map->n; ++i) {
2466 map->p[i] = (struct isl_basic_map *)
2467 isl_basic_map_underlying_set(map->p[i]);
2472 map->dim = isl_dim_underlying(map->dim, 0);
2474 isl_dim_free(map->dim);
2475 map->dim = isl_dim_copy(map->p[0]->dim);
2479 return (struct isl_set *)map;
2485 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2487 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2490 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2492 struct isl_basic_set *domain;
2496 n_out = isl_basic_map_n_out(bmap);
2497 domain = isl_basic_set_from_basic_map(bmap);
2498 return isl_basic_set_project_out(domain, n_out, 0);
2501 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2503 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2506 struct isl_set *isl_map_range(struct isl_map *map)
2509 struct isl_set *set;
2513 map = isl_map_cow(map);
2517 set = (struct isl_set *) map;
2518 if (set->dim->n_in != 0) {
2519 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2523 for (i = 0; i < map->n; ++i) {
2524 set->p[i] = isl_basic_map_range(map->p[i]);
2528 ISL_F_CLR(set, ISL_MAP_DISJOINT);
2529 ISL_F_CLR(set, ISL_SET_NORMALIZED);
2536 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
2539 struct isl_map *map = NULL;
2541 set = isl_set_cow(set);
2544 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
2545 map = (struct isl_map *)set;
2546 for (i = 0; i < set->n; ++i) {
2547 map->p[i] = isl_basic_map_from_basic_set(
2548 set->p[i], isl_dim_copy(dim));
2552 isl_dim_free(map->dim);
2561 struct isl_map *isl_map_from_range(struct isl_set *set)
2563 return (struct isl_map *)set;
2566 struct isl_set *isl_set_from_map(struct isl_map *map)
2569 struct isl_set *set = NULL;
2573 map = isl_map_cow(map);
2576 map->dim = isl_dim_cow(map->dim);
2579 map->dim->n_out += map->dim->n_in;
2581 set = (struct isl_set *)map;
2582 for (i = 0; i < map->n; ++i) {
2583 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
2593 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
2595 struct isl_map *map;
2599 isl_assert(dim->ctx, n >= 0, return NULL);
2600 map = isl_alloc(dim->ctx, struct isl_map,
2601 sizeof(struct isl_map) +
2602 n * sizeof(struct isl_basic_map *));
2606 map->ctx = dim->ctx;
2607 isl_ctx_ref(map->ctx);
2619 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
2620 unsigned nparam, unsigned in, unsigned out, int n,
2623 struct isl_map *map;
2624 struct isl_dim *dims;
2626 dims = isl_dim_alloc(ctx, nparam, in, out);
2630 map = isl_map_alloc_dim(dims, n, flags);
2634 struct isl_basic_map *isl_basic_map_empty(struct isl_ctx *ctx,
2635 unsigned nparam, unsigned in, unsigned out)
2637 struct isl_basic_map *bmap;
2638 bmap = isl_basic_map_alloc(ctx, nparam, in, out, 0, 1, 0);
2639 bmap = isl_basic_map_set_to_empty(bmap);
2643 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
2645 struct isl_basic_set *bset;
2646 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
2647 bset = isl_basic_set_set_to_empty(bset);
2651 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
2653 struct isl_basic_map *bmap;
2656 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2657 bmap = isl_basic_map_set_to_empty(bmap);
2661 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
2663 struct isl_basic_map *bmap;
2666 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2667 bmap = isl_basic_map_set_to_empty(bmap);
2671 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
2673 struct isl_basic_set *bset;
2676 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
2677 bset = isl_basic_set_set_to_empty(bset);
2681 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
2683 struct isl_basic_map *bmap;
2684 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
2688 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
2690 struct isl_basic_set *bset;
2691 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
2695 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
2699 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
2702 struct isl_map *isl_map_empty(struct isl_dim *dim)
2704 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2707 struct isl_map *isl_map_empty_like(struct isl_map *model)
2711 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2714 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
2718 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
2721 struct isl_set *isl_set_empty(struct isl_dim *dim)
2723 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
2726 struct isl_set *isl_set_empty_like(struct isl_set *model)
2730 return isl_set_empty(isl_dim_copy(model->dim));
2733 struct isl_map *isl_map_universe(struct isl_dim *dim)
2735 struct isl_map *map;
2738 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2739 map = isl_map_add(map, isl_basic_map_universe(dim));
2743 struct isl_set *isl_set_universe(struct isl_dim *dim)
2745 struct isl_set *set;
2748 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
2749 set = isl_set_add(set, isl_basic_set_universe(dim));
2753 struct isl_map *isl_map_dup(struct isl_map *map)
2756 struct isl_map *dup;
2760 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
2761 for (i = 0; i < map->n; ++i)
2762 dup = isl_map_add(dup, isl_basic_map_copy(map->p[i]));
2766 struct isl_map *isl_map_add(struct isl_map *map, struct isl_basic_map *bmap)
2770 if (isl_basic_map_fast_is_empty(bmap)) {
2771 isl_basic_map_free(bmap);
2774 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
2775 isl_assert(map->ctx, map->n < map->size, goto error);
2776 map->p[map->n] = bmap;
2778 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2784 isl_basic_map_free(bmap);
2788 void isl_map_free(struct isl_map *map)
2798 isl_ctx_deref(map->ctx);
2799 for (i = 0; i < map->n; ++i)
2800 isl_basic_map_free(map->p[i]);
2801 isl_dim_free(map->dim);
2805 struct isl_map *isl_map_extend(struct isl_map *base,
2806 unsigned nparam, unsigned n_in, unsigned n_out)
2810 base = isl_map_cow(base);
2814 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
2817 for (i = 0; i < base->n; ++i) {
2818 base->p[i] = isl_basic_map_extend_dim(base->p[i],
2819 isl_dim_copy(base->dim), 0, 0, 0);
2829 struct isl_set *isl_set_extend(struct isl_set *base,
2830 unsigned nparam, unsigned dim)
2832 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
2836 static struct isl_basic_map *isl_basic_map_fix_pos(struct isl_basic_map *bmap,
2837 unsigned pos, int value)
2841 bmap = isl_basic_map_cow(bmap);
2842 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
2843 j = isl_basic_map_alloc_equality(bmap);
2846 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
2847 isl_int_set_si(bmap->eq[j][pos], -1);
2848 isl_int_set_si(bmap->eq[j][0], value);
2849 bmap = isl_basic_map_simplify(bmap);
2850 return isl_basic_map_finalize(bmap);
2852 isl_basic_map_free(bmap);
2856 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
2857 enum isl_dim_type type, unsigned pos, int value)
2861 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
2862 return isl_basic_map_fix_pos(bmap, isl_basic_map_offset(bmap, type) + pos,
2865 isl_basic_map_free(bmap);
2869 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
2870 enum isl_dim_type type, unsigned pos, int value)
2872 return (struct isl_basic_set *)
2873 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2877 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
2878 unsigned input, int value)
2880 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
2883 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
2884 unsigned dim, int value)
2886 return (struct isl_basic_set *)
2887 isl_basic_map_fix_si((struct isl_basic_map *)bset,
2888 isl_dim_set, dim, value);
2891 struct isl_map *isl_map_fix_si(struct isl_map *map,
2892 enum isl_dim_type type, unsigned pos, int value)
2896 map = isl_map_cow(map);
2900 isl_assert(ctx, pos < isl_map_dim(map, type), goto error);
2901 for (i = 0; i < map->n; ++i) {
2902 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
2906 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2913 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
2914 unsigned input, int value)
2916 return isl_map_fix_si(map, isl_dim_in, input, value);
2919 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
2921 return (struct isl_set *)
2922 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
2925 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
2926 unsigned dim, isl_int value)
2931 bset = isl_basic_set_cow(bset);
2932 bset = isl_basic_set_extend_constraints(bset, 0, 1);
2933 j = isl_basic_set_alloc_inequality(bset);
2936 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
2937 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
2938 isl_int_neg(bset->ineq[j][0], value);
2939 bset = isl_basic_set_simplify(bset);
2940 return isl_basic_set_finalize(bset);
2942 isl_basic_set_free(bset);
2946 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
2951 set = isl_set_cow(set);
2955 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
2956 for (i = 0; i < set->n; ++i) {
2957 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
2967 struct isl_map *isl_map_reverse(struct isl_map *map)
2972 map = isl_map_cow(map);
2976 map->dim = isl_dim_reverse(map->dim);
2979 for (i = 0; i < map->n; ++i) {
2980 map->p[i] = isl_basic_map_reverse(map->p[i]);
2984 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2991 static struct isl_map *isl_basic_map_partial_lexopt(
2992 struct isl_basic_map *bmap, struct isl_basic_set *dom,
2993 struct isl_set **empty, int max)
2997 if (bmap->ctx->pip == ISL_PIP_PIP)
2998 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3000 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3002 isl_basic_map_free(bmap);
3003 isl_basic_set_free(dom);
3009 struct isl_map *isl_basic_map_partial_lexmax(
3010 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3011 struct isl_set **empty)
3013 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3016 struct isl_map *isl_basic_map_partial_lexmin(
3017 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3018 struct isl_set **empty)
3020 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3023 struct isl_set *isl_basic_set_partial_lexmin(
3024 struct isl_basic_set *bset, struct isl_basic_set *dom,
3025 struct isl_set **empty)
3027 return (struct isl_set *)
3028 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3032 struct isl_set *isl_basic_set_partial_lexmax(
3033 struct isl_basic_set *bset, struct isl_basic_set *dom,
3034 struct isl_set **empty)
3036 return (struct isl_set *)
3037 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3041 struct isl_set *isl_basic_set_lexmin(struct isl_basic_set *bset)
3043 struct isl_basic_map *bmap = NULL;
3044 struct isl_basic_set *dom = NULL;
3045 struct isl_map *min;
3046 struct isl_dim *param_dim;
3050 bmap = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
3053 param_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3054 dom = isl_basic_set_universe(param_dim);
3057 min = isl_basic_map_partial_lexmin(bmap, dom, NULL);
3058 return isl_map_range(min);
3060 isl_basic_map_free(bmap);
3064 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3065 struct isl_dim *dim)
3072 for (i = 0; i < map->n; ++i) {
3073 isl_dim_free(map->p[i]->dim);
3074 map->p[i]->dim = isl_dim_copy(dim);
3076 isl_dim_free(map->dim);
3086 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3087 struct isl_dim *dim)
3089 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3092 /* Apply a preimage specified by "mat" on the parameters of "bset".
3093 * bset is assumed to have only parameters and divs.
3095 static struct isl_basic_set *basic_set_parameter_preimage(
3096 struct isl_basic_set *bset, struct isl_mat *mat)
3103 bset->dim = isl_dim_cow(bset->dim);
3107 nparam = isl_basic_set_dim(bset, isl_dim_param);
3109 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3111 bset->dim->nparam = 0;
3112 bset->dim->n_out = nparam;
3113 bset = isl_basic_set_preimage(bset, mat);
3115 bset->dim->nparam = bset->dim->n_out;
3116 bset->dim->n_out = 0;
3121 isl_basic_set_free(bset);
3125 /* Apply a preimage specified by "mat" on the parameters of "set".
3126 * set is assumed to have only parameters and divs.
3128 static struct isl_set *set_parameter_preimage(
3129 struct isl_set *set, struct isl_mat *mat)
3131 struct isl_dim *dim = NULL;
3137 dim = isl_dim_copy(set->dim);
3138 dim = isl_dim_cow(dim);
3142 nparam = isl_set_dim(set, isl_dim_param);
3144 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3147 dim->n_out = nparam;
3148 isl_set_reset_dim(set, dim);
3149 set = isl_set_preimage(set, mat);
3152 dim = isl_dim_copy(set->dim);
3153 dim = isl_dim_cow(dim);
3156 dim->nparam = dim->n_out;
3158 isl_set_reset_dim(set, dim);
3168 /* Intersect the basic set "bset" with the affine space specified by the
3169 * equalities in "eq".
3171 static struct isl_basic_set *basic_set_append_equalities(
3172 struct isl_basic_set *bset, struct isl_mat *eq)
3180 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
3185 len = 1 + isl_dim_total(bset->dim) + bset->extra;
3186 for (i = 0; i < eq->n_row; ++i) {
3187 k = isl_basic_set_alloc_equality(bset);
3190 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
3191 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
3198 isl_basic_set_free(bset);
3202 /* Intersect the set "set" with the affine space specified by the
3203 * equalities in "eq".
3205 static struct isl_set *set_append_equalities(struct isl_set *set,
3213 for (i = 0; i < set->n; ++i) {
3214 set->p[i] = basic_set_append_equalities(set->p[i],
3227 /* Project the given basic set onto its parameter domain, possibly introducing
3228 * new, explicit, existential variables in the constraints.
3229 * The input has parameters and (possibly implicit) existential variables.
3230 * The output has the same parameters, but only
3231 * explicit existentially quantified variables.
3233 * The actual projection is performed by pip, but pip doesn't seem
3234 * to like equalities very much, so we first remove the equalities
3235 * among the parameters by performing a variable compression on
3236 * the parameters. Afterward, an inverse transformation is performed
3237 * and the equalities among the parameters are inserted back in.
3239 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
3243 struct isl_mat *T, *T2;
3244 struct isl_set *set;
3245 unsigned nparam, n_div;
3247 bset = isl_basic_set_cow(bset);
3251 if (bset->n_eq == 0)
3252 return isl_basic_set_lexmin(bset);
3254 isl_basic_set_gauss(bset, NULL);
3256 nparam = isl_basic_set_dim(bset, isl_dim_param);
3257 n_div = isl_basic_set_dim(bset, isl_dim_div);
3259 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
3260 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
3263 if (i == bset->n_eq)
3264 return isl_basic_set_lexmin(bset);
3266 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
3268 eq = isl_mat_cow(eq);
3269 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
3270 bset = basic_set_parameter_preimage(bset, T);
3272 set = isl_basic_set_lexmin(bset);
3273 set = set_parameter_preimage(set, T2);
3274 set = set_append_equalities(set, eq);
3278 /* Compute an explicit representation for all the existentially
3279 * quantified variables.
3280 * The input and output dimensions are first turned into parameters.
3281 * compute_divs then returns a map with the same parameters and
3282 * no input or output dimensions and the dimension specification
3283 * is reset to that of the input.
3285 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
3287 struct isl_basic_set *bset;
3288 struct isl_set *set;
3289 struct isl_map *map;
3290 struct isl_dim *dim, *orig_dim = NULL;
3295 bmap = isl_basic_map_cow(bmap);
3299 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3300 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3301 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3302 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
3306 orig_dim = bmap->dim;
3308 bset = (struct isl_basic_set *)bmap;
3310 set = parameter_compute_divs(bset);
3311 map = (struct isl_map *)set;
3312 map = isl_map_reset_dim(map, orig_dim);
3316 isl_basic_map_free(bmap);
3320 /* If bmap contains any unknown divs, then compute explicit
3321 * expressions for them. However, this computation may be
3322 * quite expensive, so first try to remove divs that aren't
3325 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
3332 off = isl_dim_total(bmap->dim);
3333 for (i = 0; i < bmap->n_div; ++i) {
3334 if (isl_int_is_zero(bmap->div[i][0]))
3336 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
3339 if (i == bmap->n_div)
3340 return isl_map_from_basic_map(bmap);
3341 bmap = isl_basic_map_drop_redundant_divs(bmap);
3344 for (i = 0; i < bmap->n_div; ++i)
3345 if (isl_int_is_zero(bmap->div[i][0]))
3347 if (i == bmap->n_div)
3348 return isl_map_from_basic_map(bmap);
3349 struct isl_map *map = compute_divs(bmap);
3352 isl_basic_map_free(bmap);
3356 struct isl_map *isl_map_compute_divs(struct isl_map *map)
3359 struct isl_map *res;
3365 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
3366 for (i = 1 ; i < map->n; ++i) {
3368 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
3369 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
3370 res = isl_map_union_disjoint(res, r2);
3372 res = isl_map_union(res, r2);
3379 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
3381 return (struct isl_set *)
3382 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
3385 struct isl_set *isl_set_compute_divs(struct isl_set *set)
3387 return (struct isl_set *)
3388 isl_map_compute_divs((struct isl_map *)set);
3391 struct isl_set *isl_map_domain(struct isl_map *map)
3394 struct isl_set *set;
3399 map = isl_map_cow(map);
3403 set = (struct isl_set *)map;
3404 set->dim = isl_dim_domain(set->dim);
3407 for (i = 0; i < map->n; ++i) {
3408 set->p[i] = isl_basic_map_domain(map->p[i]);
3412 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3413 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3420 struct isl_map *isl_map_union_disjoint(
3421 struct isl_map *map1, struct isl_map *map2)
3425 struct isl_map *map = NULL;
3439 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
3441 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
3442 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
3443 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3445 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
3446 map1->n + map2->n, flags);
3449 for (i = 0; i < map1->n; ++i) {
3450 map = isl_map_add(map,
3451 isl_basic_map_copy(map1->p[i]));
3455 for (i = 0; i < map2->n; ++i) {
3456 map = isl_map_add(map,
3457 isl_basic_map_copy(map2->p[i]));
3471 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
3473 map1 = isl_map_union_disjoint(map1, map2);
3477 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
3481 struct isl_set *isl_set_union_disjoint(
3482 struct isl_set *set1, struct isl_set *set2)
3484 return (struct isl_set *)
3485 isl_map_union_disjoint(
3486 (struct isl_map *)set1, (struct isl_map *)set2);
3489 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
3491 return (struct isl_set *)
3492 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
3495 struct isl_map *isl_map_intersect_range(
3496 struct isl_map *map, struct isl_set *set)
3499 struct isl_map *result;
3505 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
3506 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
3507 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
3509 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
3510 map->n * set->n, flags);
3513 for (i = 0; i < map->n; ++i)
3514 for (j = 0; j < set->n; ++j) {
3515 result = isl_map_add(result,
3516 isl_basic_map_intersect_range(
3517 isl_basic_map_copy(map->p[i]),
3518 isl_basic_set_copy(set->p[j])));
3531 struct isl_map *isl_map_intersect_domain(
3532 struct isl_map *map, struct isl_set *set)
3534 return isl_map_reverse(
3535 isl_map_intersect_range(isl_map_reverse(map), set));
3538 struct isl_map *isl_map_apply_domain(
3539 struct isl_map *map1, struct isl_map *map2)
3543 map1 = isl_map_reverse(map1);
3544 map1 = isl_map_apply_range(map1, map2);
3545 return isl_map_reverse(map1);
3552 struct isl_map *isl_map_apply_range(
3553 struct isl_map *map1, struct isl_map *map2)
3555 struct isl_dim *dim_result;
3556 struct isl_map *result;
3565 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
3566 isl_dim_copy(map2->dim));
3568 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
3571 for (i = 0; i < map1->n; ++i)
3572 for (j = 0; j < map2->n; ++j) {
3573 result = isl_map_add(result,
3574 isl_basic_map_apply_range(
3575 isl_basic_map_copy(map1->p[i]),
3576 isl_basic_map_copy(map2->p[j])));
3582 if (result && result->n <= 1)
3583 ISL_F_SET(result, ISL_MAP_DISJOINT);
3592 * returns range - domain
3594 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
3596 struct isl_basic_set *bset;
3603 dim = isl_basic_map_n_in(bmap);
3604 nparam = isl_basic_map_n_param(bmap);
3605 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
3606 bset = isl_basic_set_from_basic_map(bmap);
3607 bset = isl_basic_set_cow(bset);
3608 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
3609 bset = isl_basic_set_swap_vars(bset, 2*dim);
3610 for (i = 0; i < dim; ++i) {
3611 int j = isl_basic_map_alloc_equality(
3612 (struct isl_basic_map *)bset);
3615 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
3616 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
3617 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
3618 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
3620 return isl_basic_set_project_out(bset, 2*dim, 0);
3622 isl_basic_map_free(bmap);
3627 * returns range - domain
3629 struct isl_set *isl_map_deltas(struct isl_map *map)
3632 struct isl_set *result;
3637 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
3638 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
3639 isl_map_n_in(map), map->n, map->flags);
3642 for (i = 0; i < map->n; ++i)
3643 result = isl_set_add(result,
3644 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
3652 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
3654 struct isl_basic_map *bmap;
3662 nparam = dims->nparam;
3664 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
3668 for (i = 0; i < dim; ++i) {
3669 int j = isl_basic_map_alloc_equality(bmap);
3672 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
3673 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
3674 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
3676 return isl_basic_map_finalize(bmap);
3678 isl_basic_map_free(bmap);
3682 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
3684 struct isl_dim *dim = isl_dim_map(set_dim);
3687 return basic_map_identity(dim);
3690 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
3692 if (!model || !model->dim)
3694 isl_assert(model->ctx,
3695 model->dim->n_in == model->dim->n_out, return NULL);
3696 return basic_map_identity(isl_dim_copy(model->dim));
3699 static struct isl_map *map_identity(struct isl_dim *dim)
3701 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
3702 return isl_map_add(map, basic_map_identity(isl_dim_copy(dim)));
3705 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
3707 struct isl_dim *dim = isl_dim_map(set_dim);
3710 return map_identity(dim);
3713 struct isl_map *isl_map_identity_like(struct isl_map *model)
3715 if (!model || !model->dim)
3717 isl_assert(model->ctx,
3718 model->dim->n_in == model->dim->n_out, return NULL);
3719 return map_identity(isl_dim_copy(model->dim));
3722 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
3724 if (!model || !model->dim)
3726 isl_assert(model->ctx,
3727 model->dim->n_in == model->dim->n_out, return NULL);
3728 return map_identity(isl_dim_copy(model->dim));
3731 /* Construct a basic set with all set dimensions having only non-negative
3734 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
3739 struct isl_basic_set *bset;
3743 nparam = dims->nparam;
3745 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
3748 for (i = 0; i < dim; ++i) {
3749 int k = isl_basic_set_alloc_inequality(bset);
3752 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
3753 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
3757 isl_basic_set_free(bset);
3761 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
3763 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
3766 int isl_set_is_subset(struct isl_set *set1, struct isl_set *set2)
3768 return isl_map_is_subset(
3769 (struct isl_map *)set1, (struct isl_map *)set2);
3772 int isl_basic_map_is_subset(
3773 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3776 struct isl_map *map1;
3777 struct isl_map *map2;
3779 if (!bmap1 || !bmap2)
3782 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
3783 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
3785 is_subset = isl_map_is_subset(map1, map2);
3793 int isl_basic_map_is_equal(
3794 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3798 if (!bmap1 || !bmap2)
3800 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3803 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3807 int isl_basic_set_is_equal(
3808 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
3810 return isl_basic_map_is_equal(
3811 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
3814 int isl_map_is_empty(struct isl_map *map)
3821 for (i = 0; i < map->n; ++i) {
3822 is_empty = isl_basic_map_is_empty(map->p[i]);
3831 int isl_map_fast_is_empty(struct isl_map *map)
3836 int isl_set_is_empty(struct isl_set *set)
3838 return isl_map_is_empty((struct isl_map *)set);
3841 int isl_map_is_subset(struct isl_map *map1, struct isl_map *map2)
3845 struct isl_map *diff;
3850 if (isl_map_is_empty(map1))
3853 if (isl_map_is_empty(map2))
3856 diff = isl_map_subtract(isl_map_copy(map1), isl_map_copy(map2));
3860 is_subset = isl_map_is_empty(diff);
3866 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
3872 is_subset = isl_map_is_subset(map1, map2);
3875 is_subset = isl_map_is_subset(map2, map1);
3879 int isl_basic_map_is_strict_subset(
3880 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3884 if (!bmap1 || !bmap2)
3886 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
3889 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
3890 if (is_subset == -1)
3895 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
3901 is_subset = isl_map_is_subset(map1, map2);
3904 is_subset = isl_map_is_subset(map2, map1);
3905 if (is_subset == -1)
3910 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
3914 return bmap->n_eq == 0 && bmap->n_ineq == 0;
3917 int isl_basic_set_is_universe(struct isl_basic_set *bset)
3921 return bset->n_eq == 0 && bset->n_ineq == 0;
3924 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
3926 struct isl_basic_set *bset = NULL;
3927 struct isl_vec *sample = NULL;
3934 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
3937 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
3938 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
3939 copy = isl_basic_map_convex_hull(copy);
3940 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
3941 isl_basic_map_free(copy);
3945 total = 1 + isl_basic_map_total_dim(bmap);
3946 if (bmap->sample && bmap->sample->size == total) {
3947 int contains = basic_map_contains(bmap, bmap->sample);
3953 isl_vec_free(bmap->sample);
3954 bmap->sample = NULL;
3955 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
3958 sample = isl_basic_set_sample(bset);
3961 empty = sample->size == 0;
3962 isl_vec_free(bmap->sample);
3963 bmap->sample = sample;
3965 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
3970 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
3974 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
3977 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
3981 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
3984 int isl_basic_set_is_empty(struct isl_basic_set *bset)
3986 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
3989 struct isl_map *isl_basic_map_union(
3990 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
3992 struct isl_map *map;
3993 if (!bmap1 || !bmap2)
3996 isl_assert(map1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
3998 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4001 map = isl_map_add(map, bmap1);
4002 map = isl_map_add(map, bmap2);
4005 isl_basic_map_free(bmap1);
4006 isl_basic_map_free(bmap2);
4010 struct isl_set *isl_basic_set_union(
4011 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4013 return (struct isl_set *)isl_basic_map_union(
4014 (struct isl_basic_map *)bset1,
4015 (struct isl_basic_map *)bset2);
4018 /* Order divs such that any div only depends on previous divs */
4019 static struct isl_basic_map *order_divs(struct isl_basic_map *bmap)
4022 unsigned off = isl_dim_total(bmap->dim);
4024 for (i = 0; i < bmap->n_div; ++i) {
4026 if (isl_int_is_zero(bmap->div[i][0]))
4028 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4032 isl_basic_map_swap_div(bmap, i, i + pos);
4038 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4040 return (struct isl_basic_set *)order_divs((struct isl_basic_map *)bset);
4043 /* Look for a div in dst that corresponds to the div "div" in src.
4044 * The divs before "div" in src and dst are assumed to be the same.
4046 * Returns -1 if no corresponding div was found and the position
4047 * of the corresponding div in dst otherwise.
4049 static int find_div(struct isl_basic_map *dst,
4050 struct isl_basic_map *src, unsigned div)
4054 unsigned total = isl_dim_total(src->dim);
4056 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4057 for (i = div; i < dst->n_div; ++i)
4058 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4059 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4060 dst->n_div - div) == -1)
4065 struct isl_basic_map *isl_basic_map_align_divs(
4066 struct isl_basic_map *dst, struct isl_basic_map *src)
4069 unsigned total = isl_dim_total(src->dim);
4074 if (src->n_div == 0)
4077 for (i = 0; i < src->n_div; ++i)
4078 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4080 src = order_divs(src);
4081 dst = isl_basic_map_cow(dst);
4082 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4083 src->n_div, 0, 2 * src->n_div);
4086 for (i = 0; i < src->n_div; ++i) {
4087 int j = find_div(dst, src, i);
4089 j = isl_basic_map_alloc_div(dst);
4092 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4093 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4094 if (add_div_constraints(dst, j) < 0)
4098 isl_basic_map_swap_div(dst, i, j);
4102 isl_basic_map_free(dst);
4106 struct isl_basic_set *isl_basic_set_align_divs(
4107 struct isl_basic_set *dst, struct isl_basic_set *src)
4109 return (struct isl_basic_set *)isl_basic_map_align_divs(
4110 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4113 struct isl_map *isl_map_align_divs(struct isl_map *map)
4117 map = isl_map_compute_divs(map);
4118 map = isl_map_cow(map);
4122 for (i = 1; i < map->n; ++i)
4123 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
4124 for (i = 1; i < map->n; ++i)
4125 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
4127 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4131 struct isl_set *isl_set_align_divs(struct isl_set *set)
4133 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
4136 static struct isl_map *add_cut_constraint(struct isl_map *dst,
4137 struct isl_basic_map *src, isl_int *c,
4138 unsigned len, int oppose)
4140 struct isl_basic_map *copy = NULL;
4145 copy = isl_basic_map_copy(src);
4146 copy = isl_basic_map_cow(copy);
4149 copy = isl_basic_map_extend_constraints(copy, 0, 1);
4150 k = isl_basic_map_alloc_inequality(copy);
4154 isl_seq_neg(copy->ineq[k], c, len);
4156 isl_seq_cpy(copy->ineq[k], c, len);
4157 total = 1 + isl_basic_map_total_dim(copy);
4158 isl_seq_clr(copy->ineq[k]+len, total - len);
4159 isl_inequality_negate(copy, k);
4160 copy = isl_basic_map_simplify(copy);
4161 copy = isl_basic_map_finalize(copy);
4162 is_empty = isl_basic_map_is_empty(copy);
4166 dst = isl_map_add(dst, copy);
4168 isl_basic_map_free(copy);
4171 isl_basic_map_free(copy);
4176 static struct isl_map *subtract(struct isl_map *map, struct isl_basic_map *bmap)
4180 struct isl_map *rest = NULL;
4182 unsigned total = isl_basic_map_total_dim(bmap);
4189 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4190 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4192 max = map->n * (2 * bmap->n_eq + bmap->n_ineq);
4193 rest = isl_map_alloc_dim(isl_dim_copy(map->dim), max, flags);
4197 for (i = 0; i < map->n; ++i) {
4198 map->p[i] = isl_basic_map_align_divs(map->p[i], bmap);
4203 for (j = 0; j < map->n; ++j)
4204 map->p[j] = isl_basic_map_cow(map->p[j]);
4206 for (i = 0; i < bmap->n_eq; ++i) {
4207 for (j = 0; j < map->n; ++j) {
4208 rest = add_cut_constraint(rest,
4209 map->p[j], bmap->eq[i], 1+total, 0);
4213 rest = add_cut_constraint(rest,
4214 map->p[j], bmap->eq[i], 1+total, 1);
4218 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4222 k = isl_basic_map_alloc_equality(map->p[j]);
4225 isl_seq_cpy(map->p[j]->eq[k], bmap->eq[i], 1+total);
4226 isl_seq_clr(map->p[j]->eq[k]+1+total,
4227 map->p[j]->n_div - bmap->n_div);
4231 for (i = 0; i < bmap->n_ineq; ++i) {
4232 for (j = 0; j < map->n; ++j) {
4233 rest = add_cut_constraint(rest,
4234 map->p[j], bmap->ineq[i], 1+total, 0);
4238 map->p[j] = isl_basic_map_extend_constraints(map->p[j],
4242 k = isl_basic_map_alloc_inequality(map->p[j]);
4245 isl_seq_cpy(map->p[j]->ineq[k], bmap->ineq[i], 1+total);
4246 isl_seq_clr(map->p[j]->ineq[k]+1+total,
4247 map->p[j]->n_div - bmap->n_div);
4259 struct isl_map *isl_map_subtract(struct isl_map *map1, struct isl_map *map2)
4265 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4267 if (isl_map_is_empty(map2)) {
4272 map1 = isl_map_compute_divs(map1);
4273 map2 = isl_map_compute_divs(map2);
4277 for (i = 0; map1 && i < map2->n; ++i)
4278 map1 = subtract(map1, map2->p[i]);
4288 struct isl_set *isl_set_subtract(struct isl_set *set1, struct isl_set *set2)
4290 return (struct isl_set *)
4292 (struct isl_map *)set1, (struct isl_map *)set2);
4295 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
4299 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
4300 map = isl_map_intersect_domain(map, set);
4301 set = isl_map_range(map);
4309 /* There is no need to cow as removing empty parts doesn't change
4310 * the meaning of the set.
4312 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
4319 for (i = map->n-1; i >= 0; --i) {
4320 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
4322 isl_basic_map_free(map->p[i]);
4323 if (i != map->n-1) {
4324 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4325 map->p[i] = map->p[map->n-1];
4333 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
4335 return (struct isl_set *)
4336 isl_map_remove_empty_parts((struct isl_map *)set);
4339 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
4341 struct isl_basic_map *bmap;
4342 if (!map || map->n == 0)
4344 bmap = map->p[map->n-1];
4345 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
4346 return isl_basic_map_copy(bmap);
4349 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
4351 (struct isl_basic_set *)isl_map_copy_basic_map((struct isl_map *)set);
4354 struct isl_map *isl_map_drop_basic_map(struct isl_map *map,
4355 struct isl_basic_map *bmap)
4361 for (i = map->n-1; i >= 0; --i) {
4362 if (map->p[i] != bmap)
4364 map = isl_map_cow(map);
4367 isl_basic_map_free(map->p[i]);
4368 if (i != map->n-1) {
4369 ISL_F_CLR(map, ISL_SET_NORMALIZED);
4370 map->p[i] = map->p[map->n-1];
4375 isl_basic_map_free(bmap);
4379 isl_basic_map_free(bmap);
4383 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
4384 struct isl_basic_set *bset)
4386 (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
4387 (struct isl_basic_map *)bset);
4390 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
4391 * for any common value of the parameters and dimensions preceding dim
4392 * in both basic sets, the values of dimension pos in bset1 are
4393 * smaller or larger than those in bset2.
4396 * 1 if bset1 follows bset2
4397 * -1 if bset1 precedes bset2
4398 * 0 if bset1 and bset2 are incomparable
4399 * -2 if some error occurred.
4401 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
4402 struct isl_basic_set *bset2, int pos)
4404 struct isl_dim *dims;
4405 struct isl_basic_map *bmap1 = NULL;
4406 struct isl_basic_map *bmap2 = NULL;
4407 struct isl_ctx *ctx;
4408 struct isl_vec *obj;
4411 unsigned dim1, dim2;
4413 enum isl_lp_result res;
4416 if (!bset1 || !bset2)
4419 nparam = isl_basic_set_n_param(bset1);
4420 dim1 = isl_basic_set_n_dim(bset1);
4421 dim2 = isl_basic_set_n_dim(bset2);
4422 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
4423 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
4424 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
4425 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
4426 if (!bmap1 || !bmap2)
4428 bmap1 = isl_basic_map_cow(bmap1);
4429 bmap1 = isl_basic_map_extend(bmap1, nparam,
4430 pos, (dim1 - pos) + (dim2 - pos),
4431 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
4432 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
4435 total = isl_basic_map_total_dim(bmap1);
4437 obj = isl_vec_alloc(ctx, 1 + total);
4438 isl_seq_clr(obj->block.data, 1 + total);
4439 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
4440 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
4445 res = isl_basic_map_solve_lp(bmap1, 0, obj->block.data, ctx->one,
4447 if (res == isl_lp_empty)
4449 else if (res == isl_lp_ok && isl_int_is_pos(num))
4451 else if ((res == isl_lp_ok && isl_int_is_neg(num)) ||
4452 res == isl_lp_unbounded)
4458 isl_basic_map_free(bmap1);
4462 isl_basic_map_free(bmap1);
4463 isl_basic_map_free(bmap2);
4467 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
4468 unsigned pos, isl_int *val)
4476 total = isl_basic_map_total_dim(bmap);
4477 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
4478 for (; d+1 > pos; --d)
4479 if (!isl_int_is_zero(bmap->eq[i][1+d]))
4483 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
4485 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
4487 if (!isl_int_is_one(bmap->eq[i][1+d]))
4490 isl_int_neg(*val, bmap->eq[i][0]);
4496 static int isl_map_fast_has_fixed_var(struct isl_map *map,
4497 unsigned pos, isl_int *val)
4509 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
4512 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
4513 for (i = 1; fixed == 1 && i < map->n; ++i) {
4514 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
4515 if (fixed == 1 && isl_int_ne(tmp, v))
4519 isl_int_set(*val, v);
4525 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
4526 unsigned pos, isl_int *val)
4528 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
4532 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
4535 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
4538 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
4539 enum isl_dim_type type, unsigned pos, isl_int *val)
4541 if (pos >= isl_basic_map_dim(bmap, type))
4543 return isl_basic_map_fast_has_fixed_var(bmap,
4544 isl_basic_map_offset(bmap, type) - 1 + pos, val);
4547 int isl_map_fast_is_fixed(struct isl_map *map,
4548 enum isl_dim_type type, unsigned pos, isl_int *val)
4550 if (pos >= isl_map_dim(map, type))
4552 return isl_map_fast_has_fixed_var(map,
4553 map_offset(map, type) - 1 + pos, val);
4556 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4557 * then return this fixed value in *val.
4559 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
4562 return isl_basic_set_fast_has_fixed_var(bset,
4563 isl_basic_set_n_param(bset) + dim, val);
4566 /* Check if dimension dim has fixed value and if so and if val is not NULL,
4567 * then return this fixed value in *val.
4569 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
4571 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
4574 /* Check if input variable in has fixed value and if so and if val is not NULL,
4575 * then return this fixed value in *val.
4577 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
4579 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
4582 /* Check if dimension dim has an (obvious) fixed lower bound and if so
4583 * and if val is not NULL, then return this lower bound in *val.
4585 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
4586 unsigned dim, isl_int *val)
4588 int i, i_eq = -1, i_ineq = -1;
4595 total = isl_basic_set_total_dim(bset);
4596 nparam = isl_basic_set_n_param(bset);
4597 for (i = 0; i < bset->n_eq; ++i) {
4598 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
4604 for (i = 0; i < bset->n_ineq; ++i) {
4605 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
4607 if (i_eq != -1 || i_ineq != -1)
4611 if (i_eq == -1 && i_ineq == -1)
4613 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
4614 /* The coefficient should always be one due to normalization. */
4615 if (!isl_int_is_one(c[1+nparam+dim]))
4617 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
4619 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
4620 total - nparam - dim - 1) != -1)
4623 isl_int_neg(*val, c[0]);
4627 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
4628 unsigned dim, isl_int *val)
4640 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4644 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
4646 for (i = 1; fixed == 1 && i < set->n; ++i) {
4647 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
4649 if (fixed == 1 && isl_int_ne(tmp, v))
4653 isl_int_set(*val, v);
4664 static int qsort_constraint_cmp(const void *p1, const void *p2)
4666 const struct constraint *c1 = (const struct constraint *)p1;
4667 const struct constraint *c2 = (const struct constraint *)p2;
4668 unsigned size = isl_min(c1->size, c2->size);
4669 return isl_seq_cmp(c1->c, c2->c, size);
4672 static struct isl_basic_map *isl_basic_map_sort_constraints(
4673 struct isl_basic_map *bmap)
4676 struct constraint *c;
4681 total = isl_basic_map_total_dim(bmap);
4682 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
4685 for (i = 0; i < bmap->n_ineq; ++i) {
4687 c[i].c = bmap->ineq[i];
4689 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
4690 for (i = 0; i < bmap->n_ineq; ++i)
4691 bmap->ineq[i] = c[i].c;
4695 isl_basic_map_free(bmap);
4699 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
4703 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
4705 bmap = isl_basic_map_convex_hull(bmap);
4706 bmap = isl_basic_map_sort_constraints(bmap);
4707 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
4711 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
4713 return (struct isl_basic_set *)isl_basic_map_normalize(
4714 (struct isl_basic_map *)bset);
4717 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
4718 const struct isl_basic_map *bmap2)
4725 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
4726 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
4727 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
4728 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4729 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
4730 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
4731 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
4732 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4734 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
4736 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
4738 if (bmap1->n_eq != bmap2->n_eq)
4739 return bmap1->n_eq - bmap2->n_eq;
4740 if (bmap1->n_ineq != bmap2->n_ineq)
4741 return bmap1->n_ineq - bmap2->n_ineq;
4742 if (bmap1->n_div != bmap2->n_div)
4743 return bmap1->n_div - bmap2->n_div;
4744 total = isl_basic_map_total_dim(bmap1);
4745 for (i = 0; i < bmap1->n_eq; ++i) {
4746 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
4750 for (i = 0; i < bmap1->n_ineq; ++i) {
4751 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
4755 for (i = 0; i < bmap1->n_div; ++i) {
4756 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
4763 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
4764 struct isl_basic_map *bmap2)
4766 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
4769 static int qsort_bmap_cmp(const void *p1, const void *p2)
4771 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
4772 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
4774 return isl_basic_map_fast_cmp(bmap1, bmap2);
4777 /* We normalize in place, but if anything goes wrong we need
4778 * to return NULL, so we need to make sure we don't change the
4779 * meaning of any possible other copies of map.
4781 struct isl_map *isl_map_normalize(struct isl_map *map)
4784 struct isl_basic_map *bmap;
4788 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
4790 for (i = 0; i < map->n; ++i) {
4791 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
4794 isl_basic_map_free(map->p[i]);
4797 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
4798 ISL_F_SET(map, ISL_MAP_NORMALIZED);
4799 map = isl_map_remove_empty_parts(map);
4802 for (i = map->n - 1; i >= 1; --i) {
4803 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
4805 isl_basic_map_free(map->p[i-1]);
4806 for (j = i; j < map->n; ++j)
4807 map->p[j-1] = map->p[j];
4817 struct isl_set *isl_set_normalize(struct isl_set *set)
4819 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
4822 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
4832 if (!isl_dim_equal(map1->dim, map2->dim))
4835 map1 = isl_map_copy(map1);
4836 map2 = isl_map_copy(map2);
4837 map1 = isl_map_normalize(map1);
4838 map2 = isl_map_normalize(map2);
4841 equal = map1->n == map2->n;
4842 for (i = 0; equal && i < map1->n; ++i) {
4843 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
4856 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
4858 return isl_map_fast_is_equal((struct isl_map *)set1,
4859 (struct isl_map *)set2);
4862 /* Return an interval that ranges from min to max (inclusive)
4864 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
4865 isl_int min, isl_int max)
4868 struct isl_basic_set *bset = NULL;
4870 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
4874 k = isl_basic_set_alloc_inequality(bset);
4877 isl_int_set_si(bset->ineq[k][1], 1);
4878 isl_int_neg(bset->ineq[k][0], min);
4880 k = isl_basic_set_alloc_inequality(bset);
4883 isl_int_set_si(bset->ineq[k][1], -1);
4884 isl_int_set(bset->ineq[k][0], max);
4888 isl_basic_set_free(bset);
4892 /* Return the Cartesian product of the basic sets in list (in the given order).
4894 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
4902 struct isl_basic_set *product = NULL;
4906 isl_assert(list->ctx, list->n > 0, goto error);
4907 isl_assert(list->ctx, list->p[0], goto error);
4908 nparam = isl_basic_set_n_param(list->p[0]);
4909 dim = isl_basic_set_n_dim(list->p[0]);
4910 extra = list->p[0]->n_div;
4911 n_eq = list->p[0]->n_eq;
4912 n_ineq = list->p[0]->n_ineq;
4913 for (i = 1; i < list->n; ++i) {
4914 isl_assert(list->ctx, list->p[i], goto error);
4915 isl_assert(list->ctx,
4916 nparam == isl_basic_set_n_param(list->p[i]), goto error);
4917 dim += isl_basic_set_n_dim(list->p[i]);
4918 extra += list->p[i]->n_div;
4919 n_eq += list->p[i]->n_eq;
4920 n_ineq += list->p[i]->n_ineq;
4922 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
4927 for (i = 0; i < list->n; ++i) {
4928 isl_basic_set_add_constraints(product,
4929 isl_basic_set_copy(list->p[i]), dim);
4930 dim += isl_basic_set_n_dim(list->p[i]);
4932 isl_basic_set_list_free(list);
4935 isl_basic_set_free(product);
4936 isl_basic_set_list_free(list);
4940 struct isl_basic_map *isl_basic_map_product(
4941 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4943 struct isl_dim *dim_result = NULL;
4944 struct isl_basic_map *bmap;
4945 unsigned in1, in2, out1, out2, nparam, total, pos;
4946 struct isl_dim_map *dim_map1, *dim_map2;
4948 if (!bmap1 || !bmap2)
4951 isl_assert(map1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
4952 bmap2->dim, isl_dim_param), goto error);
4953 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
4954 isl_dim_copy(bmap2->dim));
4956 in1 = isl_basic_map_n_in(bmap1);
4957 in2 = isl_basic_map_n_in(bmap2);
4958 out1 = isl_basic_map_n_out(bmap1);
4959 out2 = isl_basic_map_n_out(bmap2);
4960 nparam = isl_basic_map_n_param(bmap1);
4962 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
4963 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
4964 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
4965 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
4966 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
4967 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
4968 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
4969 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
4970 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
4971 isl_dim_map_div(dim_map1, bmap1, pos += out2);
4972 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
4974 bmap = isl_basic_map_alloc_dim(dim_result,
4975 bmap1->n_div + bmap2->n_div,
4976 bmap1->n_eq + bmap2->n_eq,
4977 bmap1->n_ineq + bmap2->n_ineq);
4978 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
4979 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
4980 bmap = isl_basic_map_simplify(bmap);
4981 return isl_basic_map_finalize(bmap);
4983 isl_basic_map_free(bmap1);
4984 isl_basic_map_free(bmap2);
4988 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
4990 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
4993 struct isl_map *result;
4999 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5000 map2->dim, isl_dim_param), goto error);
5002 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5003 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5004 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5006 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5007 isl_dim_copy(map2->dim)),
5008 map1->n * map2->n, flags);
5011 for (i = 0; i < map1->n; ++i)
5012 for (j = 0; j < map2->n; ++j) {
5013 struct isl_basic_map *part;
5014 part = isl_basic_map_product(
5015 isl_basic_map_copy(map1->p[i]),
5016 isl_basic_map_copy(map2->p[j]));
5017 if (isl_basic_map_is_empty(part))
5018 isl_basic_map_free(part);
5020 result = isl_map_add(result, part);
5033 /* Given two set A and B, construct its Cartesian product A x B.
5035 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5037 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5038 (struct isl_map *)set2);
5041 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5049 bset = isl_basic_set_copy(bset);
5050 bset = isl_basic_set_normalize(bset);
5053 total = isl_basic_set_total_dim(bset);
5054 isl_hash_byte(hash, bset->n_eq & 0xFF);
5055 for (i = 0; i < bset->n_eq; ++i) {
5057 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5058 isl_hash_hash(hash, c_hash);
5060 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5061 for (i = 0; i < bset->n_ineq; ++i) {
5063 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5064 isl_hash_hash(hash, c_hash);
5066 isl_hash_byte(hash, bset->n_div & 0xFF);
5067 for (i = 0; i < bset->n_div; ++i) {
5069 if (isl_int_is_zero(bset->div[i][0]))
5071 isl_hash_byte(hash, i & 0xFF);
5072 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5073 isl_hash_hash(hash, c_hash);
5075 isl_basic_set_free(bset);
5079 uint32_t isl_set_get_hash(struct isl_set *set)
5086 set = isl_set_copy(set);
5087 set = isl_set_normalize(set);
5091 hash = isl_hash_init();
5092 for (i = 0; i < set->n; ++i) {
5094 bset_hash = isl_basic_set_get_hash(set->p[i]);
5095 isl_hash_hash(hash, bset_hash);
5103 /* Check if the value for dimension dim is completely determined
5104 * by the values of the other parameters and variables.
5105 * That is, check if dimension dim is involved in an equality.
5107 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5114 nparam = isl_basic_set_n_param(bset);
5115 for (i = 0; i < bset->n_eq; ++i)
5116 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5121 /* Check if the value for dimension dim is completely determined
5122 * by the values of the other parameters and variables.
5123 * That is, check if dimension dim is involved in an equality
5124 * for each of the subsets.
5126 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5132 for (i = 0; i < set->n; ++i) {
5134 unique = isl_basic_set_dim_is_unique(set->p[i], dim);