2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
18 #include "isl_equalities.h"
24 #include "isl_map_private.h"
25 #include "isl_map_piplib.h"
26 #include "isl_sample.h"
30 /* Maps dst positions to src positions */
36 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
39 struct isl_dim_map *dim_map;
40 dim_map = isl_alloc(ctx, struct isl_dim_map,
41 sizeof(struct isl_dim_map) + len * sizeof(int));
44 dim_map->len = 1 + len;
46 for (i = 0; i < len; ++i)
47 dim_map->pos[1 + i] = -1;
51 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
54 case isl_dim_param: return dim->nparam;
55 case isl_dim_in: return dim->n_in;
56 case isl_dim_out: return dim->n_out;
57 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
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;
72 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
73 struct isl_dim *dim, enum isl_dim_type type,
74 unsigned first, unsigned n, unsigned dst_pos)
82 src_pos = pos(dim, type);
83 for (i = 0; i < n; ++i)
84 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
87 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
88 enum isl_dim_type type, unsigned dst_pos)
90 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
93 static void isl_dim_map_div(struct isl_dim_map *dim_map,
94 struct isl_basic_map *bmap, unsigned dst_pos)
99 if (!dim_map || !bmap)
102 src_pos = 1 + isl_dim_total(bmap->dim);
103 for (i = 0; i < bmap->n_div; ++i)
104 dim_map->pos[1 + dst_pos + i] = src_pos + i;
107 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
111 for (i = 0; i < dim_map->len; ++i)
112 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
113 fprintf(stderr, "\n");
116 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
117 enum isl_dim_type type)
122 case isl_dim_out: return isl_dim_size(bmap->dim, type);
123 case isl_dim_div: return bmap->n_div;
124 case isl_dim_all: return isl_basic_map_total_dim(bmap);
129 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
131 return map ? n(map->dim, type) : 0;
134 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
136 return set ? n(set->dim, type) : 0;
139 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
140 enum isl_dim_type type)
142 struct isl_dim *dim = bmap->dim;
144 case isl_dim_param: return 1;
145 case isl_dim_in: return 1 + dim->nparam;
146 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
147 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
152 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
154 return pos(map->dim, type);
157 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
158 enum isl_dim_type type)
160 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
163 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
165 return bset->dim->n_out;
168 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
170 return bset->dim->nparam;
173 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
175 return isl_dim_total(bset->dim) + bset->n_div;
178 unsigned isl_set_n_dim(const struct isl_set *set)
180 return set->dim->n_out;
183 unsigned isl_set_n_param(const struct isl_set *set)
185 return set->dim->nparam;
188 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
190 return bmap->dim->n_in;
193 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
195 return bmap->dim->n_out;
198 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
200 return bmap->dim->nparam;
203 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
208 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
210 return isl_dim_total(bmap->dim) + bmap->n_div;
213 unsigned isl_map_n_in(const struct isl_map *map)
215 return map->dim->n_in;
218 unsigned isl_map_n_out(const struct isl_map *map)
220 return map->dim->n_out;
223 unsigned isl_map_n_param(const struct isl_map *map)
225 return map->dim->nparam;
228 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
230 return map->dim->n_in == set->dim->n_out &&
231 map->dim->nparam == set->dim->nparam;
234 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
235 struct isl_basic_set *bset)
237 return bmap->dim->n_in == bset->dim->n_out &&
238 bmap->dim->nparam == bset->dim->nparam;
241 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
242 struct isl_basic_set *bset)
244 return bmap->dim->n_out == bset->dim->n_out &&
245 bmap->dim->nparam == bset->dim->nparam;
248 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
252 return isl_dim_copy(bmap->dim);
255 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
259 return isl_dim_copy(bset->dim);
262 struct isl_dim *isl_map_get_dim(struct isl_map *map)
266 return isl_dim_copy(map->dim);
269 struct isl_dim *isl_set_get_dim(struct isl_set *set)
273 return isl_dim_copy(set->dim);
276 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
277 struct isl_basic_map *bmap, unsigned extra,
278 unsigned n_eq, unsigned n_ineq)
281 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
283 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
284 if (isl_blk_is_error(bmap->block)) {
289 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
291 isl_blk_free(ctx, bmap->block);
297 bmap->block2 = isl_blk_empty();
300 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
301 if (isl_blk_is_error(bmap->block2)) {
303 isl_blk_free(ctx, bmap->block);
308 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
310 isl_blk_free(ctx, bmap->block2);
312 isl_blk_free(ctx, bmap->block);
318 for (i = 0; i < n_ineq + n_eq; ++i)
319 bmap->ineq[i] = bmap->block.data + i * row_size;
321 for (i = 0; i < extra; ++i)
322 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
328 bmap->c_size = n_eq + n_ineq;
329 bmap->eq = bmap->ineq + n_ineq;
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 i = isl_basic_map_alloc_equality(bmap);
1143 isl_int_set_si(bmap->eq[i][0], 1);
1144 isl_seq_clr(bmap->eq[i]+1, total);
1145 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1146 isl_vec_free(bmap->sample);
1147 bmap->sample = NULL;
1148 return isl_basic_map_finalize(bmap);
1150 isl_basic_map_free(bmap);
1154 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1156 return (struct isl_basic_set *)
1157 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1160 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1163 unsigned off = isl_dim_total(bmap->dim);
1164 isl_int *t = bmap->div[a];
1165 bmap->div[a] = bmap->div[b];
1168 for (i = 0; i < bmap->n_eq; ++i)
1169 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1171 for (i = 0; i < bmap->n_ineq; ++i)
1172 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1174 for (i = 0; i < bmap->n_div; ++i)
1175 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1176 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1179 /* Eliminate the specified n dimensions starting at first from the
1180 * constraints using Fourier-Motzkin. The dimensions themselves
1183 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1184 enum isl_dim_type type, unsigned first, unsigned n)
1193 map = isl_map_cow(map);
1196 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1197 first += pos(map->dim, type) - 1;
1199 for (i = 0; i < map->n; ++i) {
1200 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1210 /* Eliminate the specified n dimensions starting at first from the
1211 * constraints using Fourier-Motzkin. The dimensions themselves
1214 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1215 enum isl_dim_type type, unsigned first, unsigned n)
1217 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1220 /* Eliminate the specified n dimensions starting at first from the
1221 * constraints using Fourier-Motzkin. The dimensions themselves
1224 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1225 unsigned first, unsigned n)
1227 return isl_set_eliminate(set, isl_dim_set, first, n);
1230 /* Project out n dimensions starting at first using Fourier-Motzkin */
1231 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1232 unsigned first, unsigned n)
1234 set = isl_set_eliminate_dims(set, first, n);
1235 set = isl_set_drop_dims(set, first, n);
1239 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1241 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1249 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1258 set = isl_set_cow(set);
1262 for (i = 0; i < set->n; ++i) {
1263 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1273 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1274 enum isl_dim_type type, unsigned first, unsigned n)
1278 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1282 bmap = isl_basic_map_eliminate_vars(bmap,
1283 isl_basic_map_offset(bmap, type) - 1 + first, n);
1286 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1288 bmap = isl_basic_map_drop(bmap, type, first, n);
1291 isl_basic_map_free(bmap);
1295 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1296 enum isl_dim_type type, unsigned first, unsigned n)
1298 return (isl_basic_set *)
1299 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1302 struct isl_map *isl_map_remove(struct isl_map *map,
1303 enum isl_dim_type type, unsigned first, unsigned n)
1310 map = isl_map_cow(map);
1313 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1315 for (i = 0; i < map->n; ++i) {
1316 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1317 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1321 map = isl_map_drop(map, type, first, n);
1328 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1329 enum isl_dim_type type, unsigned first, unsigned n)
1331 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1334 /* Project out n inputs starting at first using Fourier-Motzkin */
1335 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1336 unsigned first, unsigned n)
1338 return isl_map_remove(map, isl_dim_in, first, n);
1341 /* Project out n dimensions starting at first using Fourier-Motzkin */
1342 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1343 unsigned first, unsigned n)
1345 unsigned nparam = isl_basic_set_n_param(bset);
1346 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1347 bset = isl_basic_set_drop_dims(bset, first, n);
1351 static void dump_term(struct isl_basic_map *bmap,
1352 isl_int c, int pos, FILE *out)
1355 unsigned in = isl_basic_map_n_in(bmap);
1356 unsigned dim = in + isl_basic_map_n_out(bmap);
1357 unsigned nparam = isl_basic_map_n_param(bmap);
1359 isl_int_print(out, c, 0);
1361 if (!isl_int_is_one(c))
1362 isl_int_print(out, c, 0);
1363 if (pos < 1 + nparam) {
1364 name = isl_dim_get_name(bmap->dim,
1365 isl_dim_param, pos - 1);
1367 fprintf(out, "%s", name);
1369 fprintf(out, "p%d", pos - 1);
1370 } else if (pos < 1 + nparam + in)
1371 fprintf(out, "i%d", pos - 1 - nparam);
1372 else if (pos < 1 + nparam + dim)
1373 fprintf(out, "o%d", pos - 1 - nparam - in);
1375 fprintf(out, "e%d", pos - 1 - nparam - dim);
1379 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1380 int sign, FILE *out)
1384 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1388 for (i = 0, first = 1; i < len; ++i) {
1389 if (isl_int_sgn(c[i]) * sign <= 0)
1392 fprintf(out, " + ");
1394 isl_int_abs(v, c[i]);
1395 dump_term(bmap, v, i, out);
1402 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1403 const char *op, FILE *out, int indent)
1407 fprintf(out, "%*s", indent, "");
1409 dump_constraint_sign(bmap, c, 1, out);
1410 fprintf(out, " %s ", op);
1411 dump_constraint_sign(bmap, c, -1, out);
1415 for (i = bmap->n_div; i < bmap->extra; ++i) {
1416 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1418 fprintf(out, "%*s", indent, "");
1419 fprintf(out, "ERROR: unused div coefficient not zero\n");
1424 static void dump_constraints(struct isl_basic_map *bmap,
1425 isl_int **c, unsigned n,
1426 const char *op, FILE *out, int indent)
1430 for (i = 0; i < n; ++i)
1431 dump_constraint(bmap, c[i], op, out, indent);
1434 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1438 unsigned total = isl_basic_map_total_dim(bmap);
1440 for (j = 0; j < 1 + total; ++j) {
1441 if (isl_int_is_zero(exp[j]))
1443 if (!first && isl_int_is_pos(exp[j]))
1445 dump_term(bmap, exp[j], j, out);
1450 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1454 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1455 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1457 for (i = 0; i < bmap->n_div; ++i) {
1458 fprintf(out, "%*s", indent, "");
1459 fprintf(out, "e%d = [(", i);
1460 dump_affine(bmap, bmap->div[i]+1, out);
1462 isl_int_print(out, bmap->div[i][0], 0);
1463 fprintf(out, "]\n");
1467 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1470 fprintf(out, "null basic set\n");
1474 fprintf(out, "%*s", indent, "");
1475 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1476 bset->ref, bset->dim->nparam, bset->dim->n_out,
1477 bset->extra, bset->flags);
1478 dump((struct isl_basic_map *)bset, out, indent);
1481 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1484 fprintf(out, "null basic map\n");
1488 fprintf(out, "%*s", indent, "");
1489 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1490 "flags: %x, n_name: %d\n",
1492 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1493 bmap->extra, bmap->flags, bmap->dim->n_name);
1494 dump(bmap, out, indent);
1497 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1502 total = isl_basic_map_total_dim(bmap);
1503 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1504 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1505 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1506 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1510 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1512 struct isl_set *set;
1516 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1517 isl_assert(dim->ctx, n >= 0, return NULL);
1518 set = isl_alloc(dim->ctx, struct isl_set,
1519 sizeof(struct isl_set) +
1520 (n - 1) * sizeof(struct isl_basic_set *));
1524 set->ctx = dim->ctx;
1525 isl_ctx_ref(set->ctx);
1537 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1538 unsigned nparam, unsigned dim, int n, unsigned flags)
1540 struct isl_set *set;
1541 struct isl_dim *dims;
1543 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1547 set = isl_set_alloc_dim(dims, n, flags);
1551 /* Make sure "map" has room for at least "n" more basic maps.
1553 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1556 struct isl_map *grown = NULL;
1560 isl_assert(map->ctx, n >= 0, goto error);
1561 if (map->n + n <= map->size)
1563 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1566 for (i = 0; i < map->n; ++i) {
1567 grown->p[i] = isl_basic_map_copy(map->p[i]);
1575 isl_map_free(grown);
1580 /* Make sure "set" has room for at least "n" more basic sets.
1582 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1584 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1587 struct isl_set *isl_set_dup(struct isl_set *set)
1590 struct isl_set *dup;
1595 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1598 for (i = 0; i < set->n; ++i)
1599 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1603 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1605 struct isl_set *set;
1610 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1612 isl_basic_set_free(bset);
1615 return isl_set_add_basic_set(set, bset);
1618 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1620 struct isl_map *map;
1625 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1627 isl_basic_map_free(bmap);
1630 return isl_map_add_basic_map(map, bmap);
1633 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1634 __isl_take isl_basic_set *bset)
1636 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1637 (struct isl_basic_map *)bset);
1640 void isl_set_free(struct isl_set *set)
1650 isl_ctx_deref(set->ctx);
1651 for (i = 0; i < set->n; ++i)
1652 isl_basic_set_free(set->p[i]);
1653 isl_dim_free(set->dim);
1657 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1662 fprintf(out, "null set\n");
1666 fprintf(out, "%*s", indent, "");
1667 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1668 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1670 for (i = 0; i < set->n; ++i) {
1671 fprintf(out, "%*s", indent, "");
1672 fprintf(out, "basic set %d:\n", i);
1673 isl_basic_set_dump(set->p[i], out, indent+4);
1677 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1682 fprintf(out, "null map\n");
1686 fprintf(out, "%*s", indent, "");
1687 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1688 "flags: %x, n_name: %d\n",
1689 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1690 map->dim->n_out, map->flags, map->dim->n_name);
1691 for (i = 0; i < map->n; ++i) {
1692 fprintf(out, "%*s", indent, "");
1693 fprintf(out, "basic map %d:\n", i);
1694 isl_basic_map_dump(map->p[i], out, indent+4);
1698 struct isl_basic_map *isl_basic_map_intersect_domain(
1699 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1701 struct isl_basic_map *bmap_domain;
1702 struct isl_dim *dim;
1707 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1708 bset->dim, isl_dim_param), goto error);
1710 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1711 isl_assert(bset->ctx,
1712 isl_basic_map_compatible_domain(bmap, bset), goto error);
1714 bmap = isl_basic_map_cow(bmap);
1715 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1716 bset->n_div, bset->n_eq, bset->n_ineq);
1719 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1720 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1721 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1723 bmap = isl_basic_map_simplify(bmap);
1724 return isl_basic_map_finalize(bmap);
1726 isl_basic_map_free(bmap);
1727 isl_basic_set_free(bset);
1731 struct isl_basic_map *isl_basic_map_intersect_range(
1732 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1734 struct isl_basic_map *bmap_range;
1739 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1740 bset->dim, isl_dim_param), goto error);
1742 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1743 isl_assert(bset->ctx,
1744 isl_basic_map_compatible_range(bmap, bset), goto error);
1746 bmap = isl_basic_map_cow(bmap);
1747 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1748 bset->n_div, bset->n_eq, bset->n_ineq);
1751 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1752 bmap = add_constraints(bmap, bmap_range, 0, 0);
1754 bmap = isl_basic_map_simplify(bmap);
1755 return isl_basic_map_finalize(bmap);
1757 isl_basic_map_free(bmap);
1758 isl_basic_set_free(bset);
1762 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1768 total = 1 + isl_basic_map_total_dim(bmap);
1769 if (total != vec->size)
1774 for (i = 0; i < bmap->n_eq; ++i) {
1775 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1776 if (!isl_int_is_zero(s)) {
1782 for (i = 0; i < bmap->n_ineq; ++i) {
1783 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1784 if (isl_int_is_neg(s)) {
1795 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1797 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1800 struct isl_basic_map *isl_basic_map_intersect(
1801 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1803 struct isl_vec *sample = NULL;
1805 if (!bmap1 || !bmap2)
1808 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1809 bmap2->dim, isl_dim_param), goto error);
1810 if (isl_dim_total(bmap1->dim) ==
1811 isl_dim_size(bmap1->dim, isl_dim_param) &&
1812 isl_dim_total(bmap2->dim) !=
1813 isl_dim_size(bmap2->dim, isl_dim_param))
1814 return isl_basic_map_intersect(bmap2, bmap1);
1816 if (isl_dim_total(bmap2->dim) !=
1817 isl_dim_size(bmap2->dim, isl_dim_param))
1818 isl_assert(bmap1->ctx,
1819 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1821 if (bmap1->sample &&
1822 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1823 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1824 sample = isl_vec_copy(bmap1->sample);
1825 else if (bmap2->sample &&
1826 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1827 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1828 sample = isl_vec_copy(bmap2->sample);
1830 bmap1 = isl_basic_map_cow(bmap1);
1831 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1832 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1835 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1838 isl_vec_free(bmap1->sample);
1839 bmap1->sample = sample;
1842 bmap1 = isl_basic_map_simplify(bmap1);
1843 return isl_basic_map_finalize(bmap1);
1846 isl_vec_free(sample);
1847 isl_basic_map_free(bmap1);
1848 isl_basic_map_free(bmap2);
1852 struct isl_basic_set *isl_basic_set_intersect(
1853 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1855 return (struct isl_basic_set *)
1856 isl_basic_map_intersect(
1857 (struct isl_basic_map *)bset1,
1858 (struct isl_basic_map *)bset2);
1861 /* Special case of isl_map_intersect, where both map1 and map2
1862 * are convex, without any divs and such that either map1 or map2
1863 * contains a single constraint. This constraint is then simply
1864 * added to the other map.
1866 static __isl_give isl_map *map_intersect_add_constraint(
1867 __isl_take isl_map *map1, __isl_take isl_map *map2)
1869 struct isl_basic_map *bmap1;
1870 struct isl_basic_map *bmap2;
1872 isl_assert(map1->ctx, map1->n == 1, goto error);
1873 isl_assert(map2->ctx, map1->n == 1, goto error);
1874 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1875 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1877 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1878 return isl_map_intersect(map2, map1);
1880 isl_assert(map2->ctx,
1881 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1883 map1 = isl_map_cow(map1);
1886 if (isl_map_fast_is_empty(map1)) {
1890 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1891 if (map2->p[0]->n_eq == 1)
1892 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1894 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1895 map2->p[0]->ineq[0]);
1897 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1898 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1902 if (isl_basic_map_fast_is_empty(map1->p[0])) {
1903 isl_basic_map_free(map1->p[0]);
1916 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1919 struct isl_map *result;
1925 if (isl_map_fast_is_empty(map1)) {
1929 if (isl_map_fast_is_empty(map2)) {
1934 if (map1->n == 1 && map2->n == 1 &&
1935 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
1936 isl_dim_equal(map1->dim, map2->dim) &&
1937 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
1938 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
1939 return map_intersect_add_constraint(map1, map2);
1940 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
1941 map2->dim, isl_dim_param), goto error);
1942 if (isl_dim_total(map1->dim) ==
1943 isl_dim_size(map1->dim, isl_dim_param) &&
1944 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1945 return isl_map_intersect(map2, map1);
1947 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
1948 isl_assert(map1->ctx,
1949 isl_dim_equal(map1->dim, map2->dim), goto error);
1951 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
1952 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
1953 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
1955 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
1956 map1->n * map2->n, flags);
1959 for (i = 0; i < map1->n; ++i)
1960 for (j = 0; j < map2->n; ++j) {
1961 struct isl_basic_map *part;
1962 part = isl_basic_map_intersect(
1963 isl_basic_map_copy(map1->p[i]),
1964 isl_basic_map_copy(map2->p[j]));
1965 if (isl_basic_map_is_empty(part))
1966 isl_basic_map_free(part);
1968 result = isl_map_add_basic_map(result, part);
1981 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
1983 return (struct isl_set *)
1984 isl_map_intersect((struct isl_map *)set1,
1985 (struct isl_map *)set2);
1988 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
1990 struct isl_dim *dim;
1991 struct isl_basic_set *bset;
1996 bmap = isl_basic_map_cow(bmap);
1999 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2000 in = isl_basic_map_n_in(bmap);
2001 bset = isl_basic_set_from_basic_map(bmap);
2002 bset = isl_basic_set_swap_vars(bset, in);
2003 return isl_basic_map_from_basic_set(bset, dim);
2006 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2007 enum isl_dim_type type, unsigned pos, unsigned n)
2009 struct isl_dim *res_dim;
2010 struct isl_basic_map *res;
2011 struct isl_dim_map *dim_map;
2012 unsigned total, off;
2013 enum isl_dim_type t;
2021 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2023 total = isl_basic_map_total_dim(bmap) + n;
2024 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2026 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2028 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2030 unsigned size = isl_basic_map_dim(bmap, t);
2031 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2033 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2034 pos, size - pos, off + pos + n);
2036 off += isl_dim_size(res_dim, t);
2038 isl_dim_map_div(dim_map, bmap, off);
2040 res = isl_basic_map_alloc_dim(res_dim,
2041 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2042 res = add_constraints_dim_map(res, bmap, dim_map);
2043 res = isl_basic_map_simplify(res);
2044 return isl_basic_map_finalize(res);
2047 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2048 enum isl_dim_type type, unsigned n)
2052 return isl_basic_map_insert(bmap, type,
2053 isl_basic_map_dim(bmap, type), n);
2056 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2057 enum isl_dim_type type, unsigned n)
2061 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2062 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2064 isl_basic_set_free(bset);
2068 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2069 enum isl_dim_type type, unsigned pos, unsigned n)
2076 map = isl_map_cow(map);
2080 map->dim = isl_dim_insert(map->dim, type, pos, n);
2084 for (i = 0; i < map->n; ++i) {
2085 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2096 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2097 enum isl_dim_type type, unsigned n)
2101 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2104 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2105 enum isl_dim_type type, unsigned n)
2109 isl_assert(set->ctx, type != isl_dim_in, goto error);
2110 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2116 __isl_give isl_basic_map *isl_basic_map_move_dims(
2117 __isl_take isl_basic_map *bmap,
2118 enum isl_dim_type dst_type, unsigned dst_pos,
2119 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2122 struct isl_dim_map *dim_map;
2123 struct isl_basic_map *res;
2124 enum isl_dim_type t;
2125 unsigned total, off;
2132 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2135 if (dst_type == src_type && dst_pos == src_pos)
2138 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2140 if (pos(bmap->dim, dst_type) + dst_pos ==
2141 pos(bmap->dim, src_type) + src_pos +
2142 ((src_type < dst_type) ? n : 0)) {
2143 bmap = isl_basic_map_cow(bmap);
2147 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2148 src_type, src_pos, n);
2155 total = isl_basic_map_total_dim(bmap);
2156 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2159 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2160 unsigned size = isl_dim_size(bmap->dim, t);
2161 if (t == dst_type) {
2162 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2165 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2168 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2169 dst_pos, size - dst_pos, off);
2170 off += size - dst_pos;
2171 } else if (t == src_type) {
2172 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2175 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2176 src_pos + n, size - src_pos - n, off);
2177 off += size - src_pos - n;
2179 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2183 isl_dim_map_div(dim_map, bmap, off + n);
2185 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2186 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2187 bmap = add_constraints_dim_map(res, bmap, dim_map);
2189 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2190 src_type, src_pos, n);
2194 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2195 bmap = isl_basic_map_gauss(bmap, NULL);
2196 bmap = isl_basic_map_finalize(bmap);
2200 isl_basic_map_free(bmap);
2204 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2205 enum isl_dim_type dst_type, unsigned dst_pos,
2206 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2208 return (isl_basic_set *)isl_basic_map_move_dims(
2209 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2212 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2213 enum isl_dim_type dst_type, unsigned dst_pos,
2214 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2218 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2219 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2220 src_type, src_pos, n);
2226 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2227 enum isl_dim_type dst_type, unsigned dst_pos,
2228 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2237 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2240 if (dst_type == src_type && dst_pos == src_pos)
2243 isl_assert(map->ctx, dst_type != src_type, goto error);
2245 map = isl_map_cow(map);
2249 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2253 for (i = 0; i < map->n; ++i) {
2254 map->p[i] = isl_basic_map_move_dims(map->p[i],
2256 src_type, src_pos, n);
2267 /* Move the specified dimensions to the last columns right before
2268 * the divs. Don't change the dimension specification of bmap.
2269 * That's the responsibility of the caller.
2271 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2272 enum isl_dim_type type, unsigned first, unsigned n)
2274 struct isl_dim_map *dim_map;
2275 struct isl_basic_map *res;
2276 enum isl_dim_type t;
2277 unsigned total, off;
2281 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2284 total = isl_basic_map_total_dim(bmap);
2285 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2288 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2289 unsigned size = isl_dim_size(bmap->dim, t);
2291 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2294 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2295 first, n, total - bmap->n_div - n);
2296 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2297 first + n, size - (first + n), off);
2298 off += size - (first + n);
2300 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2304 isl_dim_map_div(dim_map, bmap, off + n);
2306 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2307 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2308 res = add_constraints_dim_map(res, bmap, dim_map);
2312 /* Turn the n dimensions of type type, starting at first
2313 * into existentially quantified variables.
2315 __isl_give isl_basic_map *isl_basic_map_project_out(
2316 __isl_take isl_basic_map *bmap,
2317 enum isl_dim_type type, unsigned first, unsigned n)
2330 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2331 return isl_basic_map_remove(bmap, type, first, n);
2333 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2336 bmap = move_last(bmap, type, first, n);
2337 bmap = isl_basic_map_cow(bmap);
2339 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2340 old = bmap->block2.data;
2341 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2342 (bmap->extra + n) * (1 + row_size));
2343 if (!bmap->block2.data)
2345 new_div = isl_alloc_array(ctx, isl_int *, bmap->extra + n);
2348 for (i = 0; i < n; ++i) {
2349 new_div[i] = bmap->block2.data +
2350 (bmap->extra + i) * (1 + row_size);
2351 isl_seq_clr(new_div[i], 1 + row_size);
2353 for (i = 0; i < bmap->extra; ++i)
2354 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2356 bmap->div = new_div;
2360 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2363 bmap = isl_basic_map_simplify(bmap);
2364 bmap = isl_basic_map_drop_redundant_divs(bmap);
2365 return isl_basic_map_finalize(bmap);
2367 isl_basic_map_free(bmap);
2371 /* Turn the n dimensions of type type, starting at first
2372 * into existentially quantified variables.
2374 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2375 enum isl_dim_type type, unsigned first, unsigned n)
2377 return (isl_basic_set *)isl_basic_map_project_out(
2378 (isl_basic_map *)bset, type, first, n);
2381 /* Turn the n dimensions of type type, starting at first
2382 * into existentially quantified variables.
2384 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2385 enum isl_dim_type type, unsigned first, unsigned n)
2395 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2397 map = isl_map_cow(map);
2401 map->dim = isl_dim_drop(map->dim, type, first, n);
2405 for (i = 0; i < map->n; ++i) {
2406 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2417 /* Turn the n dimensions of type type, starting at first
2418 * into existentially quantified variables.
2420 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2421 enum isl_dim_type type, unsigned first, unsigned n)
2423 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2426 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2430 for (i = 0; i < n; ++i) {
2431 j = isl_basic_map_alloc_div(bmap);
2434 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2438 isl_basic_map_free(bmap);
2442 struct isl_basic_map *isl_basic_map_apply_range(
2443 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2445 struct isl_dim *dim_result = NULL;
2446 struct isl_basic_map *bmap;
2447 unsigned n_in, n_out, n, nparam, total, pos;
2448 struct isl_dim_map *dim_map1, *dim_map2;
2450 if (!bmap1 || !bmap2)
2453 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2454 isl_dim_copy(bmap2->dim));
2456 n_in = isl_basic_map_n_in(bmap1);
2457 n_out = isl_basic_map_n_out(bmap2);
2458 n = isl_basic_map_n_out(bmap1);
2459 nparam = isl_basic_map_n_param(bmap1);
2461 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2462 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2463 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2464 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2465 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2466 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2467 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2468 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2469 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2470 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2471 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2473 bmap = isl_basic_map_alloc_dim(dim_result,
2474 bmap1->n_div + bmap2->n_div + n,
2475 bmap1->n_eq + bmap2->n_eq,
2476 bmap1->n_ineq + bmap2->n_ineq);
2477 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2478 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2479 bmap = add_divs(bmap, n);
2480 bmap = isl_basic_map_simplify(bmap);
2481 bmap = isl_basic_map_drop_redundant_divs(bmap);
2482 return isl_basic_map_finalize(bmap);
2484 isl_basic_map_free(bmap1);
2485 isl_basic_map_free(bmap2);
2489 struct isl_basic_set *isl_basic_set_apply(
2490 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2495 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2498 return (struct isl_basic_set *)
2499 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2501 isl_basic_set_free(bset);
2502 isl_basic_map_free(bmap);
2506 struct isl_basic_map *isl_basic_map_apply_domain(
2507 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2509 if (!bmap1 || !bmap2)
2512 isl_assert(bmap1->ctx,
2513 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2514 isl_assert(bmap1->ctx,
2515 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2518 bmap1 = isl_basic_map_reverse(bmap1);
2519 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2520 return isl_basic_map_reverse(bmap1);
2522 isl_basic_map_free(bmap1);
2523 isl_basic_map_free(bmap2);
2527 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2528 * A \cap B -> f(A) + f(B)
2530 struct isl_basic_map *isl_basic_map_sum(
2531 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2533 unsigned n_in, n_out, nparam, total, pos;
2534 struct isl_basic_map *bmap = NULL;
2535 struct isl_dim_map *dim_map1, *dim_map2;
2538 if (!bmap1 || !bmap2)
2541 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2544 nparam = isl_basic_map_n_param(bmap1);
2545 n_in = isl_basic_map_n_in(bmap1);
2546 n_out = isl_basic_map_n_out(bmap1);
2548 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2549 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2550 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2551 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2552 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2553 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2554 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2555 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2556 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2557 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2558 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2560 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2561 bmap1->n_div + bmap2->n_div + 2 * n_out,
2562 bmap1->n_eq + bmap2->n_eq + n_out,
2563 bmap1->n_ineq + bmap2->n_ineq);
2564 for (i = 0; i < n_out; ++i) {
2565 int j = isl_basic_map_alloc_equality(bmap);
2568 isl_seq_clr(bmap->eq[j], 1+total);
2569 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2570 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2571 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2573 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2574 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2575 bmap = add_divs(bmap, 2 * n_out);
2577 bmap = isl_basic_map_simplify(bmap);
2578 return isl_basic_map_finalize(bmap);
2580 isl_basic_map_free(bmap);
2581 isl_basic_map_free(bmap1);
2582 isl_basic_map_free(bmap2);
2586 /* Given two maps A -> f(A) and B -> g(B), construct a map
2587 * A \cap B -> f(A) + f(B)
2589 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2591 struct isl_map *result;
2597 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2599 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2600 map1->n * map2->n, 0);
2603 for (i = 0; i < map1->n; ++i)
2604 for (j = 0; j < map2->n; ++j) {
2605 struct isl_basic_map *part;
2606 part = isl_basic_map_sum(
2607 isl_basic_map_copy(map1->p[i]),
2608 isl_basic_map_copy(map2->p[j]));
2609 if (isl_basic_map_is_empty(part))
2610 isl_basic_map_free(part);
2612 result = isl_map_add_basic_map(result, part);
2625 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2626 __isl_take isl_set *set2)
2628 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2631 /* Given a basic map A -> f(A), construct A -> -f(A).
2633 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2638 bmap = isl_basic_map_cow(bmap);
2642 n = isl_basic_map_dim(bmap, isl_dim_out);
2643 off = isl_basic_map_offset(bmap, isl_dim_out);
2644 for (i = 0; i < bmap->n_eq; ++i)
2645 for (j = 0; j < n; ++j)
2646 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2647 for (i = 0; i < bmap->n_ineq; ++i)
2648 for (j = 0; j < n; ++j)
2649 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2650 for (i = 0; i < bmap->n_div; ++i)
2651 for (j = 0; j < n; ++j)
2652 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2653 return isl_basic_map_finalize(bmap);
2656 /* Given a map A -> f(A), construct A -> -f(A).
2658 struct isl_map *isl_map_neg(struct isl_map *map)
2662 map = isl_map_cow(map);
2666 for (i = 0; i < map->n; ++i) {
2667 map->p[i] = isl_basic_map_neg(map->p[i]);
2678 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2680 return (isl_set *)isl_map_neg((isl_map *)set);
2683 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2684 * A -> floor(f(A)/d).
2686 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2689 unsigned n_in, n_out, nparam, total, pos;
2690 struct isl_basic_map *result = NULL;
2691 struct isl_dim_map *dim_map;
2697 nparam = isl_basic_map_n_param(bmap);
2698 n_in = isl_basic_map_n_in(bmap);
2699 n_out = isl_basic_map_n_out(bmap);
2701 total = nparam + n_in + n_out + bmap->n_div + n_out;
2702 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2703 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2704 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2705 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2706 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2708 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2709 bmap->n_div + n_out,
2710 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2711 result = add_constraints_dim_map(result, bmap, dim_map);
2712 result = add_divs(result, n_out);
2713 for (i = 0; i < n_out; ++i) {
2715 j = isl_basic_map_alloc_inequality(result);
2718 isl_seq_clr(result->ineq[j], 1+total);
2719 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2720 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2721 j = isl_basic_map_alloc_inequality(result);
2724 isl_seq_clr(result->ineq[j], 1+total);
2725 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2726 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2727 isl_int_sub_ui(result->ineq[j][0], d, 1);
2730 result = isl_basic_map_simplify(result);
2731 return isl_basic_map_finalize(result);
2733 isl_basic_map_free(result);
2737 /* Given a map A -> f(A) and an integer d, construct a map
2738 * A -> floor(f(A)/d).
2740 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2744 map = isl_map_cow(map);
2748 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2749 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2750 for (i = 0; i < map->n; ++i) {
2751 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2762 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2768 i = isl_basic_map_alloc_equality(bmap);
2771 nparam = isl_basic_map_n_param(bmap);
2772 n_in = isl_basic_map_n_in(bmap);
2773 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2774 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2775 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2776 return isl_basic_map_finalize(bmap);
2778 isl_basic_map_free(bmap);
2782 /* Add a constraints to "bmap" expressing i_pos < o_pos
2784 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2790 i = isl_basic_map_alloc_inequality(bmap);
2793 nparam = isl_basic_map_n_param(bmap);
2794 n_in = isl_basic_map_n_in(bmap);
2795 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2796 isl_int_set_si(bmap->ineq[i][0], -1);
2797 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2798 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2799 return isl_basic_map_finalize(bmap);
2801 isl_basic_map_free(bmap);
2805 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2807 static __isl_give isl_basic_map *var_less_or_equal(
2808 __isl_take isl_basic_map *bmap, unsigned pos)
2814 i = isl_basic_map_alloc_inequality(bmap);
2817 nparam = isl_basic_map_n_param(bmap);
2818 n_in = isl_basic_map_n_in(bmap);
2819 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2820 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2821 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2822 return isl_basic_map_finalize(bmap);
2824 isl_basic_map_free(bmap);
2828 /* Add a constraints to "bmap" expressing i_pos > o_pos
2830 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2836 i = isl_basic_map_alloc_inequality(bmap);
2839 nparam = isl_basic_map_n_param(bmap);
2840 n_in = isl_basic_map_n_in(bmap);
2841 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2842 isl_int_set_si(bmap->ineq[i][0], -1);
2843 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2844 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2845 return isl_basic_map_finalize(bmap);
2847 isl_basic_map_free(bmap);
2851 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2853 static __isl_give isl_basic_map *var_more_or_equal(
2854 __isl_take isl_basic_map *bmap, unsigned pos)
2860 i = isl_basic_map_alloc_inequality(bmap);
2863 nparam = isl_basic_map_n_param(bmap);
2864 n_in = isl_basic_map_n_in(bmap);
2865 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2866 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2867 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2868 return isl_basic_map_finalize(bmap);
2870 isl_basic_map_free(bmap);
2874 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2877 struct isl_basic_map *bmap;
2878 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2881 for (i = 0; i < n_equal && bmap; ++i)
2882 bmap = var_equal(bmap, i);
2883 return isl_basic_map_finalize(bmap);
2886 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2888 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2891 struct isl_basic_map *bmap;
2892 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2895 for (i = 0; i < pos && bmap; ++i)
2896 bmap = var_equal(bmap, i);
2898 bmap = var_less(bmap, pos);
2899 return isl_basic_map_finalize(bmap);
2902 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2904 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
2905 __isl_take isl_dim *dim, unsigned pos)
2908 isl_basic_map *bmap;
2910 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2911 for (i = 0; i < pos; ++i)
2912 bmap = var_equal(bmap, i);
2913 bmap = var_less_or_equal(bmap, pos);
2914 return isl_basic_map_finalize(bmap);
2917 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2919 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2922 struct isl_basic_map *bmap;
2923 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2926 for (i = 0; i < pos && bmap; ++i)
2927 bmap = var_equal(bmap, i);
2929 bmap = var_more(bmap, pos);
2930 return isl_basic_map_finalize(bmap);
2933 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
2935 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
2936 __isl_take isl_dim *dim, unsigned pos)
2939 isl_basic_map *bmap;
2941 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2942 for (i = 0; i < pos; ++i)
2943 bmap = var_equal(bmap, i);
2944 bmap = var_more_or_equal(bmap, pos);
2945 return isl_basic_map_finalize(bmap);
2948 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
2949 unsigned n, int equal)
2951 struct isl_map *map;
2954 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
2956 for (i = 0; i + 1 < n; ++i)
2957 map = isl_map_add_basic_map(map,
2958 isl_basic_map_less_at(isl_dim_copy(dims), i));
2961 map = isl_map_add_basic_map(map,
2962 isl_basic_map_less_or_equal_at(dims, n - 1));
2964 map = isl_map_add_basic_map(map,
2965 isl_basic_map_less_at(dims, n - 1));
2972 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
2976 return map_lex_lte_first(dims, dims->n_out, equal);
2979 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
2981 return map_lex_lte_first(dim, n, 0);
2984 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
2986 return map_lex_lte_first(dim, n, 1);
2989 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
2991 return map_lex_lte(isl_dim_map(set_dim), 0);
2994 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
2996 return map_lex_lte(isl_dim_map(set_dim), 1);
2999 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3000 unsigned n, int equal)
3002 struct isl_map *map;
3005 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3007 for (i = 0; i + 1 < n; ++i)
3008 map = isl_map_add_basic_map(map,
3009 isl_basic_map_more_at(isl_dim_copy(dims), i));
3012 map = isl_map_add_basic_map(map,
3013 isl_basic_map_more_or_equal_at(dims, n - 1));
3015 map = isl_map_add_basic_map(map,
3016 isl_basic_map_more_at(dims, n - 1));
3023 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3027 return map_lex_gte_first(dims, dims->n_out, equal);
3030 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3032 return map_lex_gte_first(dim, n, 0);
3035 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3037 return map_lex_gte_first(dim, n, 1);
3040 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3042 return map_lex_gte(isl_dim_map(set_dim), 0);
3045 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3047 return map_lex_gte(isl_dim_map(set_dim), 1);
3050 struct isl_basic_map *isl_basic_map_from_basic_set(
3051 struct isl_basic_set *bset, struct isl_dim *dim)
3053 struct isl_basic_map *bmap;
3055 bset = isl_basic_set_cow(bset);
3059 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3060 isl_dim_free(bset->dim);
3061 bmap = (struct isl_basic_map *) bset;
3063 return isl_basic_map_finalize(bmap);
3065 isl_basic_set_free(bset);
3070 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3074 if (bmap->dim->n_in == 0)
3075 return (struct isl_basic_set *)bmap;
3076 bmap = isl_basic_map_cow(bmap);
3079 bmap->dim = isl_dim_cow(bmap->dim);
3082 bmap->dim->n_out += bmap->dim->n_in;
3083 bmap->dim->n_in = 0;
3084 bmap = isl_basic_map_finalize(bmap);
3085 return (struct isl_basic_set *)bmap;
3087 isl_basic_map_free(bmap);
3091 /* For a div d = floor(f/m), add the constraints
3094 * -(f-(n-1)) + m d >= 0
3096 * Note that the second constraint is the negation of
3100 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3101 unsigned pos, isl_int *div)
3104 unsigned total = isl_basic_map_total_dim(bmap);
3106 i = isl_basic_map_alloc_inequality(bmap);
3109 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3110 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3112 j = isl_basic_map_alloc_inequality(bmap);
3115 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3116 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3117 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3121 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3122 unsigned pos, isl_int *div)
3124 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3128 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3130 unsigned total = isl_basic_map_total_dim(bmap);
3131 unsigned div_pos = total - bmap->n_div + div;
3133 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3137 struct isl_basic_set *isl_basic_map_underlying_set(
3138 struct isl_basic_map *bmap)
3142 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
3143 return (struct isl_basic_set *)bmap;
3144 bmap = isl_basic_map_cow(bmap);
3147 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3150 bmap->extra -= bmap->n_div;
3152 bmap = isl_basic_map_finalize(bmap);
3153 return (struct isl_basic_set *)bmap;
3158 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3159 __isl_take isl_basic_set *bset)
3161 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3164 struct isl_basic_map *isl_basic_map_overlying_set(
3165 struct isl_basic_set *bset, struct isl_basic_map *like)
3167 struct isl_basic_map *bmap;
3168 struct isl_ctx *ctx;
3175 isl_assert(ctx, bset->n_div == 0, goto error);
3176 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3177 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3179 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3180 isl_basic_map_free(like);
3181 return (struct isl_basic_map *)bset;
3183 bset = isl_basic_set_cow(bset);
3186 total = bset->dim->n_out + bset->extra;
3187 bmap = (struct isl_basic_map *)bset;
3188 isl_dim_free(bmap->dim);
3189 bmap->dim = isl_dim_copy(like->dim);
3192 bmap->n_div = like->n_div;
3193 bmap->extra += like->n_div;
3196 ltotal = total - bmap->extra + like->extra;
3199 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3200 bmap->extra * (1 + 1 + total));
3201 if (isl_blk_is_error(bmap->block2))
3203 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3207 for (i = 0; i < bmap->extra; ++i)
3208 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3209 for (i = 0; i < like->n_div; ++i) {
3210 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3211 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3213 bmap = isl_basic_map_extend_constraints(bmap,
3214 0, 2 * like->n_div);
3215 for (i = 0; i < like->n_div; ++i) {
3216 if (isl_int_is_zero(bmap->div[i][0]))
3218 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3222 isl_basic_map_free(like);
3223 bmap = isl_basic_map_simplify(bmap);
3224 bmap = isl_basic_map_finalize(bmap);
3227 isl_basic_map_free(like);
3228 isl_basic_set_free(bset);
3232 struct isl_basic_set *isl_basic_set_from_underlying_set(
3233 struct isl_basic_set *bset, struct isl_basic_set *like)
3235 return (struct isl_basic_set *)
3236 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3239 struct isl_set *isl_set_from_underlying_set(
3240 struct isl_set *set, struct isl_basic_set *like)
3246 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3248 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3249 isl_basic_set_free(like);
3252 set = isl_set_cow(set);
3255 for (i = 0; i < set->n; ++i) {
3256 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3257 isl_basic_set_copy(like));
3261 isl_dim_free(set->dim);
3262 set->dim = isl_dim_copy(like->dim);
3265 isl_basic_set_free(like);
3268 isl_basic_set_free(like);
3273 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3277 map = isl_map_cow(map);
3280 map->dim = isl_dim_cow(map->dim);
3284 for (i = 1; i < map->n; ++i)
3285 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3287 for (i = 0; i < map->n; ++i) {
3288 map->p[i] = (struct isl_basic_map *)
3289 isl_basic_map_underlying_set(map->p[i]);
3294 map->dim = isl_dim_underlying(map->dim, 0);
3296 isl_dim_free(map->dim);
3297 map->dim = isl_dim_copy(map->p[0]->dim);
3301 return (struct isl_set *)map;
3307 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3309 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3312 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3314 struct isl_basic_set *domain;
3319 n_in = isl_basic_map_n_in(bmap);
3320 n_out = isl_basic_map_n_out(bmap);
3321 domain = isl_basic_set_from_basic_map(bmap);
3322 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3325 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3327 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3330 struct isl_set *isl_map_range(struct isl_map *map)
3333 struct isl_set *set;
3337 if (isl_map_dim(map, isl_dim_in) == 0)
3338 return (isl_set *)map;
3340 map = isl_map_cow(map);
3344 set = (struct isl_set *) map;
3345 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3348 for (i = 0; i < map->n; ++i) {
3349 set->p[i] = isl_basic_map_range(map->p[i]);
3353 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3354 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3361 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3364 struct isl_map *map = NULL;
3366 set = isl_set_cow(set);
3369 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3370 map = (struct isl_map *)set;
3371 for (i = 0; i < set->n; ++i) {
3372 map->p[i] = isl_basic_map_from_basic_set(
3373 set->p[i], isl_dim_copy(dim));
3377 isl_dim_free(map->dim);
3386 struct isl_map *isl_map_from_range(struct isl_set *set)
3388 return (struct isl_map *)set;
3391 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3393 return isl_map_reverse(isl_map_from_range(set));;
3396 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3397 __isl_take isl_set *range)
3399 return isl_map_product(isl_map_from_domain(domain),
3400 isl_map_from_range(range));
3403 struct isl_set *isl_set_from_map(struct isl_map *map)
3406 struct isl_set *set = NULL;
3410 map = isl_map_cow(map);
3413 map->dim = isl_dim_cow(map->dim);
3416 map->dim->n_out += map->dim->n_in;
3418 set = (struct isl_set *)map;
3419 for (i = 0; i < map->n; ++i) {
3420 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3430 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3432 struct isl_map *map;
3436 isl_assert(dim->ctx, n >= 0, return NULL);
3437 map = isl_alloc(dim->ctx, struct isl_map,
3438 sizeof(struct isl_map) +
3439 (n - 1) * sizeof(struct isl_basic_map *));
3443 map->ctx = dim->ctx;
3444 isl_ctx_ref(map->ctx);
3456 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3457 unsigned nparam, unsigned in, unsigned out, int n,
3460 struct isl_map *map;
3461 struct isl_dim *dims;
3463 dims = isl_dim_alloc(ctx, nparam, in, out);
3467 map = isl_map_alloc_dim(dims, n, flags);
3471 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3473 struct isl_basic_map *bmap;
3474 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3475 bmap = isl_basic_map_set_to_empty(bmap);
3479 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3481 struct isl_basic_set *bset;
3482 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3483 bset = isl_basic_set_set_to_empty(bset);
3487 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3489 struct isl_basic_map *bmap;
3492 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3493 bmap = isl_basic_map_set_to_empty(bmap);
3497 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3499 struct isl_basic_map *bmap;
3502 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3503 bmap = isl_basic_map_set_to_empty(bmap);
3507 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3509 struct isl_basic_set *bset;
3512 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3513 bset = isl_basic_set_set_to_empty(bset);
3517 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3519 struct isl_basic_map *bmap;
3520 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3524 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3526 struct isl_basic_set *bset;
3527 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3531 __isl_give isl_basic_map *isl_basic_map_universe_like(
3532 __isl_keep isl_basic_map *model)
3536 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3539 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3543 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3546 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3547 __isl_keep isl_set *model)
3551 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3554 struct isl_map *isl_map_empty(struct isl_dim *dim)
3556 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3559 struct isl_map *isl_map_empty_like(struct isl_map *model)
3563 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3566 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3570 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3573 struct isl_set *isl_set_empty(struct isl_dim *dim)
3575 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3578 struct isl_set *isl_set_empty_like(struct isl_set *model)
3582 return isl_set_empty(isl_dim_copy(model->dim));
3585 struct isl_map *isl_map_universe(struct isl_dim *dim)
3587 struct isl_map *map;
3590 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3591 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3595 struct isl_set *isl_set_universe(struct isl_dim *dim)
3597 struct isl_set *set;
3600 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3601 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3605 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3609 return isl_set_universe(isl_dim_copy(model->dim));
3612 struct isl_map *isl_map_dup(struct isl_map *map)
3615 struct isl_map *dup;
3619 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3620 for (i = 0; i < map->n; ++i)
3621 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3625 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3626 __isl_take isl_basic_map *bmap)
3630 if (isl_basic_map_fast_is_empty(bmap)) {
3631 isl_basic_map_free(bmap);
3634 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3635 isl_assert(map->ctx, map->n < map->size, goto error);
3636 map->p[map->n] = bmap;
3638 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3644 isl_basic_map_free(bmap);
3648 void isl_map_free(struct isl_map *map)
3658 isl_ctx_deref(map->ctx);
3659 for (i = 0; i < map->n; ++i)
3660 isl_basic_map_free(map->p[i]);
3661 isl_dim_free(map->dim);
3665 struct isl_map *isl_map_extend(struct isl_map *base,
3666 unsigned nparam, unsigned n_in, unsigned n_out)
3670 base = isl_map_cow(base);
3674 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3677 for (i = 0; i < base->n; ++i) {
3678 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3679 isl_dim_copy(base->dim), 0, 0, 0);
3689 struct isl_set *isl_set_extend(struct isl_set *base,
3690 unsigned nparam, unsigned dim)
3692 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3696 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3697 struct isl_basic_map *bmap, unsigned pos, int value)
3701 bmap = isl_basic_map_cow(bmap);
3702 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3703 j = isl_basic_map_alloc_equality(bmap);
3706 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3707 isl_int_set_si(bmap->eq[j][pos], -1);
3708 isl_int_set_si(bmap->eq[j][0], value);
3709 bmap = isl_basic_map_simplify(bmap);
3710 return isl_basic_map_finalize(bmap);
3712 isl_basic_map_free(bmap);
3716 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3717 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3721 bmap = isl_basic_map_cow(bmap);
3722 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3723 j = isl_basic_map_alloc_equality(bmap);
3726 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3727 isl_int_set_si(bmap->eq[j][pos], -1);
3728 isl_int_set(bmap->eq[j][0], value);
3729 bmap = isl_basic_map_simplify(bmap);
3730 return isl_basic_map_finalize(bmap);
3732 isl_basic_map_free(bmap);
3736 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3737 enum isl_dim_type type, unsigned pos, int value)
3741 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3742 return isl_basic_map_fix_pos_si(bmap,
3743 isl_basic_map_offset(bmap, type) + pos, value);
3745 isl_basic_map_free(bmap);
3749 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3750 enum isl_dim_type type, unsigned pos, isl_int value)
3754 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3755 return isl_basic_map_fix_pos(bmap,
3756 isl_basic_map_offset(bmap, type) + pos, value);
3758 isl_basic_map_free(bmap);
3762 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3763 enum isl_dim_type type, unsigned pos, int value)
3765 return (struct isl_basic_set *)
3766 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3770 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3771 enum isl_dim_type type, unsigned pos, isl_int value)
3773 return (struct isl_basic_set *)
3774 isl_basic_map_fix((struct isl_basic_map *)bset,
3778 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3779 unsigned input, int value)
3781 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3784 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3785 unsigned dim, int value)
3787 return (struct isl_basic_set *)
3788 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3789 isl_dim_set, dim, value);
3792 struct isl_map *isl_map_fix_si(struct isl_map *map,
3793 enum isl_dim_type type, unsigned pos, int value)
3797 map = isl_map_cow(map);
3801 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3802 for (i = 0; i < map->n; ++i) {
3803 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3807 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3814 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3815 enum isl_dim_type type, unsigned pos, int value)
3817 return (struct isl_set *)
3818 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3821 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3822 enum isl_dim_type type, unsigned pos, isl_int value)
3826 map = isl_map_cow(map);
3830 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3831 for (i = 0; i < map->n; ++i) {
3832 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3836 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3843 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3844 enum isl_dim_type type, unsigned pos, isl_int value)
3846 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3849 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3850 unsigned input, int value)
3852 return isl_map_fix_si(map, isl_dim_in, input, value);
3855 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3857 return (struct isl_set *)
3858 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3861 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3862 __isl_take isl_basic_map *bmap,
3863 enum isl_dim_type type, unsigned pos, int value)
3869 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3870 pos += isl_basic_map_offset(bmap, type);
3871 bmap = isl_basic_map_cow(bmap);
3872 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3873 j = isl_basic_map_alloc_inequality(bmap);
3876 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3877 isl_int_set_si(bmap->ineq[j][pos], 1);
3878 isl_int_set_si(bmap->ineq[j][0], -value);
3879 bmap = isl_basic_map_simplify(bmap);
3880 return isl_basic_map_finalize(bmap);
3882 isl_basic_map_free(bmap);
3886 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3887 unsigned dim, isl_int value)
3891 bset = isl_basic_set_cow(bset);
3892 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3893 j = isl_basic_set_alloc_inequality(bset);
3896 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3897 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3898 isl_int_neg(bset->ineq[j][0], value);
3899 bset = isl_basic_set_simplify(bset);
3900 return isl_basic_set_finalize(bset);
3902 isl_basic_set_free(bset);
3906 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3907 enum isl_dim_type type, unsigned pos, int value)
3911 map = isl_map_cow(map);
3915 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3916 for (i = 0; i < map->n; ++i) {
3917 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3922 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3929 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3930 enum isl_dim_type type, unsigned pos, int value)
3932 return (struct isl_set *)
3933 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
3936 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
3941 set = isl_set_cow(set);
3945 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
3946 for (i = 0; i < set->n; ++i) {
3947 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
3957 struct isl_map *isl_map_reverse(struct isl_map *map)
3961 map = isl_map_cow(map);
3965 map->dim = isl_dim_reverse(map->dim);
3968 for (i = 0; i < map->n; ++i) {
3969 map->p[i] = isl_basic_map_reverse(map->p[i]);
3973 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3980 static struct isl_map *isl_basic_map_partial_lexopt(
3981 struct isl_basic_map *bmap, struct isl_basic_set *dom,
3982 struct isl_set **empty, int max)
3986 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
3987 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
3989 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
3991 isl_basic_map_free(bmap);
3992 isl_basic_set_free(dom);
3998 struct isl_map *isl_basic_map_partial_lexmax(
3999 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4000 struct isl_set **empty)
4002 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4005 struct isl_map *isl_basic_map_partial_lexmin(
4006 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4007 struct isl_set **empty)
4009 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4012 struct isl_set *isl_basic_set_partial_lexmin(
4013 struct isl_basic_set *bset, struct isl_basic_set *dom,
4014 struct isl_set **empty)
4016 return (struct isl_set *)
4017 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4021 struct isl_set *isl_basic_set_partial_lexmax(
4022 struct isl_basic_set *bset, struct isl_basic_set *dom,
4023 struct isl_set **empty)
4025 return (struct isl_set *)
4026 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4030 /* Given a basic map "bmap", compute the lexicograhically minimal
4031 * (or maximal) image element for each domain element in dom.
4032 * Set *empty to those elements in dom that do not have an image element.
4034 * We first make sure the basic sets in dom are disjoint and then
4035 * simply collect the results over each of the basic sets separately.
4036 * We could probably improve the efficiency a bit by moving the union
4037 * domain down into the parametric integer programming.
4039 static __isl_give isl_map *basic_map_partial_lexopt(
4040 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4041 __isl_give isl_set **empty, int max)
4044 struct isl_map *res;
4046 dom = isl_set_make_disjoint(dom);
4050 if (isl_set_fast_is_empty(dom)) {
4051 res = isl_map_empty_like_basic_map(bmap);
4052 *empty = isl_set_empty_like(dom);
4054 isl_basic_map_free(bmap);
4058 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4059 isl_basic_set_copy(dom->p[0]), empty, max);
4061 for (i = 1; i < dom->n; ++i) {
4062 struct isl_map *res_i;
4063 struct isl_set *empty_i;
4065 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4066 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4068 res = isl_map_union_disjoint(res, res_i);
4069 *empty = isl_set_union_disjoint(*empty, empty_i);
4073 isl_basic_map_free(bmap);
4078 isl_basic_map_free(bmap);
4082 /* Given a map "map", compute the lexicograhically minimal
4083 * (or maximal) image element for each domain element in dom.
4084 * Set *empty to those elements in dom that do not have an image element.
4086 * We first compute the lexicographically minimal or maximal element
4087 * in the first basic map. This results in a partial solution "res"
4088 * and a subset "todo" of dom that still need to be handled.
4089 * We then consider each of the remaining maps in "map" and successively
4090 * improve both "res" and "todo".
4092 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4093 * Assume we are computing the lexicographical maximum.
4094 * We first intersect basic map i with a relation that maps elements
4095 * to elements that are lexicographically larger than the image elements
4096 * in res^k and the compute the maximum image element of this intersection.
4097 * The result ("better") corresponds to those image elements in basic map i
4098 * that are better than what we had before. The remainder ("keep") are the
4099 * domain elements for which the image element in res_k was better.
4100 * We also compute the lexicographical maximum of basic map i in todo^k.
4101 * res^i is the result of the operation + better + those elements in
4102 * res^k that we should keep
4103 * todo^i is the remainder of the maximum operation on todo^k.
4105 static __isl_give isl_map *isl_map_partial_lexopt(
4106 __isl_take isl_map *map, __isl_take isl_set *dom,
4107 __isl_give isl_set **empty, int max)
4110 struct isl_map *res;
4111 struct isl_set *todo;
4116 if (isl_map_fast_is_empty(map)) {
4124 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4125 isl_set_copy(dom), &todo, max);
4127 for (i = 1; i < map->n; ++i) {
4129 struct isl_map *better;
4130 struct isl_set *keep;
4131 struct isl_map *res_i;
4132 struct isl_set *todo_i;
4133 struct isl_dim *dim = isl_map_get_dim(res);
4135 dim = isl_dim_range(dim);
4137 lt = isl_map_lex_lt(dim);
4139 lt = isl_map_lex_gt(dim);
4140 lt = isl_map_apply_range(isl_map_copy(res), lt);
4141 lt = isl_map_intersect(lt,
4142 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4143 better = isl_map_partial_lexopt(lt,
4144 isl_map_domain(isl_map_copy(res)),
4147 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4148 todo, &todo_i, max);
4150 res = isl_map_intersect_domain(res, keep);
4151 res = isl_map_union_disjoint(res, res_i);
4152 res = isl_map_union_disjoint(res, better);
4173 __isl_give isl_map *isl_map_partial_lexmax(
4174 __isl_take isl_map *map, __isl_take isl_set *dom,
4175 __isl_give isl_set **empty)
4177 return isl_map_partial_lexopt(map, dom, empty, 1);
4180 __isl_give isl_map *isl_map_partial_lexmin(
4181 __isl_take isl_map *map, __isl_take isl_set *dom,
4182 __isl_give isl_set **empty)
4184 return isl_map_partial_lexopt(map, dom, empty, 0);
4187 __isl_give isl_set *isl_set_partial_lexmin(
4188 __isl_take isl_set *set, __isl_take isl_set *dom,
4189 __isl_give isl_set **empty)
4191 return (struct isl_set *)
4192 isl_map_partial_lexmin((struct isl_map *)set,
4196 __isl_give isl_set *isl_set_partial_lexmax(
4197 __isl_take isl_set *set, __isl_take isl_set *dom,
4198 __isl_give isl_set **empty)
4200 return (struct isl_set *)
4201 isl_map_partial_lexmax((struct isl_map *)set,
4205 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4207 struct isl_basic_set *dom = NULL;
4208 struct isl_dim *dom_dim;
4212 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4213 dom = isl_basic_set_universe(dom_dim);
4214 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4216 isl_basic_map_free(bmap);
4220 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4222 return isl_basic_map_lexopt(bmap, 0);
4225 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4227 return isl_basic_map_lexopt(bmap, 1);
4230 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4232 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4235 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4237 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4240 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4242 struct isl_set *dom = NULL;
4243 struct isl_dim *dom_dim;
4247 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4248 dom = isl_set_universe(dom_dim);
4249 return isl_map_partial_lexopt(map, dom, NULL, max);
4255 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4257 return isl_map_lexopt(map, 0);
4260 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4262 return isl_map_lexopt(map, 1);
4265 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4267 return (isl_set *)isl_map_lexmin((isl_map *)set);
4270 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4272 return (isl_set *)isl_map_lexmax((isl_map *)set);
4275 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4276 struct isl_dim *dim)
4283 for (i = 0; i < map->n; ++i) {
4284 isl_dim_free(map->p[i]->dim);
4285 map->p[i]->dim = isl_dim_copy(dim);
4287 isl_dim_free(map->dim);
4297 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4298 struct isl_dim *dim)
4300 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4303 /* Apply a preimage specified by "mat" on the parameters of "bset".
4304 * bset is assumed to have only parameters and divs.
4306 static struct isl_basic_set *basic_set_parameter_preimage(
4307 struct isl_basic_set *bset, struct isl_mat *mat)
4314 bset->dim = isl_dim_cow(bset->dim);
4318 nparam = isl_basic_set_dim(bset, isl_dim_param);
4320 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4322 bset->dim->nparam = 0;
4323 bset->dim->n_out = nparam;
4324 bset = isl_basic_set_preimage(bset, mat);
4326 bset->dim->nparam = bset->dim->n_out;
4327 bset->dim->n_out = 0;
4332 isl_basic_set_free(bset);
4336 /* Apply a preimage specified by "mat" on the parameters of "set".
4337 * set is assumed to have only parameters and divs.
4339 static struct isl_set *set_parameter_preimage(
4340 struct isl_set *set, struct isl_mat *mat)
4342 struct isl_dim *dim = NULL;
4348 dim = isl_dim_copy(set->dim);
4349 dim = isl_dim_cow(dim);
4353 nparam = isl_set_dim(set, isl_dim_param);
4355 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4358 dim->n_out = nparam;
4359 isl_set_reset_dim(set, dim);
4360 set = isl_set_preimage(set, mat);
4363 dim = isl_dim_copy(set->dim);
4364 dim = isl_dim_cow(dim);
4367 dim->nparam = dim->n_out;
4369 isl_set_reset_dim(set, dim);
4379 /* Intersect the basic set "bset" with the affine space specified by the
4380 * equalities in "eq".
4382 static struct isl_basic_set *basic_set_append_equalities(
4383 struct isl_basic_set *bset, struct isl_mat *eq)
4391 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4396 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4397 for (i = 0; i < eq->n_row; ++i) {
4398 k = isl_basic_set_alloc_equality(bset);
4401 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4402 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4406 bset = isl_basic_set_gauss(bset, NULL);
4407 bset = isl_basic_set_finalize(bset);
4412 isl_basic_set_free(bset);
4416 /* Intersect the set "set" with the affine space specified by the
4417 * equalities in "eq".
4419 static struct isl_set *set_append_equalities(struct isl_set *set,
4427 for (i = 0; i < set->n; ++i) {
4428 set->p[i] = basic_set_append_equalities(set->p[i],
4441 /* Project the given basic set onto its parameter domain, possibly introducing
4442 * new, explicit, existential variables in the constraints.
4443 * The input has parameters and (possibly implicit) existential variables.
4444 * The output has the same parameters, but only
4445 * explicit existentially quantified variables.
4447 * The actual projection is performed by pip, but pip doesn't seem
4448 * to like equalities very much, so we first remove the equalities
4449 * among the parameters by performing a variable compression on
4450 * the parameters. Afterward, an inverse transformation is performed
4451 * and the equalities among the parameters are inserted back in.
4453 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4457 struct isl_mat *T, *T2;
4458 struct isl_set *set;
4459 unsigned nparam, n_div;
4461 bset = isl_basic_set_cow(bset);
4465 if (bset->n_eq == 0)
4466 return isl_basic_set_lexmin(bset);
4468 isl_basic_set_gauss(bset, NULL);
4470 nparam = isl_basic_set_dim(bset, isl_dim_param);
4471 n_div = isl_basic_set_dim(bset, isl_dim_div);
4473 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4474 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4477 if (i == bset->n_eq)
4478 return isl_basic_set_lexmin(bset);
4480 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4482 eq = isl_mat_cow(eq);
4483 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4484 if (T && T->n_col == 0) {
4488 bset = isl_basic_set_set_to_empty(bset);
4489 return isl_set_from_basic_set(bset);
4491 bset = basic_set_parameter_preimage(bset, T);
4493 set = isl_basic_set_lexmin(bset);
4494 set = set_parameter_preimage(set, T2);
4495 set = set_append_equalities(set, eq);
4499 /* Compute an explicit representation for all the existentially
4500 * quantified variables.
4501 * The input and output dimensions are first turned into parameters.
4502 * compute_divs then returns a map with the same parameters and
4503 * no input or output dimensions and the dimension specification
4504 * is reset to that of the input.
4506 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4508 struct isl_basic_set *bset;
4509 struct isl_set *set;
4510 struct isl_map *map;
4511 struct isl_dim *dim, *orig_dim = NULL;
4516 bmap = isl_basic_map_cow(bmap);
4520 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4521 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4522 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4523 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4527 orig_dim = bmap->dim;
4529 bset = (struct isl_basic_set *)bmap;
4531 set = parameter_compute_divs(bset);
4532 map = (struct isl_map *)set;
4533 map = isl_map_reset_dim(map, orig_dim);
4537 isl_basic_map_free(bmap);
4541 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4549 off = isl_dim_total(bmap->dim);
4550 for (i = 0; i < bmap->n_div; ++i) {
4551 if (isl_int_is_zero(bmap->div[i][0]))
4553 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4559 static int map_divs_known(__isl_keep isl_map *map)
4566 for (i = 0; i < map->n; ++i) {
4567 int known = basic_map_divs_known(map->p[i]);
4575 /* If bmap contains any unknown divs, then compute explicit
4576 * expressions for them. However, this computation may be
4577 * quite expensive, so first try to remove divs that aren't
4580 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4584 struct isl_map *map;
4586 known = basic_map_divs_known(bmap);
4590 return isl_map_from_basic_map(bmap);
4592 bmap = isl_basic_map_drop_redundant_divs(bmap);
4594 known = basic_map_divs_known(bmap);
4598 return isl_map_from_basic_map(bmap);
4600 map = compute_divs(bmap);
4603 isl_basic_map_free(bmap);
4607 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4611 struct isl_map *res;
4618 known = map_divs_known(map);
4626 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4627 for (i = 1 ; i < map->n; ++i) {
4629 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4630 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4631 res = isl_map_union_disjoint(res, r2);
4633 res = isl_map_union(res, r2);
4640 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4642 return (struct isl_set *)
4643 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4646 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4648 return (struct isl_set *)
4649 isl_map_compute_divs((struct isl_map *)set);
4652 struct isl_set *isl_map_domain(struct isl_map *map)
4655 struct isl_set *set;
4660 map = isl_map_cow(map);
4664 set = (struct isl_set *)map;
4665 set->dim = isl_dim_domain(set->dim);
4668 for (i = 0; i < map->n; ++i) {
4669 set->p[i] = isl_basic_map_domain(map->p[i]);
4673 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4674 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4681 struct isl_map *isl_map_union_disjoint(
4682 struct isl_map *map1, struct isl_map *map2)
4686 struct isl_map *map = NULL;
4700 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4702 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4703 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4704 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4706 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4707 map1->n + map2->n, flags);
4710 for (i = 0; i < map1->n; ++i) {
4711 map = isl_map_add_basic_map(map,
4712 isl_basic_map_copy(map1->p[i]));
4716 for (i = 0; i < map2->n; ++i) {
4717 map = isl_map_add_basic_map(map,
4718 isl_basic_map_copy(map2->p[i]));
4732 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4734 map1 = isl_map_union_disjoint(map1, map2);
4738 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4742 struct isl_set *isl_set_union_disjoint(
4743 struct isl_set *set1, struct isl_set *set2)
4745 return (struct isl_set *)
4746 isl_map_union_disjoint(
4747 (struct isl_map *)set1, (struct isl_map *)set2);
4750 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4752 return (struct isl_set *)
4753 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4756 struct isl_map *isl_map_intersect_range(
4757 struct isl_map *map, struct isl_set *set)
4760 struct isl_map *result;
4766 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4767 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4768 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4770 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4771 map->n * set->n, flags);
4774 for (i = 0; i < map->n; ++i)
4775 for (j = 0; j < set->n; ++j) {
4776 result = isl_map_add_basic_map(result,
4777 isl_basic_map_intersect_range(
4778 isl_basic_map_copy(map->p[i]),
4779 isl_basic_set_copy(set->p[j])));
4792 struct isl_map *isl_map_intersect_domain(
4793 struct isl_map *map, struct isl_set *set)
4795 return isl_map_reverse(
4796 isl_map_intersect_range(isl_map_reverse(map), set));
4799 struct isl_map *isl_map_apply_domain(
4800 struct isl_map *map1, struct isl_map *map2)
4804 map1 = isl_map_reverse(map1);
4805 map1 = isl_map_apply_range(map1, map2);
4806 return isl_map_reverse(map1);
4813 struct isl_map *isl_map_apply_range(
4814 struct isl_map *map1, struct isl_map *map2)
4816 struct isl_dim *dim_result;
4817 struct isl_map *result;
4823 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4824 isl_dim_copy(map2->dim));
4826 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4829 for (i = 0; i < map1->n; ++i)
4830 for (j = 0; j < map2->n; ++j) {
4831 result = isl_map_add_basic_map(result,
4832 isl_basic_map_apply_range(
4833 isl_basic_map_copy(map1->p[i]),
4834 isl_basic_map_copy(map2->p[j])));
4840 if (result && result->n <= 1)
4841 ISL_F_SET(result, ISL_MAP_DISJOINT);
4850 * returns range - domain
4852 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4855 struct isl_basic_set *bset;
4862 dim = isl_basic_map_n_in(bmap);
4863 nparam = isl_basic_map_n_param(bmap);
4864 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4865 bset = isl_basic_set_from_basic_map(bmap);
4866 bset = isl_basic_set_cow(bset);
4867 dims = isl_basic_set_get_dim(bset);
4868 dims = isl_dim_add(dims, isl_dim_set, dim);
4869 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
4870 bset = isl_basic_set_swap_vars(bset, 2*dim);
4871 for (i = 0; i < dim; ++i) {
4872 int j = isl_basic_map_alloc_equality(
4873 (struct isl_basic_map *)bset);
4876 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4877 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4878 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4879 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4881 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4883 isl_basic_map_free(bmap);
4888 * returns range - domain
4890 struct isl_set *isl_map_deltas(struct isl_map *map)
4894 struct isl_set *result;
4899 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4900 dim = isl_map_get_dim(map);
4901 dim = isl_dim_domain(dim);
4902 result = isl_set_alloc_dim(dim, map->n, map->flags);
4905 for (i = 0; i < map->n; ++i)
4906 result = isl_set_add_basic_set(result,
4907 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4915 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4917 struct isl_basic_map *bmap;
4925 nparam = dims->nparam;
4927 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4931 for (i = 0; i < dim; ++i) {
4932 int j = isl_basic_map_alloc_equality(bmap);
4935 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
4936 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
4937 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
4939 return isl_basic_map_finalize(bmap);
4941 isl_basic_map_free(bmap);
4945 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
4947 struct isl_dim *dim = isl_dim_map(set_dim);
4950 return basic_map_identity(dim);
4953 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
4955 if (!model || !model->dim)
4957 isl_assert(model->ctx,
4958 model->dim->n_in == model->dim->n_out, return NULL);
4959 return basic_map_identity(isl_dim_copy(model->dim));
4962 static struct isl_map *map_identity(struct isl_dim *dim)
4964 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
4965 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
4968 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
4970 struct isl_dim *dim = isl_dim_map(set_dim);
4973 return map_identity(dim);
4976 struct isl_map *isl_map_identity_like(struct isl_map *model)
4978 if (!model || !model->dim)
4980 isl_assert(model->ctx,
4981 model->dim->n_in == model->dim->n_out, return NULL);
4982 return map_identity(isl_dim_copy(model->dim));
4985 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
4987 if (!model || !model->dim)
4989 isl_assert(model->ctx,
4990 model->dim->n_in == model->dim->n_out, return NULL);
4991 return map_identity(isl_dim_copy(model->dim));
4994 /* Construct a basic set with all set dimensions having only non-negative
4997 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5002 struct isl_basic_set *bset;
5006 nparam = dims->nparam;
5008 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5011 for (i = 0; i < dim; ++i) {
5012 int k = isl_basic_set_alloc_inequality(bset);
5015 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5016 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5020 isl_basic_set_free(bset);
5024 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5025 enum isl_dim_type type, unsigned first, unsigned n)
5028 isl_basic_set *nonneg = NULL;
5029 isl_basic_set *neg = NULL;
5036 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5038 for (i = 0; i < n; ++i) {
5042 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5043 k = isl_basic_set_alloc_inequality(nonneg);
5046 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5047 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5049 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5050 k = isl_basic_set_alloc_inequality(neg);
5053 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5054 isl_int_set_si(neg->ineq[k][0], -1);
5055 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5057 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5062 isl_basic_set_free(nonneg);
5063 isl_basic_set_free(neg);
5068 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5070 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5073 int isl_basic_map_is_subset(
5074 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5077 struct isl_map *map1;
5078 struct isl_map *map2;
5080 if (!bmap1 || !bmap2)
5083 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5084 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5086 is_subset = isl_map_is_subset(map1, map2);
5094 int isl_basic_map_is_equal(
5095 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5099 if (!bmap1 || !bmap2)
5101 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5104 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5108 int isl_basic_set_is_equal(
5109 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5111 return isl_basic_map_is_equal(
5112 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5115 int isl_map_is_empty(struct isl_map *map)
5122 for (i = 0; i < map->n; ++i) {
5123 is_empty = isl_basic_map_is_empty(map->p[i]);
5132 int isl_map_fast_is_empty(struct isl_map *map)
5137 int isl_set_fast_is_empty(struct isl_set *set)
5142 int isl_set_is_empty(struct isl_set *set)
5144 return isl_map_is_empty((struct isl_map *)set);
5147 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5153 is_subset = isl_map_is_subset(map1, map2);
5156 is_subset = isl_map_is_subset(map2, map1);
5160 int isl_basic_map_is_strict_subset(
5161 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5165 if (!bmap1 || !bmap2)
5167 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5170 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5171 if (is_subset == -1)
5176 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5182 is_subset = isl_map_is_subset(map1, map2);
5185 is_subset = isl_map_is_subset(map2, map1);
5186 if (is_subset == -1)
5191 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5193 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5196 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5200 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5203 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5207 return bset->n_eq == 0 && bset->n_ineq == 0;
5210 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5215 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
5218 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5220 return isl_map_fast_is_universe((isl_map *) set);
5223 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5225 struct isl_basic_set *bset = NULL;
5226 struct isl_vec *sample = NULL;
5233 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5236 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5237 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5238 copy = isl_basic_map_convex_hull(copy);
5239 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5240 isl_basic_map_free(copy);
5244 total = 1 + isl_basic_map_total_dim(bmap);
5245 if (bmap->sample && bmap->sample->size == total) {
5246 int contains = isl_basic_map_contains(bmap, bmap->sample);
5252 isl_vec_free(bmap->sample);
5253 bmap->sample = NULL;
5254 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5257 sample = isl_basic_set_sample_vec(bset);
5260 empty = sample->size == 0;
5261 isl_vec_free(bmap->sample);
5262 bmap->sample = sample;
5264 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5269 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5273 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5276 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5280 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5283 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5285 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5288 struct isl_map *isl_basic_map_union(
5289 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5291 struct isl_map *map;
5292 if (!bmap1 || !bmap2)
5295 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5297 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5300 map = isl_map_add_basic_map(map, bmap1);
5301 map = isl_map_add_basic_map(map, bmap2);
5304 isl_basic_map_free(bmap1);
5305 isl_basic_map_free(bmap2);
5309 struct isl_set *isl_basic_set_union(
5310 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5312 return (struct isl_set *)isl_basic_map_union(
5313 (struct isl_basic_map *)bset1,
5314 (struct isl_basic_map *)bset2);
5317 /* Order divs such that any div only depends on previous divs */
5318 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5321 unsigned off = isl_dim_total(bmap->dim);
5323 for (i = 0; i < bmap->n_div; ++i) {
5325 if (isl_int_is_zero(bmap->div[i][0]))
5327 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5331 isl_basic_map_swap_div(bmap, i, i + pos);
5337 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5339 return (struct isl_basic_set *)
5340 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5343 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5350 for (i = 0; i < map->n; ++i) {
5351 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5362 /* Look for a div in dst that corresponds to the div "div" in src.
5363 * The divs before "div" in src and dst are assumed to be the same.
5365 * Returns -1 if no corresponding div was found and the position
5366 * of the corresponding div in dst otherwise.
5368 static int find_div(struct isl_basic_map *dst,
5369 struct isl_basic_map *src, unsigned div)
5373 unsigned total = isl_dim_total(src->dim);
5375 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5376 for (i = div; i < dst->n_div; ++i)
5377 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5378 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5379 dst->n_div - div) == -1)
5384 struct isl_basic_map *isl_basic_map_align_divs(
5385 struct isl_basic_map *dst, struct isl_basic_map *src)
5388 unsigned total = isl_dim_total(src->dim);
5393 if (src->n_div == 0)
5396 for (i = 0; i < src->n_div; ++i)
5397 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5399 src = isl_basic_map_order_divs(src);
5400 dst = isl_basic_map_cow(dst);
5401 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5402 src->n_div, 0, 2 * src->n_div);
5405 for (i = 0; i < src->n_div; ++i) {
5406 int j = find_div(dst, src, i);
5408 j = isl_basic_map_alloc_div(dst);
5411 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5412 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5413 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5417 isl_basic_map_swap_div(dst, i, j);
5421 isl_basic_map_free(dst);
5425 struct isl_basic_set *isl_basic_set_align_divs(
5426 struct isl_basic_set *dst, struct isl_basic_set *src)
5428 return (struct isl_basic_set *)isl_basic_map_align_divs(
5429 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5432 struct isl_map *isl_map_align_divs(struct isl_map *map)
5440 map = isl_map_compute_divs(map);
5441 map = isl_map_cow(map);
5445 for (i = 1; i < map->n; ++i)
5446 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5447 for (i = 1; i < map->n; ++i)
5448 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5450 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5454 struct isl_set *isl_set_align_divs(struct isl_set *set)
5456 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5459 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5463 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5464 map = isl_map_intersect_domain(map, set);
5465 set = isl_map_range(map);
5473 /* There is no need to cow as removing empty parts doesn't change
5474 * the meaning of the set.
5476 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5483 for (i = map->n-1; i >= 0; --i) {
5484 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5486 isl_basic_map_free(map->p[i]);
5487 if (i != map->n-1) {
5488 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5489 map->p[i] = map->p[map->n-1];
5497 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5499 return (struct isl_set *)
5500 isl_map_remove_empty_parts((struct isl_map *)set);
5503 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5505 struct isl_basic_map *bmap;
5506 if (!map || map->n == 0)
5508 bmap = map->p[map->n-1];
5509 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5510 return isl_basic_map_copy(bmap);
5513 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5515 return (struct isl_basic_set *)
5516 isl_map_copy_basic_map((struct isl_map *)set);
5519 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5520 __isl_keep isl_basic_map *bmap)
5526 for (i = map->n-1; i >= 0; --i) {
5527 if (map->p[i] != bmap)
5529 map = isl_map_cow(map);
5532 isl_basic_map_free(map->p[i]);
5533 if (i != map->n-1) {
5534 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5535 map->p[i] = map->p[map->n-1];
5546 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5547 struct isl_basic_set *bset)
5549 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5550 (struct isl_basic_map *)bset);
5553 /* Given two basic sets bset1 and bset2, compute the maximal difference
5554 * between the values of dimension pos in bset1 and those in bset2
5555 * for any common value of the parameters and dimensions preceding pos.
5557 static enum isl_lp_result basic_set_maximal_difference_at(
5558 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5559 int pos, isl_int *opt)
5561 struct isl_dim *dims;
5562 struct isl_basic_map *bmap1 = NULL;
5563 struct isl_basic_map *bmap2 = NULL;
5564 struct isl_ctx *ctx;
5565 struct isl_vec *obj;
5568 unsigned dim1, dim2;
5569 enum isl_lp_result res;
5571 if (!bset1 || !bset2)
5572 return isl_lp_error;
5574 nparam = isl_basic_set_n_param(bset1);
5575 dim1 = isl_basic_set_n_dim(bset1);
5576 dim2 = isl_basic_set_n_dim(bset2);
5577 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5578 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5579 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5580 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5581 if (!bmap1 || !bmap2)
5583 bmap1 = isl_basic_map_cow(bmap1);
5584 bmap1 = isl_basic_map_extend(bmap1, nparam,
5585 pos, (dim1 - pos) + (dim2 - pos),
5586 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5587 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5590 total = isl_basic_map_total_dim(bmap1);
5592 obj = isl_vec_alloc(ctx, 1 + total);
5593 isl_seq_clr(obj->block.data, 1 + total);
5594 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5595 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5598 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5600 isl_basic_map_free(bmap1);
5604 isl_basic_map_free(bmap1);
5605 isl_basic_map_free(bmap2);
5606 return isl_lp_error;
5609 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5610 * for any common value of the parameters and dimensions preceding pos
5611 * in both basic sets, the values of dimension pos in bset1 are
5612 * smaller or larger than those in bset2.
5615 * 1 if bset1 follows bset2
5616 * -1 if bset1 precedes bset2
5617 * 0 if bset1 and bset2 are incomparable
5618 * -2 if some error occurred.
5620 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5621 struct isl_basic_set *bset2, int pos)
5624 enum isl_lp_result res;
5629 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5631 if (res == isl_lp_empty)
5633 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5634 res == isl_lp_unbounded)
5636 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5645 /* Given two basic sets bset1 and bset2, check whether
5646 * for any common value of the parameters and dimensions preceding pos
5647 * there is a value of dimension pos in bset1 that is larger
5648 * than a value of the same dimension in bset2.
5651 * 1 if there exists such a pair
5652 * 0 if there is no such pair, but there is a pair of equal values
5654 * -2 if some error occurred.
5656 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5657 __isl_keep isl_basic_set *bset2, int pos)
5660 enum isl_lp_result res;
5665 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5667 if (res == isl_lp_empty)
5669 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5670 res == isl_lp_unbounded)
5672 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5674 else if (res == isl_lp_ok)
5683 /* Given two sets set1 and set2, check whether
5684 * for any common value of the parameters and dimensions preceding pos
5685 * there is a value of dimension pos in set1 that is larger
5686 * than a value of the same dimension in set2.
5689 * 1 if there exists such a pair
5690 * 0 if there is no such pair, but there is a pair of equal values
5692 * -2 if some error occurred.
5694 int isl_set_follows_at(__isl_keep isl_set *set1,
5695 __isl_keep isl_set *set2, int pos)
5703 for (i = 0; i < set1->n; ++i)
5704 for (j = 0; j < set2->n; ++j) {
5706 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5707 if (f == 1 || f == -2)
5716 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5717 unsigned pos, isl_int *val)
5725 total = isl_basic_map_total_dim(bmap);
5726 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5727 for (; d+1 > pos; --d)
5728 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5732 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5734 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5736 if (!isl_int_is_one(bmap->eq[i][1+d]))
5739 isl_int_neg(*val, bmap->eq[i][0]);
5745 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5746 unsigned pos, isl_int *val)
5758 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5761 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5762 for (i = 1; fixed == 1 && i < map->n; ++i) {
5763 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5764 if (fixed == 1 && isl_int_ne(tmp, v))
5768 isl_int_set(*val, v);
5774 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5775 unsigned pos, isl_int *val)
5777 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5781 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5784 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5787 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5788 enum isl_dim_type type, unsigned pos, isl_int *val)
5790 if (pos >= isl_basic_map_dim(bmap, type))
5792 return isl_basic_map_fast_has_fixed_var(bmap,
5793 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5796 int isl_map_fast_is_fixed(struct isl_map *map,
5797 enum isl_dim_type type, unsigned pos, isl_int *val)
5799 if (pos >= isl_map_dim(map, type))
5801 return isl_map_fast_has_fixed_var(map,
5802 map_offset(map, type) - 1 + pos, val);
5805 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5806 * then return this fixed value in *val.
5808 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5811 return isl_basic_set_fast_has_fixed_var(bset,
5812 isl_basic_set_n_param(bset) + dim, val);
5815 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5816 * then return this fixed value in *val.
5818 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5820 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5823 /* Check if input variable in has fixed value and if so and if val is not NULL,
5824 * then return this fixed value in *val.
5826 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5828 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5831 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5832 * and if val is not NULL, then return this lower bound in *val.
5834 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5835 unsigned dim, isl_int *val)
5837 int i, i_eq = -1, i_ineq = -1;
5844 total = isl_basic_set_total_dim(bset);
5845 nparam = isl_basic_set_n_param(bset);
5846 for (i = 0; i < bset->n_eq; ++i) {
5847 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5853 for (i = 0; i < bset->n_ineq; ++i) {
5854 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5856 if (i_eq != -1 || i_ineq != -1)
5860 if (i_eq == -1 && i_ineq == -1)
5862 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5863 /* The coefficient should always be one due to normalization. */
5864 if (!isl_int_is_one(c[1+nparam+dim]))
5866 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5868 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5869 total - nparam - dim - 1) != -1)
5872 isl_int_neg(*val, c[0]);
5876 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5877 unsigned dim, isl_int *val)
5889 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5893 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5895 for (i = 1; fixed == 1 && i < set->n; ++i) {
5896 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5898 if (fixed == 1 && isl_int_ne(tmp, v))
5902 isl_int_set(*val, v);
5913 static int qsort_constraint_cmp(const void *p1, const void *p2)
5915 const struct constraint *c1 = (const struct constraint *)p1;
5916 const struct constraint *c2 = (const struct constraint *)p2;
5917 unsigned size = isl_min(c1->size, c2->size);
5918 return isl_seq_cmp(c1->c, c2->c, size);
5921 static struct isl_basic_map *isl_basic_map_sort_constraints(
5922 struct isl_basic_map *bmap)
5925 struct constraint *c;
5930 total = isl_basic_map_total_dim(bmap);
5931 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
5934 for (i = 0; i < bmap->n_ineq; ++i) {
5936 c[i].c = bmap->ineq[i];
5938 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
5939 for (i = 0; i < bmap->n_ineq; ++i)
5940 bmap->ineq[i] = c[i].c;
5944 isl_basic_map_free(bmap);
5948 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
5952 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
5954 bmap = isl_basic_map_convex_hull(bmap);
5955 bmap = isl_basic_map_sort_constraints(bmap);
5956 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
5960 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
5962 return (struct isl_basic_set *)isl_basic_map_normalize(
5963 (struct isl_basic_map *)bset);
5966 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
5967 const struct isl_basic_map *bmap2)
5974 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
5975 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
5976 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
5977 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5978 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
5979 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
5980 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
5981 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5983 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
5985 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
5987 if (bmap1->n_eq != bmap2->n_eq)
5988 return bmap1->n_eq - bmap2->n_eq;
5989 if (bmap1->n_ineq != bmap2->n_ineq)
5990 return bmap1->n_ineq - bmap2->n_ineq;
5991 if (bmap1->n_div != bmap2->n_div)
5992 return bmap1->n_div - bmap2->n_div;
5993 total = isl_basic_map_total_dim(bmap1);
5994 for (i = 0; i < bmap1->n_eq; ++i) {
5995 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
5999 for (i = 0; i < bmap1->n_ineq; ++i) {
6000 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6004 for (i = 0; i < bmap1->n_div; ++i) {
6005 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6012 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
6013 struct isl_basic_map *bmap2)
6015 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6018 static int qsort_bmap_cmp(const void *p1, const void *p2)
6020 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6021 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6023 return isl_basic_map_fast_cmp(bmap1, bmap2);
6026 /* We normalize in place, but if anything goes wrong we need
6027 * to return NULL, so we need to make sure we don't change the
6028 * meaning of any possible other copies of map.
6030 struct isl_map *isl_map_normalize(struct isl_map *map)
6033 struct isl_basic_map *bmap;
6037 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6039 for (i = 0; i < map->n; ++i) {
6040 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6043 isl_basic_map_free(map->p[i]);
6046 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6047 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6048 map = isl_map_remove_empty_parts(map);
6051 for (i = map->n - 1; i >= 1; --i) {
6052 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6054 isl_basic_map_free(map->p[i-1]);
6055 for (j = i; j < map->n; ++j)
6056 map->p[j-1] = map->p[j];
6066 struct isl_set *isl_set_normalize(struct isl_set *set)
6068 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6071 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6081 if (!isl_dim_equal(map1->dim, map2->dim))
6084 map1 = isl_map_copy(map1);
6085 map2 = isl_map_copy(map2);
6086 map1 = isl_map_normalize(map1);
6087 map2 = isl_map_normalize(map2);
6090 equal = map1->n == map2->n;
6091 for (i = 0; equal && i < map1->n; ++i) {
6092 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6105 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6107 return isl_map_fast_is_equal((struct isl_map *)set1,
6108 (struct isl_map *)set2);
6111 /* Return an interval that ranges from min to max (inclusive)
6113 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6114 isl_int min, isl_int max)
6117 struct isl_basic_set *bset = NULL;
6119 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6123 k = isl_basic_set_alloc_inequality(bset);
6126 isl_int_set_si(bset->ineq[k][1], 1);
6127 isl_int_neg(bset->ineq[k][0], min);
6129 k = isl_basic_set_alloc_inequality(bset);
6132 isl_int_set_si(bset->ineq[k][1], -1);
6133 isl_int_set(bset->ineq[k][0], max);
6137 isl_basic_set_free(bset);
6141 /* Return the Cartesian product of the basic sets in list (in the given order).
6143 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6151 struct isl_basic_set *product = NULL;
6155 isl_assert(list->ctx, list->n > 0, goto error);
6156 isl_assert(list->ctx, list->p[0], goto error);
6157 nparam = isl_basic_set_n_param(list->p[0]);
6158 dim = isl_basic_set_n_dim(list->p[0]);
6159 extra = list->p[0]->n_div;
6160 n_eq = list->p[0]->n_eq;
6161 n_ineq = list->p[0]->n_ineq;
6162 for (i = 1; i < list->n; ++i) {
6163 isl_assert(list->ctx, list->p[i], goto error);
6164 isl_assert(list->ctx,
6165 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6166 dim += isl_basic_set_n_dim(list->p[i]);
6167 extra += list->p[i]->n_div;
6168 n_eq += list->p[i]->n_eq;
6169 n_ineq += list->p[i]->n_ineq;
6171 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6176 for (i = 0; i < list->n; ++i) {
6177 isl_basic_set_add_constraints(product,
6178 isl_basic_set_copy(list->p[i]), dim);
6179 dim += isl_basic_set_n_dim(list->p[i]);
6181 isl_basic_set_list_free(list);
6184 isl_basic_set_free(product);
6185 isl_basic_set_list_free(list);
6189 struct isl_basic_map *isl_basic_map_product(
6190 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6192 struct isl_dim *dim_result = NULL;
6193 struct isl_basic_map *bmap;
6194 unsigned in1, in2, out1, out2, nparam, total, pos;
6195 struct isl_dim_map *dim_map1, *dim_map2;
6197 if (!bmap1 || !bmap2)
6200 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6201 bmap2->dim, isl_dim_param), goto error);
6202 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6203 isl_dim_copy(bmap2->dim));
6205 in1 = isl_basic_map_n_in(bmap1);
6206 in2 = isl_basic_map_n_in(bmap2);
6207 out1 = isl_basic_map_n_out(bmap1);
6208 out2 = isl_basic_map_n_out(bmap2);
6209 nparam = isl_basic_map_n_param(bmap1);
6211 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6212 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6213 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6214 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6215 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6216 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6217 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6218 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6219 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6220 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6221 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6223 bmap = isl_basic_map_alloc_dim(dim_result,
6224 bmap1->n_div + bmap2->n_div,
6225 bmap1->n_eq + bmap2->n_eq,
6226 bmap1->n_ineq + bmap2->n_ineq);
6227 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6228 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6229 bmap = isl_basic_map_simplify(bmap);
6230 return isl_basic_map_finalize(bmap);
6232 isl_basic_map_free(bmap1);
6233 isl_basic_map_free(bmap2);
6237 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6239 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6242 struct isl_map *result;
6248 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6249 map2->dim, isl_dim_param), goto error);
6251 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6252 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6253 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6255 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6256 isl_dim_copy(map2->dim)),
6257 map1->n * map2->n, flags);
6260 for (i = 0; i < map1->n; ++i)
6261 for (j = 0; j < map2->n; ++j) {
6262 struct isl_basic_map *part;
6263 part = isl_basic_map_product(
6264 isl_basic_map_copy(map1->p[i]),
6265 isl_basic_map_copy(map2->p[j]));
6266 if (isl_basic_map_is_empty(part))
6267 isl_basic_map_free(part);
6269 result = isl_map_add_basic_map(result, part);
6282 /* Given two set A and B, construct its Cartesian product A x B.
6284 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6286 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6287 (struct isl_map *)set2);
6290 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6293 uint32_t hash = isl_hash_init();
6298 bset = isl_basic_set_copy(bset);
6299 bset = isl_basic_set_normalize(bset);
6302 total = isl_basic_set_total_dim(bset);
6303 isl_hash_byte(hash, bset->n_eq & 0xFF);
6304 for (i = 0; i < bset->n_eq; ++i) {
6306 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6307 isl_hash_hash(hash, c_hash);
6309 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6310 for (i = 0; i < bset->n_ineq; ++i) {
6312 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6313 isl_hash_hash(hash, c_hash);
6315 isl_hash_byte(hash, bset->n_div & 0xFF);
6316 for (i = 0; i < bset->n_div; ++i) {
6318 if (isl_int_is_zero(bset->div[i][0]))
6320 isl_hash_byte(hash, i & 0xFF);
6321 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6322 isl_hash_hash(hash, c_hash);
6324 isl_basic_set_free(bset);
6328 uint32_t isl_set_get_hash(struct isl_set *set)
6335 set = isl_set_copy(set);
6336 set = isl_set_normalize(set);
6340 hash = isl_hash_init();
6341 for (i = 0; i < set->n; ++i) {
6343 bset_hash = isl_basic_set_get_hash(set->p[i]);
6344 isl_hash_hash(hash, bset_hash);
6352 /* Check if the value for dimension dim is completely determined
6353 * by the values of the other parameters and variables.
6354 * That is, check if dimension dim is involved in an equality.
6356 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6363 nparam = isl_basic_set_n_param(bset);
6364 for (i = 0; i < bset->n_eq; ++i)
6365 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6370 /* Check if the value for dimension dim is completely determined
6371 * by the values of the other parameters and variables.
6372 * That is, check if dimension dim is involved in an equality
6373 * for each of the subsets.
6375 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6381 for (i = 0; i < set->n; ++i) {
6383 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6390 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6391 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6398 for (i = 0; i < map->n; ++i)
6399 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6405 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6406 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6413 for (i = 0; i < set->n; ++i)
6414 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6420 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6422 struct isl_dim *dim;
6427 if (bset->n_div == 0)
6430 bset = isl_basic_set_cow(bset);
6434 dim = isl_basic_set_get_dim(bset);
6435 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6438 isl_dim_free(bset->dim);
6444 isl_basic_set_free(bset);
6448 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6451 struct isl_dim *dim;
6454 set = isl_set_align_divs(set);
6458 if (set->n == 0 || set->p[0]->n_div == 0)
6461 set = isl_set_cow(set);
6465 n_div = set->p[0]->n_div;
6466 dim = isl_set_get_dim(set);
6467 dim = isl_dim_add(dim, isl_dim_set, n_div);
6470 isl_dim_free(set->dim);
6473 for (i = 0; i < set->n; ++i) {
6474 set->p[i] = isl_basic_set_lift(set->p[i]);
6485 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6487 struct isl_dim *dim;
6488 struct isl_basic_map *bmap;
6495 set = isl_set_align_divs(set);
6500 dim = isl_set_get_dim(set);
6501 if (set->n == 0 || set->p[0]->n_div == 0) {
6503 return isl_map_identity(dim);
6506 n_div = set->p[0]->n_div;
6507 dim = isl_dim_map(dim);
6508 n_param = isl_dim_size(dim, isl_dim_param);
6509 n_set = isl_dim_size(dim, isl_dim_in);
6510 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6511 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6512 for (i = 0; i < n_set; ++i)
6513 bmap = var_equal(bmap, i);
6515 total = n_param + n_set + n_set + n_div;
6516 for (i = 0; i < n_div; ++i) {
6517 k = isl_basic_map_alloc_inequality(bmap);
6520 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6521 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6522 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6523 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6524 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6525 set->p[0]->div[i][0]);
6527 l = isl_basic_map_alloc_inequality(bmap);
6530 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6531 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6532 set->p[0]->div[i][0]);
6533 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6537 return isl_map_from_basic_map(bmap);
6540 isl_basic_map_free(bmap);
6544 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6552 dim = isl_basic_set_total_dim(bset);
6553 size += bset->n_eq * (1 + dim);
6554 size += bset->n_ineq * (1 + dim);
6555 size += bset->n_div * (2 + dim);
6560 int isl_set_size(__isl_keep isl_set *set)
6568 for (i = 0; i < set->n; ++i)
6569 size += isl_basic_set_size(set->p[i]);
6574 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6575 enum isl_dim_type type, unsigned pos)
6583 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6585 pos += isl_basic_map_offset(bmap, type);
6587 for (i = 0; i < bmap->n_eq; ++i)
6588 if (!isl_int_is_zero(bmap->eq[i][pos]))
6592 for (i = 0; i < bmap->n_ineq; ++i) {
6593 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6600 return lower && upper;
6603 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6604 enum isl_dim_type type, unsigned pos)
6611 for (i = 0; i < map->n; ++i) {
6613 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6614 if (bounded < 0 || !bounded)
6621 /* Return 1 if the specified dim is involved in both an upper bound
6622 * and a lower bound.
6624 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6625 enum isl_dim_type type, unsigned pos)
6627 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6630 /* For each of the "n" variables starting at "first", determine
6631 * the sign of the variable and put the results in the first "n"
6632 * elements of the array "signs".
6634 * 1 means that the variable is non-negative
6635 * -1 means that the variable is non-positive
6636 * 0 means the variable attains both positive and negative values.
6638 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6639 unsigned first, unsigned n, int *signs)
6641 isl_vec *bound = NULL;
6642 struct isl_tab *tab = NULL;
6643 struct isl_tab_undo *snap;
6646 if (!bset || !signs)
6649 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6650 tab = isl_tab_from_basic_set(bset);
6654 isl_seq_clr(bound->el, bound->size);
6655 isl_int_set_si(bound->el[0], -1);
6657 snap = isl_tab_snap(tab);
6658 for (i = 0; i < n; ++i) {
6661 isl_int_set_si(bound->el[1 + first + i], -1);
6662 if (isl_tab_add_ineq(tab, bound->el) < 0)
6665 isl_int_set_si(bound->el[1 + first + i], 0);
6666 if (isl_tab_rollback(tab, snap) < 0)
6674 isl_int_set_si(bound->el[1 + first + i], 1);
6675 if (isl_tab_add_ineq(tab, bound->el) < 0)
6678 isl_int_set_si(bound->el[1 + first + i], 0);
6679 if (isl_tab_rollback(tab, snap) < 0)
6682 signs[i] = empty ? -1 : 0;
6686 isl_vec_free(bound);
6690 isl_vec_free(bound);
6694 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
6695 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
6697 if (!bset || !signs)
6699 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
6702 first += pos(bset->dim, type) - 1;
6703 return isl_basic_set_vars_get_sign(bset, first, n, signs);