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_add(__isl_take isl_basic_map *bmap,
1994 enum isl_dim_type type, unsigned n)
1996 struct isl_dim *res_dim;
1997 struct isl_basic_map *res;
1998 struct isl_dim_map *dim_map;
1999 unsigned total, pos;
2007 res_dim = isl_dim_add(isl_basic_map_get_dim(bmap), type, n);
2009 total = isl_basic_map_total_dim(bmap) + n;
2010 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2012 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos);
2013 pos += isl_dim_size(res_dim, isl_dim_param);
2014 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos);
2015 pos += isl_dim_size(res_dim, isl_dim_in);
2016 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos);
2017 pos += isl_dim_size(res_dim, isl_dim_out);
2018 isl_dim_map_div(dim_map, bmap, pos);
2020 res = isl_basic_map_alloc_dim(res_dim,
2021 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2022 res = add_constraints_dim_map(res, bmap, dim_map);
2023 res = isl_basic_map_simplify(res);
2024 return isl_basic_map_finalize(res);
2027 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2028 enum isl_dim_type type, unsigned n)
2032 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2033 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2035 isl_basic_set_free(bset);
2039 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2040 enum isl_dim_type type, unsigned n)
2047 map = isl_map_cow(map);
2051 map->dim = isl_dim_add(map->dim, type, n);
2055 for (i = 0; i < map->n; ++i) {
2056 map->p[i] = isl_basic_map_add(map->p[i], type, n);
2067 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2068 enum isl_dim_type type, unsigned n)
2072 isl_assert(set->ctx, type != isl_dim_in, goto error);
2073 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2079 __isl_give isl_basic_map *isl_basic_map_move(__isl_take isl_basic_map *bmap,
2080 enum isl_dim_type dst_type, unsigned dst_pos,
2081 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2090 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2093 /* just the simple case for now */
2094 isl_assert(bmap->ctx,
2095 pos(bmap->dim, dst_type) + dst_pos ==
2096 pos(bmap->dim, src_type) + src_pos + ((src_type < dst_type) ? n : 0),
2099 if (dst_type == src_type)
2102 bmap = isl_basic_map_cow(bmap);
2106 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos, src_type, src_pos, n);
2112 isl_basic_map_free(bmap);
2116 __isl_give isl_set *isl_set_move(__isl_take isl_set *set,
2117 enum isl_dim_type dst_type, unsigned dst_pos,
2118 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2122 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2123 return (isl_set *)isl_map_move((isl_map *)set, dst_type, dst_pos,
2124 src_type, src_pos, n);
2130 __isl_give isl_map *isl_map_move(__isl_take isl_map *map,
2131 enum isl_dim_type dst_type, unsigned dst_pos,
2132 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2141 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2144 /* just the simple case for now */
2145 isl_assert(map->ctx,
2146 map_offset(map, dst_type) + dst_pos ==
2147 map_offset(map, src_type) + src_pos + ((src_type < dst_type) ? n : 0),
2150 if (dst_type == src_type)
2153 map = isl_map_cow(map);
2157 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2161 for (i = 0; i < map->n; ++i) {
2162 map->p[i] = isl_basic_map_move(map->p[i], dst_type, dst_pos,
2163 src_type, src_pos, n);
2174 /* Move the specified dimensions to the last columns right before
2175 * the divs. Don't change the dimension specification of bmap.
2176 * That's the responsibility of the caller.
2178 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2179 enum isl_dim_type type, unsigned first, unsigned n)
2181 struct isl_dim_map *dim_map;
2182 struct isl_basic_map *res;
2183 enum isl_dim_type t;
2184 unsigned total, off;
2188 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2191 total = isl_basic_map_total_dim(bmap);
2192 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2195 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2196 unsigned size = isl_dim_size(bmap->dim, t);
2198 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2201 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2202 first, n, total - bmap->n_div - n);
2203 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2204 first + n, size - (first + n), off);
2205 off += size - (first + n);
2207 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2211 isl_dim_map_div(dim_map, bmap, off + n);
2213 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2214 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2215 res = add_constraints_dim_map(res, bmap, dim_map);
2219 /* Turn the n dimensions of type type, starting at first
2220 * into existentially quantified variables.
2222 __isl_give isl_basic_map *isl_basic_map_project_out(
2223 __isl_take isl_basic_map *bmap,
2224 enum isl_dim_type type, unsigned first, unsigned n)
2237 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2238 return isl_basic_map_remove(bmap, type, first, n);
2240 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2243 bmap = move_last(bmap, type, first, n);
2244 bmap = isl_basic_map_cow(bmap);
2246 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2247 old = bmap->block2.data;
2248 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2249 (bmap->extra + n) * (1 + row_size));
2250 if (!bmap->block2.data)
2252 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2255 for (i = 0; i < n; ++i) {
2256 new_div[i] = bmap->block2.data +
2257 (bmap->extra + i) * (1 + row_size);
2258 isl_seq_clr(new_div[i], 1 + row_size);
2260 for (i = 0; i < bmap->extra; ++i)
2261 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2263 bmap->div = new_div;
2267 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2270 bmap = isl_basic_map_simplify(bmap);
2271 bmap = isl_basic_map_drop_redundant_divs(bmap);
2272 return isl_basic_map_finalize(bmap);
2274 isl_basic_map_free(bmap);
2278 /* Turn the n dimensions of type type, starting at first
2279 * into existentially quantified variables.
2281 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2282 enum isl_dim_type type, unsigned first, unsigned n)
2284 return (isl_basic_set *)isl_basic_map_project_out(
2285 (isl_basic_map *)bset, type, first, n);
2288 /* Turn the n dimensions of type type, starting at first
2289 * into existentially quantified variables.
2291 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2292 enum isl_dim_type type, unsigned first, unsigned n)
2302 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2304 map = isl_map_cow(map);
2308 map->dim = isl_dim_drop(map->dim, type, first, n);
2312 for (i = 0; i < map->n; ++i) {
2313 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2324 /* Turn the n dimensions of type type, starting at first
2325 * into existentially quantified variables.
2327 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2328 enum isl_dim_type type, unsigned first, unsigned n)
2330 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2333 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2337 for (i = 0; i < n; ++i) {
2338 j = isl_basic_map_alloc_div(bmap);
2341 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2345 isl_basic_map_free(bmap);
2349 struct isl_basic_map *isl_basic_map_apply_range(
2350 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2352 struct isl_dim *dim_result = NULL;
2353 struct isl_basic_map *bmap;
2354 unsigned n_in, n_out, n, nparam, total, pos;
2355 struct isl_dim_map *dim_map1, *dim_map2;
2357 if (!bmap1 || !bmap2)
2360 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2361 isl_dim_copy(bmap2->dim));
2363 n_in = isl_basic_map_n_in(bmap1);
2364 n_out = isl_basic_map_n_out(bmap2);
2365 n = isl_basic_map_n_out(bmap1);
2366 nparam = isl_basic_map_n_param(bmap1);
2368 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2369 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2370 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2371 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2372 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2373 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2374 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2375 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2376 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2377 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2378 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2380 bmap = isl_basic_map_alloc_dim(dim_result,
2381 bmap1->n_div + bmap2->n_div + n,
2382 bmap1->n_eq + bmap2->n_eq,
2383 bmap1->n_ineq + bmap2->n_ineq);
2384 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2385 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2386 bmap = add_divs(bmap, n);
2387 bmap = isl_basic_map_simplify(bmap);
2388 bmap = isl_basic_map_drop_redundant_divs(bmap);
2389 return isl_basic_map_finalize(bmap);
2391 isl_basic_map_free(bmap1);
2392 isl_basic_map_free(bmap2);
2396 struct isl_basic_set *isl_basic_set_apply(
2397 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2402 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2405 return (struct isl_basic_set *)
2406 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2408 isl_basic_set_free(bset);
2409 isl_basic_map_free(bmap);
2413 struct isl_basic_map *isl_basic_map_apply_domain(
2414 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2416 if (!bmap1 || !bmap2)
2419 isl_assert(bmap1->ctx,
2420 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2421 isl_assert(bmap1->ctx,
2422 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2425 bmap1 = isl_basic_map_reverse(bmap1);
2426 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2427 return isl_basic_map_reverse(bmap1);
2429 isl_basic_map_free(bmap1);
2430 isl_basic_map_free(bmap2);
2434 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2435 * A \cap B -> f(A) + f(B)
2437 struct isl_basic_map *isl_basic_map_sum(
2438 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2440 unsigned n_in, n_out, nparam, total, pos;
2441 struct isl_basic_map *bmap = NULL;
2442 struct isl_dim_map *dim_map1, *dim_map2;
2445 if (!bmap1 || !bmap2)
2448 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2451 nparam = isl_basic_map_n_param(bmap1);
2452 n_in = isl_basic_map_n_in(bmap1);
2453 n_out = isl_basic_map_n_out(bmap1);
2455 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2456 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2457 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2458 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2459 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2460 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2461 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2462 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2463 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2464 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2465 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2467 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2468 bmap1->n_div + bmap2->n_div + 2 * n_out,
2469 bmap1->n_eq + bmap2->n_eq + n_out,
2470 bmap1->n_ineq + bmap2->n_ineq);
2471 for (i = 0; i < n_out; ++i) {
2472 int j = isl_basic_map_alloc_equality(bmap);
2475 isl_seq_clr(bmap->eq[j], 1+total);
2476 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2477 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2478 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2480 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2481 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2482 bmap = add_divs(bmap, 2 * n_out);
2484 bmap = isl_basic_map_simplify(bmap);
2485 return isl_basic_map_finalize(bmap);
2487 isl_basic_map_free(bmap);
2488 isl_basic_map_free(bmap1);
2489 isl_basic_map_free(bmap2);
2493 /* Given two maps A -> f(A) and B -> g(B), construct a map
2494 * A \cap B -> f(A) + f(B)
2496 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2498 struct isl_map *result;
2504 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2506 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2507 map1->n * map2->n, 0);
2510 for (i = 0; i < map1->n; ++i)
2511 for (j = 0; j < map2->n; ++j) {
2512 struct isl_basic_map *part;
2513 part = isl_basic_map_sum(
2514 isl_basic_map_copy(map1->p[i]),
2515 isl_basic_map_copy(map2->p[j]));
2516 if (isl_basic_map_is_empty(part))
2517 isl_basic_map_free(part);
2519 result = isl_map_add_basic_map(result, part);
2532 /* Given a basic map A -> f(A), construct A -> -f(A).
2534 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2539 bmap = isl_basic_map_cow(bmap);
2543 n = isl_basic_map_dim(bmap, isl_dim_out);
2544 off = isl_basic_map_offset(bmap, isl_dim_out);
2545 for (i = 0; i < bmap->n_eq; ++i)
2546 for (j = 0; j < n; ++j)
2547 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2548 for (i = 0; i < bmap->n_ineq; ++i)
2549 for (j = 0; j < n; ++j)
2550 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2551 for (i = 0; i < bmap->n_div; ++i)
2552 for (j = 0; j < n; ++j)
2553 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2554 return isl_basic_map_finalize(bmap);
2557 /* Given a map A -> f(A), construct A -> -f(A).
2559 struct isl_map *isl_map_neg(struct isl_map *map)
2563 map = isl_map_cow(map);
2567 for (i = 0; i < map->n; ++i) {
2568 map->p[i] = isl_basic_map_neg(map->p[i]);
2579 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2580 * A -> floor(f(A)/d).
2582 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2585 unsigned n_in, n_out, nparam, total, pos;
2586 struct isl_basic_map *result = NULL;
2587 struct isl_dim_map *dim_map;
2593 nparam = isl_basic_map_n_param(bmap);
2594 n_in = isl_basic_map_n_in(bmap);
2595 n_out = isl_basic_map_n_out(bmap);
2597 total = nparam + n_in + n_out + bmap->n_div + n_out;
2598 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2599 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2600 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2601 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2602 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2604 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2605 bmap->n_div + n_out,
2606 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2607 result = add_constraints_dim_map(result, bmap, dim_map);
2608 result = add_divs(result, n_out);
2609 for (i = 0; i < n_out; ++i) {
2611 j = isl_basic_map_alloc_inequality(result);
2614 isl_seq_clr(result->ineq[j], 1+total);
2615 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2616 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2617 j = isl_basic_map_alloc_inequality(result);
2620 isl_seq_clr(result->ineq[j], 1+total);
2621 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2622 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2623 isl_int_sub_ui(result->ineq[j][0], d, 1);
2626 result = isl_basic_map_simplify(result);
2627 return isl_basic_map_finalize(result);
2629 isl_basic_map_free(result);
2633 /* Given a map A -> f(A) and an integer d, construct a map
2634 * A -> floor(f(A)/d).
2636 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2640 map = isl_map_cow(map);
2644 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2645 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2646 for (i = 0; i < map->n; ++i) {
2647 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2658 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2664 i = isl_basic_map_alloc_equality(bmap);
2667 nparam = isl_basic_map_n_param(bmap);
2668 n_in = isl_basic_map_n_in(bmap);
2669 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2670 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2671 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2672 return isl_basic_map_finalize(bmap);
2674 isl_basic_map_free(bmap);
2678 /* Add a constraints to "bmap" expressing i_pos < o_pos
2680 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2686 i = isl_basic_map_alloc_inequality(bmap);
2689 nparam = isl_basic_map_n_param(bmap);
2690 n_in = isl_basic_map_n_in(bmap);
2691 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2692 isl_int_set_si(bmap->ineq[i][0], -1);
2693 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2694 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2695 return isl_basic_map_finalize(bmap);
2697 isl_basic_map_free(bmap);
2701 /* Add a constraints to "bmap" expressing i_pos > o_pos
2703 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2709 i = isl_basic_map_alloc_inequality(bmap);
2712 nparam = isl_basic_map_n_param(bmap);
2713 n_in = isl_basic_map_n_in(bmap);
2714 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2715 isl_int_set_si(bmap->ineq[i][0], -1);
2716 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2717 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2718 return isl_basic_map_finalize(bmap);
2720 isl_basic_map_free(bmap);
2724 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2727 struct isl_basic_map *bmap;
2728 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2731 for (i = 0; i < n_equal && bmap; ++i)
2732 bmap = var_equal(bmap, i);
2733 return isl_basic_map_finalize(bmap);
2736 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2738 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2741 struct isl_basic_map *bmap;
2742 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2745 for (i = 0; i < pos && bmap; ++i)
2746 bmap = var_equal(bmap, i);
2748 bmap = var_less(bmap, pos);
2749 return isl_basic_map_finalize(bmap);
2752 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2754 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2757 struct isl_basic_map *bmap;
2758 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2761 for (i = 0; i < pos && bmap; ++i)
2762 bmap = var_equal(bmap, i);
2764 bmap = var_more(bmap, pos);
2765 return isl_basic_map_finalize(bmap);
2768 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2770 struct isl_map *map;
2777 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2779 for (i = 0; i < dim; ++i)
2780 map = isl_map_add_basic_map(map,
2781 isl_basic_map_less_at(isl_dim_copy(dims), i));
2783 map = isl_map_add_basic_map(map,
2784 isl_basic_map_equal(isl_dim_copy(dims), dim));
2790 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2792 return map_lex_lte(isl_dim_map(set_dim), 0);
2795 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2797 return map_lex_lte(isl_dim_map(set_dim), 1);
2800 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2802 struct isl_map *map;
2809 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2811 for (i = 0; i < dim; ++i)
2812 map = isl_map_add_basic_map(map,
2813 isl_basic_map_more_at(isl_dim_copy(dims), i));
2815 map = isl_map_add_basic_map(map,
2816 isl_basic_map_equal(isl_dim_copy(dims), dim));
2822 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2824 return map_lex_gte(isl_dim_map(set_dim), 0);
2827 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2829 return map_lex_gte(isl_dim_map(set_dim), 1);
2832 struct isl_basic_map *isl_basic_map_from_basic_set(
2833 struct isl_basic_set *bset, struct isl_dim *dim)
2835 struct isl_basic_map *bmap;
2837 bset = isl_basic_set_cow(bset);
2841 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2842 isl_dim_free(bset->dim);
2843 bmap = (struct isl_basic_map *) bset;
2845 return isl_basic_map_finalize(bmap);
2847 isl_basic_set_free(bset);
2852 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2856 if (bmap->dim->n_in == 0)
2857 return (struct isl_basic_set *)bmap;
2858 bmap = isl_basic_map_cow(bmap);
2861 bmap->dim = isl_dim_cow(bmap->dim);
2864 bmap->dim->n_out += bmap->dim->n_in;
2865 bmap->dim->n_in = 0;
2866 bmap = isl_basic_map_finalize(bmap);
2867 return (struct isl_basic_set *)bmap;
2869 isl_basic_map_free(bmap);
2873 /* For a div d = floor(f/m), add the constraints
2876 * -(f-(n-1)) + m d >= 0
2878 * Note that the second constraint is the negation of
2882 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2885 unsigned total = isl_basic_map_total_dim(bmap);
2886 unsigned div_pos = 1 + total - bmap->n_div + div;
2888 i = isl_basic_map_alloc_inequality(bmap);
2891 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2892 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2894 j = isl_basic_map_alloc_inequality(bmap);
2897 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2898 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2899 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2903 struct isl_basic_set *isl_basic_map_underlying_set(
2904 struct isl_basic_map *bmap)
2908 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2909 return (struct isl_basic_set *)bmap;
2910 bmap = isl_basic_map_cow(bmap);
2913 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2916 bmap->extra -= bmap->n_div;
2918 bmap = isl_basic_map_finalize(bmap);
2919 return (struct isl_basic_set *)bmap;
2924 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2925 __isl_take isl_basic_set *bset)
2927 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2930 struct isl_basic_map *isl_basic_map_overlying_set(
2931 struct isl_basic_set *bset, struct isl_basic_map *like)
2933 struct isl_basic_map *bmap;
2934 struct isl_ctx *ctx;
2941 isl_assert(ctx, bset->n_div == 0, goto error);
2942 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2943 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2945 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2946 isl_basic_map_free(like);
2947 return (struct isl_basic_map *)bset;
2949 bset = isl_basic_set_cow(bset);
2952 total = bset->dim->n_out + bset->extra;
2953 bmap = (struct isl_basic_map *)bset;
2954 isl_dim_free(bmap->dim);
2955 bmap->dim = isl_dim_copy(like->dim);
2958 bmap->n_div = like->n_div;
2959 bmap->extra += like->n_div;
2962 ltotal = total - bmap->extra + like->extra;
2965 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2966 bmap->extra * (1 + 1 + total));
2967 if (isl_blk_is_error(bmap->block2))
2969 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2973 for (i = 0; i < bmap->extra; ++i)
2974 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2975 for (i = 0; i < like->n_div; ++i) {
2976 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2977 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2979 bmap = isl_basic_map_extend_constraints(bmap,
2980 0, 2 * like->n_div);
2981 for (i = 0; i < like->n_div; ++i) {
2982 if (isl_int_is_zero(bmap->div[i][0]))
2984 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
2988 isl_basic_map_free(like);
2989 bmap = isl_basic_map_simplify(bmap);
2990 bmap = isl_basic_map_finalize(bmap);
2993 isl_basic_map_free(like);
2994 isl_basic_set_free(bset);
2998 struct isl_basic_set *isl_basic_set_from_underlying_set(
2999 struct isl_basic_set *bset, struct isl_basic_set *like)
3001 return (struct isl_basic_set *)
3002 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3005 struct isl_set *isl_set_from_underlying_set(
3006 struct isl_set *set, struct isl_basic_set *like)
3012 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3014 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3015 isl_basic_set_free(like);
3018 set = isl_set_cow(set);
3021 for (i = 0; i < set->n; ++i) {
3022 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3023 isl_basic_set_copy(like));
3027 isl_dim_free(set->dim);
3028 set->dim = isl_dim_copy(like->dim);
3031 isl_basic_set_free(like);
3034 isl_basic_set_free(like);
3039 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3043 map = isl_map_cow(map);
3046 map->dim = isl_dim_cow(map->dim);
3050 for (i = 1; i < map->n; ++i)
3051 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3053 for (i = 0; i < map->n; ++i) {
3054 map->p[i] = (struct isl_basic_map *)
3055 isl_basic_map_underlying_set(map->p[i]);
3060 map->dim = isl_dim_underlying(map->dim, 0);
3062 isl_dim_free(map->dim);
3063 map->dim = isl_dim_copy(map->p[0]->dim);
3067 return (struct isl_set *)map;
3073 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3075 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3078 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3080 struct isl_basic_set *domain;
3085 n_in = isl_basic_map_n_in(bmap);
3086 n_out = isl_basic_map_n_out(bmap);
3087 domain = isl_basic_set_from_basic_map(bmap);
3088 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3091 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3093 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3096 struct isl_set *isl_map_range(struct isl_map *map)
3099 struct isl_set *set;
3103 if (isl_map_dim(map, isl_dim_in) == 0)
3104 return (isl_set *)map;
3106 map = isl_map_cow(map);
3110 set = (struct isl_set *) map;
3111 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3114 for (i = 0; i < map->n; ++i) {
3115 set->p[i] = isl_basic_map_range(map->p[i]);
3119 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3120 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3127 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3130 struct isl_map *map = NULL;
3132 set = isl_set_cow(set);
3135 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3136 map = (struct isl_map *)set;
3137 for (i = 0; i < set->n; ++i) {
3138 map->p[i] = isl_basic_map_from_basic_set(
3139 set->p[i], isl_dim_copy(dim));
3143 isl_dim_free(map->dim);
3152 struct isl_map *isl_map_from_range(struct isl_set *set)
3154 return (struct isl_map *)set;
3157 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3159 return isl_map_reverse(isl_map_from_range(set));;
3162 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3163 __isl_take isl_set *range)
3165 return isl_map_product(isl_map_from_domain(domain),
3166 isl_map_from_range(range));
3169 struct isl_set *isl_set_from_map(struct isl_map *map)
3172 struct isl_set *set = NULL;
3176 map = isl_map_cow(map);
3179 map->dim = isl_dim_cow(map->dim);
3182 map->dim->n_out += map->dim->n_in;
3184 set = (struct isl_set *)map;
3185 for (i = 0; i < map->n; ++i) {
3186 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3196 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3198 struct isl_map *map;
3202 isl_assert(dim->ctx, n >= 0, return NULL);
3203 map = isl_alloc(dim->ctx, struct isl_map,
3204 sizeof(struct isl_map) +
3205 (n - 1) * sizeof(struct isl_basic_map *));
3209 map->ctx = dim->ctx;
3210 isl_ctx_ref(map->ctx);
3222 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3223 unsigned nparam, unsigned in, unsigned out, int n,
3226 struct isl_map *map;
3227 struct isl_dim *dims;
3229 dims = isl_dim_alloc(ctx, nparam, in, out);
3233 map = isl_map_alloc_dim(dims, n, flags);
3237 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3239 struct isl_basic_map *bmap;
3240 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3241 bmap = isl_basic_map_set_to_empty(bmap);
3245 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3247 struct isl_basic_set *bset;
3248 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3249 bset = isl_basic_set_set_to_empty(bset);
3253 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3255 struct isl_basic_map *bmap;
3258 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3259 bmap = isl_basic_map_set_to_empty(bmap);
3263 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3265 struct isl_basic_map *bmap;
3268 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3269 bmap = isl_basic_map_set_to_empty(bmap);
3273 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3275 struct isl_basic_set *bset;
3278 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3279 bset = isl_basic_set_set_to_empty(bset);
3283 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3285 struct isl_basic_map *bmap;
3286 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3290 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3292 struct isl_basic_set *bset;
3293 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3297 __isl_give isl_basic_map *isl_basic_map_universe_like(
3298 __isl_keep isl_basic_map *model)
3302 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3305 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3309 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3312 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3313 __isl_keep isl_set *model)
3317 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3320 struct isl_map *isl_map_empty(struct isl_dim *dim)
3322 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3325 struct isl_map *isl_map_empty_like(struct isl_map *model)
3329 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3332 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3336 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3339 struct isl_set *isl_set_empty(struct isl_dim *dim)
3341 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3344 struct isl_set *isl_set_empty_like(struct isl_set *model)
3348 return isl_set_empty(isl_dim_copy(model->dim));
3351 struct isl_map *isl_map_universe(struct isl_dim *dim)
3353 struct isl_map *map;
3356 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3357 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3361 struct isl_set *isl_set_universe(struct isl_dim *dim)
3363 struct isl_set *set;
3366 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3367 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3371 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3375 return isl_set_universe(isl_dim_copy(model->dim));
3378 struct isl_map *isl_map_dup(struct isl_map *map)
3381 struct isl_map *dup;
3385 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3386 for (i = 0; i < map->n; ++i)
3387 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3391 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3392 __isl_take isl_basic_map *bmap)
3396 if (isl_basic_map_fast_is_empty(bmap)) {
3397 isl_basic_map_free(bmap);
3400 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3401 isl_assert(map->ctx, map->n < map->size, goto error);
3402 map->p[map->n] = bmap;
3404 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3410 isl_basic_map_free(bmap);
3414 void isl_map_free(struct isl_map *map)
3424 isl_ctx_deref(map->ctx);
3425 for (i = 0; i < map->n; ++i)
3426 isl_basic_map_free(map->p[i]);
3427 isl_dim_free(map->dim);
3431 struct isl_map *isl_map_extend(struct isl_map *base,
3432 unsigned nparam, unsigned n_in, unsigned n_out)
3436 base = isl_map_cow(base);
3440 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3443 for (i = 0; i < base->n; ++i) {
3444 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3445 isl_dim_copy(base->dim), 0, 0, 0);
3455 struct isl_set *isl_set_extend(struct isl_set *base,
3456 unsigned nparam, unsigned dim)
3458 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3462 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3463 struct isl_basic_map *bmap, unsigned pos, int value)
3467 bmap = isl_basic_map_cow(bmap);
3468 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3469 j = isl_basic_map_alloc_equality(bmap);
3472 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3473 isl_int_set_si(bmap->eq[j][pos], -1);
3474 isl_int_set_si(bmap->eq[j][0], value);
3475 bmap = isl_basic_map_simplify(bmap);
3476 return isl_basic_map_finalize(bmap);
3478 isl_basic_map_free(bmap);
3482 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3483 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3487 bmap = isl_basic_map_cow(bmap);
3488 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3489 j = isl_basic_map_alloc_equality(bmap);
3492 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3493 isl_int_set_si(bmap->eq[j][pos], -1);
3494 isl_int_set(bmap->eq[j][0], value);
3495 bmap = isl_basic_map_simplify(bmap);
3496 return isl_basic_map_finalize(bmap);
3498 isl_basic_map_free(bmap);
3502 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3503 enum isl_dim_type type, unsigned pos, int value)
3507 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3508 return isl_basic_map_fix_pos_si(bmap,
3509 isl_basic_map_offset(bmap, type) + pos, value);
3511 isl_basic_map_free(bmap);
3515 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3516 enum isl_dim_type type, unsigned pos, isl_int value)
3520 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3521 return isl_basic_map_fix_pos(bmap,
3522 isl_basic_map_offset(bmap, type) + pos, value);
3524 isl_basic_map_free(bmap);
3528 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3529 enum isl_dim_type type, unsigned pos, int value)
3531 return (struct isl_basic_set *)
3532 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3536 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3537 enum isl_dim_type type, unsigned pos, isl_int value)
3539 return (struct isl_basic_set *)
3540 isl_basic_map_fix((struct isl_basic_map *)bset,
3544 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3545 unsigned input, int value)
3547 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3550 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3551 unsigned dim, int value)
3553 return (struct isl_basic_set *)
3554 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3555 isl_dim_set, dim, value);
3558 struct isl_map *isl_map_fix_si(struct isl_map *map,
3559 enum isl_dim_type type, unsigned pos, int value)
3563 map = isl_map_cow(map);
3567 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3568 for (i = 0; i < map->n; ++i) {
3569 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3573 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3580 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3581 enum isl_dim_type type, unsigned pos, int value)
3583 return (struct isl_set *)
3584 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3587 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3588 enum isl_dim_type type, unsigned pos, isl_int value)
3592 map = isl_map_cow(map);
3596 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3597 for (i = 0; i < map->n; ++i) {
3598 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3602 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3609 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3610 enum isl_dim_type type, unsigned pos, isl_int value)
3612 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3615 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3616 unsigned input, int value)
3618 return isl_map_fix_si(map, isl_dim_in, input, value);
3621 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3623 return (struct isl_set *)
3624 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3627 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3628 __isl_take isl_basic_map *bmap,
3629 enum isl_dim_type type, unsigned pos, int value)
3635 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3636 pos += isl_basic_map_offset(bmap, type);
3637 bmap = isl_basic_map_cow(bmap);
3638 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3639 j = isl_basic_map_alloc_inequality(bmap);
3642 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3643 isl_int_set_si(bmap->ineq[j][pos], 1);
3644 isl_int_set_si(bmap->ineq[j][0], -value);
3645 bmap = isl_basic_map_simplify(bmap);
3646 return isl_basic_map_finalize(bmap);
3648 isl_basic_map_free(bmap);
3652 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3653 unsigned dim, isl_int value)
3657 bset = isl_basic_set_cow(bset);
3658 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3659 j = isl_basic_set_alloc_inequality(bset);
3662 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3663 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3664 isl_int_neg(bset->ineq[j][0], value);
3665 bset = isl_basic_set_simplify(bset);
3666 return isl_basic_set_finalize(bset);
3668 isl_basic_set_free(bset);
3672 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3673 enum isl_dim_type type, unsigned pos, int value)
3677 map = isl_map_cow(map);
3681 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3682 for (i = 0; i < map->n; ++i) {
3683 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3688 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3695 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3696 enum isl_dim_type type, unsigned pos, int value)
3698 return (struct isl_set *)
3699 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3702 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3707 set = isl_set_cow(set);
3711 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3712 for (i = 0; i < set->n; ++i) {
3713 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3723 struct isl_map *isl_map_reverse(struct isl_map *map)
3727 map = isl_map_cow(map);
3731 map->dim = isl_dim_reverse(map->dim);
3734 for (i = 0; i < map->n; ++i) {
3735 map->p[i] = isl_basic_map_reverse(map->p[i]);
3739 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3746 static struct isl_map *isl_basic_map_partial_lexopt(
3747 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3748 struct isl_set **empty, int max)
3752 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3753 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3755 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3757 isl_basic_map_free(bmap);
3758 isl_basic_set_free(dom);
3764 struct isl_map *isl_basic_map_partial_lexmax(
3765 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3766 struct isl_set **empty)
3768 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3771 struct isl_map *isl_basic_map_partial_lexmin(
3772 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3773 struct isl_set **empty)
3775 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3778 struct isl_set *isl_basic_set_partial_lexmin(
3779 struct isl_basic_set *bset, struct isl_basic_set *dom,
3780 struct isl_set **empty)
3782 return (struct isl_set *)
3783 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3787 struct isl_set *isl_basic_set_partial_lexmax(
3788 struct isl_basic_set *bset, struct isl_basic_set *dom,
3789 struct isl_set **empty)
3791 return (struct isl_set *)
3792 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3796 /* Given a basic map "bmap", compute the lexicograhically minimal
3797 * (or maximal) image element for each domain element in dom.
3798 * Set *empty to those elements in dom that do not have an image element.
3800 * We first make sure the basic sets in dom are disjoint and then
3801 * simply collect the results over each of the basic sets separately.
3802 * We could probably improve the efficiency a bit by moving the union
3803 * domain down into the parametric integer programming.
3805 static __isl_give isl_map *basic_map_partial_lexopt(
3806 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3807 __isl_give isl_set **empty, int max)
3810 struct isl_map *res;
3812 dom = isl_set_make_disjoint(dom);
3816 if (isl_set_fast_is_empty(dom)) {
3817 res = isl_map_empty_like_basic_map(bmap);
3818 *empty = isl_set_empty_like(dom);
3820 isl_basic_map_free(bmap);
3824 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3825 isl_basic_set_copy(dom->p[0]), empty, max);
3827 for (i = 1; i < dom->n; ++i) {
3828 struct isl_map *res_i;
3829 struct isl_set *empty_i;
3831 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3832 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3834 res = isl_map_union_disjoint(res, res_i);
3835 *empty = isl_set_union_disjoint(*empty, empty_i);
3839 isl_basic_map_free(bmap);
3844 isl_basic_map_free(bmap);
3848 /* Given a map "map", compute the lexicograhically minimal
3849 * (or maximal) image element for each domain element in dom.
3850 * Set *empty to those elements in dom that do not have an image element.
3852 * We first compute the lexicographically minimal or maximal element
3853 * in the first basic map. This results in a partial solution "res"
3854 * and a subset "todo" of dom that still need to be handled.
3855 * We then consider each of the remaining maps in "map" and successively
3856 * improve both "res" and "todo".
3858 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3859 * Assume we are computing the lexicographical maximum.
3860 * We first intersect basic map i with a relation that maps elements
3861 * to elements that are lexicographically larger than the image elements
3862 * in res^k and the compute the maximum image element of this intersection.
3863 * The result ("better") corresponds to those image elements in basic map i
3864 * that are better than what we had before. The remainder ("keep") are the
3865 * domain elements for which the image element in res_k was better.
3866 * We also compute the lexicographical maximum of basic map i in todo^k.
3867 * res^i is the result of the operation + better + those elements in
3868 * res^k that we should keep
3869 * todo^i is the remainder of the maximum operation on todo^k.
3871 static __isl_give isl_map *isl_map_partial_lexopt(
3872 __isl_take isl_map *map, __isl_take isl_set *dom,
3873 __isl_give isl_set **empty, int max)
3876 struct isl_map *res;
3877 struct isl_set *todo;
3882 if (isl_map_fast_is_empty(map)) {
3890 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3891 isl_set_copy(dom), &todo, max);
3893 for (i = 1; i < map->n; ++i) {
3895 struct isl_map *better;
3896 struct isl_set *keep;
3897 struct isl_map *res_i;
3898 struct isl_set *todo_i;
3899 struct isl_dim *dim = isl_map_get_dim(res);
3901 dim = isl_dim_range(dim);
3903 lt = isl_map_lex_lt(dim);
3905 lt = isl_map_lex_gt(dim);
3906 lt = isl_map_apply_range(isl_map_copy(res), lt);
3907 lt = isl_map_intersect(lt,
3908 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3909 better = isl_map_partial_lexopt(lt,
3910 isl_map_domain(isl_map_copy(res)),
3913 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3914 todo, &todo_i, max);
3916 res = isl_map_intersect_domain(res, keep);
3917 res = isl_map_union_disjoint(res, res_i);
3918 res = isl_map_union_disjoint(res, better);
3939 __isl_give isl_map *isl_map_partial_lexmax(
3940 __isl_take isl_map *map, __isl_take isl_set *dom,
3941 __isl_give isl_set **empty)
3943 return isl_map_partial_lexopt(map, dom, empty, 1);
3946 __isl_give isl_map *isl_map_partial_lexmin(
3947 __isl_take isl_map *map, __isl_take isl_set *dom,
3948 __isl_give isl_set **empty)
3950 return isl_map_partial_lexopt(map, dom, empty, 0);
3953 __isl_give isl_set *isl_set_partial_lexmin(
3954 __isl_take isl_set *set, __isl_take isl_set *dom,
3955 __isl_give isl_set **empty)
3957 return (struct isl_set *)
3958 isl_map_partial_lexmin((struct isl_map *)set,
3962 __isl_give isl_set *isl_set_partial_lexmax(
3963 __isl_take isl_set *set, __isl_take isl_set *dom,
3964 __isl_give isl_set **empty)
3966 return (struct isl_set *)
3967 isl_map_partial_lexmax((struct isl_map *)set,
3971 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3973 struct isl_basic_set *dom = NULL;
3974 struct isl_dim *dom_dim;
3978 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3979 dom = isl_basic_set_universe(dom_dim);
3980 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
3982 isl_basic_map_free(bmap);
3986 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3988 return isl_basic_map_lexopt(bmap, 0);
3991 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
3993 return isl_basic_map_lexopt(bmap, 1);
3996 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3998 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4001 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4003 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4006 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4008 struct isl_set *dom = NULL;
4009 struct isl_dim *dom_dim;
4013 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4014 dom = isl_set_universe(dom_dim);
4015 return isl_map_partial_lexopt(map, dom, NULL, max);
4021 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4023 return isl_map_lexopt(map, 0);
4026 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4028 return isl_map_lexopt(map, 1);
4031 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4033 return (isl_set *)isl_map_lexmin((isl_map *)set);
4036 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4038 return (isl_set *)isl_map_lexmax((isl_map *)set);
4041 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4042 struct isl_dim *dim)
4049 for (i = 0; i < map->n; ++i) {
4050 isl_dim_free(map->p[i]->dim);
4051 map->p[i]->dim = isl_dim_copy(dim);
4053 isl_dim_free(map->dim);
4063 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4064 struct isl_dim *dim)
4066 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4069 /* Apply a preimage specified by "mat" on the parameters of "bset".
4070 * bset is assumed to have only parameters and divs.
4072 static struct isl_basic_set *basic_set_parameter_preimage(
4073 struct isl_basic_set *bset, struct isl_mat *mat)
4080 bset->dim = isl_dim_cow(bset->dim);
4084 nparam = isl_basic_set_dim(bset, isl_dim_param);
4086 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4088 bset->dim->nparam = 0;
4089 bset->dim->n_out = nparam;
4090 bset = isl_basic_set_preimage(bset, mat);
4092 bset->dim->nparam = bset->dim->n_out;
4093 bset->dim->n_out = 0;
4098 isl_basic_set_free(bset);
4102 /* Apply a preimage specified by "mat" on the parameters of "set".
4103 * set is assumed to have only parameters and divs.
4105 static struct isl_set *set_parameter_preimage(
4106 struct isl_set *set, struct isl_mat *mat)
4108 struct isl_dim *dim = NULL;
4114 dim = isl_dim_copy(set->dim);
4115 dim = isl_dim_cow(dim);
4119 nparam = isl_set_dim(set, isl_dim_param);
4121 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4124 dim->n_out = nparam;
4125 isl_set_reset_dim(set, dim);
4126 set = isl_set_preimage(set, mat);
4129 dim = isl_dim_copy(set->dim);
4130 dim = isl_dim_cow(dim);
4133 dim->nparam = dim->n_out;
4135 isl_set_reset_dim(set, dim);
4145 /* Intersect the basic set "bset" with the affine space specified by the
4146 * equalities in "eq".
4148 static struct isl_basic_set *basic_set_append_equalities(
4149 struct isl_basic_set *bset, struct isl_mat *eq)
4157 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4162 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4163 for (i = 0; i < eq->n_row; ++i) {
4164 k = isl_basic_set_alloc_equality(bset);
4167 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4168 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4175 isl_basic_set_free(bset);
4179 /* Intersect the set "set" with the affine space specified by the
4180 * equalities in "eq".
4182 static struct isl_set *set_append_equalities(struct isl_set *set,
4190 for (i = 0; i < set->n; ++i) {
4191 set->p[i] = basic_set_append_equalities(set->p[i],
4204 /* Project the given basic set onto its parameter domain, possibly introducing
4205 * new, explicit, existential variables in the constraints.
4206 * The input has parameters and (possibly implicit) existential variables.
4207 * The output has the same parameters, but only
4208 * explicit existentially quantified variables.
4210 * The actual projection is performed by pip, but pip doesn't seem
4211 * to like equalities very much, so we first remove the equalities
4212 * among the parameters by performing a variable compression on
4213 * the parameters. Afterward, an inverse transformation is performed
4214 * and the equalities among the parameters are inserted back in.
4216 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4220 struct isl_mat *T, *T2;
4221 struct isl_set *set;
4222 unsigned nparam, n_div;
4224 bset = isl_basic_set_cow(bset);
4228 if (bset->n_eq == 0)
4229 return isl_basic_set_lexmin(bset);
4231 isl_basic_set_gauss(bset, NULL);
4233 nparam = isl_basic_set_dim(bset, isl_dim_param);
4234 n_div = isl_basic_set_dim(bset, isl_dim_div);
4236 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4237 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4240 if (i == bset->n_eq)
4241 return isl_basic_set_lexmin(bset);
4243 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4245 eq = isl_mat_cow(eq);
4246 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4247 bset = basic_set_parameter_preimage(bset, T);
4249 set = isl_basic_set_lexmin(bset);
4250 set = set_parameter_preimage(set, T2);
4251 set = set_append_equalities(set, eq);
4255 /* Compute an explicit representation for all the existentially
4256 * quantified variables.
4257 * The input and output dimensions are first turned into parameters.
4258 * compute_divs then returns a map with the same parameters and
4259 * no input or output dimensions and the dimension specification
4260 * is reset to that of the input.
4262 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4264 struct isl_basic_set *bset;
4265 struct isl_set *set;
4266 struct isl_map *map;
4267 struct isl_dim *dim, *orig_dim = NULL;
4272 bmap = isl_basic_map_cow(bmap);
4276 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4277 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4278 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4279 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4283 orig_dim = bmap->dim;
4285 bset = (struct isl_basic_set *)bmap;
4287 set = parameter_compute_divs(bset);
4288 map = (struct isl_map *)set;
4289 map = isl_map_reset_dim(map, orig_dim);
4293 isl_basic_map_free(bmap);
4297 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4305 off = isl_dim_total(bmap->dim);
4306 for (i = 0; i < bmap->n_div; ++i) {
4307 if (isl_int_is_zero(bmap->div[i][0]))
4309 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4315 static int map_divs_known(__isl_keep isl_map *map)
4322 for (i = 0; i < map->n; ++i) {
4323 int known = basic_map_divs_known(map->p[i]);
4331 /* If bmap contains any unknown divs, then compute explicit
4332 * expressions for them. However, this computation may be
4333 * quite expensive, so first try to remove divs that aren't
4336 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4340 struct isl_map *map;
4342 known = basic_map_divs_known(bmap);
4346 return isl_map_from_basic_map(bmap);
4348 bmap = isl_basic_map_drop_redundant_divs(bmap);
4350 known = basic_map_divs_known(bmap);
4354 return isl_map_from_basic_map(bmap);
4356 map = compute_divs(bmap);
4359 isl_basic_map_free(bmap);
4363 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4367 struct isl_map *res;
4374 known = map_divs_known(map);
4382 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4383 for (i = 1 ; i < map->n; ++i) {
4385 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4386 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4387 res = isl_map_union_disjoint(res, r2);
4389 res = isl_map_union(res, r2);
4396 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4398 return (struct isl_set *)
4399 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4402 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4404 return (struct isl_set *)
4405 isl_map_compute_divs((struct isl_map *)set);
4408 struct isl_set *isl_map_domain(struct isl_map *map)
4411 struct isl_set *set;
4416 map = isl_map_cow(map);
4420 set = (struct isl_set *)map;
4421 set->dim = isl_dim_domain(set->dim);
4424 for (i = 0; i < map->n; ++i) {
4425 set->p[i] = isl_basic_map_domain(map->p[i]);
4429 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4430 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4437 struct isl_map *isl_map_union_disjoint(
4438 struct isl_map *map1, struct isl_map *map2)
4442 struct isl_map *map = NULL;
4456 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4458 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4459 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4460 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4462 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4463 map1->n + map2->n, flags);
4466 for (i = 0; i < map1->n; ++i) {
4467 map = isl_map_add_basic_map(map,
4468 isl_basic_map_copy(map1->p[i]));
4472 for (i = 0; i < map2->n; ++i) {
4473 map = isl_map_add_basic_map(map,
4474 isl_basic_map_copy(map2->p[i]));
4488 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4490 map1 = isl_map_union_disjoint(map1, map2);
4494 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4498 struct isl_set *isl_set_union_disjoint(
4499 struct isl_set *set1, struct isl_set *set2)
4501 return (struct isl_set *)
4502 isl_map_union_disjoint(
4503 (struct isl_map *)set1, (struct isl_map *)set2);
4506 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4508 return (struct isl_set *)
4509 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4512 struct isl_map *isl_map_intersect_range(
4513 struct isl_map *map, struct isl_set *set)
4516 struct isl_map *result;
4522 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4523 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4524 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4526 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4527 map->n * set->n, flags);
4530 for (i = 0; i < map->n; ++i)
4531 for (j = 0; j < set->n; ++j) {
4532 result = isl_map_add_basic_map(result,
4533 isl_basic_map_intersect_range(
4534 isl_basic_map_copy(map->p[i]),
4535 isl_basic_set_copy(set->p[j])));
4548 struct isl_map *isl_map_intersect_domain(
4549 struct isl_map *map, struct isl_set *set)
4551 return isl_map_reverse(
4552 isl_map_intersect_range(isl_map_reverse(map), set));
4555 struct isl_map *isl_map_apply_domain(
4556 struct isl_map *map1, struct isl_map *map2)
4560 map1 = isl_map_reverse(map1);
4561 map1 = isl_map_apply_range(map1, map2);
4562 return isl_map_reverse(map1);
4569 struct isl_map *isl_map_apply_range(
4570 struct isl_map *map1, struct isl_map *map2)
4572 struct isl_dim *dim_result;
4573 struct isl_map *result;
4579 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4580 isl_dim_copy(map2->dim));
4582 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4585 for (i = 0; i < map1->n; ++i)
4586 for (j = 0; j < map2->n; ++j) {
4587 result = isl_map_add_basic_map(result,
4588 isl_basic_map_apply_range(
4589 isl_basic_map_copy(map1->p[i]),
4590 isl_basic_map_copy(map2->p[j])));
4596 if (result && result->n <= 1)
4597 ISL_F_SET(result, ISL_MAP_DISJOINT);
4606 * returns range - domain
4608 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4610 struct isl_basic_set *bset;
4617 dim = isl_basic_map_n_in(bmap);
4618 nparam = isl_basic_map_n_param(bmap);
4619 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4620 bset = isl_basic_set_from_basic_map(bmap);
4621 bset = isl_basic_set_cow(bset);
4622 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4623 bset = isl_basic_set_swap_vars(bset, 2*dim);
4624 for (i = 0; i < dim; ++i) {
4625 int j = isl_basic_map_alloc_equality(
4626 (struct isl_basic_map *)bset);
4629 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4630 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4631 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4632 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4634 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4636 isl_basic_map_free(bmap);
4641 * returns range - domain
4643 struct isl_set *isl_map_deltas(struct isl_map *map)
4646 struct isl_set *result;
4651 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4652 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4653 isl_map_n_in(map), map->n, map->flags);
4656 for (i = 0; i < map->n; ++i)
4657 result = isl_set_add_basic_set(result,
4658 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4666 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4668 struct isl_basic_map *bmap;
4676 nparam = dims->nparam;
4678 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4682 for (i = 0; i < dim; ++i) {
4683 int j = isl_basic_map_alloc_equality(bmap);
4686 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4687 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4688 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4690 return isl_basic_map_finalize(bmap);
4692 isl_basic_map_free(bmap);
4696 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4698 struct isl_dim *dim = isl_dim_map(set_dim);
4701 return basic_map_identity(dim);
4704 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4706 if (!model || !model->dim)
4708 isl_assert(model->ctx,
4709 model->dim->n_in == model->dim->n_out, return NULL);
4710 return basic_map_identity(isl_dim_copy(model->dim));
4713 static struct isl_map *map_identity(struct isl_dim *dim)
4715 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4716 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4719 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4721 struct isl_dim *dim = isl_dim_map(set_dim);
4724 return map_identity(dim);
4727 struct isl_map *isl_map_identity_like(struct isl_map *model)
4729 if (!model || !model->dim)
4731 isl_assert(model->ctx,
4732 model->dim->n_in == model->dim->n_out, return NULL);
4733 return map_identity(isl_dim_copy(model->dim));
4736 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4738 if (!model || !model->dim)
4740 isl_assert(model->ctx,
4741 model->dim->n_in == model->dim->n_out, return NULL);
4742 return map_identity(isl_dim_copy(model->dim));
4745 /* Construct a basic set with all set dimensions having only non-negative
4748 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4753 struct isl_basic_set *bset;
4757 nparam = dims->nparam;
4759 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4762 for (i = 0; i < dim; ++i) {
4763 int k = isl_basic_set_alloc_inequality(bset);
4766 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4767 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4771 isl_basic_set_free(bset);
4775 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4777 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4780 int isl_basic_map_is_subset(
4781 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4784 struct isl_map *map1;
4785 struct isl_map *map2;
4787 if (!bmap1 || !bmap2)
4790 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4791 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4793 is_subset = isl_map_is_subset(map1, map2);
4801 int isl_basic_map_is_equal(
4802 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4806 if (!bmap1 || !bmap2)
4808 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4811 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4815 int isl_basic_set_is_equal(
4816 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4818 return isl_basic_map_is_equal(
4819 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4822 int isl_map_is_empty(struct isl_map *map)
4829 for (i = 0; i < map->n; ++i) {
4830 is_empty = isl_basic_map_is_empty(map->p[i]);
4839 int isl_map_fast_is_empty(struct isl_map *map)
4844 int isl_set_fast_is_empty(struct isl_set *set)
4849 int isl_set_is_empty(struct isl_set *set)
4851 return isl_map_is_empty((struct isl_map *)set);
4854 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4860 is_subset = isl_map_is_subset(map1, map2);
4863 is_subset = isl_map_is_subset(map2, map1);
4867 int isl_basic_map_is_strict_subset(
4868 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4872 if (!bmap1 || !bmap2)
4874 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4877 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4878 if (is_subset == -1)
4883 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4889 is_subset = isl_map_is_subset(map1, map2);
4892 is_subset = isl_map_is_subset(map2, map1);
4893 if (is_subset == -1)
4898 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4900 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4903 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4907 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4910 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4914 return bset->n_eq == 0 && bset->n_ineq == 0;
4917 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4922 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4925 int isl_set_fast_is_universe(__isl_keep isl_set *set)
4927 return isl_map_fast_is_universe((isl_map *) set);
4930 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4932 struct isl_basic_set *bset = NULL;
4933 struct isl_vec *sample = NULL;
4940 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4943 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4944 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4945 copy = isl_basic_map_convex_hull(copy);
4946 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4947 isl_basic_map_free(copy);
4951 total = 1 + isl_basic_map_total_dim(bmap);
4952 if (bmap->sample && bmap->sample->size == total) {
4953 int contains = isl_basic_map_contains(bmap, bmap->sample);
4959 isl_vec_free(bmap->sample);
4960 bmap->sample = NULL;
4961 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4964 sample = isl_basic_set_sample_vec(bset);
4967 empty = sample->size == 0;
4968 isl_vec_free(bmap->sample);
4969 bmap->sample = sample;
4971 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4976 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4980 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4983 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4987 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4990 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4992 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4995 struct isl_map *isl_basic_map_union(
4996 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4998 struct isl_map *map;
4999 if (!bmap1 || !bmap2)
5002 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5004 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5007 map = isl_map_add_basic_map(map, bmap1);
5008 map = isl_map_add_basic_map(map, bmap2);
5011 isl_basic_map_free(bmap1);
5012 isl_basic_map_free(bmap2);
5016 struct isl_set *isl_basic_set_union(
5017 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5019 return (struct isl_set *)isl_basic_map_union(
5020 (struct isl_basic_map *)bset1,
5021 (struct isl_basic_map *)bset2);
5024 /* Order divs such that any div only depends on previous divs */
5025 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5028 unsigned off = isl_dim_total(bmap->dim);
5030 for (i = 0; i < bmap->n_div; ++i) {
5032 if (isl_int_is_zero(bmap->div[i][0]))
5034 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5038 isl_basic_map_swap_div(bmap, i, i + pos);
5044 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5046 return (struct isl_basic_set *)
5047 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5050 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5057 for (i = 0; i < map->n; ++i) {
5058 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5069 /* Look for a div in dst that corresponds to the div "div" in src.
5070 * The divs before "div" in src and dst are assumed to be the same.
5072 * Returns -1 if no corresponding div was found and the position
5073 * of the corresponding div in dst otherwise.
5075 static int find_div(struct isl_basic_map *dst,
5076 struct isl_basic_map *src, unsigned div)
5080 unsigned total = isl_dim_total(src->dim);
5082 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5083 for (i = div; i < dst->n_div; ++i)
5084 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5085 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5086 dst->n_div - div) == -1)
5091 struct isl_basic_map *isl_basic_map_align_divs(
5092 struct isl_basic_map *dst, struct isl_basic_map *src)
5095 unsigned total = isl_dim_total(src->dim);
5100 if (src->n_div == 0)
5103 for (i = 0; i < src->n_div; ++i)
5104 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5106 src = isl_basic_map_order_divs(src);
5107 dst = isl_basic_map_cow(dst);
5108 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5109 src->n_div, 0, 2 * src->n_div);
5112 for (i = 0; i < src->n_div; ++i) {
5113 int j = find_div(dst, src, i);
5115 j = isl_basic_map_alloc_div(dst);
5118 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5119 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5120 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5124 isl_basic_map_swap_div(dst, i, j);
5128 isl_basic_map_free(dst);
5132 struct isl_basic_set *isl_basic_set_align_divs(
5133 struct isl_basic_set *dst, struct isl_basic_set *src)
5135 return (struct isl_basic_set *)isl_basic_map_align_divs(
5136 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5139 struct isl_map *isl_map_align_divs(struct isl_map *map)
5147 map = isl_map_compute_divs(map);
5148 map = isl_map_cow(map);
5152 for (i = 1; i < map->n; ++i)
5153 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5154 for (i = 1; i < map->n; ++i)
5155 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5157 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5161 struct isl_set *isl_set_align_divs(struct isl_set *set)
5163 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5166 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5170 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5171 map = isl_map_intersect_domain(map, set);
5172 set = isl_map_range(map);
5180 /* There is no need to cow as removing empty parts doesn't change
5181 * the meaning of the set.
5183 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5190 for (i = map->n-1; i >= 0; --i) {
5191 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5193 isl_basic_map_free(map->p[i]);
5194 if (i != map->n-1) {
5195 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5196 map->p[i] = map->p[map->n-1];
5204 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5206 return (struct isl_set *)
5207 isl_map_remove_empty_parts((struct isl_map *)set);
5210 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5212 struct isl_basic_map *bmap;
5213 if (!map || map->n == 0)
5215 bmap = map->p[map->n-1];
5216 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5217 return isl_basic_map_copy(bmap);
5220 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5222 return (struct isl_basic_set *)
5223 isl_map_copy_basic_map((struct isl_map *)set);
5226 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5227 __isl_keep isl_basic_map *bmap)
5233 for (i = map->n-1; i >= 0; --i) {
5234 if (map->p[i] != bmap)
5236 map = isl_map_cow(map);
5239 isl_basic_map_free(map->p[i]);
5240 if (i != map->n-1) {
5241 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5242 map->p[i] = map->p[map->n-1];
5253 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5254 struct isl_basic_set *bset)
5256 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5257 (struct isl_basic_map *)bset);
5260 /* Given two basic sets bset1 and bset2, compute the maximal difference
5261 * between the values of dimension pos in bset1 and those in bset2
5262 * for any common value of the parameters and dimensions preceding pos.
5264 static enum isl_lp_result basic_set_maximal_difference_at(
5265 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5266 int pos, isl_int *opt)
5268 struct isl_dim *dims;
5269 struct isl_basic_map *bmap1 = NULL;
5270 struct isl_basic_map *bmap2 = NULL;
5271 struct isl_ctx *ctx;
5272 struct isl_vec *obj;
5275 unsigned dim1, dim2;
5276 enum isl_lp_result res;
5278 if (!bset1 || !bset2)
5279 return isl_lp_error;
5281 nparam = isl_basic_set_n_param(bset1);
5282 dim1 = isl_basic_set_n_dim(bset1);
5283 dim2 = isl_basic_set_n_dim(bset2);
5284 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5285 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5286 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5287 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5288 if (!bmap1 || !bmap2)
5290 bmap1 = isl_basic_map_cow(bmap1);
5291 bmap1 = isl_basic_map_extend(bmap1, nparam,
5292 pos, (dim1 - pos) + (dim2 - pos),
5293 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5294 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5297 total = isl_basic_map_total_dim(bmap1);
5299 obj = isl_vec_alloc(ctx, 1 + total);
5300 isl_seq_clr(obj->block.data, 1 + total);
5301 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5302 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5305 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5307 isl_basic_map_free(bmap1);
5311 isl_basic_map_free(bmap1);
5312 isl_basic_map_free(bmap2);
5313 return isl_lp_error;
5316 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5317 * for any common value of the parameters and dimensions preceding pos
5318 * in both basic sets, the values of dimension pos in bset1 are
5319 * smaller or larger than those in bset2.
5322 * 1 if bset1 follows bset2
5323 * -1 if bset1 precedes bset2
5324 * 0 if bset1 and bset2 are incomparable
5325 * -2 if some error occurred.
5327 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5328 struct isl_basic_set *bset2, int pos)
5331 enum isl_lp_result res;
5336 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5338 if (res == isl_lp_empty)
5340 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5341 res == isl_lp_unbounded)
5343 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5352 /* Given two basic sets bset1 and bset2, check whether
5353 * for any common value of the parameters and dimensions preceding pos
5354 * there is a value of dimension pos in bset1 that is larger
5355 * than a value of the same dimension in bset2.
5358 * 1 if there exists such a pair
5359 * 0 if there is no such pair, but there is a pair of equal values
5361 * -2 if some error occurred.
5363 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5364 __isl_keep isl_basic_set *bset2, int pos)
5367 enum isl_lp_result res;
5372 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5374 if (res == isl_lp_empty)
5376 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5377 res == isl_lp_unbounded)
5379 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5381 else if (res == isl_lp_ok)
5390 /* Given two sets set1 and set2, check whether
5391 * for any common value of the parameters and dimensions preceding pos
5392 * there is a value of dimension pos in set1 that is larger
5393 * than a value of the same dimension in set2.
5396 * 1 if there exists such a pair
5397 * 0 if there is no such pair, but there is a pair of equal values
5399 * -2 if some error occurred.
5401 int isl_set_follows_at(__isl_keep isl_set *set1,
5402 __isl_keep isl_set *set2, int pos)
5410 for (i = 0; i < set1->n; ++i)
5411 for (j = 0; j < set2->n; ++j) {
5413 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5414 if (f == 1 || f == -2)
5423 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5424 unsigned pos, isl_int *val)
5432 total = isl_basic_map_total_dim(bmap);
5433 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5434 for (; d+1 > pos; --d)
5435 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5439 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5441 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5443 if (!isl_int_is_one(bmap->eq[i][1+d]))
5446 isl_int_neg(*val, bmap->eq[i][0]);
5452 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5453 unsigned pos, isl_int *val)
5465 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5468 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5469 for (i = 1; fixed == 1 && i < map->n; ++i) {
5470 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5471 if (fixed == 1 && isl_int_ne(tmp, v))
5475 isl_int_set(*val, v);
5481 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5482 unsigned pos, isl_int *val)
5484 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5488 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5491 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5494 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5495 enum isl_dim_type type, unsigned pos, isl_int *val)
5497 if (pos >= isl_basic_map_dim(bmap, type))
5499 return isl_basic_map_fast_has_fixed_var(bmap,
5500 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5503 int isl_map_fast_is_fixed(struct isl_map *map,
5504 enum isl_dim_type type, unsigned pos, isl_int *val)
5506 if (pos >= isl_map_dim(map, type))
5508 return isl_map_fast_has_fixed_var(map,
5509 map_offset(map, type) - 1 + pos, val);
5512 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5513 * then return this fixed value in *val.
5515 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5518 return isl_basic_set_fast_has_fixed_var(bset,
5519 isl_basic_set_n_param(bset) + dim, val);
5522 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5523 * then return this fixed value in *val.
5525 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5527 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5530 /* Check if input variable in has fixed value and if so and if val is not NULL,
5531 * then return this fixed value in *val.
5533 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5535 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5538 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5539 * and if val is not NULL, then return this lower bound in *val.
5541 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5542 unsigned dim, isl_int *val)
5544 int i, i_eq = -1, i_ineq = -1;
5551 total = isl_basic_set_total_dim(bset);
5552 nparam = isl_basic_set_n_param(bset);
5553 for (i = 0; i < bset->n_eq; ++i) {
5554 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5560 for (i = 0; i < bset->n_ineq; ++i) {
5561 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5563 if (i_eq != -1 || i_ineq != -1)
5567 if (i_eq == -1 && i_ineq == -1)
5569 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5570 /* The coefficient should always be one due to normalization. */
5571 if (!isl_int_is_one(c[1+nparam+dim]))
5573 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5575 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5576 total - nparam - dim - 1) != -1)
5579 isl_int_neg(*val, c[0]);
5583 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5584 unsigned dim, isl_int *val)
5596 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5600 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5602 for (i = 1; fixed == 1 && i < set->n; ++i) {
5603 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5605 if (fixed == 1 && isl_int_ne(tmp, v))
5609 isl_int_set(*val, v);
5620 static int qsort_constraint_cmp(const void *p1, const void *p2)
5622 const struct constraint *c1 = (const struct constraint *)p1;
5623 const struct constraint *c2 = (const struct constraint *)p2;
5624 unsigned size = isl_min(c1->size, c2->size);
5625 return isl_seq_cmp(c1->c, c2->c, size);
5628 static struct isl_basic_map *isl_basic_map_sort_constraints(
5629 struct isl_basic_map *bmap)
5632 struct constraint *c;
5637 total = isl_basic_map_total_dim(bmap);
5638 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5641 for (i = 0; i < bmap->n_ineq; ++i) {
5643 c[i].c = bmap->ineq[i];
5645 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5646 for (i = 0; i < bmap->n_ineq; ++i)
5647 bmap->ineq[i] = c[i].c;
5651 isl_basic_map_free(bmap);
5655 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5659 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5661 bmap = isl_basic_map_convex_hull(bmap);
5662 bmap = isl_basic_map_sort_constraints(bmap);
5663 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5667 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5669 return (struct isl_basic_set *)isl_basic_map_normalize(
5670 (struct isl_basic_map *)bset);
5673 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5674 const struct isl_basic_map *bmap2)
5681 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5682 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5683 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5684 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5685 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5686 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5687 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5688 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5690 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5692 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5694 if (bmap1->n_eq != bmap2->n_eq)
5695 return bmap1->n_eq - bmap2->n_eq;
5696 if (bmap1->n_ineq != bmap2->n_ineq)
5697 return bmap1->n_ineq - bmap2->n_ineq;
5698 if (bmap1->n_div != bmap2->n_div)
5699 return bmap1->n_div - bmap2->n_div;
5700 total = isl_basic_map_total_dim(bmap1);
5701 for (i = 0; i < bmap1->n_eq; ++i) {
5702 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5706 for (i = 0; i < bmap1->n_ineq; ++i) {
5707 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5711 for (i = 0; i < bmap1->n_div; ++i) {
5712 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5719 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5720 struct isl_basic_map *bmap2)
5722 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5725 static int qsort_bmap_cmp(const void *p1, const void *p2)
5727 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5728 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5730 return isl_basic_map_fast_cmp(bmap1, bmap2);
5733 /* We normalize in place, but if anything goes wrong we need
5734 * to return NULL, so we need to make sure we don't change the
5735 * meaning of any possible other copies of map.
5737 struct isl_map *isl_map_normalize(struct isl_map *map)
5740 struct isl_basic_map *bmap;
5744 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5746 for (i = 0; i < map->n; ++i) {
5747 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5750 isl_basic_map_free(map->p[i]);
5753 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5754 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5755 map = isl_map_remove_empty_parts(map);
5758 for (i = map->n - 1; i >= 1; --i) {
5759 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5761 isl_basic_map_free(map->p[i-1]);
5762 for (j = i; j < map->n; ++j)
5763 map->p[j-1] = map->p[j];
5773 struct isl_set *isl_set_normalize(struct isl_set *set)
5775 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5778 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5788 if (!isl_dim_equal(map1->dim, map2->dim))
5791 map1 = isl_map_copy(map1);
5792 map2 = isl_map_copy(map2);
5793 map1 = isl_map_normalize(map1);
5794 map2 = isl_map_normalize(map2);
5797 equal = map1->n == map2->n;
5798 for (i = 0; equal && i < map1->n; ++i) {
5799 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5812 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5814 return isl_map_fast_is_equal((struct isl_map *)set1,
5815 (struct isl_map *)set2);
5818 /* Return an interval that ranges from min to max (inclusive)
5820 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5821 isl_int min, isl_int max)
5824 struct isl_basic_set *bset = NULL;
5826 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5830 k = isl_basic_set_alloc_inequality(bset);
5833 isl_int_set_si(bset->ineq[k][1], 1);
5834 isl_int_neg(bset->ineq[k][0], min);
5836 k = isl_basic_set_alloc_inequality(bset);
5839 isl_int_set_si(bset->ineq[k][1], -1);
5840 isl_int_set(bset->ineq[k][0], max);
5844 isl_basic_set_free(bset);
5848 /* Return the Cartesian product of the basic sets in list (in the given order).
5850 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5858 struct isl_basic_set *product = NULL;
5862 isl_assert(list->ctx, list->n > 0, goto error);
5863 isl_assert(list->ctx, list->p[0], goto error);
5864 nparam = isl_basic_set_n_param(list->p[0]);
5865 dim = isl_basic_set_n_dim(list->p[0]);
5866 extra = list->p[0]->n_div;
5867 n_eq = list->p[0]->n_eq;
5868 n_ineq = list->p[0]->n_ineq;
5869 for (i = 1; i < list->n; ++i) {
5870 isl_assert(list->ctx, list->p[i], goto error);
5871 isl_assert(list->ctx,
5872 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5873 dim += isl_basic_set_n_dim(list->p[i]);
5874 extra += list->p[i]->n_div;
5875 n_eq += list->p[i]->n_eq;
5876 n_ineq += list->p[i]->n_ineq;
5878 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5883 for (i = 0; i < list->n; ++i) {
5884 isl_basic_set_add_constraints(product,
5885 isl_basic_set_copy(list->p[i]), dim);
5886 dim += isl_basic_set_n_dim(list->p[i]);
5888 isl_basic_set_list_free(list);
5891 isl_basic_set_free(product);
5892 isl_basic_set_list_free(list);
5896 struct isl_basic_map *isl_basic_map_product(
5897 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5899 struct isl_dim *dim_result = NULL;
5900 struct isl_basic_map *bmap;
5901 unsigned in1, in2, out1, out2, nparam, total, pos;
5902 struct isl_dim_map *dim_map1, *dim_map2;
5904 if (!bmap1 || !bmap2)
5907 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5908 bmap2->dim, isl_dim_param), goto error);
5909 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5910 isl_dim_copy(bmap2->dim));
5912 in1 = isl_basic_map_n_in(bmap1);
5913 in2 = isl_basic_map_n_in(bmap2);
5914 out1 = isl_basic_map_n_out(bmap1);
5915 out2 = isl_basic_map_n_out(bmap2);
5916 nparam = isl_basic_map_n_param(bmap1);
5918 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5919 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5920 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5921 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5922 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5923 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5924 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5925 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5926 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5927 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5928 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5930 bmap = isl_basic_map_alloc_dim(dim_result,
5931 bmap1->n_div + bmap2->n_div,
5932 bmap1->n_eq + bmap2->n_eq,
5933 bmap1->n_ineq + bmap2->n_ineq);
5934 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5935 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5936 bmap = isl_basic_map_simplify(bmap);
5937 return isl_basic_map_finalize(bmap);
5939 isl_basic_map_free(bmap1);
5940 isl_basic_map_free(bmap2);
5944 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5946 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5949 struct isl_map *result;
5955 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5956 map2->dim, isl_dim_param), goto error);
5958 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5959 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5960 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5962 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5963 isl_dim_copy(map2->dim)),
5964 map1->n * map2->n, flags);
5967 for (i = 0; i < map1->n; ++i)
5968 for (j = 0; j < map2->n; ++j) {
5969 struct isl_basic_map *part;
5970 part = isl_basic_map_product(
5971 isl_basic_map_copy(map1->p[i]),
5972 isl_basic_map_copy(map2->p[j]));
5973 if (isl_basic_map_is_empty(part))
5974 isl_basic_map_free(part);
5976 result = isl_map_add_basic_map(result, part);
5989 /* Given two set A and B, construct its Cartesian product A x B.
5991 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5993 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5994 (struct isl_map *)set2);
5997 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6000 uint32_t hash = isl_hash_init();
6005 bset = isl_basic_set_copy(bset);
6006 bset = isl_basic_set_normalize(bset);
6009 total = isl_basic_set_total_dim(bset);
6010 isl_hash_byte(hash, bset->n_eq & 0xFF);
6011 for (i = 0; i < bset->n_eq; ++i) {
6013 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6014 isl_hash_hash(hash, c_hash);
6016 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6017 for (i = 0; i < bset->n_ineq; ++i) {
6019 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6020 isl_hash_hash(hash, c_hash);
6022 isl_hash_byte(hash, bset->n_div & 0xFF);
6023 for (i = 0; i < bset->n_div; ++i) {
6025 if (isl_int_is_zero(bset->div[i][0]))
6027 isl_hash_byte(hash, i & 0xFF);
6028 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6029 isl_hash_hash(hash, c_hash);
6031 isl_basic_set_free(bset);
6035 uint32_t isl_set_get_hash(struct isl_set *set)
6042 set = isl_set_copy(set);
6043 set = isl_set_normalize(set);
6047 hash = isl_hash_init();
6048 for (i = 0; i < set->n; ++i) {
6050 bset_hash = isl_basic_set_get_hash(set->p[i]);
6051 isl_hash_hash(hash, bset_hash);
6059 /* Check if the value for dimension dim is completely determined
6060 * by the values of the other parameters and variables.
6061 * That is, check if dimension dim is involved in an equality.
6063 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6070 nparam = isl_basic_set_n_param(bset);
6071 for (i = 0; i < bset->n_eq; ++i)
6072 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6077 /* Check if the value for dimension dim is completely determined
6078 * by the values of the other parameters and variables.
6079 * That is, check if dimension dim is involved in an equality
6080 * for each of the subsets.
6082 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6088 for (i = 0; i < set->n; ++i) {
6090 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6097 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6098 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6105 for (i = 0; i < map->n; ++i)
6106 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6112 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6113 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6120 for (i = 0; i < set->n; ++i)
6121 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6127 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6129 struct isl_dim *dim;
6134 if (bset->n_div == 0)
6137 bset = isl_basic_set_cow(bset);
6141 dim = isl_basic_set_get_dim(bset);
6142 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6145 isl_dim_free(bset->dim);
6151 isl_basic_set_free(bset);
6155 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6158 struct isl_dim *dim;
6161 set = isl_set_align_divs(set);
6165 if (set->n == 0 || set->p[0]->n_div == 0)
6168 set = isl_set_cow(set);
6172 n_div = set->p[0]->n_div;
6173 dim = isl_set_get_dim(set);
6174 dim = isl_dim_add(dim, isl_dim_set, n_div);
6177 isl_dim_free(set->dim);
6180 for (i = 0; i < set->n; ++i) {
6181 set->p[i] = isl_basic_set_lift(set->p[i]);
6192 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6194 struct isl_dim *dim;
6195 struct isl_basic_map *bmap;
6202 set = isl_set_align_divs(set);
6207 dim = isl_set_get_dim(set);
6208 if (set->n == 0 || set->p[0]->n_div == 0) {
6210 return isl_map_identity(dim);
6213 n_div = set->p[0]->n_div;
6214 dim = isl_dim_map(dim);
6215 n_param = isl_dim_size(dim, isl_dim_param);
6216 n_set = isl_dim_size(dim, isl_dim_in);
6217 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6218 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6219 for (i = 0; i < n_set; ++i)
6220 bmap = var_equal(bmap, i);
6222 total = n_param + n_set + n_set + n_div;
6223 for (i = 0; i < n_div; ++i) {
6224 k = isl_basic_map_alloc_inequality(bmap);
6227 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6228 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6229 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6230 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6231 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6232 set->p[0]->div[i][0]);
6234 l = isl_basic_map_alloc_inequality(bmap);
6237 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6238 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6239 set->p[0]->div[i][0]);
6240 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6244 return isl_map_from_basic_map(bmap);
6247 isl_basic_map_free(bmap);
6251 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6259 dim = isl_basic_set_total_dim(bset);
6260 size += bset->n_eq * (1 + dim);
6261 size += bset->n_ineq * (1 + dim);
6262 size += bset->n_div * (2 + dim);
6267 int isl_set_size(__isl_keep isl_set *set)
6275 for (i = 0; i < set->n; ++i)
6276 size += isl_basic_set_size(set->p[i]);