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_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2204 enum isl_dim_type dst_type, unsigned dst_pos,
2205 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2207 return (isl_basic_set *)isl_basic_map_move_dims(
2208 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2211 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2212 enum isl_dim_type dst_type, unsigned dst_pos,
2213 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2217 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2218 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2219 src_type, src_pos, n);
2225 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2226 enum isl_dim_type dst_type, unsigned dst_pos,
2227 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2236 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2239 if (dst_type == src_type && dst_pos == src_pos)
2242 isl_assert(map->ctx, dst_type != src_type, goto error);
2244 map = isl_map_cow(map);
2248 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2252 for (i = 0; i < map->n; ++i) {
2253 map->p[i] = isl_basic_map_move_dims(map->p[i],
2255 src_type, src_pos, n);
2266 /* Move the specified dimensions to the last columns right before
2267 * the divs. Don't change the dimension specification of bmap.
2268 * That's the responsibility of the caller.
2270 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2271 enum isl_dim_type type, unsigned first, unsigned n)
2273 struct isl_dim_map *dim_map;
2274 struct isl_basic_map *res;
2275 enum isl_dim_type t;
2276 unsigned total, off;
2280 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2283 total = isl_basic_map_total_dim(bmap);
2284 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2287 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2288 unsigned size = isl_dim_size(bmap->dim, t);
2290 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2293 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2294 first, n, total - bmap->n_div - n);
2295 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2296 first + n, size - (first + n), off);
2297 off += size - (first + n);
2299 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2303 isl_dim_map_div(dim_map, bmap, off + n);
2305 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2306 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2307 res = add_constraints_dim_map(res, bmap, dim_map);
2311 /* Turn the n dimensions of type type, starting at first
2312 * into existentially quantified variables.
2314 __isl_give isl_basic_map *isl_basic_map_project_out(
2315 __isl_take isl_basic_map *bmap,
2316 enum isl_dim_type type, unsigned first, unsigned n)
2329 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2330 return isl_basic_map_remove(bmap, type, first, n);
2332 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2335 bmap = move_last(bmap, type, first, n);
2336 bmap = isl_basic_map_cow(bmap);
2338 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2339 old = bmap->block2.data;
2340 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2341 (bmap->extra + n) * (1 + row_size));
2342 if (!bmap->block2.data)
2344 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2347 for (i = 0; i < n; ++i) {
2348 new_div[i] = bmap->block2.data +
2349 (bmap->extra + i) * (1 + row_size);
2350 isl_seq_clr(new_div[i], 1 + row_size);
2352 for (i = 0; i < bmap->extra; ++i)
2353 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2355 bmap->div = new_div;
2359 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2362 bmap = isl_basic_map_simplify(bmap);
2363 bmap = isl_basic_map_drop_redundant_divs(bmap);
2364 return isl_basic_map_finalize(bmap);
2366 isl_basic_map_free(bmap);
2370 /* Turn the n dimensions of type type, starting at first
2371 * into existentially quantified variables.
2373 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2374 enum isl_dim_type type, unsigned first, unsigned n)
2376 return (isl_basic_set *)isl_basic_map_project_out(
2377 (isl_basic_map *)bset, type, first, n);
2380 /* Turn the n dimensions of type type, starting at first
2381 * into existentially quantified variables.
2383 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2384 enum isl_dim_type type, unsigned first, unsigned n)
2394 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2396 map = isl_map_cow(map);
2400 map->dim = isl_dim_drop(map->dim, type, first, n);
2404 for (i = 0; i < map->n; ++i) {
2405 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2416 /* Turn the n dimensions of type type, starting at first
2417 * into existentially quantified variables.
2419 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2420 enum isl_dim_type type, unsigned first, unsigned n)
2422 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2425 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2429 for (i = 0; i < n; ++i) {
2430 j = isl_basic_map_alloc_div(bmap);
2433 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2437 isl_basic_map_free(bmap);
2441 struct isl_basic_map *isl_basic_map_apply_range(
2442 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2444 struct isl_dim *dim_result = NULL;
2445 struct isl_basic_map *bmap;
2446 unsigned n_in, n_out, n, nparam, total, pos;
2447 struct isl_dim_map *dim_map1, *dim_map2;
2449 if (!bmap1 || !bmap2)
2452 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2453 isl_dim_copy(bmap2->dim));
2455 n_in = isl_basic_map_n_in(bmap1);
2456 n_out = isl_basic_map_n_out(bmap2);
2457 n = isl_basic_map_n_out(bmap1);
2458 nparam = isl_basic_map_n_param(bmap1);
2460 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2461 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2462 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2463 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2464 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2465 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2466 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2467 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2468 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2469 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2470 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2472 bmap = isl_basic_map_alloc_dim(dim_result,
2473 bmap1->n_div + bmap2->n_div + n,
2474 bmap1->n_eq + bmap2->n_eq,
2475 bmap1->n_ineq + bmap2->n_ineq);
2476 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2477 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2478 bmap = add_divs(bmap, n);
2479 bmap = isl_basic_map_simplify(bmap);
2480 bmap = isl_basic_map_drop_redundant_divs(bmap);
2481 return isl_basic_map_finalize(bmap);
2483 isl_basic_map_free(bmap1);
2484 isl_basic_map_free(bmap2);
2488 struct isl_basic_set *isl_basic_set_apply(
2489 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2494 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2497 return (struct isl_basic_set *)
2498 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2500 isl_basic_set_free(bset);
2501 isl_basic_map_free(bmap);
2505 struct isl_basic_map *isl_basic_map_apply_domain(
2506 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2508 if (!bmap1 || !bmap2)
2511 isl_assert(bmap1->ctx,
2512 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2513 isl_assert(bmap1->ctx,
2514 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2517 bmap1 = isl_basic_map_reverse(bmap1);
2518 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2519 return isl_basic_map_reverse(bmap1);
2521 isl_basic_map_free(bmap1);
2522 isl_basic_map_free(bmap2);
2526 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2527 * A \cap B -> f(A) + f(B)
2529 struct isl_basic_map *isl_basic_map_sum(
2530 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2532 unsigned n_in, n_out, nparam, total, pos;
2533 struct isl_basic_map *bmap = NULL;
2534 struct isl_dim_map *dim_map1, *dim_map2;
2537 if (!bmap1 || !bmap2)
2540 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2543 nparam = isl_basic_map_n_param(bmap1);
2544 n_in = isl_basic_map_n_in(bmap1);
2545 n_out = isl_basic_map_n_out(bmap1);
2547 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2548 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2549 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2550 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2551 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2552 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2553 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2554 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2555 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2556 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2557 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2559 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2560 bmap1->n_div + bmap2->n_div + 2 * n_out,
2561 bmap1->n_eq + bmap2->n_eq + n_out,
2562 bmap1->n_ineq + bmap2->n_ineq);
2563 for (i = 0; i < n_out; ++i) {
2564 int j = isl_basic_map_alloc_equality(bmap);
2567 isl_seq_clr(bmap->eq[j], 1+total);
2568 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2569 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2570 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2572 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2573 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2574 bmap = add_divs(bmap, 2 * n_out);
2576 bmap = isl_basic_map_simplify(bmap);
2577 return isl_basic_map_finalize(bmap);
2579 isl_basic_map_free(bmap);
2580 isl_basic_map_free(bmap1);
2581 isl_basic_map_free(bmap2);
2585 /* Given two maps A -> f(A) and B -> g(B), construct a map
2586 * A \cap B -> f(A) + f(B)
2588 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2590 struct isl_map *result;
2596 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2598 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2599 map1->n * map2->n, 0);
2602 for (i = 0; i < map1->n; ++i)
2603 for (j = 0; j < map2->n; ++j) {
2604 struct isl_basic_map *part;
2605 part = isl_basic_map_sum(
2606 isl_basic_map_copy(map1->p[i]),
2607 isl_basic_map_copy(map2->p[j]));
2608 if (isl_basic_map_is_empty(part))
2609 isl_basic_map_free(part);
2611 result = isl_map_add_basic_map(result, part);
2624 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2625 __isl_take isl_set *set2)
2627 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2630 /* Given a basic map A -> f(A), construct A -> -f(A).
2632 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2637 bmap = isl_basic_map_cow(bmap);
2641 n = isl_basic_map_dim(bmap, isl_dim_out);
2642 off = isl_basic_map_offset(bmap, isl_dim_out);
2643 for (i = 0; i < bmap->n_eq; ++i)
2644 for (j = 0; j < n; ++j)
2645 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2646 for (i = 0; i < bmap->n_ineq; ++i)
2647 for (j = 0; j < n; ++j)
2648 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2649 for (i = 0; i < bmap->n_div; ++i)
2650 for (j = 0; j < n; ++j)
2651 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2652 return isl_basic_map_finalize(bmap);
2655 /* Given a map A -> f(A), construct A -> -f(A).
2657 struct isl_map *isl_map_neg(struct isl_map *map)
2661 map = isl_map_cow(map);
2665 for (i = 0; i < map->n; ++i) {
2666 map->p[i] = isl_basic_map_neg(map->p[i]);
2677 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2679 return (isl_set *)isl_map_neg((isl_map *)set);
2682 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2683 * A -> floor(f(A)/d).
2685 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2688 unsigned n_in, n_out, nparam, total, pos;
2689 struct isl_basic_map *result = NULL;
2690 struct isl_dim_map *dim_map;
2696 nparam = isl_basic_map_n_param(bmap);
2697 n_in = isl_basic_map_n_in(bmap);
2698 n_out = isl_basic_map_n_out(bmap);
2700 total = nparam + n_in + n_out + bmap->n_div + n_out;
2701 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2702 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2703 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2704 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2705 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2707 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2708 bmap->n_div + n_out,
2709 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2710 result = add_constraints_dim_map(result, bmap, dim_map);
2711 result = add_divs(result, n_out);
2712 for (i = 0; i < n_out; ++i) {
2714 j = isl_basic_map_alloc_inequality(result);
2717 isl_seq_clr(result->ineq[j], 1+total);
2718 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2719 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2720 j = isl_basic_map_alloc_inequality(result);
2723 isl_seq_clr(result->ineq[j], 1+total);
2724 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2725 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2726 isl_int_sub_ui(result->ineq[j][0], d, 1);
2729 result = isl_basic_map_simplify(result);
2730 return isl_basic_map_finalize(result);
2732 isl_basic_map_free(result);
2736 /* Given a map A -> f(A) and an integer d, construct a map
2737 * A -> floor(f(A)/d).
2739 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2743 map = isl_map_cow(map);
2747 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2748 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2749 for (i = 0; i < map->n; ++i) {
2750 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2761 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2767 i = isl_basic_map_alloc_equality(bmap);
2770 nparam = isl_basic_map_n_param(bmap);
2771 n_in = isl_basic_map_n_in(bmap);
2772 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2773 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2774 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2775 return isl_basic_map_finalize(bmap);
2777 isl_basic_map_free(bmap);
2781 /* Add a constraints to "bmap" expressing i_pos < o_pos
2783 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2789 i = isl_basic_map_alloc_inequality(bmap);
2792 nparam = isl_basic_map_n_param(bmap);
2793 n_in = isl_basic_map_n_in(bmap);
2794 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2795 isl_int_set_si(bmap->ineq[i][0], -1);
2796 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2797 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2798 return isl_basic_map_finalize(bmap);
2800 isl_basic_map_free(bmap);
2804 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2806 static __isl_give isl_basic_map *var_less_or_equal(
2807 __isl_take isl_basic_map *bmap, unsigned pos)
2813 i = isl_basic_map_alloc_inequality(bmap);
2816 nparam = isl_basic_map_n_param(bmap);
2817 n_in = isl_basic_map_n_in(bmap);
2818 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2819 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2820 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2821 return isl_basic_map_finalize(bmap);
2823 isl_basic_map_free(bmap);
2827 /* Add a constraints to "bmap" expressing i_pos > o_pos
2829 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2835 i = isl_basic_map_alloc_inequality(bmap);
2838 nparam = isl_basic_map_n_param(bmap);
2839 n_in = isl_basic_map_n_in(bmap);
2840 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2841 isl_int_set_si(bmap->ineq[i][0], -1);
2842 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2843 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2844 return isl_basic_map_finalize(bmap);
2846 isl_basic_map_free(bmap);
2850 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2852 static __isl_give isl_basic_map *var_more_or_equal(
2853 __isl_take isl_basic_map *bmap, unsigned pos)
2859 i = isl_basic_map_alloc_inequality(bmap);
2862 nparam = isl_basic_map_n_param(bmap);
2863 n_in = isl_basic_map_n_in(bmap);
2864 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2865 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2866 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2867 return isl_basic_map_finalize(bmap);
2869 isl_basic_map_free(bmap);
2873 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2876 struct isl_basic_map *bmap;
2877 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2880 for (i = 0; i < n_equal && bmap; ++i)
2881 bmap = var_equal(bmap, i);
2882 return isl_basic_map_finalize(bmap);
2885 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2887 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2890 struct isl_basic_map *bmap;
2891 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2894 for (i = 0; i < pos && bmap; ++i)
2895 bmap = var_equal(bmap, i);
2897 bmap = var_less(bmap, pos);
2898 return isl_basic_map_finalize(bmap);
2901 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2903 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
2904 __isl_take isl_dim *dim, unsigned pos)
2907 isl_basic_map *bmap;
2909 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2910 for (i = 0; i < pos; ++i)
2911 bmap = var_equal(bmap, i);
2912 bmap = var_less_or_equal(bmap, pos);
2913 return isl_basic_map_finalize(bmap);
2916 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2918 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2921 struct isl_basic_map *bmap;
2922 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2925 for (i = 0; i < pos && bmap; ++i)
2926 bmap = var_equal(bmap, i);
2928 bmap = var_more(bmap, pos);
2929 return isl_basic_map_finalize(bmap);
2932 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
2934 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
2935 __isl_take isl_dim *dim, unsigned pos)
2938 isl_basic_map *bmap;
2940 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2941 for (i = 0; i < pos; ++i)
2942 bmap = var_equal(bmap, i);
2943 bmap = var_more_or_equal(bmap, pos);
2944 return isl_basic_map_finalize(bmap);
2947 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
2948 unsigned n, int equal)
2950 struct isl_map *map;
2953 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
2955 for (i = 0; i + 1 < n; ++i)
2956 map = isl_map_add_basic_map(map,
2957 isl_basic_map_less_at(isl_dim_copy(dims), i));
2960 map = isl_map_add_basic_map(map,
2961 isl_basic_map_less_or_equal_at(dims, n - 1));
2963 map = isl_map_add_basic_map(map,
2964 isl_basic_map_less_at(dims, n - 1));
2971 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2975 return map_lex_lte_first(dims, dims->n_out, equal);
2978 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
2980 return map_lex_lte_first(dim, n, 0);
2983 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
2985 return map_lex_lte_first(dim, n, 1);
2988 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2990 return map_lex_lte(isl_dim_map(set_dim), 0);
2993 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2995 return map_lex_lte(isl_dim_map(set_dim), 1);
2998 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
2999 unsigned n, int equal)
3001 struct isl_map *map;
3004 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3006 for (i = 0; i + 1 < n; ++i)
3007 map = isl_map_add_basic_map(map,
3008 isl_basic_map_more_at(isl_dim_copy(dims), i));
3011 map = isl_map_add_basic_map(map,
3012 isl_basic_map_more_or_equal_at(dims, n - 1));
3014 map = isl_map_add_basic_map(map,
3015 isl_basic_map_more_at(dims, n - 1));
3022 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3026 return map_lex_gte_first(dims, dims->n_out, equal);
3029 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3031 return map_lex_gte_first(dim, n, 0);
3034 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3036 return map_lex_gte_first(dim, n, 1);
3039 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3041 return map_lex_gte(isl_dim_map(set_dim), 0);
3044 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3046 return map_lex_gte(isl_dim_map(set_dim), 1);
3049 struct isl_basic_map *isl_basic_map_from_basic_set(
3050 struct isl_basic_set *bset, struct isl_dim *dim)
3052 struct isl_basic_map *bmap;
3054 bset = isl_basic_set_cow(bset);
3058 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3059 isl_dim_free(bset->dim);
3060 bmap = (struct isl_basic_map *) bset;
3062 return isl_basic_map_finalize(bmap);
3064 isl_basic_set_free(bset);
3069 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3073 if (bmap->dim->n_in == 0)
3074 return (struct isl_basic_set *)bmap;
3075 bmap = isl_basic_map_cow(bmap);
3078 bmap->dim = isl_dim_cow(bmap->dim);
3081 bmap->dim->n_out += bmap->dim->n_in;
3082 bmap->dim->n_in = 0;
3083 bmap = isl_basic_map_finalize(bmap);
3084 return (struct isl_basic_set *)bmap;
3086 isl_basic_map_free(bmap);
3090 /* For a div d = floor(f/m), add the constraints
3093 * -(f-(n-1)) + m d >= 0
3095 * Note that the second constraint is the negation of
3099 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3100 unsigned pos, isl_int *div)
3103 unsigned total = isl_basic_map_total_dim(bmap);
3105 i = isl_basic_map_alloc_inequality(bmap);
3108 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3109 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3111 j = isl_basic_map_alloc_inequality(bmap);
3114 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3115 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3116 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3120 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3121 unsigned pos, isl_int *div)
3123 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3127 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3129 unsigned total = isl_basic_map_total_dim(bmap);
3130 unsigned div_pos = total - bmap->n_div + div;
3132 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3136 struct isl_basic_set *isl_basic_map_underlying_set(
3137 struct isl_basic_map *bmap)
3141 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
3142 return (struct isl_basic_set *)bmap;
3143 bmap = isl_basic_map_cow(bmap);
3146 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3149 bmap->extra -= bmap->n_div;
3151 bmap = isl_basic_map_finalize(bmap);
3152 return (struct isl_basic_set *)bmap;
3157 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3158 __isl_take isl_basic_set *bset)
3160 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3163 struct isl_basic_map *isl_basic_map_overlying_set(
3164 struct isl_basic_set *bset, struct isl_basic_map *like)
3166 struct isl_basic_map *bmap;
3167 struct isl_ctx *ctx;
3174 isl_assert(ctx, bset->n_div == 0, goto error);
3175 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3176 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3178 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3179 isl_basic_map_free(like);
3180 return (struct isl_basic_map *)bset;
3182 bset = isl_basic_set_cow(bset);
3185 total = bset->dim->n_out + bset->extra;
3186 bmap = (struct isl_basic_map *)bset;
3187 isl_dim_free(bmap->dim);
3188 bmap->dim = isl_dim_copy(like->dim);
3191 bmap->n_div = like->n_div;
3192 bmap->extra += like->n_div;
3195 ltotal = total - bmap->extra + like->extra;
3198 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3199 bmap->extra * (1 + 1 + total));
3200 if (isl_blk_is_error(bmap->block2))
3202 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3206 for (i = 0; i < bmap->extra; ++i)
3207 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3208 for (i = 0; i < like->n_div; ++i) {
3209 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3210 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3212 bmap = isl_basic_map_extend_constraints(bmap,
3213 0, 2 * like->n_div);
3214 for (i = 0; i < like->n_div; ++i) {
3215 if (isl_int_is_zero(bmap->div[i][0]))
3217 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3221 isl_basic_map_free(like);
3222 bmap = isl_basic_map_simplify(bmap);
3223 bmap = isl_basic_map_finalize(bmap);
3226 isl_basic_map_free(like);
3227 isl_basic_set_free(bset);
3231 struct isl_basic_set *isl_basic_set_from_underlying_set(
3232 struct isl_basic_set *bset, struct isl_basic_set *like)
3234 return (struct isl_basic_set *)
3235 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3238 struct isl_set *isl_set_from_underlying_set(
3239 struct isl_set *set, struct isl_basic_set *like)
3245 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3247 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3248 isl_basic_set_free(like);
3251 set = isl_set_cow(set);
3254 for (i = 0; i < set->n; ++i) {
3255 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3256 isl_basic_set_copy(like));
3260 isl_dim_free(set->dim);
3261 set->dim = isl_dim_copy(like->dim);
3264 isl_basic_set_free(like);
3267 isl_basic_set_free(like);
3272 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3276 map = isl_map_cow(map);
3279 map->dim = isl_dim_cow(map->dim);
3283 for (i = 1; i < map->n; ++i)
3284 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3286 for (i = 0; i < map->n; ++i) {
3287 map->p[i] = (struct isl_basic_map *)
3288 isl_basic_map_underlying_set(map->p[i]);
3293 map->dim = isl_dim_underlying(map->dim, 0);
3295 isl_dim_free(map->dim);
3296 map->dim = isl_dim_copy(map->p[0]->dim);
3300 return (struct isl_set *)map;
3306 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3308 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3311 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3313 struct isl_basic_set *domain;
3318 n_in = isl_basic_map_n_in(bmap);
3319 n_out = isl_basic_map_n_out(bmap);
3320 domain = isl_basic_set_from_basic_map(bmap);
3321 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3324 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3326 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3329 struct isl_set *isl_map_range(struct isl_map *map)
3332 struct isl_set *set;
3336 if (isl_map_dim(map, isl_dim_in) == 0)
3337 return (isl_set *)map;
3339 map = isl_map_cow(map);
3343 set = (struct isl_set *) map;
3344 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3347 for (i = 0; i < map->n; ++i) {
3348 set->p[i] = isl_basic_map_range(map->p[i]);
3352 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3353 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3360 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3363 struct isl_map *map = NULL;
3365 set = isl_set_cow(set);
3368 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3369 map = (struct isl_map *)set;
3370 for (i = 0; i < set->n; ++i) {
3371 map->p[i] = isl_basic_map_from_basic_set(
3372 set->p[i], isl_dim_copy(dim));
3376 isl_dim_free(map->dim);
3385 struct isl_map *isl_map_from_range(struct isl_set *set)
3387 return (struct isl_map *)set;
3390 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3392 return isl_map_reverse(isl_map_from_range(set));;
3395 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3396 __isl_take isl_set *range)
3398 return isl_map_product(isl_map_from_domain(domain),
3399 isl_map_from_range(range));
3402 struct isl_set *isl_set_from_map(struct isl_map *map)
3405 struct isl_set *set = NULL;
3409 map = isl_map_cow(map);
3412 map->dim = isl_dim_cow(map->dim);
3415 map->dim->n_out += map->dim->n_in;
3417 set = (struct isl_set *)map;
3418 for (i = 0; i < map->n; ++i) {
3419 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3429 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3431 struct isl_map *map;
3435 isl_assert(dim->ctx, n >= 0, return NULL);
3436 map = isl_alloc(dim->ctx, struct isl_map,
3437 sizeof(struct isl_map) +
3438 (n - 1) * sizeof(struct isl_basic_map *));
3442 map->ctx = dim->ctx;
3443 isl_ctx_ref(map->ctx);
3455 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3456 unsigned nparam, unsigned in, unsigned out, int n,
3459 struct isl_map *map;
3460 struct isl_dim *dims;
3462 dims = isl_dim_alloc(ctx, nparam, in, out);
3466 map = isl_map_alloc_dim(dims, n, flags);
3470 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3472 struct isl_basic_map *bmap;
3473 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3474 bmap = isl_basic_map_set_to_empty(bmap);
3478 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3480 struct isl_basic_set *bset;
3481 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3482 bset = isl_basic_set_set_to_empty(bset);
3486 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3488 struct isl_basic_map *bmap;
3491 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3492 bmap = isl_basic_map_set_to_empty(bmap);
3496 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3498 struct isl_basic_map *bmap;
3501 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3502 bmap = isl_basic_map_set_to_empty(bmap);
3506 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3508 struct isl_basic_set *bset;
3511 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3512 bset = isl_basic_set_set_to_empty(bset);
3516 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3518 struct isl_basic_map *bmap;
3519 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3523 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3525 struct isl_basic_set *bset;
3526 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3530 __isl_give isl_basic_map *isl_basic_map_universe_like(
3531 __isl_keep isl_basic_map *model)
3535 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3538 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3542 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3545 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3546 __isl_keep isl_set *model)
3550 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3553 struct isl_map *isl_map_empty(struct isl_dim *dim)
3555 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3558 struct isl_map *isl_map_empty_like(struct isl_map *model)
3562 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3565 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3569 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3572 struct isl_set *isl_set_empty(struct isl_dim *dim)
3574 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3577 struct isl_set *isl_set_empty_like(struct isl_set *model)
3581 return isl_set_empty(isl_dim_copy(model->dim));
3584 struct isl_map *isl_map_universe(struct isl_dim *dim)
3586 struct isl_map *map;
3589 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3590 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3594 struct isl_set *isl_set_universe(struct isl_dim *dim)
3596 struct isl_set *set;
3599 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3600 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3604 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3608 return isl_set_universe(isl_dim_copy(model->dim));
3611 struct isl_map *isl_map_dup(struct isl_map *map)
3614 struct isl_map *dup;
3618 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3619 for (i = 0; i < map->n; ++i)
3620 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3624 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3625 __isl_take isl_basic_map *bmap)
3629 if (isl_basic_map_fast_is_empty(bmap)) {
3630 isl_basic_map_free(bmap);
3633 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3634 isl_assert(map->ctx, map->n < map->size, goto error);
3635 map->p[map->n] = bmap;
3637 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3643 isl_basic_map_free(bmap);
3647 void isl_map_free(struct isl_map *map)
3657 isl_ctx_deref(map->ctx);
3658 for (i = 0; i < map->n; ++i)
3659 isl_basic_map_free(map->p[i]);
3660 isl_dim_free(map->dim);
3664 struct isl_map *isl_map_extend(struct isl_map *base,
3665 unsigned nparam, unsigned n_in, unsigned n_out)
3669 base = isl_map_cow(base);
3673 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3676 for (i = 0; i < base->n; ++i) {
3677 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3678 isl_dim_copy(base->dim), 0, 0, 0);
3688 struct isl_set *isl_set_extend(struct isl_set *base,
3689 unsigned nparam, unsigned dim)
3691 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3695 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3696 struct isl_basic_map *bmap, unsigned pos, int value)
3700 bmap = isl_basic_map_cow(bmap);
3701 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3702 j = isl_basic_map_alloc_equality(bmap);
3705 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3706 isl_int_set_si(bmap->eq[j][pos], -1);
3707 isl_int_set_si(bmap->eq[j][0], value);
3708 bmap = isl_basic_map_simplify(bmap);
3709 return isl_basic_map_finalize(bmap);
3711 isl_basic_map_free(bmap);
3715 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3716 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3720 bmap = isl_basic_map_cow(bmap);
3721 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3722 j = isl_basic_map_alloc_equality(bmap);
3725 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3726 isl_int_set_si(bmap->eq[j][pos], -1);
3727 isl_int_set(bmap->eq[j][0], value);
3728 bmap = isl_basic_map_simplify(bmap);
3729 return isl_basic_map_finalize(bmap);
3731 isl_basic_map_free(bmap);
3735 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3736 enum isl_dim_type type, unsigned pos, int value)
3740 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3741 return isl_basic_map_fix_pos_si(bmap,
3742 isl_basic_map_offset(bmap, type) + pos, value);
3744 isl_basic_map_free(bmap);
3748 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3749 enum isl_dim_type type, unsigned pos, isl_int value)
3753 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3754 return isl_basic_map_fix_pos(bmap,
3755 isl_basic_map_offset(bmap, type) + pos, value);
3757 isl_basic_map_free(bmap);
3761 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3762 enum isl_dim_type type, unsigned pos, int value)
3764 return (struct isl_basic_set *)
3765 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3769 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3770 enum isl_dim_type type, unsigned pos, isl_int value)
3772 return (struct isl_basic_set *)
3773 isl_basic_map_fix((struct isl_basic_map *)bset,
3777 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3778 unsigned input, int value)
3780 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3783 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3784 unsigned dim, int value)
3786 return (struct isl_basic_set *)
3787 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3788 isl_dim_set, dim, value);
3791 struct isl_map *isl_map_fix_si(struct isl_map *map,
3792 enum isl_dim_type type, unsigned pos, int value)
3796 map = isl_map_cow(map);
3800 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3801 for (i = 0; i < map->n; ++i) {
3802 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3806 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3813 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3814 enum isl_dim_type type, unsigned pos, int value)
3816 return (struct isl_set *)
3817 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3820 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3821 enum isl_dim_type type, unsigned pos, isl_int value)
3825 map = isl_map_cow(map);
3829 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3830 for (i = 0; i < map->n; ++i) {
3831 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3835 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3842 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3843 enum isl_dim_type type, unsigned pos, isl_int value)
3845 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3848 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3849 unsigned input, int value)
3851 return isl_map_fix_si(map, isl_dim_in, input, value);
3854 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3856 return (struct isl_set *)
3857 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3860 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3861 __isl_take isl_basic_map *bmap,
3862 enum isl_dim_type type, unsigned pos, int value)
3868 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3869 pos += isl_basic_map_offset(bmap, type);
3870 bmap = isl_basic_map_cow(bmap);
3871 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3872 j = isl_basic_map_alloc_inequality(bmap);
3875 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3876 isl_int_set_si(bmap->ineq[j][pos], 1);
3877 isl_int_set_si(bmap->ineq[j][0], -value);
3878 bmap = isl_basic_map_simplify(bmap);
3879 return isl_basic_map_finalize(bmap);
3881 isl_basic_map_free(bmap);
3885 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3886 unsigned dim, isl_int value)
3890 bset = isl_basic_set_cow(bset);
3891 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3892 j = isl_basic_set_alloc_inequality(bset);
3895 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3896 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3897 isl_int_neg(bset->ineq[j][0], value);
3898 bset = isl_basic_set_simplify(bset);
3899 return isl_basic_set_finalize(bset);
3901 isl_basic_set_free(bset);
3905 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3906 enum isl_dim_type type, unsigned pos, int value)
3910 map = isl_map_cow(map);
3914 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3915 for (i = 0; i < map->n; ++i) {
3916 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3921 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3928 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3929 enum isl_dim_type type, unsigned pos, int value)
3931 return (struct isl_set *)
3932 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3935 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3940 set = isl_set_cow(set);
3944 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3945 for (i = 0; i < set->n; ++i) {
3946 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3956 struct isl_map *isl_map_reverse(struct isl_map *map)
3960 map = isl_map_cow(map);
3964 map->dim = isl_dim_reverse(map->dim);
3967 for (i = 0; i < map->n; ++i) {
3968 map->p[i] = isl_basic_map_reverse(map->p[i]);
3972 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3979 static struct isl_map *isl_basic_map_partial_lexopt(
3980 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3981 struct isl_set **empty, int max)
3985 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3986 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3988 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3990 isl_basic_map_free(bmap);
3991 isl_basic_set_free(dom);
3997 struct isl_map *isl_basic_map_partial_lexmax(
3998 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3999 struct isl_set **empty)
4001 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4004 struct isl_map *isl_basic_map_partial_lexmin(
4005 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4006 struct isl_set **empty)
4008 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4011 struct isl_set *isl_basic_set_partial_lexmin(
4012 struct isl_basic_set *bset, struct isl_basic_set *dom,
4013 struct isl_set **empty)
4015 return (struct isl_set *)
4016 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4020 struct isl_set *isl_basic_set_partial_lexmax(
4021 struct isl_basic_set *bset, struct isl_basic_set *dom,
4022 struct isl_set **empty)
4024 return (struct isl_set *)
4025 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4029 /* Given a basic map "bmap", compute the lexicograhically minimal
4030 * (or maximal) image element for each domain element in dom.
4031 * Set *empty to those elements in dom that do not have an image element.
4033 * We first make sure the basic sets in dom are disjoint and then
4034 * simply collect the results over each of the basic sets separately.
4035 * We could probably improve the efficiency a bit by moving the union
4036 * domain down into the parametric integer programming.
4038 static __isl_give isl_map *basic_map_partial_lexopt(
4039 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4040 __isl_give isl_set **empty, int max)
4043 struct isl_map *res;
4045 dom = isl_set_make_disjoint(dom);
4049 if (isl_set_fast_is_empty(dom)) {
4050 res = isl_map_empty_like_basic_map(bmap);
4051 *empty = isl_set_empty_like(dom);
4053 isl_basic_map_free(bmap);
4057 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4058 isl_basic_set_copy(dom->p[0]), empty, max);
4060 for (i = 1; i < dom->n; ++i) {
4061 struct isl_map *res_i;
4062 struct isl_set *empty_i;
4064 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4065 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4067 res = isl_map_union_disjoint(res, res_i);
4068 *empty = isl_set_union_disjoint(*empty, empty_i);
4072 isl_basic_map_free(bmap);
4077 isl_basic_map_free(bmap);
4081 /* Given a map "map", compute the lexicograhically minimal
4082 * (or maximal) image element for each domain element in dom.
4083 * Set *empty to those elements in dom that do not have an image element.
4085 * We first compute the lexicographically minimal or maximal element
4086 * in the first basic map. This results in a partial solution "res"
4087 * and a subset "todo" of dom that still need to be handled.
4088 * We then consider each of the remaining maps in "map" and successively
4089 * improve both "res" and "todo".
4091 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4092 * Assume we are computing the lexicographical maximum.
4093 * We first intersect basic map i with a relation that maps elements
4094 * to elements that are lexicographically larger than the image elements
4095 * in res^k and the compute the maximum image element of this intersection.
4096 * The result ("better") corresponds to those image elements in basic map i
4097 * that are better than what we had before. The remainder ("keep") are the
4098 * domain elements for which the image element in res_k was better.
4099 * We also compute the lexicographical maximum of basic map i in todo^k.
4100 * res^i is the result of the operation + better + those elements in
4101 * res^k that we should keep
4102 * todo^i is the remainder of the maximum operation on todo^k.
4104 static __isl_give isl_map *isl_map_partial_lexopt(
4105 __isl_take isl_map *map, __isl_take isl_set *dom,
4106 __isl_give isl_set **empty, int max)
4109 struct isl_map *res;
4110 struct isl_set *todo;
4115 if (isl_map_fast_is_empty(map)) {
4123 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4124 isl_set_copy(dom), &todo, max);
4126 for (i = 1; i < map->n; ++i) {
4128 struct isl_map *better;
4129 struct isl_set *keep;
4130 struct isl_map *res_i;
4131 struct isl_set *todo_i;
4132 struct isl_dim *dim = isl_map_get_dim(res);
4134 dim = isl_dim_range(dim);
4136 lt = isl_map_lex_lt(dim);
4138 lt = isl_map_lex_gt(dim);
4139 lt = isl_map_apply_range(isl_map_copy(res), lt);
4140 lt = isl_map_intersect(lt,
4141 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4142 better = isl_map_partial_lexopt(lt,
4143 isl_map_domain(isl_map_copy(res)),
4146 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4147 todo, &todo_i, max);
4149 res = isl_map_intersect_domain(res, keep);
4150 res = isl_map_union_disjoint(res, res_i);
4151 res = isl_map_union_disjoint(res, better);
4172 __isl_give isl_map *isl_map_partial_lexmax(
4173 __isl_take isl_map *map, __isl_take isl_set *dom,
4174 __isl_give isl_set **empty)
4176 return isl_map_partial_lexopt(map, dom, empty, 1);
4179 __isl_give isl_map *isl_map_partial_lexmin(
4180 __isl_take isl_map *map, __isl_take isl_set *dom,
4181 __isl_give isl_set **empty)
4183 return isl_map_partial_lexopt(map, dom, empty, 0);
4186 __isl_give isl_set *isl_set_partial_lexmin(
4187 __isl_take isl_set *set, __isl_take isl_set *dom,
4188 __isl_give isl_set **empty)
4190 return (struct isl_set *)
4191 isl_map_partial_lexmin((struct isl_map *)set,
4195 __isl_give isl_set *isl_set_partial_lexmax(
4196 __isl_take isl_set *set, __isl_take isl_set *dom,
4197 __isl_give isl_set **empty)
4199 return (struct isl_set *)
4200 isl_map_partial_lexmax((struct isl_map *)set,
4204 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4206 struct isl_basic_set *dom = NULL;
4207 struct isl_dim *dom_dim;
4211 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4212 dom = isl_basic_set_universe(dom_dim);
4213 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4215 isl_basic_map_free(bmap);
4219 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4221 return isl_basic_map_lexopt(bmap, 0);
4224 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4226 return isl_basic_map_lexopt(bmap, 1);
4229 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4231 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4234 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4236 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4239 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4241 struct isl_set *dom = NULL;
4242 struct isl_dim *dom_dim;
4246 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4247 dom = isl_set_universe(dom_dim);
4248 return isl_map_partial_lexopt(map, dom, NULL, max);
4254 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4256 return isl_map_lexopt(map, 0);
4259 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4261 return isl_map_lexopt(map, 1);
4264 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4266 return (isl_set *)isl_map_lexmin((isl_map *)set);
4269 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4271 return (isl_set *)isl_map_lexmax((isl_map *)set);
4274 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4275 struct isl_dim *dim)
4282 for (i = 0; i < map->n; ++i) {
4283 isl_dim_free(map->p[i]->dim);
4284 map->p[i]->dim = isl_dim_copy(dim);
4286 isl_dim_free(map->dim);
4296 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4297 struct isl_dim *dim)
4299 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4302 /* Apply a preimage specified by "mat" on the parameters of "bset".
4303 * bset is assumed to have only parameters and divs.
4305 static struct isl_basic_set *basic_set_parameter_preimage(
4306 struct isl_basic_set *bset, struct isl_mat *mat)
4313 bset->dim = isl_dim_cow(bset->dim);
4317 nparam = isl_basic_set_dim(bset, isl_dim_param);
4319 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4321 bset->dim->nparam = 0;
4322 bset->dim->n_out = nparam;
4323 bset = isl_basic_set_preimage(bset, mat);
4325 bset->dim->nparam = bset->dim->n_out;
4326 bset->dim->n_out = 0;
4331 isl_basic_set_free(bset);
4335 /* Apply a preimage specified by "mat" on the parameters of "set".
4336 * set is assumed to have only parameters and divs.
4338 static struct isl_set *set_parameter_preimage(
4339 struct isl_set *set, struct isl_mat *mat)
4341 struct isl_dim *dim = NULL;
4347 dim = isl_dim_copy(set->dim);
4348 dim = isl_dim_cow(dim);
4352 nparam = isl_set_dim(set, isl_dim_param);
4354 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4357 dim->n_out = nparam;
4358 isl_set_reset_dim(set, dim);
4359 set = isl_set_preimage(set, mat);
4362 dim = isl_dim_copy(set->dim);
4363 dim = isl_dim_cow(dim);
4366 dim->nparam = dim->n_out;
4368 isl_set_reset_dim(set, dim);
4378 /* Intersect the basic set "bset" with the affine space specified by the
4379 * equalities in "eq".
4381 static struct isl_basic_set *basic_set_append_equalities(
4382 struct isl_basic_set *bset, struct isl_mat *eq)
4390 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4395 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4396 for (i = 0; i < eq->n_row; ++i) {
4397 k = isl_basic_set_alloc_equality(bset);
4400 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4401 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4405 bset = isl_basic_set_gauss(bset, NULL);
4406 bset = isl_basic_set_finalize(bset);
4411 isl_basic_set_free(bset);
4415 /* Intersect the set "set" with the affine space specified by the
4416 * equalities in "eq".
4418 static struct isl_set *set_append_equalities(struct isl_set *set,
4426 for (i = 0; i < set->n; ++i) {
4427 set->p[i] = basic_set_append_equalities(set->p[i],
4440 /* Project the given basic set onto its parameter domain, possibly introducing
4441 * new, explicit, existential variables in the constraints.
4442 * The input has parameters and (possibly implicit) existential variables.
4443 * The output has the same parameters, but only
4444 * explicit existentially quantified variables.
4446 * The actual projection is performed by pip, but pip doesn't seem
4447 * to like equalities very much, so we first remove the equalities
4448 * among the parameters by performing a variable compression on
4449 * the parameters. Afterward, an inverse transformation is performed
4450 * and the equalities among the parameters are inserted back in.
4452 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4456 struct isl_mat *T, *T2;
4457 struct isl_set *set;
4458 unsigned nparam, n_div;
4460 bset = isl_basic_set_cow(bset);
4464 if (bset->n_eq == 0)
4465 return isl_basic_set_lexmin(bset);
4467 isl_basic_set_gauss(bset, NULL);
4469 nparam = isl_basic_set_dim(bset, isl_dim_param);
4470 n_div = isl_basic_set_dim(bset, isl_dim_div);
4472 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4473 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4476 if (i == bset->n_eq)
4477 return isl_basic_set_lexmin(bset);
4479 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4481 eq = isl_mat_cow(eq);
4482 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4483 if (T && T->n_col == 0) {
4487 bset = isl_basic_set_set_to_empty(bset);
4488 return isl_set_from_basic_set(bset);
4490 bset = basic_set_parameter_preimage(bset, T);
4492 set = isl_basic_set_lexmin(bset);
4493 set = set_parameter_preimage(set, T2);
4494 set = set_append_equalities(set, eq);
4498 /* Compute an explicit representation for all the existentially
4499 * quantified variables.
4500 * The input and output dimensions are first turned into parameters.
4501 * compute_divs then returns a map with the same parameters and
4502 * no input or output dimensions and the dimension specification
4503 * is reset to that of the input.
4505 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4507 struct isl_basic_set *bset;
4508 struct isl_set *set;
4509 struct isl_map *map;
4510 struct isl_dim *dim, *orig_dim = NULL;
4515 bmap = isl_basic_map_cow(bmap);
4519 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4520 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4521 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4522 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4526 orig_dim = bmap->dim;
4528 bset = (struct isl_basic_set *)bmap;
4530 set = parameter_compute_divs(bset);
4531 map = (struct isl_map *)set;
4532 map = isl_map_reset_dim(map, orig_dim);
4536 isl_basic_map_free(bmap);
4540 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4548 off = isl_dim_total(bmap->dim);
4549 for (i = 0; i < bmap->n_div; ++i) {
4550 if (isl_int_is_zero(bmap->div[i][0]))
4552 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4558 static int map_divs_known(__isl_keep isl_map *map)
4565 for (i = 0; i < map->n; ++i) {
4566 int known = basic_map_divs_known(map->p[i]);
4574 /* If bmap contains any unknown divs, then compute explicit
4575 * expressions for them. However, this computation may be
4576 * quite expensive, so first try to remove divs that aren't
4579 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4583 struct isl_map *map;
4585 known = basic_map_divs_known(bmap);
4589 return isl_map_from_basic_map(bmap);
4591 bmap = isl_basic_map_drop_redundant_divs(bmap);
4593 known = basic_map_divs_known(bmap);
4597 return isl_map_from_basic_map(bmap);
4599 map = compute_divs(bmap);
4602 isl_basic_map_free(bmap);
4606 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4610 struct isl_map *res;
4617 known = map_divs_known(map);
4625 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4626 for (i = 1 ; i < map->n; ++i) {
4628 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4629 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4630 res = isl_map_union_disjoint(res, r2);
4632 res = isl_map_union(res, r2);
4639 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4641 return (struct isl_set *)
4642 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4645 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4647 return (struct isl_set *)
4648 isl_map_compute_divs((struct isl_map *)set);
4651 struct isl_set *isl_map_domain(struct isl_map *map)
4654 struct isl_set *set;
4659 map = isl_map_cow(map);
4663 set = (struct isl_set *)map;
4664 set->dim = isl_dim_domain(set->dim);
4667 for (i = 0; i < map->n; ++i) {
4668 set->p[i] = isl_basic_map_domain(map->p[i]);
4672 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4673 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4680 struct isl_map *isl_map_union_disjoint(
4681 struct isl_map *map1, struct isl_map *map2)
4685 struct isl_map *map = NULL;
4699 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4701 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4702 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4703 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4705 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4706 map1->n + map2->n, flags);
4709 for (i = 0; i < map1->n; ++i) {
4710 map = isl_map_add_basic_map(map,
4711 isl_basic_map_copy(map1->p[i]));
4715 for (i = 0; i < map2->n; ++i) {
4716 map = isl_map_add_basic_map(map,
4717 isl_basic_map_copy(map2->p[i]));
4731 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4733 map1 = isl_map_union_disjoint(map1, map2);
4737 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4741 struct isl_set *isl_set_union_disjoint(
4742 struct isl_set *set1, struct isl_set *set2)
4744 return (struct isl_set *)
4745 isl_map_union_disjoint(
4746 (struct isl_map *)set1, (struct isl_map *)set2);
4749 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4751 return (struct isl_set *)
4752 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4755 struct isl_map *isl_map_intersect_range(
4756 struct isl_map *map, struct isl_set *set)
4759 struct isl_map *result;
4765 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4766 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4767 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4769 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4770 map->n * set->n, flags);
4773 for (i = 0; i < map->n; ++i)
4774 for (j = 0; j < set->n; ++j) {
4775 result = isl_map_add_basic_map(result,
4776 isl_basic_map_intersect_range(
4777 isl_basic_map_copy(map->p[i]),
4778 isl_basic_set_copy(set->p[j])));
4791 struct isl_map *isl_map_intersect_domain(
4792 struct isl_map *map, struct isl_set *set)
4794 return isl_map_reverse(
4795 isl_map_intersect_range(isl_map_reverse(map), set));
4798 struct isl_map *isl_map_apply_domain(
4799 struct isl_map *map1, struct isl_map *map2)
4803 map1 = isl_map_reverse(map1);
4804 map1 = isl_map_apply_range(map1, map2);
4805 return isl_map_reverse(map1);
4812 struct isl_map *isl_map_apply_range(
4813 struct isl_map *map1, struct isl_map *map2)
4815 struct isl_dim *dim_result;
4816 struct isl_map *result;
4822 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4823 isl_dim_copy(map2->dim));
4825 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4828 for (i = 0; i < map1->n; ++i)
4829 for (j = 0; j < map2->n; ++j) {
4830 result = isl_map_add_basic_map(result,
4831 isl_basic_map_apply_range(
4832 isl_basic_map_copy(map1->p[i]),
4833 isl_basic_map_copy(map2->p[j])));
4839 if (result && result->n <= 1)
4840 ISL_F_SET(result, ISL_MAP_DISJOINT);
4849 * returns range - domain
4851 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4854 struct isl_basic_set *bset;
4861 dim = isl_basic_map_n_in(bmap);
4862 nparam = isl_basic_map_n_param(bmap);
4863 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4864 bset = isl_basic_set_from_basic_map(bmap);
4865 bset = isl_basic_set_cow(bset);
4866 dims = isl_basic_set_get_dim(bset);
4867 dims = isl_dim_add(dims, isl_dim_set, dim);
4868 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
4869 bset = isl_basic_set_swap_vars(bset, 2*dim);
4870 for (i = 0; i < dim; ++i) {
4871 int j = isl_basic_map_alloc_equality(
4872 (struct isl_basic_map *)bset);
4875 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4876 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4877 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4878 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4880 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4882 isl_basic_map_free(bmap);
4887 * returns range - domain
4889 struct isl_set *isl_map_deltas(struct isl_map *map)
4893 struct isl_set *result;
4898 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4899 dim = isl_map_get_dim(map);
4900 dim = isl_dim_domain(dim);
4901 result = isl_set_alloc_dim(dim, map->n, map->flags);
4904 for (i = 0; i < map->n; ++i)
4905 result = isl_set_add_basic_set(result,
4906 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4914 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4916 struct isl_basic_map *bmap;
4924 nparam = dims->nparam;
4926 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4930 for (i = 0; i < dim; ++i) {
4931 int j = isl_basic_map_alloc_equality(bmap);
4934 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4935 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4936 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4938 return isl_basic_map_finalize(bmap);
4940 isl_basic_map_free(bmap);
4944 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4946 struct isl_dim *dim = isl_dim_map(set_dim);
4949 return basic_map_identity(dim);
4952 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4954 if (!model || !model->dim)
4956 isl_assert(model->ctx,
4957 model->dim->n_in == model->dim->n_out, return NULL);
4958 return basic_map_identity(isl_dim_copy(model->dim));
4961 static struct isl_map *map_identity(struct isl_dim *dim)
4963 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4964 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4967 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4969 struct isl_dim *dim = isl_dim_map(set_dim);
4972 return map_identity(dim);
4975 struct isl_map *isl_map_identity_like(struct isl_map *model)
4977 if (!model || !model->dim)
4979 isl_assert(model->ctx,
4980 model->dim->n_in == model->dim->n_out, return NULL);
4981 return map_identity(isl_dim_copy(model->dim));
4984 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4986 if (!model || !model->dim)
4988 isl_assert(model->ctx,
4989 model->dim->n_in == model->dim->n_out, return NULL);
4990 return map_identity(isl_dim_copy(model->dim));
4993 /* Construct a basic set with all set dimensions having only non-negative
4996 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5001 struct isl_basic_set *bset;
5005 nparam = dims->nparam;
5007 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5010 for (i = 0; i < dim; ++i) {
5011 int k = isl_basic_set_alloc_inequality(bset);
5014 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5015 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5019 isl_basic_set_free(bset);
5023 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5024 enum isl_dim_type type, unsigned first, unsigned n)
5027 isl_basic_set *nonneg = NULL;
5028 isl_basic_set *neg = NULL;
5035 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5037 for (i = 0; i < n; ++i) {
5041 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5042 k = isl_basic_set_alloc_inequality(nonneg);
5045 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5046 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5048 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5049 k = isl_basic_set_alloc_inequality(neg);
5052 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5053 isl_int_set_si(neg->ineq[k][0], -1);
5054 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5056 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5061 isl_basic_set_free(nonneg);
5062 isl_basic_set_free(neg);
5067 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5069 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5072 int isl_basic_map_is_subset(
5073 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5076 struct isl_map *map1;
5077 struct isl_map *map2;
5079 if (!bmap1 || !bmap2)
5082 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5083 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5085 is_subset = isl_map_is_subset(map1, map2);
5093 int isl_basic_map_is_equal(
5094 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5098 if (!bmap1 || !bmap2)
5100 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5103 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5107 int isl_basic_set_is_equal(
5108 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5110 return isl_basic_map_is_equal(
5111 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5114 int isl_map_is_empty(struct isl_map *map)
5121 for (i = 0; i < map->n; ++i) {
5122 is_empty = isl_basic_map_is_empty(map->p[i]);
5131 int isl_map_fast_is_empty(struct isl_map *map)
5136 int isl_set_fast_is_empty(struct isl_set *set)
5141 int isl_set_is_empty(struct isl_set *set)
5143 return isl_map_is_empty((struct isl_map *)set);
5146 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5152 is_subset = isl_map_is_subset(map1, map2);
5155 is_subset = isl_map_is_subset(map2, map1);
5159 int isl_basic_map_is_strict_subset(
5160 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5164 if (!bmap1 || !bmap2)
5166 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5169 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5170 if (is_subset == -1)
5175 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5181 is_subset = isl_map_is_subset(map1, map2);
5184 is_subset = isl_map_is_subset(map2, map1);
5185 if (is_subset == -1)
5190 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5192 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5195 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5199 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5202 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5206 return bset->n_eq == 0 && bset->n_ineq == 0;
5209 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5214 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
5217 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5219 return isl_map_fast_is_universe((isl_map *) set);
5222 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5224 struct isl_basic_set *bset = NULL;
5225 struct isl_vec *sample = NULL;
5232 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5235 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5236 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5237 copy = isl_basic_map_convex_hull(copy);
5238 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5239 isl_basic_map_free(copy);
5243 total = 1 + isl_basic_map_total_dim(bmap);
5244 if (bmap->sample && bmap->sample->size == total) {
5245 int contains = isl_basic_map_contains(bmap, bmap->sample);
5251 isl_vec_free(bmap->sample);
5252 bmap->sample = NULL;
5253 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5256 sample = isl_basic_set_sample_vec(bset);
5259 empty = sample->size == 0;
5260 isl_vec_free(bmap->sample);
5261 bmap->sample = sample;
5263 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5268 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5272 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5275 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5279 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5282 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5284 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5287 struct isl_map *isl_basic_map_union(
5288 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5290 struct isl_map *map;
5291 if (!bmap1 || !bmap2)
5294 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5296 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5299 map = isl_map_add_basic_map(map, bmap1);
5300 map = isl_map_add_basic_map(map, bmap2);
5303 isl_basic_map_free(bmap1);
5304 isl_basic_map_free(bmap2);
5308 struct isl_set *isl_basic_set_union(
5309 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5311 return (struct isl_set *)isl_basic_map_union(
5312 (struct isl_basic_map *)bset1,
5313 (struct isl_basic_map *)bset2);
5316 /* Order divs such that any div only depends on previous divs */
5317 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5320 unsigned off = isl_dim_total(bmap->dim);
5322 for (i = 0; i < bmap->n_div; ++i) {
5324 if (isl_int_is_zero(bmap->div[i][0]))
5326 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5330 isl_basic_map_swap_div(bmap, i, i + pos);
5336 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5338 return (struct isl_basic_set *)
5339 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5342 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5349 for (i = 0; i < map->n; ++i) {
5350 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5361 /* Look for a div in dst that corresponds to the div "div" in src.
5362 * The divs before "div" in src and dst are assumed to be the same.
5364 * Returns -1 if no corresponding div was found and the position
5365 * of the corresponding div in dst otherwise.
5367 static int find_div(struct isl_basic_map *dst,
5368 struct isl_basic_map *src, unsigned div)
5372 unsigned total = isl_dim_total(src->dim);
5374 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5375 for (i = div; i < dst->n_div; ++i)
5376 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5377 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5378 dst->n_div - div) == -1)
5383 struct isl_basic_map *isl_basic_map_align_divs(
5384 struct isl_basic_map *dst, struct isl_basic_map *src)
5387 unsigned total = isl_dim_total(src->dim);
5392 if (src->n_div == 0)
5395 for (i = 0; i < src->n_div; ++i)
5396 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5398 src = isl_basic_map_order_divs(src);
5399 dst = isl_basic_map_cow(dst);
5400 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5401 src->n_div, 0, 2 * src->n_div);
5404 for (i = 0; i < src->n_div; ++i) {
5405 int j = find_div(dst, src, i);
5407 j = isl_basic_map_alloc_div(dst);
5410 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5411 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5412 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5416 isl_basic_map_swap_div(dst, i, j);
5420 isl_basic_map_free(dst);
5424 struct isl_basic_set *isl_basic_set_align_divs(
5425 struct isl_basic_set *dst, struct isl_basic_set *src)
5427 return (struct isl_basic_set *)isl_basic_map_align_divs(
5428 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5431 struct isl_map *isl_map_align_divs(struct isl_map *map)
5439 map = isl_map_compute_divs(map);
5440 map = isl_map_cow(map);
5444 for (i = 1; i < map->n; ++i)
5445 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5446 for (i = 1; i < map->n; ++i)
5447 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5449 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5453 struct isl_set *isl_set_align_divs(struct isl_set *set)
5455 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5458 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5462 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5463 map = isl_map_intersect_domain(map, set);
5464 set = isl_map_range(map);
5472 /* There is no need to cow as removing empty parts doesn't change
5473 * the meaning of the set.
5475 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5482 for (i = map->n-1; i >= 0; --i) {
5483 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5485 isl_basic_map_free(map->p[i]);
5486 if (i != map->n-1) {
5487 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5488 map->p[i] = map->p[map->n-1];
5496 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5498 return (struct isl_set *)
5499 isl_map_remove_empty_parts((struct isl_map *)set);
5502 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5504 struct isl_basic_map *bmap;
5505 if (!map || map->n == 0)
5507 bmap = map->p[map->n-1];
5508 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5509 return isl_basic_map_copy(bmap);
5512 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5514 return (struct isl_basic_set *)
5515 isl_map_copy_basic_map((struct isl_map *)set);
5518 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5519 __isl_keep isl_basic_map *bmap)
5525 for (i = map->n-1; i >= 0; --i) {
5526 if (map->p[i] != bmap)
5528 map = isl_map_cow(map);
5531 isl_basic_map_free(map->p[i]);
5532 if (i != map->n-1) {
5533 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5534 map->p[i] = map->p[map->n-1];
5545 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5546 struct isl_basic_set *bset)
5548 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5549 (struct isl_basic_map *)bset);
5552 /* Given two basic sets bset1 and bset2, compute the maximal difference
5553 * between the values of dimension pos in bset1 and those in bset2
5554 * for any common value of the parameters and dimensions preceding pos.
5556 static enum isl_lp_result basic_set_maximal_difference_at(
5557 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5558 int pos, isl_int *opt)
5560 struct isl_dim *dims;
5561 struct isl_basic_map *bmap1 = NULL;
5562 struct isl_basic_map *bmap2 = NULL;
5563 struct isl_ctx *ctx;
5564 struct isl_vec *obj;
5567 unsigned dim1, dim2;
5568 enum isl_lp_result res;
5570 if (!bset1 || !bset2)
5571 return isl_lp_error;
5573 nparam = isl_basic_set_n_param(bset1);
5574 dim1 = isl_basic_set_n_dim(bset1);
5575 dim2 = isl_basic_set_n_dim(bset2);
5576 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5577 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5578 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5579 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5580 if (!bmap1 || !bmap2)
5582 bmap1 = isl_basic_map_cow(bmap1);
5583 bmap1 = isl_basic_map_extend(bmap1, nparam,
5584 pos, (dim1 - pos) + (dim2 - pos),
5585 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5586 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5589 total = isl_basic_map_total_dim(bmap1);
5591 obj = isl_vec_alloc(ctx, 1 + total);
5592 isl_seq_clr(obj->block.data, 1 + total);
5593 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5594 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5597 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5599 isl_basic_map_free(bmap1);
5603 isl_basic_map_free(bmap1);
5604 isl_basic_map_free(bmap2);
5605 return isl_lp_error;
5608 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5609 * for any common value of the parameters and dimensions preceding pos
5610 * in both basic sets, the values of dimension pos in bset1 are
5611 * smaller or larger than those in bset2.
5614 * 1 if bset1 follows bset2
5615 * -1 if bset1 precedes bset2
5616 * 0 if bset1 and bset2 are incomparable
5617 * -2 if some error occurred.
5619 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5620 struct isl_basic_set *bset2, int pos)
5623 enum isl_lp_result res;
5628 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5630 if (res == isl_lp_empty)
5632 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5633 res == isl_lp_unbounded)
5635 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5644 /* Given two basic sets bset1 and bset2, check whether
5645 * for any common value of the parameters and dimensions preceding pos
5646 * there is a value of dimension pos in bset1 that is larger
5647 * than a value of the same dimension in bset2.
5650 * 1 if there exists such a pair
5651 * 0 if there is no such pair, but there is a pair of equal values
5653 * -2 if some error occurred.
5655 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5656 __isl_keep isl_basic_set *bset2, int pos)
5659 enum isl_lp_result res;
5664 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5666 if (res == isl_lp_empty)
5668 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5669 res == isl_lp_unbounded)
5671 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5673 else if (res == isl_lp_ok)
5682 /* Given two sets set1 and set2, check whether
5683 * for any common value of the parameters and dimensions preceding pos
5684 * there is a value of dimension pos in set1 that is larger
5685 * than a value of the same dimension in set2.
5688 * 1 if there exists such a pair
5689 * 0 if there is no such pair, but there is a pair of equal values
5691 * -2 if some error occurred.
5693 int isl_set_follows_at(__isl_keep isl_set *set1,
5694 __isl_keep isl_set *set2, int pos)
5702 for (i = 0; i < set1->n; ++i)
5703 for (j = 0; j < set2->n; ++j) {
5705 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5706 if (f == 1 || f == -2)
5715 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5716 unsigned pos, isl_int *val)
5724 total = isl_basic_map_total_dim(bmap);
5725 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5726 for (; d+1 > pos; --d)
5727 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5731 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5733 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5735 if (!isl_int_is_one(bmap->eq[i][1+d]))
5738 isl_int_neg(*val, bmap->eq[i][0]);
5744 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5745 unsigned pos, isl_int *val)
5757 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5760 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5761 for (i = 1; fixed == 1 && i < map->n; ++i) {
5762 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5763 if (fixed == 1 && isl_int_ne(tmp, v))
5767 isl_int_set(*val, v);
5773 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5774 unsigned pos, isl_int *val)
5776 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5780 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5783 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5786 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5787 enum isl_dim_type type, unsigned pos, isl_int *val)
5789 if (pos >= isl_basic_map_dim(bmap, type))
5791 return isl_basic_map_fast_has_fixed_var(bmap,
5792 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5795 int isl_map_fast_is_fixed(struct isl_map *map,
5796 enum isl_dim_type type, unsigned pos, isl_int *val)
5798 if (pos >= isl_map_dim(map, type))
5800 return isl_map_fast_has_fixed_var(map,
5801 map_offset(map, type) - 1 + pos, val);
5804 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5805 * then return this fixed value in *val.
5807 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5810 return isl_basic_set_fast_has_fixed_var(bset,
5811 isl_basic_set_n_param(bset) + dim, val);
5814 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5815 * then return this fixed value in *val.
5817 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5819 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5822 /* Check if input variable in has fixed value and if so and if val is not NULL,
5823 * then return this fixed value in *val.
5825 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5827 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5830 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5831 * and if val is not NULL, then return this lower bound in *val.
5833 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5834 unsigned dim, isl_int *val)
5836 int i, i_eq = -1, i_ineq = -1;
5843 total = isl_basic_set_total_dim(bset);
5844 nparam = isl_basic_set_n_param(bset);
5845 for (i = 0; i < bset->n_eq; ++i) {
5846 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5852 for (i = 0; i < bset->n_ineq; ++i) {
5853 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5855 if (i_eq != -1 || i_ineq != -1)
5859 if (i_eq == -1 && i_ineq == -1)
5861 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5862 /* The coefficient should always be one due to normalization. */
5863 if (!isl_int_is_one(c[1+nparam+dim]))
5865 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5867 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5868 total - nparam - dim - 1) != -1)
5871 isl_int_neg(*val, c[0]);
5875 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5876 unsigned dim, isl_int *val)
5888 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5892 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5894 for (i = 1; fixed == 1 && i < set->n; ++i) {
5895 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5897 if (fixed == 1 && isl_int_ne(tmp, v))
5901 isl_int_set(*val, v);
5912 static int qsort_constraint_cmp(const void *p1, const void *p2)
5914 const struct constraint *c1 = (const struct constraint *)p1;
5915 const struct constraint *c2 = (const struct constraint *)p2;
5916 unsigned size = isl_min(c1->size, c2->size);
5917 return isl_seq_cmp(c1->c, c2->c, size);
5920 static struct isl_basic_map *isl_basic_map_sort_constraints(
5921 struct isl_basic_map *bmap)
5924 struct constraint *c;
5929 total = isl_basic_map_total_dim(bmap);
5930 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5933 for (i = 0; i < bmap->n_ineq; ++i) {
5935 c[i].c = bmap->ineq[i];
5937 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5938 for (i = 0; i < bmap->n_ineq; ++i)
5939 bmap->ineq[i] = c[i].c;
5943 isl_basic_map_free(bmap);
5947 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5951 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5953 bmap = isl_basic_map_convex_hull(bmap);
5954 bmap = isl_basic_map_sort_constraints(bmap);
5955 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5959 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5961 return (struct isl_basic_set *)isl_basic_map_normalize(
5962 (struct isl_basic_map *)bset);
5965 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5966 const struct isl_basic_map *bmap2)
5973 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5974 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5975 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5976 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5977 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5978 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5979 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5980 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5982 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5984 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5986 if (bmap1->n_eq != bmap2->n_eq)
5987 return bmap1->n_eq - bmap2->n_eq;
5988 if (bmap1->n_ineq != bmap2->n_ineq)
5989 return bmap1->n_ineq - bmap2->n_ineq;
5990 if (bmap1->n_div != bmap2->n_div)
5991 return bmap1->n_div - bmap2->n_div;
5992 total = isl_basic_map_total_dim(bmap1);
5993 for (i = 0; i < bmap1->n_eq; ++i) {
5994 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5998 for (i = 0; i < bmap1->n_ineq; ++i) {
5999 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6003 for (i = 0; i < bmap1->n_div; ++i) {
6004 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6011 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
6012 struct isl_basic_map *bmap2)
6014 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6017 static int qsort_bmap_cmp(const void *p1, const void *p2)
6019 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6020 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6022 return isl_basic_map_fast_cmp(bmap1, bmap2);
6025 /* We normalize in place, but if anything goes wrong we need
6026 * to return NULL, so we need to make sure we don't change the
6027 * meaning of any possible other copies of map.
6029 struct isl_map *isl_map_normalize(struct isl_map *map)
6032 struct isl_basic_map *bmap;
6036 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6038 for (i = 0; i < map->n; ++i) {
6039 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6042 isl_basic_map_free(map->p[i]);
6045 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6046 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6047 map = isl_map_remove_empty_parts(map);
6050 for (i = map->n - 1; i >= 1; --i) {
6051 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6053 isl_basic_map_free(map->p[i-1]);
6054 for (j = i; j < map->n; ++j)
6055 map->p[j-1] = map->p[j];
6065 struct isl_set *isl_set_normalize(struct isl_set *set)
6067 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6070 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6080 if (!isl_dim_equal(map1->dim, map2->dim))
6083 map1 = isl_map_copy(map1);
6084 map2 = isl_map_copy(map2);
6085 map1 = isl_map_normalize(map1);
6086 map2 = isl_map_normalize(map2);
6089 equal = map1->n == map2->n;
6090 for (i = 0; equal && i < map1->n; ++i) {
6091 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6104 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6106 return isl_map_fast_is_equal((struct isl_map *)set1,
6107 (struct isl_map *)set2);
6110 /* Return an interval that ranges from min to max (inclusive)
6112 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6113 isl_int min, isl_int max)
6116 struct isl_basic_set *bset = NULL;
6118 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6122 k = isl_basic_set_alloc_inequality(bset);
6125 isl_int_set_si(bset->ineq[k][1], 1);
6126 isl_int_neg(bset->ineq[k][0], min);
6128 k = isl_basic_set_alloc_inequality(bset);
6131 isl_int_set_si(bset->ineq[k][1], -1);
6132 isl_int_set(bset->ineq[k][0], max);
6136 isl_basic_set_free(bset);
6140 /* Return the Cartesian product of the basic sets in list (in the given order).
6142 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6150 struct isl_basic_set *product = NULL;
6154 isl_assert(list->ctx, list->n > 0, goto error);
6155 isl_assert(list->ctx, list->p[0], goto error);
6156 nparam = isl_basic_set_n_param(list->p[0]);
6157 dim = isl_basic_set_n_dim(list->p[0]);
6158 extra = list->p[0]->n_div;
6159 n_eq = list->p[0]->n_eq;
6160 n_ineq = list->p[0]->n_ineq;
6161 for (i = 1; i < list->n; ++i) {
6162 isl_assert(list->ctx, list->p[i], goto error);
6163 isl_assert(list->ctx,
6164 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6165 dim += isl_basic_set_n_dim(list->p[i]);
6166 extra += list->p[i]->n_div;
6167 n_eq += list->p[i]->n_eq;
6168 n_ineq += list->p[i]->n_ineq;
6170 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6175 for (i = 0; i < list->n; ++i) {
6176 isl_basic_set_add_constraints(product,
6177 isl_basic_set_copy(list->p[i]), dim);
6178 dim += isl_basic_set_n_dim(list->p[i]);
6180 isl_basic_set_list_free(list);
6183 isl_basic_set_free(product);
6184 isl_basic_set_list_free(list);
6188 struct isl_basic_map *isl_basic_map_product(
6189 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6191 struct isl_dim *dim_result = NULL;
6192 struct isl_basic_map *bmap;
6193 unsigned in1, in2, out1, out2, nparam, total, pos;
6194 struct isl_dim_map *dim_map1, *dim_map2;
6196 if (!bmap1 || !bmap2)
6199 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6200 bmap2->dim, isl_dim_param), goto error);
6201 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6202 isl_dim_copy(bmap2->dim));
6204 in1 = isl_basic_map_n_in(bmap1);
6205 in2 = isl_basic_map_n_in(bmap2);
6206 out1 = isl_basic_map_n_out(bmap1);
6207 out2 = isl_basic_map_n_out(bmap2);
6208 nparam = isl_basic_map_n_param(bmap1);
6210 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6211 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6212 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6213 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6214 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6215 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6216 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6217 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6218 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6219 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6220 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6222 bmap = isl_basic_map_alloc_dim(dim_result,
6223 bmap1->n_div + bmap2->n_div,
6224 bmap1->n_eq + bmap2->n_eq,
6225 bmap1->n_ineq + bmap2->n_ineq);
6226 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6227 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6228 bmap = isl_basic_map_simplify(bmap);
6229 return isl_basic_map_finalize(bmap);
6231 isl_basic_map_free(bmap1);
6232 isl_basic_map_free(bmap2);
6236 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6238 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6241 struct isl_map *result;
6247 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6248 map2->dim, isl_dim_param), goto error);
6250 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6251 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6252 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6254 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6255 isl_dim_copy(map2->dim)),
6256 map1->n * map2->n, flags);
6259 for (i = 0; i < map1->n; ++i)
6260 for (j = 0; j < map2->n; ++j) {
6261 struct isl_basic_map *part;
6262 part = isl_basic_map_product(
6263 isl_basic_map_copy(map1->p[i]),
6264 isl_basic_map_copy(map2->p[j]));
6265 if (isl_basic_map_is_empty(part))
6266 isl_basic_map_free(part);
6268 result = isl_map_add_basic_map(result, part);
6281 /* Given two set A and B, construct its Cartesian product A x B.
6283 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6285 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6286 (struct isl_map *)set2);
6289 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6292 uint32_t hash = isl_hash_init();
6297 bset = isl_basic_set_copy(bset);
6298 bset = isl_basic_set_normalize(bset);
6301 total = isl_basic_set_total_dim(bset);
6302 isl_hash_byte(hash, bset->n_eq & 0xFF);
6303 for (i = 0; i < bset->n_eq; ++i) {
6305 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6306 isl_hash_hash(hash, c_hash);
6308 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6309 for (i = 0; i < bset->n_ineq; ++i) {
6311 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6312 isl_hash_hash(hash, c_hash);
6314 isl_hash_byte(hash, bset->n_div & 0xFF);
6315 for (i = 0; i < bset->n_div; ++i) {
6317 if (isl_int_is_zero(bset->div[i][0]))
6319 isl_hash_byte(hash, i & 0xFF);
6320 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6321 isl_hash_hash(hash, c_hash);
6323 isl_basic_set_free(bset);
6327 uint32_t isl_set_get_hash(struct isl_set *set)
6334 set = isl_set_copy(set);
6335 set = isl_set_normalize(set);
6339 hash = isl_hash_init();
6340 for (i = 0; i < set->n; ++i) {
6342 bset_hash = isl_basic_set_get_hash(set->p[i]);
6343 isl_hash_hash(hash, bset_hash);
6351 /* Check if the value for dimension dim is completely determined
6352 * by the values of the other parameters and variables.
6353 * That is, check if dimension dim is involved in an equality.
6355 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6362 nparam = isl_basic_set_n_param(bset);
6363 for (i = 0; i < bset->n_eq; ++i)
6364 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6369 /* Check if the value for dimension dim is completely determined
6370 * by the values of the other parameters and variables.
6371 * That is, check if dimension dim is involved in an equality
6372 * for each of the subsets.
6374 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6380 for (i = 0; i < set->n; ++i) {
6382 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6389 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6390 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6397 for (i = 0; i < map->n; ++i)
6398 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6404 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6405 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6412 for (i = 0; i < set->n; ++i)
6413 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6419 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6421 struct isl_dim *dim;
6426 if (bset->n_div == 0)
6429 bset = isl_basic_set_cow(bset);
6433 dim = isl_basic_set_get_dim(bset);
6434 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6437 isl_dim_free(bset->dim);
6443 isl_basic_set_free(bset);
6447 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6450 struct isl_dim *dim;
6453 set = isl_set_align_divs(set);
6457 if (set->n == 0 || set->p[0]->n_div == 0)
6460 set = isl_set_cow(set);
6464 n_div = set->p[0]->n_div;
6465 dim = isl_set_get_dim(set);
6466 dim = isl_dim_add(dim, isl_dim_set, n_div);
6469 isl_dim_free(set->dim);
6472 for (i = 0; i < set->n; ++i) {
6473 set->p[i] = isl_basic_set_lift(set->p[i]);
6484 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6486 struct isl_dim *dim;
6487 struct isl_basic_map *bmap;
6494 set = isl_set_align_divs(set);
6499 dim = isl_set_get_dim(set);
6500 if (set->n == 0 || set->p[0]->n_div == 0) {
6502 return isl_map_identity(dim);
6505 n_div = set->p[0]->n_div;
6506 dim = isl_dim_map(dim);
6507 n_param = isl_dim_size(dim, isl_dim_param);
6508 n_set = isl_dim_size(dim, isl_dim_in);
6509 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6510 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6511 for (i = 0; i < n_set; ++i)
6512 bmap = var_equal(bmap, i);
6514 total = n_param + n_set + n_set + n_div;
6515 for (i = 0; i < n_div; ++i) {
6516 k = isl_basic_map_alloc_inequality(bmap);
6519 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6520 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6521 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6522 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6523 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6524 set->p[0]->div[i][0]);
6526 l = isl_basic_map_alloc_inequality(bmap);
6529 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6530 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6531 set->p[0]->div[i][0]);
6532 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6536 return isl_map_from_basic_map(bmap);
6539 isl_basic_map_free(bmap);
6543 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6551 dim = isl_basic_set_total_dim(bset);
6552 size += bset->n_eq * (1 + dim);
6553 size += bset->n_ineq * (1 + dim);
6554 size += bset->n_div * (2 + dim);
6559 int isl_set_size(__isl_keep isl_set *set)
6567 for (i = 0; i < set->n; ++i)
6568 size += isl_basic_set_size(set->p[i]);
6573 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6574 enum isl_dim_type type, unsigned pos)
6582 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6584 pos += isl_basic_map_offset(bmap, type);
6586 for (i = 0; i < bmap->n_eq; ++i)
6587 if (!isl_int_is_zero(bmap->eq[i][pos]))
6591 for (i = 0; i < bmap->n_ineq; ++i) {
6592 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6599 return lower && upper;
6602 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6603 enum isl_dim_type type, unsigned pos)
6610 for (i = 0; i < map->n; ++i) {
6612 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6613 if (bounded < 0 || !bounded)
6620 /* Return 1 if the specified dim is involved in both an upper bound
6621 * and a lower bound.
6623 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6624 enum isl_dim_type type, unsigned pos)
6626 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6629 /* For each of the "n" variables starting at "first", determine
6630 * the sign of the variable and put the results in the first "n"
6631 * elements of the array "signs".
6633 * 1 means that the variable is non-negative
6634 * -1 means that the variable is non-positive
6635 * 0 means the variable attains both positive and negative values.
6637 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6638 unsigned first, unsigned n, int *signs)
6640 isl_vec *bound = NULL;
6641 struct isl_tab *tab = NULL;
6642 struct isl_tab_undo *snap;
6645 if (!bset || !signs)
6648 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6649 tab = isl_tab_from_basic_set(bset);
6653 isl_seq_clr(bound->el, bound->size);
6654 isl_int_set_si(bound->el[0], -1);
6656 snap = isl_tab_snap(tab);
6657 for (i = 0; i < n; ++i) {
6660 isl_int_set_si(bound->el[1 + first + i], -1);
6661 if (isl_tab_add_ineq(tab, bound->el) < 0)
6664 isl_int_set_si(bound->el[1 + first + i], 0);
6665 if (isl_tab_rollback(tab, snap) < 0)
6673 isl_int_set_si(bound->el[1 + first + i], 1);
6674 if (isl_tab_add_ineq(tab, bound->el) < 0)
6677 isl_int_set_si(bound->el[1 + first + i], 0);
6678 if (isl_tab_rollback(tab, snap) < 0)
6681 signs[i] = empty ? -1 : 0;
6685 isl_vec_free(bound);
6689 isl_vec_free(bound);
6693 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
6694 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
6696 if (!bset || !signs)
6698 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
6701 first += pos(bset->dim, type) - 1;
6702 return isl_basic_set_vars_get_sign(bset, first, n, signs);