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_dims(
2116 __isl_take isl_basic_map *bmap,
2117 enum isl_dim_type dst_type, unsigned dst_pos,
2118 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2121 struct isl_dim_map *dim_map;
2122 struct isl_basic_map *res;
2123 enum isl_dim_type t;
2124 unsigned total, off;
2131 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2134 if (dst_type == src_type && dst_pos == src_pos)
2137 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2139 if (pos(bmap->dim, dst_type) + dst_pos ==
2140 pos(bmap->dim, src_type) + src_pos +
2141 ((src_type < dst_type) ? n : 0)) {
2142 bmap = isl_basic_map_cow(bmap);
2146 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2147 src_type, src_pos, n);
2154 total = isl_basic_map_total_dim(bmap);
2155 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2158 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2159 unsigned size = isl_dim_size(bmap->dim, t);
2160 if (t == dst_type) {
2161 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2164 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2167 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2168 dst_pos, size - dst_pos, off);
2169 off += size - dst_pos;
2170 } else if (t == src_type) {
2171 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2174 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2175 src_pos + n, size - src_pos - n, off);
2176 off += size - src_pos - n;
2178 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2182 isl_dim_map_div(dim_map, bmap, off + n);
2184 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2185 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2186 bmap = add_constraints_dim_map(res, bmap, dim_map);
2188 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2189 src_type, src_pos, n);
2193 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2194 bmap = isl_basic_map_gauss(bmap, NULL);
2195 bmap = isl_basic_map_finalize(bmap);
2199 isl_basic_map_free(bmap);
2203 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2204 enum isl_dim_type dst_type, unsigned dst_pos,
2205 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2209 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2210 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2211 src_type, src_pos, n);
2217 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2218 enum isl_dim_type dst_type, unsigned dst_pos,
2219 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2228 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2231 if (dst_type == src_type && dst_pos == src_pos)
2234 isl_assert(map->ctx, dst_type != src_type, goto error);
2236 map = isl_map_cow(map);
2240 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2244 for (i = 0; i < map->n; ++i) {
2245 map->p[i] = isl_basic_map_move_dims(map->p[i],
2247 src_type, src_pos, n);
2258 /* Move the specified dimensions to the last columns right before
2259 * the divs. Don't change the dimension specification of bmap.
2260 * That's the responsibility of the caller.
2262 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2263 enum isl_dim_type type, unsigned first, unsigned n)
2265 struct isl_dim_map *dim_map;
2266 struct isl_basic_map *res;
2267 enum isl_dim_type t;
2268 unsigned total, off;
2272 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2275 total = isl_basic_map_total_dim(bmap);
2276 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2279 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2280 unsigned size = isl_dim_size(bmap->dim, t);
2282 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2285 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2286 first, n, total - bmap->n_div - n);
2287 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2288 first + n, size - (first + n), off);
2289 off += size - (first + n);
2291 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2295 isl_dim_map_div(dim_map, bmap, off + n);
2297 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2298 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2299 res = add_constraints_dim_map(res, bmap, dim_map);
2303 /* Turn the n dimensions of type type, starting at first
2304 * into existentially quantified variables.
2306 __isl_give isl_basic_map *isl_basic_map_project_out(
2307 __isl_take isl_basic_map *bmap,
2308 enum isl_dim_type type, unsigned first, unsigned n)
2321 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2322 return isl_basic_map_remove(bmap, type, first, n);
2324 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2327 bmap = move_last(bmap, type, first, n);
2328 bmap = isl_basic_map_cow(bmap);
2330 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2331 old = bmap->block2.data;
2332 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2333 (bmap->extra + n) * (1 + row_size));
2334 if (!bmap->block2.data)
2336 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2339 for (i = 0; i < n; ++i) {
2340 new_div[i] = bmap->block2.data +
2341 (bmap->extra + i) * (1 + row_size);
2342 isl_seq_clr(new_div[i], 1 + row_size);
2344 for (i = 0; i < bmap->extra; ++i)
2345 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2347 bmap->div = new_div;
2351 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2354 bmap = isl_basic_map_simplify(bmap);
2355 bmap = isl_basic_map_drop_redundant_divs(bmap);
2356 return isl_basic_map_finalize(bmap);
2358 isl_basic_map_free(bmap);
2362 /* Turn the n dimensions of type type, starting at first
2363 * into existentially quantified variables.
2365 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2366 enum isl_dim_type type, unsigned first, unsigned n)
2368 return (isl_basic_set *)isl_basic_map_project_out(
2369 (isl_basic_map *)bset, type, first, n);
2372 /* Turn the n dimensions of type type, starting at first
2373 * into existentially quantified variables.
2375 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2376 enum isl_dim_type type, unsigned first, unsigned n)
2386 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2388 map = isl_map_cow(map);
2392 map->dim = isl_dim_drop(map->dim, type, first, n);
2396 for (i = 0; i < map->n; ++i) {
2397 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2408 /* Turn the n dimensions of type type, starting at first
2409 * into existentially quantified variables.
2411 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2412 enum isl_dim_type type, unsigned first, unsigned n)
2414 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2417 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2421 for (i = 0; i < n; ++i) {
2422 j = isl_basic_map_alloc_div(bmap);
2425 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2429 isl_basic_map_free(bmap);
2433 struct isl_basic_map *isl_basic_map_apply_range(
2434 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2436 struct isl_dim *dim_result = NULL;
2437 struct isl_basic_map *bmap;
2438 unsigned n_in, n_out, n, nparam, total, pos;
2439 struct isl_dim_map *dim_map1, *dim_map2;
2441 if (!bmap1 || !bmap2)
2444 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2445 isl_dim_copy(bmap2->dim));
2447 n_in = isl_basic_map_n_in(bmap1);
2448 n_out = isl_basic_map_n_out(bmap2);
2449 n = isl_basic_map_n_out(bmap1);
2450 nparam = isl_basic_map_n_param(bmap1);
2452 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2453 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2454 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2455 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2456 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2457 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2458 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2459 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2460 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2461 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2462 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2464 bmap = isl_basic_map_alloc_dim(dim_result,
2465 bmap1->n_div + bmap2->n_div + n,
2466 bmap1->n_eq + bmap2->n_eq,
2467 bmap1->n_ineq + bmap2->n_ineq);
2468 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2469 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2470 bmap = add_divs(bmap, n);
2471 bmap = isl_basic_map_simplify(bmap);
2472 bmap = isl_basic_map_drop_redundant_divs(bmap);
2473 return isl_basic_map_finalize(bmap);
2475 isl_basic_map_free(bmap1);
2476 isl_basic_map_free(bmap2);
2480 struct isl_basic_set *isl_basic_set_apply(
2481 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2486 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2489 return (struct isl_basic_set *)
2490 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2492 isl_basic_set_free(bset);
2493 isl_basic_map_free(bmap);
2497 struct isl_basic_map *isl_basic_map_apply_domain(
2498 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2500 if (!bmap1 || !bmap2)
2503 isl_assert(bmap1->ctx,
2504 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2505 isl_assert(bmap1->ctx,
2506 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2509 bmap1 = isl_basic_map_reverse(bmap1);
2510 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2511 return isl_basic_map_reverse(bmap1);
2513 isl_basic_map_free(bmap1);
2514 isl_basic_map_free(bmap2);
2518 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2519 * A \cap B -> f(A) + f(B)
2521 struct isl_basic_map *isl_basic_map_sum(
2522 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2524 unsigned n_in, n_out, nparam, total, pos;
2525 struct isl_basic_map *bmap = NULL;
2526 struct isl_dim_map *dim_map1, *dim_map2;
2529 if (!bmap1 || !bmap2)
2532 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2535 nparam = isl_basic_map_n_param(bmap1);
2536 n_in = isl_basic_map_n_in(bmap1);
2537 n_out = isl_basic_map_n_out(bmap1);
2539 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2540 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2541 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2542 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2543 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2544 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2545 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2546 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2547 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2548 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2549 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2551 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2552 bmap1->n_div + bmap2->n_div + 2 * n_out,
2553 bmap1->n_eq + bmap2->n_eq + n_out,
2554 bmap1->n_ineq + bmap2->n_ineq);
2555 for (i = 0; i < n_out; ++i) {
2556 int j = isl_basic_map_alloc_equality(bmap);
2559 isl_seq_clr(bmap->eq[j], 1+total);
2560 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2561 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2562 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2564 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2565 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2566 bmap = add_divs(bmap, 2 * n_out);
2568 bmap = isl_basic_map_simplify(bmap);
2569 return isl_basic_map_finalize(bmap);
2571 isl_basic_map_free(bmap);
2572 isl_basic_map_free(bmap1);
2573 isl_basic_map_free(bmap2);
2577 /* Given two maps A -> f(A) and B -> g(B), construct a map
2578 * A \cap B -> f(A) + f(B)
2580 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2582 struct isl_map *result;
2588 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2590 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2591 map1->n * map2->n, 0);
2594 for (i = 0; i < map1->n; ++i)
2595 for (j = 0; j < map2->n; ++j) {
2596 struct isl_basic_map *part;
2597 part = isl_basic_map_sum(
2598 isl_basic_map_copy(map1->p[i]),
2599 isl_basic_map_copy(map2->p[j]));
2600 if (isl_basic_map_is_empty(part))
2601 isl_basic_map_free(part);
2603 result = isl_map_add_basic_map(result, part);
2616 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2617 __isl_take isl_set *set2)
2619 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2622 /* Given a basic map A -> f(A), construct A -> -f(A).
2624 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2629 bmap = isl_basic_map_cow(bmap);
2633 n = isl_basic_map_dim(bmap, isl_dim_out);
2634 off = isl_basic_map_offset(bmap, isl_dim_out);
2635 for (i = 0; i < bmap->n_eq; ++i)
2636 for (j = 0; j < n; ++j)
2637 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2638 for (i = 0; i < bmap->n_ineq; ++i)
2639 for (j = 0; j < n; ++j)
2640 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2641 for (i = 0; i < bmap->n_div; ++i)
2642 for (j = 0; j < n; ++j)
2643 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2644 return isl_basic_map_finalize(bmap);
2647 /* Given a map A -> f(A), construct A -> -f(A).
2649 struct isl_map *isl_map_neg(struct isl_map *map)
2653 map = isl_map_cow(map);
2657 for (i = 0; i < map->n; ++i) {
2658 map->p[i] = isl_basic_map_neg(map->p[i]);
2669 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2671 return (isl_set *)isl_map_neg((isl_map *)set);
2674 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2675 * A -> floor(f(A)/d).
2677 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2680 unsigned n_in, n_out, nparam, total, pos;
2681 struct isl_basic_map *result = NULL;
2682 struct isl_dim_map *dim_map;
2688 nparam = isl_basic_map_n_param(bmap);
2689 n_in = isl_basic_map_n_in(bmap);
2690 n_out = isl_basic_map_n_out(bmap);
2692 total = nparam + n_in + n_out + bmap->n_div + n_out;
2693 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2694 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2695 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2696 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2697 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2699 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2700 bmap->n_div + n_out,
2701 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2702 result = add_constraints_dim_map(result, bmap, dim_map);
2703 result = add_divs(result, n_out);
2704 for (i = 0; i < n_out; ++i) {
2706 j = isl_basic_map_alloc_inequality(result);
2709 isl_seq_clr(result->ineq[j], 1+total);
2710 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2711 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2712 j = isl_basic_map_alloc_inequality(result);
2715 isl_seq_clr(result->ineq[j], 1+total);
2716 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2717 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2718 isl_int_sub_ui(result->ineq[j][0], d, 1);
2721 result = isl_basic_map_simplify(result);
2722 return isl_basic_map_finalize(result);
2724 isl_basic_map_free(result);
2728 /* Given a map A -> f(A) and an integer d, construct a map
2729 * A -> floor(f(A)/d).
2731 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2735 map = isl_map_cow(map);
2739 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2740 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2741 for (i = 0; i < map->n; ++i) {
2742 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2753 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2759 i = isl_basic_map_alloc_equality(bmap);
2762 nparam = isl_basic_map_n_param(bmap);
2763 n_in = isl_basic_map_n_in(bmap);
2764 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2765 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2766 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2767 return isl_basic_map_finalize(bmap);
2769 isl_basic_map_free(bmap);
2773 /* Add a constraints to "bmap" expressing i_pos < o_pos
2775 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2781 i = isl_basic_map_alloc_inequality(bmap);
2784 nparam = isl_basic_map_n_param(bmap);
2785 n_in = isl_basic_map_n_in(bmap);
2786 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2787 isl_int_set_si(bmap->ineq[i][0], -1);
2788 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2789 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2790 return isl_basic_map_finalize(bmap);
2792 isl_basic_map_free(bmap);
2796 /* Add a constraints to "bmap" expressing i_pos > o_pos
2798 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2804 i = isl_basic_map_alloc_inequality(bmap);
2807 nparam = isl_basic_map_n_param(bmap);
2808 n_in = isl_basic_map_n_in(bmap);
2809 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2810 isl_int_set_si(bmap->ineq[i][0], -1);
2811 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2812 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2813 return isl_basic_map_finalize(bmap);
2815 isl_basic_map_free(bmap);
2819 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2822 struct isl_basic_map *bmap;
2823 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2826 for (i = 0; i < n_equal && bmap; ++i)
2827 bmap = var_equal(bmap, i);
2828 return isl_basic_map_finalize(bmap);
2831 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2833 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2836 struct isl_basic_map *bmap;
2837 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2840 for (i = 0; i < pos && bmap; ++i)
2841 bmap = var_equal(bmap, i);
2843 bmap = var_less(bmap, pos);
2844 return isl_basic_map_finalize(bmap);
2847 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2849 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2852 struct isl_basic_map *bmap;
2853 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2856 for (i = 0; i < pos && bmap; ++i)
2857 bmap = var_equal(bmap, i);
2859 bmap = var_more(bmap, pos);
2860 return isl_basic_map_finalize(bmap);
2863 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2865 struct isl_map *map;
2872 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2874 for (i = 0; i < dim; ++i)
2875 map = isl_map_add_basic_map(map,
2876 isl_basic_map_less_at(isl_dim_copy(dims), i));
2878 map = isl_map_add_basic_map(map,
2879 isl_basic_map_equal(isl_dim_copy(dims), dim));
2885 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2887 return map_lex_lte(isl_dim_map(set_dim), 0);
2890 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2892 return map_lex_lte(isl_dim_map(set_dim), 1);
2895 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2897 struct isl_map *map;
2904 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2906 for (i = 0; i < dim; ++i)
2907 map = isl_map_add_basic_map(map,
2908 isl_basic_map_more_at(isl_dim_copy(dims), i));
2910 map = isl_map_add_basic_map(map,
2911 isl_basic_map_equal(isl_dim_copy(dims), dim));
2917 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2919 return map_lex_gte(isl_dim_map(set_dim), 0);
2922 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2924 return map_lex_gte(isl_dim_map(set_dim), 1);
2927 struct isl_basic_map *isl_basic_map_from_basic_set(
2928 struct isl_basic_set *bset, struct isl_dim *dim)
2930 struct isl_basic_map *bmap;
2932 bset = isl_basic_set_cow(bset);
2936 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2937 isl_dim_free(bset->dim);
2938 bmap = (struct isl_basic_map *) bset;
2940 return isl_basic_map_finalize(bmap);
2942 isl_basic_set_free(bset);
2947 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2951 if (bmap->dim->n_in == 0)
2952 return (struct isl_basic_set *)bmap;
2953 bmap = isl_basic_map_cow(bmap);
2956 bmap->dim = isl_dim_cow(bmap->dim);
2959 bmap->dim->n_out += bmap->dim->n_in;
2960 bmap->dim->n_in = 0;
2961 bmap = isl_basic_map_finalize(bmap);
2962 return (struct isl_basic_set *)bmap;
2964 isl_basic_map_free(bmap);
2968 /* For a div d = floor(f/m), add the constraints
2971 * -(f-(n-1)) + m d >= 0
2973 * Note that the second constraint is the negation of
2977 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2980 unsigned total = isl_basic_map_total_dim(bmap);
2981 unsigned div_pos = 1 + total - bmap->n_div + div;
2983 i = isl_basic_map_alloc_inequality(bmap);
2986 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2987 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2989 j = isl_basic_map_alloc_inequality(bmap);
2992 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2993 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2994 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2998 struct isl_basic_set *isl_basic_map_underlying_set(
2999 struct isl_basic_map *bmap)
3003 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
3004 return (struct isl_basic_set *)bmap;
3005 bmap = isl_basic_map_cow(bmap);
3008 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3011 bmap->extra -= bmap->n_div;
3013 bmap = isl_basic_map_finalize(bmap);
3014 return (struct isl_basic_set *)bmap;
3019 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3020 __isl_take isl_basic_set *bset)
3022 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3025 struct isl_basic_map *isl_basic_map_overlying_set(
3026 struct isl_basic_set *bset, struct isl_basic_map *like)
3028 struct isl_basic_map *bmap;
3029 struct isl_ctx *ctx;
3036 isl_assert(ctx, bset->n_div == 0, goto error);
3037 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3038 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3040 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3041 isl_basic_map_free(like);
3042 return (struct isl_basic_map *)bset;
3044 bset = isl_basic_set_cow(bset);
3047 total = bset->dim->n_out + bset->extra;
3048 bmap = (struct isl_basic_map *)bset;
3049 isl_dim_free(bmap->dim);
3050 bmap->dim = isl_dim_copy(like->dim);
3053 bmap->n_div = like->n_div;
3054 bmap->extra += like->n_div;
3057 ltotal = total - bmap->extra + like->extra;
3060 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3061 bmap->extra * (1 + 1 + total));
3062 if (isl_blk_is_error(bmap->block2))
3064 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3068 for (i = 0; i < bmap->extra; ++i)
3069 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3070 for (i = 0; i < like->n_div; ++i) {
3071 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3072 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3074 bmap = isl_basic_map_extend_constraints(bmap,
3075 0, 2 * like->n_div);
3076 for (i = 0; i < like->n_div; ++i) {
3077 if (isl_int_is_zero(bmap->div[i][0]))
3079 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3083 isl_basic_map_free(like);
3084 bmap = isl_basic_map_simplify(bmap);
3085 bmap = isl_basic_map_finalize(bmap);
3088 isl_basic_map_free(like);
3089 isl_basic_set_free(bset);
3093 struct isl_basic_set *isl_basic_set_from_underlying_set(
3094 struct isl_basic_set *bset, struct isl_basic_set *like)
3096 return (struct isl_basic_set *)
3097 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3100 struct isl_set *isl_set_from_underlying_set(
3101 struct isl_set *set, struct isl_basic_set *like)
3107 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3109 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3110 isl_basic_set_free(like);
3113 set = isl_set_cow(set);
3116 for (i = 0; i < set->n; ++i) {
3117 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3118 isl_basic_set_copy(like));
3122 isl_dim_free(set->dim);
3123 set->dim = isl_dim_copy(like->dim);
3126 isl_basic_set_free(like);
3129 isl_basic_set_free(like);
3134 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3138 map = isl_map_cow(map);
3141 map->dim = isl_dim_cow(map->dim);
3145 for (i = 1; i < map->n; ++i)
3146 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3148 for (i = 0; i < map->n; ++i) {
3149 map->p[i] = (struct isl_basic_map *)
3150 isl_basic_map_underlying_set(map->p[i]);
3155 map->dim = isl_dim_underlying(map->dim, 0);
3157 isl_dim_free(map->dim);
3158 map->dim = isl_dim_copy(map->p[0]->dim);
3162 return (struct isl_set *)map;
3168 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3170 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3173 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3175 struct isl_basic_set *domain;
3180 n_in = isl_basic_map_n_in(bmap);
3181 n_out = isl_basic_map_n_out(bmap);
3182 domain = isl_basic_set_from_basic_map(bmap);
3183 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3186 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3188 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3191 struct isl_set *isl_map_range(struct isl_map *map)
3194 struct isl_set *set;
3198 if (isl_map_dim(map, isl_dim_in) == 0)
3199 return (isl_set *)map;
3201 map = isl_map_cow(map);
3205 set = (struct isl_set *) map;
3206 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3209 for (i = 0; i < map->n; ++i) {
3210 set->p[i] = isl_basic_map_range(map->p[i]);
3214 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3215 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3222 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3225 struct isl_map *map = NULL;
3227 set = isl_set_cow(set);
3230 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3231 map = (struct isl_map *)set;
3232 for (i = 0; i < set->n; ++i) {
3233 map->p[i] = isl_basic_map_from_basic_set(
3234 set->p[i], isl_dim_copy(dim));
3238 isl_dim_free(map->dim);
3247 struct isl_map *isl_map_from_range(struct isl_set *set)
3249 return (struct isl_map *)set;
3252 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3254 return isl_map_reverse(isl_map_from_range(set));;
3257 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3258 __isl_take isl_set *range)
3260 return isl_map_product(isl_map_from_domain(domain),
3261 isl_map_from_range(range));
3264 struct isl_set *isl_set_from_map(struct isl_map *map)
3267 struct isl_set *set = NULL;
3271 map = isl_map_cow(map);
3274 map->dim = isl_dim_cow(map->dim);
3277 map->dim->n_out += map->dim->n_in;
3279 set = (struct isl_set *)map;
3280 for (i = 0; i < map->n; ++i) {
3281 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3291 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3293 struct isl_map *map;
3297 isl_assert(dim->ctx, n >= 0, return NULL);
3298 map = isl_alloc(dim->ctx, struct isl_map,
3299 sizeof(struct isl_map) +
3300 (n - 1) * sizeof(struct isl_basic_map *));
3304 map->ctx = dim->ctx;
3305 isl_ctx_ref(map->ctx);
3317 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3318 unsigned nparam, unsigned in, unsigned out, int n,
3321 struct isl_map *map;
3322 struct isl_dim *dims;
3324 dims = isl_dim_alloc(ctx, nparam, in, out);
3328 map = isl_map_alloc_dim(dims, n, flags);
3332 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3334 struct isl_basic_map *bmap;
3335 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3336 bmap = isl_basic_map_set_to_empty(bmap);
3340 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3342 struct isl_basic_set *bset;
3343 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3344 bset = isl_basic_set_set_to_empty(bset);
3348 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3350 struct isl_basic_map *bmap;
3353 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3354 bmap = isl_basic_map_set_to_empty(bmap);
3358 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3360 struct isl_basic_map *bmap;
3363 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3364 bmap = isl_basic_map_set_to_empty(bmap);
3368 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3370 struct isl_basic_set *bset;
3373 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3374 bset = isl_basic_set_set_to_empty(bset);
3378 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3380 struct isl_basic_map *bmap;
3381 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3385 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3387 struct isl_basic_set *bset;
3388 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3392 __isl_give isl_basic_map *isl_basic_map_universe_like(
3393 __isl_keep isl_basic_map *model)
3397 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3400 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3404 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3407 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3408 __isl_keep isl_set *model)
3412 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3415 struct isl_map *isl_map_empty(struct isl_dim *dim)
3417 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3420 struct isl_map *isl_map_empty_like(struct isl_map *model)
3424 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3427 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3431 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3434 struct isl_set *isl_set_empty(struct isl_dim *dim)
3436 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3439 struct isl_set *isl_set_empty_like(struct isl_set *model)
3443 return isl_set_empty(isl_dim_copy(model->dim));
3446 struct isl_map *isl_map_universe(struct isl_dim *dim)
3448 struct isl_map *map;
3451 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3452 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3456 struct isl_set *isl_set_universe(struct isl_dim *dim)
3458 struct isl_set *set;
3461 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3462 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3466 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3470 return isl_set_universe(isl_dim_copy(model->dim));
3473 struct isl_map *isl_map_dup(struct isl_map *map)
3476 struct isl_map *dup;
3480 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3481 for (i = 0; i < map->n; ++i)
3482 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3486 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3487 __isl_take isl_basic_map *bmap)
3491 if (isl_basic_map_fast_is_empty(bmap)) {
3492 isl_basic_map_free(bmap);
3495 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3496 isl_assert(map->ctx, map->n < map->size, goto error);
3497 map->p[map->n] = bmap;
3499 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3505 isl_basic_map_free(bmap);
3509 void isl_map_free(struct isl_map *map)
3519 isl_ctx_deref(map->ctx);
3520 for (i = 0; i < map->n; ++i)
3521 isl_basic_map_free(map->p[i]);
3522 isl_dim_free(map->dim);
3526 struct isl_map *isl_map_extend(struct isl_map *base,
3527 unsigned nparam, unsigned n_in, unsigned n_out)
3531 base = isl_map_cow(base);
3535 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3538 for (i = 0; i < base->n; ++i) {
3539 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3540 isl_dim_copy(base->dim), 0, 0, 0);
3550 struct isl_set *isl_set_extend(struct isl_set *base,
3551 unsigned nparam, unsigned dim)
3553 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3557 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3558 struct isl_basic_map *bmap, unsigned pos, int value)
3562 bmap = isl_basic_map_cow(bmap);
3563 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3564 j = isl_basic_map_alloc_equality(bmap);
3567 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3568 isl_int_set_si(bmap->eq[j][pos], -1);
3569 isl_int_set_si(bmap->eq[j][0], value);
3570 bmap = isl_basic_map_simplify(bmap);
3571 return isl_basic_map_finalize(bmap);
3573 isl_basic_map_free(bmap);
3577 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3578 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3582 bmap = isl_basic_map_cow(bmap);
3583 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3584 j = isl_basic_map_alloc_equality(bmap);
3587 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3588 isl_int_set_si(bmap->eq[j][pos], -1);
3589 isl_int_set(bmap->eq[j][0], value);
3590 bmap = isl_basic_map_simplify(bmap);
3591 return isl_basic_map_finalize(bmap);
3593 isl_basic_map_free(bmap);
3597 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3598 enum isl_dim_type type, unsigned pos, int value)
3602 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3603 return isl_basic_map_fix_pos_si(bmap,
3604 isl_basic_map_offset(bmap, type) + pos, value);
3606 isl_basic_map_free(bmap);
3610 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3611 enum isl_dim_type type, unsigned pos, isl_int value)
3615 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3616 return isl_basic_map_fix_pos(bmap,
3617 isl_basic_map_offset(bmap, type) + pos, value);
3619 isl_basic_map_free(bmap);
3623 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3624 enum isl_dim_type type, unsigned pos, int value)
3626 return (struct isl_basic_set *)
3627 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3631 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3632 enum isl_dim_type type, unsigned pos, isl_int value)
3634 return (struct isl_basic_set *)
3635 isl_basic_map_fix((struct isl_basic_map *)bset,
3639 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3640 unsigned input, int value)
3642 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3645 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3646 unsigned dim, int value)
3648 return (struct isl_basic_set *)
3649 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3650 isl_dim_set, dim, value);
3653 struct isl_map *isl_map_fix_si(struct isl_map *map,
3654 enum isl_dim_type type, unsigned pos, int value)
3658 map = isl_map_cow(map);
3662 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3663 for (i = 0; i < map->n; ++i) {
3664 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3668 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3675 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3676 enum isl_dim_type type, unsigned pos, int value)
3678 return (struct isl_set *)
3679 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3682 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3683 enum isl_dim_type type, unsigned pos, isl_int value)
3687 map = isl_map_cow(map);
3691 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3692 for (i = 0; i < map->n; ++i) {
3693 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3697 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3704 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3705 enum isl_dim_type type, unsigned pos, isl_int value)
3707 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3710 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3711 unsigned input, int value)
3713 return isl_map_fix_si(map, isl_dim_in, input, value);
3716 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3718 return (struct isl_set *)
3719 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3722 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3723 __isl_take isl_basic_map *bmap,
3724 enum isl_dim_type type, unsigned pos, int value)
3730 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3731 pos += isl_basic_map_offset(bmap, type);
3732 bmap = isl_basic_map_cow(bmap);
3733 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3734 j = isl_basic_map_alloc_inequality(bmap);
3737 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3738 isl_int_set_si(bmap->ineq[j][pos], 1);
3739 isl_int_set_si(bmap->ineq[j][0], -value);
3740 bmap = isl_basic_map_simplify(bmap);
3741 return isl_basic_map_finalize(bmap);
3743 isl_basic_map_free(bmap);
3747 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3748 unsigned dim, isl_int value)
3752 bset = isl_basic_set_cow(bset);
3753 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3754 j = isl_basic_set_alloc_inequality(bset);
3757 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3758 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3759 isl_int_neg(bset->ineq[j][0], value);
3760 bset = isl_basic_set_simplify(bset);
3761 return isl_basic_set_finalize(bset);
3763 isl_basic_set_free(bset);
3767 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3768 enum isl_dim_type type, unsigned pos, int value)
3772 map = isl_map_cow(map);
3776 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3777 for (i = 0; i < map->n; ++i) {
3778 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3783 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3790 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3791 enum isl_dim_type type, unsigned pos, int value)
3793 return (struct isl_set *)
3794 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3797 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3802 set = isl_set_cow(set);
3806 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3807 for (i = 0; i < set->n; ++i) {
3808 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3818 struct isl_map *isl_map_reverse(struct isl_map *map)
3822 map = isl_map_cow(map);
3826 map->dim = isl_dim_reverse(map->dim);
3829 for (i = 0; i < map->n; ++i) {
3830 map->p[i] = isl_basic_map_reverse(map->p[i]);
3834 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3841 static struct isl_map *isl_basic_map_partial_lexopt(
3842 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3843 struct isl_set **empty, int max)
3847 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3848 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3850 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3852 isl_basic_map_free(bmap);
3853 isl_basic_set_free(dom);
3859 struct isl_map *isl_basic_map_partial_lexmax(
3860 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3861 struct isl_set **empty)
3863 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3866 struct isl_map *isl_basic_map_partial_lexmin(
3867 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3868 struct isl_set **empty)
3870 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3873 struct isl_set *isl_basic_set_partial_lexmin(
3874 struct isl_basic_set *bset, struct isl_basic_set *dom,
3875 struct isl_set **empty)
3877 return (struct isl_set *)
3878 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3882 struct isl_set *isl_basic_set_partial_lexmax(
3883 struct isl_basic_set *bset, struct isl_basic_set *dom,
3884 struct isl_set **empty)
3886 return (struct isl_set *)
3887 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3891 /* Given a basic map "bmap", compute the lexicograhically minimal
3892 * (or maximal) image element for each domain element in dom.
3893 * Set *empty to those elements in dom that do not have an image element.
3895 * We first make sure the basic sets in dom are disjoint and then
3896 * simply collect the results over each of the basic sets separately.
3897 * We could probably improve the efficiency a bit by moving the union
3898 * domain down into the parametric integer programming.
3900 static __isl_give isl_map *basic_map_partial_lexopt(
3901 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3902 __isl_give isl_set **empty, int max)
3905 struct isl_map *res;
3907 dom = isl_set_make_disjoint(dom);
3911 if (isl_set_fast_is_empty(dom)) {
3912 res = isl_map_empty_like_basic_map(bmap);
3913 *empty = isl_set_empty_like(dom);
3915 isl_basic_map_free(bmap);
3919 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3920 isl_basic_set_copy(dom->p[0]), empty, max);
3922 for (i = 1; i < dom->n; ++i) {
3923 struct isl_map *res_i;
3924 struct isl_set *empty_i;
3926 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3927 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3929 res = isl_map_union_disjoint(res, res_i);
3930 *empty = isl_set_union_disjoint(*empty, empty_i);
3934 isl_basic_map_free(bmap);
3939 isl_basic_map_free(bmap);
3943 /* Given a map "map", compute the lexicograhically minimal
3944 * (or maximal) image element for each domain element in dom.
3945 * Set *empty to those elements in dom that do not have an image element.
3947 * We first compute the lexicographically minimal or maximal element
3948 * in the first basic map. This results in a partial solution "res"
3949 * and a subset "todo" of dom that still need to be handled.
3950 * We then consider each of the remaining maps in "map" and successively
3951 * improve both "res" and "todo".
3953 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3954 * Assume we are computing the lexicographical maximum.
3955 * We first intersect basic map i with a relation that maps elements
3956 * to elements that are lexicographically larger than the image elements
3957 * in res^k and the compute the maximum image element of this intersection.
3958 * The result ("better") corresponds to those image elements in basic map i
3959 * that are better than what we had before. The remainder ("keep") are the
3960 * domain elements for which the image element in res_k was better.
3961 * We also compute the lexicographical maximum of basic map i in todo^k.
3962 * res^i is the result of the operation + better + those elements in
3963 * res^k that we should keep
3964 * todo^i is the remainder of the maximum operation on todo^k.
3966 static __isl_give isl_map *isl_map_partial_lexopt(
3967 __isl_take isl_map *map, __isl_take isl_set *dom,
3968 __isl_give isl_set **empty, int max)
3971 struct isl_map *res;
3972 struct isl_set *todo;
3977 if (isl_map_fast_is_empty(map)) {
3985 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3986 isl_set_copy(dom), &todo, max);
3988 for (i = 1; i < map->n; ++i) {
3990 struct isl_map *better;
3991 struct isl_set *keep;
3992 struct isl_map *res_i;
3993 struct isl_set *todo_i;
3994 struct isl_dim *dim = isl_map_get_dim(res);
3996 dim = isl_dim_range(dim);
3998 lt = isl_map_lex_lt(dim);
4000 lt = isl_map_lex_gt(dim);
4001 lt = isl_map_apply_range(isl_map_copy(res), lt);
4002 lt = isl_map_intersect(lt,
4003 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4004 better = isl_map_partial_lexopt(lt,
4005 isl_map_domain(isl_map_copy(res)),
4008 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4009 todo, &todo_i, max);
4011 res = isl_map_intersect_domain(res, keep);
4012 res = isl_map_union_disjoint(res, res_i);
4013 res = isl_map_union_disjoint(res, better);
4034 __isl_give isl_map *isl_map_partial_lexmax(
4035 __isl_take isl_map *map, __isl_take isl_set *dom,
4036 __isl_give isl_set **empty)
4038 return isl_map_partial_lexopt(map, dom, empty, 1);
4041 __isl_give isl_map *isl_map_partial_lexmin(
4042 __isl_take isl_map *map, __isl_take isl_set *dom,
4043 __isl_give isl_set **empty)
4045 return isl_map_partial_lexopt(map, dom, empty, 0);
4048 __isl_give isl_set *isl_set_partial_lexmin(
4049 __isl_take isl_set *set, __isl_take isl_set *dom,
4050 __isl_give isl_set **empty)
4052 return (struct isl_set *)
4053 isl_map_partial_lexmin((struct isl_map *)set,
4057 __isl_give isl_set *isl_set_partial_lexmax(
4058 __isl_take isl_set *set, __isl_take isl_set *dom,
4059 __isl_give isl_set **empty)
4061 return (struct isl_set *)
4062 isl_map_partial_lexmax((struct isl_map *)set,
4066 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4068 struct isl_basic_set *dom = NULL;
4069 struct isl_dim *dom_dim;
4073 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4074 dom = isl_basic_set_universe(dom_dim);
4075 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4077 isl_basic_map_free(bmap);
4081 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4083 return isl_basic_map_lexopt(bmap, 0);
4086 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4088 return isl_basic_map_lexopt(bmap, 1);
4091 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4093 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4096 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4098 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4101 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4103 struct isl_set *dom = NULL;
4104 struct isl_dim *dom_dim;
4108 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4109 dom = isl_set_universe(dom_dim);
4110 return isl_map_partial_lexopt(map, dom, NULL, max);
4116 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4118 return isl_map_lexopt(map, 0);
4121 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4123 return isl_map_lexopt(map, 1);
4126 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4128 return (isl_set *)isl_map_lexmin((isl_map *)set);
4131 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4133 return (isl_set *)isl_map_lexmax((isl_map *)set);
4136 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4137 struct isl_dim *dim)
4144 for (i = 0; i < map->n; ++i) {
4145 isl_dim_free(map->p[i]->dim);
4146 map->p[i]->dim = isl_dim_copy(dim);
4148 isl_dim_free(map->dim);
4158 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4159 struct isl_dim *dim)
4161 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4164 /* Apply a preimage specified by "mat" on the parameters of "bset".
4165 * bset is assumed to have only parameters and divs.
4167 static struct isl_basic_set *basic_set_parameter_preimage(
4168 struct isl_basic_set *bset, struct isl_mat *mat)
4175 bset->dim = isl_dim_cow(bset->dim);
4179 nparam = isl_basic_set_dim(bset, isl_dim_param);
4181 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4183 bset->dim->nparam = 0;
4184 bset->dim->n_out = nparam;
4185 bset = isl_basic_set_preimage(bset, mat);
4187 bset->dim->nparam = bset->dim->n_out;
4188 bset->dim->n_out = 0;
4193 isl_basic_set_free(bset);
4197 /* Apply a preimage specified by "mat" on the parameters of "set".
4198 * set is assumed to have only parameters and divs.
4200 static struct isl_set *set_parameter_preimage(
4201 struct isl_set *set, struct isl_mat *mat)
4203 struct isl_dim *dim = NULL;
4209 dim = isl_dim_copy(set->dim);
4210 dim = isl_dim_cow(dim);
4214 nparam = isl_set_dim(set, isl_dim_param);
4216 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4219 dim->n_out = nparam;
4220 isl_set_reset_dim(set, dim);
4221 set = isl_set_preimage(set, mat);
4224 dim = isl_dim_copy(set->dim);
4225 dim = isl_dim_cow(dim);
4228 dim->nparam = dim->n_out;
4230 isl_set_reset_dim(set, dim);
4240 /* Intersect the basic set "bset" with the affine space specified by the
4241 * equalities in "eq".
4243 static struct isl_basic_set *basic_set_append_equalities(
4244 struct isl_basic_set *bset, struct isl_mat *eq)
4252 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4257 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4258 for (i = 0; i < eq->n_row; ++i) {
4259 k = isl_basic_set_alloc_equality(bset);
4262 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4263 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4267 bset = isl_basic_set_gauss(bset, NULL);
4268 bset = isl_basic_set_finalize(bset);
4273 isl_basic_set_free(bset);
4277 /* Intersect the set "set" with the affine space specified by the
4278 * equalities in "eq".
4280 static struct isl_set *set_append_equalities(struct isl_set *set,
4288 for (i = 0; i < set->n; ++i) {
4289 set->p[i] = basic_set_append_equalities(set->p[i],
4302 /* Project the given basic set onto its parameter domain, possibly introducing
4303 * new, explicit, existential variables in the constraints.
4304 * The input has parameters and (possibly implicit) existential variables.
4305 * The output has the same parameters, but only
4306 * explicit existentially quantified variables.
4308 * The actual projection is performed by pip, but pip doesn't seem
4309 * to like equalities very much, so we first remove the equalities
4310 * among the parameters by performing a variable compression on
4311 * the parameters. Afterward, an inverse transformation is performed
4312 * and the equalities among the parameters are inserted back in.
4314 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4318 struct isl_mat *T, *T2;
4319 struct isl_set *set;
4320 unsigned nparam, n_div;
4322 bset = isl_basic_set_cow(bset);
4326 if (bset->n_eq == 0)
4327 return isl_basic_set_lexmin(bset);
4329 isl_basic_set_gauss(bset, NULL);
4331 nparam = isl_basic_set_dim(bset, isl_dim_param);
4332 n_div = isl_basic_set_dim(bset, isl_dim_div);
4334 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4335 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4338 if (i == bset->n_eq)
4339 return isl_basic_set_lexmin(bset);
4341 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4343 eq = isl_mat_cow(eq);
4344 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4345 if (T && T->n_col == 0) {
4349 bset = isl_basic_set_set_to_empty(bset);
4350 return isl_set_from_basic_set(bset);
4352 bset = basic_set_parameter_preimage(bset, T);
4354 set = isl_basic_set_lexmin(bset);
4355 set = set_parameter_preimage(set, T2);
4356 set = set_append_equalities(set, eq);
4360 /* Compute an explicit representation for all the existentially
4361 * quantified variables.
4362 * The input and output dimensions are first turned into parameters.
4363 * compute_divs then returns a map with the same parameters and
4364 * no input or output dimensions and the dimension specification
4365 * is reset to that of the input.
4367 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4369 struct isl_basic_set *bset;
4370 struct isl_set *set;
4371 struct isl_map *map;
4372 struct isl_dim *dim, *orig_dim = NULL;
4377 bmap = isl_basic_map_cow(bmap);
4381 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4382 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4383 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4384 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4388 orig_dim = bmap->dim;
4390 bset = (struct isl_basic_set *)bmap;
4392 set = parameter_compute_divs(bset);
4393 map = (struct isl_map *)set;
4394 map = isl_map_reset_dim(map, orig_dim);
4398 isl_basic_map_free(bmap);
4402 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4410 off = isl_dim_total(bmap->dim);
4411 for (i = 0; i < bmap->n_div; ++i) {
4412 if (isl_int_is_zero(bmap->div[i][0]))
4414 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4420 static int map_divs_known(__isl_keep isl_map *map)
4427 for (i = 0; i < map->n; ++i) {
4428 int known = basic_map_divs_known(map->p[i]);
4436 /* If bmap contains any unknown divs, then compute explicit
4437 * expressions for them. However, this computation may be
4438 * quite expensive, so first try to remove divs that aren't
4441 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4445 struct isl_map *map;
4447 known = basic_map_divs_known(bmap);
4451 return isl_map_from_basic_map(bmap);
4453 bmap = isl_basic_map_drop_redundant_divs(bmap);
4455 known = basic_map_divs_known(bmap);
4459 return isl_map_from_basic_map(bmap);
4461 map = compute_divs(bmap);
4464 isl_basic_map_free(bmap);
4468 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4472 struct isl_map *res;
4479 known = map_divs_known(map);
4487 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4488 for (i = 1 ; i < map->n; ++i) {
4490 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4491 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4492 res = isl_map_union_disjoint(res, r2);
4494 res = isl_map_union(res, r2);
4501 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4503 return (struct isl_set *)
4504 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4507 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4509 return (struct isl_set *)
4510 isl_map_compute_divs((struct isl_map *)set);
4513 struct isl_set *isl_map_domain(struct isl_map *map)
4516 struct isl_set *set;
4521 map = isl_map_cow(map);
4525 set = (struct isl_set *)map;
4526 set->dim = isl_dim_domain(set->dim);
4529 for (i = 0; i < map->n; ++i) {
4530 set->p[i] = isl_basic_map_domain(map->p[i]);
4534 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4535 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4542 struct isl_map *isl_map_union_disjoint(
4543 struct isl_map *map1, struct isl_map *map2)
4547 struct isl_map *map = NULL;
4561 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4563 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4564 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4565 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4567 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4568 map1->n + map2->n, flags);
4571 for (i = 0; i < map1->n; ++i) {
4572 map = isl_map_add_basic_map(map,
4573 isl_basic_map_copy(map1->p[i]));
4577 for (i = 0; i < map2->n; ++i) {
4578 map = isl_map_add_basic_map(map,
4579 isl_basic_map_copy(map2->p[i]));
4593 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4595 map1 = isl_map_union_disjoint(map1, map2);
4599 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4603 struct isl_set *isl_set_union_disjoint(
4604 struct isl_set *set1, struct isl_set *set2)
4606 return (struct isl_set *)
4607 isl_map_union_disjoint(
4608 (struct isl_map *)set1, (struct isl_map *)set2);
4611 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4613 return (struct isl_set *)
4614 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4617 struct isl_map *isl_map_intersect_range(
4618 struct isl_map *map, struct isl_set *set)
4621 struct isl_map *result;
4627 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4628 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4629 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4631 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4632 map->n * set->n, flags);
4635 for (i = 0; i < map->n; ++i)
4636 for (j = 0; j < set->n; ++j) {
4637 result = isl_map_add_basic_map(result,
4638 isl_basic_map_intersect_range(
4639 isl_basic_map_copy(map->p[i]),
4640 isl_basic_set_copy(set->p[j])));
4653 struct isl_map *isl_map_intersect_domain(
4654 struct isl_map *map, struct isl_set *set)
4656 return isl_map_reverse(
4657 isl_map_intersect_range(isl_map_reverse(map), set));
4660 struct isl_map *isl_map_apply_domain(
4661 struct isl_map *map1, struct isl_map *map2)
4665 map1 = isl_map_reverse(map1);
4666 map1 = isl_map_apply_range(map1, map2);
4667 return isl_map_reverse(map1);
4674 struct isl_map *isl_map_apply_range(
4675 struct isl_map *map1, struct isl_map *map2)
4677 struct isl_dim *dim_result;
4678 struct isl_map *result;
4684 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4685 isl_dim_copy(map2->dim));
4687 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4690 for (i = 0; i < map1->n; ++i)
4691 for (j = 0; j < map2->n; ++j) {
4692 result = isl_map_add_basic_map(result,
4693 isl_basic_map_apply_range(
4694 isl_basic_map_copy(map1->p[i]),
4695 isl_basic_map_copy(map2->p[j])));
4701 if (result && result->n <= 1)
4702 ISL_F_SET(result, ISL_MAP_DISJOINT);
4711 * returns range - domain
4713 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4716 struct isl_basic_set *bset;
4723 dim = isl_basic_map_n_in(bmap);
4724 nparam = isl_basic_map_n_param(bmap);
4725 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4726 bset = isl_basic_set_from_basic_map(bmap);
4727 bset = isl_basic_set_cow(bset);
4728 dims = isl_basic_set_get_dim(bset);
4729 dims = isl_dim_add(dims, isl_dim_set, dim);
4730 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
4731 bset = isl_basic_set_swap_vars(bset, 2*dim);
4732 for (i = 0; i < dim; ++i) {
4733 int j = isl_basic_map_alloc_equality(
4734 (struct isl_basic_map *)bset);
4737 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4738 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4739 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4740 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4742 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4744 isl_basic_map_free(bmap);
4749 * returns range - domain
4751 struct isl_set *isl_map_deltas(struct isl_map *map)
4755 struct isl_set *result;
4760 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4761 dim = isl_map_get_dim(map);
4762 dim = isl_dim_domain(dim);
4763 result = isl_set_alloc_dim(dim, map->n, map->flags);
4766 for (i = 0; i < map->n; ++i)
4767 result = isl_set_add_basic_set(result,
4768 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4776 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4778 struct isl_basic_map *bmap;
4786 nparam = dims->nparam;
4788 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4792 for (i = 0; i < dim; ++i) {
4793 int j = isl_basic_map_alloc_equality(bmap);
4796 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4797 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4798 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4800 return isl_basic_map_finalize(bmap);
4802 isl_basic_map_free(bmap);
4806 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4808 struct isl_dim *dim = isl_dim_map(set_dim);
4811 return basic_map_identity(dim);
4814 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4816 if (!model || !model->dim)
4818 isl_assert(model->ctx,
4819 model->dim->n_in == model->dim->n_out, return NULL);
4820 return basic_map_identity(isl_dim_copy(model->dim));
4823 static struct isl_map *map_identity(struct isl_dim *dim)
4825 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4826 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4829 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4831 struct isl_dim *dim = isl_dim_map(set_dim);
4834 return map_identity(dim);
4837 struct isl_map *isl_map_identity_like(struct isl_map *model)
4839 if (!model || !model->dim)
4841 isl_assert(model->ctx,
4842 model->dim->n_in == model->dim->n_out, return NULL);
4843 return map_identity(isl_dim_copy(model->dim));
4846 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4848 if (!model || !model->dim)
4850 isl_assert(model->ctx,
4851 model->dim->n_in == model->dim->n_out, return NULL);
4852 return map_identity(isl_dim_copy(model->dim));
4855 /* Construct a basic set with all set dimensions having only non-negative
4858 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4863 struct isl_basic_set *bset;
4867 nparam = dims->nparam;
4869 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4872 for (i = 0; i < dim; ++i) {
4873 int k = isl_basic_set_alloc_inequality(bset);
4876 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4877 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4881 isl_basic_set_free(bset);
4885 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
4886 enum isl_dim_type type, unsigned first, unsigned n)
4889 isl_basic_set *nonneg = NULL;
4890 isl_basic_set *neg = NULL;
4897 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
4899 for (i = 0; i < n; ++i) {
4903 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
4904 k = isl_basic_set_alloc_inequality(nonneg);
4907 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
4908 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
4910 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
4911 k = isl_basic_set_alloc_inequality(neg);
4914 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
4915 isl_int_set_si(neg->ineq[k][0], -1);
4916 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
4918 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
4923 isl_basic_set_free(nonneg);
4924 isl_basic_set_free(neg);
4929 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4931 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4934 int isl_basic_map_is_subset(
4935 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4938 struct isl_map *map1;
4939 struct isl_map *map2;
4941 if (!bmap1 || !bmap2)
4944 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4945 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4947 is_subset = isl_map_is_subset(map1, map2);
4955 int isl_basic_map_is_equal(
4956 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4960 if (!bmap1 || !bmap2)
4962 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4965 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4969 int isl_basic_set_is_equal(
4970 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4972 return isl_basic_map_is_equal(
4973 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4976 int isl_map_is_empty(struct isl_map *map)
4983 for (i = 0; i < map->n; ++i) {
4984 is_empty = isl_basic_map_is_empty(map->p[i]);
4993 int isl_map_fast_is_empty(struct isl_map *map)
4998 int isl_set_fast_is_empty(struct isl_set *set)
5003 int isl_set_is_empty(struct isl_set *set)
5005 return isl_map_is_empty((struct isl_map *)set);
5008 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5014 is_subset = isl_map_is_subset(map1, map2);
5017 is_subset = isl_map_is_subset(map2, map1);
5021 int isl_basic_map_is_strict_subset(
5022 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5026 if (!bmap1 || !bmap2)
5028 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5031 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5032 if (is_subset == -1)
5037 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5043 is_subset = isl_map_is_subset(map1, map2);
5046 is_subset = isl_map_is_subset(map2, map1);
5047 if (is_subset == -1)
5052 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5054 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5057 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5061 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5064 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5068 return bset->n_eq == 0 && bset->n_ineq == 0;
5071 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5076 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
5079 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5081 return isl_map_fast_is_universe((isl_map *) set);
5084 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5086 struct isl_basic_set *bset = NULL;
5087 struct isl_vec *sample = NULL;
5094 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5097 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5098 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5099 copy = isl_basic_map_convex_hull(copy);
5100 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5101 isl_basic_map_free(copy);
5105 total = 1 + isl_basic_map_total_dim(bmap);
5106 if (bmap->sample && bmap->sample->size == total) {
5107 int contains = isl_basic_map_contains(bmap, bmap->sample);
5113 isl_vec_free(bmap->sample);
5114 bmap->sample = NULL;
5115 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5118 sample = isl_basic_set_sample_vec(bset);
5121 empty = sample->size == 0;
5122 isl_vec_free(bmap->sample);
5123 bmap->sample = sample;
5125 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5130 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5134 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5137 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5141 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5144 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5146 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5149 struct isl_map *isl_basic_map_union(
5150 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5152 struct isl_map *map;
5153 if (!bmap1 || !bmap2)
5156 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5158 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5161 map = isl_map_add_basic_map(map, bmap1);
5162 map = isl_map_add_basic_map(map, bmap2);
5165 isl_basic_map_free(bmap1);
5166 isl_basic_map_free(bmap2);
5170 struct isl_set *isl_basic_set_union(
5171 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5173 return (struct isl_set *)isl_basic_map_union(
5174 (struct isl_basic_map *)bset1,
5175 (struct isl_basic_map *)bset2);
5178 /* Order divs such that any div only depends on previous divs */
5179 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5182 unsigned off = isl_dim_total(bmap->dim);
5184 for (i = 0; i < bmap->n_div; ++i) {
5186 if (isl_int_is_zero(bmap->div[i][0]))
5188 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5192 isl_basic_map_swap_div(bmap, i, i + pos);
5198 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5200 return (struct isl_basic_set *)
5201 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5204 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5211 for (i = 0; i < map->n; ++i) {
5212 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5223 /* Look for a div in dst that corresponds to the div "div" in src.
5224 * The divs before "div" in src and dst are assumed to be the same.
5226 * Returns -1 if no corresponding div was found and the position
5227 * of the corresponding div in dst otherwise.
5229 static int find_div(struct isl_basic_map *dst,
5230 struct isl_basic_map *src, unsigned div)
5234 unsigned total = isl_dim_total(src->dim);
5236 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5237 for (i = div; i < dst->n_div; ++i)
5238 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5239 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5240 dst->n_div - div) == -1)
5245 struct isl_basic_map *isl_basic_map_align_divs(
5246 struct isl_basic_map *dst, struct isl_basic_map *src)
5249 unsigned total = isl_dim_total(src->dim);
5254 if (src->n_div == 0)
5257 for (i = 0; i < src->n_div; ++i)
5258 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5260 src = isl_basic_map_order_divs(src);
5261 dst = isl_basic_map_cow(dst);
5262 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5263 src->n_div, 0, 2 * src->n_div);
5266 for (i = 0; i < src->n_div; ++i) {
5267 int j = find_div(dst, src, i);
5269 j = isl_basic_map_alloc_div(dst);
5272 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5273 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5274 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5278 isl_basic_map_swap_div(dst, i, j);
5282 isl_basic_map_free(dst);
5286 struct isl_basic_set *isl_basic_set_align_divs(
5287 struct isl_basic_set *dst, struct isl_basic_set *src)
5289 return (struct isl_basic_set *)isl_basic_map_align_divs(
5290 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5293 struct isl_map *isl_map_align_divs(struct isl_map *map)
5301 map = isl_map_compute_divs(map);
5302 map = isl_map_cow(map);
5306 for (i = 1; i < map->n; ++i)
5307 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5308 for (i = 1; i < map->n; ++i)
5309 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5311 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5315 struct isl_set *isl_set_align_divs(struct isl_set *set)
5317 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5320 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5324 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5325 map = isl_map_intersect_domain(map, set);
5326 set = isl_map_range(map);
5334 /* There is no need to cow as removing empty parts doesn't change
5335 * the meaning of the set.
5337 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5344 for (i = map->n-1; i >= 0; --i) {
5345 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5347 isl_basic_map_free(map->p[i]);
5348 if (i != map->n-1) {
5349 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5350 map->p[i] = map->p[map->n-1];
5358 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5360 return (struct isl_set *)
5361 isl_map_remove_empty_parts((struct isl_map *)set);
5364 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5366 struct isl_basic_map *bmap;
5367 if (!map || map->n == 0)
5369 bmap = map->p[map->n-1];
5370 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5371 return isl_basic_map_copy(bmap);
5374 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5376 return (struct isl_basic_set *)
5377 isl_map_copy_basic_map((struct isl_map *)set);
5380 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5381 __isl_keep isl_basic_map *bmap)
5387 for (i = map->n-1; i >= 0; --i) {
5388 if (map->p[i] != bmap)
5390 map = isl_map_cow(map);
5393 isl_basic_map_free(map->p[i]);
5394 if (i != map->n-1) {
5395 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5396 map->p[i] = map->p[map->n-1];
5407 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5408 struct isl_basic_set *bset)
5410 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5411 (struct isl_basic_map *)bset);
5414 /* Given two basic sets bset1 and bset2, compute the maximal difference
5415 * between the values of dimension pos in bset1 and those in bset2
5416 * for any common value of the parameters and dimensions preceding pos.
5418 static enum isl_lp_result basic_set_maximal_difference_at(
5419 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5420 int pos, isl_int *opt)
5422 struct isl_dim *dims;
5423 struct isl_basic_map *bmap1 = NULL;
5424 struct isl_basic_map *bmap2 = NULL;
5425 struct isl_ctx *ctx;
5426 struct isl_vec *obj;
5429 unsigned dim1, dim2;
5430 enum isl_lp_result res;
5432 if (!bset1 || !bset2)
5433 return isl_lp_error;
5435 nparam = isl_basic_set_n_param(bset1);
5436 dim1 = isl_basic_set_n_dim(bset1);
5437 dim2 = isl_basic_set_n_dim(bset2);
5438 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5439 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5440 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5441 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5442 if (!bmap1 || !bmap2)
5444 bmap1 = isl_basic_map_cow(bmap1);
5445 bmap1 = isl_basic_map_extend(bmap1, nparam,
5446 pos, (dim1 - pos) + (dim2 - pos),
5447 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5448 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5451 total = isl_basic_map_total_dim(bmap1);
5453 obj = isl_vec_alloc(ctx, 1 + total);
5454 isl_seq_clr(obj->block.data, 1 + total);
5455 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5456 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5459 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5461 isl_basic_map_free(bmap1);
5465 isl_basic_map_free(bmap1);
5466 isl_basic_map_free(bmap2);
5467 return isl_lp_error;
5470 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5471 * for any common value of the parameters and dimensions preceding pos
5472 * in both basic sets, the values of dimension pos in bset1 are
5473 * smaller or larger than those in bset2.
5476 * 1 if bset1 follows bset2
5477 * -1 if bset1 precedes bset2
5478 * 0 if bset1 and bset2 are incomparable
5479 * -2 if some error occurred.
5481 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5482 struct isl_basic_set *bset2, int pos)
5485 enum isl_lp_result res;
5490 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5492 if (res == isl_lp_empty)
5494 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5495 res == isl_lp_unbounded)
5497 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5506 /* Given two basic sets bset1 and bset2, check whether
5507 * for any common value of the parameters and dimensions preceding pos
5508 * there is a value of dimension pos in bset1 that is larger
5509 * than a value of the same dimension in bset2.
5512 * 1 if there exists such a pair
5513 * 0 if there is no such pair, but there is a pair of equal values
5515 * -2 if some error occurred.
5517 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5518 __isl_keep isl_basic_set *bset2, int pos)
5521 enum isl_lp_result res;
5526 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5528 if (res == isl_lp_empty)
5530 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5531 res == isl_lp_unbounded)
5533 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5535 else if (res == isl_lp_ok)
5544 /* Given two sets set1 and set2, check whether
5545 * for any common value of the parameters and dimensions preceding pos
5546 * there is a value of dimension pos in set1 that is larger
5547 * than a value of the same dimension in set2.
5550 * 1 if there exists such a pair
5551 * 0 if there is no such pair, but there is a pair of equal values
5553 * -2 if some error occurred.
5555 int isl_set_follows_at(__isl_keep isl_set *set1,
5556 __isl_keep isl_set *set2, int pos)
5564 for (i = 0; i < set1->n; ++i)
5565 for (j = 0; j < set2->n; ++j) {
5567 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5568 if (f == 1 || f == -2)
5577 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5578 unsigned pos, isl_int *val)
5586 total = isl_basic_map_total_dim(bmap);
5587 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5588 for (; d+1 > pos; --d)
5589 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5593 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5595 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5597 if (!isl_int_is_one(bmap->eq[i][1+d]))
5600 isl_int_neg(*val, bmap->eq[i][0]);
5606 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5607 unsigned pos, isl_int *val)
5619 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5622 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5623 for (i = 1; fixed == 1 && i < map->n; ++i) {
5624 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5625 if (fixed == 1 && isl_int_ne(tmp, v))
5629 isl_int_set(*val, v);
5635 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5636 unsigned pos, isl_int *val)
5638 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5642 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5645 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5648 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5649 enum isl_dim_type type, unsigned pos, isl_int *val)
5651 if (pos >= isl_basic_map_dim(bmap, type))
5653 return isl_basic_map_fast_has_fixed_var(bmap,
5654 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5657 int isl_map_fast_is_fixed(struct isl_map *map,
5658 enum isl_dim_type type, unsigned pos, isl_int *val)
5660 if (pos >= isl_map_dim(map, type))
5662 return isl_map_fast_has_fixed_var(map,
5663 map_offset(map, type) - 1 + pos, val);
5666 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5667 * then return this fixed value in *val.
5669 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5672 return isl_basic_set_fast_has_fixed_var(bset,
5673 isl_basic_set_n_param(bset) + dim, val);
5676 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5677 * then return this fixed value in *val.
5679 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5681 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5684 /* Check if input variable in has fixed value and if so and if val is not NULL,
5685 * then return this fixed value in *val.
5687 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5689 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5692 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5693 * and if val is not NULL, then return this lower bound in *val.
5695 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5696 unsigned dim, isl_int *val)
5698 int i, i_eq = -1, i_ineq = -1;
5705 total = isl_basic_set_total_dim(bset);
5706 nparam = isl_basic_set_n_param(bset);
5707 for (i = 0; i < bset->n_eq; ++i) {
5708 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5714 for (i = 0; i < bset->n_ineq; ++i) {
5715 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5717 if (i_eq != -1 || i_ineq != -1)
5721 if (i_eq == -1 && i_ineq == -1)
5723 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5724 /* The coefficient should always be one due to normalization. */
5725 if (!isl_int_is_one(c[1+nparam+dim]))
5727 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5729 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5730 total - nparam - dim - 1) != -1)
5733 isl_int_neg(*val, c[0]);
5737 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5738 unsigned dim, isl_int *val)
5750 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5754 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5756 for (i = 1; fixed == 1 && i < set->n; ++i) {
5757 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5759 if (fixed == 1 && isl_int_ne(tmp, v))
5763 isl_int_set(*val, v);
5774 static int qsort_constraint_cmp(const void *p1, const void *p2)
5776 const struct constraint *c1 = (const struct constraint *)p1;
5777 const struct constraint *c2 = (const struct constraint *)p2;
5778 unsigned size = isl_min(c1->size, c2->size);
5779 return isl_seq_cmp(c1->c, c2->c, size);
5782 static struct isl_basic_map *isl_basic_map_sort_constraints(
5783 struct isl_basic_map *bmap)
5786 struct constraint *c;
5791 total = isl_basic_map_total_dim(bmap);
5792 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5795 for (i = 0; i < bmap->n_ineq; ++i) {
5797 c[i].c = bmap->ineq[i];
5799 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5800 for (i = 0; i < bmap->n_ineq; ++i)
5801 bmap->ineq[i] = c[i].c;
5805 isl_basic_map_free(bmap);
5809 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5813 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5815 bmap = isl_basic_map_convex_hull(bmap);
5816 bmap = isl_basic_map_sort_constraints(bmap);
5817 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5821 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5823 return (struct isl_basic_set *)isl_basic_map_normalize(
5824 (struct isl_basic_map *)bset);
5827 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5828 const struct isl_basic_map *bmap2)
5835 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5836 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5837 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5838 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5839 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5840 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5841 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5842 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5844 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5846 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5848 if (bmap1->n_eq != bmap2->n_eq)
5849 return bmap1->n_eq - bmap2->n_eq;
5850 if (bmap1->n_ineq != bmap2->n_ineq)
5851 return bmap1->n_ineq - bmap2->n_ineq;
5852 if (bmap1->n_div != bmap2->n_div)
5853 return bmap1->n_div - bmap2->n_div;
5854 total = isl_basic_map_total_dim(bmap1);
5855 for (i = 0; i < bmap1->n_eq; ++i) {
5856 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5860 for (i = 0; i < bmap1->n_ineq; ++i) {
5861 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5865 for (i = 0; i < bmap1->n_div; ++i) {
5866 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5873 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5874 struct isl_basic_map *bmap2)
5876 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5879 static int qsort_bmap_cmp(const void *p1, const void *p2)
5881 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5882 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5884 return isl_basic_map_fast_cmp(bmap1, bmap2);
5887 /* We normalize in place, but if anything goes wrong we need
5888 * to return NULL, so we need to make sure we don't change the
5889 * meaning of any possible other copies of map.
5891 struct isl_map *isl_map_normalize(struct isl_map *map)
5894 struct isl_basic_map *bmap;
5898 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5900 for (i = 0; i < map->n; ++i) {
5901 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5904 isl_basic_map_free(map->p[i]);
5907 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5908 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5909 map = isl_map_remove_empty_parts(map);
5912 for (i = map->n - 1; i >= 1; --i) {
5913 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5915 isl_basic_map_free(map->p[i-1]);
5916 for (j = i; j < map->n; ++j)
5917 map->p[j-1] = map->p[j];
5927 struct isl_set *isl_set_normalize(struct isl_set *set)
5929 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5932 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5942 if (!isl_dim_equal(map1->dim, map2->dim))
5945 map1 = isl_map_copy(map1);
5946 map2 = isl_map_copy(map2);
5947 map1 = isl_map_normalize(map1);
5948 map2 = isl_map_normalize(map2);
5951 equal = map1->n == map2->n;
5952 for (i = 0; equal && i < map1->n; ++i) {
5953 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5966 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5968 return isl_map_fast_is_equal((struct isl_map *)set1,
5969 (struct isl_map *)set2);
5972 /* Return an interval that ranges from min to max (inclusive)
5974 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5975 isl_int min, isl_int max)
5978 struct isl_basic_set *bset = NULL;
5980 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5984 k = isl_basic_set_alloc_inequality(bset);
5987 isl_int_set_si(bset->ineq[k][1], 1);
5988 isl_int_neg(bset->ineq[k][0], min);
5990 k = isl_basic_set_alloc_inequality(bset);
5993 isl_int_set_si(bset->ineq[k][1], -1);
5994 isl_int_set(bset->ineq[k][0], max);
5998 isl_basic_set_free(bset);
6002 /* Return the Cartesian product of the basic sets in list (in the given order).
6004 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6012 struct isl_basic_set *product = NULL;
6016 isl_assert(list->ctx, list->n > 0, goto error);
6017 isl_assert(list->ctx, list->p[0], goto error);
6018 nparam = isl_basic_set_n_param(list->p[0]);
6019 dim = isl_basic_set_n_dim(list->p[0]);
6020 extra = list->p[0]->n_div;
6021 n_eq = list->p[0]->n_eq;
6022 n_ineq = list->p[0]->n_ineq;
6023 for (i = 1; i < list->n; ++i) {
6024 isl_assert(list->ctx, list->p[i], goto error);
6025 isl_assert(list->ctx,
6026 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6027 dim += isl_basic_set_n_dim(list->p[i]);
6028 extra += list->p[i]->n_div;
6029 n_eq += list->p[i]->n_eq;
6030 n_ineq += list->p[i]->n_ineq;
6032 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6037 for (i = 0; i < list->n; ++i) {
6038 isl_basic_set_add_constraints(product,
6039 isl_basic_set_copy(list->p[i]), dim);
6040 dim += isl_basic_set_n_dim(list->p[i]);
6042 isl_basic_set_list_free(list);
6045 isl_basic_set_free(product);
6046 isl_basic_set_list_free(list);
6050 struct isl_basic_map *isl_basic_map_product(
6051 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6053 struct isl_dim *dim_result = NULL;
6054 struct isl_basic_map *bmap;
6055 unsigned in1, in2, out1, out2, nparam, total, pos;
6056 struct isl_dim_map *dim_map1, *dim_map2;
6058 if (!bmap1 || !bmap2)
6061 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6062 bmap2->dim, isl_dim_param), goto error);
6063 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6064 isl_dim_copy(bmap2->dim));
6066 in1 = isl_basic_map_n_in(bmap1);
6067 in2 = isl_basic_map_n_in(bmap2);
6068 out1 = isl_basic_map_n_out(bmap1);
6069 out2 = isl_basic_map_n_out(bmap2);
6070 nparam = isl_basic_map_n_param(bmap1);
6072 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6073 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6074 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6075 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6076 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6077 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6078 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6079 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6080 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6081 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6082 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6084 bmap = isl_basic_map_alloc_dim(dim_result,
6085 bmap1->n_div + bmap2->n_div,
6086 bmap1->n_eq + bmap2->n_eq,
6087 bmap1->n_ineq + bmap2->n_ineq);
6088 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6089 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6090 bmap = isl_basic_map_simplify(bmap);
6091 return isl_basic_map_finalize(bmap);
6093 isl_basic_map_free(bmap1);
6094 isl_basic_map_free(bmap2);
6098 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6100 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6103 struct isl_map *result;
6109 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6110 map2->dim, isl_dim_param), goto error);
6112 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6113 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6114 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6116 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6117 isl_dim_copy(map2->dim)),
6118 map1->n * map2->n, flags);
6121 for (i = 0; i < map1->n; ++i)
6122 for (j = 0; j < map2->n; ++j) {
6123 struct isl_basic_map *part;
6124 part = isl_basic_map_product(
6125 isl_basic_map_copy(map1->p[i]),
6126 isl_basic_map_copy(map2->p[j]));
6127 if (isl_basic_map_is_empty(part))
6128 isl_basic_map_free(part);
6130 result = isl_map_add_basic_map(result, part);
6143 /* Given two set A and B, construct its Cartesian product A x B.
6145 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6147 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6148 (struct isl_map *)set2);
6151 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6154 uint32_t hash = isl_hash_init();
6159 bset = isl_basic_set_copy(bset);
6160 bset = isl_basic_set_normalize(bset);
6163 total = isl_basic_set_total_dim(bset);
6164 isl_hash_byte(hash, bset->n_eq & 0xFF);
6165 for (i = 0; i < bset->n_eq; ++i) {
6167 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6168 isl_hash_hash(hash, c_hash);
6170 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6171 for (i = 0; i < bset->n_ineq; ++i) {
6173 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6174 isl_hash_hash(hash, c_hash);
6176 isl_hash_byte(hash, bset->n_div & 0xFF);
6177 for (i = 0; i < bset->n_div; ++i) {
6179 if (isl_int_is_zero(bset->div[i][0]))
6181 isl_hash_byte(hash, i & 0xFF);
6182 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6183 isl_hash_hash(hash, c_hash);
6185 isl_basic_set_free(bset);
6189 uint32_t isl_set_get_hash(struct isl_set *set)
6196 set = isl_set_copy(set);
6197 set = isl_set_normalize(set);
6201 hash = isl_hash_init();
6202 for (i = 0; i < set->n; ++i) {
6204 bset_hash = isl_basic_set_get_hash(set->p[i]);
6205 isl_hash_hash(hash, bset_hash);
6213 /* Check if the value for dimension dim is completely determined
6214 * by the values of the other parameters and variables.
6215 * That is, check if dimension dim is involved in an equality.
6217 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6224 nparam = isl_basic_set_n_param(bset);
6225 for (i = 0; i < bset->n_eq; ++i)
6226 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6231 /* Check if the value for dimension dim is completely determined
6232 * by the values of the other parameters and variables.
6233 * That is, check if dimension dim is involved in an equality
6234 * for each of the subsets.
6236 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6242 for (i = 0; i < set->n; ++i) {
6244 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6251 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6252 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6259 for (i = 0; i < map->n; ++i)
6260 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6266 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6267 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6274 for (i = 0; i < set->n; ++i)
6275 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6281 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6283 struct isl_dim *dim;
6288 if (bset->n_div == 0)
6291 bset = isl_basic_set_cow(bset);
6295 dim = isl_basic_set_get_dim(bset);
6296 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6299 isl_dim_free(bset->dim);
6305 isl_basic_set_free(bset);
6309 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6312 struct isl_dim *dim;
6315 set = isl_set_align_divs(set);
6319 if (set->n == 0 || set->p[0]->n_div == 0)
6322 set = isl_set_cow(set);
6326 n_div = set->p[0]->n_div;
6327 dim = isl_set_get_dim(set);
6328 dim = isl_dim_add(dim, isl_dim_set, n_div);
6331 isl_dim_free(set->dim);
6334 for (i = 0; i < set->n; ++i) {
6335 set->p[i] = isl_basic_set_lift(set->p[i]);
6346 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6348 struct isl_dim *dim;
6349 struct isl_basic_map *bmap;
6356 set = isl_set_align_divs(set);
6361 dim = isl_set_get_dim(set);
6362 if (set->n == 0 || set->p[0]->n_div == 0) {
6364 return isl_map_identity(dim);
6367 n_div = set->p[0]->n_div;
6368 dim = isl_dim_map(dim);
6369 n_param = isl_dim_size(dim, isl_dim_param);
6370 n_set = isl_dim_size(dim, isl_dim_in);
6371 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6372 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6373 for (i = 0; i < n_set; ++i)
6374 bmap = var_equal(bmap, i);
6376 total = n_param + n_set + n_set + n_div;
6377 for (i = 0; i < n_div; ++i) {
6378 k = isl_basic_map_alloc_inequality(bmap);
6381 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6382 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6383 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6384 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6385 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6386 set->p[0]->div[i][0]);
6388 l = isl_basic_map_alloc_inequality(bmap);
6391 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6392 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6393 set->p[0]->div[i][0]);
6394 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6398 return isl_map_from_basic_map(bmap);
6401 isl_basic_map_free(bmap);
6405 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6413 dim = isl_basic_set_total_dim(bset);
6414 size += bset->n_eq * (1 + dim);
6415 size += bset->n_ineq * (1 + dim);
6416 size += bset->n_div * (2 + dim);
6421 int isl_set_size(__isl_keep isl_set *set)
6429 for (i = 0; i < set->n; ++i)
6430 size += isl_basic_set_size(set->p[i]);
6435 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6436 enum isl_dim_type type, unsigned pos)
6444 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6446 pos += isl_basic_map_offset(bmap, type);
6448 for (i = 0; i < bmap->n_eq; ++i)
6449 if (!isl_int_is_zero(bmap->eq[i][pos]))
6453 for (i = 0; i < bmap->n_ineq; ++i) {
6454 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6461 return lower && upper;
6464 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6465 enum isl_dim_type type, unsigned pos)
6472 for (i = 0; i < map->n; ++i) {
6474 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6475 if (bounded < 0 || !bounded)
6482 /* Return 1 if the specified dim is involved in both an upper bound
6483 * and a lower bound.
6485 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6486 enum isl_dim_type type, unsigned pos)
6488 return isl_map_dim_is_bounded((isl_map *)set, type, pos);