2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include "isl_sample.h"
30 /* Maps dst positions to src positions */
36 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
39 struct isl_dim_map *dim_map;
40 dim_map = isl_alloc(ctx, struct isl_dim_map,
41 sizeof(struct isl_dim_map) + len * sizeof(int));
44 dim_map->len = 1 + len;
46 for (i = 0; i < len; ++i)
47 dim_map->pos[1 + i] = -1;
51 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
54 case isl_dim_param: return dim->nparam;
55 case isl_dim_in: return dim->n_in;
56 case isl_dim_out: return dim->n_out;
57 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
61 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
64 case isl_dim_param: return 1;
65 case isl_dim_in: return 1 + dim->nparam;
66 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
70 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
71 struct isl_dim *dim, enum isl_dim_type type,
72 unsigned first, unsigned n, unsigned dst_pos)
80 src_pos = pos(dim, type);
81 for (i = 0; i < n; ++i)
82 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
85 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
86 enum isl_dim_type type, unsigned dst_pos)
88 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
91 static void isl_dim_map_div(struct isl_dim_map *dim_map,
92 struct isl_basic_map *bmap, unsigned dst_pos)
97 if (!dim_map || !bmap)
100 src_pos = 1 + isl_dim_total(bmap->dim);
101 for (i = 0; i < bmap->n_div; ++i)
102 dim_map->pos[1 + dst_pos + i] = src_pos + i;
105 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
109 for (i = 0; i < dim_map->len; ++i)
110 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
111 fprintf(stderr, "\n");
114 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
115 enum isl_dim_type type)
120 case isl_dim_out: return isl_dim_size(bmap->dim, type);
121 case isl_dim_div: return bmap->n_div;
122 case isl_dim_all: return isl_basic_map_total_dim(bmap);
126 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
128 return map ? n(map->dim, type) : 0;
131 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
133 return set ? n(set->dim, type) : 0;
136 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
137 enum isl_dim_type type)
139 struct isl_dim *dim = bmap->dim;
141 case isl_dim_param: return 1;
142 case isl_dim_in: return 1 + dim->nparam;
143 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
144 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
148 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
150 return pos(map->dim, type);
153 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
154 enum isl_dim_type type)
156 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
159 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
161 return bset->dim->n_out;
164 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
166 return bset->dim->nparam;
169 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
171 return isl_dim_total(bset->dim) + bset->n_div;
174 unsigned isl_set_n_dim(const struct isl_set *set)
176 return set->dim->n_out;
179 unsigned isl_set_n_param(const struct isl_set *set)
181 return set->dim->nparam;
184 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
186 return bmap->dim->n_in;
189 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
191 return bmap->dim->n_out;
194 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
196 return bmap->dim->nparam;
199 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
204 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
206 return isl_dim_total(bmap->dim) + bmap->n_div;
209 unsigned isl_map_n_in(const struct isl_map *map)
211 return map->dim->n_in;
214 unsigned isl_map_n_out(const struct isl_map *map)
216 return map->dim->n_out;
219 unsigned isl_map_n_param(const struct isl_map *map)
221 return map->dim->nparam;
224 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
226 return map->dim->n_in == set->dim->n_out &&
227 map->dim->nparam == set->dim->nparam;
230 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
231 struct isl_basic_set *bset)
233 return bmap->dim->n_in == bset->dim->n_out &&
234 bmap->dim->nparam == bset->dim->nparam;
237 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
238 struct isl_basic_set *bset)
240 return bmap->dim->n_out == bset->dim->n_out &&
241 bmap->dim->nparam == bset->dim->nparam;
244 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
248 return isl_dim_copy(bmap->dim);
251 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
255 return isl_dim_copy(bset->dim);
258 struct isl_dim *isl_map_get_dim(struct isl_map *map)
262 return isl_dim_copy(map->dim);
265 struct isl_dim *isl_set_get_dim(struct isl_set *set)
269 return isl_dim_copy(set->dim);
272 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
273 struct isl_basic_map *bmap, unsigned extra,
274 unsigned n_eq, unsigned n_ineq)
277 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
279 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
280 if (isl_blk_is_error(bmap->block)) {
285 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
287 isl_blk_free(ctx, bmap->block);
293 bmap->block2 = isl_blk_empty();
296 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
297 if (isl_blk_is_error(bmap->block2)) {
299 isl_blk_free(ctx, bmap->block);
304 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
306 isl_blk_free(ctx, bmap->block2);
308 isl_blk_free(ctx, bmap->block);
314 for (i = 0; i < n_ineq + n_eq; ++i)
315 bmap->ineq[i] = bmap->block.data + i * row_size;
317 for (i = 0; i < extra; ++i)
318 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
324 bmap->c_size = n_eq + n_ineq;
325 bmap->eq = bmap->ineq + n_ineq;
334 isl_basic_map_free(bmap);
338 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
339 unsigned nparam, unsigned dim, unsigned extra,
340 unsigned n_eq, unsigned n_ineq)
342 struct isl_basic_map *bmap;
343 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
344 return (struct isl_basic_set *)bmap;
347 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
348 unsigned extra, unsigned n_eq, unsigned n_ineq)
350 struct isl_basic_map *bmap;
353 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
354 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
355 return (struct isl_basic_set *)bmap;
358 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
359 unsigned extra, unsigned n_eq, unsigned n_ineq)
361 struct isl_basic_map *bmap;
365 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
370 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
376 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
377 unsigned nparam, unsigned in, unsigned out, unsigned extra,
378 unsigned n_eq, unsigned n_ineq)
380 struct isl_basic_map *bmap;
383 dim = isl_dim_alloc(ctx, nparam, in, out);
387 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
391 static void dup_constraints(
392 struct isl_basic_map *dst, struct isl_basic_map *src)
395 unsigned total = isl_basic_map_total_dim(src);
397 for (i = 0; i < src->n_eq; ++i) {
398 int j = isl_basic_map_alloc_equality(dst);
399 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
402 for (i = 0; i < src->n_ineq; ++i) {
403 int j = isl_basic_map_alloc_inequality(dst);
404 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
407 for (i = 0; i < src->n_div; ++i) {
408 int j = isl_basic_map_alloc_div(dst);
409 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
411 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
414 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
416 struct isl_basic_map *dup;
420 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
421 bmap->n_div, bmap->n_eq, bmap->n_ineq);
424 dup_constraints(dup, bmap);
425 dup->flags = bmap->flags;
426 dup->sample = isl_vec_copy(bmap->sample);
430 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
432 struct isl_basic_map *dup;
434 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
435 return (struct isl_basic_set *)dup;
438 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
443 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
447 return isl_basic_set_dup(bset);
450 struct isl_set *isl_set_copy(struct isl_set *set)
459 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
464 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
468 return isl_basic_map_dup(bmap);
471 struct isl_map *isl_map_copy(struct isl_map *map)
480 void isl_basic_map_free(struct isl_basic_map *bmap)
488 isl_ctx_deref(bmap->ctx);
490 isl_blk_free(bmap->ctx, bmap->block2);
492 isl_blk_free(bmap->ctx, bmap->block);
493 isl_vec_free(bmap->sample);
494 isl_dim_free(bmap->dim);
498 void isl_basic_set_free(struct isl_basic_set *bset)
500 isl_basic_map_free((struct isl_basic_map *)bset);
503 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
505 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
508 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
514 isl_assert(ctx, room_for_con(bmap, 1), return -1);
515 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
517 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
518 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
519 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
520 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
521 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
522 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
524 int j = isl_basic_map_alloc_inequality(bmap);
528 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
529 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
536 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
537 bmap->extra - bmap->n_div);
541 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
543 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
546 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
550 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
555 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
557 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
560 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
565 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
567 if (pos != bmap->n_eq - 1) {
569 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
570 bmap->eq[bmap->n_eq - 1] = t;
576 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
578 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
581 void isl_basic_map_inequality_to_equality(
582 struct isl_basic_map *bmap, unsigned pos)
587 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
588 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
593 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
594 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
595 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
596 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
599 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
601 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
604 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
610 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
611 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
612 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
613 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
614 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
615 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
616 1 + isl_basic_map_total_dim(bmap),
617 bmap->extra - bmap->n_div);
618 return bmap->n_ineq++;
621 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
623 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
626 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
630 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
635 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
637 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
640 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
645 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
647 if (pos != bmap->n_ineq - 1) {
649 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
650 bmap->ineq[bmap->n_ineq - 1] = t;
651 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
657 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
659 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
662 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
667 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
670 k = isl_basic_map_alloc_equality(bmap);
673 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
676 isl_basic_map_free(bmap);
680 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
683 return (isl_basic_set *)
684 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
687 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
692 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
695 k = isl_basic_map_alloc_inequality(bmap);
698 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
701 isl_basic_map_free(bmap);
705 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
708 return (isl_basic_set *)
709 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
712 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
716 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
717 isl_seq_clr(bmap->div[bmap->n_div] +
718 1 + 1 + isl_basic_map_total_dim(bmap),
719 bmap->extra - bmap->n_div);
720 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
721 return bmap->n_div++;
724 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
726 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
729 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
733 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
738 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
740 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
743 /* Copy constraint from src to dst, putting the vars of src at offset
744 * dim_off in dst and the divs of src at offset div_off in dst.
745 * If both sets are actually map, then dim_off applies to the input
748 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
749 struct isl_basic_map *src_map, isl_int *src,
750 unsigned in_off, unsigned out_off, unsigned div_off)
752 unsigned src_nparam = isl_basic_map_n_param(src_map);
753 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
754 unsigned src_in = isl_basic_map_n_in(src_map);
755 unsigned dst_in = isl_basic_map_n_in(dst_map);
756 unsigned src_out = isl_basic_map_n_out(src_map);
757 unsigned dst_out = isl_basic_map_n_out(dst_map);
758 isl_int_set(dst[0], src[0]);
759 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
760 if (dst_nparam > src_nparam)
761 isl_seq_clr(dst+1+src_nparam,
762 dst_nparam - src_nparam);
763 isl_seq_clr(dst+1+dst_nparam, in_off);
764 isl_seq_cpy(dst+1+dst_nparam+in_off,
766 isl_min(dst_in-in_off, src_in));
767 if (dst_in-in_off > src_in)
768 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
769 dst_in - in_off - src_in);
770 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
771 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
772 src+1+src_nparam+src_in,
773 isl_min(dst_out-out_off, src_out));
774 if (dst_out-out_off > src_out)
775 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
776 dst_out - out_off - src_out);
777 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
778 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
779 src+1+src_nparam+src_in+src_out,
780 isl_min(dst_map->extra-div_off, src_map->n_div));
781 if (dst_map->n_div-div_off > src_map->n_div)
782 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
783 div_off+src_map->n_div,
784 dst_map->n_div - div_off - src_map->n_div);
787 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
788 struct isl_basic_map *src_map, isl_int *src,
789 unsigned in_off, unsigned out_off, unsigned div_off)
791 isl_int_set(dst[0], src[0]);
792 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
795 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
796 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
801 if (!bmap1 || !bmap2)
804 div_off = bmap1->n_div;
806 for (i = 0; i < bmap2->n_eq; ++i) {
807 int i1 = isl_basic_map_alloc_equality(bmap1);
810 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
811 i_pos, o_pos, div_off);
814 for (i = 0; i < bmap2->n_ineq; ++i) {
815 int i1 = isl_basic_map_alloc_inequality(bmap1);
818 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
819 i_pos, o_pos, div_off);
822 for (i = 0; i < bmap2->n_div; ++i) {
823 int i1 = isl_basic_map_alloc_div(bmap1);
826 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
827 i_pos, o_pos, div_off);
830 isl_basic_map_free(bmap2);
835 isl_basic_map_free(bmap1);
836 isl_basic_map_free(bmap2);
840 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
841 struct isl_dim_map *dim_map)
845 for (i = 0; i < dim_map->len; ++i) {
846 if (dim_map->pos[i] < 0)
847 isl_int_set_si(dst[i], 0);
849 isl_int_set(dst[i], src[dim_map->pos[i]]);
853 static void copy_div_dim_map(isl_int *dst, isl_int *src,
854 struct isl_dim_map *dim_map)
856 isl_int_set(dst[0], src[0]);
857 copy_constraint_dim_map(dst+1, src+1, dim_map);
860 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
861 struct isl_basic_map *src, struct isl_dim_map *dim_map)
865 if (!src || !dst || !dim_map)
868 for (i = 0; i < src->n_eq; ++i) {
869 int i1 = isl_basic_map_alloc_equality(dst);
872 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
875 for (i = 0; i < src->n_ineq; ++i) {
876 int i1 = isl_basic_map_alloc_inequality(dst);
879 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
882 for (i = 0; i < src->n_div; ++i) {
883 int i1 = isl_basic_map_alloc_div(dst);
886 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
890 isl_basic_map_free(src);
895 isl_basic_map_free(src);
896 isl_basic_map_free(dst);
900 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
901 struct isl_basic_set *bset2, unsigned pos)
903 return (struct isl_basic_set *)
904 add_constraints((struct isl_basic_map *)bset1,
905 (struct isl_basic_map *)bset2, 0, pos);
908 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
909 struct isl_dim *dim, unsigned extra,
910 unsigned n_eq, unsigned n_ineq)
912 struct isl_basic_map *ext;
922 dims_ok = isl_dim_equal(base->dim, dim) &&
923 base->extra >= base->n_div + extra;
925 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
926 room_for_ineq(base, n_ineq)) {
931 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
932 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
933 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
934 extra += base->extra;
936 n_ineq += base->n_ineq;
938 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
944 ext->sample = isl_vec_copy(base->sample);
946 ext = add_constraints(ext, base, 0, 0);
949 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
956 isl_basic_map_free(base);
960 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
961 struct isl_dim *dim, unsigned extra,
962 unsigned n_eq, unsigned n_ineq)
964 return (struct isl_basic_set *)
965 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
966 extra, n_eq, n_ineq);
969 struct isl_basic_map *isl_basic_map_extend_constraints(
970 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
974 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
978 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
979 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
980 unsigned n_eq, unsigned n_ineq)
982 struct isl_basic_map *bmap;
987 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
991 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
995 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
996 unsigned nparam, unsigned dim, unsigned extra,
997 unsigned n_eq, unsigned n_ineq)
999 return (struct isl_basic_set *)
1000 isl_basic_map_extend((struct isl_basic_map *)base,
1001 nparam, 0, dim, extra, n_eq, n_ineq);
1004 struct isl_basic_set *isl_basic_set_extend_constraints(
1005 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1007 return (struct isl_basic_set *)
1008 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1012 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1014 return (struct isl_basic_set *)
1015 isl_basic_map_cow((struct isl_basic_map *)bset);
1018 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1023 if (bmap->ref > 1) {
1025 bmap = isl_basic_map_dup(bmap);
1027 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1031 struct isl_set *isl_set_cow(struct isl_set *set)
1039 return isl_set_dup(set);
1042 struct isl_map *isl_map_cow(struct isl_map *map)
1050 return isl_map_dup(map);
1053 static void swap_vars(struct isl_blk blk, isl_int *a,
1054 unsigned a_len, unsigned b_len)
1056 isl_seq_cpy(blk.data, a+a_len, b_len);
1057 isl_seq_cpy(blk.data+b_len, a, a_len);
1058 isl_seq_cpy(a, blk.data, b_len+a_len);
1061 struct isl_basic_set *isl_basic_set_swap_vars(
1062 struct isl_basic_set *bset, unsigned n)
1072 nparam = isl_basic_set_n_param(bset);
1073 dim = isl_basic_set_n_dim(bset);
1074 isl_assert(bset->ctx, n <= dim, goto error);
1079 bset = isl_basic_set_cow(bset);
1083 blk = isl_blk_alloc(bset->ctx, dim);
1084 if (isl_blk_is_error(blk))
1087 for (i = 0; i < bset->n_eq; ++i)
1089 bset->eq[i]+1+nparam, n, dim - n);
1091 for (i = 0; i < bset->n_ineq; ++i)
1093 bset->ineq[i]+1+nparam, n, dim - n);
1095 for (i = 0; i < bset->n_div; ++i)
1097 bset->div[i]+1+1+nparam, n, dim - n);
1099 isl_blk_free(bset->ctx, blk);
1101 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1102 return isl_basic_set_gauss(bset, NULL);
1104 isl_basic_set_free(bset);
1108 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1111 set = isl_set_cow(set);
1115 for (i = 0; i < set->n; ++i) {
1116 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1122 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1126 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1132 total = isl_basic_map_total_dim(bmap);
1133 isl_basic_map_free_div(bmap, bmap->n_div);
1134 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1136 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1138 i = isl_basic_map_alloc_equality(bmap);
1142 isl_int_set_si(bmap->eq[i][0], 1);
1143 isl_seq_clr(bmap->eq[i]+1, total);
1144 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1145 isl_vec_free(bmap->sample);
1146 bmap->sample = NULL;
1147 return isl_basic_map_finalize(bmap);
1149 isl_basic_map_free(bmap);
1153 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1155 return (struct isl_basic_set *)
1156 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1159 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1162 unsigned off = isl_dim_total(bmap->dim);
1163 isl_int *t = bmap->div[a];
1164 bmap->div[a] = bmap->div[b];
1167 for (i = 0; i < bmap->n_eq; ++i)
1168 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1170 for (i = 0; i < bmap->n_ineq; ++i)
1171 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1173 for (i = 0; i < bmap->n_div; ++i)
1174 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1175 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1178 /* Eliminate the specified n dimensions starting at first from the
1179 * constraints using Fourier-Motzkin. The dimensions themselves
1182 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1183 enum isl_dim_type type, unsigned first, unsigned n)
1192 map = isl_map_cow(map);
1195 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1196 first += pos(map->dim, type) - 1;
1198 for (i = 0; i < map->n; ++i) {
1199 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1209 /* Eliminate the specified n dimensions starting at first from the
1210 * constraints using Fourier-Motzkin. The dimensions themselves
1213 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1214 enum isl_dim_type type, unsigned first, unsigned n)
1216 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1219 /* Eliminate the specified n dimensions starting at first from the
1220 * constraints using Fourier-Motzkin. The dimensions themselves
1223 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1224 unsigned first, unsigned n)
1226 return isl_set_eliminate(set, isl_dim_set, first, n);
1229 /* Project out n dimensions starting at first using Fourier-Motzkin */
1230 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1231 unsigned first, unsigned n)
1233 set = isl_set_eliminate_dims(set, first, n);
1234 set = isl_set_drop_dims(set, first, n);
1238 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1240 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1248 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1257 set = isl_set_cow(set);
1261 for (i = 0; i < set->n; ++i) {
1262 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1272 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1273 enum isl_dim_type type, unsigned first, unsigned n)
1277 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1281 bmap = isl_basic_map_eliminate_vars(bmap,
1282 isl_basic_map_offset(bmap, type) - 1 + first, n);
1285 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1287 bmap = isl_basic_map_drop(bmap, type, first, n);
1290 isl_basic_map_free(bmap);
1294 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1295 enum isl_dim_type type, unsigned first, unsigned n)
1297 return (isl_basic_set *)
1298 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1301 struct isl_map *isl_map_remove(struct isl_map *map,
1302 enum isl_dim_type type, unsigned first, unsigned n)
1309 map = isl_map_cow(map);
1312 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1314 for (i = 0; i < map->n; ++i) {
1315 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1316 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1320 map = isl_map_drop(map, type, first, n);
1327 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1328 enum isl_dim_type type, unsigned first, unsigned n)
1330 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1333 /* Project out n inputs starting at first using Fourier-Motzkin */
1334 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1335 unsigned first, unsigned n)
1337 return isl_map_remove(map, isl_dim_in, first, n);
1340 /* Project out n dimensions starting at first using Fourier-Motzkin */
1341 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1342 unsigned first, unsigned n)
1344 unsigned nparam = isl_basic_set_n_param(bset);
1345 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1346 bset = isl_basic_set_drop_dims(bset, first, n);
1350 static void dump_term(struct isl_basic_map *bmap,
1351 isl_int c, int pos, FILE *out)
1354 unsigned in = isl_basic_map_n_in(bmap);
1355 unsigned dim = in + isl_basic_map_n_out(bmap);
1356 unsigned nparam = isl_basic_map_n_param(bmap);
1358 isl_int_print(out, c, 0);
1360 if (!isl_int_is_one(c))
1361 isl_int_print(out, c, 0);
1362 if (pos < 1 + nparam) {
1363 name = isl_dim_get_name(bmap->dim,
1364 isl_dim_param, pos - 1);
1366 fprintf(out, "%s", name);
1368 fprintf(out, "p%d", pos - 1);
1369 } else if (pos < 1 + nparam + in)
1370 fprintf(out, "i%d", pos - 1 - nparam);
1371 else if (pos < 1 + nparam + dim)
1372 fprintf(out, "o%d", pos - 1 - nparam - in);
1374 fprintf(out, "e%d", pos - 1 - nparam - dim);
1378 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1379 int sign, FILE *out)
1383 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1387 for (i = 0, first = 1; i < len; ++i) {
1388 if (isl_int_sgn(c[i]) * sign <= 0)
1391 fprintf(out, " + ");
1393 isl_int_abs(v, c[i]);
1394 dump_term(bmap, v, i, out);
1401 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1402 const char *op, FILE *out, int indent)
1406 fprintf(out, "%*s", indent, "");
1408 dump_constraint_sign(bmap, c, 1, out);
1409 fprintf(out, " %s ", op);
1410 dump_constraint_sign(bmap, c, -1, out);
1414 for (i = bmap->n_div; i < bmap->extra; ++i) {
1415 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1417 fprintf(out, "%*s", indent, "");
1418 fprintf(out, "ERROR: unused div coefficient not zero\n");
1423 static void dump_constraints(struct isl_basic_map *bmap,
1424 isl_int **c, unsigned n,
1425 const char *op, FILE *out, int indent)
1429 for (i = 0; i < n; ++i)
1430 dump_constraint(bmap, c[i], op, out, indent);
1433 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1437 unsigned total = isl_basic_map_total_dim(bmap);
1439 for (j = 0; j < 1 + total; ++j) {
1440 if (isl_int_is_zero(exp[j]))
1442 if (!first && isl_int_is_pos(exp[j]))
1444 dump_term(bmap, exp[j], j, out);
1449 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1453 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1454 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1456 for (i = 0; i < bmap->n_div; ++i) {
1457 fprintf(out, "%*s", indent, "");
1458 fprintf(out, "e%d = [(", i);
1459 dump_affine(bmap, bmap->div[i]+1, out);
1461 isl_int_print(out, bmap->div[i][0], 0);
1462 fprintf(out, "]\n");
1466 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1469 fprintf(out, "null basic set\n");
1473 fprintf(out, "%*s", indent, "");
1474 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1475 bset->ref, bset->dim->nparam, bset->dim->n_out,
1476 bset->extra, bset->flags);
1477 dump((struct isl_basic_map *)bset, out, indent);
1480 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1483 fprintf(out, "null basic map\n");
1487 fprintf(out, "%*s", indent, "");
1488 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1489 "flags: %x, n_name: %d\n",
1491 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1492 bmap->extra, bmap->flags, bmap->dim->n_name);
1493 dump(bmap, out, indent);
1496 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1501 total = isl_basic_map_total_dim(bmap);
1502 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1503 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1504 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1505 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1509 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1511 struct isl_set *set;
1515 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1516 isl_assert(dim->ctx, n >= 0, return NULL);
1517 set = isl_alloc(dim->ctx, struct isl_set,
1518 sizeof(struct isl_set) +
1519 (n - 1) * sizeof(struct isl_basic_set *));
1523 set->ctx = dim->ctx;
1524 isl_ctx_ref(set->ctx);
1536 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1537 unsigned nparam, unsigned dim, int n, unsigned flags)
1539 struct isl_set *set;
1540 struct isl_dim *dims;
1542 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1546 set = isl_set_alloc_dim(dims, n, flags);
1550 /* Make sure "map" has room for at least "n" more basic maps.
1552 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1555 struct isl_map *grown = NULL;
1559 isl_assert(map->ctx, n >= 0, goto error);
1560 if (map->n + n <= map->size)
1562 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1565 for (i = 0; i < map->n; ++i) {
1566 grown->p[i] = isl_basic_map_copy(map->p[i]);
1574 isl_map_free(grown);
1579 /* Make sure "set" has room for at least "n" more basic sets.
1581 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1583 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1586 struct isl_set *isl_set_dup(struct isl_set *set)
1589 struct isl_set *dup;
1594 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1597 for (i = 0; i < set->n; ++i)
1598 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1602 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1604 struct isl_set *set;
1609 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1611 isl_basic_set_free(bset);
1614 return isl_set_add_basic_set(set, bset);
1617 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1619 struct isl_map *map;
1624 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1626 isl_basic_map_free(bmap);
1629 return isl_map_add_basic_map(map, bmap);
1632 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1633 __isl_take isl_basic_set *bset)
1635 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1636 (struct isl_basic_map *)bset);
1639 void isl_set_free(struct isl_set *set)
1649 isl_ctx_deref(set->ctx);
1650 for (i = 0; i < set->n; ++i)
1651 isl_basic_set_free(set->p[i]);
1652 isl_dim_free(set->dim);
1656 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1661 fprintf(out, "null set\n");
1665 fprintf(out, "%*s", indent, "");
1666 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1667 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1669 for (i = 0; i < set->n; ++i) {
1670 fprintf(out, "%*s", indent, "");
1671 fprintf(out, "basic set %d:\n", i);
1672 isl_basic_set_dump(set->p[i], out, indent+4);
1676 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1681 fprintf(out, "null map\n");
1685 fprintf(out, "%*s", indent, "");
1686 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1687 "flags: %x, n_name: %d\n",
1688 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1689 map->dim->n_out, map->flags, map->dim->n_name);
1690 for (i = 0; i < map->n; ++i) {
1691 fprintf(out, "%*s", indent, "");
1692 fprintf(out, "basic map %d:\n", i);
1693 isl_basic_map_dump(map->p[i], out, indent+4);
1697 struct isl_basic_map *isl_basic_map_intersect_domain(
1698 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1700 struct isl_basic_map *bmap_domain;
1701 struct isl_dim *dim;
1706 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1707 bset->dim, isl_dim_param), goto error);
1709 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1710 isl_assert(bset->ctx,
1711 isl_basic_map_compatible_domain(bmap, bset), goto error);
1713 bmap = isl_basic_map_cow(bmap);
1714 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1715 bset->n_div, bset->n_eq, bset->n_ineq);
1718 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1719 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1720 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1722 bmap = isl_basic_map_simplify(bmap);
1723 return isl_basic_map_finalize(bmap);
1725 isl_basic_map_free(bmap);
1726 isl_basic_set_free(bset);
1730 struct isl_basic_map *isl_basic_map_intersect_range(
1731 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1733 struct isl_basic_map *bmap_range;
1738 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1739 bset->dim, isl_dim_param), goto error);
1741 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1742 isl_assert(bset->ctx,
1743 isl_basic_map_compatible_range(bmap, bset), goto error);
1745 bmap = isl_basic_map_cow(bmap);
1746 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1747 bset->n_div, bset->n_eq, bset->n_ineq);
1750 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1751 bmap = add_constraints(bmap, bmap_range, 0, 0);
1753 bmap = isl_basic_map_simplify(bmap);
1754 return isl_basic_map_finalize(bmap);
1756 isl_basic_map_free(bmap);
1757 isl_basic_set_free(bset);
1761 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1767 total = 1 + isl_basic_map_total_dim(bmap);
1768 if (total != vec->size)
1773 for (i = 0; i < bmap->n_eq; ++i) {
1774 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1775 if (!isl_int_is_zero(s)) {
1781 for (i = 0; i < bmap->n_ineq; ++i) {
1782 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1783 if (isl_int_is_neg(s)) {
1794 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1796 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1799 struct isl_basic_map *isl_basic_map_intersect(
1800 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1802 struct isl_vec *sample = NULL;
1804 if (!bmap1 || !bmap2)
1807 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1808 bmap2->dim, isl_dim_param), goto error);
1809 if (isl_dim_total(bmap1->dim) ==
1810 isl_dim_size(bmap1->dim, isl_dim_param) &&
1811 isl_dim_total(bmap2->dim) !=
1812 isl_dim_size(bmap2->dim, isl_dim_param))
1813 return isl_basic_map_intersect(bmap2, bmap1);
1815 if (isl_dim_total(bmap2->dim) !=
1816 isl_dim_size(bmap2->dim, isl_dim_param))
1817 isl_assert(bmap1->ctx,
1818 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1820 if (bmap1->sample &&
1821 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1822 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1823 sample = isl_vec_copy(bmap1->sample);
1824 else if (bmap2->sample &&
1825 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1826 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1827 sample = isl_vec_copy(bmap2->sample);
1829 bmap1 = isl_basic_map_cow(bmap1);
1830 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1831 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1834 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1837 isl_vec_free(bmap1->sample);
1838 bmap1->sample = sample;
1841 bmap1 = isl_basic_map_simplify(bmap1);
1842 return isl_basic_map_finalize(bmap1);
1845 isl_vec_free(sample);
1846 isl_basic_map_free(bmap1);
1847 isl_basic_map_free(bmap2);
1851 struct isl_basic_set *isl_basic_set_intersect(
1852 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1854 return (struct isl_basic_set *)
1855 isl_basic_map_intersect(
1856 (struct isl_basic_map *)bset1,
1857 (struct isl_basic_map *)bset2);
1860 /* Special case of isl_map_intersect, where both map1 and map2
1861 * are convex, without any divs and such that either map1 or map2
1862 * contains a single constraint. This constraint is then simply
1863 * added to the other map.
1865 static __isl_give isl_map *map_intersect_add_constraint(
1866 __isl_take isl_map *map1, __isl_take isl_map *map2)
1868 struct isl_basic_map *bmap1;
1869 struct isl_basic_map *bmap2;
1871 isl_assert(map1->ctx, map1->n == 1, goto error);
1872 isl_assert(map2->ctx, map1->n == 1, goto error);
1873 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1874 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1876 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1877 return isl_map_intersect(map2, map1);
1879 isl_assert(map2->ctx,
1880 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1882 map1 = isl_map_cow(map1);
1885 if (isl_map_fast_is_empty(map1)) {
1889 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1890 if (map2->p[0]->n_eq == 1)
1891 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1893 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1894 map2->p[0]->ineq[0]);
1896 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1897 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1901 if (isl_basic_map_fast_is_empty(map1->p[0])) {
1902 isl_basic_map_free(map1->p[0]);
1915 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1918 struct isl_map *result;
1924 if (isl_map_fast_is_empty(map1)) {
1928 if (isl_map_fast_is_empty(map2)) {
1933 if (map1->n == 1 && map2->n == 1 &&
1934 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1935 isl_dim_equal(map1->dim, map2->dim) &&
1936 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1937 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1938 return map_intersect_add_constraint(map1, map2);
1939 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1940 map2->dim, isl_dim_param), goto error);
1941 if (isl_dim_total(map1->dim) ==
1942 isl_dim_size(map1->dim, isl_dim_param) &&
1943 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1944 return isl_map_intersect(map2, map1);
1946 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1947 isl_assert(map1->ctx,
1948 isl_dim_equal(map1->dim, map2->dim), goto error);
1950 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1951 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1952 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1954 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1955 map1->n * map2->n, flags);
1958 for (i = 0; i < map1->n; ++i)
1959 for (j = 0; j < map2->n; ++j) {
1960 struct isl_basic_map *part;
1961 part = isl_basic_map_intersect(
1962 isl_basic_map_copy(map1->p[i]),
1963 isl_basic_map_copy(map2->p[j]));
1964 if (isl_basic_map_is_empty(part))
1965 isl_basic_map_free(part);
1967 result = isl_map_add_basic_map(result, part);
1980 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1982 return (struct isl_set *)
1983 isl_map_intersect((struct isl_map *)set1,
1984 (struct isl_map *)set2);
1987 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1989 struct isl_dim *dim;
1990 struct isl_basic_set *bset;
1995 bmap = isl_basic_map_cow(bmap);
1998 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1999 in = isl_basic_map_n_in(bmap);
2000 bset = isl_basic_set_from_basic_map(bmap);
2001 bset = isl_basic_set_swap_vars(bset, in);
2002 return isl_basic_map_from_basic_set(bset, dim);
2005 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2006 enum isl_dim_type type, unsigned pos, unsigned n)
2008 struct isl_dim *res_dim;
2009 struct isl_basic_map *res;
2010 struct isl_dim_map *dim_map;
2011 unsigned total, off;
2012 enum isl_dim_type t;
2020 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2022 total = isl_basic_map_total_dim(bmap) + n;
2023 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2025 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2027 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2029 unsigned size = isl_basic_map_dim(bmap, t);
2030 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2032 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2033 pos, size - pos, off + pos + n);
2035 off += isl_dim_size(res_dim, t);
2037 isl_dim_map_div(dim_map, bmap, off);
2039 res = isl_basic_map_alloc_dim(res_dim,
2040 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2041 res = add_constraints_dim_map(res, bmap, dim_map);
2042 res = isl_basic_map_simplify(res);
2043 return isl_basic_map_finalize(res);
2046 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2047 enum isl_dim_type type, unsigned n)
2051 return isl_basic_map_insert(bmap, type,
2052 isl_basic_map_dim(bmap, type), n);
2055 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2056 enum isl_dim_type type, unsigned n)
2060 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2061 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2063 isl_basic_set_free(bset);
2067 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2068 enum isl_dim_type type, unsigned pos, unsigned n)
2075 map = isl_map_cow(map);
2079 map->dim = isl_dim_insert(map->dim, type, pos, n);
2083 for (i = 0; i < map->n; ++i) {
2084 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2095 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2096 enum isl_dim_type type, unsigned n)
2100 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2103 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2104 enum isl_dim_type type, unsigned n)
2108 isl_assert(set->ctx, type != isl_dim_in, goto error);
2109 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2115 __isl_give isl_basic_map *isl_basic_map_move(__isl_take isl_basic_map *bmap,
2116 enum isl_dim_type dst_type, unsigned dst_pos,
2117 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2120 struct isl_dim_map *dim_map;
2121 struct isl_basic_map *res;
2122 enum isl_dim_type t;
2123 unsigned total, off;
2130 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2133 if (dst_type == src_type && dst_pos == src_pos)
2136 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2138 if (pos(bmap->dim, dst_type) + dst_pos ==
2139 pos(bmap->dim, src_type) + src_pos +
2140 ((src_type < dst_type) ? n : 0)) {
2141 bmap = isl_basic_map_cow(bmap);
2145 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2146 src_type, src_pos, n);
2153 total = isl_basic_map_total_dim(bmap);
2154 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2157 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2158 unsigned size = isl_dim_size(bmap->dim, t);
2159 if (t == dst_type) {
2160 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2163 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2166 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2167 dst_pos, size - dst_pos, off);
2168 off += size - dst_pos;
2169 } else if (t == src_type) {
2170 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2173 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2174 src_pos + n, size - src_pos - n, off);
2175 off += size - src_pos - n;
2177 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2181 isl_dim_map_div(dim_map, bmap, off + n);
2183 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2184 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2185 bmap = add_constraints_dim_map(res, bmap, dim_map);
2187 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2188 src_type, src_pos, n);
2194 isl_basic_map_free(bmap);
2198 __isl_give isl_set *isl_set_move(__isl_take isl_set *set,
2199 enum isl_dim_type dst_type, unsigned dst_pos,
2200 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2204 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2205 return (isl_set *)isl_map_move((isl_map *)set, dst_type, dst_pos,
2206 src_type, src_pos, n);
2212 __isl_give isl_map *isl_map_move(__isl_take isl_map *map,
2213 enum isl_dim_type dst_type, unsigned dst_pos,
2214 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2223 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2226 if (dst_type == src_type && dst_pos == src_pos)
2229 isl_assert(map->ctx, dst_type != src_type, goto error);
2231 map = isl_map_cow(map);
2235 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2239 for (i = 0; i < map->n; ++i) {
2240 map->p[i] = isl_basic_map_move(map->p[i], dst_type, dst_pos,
2241 src_type, src_pos, n);
2252 /* Move the specified dimensions to the last columns right before
2253 * the divs. Don't change the dimension specification of bmap.
2254 * That's the responsibility of the caller.
2256 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2257 enum isl_dim_type type, unsigned first, unsigned n)
2259 struct isl_dim_map *dim_map;
2260 struct isl_basic_map *res;
2261 enum isl_dim_type t;
2262 unsigned total, off;
2266 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2269 total = isl_basic_map_total_dim(bmap);
2270 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2273 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2274 unsigned size = isl_dim_size(bmap->dim, t);
2276 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2279 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2280 first, n, total - bmap->n_div - n);
2281 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2282 first + n, size - (first + n), off);
2283 off += size - (first + n);
2285 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2289 isl_dim_map_div(dim_map, bmap, off + n);
2291 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2292 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2293 res = add_constraints_dim_map(res, bmap, dim_map);
2297 /* Turn the n dimensions of type type, starting at first
2298 * into existentially quantified variables.
2300 __isl_give isl_basic_map *isl_basic_map_project_out(
2301 __isl_take isl_basic_map *bmap,
2302 enum isl_dim_type type, unsigned first, unsigned n)
2315 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2316 return isl_basic_map_remove(bmap, type, first, n);
2318 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2321 bmap = move_last(bmap, type, first, n);
2322 bmap = isl_basic_map_cow(bmap);
2324 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2325 old = bmap->block2.data;
2326 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2327 (bmap->extra + n) * (1 + row_size));
2328 if (!bmap->block2.data)
2330 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2333 for (i = 0; i < n; ++i) {
2334 new_div[i] = bmap->block2.data +
2335 (bmap->extra + i) * (1 + row_size);
2336 isl_seq_clr(new_div[i], 1 + row_size);
2338 for (i = 0; i < bmap->extra; ++i)
2339 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2341 bmap->div = new_div;
2345 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2348 bmap = isl_basic_map_simplify(bmap);
2349 bmap = isl_basic_map_drop_redundant_divs(bmap);
2350 return isl_basic_map_finalize(bmap);
2352 isl_basic_map_free(bmap);
2356 /* Turn the n dimensions of type type, starting at first
2357 * into existentially quantified variables.
2359 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2360 enum isl_dim_type type, unsigned first, unsigned n)
2362 return (isl_basic_set *)isl_basic_map_project_out(
2363 (isl_basic_map *)bset, type, first, n);
2366 /* Turn the n dimensions of type type, starting at first
2367 * into existentially quantified variables.
2369 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2370 enum isl_dim_type type, unsigned first, unsigned n)
2380 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2382 map = isl_map_cow(map);
2386 map->dim = isl_dim_drop(map->dim, type, first, n);
2390 for (i = 0; i < map->n; ++i) {
2391 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2402 /* Turn the n dimensions of type type, starting at first
2403 * into existentially quantified variables.
2405 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2406 enum isl_dim_type type, unsigned first, unsigned n)
2408 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2411 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2415 for (i = 0; i < n; ++i) {
2416 j = isl_basic_map_alloc_div(bmap);
2419 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2423 isl_basic_map_free(bmap);
2427 struct isl_basic_map *isl_basic_map_apply_range(
2428 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2430 struct isl_dim *dim_result = NULL;
2431 struct isl_basic_map *bmap;
2432 unsigned n_in, n_out, n, nparam, total, pos;
2433 struct isl_dim_map *dim_map1, *dim_map2;
2435 if (!bmap1 || !bmap2)
2438 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2439 isl_dim_copy(bmap2->dim));
2441 n_in = isl_basic_map_n_in(bmap1);
2442 n_out = isl_basic_map_n_out(bmap2);
2443 n = isl_basic_map_n_out(bmap1);
2444 nparam = isl_basic_map_n_param(bmap1);
2446 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2447 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2448 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2449 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2450 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2451 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2452 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2453 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2454 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2455 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2456 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2458 bmap = isl_basic_map_alloc_dim(dim_result,
2459 bmap1->n_div + bmap2->n_div + n,
2460 bmap1->n_eq + bmap2->n_eq,
2461 bmap1->n_ineq + bmap2->n_ineq);
2462 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2463 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2464 bmap = add_divs(bmap, n);
2465 bmap = isl_basic_map_simplify(bmap);
2466 bmap = isl_basic_map_drop_redundant_divs(bmap);
2467 return isl_basic_map_finalize(bmap);
2469 isl_basic_map_free(bmap1);
2470 isl_basic_map_free(bmap2);
2474 struct isl_basic_set *isl_basic_set_apply(
2475 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2480 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2483 return (struct isl_basic_set *)
2484 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2486 isl_basic_set_free(bset);
2487 isl_basic_map_free(bmap);
2491 struct isl_basic_map *isl_basic_map_apply_domain(
2492 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2494 if (!bmap1 || !bmap2)
2497 isl_assert(bmap1->ctx,
2498 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2499 isl_assert(bmap1->ctx,
2500 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2503 bmap1 = isl_basic_map_reverse(bmap1);
2504 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2505 return isl_basic_map_reverse(bmap1);
2507 isl_basic_map_free(bmap1);
2508 isl_basic_map_free(bmap2);
2512 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2513 * A \cap B -> f(A) + f(B)
2515 struct isl_basic_map *isl_basic_map_sum(
2516 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2518 unsigned n_in, n_out, nparam, total, pos;
2519 struct isl_basic_map *bmap = NULL;
2520 struct isl_dim_map *dim_map1, *dim_map2;
2523 if (!bmap1 || !bmap2)
2526 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2529 nparam = isl_basic_map_n_param(bmap1);
2530 n_in = isl_basic_map_n_in(bmap1);
2531 n_out = isl_basic_map_n_out(bmap1);
2533 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2534 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2535 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2536 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2537 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2538 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2539 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2540 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2541 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2542 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2543 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2545 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2546 bmap1->n_div + bmap2->n_div + 2 * n_out,
2547 bmap1->n_eq + bmap2->n_eq + n_out,
2548 bmap1->n_ineq + bmap2->n_ineq);
2549 for (i = 0; i < n_out; ++i) {
2550 int j = isl_basic_map_alloc_equality(bmap);
2553 isl_seq_clr(bmap->eq[j], 1+total);
2554 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2555 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2556 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2558 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2559 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2560 bmap = add_divs(bmap, 2 * n_out);
2562 bmap = isl_basic_map_simplify(bmap);
2563 return isl_basic_map_finalize(bmap);
2565 isl_basic_map_free(bmap);
2566 isl_basic_map_free(bmap1);
2567 isl_basic_map_free(bmap2);
2571 /* Given two maps A -> f(A) and B -> g(B), construct a map
2572 * A \cap B -> f(A) + f(B)
2574 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2576 struct isl_map *result;
2582 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2584 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2585 map1->n * map2->n, 0);
2588 for (i = 0; i < map1->n; ++i)
2589 for (j = 0; j < map2->n; ++j) {
2590 struct isl_basic_map *part;
2591 part = isl_basic_map_sum(
2592 isl_basic_map_copy(map1->p[i]),
2593 isl_basic_map_copy(map2->p[j]));
2594 if (isl_basic_map_is_empty(part))
2595 isl_basic_map_free(part);
2597 result = isl_map_add_basic_map(result, part);
2610 /* Given a basic map A -> f(A), construct A -> -f(A).
2612 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2617 bmap = isl_basic_map_cow(bmap);
2621 n = isl_basic_map_dim(bmap, isl_dim_out);
2622 off = isl_basic_map_offset(bmap, isl_dim_out);
2623 for (i = 0; i < bmap->n_eq; ++i)
2624 for (j = 0; j < n; ++j)
2625 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2626 for (i = 0; i < bmap->n_ineq; ++i)
2627 for (j = 0; j < n; ++j)
2628 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2629 for (i = 0; i < bmap->n_div; ++i)
2630 for (j = 0; j < n; ++j)
2631 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2632 return isl_basic_map_finalize(bmap);
2635 /* Given a map A -> f(A), construct A -> -f(A).
2637 struct isl_map *isl_map_neg(struct isl_map *map)
2641 map = isl_map_cow(map);
2645 for (i = 0; i < map->n; ++i) {
2646 map->p[i] = isl_basic_map_neg(map->p[i]);
2657 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2658 * A -> floor(f(A)/d).
2660 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2663 unsigned n_in, n_out, nparam, total, pos;
2664 struct isl_basic_map *result = NULL;
2665 struct isl_dim_map *dim_map;
2671 nparam = isl_basic_map_n_param(bmap);
2672 n_in = isl_basic_map_n_in(bmap);
2673 n_out = isl_basic_map_n_out(bmap);
2675 total = nparam + n_in + n_out + bmap->n_div + n_out;
2676 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2677 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2678 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2679 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2680 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2682 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2683 bmap->n_div + n_out,
2684 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2685 result = add_constraints_dim_map(result, bmap, dim_map);
2686 result = add_divs(result, n_out);
2687 for (i = 0; i < n_out; ++i) {
2689 j = isl_basic_map_alloc_inequality(result);
2692 isl_seq_clr(result->ineq[j], 1+total);
2693 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2694 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2695 j = isl_basic_map_alloc_inequality(result);
2698 isl_seq_clr(result->ineq[j], 1+total);
2699 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2700 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2701 isl_int_sub_ui(result->ineq[j][0], d, 1);
2704 result = isl_basic_map_simplify(result);
2705 return isl_basic_map_finalize(result);
2707 isl_basic_map_free(result);
2711 /* Given a map A -> f(A) and an integer d, construct a map
2712 * A -> floor(f(A)/d).
2714 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2718 map = isl_map_cow(map);
2722 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2723 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2724 for (i = 0; i < map->n; ++i) {
2725 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2736 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2742 i = isl_basic_map_alloc_equality(bmap);
2745 nparam = isl_basic_map_n_param(bmap);
2746 n_in = isl_basic_map_n_in(bmap);
2747 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2748 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2749 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2750 return isl_basic_map_finalize(bmap);
2752 isl_basic_map_free(bmap);
2756 /* Add a constraints to "bmap" expressing i_pos < o_pos
2758 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2764 i = isl_basic_map_alloc_inequality(bmap);
2767 nparam = isl_basic_map_n_param(bmap);
2768 n_in = isl_basic_map_n_in(bmap);
2769 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2770 isl_int_set_si(bmap->ineq[i][0], -1);
2771 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2772 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2773 return isl_basic_map_finalize(bmap);
2775 isl_basic_map_free(bmap);
2779 /* Add a constraints to "bmap" expressing i_pos > o_pos
2781 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2787 i = isl_basic_map_alloc_inequality(bmap);
2790 nparam = isl_basic_map_n_param(bmap);
2791 n_in = isl_basic_map_n_in(bmap);
2792 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2793 isl_int_set_si(bmap->ineq[i][0], -1);
2794 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2795 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2796 return isl_basic_map_finalize(bmap);
2798 isl_basic_map_free(bmap);
2802 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2805 struct isl_basic_map *bmap;
2806 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2809 for (i = 0; i < n_equal && bmap; ++i)
2810 bmap = var_equal(bmap, i);
2811 return isl_basic_map_finalize(bmap);
2814 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2816 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2819 struct isl_basic_map *bmap;
2820 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2823 for (i = 0; i < pos && bmap; ++i)
2824 bmap = var_equal(bmap, i);
2826 bmap = var_less(bmap, pos);
2827 return isl_basic_map_finalize(bmap);
2830 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2832 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2835 struct isl_basic_map *bmap;
2836 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2839 for (i = 0; i < pos && bmap; ++i)
2840 bmap = var_equal(bmap, i);
2842 bmap = var_more(bmap, pos);
2843 return isl_basic_map_finalize(bmap);
2846 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2848 struct isl_map *map;
2855 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2857 for (i = 0; i < dim; ++i)
2858 map = isl_map_add_basic_map(map,
2859 isl_basic_map_less_at(isl_dim_copy(dims), i));
2861 map = isl_map_add_basic_map(map,
2862 isl_basic_map_equal(isl_dim_copy(dims), dim));
2868 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2870 return map_lex_lte(isl_dim_map(set_dim), 0);
2873 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2875 return map_lex_lte(isl_dim_map(set_dim), 1);
2878 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2880 struct isl_map *map;
2887 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2889 for (i = 0; i < dim; ++i)
2890 map = isl_map_add_basic_map(map,
2891 isl_basic_map_more_at(isl_dim_copy(dims), i));
2893 map = isl_map_add_basic_map(map,
2894 isl_basic_map_equal(isl_dim_copy(dims), dim));
2900 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2902 return map_lex_gte(isl_dim_map(set_dim), 0);
2905 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2907 return map_lex_gte(isl_dim_map(set_dim), 1);
2910 struct isl_basic_map *isl_basic_map_from_basic_set(
2911 struct isl_basic_set *bset, struct isl_dim *dim)
2913 struct isl_basic_map *bmap;
2915 bset = isl_basic_set_cow(bset);
2919 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2920 isl_dim_free(bset->dim);
2921 bmap = (struct isl_basic_map *) bset;
2923 return isl_basic_map_finalize(bmap);
2925 isl_basic_set_free(bset);
2930 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2934 if (bmap->dim->n_in == 0)
2935 return (struct isl_basic_set *)bmap;
2936 bmap = isl_basic_map_cow(bmap);
2939 bmap->dim = isl_dim_cow(bmap->dim);
2942 bmap->dim->n_out += bmap->dim->n_in;
2943 bmap->dim->n_in = 0;
2944 bmap = isl_basic_map_finalize(bmap);
2945 return (struct isl_basic_set *)bmap;
2947 isl_basic_map_free(bmap);
2951 /* For a div d = floor(f/m), add the constraints
2954 * -(f-(n-1)) + m d >= 0
2956 * Note that the second constraint is the negation of
2960 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2963 unsigned total = isl_basic_map_total_dim(bmap);
2964 unsigned div_pos = 1 + total - bmap->n_div + div;
2966 i = isl_basic_map_alloc_inequality(bmap);
2969 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2970 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2972 j = isl_basic_map_alloc_inequality(bmap);
2975 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2976 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2977 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2981 struct isl_basic_set *isl_basic_map_underlying_set(
2982 struct isl_basic_map *bmap)
2986 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2987 return (struct isl_basic_set *)bmap;
2988 bmap = isl_basic_map_cow(bmap);
2991 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2994 bmap->extra -= bmap->n_div;
2996 bmap = isl_basic_map_finalize(bmap);
2997 return (struct isl_basic_set *)bmap;
3002 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3003 __isl_take isl_basic_set *bset)
3005 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3008 struct isl_basic_map *isl_basic_map_overlying_set(
3009 struct isl_basic_set *bset, struct isl_basic_map *like)
3011 struct isl_basic_map *bmap;
3012 struct isl_ctx *ctx;
3019 isl_assert(ctx, bset->n_div == 0, goto error);
3020 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3021 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3023 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3024 isl_basic_map_free(like);
3025 return (struct isl_basic_map *)bset;
3027 bset = isl_basic_set_cow(bset);
3030 total = bset->dim->n_out + bset->extra;
3031 bmap = (struct isl_basic_map *)bset;
3032 isl_dim_free(bmap->dim);
3033 bmap->dim = isl_dim_copy(like->dim);
3036 bmap->n_div = like->n_div;
3037 bmap->extra += like->n_div;
3040 ltotal = total - bmap->extra + like->extra;
3043 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3044 bmap->extra * (1 + 1 + total));
3045 if (isl_blk_is_error(bmap->block2))
3047 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3051 for (i = 0; i < bmap->extra; ++i)
3052 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3053 for (i = 0; i < like->n_div; ++i) {
3054 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3055 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3057 bmap = isl_basic_map_extend_constraints(bmap,
3058 0, 2 * like->n_div);
3059 for (i = 0; i < like->n_div; ++i) {
3060 if (isl_int_is_zero(bmap->div[i][0]))
3062 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3066 isl_basic_map_free(like);
3067 bmap = isl_basic_map_simplify(bmap);
3068 bmap = isl_basic_map_finalize(bmap);
3071 isl_basic_map_free(like);
3072 isl_basic_set_free(bset);
3076 struct isl_basic_set *isl_basic_set_from_underlying_set(
3077 struct isl_basic_set *bset, struct isl_basic_set *like)
3079 return (struct isl_basic_set *)
3080 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3083 struct isl_set *isl_set_from_underlying_set(
3084 struct isl_set *set, struct isl_basic_set *like)
3090 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3092 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3093 isl_basic_set_free(like);
3096 set = isl_set_cow(set);
3099 for (i = 0; i < set->n; ++i) {
3100 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3101 isl_basic_set_copy(like));
3105 isl_dim_free(set->dim);
3106 set->dim = isl_dim_copy(like->dim);
3109 isl_basic_set_free(like);
3112 isl_basic_set_free(like);
3117 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3121 map = isl_map_cow(map);
3124 map->dim = isl_dim_cow(map->dim);
3128 for (i = 1; i < map->n; ++i)
3129 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3131 for (i = 0; i < map->n; ++i) {
3132 map->p[i] = (struct isl_basic_map *)
3133 isl_basic_map_underlying_set(map->p[i]);
3138 map->dim = isl_dim_underlying(map->dim, 0);
3140 isl_dim_free(map->dim);
3141 map->dim = isl_dim_copy(map->p[0]->dim);
3145 return (struct isl_set *)map;
3151 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3153 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3156 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3158 struct isl_basic_set *domain;
3163 n_in = isl_basic_map_n_in(bmap);
3164 n_out = isl_basic_map_n_out(bmap);
3165 domain = isl_basic_set_from_basic_map(bmap);
3166 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3169 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3171 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3174 struct isl_set *isl_map_range(struct isl_map *map)
3177 struct isl_set *set;
3181 if (isl_map_dim(map, isl_dim_in) == 0)
3182 return (isl_set *)map;
3184 map = isl_map_cow(map);
3188 set = (struct isl_set *) map;
3189 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3192 for (i = 0; i < map->n; ++i) {
3193 set->p[i] = isl_basic_map_range(map->p[i]);
3197 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3198 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3205 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3208 struct isl_map *map = NULL;
3210 set = isl_set_cow(set);
3213 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3214 map = (struct isl_map *)set;
3215 for (i = 0; i < set->n; ++i) {
3216 map->p[i] = isl_basic_map_from_basic_set(
3217 set->p[i], isl_dim_copy(dim));
3221 isl_dim_free(map->dim);
3230 struct isl_map *isl_map_from_range(struct isl_set *set)
3232 return (struct isl_map *)set;
3235 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3237 return isl_map_reverse(isl_map_from_range(set));;
3240 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3241 __isl_take isl_set *range)
3243 return isl_map_product(isl_map_from_domain(domain),
3244 isl_map_from_range(range));
3247 struct isl_set *isl_set_from_map(struct isl_map *map)
3250 struct isl_set *set = NULL;
3254 map = isl_map_cow(map);
3257 map->dim = isl_dim_cow(map->dim);
3260 map->dim->n_out += map->dim->n_in;
3262 set = (struct isl_set *)map;
3263 for (i = 0; i < map->n; ++i) {
3264 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3274 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3276 struct isl_map *map;
3280 isl_assert(dim->ctx, n >= 0, return NULL);
3281 map = isl_alloc(dim->ctx, struct isl_map,
3282 sizeof(struct isl_map) +
3283 (n - 1) * sizeof(struct isl_basic_map *));
3287 map->ctx = dim->ctx;
3288 isl_ctx_ref(map->ctx);
3300 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3301 unsigned nparam, unsigned in, unsigned out, int n,
3304 struct isl_map *map;
3305 struct isl_dim *dims;
3307 dims = isl_dim_alloc(ctx, nparam, in, out);
3311 map = isl_map_alloc_dim(dims, n, flags);
3315 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3317 struct isl_basic_map *bmap;
3318 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3319 bmap = isl_basic_map_set_to_empty(bmap);
3323 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3325 struct isl_basic_set *bset;
3326 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3327 bset = isl_basic_set_set_to_empty(bset);
3331 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3333 struct isl_basic_map *bmap;
3336 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3337 bmap = isl_basic_map_set_to_empty(bmap);
3341 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3343 struct isl_basic_map *bmap;
3346 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3347 bmap = isl_basic_map_set_to_empty(bmap);
3351 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3353 struct isl_basic_set *bset;
3356 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3357 bset = isl_basic_set_set_to_empty(bset);
3361 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3363 struct isl_basic_map *bmap;
3364 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3368 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3370 struct isl_basic_set *bset;
3371 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3375 __isl_give isl_basic_map *isl_basic_map_universe_like(
3376 __isl_keep isl_basic_map *model)
3380 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3383 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3387 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3390 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3391 __isl_keep isl_set *model)
3395 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3398 struct isl_map *isl_map_empty(struct isl_dim *dim)
3400 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3403 struct isl_map *isl_map_empty_like(struct isl_map *model)
3407 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3410 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3414 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3417 struct isl_set *isl_set_empty(struct isl_dim *dim)
3419 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3422 struct isl_set *isl_set_empty_like(struct isl_set *model)
3426 return isl_set_empty(isl_dim_copy(model->dim));
3429 struct isl_map *isl_map_universe(struct isl_dim *dim)
3431 struct isl_map *map;
3434 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3435 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3439 struct isl_set *isl_set_universe(struct isl_dim *dim)
3441 struct isl_set *set;
3444 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3445 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3449 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3453 return isl_set_universe(isl_dim_copy(model->dim));
3456 struct isl_map *isl_map_dup(struct isl_map *map)
3459 struct isl_map *dup;
3463 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3464 for (i = 0; i < map->n; ++i)
3465 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3469 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3470 __isl_take isl_basic_map *bmap)
3474 if (isl_basic_map_fast_is_empty(bmap)) {
3475 isl_basic_map_free(bmap);
3478 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3479 isl_assert(map->ctx, map->n < map->size, goto error);
3480 map->p[map->n] = bmap;
3482 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3488 isl_basic_map_free(bmap);
3492 void isl_map_free(struct isl_map *map)
3502 isl_ctx_deref(map->ctx);
3503 for (i = 0; i < map->n; ++i)
3504 isl_basic_map_free(map->p[i]);
3505 isl_dim_free(map->dim);
3509 struct isl_map *isl_map_extend(struct isl_map *base,
3510 unsigned nparam, unsigned n_in, unsigned n_out)
3514 base = isl_map_cow(base);
3518 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3521 for (i = 0; i < base->n; ++i) {
3522 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3523 isl_dim_copy(base->dim), 0, 0, 0);
3533 struct isl_set *isl_set_extend(struct isl_set *base,
3534 unsigned nparam, unsigned dim)
3536 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3540 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3541 struct isl_basic_map *bmap, unsigned pos, int value)
3545 bmap = isl_basic_map_cow(bmap);
3546 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3547 j = isl_basic_map_alloc_equality(bmap);
3550 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3551 isl_int_set_si(bmap->eq[j][pos], -1);
3552 isl_int_set_si(bmap->eq[j][0], value);
3553 bmap = isl_basic_map_simplify(bmap);
3554 return isl_basic_map_finalize(bmap);
3556 isl_basic_map_free(bmap);
3560 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3561 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3565 bmap = isl_basic_map_cow(bmap);
3566 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3567 j = isl_basic_map_alloc_equality(bmap);
3570 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3571 isl_int_set_si(bmap->eq[j][pos], -1);
3572 isl_int_set(bmap->eq[j][0], value);
3573 bmap = isl_basic_map_simplify(bmap);
3574 return isl_basic_map_finalize(bmap);
3576 isl_basic_map_free(bmap);
3580 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3581 enum isl_dim_type type, unsigned pos, int value)
3585 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3586 return isl_basic_map_fix_pos_si(bmap,
3587 isl_basic_map_offset(bmap, type) + pos, value);
3589 isl_basic_map_free(bmap);
3593 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3594 enum isl_dim_type type, unsigned pos, isl_int value)
3598 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3599 return isl_basic_map_fix_pos(bmap,
3600 isl_basic_map_offset(bmap, type) + pos, value);
3602 isl_basic_map_free(bmap);
3606 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3607 enum isl_dim_type type, unsigned pos, int value)
3609 return (struct isl_basic_set *)
3610 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3614 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3615 enum isl_dim_type type, unsigned pos, isl_int value)
3617 return (struct isl_basic_set *)
3618 isl_basic_map_fix((struct isl_basic_map *)bset,
3622 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3623 unsigned input, int value)
3625 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3628 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3629 unsigned dim, int value)
3631 return (struct isl_basic_set *)
3632 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3633 isl_dim_set, dim, value);
3636 struct isl_map *isl_map_fix_si(struct isl_map *map,
3637 enum isl_dim_type type, unsigned pos, int value)
3641 map = isl_map_cow(map);
3645 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3646 for (i = 0; i < map->n; ++i) {
3647 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3651 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3658 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3659 enum isl_dim_type type, unsigned pos, int value)
3661 return (struct isl_set *)
3662 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3665 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3666 enum isl_dim_type type, unsigned pos, isl_int value)
3670 map = isl_map_cow(map);
3674 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3675 for (i = 0; i < map->n; ++i) {
3676 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3680 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3687 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3688 enum isl_dim_type type, unsigned pos, isl_int value)
3690 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3693 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3694 unsigned input, int value)
3696 return isl_map_fix_si(map, isl_dim_in, input, value);
3699 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3701 return (struct isl_set *)
3702 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3705 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3706 __isl_take isl_basic_map *bmap,
3707 enum isl_dim_type type, unsigned pos, int value)
3713 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3714 pos += isl_basic_map_offset(bmap, type);
3715 bmap = isl_basic_map_cow(bmap);
3716 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3717 j = isl_basic_map_alloc_inequality(bmap);
3720 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3721 isl_int_set_si(bmap->ineq[j][pos], 1);
3722 isl_int_set_si(bmap->ineq[j][0], -value);
3723 bmap = isl_basic_map_simplify(bmap);
3724 return isl_basic_map_finalize(bmap);
3726 isl_basic_map_free(bmap);
3730 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3731 unsigned dim, isl_int value)
3735 bset = isl_basic_set_cow(bset);
3736 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3737 j = isl_basic_set_alloc_inequality(bset);
3740 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3741 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3742 isl_int_neg(bset->ineq[j][0], value);
3743 bset = isl_basic_set_simplify(bset);
3744 return isl_basic_set_finalize(bset);
3746 isl_basic_set_free(bset);
3750 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3751 enum isl_dim_type type, unsigned pos, int value)
3755 map = isl_map_cow(map);
3759 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3760 for (i = 0; i < map->n; ++i) {
3761 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3766 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3773 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3774 enum isl_dim_type type, unsigned pos, int value)
3776 return (struct isl_set *)
3777 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3780 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3785 set = isl_set_cow(set);
3789 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3790 for (i = 0; i < set->n; ++i) {
3791 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3801 struct isl_map *isl_map_reverse(struct isl_map *map)
3805 map = isl_map_cow(map);
3809 map->dim = isl_dim_reverse(map->dim);
3812 for (i = 0; i < map->n; ++i) {
3813 map->p[i] = isl_basic_map_reverse(map->p[i]);
3817 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3824 static struct isl_map *isl_basic_map_partial_lexopt(
3825 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3826 struct isl_set **empty, int max)
3830 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3831 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3833 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3835 isl_basic_map_free(bmap);
3836 isl_basic_set_free(dom);
3842 struct isl_map *isl_basic_map_partial_lexmax(
3843 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3844 struct isl_set **empty)
3846 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3849 struct isl_map *isl_basic_map_partial_lexmin(
3850 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3851 struct isl_set **empty)
3853 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3856 struct isl_set *isl_basic_set_partial_lexmin(
3857 struct isl_basic_set *bset, struct isl_basic_set *dom,
3858 struct isl_set **empty)
3860 return (struct isl_set *)
3861 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3865 struct isl_set *isl_basic_set_partial_lexmax(
3866 struct isl_basic_set *bset, struct isl_basic_set *dom,
3867 struct isl_set **empty)
3869 return (struct isl_set *)
3870 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3874 /* Given a basic map "bmap", compute the lexicograhically minimal
3875 * (or maximal) image element for each domain element in dom.
3876 * Set *empty to those elements in dom that do not have an image element.
3878 * We first make sure the basic sets in dom are disjoint and then
3879 * simply collect the results over each of the basic sets separately.
3880 * We could probably improve the efficiency a bit by moving the union
3881 * domain down into the parametric integer programming.
3883 static __isl_give isl_map *basic_map_partial_lexopt(
3884 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3885 __isl_give isl_set **empty, int max)
3888 struct isl_map *res;
3890 dom = isl_set_make_disjoint(dom);
3894 if (isl_set_fast_is_empty(dom)) {
3895 res = isl_map_empty_like_basic_map(bmap);
3896 *empty = isl_set_empty_like(dom);
3898 isl_basic_map_free(bmap);
3902 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3903 isl_basic_set_copy(dom->p[0]), empty, max);
3905 for (i = 1; i < dom->n; ++i) {
3906 struct isl_map *res_i;
3907 struct isl_set *empty_i;
3909 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3910 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3912 res = isl_map_union_disjoint(res, res_i);
3913 *empty = isl_set_union_disjoint(*empty, empty_i);
3917 isl_basic_map_free(bmap);
3922 isl_basic_map_free(bmap);
3926 /* Given a map "map", compute the lexicograhically minimal
3927 * (or maximal) image element for each domain element in dom.
3928 * Set *empty to those elements in dom that do not have an image element.
3930 * We first compute the lexicographically minimal or maximal element
3931 * in the first basic map. This results in a partial solution "res"
3932 * and a subset "todo" of dom that still need to be handled.
3933 * We then consider each of the remaining maps in "map" and successively
3934 * improve both "res" and "todo".
3936 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3937 * Assume we are computing the lexicographical maximum.
3938 * We first intersect basic map i with a relation that maps elements
3939 * to elements that are lexicographically larger than the image elements
3940 * in res^k and the compute the maximum image element of this intersection.
3941 * The result ("better") corresponds to those image elements in basic map i
3942 * that are better than what we had before. The remainder ("keep") are the
3943 * domain elements for which the image element in res_k was better.
3944 * We also compute the lexicographical maximum of basic map i in todo^k.
3945 * res^i is the result of the operation + better + those elements in
3946 * res^k that we should keep
3947 * todo^i is the remainder of the maximum operation on todo^k.
3949 static __isl_give isl_map *isl_map_partial_lexopt(
3950 __isl_take isl_map *map, __isl_take isl_set *dom,
3951 __isl_give isl_set **empty, int max)
3954 struct isl_map *res;
3955 struct isl_set *todo;
3960 if (isl_map_fast_is_empty(map)) {
3968 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3969 isl_set_copy(dom), &todo, max);
3971 for (i = 1; i < map->n; ++i) {
3973 struct isl_map *better;
3974 struct isl_set *keep;
3975 struct isl_map *res_i;
3976 struct isl_set *todo_i;
3977 struct isl_dim *dim = isl_map_get_dim(res);
3979 dim = isl_dim_range(dim);
3981 lt = isl_map_lex_lt(dim);
3983 lt = isl_map_lex_gt(dim);
3984 lt = isl_map_apply_range(isl_map_copy(res), lt);
3985 lt = isl_map_intersect(lt,
3986 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3987 better = isl_map_partial_lexopt(lt,
3988 isl_map_domain(isl_map_copy(res)),
3991 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3992 todo, &todo_i, max);
3994 res = isl_map_intersect_domain(res, keep);
3995 res = isl_map_union_disjoint(res, res_i);
3996 res = isl_map_union_disjoint(res, better);
4017 __isl_give isl_map *isl_map_partial_lexmax(
4018 __isl_take isl_map *map, __isl_take isl_set *dom,
4019 __isl_give isl_set **empty)
4021 return isl_map_partial_lexopt(map, dom, empty, 1);
4024 __isl_give isl_map *isl_map_partial_lexmin(
4025 __isl_take isl_map *map, __isl_take isl_set *dom,
4026 __isl_give isl_set **empty)
4028 return isl_map_partial_lexopt(map, dom, empty, 0);
4031 __isl_give isl_set *isl_set_partial_lexmin(
4032 __isl_take isl_set *set, __isl_take isl_set *dom,
4033 __isl_give isl_set **empty)
4035 return (struct isl_set *)
4036 isl_map_partial_lexmin((struct isl_map *)set,
4040 __isl_give isl_set *isl_set_partial_lexmax(
4041 __isl_take isl_set *set, __isl_take isl_set *dom,
4042 __isl_give isl_set **empty)
4044 return (struct isl_set *)
4045 isl_map_partial_lexmax((struct isl_map *)set,
4049 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4051 struct isl_basic_set *dom = NULL;
4052 struct isl_dim *dom_dim;
4056 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4057 dom = isl_basic_set_universe(dom_dim);
4058 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4060 isl_basic_map_free(bmap);
4064 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4066 return isl_basic_map_lexopt(bmap, 0);
4069 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4071 return isl_basic_map_lexopt(bmap, 1);
4074 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4076 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4079 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4081 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4084 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4086 struct isl_set *dom = NULL;
4087 struct isl_dim *dom_dim;
4091 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4092 dom = isl_set_universe(dom_dim);
4093 return isl_map_partial_lexopt(map, dom, NULL, max);
4099 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4101 return isl_map_lexopt(map, 0);
4104 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4106 return isl_map_lexopt(map, 1);
4109 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4111 return (isl_set *)isl_map_lexmin((isl_map *)set);
4114 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4116 return (isl_set *)isl_map_lexmax((isl_map *)set);
4119 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4120 struct isl_dim *dim)
4127 for (i = 0; i < map->n; ++i) {
4128 isl_dim_free(map->p[i]->dim);
4129 map->p[i]->dim = isl_dim_copy(dim);
4131 isl_dim_free(map->dim);
4141 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4142 struct isl_dim *dim)
4144 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4147 /* Apply a preimage specified by "mat" on the parameters of "bset".
4148 * bset is assumed to have only parameters and divs.
4150 static struct isl_basic_set *basic_set_parameter_preimage(
4151 struct isl_basic_set *bset, struct isl_mat *mat)
4158 bset->dim = isl_dim_cow(bset->dim);
4162 nparam = isl_basic_set_dim(bset, isl_dim_param);
4164 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4166 bset->dim->nparam = 0;
4167 bset->dim->n_out = nparam;
4168 bset = isl_basic_set_preimage(bset, mat);
4170 bset->dim->nparam = bset->dim->n_out;
4171 bset->dim->n_out = 0;
4176 isl_basic_set_free(bset);
4180 /* Apply a preimage specified by "mat" on the parameters of "set".
4181 * set is assumed to have only parameters and divs.
4183 static struct isl_set *set_parameter_preimage(
4184 struct isl_set *set, struct isl_mat *mat)
4186 struct isl_dim *dim = NULL;
4192 dim = isl_dim_copy(set->dim);
4193 dim = isl_dim_cow(dim);
4197 nparam = isl_set_dim(set, isl_dim_param);
4199 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4202 dim->n_out = nparam;
4203 isl_set_reset_dim(set, dim);
4204 set = isl_set_preimage(set, mat);
4207 dim = isl_dim_copy(set->dim);
4208 dim = isl_dim_cow(dim);
4211 dim->nparam = dim->n_out;
4213 isl_set_reset_dim(set, dim);
4223 /* Intersect the basic set "bset" with the affine space specified by the
4224 * equalities in "eq".
4226 static struct isl_basic_set *basic_set_append_equalities(
4227 struct isl_basic_set *bset, struct isl_mat *eq)
4235 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4240 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4241 for (i = 0; i < eq->n_row; ++i) {
4242 k = isl_basic_set_alloc_equality(bset);
4245 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4246 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4253 isl_basic_set_free(bset);
4257 /* Intersect the set "set" with the affine space specified by the
4258 * equalities in "eq".
4260 static struct isl_set *set_append_equalities(struct isl_set *set,
4268 for (i = 0; i < set->n; ++i) {
4269 set->p[i] = basic_set_append_equalities(set->p[i],
4282 /* Project the given basic set onto its parameter domain, possibly introducing
4283 * new, explicit, existential variables in the constraints.
4284 * The input has parameters and (possibly implicit) existential variables.
4285 * The output has the same parameters, but only
4286 * explicit existentially quantified variables.
4288 * The actual projection is performed by pip, but pip doesn't seem
4289 * to like equalities very much, so we first remove the equalities
4290 * among the parameters by performing a variable compression on
4291 * the parameters. Afterward, an inverse transformation is performed
4292 * and the equalities among the parameters are inserted back in.
4294 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4298 struct isl_mat *T, *T2;
4299 struct isl_set *set;
4300 unsigned nparam, n_div;
4302 bset = isl_basic_set_cow(bset);
4306 if (bset->n_eq == 0)
4307 return isl_basic_set_lexmin(bset);
4309 isl_basic_set_gauss(bset, NULL);
4311 nparam = isl_basic_set_dim(bset, isl_dim_param);
4312 n_div = isl_basic_set_dim(bset, isl_dim_div);
4314 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4315 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4318 if (i == bset->n_eq)
4319 return isl_basic_set_lexmin(bset);
4321 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4323 eq = isl_mat_cow(eq);
4324 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4325 bset = basic_set_parameter_preimage(bset, T);
4327 set = isl_basic_set_lexmin(bset);
4328 set = set_parameter_preimage(set, T2);
4329 set = set_append_equalities(set, eq);
4333 /* Compute an explicit representation for all the existentially
4334 * quantified variables.
4335 * The input and output dimensions are first turned into parameters.
4336 * compute_divs then returns a map with the same parameters and
4337 * no input or output dimensions and the dimension specification
4338 * is reset to that of the input.
4340 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4342 struct isl_basic_set *bset;
4343 struct isl_set *set;
4344 struct isl_map *map;
4345 struct isl_dim *dim, *orig_dim = NULL;
4350 bmap = isl_basic_map_cow(bmap);
4354 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4355 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4356 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4357 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4361 orig_dim = bmap->dim;
4363 bset = (struct isl_basic_set *)bmap;
4365 set = parameter_compute_divs(bset);
4366 map = (struct isl_map *)set;
4367 map = isl_map_reset_dim(map, orig_dim);
4371 isl_basic_map_free(bmap);
4375 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4383 off = isl_dim_total(bmap->dim);
4384 for (i = 0; i < bmap->n_div; ++i) {
4385 if (isl_int_is_zero(bmap->div[i][0]))
4387 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4393 static int map_divs_known(__isl_keep isl_map *map)
4400 for (i = 0; i < map->n; ++i) {
4401 int known = basic_map_divs_known(map->p[i]);
4409 /* If bmap contains any unknown divs, then compute explicit
4410 * expressions for them. However, this computation may be
4411 * quite expensive, so first try to remove divs that aren't
4414 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4418 struct isl_map *map;
4420 known = basic_map_divs_known(bmap);
4424 return isl_map_from_basic_map(bmap);
4426 bmap = isl_basic_map_drop_redundant_divs(bmap);
4428 known = basic_map_divs_known(bmap);
4432 return isl_map_from_basic_map(bmap);
4434 map = compute_divs(bmap);
4437 isl_basic_map_free(bmap);
4441 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4445 struct isl_map *res;
4452 known = map_divs_known(map);
4460 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4461 for (i = 1 ; i < map->n; ++i) {
4463 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4464 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4465 res = isl_map_union_disjoint(res, r2);
4467 res = isl_map_union(res, r2);
4474 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4476 return (struct isl_set *)
4477 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4480 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4482 return (struct isl_set *)
4483 isl_map_compute_divs((struct isl_map *)set);
4486 struct isl_set *isl_map_domain(struct isl_map *map)
4489 struct isl_set *set;
4494 map = isl_map_cow(map);
4498 set = (struct isl_set *)map;
4499 set->dim = isl_dim_domain(set->dim);
4502 for (i = 0; i < map->n; ++i) {
4503 set->p[i] = isl_basic_map_domain(map->p[i]);
4507 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4508 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4515 struct isl_map *isl_map_union_disjoint(
4516 struct isl_map *map1, struct isl_map *map2)
4520 struct isl_map *map = NULL;
4534 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4536 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4537 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4538 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4540 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4541 map1->n + map2->n, flags);
4544 for (i = 0; i < map1->n; ++i) {
4545 map = isl_map_add_basic_map(map,
4546 isl_basic_map_copy(map1->p[i]));
4550 for (i = 0; i < map2->n; ++i) {
4551 map = isl_map_add_basic_map(map,
4552 isl_basic_map_copy(map2->p[i]));
4566 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4568 map1 = isl_map_union_disjoint(map1, map2);
4572 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4576 struct isl_set *isl_set_union_disjoint(
4577 struct isl_set *set1, struct isl_set *set2)
4579 return (struct isl_set *)
4580 isl_map_union_disjoint(
4581 (struct isl_map *)set1, (struct isl_map *)set2);
4584 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4586 return (struct isl_set *)
4587 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4590 struct isl_map *isl_map_intersect_range(
4591 struct isl_map *map, struct isl_set *set)
4594 struct isl_map *result;
4600 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4601 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4602 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4604 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4605 map->n * set->n, flags);
4608 for (i = 0; i < map->n; ++i)
4609 for (j = 0; j < set->n; ++j) {
4610 result = isl_map_add_basic_map(result,
4611 isl_basic_map_intersect_range(
4612 isl_basic_map_copy(map->p[i]),
4613 isl_basic_set_copy(set->p[j])));
4626 struct isl_map *isl_map_intersect_domain(
4627 struct isl_map *map, struct isl_set *set)
4629 return isl_map_reverse(
4630 isl_map_intersect_range(isl_map_reverse(map), set));
4633 struct isl_map *isl_map_apply_domain(
4634 struct isl_map *map1, struct isl_map *map2)
4638 map1 = isl_map_reverse(map1);
4639 map1 = isl_map_apply_range(map1, map2);
4640 return isl_map_reverse(map1);
4647 struct isl_map *isl_map_apply_range(
4648 struct isl_map *map1, struct isl_map *map2)
4650 struct isl_dim *dim_result;
4651 struct isl_map *result;
4657 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4658 isl_dim_copy(map2->dim));
4660 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4663 for (i = 0; i < map1->n; ++i)
4664 for (j = 0; j < map2->n; ++j) {
4665 result = isl_map_add_basic_map(result,
4666 isl_basic_map_apply_range(
4667 isl_basic_map_copy(map1->p[i]),
4668 isl_basic_map_copy(map2->p[j])));
4674 if (result && result->n <= 1)
4675 ISL_F_SET(result, ISL_MAP_DISJOINT);
4684 * returns range - domain
4686 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4689 struct isl_basic_set *bset;
4696 dim = isl_basic_map_n_in(bmap);
4697 nparam = isl_basic_map_n_param(bmap);
4698 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4699 bset = isl_basic_set_from_basic_map(bmap);
4700 bset = isl_basic_set_cow(bset);
4701 dims = isl_basic_set_get_dim(bset);
4702 dims = isl_dim_add(dims, isl_dim_set, dim);
4703 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
4704 bset = isl_basic_set_swap_vars(bset, 2*dim);
4705 for (i = 0; i < dim; ++i) {
4706 int j = isl_basic_map_alloc_equality(
4707 (struct isl_basic_map *)bset);
4710 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4711 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4712 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4713 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4715 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4717 isl_basic_map_free(bmap);
4722 * returns range - domain
4724 struct isl_set *isl_map_deltas(struct isl_map *map)
4728 struct isl_set *result;
4733 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4734 dim = isl_map_get_dim(map);
4735 dim = isl_dim_domain(dim);
4736 result = isl_set_alloc_dim(dim, map->n, map->flags);
4739 for (i = 0; i < map->n; ++i)
4740 result = isl_set_add_basic_set(result,
4741 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4749 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4751 struct isl_basic_map *bmap;
4759 nparam = dims->nparam;
4761 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4765 for (i = 0; i < dim; ++i) {
4766 int j = isl_basic_map_alloc_equality(bmap);
4769 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4770 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4771 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4773 return isl_basic_map_finalize(bmap);
4775 isl_basic_map_free(bmap);
4779 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4781 struct isl_dim *dim = isl_dim_map(set_dim);
4784 return basic_map_identity(dim);
4787 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4789 if (!model || !model->dim)
4791 isl_assert(model->ctx,
4792 model->dim->n_in == model->dim->n_out, return NULL);
4793 return basic_map_identity(isl_dim_copy(model->dim));
4796 static struct isl_map *map_identity(struct isl_dim *dim)
4798 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4799 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4802 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4804 struct isl_dim *dim = isl_dim_map(set_dim);
4807 return map_identity(dim);
4810 struct isl_map *isl_map_identity_like(struct isl_map *model)
4812 if (!model || !model->dim)
4814 isl_assert(model->ctx,
4815 model->dim->n_in == model->dim->n_out, return NULL);
4816 return map_identity(isl_dim_copy(model->dim));
4819 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4821 if (!model || !model->dim)
4823 isl_assert(model->ctx,
4824 model->dim->n_in == model->dim->n_out, return NULL);
4825 return map_identity(isl_dim_copy(model->dim));
4828 /* Construct a basic set with all set dimensions having only non-negative
4831 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4836 struct isl_basic_set *bset;
4840 nparam = dims->nparam;
4842 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4845 for (i = 0; i < dim; ++i) {
4846 int k = isl_basic_set_alloc_inequality(bset);
4849 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4850 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4854 isl_basic_set_free(bset);
4858 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
4859 enum isl_dim_type type, unsigned first, unsigned n)
4862 isl_basic_set *nonneg = NULL;
4863 isl_basic_set *neg = NULL;
4870 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
4872 for (i = 0; i < n; ++i) {
4876 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
4877 k = isl_basic_set_alloc_inequality(nonneg);
4880 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
4881 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
4883 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
4884 k = isl_basic_set_alloc_inequality(neg);
4887 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
4888 isl_int_set_si(neg->ineq[k][0], -1);
4889 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
4891 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
4896 isl_basic_set_free(nonneg);
4897 isl_basic_set_free(neg);
4902 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4904 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4907 int isl_basic_map_is_subset(
4908 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4911 struct isl_map *map1;
4912 struct isl_map *map2;
4914 if (!bmap1 || !bmap2)
4917 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4918 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4920 is_subset = isl_map_is_subset(map1, map2);
4928 int isl_basic_map_is_equal(
4929 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4933 if (!bmap1 || !bmap2)
4935 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4938 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4942 int isl_basic_set_is_equal(
4943 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4945 return isl_basic_map_is_equal(
4946 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4949 int isl_map_is_empty(struct isl_map *map)
4956 for (i = 0; i < map->n; ++i) {
4957 is_empty = isl_basic_map_is_empty(map->p[i]);
4966 int isl_map_fast_is_empty(struct isl_map *map)
4971 int isl_set_fast_is_empty(struct isl_set *set)
4976 int isl_set_is_empty(struct isl_set *set)
4978 return isl_map_is_empty((struct isl_map *)set);
4981 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4987 is_subset = isl_map_is_subset(map1, map2);
4990 is_subset = isl_map_is_subset(map2, map1);
4994 int isl_basic_map_is_strict_subset(
4995 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4999 if (!bmap1 || !bmap2)
5001 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5004 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5005 if (is_subset == -1)
5010 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5016 is_subset = isl_map_is_subset(map1, map2);
5019 is_subset = isl_map_is_subset(map2, map1);
5020 if (is_subset == -1)
5025 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5027 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5030 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5034 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5037 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5041 return bset->n_eq == 0 && bset->n_ineq == 0;
5044 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5049 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
5052 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5054 return isl_map_fast_is_universe((isl_map *) set);
5057 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5059 struct isl_basic_set *bset = NULL;
5060 struct isl_vec *sample = NULL;
5067 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5070 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5071 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5072 copy = isl_basic_map_convex_hull(copy);
5073 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5074 isl_basic_map_free(copy);
5078 total = 1 + isl_basic_map_total_dim(bmap);
5079 if (bmap->sample && bmap->sample->size == total) {
5080 int contains = isl_basic_map_contains(bmap, bmap->sample);
5086 isl_vec_free(bmap->sample);
5087 bmap->sample = NULL;
5088 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5091 sample = isl_basic_set_sample_vec(bset);
5094 empty = sample->size == 0;
5095 isl_vec_free(bmap->sample);
5096 bmap->sample = sample;
5098 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5103 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5107 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5110 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5114 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5117 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5119 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5122 struct isl_map *isl_basic_map_union(
5123 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5125 struct isl_map *map;
5126 if (!bmap1 || !bmap2)
5129 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5131 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5134 map = isl_map_add_basic_map(map, bmap1);
5135 map = isl_map_add_basic_map(map, bmap2);
5138 isl_basic_map_free(bmap1);
5139 isl_basic_map_free(bmap2);
5143 struct isl_set *isl_basic_set_union(
5144 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5146 return (struct isl_set *)isl_basic_map_union(
5147 (struct isl_basic_map *)bset1,
5148 (struct isl_basic_map *)bset2);
5151 /* Order divs such that any div only depends on previous divs */
5152 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5155 unsigned off = isl_dim_total(bmap->dim);
5157 for (i = 0; i < bmap->n_div; ++i) {
5159 if (isl_int_is_zero(bmap->div[i][0]))
5161 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5165 isl_basic_map_swap_div(bmap, i, i + pos);
5171 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5173 return (struct isl_basic_set *)
5174 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5177 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5184 for (i = 0; i < map->n; ++i) {
5185 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5196 /* Look for a div in dst that corresponds to the div "div" in src.
5197 * The divs before "div" in src and dst are assumed to be the same.
5199 * Returns -1 if no corresponding div was found and the position
5200 * of the corresponding div in dst otherwise.
5202 static int find_div(struct isl_basic_map *dst,
5203 struct isl_basic_map *src, unsigned div)
5207 unsigned total = isl_dim_total(src->dim);
5209 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5210 for (i = div; i < dst->n_div; ++i)
5211 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5212 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5213 dst->n_div - div) == -1)
5218 struct isl_basic_map *isl_basic_map_align_divs(
5219 struct isl_basic_map *dst, struct isl_basic_map *src)
5222 unsigned total = isl_dim_total(src->dim);
5227 if (src->n_div == 0)
5230 for (i = 0; i < src->n_div; ++i)
5231 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5233 src = isl_basic_map_order_divs(src);
5234 dst = isl_basic_map_cow(dst);
5235 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5236 src->n_div, 0, 2 * src->n_div);
5239 for (i = 0; i < src->n_div; ++i) {
5240 int j = find_div(dst, src, i);
5242 j = isl_basic_map_alloc_div(dst);
5245 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5246 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5247 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5251 isl_basic_map_swap_div(dst, i, j);
5255 isl_basic_map_free(dst);
5259 struct isl_basic_set *isl_basic_set_align_divs(
5260 struct isl_basic_set *dst, struct isl_basic_set *src)
5262 return (struct isl_basic_set *)isl_basic_map_align_divs(
5263 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5266 struct isl_map *isl_map_align_divs(struct isl_map *map)
5274 map = isl_map_compute_divs(map);
5275 map = isl_map_cow(map);
5279 for (i = 1; i < map->n; ++i)
5280 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5281 for (i = 1; i < map->n; ++i)
5282 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5284 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5288 struct isl_set *isl_set_align_divs(struct isl_set *set)
5290 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5293 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5297 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5298 map = isl_map_intersect_domain(map, set);
5299 set = isl_map_range(map);
5307 /* There is no need to cow as removing empty parts doesn't change
5308 * the meaning of the set.
5310 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5317 for (i = map->n-1; i >= 0; --i) {
5318 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5320 isl_basic_map_free(map->p[i]);
5321 if (i != map->n-1) {
5322 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5323 map->p[i] = map->p[map->n-1];
5331 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5333 return (struct isl_set *)
5334 isl_map_remove_empty_parts((struct isl_map *)set);
5337 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5339 struct isl_basic_map *bmap;
5340 if (!map || map->n == 0)
5342 bmap = map->p[map->n-1];
5343 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5344 return isl_basic_map_copy(bmap);
5347 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5349 return (struct isl_basic_set *)
5350 isl_map_copy_basic_map((struct isl_map *)set);
5353 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5354 __isl_keep isl_basic_map *bmap)
5360 for (i = map->n-1; i >= 0; --i) {
5361 if (map->p[i] != bmap)
5363 map = isl_map_cow(map);
5366 isl_basic_map_free(map->p[i]);
5367 if (i != map->n-1) {
5368 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5369 map->p[i] = map->p[map->n-1];
5380 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5381 struct isl_basic_set *bset)
5383 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5384 (struct isl_basic_map *)bset);
5387 /* Given two basic sets bset1 and bset2, compute the maximal difference
5388 * between the values of dimension pos in bset1 and those in bset2
5389 * for any common value of the parameters and dimensions preceding pos.
5391 static enum isl_lp_result basic_set_maximal_difference_at(
5392 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5393 int pos, isl_int *opt)
5395 struct isl_dim *dims;
5396 struct isl_basic_map *bmap1 = NULL;
5397 struct isl_basic_map *bmap2 = NULL;
5398 struct isl_ctx *ctx;
5399 struct isl_vec *obj;
5402 unsigned dim1, dim2;
5403 enum isl_lp_result res;
5405 if (!bset1 || !bset2)
5406 return isl_lp_error;
5408 nparam = isl_basic_set_n_param(bset1);
5409 dim1 = isl_basic_set_n_dim(bset1);
5410 dim2 = isl_basic_set_n_dim(bset2);
5411 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5412 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5413 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5414 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5415 if (!bmap1 || !bmap2)
5417 bmap1 = isl_basic_map_cow(bmap1);
5418 bmap1 = isl_basic_map_extend(bmap1, nparam,
5419 pos, (dim1 - pos) + (dim2 - pos),
5420 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5421 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5424 total = isl_basic_map_total_dim(bmap1);
5426 obj = isl_vec_alloc(ctx, 1 + total);
5427 isl_seq_clr(obj->block.data, 1 + total);
5428 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5429 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5432 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5434 isl_basic_map_free(bmap1);
5438 isl_basic_map_free(bmap1);
5439 isl_basic_map_free(bmap2);
5440 return isl_lp_error;
5443 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5444 * for any common value of the parameters and dimensions preceding pos
5445 * in both basic sets, the values of dimension pos in bset1 are
5446 * smaller or larger than those in bset2.
5449 * 1 if bset1 follows bset2
5450 * -1 if bset1 precedes bset2
5451 * 0 if bset1 and bset2 are incomparable
5452 * -2 if some error occurred.
5454 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5455 struct isl_basic_set *bset2, int pos)
5458 enum isl_lp_result res;
5463 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5465 if (res == isl_lp_empty)
5467 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5468 res == isl_lp_unbounded)
5470 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5479 /* Given two basic sets bset1 and bset2, check whether
5480 * for any common value of the parameters and dimensions preceding pos
5481 * there is a value of dimension pos in bset1 that is larger
5482 * than a value of the same dimension in bset2.
5485 * 1 if there exists such a pair
5486 * 0 if there is no such pair, but there is a pair of equal values
5488 * -2 if some error occurred.
5490 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5491 __isl_keep isl_basic_set *bset2, int pos)
5494 enum isl_lp_result res;
5499 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5501 if (res == isl_lp_empty)
5503 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5504 res == isl_lp_unbounded)
5506 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5508 else if (res == isl_lp_ok)
5517 /* Given two sets set1 and set2, check whether
5518 * for any common value of the parameters and dimensions preceding pos
5519 * there is a value of dimension pos in set1 that is larger
5520 * than a value of the same dimension in set2.
5523 * 1 if there exists such a pair
5524 * 0 if there is no such pair, but there is a pair of equal values
5526 * -2 if some error occurred.
5528 int isl_set_follows_at(__isl_keep isl_set *set1,
5529 __isl_keep isl_set *set2, int pos)
5537 for (i = 0; i < set1->n; ++i)
5538 for (j = 0; j < set2->n; ++j) {
5540 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5541 if (f == 1 || f == -2)
5550 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5551 unsigned pos, isl_int *val)
5559 total = isl_basic_map_total_dim(bmap);
5560 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5561 for (; d+1 > pos; --d)
5562 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5566 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5568 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5570 if (!isl_int_is_one(bmap->eq[i][1+d]))
5573 isl_int_neg(*val, bmap->eq[i][0]);
5579 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5580 unsigned pos, isl_int *val)
5592 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5595 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5596 for (i = 1; fixed == 1 && i < map->n; ++i) {
5597 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5598 if (fixed == 1 && isl_int_ne(tmp, v))
5602 isl_int_set(*val, v);
5608 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5609 unsigned pos, isl_int *val)
5611 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5615 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5618 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5621 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5622 enum isl_dim_type type, unsigned pos, isl_int *val)
5624 if (pos >= isl_basic_map_dim(bmap, type))
5626 return isl_basic_map_fast_has_fixed_var(bmap,
5627 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5630 int isl_map_fast_is_fixed(struct isl_map *map,
5631 enum isl_dim_type type, unsigned pos, isl_int *val)
5633 if (pos >= isl_map_dim(map, type))
5635 return isl_map_fast_has_fixed_var(map,
5636 map_offset(map, type) - 1 + pos, val);
5639 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5640 * then return this fixed value in *val.
5642 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5645 return isl_basic_set_fast_has_fixed_var(bset,
5646 isl_basic_set_n_param(bset) + dim, val);
5649 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5650 * then return this fixed value in *val.
5652 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5654 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5657 /* Check if input variable in has fixed value and if so and if val is not NULL,
5658 * then return this fixed value in *val.
5660 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5662 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5665 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5666 * and if val is not NULL, then return this lower bound in *val.
5668 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5669 unsigned dim, isl_int *val)
5671 int i, i_eq = -1, i_ineq = -1;
5678 total = isl_basic_set_total_dim(bset);
5679 nparam = isl_basic_set_n_param(bset);
5680 for (i = 0; i < bset->n_eq; ++i) {
5681 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5687 for (i = 0; i < bset->n_ineq; ++i) {
5688 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5690 if (i_eq != -1 || i_ineq != -1)
5694 if (i_eq == -1 && i_ineq == -1)
5696 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5697 /* The coefficient should always be one due to normalization. */
5698 if (!isl_int_is_one(c[1+nparam+dim]))
5700 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5702 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5703 total - nparam - dim - 1) != -1)
5706 isl_int_neg(*val, c[0]);
5710 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5711 unsigned dim, isl_int *val)
5723 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5727 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5729 for (i = 1; fixed == 1 && i < set->n; ++i) {
5730 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5732 if (fixed == 1 && isl_int_ne(tmp, v))
5736 isl_int_set(*val, v);
5747 static int qsort_constraint_cmp(const void *p1, const void *p2)
5749 const struct constraint *c1 = (const struct constraint *)p1;
5750 const struct constraint *c2 = (const struct constraint *)p2;
5751 unsigned size = isl_min(c1->size, c2->size);
5752 return isl_seq_cmp(c1->c, c2->c, size);
5755 static struct isl_basic_map *isl_basic_map_sort_constraints(
5756 struct isl_basic_map *bmap)
5759 struct constraint *c;
5764 total = isl_basic_map_total_dim(bmap);
5765 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5768 for (i = 0; i < bmap->n_ineq; ++i) {
5770 c[i].c = bmap->ineq[i];
5772 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5773 for (i = 0; i < bmap->n_ineq; ++i)
5774 bmap->ineq[i] = c[i].c;
5778 isl_basic_map_free(bmap);
5782 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5786 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5788 bmap = isl_basic_map_convex_hull(bmap);
5789 bmap = isl_basic_map_sort_constraints(bmap);
5790 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5794 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5796 return (struct isl_basic_set *)isl_basic_map_normalize(
5797 (struct isl_basic_map *)bset);
5800 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5801 const struct isl_basic_map *bmap2)
5808 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5809 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5810 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5811 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5812 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5813 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5814 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5815 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5817 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5819 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5821 if (bmap1->n_eq != bmap2->n_eq)
5822 return bmap1->n_eq - bmap2->n_eq;
5823 if (bmap1->n_ineq != bmap2->n_ineq)
5824 return bmap1->n_ineq - bmap2->n_ineq;
5825 if (bmap1->n_div != bmap2->n_div)
5826 return bmap1->n_div - bmap2->n_div;
5827 total = isl_basic_map_total_dim(bmap1);
5828 for (i = 0; i < bmap1->n_eq; ++i) {
5829 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5833 for (i = 0; i < bmap1->n_ineq; ++i) {
5834 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5838 for (i = 0; i < bmap1->n_div; ++i) {
5839 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5846 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5847 struct isl_basic_map *bmap2)
5849 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5852 static int qsort_bmap_cmp(const void *p1, const void *p2)
5854 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5855 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5857 return isl_basic_map_fast_cmp(bmap1, bmap2);
5860 /* We normalize in place, but if anything goes wrong we need
5861 * to return NULL, so we need to make sure we don't change the
5862 * meaning of any possible other copies of map.
5864 struct isl_map *isl_map_normalize(struct isl_map *map)
5867 struct isl_basic_map *bmap;
5871 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5873 for (i = 0; i < map->n; ++i) {
5874 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5877 isl_basic_map_free(map->p[i]);
5880 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5881 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5882 map = isl_map_remove_empty_parts(map);
5885 for (i = map->n - 1; i >= 1; --i) {
5886 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5888 isl_basic_map_free(map->p[i-1]);
5889 for (j = i; j < map->n; ++j)
5890 map->p[j-1] = map->p[j];
5900 struct isl_set *isl_set_normalize(struct isl_set *set)
5902 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5905 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5915 if (!isl_dim_equal(map1->dim, map2->dim))
5918 map1 = isl_map_copy(map1);
5919 map2 = isl_map_copy(map2);
5920 map1 = isl_map_normalize(map1);
5921 map2 = isl_map_normalize(map2);
5924 equal = map1->n == map2->n;
5925 for (i = 0; equal && i < map1->n; ++i) {
5926 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5939 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5941 return isl_map_fast_is_equal((struct isl_map *)set1,
5942 (struct isl_map *)set2);
5945 /* Return an interval that ranges from min to max (inclusive)
5947 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5948 isl_int min, isl_int max)
5951 struct isl_basic_set *bset = NULL;
5953 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5957 k = isl_basic_set_alloc_inequality(bset);
5960 isl_int_set_si(bset->ineq[k][1], 1);
5961 isl_int_neg(bset->ineq[k][0], min);
5963 k = isl_basic_set_alloc_inequality(bset);
5966 isl_int_set_si(bset->ineq[k][1], -1);
5967 isl_int_set(bset->ineq[k][0], max);
5971 isl_basic_set_free(bset);
5975 /* Return the Cartesian product of the basic sets in list (in the given order).
5977 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5985 struct isl_basic_set *product = NULL;
5989 isl_assert(list->ctx, list->n > 0, goto error);
5990 isl_assert(list->ctx, list->p[0], goto error);
5991 nparam = isl_basic_set_n_param(list->p[0]);
5992 dim = isl_basic_set_n_dim(list->p[0]);
5993 extra = list->p[0]->n_div;
5994 n_eq = list->p[0]->n_eq;
5995 n_ineq = list->p[0]->n_ineq;
5996 for (i = 1; i < list->n; ++i) {
5997 isl_assert(list->ctx, list->p[i], goto error);
5998 isl_assert(list->ctx,
5999 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6000 dim += isl_basic_set_n_dim(list->p[i]);
6001 extra += list->p[i]->n_div;
6002 n_eq += list->p[i]->n_eq;
6003 n_ineq += list->p[i]->n_ineq;
6005 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6010 for (i = 0; i < list->n; ++i) {
6011 isl_basic_set_add_constraints(product,
6012 isl_basic_set_copy(list->p[i]), dim);
6013 dim += isl_basic_set_n_dim(list->p[i]);
6015 isl_basic_set_list_free(list);
6018 isl_basic_set_free(product);
6019 isl_basic_set_list_free(list);
6023 struct isl_basic_map *isl_basic_map_product(
6024 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6026 struct isl_dim *dim_result = NULL;
6027 struct isl_basic_map *bmap;
6028 unsigned in1, in2, out1, out2, nparam, total, pos;
6029 struct isl_dim_map *dim_map1, *dim_map2;
6031 if (!bmap1 || !bmap2)
6034 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6035 bmap2->dim, isl_dim_param), goto error);
6036 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6037 isl_dim_copy(bmap2->dim));
6039 in1 = isl_basic_map_n_in(bmap1);
6040 in2 = isl_basic_map_n_in(bmap2);
6041 out1 = isl_basic_map_n_out(bmap1);
6042 out2 = isl_basic_map_n_out(bmap2);
6043 nparam = isl_basic_map_n_param(bmap1);
6045 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6046 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6047 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6048 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6049 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6050 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6051 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6052 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6053 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6054 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6055 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6057 bmap = isl_basic_map_alloc_dim(dim_result,
6058 bmap1->n_div + bmap2->n_div,
6059 bmap1->n_eq + bmap2->n_eq,
6060 bmap1->n_ineq + bmap2->n_ineq);
6061 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6062 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6063 bmap = isl_basic_map_simplify(bmap);
6064 return isl_basic_map_finalize(bmap);
6066 isl_basic_map_free(bmap1);
6067 isl_basic_map_free(bmap2);
6071 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6073 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6076 struct isl_map *result;
6082 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6083 map2->dim, isl_dim_param), goto error);
6085 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6086 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6087 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6089 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6090 isl_dim_copy(map2->dim)),
6091 map1->n * map2->n, flags);
6094 for (i = 0; i < map1->n; ++i)
6095 for (j = 0; j < map2->n; ++j) {
6096 struct isl_basic_map *part;
6097 part = isl_basic_map_product(
6098 isl_basic_map_copy(map1->p[i]),
6099 isl_basic_map_copy(map2->p[j]));
6100 if (isl_basic_map_is_empty(part))
6101 isl_basic_map_free(part);
6103 result = isl_map_add_basic_map(result, part);
6116 /* Given two set A and B, construct its Cartesian product A x B.
6118 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6120 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6121 (struct isl_map *)set2);
6124 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6127 uint32_t hash = isl_hash_init();
6132 bset = isl_basic_set_copy(bset);
6133 bset = isl_basic_set_normalize(bset);
6136 total = isl_basic_set_total_dim(bset);
6137 isl_hash_byte(hash, bset->n_eq & 0xFF);
6138 for (i = 0; i < bset->n_eq; ++i) {
6140 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6141 isl_hash_hash(hash, c_hash);
6143 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6144 for (i = 0; i < bset->n_ineq; ++i) {
6146 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6147 isl_hash_hash(hash, c_hash);
6149 isl_hash_byte(hash, bset->n_div & 0xFF);
6150 for (i = 0; i < bset->n_div; ++i) {
6152 if (isl_int_is_zero(bset->div[i][0]))
6154 isl_hash_byte(hash, i & 0xFF);
6155 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6156 isl_hash_hash(hash, c_hash);
6158 isl_basic_set_free(bset);
6162 uint32_t isl_set_get_hash(struct isl_set *set)
6169 set = isl_set_copy(set);
6170 set = isl_set_normalize(set);
6174 hash = isl_hash_init();
6175 for (i = 0; i < set->n; ++i) {
6177 bset_hash = isl_basic_set_get_hash(set->p[i]);
6178 isl_hash_hash(hash, bset_hash);
6186 /* Check if the value for dimension dim is completely determined
6187 * by the values of the other parameters and variables.
6188 * That is, check if dimension dim is involved in an equality.
6190 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6197 nparam = isl_basic_set_n_param(bset);
6198 for (i = 0; i < bset->n_eq; ++i)
6199 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6204 /* Check if the value for dimension dim is completely determined
6205 * by the values of the other parameters and variables.
6206 * That is, check if dimension dim is involved in an equality
6207 * for each of the subsets.
6209 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6215 for (i = 0; i < set->n; ++i) {
6217 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6224 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6225 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6232 for (i = 0; i < map->n; ++i)
6233 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6239 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6240 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6247 for (i = 0; i < set->n; ++i)
6248 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6254 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6256 struct isl_dim *dim;
6261 if (bset->n_div == 0)
6264 bset = isl_basic_set_cow(bset);
6268 dim = isl_basic_set_get_dim(bset);
6269 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6272 isl_dim_free(bset->dim);
6278 isl_basic_set_free(bset);
6282 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6285 struct isl_dim *dim;
6288 set = isl_set_align_divs(set);
6292 if (set->n == 0 || set->p[0]->n_div == 0)
6295 set = isl_set_cow(set);
6299 n_div = set->p[0]->n_div;
6300 dim = isl_set_get_dim(set);
6301 dim = isl_dim_add(dim, isl_dim_set, n_div);
6304 isl_dim_free(set->dim);
6307 for (i = 0; i < set->n; ++i) {
6308 set->p[i] = isl_basic_set_lift(set->p[i]);
6319 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6321 struct isl_dim *dim;
6322 struct isl_basic_map *bmap;
6329 set = isl_set_align_divs(set);
6334 dim = isl_set_get_dim(set);
6335 if (set->n == 0 || set->p[0]->n_div == 0) {
6337 return isl_map_identity(dim);
6340 n_div = set->p[0]->n_div;
6341 dim = isl_dim_map(dim);
6342 n_param = isl_dim_size(dim, isl_dim_param);
6343 n_set = isl_dim_size(dim, isl_dim_in);
6344 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6345 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6346 for (i = 0; i < n_set; ++i)
6347 bmap = var_equal(bmap, i);
6349 total = n_param + n_set + n_set + n_div;
6350 for (i = 0; i < n_div; ++i) {
6351 k = isl_basic_map_alloc_inequality(bmap);
6354 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6355 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6356 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6357 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6358 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6359 set->p[0]->div[i][0]);
6361 l = isl_basic_map_alloc_inequality(bmap);
6364 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6365 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6366 set->p[0]->div[i][0]);
6367 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6371 return isl_map_from_basic_map(bmap);
6374 isl_basic_map_free(bmap);
6378 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6386 dim = isl_basic_set_total_dim(bset);
6387 size += bset->n_eq * (1 + dim);
6388 size += bset->n_ineq * (1 + dim);
6389 size += bset->n_div * (2 + dim);
6394 int isl_set_size(__isl_keep isl_set *set)
6402 for (i = 0; i < set->n; ++i)
6403 size += isl_basic_set_size(set->p[i]);
6408 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6409 enum isl_dim_type type, unsigned pos)
6417 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6419 pos += isl_basic_map_offset(bmap, type);
6421 for (i = 0; i < bmap->n_eq; ++i)
6422 if (!isl_int_is_zero(bmap->eq[i][pos]))
6426 for (i = 0; i < bmap->n_ineq; ++i) {
6427 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6434 return lower && upper;
6437 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6438 enum isl_dim_type type, unsigned pos)
6445 for (i = 0; i < map->n; ++i) {
6447 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6448 if (bounded < 0 || !bounded)
6455 /* Return 1 if the specified dim is involved in both an upper bound
6456 * and a lower bound.
6458 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6459 enum isl_dim_type type, unsigned pos)
6461 return isl_map_dim_is_bounded((isl_map *)set, type, pos);