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 struct isl_set *isl_set_eliminate_dims(struct isl_set *set,
1184 unsigned first, unsigned n)
1194 set = isl_set_cow(set);
1197 isl_assert(set->ctx, first+n <= isl_set_n_dim(set), goto error);
1198 nparam = isl_set_n_param(set);
1200 for (i = 0; i < set->n; ++i) {
1201 set->p[i] = isl_basic_set_eliminate_vars(set->p[i],
1212 /* Project out n dimensions starting at first using Fourier-Motzkin */
1213 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1214 unsigned first, unsigned n)
1216 set = isl_set_eliminate_dims(set, first, n);
1217 set = isl_set_drop_dims(set, first, n);
1221 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1223 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1231 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1240 set = isl_set_cow(set);
1244 for (i = 0; i < set->n; ++i) {
1245 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1255 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1256 enum isl_dim_type type, unsigned first, unsigned n)
1260 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1264 bmap = isl_basic_map_eliminate_vars(bmap,
1265 isl_basic_map_offset(bmap, type) - 1 + first, n);
1268 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1270 bmap = isl_basic_map_drop(bmap, type, first, n);
1273 isl_basic_map_free(bmap);
1277 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1278 enum isl_dim_type type, unsigned first, unsigned n)
1280 return (isl_basic_set *)
1281 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1284 struct isl_map *isl_map_remove(struct isl_map *map,
1285 enum isl_dim_type type, unsigned first, unsigned n)
1292 map = isl_map_cow(map);
1295 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1297 for (i = 0; i < map->n; ++i) {
1298 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1299 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1303 map = isl_map_drop(map, type, first, n);
1310 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1311 enum isl_dim_type type, unsigned first, unsigned n)
1313 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1316 /* Project out n inputs starting at first using Fourier-Motzkin */
1317 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1318 unsigned first, unsigned n)
1320 return isl_map_remove(map, isl_dim_in, first, n);
1323 /* Project out n dimensions starting at first using Fourier-Motzkin */
1324 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1325 unsigned first, unsigned n)
1327 unsigned nparam = isl_basic_set_n_param(bset);
1328 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1329 bset = isl_basic_set_drop_dims(bset, first, n);
1333 static void dump_term(struct isl_basic_map *bmap,
1334 isl_int c, int pos, FILE *out)
1337 unsigned in = isl_basic_map_n_in(bmap);
1338 unsigned dim = in + isl_basic_map_n_out(bmap);
1339 unsigned nparam = isl_basic_map_n_param(bmap);
1341 isl_int_print(out, c, 0);
1343 if (!isl_int_is_one(c))
1344 isl_int_print(out, c, 0);
1345 if (pos < 1 + nparam) {
1346 name = isl_dim_get_name(bmap->dim,
1347 isl_dim_param, pos - 1);
1349 fprintf(out, "%s", name);
1351 fprintf(out, "p%d", pos - 1);
1352 } else if (pos < 1 + nparam + in)
1353 fprintf(out, "i%d", pos - 1 - nparam);
1354 else if (pos < 1 + nparam + dim)
1355 fprintf(out, "o%d", pos - 1 - nparam - in);
1357 fprintf(out, "e%d", pos - 1 - nparam - dim);
1361 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1362 int sign, FILE *out)
1366 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1370 for (i = 0, first = 1; i < len; ++i) {
1371 if (isl_int_sgn(c[i]) * sign <= 0)
1374 fprintf(out, " + ");
1376 isl_int_abs(v, c[i]);
1377 dump_term(bmap, v, i, out);
1384 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1385 const char *op, FILE *out, int indent)
1389 fprintf(out, "%*s", indent, "");
1391 dump_constraint_sign(bmap, c, 1, out);
1392 fprintf(out, " %s ", op);
1393 dump_constraint_sign(bmap, c, -1, out);
1397 for (i = bmap->n_div; i < bmap->extra; ++i) {
1398 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1400 fprintf(out, "%*s", indent, "");
1401 fprintf(out, "ERROR: unused div coefficient not zero\n");
1406 static void dump_constraints(struct isl_basic_map *bmap,
1407 isl_int **c, unsigned n,
1408 const char *op, FILE *out, int indent)
1412 for (i = 0; i < n; ++i)
1413 dump_constraint(bmap, c[i], op, out, indent);
1416 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1420 unsigned total = isl_basic_map_total_dim(bmap);
1422 for (j = 0; j < 1 + total; ++j) {
1423 if (isl_int_is_zero(exp[j]))
1425 if (!first && isl_int_is_pos(exp[j]))
1427 dump_term(bmap, exp[j], j, out);
1432 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1436 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1437 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1439 for (i = 0; i < bmap->n_div; ++i) {
1440 fprintf(out, "%*s", indent, "");
1441 fprintf(out, "e%d = [(", i);
1442 dump_affine(bmap, bmap->div[i]+1, out);
1444 isl_int_print(out, bmap->div[i][0], 0);
1445 fprintf(out, "]\n");
1449 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1452 fprintf(out, "null basic set\n");
1456 fprintf(out, "%*s", indent, "");
1457 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1458 bset->ref, bset->dim->nparam, bset->dim->n_out,
1459 bset->extra, bset->flags);
1460 dump((struct isl_basic_map *)bset, out, indent);
1463 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1466 fprintf(out, "null basic map\n");
1470 fprintf(out, "%*s", indent, "");
1471 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1472 "flags: %x, n_name: %d\n",
1474 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1475 bmap->extra, bmap->flags, bmap->dim->n_name);
1476 dump(bmap, out, indent);
1479 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1484 total = isl_basic_map_total_dim(bmap);
1485 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1486 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1487 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1488 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1492 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1494 struct isl_set *set;
1498 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1499 isl_assert(dim->ctx, n >= 0, return NULL);
1500 set = isl_alloc(dim->ctx, struct isl_set,
1501 sizeof(struct isl_set) +
1502 (n - 1) * sizeof(struct isl_basic_set *));
1506 set->ctx = dim->ctx;
1507 isl_ctx_ref(set->ctx);
1519 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1520 unsigned nparam, unsigned dim, int n, unsigned flags)
1522 struct isl_set *set;
1523 struct isl_dim *dims;
1525 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1529 set = isl_set_alloc_dim(dims, n, flags);
1533 /* Make sure "map" has room for at least "n" more basic maps.
1535 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1538 struct isl_map *grown = NULL;
1542 isl_assert(map->ctx, n >= 0, goto error);
1543 if (map->n + n <= map->size)
1545 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1548 for (i = 0; i < map->n; ++i) {
1549 grown->p[i] = isl_basic_map_copy(map->p[i]);
1557 isl_map_free(grown);
1562 /* Make sure "set" has room for at least "n" more basic sets.
1564 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1566 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1569 struct isl_set *isl_set_dup(struct isl_set *set)
1572 struct isl_set *dup;
1577 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1580 for (i = 0; i < set->n; ++i)
1581 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1585 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1587 struct isl_set *set;
1592 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1594 isl_basic_set_free(bset);
1597 return isl_set_add_basic_set(set, bset);
1600 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1602 struct isl_map *map;
1607 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1609 isl_basic_map_free(bmap);
1612 return isl_map_add_basic_map(map, bmap);
1615 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1616 __isl_take isl_basic_set *bset)
1618 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1619 (struct isl_basic_map *)bset);
1622 void isl_set_free(struct isl_set *set)
1632 isl_ctx_deref(set->ctx);
1633 for (i = 0; i < set->n; ++i)
1634 isl_basic_set_free(set->p[i]);
1635 isl_dim_free(set->dim);
1639 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1644 fprintf(out, "null set\n");
1648 fprintf(out, "%*s", indent, "");
1649 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1650 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1652 for (i = 0; i < set->n; ++i) {
1653 fprintf(out, "%*s", indent, "");
1654 fprintf(out, "basic set %d:\n", i);
1655 isl_basic_set_dump(set->p[i], out, indent+4);
1659 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1664 fprintf(out, "null map\n");
1668 fprintf(out, "%*s", indent, "");
1669 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1670 "flags: %x, n_name: %d\n",
1671 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1672 map->dim->n_out, map->flags, map->dim->n_name);
1673 for (i = 0; i < map->n; ++i) {
1674 fprintf(out, "%*s", indent, "");
1675 fprintf(out, "basic map %d:\n", i);
1676 isl_basic_map_dump(map->p[i], out, indent+4);
1680 struct isl_basic_map *isl_basic_map_intersect_domain(
1681 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1683 struct isl_basic_map *bmap_domain;
1684 struct isl_dim *dim;
1689 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1690 bset->dim, isl_dim_param), goto error);
1692 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1693 isl_assert(bset->ctx,
1694 isl_basic_map_compatible_domain(bmap, bset), goto error);
1696 bmap = isl_basic_map_cow(bmap);
1697 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1698 bset->n_div, bset->n_eq, bset->n_ineq);
1701 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1702 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1703 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1705 bmap = isl_basic_map_simplify(bmap);
1706 return isl_basic_map_finalize(bmap);
1708 isl_basic_map_free(bmap);
1709 isl_basic_set_free(bset);
1713 struct isl_basic_map *isl_basic_map_intersect_range(
1714 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1716 struct isl_basic_map *bmap_range;
1721 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1722 bset->dim, isl_dim_param), goto error);
1724 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1725 isl_assert(bset->ctx,
1726 isl_basic_map_compatible_range(bmap, bset), goto error);
1728 bmap = isl_basic_map_cow(bmap);
1729 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1730 bset->n_div, bset->n_eq, bset->n_ineq);
1733 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1734 bmap = add_constraints(bmap, bmap_range, 0, 0);
1736 bmap = isl_basic_map_simplify(bmap);
1737 return isl_basic_map_finalize(bmap);
1739 isl_basic_map_free(bmap);
1740 isl_basic_set_free(bset);
1744 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1750 total = 1 + isl_basic_map_total_dim(bmap);
1751 if (total != vec->size)
1756 for (i = 0; i < bmap->n_eq; ++i) {
1757 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1758 if (!isl_int_is_zero(s)) {
1764 for (i = 0; i < bmap->n_ineq; ++i) {
1765 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1766 if (isl_int_is_neg(s)) {
1777 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1779 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1782 struct isl_basic_map *isl_basic_map_intersect(
1783 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1785 struct isl_vec *sample = NULL;
1787 if (!bmap1 || !bmap2)
1790 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1791 bmap2->dim, isl_dim_param), goto error);
1792 if (isl_dim_total(bmap1->dim) ==
1793 isl_dim_size(bmap1->dim, isl_dim_param) &&
1794 isl_dim_total(bmap2->dim) !=
1795 isl_dim_size(bmap2->dim, isl_dim_param))
1796 return isl_basic_map_intersect(bmap2, bmap1);
1798 if (isl_dim_total(bmap2->dim) !=
1799 isl_dim_size(bmap2->dim, isl_dim_param))
1800 isl_assert(bmap1->ctx,
1801 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1803 if (bmap1->sample &&
1804 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1805 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1806 sample = isl_vec_copy(bmap1->sample);
1807 else if (bmap2->sample &&
1808 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1809 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1810 sample = isl_vec_copy(bmap2->sample);
1812 bmap1 = isl_basic_map_cow(bmap1);
1813 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1814 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1817 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1820 isl_vec_free(bmap1->sample);
1821 bmap1->sample = sample;
1824 bmap1 = isl_basic_map_simplify(bmap1);
1825 return isl_basic_map_finalize(bmap1);
1828 isl_vec_free(sample);
1829 isl_basic_map_free(bmap1);
1830 isl_basic_map_free(bmap2);
1834 struct isl_basic_set *isl_basic_set_intersect(
1835 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1837 return (struct isl_basic_set *)
1838 isl_basic_map_intersect(
1839 (struct isl_basic_map *)bset1,
1840 (struct isl_basic_map *)bset2);
1843 /* Special case of isl_map_intersect, where both map1 and map2
1844 * are convex, without any divs and such that either map1 or map2
1845 * contains a single constraint. This constraint is then simply
1846 * added to the other map.
1848 static __isl_give isl_map *map_intersect_add_constraint(
1849 __isl_take isl_map *map1, __isl_take isl_map *map2)
1851 struct isl_basic_map *bmap1;
1852 struct isl_basic_map *bmap2;
1854 isl_assert(map1->ctx, map1->n == 1, goto error);
1855 isl_assert(map2->ctx, map1->n == 1, goto error);
1856 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1857 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1859 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1860 return isl_map_intersect(map2, map1);
1862 isl_assert(map2->ctx,
1863 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1865 map1 = isl_map_cow(map1);
1868 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1869 if (map2->p[0]->n_eq == 1)
1870 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1872 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1873 map2->p[0]->ineq[0]);
1875 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1876 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1880 if (isl_basic_map_fast_is_empty(map1->p[0])) {
1881 isl_basic_map_free(map1->p[0]);
1894 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1897 struct isl_map *result;
1903 if (map1->n == 1 && map2->n == 1 &&
1904 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1905 isl_dim_equal(map1->dim, map2->dim) &&
1906 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1907 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1908 return map_intersect_add_constraint(map1, map2);
1909 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1910 map2->dim, isl_dim_param), goto error);
1911 if (isl_dim_total(map1->dim) ==
1912 isl_dim_size(map1->dim, isl_dim_param) &&
1913 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1914 return isl_map_intersect(map2, map1);
1916 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1917 isl_assert(map1->ctx,
1918 isl_dim_equal(map1->dim, map2->dim), goto error);
1920 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1921 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1922 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1924 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1925 map1->n * map2->n, flags);
1928 for (i = 0; i < map1->n; ++i)
1929 for (j = 0; j < map2->n; ++j) {
1930 struct isl_basic_map *part;
1931 part = isl_basic_map_intersect(
1932 isl_basic_map_copy(map1->p[i]),
1933 isl_basic_map_copy(map2->p[j]));
1934 if (isl_basic_map_is_empty(part))
1935 isl_basic_map_free(part);
1937 result = isl_map_add_basic_map(result, part);
1950 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1952 return (struct isl_set *)
1953 isl_map_intersect((struct isl_map *)set1,
1954 (struct isl_map *)set2);
1957 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1959 struct isl_dim *dim;
1960 struct isl_basic_set *bset;
1965 bmap = isl_basic_map_cow(bmap);
1968 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
1969 in = isl_basic_map_n_in(bmap);
1970 bset = isl_basic_set_from_basic_map(bmap);
1971 bset = isl_basic_set_swap_vars(bset, in);
1972 return isl_basic_map_from_basic_set(bset, dim);
1975 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
1976 enum isl_dim_type type, unsigned n)
1978 struct isl_dim *res_dim;
1979 struct isl_basic_map *res;
1980 struct isl_dim_map *dim_map;
1981 unsigned total, pos;
1989 res_dim = isl_dim_add(isl_basic_map_get_dim(bmap), type, n);
1991 total = isl_basic_map_total_dim(bmap) + n;
1992 dim_map = isl_dim_map_alloc(bmap->ctx, total);
1994 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos);
1995 pos += isl_dim_size(res_dim, isl_dim_param);
1996 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos);
1997 pos += isl_dim_size(res_dim, isl_dim_in);
1998 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos);
1999 pos += isl_dim_size(res_dim, isl_dim_out);
2000 isl_dim_map_div(dim_map, bmap, pos);
2002 res = isl_basic_map_alloc_dim(res_dim,
2003 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2004 res = add_constraints_dim_map(res, bmap, dim_map);
2005 res = isl_basic_map_simplify(res);
2006 return isl_basic_map_finalize(res);
2009 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2010 enum isl_dim_type type, unsigned n)
2014 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2015 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2017 isl_basic_set_free(bset);
2021 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2022 enum isl_dim_type type, unsigned n)
2029 map = isl_map_cow(map);
2033 map->dim = isl_dim_add(map->dim, type, n);
2037 for (i = 0; i < map->n; ++i) {
2038 map->p[i] = isl_basic_map_add(map->p[i], type, n);
2049 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2050 enum isl_dim_type type, unsigned n)
2054 isl_assert(set->ctx, type != isl_dim_in, goto error);
2055 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2061 __isl_give isl_basic_map *isl_basic_map_move(__isl_take isl_basic_map *bmap,
2062 enum isl_dim_type dst_type, unsigned dst_pos,
2063 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2072 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2075 /* just the simple case for now */
2076 isl_assert(bmap->ctx,
2077 pos(bmap->dim, dst_type) + dst_pos ==
2078 pos(bmap->dim, src_type) + src_pos + ((src_type < dst_type) ? n : 0),
2081 if (dst_type == src_type)
2084 bmap = isl_basic_map_cow(bmap);
2088 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos, src_type, src_pos, n);
2094 isl_basic_map_free(bmap);
2098 __isl_give isl_set *isl_set_move(__isl_take isl_set *set,
2099 enum isl_dim_type dst_type, unsigned dst_pos,
2100 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2104 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2105 return (isl_set *)isl_map_move((isl_map *)set, dst_type, dst_pos,
2106 src_type, src_pos, n);
2112 __isl_give isl_map *isl_map_move(__isl_take isl_map *map,
2113 enum isl_dim_type dst_type, unsigned dst_pos,
2114 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2123 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2126 /* just the simple case for now */
2127 isl_assert(map->ctx,
2128 map_offset(map, dst_type) + dst_pos ==
2129 map_offset(map, src_type) + src_pos + ((src_type < dst_type) ? n : 0),
2132 if (dst_type == src_type)
2135 map = isl_map_cow(map);
2139 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2143 for (i = 0; i < map->n; ++i) {
2144 map->p[i] = isl_basic_map_move(map->p[i], dst_type, dst_pos,
2145 src_type, src_pos, n);
2156 /* Move the specified dimensions to the last columns right before
2157 * the divs. Don't change the dimension specification of bmap.
2158 * That's the responsibility of the caller.
2160 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2161 enum isl_dim_type type, unsigned first, unsigned n)
2163 struct isl_dim_map *dim_map;
2164 struct isl_basic_map *res;
2165 enum isl_dim_type t;
2166 unsigned total, off;
2170 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2173 total = isl_basic_map_total_dim(bmap);
2174 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2177 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2178 unsigned size = isl_dim_size(bmap->dim, t);
2180 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2183 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2184 first, n, total - bmap->n_div - n);
2185 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2186 first + n, size - (first + n), off);
2187 off += size - (first + n);
2189 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2193 isl_dim_map_div(dim_map, bmap, off + n);
2195 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2196 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2197 res = add_constraints_dim_map(res, bmap, dim_map);
2201 /* Turn the n dimensions of type type, starting at first
2202 * into existentially quantified variables.
2204 __isl_give isl_basic_map *isl_basic_map_project_out(
2205 __isl_take isl_basic_map *bmap,
2206 enum isl_dim_type type, unsigned first, unsigned n)
2219 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2220 return isl_basic_map_remove(bmap, type, first, n);
2222 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2225 bmap = move_last(bmap, type, first, n);
2226 bmap = isl_basic_map_cow(bmap);
2228 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2229 old = bmap->block2.data;
2230 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2231 (bmap->extra + n) * (1 + row_size));
2232 if (!bmap->block2.data)
2234 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2237 for (i = 0; i < n; ++i) {
2238 new_div[i] = bmap->block2.data +
2239 (bmap->extra + i) * (1 + row_size);
2240 isl_seq_clr(new_div[i], 1 + row_size);
2242 for (i = 0; i < bmap->extra; ++i)
2243 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2245 bmap->div = new_div;
2249 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2252 bmap = isl_basic_map_simplify(bmap);
2253 bmap = isl_basic_map_drop_redundant_divs(bmap);
2254 return isl_basic_map_finalize(bmap);
2256 isl_basic_map_free(bmap);
2260 /* Turn the n dimensions of type type, starting at first
2261 * into existentially quantified variables.
2263 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2264 enum isl_dim_type type, unsigned first, unsigned n)
2266 return (isl_basic_set *)isl_basic_map_project_out(
2267 (isl_basic_map *)bset, type, first, n);
2270 /* Turn the n dimensions of type type, starting at first
2271 * into existentially quantified variables.
2273 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2274 enum isl_dim_type type, unsigned first, unsigned n)
2284 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2286 map = isl_map_cow(map);
2290 map->dim = isl_dim_drop(map->dim, type, first, n);
2294 for (i = 0; i < map->n; ++i) {
2295 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2306 /* Turn the n dimensions of type type, starting at first
2307 * into existentially quantified variables.
2309 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2310 enum isl_dim_type type, unsigned first, unsigned n)
2312 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2315 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2319 for (i = 0; i < n; ++i) {
2320 j = isl_basic_map_alloc_div(bmap);
2323 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2327 isl_basic_map_free(bmap);
2331 struct isl_basic_map *isl_basic_map_apply_range(
2332 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2334 struct isl_dim *dim_result = NULL;
2335 struct isl_basic_map *bmap;
2336 unsigned n_in, n_out, n, nparam, total, pos;
2337 struct isl_dim_map *dim_map1, *dim_map2;
2339 if (!bmap1 || !bmap2)
2342 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2343 isl_dim_copy(bmap2->dim));
2345 n_in = isl_basic_map_n_in(bmap1);
2346 n_out = isl_basic_map_n_out(bmap2);
2347 n = isl_basic_map_n_out(bmap1);
2348 nparam = isl_basic_map_n_param(bmap1);
2350 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2351 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2352 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2353 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2354 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2355 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2356 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2357 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2358 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2359 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2360 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2362 bmap = isl_basic_map_alloc_dim(dim_result,
2363 bmap1->n_div + bmap2->n_div + n,
2364 bmap1->n_eq + bmap2->n_eq,
2365 bmap1->n_ineq + bmap2->n_ineq);
2366 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2367 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2368 bmap = add_divs(bmap, n);
2369 bmap = isl_basic_map_simplify(bmap);
2370 bmap = isl_basic_map_drop_redundant_divs(bmap);
2371 return isl_basic_map_finalize(bmap);
2373 isl_basic_map_free(bmap1);
2374 isl_basic_map_free(bmap2);
2378 struct isl_basic_set *isl_basic_set_apply(
2379 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2384 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2387 return (struct isl_basic_set *)
2388 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2390 isl_basic_set_free(bset);
2391 isl_basic_map_free(bmap);
2395 struct isl_basic_map *isl_basic_map_apply_domain(
2396 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2398 if (!bmap1 || !bmap2)
2401 isl_assert(bmap1->ctx,
2402 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2403 isl_assert(bmap1->ctx,
2404 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2407 bmap1 = isl_basic_map_reverse(bmap1);
2408 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2409 return isl_basic_map_reverse(bmap1);
2411 isl_basic_map_free(bmap1);
2412 isl_basic_map_free(bmap2);
2416 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2417 * A \cap B -> f(A) + f(B)
2419 struct isl_basic_map *isl_basic_map_sum(
2420 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2422 unsigned n_in, n_out, nparam, total, pos;
2423 struct isl_basic_map *bmap = NULL;
2424 struct isl_dim_map *dim_map1, *dim_map2;
2427 if (!bmap1 || !bmap2)
2430 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2433 nparam = isl_basic_map_n_param(bmap1);
2434 n_in = isl_basic_map_n_in(bmap1);
2435 n_out = isl_basic_map_n_out(bmap1);
2437 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2438 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2439 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2440 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2441 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2442 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2443 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2444 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2445 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2446 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2447 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2449 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2450 bmap1->n_div + bmap2->n_div + 2 * n_out,
2451 bmap1->n_eq + bmap2->n_eq + n_out,
2452 bmap1->n_ineq + bmap2->n_ineq);
2453 for (i = 0; i < n_out; ++i) {
2454 int j = isl_basic_map_alloc_equality(bmap);
2457 isl_seq_clr(bmap->eq[j], 1+total);
2458 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2459 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2460 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2462 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2463 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2464 bmap = add_divs(bmap, 2 * n_out);
2466 bmap = isl_basic_map_simplify(bmap);
2467 return isl_basic_map_finalize(bmap);
2469 isl_basic_map_free(bmap);
2470 isl_basic_map_free(bmap1);
2471 isl_basic_map_free(bmap2);
2475 /* Given two maps A -> f(A) and B -> g(B), construct a map
2476 * A \cap B -> f(A) + f(B)
2478 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2480 struct isl_map *result;
2486 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2488 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2489 map1->n * map2->n, 0);
2492 for (i = 0; i < map1->n; ++i)
2493 for (j = 0; j < map2->n; ++j) {
2494 struct isl_basic_map *part;
2495 part = isl_basic_map_sum(
2496 isl_basic_map_copy(map1->p[i]),
2497 isl_basic_map_copy(map2->p[j]));
2498 if (isl_basic_map_is_empty(part))
2499 isl_basic_map_free(part);
2501 result = isl_map_add_basic_map(result, part);
2514 /* Given a basic map A -> f(A), construct A -> -f(A).
2516 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2521 bmap = isl_basic_map_cow(bmap);
2525 n = isl_basic_map_dim(bmap, isl_dim_out);
2526 off = isl_basic_map_offset(bmap, isl_dim_out);
2527 for (i = 0; i < bmap->n_eq; ++i)
2528 for (j = 0; j < n; ++j)
2529 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2530 for (i = 0; i < bmap->n_ineq; ++i)
2531 for (j = 0; j < n; ++j)
2532 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2533 for (i = 0; i < bmap->n_div; ++i)
2534 for (j = 0; j < n; ++j)
2535 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2536 return isl_basic_map_finalize(bmap);
2539 /* Given a map A -> f(A), construct A -> -f(A).
2541 struct isl_map *isl_map_neg(struct isl_map *map)
2545 map = isl_map_cow(map);
2549 for (i = 0; i < map->n; ++i) {
2550 map->p[i] = isl_basic_map_neg(map->p[i]);
2561 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2562 * A -> floor(f(A)/d).
2564 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2567 unsigned n_in, n_out, nparam, total, pos;
2568 struct isl_basic_map *result = NULL;
2569 struct isl_dim_map *dim_map;
2575 nparam = isl_basic_map_n_param(bmap);
2576 n_in = isl_basic_map_n_in(bmap);
2577 n_out = isl_basic_map_n_out(bmap);
2579 total = nparam + n_in + n_out + bmap->n_div + n_out;
2580 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2581 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2582 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2583 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2584 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2586 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2587 bmap->n_div + n_out,
2588 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2589 result = add_constraints_dim_map(result, bmap, dim_map);
2590 result = add_divs(result, n_out);
2591 for (i = 0; i < n_out; ++i) {
2593 j = isl_basic_map_alloc_inequality(result);
2596 isl_seq_clr(result->ineq[j], 1+total);
2597 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2598 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2599 j = isl_basic_map_alloc_inequality(result);
2602 isl_seq_clr(result->ineq[j], 1+total);
2603 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2604 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2605 isl_int_sub_ui(result->ineq[j][0], d, 1);
2608 result = isl_basic_map_simplify(result);
2609 return isl_basic_map_finalize(result);
2611 isl_basic_map_free(result);
2615 /* Given a map A -> f(A) and an integer d, construct a map
2616 * A -> floor(f(A)/d).
2618 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2622 map = isl_map_cow(map);
2626 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2627 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2628 for (i = 0; i < map->n; ++i) {
2629 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2640 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2646 i = isl_basic_map_alloc_equality(bmap);
2649 nparam = isl_basic_map_n_param(bmap);
2650 n_in = isl_basic_map_n_in(bmap);
2651 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2652 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2653 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2654 return isl_basic_map_finalize(bmap);
2656 isl_basic_map_free(bmap);
2660 /* Add a constraints to "bmap" expressing i_pos < o_pos
2662 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2668 i = isl_basic_map_alloc_inequality(bmap);
2671 nparam = isl_basic_map_n_param(bmap);
2672 n_in = isl_basic_map_n_in(bmap);
2673 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2674 isl_int_set_si(bmap->ineq[i][0], -1);
2675 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2676 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2677 return isl_basic_map_finalize(bmap);
2679 isl_basic_map_free(bmap);
2683 /* Add a constraints to "bmap" expressing i_pos > o_pos
2685 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2691 i = isl_basic_map_alloc_inequality(bmap);
2694 nparam = isl_basic_map_n_param(bmap);
2695 n_in = isl_basic_map_n_in(bmap);
2696 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2697 isl_int_set_si(bmap->ineq[i][0], -1);
2698 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2699 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2700 return isl_basic_map_finalize(bmap);
2702 isl_basic_map_free(bmap);
2706 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2709 struct isl_basic_map *bmap;
2710 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2713 for (i = 0; i < n_equal && bmap; ++i)
2714 bmap = var_equal(bmap, i);
2715 return isl_basic_map_finalize(bmap);
2718 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos < o_pos
2720 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2723 struct isl_basic_map *bmap;
2724 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2727 for (i = 0; i < pos && bmap; ++i)
2728 bmap = var_equal(bmap, i);
2730 bmap = var_less(bmap, pos);
2731 return isl_basic_map_finalize(bmap);
2734 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2736 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2739 struct isl_basic_map *bmap;
2740 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2743 for (i = 0; i < pos && bmap; ++i)
2744 bmap = var_equal(bmap, i);
2746 bmap = var_more(bmap, pos);
2747 return isl_basic_map_finalize(bmap);
2750 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2752 struct isl_map *map;
2759 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2761 for (i = 0; i < dim; ++i)
2762 map = isl_map_add_basic_map(map,
2763 isl_basic_map_less_at(isl_dim_copy(dims), i));
2765 map = isl_map_add_basic_map(map,
2766 isl_basic_map_equal(isl_dim_copy(dims), dim));
2772 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2774 return map_lex_lte(isl_dim_map(set_dim), 0);
2777 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2779 return map_lex_lte(isl_dim_map(set_dim), 1);
2782 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
2784 struct isl_map *map;
2791 map = isl_map_alloc_dim(isl_dim_copy(dims), dim + equal, ISL_MAP_DISJOINT);
2793 for (i = 0; i < dim; ++i)
2794 map = isl_map_add_basic_map(map,
2795 isl_basic_map_more_at(isl_dim_copy(dims), i));
2797 map = isl_map_add_basic_map(map,
2798 isl_basic_map_equal(isl_dim_copy(dims), dim));
2804 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
2806 return map_lex_gte(isl_dim_map(set_dim), 0);
2809 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
2811 return map_lex_gte(isl_dim_map(set_dim), 1);
2814 struct isl_basic_map *isl_basic_map_from_basic_set(
2815 struct isl_basic_set *bset, struct isl_dim *dim)
2817 struct isl_basic_map *bmap;
2819 bset = isl_basic_set_cow(bset);
2823 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
2824 isl_dim_free(bset->dim);
2825 bmap = (struct isl_basic_map *) bset;
2827 return isl_basic_map_finalize(bmap);
2829 isl_basic_set_free(bset);
2834 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
2838 if (bmap->dim->n_in == 0)
2839 return (struct isl_basic_set *)bmap;
2840 bmap = isl_basic_map_cow(bmap);
2843 bmap->dim = isl_dim_cow(bmap->dim);
2846 bmap->dim->n_out += bmap->dim->n_in;
2847 bmap->dim->n_in = 0;
2848 bmap = isl_basic_map_finalize(bmap);
2849 return (struct isl_basic_set *)bmap;
2851 isl_basic_map_free(bmap);
2855 /* For a div d = floor(f/m), add the constraints
2858 * -(f-(n-1)) + m d >= 0
2860 * Note that the second constraint is the negation of
2864 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
2867 unsigned total = isl_basic_map_total_dim(bmap);
2868 unsigned div_pos = 1 + total - bmap->n_div + div;
2870 i = isl_basic_map_alloc_inequality(bmap);
2873 isl_seq_cpy(bmap->ineq[i], bmap->div[div]+1, 1+total);
2874 isl_int_neg(bmap->ineq[i][div_pos], bmap->div[div][0]);
2876 j = isl_basic_map_alloc_inequality(bmap);
2879 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
2880 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][div_pos]);
2881 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
2885 struct isl_basic_set *isl_basic_map_underlying_set(
2886 struct isl_basic_map *bmap)
2890 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
2891 return (struct isl_basic_set *)bmap;
2892 bmap = isl_basic_map_cow(bmap);
2895 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
2898 bmap->extra -= bmap->n_div;
2900 bmap = isl_basic_map_finalize(bmap);
2901 return (struct isl_basic_set *)bmap;
2906 __isl_give isl_basic_set *isl_basic_set_underlying_set(
2907 __isl_take isl_basic_set *bset)
2909 return isl_basic_map_underlying_set((isl_basic_map *)bset);
2912 struct isl_basic_map *isl_basic_map_overlying_set(
2913 struct isl_basic_set *bset, struct isl_basic_map *like)
2915 struct isl_basic_map *bmap;
2916 struct isl_ctx *ctx;
2923 isl_assert(ctx, bset->n_div == 0, goto error);
2924 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
2925 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
2927 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
2928 isl_basic_map_free(like);
2929 return (struct isl_basic_map *)bset;
2931 bset = isl_basic_set_cow(bset);
2934 total = bset->dim->n_out + bset->extra;
2935 bmap = (struct isl_basic_map *)bset;
2936 isl_dim_free(bmap->dim);
2937 bmap->dim = isl_dim_copy(like->dim);
2940 bmap->n_div = like->n_div;
2941 bmap->extra += like->n_div;
2944 ltotal = total - bmap->extra + like->extra;
2947 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
2948 bmap->extra * (1 + 1 + total));
2949 if (isl_blk_is_error(bmap->block2))
2951 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
2955 for (i = 0; i < bmap->extra; ++i)
2956 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
2957 for (i = 0; i < like->n_div; ++i) {
2958 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
2959 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
2961 bmap = isl_basic_map_extend_constraints(bmap,
2962 0, 2 * like->n_div);
2963 for (i = 0; i < like->n_div; ++i) {
2964 if (isl_int_is_zero(bmap->div[i][0]))
2966 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
2970 isl_basic_map_free(like);
2971 bmap = isl_basic_map_simplify(bmap);
2972 bmap = isl_basic_map_finalize(bmap);
2975 isl_basic_map_free(like);
2976 isl_basic_set_free(bset);
2980 struct isl_basic_set *isl_basic_set_from_underlying_set(
2981 struct isl_basic_set *bset, struct isl_basic_set *like)
2983 return (struct isl_basic_set *)
2984 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
2987 struct isl_set *isl_set_from_underlying_set(
2988 struct isl_set *set, struct isl_basic_set *like)
2994 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
2996 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
2997 isl_basic_set_free(like);
3000 set = isl_set_cow(set);
3003 for (i = 0; i < set->n; ++i) {
3004 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3005 isl_basic_set_copy(like));
3009 isl_dim_free(set->dim);
3010 set->dim = isl_dim_copy(like->dim);
3013 isl_basic_set_free(like);
3016 isl_basic_set_free(like);
3021 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3025 map = isl_map_cow(map);
3028 map->dim = isl_dim_cow(map->dim);
3032 for (i = 1; i < map->n; ++i)
3033 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3035 for (i = 0; i < map->n; ++i) {
3036 map->p[i] = (struct isl_basic_map *)
3037 isl_basic_map_underlying_set(map->p[i]);
3042 map->dim = isl_dim_underlying(map->dim, 0);
3044 isl_dim_free(map->dim);
3045 map->dim = isl_dim_copy(map->p[0]->dim);
3049 return (struct isl_set *)map;
3055 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3057 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3060 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3062 struct isl_basic_set *domain;
3067 n_in = isl_basic_map_n_in(bmap);
3068 n_out = isl_basic_map_n_out(bmap);
3069 domain = isl_basic_set_from_basic_map(bmap);
3070 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3073 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3075 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3078 struct isl_set *isl_map_range(struct isl_map *map)
3081 struct isl_set *set;
3085 map = isl_map_cow(map);
3089 set = (struct isl_set *) map;
3090 if (set->dim->n_in != 0) {
3091 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3095 for (i = 0; i < map->n; ++i) {
3096 set->p[i] = isl_basic_map_range(map->p[i]);
3100 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3101 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3108 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3111 struct isl_map *map = NULL;
3113 set = isl_set_cow(set);
3116 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3117 map = (struct isl_map *)set;
3118 for (i = 0; i < set->n; ++i) {
3119 map->p[i] = isl_basic_map_from_basic_set(
3120 set->p[i], isl_dim_copy(dim));
3124 isl_dim_free(map->dim);
3133 struct isl_map *isl_map_from_range(struct isl_set *set)
3135 return (struct isl_map *)set;
3138 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3140 return isl_map_reverse(isl_map_from_range(set));;
3143 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3144 __isl_take isl_set *range)
3146 return isl_map_product(isl_map_from_domain(domain),
3147 isl_map_from_range(range));
3150 struct isl_set *isl_set_from_map(struct isl_map *map)
3153 struct isl_set *set = NULL;
3157 map = isl_map_cow(map);
3160 map->dim = isl_dim_cow(map->dim);
3163 map->dim->n_out += map->dim->n_in;
3165 set = (struct isl_set *)map;
3166 for (i = 0; i < map->n; ++i) {
3167 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3177 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3179 struct isl_map *map;
3183 isl_assert(dim->ctx, n >= 0, return NULL);
3184 map = isl_alloc(dim->ctx, struct isl_map,
3185 sizeof(struct isl_map) +
3186 (n - 1) * sizeof(struct isl_basic_map *));
3190 map->ctx = dim->ctx;
3191 isl_ctx_ref(map->ctx);
3203 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3204 unsigned nparam, unsigned in, unsigned out, int n,
3207 struct isl_map *map;
3208 struct isl_dim *dims;
3210 dims = isl_dim_alloc(ctx, nparam, in, out);
3214 map = isl_map_alloc_dim(dims, n, flags);
3218 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3220 struct isl_basic_map *bmap;
3221 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3222 bmap = isl_basic_map_set_to_empty(bmap);
3226 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3228 struct isl_basic_set *bset;
3229 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3230 bset = isl_basic_set_set_to_empty(bset);
3234 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3236 struct isl_basic_map *bmap;
3239 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3240 bmap = isl_basic_map_set_to_empty(bmap);
3244 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3246 struct isl_basic_map *bmap;
3249 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3250 bmap = isl_basic_map_set_to_empty(bmap);
3254 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3256 struct isl_basic_set *bset;
3259 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3260 bset = isl_basic_set_set_to_empty(bset);
3264 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3266 struct isl_basic_map *bmap;
3267 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3271 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3273 struct isl_basic_set *bset;
3274 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3278 __isl_give isl_basic_map *isl_basic_map_universe_like(
3279 __isl_keep isl_basic_map *model)
3283 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3286 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3290 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3293 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3294 __isl_keep isl_set *model)
3298 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3301 struct isl_map *isl_map_empty(struct isl_dim *dim)
3303 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3306 struct isl_map *isl_map_empty_like(struct isl_map *model)
3310 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3313 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3317 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3320 struct isl_set *isl_set_empty(struct isl_dim *dim)
3322 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3325 struct isl_set *isl_set_empty_like(struct isl_set *model)
3329 return isl_set_empty(isl_dim_copy(model->dim));
3332 struct isl_map *isl_map_universe(struct isl_dim *dim)
3334 struct isl_map *map;
3337 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3338 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3342 struct isl_set *isl_set_universe(struct isl_dim *dim)
3344 struct isl_set *set;
3347 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3348 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3352 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3356 return isl_set_universe(isl_dim_copy(model->dim));
3359 struct isl_map *isl_map_dup(struct isl_map *map)
3362 struct isl_map *dup;
3366 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3367 for (i = 0; i < map->n; ++i)
3368 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3372 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3373 __isl_take isl_basic_map *bmap)
3377 if (isl_basic_map_fast_is_empty(bmap)) {
3378 isl_basic_map_free(bmap);
3381 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3382 isl_assert(map->ctx, map->n < map->size, goto error);
3383 map->p[map->n] = bmap;
3385 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3391 isl_basic_map_free(bmap);
3395 void isl_map_free(struct isl_map *map)
3405 isl_ctx_deref(map->ctx);
3406 for (i = 0; i < map->n; ++i)
3407 isl_basic_map_free(map->p[i]);
3408 isl_dim_free(map->dim);
3412 struct isl_map *isl_map_extend(struct isl_map *base,
3413 unsigned nparam, unsigned n_in, unsigned n_out)
3417 base = isl_map_cow(base);
3421 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3424 for (i = 0; i < base->n; ++i) {
3425 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3426 isl_dim_copy(base->dim), 0, 0, 0);
3436 struct isl_set *isl_set_extend(struct isl_set *base,
3437 unsigned nparam, unsigned dim)
3439 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3443 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3444 struct isl_basic_map *bmap, unsigned pos, int value)
3448 bmap = isl_basic_map_cow(bmap);
3449 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3450 j = isl_basic_map_alloc_equality(bmap);
3453 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3454 isl_int_set_si(bmap->eq[j][pos], -1);
3455 isl_int_set_si(bmap->eq[j][0], value);
3456 bmap = isl_basic_map_simplify(bmap);
3457 return isl_basic_map_finalize(bmap);
3459 isl_basic_map_free(bmap);
3463 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3464 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3468 bmap = isl_basic_map_cow(bmap);
3469 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3470 j = isl_basic_map_alloc_equality(bmap);
3473 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3474 isl_int_set_si(bmap->eq[j][pos], -1);
3475 isl_int_set(bmap->eq[j][0], value);
3476 bmap = isl_basic_map_simplify(bmap);
3477 return isl_basic_map_finalize(bmap);
3479 isl_basic_map_free(bmap);
3483 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3484 enum isl_dim_type type, unsigned pos, int value)
3488 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3489 return isl_basic_map_fix_pos_si(bmap,
3490 isl_basic_map_offset(bmap, type) + pos, value);
3492 isl_basic_map_free(bmap);
3496 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3497 enum isl_dim_type type, unsigned pos, isl_int value)
3501 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3502 return isl_basic_map_fix_pos(bmap,
3503 isl_basic_map_offset(bmap, type) + pos, value);
3505 isl_basic_map_free(bmap);
3509 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3510 enum isl_dim_type type, unsigned pos, int value)
3512 return (struct isl_basic_set *)
3513 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3517 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3518 enum isl_dim_type type, unsigned pos, isl_int value)
3520 return (struct isl_basic_set *)
3521 isl_basic_map_fix((struct isl_basic_map *)bset,
3525 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3526 unsigned input, int value)
3528 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3531 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3532 unsigned dim, int value)
3534 return (struct isl_basic_set *)
3535 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3536 isl_dim_set, dim, value);
3539 struct isl_map *isl_map_fix_si(struct isl_map *map,
3540 enum isl_dim_type type, unsigned pos, int value)
3544 map = isl_map_cow(map);
3548 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3549 for (i = 0; i < map->n; ++i) {
3550 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3554 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3561 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3562 enum isl_dim_type type, unsigned pos, int value)
3564 return (struct isl_set *)
3565 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3568 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3569 enum isl_dim_type type, unsigned pos, isl_int value)
3573 map = isl_map_cow(map);
3577 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3578 for (i = 0; i < map->n; ++i) {
3579 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3583 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3590 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3591 enum isl_dim_type type, unsigned pos, isl_int value)
3593 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3596 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3597 unsigned input, int value)
3599 return isl_map_fix_si(map, isl_dim_in, input, value);
3602 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3604 return (struct isl_set *)
3605 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3608 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3609 __isl_take isl_basic_map *bmap,
3610 enum isl_dim_type type, unsigned pos, int value)
3616 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3617 pos += isl_basic_map_offset(bmap, type);
3618 bmap = isl_basic_map_cow(bmap);
3619 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3620 j = isl_basic_map_alloc_inequality(bmap);
3623 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3624 isl_int_set_si(bmap->ineq[j][pos], 1);
3625 isl_int_set_si(bmap->ineq[j][0], -value);
3626 bmap = isl_basic_map_simplify(bmap);
3627 return isl_basic_map_finalize(bmap);
3629 isl_basic_map_free(bmap);
3633 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3634 unsigned dim, isl_int value)
3638 bset = isl_basic_set_cow(bset);
3639 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3640 j = isl_basic_set_alloc_inequality(bset);
3643 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3644 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3645 isl_int_neg(bset->ineq[j][0], value);
3646 bset = isl_basic_set_simplify(bset);
3647 return isl_basic_set_finalize(bset);
3649 isl_basic_set_free(bset);
3653 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3654 enum isl_dim_type type, unsigned pos, int value)
3658 map = isl_map_cow(map);
3662 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3663 for (i = 0; i < map->n; ++i) {
3664 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3669 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3676 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3677 enum isl_dim_type type, unsigned pos, int value)
3679 return (struct isl_set *)
3680 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3683 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3688 set = isl_set_cow(set);
3692 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3693 for (i = 0; i < set->n; ++i) {
3694 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3704 struct isl_map *isl_map_reverse(struct isl_map *map)
3708 map = isl_map_cow(map);
3712 map->dim = isl_dim_reverse(map->dim);
3715 for (i = 0; i < map->n; ++i) {
3716 map->p[i] = isl_basic_map_reverse(map->p[i]);
3720 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3727 static struct isl_map *isl_basic_map_partial_lexopt(
3728 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3729 struct isl_set **empty, int max)
3733 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3734 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3736 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3738 isl_basic_map_free(bmap);
3739 isl_basic_set_free(dom);
3745 struct isl_map *isl_basic_map_partial_lexmax(
3746 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3747 struct isl_set **empty)
3749 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
3752 struct isl_map *isl_basic_map_partial_lexmin(
3753 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3754 struct isl_set **empty)
3756 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
3759 struct isl_set *isl_basic_set_partial_lexmin(
3760 struct isl_basic_set *bset, struct isl_basic_set *dom,
3761 struct isl_set **empty)
3763 return (struct isl_set *)
3764 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
3768 struct isl_set *isl_basic_set_partial_lexmax(
3769 struct isl_basic_set *bset, struct isl_basic_set *dom,
3770 struct isl_set **empty)
3772 return (struct isl_set *)
3773 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
3777 /* Given a basic map "bmap", compute the lexicograhically minimal
3778 * (or maximal) image element for each domain element in dom.
3779 * Set *empty to those elements in dom that do not have an image element.
3781 * We first make sure the basic sets in dom are disjoint and then
3782 * simply collect the results over each of the basic sets separately.
3783 * We could probably improve the efficiency a bit by moving the union
3784 * domain down into the parametric integer programming.
3786 static __isl_give isl_map *basic_map_partial_lexopt(
3787 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
3788 __isl_give isl_set **empty, int max)
3791 struct isl_map *res;
3793 dom = isl_set_make_disjoint(dom);
3797 if (isl_set_fast_is_empty(dom)) {
3798 res = isl_map_empty_like_basic_map(bmap);
3799 *empty = isl_set_empty_like(dom);
3801 isl_basic_map_free(bmap);
3805 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3806 isl_basic_set_copy(dom->p[0]), empty, max);
3808 for (i = 1; i < dom->n; ++i) {
3809 struct isl_map *res_i;
3810 struct isl_set *empty_i;
3812 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
3813 isl_basic_set_copy(dom->p[i]), &empty_i, max);
3815 res = isl_map_union_disjoint(res, res_i);
3816 *empty = isl_set_union_disjoint(*empty, empty_i);
3820 isl_basic_map_free(bmap);
3825 isl_basic_map_free(bmap);
3829 /* Given a map "map", compute the lexicograhically minimal
3830 * (or maximal) image element for each domain element in dom.
3831 * Set *empty to those elements in dom that do not have an image element.
3833 * We first compute the lexicographically minimal or maximal element
3834 * in the first basic map. This results in a partial solution "res"
3835 * and a subset "todo" of dom that still need to be handled.
3836 * We then consider each of the remaining maps in "map" and successively
3837 * improve both "res" and "todo".
3839 * Let res^k and todo^k be the results after k steps and let i = k + 1.
3840 * Assume we are computing the lexicographical maximum.
3841 * We first intersect basic map i with a relation that maps elements
3842 * to elements that are lexicographically larger than the image elements
3843 * in res^k and the compute the maximum image element of this intersection.
3844 * The result ("better") corresponds to those image elements in basic map i
3845 * that are better than what we had before. The remainder ("keep") are the
3846 * domain elements for which the image element in res_k was better.
3847 * We also compute the lexicographical maximum of basic map i in todo^k.
3848 * res^i is the result of the operation + better + those elements in
3849 * res^k that we should keep
3850 * todo^i is the remainder of the maximum operation on todo^k.
3852 static __isl_give isl_map *isl_map_partial_lexopt(
3853 __isl_take isl_map *map, __isl_take isl_set *dom,
3854 __isl_give isl_set **empty, int max)
3857 struct isl_map *res;
3858 struct isl_set *todo;
3863 if (isl_map_fast_is_empty(map)) {
3871 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
3872 isl_set_copy(dom), &todo, max);
3874 for (i = 1; i < map->n; ++i) {
3876 struct isl_map *better;
3877 struct isl_set *keep;
3878 struct isl_map *res_i;
3879 struct isl_set *todo_i;
3880 struct isl_dim *dim = isl_map_get_dim(res);
3882 dim = isl_dim_range(dim);
3884 lt = isl_map_lex_lt(dim);
3886 lt = isl_map_lex_gt(dim);
3887 lt = isl_map_apply_range(isl_map_copy(res), lt);
3888 lt = isl_map_intersect(lt,
3889 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
3890 better = isl_map_partial_lexopt(lt,
3891 isl_map_domain(isl_map_copy(res)),
3894 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
3895 todo, &todo_i, max);
3897 res = isl_map_intersect_domain(res, keep);
3898 res = isl_map_union_disjoint(res, res_i);
3899 res = isl_map_union_disjoint(res, better);
3920 __isl_give isl_map *isl_map_partial_lexmax(
3921 __isl_take isl_map *map, __isl_take isl_set *dom,
3922 __isl_give isl_set **empty)
3924 return isl_map_partial_lexopt(map, dom, empty, 1);
3927 __isl_give isl_map *isl_map_partial_lexmin(
3928 __isl_take isl_map *map, __isl_take isl_set *dom,
3929 __isl_give isl_set **empty)
3931 return isl_map_partial_lexopt(map, dom, empty, 0);
3934 __isl_give isl_set *isl_set_partial_lexmin(
3935 __isl_take isl_set *set, __isl_take isl_set *dom,
3936 __isl_give isl_set **empty)
3938 return (struct isl_set *)
3939 isl_map_partial_lexmin((struct isl_map *)set,
3943 __isl_give isl_set *isl_set_partial_lexmax(
3944 __isl_take isl_set *set, __isl_take isl_set *dom,
3945 __isl_give isl_set **empty)
3947 return (struct isl_set *)
3948 isl_map_partial_lexmax((struct isl_map *)set,
3952 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
3954 struct isl_basic_set *dom = NULL;
3955 struct isl_dim *dom_dim;
3959 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
3960 dom = isl_basic_set_universe(dom_dim);
3961 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
3963 isl_basic_map_free(bmap);
3967 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
3969 return isl_basic_map_lexopt(bmap, 0);
3972 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
3974 return isl_basic_map_lexopt(bmap, 1);
3977 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
3979 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
3982 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
3984 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
3987 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
3989 struct isl_set *dom = NULL;
3990 struct isl_dim *dom_dim;
3994 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
3995 dom = isl_set_universe(dom_dim);
3996 return isl_map_partial_lexopt(map, dom, NULL, max);
4002 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4004 return isl_map_lexopt(map, 0);
4007 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4009 return isl_map_lexopt(map, 1);
4012 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4014 return (isl_set *)isl_map_lexmin((isl_map *)set);
4017 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4019 return (isl_set *)isl_map_lexmax((isl_map *)set);
4022 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4023 struct isl_dim *dim)
4030 for (i = 0; i < map->n; ++i) {
4031 isl_dim_free(map->p[i]->dim);
4032 map->p[i]->dim = isl_dim_copy(dim);
4034 isl_dim_free(map->dim);
4044 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4045 struct isl_dim *dim)
4047 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4050 /* Apply a preimage specified by "mat" on the parameters of "bset".
4051 * bset is assumed to have only parameters and divs.
4053 static struct isl_basic_set *basic_set_parameter_preimage(
4054 struct isl_basic_set *bset, struct isl_mat *mat)
4061 bset->dim = isl_dim_cow(bset->dim);
4065 nparam = isl_basic_set_dim(bset, isl_dim_param);
4067 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4069 bset->dim->nparam = 0;
4070 bset->dim->n_out = nparam;
4071 bset = isl_basic_set_preimage(bset, mat);
4073 bset->dim->nparam = bset->dim->n_out;
4074 bset->dim->n_out = 0;
4079 isl_basic_set_free(bset);
4083 /* Apply a preimage specified by "mat" on the parameters of "set".
4084 * set is assumed to have only parameters and divs.
4086 static struct isl_set *set_parameter_preimage(
4087 struct isl_set *set, struct isl_mat *mat)
4089 struct isl_dim *dim = NULL;
4095 dim = isl_dim_copy(set->dim);
4096 dim = isl_dim_cow(dim);
4100 nparam = isl_set_dim(set, isl_dim_param);
4102 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4105 dim->n_out = nparam;
4106 isl_set_reset_dim(set, dim);
4107 set = isl_set_preimage(set, mat);
4110 dim = isl_dim_copy(set->dim);
4111 dim = isl_dim_cow(dim);
4114 dim->nparam = dim->n_out;
4116 isl_set_reset_dim(set, dim);
4126 /* Intersect the basic set "bset" with the affine space specified by the
4127 * equalities in "eq".
4129 static struct isl_basic_set *basic_set_append_equalities(
4130 struct isl_basic_set *bset, struct isl_mat *eq)
4138 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4143 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4144 for (i = 0; i < eq->n_row; ++i) {
4145 k = isl_basic_set_alloc_equality(bset);
4148 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4149 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4156 isl_basic_set_free(bset);
4160 /* Intersect the set "set" with the affine space specified by the
4161 * equalities in "eq".
4163 static struct isl_set *set_append_equalities(struct isl_set *set,
4171 for (i = 0; i < set->n; ++i) {
4172 set->p[i] = basic_set_append_equalities(set->p[i],
4185 /* Project the given basic set onto its parameter domain, possibly introducing
4186 * new, explicit, existential variables in the constraints.
4187 * The input has parameters and (possibly implicit) existential variables.
4188 * The output has the same parameters, but only
4189 * explicit existentially quantified variables.
4191 * The actual projection is performed by pip, but pip doesn't seem
4192 * to like equalities very much, so we first remove the equalities
4193 * among the parameters by performing a variable compression on
4194 * the parameters. Afterward, an inverse transformation is performed
4195 * and the equalities among the parameters are inserted back in.
4197 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4201 struct isl_mat *T, *T2;
4202 struct isl_set *set;
4203 unsigned nparam, n_div;
4205 bset = isl_basic_set_cow(bset);
4209 if (bset->n_eq == 0)
4210 return isl_basic_set_lexmin(bset);
4212 isl_basic_set_gauss(bset, NULL);
4214 nparam = isl_basic_set_dim(bset, isl_dim_param);
4215 n_div = isl_basic_set_dim(bset, isl_dim_div);
4217 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4218 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4221 if (i == bset->n_eq)
4222 return isl_basic_set_lexmin(bset);
4224 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4226 eq = isl_mat_cow(eq);
4227 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4228 bset = basic_set_parameter_preimage(bset, T);
4230 set = isl_basic_set_lexmin(bset);
4231 set = set_parameter_preimage(set, T2);
4232 set = set_append_equalities(set, eq);
4236 /* Compute an explicit representation for all the existentially
4237 * quantified variables.
4238 * The input and output dimensions are first turned into parameters.
4239 * compute_divs then returns a map with the same parameters and
4240 * no input or output dimensions and the dimension specification
4241 * is reset to that of the input.
4243 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4245 struct isl_basic_set *bset;
4246 struct isl_set *set;
4247 struct isl_map *map;
4248 struct isl_dim *dim, *orig_dim = NULL;
4253 bmap = isl_basic_map_cow(bmap);
4257 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4258 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4259 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4260 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4264 orig_dim = bmap->dim;
4266 bset = (struct isl_basic_set *)bmap;
4268 set = parameter_compute_divs(bset);
4269 map = (struct isl_map *)set;
4270 map = isl_map_reset_dim(map, orig_dim);
4274 isl_basic_map_free(bmap);
4278 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4286 off = isl_dim_total(bmap->dim);
4287 for (i = 0; i < bmap->n_div; ++i) {
4288 if (isl_int_is_zero(bmap->div[i][0]))
4290 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4296 static int map_divs_known(__isl_keep isl_map *map)
4303 for (i = 0; i < map->n; ++i) {
4304 int known = basic_map_divs_known(map->p[i]);
4312 /* If bmap contains any unknown divs, then compute explicit
4313 * expressions for them. However, this computation may be
4314 * quite expensive, so first try to remove divs that aren't
4317 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4321 struct isl_map *map;
4323 known = basic_map_divs_known(bmap);
4327 return isl_map_from_basic_map(bmap);
4329 bmap = isl_basic_map_drop_redundant_divs(bmap);
4331 known = basic_map_divs_known(bmap);
4335 return isl_map_from_basic_map(bmap);
4337 map = compute_divs(bmap);
4340 isl_basic_map_free(bmap);
4344 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4348 struct isl_map *res;
4355 known = map_divs_known(map);
4363 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4364 for (i = 1 ; i < map->n; ++i) {
4366 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4367 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4368 res = isl_map_union_disjoint(res, r2);
4370 res = isl_map_union(res, r2);
4377 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4379 return (struct isl_set *)
4380 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4383 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4385 return (struct isl_set *)
4386 isl_map_compute_divs((struct isl_map *)set);
4389 struct isl_set *isl_map_domain(struct isl_map *map)
4392 struct isl_set *set;
4397 map = isl_map_cow(map);
4401 set = (struct isl_set *)map;
4402 set->dim = isl_dim_domain(set->dim);
4405 for (i = 0; i < map->n; ++i) {
4406 set->p[i] = isl_basic_map_domain(map->p[i]);
4410 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4411 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4418 struct isl_map *isl_map_union_disjoint(
4419 struct isl_map *map1, struct isl_map *map2)
4423 struct isl_map *map = NULL;
4437 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4439 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4440 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4441 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4443 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4444 map1->n + map2->n, flags);
4447 for (i = 0; i < map1->n; ++i) {
4448 map = isl_map_add_basic_map(map,
4449 isl_basic_map_copy(map1->p[i]));
4453 for (i = 0; i < map2->n; ++i) {
4454 map = isl_map_add_basic_map(map,
4455 isl_basic_map_copy(map2->p[i]));
4469 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4471 map1 = isl_map_union_disjoint(map1, map2);
4475 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4479 struct isl_set *isl_set_union_disjoint(
4480 struct isl_set *set1, struct isl_set *set2)
4482 return (struct isl_set *)
4483 isl_map_union_disjoint(
4484 (struct isl_map *)set1, (struct isl_map *)set2);
4487 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4489 return (struct isl_set *)
4490 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4493 struct isl_map *isl_map_intersect_range(
4494 struct isl_map *map, struct isl_set *set)
4497 struct isl_map *result;
4503 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4504 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4505 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4507 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4508 map->n * set->n, flags);
4511 for (i = 0; i < map->n; ++i)
4512 for (j = 0; j < set->n; ++j) {
4513 result = isl_map_add_basic_map(result,
4514 isl_basic_map_intersect_range(
4515 isl_basic_map_copy(map->p[i]),
4516 isl_basic_set_copy(set->p[j])));
4529 struct isl_map *isl_map_intersect_domain(
4530 struct isl_map *map, struct isl_set *set)
4532 return isl_map_reverse(
4533 isl_map_intersect_range(isl_map_reverse(map), set));
4536 struct isl_map *isl_map_apply_domain(
4537 struct isl_map *map1, struct isl_map *map2)
4541 map1 = isl_map_reverse(map1);
4542 map1 = isl_map_apply_range(map1, map2);
4543 return isl_map_reverse(map1);
4550 struct isl_map *isl_map_apply_range(
4551 struct isl_map *map1, struct isl_map *map2)
4553 struct isl_dim *dim_result;
4554 struct isl_map *result;
4560 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4561 isl_dim_copy(map2->dim));
4563 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4566 for (i = 0; i < map1->n; ++i)
4567 for (j = 0; j < map2->n; ++j) {
4568 result = isl_map_add_basic_map(result,
4569 isl_basic_map_apply_range(
4570 isl_basic_map_copy(map1->p[i]),
4571 isl_basic_map_copy(map2->p[j])));
4577 if (result && result->n <= 1)
4578 ISL_F_SET(result, ISL_MAP_DISJOINT);
4587 * returns range - domain
4589 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4591 struct isl_basic_set *bset;
4598 dim = isl_basic_map_n_in(bmap);
4599 nparam = isl_basic_map_n_param(bmap);
4600 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4601 bset = isl_basic_set_from_basic_map(bmap);
4602 bset = isl_basic_set_cow(bset);
4603 bset = isl_basic_set_extend(bset, nparam, 3*dim, 0, dim, 0);
4604 bset = isl_basic_set_swap_vars(bset, 2*dim);
4605 for (i = 0; i < dim; ++i) {
4606 int j = isl_basic_map_alloc_equality(
4607 (struct isl_basic_map *)bset);
4610 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4611 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4612 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4613 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4615 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4617 isl_basic_map_free(bmap);
4622 * returns range - domain
4624 struct isl_set *isl_map_deltas(struct isl_map *map)
4627 struct isl_set *result;
4632 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4633 result = isl_set_alloc(map->ctx, isl_map_n_param(map),
4634 isl_map_n_in(map), map->n, map->flags);
4637 for (i = 0; i < map->n; ++i)
4638 result = isl_set_add_basic_set(result,
4639 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4647 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4649 struct isl_basic_map *bmap;
4657 nparam = dims->nparam;
4659 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4663 for (i = 0; i < dim; ++i) {
4664 int j = isl_basic_map_alloc_equality(bmap);
4667 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4668 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4669 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4671 return isl_basic_map_finalize(bmap);
4673 isl_basic_map_free(bmap);
4677 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4679 struct isl_dim *dim = isl_dim_map(set_dim);
4682 return basic_map_identity(dim);
4685 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4687 if (!model || !model->dim)
4689 isl_assert(model->ctx,
4690 model->dim->n_in == model->dim->n_out, return NULL);
4691 return basic_map_identity(isl_dim_copy(model->dim));
4694 static struct isl_map *map_identity(struct isl_dim *dim)
4696 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4697 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4700 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4702 struct isl_dim *dim = isl_dim_map(set_dim);
4705 return map_identity(dim);
4708 struct isl_map *isl_map_identity_like(struct isl_map *model)
4710 if (!model || !model->dim)
4712 isl_assert(model->ctx,
4713 model->dim->n_in == model->dim->n_out, return NULL);
4714 return map_identity(isl_dim_copy(model->dim));
4717 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4719 if (!model || !model->dim)
4721 isl_assert(model->ctx,
4722 model->dim->n_in == model->dim->n_out, return NULL);
4723 return map_identity(isl_dim_copy(model->dim));
4726 /* Construct a basic set with all set dimensions having only non-negative
4729 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
4734 struct isl_basic_set *bset;
4738 nparam = dims->nparam;
4740 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
4743 for (i = 0; i < dim; ++i) {
4744 int k = isl_basic_set_alloc_inequality(bset);
4747 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
4748 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
4752 isl_basic_set_free(bset);
4756 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
4758 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
4761 int isl_basic_map_is_subset(
4762 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4765 struct isl_map *map1;
4766 struct isl_map *map2;
4768 if (!bmap1 || !bmap2)
4771 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
4772 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
4774 is_subset = isl_map_is_subset(map1, map2);
4782 int isl_basic_map_is_equal(
4783 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4787 if (!bmap1 || !bmap2)
4789 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4792 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4796 int isl_basic_set_is_equal(
4797 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
4799 return isl_basic_map_is_equal(
4800 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
4803 int isl_map_is_empty(struct isl_map *map)
4810 for (i = 0; i < map->n; ++i) {
4811 is_empty = isl_basic_map_is_empty(map->p[i]);
4820 int isl_map_fast_is_empty(struct isl_map *map)
4825 int isl_set_fast_is_empty(struct isl_set *set)
4830 int isl_set_is_empty(struct isl_set *set)
4832 return isl_map_is_empty((struct isl_map *)set);
4835 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
4841 is_subset = isl_map_is_subset(map1, map2);
4844 is_subset = isl_map_is_subset(map2, map1);
4848 int isl_basic_map_is_strict_subset(
4849 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4853 if (!bmap1 || !bmap2)
4855 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
4858 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
4859 if (is_subset == -1)
4864 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
4870 is_subset = isl_map_is_subset(map1, map2);
4873 is_subset = isl_map_is_subset(map2, map1);
4874 if (is_subset == -1)
4879 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
4881 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
4884 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
4888 return bmap->n_eq == 0 && bmap->n_ineq == 0;
4891 int isl_basic_set_is_universe(struct isl_basic_set *bset)
4895 return bset->n_eq == 0 && bset->n_ineq == 0;
4898 int isl_map_fast_is_universe(__isl_keep isl_map *map)
4903 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
4906 int isl_set_fast_is_universe(__isl_keep isl_set *set)
4908 return isl_map_fast_is_universe((isl_map *) set);
4911 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
4913 struct isl_basic_set *bset = NULL;
4914 struct isl_vec *sample = NULL;
4921 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
4924 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
4925 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
4926 copy = isl_basic_map_convex_hull(copy);
4927 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
4928 isl_basic_map_free(copy);
4932 total = 1 + isl_basic_map_total_dim(bmap);
4933 if (bmap->sample && bmap->sample->size == total) {
4934 int contains = isl_basic_map_contains(bmap, bmap->sample);
4940 isl_vec_free(bmap->sample);
4941 bmap->sample = NULL;
4942 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
4945 sample = isl_basic_set_sample_vec(bset);
4948 empty = sample->size == 0;
4949 isl_vec_free(bmap->sample);
4950 bmap->sample = sample;
4952 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
4957 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
4961 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
4964 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
4968 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
4971 int isl_basic_set_is_empty(struct isl_basic_set *bset)
4973 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
4976 struct isl_map *isl_basic_map_union(
4977 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
4979 struct isl_map *map;
4980 if (!bmap1 || !bmap2)
4983 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
4985 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
4988 map = isl_map_add_basic_map(map, bmap1);
4989 map = isl_map_add_basic_map(map, bmap2);
4992 isl_basic_map_free(bmap1);
4993 isl_basic_map_free(bmap2);
4997 struct isl_set *isl_basic_set_union(
4998 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5000 return (struct isl_set *)isl_basic_map_union(
5001 (struct isl_basic_map *)bset1,
5002 (struct isl_basic_map *)bset2);
5005 /* Order divs such that any div only depends on previous divs */
5006 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5009 unsigned off = isl_dim_total(bmap->dim);
5011 for (i = 0; i < bmap->n_div; ++i) {
5013 if (isl_int_is_zero(bmap->div[i][0]))
5015 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5019 isl_basic_map_swap_div(bmap, i, i + pos);
5025 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5027 return (struct isl_basic_set *)
5028 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5031 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5038 for (i = 0; i < map->n; ++i) {
5039 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5050 /* Look for a div in dst that corresponds to the div "div" in src.
5051 * The divs before "div" in src and dst are assumed to be the same.
5053 * Returns -1 if no corresponding div was found and the position
5054 * of the corresponding div in dst otherwise.
5056 static int find_div(struct isl_basic_map *dst,
5057 struct isl_basic_map *src, unsigned div)
5061 unsigned total = isl_dim_total(src->dim);
5063 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5064 for (i = div; i < dst->n_div; ++i)
5065 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5066 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5067 dst->n_div - div) == -1)
5072 struct isl_basic_map *isl_basic_map_align_divs(
5073 struct isl_basic_map *dst, struct isl_basic_map *src)
5076 unsigned total = isl_dim_total(src->dim);
5081 if (src->n_div == 0)
5084 for (i = 0; i < src->n_div; ++i)
5085 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5087 src = isl_basic_map_order_divs(src);
5088 dst = isl_basic_map_cow(dst);
5089 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5090 src->n_div, 0, 2 * src->n_div);
5093 for (i = 0; i < src->n_div; ++i) {
5094 int j = find_div(dst, src, i);
5096 j = isl_basic_map_alloc_div(dst);
5099 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5100 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5101 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5105 isl_basic_map_swap_div(dst, i, j);
5109 isl_basic_map_free(dst);
5113 struct isl_basic_set *isl_basic_set_align_divs(
5114 struct isl_basic_set *dst, struct isl_basic_set *src)
5116 return (struct isl_basic_set *)isl_basic_map_align_divs(
5117 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5120 struct isl_map *isl_map_align_divs(struct isl_map *map)
5128 map = isl_map_compute_divs(map);
5129 map = isl_map_cow(map);
5133 for (i = 1; i < map->n; ++i)
5134 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5135 for (i = 1; i < map->n; ++i)
5136 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5138 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5142 struct isl_set *isl_set_align_divs(struct isl_set *set)
5144 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5147 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5151 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5152 map = isl_map_intersect_domain(map, set);
5153 set = isl_map_range(map);
5161 /* There is no need to cow as removing empty parts doesn't change
5162 * the meaning of the set.
5164 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5171 for (i = map->n-1; i >= 0; --i) {
5172 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5174 isl_basic_map_free(map->p[i]);
5175 if (i != map->n-1) {
5176 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5177 map->p[i] = map->p[map->n-1];
5185 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5187 return (struct isl_set *)
5188 isl_map_remove_empty_parts((struct isl_map *)set);
5191 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5193 struct isl_basic_map *bmap;
5194 if (!map || map->n == 0)
5196 bmap = map->p[map->n-1];
5197 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5198 return isl_basic_map_copy(bmap);
5201 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5203 return (struct isl_basic_set *)
5204 isl_map_copy_basic_map((struct isl_map *)set);
5207 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5208 __isl_keep isl_basic_map *bmap)
5214 for (i = map->n-1; i >= 0; --i) {
5215 if (map->p[i] != bmap)
5217 map = isl_map_cow(map);
5220 isl_basic_map_free(map->p[i]);
5221 if (i != map->n-1) {
5222 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5223 map->p[i] = map->p[map->n-1];
5234 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5235 struct isl_basic_set *bset)
5237 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5238 (struct isl_basic_map *)bset);
5241 /* Given two basic sets bset1 and bset2, compute the maximal difference
5242 * between the values of dimension pos in bset1 and those in bset2
5243 * for any common value of the parameters and dimensions preceding pos.
5245 static enum isl_lp_result basic_set_maximal_difference_at(
5246 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5247 int pos, isl_int *opt)
5249 struct isl_dim *dims;
5250 struct isl_basic_map *bmap1 = NULL;
5251 struct isl_basic_map *bmap2 = NULL;
5252 struct isl_ctx *ctx;
5253 struct isl_vec *obj;
5256 unsigned dim1, dim2;
5257 enum isl_lp_result res;
5259 if (!bset1 || !bset2)
5260 return isl_lp_error;
5262 nparam = isl_basic_set_n_param(bset1);
5263 dim1 = isl_basic_set_n_dim(bset1);
5264 dim2 = isl_basic_set_n_dim(bset2);
5265 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5266 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5267 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5268 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5269 if (!bmap1 || !bmap2)
5271 bmap1 = isl_basic_map_cow(bmap1);
5272 bmap1 = isl_basic_map_extend(bmap1, nparam,
5273 pos, (dim1 - pos) + (dim2 - pos),
5274 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5275 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5278 total = isl_basic_map_total_dim(bmap1);
5280 obj = isl_vec_alloc(ctx, 1 + total);
5281 isl_seq_clr(obj->block.data, 1 + total);
5282 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5283 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5286 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5288 isl_basic_map_free(bmap1);
5292 isl_basic_map_free(bmap1);
5293 isl_basic_map_free(bmap2);
5294 return isl_lp_error;
5297 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5298 * for any common value of the parameters and dimensions preceding pos
5299 * in both basic sets, the values of dimension pos in bset1 are
5300 * smaller or larger than those in bset2.
5303 * 1 if bset1 follows bset2
5304 * -1 if bset1 precedes bset2
5305 * 0 if bset1 and bset2 are incomparable
5306 * -2 if some error occurred.
5308 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5309 struct isl_basic_set *bset2, int pos)
5312 enum isl_lp_result res;
5317 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5319 if (res == isl_lp_empty)
5321 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5322 res == isl_lp_unbounded)
5324 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5333 /* Given two basic sets bset1 and bset2, check whether
5334 * for any common value of the parameters and dimensions preceding pos
5335 * there is a value of dimension pos in bset1 that is larger
5336 * than a value of the same dimension in bset2.
5339 * 1 if there exists such a pair
5340 * 0 if there is no such pair, but there is a pair of equal values
5342 * -2 if some error occurred.
5344 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5345 __isl_keep isl_basic_set *bset2, int pos)
5348 enum isl_lp_result res;
5353 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5355 if (res == isl_lp_empty)
5357 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5358 res == isl_lp_unbounded)
5360 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5362 else if (res == isl_lp_ok)
5371 /* Given two sets set1 and set2, check whether
5372 * for any common value of the parameters and dimensions preceding pos
5373 * there is a value of dimension pos in set1 that is larger
5374 * than a value of the same dimension in set2.
5377 * 1 if there exists such a pair
5378 * 0 if there is no such pair, but there is a pair of equal values
5380 * -2 if some error occurred.
5382 int isl_set_follows_at(__isl_keep isl_set *set1,
5383 __isl_keep isl_set *set2, int pos)
5391 for (i = 0; i < set1->n; ++i)
5392 for (j = 0; j < set2->n; ++j) {
5394 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5395 if (f == 1 || f == -2)
5404 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5405 unsigned pos, isl_int *val)
5413 total = isl_basic_map_total_dim(bmap);
5414 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5415 for (; d+1 > pos; --d)
5416 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5420 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5422 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5424 if (!isl_int_is_one(bmap->eq[i][1+d]))
5427 isl_int_neg(*val, bmap->eq[i][0]);
5433 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5434 unsigned pos, isl_int *val)
5446 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5449 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5450 for (i = 1; fixed == 1 && i < map->n; ++i) {
5451 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5452 if (fixed == 1 && isl_int_ne(tmp, v))
5456 isl_int_set(*val, v);
5462 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5463 unsigned pos, isl_int *val)
5465 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5469 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5472 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5475 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5476 enum isl_dim_type type, unsigned pos, isl_int *val)
5478 if (pos >= isl_basic_map_dim(bmap, type))
5480 return isl_basic_map_fast_has_fixed_var(bmap,
5481 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5484 int isl_map_fast_is_fixed(struct isl_map *map,
5485 enum isl_dim_type type, unsigned pos, isl_int *val)
5487 if (pos >= isl_map_dim(map, type))
5489 return isl_map_fast_has_fixed_var(map,
5490 map_offset(map, type) - 1 + pos, val);
5493 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5494 * then return this fixed value in *val.
5496 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5499 return isl_basic_set_fast_has_fixed_var(bset,
5500 isl_basic_set_n_param(bset) + dim, val);
5503 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5504 * then return this fixed value in *val.
5506 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5508 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5511 /* Check if input variable in has fixed value and if so and if val is not NULL,
5512 * then return this fixed value in *val.
5514 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5516 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5519 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5520 * and if val is not NULL, then return this lower bound in *val.
5522 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5523 unsigned dim, isl_int *val)
5525 int i, i_eq = -1, i_ineq = -1;
5532 total = isl_basic_set_total_dim(bset);
5533 nparam = isl_basic_set_n_param(bset);
5534 for (i = 0; i < bset->n_eq; ++i) {
5535 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5541 for (i = 0; i < bset->n_ineq; ++i) {
5542 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5544 if (i_eq != -1 || i_ineq != -1)
5548 if (i_eq == -1 && i_ineq == -1)
5550 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5551 /* The coefficient should always be one due to normalization. */
5552 if (!isl_int_is_one(c[1+nparam+dim]))
5554 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5556 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5557 total - nparam - dim - 1) != -1)
5560 isl_int_neg(*val, c[0]);
5564 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5565 unsigned dim, isl_int *val)
5577 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5581 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5583 for (i = 1; fixed == 1 && i < set->n; ++i) {
5584 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5586 if (fixed == 1 && isl_int_ne(tmp, v))
5590 isl_int_set(*val, v);
5601 static int qsort_constraint_cmp(const void *p1, const void *p2)
5603 const struct constraint *c1 = (const struct constraint *)p1;
5604 const struct constraint *c2 = (const struct constraint *)p2;
5605 unsigned size = isl_min(c1->size, c2->size);
5606 return isl_seq_cmp(c1->c, c2->c, size);
5609 static struct isl_basic_map *isl_basic_map_sort_constraints(
5610 struct isl_basic_map *bmap)
5613 struct constraint *c;
5618 total = isl_basic_map_total_dim(bmap);
5619 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5622 for (i = 0; i < bmap->n_ineq; ++i) {
5624 c[i].c = bmap->ineq[i];
5626 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5627 for (i = 0; i < bmap->n_ineq; ++i)
5628 bmap->ineq[i] = c[i].c;
5632 isl_basic_map_free(bmap);
5636 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5640 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5642 bmap = isl_basic_map_convex_hull(bmap);
5643 bmap = isl_basic_map_sort_constraints(bmap);
5644 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5648 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5650 return (struct isl_basic_set *)isl_basic_map_normalize(
5651 (struct isl_basic_map *)bset);
5654 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5655 const struct isl_basic_map *bmap2)
5662 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5663 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5664 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5665 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5666 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5667 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5668 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5669 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5671 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5673 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5675 if (bmap1->n_eq != bmap2->n_eq)
5676 return bmap1->n_eq - bmap2->n_eq;
5677 if (bmap1->n_ineq != bmap2->n_ineq)
5678 return bmap1->n_ineq - bmap2->n_ineq;
5679 if (bmap1->n_div != bmap2->n_div)
5680 return bmap1->n_div - bmap2->n_div;
5681 total = isl_basic_map_total_dim(bmap1);
5682 for (i = 0; i < bmap1->n_eq; ++i) {
5683 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5687 for (i = 0; i < bmap1->n_ineq; ++i) {
5688 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
5692 for (i = 0; i < bmap1->n_div; ++i) {
5693 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
5700 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
5701 struct isl_basic_map *bmap2)
5703 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
5706 static int qsort_bmap_cmp(const void *p1, const void *p2)
5708 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
5709 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
5711 return isl_basic_map_fast_cmp(bmap1, bmap2);
5714 /* We normalize in place, but if anything goes wrong we need
5715 * to return NULL, so we need to make sure we don't change the
5716 * meaning of any possible other copies of map.
5718 struct isl_map *isl_map_normalize(struct isl_map *map)
5721 struct isl_basic_map *bmap;
5725 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
5727 for (i = 0; i < map->n; ++i) {
5728 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
5731 isl_basic_map_free(map->p[i]);
5734 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
5735 ISL_F_SET(map, ISL_MAP_NORMALIZED);
5736 map = isl_map_remove_empty_parts(map);
5739 for (i = map->n - 1; i >= 1; --i) {
5740 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
5742 isl_basic_map_free(map->p[i-1]);
5743 for (j = i; j < map->n; ++j)
5744 map->p[j-1] = map->p[j];
5754 struct isl_set *isl_set_normalize(struct isl_set *set)
5756 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
5759 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
5769 if (!isl_dim_equal(map1->dim, map2->dim))
5772 map1 = isl_map_copy(map1);
5773 map2 = isl_map_copy(map2);
5774 map1 = isl_map_normalize(map1);
5775 map2 = isl_map_normalize(map2);
5778 equal = map1->n == map2->n;
5779 for (i = 0; equal && i < map1->n; ++i) {
5780 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
5793 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
5795 return isl_map_fast_is_equal((struct isl_map *)set1,
5796 (struct isl_map *)set2);
5799 /* Return an interval that ranges from min to max (inclusive)
5801 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
5802 isl_int min, isl_int max)
5805 struct isl_basic_set *bset = NULL;
5807 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
5811 k = isl_basic_set_alloc_inequality(bset);
5814 isl_int_set_si(bset->ineq[k][1], 1);
5815 isl_int_neg(bset->ineq[k][0], min);
5817 k = isl_basic_set_alloc_inequality(bset);
5820 isl_int_set_si(bset->ineq[k][1], -1);
5821 isl_int_set(bset->ineq[k][0], max);
5825 isl_basic_set_free(bset);
5829 /* Return the Cartesian product of the basic sets in list (in the given order).
5831 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
5839 struct isl_basic_set *product = NULL;
5843 isl_assert(list->ctx, list->n > 0, goto error);
5844 isl_assert(list->ctx, list->p[0], goto error);
5845 nparam = isl_basic_set_n_param(list->p[0]);
5846 dim = isl_basic_set_n_dim(list->p[0]);
5847 extra = list->p[0]->n_div;
5848 n_eq = list->p[0]->n_eq;
5849 n_ineq = list->p[0]->n_ineq;
5850 for (i = 1; i < list->n; ++i) {
5851 isl_assert(list->ctx, list->p[i], goto error);
5852 isl_assert(list->ctx,
5853 nparam == isl_basic_set_n_param(list->p[i]), goto error);
5854 dim += isl_basic_set_n_dim(list->p[i]);
5855 extra += list->p[i]->n_div;
5856 n_eq += list->p[i]->n_eq;
5857 n_ineq += list->p[i]->n_ineq;
5859 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
5864 for (i = 0; i < list->n; ++i) {
5865 isl_basic_set_add_constraints(product,
5866 isl_basic_set_copy(list->p[i]), dim);
5867 dim += isl_basic_set_n_dim(list->p[i]);
5869 isl_basic_set_list_free(list);
5872 isl_basic_set_free(product);
5873 isl_basic_set_list_free(list);
5877 struct isl_basic_map *isl_basic_map_product(
5878 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5880 struct isl_dim *dim_result = NULL;
5881 struct isl_basic_map *bmap;
5882 unsigned in1, in2, out1, out2, nparam, total, pos;
5883 struct isl_dim_map *dim_map1, *dim_map2;
5885 if (!bmap1 || !bmap2)
5888 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
5889 bmap2->dim, isl_dim_param), goto error);
5890 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
5891 isl_dim_copy(bmap2->dim));
5893 in1 = isl_basic_map_n_in(bmap1);
5894 in2 = isl_basic_map_n_in(bmap2);
5895 out1 = isl_basic_map_n_out(bmap1);
5896 out2 = isl_basic_map_n_out(bmap2);
5897 nparam = isl_basic_map_n_param(bmap1);
5899 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
5900 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
5901 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
5902 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
5903 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
5904 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
5905 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
5906 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
5907 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
5908 isl_dim_map_div(dim_map1, bmap1, pos += out2);
5909 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
5911 bmap = isl_basic_map_alloc_dim(dim_result,
5912 bmap1->n_div + bmap2->n_div,
5913 bmap1->n_eq + bmap2->n_eq,
5914 bmap1->n_ineq + bmap2->n_ineq);
5915 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
5916 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
5917 bmap = isl_basic_map_simplify(bmap);
5918 return isl_basic_map_finalize(bmap);
5920 isl_basic_map_free(bmap1);
5921 isl_basic_map_free(bmap2);
5925 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
5927 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
5930 struct isl_map *result;
5936 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
5937 map2->dim, isl_dim_param), goto error);
5939 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5940 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5941 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5943 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
5944 isl_dim_copy(map2->dim)),
5945 map1->n * map2->n, flags);
5948 for (i = 0; i < map1->n; ++i)
5949 for (j = 0; j < map2->n; ++j) {
5950 struct isl_basic_map *part;
5951 part = isl_basic_map_product(
5952 isl_basic_map_copy(map1->p[i]),
5953 isl_basic_map_copy(map2->p[j]));
5954 if (isl_basic_map_is_empty(part))
5955 isl_basic_map_free(part);
5957 result = isl_map_add_basic_map(result, part);
5970 /* Given two set A and B, construct its Cartesian product A x B.
5972 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
5974 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
5975 (struct isl_map *)set2);
5978 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
5981 uint32_t hash = isl_hash_init();
5986 bset = isl_basic_set_copy(bset);
5987 bset = isl_basic_set_normalize(bset);
5990 total = isl_basic_set_total_dim(bset);
5991 isl_hash_byte(hash, bset->n_eq & 0xFF);
5992 for (i = 0; i < bset->n_eq; ++i) {
5994 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
5995 isl_hash_hash(hash, c_hash);
5997 isl_hash_byte(hash, bset->n_ineq & 0xFF);
5998 for (i = 0; i < bset->n_ineq; ++i) {
6000 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6001 isl_hash_hash(hash, c_hash);
6003 isl_hash_byte(hash, bset->n_div & 0xFF);
6004 for (i = 0; i < bset->n_div; ++i) {
6006 if (isl_int_is_zero(bset->div[i][0]))
6008 isl_hash_byte(hash, i & 0xFF);
6009 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6010 isl_hash_hash(hash, c_hash);
6012 isl_basic_set_free(bset);
6016 uint32_t isl_set_get_hash(struct isl_set *set)
6023 set = isl_set_copy(set);
6024 set = isl_set_normalize(set);
6028 hash = isl_hash_init();
6029 for (i = 0; i < set->n; ++i) {
6031 bset_hash = isl_basic_set_get_hash(set->p[i]);
6032 isl_hash_hash(hash, bset_hash);
6040 /* Check if the value for dimension dim is completely determined
6041 * by the values of the other parameters and variables.
6042 * That is, check if dimension dim is involved in an equality.
6044 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6051 nparam = isl_basic_set_n_param(bset);
6052 for (i = 0; i < bset->n_eq; ++i)
6053 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6058 /* Check if the value for dimension dim is completely determined
6059 * by the values of the other parameters and variables.
6060 * That is, check if dimension dim is involved in an equality
6061 * for each of the subsets.
6063 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6069 for (i = 0; i < set->n; ++i) {
6071 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6078 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6079 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6086 for (i = 0; i < map->n; ++i)
6087 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6093 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6094 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6101 for (i = 0; i < set->n; ++i)
6102 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6108 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6110 struct isl_dim *dim;
6115 if (bset->n_div == 0)
6118 bset = isl_basic_set_cow(bset);
6122 dim = isl_basic_set_get_dim(bset);
6123 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6126 isl_dim_free(bset->dim);
6132 isl_basic_set_free(bset);
6136 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6139 struct isl_dim *dim;
6142 set = isl_set_align_divs(set);
6146 if (set->n == 0 || set->p[0]->n_div == 0)
6149 set = isl_set_cow(set);
6153 n_div = set->p[0]->n_div;
6154 dim = isl_set_get_dim(set);
6155 dim = isl_dim_add(dim, isl_dim_set, n_div);
6158 isl_dim_free(set->dim);
6161 for (i = 0; i < set->n; ++i) {
6162 set->p[i] = isl_basic_set_lift(set->p[i]);
6173 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6175 struct isl_dim *dim;
6176 struct isl_basic_map *bmap;
6183 set = isl_set_align_divs(set);
6188 dim = isl_set_get_dim(set);
6189 if (set->n == 0 || set->p[0]->n_div == 0) {
6191 return isl_map_identity(dim);
6194 n_div = set->p[0]->n_div;
6195 dim = isl_dim_map(dim);
6196 n_param = isl_dim_size(dim, isl_dim_param);
6197 n_set = isl_dim_size(dim, isl_dim_in);
6198 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6199 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6200 for (i = 0; i < n_set; ++i)
6201 bmap = var_equal(bmap, i);
6203 total = n_param + n_set + n_set + n_div;
6204 for (i = 0; i < n_div; ++i) {
6205 k = isl_basic_map_alloc_inequality(bmap);
6208 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6209 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6210 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6211 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6212 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6213 set->p[0]->div[i][0]);
6215 l = isl_basic_map_alloc_inequality(bmap);
6218 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6219 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6220 set->p[0]->div[i][0]);
6221 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6225 return isl_map_from_basic_map(bmap);
6228 isl_basic_map_free(bmap);
6232 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6240 dim = isl_basic_set_total_dim(bset);
6241 size += bset->n_eq * (1 + dim);
6242 size += bset->n_ineq * (1 + dim);
6243 size += bset->n_div * (2 + dim);
6248 int isl_set_size(__isl_keep isl_set *set)
6256 for (i = 0; i < set->n; ++i)
6257 size += isl_basic_set_size(set->p[i]);