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)
2114 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2117 /* just the simple case for now */
2118 isl_assert(bmap->ctx,
2119 pos(bmap->dim, dst_type) + dst_pos ==
2120 pos(bmap->dim, src_type) + src_pos + ((src_type < dst_type) ? n : 0),
2123 if (dst_type == src_type)
2126 bmap = isl_basic_map_cow(bmap);
2130 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos, src_type, src_pos, n);
2136 isl_basic_map_free(bmap);
2140 __isl_give isl_set *isl_set_move(__isl_take isl_set *set,
2141 enum isl_dim_type dst_type, unsigned dst_pos,
2142 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2146 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2147 return (isl_set *)isl_map_move((isl_map *)set, dst_type, dst_pos,
2148 src_type, src_pos, n);
2154 __isl_give isl_map *isl_map_move(__isl_take isl_map *map,
2155 enum isl_dim_type dst_type, unsigned dst_pos,
2156 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2165 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2168 /* just the simple case for now */
2169 isl_assert(map->ctx,
2170 map_offset(map, dst_type) + dst_pos ==
2171 map_offset(map, src_type) + src_pos + ((src_type < dst_type) ? n : 0),
2174 if (dst_type == src_type)
2177 map = isl_map_cow(map);
2181 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2185 for (i = 0; i < map->n; ++i) {
2186 map->p[i] = isl_basic_map_move(map->p[i], dst_type, dst_pos,
2187 src_type, src_pos, n);
2198 /* Move the specified dimensions to the last columns right before
2199 * the divs. Don't change the dimension specification of bmap.
2200 * That's the responsibility of the caller.
2202 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2203 enum isl_dim_type type, unsigned first, unsigned n)
2205 struct isl_dim_map *dim_map;
2206 struct isl_basic_map *res;
2207 enum isl_dim_type t;
2208 unsigned total, off;
2212 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2215 total = isl_basic_map_total_dim(bmap);
2216 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2219 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2220 unsigned size = isl_dim_size(bmap->dim, t);
2222 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2225 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2226 first, n, total - bmap->n_div - n);
2227 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2228 first + n, size - (first + n), off);
2229 off += size - (first + n);
2231 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2235 isl_dim_map_div(dim_map, bmap, off + n);
2237 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2238 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2239 res = add_constraints_dim_map(res, bmap, dim_map);
2243 /* Turn the n dimensions of type type, starting at first
2244 * into existentially quantified variables.
2246 __isl_give isl_basic_map *isl_basic_map_project_out(
2247 __isl_take isl_basic_map *bmap,
2248 enum isl_dim_type type, unsigned first, unsigned n)
2261 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2262 return isl_basic_map_remove(bmap, type, first, n);
2264 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2267 bmap = move_last(bmap, type, first, n);
2268 bmap = isl_basic_map_cow(bmap);
2270 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2271 old = bmap->block2.data;
2272 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2273 (bmap->extra + n) * (1 + row_size));
2274 if (!bmap->block2.data)
2276 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2279 for (i = 0; i < n; ++i) {
2280 new_div[i] = bmap->block2.data +
2281 (bmap->extra + i) * (1 + row_size);
2282 isl_seq_clr(new_div[i], 1 + row_size);
2284 for (i = 0; i < bmap->extra; ++i)
2285 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2287 bmap->div = new_div;
2291 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2294 bmap = isl_basic_map_simplify(bmap);
2295 bmap = isl_basic_map_drop_redundant_divs(bmap);
2296 return isl_basic_map_finalize(bmap);
2298 isl_basic_map_free(bmap);
2302 /* Turn the n dimensions of type type, starting at first
2303 * into existentially quantified variables.
2305 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2306 enum isl_dim_type type, unsigned first, unsigned n)
2308 return (isl_basic_set *)isl_basic_map_project_out(
2309 (isl_basic_map *)bset, type, first, n);
2312 /* Turn the n dimensions of type type, starting at first
2313 * into existentially quantified variables.
2315 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2316 enum isl_dim_type type, unsigned first, unsigned n)
2326 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2328 map = isl_map_cow(map);
2332 map->dim = isl_dim_drop(map->dim, type, first, n);
2336 for (i = 0; i < map->n; ++i) {
2337 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2348 /* Turn the n dimensions of type type, starting at first
2349 * into existentially quantified variables.
2351 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2352 enum isl_dim_type type, unsigned first, unsigned n)
2354 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2357 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2361 for (i = 0; i < n; ++i) {
2362 j = isl_basic_map_alloc_div(bmap);
2365 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2369 isl_basic_map_free(bmap);
2373 struct isl_basic_map *isl_basic_map_apply_range(
2374 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2376 struct isl_dim *dim_result = NULL;
2377 struct isl_basic_map *bmap;
2378 unsigned n_in, n_out, n, nparam, total, pos;
2379 struct isl_dim_map *dim_map1, *dim_map2;
2381 if (!bmap1 || !bmap2)
2384 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2385 isl_dim_copy(bmap2->dim));
2387 n_in = isl_basic_map_n_in(bmap1);
2388 n_out = isl_basic_map_n_out(bmap2);
2389 n = isl_basic_map_n_out(bmap1);
2390 nparam = isl_basic_map_n_param(bmap1);
2392 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2393 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2394 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2395 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2396 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2397 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2398 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2399 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2400 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2401 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2402 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2404 bmap = isl_basic_map_alloc_dim(dim_result,
2405 bmap1->n_div + bmap2->n_div + n,
2406 bmap1->n_eq + bmap2->n_eq,
2407 bmap1->n_ineq + bmap2->n_ineq);
2408 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2409 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2410 bmap = add_divs(bmap, n);
2411 bmap = isl_basic_map_simplify(bmap);
2412 bmap = isl_basic_map_drop_redundant_divs(bmap);
2413 return isl_basic_map_finalize(bmap);
2415 isl_basic_map_free(bmap1);
2416 isl_basic_map_free(bmap2);
2420 struct isl_basic_set *isl_basic_set_apply(
2421 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2426 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2429 return (struct isl_basic_set *)
2430 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2432 isl_basic_set_free(bset);
2433 isl_basic_map_free(bmap);
2437 struct isl_basic_map *isl_basic_map_apply_domain(
2438 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2440 if (!bmap1 || !bmap2)
2443 isl_assert(bmap1->ctx,
2444 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2445 isl_assert(bmap1->ctx,
2446 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2449 bmap1 = isl_basic_map_reverse(bmap1);
2450 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2451 return isl_basic_map_reverse(bmap1);
2453 isl_basic_map_free(bmap1);
2454 isl_basic_map_free(bmap2);
2458 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2459 * A \cap B -> f(A) + f(B)
2461 struct isl_basic_map *isl_basic_map_sum(
2462 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2464 unsigned n_in, n_out, nparam, total, pos;
2465 struct isl_basic_map *bmap = NULL;
2466 struct isl_dim_map *dim_map1, *dim_map2;
2469 if (!bmap1 || !bmap2)
2472 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2475 nparam = isl_basic_map_n_param(bmap1);
2476 n_in = isl_basic_map_n_in(bmap1);
2477 n_out = isl_basic_map_n_out(bmap1);
2479 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2480 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2481 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2482 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2483 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2484 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2485 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2486 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2487 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2488 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2489 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2491 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2492 bmap1->n_div + bmap2->n_div + 2 * n_out,
2493 bmap1->n_eq + bmap2->n_eq + n_out,
2494 bmap1->n_ineq + bmap2->n_ineq);
2495 for (i = 0; i < n_out; ++i) {
2496 int j = isl_basic_map_alloc_equality(bmap);
2499 isl_seq_clr(bmap->eq[j], 1+total);
2500 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2501 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2502 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2504 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2505 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2506 bmap = add_divs(bmap, 2 * n_out);
2508 bmap = isl_basic_map_simplify(bmap);
2509 return isl_basic_map_finalize(bmap);
2511 isl_basic_map_free(bmap);
2512 isl_basic_map_free(bmap1);
2513 isl_basic_map_free(bmap2);
2517 /* Given two maps A -> f(A) and B -> g(B), construct a map
2518 * A \cap B -> f(A) + f(B)
2520 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2522 struct isl_map *result;
2528 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2530 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2531 map1->n * map2->n, 0);
2534 for (i = 0; i < map1->n; ++i)
2535 for (j = 0; j < map2->n; ++j) {
2536 struct isl_basic_map *part;
2537 part = isl_basic_map_sum(
2538 isl_basic_map_copy(map1->p[i]),
2539 isl_basic_map_copy(map2->p[j]));
2540 if (isl_basic_map_is_empty(part))
2541 isl_basic_map_free(part);
2543 result = isl_map_add_basic_map(result, part);
2556 /* Given a basic map A -> f(A), construct A -> -f(A).
2558 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2563 bmap = isl_basic_map_cow(bmap);
2567 n = isl_basic_map_dim(bmap, isl_dim_out);
2568 off = isl_basic_map_offset(bmap, isl_dim_out);
2569 for (i = 0; i < bmap->n_eq; ++i)
2570 for (j = 0; j < n; ++j)
2571 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2572 for (i = 0; i < bmap->n_ineq; ++i)
2573 for (j = 0; j < n; ++j)
2574 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2575 for (i = 0; i < bmap->n_div; ++i)
2576 for (j = 0; j < n; ++j)
2577 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2578 return isl_basic_map_finalize(bmap);
2581 /* Given a map A -> f(A), construct A -> -f(A).
2583 struct isl_map *isl_map_neg(struct isl_map *map)
2587 map = isl_map_cow(map);
2591 for (i = 0; i < map->n; ++i) {
2592 map->p[i] = isl_basic_map_neg(map->p[i]);
2603 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2604 * A -> floor(f(A)/d).
2606 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2609 unsigned n_in, n_out, nparam, total, pos;
2610 struct isl_basic_map *result = NULL;
2611 struct isl_dim_map *dim_map;
2617 nparam = isl_basic_map_n_param(bmap);
2618 n_in = isl_basic_map_n_in(bmap);
2619 n_out = isl_basic_map_n_out(bmap);
2621 total = nparam + n_in + n_out + bmap->n_div + n_out;
2622 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2623 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2624 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2625 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2626 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2628 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2629 bmap->n_div + n_out,
2630 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2631 result = add_constraints_dim_map(result, bmap, dim_map);
2632 result = add_divs(result, n_out);
2633 for (i = 0; i < n_out; ++i) {
2635 j = isl_basic_map_alloc_inequality(result);
2638 isl_seq_clr(result->ineq[j], 1+total);
2639 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2640 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2641 j = isl_basic_map_alloc_inequality(result);
2644 isl_seq_clr(result->ineq[j], 1+total);
2645 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2646 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2647 isl_int_sub_ui(result->ineq[j][0], d, 1);
2650 result = isl_basic_map_simplify(result);
2651 return isl_basic_map_finalize(result);
2653 isl_basic_map_free(result);
2657 /* Given a map A -> f(A) and an integer d, construct a map
2658 * A -> floor(f(A)/d).
2660 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2664 map = isl_map_cow(map);
2668 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2669 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2670 for (i = 0; i < map->n; ++i) {
2671 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2682 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2688 i = isl_basic_map_alloc_equality(bmap);
2691 nparam = isl_basic_map_n_param(bmap);
2692 n_in = isl_basic_map_n_in(bmap);
2693 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2694 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2695 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2696 return isl_basic_map_finalize(bmap);
2698 isl_basic_map_free(bmap);
2702 /* Add a constraints to "bmap" expressing i_pos < o_pos
2704 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2710 i = isl_basic_map_alloc_inequality(bmap);
2713 nparam = isl_basic_map_n_param(bmap);
2714 n_in = isl_basic_map_n_in(bmap);
2715 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2716 isl_int_set_si(bmap->ineq[i][0], -1);
2717 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2718 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2719 return isl_basic_map_finalize(bmap);
2721 isl_basic_map_free(bmap);
2725 /* Add a constraints to "bmap" expressing i_pos > o_pos
2727 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2733 i = isl_basic_map_alloc_inequality(bmap);
2736 nparam = isl_basic_map_n_param(bmap);
2737 n_in = isl_basic_map_n_in(bmap);
2738 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2739 isl_int_set_si(bmap->ineq[i][0], -1);
2740 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2741 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2742 return isl_basic_map_finalize(bmap);
2744 isl_basic_map_free(bmap);
2748 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2751 struct isl_basic_map *bmap;
2752 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2755 for (i = 0; i < n_equal && bmap; ++i)
2756 bmap = var_equal(bmap, i);
2757 return isl_basic_map_finalize(bmap);
2760 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2762 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2765 struct isl_basic_map *bmap;
2766 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2769 for (i = 0; i < pos && bmap; ++i)
2770 bmap = var_equal(bmap, i);
2772 bmap = var_less(bmap, pos);
2773 return isl_basic_map_finalize(bmap);
2776 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2778 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2781 struct isl_basic_map *bmap;
2782 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2785 for (i = 0; i < pos && bmap; ++i)
2786 bmap = var_equal(bmap, i);
2788 bmap = var_more(bmap, pos);
2789 return isl_basic_map_finalize(bmap);
2792 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2794 struct isl_map *map;
2801 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2803 for (i = 0; i < dim; ++i)
2804 map = isl_map_add_basic_map(map,
2805 isl_basic_map_less_at(isl_dim_copy(dims), i));
2807 map = isl_map_add_basic_map(map,
2808 isl_basic_map_equal(isl_dim_copy(dims), dim));
2814 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2816 return map_lex_lte(isl_dim_map(set_dim), 0);
2819 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2821 return map_lex_lte(isl_dim_map(set_dim), 1);
2824 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2826 struct isl_map *map;
2833 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2835 for (i = 0; i < dim; ++i)
2836 map = isl_map_add_basic_map(map,
2837 isl_basic_map_more_at(isl_dim_copy(dims), i));
2839 map = isl_map_add_basic_map(map,
2840 isl_basic_map_equal(isl_dim_copy(dims), dim));
2846 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2848 return map_lex_gte(isl_dim_map(set_dim), 0);
2851 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2853 return map_lex_gte(isl_dim_map(set_dim), 1);
2856 struct isl_basic_map *isl_basic_map_from_basic_set(
2857 struct isl_basic_set *bset, struct isl_dim *dim)
2859 struct isl_basic_map *bmap;
2861 bset = isl_basic_set_cow(bset);
2865 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2866 isl_dim_free(bset->dim);
2867 bmap = (struct isl_basic_map *) bset;
2869 return isl_basic_map_finalize(bmap);
2871 isl_basic_set_free(bset);
2876 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2880 if (bmap->dim->n_in == 0)
2881 return (struct isl_basic_set *)bmap;
2882 bmap = isl_basic_map_cow(bmap);
2885 bmap->dim = isl_dim_cow(bmap->dim);
2888 bmap->dim->n_out += bmap->dim->n_in;
2889 bmap->dim->n_in = 0;
2890 bmap = isl_basic_map_finalize(bmap);
2891 return (struct isl_basic_set *)bmap;
2893 isl_basic_map_free(bmap);
2897 /* For a div d = floor(f/m), add the constraints
2900 * -(f-(n-1)) + m d >= 0
2902 * Note that the second constraint is the negation of
2906 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2909 unsigned total = isl_basic_map_total_dim(bmap);
2910 unsigned div_pos = 1 + total - bmap->n_div + div;
2912 i = isl_basic_map_alloc_inequality(bmap);
2915 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2916 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2918 j = isl_basic_map_alloc_inequality(bmap);
2921 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2922 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2923 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2927 struct isl_basic_set *isl_basic_map_underlying_set(
2928 struct isl_basic_map *bmap)
2932 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2933 return (struct isl_basic_set *)bmap;
2934 bmap = isl_basic_map_cow(bmap);
2937 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2940 bmap->extra -= bmap->n_div;
2942 bmap = isl_basic_map_finalize(bmap);
2943 return (struct isl_basic_set *)bmap;
2948 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2949 __isl_take isl_basic_set *bset)
2951 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2954 struct isl_basic_map *isl_basic_map_overlying_set(
2955 struct isl_basic_set *bset, struct isl_basic_map *like)
2957 struct isl_basic_map *bmap;
2958 struct isl_ctx *ctx;
2965 isl_assert(ctx, bset->n_div == 0, goto error);
2966 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2967 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2969 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2970 isl_basic_map_free(like);
2971 return (struct isl_basic_map *)bset;
2973 bset = isl_basic_set_cow(bset);
2976 total = bset->dim->n_out + bset->extra;
2977 bmap = (struct isl_basic_map *)bset;
2978 isl_dim_free(bmap->dim);
2979 bmap->dim = isl_dim_copy(like->dim);
2982 bmap->n_div = like->n_div;
2983 bmap->extra += like->n_div;
2986 ltotal = total - bmap->extra + like->extra;
2989 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2990 bmap->extra * (1 + 1 + total));
2991 if (isl_blk_is_error(bmap->block2))
2993 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2997 for (i = 0; i < bmap->extra; ++i)
2998 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2999 for (i = 0; i < like->n_div; ++i) {
3000 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3001 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3003 bmap = isl_basic_map_extend_constraints(bmap,
3004 0, 2 * like->n_div);
3005 for (i = 0; i < like->n_div; ++i) {
3006 if (isl_int_is_zero(bmap->div[i][0]))
3008 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3012 isl_basic_map_free(like);
3013 bmap = isl_basic_map_simplify(bmap);
3014 bmap = isl_basic_map_finalize(bmap);
3017 isl_basic_map_free(like);
3018 isl_basic_set_free(bset);
3022 struct isl_basic_set *isl_basic_set_from_underlying_set(
3023 struct isl_basic_set *bset, struct isl_basic_set *like)
3025 return (struct isl_basic_set *)
3026 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3029 struct isl_set *isl_set_from_underlying_set(
3030 struct isl_set *set, struct isl_basic_set *like)
3036 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3038 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3039 isl_basic_set_free(like);
3042 set = isl_set_cow(set);
3045 for (i = 0; i < set->n; ++i) {
3046 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3047 isl_basic_set_copy(like));
3051 isl_dim_free(set->dim);
3052 set->dim = isl_dim_copy(like->dim);
3055 isl_basic_set_free(like);
3058 isl_basic_set_free(like);
3063 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3067 map = isl_map_cow(map);
3070 map->dim = isl_dim_cow(map->dim);
3074 for (i = 1; i < map->n; ++i)
3075 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3077 for (i = 0; i < map->n; ++i) {
3078 map->p[i] = (struct isl_basic_map *)
3079 isl_basic_map_underlying_set(map->p[i]);
3084 map->dim = isl_dim_underlying(map->dim, 0);
3086 isl_dim_free(map->dim);
3087 map->dim = isl_dim_copy(map->p[0]->dim);
3091 return (struct isl_set *)map;
3097 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3099 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3102 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3104 struct isl_basic_set *domain;
3109 n_in = isl_basic_map_n_in(bmap);
3110 n_out = isl_basic_map_n_out(bmap);
3111 domain = isl_basic_set_from_basic_map(bmap);
3112 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3115 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3117 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3120 struct isl_set *isl_map_range(struct isl_map *map)
3123 struct isl_set *set;
3127 if (isl_map_dim(map, isl_dim_in) == 0)
3128 return (isl_set *)map;
3130 map = isl_map_cow(map);
3134 set = (struct isl_set *) map;
3135 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3138 for (i = 0; i < map->n; ++i) {
3139 set->p[i] = isl_basic_map_range(map->p[i]);
3143 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3144 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3151 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3154 struct isl_map *map = NULL;
3156 set = isl_set_cow(set);
3159 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3160 map = (struct isl_map *)set;
3161 for (i = 0; i < set->n; ++i) {
3162 map->p[i] = isl_basic_map_from_basic_set(
3163 set->p[i], isl_dim_copy(dim));
3167 isl_dim_free(map->dim);
3176 struct isl_map *isl_map_from_range(struct isl_set *set)
3178 return (struct isl_map *)set;
3181 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3183 return isl_map_reverse(isl_map_from_range(set));;
3186 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3187 __isl_take isl_set *range)
3189 return isl_map_product(isl_map_from_domain(domain),
3190 isl_map_from_range(range));
3193 struct isl_set *isl_set_from_map(struct isl_map *map)
3196 struct isl_set *set = NULL;
3200 map = isl_map_cow(map);
3203 map->dim = isl_dim_cow(map->dim);
3206 map->dim->n_out += map->dim->n_in;
3208 set = (struct isl_set *)map;
3209 for (i = 0; i < map->n; ++i) {
3210 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3220 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3222 struct isl_map *map;
3226 isl_assert(dim->ctx, n >= 0, return NULL);
3227 map = isl_alloc(dim->ctx, struct isl_map,
3228 sizeof(struct isl_map) +
3229 (n - 1) * sizeof(struct isl_basic_map *));
3233 map->ctx = dim->ctx;
3234 isl_ctx_ref(map->ctx);
3246 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3247 unsigned nparam, unsigned in, unsigned out, int n,
3250 struct isl_map *map;
3251 struct isl_dim *dims;
3253 dims = isl_dim_alloc(ctx, nparam, in, out);
3257 map = isl_map_alloc_dim(dims, n, flags);
3261 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3263 struct isl_basic_map *bmap;
3264 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3265 bmap = isl_basic_map_set_to_empty(bmap);
3269 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3271 struct isl_basic_set *bset;
3272 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3273 bset = isl_basic_set_set_to_empty(bset);
3277 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3279 struct isl_basic_map *bmap;
3282 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3283 bmap = isl_basic_map_set_to_empty(bmap);
3287 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3289 struct isl_basic_map *bmap;
3292 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3293 bmap = isl_basic_map_set_to_empty(bmap);
3297 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3299 struct isl_basic_set *bset;
3302 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3303 bset = isl_basic_set_set_to_empty(bset);
3307 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3309 struct isl_basic_map *bmap;
3310 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3314 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3316 struct isl_basic_set *bset;
3317 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3321 __isl_give isl_basic_map *isl_basic_map_universe_like(
3322 __isl_keep isl_basic_map *model)
3326 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3329 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3333 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3336 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3337 __isl_keep isl_set *model)
3341 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3344 struct isl_map *isl_map_empty(struct isl_dim *dim)
3346 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3349 struct isl_map *isl_map_empty_like(struct isl_map *model)
3353 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3356 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3360 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3363 struct isl_set *isl_set_empty(struct isl_dim *dim)
3365 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3368 struct isl_set *isl_set_empty_like(struct isl_set *model)
3372 return isl_set_empty(isl_dim_copy(model->dim));
3375 struct isl_map *isl_map_universe(struct isl_dim *dim)
3377 struct isl_map *map;
3380 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3381 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3385 struct isl_set *isl_set_universe(struct isl_dim *dim)
3387 struct isl_set *set;
3390 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3391 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3395 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3399 return isl_set_universe(isl_dim_copy(model->dim));
3402 struct isl_map *isl_map_dup(struct isl_map *map)
3405 struct isl_map *dup;
3409 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3410 for (i = 0; i < map->n; ++i)
3411 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3415 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3416 __isl_take isl_basic_map *bmap)
3420 if (isl_basic_map_fast_is_empty(bmap)) {
3421 isl_basic_map_free(bmap);
3424 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3425 isl_assert(map->ctx, map->n < map->size, goto error);
3426 map->p[map->n] = bmap;
3428 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3434 isl_basic_map_free(bmap);
3438 void isl_map_free(struct isl_map *map)
3448 isl_ctx_deref(map->ctx);
3449 for (i = 0; i < map->n; ++i)
3450 isl_basic_map_free(map->p[i]);
3451 isl_dim_free(map->dim);
3455 struct isl_map *isl_map_extend(struct isl_map *base,
3456 unsigned nparam, unsigned n_in, unsigned n_out)
3460 base = isl_map_cow(base);
3464 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3467 for (i = 0; i < base->n; ++i) {
3468 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3469 isl_dim_copy(base->dim), 0, 0, 0);
3479 struct isl_set *isl_set_extend(struct isl_set *base,
3480 unsigned nparam, unsigned dim)
3482 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3486 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3487 struct isl_basic_map *bmap, unsigned pos, int value)
3491 bmap = isl_basic_map_cow(bmap);
3492 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3493 j = isl_basic_map_alloc_equality(bmap);
3496 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3497 isl_int_set_si(bmap->eq[j][pos], -1);
3498 isl_int_set_si(bmap->eq[j][0], value);
3499 bmap = isl_basic_map_simplify(bmap);
3500 return isl_basic_map_finalize(bmap);
3502 isl_basic_map_free(bmap);
3506 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3507 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3511 bmap = isl_basic_map_cow(bmap);
3512 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3513 j = isl_basic_map_alloc_equality(bmap);
3516 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3517 isl_int_set_si(bmap->eq[j][pos], -1);
3518 isl_int_set(bmap->eq[j][0], value);
3519 bmap = isl_basic_map_simplify(bmap);
3520 return isl_basic_map_finalize(bmap);
3522 isl_basic_map_free(bmap);
3526 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3527 enum isl_dim_type type, unsigned pos, int value)
3531 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3532 return isl_basic_map_fix_pos_si(bmap,
3533 isl_basic_map_offset(bmap, type) + pos, value);
3535 isl_basic_map_free(bmap);
3539 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3540 enum isl_dim_type type, unsigned pos, isl_int value)
3544 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3545 return isl_basic_map_fix_pos(bmap,
3546 isl_basic_map_offset(bmap, type) + pos, value);
3548 isl_basic_map_free(bmap);
3552 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3553 enum isl_dim_type type, unsigned pos, int value)
3555 return (struct isl_basic_set *)
3556 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3560 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3561 enum isl_dim_type type, unsigned pos, isl_int value)
3563 return (struct isl_basic_set *)
3564 isl_basic_map_fix((struct isl_basic_map *)bset,
3568 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3569 unsigned input, int value)
3571 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3574 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3575 unsigned dim, int value)
3577 return (struct isl_basic_set *)
3578 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3579 isl_dim_set, dim, value);
3582 struct isl_map *isl_map_fix_si(struct isl_map *map,
3583 enum isl_dim_type type, unsigned pos, int value)
3587 map = isl_map_cow(map);
3591 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3592 for (i = 0; i < map->n; ++i) {
3593 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3597 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3604 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3605 enum isl_dim_type type, unsigned pos, int value)
3607 return (struct isl_set *)
3608 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3611 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3612 enum isl_dim_type type, unsigned pos, isl_int value)
3616 map = isl_map_cow(map);
3620 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3621 for (i = 0; i < map->n; ++i) {
3622 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3626 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3633 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3634 enum isl_dim_type type, unsigned pos, isl_int value)
3636 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3639 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3640 unsigned input, int value)
3642 return isl_map_fix_si(map, isl_dim_in, input, value);
3645 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3647 return (struct isl_set *)
3648 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3651 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3652 __isl_take isl_basic_map *bmap,
3653 enum isl_dim_type type, unsigned pos, int value)
3659 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3660 pos += isl_basic_map_offset(bmap, type);
3661 bmap = isl_basic_map_cow(bmap);
3662 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3663 j = isl_basic_map_alloc_inequality(bmap);
3666 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3667 isl_int_set_si(bmap->ineq[j][pos], 1);
3668 isl_int_set_si(bmap->ineq[j][0], -value);
3669 bmap = isl_basic_map_simplify(bmap);
3670 return isl_basic_map_finalize(bmap);
3672 isl_basic_map_free(bmap);
3676 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3677 unsigned dim, isl_int value)
3681 bset = isl_basic_set_cow(bset);
3682 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3683 j = isl_basic_set_alloc_inequality(bset);
3686 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3687 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3688 isl_int_neg(bset->ineq[j][0], value);
3689 bset = isl_basic_set_simplify(bset);
3690 return isl_basic_set_finalize(bset);
3692 isl_basic_set_free(bset);
3696 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3697 enum isl_dim_type type, unsigned pos, int value)
3701 map = isl_map_cow(map);
3705 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3706 for (i = 0; i < map->n; ++i) {
3707 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3712 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3719 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3720 enum isl_dim_type type, unsigned pos, int value)
3722 return (struct isl_set *)
3723 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3726 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3731 set = isl_set_cow(set);
3735 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3736 for (i = 0; i < set->n; ++i) {
3737 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3747 struct isl_map *isl_map_reverse(struct isl_map *map)
3751 map = isl_map_cow(map);
3755 map->dim = isl_dim_reverse(map->dim);
3758 for (i = 0; i < map->n; ++i) {
3759 map->p[i] = isl_basic_map_reverse(map->p[i]);
3763 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3770 static struct isl_map *isl_basic_map_partial_lexopt(
3771 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3772 struct isl_set **empty, int max)
3776 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3777 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3779 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3781 isl_basic_map_free(bmap);
3782 isl_basic_set_free(dom);
3788 struct isl_map *isl_basic_map_partial_lexmax(
3789 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3790 struct isl_set **empty)
3792 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3795 struct isl_map *isl_basic_map_partial_lexmin(
3796 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3797 struct isl_set **empty)
3799 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3802 struct isl_set *isl_basic_set_partial_lexmin(
3803 struct isl_basic_set *bset, struct isl_basic_set *dom,
3804 struct isl_set **empty)
3806 return (struct isl_set *)
3807 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3811 struct isl_set *isl_basic_set_partial_lexmax(
3812 struct isl_basic_set *bset, struct isl_basic_set *dom,
3813 struct isl_set **empty)
3815 return (struct isl_set *)
3816 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3820 /* Given a basic map "bmap", compute the lexicograhically minimal
3821 * (or maximal) image element for each domain element in dom.
3822 * Set *empty to those elements in dom that do not have an image element.
3824 * We first make sure the basic sets in dom are disjoint and then
3825 * simply collect the results over each of the basic sets separately.
3826 * We could probably improve the efficiency a bit by moving the union
3827 * domain down into the parametric integer programming.
3829 static __isl_give isl_map *basic_map_partial_lexopt(
3830 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3831 __isl_give isl_set **empty, int max)
3834 struct isl_map *res;
3836 dom = isl_set_make_disjoint(dom);
3840 if (isl_set_fast_is_empty(dom)) {
3841 res = isl_map_empty_like_basic_map(bmap);
3842 *empty = isl_set_empty_like(dom);
3844 isl_basic_map_free(bmap);
3848 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3849 isl_basic_set_copy(dom->p[0]), empty, max);
3851 for (i = 1; i < dom->n; ++i) {
3852 struct isl_map *res_i;
3853 struct isl_set *empty_i;
3855 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3856 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3858 res = isl_map_union_disjoint(res, res_i);
3859 *empty = isl_set_union_disjoint(*empty, empty_i);
3863 isl_basic_map_free(bmap);
3868 isl_basic_map_free(bmap);
3872 /* Given a map "map", compute the lexicograhically minimal
3873 * (or maximal) image element for each domain element in dom.
3874 * Set *empty to those elements in dom that do not have an image element.
3876 * We first compute the lexicographically minimal or maximal element
3877 * in the first basic map. This results in a partial solution "res"
3878 * and a subset "todo" of dom that still need to be handled.
3879 * We then consider each of the remaining maps in "map" and successively
3880 * improve both "res" and "todo".
3882 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3883 * Assume we are computing the lexicographical maximum.
3884 * We first intersect basic map i with a relation that maps elements
3885 * to elements that are lexicographically larger than the image elements
3886 * in res^k and the compute the maximum image element of this intersection.
3887 * The result ("better") corresponds to those image elements in basic map i
3888 * that are better than what we had before. The remainder ("keep") are the
3889 * domain elements for which the image element in res_k was better.
3890 * We also compute the lexicographical maximum of basic map i in todo^k.
3891 * res^i is the result of the operation + better + those elements in
3892 * res^k that we should keep
3893 * todo^i is the remainder of the maximum operation on todo^k.
3895 static __isl_give isl_map *isl_map_partial_lexopt(
3896 __isl_take isl_map *map, __isl_take isl_set *dom,
3897 __isl_give isl_set **empty, int max)
3900 struct isl_map *res;
3901 struct isl_set *todo;
3906 if (isl_map_fast_is_empty(map)) {
3914 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3915 isl_set_copy(dom), &todo, max);
3917 for (i = 1; i < map->n; ++i) {
3919 struct isl_map *better;
3920 struct isl_set *keep;
3921 struct isl_map *res_i;
3922 struct isl_set *todo_i;
3923 struct isl_dim *dim = isl_map_get_dim(res);
3925 dim = isl_dim_range(dim);
3927 lt = isl_map_lex_lt(dim);
3929 lt = isl_map_lex_gt(dim);
3930 lt = isl_map_apply_range(isl_map_copy(res), lt);
3931 lt = isl_map_intersect(lt,
3932 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3933 better = isl_map_partial_lexopt(lt,
3934 isl_map_domain(isl_map_copy(res)),
3937 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3938 todo, &todo_i, max);
3940 res = isl_map_intersect_domain(res, keep);
3941 res = isl_map_union_disjoint(res, res_i);
3942 res = isl_map_union_disjoint(res, better);
3963 __isl_give isl_map *isl_map_partial_lexmax(
3964 __isl_take isl_map *map, __isl_take isl_set *dom,
3965 __isl_give isl_set **empty)
3967 return isl_map_partial_lexopt(map, dom, empty, 1);
3970 __isl_give isl_map *isl_map_partial_lexmin(
3971 __isl_take isl_map *map, __isl_take isl_set *dom,
3972 __isl_give isl_set **empty)
3974 return isl_map_partial_lexopt(map, dom, empty, 0);
3977 __isl_give isl_set *isl_set_partial_lexmin(
3978 __isl_take isl_set *set, __isl_take isl_set *dom,
3979 __isl_give isl_set **empty)
3981 return (struct isl_set *)
3982 isl_map_partial_lexmin((struct isl_map *)set,
3986 __isl_give isl_set *isl_set_partial_lexmax(
3987 __isl_take isl_set *set, __isl_take isl_set *dom,
3988 __isl_give isl_set **empty)
3990 return (struct isl_set *)
3991 isl_map_partial_lexmax((struct isl_map *)set,
3995 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3997 struct isl_basic_set *dom = NULL;
3998 struct isl_dim *dom_dim;
4002 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4003 dom = isl_basic_set_universe(dom_dim);
4004 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4006 isl_basic_map_free(bmap);
4010 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4012 return isl_basic_map_lexopt(bmap, 0);
4015 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4017 return isl_basic_map_lexopt(bmap, 1);
4020 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4022 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4025 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4027 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4030 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4032 struct isl_set *dom = NULL;
4033 struct isl_dim *dom_dim;
4037 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4038 dom = isl_set_universe(dom_dim);
4039 return isl_map_partial_lexopt(map, dom, NULL, max);
4045 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4047 return isl_map_lexopt(map, 0);
4050 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4052 return isl_map_lexopt(map, 1);
4055 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4057 return (isl_set *)isl_map_lexmin((isl_map *)set);
4060 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4062 return (isl_set *)isl_map_lexmax((isl_map *)set);
4065 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4066 struct isl_dim *dim)
4073 for (i = 0; i < map->n; ++i) {
4074 isl_dim_free(map->p[i]->dim);
4075 map->p[i]->dim = isl_dim_copy(dim);
4077 isl_dim_free(map->dim);
4087 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4088 struct isl_dim *dim)
4090 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4093 /* Apply a preimage specified by "mat" on the parameters of "bset".
4094 * bset is assumed to have only parameters and divs.
4096 static struct isl_basic_set *basic_set_parameter_preimage(
4097 struct isl_basic_set *bset, struct isl_mat *mat)
4104 bset->dim = isl_dim_cow(bset->dim);
4108 nparam = isl_basic_set_dim(bset, isl_dim_param);
4110 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4112 bset->dim->nparam = 0;
4113 bset->dim->n_out = nparam;
4114 bset = isl_basic_set_preimage(bset, mat);
4116 bset->dim->nparam = bset->dim->n_out;
4117 bset->dim->n_out = 0;
4122 isl_basic_set_free(bset);
4126 /* Apply a preimage specified by "mat" on the parameters of "set".
4127 * set is assumed to have only parameters and divs.
4129 static struct isl_set *set_parameter_preimage(
4130 struct isl_set *set, struct isl_mat *mat)
4132 struct isl_dim *dim = NULL;
4138 dim = isl_dim_copy(set->dim);
4139 dim = isl_dim_cow(dim);
4143 nparam = isl_set_dim(set, isl_dim_param);
4145 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4148 dim->n_out = nparam;
4149 isl_set_reset_dim(set, dim);
4150 set = isl_set_preimage(set, mat);
4153 dim = isl_dim_copy(set->dim);
4154 dim = isl_dim_cow(dim);
4157 dim->nparam = dim->n_out;
4159 isl_set_reset_dim(set, dim);
4169 /* Intersect the basic set "bset" with the affine space specified by the
4170 * equalities in "eq".
4172 static struct isl_basic_set *basic_set_append_equalities(
4173 struct isl_basic_set *bset, struct isl_mat *eq)
4181 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4186 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4187 for (i = 0; i < eq->n_row; ++i) {
4188 k = isl_basic_set_alloc_equality(bset);
4191 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4192 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4199 isl_basic_set_free(bset);
4203 /* Intersect the set "set" with the affine space specified by the
4204 * equalities in "eq".
4206 static struct isl_set *set_append_equalities(struct isl_set *set,
4214 for (i = 0; i < set->n; ++i) {
4215 set->p[i] = basic_set_append_equalities(set->p[i],
4228 /* Project the given basic set onto its parameter domain, possibly introducing
4229 * new, explicit, existential variables in the constraints.
4230 * The input has parameters and (possibly implicit) existential variables.
4231 * The output has the same parameters, but only
4232 * explicit existentially quantified variables.
4234 * The actual projection is performed by pip, but pip doesn't seem
4235 * to like equalities very much, so we first remove the equalities
4236 * among the parameters by performing a variable compression on
4237 * the parameters. Afterward, an inverse transformation is performed
4238 * and the equalities among the parameters are inserted back in.
4240 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4244 struct isl_mat *T, *T2;
4245 struct isl_set *set;
4246 unsigned nparam, n_div;
4248 bset = isl_basic_set_cow(bset);
4252 if (bset->n_eq == 0)
4253 return isl_basic_set_lexmin(bset);
4255 isl_basic_set_gauss(bset, NULL);
4257 nparam = isl_basic_set_dim(bset, isl_dim_param);
4258 n_div = isl_basic_set_dim(bset, isl_dim_div);
4260 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4261 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4264 if (i == bset->n_eq)
4265 return isl_basic_set_lexmin(bset);
4267 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4269 eq = isl_mat_cow(eq);
4270 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4271 bset = basic_set_parameter_preimage(bset, T);
4273 set = isl_basic_set_lexmin(bset);
4274 set = set_parameter_preimage(set, T2);
4275 set = set_append_equalities(set, eq);
4279 /* Compute an explicit representation for all the existentially
4280 * quantified variables.
4281 * The input and output dimensions are first turned into parameters.
4282 * compute_divs then returns a map with the same parameters and
4283 * no input or output dimensions and the dimension specification
4284 * is reset to that of the input.
4286 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4288 struct isl_basic_set *bset;
4289 struct isl_set *set;
4290 struct isl_map *map;
4291 struct isl_dim *dim, *orig_dim = NULL;
4296 bmap = isl_basic_map_cow(bmap);
4300 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4301 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4302 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4303 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4307 orig_dim = bmap->dim;
4309 bset = (struct isl_basic_set *)bmap;
4311 set = parameter_compute_divs(bset);
4312 map = (struct isl_map *)set;
4313 map = isl_map_reset_dim(map, orig_dim);
4317 isl_basic_map_free(bmap);
4321 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4329 off = isl_dim_total(bmap->dim);
4330 for (i = 0; i < bmap->n_div; ++i) {
4331 if (isl_int_is_zero(bmap->div[i][0]))
4333 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4339 static int map_divs_known(__isl_keep isl_map *map)
4346 for (i = 0; i < map->n; ++i) {
4347 int known = basic_map_divs_known(map->p[i]);
4355 /* If bmap contains any unknown divs, then compute explicit
4356 * expressions for them. However, this computation may be
4357 * quite expensive, so first try to remove divs that aren't
4360 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4364 struct isl_map *map;
4366 known = basic_map_divs_known(bmap);
4370 return isl_map_from_basic_map(bmap);
4372 bmap = isl_basic_map_drop_redundant_divs(bmap);
4374 known = basic_map_divs_known(bmap);
4378 return isl_map_from_basic_map(bmap);
4380 map = compute_divs(bmap);
4383 isl_basic_map_free(bmap);
4387 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4391 struct isl_map *res;
4398 known = map_divs_known(map);
4406 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4407 for (i = 1 ; i < map->n; ++i) {
4409 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4410 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4411 res = isl_map_union_disjoint(res, r2);
4413 res = isl_map_union(res, r2);
4420 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4422 return (struct isl_set *)
4423 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4426 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4428 return (struct isl_set *)
4429 isl_map_compute_divs((struct isl_map *)set);
4432 struct isl_set *isl_map_domain(struct isl_map *map)
4435 struct isl_set *set;
4440 map = isl_map_cow(map);
4444 set = (struct isl_set *)map;
4445 set->dim = isl_dim_domain(set->dim);
4448 for (i = 0; i < map->n; ++i) {
4449 set->p[i] = isl_basic_map_domain(map->p[i]);
4453 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4454 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4461 struct isl_map *isl_map_union_disjoint(
4462 struct isl_map *map1, struct isl_map *map2)
4466 struct isl_map *map = NULL;
4480 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4482 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4483 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4484 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4486 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4487 map1->n + map2->n, flags);
4490 for (i = 0; i < map1->n; ++i) {
4491 map = isl_map_add_basic_map(map,
4492 isl_basic_map_copy(map1->p[i]));
4496 for (i = 0; i < map2->n; ++i) {
4497 map = isl_map_add_basic_map(map,
4498 isl_basic_map_copy(map2->p[i]));
4512 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4514 map1 = isl_map_union_disjoint(map1, map2);
4518 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4522 struct isl_set *isl_set_union_disjoint(
4523 struct isl_set *set1, struct isl_set *set2)
4525 return (struct isl_set *)
4526 isl_map_union_disjoint(
4527 (struct isl_map *)set1, (struct isl_map *)set2);
4530 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4532 return (struct isl_set *)
4533 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4536 struct isl_map *isl_map_intersect_range(
4537 struct isl_map *map, struct isl_set *set)
4540 struct isl_map *result;
4546 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4547 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4548 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4550 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4551 map->n * set->n, flags);
4554 for (i = 0; i < map->n; ++i)
4555 for (j = 0; j < set->n; ++j) {
4556 result = isl_map_add_basic_map(result,
4557 isl_basic_map_intersect_range(
4558 isl_basic_map_copy(map->p[i]),
4559 isl_basic_set_copy(set->p[j])));
4572 struct isl_map *isl_map_intersect_domain(
4573 struct isl_map *map, struct isl_set *set)
4575 return isl_map_reverse(
4576 isl_map_intersect_range(isl_map_reverse(map), set));
4579 struct isl_map *isl_map_apply_domain(
4580 struct isl_map *map1, struct isl_map *map2)
4584 map1 = isl_map_reverse(map1);
4585 map1 = isl_map_apply_range(map1, map2);
4586 return isl_map_reverse(map1);
4593 struct isl_map *isl_map_apply_range(
4594 struct isl_map *map1, struct isl_map *map2)
4596 struct isl_dim *dim_result;
4597 struct isl_map *result;
4603 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4604 isl_dim_copy(map2->dim));
4606 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4609 for (i = 0; i < map1->n; ++i)
4610 for (j = 0; j < map2->n; ++j) {
4611 result = isl_map_add_basic_map(result,
4612 isl_basic_map_apply_range(
4613 isl_basic_map_copy(map1->p[i]),
4614 isl_basic_map_copy(map2->p[j])));
4620 if (result && result->n <= 1)
4621 ISL_F_SET(result, ISL_MAP_DISJOINT);
4630 * returns range - domain
4632 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4634 struct isl_basic_set *bset;
4641 dim = isl_basic_map_n_in(bmap);
4642 nparam = isl_basic_map_n_param(bmap);
4643 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4644 bset = isl_basic_set_from_basic_map(bmap);
4645 bset = isl_basic_set_cow(bset);
4646 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4647 bset = isl_basic_set_swap_vars(bset, 2*dim);
4648 for (i = 0; i < dim; ++i) {
4649 int j = isl_basic_map_alloc_equality(
4650 (struct isl_basic_map *)bset);
4653 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4654 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4655 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4656 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4658 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4660 isl_basic_map_free(bmap);
4665 * returns range - domain
4667 struct isl_set *isl_map_deltas(struct isl_map *map)
4670 struct isl_set *result;
4675 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4676 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4677 isl_map_n_in(map), map->n, map->flags);
4680 for (i = 0; i < map->n; ++i)
4681 result = isl_set_add_basic_set(result,
4682 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4690 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4692 struct isl_basic_map *bmap;
4700 nparam = dims->nparam;
4702 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4706 for (i = 0; i < dim; ++i) {
4707 int j = isl_basic_map_alloc_equality(bmap);
4710 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4711 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4712 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4714 return isl_basic_map_finalize(bmap);
4716 isl_basic_map_free(bmap);
4720 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4722 struct isl_dim *dim = isl_dim_map(set_dim);
4725 return basic_map_identity(dim);
4728 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4730 if (!model || !model->dim)
4732 isl_assert(model->ctx,
4733 model->dim->n_in == model->dim->n_out, return NULL);
4734 return basic_map_identity(isl_dim_copy(model->dim));
4737 static struct isl_map *map_identity(struct isl_dim *dim)
4739 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4740 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4743 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4745 struct isl_dim *dim = isl_dim_map(set_dim);
4748 return map_identity(dim);
4751 struct isl_map *isl_map_identity_like(struct isl_map *model)
4753 if (!model || !model->dim)
4755 isl_assert(model->ctx,
4756 model->dim->n_in == model->dim->n_out, return NULL);
4757 return map_identity(isl_dim_copy(model->dim));
4760 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4762 if (!model || !model->dim)
4764 isl_assert(model->ctx,
4765 model->dim->n_in == model->dim->n_out, return NULL);
4766 return map_identity(isl_dim_copy(model->dim));
4769 /* Construct a basic set with all set dimensions having only non-negative
4772 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4777 struct isl_basic_set *bset;
4781 nparam = dims->nparam;
4783 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4786 for (i = 0; i < dim; ++i) {
4787 int k = isl_basic_set_alloc_inequality(bset);
4790 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4791 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4795 isl_basic_set_free(bset);
4799 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4801 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4804 int isl_basic_map_is_subset(
4805 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4808 struct isl_map *map1;
4809 struct isl_map *map2;
4811 if (!bmap1 || !bmap2)
4814 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4815 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4817 is_subset = isl_map_is_subset(map1, map2);
4825 int isl_basic_map_is_equal(
4826 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4830 if (!bmap1 || !bmap2)
4832 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4835 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4839 int isl_basic_set_is_equal(
4840 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4842 return isl_basic_map_is_equal(
4843 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4846 int isl_map_is_empty(struct isl_map *map)
4853 for (i = 0; i < map->n; ++i) {
4854 is_empty = isl_basic_map_is_empty(map->p[i]);
4863 int isl_map_fast_is_empty(struct isl_map *map)
4868 int isl_set_fast_is_empty(struct isl_set *set)
4873 int isl_set_is_empty(struct isl_set *set)
4875 return isl_map_is_empty((struct isl_map *)set);
4878 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4884 is_subset = isl_map_is_subset(map1, map2);
4887 is_subset = isl_map_is_subset(map2, map1);
4891 int isl_basic_map_is_strict_subset(
4892 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4896 if (!bmap1 || !bmap2)
4898 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4901 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4902 if (is_subset == -1)
4907 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4913 is_subset = isl_map_is_subset(map1, map2);
4916 is_subset = isl_map_is_subset(map2, map1);
4917 if (is_subset == -1)
4922 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4924 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4927 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4931 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4934 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4938 return bset->n_eq == 0 && bset->n_ineq == 0;
4941 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4946 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4949 int isl_set_fast_is_universe(__isl_keep isl_set *set)
4951 return isl_map_fast_is_universe((isl_map *) set);
4954 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4956 struct isl_basic_set *bset = NULL;
4957 struct isl_vec *sample = NULL;
4964 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4967 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4968 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4969 copy = isl_basic_map_convex_hull(copy);
4970 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4971 isl_basic_map_free(copy);
4975 total = 1 + isl_basic_map_total_dim(bmap);
4976 if (bmap->sample && bmap->sample->size == total) {
4977 int contains = isl_basic_map_contains(bmap, bmap->sample);
4983 isl_vec_free(bmap->sample);
4984 bmap->sample = NULL;
4985 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4988 sample = isl_basic_set_sample_vec(bset);
4991 empty = sample->size == 0;
4992 isl_vec_free(bmap->sample);
4993 bmap->sample = sample;
4995 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5000 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5004 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5007 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5011 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5014 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5016 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5019 struct isl_map *isl_basic_map_union(
5020 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5022 struct isl_map *map;
5023 if (!bmap1 || !bmap2)
5026 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5028 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5031 map = isl_map_add_basic_map(map, bmap1);
5032 map = isl_map_add_basic_map(map, bmap2);
5035 isl_basic_map_free(bmap1);
5036 isl_basic_map_free(bmap2);
5040 struct isl_set *isl_basic_set_union(
5041 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5043 return (struct isl_set *)isl_basic_map_union(
5044 (struct isl_basic_map *)bset1,
5045 (struct isl_basic_map *)bset2);
5048 /* Order divs such that any div only depends on previous divs */
5049 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5052 unsigned off = isl_dim_total(bmap->dim);
5054 for (i = 0; i < bmap->n_div; ++i) {
5056 if (isl_int_is_zero(bmap->div[i][0]))
5058 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5062 isl_basic_map_swap_div(bmap, i, i + pos);
5068 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5070 return (struct isl_basic_set *)
5071 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5074 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5081 for (i = 0; i < map->n; ++i) {
5082 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5093 /* Look for a div in dst that corresponds to the div "div" in src.
5094 * The divs before "div" in src and dst are assumed to be the same.
5096 * Returns -1 if no corresponding div was found and the position
5097 * of the corresponding div in dst otherwise.
5099 static int find_div(struct isl_basic_map *dst,
5100 struct isl_basic_map *src, unsigned div)
5104 unsigned total = isl_dim_total(src->dim);
5106 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5107 for (i = div; i < dst->n_div; ++i)
5108 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5109 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5110 dst->n_div - div) == -1)
5115 struct isl_basic_map *isl_basic_map_align_divs(
5116 struct isl_basic_map *dst, struct isl_basic_map *src)
5119 unsigned total = isl_dim_total(src->dim);
5124 if (src->n_div == 0)
5127 for (i = 0; i < src->n_div; ++i)
5128 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5130 src = isl_basic_map_order_divs(src);
5131 dst = isl_basic_map_cow(dst);
5132 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5133 src->n_div, 0, 2 * src->n_div);
5136 for (i = 0; i < src->n_div; ++i) {
5137 int j = find_div(dst, src, i);
5139 j = isl_basic_map_alloc_div(dst);
5142 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5143 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5144 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5148 isl_basic_map_swap_div(dst, i, j);
5152 isl_basic_map_free(dst);
5156 struct isl_basic_set *isl_basic_set_align_divs(
5157 struct isl_basic_set *dst, struct isl_basic_set *src)
5159 return (struct isl_basic_set *)isl_basic_map_align_divs(
5160 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5163 struct isl_map *isl_map_align_divs(struct isl_map *map)
5171 map = isl_map_compute_divs(map);
5172 map = isl_map_cow(map);
5176 for (i = 1; i < map->n; ++i)
5177 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5178 for (i = 1; i < map->n; ++i)
5179 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5181 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5185 struct isl_set *isl_set_align_divs(struct isl_set *set)
5187 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5190 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5194 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5195 map = isl_map_intersect_domain(map, set);
5196 set = isl_map_range(map);
5204 /* There is no need to cow as removing empty parts doesn't change
5205 * the meaning of the set.
5207 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5214 for (i = map->n-1; i >= 0; --i) {
5215 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5217 isl_basic_map_free(map->p[i]);
5218 if (i != map->n-1) {
5219 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5220 map->p[i] = map->p[map->n-1];
5228 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5230 return (struct isl_set *)
5231 isl_map_remove_empty_parts((struct isl_map *)set);
5234 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5236 struct isl_basic_map *bmap;
5237 if (!map || map->n == 0)
5239 bmap = map->p[map->n-1];
5240 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5241 return isl_basic_map_copy(bmap);
5244 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5246 return (struct isl_basic_set *)
5247 isl_map_copy_basic_map((struct isl_map *)set);
5250 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5251 __isl_keep isl_basic_map *bmap)
5257 for (i = map->n-1; i >= 0; --i) {
5258 if (map->p[i] != bmap)
5260 map = isl_map_cow(map);
5263 isl_basic_map_free(map->p[i]);
5264 if (i != map->n-1) {
5265 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5266 map->p[i] = map->p[map->n-1];
5277 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5278 struct isl_basic_set *bset)
5280 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5281 (struct isl_basic_map *)bset);
5284 /* Given two basic sets bset1 and bset2, compute the maximal difference
5285 * between the values of dimension pos in bset1 and those in bset2
5286 * for any common value of the parameters and dimensions preceding pos.
5288 static enum isl_lp_result basic_set_maximal_difference_at(
5289 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5290 int pos, isl_int *opt)
5292 struct isl_dim *dims;
5293 struct isl_basic_map *bmap1 = NULL;
5294 struct isl_basic_map *bmap2 = NULL;
5295 struct isl_ctx *ctx;
5296 struct isl_vec *obj;
5299 unsigned dim1, dim2;
5300 enum isl_lp_result res;
5302 if (!bset1 || !bset2)
5303 return isl_lp_error;
5305 nparam = isl_basic_set_n_param(bset1);
5306 dim1 = isl_basic_set_n_dim(bset1);
5307 dim2 = isl_basic_set_n_dim(bset2);
5308 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5309 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5310 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5311 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5312 if (!bmap1 || !bmap2)
5314 bmap1 = isl_basic_map_cow(bmap1);
5315 bmap1 = isl_basic_map_extend(bmap1, nparam,
5316 pos, (dim1 - pos) + (dim2 - pos),
5317 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5318 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5321 total = isl_basic_map_total_dim(bmap1);
5323 obj = isl_vec_alloc(ctx, 1 + total);
5324 isl_seq_clr(obj->block.data, 1 + total);
5325 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5326 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5329 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5331 isl_basic_map_free(bmap1);
5335 isl_basic_map_free(bmap1);
5336 isl_basic_map_free(bmap2);
5337 return isl_lp_error;
5340 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5341 * for any common value of the parameters and dimensions preceding pos
5342 * in both basic sets, the values of dimension pos in bset1 are
5343 * smaller or larger than those in bset2.
5346 * 1 if bset1 follows bset2
5347 * -1 if bset1 precedes bset2
5348 * 0 if bset1 and bset2 are incomparable
5349 * -2 if some error occurred.
5351 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5352 struct isl_basic_set *bset2, int pos)
5355 enum isl_lp_result res;
5360 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5362 if (res == isl_lp_empty)
5364 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5365 res == isl_lp_unbounded)
5367 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5376 /* Given two basic sets bset1 and bset2, check whether
5377 * for any common value of the parameters and dimensions preceding pos
5378 * there is a value of dimension pos in bset1 that is larger
5379 * than a value of the same dimension in bset2.
5382 * 1 if there exists such a pair
5383 * 0 if there is no such pair, but there is a pair of equal values
5385 * -2 if some error occurred.
5387 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5388 __isl_keep isl_basic_set *bset2, int pos)
5391 enum isl_lp_result res;
5396 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5398 if (res == isl_lp_empty)
5400 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5401 res == isl_lp_unbounded)
5403 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5405 else if (res == isl_lp_ok)
5414 /* Given two sets set1 and set2, check whether
5415 * for any common value of the parameters and dimensions preceding pos
5416 * there is a value of dimension pos in set1 that is larger
5417 * than a value of the same dimension in set2.
5420 * 1 if there exists such a pair
5421 * 0 if there is no such pair, but there is a pair of equal values
5423 * -2 if some error occurred.
5425 int isl_set_follows_at(__isl_keep isl_set *set1,
5426 __isl_keep isl_set *set2, int pos)
5434 for (i = 0; i < set1->n; ++i)
5435 for (j = 0; j < set2->n; ++j) {
5437 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5438 if (f == 1 || f == -2)
5447 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5448 unsigned pos, isl_int *val)
5456 total = isl_basic_map_total_dim(bmap);
5457 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5458 for (; d+1 > pos; --d)
5459 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5463 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5465 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5467 if (!isl_int_is_one(bmap->eq[i][1+d]))
5470 isl_int_neg(*val, bmap->eq[i][0]);
5476 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5477 unsigned pos, isl_int *val)
5489 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5492 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5493 for (i = 1; fixed == 1 && i < map->n; ++i) {
5494 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5495 if (fixed == 1 && isl_int_ne(tmp, v))
5499 isl_int_set(*val, v);
5505 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5506 unsigned pos, isl_int *val)
5508 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5512 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5515 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5518 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5519 enum isl_dim_type type, unsigned pos, isl_int *val)
5521 if (pos >= isl_basic_map_dim(bmap, type))
5523 return isl_basic_map_fast_has_fixed_var(bmap,
5524 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5527 int isl_map_fast_is_fixed(struct isl_map *map,
5528 enum isl_dim_type type, unsigned pos, isl_int *val)
5530 if (pos >= isl_map_dim(map, type))
5532 return isl_map_fast_has_fixed_var(map,
5533 map_offset(map, type) - 1 + pos, val);
5536 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5537 * then return this fixed value in *val.
5539 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5542 return isl_basic_set_fast_has_fixed_var(bset,
5543 isl_basic_set_n_param(bset) + dim, val);
5546 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5547 * then return this fixed value in *val.
5549 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5551 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5554 /* Check if input variable in has fixed value and if so and if val is not NULL,
5555 * then return this fixed value in *val.
5557 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5559 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5562 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5563 * and if val is not NULL, then return this lower bound in *val.
5565 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5566 unsigned dim, isl_int *val)
5568 int i, i_eq = -1, i_ineq = -1;
5575 total = isl_basic_set_total_dim(bset);
5576 nparam = isl_basic_set_n_param(bset);
5577 for (i = 0; i < bset->n_eq; ++i) {
5578 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5584 for (i = 0; i < bset->n_ineq; ++i) {
5585 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5587 if (i_eq != -1 || i_ineq != -1)
5591 if (i_eq == -1 && i_ineq == -1)
5593 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5594 /* The coefficient should always be one due to normalization. */
5595 if (!isl_int_is_one(c[1+nparam+dim]))
5597 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5599 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5600 total - nparam - dim - 1) != -1)
5603 isl_int_neg(*val, c[0]);
5607 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5608 unsigned dim, isl_int *val)
5620 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5624 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5626 for (i = 1; fixed == 1 && i < set->n; ++i) {
5627 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5629 if (fixed == 1 && isl_int_ne(tmp, v))
5633 isl_int_set(*val, v);
5644 static int qsort_constraint_cmp(const void *p1, const void *p2)
5646 const struct constraint *c1 = (const struct constraint *)p1;
5647 const struct constraint *c2 = (const struct constraint *)p2;
5648 unsigned size = isl_min(c1->size, c2->size);
5649 return isl_seq_cmp(c1->c, c2->c, size);
5652 static struct isl_basic_map *isl_basic_map_sort_constraints(
5653 struct isl_basic_map *bmap)
5656 struct constraint *c;
5661 total = isl_basic_map_total_dim(bmap);
5662 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5665 for (i = 0; i < bmap->n_ineq; ++i) {
5667 c[i].c = bmap->ineq[i];
5669 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5670 for (i = 0; i < bmap->n_ineq; ++i)
5671 bmap->ineq[i] = c[i].c;
5675 isl_basic_map_free(bmap);
5679 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5683 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5685 bmap = isl_basic_map_convex_hull(bmap);
5686 bmap = isl_basic_map_sort_constraints(bmap);
5687 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5691 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5693 return (struct isl_basic_set *)isl_basic_map_normalize(
5694 (struct isl_basic_map *)bset);
5697 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5698 const struct isl_basic_map *bmap2)
5705 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5706 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5707 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5708 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5709 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5710 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5711 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5712 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5714 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5716 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5718 if (bmap1->n_eq != bmap2->n_eq)
5719 return bmap1->n_eq - bmap2->n_eq;
5720 if (bmap1->n_ineq != bmap2->n_ineq)
5721 return bmap1->n_ineq - bmap2->n_ineq;
5722 if (bmap1->n_div != bmap2->n_div)
5723 return bmap1->n_div - bmap2->n_div;
5724 total = isl_basic_map_total_dim(bmap1);
5725 for (i = 0; i < bmap1->n_eq; ++i) {
5726 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5730 for (i = 0; i < bmap1->n_ineq; ++i) {
5731 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5735 for (i = 0; i < bmap1->n_div; ++i) {
5736 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5743 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5744 struct isl_basic_map *bmap2)
5746 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5749 static int qsort_bmap_cmp(const void *p1, const void *p2)
5751 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5752 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5754 return isl_basic_map_fast_cmp(bmap1, bmap2);
5757 /* We normalize in place, but if anything goes wrong we need
5758 * to return NULL, so we need to make sure we don't change the
5759 * meaning of any possible other copies of map.
5761 struct isl_map *isl_map_normalize(struct isl_map *map)
5764 struct isl_basic_map *bmap;
5768 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5770 for (i = 0; i < map->n; ++i) {
5771 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5774 isl_basic_map_free(map->p[i]);
5777 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5778 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5779 map = isl_map_remove_empty_parts(map);
5782 for (i = map->n - 1; i >= 1; --i) {
5783 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5785 isl_basic_map_free(map->p[i-1]);
5786 for (j = i; j < map->n; ++j)
5787 map->p[j-1] = map->p[j];
5797 struct isl_set *isl_set_normalize(struct isl_set *set)
5799 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5802 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5812 if (!isl_dim_equal(map1->dim, map2->dim))
5815 map1 = isl_map_copy(map1);
5816 map2 = isl_map_copy(map2);
5817 map1 = isl_map_normalize(map1);
5818 map2 = isl_map_normalize(map2);
5821 equal = map1->n == map2->n;
5822 for (i = 0; equal && i < map1->n; ++i) {
5823 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5836 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5838 return isl_map_fast_is_equal((struct isl_map *)set1,
5839 (struct isl_map *)set2);
5842 /* Return an interval that ranges from min to max (inclusive)
5844 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5845 isl_int min, isl_int max)
5848 struct isl_basic_set *bset = NULL;
5850 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5854 k = isl_basic_set_alloc_inequality(bset);
5857 isl_int_set_si(bset->ineq[k][1], 1);
5858 isl_int_neg(bset->ineq[k][0], min);
5860 k = isl_basic_set_alloc_inequality(bset);
5863 isl_int_set_si(bset->ineq[k][1], -1);
5864 isl_int_set(bset->ineq[k][0], max);
5868 isl_basic_set_free(bset);
5872 /* Return the Cartesian product of the basic sets in list (in the given order).
5874 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5882 struct isl_basic_set *product = NULL;
5886 isl_assert(list->ctx, list->n > 0, goto error);
5887 isl_assert(list->ctx, list->p[0], goto error);
5888 nparam = isl_basic_set_n_param(list->p[0]);
5889 dim = isl_basic_set_n_dim(list->p[0]);
5890 extra = list->p[0]->n_div;
5891 n_eq = list->p[0]->n_eq;
5892 n_ineq = list->p[0]->n_ineq;
5893 for (i = 1; i < list->n; ++i) {
5894 isl_assert(list->ctx, list->p[i], goto error);
5895 isl_assert(list->ctx,
5896 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5897 dim += isl_basic_set_n_dim(list->p[i]);
5898 extra += list->p[i]->n_div;
5899 n_eq += list->p[i]->n_eq;
5900 n_ineq += list->p[i]->n_ineq;
5902 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5907 for (i = 0; i < list->n; ++i) {
5908 isl_basic_set_add_constraints(product,
5909 isl_basic_set_copy(list->p[i]), dim);
5910 dim += isl_basic_set_n_dim(list->p[i]);
5912 isl_basic_set_list_free(list);
5915 isl_basic_set_free(product);
5916 isl_basic_set_list_free(list);
5920 struct isl_basic_map *isl_basic_map_product(
5921 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5923 struct isl_dim *dim_result = NULL;
5924 struct isl_basic_map *bmap;
5925 unsigned in1, in2, out1, out2, nparam, total, pos;
5926 struct isl_dim_map *dim_map1, *dim_map2;
5928 if (!bmap1 || !bmap2)
5931 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5932 bmap2->dim, isl_dim_param), goto error);
5933 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5934 isl_dim_copy(bmap2->dim));
5936 in1 = isl_basic_map_n_in(bmap1);
5937 in2 = isl_basic_map_n_in(bmap2);
5938 out1 = isl_basic_map_n_out(bmap1);
5939 out2 = isl_basic_map_n_out(bmap2);
5940 nparam = isl_basic_map_n_param(bmap1);
5942 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5943 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5944 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5945 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5946 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5947 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5948 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5949 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5950 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5951 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5952 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5954 bmap = isl_basic_map_alloc_dim(dim_result,
5955 bmap1->n_div + bmap2->n_div,
5956 bmap1->n_eq + bmap2->n_eq,
5957 bmap1->n_ineq + bmap2->n_ineq);
5958 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5959 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5960 bmap = isl_basic_map_simplify(bmap);
5961 return isl_basic_map_finalize(bmap);
5963 isl_basic_map_free(bmap1);
5964 isl_basic_map_free(bmap2);
5968 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5970 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5973 struct isl_map *result;
5979 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5980 map2->dim, isl_dim_param), goto error);
5982 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5983 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5984 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5986 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5987 isl_dim_copy(map2->dim)),
5988 map1->n * map2->n, flags);
5991 for (i = 0; i < map1->n; ++i)
5992 for (j = 0; j < map2->n; ++j) {
5993 struct isl_basic_map *part;
5994 part = isl_basic_map_product(
5995 isl_basic_map_copy(map1->p[i]),
5996 isl_basic_map_copy(map2->p[j]));
5997 if (isl_basic_map_is_empty(part))
5998 isl_basic_map_free(part);
6000 result = isl_map_add_basic_map(result, part);
6013 /* Given two set A and B, construct its Cartesian product A x B.
6015 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6017 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6018 (struct isl_map *)set2);
6021 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6024 uint32_t hash = isl_hash_init();
6029 bset = isl_basic_set_copy(bset);
6030 bset = isl_basic_set_normalize(bset);
6033 total = isl_basic_set_total_dim(bset);
6034 isl_hash_byte(hash, bset->n_eq & 0xFF);
6035 for (i = 0; i < bset->n_eq; ++i) {
6037 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6038 isl_hash_hash(hash, c_hash);
6040 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6041 for (i = 0; i < bset->n_ineq; ++i) {
6043 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6044 isl_hash_hash(hash, c_hash);
6046 isl_hash_byte(hash, bset->n_div & 0xFF);
6047 for (i = 0; i < bset->n_div; ++i) {
6049 if (isl_int_is_zero(bset->div[i][0]))
6051 isl_hash_byte(hash, i & 0xFF);
6052 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6053 isl_hash_hash(hash, c_hash);
6055 isl_basic_set_free(bset);
6059 uint32_t isl_set_get_hash(struct isl_set *set)
6066 set = isl_set_copy(set);
6067 set = isl_set_normalize(set);
6071 hash = isl_hash_init();
6072 for (i = 0; i < set->n; ++i) {
6074 bset_hash = isl_basic_set_get_hash(set->p[i]);
6075 isl_hash_hash(hash, bset_hash);
6083 /* Check if the value for dimension dim is completely determined
6084 * by the values of the other parameters and variables.
6085 * That is, check if dimension dim is involved in an equality.
6087 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6094 nparam = isl_basic_set_n_param(bset);
6095 for (i = 0; i < bset->n_eq; ++i)
6096 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6101 /* Check if the value for dimension dim is completely determined
6102 * by the values of the other parameters and variables.
6103 * That is, check if dimension dim is involved in an equality
6104 * for each of the subsets.
6106 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6112 for (i = 0; i < set->n; ++i) {
6114 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6121 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6122 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6129 for (i = 0; i < map->n; ++i)
6130 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6136 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6137 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6144 for (i = 0; i < set->n; ++i)
6145 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6151 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6153 struct isl_dim *dim;
6158 if (bset->n_div == 0)
6161 bset = isl_basic_set_cow(bset);
6165 dim = isl_basic_set_get_dim(bset);
6166 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6169 isl_dim_free(bset->dim);
6175 isl_basic_set_free(bset);
6179 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6182 struct isl_dim *dim;
6185 set = isl_set_align_divs(set);
6189 if (set->n == 0 || set->p[0]->n_div == 0)
6192 set = isl_set_cow(set);
6196 n_div = set->p[0]->n_div;
6197 dim = isl_set_get_dim(set);
6198 dim = isl_dim_add(dim, isl_dim_set, n_div);
6201 isl_dim_free(set->dim);
6204 for (i = 0; i < set->n; ++i) {
6205 set->p[i] = isl_basic_set_lift(set->p[i]);
6216 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6218 struct isl_dim *dim;
6219 struct isl_basic_map *bmap;
6226 set = isl_set_align_divs(set);
6231 dim = isl_set_get_dim(set);
6232 if (set->n == 0 || set->p[0]->n_div == 0) {
6234 return isl_map_identity(dim);
6237 n_div = set->p[0]->n_div;
6238 dim = isl_dim_map(dim);
6239 n_param = isl_dim_size(dim, isl_dim_param);
6240 n_set = isl_dim_size(dim, isl_dim_in);
6241 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6242 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6243 for (i = 0; i < n_set; ++i)
6244 bmap = var_equal(bmap, i);
6246 total = n_param + n_set + n_set + n_div;
6247 for (i = 0; i < n_div; ++i) {
6248 k = isl_basic_map_alloc_inequality(bmap);
6251 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6252 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6253 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6254 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6255 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6256 set->p[0]->div[i][0]);
6258 l = isl_basic_map_alloc_inequality(bmap);
6261 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6262 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6263 set->p[0]->div[i][0]);
6264 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6268 return isl_map_from_basic_map(bmap);
6271 isl_basic_map_free(bmap);
6275 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6283 dim = isl_basic_set_total_dim(bset);
6284 size += bset->n_eq * (1 + dim);
6285 size += bset->n_ineq * (1 + dim);
6286 size += bset->n_div * (2 + dim);
6291 int isl_set_size(__isl_keep isl_set *set)
6299 for (i = 0; i < set->n; ++i)
6300 size += isl_basic_set_size(set->p[i]);