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"
29 #include <isl_dim_private.h>
31 /* Maps dst positions to src positions */
37 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
40 struct isl_dim_map *dim_map;
41 dim_map = isl_alloc(ctx, struct isl_dim_map,
42 sizeof(struct isl_dim_map) + len * sizeof(int));
45 dim_map->len = 1 + len;
47 for (i = 0; i < len; ++i)
48 dim_map->pos[1 + i] = -1;
52 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
55 case isl_dim_param: return dim->nparam;
56 case isl_dim_in: return dim->n_in;
57 case isl_dim_out: return dim->n_out;
58 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
62 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
65 case isl_dim_param: return 1;
66 case isl_dim_in: return 1 + dim->nparam;
67 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
71 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
72 struct isl_dim *dim, enum isl_dim_type type,
73 unsigned first, unsigned n, unsigned dst_pos)
81 src_pos = pos(dim, type);
82 for (i = 0; i < n; ++i)
83 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
86 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
87 enum isl_dim_type type, unsigned dst_pos)
89 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
92 static void isl_dim_map_div(struct isl_dim_map *dim_map,
93 struct isl_basic_map *bmap, unsigned dst_pos)
98 if (!dim_map || !bmap)
101 src_pos = 1 + isl_dim_total(bmap->dim);
102 for (i = 0; i < bmap->n_div; ++i)
103 dim_map->pos[1 + dst_pos + i] = src_pos + i;
106 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
110 for (i = 0; i < dim_map->len; ++i)
111 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
112 fprintf(stderr, "\n");
115 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
116 enum isl_dim_type type)
121 case isl_dim_out: return isl_dim_size(bmap->dim, type);
122 case isl_dim_div: return bmap->n_div;
123 case isl_dim_all: return isl_basic_map_total_dim(bmap);
127 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
129 return map ? n(map->dim, type) : 0;
132 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
134 return set ? n(set->dim, type) : 0;
137 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
138 enum isl_dim_type type)
140 struct isl_dim *dim = bmap->dim;
142 case isl_dim_param: return 1;
143 case isl_dim_in: return 1 + dim->nparam;
144 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
145 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
149 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
151 return pos(map->dim, type);
154 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
155 enum isl_dim_type type)
157 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
160 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
162 return bset->dim->n_out;
165 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
167 return bset->dim->nparam;
170 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
172 return isl_dim_total(bset->dim) + bset->n_div;
175 unsigned isl_set_n_dim(const struct isl_set *set)
177 return set->dim->n_out;
180 unsigned isl_set_n_param(const struct isl_set *set)
182 return set->dim->nparam;
185 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
187 return bmap->dim->n_in;
190 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
192 return bmap->dim->n_out;
195 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
197 return bmap->dim->nparam;
200 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
205 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
207 return isl_dim_total(bmap->dim) + bmap->n_div;
210 unsigned isl_map_n_in(const struct isl_map *map)
212 return map->dim->n_in;
215 unsigned isl_map_n_out(const struct isl_map *map)
217 return map->dim->n_out;
220 unsigned isl_map_n_param(const struct isl_map *map)
222 return map->dim->nparam;
225 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
227 return map->dim->n_in == set->dim->n_out &&
228 map->dim->nparam == set->dim->nparam;
231 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
232 struct isl_basic_set *bset)
234 return bmap->dim->n_in == bset->dim->n_out &&
235 bmap->dim->nparam == bset->dim->nparam;
238 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
239 struct isl_basic_set *bset)
241 return bmap->dim->n_out == bset->dim->n_out &&
242 bmap->dim->nparam == bset->dim->nparam;
245 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
249 return isl_dim_copy(bmap->dim);
252 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
256 return isl_dim_copy(bset->dim);
259 struct isl_dim *isl_map_get_dim(struct isl_map *map)
263 return isl_dim_copy(map->dim);
266 struct isl_dim *isl_set_get_dim(struct isl_set *set)
270 return isl_dim_copy(set->dim);
273 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
274 struct isl_basic_map *bmap, unsigned extra,
275 unsigned n_eq, unsigned n_ineq)
278 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
280 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
281 if (isl_blk_is_error(bmap->block)) {
286 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
288 isl_blk_free(ctx, bmap->block);
294 bmap->block2 = isl_blk_empty();
297 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
298 if (isl_blk_is_error(bmap->block2)) {
300 isl_blk_free(ctx, bmap->block);
305 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
307 isl_blk_free(ctx, bmap->block2);
309 isl_blk_free(ctx, bmap->block);
315 for (i = 0; i < n_ineq + n_eq; ++i)
316 bmap->ineq[i] = bmap->block.data + i * row_size;
318 for (i = 0; i < extra; ++i)
319 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
325 bmap->c_size = n_eq + n_ineq;
326 bmap->eq = bmap->ineq + n_ineq;
335 isl_basic_map_free(bmap);
339 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
340 unsigned nparam, unsigned dim, unsigned extra,
341 unsigned n_eq, unsigned n_ineq)
343 struct isl_basic_map *bmap;
344 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
345 return (struct isl_basic_set *)bmap;
348 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
349 unsigned extra, unsigned n_eq, unsigned n_ineq)
351 struct isl_basic_map *bmap;
354 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
355 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
356 return (struct isl_basic_set *)bmap;
359 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
360 unsigned extra, unsigned n_eq, unsigned n_ineq)
362 struct isl_basic_map *bmap;
366 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
371 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
377 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
378 unsigned nparam, unsigned in, unsigned out, unsigned extra,
379 unsigned n_eq, unsigned n_ineq)
381 struct isl_basic_map *bmap;
384 dim = isl_dim_alloc(ctx, nparam, in, out);
388 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
392 static void dup_constraints(
393 struct isl_basic_map *dst, struct isl_basic_map *src)
396 unsigned total = isl_basic_map_total_dim(src);
398 for (i = 0; i < src->n_eq; ++i) {
399 int j = isl_basic_map_alloc_equality(dst);
400 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
403 for (i = 0; i < src->n_ineq; ++i) {
404 int j = isl_basic_map_alloc_inequality(dst);
405 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
408 for (i = 0; i < src->n_div; ++i) {
409 int j = isl_basic_map_alloc_div(dst);
410 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
412 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
415 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
417 struct isl_basic_map *dup;
421 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
422 bmap->n_div, bmap->n_eq, bmap->n_ineq);
425 dup_constraints(dup, bmap);
426 dup->flags = bmap->flags;
427 dup->sample = isl_vec_copy(bmap->sample);
431 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
433 struct isl_basic_map *dup;
435 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
436 return (struct isl_basic_set *)dup;
439 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
444 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
448 return isl_basic_set_dup(bset);
451 struct isl_set *isl_set_copy(struct isl_set *set)
460 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
465 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
469 return isl_basic_map_dup(bmap);
472 struct isl_map *isl_map_copy(struct isl_map *map)
481 void isl_basic_map_free(struct isl_basic_map *bmap)
489 isl_ctx_deref(bmap->ctx);
491 isl_blk_free(bmap->ctx, bmap->block2);
493 isl_blk_free(bmap->ctx, bmap->block);
494 isl_vec_free(bmap->sample);
495 isl_dim_free(bmap->dim);
499 void isl_basic_set_free(struct isl_basic_set *bset)
501 isl_basic_map_free((struct isl_basic_map *)bset);
504 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
506 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
509 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
515 isl_assert(ctx, room_for_con(bmap, 1), return -1);
516 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
518 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
519 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
520 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
521 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
522 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
523 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
525 int j = isl_basic_map_alloc_inequality(bmap);
529 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
530 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
537 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
538 bmap->extra - bmap->n_div);
542 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
544 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
547 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
551 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
556 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
558 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
561 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
566 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
568 if (pos != bmap->n_eq - 1) {
570 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
571 bmap->eq[bmap->n_eq - 1] = t;
577 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
579 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
582 void isl_basic_map_inequality_to_equality(
583 struct isl_basic_map *bmap, unsigned pos)
588 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
589 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
594 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
595 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
596 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
597 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
600 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
602 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
605 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
611 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
612 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
613 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
614 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
615 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
616 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
617 1 + isl_basic_map_total_dim(bmap),
618 bmap->extra - bmap->n_div);
619 return bmap->n_ineq++;
622 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
624 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
627 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
631 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
636 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
638 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
641 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
646 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
648 if (pos != bmap->n_ineq - 1) {
650 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
651 bmap->ineq[bmap->n_ineq - 1] = t;
652 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
658 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
660 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
663 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
668 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
671 k = isl_basic_map_alloc_equality(bmap);
674 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
677 isl_basic_map_free(bmap);
681 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
684 return (isl_basic_set *)
685 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
688 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
693 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
696 k = isl_basic_map_alloc_inequality(bmap);
699 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
702 isl_basic_map_free(bmap);
706 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
709 return (isl_basic_set *)
710 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
713 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
717 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
718 isl_seq_clr(bmap->div[bmap->n_div] +
719 1 + 1 + isl_basic_map_total_dim(bmap),
720 bmap->extra - bmap->n_div);
721 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
722 return bmap->n_div++;
725 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
727 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
730 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
734 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
739 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
741 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
744 /* Copy constraint from src to dst, putting the vars of src at offset
745 * dim_off in dst and the divs of src at offset div_off in dst.
746 * If both sets are actually map, then dim_off applies to the input
749 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
750 struct isl_basic_map *src_map, isl_int *src,
751 unsigned in_off, unsigned out_off, unsigned div_off)
753 unsigned src_nparam = isl_basic_map_n_param(src_map);
754 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
755 unsigned src_in = isl_basic_map_n_in(src_map);
756 unsigned dst_in = isl_basic_map_n_in(dst_map);
757 unsigned src_out = isl_basic_map_n_out(src_map);
758 unsigned dst_out = isl_basic_map_n_out(dst_map);
759 isl_int_set(dst[0], src[0]);
760 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
761 if (dst_nparam > src_nparam)
762 isl_seq_clr(dst+1+src_nparam,
763 dst_nparam - src_nparam);
764 isl_seq_clr(dst+1+dst_nparam, in_off);
765 isl_seq_cpy(dst+1+dst_nparam+in_off,
767 isl_min(dst_in-in_off, src_in));
768 if (dst_in-in_off > src_in)
769 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
770 dst_in - in_off - src_in);
771 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
772 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
773 src+1+src_nparam+src_in,
774 isl_min(dst_out-out_off, src_out));
775 if (dst_out-out_off > src_out)
776 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
777 dst_out - out_off - src_out);
778 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
779 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
780 src+1+src_nparam+src_in+src_out,
781 isl_min(dst_map->extra-div_off, src_map->n_div));
782 if (dst_map->n_div-div_off > src_map->n_div)
783 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
784 div_off+src_map->n_div,
785 dst_map->n_div - div_off - src_map->n_div);
788 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
789 struct isl_basic_map *src_map, isl_int *src,
790 unsigned in_off, unsigned out_off, unsigned div_off)
792 isl_int_set(dst[0], src[0]);
793 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
796 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
797 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
802 if (!bmap1 || !bmap2)
805 div_off = bmap1->n_div;
807 for (i = 0; i < bmap2->n_eq; ++i) {
808 int i1 = isl_basic_map_alloc_equality(bmap1);
811 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
812 i_pos, o_pos, div_off);
815 for (i = 0; i < bmap2->n_ineq; ++i) {
816 int i1 = isl_basic_map_alloc_inequality(bmap1);
819 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
820 i_pos, o_pos, div_off);
823 for (i = 0; i < bmap2->n_div; ++i) {
824 int i1 = isl_basic_map_alloc_div(bmap1);
827 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
828 i_pos, o_pos, div_off);
831 isl_basic_map_free(bmap2);
836 isl_basic_map_free(bmap1);
837 isl_basic_map_free(bmap2);
841 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
842 struct isl_dim_map *dim_map)
846 for (i = 0; i < dim_map->len; ++i) {
847 if (dim_map->pos[i] < 0)
848 isl_int_set_si(dst[i], 0);
850 isl_int_set(dst[i], src[dim_map->pos[i]]);
854 static void copy_div_dim_map(isl_int *dst, isl_int *src,
855 struct isl_dim_map *dim_map)
857 isl_int_set(dst[0], src[0]);
858 copy_constraint_dim_map(dst+1, src+1, dim_map);
861 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
862 struct isl_basic_map *src, struct isl_dim_map *dim_map)
866 if (!src || !dst || !dim_map)
869 for (i = 0; i < src->n_eq; ++i) {
870 int i1 = isl_basic_map_alloc_equality(dst);
873 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
876 for (i = 0; i < src->n_ineq; ++i) {
877 int i1 = isl_basic_map_alloc_inequality(dst);
880 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
883 for (i = 0; i < src->n_div; ++i) {
884 int i1 = isl_basic_map_alloc_div(dst);
887 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
891 isl_basic_map_free(src);
896 isl_basic_map_free(src);
897 isl_basic_map_free(dst);
901 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
902 struct isl_basic_set *bset2, unsigned pos)
904 return (struct isl_basic_set *)
905 add_constraints((struct isl_basic_map *)bset1,
906 (struct isl_basic_map *)bset2, 0, pos);
909 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
910 struct isl_dim *dim, unsigned extra,
911 unsigned n_eq, unsigned n_ineq)
913 struct isl_basic_map *ext;
923 dims_ok = isl_dim_equal(base->dim, dim) &&
924 base->extra >= base->n_div + extra;
926 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
927 room_for_ineq(base, n_ineq)) {
932 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
933 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
934 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
935 extra += base->extra;
937 n_ineq += base->n_ineq;
939 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
945 ext->sample = isl_vec_copy(base->sample);
947 ext = add_constraints(ext, base, 0, 0);
950 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
957 isl_basic_map_free(base);
961 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
962 struct isl_dim *dim, unsigned extra,
963 unsigned n_eq, unsigned n_ineq)
965 return (struct isl_basic_set *)
966 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
967 extra, n_eq, n_ineq);
970 struct isl_basic_map *isl_basic_map_extend_constraints(
971 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
975 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
979 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
980 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
981 unsigned n_eq, unsigned n_ineq)
983 struct isl_basic_map *bmap;
988 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
992 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
996 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
997 unsigned nparam, unsigned dim, unsigned extra,
998 unsigned n_eq, unsigned n_ineq)
1000 return (struct isl_basic_set *)
1001 isl_basic_map_extend((struct isl_basic_map *)base,
1002 nparam, 0, dim, extra, n_eq, n_ineq);
1005 struct isl_basic_set *isl_basic_set_extend_constraints(
1006 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1008 return (struct isl_basic_set *)
1009 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1013 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1015 return (struct isl_basic_set *)
1016 isl_basic_map_cow((struct isl_basic_map *)bset);
1019 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1024 if (bmap->ref > 1) {
1026 bmap = isl_basic_map_dup(bmap);
1028 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1032 struct isl_set *isl_set_cow(struct isl_set *set)
1040 return isl_set_dup(set);
1043 struct isl_map *isl_map_cow(struct isl_map *map)
1051 return isl_map_dup(map);
1054 static void swap_vars(struct isl_blk blk, isl_int *a,
1055 unsigned a_len, unsigned b_len)
1057 isl_seq_cpy(blk.data, a+a_len, b_len);
1058 isl_seq_cpy(blk.data+b_len, a, a_len);
1059 isl_seq_cpy(a, blk.data, b_len+a_len);
1062 struct isl_basic_set *isl_basic_set_swap_vars(
1063 struct isl_basic_set *bset, unsigned n)
1073 nparam = isl_basic_set_n_param(bset);
1074 dim = isl_basic_set_n_dim(bset);
1075 isl_assert(bset->ctx, n <= dim, goto error);
1080 bset = isl_basic_set_cow(bset);
1084 blk = isl_blk_alloc(bset->ctx, dim);
1085 if (isl_blk_is_error(blk))
1088 for (i = 0; i < bset->n_eq; ++i)
1090 bset->eq[i]+1+nparam, n, dim - n);
1092 for (i = 0; i < bset->n_ineq; ++i)
1094 bset->ineq[i]+1+nparam, n, dim - n);
1096 for (i = 0; i < bset->n_div; ++i)
1098 bset->div[i]+1+1+nparam, n, dim - n);
1100 isl_blk_free(bset->ctx, blk);
1102 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1103 return isl_basic_set_gauss(bset, NULL);
1105 isl_basic_set_free(bset);
1109 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1112 set = isl_set_cow(set);
1116 for (i = 0; i < set->n; ++i) {
1117 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1123 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1127 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1133 total = isl_basic_map_total_dim(bmap);
1134 isl_basic_map_free_div(bmap, bmap->n_div);
1135 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1137 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1139 isl_basic_map_alloc_equality(bmap);
1143 isl_int_set_si(bmap->eq[i][0], 1);
1144 isl_seq_clr(bmap->eq[i]+1, total);
1145 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1146 isl_vec_free(bmap->sample);
1147 bmap->sample = NULL;
1148 return isl_basic_map_finalize(bmap);
1150 isl_basic_map_free(bmap);
1154 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1156 return (struct isl_basic_set *)
1157 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1160 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1163 unsigned off = isl_dim_total(bmap->dim);
1164 isl_int *t = bmap->div[a];
1165 bmap->div[a] = bmap->div[b];
1168 for (i = 0; i < bmap->n_eq; ++i)
1169 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1171 for (i = 0; i < bmap->n_ineq; ++i)
1172 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1174 for (i = 0; i < bmap->n_div; ++i)
1175 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1176 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1179 /* Eliminate the specified n dimensions starting at first from the
1180 * constraints using Fourier-Motzkin. The dimensions themselves
1183 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1184 enum isl_dim_type type, unsigned first, unsigned n)
1193 map = isl_map_cow(map);
1196 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1197 first += pos(map->dim, type) - 1;
1199 for (i = 0; i < map->n; ++i) {
1200 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1210 /* Eliminate the specified n dimensions starting at first from the
1211 * constraints using Fourier-Motzkin. The dimensions themselves
1214 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1215 enum isl_dim_type type, unsigned first, unsigned n)
1217 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1220 /* Eliminate the specified n dimensions starting at first from the
1221 * constraints using Fourier-Motzkin. The dimensions themselves
1224 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1225 unsigned first, unsigned n)
1227 return isl_set_eliminate(set, isl_dim_set, first, n);
1230 /* Project out n dimensions starting at first using Fourier-Motzkin */
1231 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1232 unsigned first, unsigned n)
1234 set = isl_set_eliminate_dims(set, first, n);
1235 set = isl_set_drop_dims(set, first, n);
1239 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1241 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1249 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1258 set = isl_set_cow(set);
1262 for (i = 0; i < set->n; ++i) {
1263 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1273 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1274 enum isl_dim_type type, unsigned first, unsigned n)
1278 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1282 bmap = isl_basic_map_eliminate_vars(bmap,
1283 isl_basic_map_offset(bmap, type) - 1 + first, n);
1286 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1288 bmap = isl_basic_map_drop(bmap, type, first, n);
1291 isl_basic_map_free(bmap);
1295 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1296 enum isl_dim_type type, unsigned first, unsigned n)
1298 return (isl_basic_set *)
1299 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1302 struct isl_map *isl_map_remove(struct isl_map *map,
1303 enum isl_dim_type type, unsigned first, unsigned n)
1310 map = isl_map_cow(map);
1313 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1315 for (i = 0; i < map->n; ++i) {
1316 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1317 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1321 map = isl_map_drop(map, type, first, n);
1328 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1329 enum isl_dim_type type, unsigned first, unsigned n)
1331 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1334 /* Project out n inputs starting at first using Fourier-Motzkin */
1335 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1336 unsigned first, unsigned n)
1338 return isl_map_remove(map, isl_dim_in, first, n);
1341 /* Project out n dimensions starting at first using Fourier-Motzkin */
1342 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1343 unsigned first, unsigned n)
1345 unsigned nparam = isl_basic_set_n_param(bset);
1346 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1347 bset = isl_basic_set_drop_dims(bset, first, n);
1351 static void dump_term(struct isl_basic_map *bmap,
1352 isl_int c, int pos, FILE *out)
1355 unsigned in = isl_basic_map_n_in(bmap);
1356 unsigned dim = in + isl_basic_map_n_out(bmap);
1357 unsigned nparam = isl_basic_map_n_param(bmap);
1359 isl_int_print(out, c, 0);
1361 if (!isl_int_is_one(c))
1362 isl_int_print(out, c, 0);
1363 if (pos < 1 + nparam) {
1364 name = isl_dim_get_name(bmap->dim,
1365 isl_dim_param, pos - 1);
1367 fprintf(out, "%s", name);
1369 fprintf(out, "p%d", pos - 1);
1370 } else if (pos < 1 + nparam + in)
1371 fprintf(out, "i%d", pos - 1 - nparam);
1372 else if (pos < 1 + nparam + dim)
1373 fprintf(out, "o%d", pos - 1 - nparam - in);
1375 fprintf(out, "e%d", pos - 1 - nparam - dim);
1379 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1380 int sign, FILE *out)
1384 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1388 for (i = 0, first = 1; i < len; ++i) {
1389 if (isl_int_sgn(c[i]) * sign <= 0)
1392 fprintf(out, " + ");
1394 isl_int_abs(v, c[i]);
1395 dump_term(bmap, v, i, out);
1402 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1403 const char *op, FILE *out, int indent)
1407 fprintf(out, "%*s", indent, "");
1409 dump_constraint_sign(bmap, c, 1, out);
1410 fprintf(out, " %s ", op);
1411 dump_constraint_sign(bmap, c, -1, out);
1415 for (i = bmap->n_div; i < bmap->extra; ++i) {
1416 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1418 fprintf(out, "%*s", indent, "");
1419 fprintf(out, "ERROR: unused div coefficient not zero\n");
1424 static void dump_constraints(struct isl_basic_map *bmap,
1425 isl_int **c, unsigned n,
1426 const char *op, FILE *out, int indent)
1430 for (i = 0; i < n; ++i)
1431 dump_constraint(bmap, c[i], op, out, indent);
1434 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1438 unsigned total = isl_basic_map_total_dim(bmap);
1440 for (j = 0; j < 1 + total; ++j) {
1441 if (isl_int_is_zero(exp[j]))
1443 if (!first && isl_int_is_pos(exp[j]))
1445 dump_term(bmap, exp[j], j, out);
1450 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1454 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1455 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1457 for (i = 0; i < bmap->n_div; ++i) {
1458 fprintf(out, "%*s", indent, "");
1459 fprintf(out, "e%d = [(", i);
1460 dump_affine(bmap, bmap->div[i]+1, out);
1462 isl_int_print(out, bmap->div[i][0], 0);
1463 fprintf(out, "]\n");
1467 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1470 fprintf(out, "null basic set\n");
1474 fprintf(out, "%*s", indent, "");
1475 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1476 bset->ref, bset->dim->nparam, bset->dim->n_out,
1477 bset->extra, bset->flags);
1478 dump((struct isl_basic_map *)bset, out, indent);
1481 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1484 fprintf(out, "null basic map\n");
1488 fprintf(out, "%*s", indent, "");
1489 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1490 "flags: %x, n_name: %d\n",
1492 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1493 bmap->extra, bmap->flags, bmap->dim->n_name);
1494 dump(bmap, out, indent);
1497 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1502 total = isl_basic_map_total_dim(bmap);
1503 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1504 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1505 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1506 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1510 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1512 struct isl_set *set;
1516 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1517 isl_assert(dim->ctx, n >= 0, return NULL);
1518 set = isl_alloc(dim->ctx, struct isl_set,
1519 sizeof(struct isl_set) +
1520 (n - 1) * sizeof(struct isl_basic_set *));
1524 set->ctx = dim->ctx;
1525 isl_ctx_ref(set->ctx);
1537 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1538 unsigned nparam, unsigned dim, int n, unsigned flags)
1540 struct isl_set *set;
1541 struct isl_dim *dims;
1543 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1547 set = isl_set_alloc_dim(dims, n, flags);
1551 /* Make sure "map" has room for at least "n" more basic maps.
1553 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1556 struct isl_map *grown = NULL;
1560 isl_assert(map->ctx, n >= 0, goto error);
1561 if (map->n + n <= map->size)
1563 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1566 for (i = 0; i < map->n; ++i) {
1567 grown->p[i] = isl_basic_map_copy(map->p[i]);
1575 isl_map_free(grown);
1580 /* Make sure "set" has room for at least "n" more basic sets.
1582 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1584 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1587 struct isl_set *isl_set_dup(struct isl_set *set)
1590 struct isl_set *dup;
1595 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1598 for (i = 0; i < set->n; ++i)
1599 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1603 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1605 struct isl_set *set;
1610 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1612 isl_basic_set_free(bset);
1615 return isl_set_add_basic_set(set, bset);
1618 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1620 struct isl_map *map;
1625 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1627 isl_basic_map_free(bmap);
1630 return isl_map_add_basic_map(map, bmap);
1633 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1634 __isl_take isl_basic_set *bset)
1636 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1637 (struct isl_basic_map *)bset);
1640 void isl_set_free(struct isl_set *set)
1650 isl_ctx_deref(set->ctx);
1651 for (i = 0; i < set->n; ++i)
1652 isl_basic_set_free(set->p[i]);
1653 isl_dim_free(set->dim);
1657 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1662 fprintf(out, "null set\n");
1666 fprintf(out, "%*s", indent, "");
1667 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1668 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1670 for (i = 0; i < set->n; ++i) {
1671 fprintf(out, "%*s", indent, "");
1672 fprintf(out, "basic set %d:\n", i);
1673 isl_basic_set_dump(set->p[i], out, indent+4);
1677 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1682 fprintf(out, "null map\n");
1686 fprintf(out, "%*s", indent, "");
1687 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1688 "flags: %x, n_name: %d\n",
1689 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1690 map->dim->n_out, map->flags, map->dim->n_name);
1691 for (i = 0; i < map->n; ++i) {
1692 fprintf(out, "%*s", indent, "");
1693 fprintf(out, "basic map %d:\n", i);
1694 isl_basic_map_dump(map->p[i], out, indent+4);
1698 struct isl_basic_map *isl_basic_map_intersect_domain(
1699 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1701 struct isl_basic_map *bmap_domain;
1702 struct isl_dim *dim;
1707 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1708 bset->dim, isl_dim_param), goto error);
1710 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1711 isl_assert(bset->ctx,
1712 isl_basic_map_compatible_domain(bmap, bset), goto error);
1714 bmap = isl_basic_map_cow(bmap);
1715 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1716 bset->n_div, bset->n_eq, bset->n_ineq);
1719 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1720 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1721 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1723 bmap = isl_basic_map_simplify(bmap);
1724 return isl_basic_map_finalize(bmap);
1726 isl_basic_map_free(bmap);
1727 isl_basic_set_free(bset);
1731 struct isl_basic_map *isl_basic_map_intersect_range(
1732 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1734 struct isl_basic_map *bmap_range;
1739 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1740 bset->dim, isl_dim_param), goto error);
1742 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1743 isl_assert(bset->ctx,
1744 isl_basic_map_compatible_range(bmap, bset), goto error);
1746 bmap = isl_basic_map_cow(bmap);
1747 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1748 bset->n_div, bset->n_eq, bset->n_ineq);
1751 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1752 bmap = add_constraints(bmap, bmap_range, 0, 0);
1754 bmap = isl_basic_map_simplify(bmap);
1755 return isl_basic_map_finalize(bmap);
1757 isl_basic_map_free(bmap);
1758 isl_basic_set_free(bset);
1762 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1768 total = 1 + isl_basic_map_total_dim(bmap);
1769 if (total != vec->size)
1774 for (i = 0; i < bmap->n_eq; ++i) {
1775 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1776 if (!isl_int_is_zero(s)) {
1782 for (i = 0; i < bmap->n_ineq; ++i) {
1783 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1784 if (isl_int_is_neg(s)) {
1795 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1797 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1800 struct isl_basic_map *isl_basic_map_intersect(
1801 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1803 struct isl_vec *sample = NULL;
1805 if (!bmap1 || !bmap2)
1808 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1809 bmap2->dim, isl_dim_param), goto error);
1810 if (isl_dim_total(bmap1->dim) ==
1811 isl_dim_size(bmap1->dim, isl_dim_param) &&
1812 isl_dim_total(bmap2->dim) !=
1813 isl_dim_size(bmap2->dim, isl_dim_param))
1814 return isl_basic_map_intersect(bmap2, bmap1);
1816 if (isl_dim_total(bmap2->dim) !=
1817 isl_dim_size(bmap2->dim, isl_dim_param))
1818 isl_assert(bmap1->ctx,
1819 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1821 if (bmap1->sample &&
1822 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1823 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1824 sample = isl_vec_copy(bmap1->sample);
1825 else if (bmap2->sample &&
1826 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1827 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1828 sample = isl_vec_copy(bmap2->sample);
1830 bmap1 = isl_basic_map_cow(bmap1);
1831 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1832 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1835 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1838 isl_vec_free(bmap1->sample);
1839 bmap1->sample = sample;
1842 bmap1 = isl_basic_map_simplify(bmap1);
1843 return isl_basic_map_finalize(bmap1);
1846 isl_vec_free(sample);
1847 isl_basic_map_free(bmap1);
1848 isl_basic_map_free(bmap2);
1852 struct isl_basic_set *isl_basic_set_intersect(
1853 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1855 return (struct isl_basic_set *)
1856 isl_basic_map_intersect(
1857 (struct isl_basic_map *)bset1,
1858 (struct isl_basic_map *)bset2);
1861 /* Special case of isl_map_intersect, where both map1 and map2
1862 * are convex, without any divs and such that either map1 or map2
1863 * contains a single constraint. This constraint is then simply
1864 * added to the other map.
1866 static __isl_give isl_map *map_intersect_add_constraint(
1867 __isl_take isl_map *map1, __isl_take isl_map *map2)
1869 struct isl_basic_map *bmap1;
1870 struct isl_basic_map *bmap2;
1872 isl_assert(map1->ctx, map1->n == 1, goto error);
1873 isl_assert(map2->ctx, map1->n == 1, goto error);
1874 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1875 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1877 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1878 return isl_map_intersect(map2, map1);
1880 isl_assert(map2->ctx,
1881 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1883 map1 = isl_map_cow(map1);
1886 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1887 if (map2->p[0]->n_eq == 1)
1888 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1890 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1891 map2->p[0]->ineq[0]);
1893 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1894 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1898 if (isl_basic_map_fast_is_empty(map1->p[0])) {
1899 isl_basic_map_free(map1->p[0]);
1912 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1915 struct isl_map *result;
1921 if (map1->n == 1 && map2->n == 1 &&
1922 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1923 isl_dim_equal(map1->dim, map2->dim) &&
1924 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1925 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1926 return map_intersect_add_constraint(map1, map2);
1927 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1928 map2->dim, isl_dim_param), goto error);
1929 if (isl_dim_total(map1->dim) ==
1930 isl_dim_size(map1->dim, isl_dim_param) &&
1931 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1932 return isl_map_intersect(map2, map1);
1934 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1935 isl_assert(map1->ctx,
1936 isl_dim_equal(map1->dim, map2->dim), goto error);
1938 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1939 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1940 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1942 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1943 map1->n * map2->n, flags);
1946 for (i = 0; i < map1->n; ++i)
1947 for (j = 0; j < map2->n; ++j) {
1948 struct isl_basic_map *part;
1949 part = isl_basic_map_intersect(
1950 isl_basic_map_copy(map1->p[i]),
1951 isl_basic_map_copy(map2->p[j]));
1952 if (isl_basic_map_is_empty(part))
1953 isl_basic_map_free(part);
1955 result = isl_map_add_basic_map(result, part);
1968 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1970 return (struct isl_set *)
1971 isl_map_intersect((struct isl_map *)set1,
1972 (struct isl_map *)set2);
1975 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1977 struct isl_dim *dim;
1978 struct isl_basic_set *bset;
1983 bmap = isl_basic_map_cow(bmap);
1986 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1987 in = isl_basic_map_n_in(bmap);
1988 bset = isl_basic_set_from_basic_map(bmap);
1989 bset = isl_basic_set_swap_vars(bset, in);
1990 return isl_basic_map_from_basic_set(bset, dim);
1993 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
1994 enum isl_dim_type type, unsigned pos, unsigned n)
1996 struct isl_dim *res_dim;
1997 struct isl_basic_map *res;
1998 struct isl_dim_map *dim_map;
1999 unsigned total, off;
2000 enum isl_dim_type t;
2008 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2010 total = isl_basic_map_total_dim(bmap) + n;
2011 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2013 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2015 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2017 unsigned size = isl_basic_map_dim(bmap, t);
2018 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2020 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2021 pos, size - pos, off + pos + n);
2023 off += isl_dim_size(res_dim, t);
2025 isl_dim_map_div(dim_map, bmap, off);
2027 res = isl_basic_map_alloc_dim(res_dim,
2028 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2029 res = add_constraints_dim_map(res, bmap, dim_map);
2030 res = isl_basic_map_simplify(res);
2031 return isl_basic_map_finalize(res);
2034 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2035 enum isl_dim_type type, unsigned n)
2039 return isl_basic_map_insert(bmap, type,
2040 isl_basic_map_dim(bmap, type), n);
2043 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2044 enum isl_dim_type type, unsigned n)
2048 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2049 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2051 isl_basic_set_free(bset);
2055 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2056 enum isl_dim_type type, unsigned pos, unsigned n)
2063 map = isl_map_cow(map);
2067 map->dim = isl_dim_insert(map->dim, type, pos, n);
2071 for (i = 0; i < map->n; ++i) {
2072 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2083 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2084 enum isl_dim_type type, unsigned n)
2088 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2091 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2092 enum isl_dim_type type, unsigned n)
2096 isl_assert(set->ctx, type != isl_dim_in, goto error);
2097 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2103 __isl_give isl_basic_map *isl_basic_map_move(__isl_take isl_basic_map *bmap,
2104 enum isl_dim_type dst_type, unsigned dst_pos,
2105 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2108 struct isl_dim_map *dim_map;
2109 struct isl_basic_map *res;
2110 enum isl_dim_type t;
2111 unsigned total, off;
2118 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2121 if (dst_type == src_type && dst_pos == src_pos)
2124 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2126 if (pos(bmap->dim, dst_type) + dst_pos ==
2127 pos(bmap->dim, src_type) + src_pos +
2128 ((src_type < dst_type) ? n : 0)) {
2129 bmap = isl_basic_map_cow(bmap);
2133 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2134 src_type, src_pos, n);
2141 total = isl_basic_map_total_dim(bmap);
2142 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2145 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2146 unsigned size = isl_dim_size(bmap->dim, t);
2147 if (t == dst_type) {
2148 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2151 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2154 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2155 dst_pos, size - dst_pos, off);
2156 off += size - dst_pos;
2157 } else if (t == src_type) {
2158 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2161 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2162 src_pos + n, size - src_pos - n, off);
2163 off += size - src_pos - n;
2165 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2169 isl_dim_map_div(dim_map, bmap, off + n);
2171 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2172 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2173 bmap = add_constraints_dim_map(res, bmap, dim_map);
2175 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2176 src_type, src_pos, n);
2182 isl_basic_map_free(bmap);
2186 __isl_give isl_set *isl_set_move(__isl_take isl_set *set,
2187 enum isl_dim_type dst_type, unsigned dst_pos,
2188 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2192 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2193 return (isl_set *)isl_map_move((isl_map *)set, dst_type, dst_pos,
2194 src_type, src_pos, n);
2200 __isl_give isl_map *isl_map_move(__isl_take isl_map *map,
2201 enum isl_dim_type dst_type, unsigned dst_pos,
2202 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2211 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2214 if (dst_type == src_type && dst_pos == src_pos)
2217 isl_assert(map->ctx, dst_type != src_type, goto error);
2219 map = isl_map_cow(map);
2223 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2227 for (i = 0; i < map->n; ++i) {
2228 map->p[i] = isl_basic_map_move(map->p[i], dst_type, dst_pos,
2229 src_type, src_pos, n);
2240 /* Move the specified dimensions to the last columns right before
2241 * the divs. Don't change the dimension specification of bmap.
2242 * That's the responsibility of the caller.
2244 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2245 enum isl_dim_type type, unsigned first, unsigned n)
2247 struct isl_dim_map *dim_map;
2248 struct isl_basic_map *res;
2249 enum isl_dim_type t;
2250 unsigned total, off;
2254 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2257 total = isl_basic_map_total_dim(bmap);
2258 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2261 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2262 unsigned size = isl_dim_size(bmap->dim, t);
2264 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2267 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2268 first, n, total - bmap->n_div - n);
2269 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2270 first + n, size - (first + n), off);
2271 off += size - (first + n);
2273 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2277 isl_dim_map_div(dim_map, bmap, off + n);
2279 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2280 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2281 res = add_constraints_dim_map(res, bmap, dim_map);
2285 /* Turn the n dimensions of type type, starting at first
2286 * into existentially quantified variables.
2288 __isl_give isl_basic_map *isl_basic_map_project_out(
2289 __isl_take isl_basic_map *bmap,
2290 enum isl_dim_type type, unsigned first, unsigned n)
2303 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2304 return isl_basic_map_remove(bmap, type, first, n);
2306 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2309 bmap = move_last(bmap, type, first, n);
2310 bmap = isl_basic_map_cow(bmap);
2312 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2313 old = bmap->block2.data;
2314 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2315 (bmap->extra + n) * (1 + row_size));
2316 if (!bmap->block2.data)
2318 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2321 for (i = 0; i < n; ++i) {
2322 new_div[i] = bmap->block2.data +
2323 (bmap->extra + i) * (1 + row_size);
2324 isl_seq_clr(new_div[i], 1 + row_size);
2326 for (i = 0; i < bmap->extra; ++i)
2327 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2329 bmap->div = new_div;
2333 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2336 bmap = isl_basic_map_simplify(bmap);
2337 bmap = isl_basic_map_drop_redundant_divs(bmap);
2338 return isl_basic_map_finalize(bmap);
2340 isl_basic_map_free(bmap);
2344 /* Turn the n dimensions of type type, starting at first
2345 * into existentially quantified variables.
2347 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2348 enum isl_dim_type type, unsigned first, unsigned n)
2350 return (isl_basic_set *)isl_basic_map_project_out(
2351 (isl_basic_map *)bset, type, first, n);
2354 /* Turn the n dimensions of type type, starting at first
2355 * into existentially quantified variables.
2357 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2358 enum isl_dim_type type, unsigned first, unsigned n)
2368 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2370 map = isl_map_cow(map);
2374 map->dim = isl_dim_drop(map->dim, type, first, n);
2378 for (i = 0; i < map->n; ++i) {
2379 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2390 /* Turn the n dimensions of type type, starting at first
2391 * into existentially quantified variables.
2393 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2394 enum isl_dim_type type, unsigned first, unsigned n)
2396 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2399 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2403 for (i = 0; i < n; ++i) {
2404 j = isl_basic_map_alloc_div(bmap);
2407 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2411 isl_basic_map_free(bmap);
2415 struct isl_basic_map *isl_basic_map_apply_range(
2416 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2418 struct isl_dim *dim_result = NULL;
2419 struct isl_basic_map *bmap;
2420 unsigned n_in, n_out, n, nparam, total, pos;
2421 struct isl_dim_map *dim_map1, *dim_map2;
2423 if (!bmap1 || !bmap2)
2426 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2427 isl_dim_copy(bmap2->dim));
2429 n_in = isl_basic_map_n_in(bmap1);
2430 n_out = isl_basic_map_n_out(bmap2);
2431 n = isl_basic_map_n_out(bmap1);
2432 nparam = isl_basic_map_n_param(bmap1);
2434 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2435 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2436 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2437 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2438 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2439 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2440 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2441 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2442 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2443 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2444 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2446 bmap = isl_basic_map_alloc_dim(dim_result,
2447 bmap1->n_div + bmap2->n_div + n,
2448 bmap1->n_eq + bmap2->n_eq,
2449 bmap1->n_ineq + bmap2->n_ineq);
2450 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2451 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2452 bmap = add_divs(bmap, n);
2453 bmap = isl_basic_map_simplify(bmap);
2454 bmap = isl_basic_map_drop_redundant_divs(bmap);
2455 return isl_basic_map_finalize(bmap);
2457 isl_basic_map_free(bmap1);
2458 isl_basic_map_free(bmap2);
2462 struct isl_basic_set *isl_basic_set_apply(
2463 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2468 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2471 return (struct isl_basic_set *)
2472 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2474 isl_basic_set_free(bset);
2475 isl_basic_map_free(bmap);
2479 struct isl_basic_map *isl_basic_map_apply_domain(
2480 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2482 if (!bmap1 || !bmap2)
2485 isl_assert(bmap1->ctx,
2486 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2487 isl_assert(bmap1->ctx,
2488 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2491 bmap1 = isl_basic_map_reverse(bmap1);
2492 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2493 return isl_basic_map_reverse(bmap1);
2495 isl_basic_map_free(bmap1);
2496 isl_basic_map_free(bmap2);
2500 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2501 * A \cap B -> f(A) + f(B)
2503 struct isl_basic_map *isl_basic_map_sum(
2504 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2506 unsigned n_in, n_out, nparam, total, pos;
2507 struct isl_basic_map *bmap = NULL;
2508 struct isl_dim_map *dim_map1, *dim_map2;
2511 if (!bmap1 || !bmap2)
2514 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2517 nparam = isl_basic_map_n_param(bmap1);
2518 n_in = isl_basic_map_n_in(bmap1);
2519 n_out = isl_basic_map_n_out(bmap1);
2521 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2522 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2523 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2524 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2525 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2526 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2527 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2528 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2529 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2530 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2531 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2533 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2534 bmap1->n_div + bmap2->n_div + 2 * n_out,
2535 bmap1->n_eq + bmap2->n_eq + n_out,
2536 bmap1->n_ineq + bmap2->n_ineq);
2537 for (i = 0; i < n_out; ++i) {
2538 int j = isl_basic_map_alloc_equality(bmap);
2541 isl_seq_clr(bmap->eq[j], 1+total);
2542 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2543 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2544 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2546 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2547 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2548 bmap = add_divs(bmap, 2 * n_out);
2550 bmap = isl_basic_map_simplify(bmap);
2551 return isl_basic_map_finalize(bmap);
2553 isl_basic_map_free(bmap);
2554 isl_basic_map_free(bmap1);
2555 isl_basic_map_free(bmap2);
2559 /* Given two maps A -> f(A) and B -> g(B), construct a map
2560 * A \cap B -> f(A) + f(B)
2562 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2564 struct isl_map *result;
2570 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2572 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2573 map1->n * map2->n, 0);
2576 for (i = 0; i < map1->n; ++i)
2577 for (j = 0; j < map2->n; ++j) {
2578 struct isl_basic_map *part;
2579 part = isl_basic_map_sum(
2580 isl_basic_map_copy(map1->p[i]),
2581 isl_basic_map_copy(map2->p[j]));
2582 if (isl_basic_map_is_empty(part))
2583 isl_basic_map_free(part);
2585 result = isl_map_add_basic_map(result, part);
2598 /* Given a basic map A -> f(A), construct A -> -f(A).
2600 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2605 bmap = isl_basic_map_cow(bmap);
2609 n = isl_basic_map_dim(bmap, isl_dim_out);
2610 off = isl_basic_map_offset(bmap, isl_dim_out);
2611 for (i = 0; i < bmap->n_eq; ++i)
2612 for (j = 0; j < n; ++j)
2613 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2614 for (i = 0; i < bmap->n_ineq; ++i)
2615 for (j = 0; j < n; ++j)
2616 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2617 for (i = 0; i < bmap->n_div; ++i)
2618 for (j = 0; j < n; ++j)
2619 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2620 return isl_basic_map_finalize(bmap);
2623 /* Given a map A -> f(A), construct A -> -f(A).
2625 struct isl_map *isl_map_neg(struct isl_map *map)
2629 map = isl_map_cow(map);
2633 for (i = 0; i < map->n; ++i) {
2634 map->p[i] = isl_basic_map_neg(map->p[i]);
2645 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2646 * A -> floor(f(A)/d).
2648 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2651 unsigned n_in, n_out, nparam, total, pos;
2652 struct isl_basic_map *result = NULL;
2653 struct isl_dim_map *dim_map;
2659 nparam = isl_basic_map_n_param(bmap);
2660 n_in = isl_basic_map_n_in(bmap);
2661 n_out = isl_basic_map_n_out(bmap);
2663 total = nparam + n_in + n_out + bmap->n_div + n_out;
2664 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2665 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2666 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2667 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2668 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2670 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2671 bmap->n_div + n_out,
2672 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2673 result = add_constraints_dim_map(result, bmap, dim_map);
2674 result = add_divs(result, n_out);
2675 for (i = 0; i < n_out; ++i) {
2677 j = isl_basic_map_alloc_inequality(result);
2680 isl_seq_clr(result->ineq[j], 1+total);
2681 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2682 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2683 j = isl_basic_map_alloc_inequality(result);
2686 isl_seq_clr(result->ineq[j], 1+total);
2687 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2688 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2689 isl_int_sub_ui(result->ineq[j][0], d, 1);
2692 result = isl_basic_map_simplify(result);
2693 return isl_basic_map_finalize(result);
2695 isl_basic_map_free(result);
2699 /* Given a map A -> f(A) and an integer d, construct a map
2700 * A -> floor(f(A)/d).
2702 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2706 map = isl_map_cow(map);
2710 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2711 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2712 for (i = 0; i < map->n; ++i) {
2713 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2724 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2730 i = isl_basic_map_alloc_equality(bmap);
2733 nparam = isl_basic_map_n_param(bmap);
2734 n_in = isl_basic_map_n_in(bmap);
2735 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2736 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2737 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2738 return isl_basic_map_finalize(bmap);
2740 isl_basic_map_free(bmap);
2744 /* Add a constraints to "bmap" expressing i_pos < o_pos
2746 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2752 i = isl_basic_map_alloc_inequality(bmap);
2755 nparam = isl_basic_map_n_param(bmap);
2756 n_in = isl_basic_map_n_in(bmap);
2757 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2758 isl_int_set_si(bmap->ineq[i][0], -1);
2759 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2760 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2761 return isl_basic_map_finalize(bmap);
2763 isl_basic_map_free(bmap);
2767 /* Add a constraints to "bmap" expressing i_pos > o_pos
2769 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2775 i = isl_basic_map_alloc_inequality(bmap);
2778 nparam = isl_basic_map_n_param(bmap);
2779 n_in = isl_basic_map_n_in(bmap);
2780 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2781 isl_int_set_si(bmap->ineq[i][0], -1);
2782 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2783 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2784 return isl_basic_map_finalize(bmap);
2786 isl_basic_map_free(bmap);
2790 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2793 struct isl_basic_map *bmap;
2794 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2797 for (i = 0; i < n_equal && bmap; ++i)
2798 bmap = var_equal(bmap, i);
2799 return isl_basic_map_finalize(bmap);
2802 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2804 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2807 struct isl_basic_map *bmap;
2808 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2811 for (i = 0; i < pos && bmap; ++i)
2812 bmap = var_equal(bmap, i);
2814 bmap = var_less(bmap, pos);
2815 return isl_basic_map_finalize(bmap);
2818 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2820 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2823 struct isl_basic_map *bmap;
2824 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2827 for (i = 0; i < pos && bmap; ++i)
2828 bmap = var_equal(bmap, i);
2830 bmap = var_more(bmap, pos);
2831 return isl_basic_map_finalize(bmap);
2834 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2836 struct isl_map *map;
2843 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2845 for (i = 0; i < dim; ++i)
2846 map = isl_map_add_basic_map(map,
2847 isl_basic_map_less_at(isl_dim_copy(dims), i));
2849 map = isl_map_add_basic_map(map,
2850 isl_basic_map_equal(isl_dim_copy(dims), dim));
2856 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2858 return map_lex_lte(isl_dim_map(set_dim), 0);
2861 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2863 return map_lex_lte(isl_dim_map(set_dim), 1);
2866 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2868 struct isl_map *map;
2875 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2877 for (i = 0; i < dim; ++i)
2878 map = isl_map_add_basic_map(map,
2879 isl_basic_map_more_at(isl_dim_copy(dims), i));
2881 map = isl_map_add_basic_map(map,
2882 isl_basic_map_equal(isl_dim_copy(dims), dim));
2888 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2890 return map_lex_gte(isl_dim_map(set_dim), 0);
2893 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2895 return map_lex_gte(isl_dim_map(set_dim), 1);
2898 struct isl_basic_map *isl_basic_map_from_basic_set(
2899 struct isl_basic_set *bset, struct isl_dim *dim)
2901 struct isl_basic_map *bmap;
2903 bset = isl_basic_set_cow(bset);
2907 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2908 isl_dim_free(bset->dim);
2909 bmap = (struct isl_basic_map *) bset;
2911 return isl_basic_map_finalize(bmap);
2913 isl_basic_set_free(bset);
2918 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2922 if (bmap->dim->n_in == 0)
2923 return (struct isl_basic_set *)bmap;
2924 bmap = isl_basic_map_cow(bmap);
2927 bmap->dim = isl_dim_cow(bmap->dim);
2930 bmap->dim->n_out += bmap->dim->n_in;
2931 bmap->dim->n_in = 0;
2932 bmap = isl_basic_map_finalize(bmap);
2933 return (struct isl_basic_set *)bmap;
2935 isl_basic_map_free(bmap);
2939 /* For a div d = floor(f/m), add the constraints
2942 * -(f-(n-1)) + m d >= 0
2944 * Note that the second constraint is the negation of
2948 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2951 unsigned total = isl_basic_map_total_dim(bmap);
2952 unsigned div_pos = 1 + total - bmap->n_div + div;
2954 i = isl_basic_map_alloc_inequality(bmap);
2957 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2958 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2960 j = isl_basic_map_alloc_inequality(bmap);
2963 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2964 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2965 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2969 struct isl_basic_set *isl_basic_map_underlying_set(
2970 struct isl_basic_map *bmap)
2974 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2975 return (struct isl_basic_set *)bmap;
2976 bmap = isl_basic_map_cow(bmap);
2979 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2982 bmap->extra -= bmap->n_div;
2984 bmap = isl_basic_map_finalize(bmap);
2985 return (struct isl_basic_set *)bmap;
2990 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2991 __isl_take isl_basic_set *bset)
2993 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2996 struct isl_basic_map *isl_basic_map_overlying_set(
2997 struct isl_basic_set *bset, struct isl_basic_map *like)
2999 struct isl_basic_map *bmap;
3000 struct isl_ctx *ctx;
3007 isl_assert(ctx, bset->n_div == 0, goto error);
3008 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3009 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3011 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3012 isl_basic_map_free(like);
3013 return (struct isl_basic_map *)bset;
3015 bset = isl_basic_set_cow(bset);
3018 total = bset->dim->n_out + bset->extra;
3019 bmap = (struct isl_basic_map *)bset;
3020 isl_dim_free(bmap->dim);
3021 bmap->dim = isl_dim_copy(like->dim);
3024 bmap->n_div = like->n_div;
3025 bmap->extra += like->n_div;
3028 ltotal = total - bmap->extra + like->extra;
3031 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3032 bmap->extra * (1 + 1 + total));
3033 if (isl_blk_is_error(bmap->block2))
3035 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3039 for (i = 0; i < bmap->extra; ++i)
3040 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3041 for (i = 0; i < like->n_div; ++i) {
3042 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3043 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3045 bmap = isl_basic_map_extend_constraints(bmap,
3046 0, 2 * like->n_div);
3047 for (i = 0; i < like->n_div; ++i) {
3048 if (isl_int_is_zero(bmap->div[i][0]))
3050 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3054 isl_basic_map_free(like);
3055 bmap = isl_basic_map_simplify(bmap);
3056 bmap = isl_basic_map_finalize(bmap);
3059 isl_basic_map_free(like);
3060 isl_basic_set_free(bset);
3064 struct isl_basic_set *isl_basic_set_from_underlying_set(
3065 struct isl_basic_set *bset, struct isl_basic_set *like)
3067 return (struct isl_basic_set *)
3068 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3071 struct isl_set *isl_set_from_underlying_set(
3072 struct isl_set *set, struct isl_basic_set *like)
3078 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3080 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3081 isl_basic_set_free(like);
3084 set = isl_set_cow(set);
3087 for (i = 0; i < set->n; ++i) {
3088 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3089 isl_basic_set_copy(like));
3093 isl_dim_free(set->dim);
3094 set->dim = isl_dim_copy(like->dim);
3097 isl_basic_set_free(like);
3100 isl_basic_set_free(like);
3105 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3109 map = isl_map_cow(map);
3112 map->dim = isl_dim_cow(map->dim);
3116 for (i = 1; i < map->n; ++i)
3117 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3119 for (i = 0; i < map->n; ++i) {
3120 map->p[i] = (struct isl_basic_map *)
3121 isl_basic_map_underlying_set(map->p[i]);
3126 map->dim = isl_dim_underlying(map->dim, 0);
3128 isl_dim_free(map->dim);
3129 map->dim = isl_dim_copy(map->p[0]->dim);
3133 return (struct isl_set *)map;
3139 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3141 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3144 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3146 struct isl_basic_set *domain;
3151 n_in = isl_basic_map_n_in(bmap);
3152 n_out = isl_basic_map_n_out(bmap);
3153 domain = isl_basic_set_from_basic_map(bmap);
3154 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3157 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3159 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3162 struct isl_set *isl_map_range(struct isl_map *map)
3165 struct isl_set *set;
3169 if (isl_map_dim(map, isl_dim_in) == 0)
3170 return (isl_set *)map;
3172 map = isl_map_cow(map);
3176 set = (struct isl_set *) map;
3177 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3180 for (i = 0; i < map->n; ++i) {
3181 set->p[i] = isl_basic_map_range(map->p[i]);
3185 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3186 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3193 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3196 struct isl_map *map = NULL;
3198 set = isl_set_cow(set);
3201 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3202 map = (struct isl_map *)set;
3203 for (i = 0; i < set->n; ++i) {
3204 map->p[i] = isl_basic_map_from_basic_set(
3205 set->p[i], isl_dim_copy(dim));
3209 isl_dim_free(map->dim);
3218 struct isl_map *isl_map_from_range(struct isl_set *set)
3220 return (struct isl_map *)set;
3223 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3225 return isl_map_reverse(isl_map_from_range(set));;
3228 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3229 __isl_take isl_set *range)
3231 return isl_map_product(isl_map_from_domain(domain),
3232 isl_map_from_range(range));
3235 struct isl_set *isl_set_from_map(struct isl_map *map)
3238 struct isl_set *set = NULL;
3242 map = isl_map_cow(map);
3245 map->dim = isl_dim_cow(map->dim);
3248 map->dim->n_out += map->dim->n_in;
3250 set = (struct isl_set *)map;
3251 for (i = 0; i < map->n; ++i) {
3252 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3262 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3264 struct isl_map *map;
3268 isl_assert(dim->ctx, n >= 0, return NULL);
3269 map = isl_alloc(dim->ctx, struct isl_map,
3270 sizeof(struct isl_map) +
3271 (n - 1) * sizeof(struct isl_basic_map *));
3275 map->ctx = dim->ctx;
3276 isl_ctx_ref(map->ctx);
3288 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3289 unsigned nparam, unsigned in, unsigned out, int n,
3292 struct isl_map *map;
3293 struct isl_dim *dims;
3295 dims = isl_dim_alloc(ctx, nparam, in, out);
3299 map = isl_map_alloc_dim(dims, n, flags);
3303 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3305 struct isl_basic_map *bmap;
3306 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3307 bmap = isl_basic_map_set_to_empty(bmap);
3311 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3313 struct isl_basic_set *bset;
3314 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3315 bset = isl_basic_set_set_to_empty(bset);
3319 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3321 struct isl_basic_map *bmap;
3324 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3325 bmap = isl_basic_map_set_to_empty(bmap);
3329 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3331 struct isl_basic_map *bmap;
3334 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3335 bmap = isl_basic_map_set_to_empty(bmap);
3339 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3341 struct isl_basic_set *bset;
3344 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3345 bset = isl_basic_set_set_to_empty(bset);
3349 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3351 struct isl_basic_map *bmap;
3352 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3356 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3358 struct isl_basic_set *bset;
3359 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3363 __isl_give isl_basic_map *isl_basic_map_universe_like(
3364 __isl_keep isl_basic_map *model)
3368 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3371 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3375 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3378 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3379 __isl_keep isl_set *model)
3383 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3386 struct isl_map *isl_map_empty(struct isl_dim *dim)
3388 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3391 struct isl_map *isl_map_empty_like(struct isl_map *model)
3395 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3398 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3402 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3405 struct isl_set *isl_set_empty(struct isl_dim *dim)
3407 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3410 struct isl_set *isl_set_empty_like(struct isl_set *model)
3414 return isl_set_empty(isl_dim_copy(model->dim));
3417 struct isl_map *isl_map_universe(struct isl_dim *dim)
3419 struct isl_map *map;
3422 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3423 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3427 struct isl_set *isl_set_universe(struct isl_dim *dim)
3429 struct isl_set *set;
3432 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3433 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3437 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3441 return isl_set_universe(isl_dim_copy(model->dim));
3444 struct isl_map *isl_map_dup(struct isl_map *map)
3447 struct isl_map *dup;
3451 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3452 for (i = 0; i < map->n; ++i)
3453 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3457 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3458 __isl_take isl_basic_map *bmap)
3462 if (isl_basic_map_fast_is_empty(bmap)) {
3463 isl_basic_map_free(bmap);
3466 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3467 isl_assert(map->ctx, map->n < map->size, goto error);
3468 map->p[map->n] = bmap;
3470 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3476 isl_basic_map_free(bmap);
3480 void isl_map_free(struct isl_map *map)
3490 isl_ctx_deref(map->ctx);
3491 for (i = 0; i < map->n; ++i)
3492 isl_basic_map_free(map->p[i]);
3493 isl_dim_free(map->dim);
3497 struct isl_map *isl_map_extend(struct isl_map *base,
3498 unsigned nparam, unsigned n_in, unsigned n_out)
3502 base = isl_map_cow(base);
3506 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3509 for (i = 0; i < base->n; ++i) {
3510 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3511 isl_dim_copy(base->dim), 0, 0, 0);
3521 struct isl_set *isl_set_extend(struct isl_set *base,
3522 unsigned nparam, unsigned dim)
3524 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3528 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3529 struct isl_basic_map *bmap, unsigned pos, int value)
3533 bmap = isl_basic_map_cow(bmap);
3534 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3535 j = isl_basic_map_alloc_equality(bmap);
3538 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3539 isl_int_set_si(bmap->eq[j][pos], -1);
3540 isl_int_set_si(bmap->eq[j][0], value);
3541 bmap = isl_basic_map_simplify(bmap);
3542 return isl_basic_map_finalize(bmap);
3544 isl_basic_map_free(bmap);
3548 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3549 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3553 bmap = isl_basic_map_cow(bmap);
3554 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3555 j = isl_basic_map_alloc_equality(bmap);
3558 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3559 isl_int_set_si(bmap->eq[j][pos], -1);
3560 isl_int_set(bmap->eq[j][0], value);
3561 bmap = isl_basic_map_simplify(bmap);
3562 return isl_basic_map_finalize(bmap);
3564 isl_basic_map_free(bmap);
3568 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3569 enum isl_dim_type type, unsigned pos, int value)
3573 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3574 return isl_basic_map_fix_pos_si(bmap,
3575 isl_basic_map_offset(bmap, type) + pos, value);
3577 isl_basic_map_free(bmap);
3581 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3582 enum isl_dim_type type, unsigned pos, isl_int value)
3586 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3587 return isl_basic_map_fix_pos(bmap,
3588 isl_basic_map_offset(bmap, type) + pos, value);
3590 isl_basic_map_free(bmap);
3594 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3595 enum isl_dim_type type, unsigned pos, int value)
3597 return (struct isl_basic_set *)
3598 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3602 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3603 enum isl_dim_type type, unsigned pos, isl_int value)
3605 return (struct isl_basic_set *)
3606 isl_basic_map_fix((struct isl_basic_map *)bset,
3610 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3611 unsigned input, int value)
3613 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3616 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3617 unsigned dim, int value)
3619 return (struct isl_basic_set *)
3620 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3621 isl_dim_set, dim, value);
3624 struct isl_map *isl_map_fix_si(struct isl_map *map,
3625 enum isl_dim_type type, unsigned pos, int value)
3629 map = isl_map_cow(map);
3633 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3634 for (i = 0; i < map->n; ++i) {
3635 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3639 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3646 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3647 enum isl_dim_type type, unsigned pos, int value)
3649 return (struct isl_set *)
3650 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3653 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3654 enum isl_dim_type type, unsigned pos, isl_int value)
3658 map = isl_map_cow(map);
3662 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3663 for (i = 0; i < map->n; ++i) {
3664 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3668 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3675 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3676 enum isl_dim_type type, unsigned pos, isl_int value)
3678 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3681 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3682 unsigned input, int value)
3684 return isl_map_fix_si(map, isl_dim_in, input, value);
3687 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3689 return (struct isl_set *)
3690 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3693 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3694 __isl_take isl_basic_map *bmap,
3695 enum isl_dim_type type, unsigned pos, int value)
3701 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3702 pos += isl_basic_map_offset(bmap, type);
3703 bmap = isl_basic_map_cow(bmap);
3704 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3705 j = isl_basic_map_alloc_inequality(bmap);
3708 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3709 isl_int_set_si(bmap->ineq[j][pos], 1);
3710 isl_int_set_si(bmap->ineq[j][0], -value);
3711 bmap = isl_basic_map_simplify(bmap);
3712 return isl_basic_map_finalize(bmap);
3714 isl_basic_map_free(bmap);
3718 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3719 unsigned dim, isl_int value)
3723 bset = isl_basic_set_cow(bset);
3724 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3725 j = isl_basic_set_alloc_inequality(bset);
3728 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3729 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3730 isl_int_neg(bset->ineq[j][0], value);
3731 bset = isl_basic_set_simplify(bset);
3732 return isl_basic_set_finalize(bset);
3734 isl_basic_set_free(bset);
3738 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3739 enum isl_dim_type type, unsigned pos, int value)
3743 map = isl_map_cow(map);
3747 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3748 for (i = 0; i < map->n; ++i) {
3749 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3754 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3761 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3762 enum isl_dim_type type, unsigned pos, int value)
3764 return (struct isl_set *)
3765 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3768 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3773 set = isl_set_cow(set);
3777 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3778 for (i = 0; i < set->n; ++i) {
3779 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3789 struct isl_map *isl_map_reverse(struct isl_map *map)
3793 map = isl_map_cow(map);
3797 map->dim = isl_dim_reverse(map->dim);
3800 for (i = 0; i < map->n; ++i) {
3801 map->p[i] = isl_basic_map_reverse(map->p[i]);
3805 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3812 static struct isl_map *isl_basic_map_partial_lexopt(
3813 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3814 struct isl_set **empty, int max)
3818 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3819 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3821 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3823 isl_basic_map_free(bmap);
3824 isl_basic_set_free(dom);
3830 struct isl_map *isl_basic_map_partial_lexmax(
3831 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3832 struct isl_set **empty)
3834 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3837 struct isl_map *isl_basic_map_partial_lexmin(
3838 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3839 struct isl_set **empty)
3841 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3844 struct isl_set *isl_basic_set_partial_lexmin(
3845 struct isl_basic_set *bset, struct isl_basic_set *dom,
3846 struct isl_set **empty)
3848 return (struct isl_set *)
3849 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3853 struct isl_set *isl_basic_set_partial_lexmax(
3854 struct isl_basic_set *bset, struct isl_basic_set *dom,
3855 struct isl_set **empty)
3857 return (struct isl_set *)
3858 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3862 /* Given a basic map "bmap", compute the lexicograhically minimal
3863 * (or maximal) image element for each domain element in dom.
3864 * Set *empty to those elements in dom that do not have an image element.
3866 * We first make sure the basic sets in dom are disjoint and then
3867 * simply collect the results over each of the basic sets separately.
3868 * We could probably improve the efficiency a bit by moving the union
3869 * domain down into the parametric integer programming.
3871 static __isl_give isl_map *basic_map_partial_lexopt(
3872 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3873 __isl_give isl_set **empty, int max)
3876 struct isl_map *res;
3878 dom = isl_set_make_disjoint(dom);
3882 if (isl_set_fast_is_empty(dom)) {
3883 res = isl_map_empty_like_basic_map(bmap);
3884 *empty = isl_set_empty_like(dom);
3886 isl_basic_map_free(bmap);
3890 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3891 isl_basic_set_copy(dom->p[0]), empty, max);
3893 for (i = 1; i < dom->n; ++i) {
3894 struct isl_map *res_i;
3895 struct isl_set *empty_i;
3897 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3898 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3900 res = isl_map_union_disjoint(res, res_i);
3901 *empty = isl_set_union_disjoint(*empty, empty_i);
3905 isl_basic_map_free(bmap);
3910 isl_basic_map_free(bmap);
3914 /* Given a map "map", compute the lexicograhically minimal
3915 * (or maximal) image element for each domain element in dom.
3916 * Set *empty to those elements in dom that do not have an image element.
3918 * We first compute the lexicographically minimal or maximal element
3919 * in the first basic map. This results in a partial solution "res"
3920 * and a subset "todo" of dom that still need to be handled.
3921 * We then consider each of the remaining maps in "map" and successively
3922 * improve both "res" and "todo".
3924 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3925 * Assume we are computing the lexicographical maximum.
3926 * We first intersect basic map i with a relation that maps elements
3927 * to elements that are lexicographically larger than the image elements
3928 * in res^k and the compute the maximum image element of this intersection.
3929 * The result ("better") corresponds to those image elements in basic map i
3930 * that are better than what we had before. The remainder ("keep") are the
3931 * domain elements for which the image element in res_k was better.
3932 * We also compute the lexicographical maximum of basic map i in todo^k.
3933 * res^i is the result of the operation + better + those elements in
3934 * res^k that we should keep
3935 * todo^i is the remainder of the maximum operation on todo^k.
3937 static __isl_give isl_map *isl_map_partial_lexopt(
3938 __isl_take isl_map *map, __isl_take isl_set *dom,
3939 __isl_give isl_set **empty, int max)
3942 struct isl_map *res;
3943 struct isl_set *todo;
3948 if (isl_map_fast_is_empty(map)) {
3956 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3957 isl_set_copy(dom), &todo, max);
3959 for (i = 1; i < map->n; ++i) {
3961 struct isl_map *better;
3962 struct isl_set *keep;
3963 struct isl_map *res_i;
3964 struct isl_set *todo_i;
3965 struct isl_dim *dim = isl_map_get_dim(res);
3967 dim = isl_dim_range(dim);
3969 lt = isl_map_lex_lt(dim);
3971 lt = isl_map_lex_gt(dim);
3972 lt = isl_map_apply_range(isl_map_copy(res), lt);
3973 lt = isl_map_intersect(lt,
3974 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3975 better = isl_map_partial_lexopt(lt,
3976 isl_map_domain(isl_map_copy(res)),
3979 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3980 todo, &todo_i, max);
3982 res = isl_map_intersect_domain(res, keep);
3983 res = isl_map_union_disjoint(res, res_i);
3984 res = isl_map_union_disjoint(res, better);
4005 __isl_give isl_map *isl_map_partial_lexmax(
4006 __isl_take isl_map *map, __isl_take isl_set *dom,
4007 __isl_give isl_set **empty)
4009 return isl_map_partial_lexopt(map, dom, empty, 1);
4012 __isl_give isl_map *isl_map_partial_lexmin(
4013 __isl_take isl_map *map, __isl_take isl_set *dom,
4014 __isl_give isl_set **empty)
4016 return isl_map_partial_lexopt(map, dom, empty, 0);
4019 __isl_give isl_set *isl_set_partial_lexmin(
4020 __isl_take isl_set *set, __isl_take isl_set *dom,
4021 __isl_give isl_set **empty)
4023 return (struct isl_set *)
4024 isl_map_partial_lexmin((struct isl_map *)set,
4028 __isl_give isl_set *isl_set_partial_lexmax(
4029 __isl_take isl_set *set, __isl_take isl_set *dom,
4030 __isl_give isl_set **empty)
4032 return (struct isl_set *)
4033 isl_map_partial_lexmax((struct isl_map *)set,
4037 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4039 struct isl_basic_set *dom = NULL;
4040 struct isl_dim *dom_dim;
4044 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4045 dom = isl_basic_set_universe(dom_dim);
4046 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4048 isl_basic_map_free(bmap);
4052 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4054 return isl_basic_map_lexopt(bmap, 0);
4057 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4059 return isl_basic_map_lexopt(bmap, 1);
4062 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4064 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4067 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4069 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4072 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4074 struct isl_set *dom = NULL;
4075 struct isl_dim *dom_dim;
4079 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4080 dom = isl_set_universe(dom_dim);
4081 return isl_map_partial_lexopt(map, dom, NULL, max);
4087 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4089 return isl_map_lexopt(map, 0);
4092 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4094 return isl_map_lexopt(map, 1);
4097 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4099 return (isl_set *)isl_map_lexmin((isl_map *)set);
4102 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4104 return (isl_set *)isl_map_lexmax((isl_map *)set);
4107 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4108 struct isl_dim *dim)
4115 for (i = 0; i < map->n; ++i) {
4116 isl_dim_free(map->p[i]->dim);
4117 map->p[i]->dim = isl_dim_copy(dim);
4119 isl_dim_free(map->dim);
4129 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4130 struct isl_dim *dim)
4132 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4135 /* Apply a preimage specified by "mat" on the parameters of "bset".
4136 * bset is assumed to have only parameters and divs.
4138 static struct isl_basic_set *basic_set_parameter_preimage(
4139 struct isl_basic_set *bset, struct isl_mat *mat)
4146 bset->dim = isl_dim_cow(bset->dim);
4150 nparam = isl_basic_set_dim(bset, isl_dim_param);
4152 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4154 bset->dim->nparam = 0;
4155 bset->dim->n_out = nparam;
4156 bset = isl_basic_set_preimage(bset, mat);
4158 bset->dim->nparam = bset->dim->n_out;
4159 bset->dim->n_out = 0;
4164 isl_basic_set_free(bset);
4168 /* Apply a preimage specified by "mat" on the parameters of "set".
4169 * set is assumed to have only parameters and divs.
4171 static struct isl_set *set_parameter_preimage(
4172 struct isl_set *set, struct isl_mat *mat)
4174 struct isl_dim *dim = NULL;
4180 dim = isl_dim_copy(set->dim);
4181 dim = isl_dim_cow(dim);
4185 nparam = isl_set_dim(set, isl_dim_param);
4187 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4190 dim->n_out = nparam;
4191 isl_set_reset_dim(set, dim);
4192 set = isl_set_preimage(set, mat);
4195 dim = isl_dim_copy(set->dim);
4196 dim = isl_dim_cow(dim);
4199 dim->nparam = dim->n_out;
4201 isl_set_reset_dim(set, dim);
4211 /* Intersect the basic set "bset" with the affine space specified by the
4212 * equalities in "eq".
4214 static struct isl_basic_set *basic_set_append_equalities(
4215 struct isl_basic_set *bset, struct isl_mat *eq)
4223 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4228 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4229 for (i = 0; i < eq->n_row; ++i) {
4230 k = isl_basic_set_alloc_equality(bset);
4233 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4234 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4241 isl_basic_set_free(bset);
4245 /* Intersect the set "set" with the affine space specified by the
4246 * equalities in "eq".
4248 static struct isl_set *set_append_equalities(struct isl_set *set,
4256 for (i = 0; i < set->n; ++i) {
4257 set->p[i] = basic_set_append_equalities(set->p[i],
4270 /* Project the given basic set onto its parameter domain, possibly introducing
4271 * new, explicit, existential variables in the constraints.
4272 * The input has parameters and (possibly implicit) existential variables.
4273 * The output has the same parameters, but only
4274 * explicit existentially quantified variables.
4276 * The actual projection is performed by pip, but pip doesn't seem
4277 * to like equalities very much, so we first remove the equalities
4278 * among the parameters by performing a variable compression on
4279 * the parameters. Afterward, an inverse transformation is performed
4280 * and the equalities among the parameters are inserted back in.
4282 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4286 struct isl_mat *T, *T2;
4287 struct isl_set *set;
4288 unsigned nparam, n_div;
4290 bset = isl_basic_set_cow(bset);
4294 if (bset->n_eq == 0)
4295 return isl_basic_set_lexmin(bset);
4297 isl_basic_set_gauss(bset, NULL);
4299 nparam = isl_basic_set_dim(bset, isl_dim_param);
4300 n_div = isl_basic_set_dim(bset, isl_dim_div);
4302 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4303 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4306 if (i == bset->n_eq)
4307 return isl_basic_set_lexmin(bset);
4309 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4311 eq = isl_mat_cow(eq);
4312 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4313 bset = basic_set_parameter_preimage(bset, T);
4315 set = isl_basic_set_lexmin(bset);
4316 set = set_parameter_preimage(set, T2);
4317 set = set_append_equalities(set, eq);
4321 /* Compute an explicit representation for all the existentially
4322 * quantified variables.
4323 * The input and output dimensions are first turned into parameters.
4324 * compute_divs then returns a map with the same parameters and
4325 * no input or output dimensions and the dimension specification
4326 * is reset to that of the input.
4328 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4330 struct isl_basic_set *bset;
4331 struct isl_set *set;
4332 struct isl_map *map;
4333 struct isl_dim *dim, *orig_dim = NULL;
4338 bmap = isl_basic_map_cow(bmap);
4342 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4343 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4344 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4345 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4349 orig_dim = bmap->dim;
4351 bset = (struct isl_basic_set *)bmap;
4353 set = parameter_compute_divs(bset);
4354 map = (struct isl_map *)set;
4355 map = isl_map_reset_dim(map, orig_dim);
4359 isl_basic_map_free(bmap);
4363 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4371 off = isl_dim_total(bmap->dim);
4372 for (i = 0; i < bmap->n_div; ++i) {
4373 if (isl_int_is_zero(bmap->div[i][0]))
4375 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4381 static int map_divs_known(__isl_keep isl_map *map)
4388 for (i = 0; i < map->n; ++i) {
4389 int known = basic_map_divs_known(map->p[i]);
4397 /* If bmap contains any unknown divs, then compute explicit
4398 * expressions for them. However, this computation may be
4399 * quite expensive, so first try to remove divs that aren't
4402 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4406 struct isl_map *map;
4408 known = basic_map_divs_known(bmap);
4412 return isl_map_from_basic_map(bmap);
4414 bmap = isl_basic_map_drop_redundant_divs(bmap);
4416 known = basic_map_divs_known(bmap);
4420 return isl_map_from_basic_map(bmap);
4422 map = compute_divs(bmap);
4425 isl_basic_map_free(bmap);
4429 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4433 struct isl_map *res;
4440 known = map_divs_known(map);
4448 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4449 for (i = 1 ; i < map->n; ++i) {
4451 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4452 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4453 res = isl_map_union_disjoint(res, r2);
4455 res = isl_map_union(res, r2);
4462 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4464 return (struct isl_set *)
4465 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4468 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4470 return (struct isl_set *)
4471 isl_map_compute_divs((struct isl_map *)set);
4474 struct isl_set *isl_map_domain(struct isl_map *map)
4477 struct isl_set *set;
4482 map = isl_map_cow(map);
4486 set = (struct isl_set *)map;
4487 set->dim = isl_dim_domain(set->dim);
4490 for (i = 0; i < map->n; ++i) {
4491 set->p[i] = isl_basic_map_domain(map->p[i]);
4495 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4496 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4503 struct isl_map *isl_map_union_disjoint(
4504 struct isl_map *map1, struct isl_map *map2)
4508 struct isl_map *map = NULL;
4522 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4524 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4525 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4526 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4528 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4529 map1->n + map2->n, flags);
4532 for (i = 0; i < map1->n; ++i) {
4533 map = isl_map_add_basic_map(map,
4534 isl_basic_map_copy(map1->p[i]));
4538 for (i = 0; i < map2->n; ++i) {
4539 map = isl_map_add_basic_map(map,
4540 isl_basic_map_copy(map2->p[i]));
4554 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4556 map1 = isl_map_union_disjoint(map1, map2);
4560 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4564 struct isl_set *isl_set_union_disjoint(
4565 struct isl_set *set1, struct isl_set *set2)
4567 return (struct isl_set *)
4568 isl_map_union_disjoint(
4569 (struct isl_map *)set1, (struct isl_map *)set2);
4572 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4574 return (struct isl_set *)
4575 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4578 struct isl_map *isl_map_intersect_range(
4579 struct isl_map *map, struct isl_set *set)
4582 struct isl_map *result;
4588 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4589 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4590 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4592 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4593 map->n * set->n, flags);
4596 for (i = 0; i < map->n; ++i)
4597 for (j = 0; j < set->n; ++j) {
4598 result = isl_map_add_basic_map(result,
4599 isl_basic_map_intersect_range(
4600 isl_basic_map_copy(map->p[i]),
4601 isl_basic_set_copy(set->p[j])));
4614 struct isl_map *isl_map_intersect_domain(
4615 struct isl_map *map, struct isl_set *set)
4617 return isl_map_reverse(
4618 isl_map_intersect_range(isl_map_reverse(map), set));
4621 struct isl_map *isl_map_apply_domain(
4622 struct isl_map *map1, struct isl_map *map2)
4626 map1 = isl_map_reverse(map1);
4627 map1 = isl_map_apply_range(map1, map2);
4628 return isl_map_reverse(map1);
4635 struct isl_map *isl_map_apply_range(
4636 struct isl_map *map1, struct isl_map *map2)
4638 struct isl_dim *dim_result;
4639 struct isl_map *result;
4645 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4646 isl_dim_copy(map2->dim));
4648 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4651 for (i = 0; i < map1->n; ++i)
4652 for (j = 0; j < map2->n; ++j) {
4653 result = isl_map_add_basic_map(result,
4654 isl_basic_map_apply_range(
4655 isl_basic_map_copy(map1->p[i]),
4656 isl_basic_map_copy(map2->p[j])));
4662 if (result && result->n <= 1)
4663 ISL_F_SET(result, ISL_MAP_DISJOINT);
4672 * returns range - domain
4674 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4676 struct isl_basic_set *bset;
4683 dim = isl_basic_map_n_in(bmap);
4684 nparam = isl_basic_map_n_param(bmap);
4685 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4686 bset = isl_basic_set_from_basic_map(bmap);
4687 bset = isl_basic_set_cow(bset);
4688 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4689 bset = isl_basic_set_swap_vars(bset, 2*dim);
4690 for (i = 0; i < dim; ++i) {
4691 int j = isl_basic_map_alloc_equality(
4692 (struct isl_basic_map *)bset);
4695 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4696 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4697 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4698 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4700 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4702 isl_basic_map_free(bmap);
4707 * returns range - domain
4709 struct isl_set *isl_map_deltas(struct isl_map *map)
4712 struct isl_set *result;
4717 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4718 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4719 isl_map_n_in(map), map->n, map->flags);
4722 for (i = 0; i < map->n; ++i)
4723 result = isl_set_add_basic_set(result,
4724 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4732 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4734 struct isl_basic_map *bmap;
4742 nparam = dims->nparam;
4744 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4748 for (i = 0; i < dim; ++i) {
4749 int j = isl_basic_map_alloc_equality(bmap);
4752 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4753 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4754 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4756 return isl_basic_map_finalize(bmap);
4758 isl_basic_map_free(bmap);
4762 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4764 struct isl_dim *dim = isl_dim_map(set_dim);
4767 return basic_map_identity(dim);
4770 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4772 if (!model || !model->dim)
4774 isl_assert(model->ctx,
4775 model->dim->n_in == model->dim->n_out, return NULL);
4776 return basic_map_identity(isl_dim_copy(model->dim));
4779 static struct isl_map *map_identity(struct isl_dim *dim)
4781 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4782 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4785 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4787 struct isl_dim *dim = isl_dim_map(set_dim);
4790 return map_identity(dim);
4793 struct isl_map *isl_map_identity_like(struct isl_map *model)
4795 if (!model || !model->dim)
4797 isl_assert(model->ctx,
4798 model->dim->n_in == model->dim->n_out, return NULL);
4799 return map_identity(isl_dim_copy(model->dim));
4802 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4804 if (!model || !model->dim)
4806 isl_assert(model->ctx,
4807 model->dim->n_in == model->dim->n_out, return NULL);
4808 return map_identity(isl_dim_copy(model->dim));
4811 /* Construct a basic set with all set dimensions having only non-negative
4814 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4819 struct isl_basic_set *bset;
4823 nparam = dims->nparam;
4825 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4828 for (i = 0; i < dim; ++i) {
4829 int k = isl_basic_set_alloc_inequality(bset);
4832 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4833 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4837 isl_basic_set_free(bset);
4841 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4843 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4846 int isl_basic_map_is_subset(
4847 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4850 struct isl_map *map1;
4851 struct isl_map *map2;
4853 if (!bmap1 || !bmap2)
4856 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4857 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4859 is_subset = isl_map_is_subset(map1, map2);
4867 int isl_basic_map_is_equal(
4868 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4872 if (!bmap1 || !bmap2)
4874 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4877 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4881 int isl_basic_set_is_equal(
4882 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4884 return isl_basic_map_is_equal(
4885 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4888 int isl_map_is_empty(struct isl_map *map)
4895 for (i = 0; i < map->n; ++i) {
4896 is_empty = isl_basic_map_is_empty(map->p[i]);
4905 int isl_map_fast_is_empty(struct isl_map *map)
4910 int isl_set_fast_is_empty(struct isl_set *set)
4915 int isl_set_is_empty(struct isl_set *set)
4917 return isl_map_is_empty((struct isl_map *)set);
4920 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4926 is_subset = isl_map_is_subset(map1, map2);
4929 is_subset = isl_map_is_subset(map2, map1);
4933 int isl_basic_map_is_strict_subset(
4934 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4938 if (!bmap1 || !bmap2)
4940 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4943 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4944 if (is_subset == -1)
4949 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4955 is_subset = isl_map_is_subset(map1, map2);
4958 is_subset = isl_map_is_subset(map2, map1);
4959 if (is_subset == -1)
4964 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4966 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4969 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4973 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4976 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4980 return bset->n_eq == 0 && bset->n_ineq == 0;
4983 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4988 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4991 int isl_set_fast_is_universe(__isl_keep isl_set *set)
4993 return isl_map_fast_is_universe((isl_map *) set);
4996 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4998 struct isl_basic_set *bset = NULL;
4999 struct isl_vec *sample = NULL;
5006 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5009 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5010 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5011 copy = isl_basic_map_convex_hull(copy);
5012 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5013 isl_basic_map_free(copy);
5017 total = 1 + isl_basic_map_total_dim(bmap);
5018 if (bmap->sample && bmap->sample->size == total) {
5019 int contains = isl_basic_map_contains(bmap, bmap->sample);
5025 isl_vec_free(bmap->sample);
5026 bmap->sample = NULL;
5027 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5030 sample = isl_basic_set_sample_vec(bset);
5033 empty = sample->size == 0;
5034 isl_vec_free(bmap->sample);
5035 bmap->sample = sample;
5037 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5042 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5046 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5049 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5053 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5056 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5058 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5061 struct isl_map *isl_basic_map_union(
5062 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5064 struct isl_map *map;
5065 if (!bmap1 || !bmap2)
5068 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5070 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5073 map = isl_map_add_basic_map(map, bmap1);
5074 map = isl_map_add_basic_map(map, bmap2);
5077 isl_basic_map_free(bmap1);
5078 isl_basic_map_free(bmap2);
5082 struct isl_set *isl_basic_set_union(
5083 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5085 return (struct isl_set *)isl_basic_map_union(
5086 (struct isl_basic_map *)bset1,
5087 (struct isl_basic_map *)bset2);
5090 /* Order divs such that any div only depends on previous divs */
5091 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5094 unsigned off = isl_dim_total(bmap->dim);
5096 for (i = 0; i < bmap->n_div; ++i) {
5098 if (isl_int_is_zero(bmap->div[i][0]))
5100 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5104 isl_basic_map_swap_div(bmap, i, i + pos);
5110 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5112 return (struct isl_basic_set *)
5113 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5116 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5123 for (i = 0; i < map->n; ++i) {
5124 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5135 /* Look for a div in dst that corresponds to the div "div" in src.
5136 * The divs before "div" in src and dst are assumed to be the same.
5138 * Returns -1 if no corresponding div was found and the position
5139 * of the corresponding div in dst otherwise.
5141 static int find_div(struct isl_basic_map *dst,
5142 struct isl_basic_map *src, unsigned div)
5146 unsigned total = isl_dim_total(src->dim);
5148 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5149 for (i = div; i < dst->n_div; ++i)
5150 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5151 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5152 dst->n_div - div) == -1)
5157 struct isl_basic_map *isl_basic_map_align_divs(
5158 struct isl_basic_map *dst, struct isl_basic_map *src)
5161 unsigned total = isl_dim_total(src->dim);
5166 if (src->n_div == 0)
5169 for (i = 0; i < src->n_div; ++i)
5170 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5172 src = isl_basic_map_order_divs(src);
5173 dst = isl_basic_map_cow(dst);
5174 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5175 src->n_div, 0, 2 * src->n_div);
5178 for (i = 0; i < src->n_div; ++i) {
5179 int j = find_div(dst, src, i);
5181 j = isl_basic_map_alloc_div(dst);
5184 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5185 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5186 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5190 isl_basic_map_swap_div(dst, i, j);
5194 isl_basic_map_free(dst);
5198 struct isl_basic_set *isl_basic_set_align_divs(
5199 struct isl_basic_set *dst, struct isl_basic_set *src)
5201 return (struct isl_basic_set *)isl_basic_map_align_divs(
5202 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5205 struct isl_map *isl_map_align_divs(struct isl_map *map)
5213 map = isl_map_compute_divs(map);
5214 map = isl_map_cow(map);
5218 for (i = 1; i < map->n; ++i)
5219 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5220 for (i = 1; i < map->n; ++i)
5221 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5223 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5227 struct isl_set *isl_set_align_divs(struct isl_set *set)
5229 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5232 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5236 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5237 map = isl_map_intersect_domain(map, set);
5238 set = isl_map_range(map);
5246 /* There is no need to cow as removing empty parts doesn't change
5247 * the meaning of the set.
5249 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5256 for (i = map->n-1; i >= 0; --i) {
5257 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5259 isl_basic_map_free(map->p[i]);
5260 if (i != map->n-1) {
5261 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5262 map->p[i] = map->p[map->n-1];
5270 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5272 return (struct isl_set *)
5273 isl_map_remove_empty_parts((struct isl_map *)set);
5276 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5278 struct isl_basic_map *bmap;
5279 if (!map || map->n == 0)
5281 bmap = map->p[map->n-1];
5282 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5283 return isl_basic_map_copy(bmap);
5286 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5288 return (struct isl_basic_set *)
5289 isl_map_copy_basic_map((struct isl_map *)set);
5292 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5293 __isl_keep isl_basic_map *bmap)
5299 for (i = map->n-1; i >= 0; --i) {
5300 if (map->p[i] != bmap)
5302 map = isl_map_cow(map);
5305 isl_basic_map_free(map->p[i]);
5306 if (i != map->n-1) {
5307 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5308 map->p[i] = map->p[map->n-1];
5319 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5320 struct isl_basic_set *bset)
5322 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5323 (struct isl_basic_map *)bset);
5326 /* Given two basic sets bset1 and bset2, compute the maximal difference
5327 * between the values of dimension pos in bset1 and those in bset2
5328 * for any common value of the parameters and dimensions preceding pos.
5330 static enum isl_lp_result basic_set_maximal_difference_at(
5331 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5332 int pos, isl_int *opt)
5334 struct isl_dim *dims;
5335 struct isl_basic_map *bmap1 = NULL;
5336 struct isl_basic_map *bmap2 = NULL;
5337 struct isl_ctx *ctx;
5338 struct isl_vec *obj;
5341 unsigned dim1, dim2;
5342 enum isl_lp_result res;
5344 if (!bset1 || !bset2)
5345 return isl_lp_error;
5347 nparam = isl_basic_set_n_param(bset1);
5348 dim1 = isl_basic_set_n_dim(bset1);
5349 dim2 = isl_basic_set_n_dim(bset2);
5350 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5351 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5352 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5353 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5354 if (!bmap1 || !bmap2)
5356 bmap1 = isl_basic_map_cow(bmap1);
5357 bmap1 = isl_basic_map_extend(bmap1, nparam,
5358 pos, (dim1 - pos) + (dim2 - pos),
5359 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5360 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5363 total = isl_basic_map_total_dim(bmap1);
5365 obj = isl_vec_alloc(ctx, 1 + total);
5366 isl_seq_clr(obj->block.data, 1 + total);
5367 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5368 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5371 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5373 isl_basic_map_free(bmap1);
5377 isl_basic_map_free(bmap1);
5378 isl_basic_map_free(bmap2);
5379 return isl_lp_error;
5382 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5383 * for any common value of the parameters and dimensions preceding pos
5384 * in both basic sets, the values of dimension pos in bset1 are
5385 * smaller or larger than those in bset2.
5388 * 1 if bset1 follows bset2
5389 * -1 if bset1 precedes bset2
5390 * 0 if bset1 and bset2 are incomparable
5391 * -2 if some error occurred.
5393 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5394 struct isl_basic_set *bset2, int pos)
5397 enum isl_lp_result res;
5402 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5404 if (res == isl_lp_empty)
5406 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5407 res == isl_lp_unbounded)
5409 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5418 /* Given two basic sets bset1 and bset2, check whether
5419 * for any common value of the parameters and dimensions preceding pos
5420 * there is a value of dimension pos in bset1 that is larger
5421 * than a value of the same dimension in bset2.
5424 * 1 if there exists such a pair
5425 * 0 if there is no such pair, but there is a pair of equal values
5427 * -2 if some error occurred.
5429 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5430 __isl_keep isl_basic_set *bset2, int pos)
5433 enum isl_lp_result res;
5438 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5440 if (res == isl_lp_empty)
5442 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5443 res == isl_lp_unbounded)
5445 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5447 else if (res == isl_lp_ok)
5456 /* Given two sets set1 and set2, check whether
5457 * for any common value of the parameters and dimensions preceding pos
5458 * there is a value of dimension pos in set1 that is larger
5459 * than a value of the same dimension in set2.
5462 * 1 if there exists such a pair
5463 * 0 if there is no such pair, but there is a pair of equal values
5465 * -2 if some error occurred.
5467 int isl_set_follows_at(__isl_keep isl_set *set1,
5468 __isl_keep isl_set *set2, int pos)
5476 for (i = 0; i < set1->n; ++i)
5477 for (j = 0; j < set2->n; ++j) {
5479 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5480 if (f == 1 || f == -2)
5489 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5490 unsigned pos, isl_int *val)
5498 total = isl_basic_map_total_dim(bmap);
5499 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5500 for (; d+1 > pos; --d)
5501 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5505 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5507 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5509 if (!isl_int_is_one(bmap->eq[i][1+d]))
5512 isl_int_neg(*val, bmap->eq[i][0]);
5518 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5519 unsigned pos, isl_int *val)
5531 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5534 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5535 for (i = 1; fixed == 1 && i < map->n; ++i) {
5536 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5537 if (fixed == 1 && isl_int_ne(tmp, v))
5541 isl_int_set(*val, v);
5547 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5548 unsigned pos, isl_int *val)
5550 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5554 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5557 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5560 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5561 enum isl_dim_type type, unsigned pos, isl_int *val)
5563 if (pos >= isl_basic_map_dim(bmap, type))
5565 return isl_basic_map_fast_has_fixed_var(bmap,
5566 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5569 int isl_map_fast_is_fixed(struct isl_map *map,
5570 enum isl_dim_type type, unsigned pos, isl_int *val)
5572 if (pos >= isl_map_dim(map, type))
5574 return isl_map_fast_has_fixed_var(map,
5575 map_offset(map, type) - 1 + pos, val);
5578 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5579 * then return this fixed value in *val.
5581 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5584 return isl_basic_set_fast_has_fixed_var(bset,
5585 isl_basic_set_n_param(bset) + dim, val);
5588 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5589 * then return this fixed value in *val.
5591 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5593 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5596 /* Check if input variable in has fixed value and if so and if val is not NULL,
5597 * then return this fixed value in *val.
5599 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5601 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5604 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5605 * and if val is not NULL, then return this lower bound in *val.
5607 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5608 unsigned dim, isl_int *val)
5610 int i, i_eq = -1, i_ineq = -1;
5617 total = isl_basic_set_total_dim(bset);
5618 nparam = isl_basic_set_n_param(bset);
5619 for (i = 0; i < bset->n_eq; ++i) {
5620 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5626 for (i = 0; i < bset->n_ineq; ++i) {
5627 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5629 if (i_eq != -1 || i_ineq != -1)
5633 if (i_eq == -1 && i_ineq == -1)
5635 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5636 /* The coefficient should always be one due to normalization. */
5637 if (!isl_int_is_one(c[1+nparam+dim]))
5639 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5641 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5642 total - nparam - dim - 1) != -1)
5645 isl_int_neg(*val, c[0]);
5649 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5650 unsigned dim, isl_int *val)
5662 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5666 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5668 for (i = 1; fixed == 1 && i < set->n; ++i) {
5669 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5671 if (fixed == 1 && isl_int_ne(tmp, v))
5675 isl_int_set(*val, v);
5686 static int qsort_constraint_cmp(const void *p1, const void *p2)
5688 const struct constraint *c1 = (const struct constraint *)p1;
5689 const struct constraint *c2 = (const struct constraint *)p2;
5690 unsigned size = isl_min(c1->size, c2->size);
5691 return isl_seq_cmp(c1->c, c2->c, size);
5694 static struct isl_basic_map *isl_basic_map_sort_constraints(
5695 struct isl_basic_map *bmap)
5698 struct constraint *c;
5703 total = isl_basic_map_total_dim(bmap);
5704 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5707 for (i = 0; i < bmap->n_ineq; ++i) {
5709 c[i].c = bmap->ineq[i];
5711 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5712 for (i = 0; i < bmap->n_ineq; ++i)
5713 bmap->ineq[i] = c[i].c;
5717 isl_basic_map_free(bmap);
5721 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5725 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5727 bmap = isl_basic_map_convex_hull(bmap);
5728 bmap = isl_basic_map_sort_constraints(bmap);
5729 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5733 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5735 return (struct isl_basic_set *)isl_basic_map_normalize(
5736 (struct isl_basic_map *)bset);
5739 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5740 const struct isl_basic_map *bmap2)
5747 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5748 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5749 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5750 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5751 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5752 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5753 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5754 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5756 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5758 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5760 if (bmap1->n_eq != bmap2->n_eq)
5761 return bmap1->n_eq - bmap2->n_eq;
5762 if (bmap1->n_ineq != bmap2->n_ineq)
5763 return bmap1->n_ineq - bmap2->n_ineq;
5764 if (bmap1->n_div != bmap2->n_div)
5765 return bmap1->n_div - bmap2->n_div;
5766 total = isl_basic_map_total_dim(bmap1);
5767 for (i = 0; i < bmap1->n_eq; ++i) {
5768 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5772 for (i = 0; i < bmap1->n_ineq; ++i) {
5773 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5777 for (i = 0; i < bmap1->n_div; ++i) {
5778 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5785 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5786 struct isl_basic_map *bmap2)
5788 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5791 static int qsort_bmap_cmp(const void *p1, const void *p2)
5793 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5794 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5796 return isl_basic_map_fast_cmp(bmap1, bmap2);
5799 /* We normalize in place, but if anything goes wrong we need
5800 * to return NULL, so we need to make sure we don't change the
5801 * meaning of any possible other copies of map.
5803 struct isl_map *isl_map_normalize(struct isl_map *map)
5806 struct isl_basic_map *bmap;
5810 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5812 for (i = 0; i < map->n; ++i) {
5813 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5816 isl_basic_map_free(map->p[i]);
5819 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5820 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5821 map = isl_map_remove_empty_parts(map);
5824 for (i = map->n - 1; i >= 1; --i) {
5825 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5827 isl_basic_map_free(map->p[i-1]);
5828 for (j = i; j < map->n; ++j)
5829 map->p[j-1] = map->p[j];
5839 struct isl_set *isl_set_normalize(struct isl_set *set)
5841 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5844 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5854 if (!isl_dim_equal(map1->dim, map2->dim))
5857 map1 = isl_map_copy(map1);
5858 map2 = isl_map_copy(map2);
5859 map1 = isl_map_normalize(map1);
5860 map2 = isl_map_normalize(map2);
5863 equal = map1->n == map2->n;
5864 for (i = 0; equal && i < map1->n; ++i) {
5865 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5878 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5880 return isl_map_fast_is_equal((struct isl_map *)set1,
5881 (struct isl_map *)set2);
5884 /* Return an interval that ranges from min to max (inclusive)
5886 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5887 isl_int min, isl_int max)
5890 struct isl_basic_set *bset = NULL;
5892 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5896 k = isl_basic_set_alloc_inequality(bset);
5899 isl_int_set_si(bset->ineq[k][1], 1);
5900 isl_int_neg(bset->ineq[k][0], min);
5902 k = isl_basic_set_alloc_inequality(bset);
5905 isl_int_set_si(bset->ineq[k][1], -1);
5906 isl_int_set(bset->ineq[k][0], max);
5910 isl_basic_set_free(bset);
5914 /* Return the Cartesian product of the basic sets in list (in the given order).
5916 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5924 struct isl_basic_set *product = NULL;
5928 isl_assert(list->ctx, list->n > 0, goto error);
5929 isl_assert(list->ctx, list->p[0], goto error);
5930 nparam = isl_basic_set_n_param(list->p[0]);
5931 dim = isl_basic_set_n_dim(list->p[0]);
5932 extra = list->p[0]->n_div;
5933 n_eq = list->p[0]->n_eq;
5934 n_ineq = list->p[0]->n_ineq;
5935 for (i = 1; i < list->n; ++i) {
5936 isl_assert(list->ctx, list->p[i], goto error);
5937 isl_assert(list->ctx,
5938 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5939 dim += isl_basic_set_n_dim(list->p[i]);
5940 extra += list->p[i]->n_div;
5941 n_eq += list->p[i]->n_eq;
5942 n_ineq += list->p[i]->n_ineq;
5944 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5949 for (i = 0; i < list->n; ++i) {
5950 isl_basic_set_add_constraints(product,
5951 isl_basic_set_copy(list->p[i]), dim);
5952 dim += isl_basic_set_n_dim(list->p[i]);
5954 isl_basic_set_list_free(list);
5957 isl_basic_set_free(product);
5958 isl_basic_set_list_free(list);
5962 struct isl_basic_map *isl_basic_map_product(
5963 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5965 struct isl_dim *dim_result = NULL;
5966 struct isl_basic_map *bmap;
5967 unsigned in1, in2, out1, out2, nparam, total, pos;
5968 struct isl_dim_map *dim_map1, *dim_map2;
5970 if (!bmap1 || !bmap2)
5973 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5974 bmap2->dim, isl_dim_param), goto error);
5975 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5976 isl_dim_copy(bmap2->dim));
5978 in1 = isl_basic_map_n_in(bmap1);
5979 in2 = isl_basic_map_n_in(bmap2);
5980 out1 = isl_basic_map_n_out(bmap1);
5981 out2 = isl_basic_map_n_out(bmap2);
5982 nparam = isl_basic_map_n_param(bmap1);
5984 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5985 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5986 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5987 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5988 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5989 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5990 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5991 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5992 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5993 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5994 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5996 bmap = isl_basic_map_alloc_dim(dim_result,
5997 bmap1->n_div + bmap2->n_div,
5998 bmap1->n_eq + bmap2->n_eq,
5999 bmap1->n_ineq + bmap2->n_ineq);
6000 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6001 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6002 bmap = isl_basic_map_simplify(bmap);
6003 return isl_basic_map_finalize(bmap);
6005 isl_basic_map_free(bmap1);
6006 isl_basic_map_free(bmap2);
6010 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6012 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6015 struct isl_map *result;
6021 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6022 map2->dim, isl_dim_param), goto error);
6024 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6025 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6026 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6028 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6029 isl_dim_copy(map2->dim)),
6030 map1->n * map2->n, flags);
6033 for (i = 0; i < map1->n; ++i)
6034 for (j = 0; j < map2->n; ++j) {
6035 struct isl_basic_map *part;
6036 part = isl_basic_map_product(
6037 isl_basic_map_copy(map1->p[i]),
6038 isl_basic_map_copy(map2->p[j]));
6039 if (isl_basic_map_is_empty(part))
6040 isl_basic_map_free(part);
6042 result = isl_map_add_basic_map(result, part);
6055 /* Given two set A and B, construct its Cartesian product A x B.
6057 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6059 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6060 (struct isl_map *)set2);
6063 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6066 uint32_t hash = isl_hash_init();
6071 bset = isl_basic_set_copy(bset);
6072 bset = isl_basic_set_normalize(bset);
6075 total = isl_basic_set_total_dim(bset);
6076 isl_hash_byte(hash, bset->n_eq & 0xFF);
6077 for (i = 0; i < bset->n_eq; ++i) {
6079 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6080 isl_hash_hash(hash, c_hash);
6082 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6083 for (i = 0; i < bset->n_ineq; ++i) {
6085 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6086 isl_hash_hash(hash, c_hash);
6088 isl_hash_byte(hash, bset->n_div & 0xFF);
6089 for (i = 0; i < bset->n_div; ++i) {
6091 if (isl_int_is_zero(bset->div[i][0]))
6093 isl_hash_byte(hash, i & 0xFF);
6094 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6095 isl_hash_hash(hash, c_hash);
6097 isl_basic_set_free(bset);
6101 uint32_t isl_set_get_hash(struct isl_set *set)
6108 set = isl_set_copy(set);
6109 set = isl_set_normalize(set);
6113 hash = isl_hash_init();
6114 for (i = 0; i < set->n; ++i) {
6116 bset_hash = isl_basic_set_get_hash(set->p[i]);
6117 isl_hash_hash(hash, bset_hash);
6125 /* Check if the value for dimension dim is completely determined
6126 * by the values of the other parameters and variables.
6127 * That is, check if dimension dim is involved in an equality.
6129 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6136 nparam = isl_basic_set_n_param(bset);
6137 for (i = 0; i < bset->n_eq; ++i)
6138 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6143 /* Check if the value for dimension dim is completely determined
6144 * by the values of the other parameters and variables.
6145 * That is, check if dimension dim is involved in an equality
6146 * for each of the subsets.
6148 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6154 for (i = 0; i < set->n; ++i) {
6156 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6163 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6164 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6171 for (i = 0; i < map->n; ++i)
6172 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6178 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6179 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6186 for (i = 0; i < set->n; ++i)
6187 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6193 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6195 struct isl_dim *dim;
6200 if (bset->n_div == 0)
6203 bset = isl_basic_set_cow(bset);
6207 dim = isl_basic_set_get_dim(bset);
6208 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6211 isl_dim_free(bset->dim);
6217 isl_basic_set_free(bset);
6221 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6224 struct isl_dim *dim;
6227 set = isl_set_align_divs(set);
6231 if (set->n == 0 || set->p[0]->n_div == 0)
6234 set = isl_set_cow(set);
6238 n_div = set->p[0]->n_div;
6239 dim = isl_set_get_dim(set);
6240 dim = isl_dim_add(dim, isl_dim_set, n_div);
6243 isl_dim_free(set->dim);
6246 for (i = 0; i < set->n; ++i) {
6247 set->p[i] = isl_basic_set_lift(set->p[i]);
6258 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6260 struct isl_dim *dim;
6261 struct isl_basic_map *bmap;
6268 set = isl_set_align_divs(set);
6273 dim = isl_set_get_dim(set);
6274 if (set->n == 0 || set->p[0]->n_div == 0) {
6276 return isl_map_identity(dim);
6279 n_div = set->p[0]->n_div;
6280 dim = isl_dim_map(dim);
6281 n_param = isl_dim_size(dim, isl_dim_param);
6282 n_set = isl_dim_size(dim, isl_dim_in);
6283 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6284 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6285 for (i = 0; i < n_set; ++i)
6286 bmap = var_equal(bmap, i);
6288 total = n_param + n_set + n_set + n_div;
6289 for (i = 0; i < n_div; ++i) {
6290 k = isl_basic_map_alloc_inequality(bmap);
6293 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6294 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6295 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6296 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6297 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6298 set->p[0]->div[i][0]);
6300 l = isl_basic_map_alloc_inequality(bmap);
6303 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6304 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6305 set->p[0]->div[i][0]);
6306 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6310 return isl_map_from_basic_map(bmap);
6313 isl_basic_map_free(bmap);
6317 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6325 dim = isl_basic_set_total_dim(bset);
6326 size += bset->n_eq * (1 + dim);
6327 size += bset->n_ineq * (1 + dim);
6328 size += bset->n_div * (2 + dim);
6333 int isl_set_size(__isl_keep isl_set *set)
6341 for (i = 0; i < set->n; ++i)
6342 size += isl_basic_set_size(set->p[i]);