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 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 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1183 unsigned first, unsigned n)
1193 set = isl_set_cow(set);
1196 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1197 nparam = isl_set_n_param(set);
1199 for (i = 0; i < set->n; ++i) {
1200 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1211 /* Project out n dimensions starting at first using Fourier-Motzkin */
1212 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1213 unsigned first, unsigned n)
1215 set = isl_set_eliminate_dims(set, first, n);
1216 set = isl_set_drop_dims(set, first, n);
1220 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1222 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1230 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1239 set = isl_set_cow(set);
1243 for (i = 0; i < set->n; ++i) {
1244 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1254 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1255 enum isl_dim_type type, unsigned first, unsigned n)
1259 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1263 bmap = isl_basic_map_eliminate_vars(bmap,
1264 isl_basic_map_offset(bmap, type) - 1 + first, n);
1267 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1269 bmap = isl_basic_map_drop(bmap, type, first, n);
1272 isl_basic_map_free(bmap);
1276 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1277 enum isl_dim_type type, unsigned first, unsigned n)
1279 return (isl_basic_set *)
1280 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1283 struct isl_map *isl_map_remove(struct isl_map *map,
1284 enum isl_dim_type type, unsigned first, unsigned n)
1291 map = isl_map_cow(map);
1294 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1296 for (i = 0; i < map->n; ++i) {
1297 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1298 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1302 map = isl_map_drop(map, type, first, n);
1309 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1310 enum isl_dim_type type, unsigned first, unsigned n)
1312 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1315 /* Project out n inputs starting at first using Fourier-Motzkin */
1316 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1317 unsigned first, unsigned n)
1319 return isl_map_remove(map, isl_dim_in, first, n);
1322 /* Project out n dimensions starting at first using Fourier-Motzkin */
1323 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1324 unsigned first, unsigned n)
1326 unsigned nparam = isl_basic_set_n_param(bset);
1327 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1328 bset = isl_basic_set_drop_dims(bset, first, n);
1332 static void dump_term(struct isl_basic_map *bmap,
1333 isl_int c, int pos, FILE *out)
1336 unsigned in = isl_basic_map_n_in(bmap);
1337 unsigned dim = in + isl_basic_map_n_out(bmap);
1338 unsigned nparam = isl_basic_map_n_param(bmap);
1340 isl_int_print(out, c, 0);
1342 if (!isl_int_is_one(c))
1343 isl_int_print(out, c, 0);
1344 if (pos < 1 + nparam) {
1345 name = isl_dim_get_name(bmap->dim,
1346 isl_dim_param, pos - 1);
1348 fprintf(out, "%s", name);
1350 fprintf(out, "p%d", pos - 1);
1351 } else if (pos < 1 + nparam + in)
1352 fprintf(out, "i%d", pos - 1 - nparam);
1353 else if (pos < 1 + nparam + dim)
1354 fprintf(out, "o%d", pos - 1 - nparam - in);
1356 fprintf(out, "e%d", pos - 1 - nparam - dim);
1360 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1361 int sign, FILE *out)
1365 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1369 for (i = 0, first = 1; i < len; ++i) {
1370 if (isl_int_sgn(c[i]) * sign <= 0)
1373 fprintf(out, " + ");
1375 isl_int_abs(v, c[i]);
1376 dump_term(bmap, v, i, out);
1383 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1384 const char *op, FILE *out, int indent)
1388 fprintf(out, "%*s", indent, "");
1390 dump_constraint_sign(bmap, c, 1, out);
1391 fprintf(out, " %s ", op);
1392 dump_constraint_sign(bmap, c, -1, out);
1396 for (i = bmap->n_div; i < bmap->extra; ++i) {
1397 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1399 fprintf(out, "%*s", indent, "");
1400 fprintf(out, "ERROR: unused div coefficient not zero\n");
1405 static void dump_constraints(struct isl_basic_map *bmap,
1406 isl_int **c, unsigned n,
1407 const char *op, FILE *out, int indent)
1411 for (i = 0; i < n; ++i)
1412 dump_constraint(bmap, c[i], op, out, indent);
1415 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1419 unsigned total = isl_basic_map_total_dim(bmap);
1421 for (j = 0; j < 1 + total; ++j) {
1422 if (isl_int_is_zero(exp[j]))
1424 if (!first && isl_int_is_pos(exp[j]))
1426 dump_term(bmap, exp[j], j, out);
1431 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1435 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1436 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1438 for (i = 0; i < bmap->n_div; ++i) {
1439 fprintf(out, "%*s", indent, "");
1440 fprintf(out, "e%d = [(", i);
1441 dump_affine(bmap, bmap->div[i]+1, out);
1443 isl_int_print(out, bmap->div[i][0], 0);
1444 fprintf(out, "]\n");
1448 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1451 fprintf(out, "null basic set\n");
1455 fprintf(out, "%*s", indent, "");
1456 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1457 bset->ref, bset->dim->nparam, bset->dim->n_out,
1458 bset->extra, bset->flags);
1459 dump((struct isl_basic_map *)bset, out, indent);
1462 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1465 fprintf(out, "null basic map\n");
1469 fprintf(out, "%*s", indent, "");
1470 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1471 "flags: %x, n_name: %d\n",
1473 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1474 bmap->extra, bmap->flags, bmap->dim->n_name);
1475 dump(bmap, out, indent);
1478 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1483 total = isl_basic_map_total_dim(bmap);
1484 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1485 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1486 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1487 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1491 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1493 struct isl_set *set;
1497 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1498 isl_assert(dim->ctx, n >= 0, return NULL);
1499 set = isl_alloc(dim->ctx, struct isl_set,
1500 sizeof(struct isl_set) +
1501 (n - 1) * sizeof(struct isl_basic_set *));
1505 set->ctx = dim->ctx;
1506 isl_ctx_ref(set->ctx);
1518 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1519 unsigned nparam, unsigned dim, int n, unsigned flags)
1521 struct isl_set *set;
1522 struct isl_dim *dims;
1524 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1528 set = isl_set_alloc_dim(dims, n, flags);
1532 /* Make sure "map" has room for at least "n" more basic maps.
1534 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1537 struct isl_map *grown = NULL;
1541 isl_assert(map->ctx, n >= 0, goto error);
1542 if (map->n + n <= map->size)
1544 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1547 for (i = 0; i < map->n; ++i) {
1548 grown->p[i] = isl_basic_map_copy(map->p[i]);
1556 isl_map_free(grown);
1561 /* Make sure "set" has room for at least "n" more basic sets.
1563 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1565 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1568 struct isl_set *isl_set_dup(struct isl_set *set)
1571 struct isl_set *dup;
1576 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1579 for (i = 0; i < set->n; ++i)
1580 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1584 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1586 struct isl_set *set;
1591 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1593 isl_basic_set_free(bset);
1596 return isl_set_add_basic_set(set, bset);
1599 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1601 struct isl_map *map;
1606 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1608 isl_basic_map_free(bmap);
1611 return isl_map_add_basic_map(map, bmap);
1614 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1615 __isl_take isl_basic_set *bset)
1617 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1618 (struct isl_basic_map *)bset);
1621 void isl_set_free(struct isl_set *set)
1631 isl_ctx_deref(set->ctx);
1632 for (i = 0; i < set->n; ++i)
1633 isl_basic_set_free(set->p[i]);
1634 isl_dim_free(set->dim);
1638 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1643 fprintf(out, "null set\n");
1647 fprintf(out, "%*s", indent, "");
1648 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1649 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1651 for (i = 0; i < set->n; ++i) {
1652 fprintf(out, "%*s", indent, "");
1653 fprintf(out, "basic set %d:\n", i);
1654 isl_basic_set_dump(set->p[i], out, indent+4);
1658 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1663 fprintf(out, "null map\n");
1667 fprintf(out, "%*s", indent, "");
1668 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1669 "flags: %x, n_name: %d\n",
1670 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1671 map->dim->n_out, map->flags, map->dim->n_name);
1672 for (i = 0; i < map->n; ++i) {
1673 fprintf(out, "%*s", indent, "");
1674 fprintf(out, "basic map %d:\n", i);
1675 isl_basic_map_dump(map->p[i], out, indent+4);
1679 struct isl_basic_map *isl_basic_map_intersect_domain(
1680 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1682 struct isl_basic_map *bmap_domain;
1683 struct isl_dim *dim;
1688 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1689 bset->dim, isl_dim_param), goto error);
1691 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1692 isl_assert(bset->ctx,
1693 isl_basic_map_compatible_domain(bmap, bset), goto error);
1695 bmap = isl_basic_map_cow(bmap);
1696 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1697 bset->n_div, bset->n_eq, bset->n_ineq);
1700 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1701 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1702 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1704 bmap = isl_basic_map_simplify(bmap);
1705 return isl_basic_map_finalize(bmap);
1707 isl_basic_map_free(bmap);
1708 isl_basic_set_free(bset);
1712 struct isl_basic_map *isl_basic_map_intersect_range(
1713 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1715 struct isl_basic_map *bmap_range;
1720 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1721 bset->dim, isl_dim_param), goto error);
1723 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1724 isl_assert(bset->ctx,
1725 isl_basic_map_compatible_range(bmap, bset), goto error);
1727 bmap = isl_basic_map_cow(bmap);
1728 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1729 bset->n_div, bset->n_eq, bset->n_ineq);
1732 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1733 bmap = add_constraints(bmap, bmap_range, 0, 0);
1735 bmap = isl_basic_map_simplify(bmap);
1736 return isl_basic_map_finalize(bmap);
1738 isl_basic_map_free(bmap);
1739 isl_basic_set_free(bset);
1743 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1749 total = 1 + isl_basic_map_total_dim(bmap);
1750 if (total != vec->size)
1755 for (i = 0; i < bmap->n_eq; ++i) {
1756 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1757 if (!isl_int_is_zero(s)) {
1763 for (i = 0; i < bmap->n_ineq; ++i) {
1764 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1765 if (isl_int_is_neg(s)) {
1776 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1778 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1781 struct isl_basic_map *isl_basic_map_intersect(
1782 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1784 struct isl_vec *sample = NULL;
1786 if (!bmap1 || !bmap2)
1789 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1790 bmap2->dim, isl_dim_param), goto error);
1791 if (isl_dim_total(bmap1->dim) ==
1792 isl_dim_size(bmap1->dim, isl_dim_param) &&
1793 isl_dim_total(bmap2->dim) !=
1794 isl_dim_size(bmap2->dim, isl_dim_param))
1795 return isl_basic_map_intersect(bmap2, bmap1);
1797 if (isl_dim_total(bmap2->dim) !=
1798 isl_dim_size(bmap2->dim, isl_dim_param))
1799 isl_assert(bmap1->ctx,
1800 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1802 if (bmap1->sample &&
1803 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1804 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1805 sample = isl_vec_copy(bmap1->sample);
1806 else if (bmap2->sample &&
1807 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1808 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1809 sample = isl_vec_copy(bmap2->sample);
1811 bmap1 = isl_basic_map_cow(bmap1);
1812 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1813 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1816 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1819 isl_vec_free(bmap1->sample);
1820 bmap1->sample = sample;
1823 bmap1 = isl_basic_map_simplify(bmap1);
1824 return isl_basic_map_finalize(bmap1);
1827 isl_vec_free(sample);
1828 isl_basic_map_free(bmap1);
1829 isl_basic_map_free(bmap2);
1833 struct isl_basic_set *isl_basic_set_intersect(
1834 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1836 return (struct isl_basic_set *)
1837 isl_basic_map_intersect(
1838 (struct isl_basic_map *)bset1,
1839 (struct isl_basic_map *)bset2);
1842 /* Special case of isl_map_intersect, where both map1 and map2
1843 * are convex, without any divs and such that either map1 or map2
1844 * contains a single constraint. This constraint is then simply
1845 * added to the other map.
1847 static __isl_give isl_map *map_intersect_add_constraint(
1848 __isl_take isl_map *map1, __isl_take isl_map *map2)
1850 struct isl_basic_map *bmap1;
1851 struct isl_basic_map *bmap2;
1853 isl_assert(map1->ctx, map1->n == 1, goto error);
1854 isl_assert(map2->ctx, map1->n == 1, goto error);
1855 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1856 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1858 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1859 return isl_map_intersect(map2, map1);
1861 isl_assert(map2->ctx,
1862 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1864 map1 = isl_map_cow(map1);
1867 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1868 if (map2->p[0]->n_eq == 1)
1869 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1871 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1872 map2->p[0]->ineq[0]);
1874 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1875 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1888 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1891 struct isl_map *result;
1897 if (map1->n == 1 && map2->n == 1 &&
1898 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1899 isl_dim_equal(map1->dim, map2->dim) &&
1900 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1901 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1902 return map_intersect_add_constraint(map1, map2);
1903 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1904 map2->dim, isl_dim_param), goto error);
1905 if (isl_dim_total(map1->dim) ==
1906 isl_dim_size(map1->dim, isl_dim_param) &&
1907 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1908 return isl_map_intersect(map2, map1);
1910 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1911 isl_assert(map1->ctx,
1912 isl_dim_equal(map1->dim, map2->dim), goto error);
1914 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1915 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1916 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1918 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1919 map1->n * map2->n, flags);
1922 for (i = 0; i < map1->n; ++i)
1923 for (j = 0; j < map2->n; ++j) {
1924 struct isl_basic_map *part;
1925 part = isl_basic_map_intersect(
1926 isl_basic_map_copy(map1->p[i]),
1927 isl_basic_map_copy(map2->p[j]));
1928 if (isl_basic_map_is_empty(part))
1929 isl_basic_map_free(part);
1931 result = isl_map_add_basic_map(result, part);
1944 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1946 return (struct isl_set *)
1947 isl_map_intersect((struct isl_map *)set1,
1948 (struct isl_map *)set2);
1951 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1953 struct isl_dim *dim;
1954 struct isl_basic_set *bset;
1959 bmap = isl_basic_map_cow(bmap);
1962 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1963 in = isl_basic_map_n_in(bmap);
1964 bset = isl_basic_set_from_basic_map(bmap);
1965 bset = isl_basic_set_swap_vars(bset, in);
1966 return isl_basic_map_from_basic_set(bset, dim);
1969 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
1970 enum isl_dim_type type, unsigned n)
1972 struct isl_dim *res_dim;
1973 struct isl_basic_map *res;
1974 struct isl_dim_map *dim_map;
1975 unsigned total, pos;
1983 res_dim = isl_dim_add(isl_basic_map_get_dim(bmap), type, n);
1985 total = isl_basic_map_total_dim(bmap) + n;
1986 dim_map = isl_dim_map_alloc(bmap->ctx, total);
1988 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos);
1989 pos += isl_dim_size(res_dim, isl_dim_param);
1990 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos);
1991 pos += isl_dim_size(res_dim, isl_dim_in);
1992 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos);
1993 pos += isl_dim_size(res_dim, isl_dim_out);
1994 isl_dim_map_div(dim_map, bmap, pos);
1996 res = isl_basic_map_alloc_dim(res_dim,
1997 bmap->n_div, bmap->n_eq, bmap->n_ineq);
1998 res = add_constraints_dim_map(res, bmap, dim_map);
1999 res = isl_basic_map_simplify(res);
2000 return isl_basic_map_finalize(res);
2003 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2004 enum isl_dim_type type, unsigned n)
2008 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2009 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2011 isl_basic_set_free(bset);
2015 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2016 enum isl_dim_type type, unsigned n)
2023 map = isl_map_cow(map);
2027 map->dim = isl_dim_add(map->dim, type, n);
2031 for (i = 0; i < map->n; ++i) {
2032 map->p[i] = isl_basic_map_add(map->p[i], type, n);
2043 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2044 enum isl_dim_type type, unsigned n)
2048 isl_assert(set->ctx, type != isl_dim_in, goto error);
2049 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2055 /* Move the specified dimensions to the last columns right before
2056 * the divs. Don't change the dimension specification of bmap.
2057 * That's the responsibility of the caller.
2059 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2060 enum isl_dim_type type, unsigned first, unsigned n)
2062 struct isl_dim_map *dim_map;
2063 struct isl_basic_map *res;
2064 enum isl_dim_type t;
2065 unsigned total, off;
2069 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2072 total = isl_basic_map_total_dim(bmap);
2073 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2076 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2077 unsigned size = isl_dim_size(bmap->dim, t);
2079 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2082 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2083 first, n, total - bmap->n_div - n);
2084 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2085 first + n, size - (first + n), off);
2086 off += size - (first + n);
2088 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2092 isl_dim_map_div(dim_map, bmap, off + n);
2094 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2095 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2096 res = add_constraints_dim_map(res, bmap, dim_map);
2100 /* Turn the n dimensions of type type, starting at first
2101 * into existentially quantified variables.
2103 __isl_give isl_basic_map *isl_basic_map_project_out(
2104 __isl_take isl_basic_map *bmap,
2105 enum isl_dim_type type, unsigned first, unsigned n)
2118 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2119 return isl_basic_map_remove(bmap, type, first, n);
2121 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2124 bmap = move_last(bmap, type, first, n);
2125 bmap = isl_basic_map_cow(bmap);
2127 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2128 old = bmap->block2.data;
2129 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2130 (bmap->extra + n) * (1 + row_size));
2131 if (!bmap->block2.data)
2133 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2136 for (i = 0; i < n; ++i) {
2137 new_div[i] = bmap->block2.data +
2138 (bmap->extra + i) * (1 + row_size);
2139 isl_seq_clr(new_div[i], 1 + row_size);
2141 for (i = 0; i < bmap->extra; ++i)
2142 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2144 bmap->div = new_div;
2148 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2151 bmap = isl_basic_map_simplify(bmap);
2152 bmap = isl_basic_map_drop_redundant_divs(bmap);
2153 return isl_basic_map_finalize(bmap);
2155 isl_basic_map_free(bmap);
2159 /* Turn the n dimensions of type type, starting at first
2160 * into existentially quantified variables.
2162 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2163 enum isl_dim_type type, unsigned first, unsigned n)
2165 return (isl_basic_set *)isl_basic_map_project_out(
2166 (isl_basic_map *)bset, type, first, n);
2169 /* Turn the n dimensions of type type, starting at first
2170 * into existentially quantified variables.
2172 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2173 enum isl_dim_type type, unsigned first, unsigned n)
2183 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2185 map = isl_map_cow(map);
2189 map->dim = isl_dim_drop(map->dim, type, first, n);
2193 for (i = 0; i < map->n; ++i) {
2194 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2205 /* Turn the n dimensions of type type, starting at first
2206 * into existentially quantified variables.
2208 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2209 enum isl_dim_type type, unsigned first, unsigned n)
2211 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2214 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2218 for (i = 0; i < n; ++i) {
2219 j = isl_basic_map_alloc_div(bmap);
2222 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2226 isl_basic_map_free(bmap);
2230 struct isl_basic_map *isl_basic_map_apply_range(
2231 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2233 struct isl_dim *dim_result = NULL;
2234 struct isl_basic_map *bmap;
2235 unsigned n_in, n_out, n, nparam, total, pos;
2236 struct isl_dim_map *dim_map1, *dim_map2;
2238 if (!bmap1 || !bmap2)
2241 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2242 isl_dim_copy(bmap2->dim));
2244 n_in = isl_basic_map_n_in(bmap1);
2245 n_out = isl_basic_map_n_out(bmap2);
2246 n = isl_basic_map_n_out(bmap1);
2247 nparam = isl_basic_map_n_param(bmap1);
2249 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2250 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2251 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2252 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2253 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2254 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2255 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2256 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2257 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2258 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2259 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2261 bmap = isl_basic_map_alloc_dim(dim_result,
2262 bmap1->n_div + bmap2->n_div + n,
2263 bmap1->n_eq + bmap2->n_eq,
2264 bmap1->n_ineq + bmap2->n_ineq);
2265 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2266 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2267 bmap = add_divs(bmap, n);
2268 bmap = isl_basic_map_simplify(bmap);
2269 bmap = isl_basic_map_drop_redundant_divs(bmap);
2270 return isl_basic_map_finalize(bmap);
2272 isl_basic_map_free(bmap1);
2273 isl_basic_map_free(bmap2);
2277 struct isl_basic_set *isl_basic_set_apply(
2278 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2283 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2286 return (struct isl_basic_set *)
2287 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2289 isl_basic_set_free(bset);
2290 isl_basic_map_free(bmap);
2294 struct isl_basic_map *isl_basic_map_apply_domain(
2295 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2297 if (!bmap1 || !bmap2)
2300 isl_assert(bmap1->ctx,
2301 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2302 isl_assert(bmap1->ctx,
2303 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2306 bmap1 = isl_basic_map_reverse(bmap1);
2307 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2308 return isl_basic_map_reverse(bmap1);
2310 isl_basic_map_free(bmap1);
2311 isl_basic_map_free(bmap2);
2315 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2316 * A \cap B -> f(A) + f(B)
2318 struct isl_basic_map *isl_basic_map_sum(
2319 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2321 unsigned n_in, n_out, nparam, total, pos;
2322 struct isl_basic_map *bmap = NULL;
2323 struct isl_dim_map *dim_map1, *dim_map2;
2326 if (!bmap1 || !bmap2)
2329 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2332 nparam = isl_basic_map_n_param(bmap1);
2333 n_in = isl_basic_map_n_in(bmap1);
2334 n_out = isl_basic_map_n_out(bmap1);
2336 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2337 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2338 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2339 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2340 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2341 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2342 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2343 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2344 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2345 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2346 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2348 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2349 bmap1->n_div + bmap2->n_div + 2 * n_out,
2350 bmap1->n_eq + bmap2->n_eq + n_out,
2351 bmap1->n_ineq + bmap2->n_ineq);
2352 for (i = 0; i < n_out; ++i) {
2353 int j = isl_basic_map_alloc_equality(bmap);
2356 isl_seq_clr(bmap->eq[j], 1+total);
2357 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2358 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2359 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2361 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2362 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2363 bmap = add_divs(bmap, 2 * n_out);
2365 bmap = isl_basic_map_simplify(bmap);
2366 return isl_basic_map_finalize(bmap);
2368 isl_basic_map_free(bmap);
2369 isl_basic_map_free(bmap1);
2370 isl_basic_map_free(bmap2);
2374 /* Given two maps A -> f(A) and B -> g(B), construct a map
2375 * A \cap B -> f(A) + f(B)
2377 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2379 struct isl_map *result;
2385 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2387 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2388 map1->n * map2->n, 0);
2391 for (i = 0; i < map1->n; ++i)
2392 for (j = 0; j < map2->n; ++j) {
2393 struct isl_basic_map *part;
2394 part = isl_basic_map_sum(
2395 isl_basic_map_copy(map1->p[i]),
2396 isl_basic_map_copy(map2->p[j]));
2397 if (isl_basic_map_is_empty(part))
2398 isl_basic_map_free(part);
2400 result = isl_map_add_basic_map(result, part);
2413 /* Given a basic map A -> f(A), construct A -> -f(A).
2415 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2420 bmap = isl_basic_map_cow(bmap);
2424 n = isl_basic_map_dim(bmap, isl_dim_out);
2425 off = isl_basic_map_offset(bmap, isl_dim_out);
2426 for (i = 0; i < bmap->n_eq; ++i)
2427 for (j = 0; j < n; ++j)
2428 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2429 for (i = 0; i < bmap->n_ineq; ++i)
2430 for (j = 0; j < n; ++j)
2431 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2432 for (i = 0; i < bmap->n_div; ++i)
2433 for (j = 0; j < n; ++j)
2434 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2435 return isl_basic_map_finalize(bmap);
2438 /* Given a map A -> f(A), construct A -> -f(A).
2440 struct isl_map *isl_map_neg(struct isl_map *map)
2444 map = isl_map_cow(map);
2448 for (i = 0; i < map->n; ++i) {
2449 map->p[i] = isl_basic_map_neg(map->p[i]);
2460 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2461 * A -> floor(f(A)/d).
2463 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2466 unsigned n_in, n_out, nparam, total, pos;
2467 struct isl_basic_map *result = NULL;
2468 struct isl_dim_map *dim_map;
2474 nparam = isl_basic_map_n_param(bmap);
2475 n_in = isl_basic_map_n_in(bmap);
2476 n_out = isl_basic_map_n_out(bmap);
2478 total = nparam + n_in + n_out + bmap->n_div + n_out;
2479 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2480 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2481 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2482 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2483 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2485 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2486 bmap->n_div + n_out,
2487 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2488 result = add_constraints_dim_map(result, bmap, dim_map);
2489 result = add_divs(result, n_out);
2490 for (i = 0; i < n_out; ++i) {
2492 j = isl_basic_map_alloc_inequality(result);
2495 isl_seq_clr(result->ineq[j], 1+total);
2496 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2497 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2498 j = isl_basic_map_alloc_inequality(result);
2501 isl_seq_clr(result->ineq[j], 1+total);
2502 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2503 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2504 isl_int_sub_ui(result->ineq[j][0], d, 1);
2507 result = isl_basic_map_simplify(result);
2508 return isl_basic_map_finalize(result);
2510 isl_basic_map_free(result);
2514 /* Given a map A -> f(A) and an integer d, construct a map
2515 * A -> floor(f(A)/d).
2517 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2521 map = isl_map_cow(map);
2525 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2526 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2527 for (i = 0; i < map->n; ++i) {
2528 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2539 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2545 i = isl_basic_map_alloc_equality(bmap);
2548 nparam = isl_basic_map_n_param(bmap);
2549 n_in = isl_basic_map_n_in(bmap);
2550 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2551 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2552 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2553 return isl_basic_map_finalize(bmap);
2555 isl_basic_map_free(bmap);
2559 /* Add a constraints to "bmap" expressing i_pos < o_pos
2561 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2567 i = isl_basic_map_alloc_inequality(bmap);
2570 nparam = isl_basic_map_n_param(bmap);
2571 n_in = isl_basic_map_n_in(bmap);
2572 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2573 isl_int_set_si(bmap->ineq[i][0], -1);
2574 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2575 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2576 return isl_basic_map_finalize(bmap);
2578 isl_basic_map_free(bmap);
2582 /* Add a constraints to "bmap" expressing i_pos > o_pos
2584 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2590 i = isl_basic_map_alloc_inequality(bmap);
2593 nparam = isl_basic_map_n_param(bmap);
2594 n_in = isl_basic_map_n_in(bmap);
2595 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2596 isl_int_set_si(bmap->ineq[i][0], -1);
2597 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2598 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2599 return isl_basic_map_finalize(bmap);
2601 isl_basic_map_free(bmap);
2605 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2608 struct isl_basic_map *bmap;
2609 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2612 for (i = 0; i < n_equal && bmap; ++i)
2613 bmap = var_equal(bmap, i);
2614 return isl_basic_map_finalize(bmap);
2617 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2619 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2622 struct isl_basic_map *bmap;
2623 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2626 for (i = 0; i < pos && bmap; ++i)
2627 bmap = var_equal(bmap, i);
2629 bmap = var_less(bmap, pos);
2630 return isl_basic_map_finalize(bmap);
2633 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2635 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2638 struct isl_basic_map *bmap;
2639 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2642 for (i = 0; i < pos && bmap; ++i)
2643 bmap = var_equal(bmap, i);
2645 bmap = var_more(bmap, pos);
2646 return isl_basic_map_finalize(bmap);
2649 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2651 struct isl_map *map;
2658 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2660 for (i = 0; i < dim; ++i)
2661 map = isl_map_add_basic_map(map,
2662 isl_basic_map_less_at(isl_dim_copy(dims), i));
2664 map = isl_map_add_basic_map(map,
2665 isl_basic_map_equal(isl_dim_copy(dims), dim));
2671 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2673 return map_lex_lte(isl_dim_map(set_dim), 0);
2676 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2678 return map_lex_lte(isl_dim_map(set_dim), 1);
2681 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2683 struct isl_map *map;
2690 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2692 for (i = 0; i < dim; ++i)
2693 map = isl_map_add_basic_map(map,
2694 isl_basic_map_more_at(isl_dim_copy(dims), i));
2696 map = isl_map_add_basic_map(map,
2697 isl_basic_map_equal(isl_dim_copy(dims), dim));
2703 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2705 return map_lex_gte(isl_dim_map(set_dim), 0);
2708 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2710 return map_lex_gte(isl_dim_map(set_dim), 1);
2713 struct isl_basic_map *isl_basic_map_from_basic_set(
2714 struct isl_basic_set *bset, struct isl_dim *dim)
2716 struct isl_basic_map *bmap;
2718 bset = isl_basic_set_cow(bset);
2722 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2723 isl_dim_free(bset->dim);
2724 bmap = (struct isl_basic_map *) bset;
2726 return isl_basic_map_finalize(bmap);
2728 isl_basic_set_free(bset);
2733 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2737 if (bmap->dim->n_in == 0)
2738 return (struct isl_basic_set *)bmap;
2739 bmap = isl_basic_map_cow(bmap);
2742 bmap->dim = isl_dim_cow(bmap->dim);
2745 bmap->dim->n_out += bmap->dim->n_in;
2746 bmap->dim->n_in = 0;
2747 bmap = isl_basic_map_finalize(bmap);
2748 return (struct isl_basic_set *)bmap;
2750 isl_basic_map_free(bmap);
2754 /* For a div d = floor(f/m), add the constraints
2757 * -(f-(n-1)) + m d >= 0
2759 * Note that the second constraint is the negation of
2763 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2766 unsigned total = isl_basic_map_total_dim(bmap);
2767 unsigned div_pos = 1 + total - bmap->n_div + div;
2769 i = isl_basic_map_alloc_inequality(bmap);
2772 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2773 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2775 j = isl_basic_map_alloc_inequality(bmap);
2778 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2779 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2780 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2784 struct isl_basic_set *isl_basic_map_underlying_set(
2785 struct isl_basic_map *bmap)
2789 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2790 return (struct isl_basic_set *)bmap;
2791 bmap = isl_basic_map_cow(bmap);
2794 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2797 bmap->extra -= bmap->n_div;
2799 bmap = isl_basic_map_finalize(bmap);
2800 return (struct isl_basic_set *)bmap;
2805 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2806 __isl_take isl_basic_set *bset)
2808 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2811 struct isl_basic_map *isl_basic_map_overlying_set(
2812 struct isl_basic_set *bset, struct isl_basic_map *like)
2814 struct isl_basic_map *bmap;
2815 struct isl_ctx *ctx;
2822 isl_assert(ctx, bset->n_div == 0, goto error);
2823 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2824 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2826 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2827 isl_basic_map_free(like);
2828 return (struct isl_basic_map *)bset;
2830 bset = isl_basic_set_cow(bset);
2833 total = bset->dim->n_out + bset->extra;
2834 bmap = (struct isl_basic_map *)bset;
2835 isl_dim_free(bmap->dim);
2836 bmap->dim = isl_dim_copy(like->dim);
2839 bmap->n_div = like->n_div;
2840 bmap->extra += like->n_div;
2843 ltotal = total - bmap->extra + like->extra;
2846 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2847 bmap->extra * (1 + 1 + total));
2848 if (isl_blk_is_error(bmap->block2))
2850 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2854 for (i = 0; i < bmap->extra; ++i)
2855 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2856 for (i = 0; i < like->n_div; ++i) {
2857 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2858 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2860 bmap = isl_basic_map_extend_constraints(bmap,
2861 0, 2 * like->n_div);
2862 for (i = 0; i < like->n_div; ++i) {
2863 if (isl_int_is_zero(bmap->div[i][0]))
2865 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
2869 isl_basic_map_free(like);
2870 bmap = isl_basic_map_simplify(bmap);
2871 bmap = isl_basic_map_finalize(bmap);
2874 isl_basic_map_free(like);
2875 isl_basic_set_free(bset);
2879 struct isl_basic_set *isl_basic_set_from_underlying_set(
2880 struct isl_basic_set *bset, struct isl_basic_set *like)
2882 return (struct isl_basic_set *)
2883 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2886 struct isl_set *isl_set_from_underlying_set(
2887 struct isl_set *set, struct isl_basic_set *like)
2893 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2895 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2896 isl_basic_set_free(like);
2899 set = isl_set_cow(set);
2902 for (i = 0; i < set->n; ++i) {
2903 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
2904 isl_basic_set_copy(like));
2908 isl_dim_free(set->dim);
2909 set->dim = isl_dim_copy(like->dim);
2912 isl_basic_set_free(like);
2915 isl_basic_set_free(like);
2920 struct isl_set *isl_map_underlying_set(struct isl_map *map)
2924 map = isl_map_cow(map);
2927 map->dim = isl_dim_cow(map->dim);
2931 for (i = 1; i < map->n; ++i)
2932 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
2934 for (i = 0; i < map->n; ++i) {
2935 map->p[i] = (struct isl_basic_map *)
2936 isl_basic_map_underlying_set(map->p[i]);
2941 map->dim = isl_dim_underlying(map->dim, 0);
2943 isl_dim_free(map->dim);
2944 map->dim = isl_dim_copy(map->p[0]->dim);
2948 return (struct isl_set *)map;
2954 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
2956 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
2959 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
2961 struct isl_basic_set *domain;
2966 n_in = isl_basic_map_n_in(bmap);
2967 n_out = isl_basic_map_n_out(bmap);
2968 domain = isl_basic_set_from_basic_map(bmap);
2969 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
2972 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
2974 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
2977 struct isl_set *isl_map_range(struct isl_map *map)
2980 struct isl_set *set;
2984 map = isl_map_cow(map);
2988 set = (struct isl_set *) map;
2989 if (set->dim->n_in != 0) {
2990 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
2994 for (i = 0; i < map->n; ++i) {
2995 set->p[i] = isl_basic_map_range(map->p[i]);
2999 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3000 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3007 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3010 struct isl_map *map = NULL;
3012 set = isl_set_cow(set);
3015 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3016 map = (struct isl_map *)set;
3017 for (i = 0; i < set->n; ++i) {
3018 map->p[i] = isl_basic_map_from_basic_set(
3019 set->p[i], isl_dim_copy(dim));
3023 isl_dim_free(map->dim);
3032 struct isl_map *isl_map_from_range(struct isl_set *set)
3034 return (struct isl_map *)set;
3037 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3039 return isl_map_reverse(isl_map_from_range(set));;
3042 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3043 __isl_take isl_set *range)
3045 return isl_map_product(isl_map_from_domain(domain),
3046 isl_map_from_range(range));
3049 struct isl_set *isl_set_from_map(struct isl_map *map)
3052 struct isl_set *set = NULL;
3056 map = isl_map_cow(map);
3059 map->dim = isl_dim_cow(map->dim);
3062 map->dim->n_out += map->dim->n_in;
3064 set = (struct isl_set *)map;
3065 for (i = 0; i < map->n; ++i) {
3066 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3076 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3078 struct isl_map *map;
3082 isl_assert(dim->ctx, n >= 0, return NULL);
3083 map = isl_alloc(dim->ctx, struct isl_map,
3084 sizeof(struct isl_map) +
3085 (n - 1) * sizeof(struct isl_basic_map *));
3089 map->ctx = dim->ctx;
3090 isl_ctx_ref(map->ctx);
3102 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3103 unsigned nparam, unsigned in, unsigned out, int n,
3106 struct isl_map *map;
3107 struct isl_dim *dims;
3109 dims = isl_dim_alloc(ctx, nparam, in, out);
3113 map = isl_map_alloc_dim(dims, n, flags);
3117 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3119 struct isl_basic_map *bmap;
3120 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3121 bmap = isl_basic_map_set_to_empty(bmap);
3125 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3127 struct isl_basic_set *bset;
3128 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3129 bset = isl_basic_set_set_to_empty(bset);
3133 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3135 struct isl_basic_map *bmap;
3138 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3139 bmap = isl_basic_map_set_to_empty(bmap);
3143 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3145 struct isl_basic_map *bmap;
3148 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3149 bmap = isl_basic_map_set_to_empty(bmap);
3153 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3155 struct isl_basic_set *bset;
3158 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3159 bset = isl_basic_set_set_to_empty(bset);
3163 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3165 struct isl_basic_map *bmap;
3166 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3170 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3172 struct isl_basic_set *bset;
3173 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3177 __isl_give isl_basic_map *isl_basic_map_universe_like(
3178 __isl_keep isl_basic_map *model)
3182 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3185 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3189 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3192 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3193 __isl_keep isl_set *model)
3197 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3200 struct isl_map *isl_map_empty(struct isl_dim *dim)
3202 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3205 struct isl_map *isl_map_empty_like(struct isl_map *model)
3209 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3212 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3216 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3219 struct isl_set *isl_set_empty(struct isl_dim *dim)
3221 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3224 struct isl_set *isl_set_empty_like(struct isl_set *model)
3228 return isl_set_empty(isl_dim_copy(model->dim));
3231 struct isl_map *isl_map_universe(struct isl_dim *dim)
3233 struct isl_map *map;
3236 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3237 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3241 struct isl_set *isl_set_universe(struct isl_dim *dim)
3243 struct isl_set *set;
3246 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3247 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3251 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3255 return isl_set_universe(isl_dim_copy(model->dim));
3258 struct isl_map *isl_map_dup(struct isl_map *map)
3261 struct isl_map *dup;
3265 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3266 for (i = 0; i < map->n; ++i)
3267 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3271 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3272 __isl_take isl_basic_map *bmap)
3276 if (isl_basic_map_fast_is_empty(bmap)) {
3277 isl_basic_map_free(bmap);
3280 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3281 isl_assert(map->ctx, map->n < map->size, goto error);
3282 map->p[map->n] = bmap;
3284 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3290 isl_basic_map_free(bmap);
3294 void isl_map_free(struct isl_map *map)
3304 isl_ctx_deref(map->ctx);
3305 for (i = 0; i < map->n; ++i)
3306 isl_basic_map_free(map->p[i]);
3307 isl_dim_free(map->dim);
3311 struct isl_map *isl_map_extend(struct isl_map *base,
3312 unsigned nparam, unsigned n_in, unsigned n_out)
3316 base = isl_map_cow(base);
3320 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3323 for (i = 0; i < base->n; ++i) {
3324 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3325 isl_dim_copy(base->dim), 0, 0, 0);
3335 struct isl_set *isl_set_extend(struct isl_set *base,
3336 unsigned nparam, unsigned dim)
3338 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3342 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3343 struct isl_basic_map *bmap, unsigned pos, int value)
3347 bmap = isl_basic_map_cow(bmap);
3348 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3349 j = isl_basic_map_alloc_equality(bmap);
3352 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3353 isl_int_set_si(bmap->eq[j][pos], -1);
3354 isl_int_set_si(bmap->eq[j][0], value);
3355 bmap = isl_basic_map_simplify(bmap);
3356 return isl_basic_map_finalize(bmap);
3358 isl_basic_map_free(bmap);
3362 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3363 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3367 bmap = isl_basic_map_cow(bmap);
3368 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3369 j = isl_basic_map_alloc_equality(bmap);
3372 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3373 isl_int_set_si(bmap->eq[j][pos], -1);
3374 isl_int_set(bmap->eq[j][0], value);
3375 bmap = isl_basic_map_simplify(bmap);
3376 return isl_basic_map_finalize(bmap);
3378 isl_basic_map_free(bmap);
3382 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3383 enum isl_dim_type type, unsigned pos, int value)
3387 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3388 return isl_basic_map_fix_pos_si(bmap,
3389 isl_basic_map_offset(bmap, type) + pos, value);
3391 isl_basic_map_free(bmap);
3395 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3396 enum isl_dim_type type, unsigned pos, isl_int value)
3400 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3401 return isl_basic_map_fix_pos(bmap,
3402 isl_basic_map_offset(bmap, type) + pos, value);
3404 isl_basic_map_free(bmap);
3408 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3409 enum isl_dim_type type, unsigned pos, int value)
3411 return (struct isl_basic_set *)
3412 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3416 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3417 enum isl_dim_type type, unsigned pos, isl_int value)
3419 return (struct isl_basic_set *)
3420 isl_basic_map_fix((struct isl_basic_map *)bset,
3424 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3425 unsigned input, int value)
3427 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3430 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3431 unsigned dim, int value)
3433 return (struct isl_basic_set *)
3434 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3435 isl_dim_set, dim, value);
3438 struct isl_map *isl_map_fix_si(struct isl_map *map,
3439 enum isl_dim_type type, unsigned pos, int value)
3443 map = isl_map_cow(map);
3447 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3448 for (i = 0; i < map->n; ++i) {
3449 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3453 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3460 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3461 enum isl_dim_type type, unsigned pos, int value)
3463 return (struct isl_set *)
3464 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3467 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3468 enum isl_dim_type type, unsigned pos, isl_int value)
3472 map = isl_map_cow(map);
3476 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3477 for (i = 0; i < map->n; ++i) {
3478 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3482 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3489 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3490 enum isl_dim_type type, unsigned pos, isl_int value)
3492 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3495 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3496 unsigned input, int value)
3498 return isl_map_fix_si(map, isl_dim_in, input, value);
3501 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3503 return (struct isl_set *)
3504 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3507 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3508 __isl_take isl_basic_map *bmap,
3509 enum isl_dim_type type, unsigned pos, int value)
3515 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3516 pos += isl_basic_map_offset(bmap, type);
3517 bmap = isl_basic_map_cow(bmap);
3518 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3519 j = isl_basic_map_alloc_inequality(bmap);
3522 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3523 isl_int_set_si(bmap->ineq[j][pos], 1);
3524 isl_int_set_si(bmap->ineq[j][0], -value);
3525 bmap = isl_basic_map_simplify(bmap);
3526 return isl_basic_map_finalize(bmap);
3528 isl_basic_map_free(bmap);
3532 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3533 unsigned dim, isl_int value)
3537 bset = isl_basic_set_cow(bset);
3538 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3539 j = isl_basic_set_alloc_inequality(bset);
3542 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3543 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3544 isl_int_neg(bset->ineq[j][0], value);
3545 bset = isl_basic_set_simplify(bset);
3546 return isl_basic_set_finalize(bset);
3548 isl_basic_set_free(bset);
3552 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3553 enum isl_dim_type type, unsigned pos, int value)
3557 map = isl_map_cow(map);
3561 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3562 for (i = 0; i < map->n; ++i) {
3563 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3568 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3575 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3580 set = isl_set_cow(set);
3584 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3585 for (i = 0; i < set->n; ++i) {
3586 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3596 struct isl_map *isl_map_reverse(struct isl_map *map)
3600 map = isl_map_cow(map);
3604 map->dim = isl_dim_reverse(map->dim);
3607 for (i = 0; i < map->n; ++i) {
3608 map->p[i] = isl_basic_map_reverse(map->p[i]);
3612 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3619 static struct isl_map *isl_basic_map_partial_lexopt(
3620 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3621 struct isl_set **empty, int max)
3625 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3626 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3628 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3630 isl_basic_map_free(bmap);
3631 isl_basic_set_free(dom);
3637 struct isl_map *isl_basic_map_partial_lexmax(
3638 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3639 struct isl_set **empty)
3641 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3644 struct isl_map *isl_basic_map_partial_lexmin(
3645 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3646 struct isl_set **empty)
3648 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3651 struct isl_set *isl_basic_set_partial_lexmin(
3652 struct isl_basic_set *bset, struct isl_basic_set *dom,
3653 struct isl_set **empty)
3655 return (struct isl_set *)
3656 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3660 struct isl_set *isl_basic_set_partial_lexmax(
3661 struct isl_basic_set *bset, struct isl_basic_set *dom,
3662 struct isl_set **empty)
3664 return (struct isl_set *)
3665 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3669 /* Given a basic map "bmap", compute the lexicograhically minimal
3670 * (or maximal) image element for each domain element in dom.
3671 * Set *empty to those elements in dom that do not have an image element.
3673 * We first make sure the basic sets in dom are disjoint and then
3674 * simply collect the results over each of the basic sets separately.
3675 * We could probably improve the efficiency a bit by moving the union
3676 * domain down into the parametric integer programming.
3678 static __isl_give isl_map *basic_map_partial_lexopt(
3679 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3680 __isl_give isl_set **empty, int max)
3683 struct isl_map *res;
3685 dom = isl_set_make_disjoint(dom);
3689 if (isl_set_fast_is_empty(dom)) {
3690 res = isl_map_empty_like_basic_map(bmap);
3691 *empty = isl_set_empty_like(dom);
3693 isl_basic_map_free(bmap);
3697 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3698 isl_basic_set_copy(dom->p[0]), empty, max);
3700 for (i = 1; i < dom->n; ++i) {
3701 struct isl_map *res_i;
3702 struct isl_set *empty_i;
3704 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3705 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3707 res = isl_map_union_disjoint(res, res_i);
3708 *empty = isl_set_union_disjoint(*empty, empty_i);
3712 isl_basic_map_free(bmap);
3717 isl_basic_map_free(bmap);
3721 /* Given a map "map", compute the lexicograhically minimal
3722 * (or maximal) image element for each domain element in dom.
3723 * Set *empty to those elements in dom that do not have an image element.
3725 * We first compute the lexicographically minimal or maximal element
3726 * in the first basic map. This results in a partial solution "res"
3727 * and a subset "todo" of dom that still need to be handled.
3728 * We then consider each of the remaining maps in "map" and successively
3729 * improve both "res" and "todo".
3731 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3732 * Assume we are computing the lexicographical maximum.
3733 * We first intersect basic map i with a relation that maps elements
3734 * to elements that are lexicographically larger than the image elements
3735 * in res^k and the compute the maximum image element of this intersection.
3736 * The result ("better") corresponds to those image elements in basic map i
3737 * that are better than what we had before. The remainder ("keep") are the
3738 * domain elements for which the image element in res_k was better.
3739 * We also compute the lexicographical maximum of basic map i in todo^k.
3740 * res^i is the result of the operation + better + those elements in
3741 * res^k that we should keep
3742 * todo^i is the remainder of the maximum operation on todo^k.
3744 static __isl_give isl_map *isl_map_partial_lexopt(
3745 __isl_take isl_map *map, __isl_take isl_set *dom,
3746 __isl_give isl_set **empty, int max)
3749 struct isl_map *res;
3750 struct isl_set *todo;
3755 if (isl_map_fast_is_empty(map)) {
3763 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3764 isl_set_copy(dom), &todo, max);
3766 for (i = 1; i < map->n; ++i) {
3768 struct isl_map *better;
3769 struct isl_set *keep;
3770 struct isl_map *res_i;
3771 struct isl_set *todo_i;
3772 struct isl_dim *dim = isl_map_get_dim(res);
3774 dim = isl_dim_range(dim);
3776 lt = isl_map_lex_lt(dim);
3778 lt = isl_map_lex_gt(dim);
3779 lt = isl_map_apply_range(isl_map_copy(res), lt);
3780 lt = isl_map_intersect(lt,
3781 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3782 better = isl_map_partial_lexopt(lt,
3783 isl_map_domain(isl_map_copy(res)),
3786 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3787 todo, &todo_i, max);
3789 res = isl_map_intersect_domain(res, keep);
3790 res = isl_map_union_disjoint(res, res_i);
3791 res = isl_map_union_disjoint(res, better);
3812 __isl_give isl_map *isl_map_partial_lexmax(
3813 __isl_take isl_map *map, __isl_take isl_set *dom,
3814 __isl_give isl_set **empty)
3816 return isl_map_partial_lexopt(map, dom, empty, 1);
3819 __isl_give isl_map *isl_map_partial_lexmin(
3820 __isl_take isl_map *map, __isl_take isl_set *dom,
3821 __isl_give isl_set **empty)
3823 return isl_map_partial_lexopt(map, dom, empty, 0);
3826 __isl_give isl_set *isl_set_partial_lexmin(
3827 __isl_take isl_set *set, __isl_take isl_set *dom,
3828 __isl_give isl_set **empty)
3830 return (struct isl_set *)
3831 isl_map_partial_lexmin((struct isl_map *)set,
3835 __isl_give isl_set *isl_set_partial_lexmax(
3836 __isl_take isl_set *set, __isl_take isl_set *dom,
3837 __isl_give isl_set **empty)
3839 return (struct isl_set *)
3840 isl_map_partial_lexmax((struct isl_map *)set,
3844 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3846 struct isl_basic_set *dom = NULL;
3847 struct isl_dim *dom_dim;
3851 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3852 dom = isl_basic_set_universe(dom_dim);
3853 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
3855 isl_basic_map_free(bmap);
3859 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3861 return isl_basic_map_lexopt(bmap, 0);
3864 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
3866 return isl_basic_map_lexopt(bmap, 1);
3869 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3871 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3874 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
3876 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
3879 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
3881 struct isl_set *dom = NULL;
3882 struct isl_dim *dom_dim;
3886 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
3887 dom = isl_set_universe(dom_dim);
3888 return isl_map_partial_lexopt(map, dom, NULL, max);
3894 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
3896 return isl_map_lexopt(map, 0);
3899 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
3901 return isl_map_lexopt(map, 1);
3904 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
3906 return (isl_set *)isl_map_lexmin((isl_map *)set);
3909 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
3911 return (isl_set *)isl_map_lexmax((isl_map *)set);
3914 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
3915 struct isl_dim *dim)
3922 for (i = 0; i < map->n; ++i) {
3923 isl_dim_free(map->p[i]->dim);
3924 map->p[i]->dim = isl_dim_copy(dim);
3926 isl_dim_free(map->dim);
3936 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
3937 struct isl_dim *dim)
3939 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3942 /* Apply a preimage specified by "mat" on the parameters of "bset".
3943 * bset is assumed to have only parameters and divs.
3945 static struct isl_basic_set *basic_set_parameter_preimage(
3946 struct isl_basic_set *bset, struct isl_mat *mat)
3953 bset->dim = isl_dim_cow(bset->dim);
3957 nparam = isl_basic_set_dim(bset, isl_dim_param);
3959 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
3961 bset->dim->nparam = 0;
3962 bset->dim->n_out = nparam;
3963 bset = isl_basic_set_preimage(bset, mat);
3965 bset->dim->nparam = bset->dim->n_out;
3966 bset->dim->n_out = 0;
3971 isl_basic_set_free(bset);
3975 /* Apply a preimage specified by "mat" on the parameters of "set".
3976 * set is assumed to have only parameters and divs.
3978 static struct isl_set *set_parameter_preimage(
3979 struct isl_set *set, struct isl_mat *mat)
3981 struct isl_dim *dim = NULL;
3987 dim = isl_dim_copy(set->dim);
3988 dim = isl_dim_cow(dim);
3992 nparam = isl_set_dim(set, isl_dim_param);
3994 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
3997 dim->n_out = nparam;
3998 isl_set_reset_dim(set, dim);
3999 set = isl_set_preimage(set, mat);
4002 dim = isl_dim_copy(set->dim);
4003 dim = isl_dim_cow(dim);
4006 dim->nparam = dim->n_out;
4008 isl_set_reset_dim(set, dim);
4018 /* Intersect the basic set "bset" with the affine space specified by the
4019 * equalities in "eq".
4021 static struct isl_basic_set *basic_set_append_equalities(
4022 struct isl_basic_set *bset, struct isl_mat *eq)
4030 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4035 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4036 for (i = 0; i < eq->n_row; ++i) {
4037 k = isl_basic_set_alloc_equality(bset);
4040 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4041 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4048 isl_basic_set_free(bset);
4052 /* Intersect the set "set" with the affine space specified by the
4053 * equalities in "eq".
4055 static struct isl_set *set_append_equalities(struct isl_set *set,
4063 for (i = 0; i < set->n; ++i) {
4064 set->p[i] = basic_set_append_equalities(set->p[i],
4077 /* Project the given basic set onto its parameter domain, possibly introducing
4078 * new, explicit, existential variables in the constraints.
4079 * The input has parameters and (possibly implicit) existential variables.
4080 * The output has the same parameters, but only
4081 * explicit existentially quantified variables.
4083 * The actual projection is performed by pip, but pip doesn't seem
4084 * to like equalities very much, so we first remove the equalities
4085 * among the parameters by performing a variable compression on
4086 * the parameters. Afterward, an inverse transformation is performed
4087 * and the equalities among the parameters are inserted back in.
4089 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4093 struct isl_mat *T, *T2;
4094 struct isl_set *set;
4095 unsigned nparam, n_div;
4097 bset = isl_basic_set_cow(bset);
4101 if (bset->n_eq == 0)
4102 return isl_basic_set_lexmin(bset);
4104 isl_basic_set_gauss(bset, NULL);
4106 nparam = isl_basic_set_dim(bset, isl_dim_param);
4107 n_div = isl_basic_set_dim(bset, isl_dim_div);
4109 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4110 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4113 if (i == bset->n_eq)
4114 return isl_basic_set_lexmin(bset);
4116 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4118 eq = isl_mat_cow(eq);
4119 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4120 bset = basic_set_parameter_preimage(bset, T);
4122 set = isl_basic_set_lexmin(bset);
4123 set = set_parameter_preimage(set, T2);
4124 set = set_append_equalities(set, eq);
4128 /* Compute an explicit representation for all the existentially
4129 * quantified variables.
4130 * The input and output dimensions are first turned into parameters.
4131 * compute_divs then returns a map with the same parameters and
4132 * no input or output dimensions and the dimension specification
4133 * is reset to that of the input.
4135 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4137 struct isl_basic_set *bset;
4138 struct isl_set *set;
4139 struct isl_map *map;
4140 struct isl_dim *dim, *orig_dim = NULL;
4145 bmap = isl_basic_map_cow(bmap);
4149 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4150 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4151 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4152 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4156 orig_dim = bmap->dim;
4158 bset = (struct isl_basic_set *)bmap;
4160 set = parameter_compute_divs(bset);
4161 map = (struct isl_map *)set;
4162 map = isl_map_reset_dim(map, orig_dim);
4166 isl_basic_map_free(bmap);
4170 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4178 off = isl_dim_total(bmap->dim);
4179 for (i = 0; i < bmap->n_div; ++i) {
4180 if (isl_int_is_zero(bmap->div[i][0]))
4182 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4188 static int map_divs_known(__isl_keep isl_map *map)
4195 for (i = 0; i < map->n; ++i) {
4196 int known = basic_map_divs_known(map->p[i]);
4204 /* If bmap contains any unknown divs, then compute explicit
4205 * expressions for them. However, this computation may be
4206 * quite expensive, so first try to remove divs that aren't
4209 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4213 struct isl_map *map;
4215 known = basic_map_divs_known(bmap);
4219 return isl_map_from_basic_map(bmap);
4221 bmap = isl_basic_map_drop_redundant_divs(bmap);
4223 known = basic_map_divs_known(bmap);
4227 return isl_map_from_basic_map(bmap);
4229 map = compute_divs(bmap);
4232 isl_basic_map_free(bmap);
4236 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4240 struct isl_map *res;
4247 known = map_divs_known(map);
4255 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4256 for (i = 1 ; i < map->n; ++i) {
4258 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4259 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4260 res = isl_map_union_disjoint(res, r2);
4262 res = isl_map_union(res, r2);
4269 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4271 return (struct isl_set *)
4272 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4275 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4277 return (struct isl_set *)
4278 isl_map_compute_divs((struct isl_map *)set);
4281 struct isl_set *isl_map_domain(struct isl_map *map)
4284 struct isl_set *set;
4289 map = isl_map_cow(map);
4293 set = (struct isl_set *)map;
4294 set->dim = isl_dim_domain(set->dim);
4297 for (i = 0; i < map->n; ++i) {
4298 set->p[i] = isl_basic_map_domain(map->p[i]);
4302 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4303 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4310 struct isl_map *isl_map_union_disjoint(
4311 struct isl_map *map1, struct isl_map *map2)
4315 struct isl_map *map = NULL;
4329 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4331 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4332 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4333 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4335 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4336 map1->n + map2->n, flags);
4339 for (i = 0; i < map1->n; ++i) {
4340 map = isl_map_add_basic_map(map,
4341 isl_basic_map_copy(map1->p[i]));
4345 for (i = 0; i < map2->n; ++i) {
4346 map = isl_map_add_basic_map(map,
4347 isl_basic_map_copy(map2->p[i]));
4361 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4363 map1 = isl_map_union_disjoint(map1, map2);
4367 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4371 struct isl_set *isl_set_union_disjoint(
4372 struct isl_set *set1, struct isl_set *set2)
4374 return (struct isl_set *)
4375 isl_map_union_disjoint(
4376 (struct isl_map *)set1, (struct isl_map *)set2);
4379 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4381 return (struct isl_set *)
4382 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4385 struct isl_map *isl_map_intersect_range(
4386 struct isl_map *map, struct isl_set *set)
4389 struct isl_map *result;
4395 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4396 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4397 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4399 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4400 map->n * set->n, flags);
4403 for (i = 0; i < map->n; ++i)
4404 for (j = 0; j < set->n; ++j) {
4405 result = isl_map_add_basic_map(result,
4406 isl_basic_map_intersect_range(
4407 isl_basic_map_copy(map->p[i]),
4408 isl_basic_set_copy(set->p[j])));
4421 struct isl_map *isl_map_intersect_domain(
4422 struct isl_map *map, struct isl_set *set)
4424 return isl_map_reverse(
4425 isl_map_intersect_range(isl_map_reverse(map), set));
4428 struct isl_map *isl_map_apply_domain(
4429 struct isl_map *map1, struct isl_map *map2)
4433 map1 = isl_map_reverse(map1);
4434 map1 = isl_map_apply_range(map1, map2);
4435 return isl_map_reverse(map1);
4442 struct isl_map *isl_map_apply_range(
4443 struct isl_map *map1, struct isl_map *map2)
4445 struct isl_dim *dim_result;
4446 struct isl_map *result;
4452 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4453 isl_dim_copy(map2->dim));
4455 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4458 for (i = 0; i < map1->n; ++i)
4459 for (j = 0; j < map2->n; ++j) {
4460 result = isl_map_add_basic_map(result,
4461 isl_basic_map_apply_range(
4462 isl_basic_map_copy(map1->p[i]),
4463 isl_basic_map_copy(map2->p[j])));
4469 if (result && result->n <= 1)
4470 ISL_F_SET(result, ISL_MAP_DISJOINT);
4479 * returns range - domain
4481 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4483 struct isl_basic_set *bset;
4490 dim = isl_basic_map_n_in(bmap);
4491 nparam = isl_basic_map_n_param(bmap);
4492 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4493 bset = isl_basic_set_from_basic_map(bmap);
4494 bset = isl_basic_set_cow(bset);
4495 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4496 bset = isl_basic_set_swap_vars(bset, 2*dim);
4497 for (i = 0; i < dim; ++i) {
4498 int j = isl_basic_map_alloc_equality(
4499 (struct isl_basic_map *)bset);
4502 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4503 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4504 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4505 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4507 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4509 isl_basic_map_free(bmap);
4514 * returns range - domain
4516 struct isl_set *isl_map_deltas(struct isl_map *map)
4519 struct isl_set *result;
4524 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4525 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4526 isl_map_n_in(map), map->n, map->flags);
4529 for (i = 0; i < map->n; ++i)
4530 result = isl_set_add_basic_set(result,
4531 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4539 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4541 struct isl_basic_map *bmap;
4549 nparam = dims->nparam;
4551 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4555 for (i = 0; i < dim; ++i) {
4556 int j = isl_basic_map_alloc_equality(bmap);
4559 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4560 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4561 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4563 return isl_basic_map_finalize(bmap);
4565 isl_basic_map_free(bmap);
4569 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4571 struct isl_dim *dim = isl_dim_map(set_dim);
4574 return basic_map_identity(dim);
4577 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4579 if (!model || !model->dim)
4581 isl_assert(model->ctx,
4582 model->dim->n_in == model->dim->n_out, return NULL);
4583 return basic_map_identity(isl_dim_copy(model->dim));
4586 static struct isl_map *map_identity(struct isl_dim *dim)
4588 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4589 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4592 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4594 struct isl_dim *dim = isl_dim_map(set_dim);
4597 return map_identity(dim);
4600 struct isl_map *isl_map_identity_like(struct isl_map *model)
4602 if (!model || !model->dim)
4604 isl_assert(model->ctx,
4605 model->dim->n_in == model->dim->n_out, return NULL);
4606 return map_identity(isl_dim_copy(model->dim));
4609 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4611 if (!model || !model->dim)
4613 isl_assert(model->ctx,
4614 model->dim->n_in == model->dim->n_out, return NULL);
4615 return map_identity(isl_dim_copy(model->dim));
4618 /* Construct a basic set with all set dimensions having only non-negative
4621 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4626 struct isl_basic_set *bset;
4630 nparam = dims->nparam;
4632 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4635 for (i = 0; i < dim; ++i) {
4636 int k = isl_basic_set_alloc_inequality(bset);
4639 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4640 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4644 isl_basic_set_free(bset);
4648 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4650 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4653 int isl_basic_map_is_subset(
4654 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4657 struct isl_map *map1;
4658 struct isl_map *map2;
4660 if (!bmap1 || !bmap2)
4663 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4664 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4666 is_subset = isl_map_is_subset(map1, map2);
4674 int isl_basic_map_is_equal(
4675 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4679 if (!bmap1 || !bmap2)
4681 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4684 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4688 int isl_basic_set_is_equal(
4689 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4691 return isl_basic_map_is_equal(
4692 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4695 int isl_map_is_empty(struct isl_map *map)
4702 for (i = 0; i < map->n; ++i) {
4703 is_empty = isl_basic_map_is_empty(map->p[i]);
4712 int isl_map_fast_is_empty(struct isl_map *map)
4717 int isl_set_fast_is_empty(struct isl_set *set)
4722 int isl_set_is_empty(struct isl_set *set)
4724 return isl_map_is_empty((struct isl_map *)set);
4727 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4733 is_subset = isl_map_is_subset(map1, map2);
4736 is_subset = isl_map_is_subset(map2, map1);
4740 int isl_basic_map_is_strict_subset(
4741 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4745 if (!bmap1 || !bmap2)
4747 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4750 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4751 if (is_subset == -1)
4756 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4762 is_subset = isl_map_is_subset(map1, map2);
4765 is_subset = isl_map_is_subset(map2, map1);
4766 if (is_subset == -1)
4771 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4773 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4776 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4780 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4783 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4787 return bset->n_eq == 0 && bset->n_ineq == 0;
4790 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4795 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4798 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4800 struct isl_basic_set *bset = NULL;
4801 struct isl_vec *sample = NULL;
4808 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4811 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4812 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4813 copy = isl_basic_map_convex_hull(copy);
4814 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4815 isl_basic_map_free(copy);
4819 total = 1 + isl_basic_map_total_dim(bmap);
4820 if (bmap->sample && bmap->sample->size == total) {
4821 int contains = isl_basic_map_contains(bmap, bmap->sample);
4827 isl_vec_free(bmap->sample);
4828 bmap->sample = NULL;
4829 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4832 sample = isl_basic_set_sample_vec(bset);
4835 empty = sample->size == 0;
4836 isl_vec_free(bmap->sample);
4837 bmap->sample = sample;
4839 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4844 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4848 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4851 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4855 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4858 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4860 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4863 struct isl_map *isl_basic_map_union(
4864 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4866 struct isl_map *map;
4867 if (!bmap1 || !bmap2)
4870 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4872 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4875 map = isl_map_add_basic_map(map, bmap1);
4876 map = isl_map_add_basic_map(map, bmap2);
4879 isl_basic_map_free(bmap1);
4880 isl_basic_map_free(bmap2);
4884 struct isl_set *isl_basic_set_union(
4885 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4887 return (struct isl_set *)isl_basic_map_union(
4888 (struct isl_basic_map *)bset1,
4889 (struct isl_basic_map *)bset2);
4892 /* Order divs such that any div only depends on previous divs */
4893 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
4896 unsigned off = isl_dim_total(bmap->dim);
4898 for (i = 0; i < bmap->n_div; ++i) {
4900 if (isl_int_is_zero(bmap->div[i][0]))
4902 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
4906 isl_basic_map_swap_div(bmap, i, i + pos);
4912 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
4914 return (struct isl_basic_set *)
4915 isl_basic_map_order_divs((struct isl_basic_map *)bset);
4918 /* Look for a div in dst that corresponds to the div "div" in src.
4919 * The divs before "div" in src and dst are assumed to be the same.
4921 * Returns -1 if no corresponding div was found and the position
4922 * of the corresponding div in dst otherwise.
4924 static int find_div(struct isl_basic_map *dst,
4925 struct isl_basic_map *src, unsigned div)
4929 unsigned total = isl_dim_total(src->dim);
4931 isl_assert(dst->ctx, div <= dst->n_div, return -1);
4932 for (i = div; i < dst->n_div; ++i)
4933 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
4934 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
4935 dst->n_div - div) == -1)
4940 struct isl_basic_map *isl_basic_map_align_divs(
4941 struct isl_basic_map *dst, struct isl_basic_map *src)
4944 unsigned total = isl_dim_total(src->dim);
4949 if (src->n_div == 0)
4952 for (i = 0; i < src->n_div; ++i)
4953 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
4955 src = isl_basic_map_order_divs(src);
4956 dst = isl_basic_map_cow(dst);
4957 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
4958 src->n_div, 0, 2 * src->n_div);
4961 for (i = 0; i < src->n_div; ++i) {
4962 int j = find_div(dst, src, i);
4964 j = isl_basic_map_alloc_div(dst);
4967 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
4968 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
4969 if (isl_basic_map_add_div_constraints(dst, j) < 0)
4973 isl_basic_map_swap_div(dst, i, j);
4977 isl_basic_map_free(dst);
4981 struct isl_basic_set *isl_basic_set_align_divs(
4982 struct isl_basic_set *dst, struct isl_basic_set *src)
4984 return (struct isl_basic_set *)isl_basic_map_align_divs(
4985 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
4988 struct isl_map *isl_map_align_divs(struct isl_map *map)
4996 map = isl_map_compute_divs(map);
4997 map = isl_map_cow(map);
5001 for (i = 1; i < map->n; ++i)
5002 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5003 for (i = 1; i < map->n; ++i)
5004 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5006 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5010 struct isl_set *isl_set_align_divs(struct isl_set *set)
5012 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5015 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5019 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5020 map = isl_map_intersect_domain(map, set);
5021 set = isl_map_range(map);
5029 /* There is no need to cow as removing empty parts doesn't change
5030 * the meaning of the set.
5032 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5039 for (i = map->n-1; i >= 0; --i) {
5040 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5042 isl_basic_map_free(map->p[i]);
5043 if (i != map->n-1) {
5044 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5045 map->p[i] = map->p[map->n-1];
5053 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5055 return (struct isl_set *)
5056 isl_map_remove_empty_parts((struct isl_map *)set);
5059 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5061 struct isl_basic_map *bmap;
5062 if (!map || map->n == 0)
5064 bmap = map->p[map->n-1];
5065 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5066 return isl_basic_map_copy(bmap);
5069 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5071 return (struct isl_basic_set *)
5072 isl_map_copy_basic_map((struct isl_map *)set);
5075 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5076 __isl_keep isl_basic_map *bmap)
5082 for (i = map->n-1; i >= 0; --i) {
5083 if (map->p[i] != bmap)
5085 map = isl_map_cow(map);
5088 isl_basic_map_free(map->p[i]);
5089 if (i != map->n-1) {
5090 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5091 map->p[i] = map->p[map->n-1];
5102 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5103 struct isl_basic_set *bset)
5105 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5106 (struct isl_basic_map *)bset);
5109 /* Given two basic sets bset1 and bset2, compute the maximal difference
5110 * between the values of dimension pos in bset1 and those in bset2
5111 * for any common value of the parameters and dimensions preceding pos.
5113 static enum isl_lp_result basic_set_maximal_difference_at(
5114 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5115 int pos, isl_int *opt)
5117 struct isl_dim *dims;
5118 struct isl_basic_map *bmap1 = NULL;
5119 struct isl_basic_map *bmap2 = NULL;
5120 struct isl_ctx *ctx;
5121 struct isl_vec *obj;
5124 unsigned dim1, dim2;
5125 enum isl_lp_result res;
5127 if (!bset1 || !bset2)
5128 return isl_lp_error;
5130 nparam = isl_basic_set_n_param(bset1);
5131 dim1 = isl_basic_set_n_dim(bset1);
5132 dim2 = isl_basic_set_n_dim(bset2);
5133 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5134 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5135 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5136 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5137 if (!bmap1 || !bmap2)
5139 bmap1 = isl_basic_map_cow(bmap1);
5140 bmap1 = isl_basic_map_extend(bmap1, nparam,
5141 pos, (dim1 - pos) + (dim2 - pos),
5142 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5143 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5146 total = isl_basic_map_total_dim(bmap1);
5148 obj = isl_vec_alloc(ctx, 1 + total);
5149 isl_seq_clr(obj->block.data, 1 + total);
5150 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5151 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5154 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5156 isl_basic_map_free(bmap1);
5160 isl_basic_map_free(bmap1);
5161 isl_basic_map_free(bmap2);
5162 return isl_lp_error;
5165 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5166 * for any common value of the parameters and dimensions preceding pos
5167 * in both basic sets, the values of dimension pos in bset1 are
5168 * smaller or larger than those in bset2.
5171 * 1 if bset1 follows bset2
5172 * -1 if bset1 precedes bset2
5173 * 0 if bset1 and bset2 are incomparable
5174 * -2 if some error occurred.
5176 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5177 struct isl_basic_set *bset2, int pos)
5180 enum isl_lp_result res;
5185 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5187 if (res == isl_lp_empty)
5189 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5190 res == isl_lp_unbounded)
5192 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5201 /* Given two basic sets bset1 and bset2, check whether
5202 * for any common value of the parameters and dimensions preceding pos
5203 * there is a value of dimension pos in bset1 that is larger
5204 * than a value of the same dimension in bset2.
5207 * 1 if there exists such a pair
5208 * 0 if there is no such pair, but there is a pair of equal values
5210 * -2 if some error occurred.
5212 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5213 __isl_keep isl_basic_set *bset2, int pos)
5216 enum isl_lp_result res;
5221 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5223 if (res == isl_lp_empty)
5225 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5226 res == isl_lp_unbounded)
5228 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5230 else if (res == isl_lp_ok)
5239 /* Given two sets set1 and set2, check whether
5240 * for any common value of the parameters and dimensions preceding pos
5241 * there is a value of dimension pos in set1 that is larger
5242 * than a value of the same dimension in set2.
5245 * 1 if there exists such a pair
5246 * 0 if there is no such pair, but there is a pair of equal values
5248 * -2 if some error occurred.
5250 int isl_set_follows_at(__isl_keep isl_set *set1,
5251 __isl_keep isl_set *set2, int pos)
5259 for (i = 0; i < set1->n; ++i)
5260 for (j = 0; j < set2->n; ++j) {
5262 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5263 if (f == 1 || f == -2)
5272 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5273 unsigned pos, isl_int *val)
5281 total = isl_basic_map_total_dim(bmap);
5282 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5283 for (; d+1 > pos; --d)
5284 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5288 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5290 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5292 if (!isl_int_is_one(bmap->eq[i][1+d]))
5295 isl_int_neg(*val, bmap->eq[i][0]);
5301 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5302 unsigned pos, isl_int *val)
5314 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5317 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5318 for (i = 1; fixed == 1 && i < map->n; ++i) {
5319 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5320 if (fixed == 1 && isl_int_ne(tmp, v))
5324 isl_int_set(*val, v);
5330 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5331 unsigned pos, isl_int *val)
5333 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5337 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5340 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5343 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5344 enum isl_dim_type type, unsigned pos, isl_int *val)
5346 if (pos >= isl_basic_map_dim(bmap, type))
5348 return isl_basic_map_fast_has_fixed_var(bmap,
5349 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5352 int isl_map_fast_is_fixed(struct isl_map *map,
5353 enum isl_dim_type type, unsigned pos, isl_int *val)
5355 if (pos >= isl_map_dim(map, type))
5357 return isl_map_fast_has_fixed_var(map,
5358 map_offset(map, type) - 1 + pos, val);
5361 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5362 * then return this fixed value in *val.
5364 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5367 return isl_basic_set_fast_has_fixed_var(bset,
5368 isl_basic_set_n_param(bset) + dim, val);
5371 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5372 * then return this fixed value in *val.
5374 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5376 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5379 /* Check if input variable in has fixed value and if so and if val is not NULL,
5380 * then return this fixed value in *val.
5382 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5384 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5387 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5388 * and if val is not NULL, then return this lower bound in *val.
5390 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5391 unsigned dim, isl_int *val)
5393 int i, i_eq = -1, i_ineq = -1;
5400 total = isl_basic_set_total_dim(bset);
5401 nparam = isl_basic_set_n_param(bset);
5402 for (i = 0; i < bset->n_eq; ++i) {
5403 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5409 for (i = 0; i < bset->n_ineq; ++i) {
5410 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5412 if (i_eq != -1 || i_ineq != -1)
5416 if (i_eq == -1 && i_ineq == -1)
5418 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5419 /* The coefficient should always be one due to normalization. */
5420 if (!isl_int_is_one(c[1+nparam+dim]))
5422 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5424 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5425 total - nparam - dim - 1) != -1)
5428 isl_int_neg(*val, c[0]);
5432 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5433 unsigned dim, isl_int *val)
5445 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5449 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5451 for (i = 1; fixed == 1 && i < set->n; ++i) {
5452 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5454 if (fixed == 1 && isl_int_ne(tmp, v))
5458 isl_int_set(*val, v);
5469 static int qsort_constraint_cmp(const void *p1, const void *p2)
5471 const struct constraint *c1 = (const struct constraint *)p1;
5472 const struct constraint *c2 = (const struct constraint *)p2;
5473 unsigned size = isl_min(c1->size, c2->size);
5474 return isl_seq_cmp(c1->c, c2->c, size);
5477 static struct isl_basic_map *isl_basic_map_sort_constraints(
5478 struct isl_basic_map *bmap)
5481 struct constraint *c;
5486 total = isl_basic_map_total_dim(bmap);
5487 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5490 for (i = 0; i < bmap->n_ineq; ++i) {
5492 c[i].c = bmap->ineq[i];
5494 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5495 for (i = 0; i < bmap->n_ineq; ++i)
5496 bmap->ineq[i] = c[i].c;
5500 isl_basic_map_free(bmap);
5504 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5508 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5510 bmap = isl_basic_map_convex_hull(bmap);
5511 bmap = isl_basic_map_sort_constraints(bmap);
5512 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5516 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5518 return (struct isl_basic_set *)isl_basic_map_normalize(
5519 (struct isl_basic_map *)bset);
5522 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5523 const struct isl_basic_map *bmap2)
5530 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5531 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5532 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5533 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5534 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5535 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5536 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5537 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5539 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5541 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5543 if (bmap1->n_eq != bmap2->n_eq)
5544 return bmap1->n_eq - bmap2->n_eq;
5545 if (bmap1->n_ineq != bmap2->n_ineq)
5546 return bmap1->n_ineq - bmap2->n_ineq;
5547 if (bmap1->n_div != bmap2->n_div)
5548 return bmap1->n_div - bmap2->n_div;
5549 total = isl_basic_map_total_dim(bmap1);
5550 for (i = 0; i < bmap1->n_eq; ++i) {
5551 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5555 for (i = 0; i < bmap1->n_ineq; ++i) {
5556 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5560 for (i = 0; i < bmap1->n_div; ++i) {
5561 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5568 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5569 struct isl_basic_map *bmap2)
5571 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5574 static int qsort_bmap_cmp(const void *p1, const void *p2)
5576 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5577 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5579 return isl_basic_map_fast_cmp(bmap1, bmap2);
5582 /* We normalize in place, but if anything goes wrong we need
5583 * to return NULL, so we need to make sure we don't change the
5584 * meaning of any possible other copies of map.
5586 struct isl_map *isl_map_normalize(struct isl_map *map)
5589 struct isl_basic_map *bmap;
5593 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5595 for (i = 0; i < map->n; ++i) {
5596 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5599 isl_basic_map_free(map->p[i]);
5602 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5603 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5604 map = isl_map_remove_empty_parts(map);
5607 for (i = map->n - 1; i >= 1; --i) {
5608 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5610 isl_basic_map_free(map->p[i-1]);
5611 for (j = i; j < map->n; ++j)
5612 map->p[j-1] = map->p[j];
5622 struct isl_set *isl_set_normalize(struct isl_set *set)
5624 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5627 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5637 if (!isl_dim_equal(map1->dim, map2->dim))
5640 map1 = isl_map_copy(map1);
5641 map2 = isl_map_copy(map2);
5642 map1 = isl_map_normalize(map1);
5643 map2 = isl_map_normalize(map2);
5646 equal = map1->n == map2->n;
5647 for (i = 0; equal && i < map1->n; ++i) {
5648 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5661 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5663 return isl_map_fast_is_equal((struct isl_map *)set1,
5664 (struct isl_map *)set2);
5667 /* Return an interval that ranges from min to max (inclusive)
5669 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5670 isl_int min, isl_int max)
5673 struct isl_basic_set *bset = NULL;
5675 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5679 k = isl_basic_set_alloc_inequality(bset);
5682 isl_int_set_si(bset->ineq[k][1], 1);
5683 isl_int_neg(bset->ineq[k][0], min);
5685 k = isl_basic_set_alloc_inequality(bset);
5688 isl_int_set_si(bset->ineq[k][1], -1);
5689 isl_int_set(bset->ineq[k][0], max);
5693 isl_basic_set_free(bset);
5697 /* Return the Cartesian product of the basic sets in list (in the given order).
5699 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5707 struct isl_basic_set *product = NULL;
5711 isl_assert(list->ctx, list->n > 0, goto error);
5712 isl_assert(list->ctx, list->p[0], goto error);
5713 nparam = isl_basic_set_n_param(list->p[0]);
5714 dim = isl_basic_set_n_dim(list->p[0]);
5715 extra = list->p[0]->n_div;
5716 n_eq = list->p[0]->n_eq;
5717 n_ineq = list->p[0]->n_ineq;
5718 for (i = 1; i < list->n; ++i) {
5719 isl_assert(list->ctx, list->p[i], goto error);
5720 isl_assert(list->ctx,
5721 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5722 dim += isl_basic_set_n_dim(list->p[i]);
5723 extra += list->p[i]->n_div;
5724 n_eq += list->p[i]->n_eq;
5725 n_ineq += list->p[i]->n_ineq;
5727 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5732 for (i = 0; i < list->n; ++i) {
5733 isl_basic_set_add_constraints(product,
5734 isl_basic_set_copy(list->p[i]), dim);
5735 dim += isl_basic_set_n_dim(list->p[i]);
5737 isl_basic_set_list_free(list);
5740 isl_basic_set_free(product);
5741 isl_basic_set_list_free(list);
5745 struct isl_basic_map *isl_basic_map_product(
5746 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5748 struct isl_dim *dim_result = NULL;
5749 struct isl_basic_map *bmap;
5750 unsigned in1, in2, out1, out2, nparam, total, pos;
5751 struct isl_dim_map *dim_map1, *dim_map2;
5753 if (!bmap1 || !bmap2)
5756 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5757 bmap2->dim, isl_dim_param), goto error);
5758 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5759 isl_dim_copy(bmap2->dim));
5761 in1 = isl_basic_map_n_in(bmap1);
5762 in2 = isl_basic_map_n_in(bmap2);
5763 out1 = isl_basic_map_n_out(bmap1);
5764 out2 = isl_basic_map_n_out(bmap2);
5765 nparam = isl_basic_map_n_param(bmap1);
5767 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5768 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5769 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5770 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5771 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5772 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5773 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5774 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5775 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5776 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5777 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5779 bmap = isl_basic_map_alloc_dim(dim_result,
5780 bmap1->n_div + bmap2->n_div,
5781 bmap1->n_eq + bmap2->n_eq,
5782 bmap1->n_ineq + bmap2->n_ineq);
5783 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5784 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5785 bmap = isl_basic_map_simplify(bmap);
5786 return isl_basic_map_finalize(bmap);
5788 isl_basic_map_free(bmap1);
5789 isl_basic_map_free(bmap2);
5793 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5795 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5798 struct isl_map *result;
5804 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5805 map2->dim, isl_dim_param), goto error);
5807 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5808 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5809 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5811 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5812 isl_dim_copy(map2->dim)),
5813 map1->n * map2->n, flags);
5816 for (i = 0; i < map1->n; ++i)
5817 for (j = 0; j < map2->n; ++j) {
5818 struct isl_basic_map *part;
5819 part = isl_basic_map_product(
5820 isl_basic_map_copy(map1->p[i]),
5821 isl_basic_map_copy(map2->p[j]));
5822 if (isl_basic_map_is_empty(part))
5823 isl_basic_map_free(part);
5825 result = isl_map_add_basic_map(result, part);
5838 /* Given two set A and B, construct its Cartesian product A x B.
5840 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5842 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5843 (struct isl_map *)set2);
5846 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5849 uint32_t hash = isl_hash_init();
5854 bset = isl_basic_set_copy(bset);
5855 bset = isl_basic_set_normalize(bset);
5858 total = isl_basic_set_total_dim(bset);
5859 isl_hash_byte(hash, bset->n_eq & 0xFF);
5860 for (i = 0; i < bset->n_eq; ++i) {
5862 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5863 isl_hash_hash(hash, c_hash);
5865 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5866 for (i = 0; i < bset->n_ineq; ++i) {
5868 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
5869 isl_hash_hash(hash, c_hash);
5871 isl_hash_byte(hash, bset->n_div & 0xFF);
5872 for (i = 0; i < bset->n_div; ++i) {
5874 if (isl_int_is_zero(bset->div[i][0]))
5876 isl_hash_byte(hash, i & 0xFF);
5877 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
5878 isl_hash_hash(hash, c_hash);
5880 isl_basic_set_free(bset);
5884 uint32_t isl_set_get_hash(struct isl_set *set)
5891 set = isl_set_copy(set);
5892 set = isl_set_normalize(set);
5896 hash = isl_hash_init();
5897 for (i = 0; i < set->n; ++i) {
5899 bset_hash = isl_basic_set_get_hash(set->p[i]);
5900 isl_hash_hash(hash, bset_hash);
5908 /* Check if the value for dimension dim is completely determined
5909 * by the values of the other parameters and variables.
5910 * That is, check if dimension dim is involved in an equality.
5912 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
5919 nparam = isl_basic_set_n_param(bset);
5920 for (i = 0; i < bset->n_eq; ++i)
5921 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
5926 /* Check if the value for dimension dim is completely determined
5927 * by the values of the other parameters and variables.
5928 * That is, check if dimension dim is involved in an equality
5929 * for each of the subsets.
5931 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
5937 for (i = 0; i < set->n; ++i) {
5939 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
5946 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
5947 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
5954 for (i = 0; i < map->n; ++i)
5955 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
5961 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
5962 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
5969 for (i = 0; i < set->n; ++i)
5970 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
5976 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
5978 struct isl_dim *dim;
5979 struct isl_basic_map *bmap;
5986 set = isl_set_align_divs(set);
5991 dim = isl_set_get_dim(set);
5992 if (set->n == 0 || set->p[0]->n_div == 0) {
5994 return isl_map_identity(dim);
5997 n_div = set->p[0]->n_div;
5998 dim = isl_dim_map(dim);
5999 n_param = isl_dim_size(dim, isl_dim_param);
6000 n_set = isl_dim_size(dim, isl_dim_in);
6001 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6002 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6003 for (i = 0; i < n_set; ++i)
6004 bmap = var_equal(bmap, i);
6006 total = n_param + n_set + n_set + n_div;
6007 for (i = 0; i < n_div; ++i) {
6008 k = isl_basic_map_alloc_inequality(bmap);
6011 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6012 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6013 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6014 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6015 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6016 set->p[0]->div[i][0]);
6018 l = isl_basic_map_alloc_inequality(bmap);
6021 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6022 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6023 set->p[0]->div[i][0]);
6024 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6028 return isl_map_from_basic_map(bmap);
6031 isl_basic_map_free(bmap);
6035 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6043 dim = isl_basic_set_total_dim(bset);
6044 size += bset->n_eq * (1 + dim);
6045 size += bset->n_ineq * (1 + dim);
6046 size += bset->n_div * (2 + dim);
6051 int isl_set_size(__isl_keep isl_set *set)
6059 for (i = 0; i < set->n; ++i)
6060 size += isl_basic_set_size(set->p[i]);