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
17 #include "isl_dim_private.h"
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 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
277 __isl_take isl_basic_map *bmap,
278 enum isl_dim_type type, unsigned pos, const char *s)
282 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
287 isl_basic_map_free(bmap);
291 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
292 enum isl_dim_type type, unsigned pos, const char *s)
299 map->dim = isl_dim_set_name(map->dim, type, pos, s);
303 for (i = 0; i < map->n; ++i) {
304 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
315 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
316 __isl_take isl_basic_set *bset,
317 enum isl_dim_type type, unsigned pos, const char *s)
319 return (isl_basic_set *)isl_basic_map_set_dim_name(
320 (isl_basic_map *)bset, type, pos, s);
323 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
324 enum isl_dim_type type, unsigned pos, const char *s)
326 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
329 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
333 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
336 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
337 struct isl_basic_map *bmap, unsigned extra,
338 unsigned n_eq, unsigned n_ineq)
341 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
343 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
344 if (isl_blk_is_error(bmap->block)) {
349 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
351 isl_blk_free(ctx, bmap->block);
357 bmap->block2 = isl_blk_empty();
360 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
361 if (isl_blk_is_error(bmap->block2)) {
363 isl_blk_free(ctx, bmap->block);
368 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
370 isl_blk_free(ctx, bmap->block2);
372 isl_blk_free(ctx, bmap->block);
378 for (i = 0; i < n_ineq + n_eq; ++i)
379 bmap->ineq[i] = bmap->block.data + i * row_size;
381 for (i = 0; i < extra; ++i)
382 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
388 bmap->c_size = n_eq + n_ineq;
389 bmap->eq = bmap->ineq + n_ineq;
399 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
400 unsigned nparam, unsigned dim, unsigned extra,
401 unsigned n_eq, unsigned n_ineq)
403 struct isl_basic_map *bmap;
404 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
405 return (struct isl_basic_set *)bmap;
408 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
409 unsigned extra, unsigned n_eq, unsigned n_ineq)
411 struct isl_basic_map *bmap;
414 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
415 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
416 return (struct isl_basic_set *)bmap;
419 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
420 unsigned extra, unsigned n_eq, unsigned n_ineq)
422 struct isl_basic_map *bmap;
426 bmap = isl_alloc_type(dim->ctx, struct isl_basic_map);
431 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
437 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
438 unsigned nparam, unsigned in, unsigned out, unsigned extra,
439 unsigned n_eq, unsigned n_ineq)
441 struct isl_basic_map *bmap;
444 dim = isl_dim_alloc(ctx, nparam, in, out);
448 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
452 static void dup_constraints(
453 struct isl_basic_map *dst, struct isl_basic_map *src)
456 unsigned total = isl_basic_map_total_dim(src);
458 for (i = 0; i < src->n_eq; ++i) {
459 int j = isl_basic_map_alloc_equality(dst);
460 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
463 for (i = 0; i < src->n_ineq; ++i) {
464 int j = isl_basic_map_alloc_inequality(dst);
465 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
468 for (i = 0; i < src->n_div; ++i) {
469 int j = isl_basic_map_alloc_div(dst);
470 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
472 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
475 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
477 struct isl_basic_map *dup;
481 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
482 bmap->n_div, bmap->n_eq, bmap->n_ineq);
485 dup_constraints(dup, bmap);
486 dup->flags = bmap->flags;
487 dup->sample = isl_vec_copy(bmap->sample);
491 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
493 struct isl_basic_map *dup;
495 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
496 return (struct isl_basic_set *)dup;
499 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
504 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
508 return isl_basic_set_dup(bset);
511 struct isl_set *isl_set_copy(struct isl_set *set)
520 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
525 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
529 bmap = isl_basic_map_dup(bmap);
531 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
535 struct isl_map *isl_map_copy(struct isl_map *map)
544 void isl_basic_map_free(struct isl_basic_map *bmap)
552 isl_ctx_deref(bmap->ctx);
554 isl_blk_free(bmap->ctx, bmap->block2);
556 isl_blk_free(bmap->ctx, bmap->block);
557 isl_vec_free(bmap->sample);
558 isl_dim_free(bmap->dim);
562 void isl_basic_set_free(struct isl_basic_set *bset)
564 isl_basic_map_free((struct isl_basic_map *)bset);
567 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
569 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
572 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
578 isl_assert(ctx, room_for_con(bmap, 1), return -1);
579 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
581 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
582 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
583 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
584 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
585 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
586 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
588 int j = isl_basic_map_alloc_inequality(bmap);
592 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
593 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
600 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
601 bmap->extra - bmap->n_div);
605 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
607 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
610 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
614 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
619 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
621 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
624 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
629 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
631 if (pos != bmap->n_eq - 1) {
633 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
634 bmap->eq[bmap->n_eq - 1] = t;
640 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
642 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
645 void isl_basic_map_inequality_to_equality(
646 struct isl_basic_map *bmap, unsigned pos)
651 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
652 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
657 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
658 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
659 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
660 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
663 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
665 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
668 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
674 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
675 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
676 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
677 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
678 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
679 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
680 1 + isl_basic_map_total_dim(bmap),
681 bmap->extra - bmap->n_div);
682 return bmap->n_ineq++;
685 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
687 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
690 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
694 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
699 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
701 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
704 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
709 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
711 if (pos != bmap->n_ineq - 1) {
713 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
714 bmap->ineq[bmap->n_ineq - 1] = t;
715 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
721 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
723 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
726 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
731 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
734 k = isl_basic_map_alloc_equality(bmap);
737 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
740 isl_basic_map_free(bmap);
744 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
747 return (isl_basic_set *)
748 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
751 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
756 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
759 k = isl_basic_map_alloc_inequality(bmap);
762 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
765 isl_basic_map_free(bmap);
769 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
772 return (isl_basic_set *)
773 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
776 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
780 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
781 isl_seq_clr(bmap->div[bmap->n_div] +
782 1 + 1 + isl_basic_map_total_dim(bmap),
783 bmap->extra - bmap->n_div);
784 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
785 return bmap->n_div++;
788 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
790 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
793 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
797 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
802 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
804 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
807 /* Copy constraint from src to dst, putting the vars of src at offset
808 * dim_off in dst and the divs of src at offset div_off in dst.
809 * If both sets are actually map, then dim_off applies to the input
812 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
813 struct isl_basic_map *src_map, isl_int *src,
814 unsigned in_off, unsigned out_off, unsigned div_off)
816 unsigned src_nparam = isl_basic_map_n_param(src_map);
817 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
818 unsigned src_in = isl_basic_map_n_in(src_map);
819 unsigned dst_in = isl_basic_map_n_in(dst_map);
820 unsigned src_out = isl_basic_map_n_out(src_map);
821 unsigned dst_out = isl_basic_map_n_out(dst_map);
822 isl_int_set(dst[0], src[0]);
823 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
824 if (dst_nparam > src_nparam)
825 isl_seq_clr(dst+1+src_nparam,
826 dst_nparam - src_nparam);
827 isl_seq_clr(dst+1+dst_nparam, in_off);
828 isl_seq_cpy(dst+1+dst_nparam+in_off,
830 isl_min(dst_in-in_off, src_in));
831 if (dst_in-in_off > src_in)
832 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
833 dst_in - in_off - src_in);
834 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
835 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
836 src+1+src_nparam+src_in,
837 isl_min(dst_out-out_off, src_out));
838 if (dst_out-out_off > src_out)
839 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
840 dst_out - out_off - src_out);
841 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
842 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
843 src+1+src_nparam+src_in+src_out,
844 isl_min(dst_map->extra-div_off, src_map->n_div));
845 if (dst_map->n_div-div_off > src_map->n_div)
846 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
847 div_off+src_map->n_div,
848 dst_map->n_div - div_off - src_map->n_div);
851 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
852 struct isl_basic_map *src_map, isl_int *src,
853 unsigned in_off, unsigned out_off, unsigned div_off)
855 isl_int_set(dst[0], src[0]);
856 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
859 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
860 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
865 if (!bmap1 || !bmap2)
868 div_off = bmap1->n_div;
870 for (i = 0; i < bmap2->n_eq; ++i) {
871 int i1 = isl_basic_map_alloc_equality(bmap1);
874 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
875 i_pos, o_pos, div_off);
878 for (i = 0; i < bmap2->n_ineq; ++i) {
879 int i1 = isl_basic_map_alloc_inequality(bmap1);
882 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
883 i_pos, o_pos, div_off);
886 for (i = 0; i < bmap2->n_div; ++i) {
887 int i1 = isl_basic_map_alloc_div(bmap1);
890 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
891 i_pos, o_pos, div_off);
894 isl_basic_map_free(bmap2);
899 isl_basic_map_free(bmap1);
900 isl_basic_map_free(bmap2);
904 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
905 struct isl_dim_map *dim_map)
909 for (i = 0; i < dim_map->len; ++i) {
910 if (dim_map->pos[i] < 0)
911 isl_int_set_si(dst[i], 0);
913 isl_int_set(dst[i], src[dim_map->pos[i]]);
917 static void copy_div_dim_map(isl_int *dst, isl_int *src,
918 struct isl_dim_map *dim_map)
920 isl_int_set(dst[0], src[0]);
921 copy_constraint_dim_map(dst+1, src+1, dim_map);
924 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
925 struct isl_basic_map *src, struct isl_dim_map *dim_map)
929 if (!src || !dst || !dim_map)
932 for (i = 0; i < src->n_eq; ++i) {
933 int i1 = isl_basic_map_alloc_equality(dst);
936 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
939 for (i = 0; i < src->n_ineq; ++i) {
940 int i1 = isl_basic_map_alloc_inequality(dst);
943 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
946 for (i = 0; i < src->n_div; ++i) {
947 int i1 = isl_basic_map_alloc_div(dst);
950 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
954 isl_basic_map_free(src);
959 isl_basic_map_free(src);
960 isl_basic_map_free(dst);
964 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
965 struct isl_basic_set *bset2, unsigned pos)
967 return (struct isl_basic_set *)
968 add_constraints((struct isl_basic_map *)bset1,
969 (struct isl_basic_map *)bset2, 0, pos);
972 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
973 struct isl_dim *dim, unsigned extra,
974 unsigned n_eq, unsigned n_ineq)
976 struct isl_basic_map *ext;
986 dims_ok = isl_dim_equal(base->dim, dim) &&
987 base->extra >= base->n_div + extra;
989 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
990 room_for_ineq(base, n_ineq)) {
995 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
996 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
997 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
998 extra += base->extra;
1000 n_ineq += base->n_ineq;
1002 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1008 ext->sample = isl_vec_copy(base->sample);
1009 flags = base->flags;
1010 ext = add_constraints(ext, base, 0, 0);
1013 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1020 isl_basic_map_free(base);
1024 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1025 struct isl_dim *dim, unsigned extra,
1026 unsigned n_eq, unsigned n_ineq)
1028 return (struct isl_basic_set *)
1029 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1030 extra, n_eq, n_ineq);
1033 struct isl_basic_map *isl_basic_map_extend_constraints(
1034 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1038 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1042 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1043 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1044 unsigned n_eq, unsigned n_ineq)
1046 struct isl_basic_map *bmap;
1047 struct isl_dim *dim;
1051 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1055 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1059 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1060 unsigned nparam, unsigned dim, unsigned extra,
1061 unsigned n_eq, unsigned n_ineq)
1063 return (struct isl_basic_set *)
1064 isl_basic_map_extend((struct isl_basic_map *)base,
1065 nparam, 0, dim, extra, n_eq, n_ineq);
1068 struct isl_basic_set *isl_basic_set_extend_constraints(
1069 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1071 return (struct isl_basic_set *)
1072 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1076 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1078 return (struct isl_basic_set *)
1079 isl_basic_map_cow((struct isl_basic_map *)bset);
1082 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1087 if (bmap->ref > 1) {
1089 bmap = isl_basic_map_dup(bmap);
1092 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1096 struct isl_set *isl_set_cow(struct isl_set *set)
1104 return isl_set_dup(set);
1107 struct isl_map *isl_map_cow(struct isl_map *map)
1115 return isl_map_dup(map);
1118 static void swap_vars(struct isl_blk blk, isl_int *a,
1119 unsigned a_len, unsigned b_len)
1121 isl_seq_cpy(blk.data, a+a_len, b_len);
1122 isl_seq_cpy(blk.data+b_len, a, a_len);
1123 isl_seq_cpy(a, blk.data, b_len+a_len);
1126 struct isl_basic_set *isl_basic_set_swap_vars(
1127 struct isl_basic_set *bset, unsigned n)
1137 nparam = isl_basic_set_n_param(bset);
1138 dim = isl_basic_set_n_dim(bset);
1139 isl_assert(bset->ctx, n <= dim, goto error);
1144 bset = isl_basic_set_cow(bset);
1148 blk = isl_blk_alloc(bset->ctx, dim);
1149 if (isl_blk_is_error(blk))
1152 for (i = 0; i < bset->n_eq; ++i)
1154 bset->eq[i]+1+nparam, n, dim - n);
1156 for (i = 0; i < bset->n_ineq; ++i)
1158 bset->ineq[i]+1+nparam, n, dim - n);
1160 for (i = 0; i < bset->n_div; ++i)
1162 bset->div[i]+1+1+nparam, n, dim - n);
1164 isl_blk_free(bset->ctx, blk);
1166 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1167 return isl_basic_set_gauss(bset, NULL);
1169 isl_basic_set_free(bset);
1173 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1176 set = isl_set_cow(set);
1180 for (i = 0; i < set->n; ++i) {
1181 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1187 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1191 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1197 total = isl_basic_map_total_dim(bmap);
1198 isl_basic_map_free_div(bmap, bmap->n_div);
1199 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1201 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1203 i = isl_basic_map_alloc_equality(bmap);
1207 isl_int_set_si(bmap->eq[i][0], 1);
1208 isl_seq_clr(bmap->eq[i]+1, total);
1209 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1210 isl_vec_free(bmap->sample);
1211 bmap->sample = NULL;
1212 return isl_basic_map_finalize(bmap);
1214 isl_basic_map_free(bmap);
1218 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1220 return (struct isl_basic_set *)
1221 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1224 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1227 unsigned off = isl_dim_total(bmap->dim);
1228 isl_int *t = bmap->div[a];
1229 bmap->div[a] = bmap->div[b];
1232 for (i = 0; i < bmap->n_eq; ++i)
1233 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1235 for (i = 0; i < bmap->n_ineq; ++i)
1236 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1238 for (i = 0; i < bmap->n_div; ++i)
1239 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1240 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1243 /* Eliminate the specified n dimensions starting at first from the
1244 * constraints using Fourier-Motzkin. The dimensions themselves
1247 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1248 enum isl_dim_type type, unsigned first, unsigned n)
1257 map = isl_map_cow(map);
1260 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1261 first += pos(map->dim, type) - 1;
1263 for (i = 0; i < map->n; ++i) {
1264 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1274 /* Eliminate the specified n dimensions starting at first from the
1275 * constraints using Fourier-Motzkin. The dimensions themselves
1278 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1279 enum isl_dim_type type, unsigned first, unsigned n)
1281 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1284 /* Eliminate the specified n dimensions starting at first from the
1285 * constraints using Fourier-Motzkin. The dimensions themselves
1288 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1289 unsigned first, unsigned n)
1291 return isl_set_eliminate(set, isl_dim_set, first, n);
1294 /* Project out n dimensions starting at first using Fourier-Motzkin */
1295 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1296 unsigned first, unsigned n)
1298 set = isl_set_eliminate_dims(set, first, n);
1299 set = isl_set_drop_dims(set, first, n);
1303 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1305 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1313 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1322 set = isl_set_cow(set);
1326 for (i = 0; i < set->n; ++i) {
1327 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1337 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1338 enum isl_dim_type type, unsigned first, unsigned n)
1342 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1346 bmap = isl_basic_map_eliminate_vars(bmap,
1347 isl_basic_map_offset(bmap, type) - 1 + first, n);
1350 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1352 bmap = isl_basic_map_drop(bmap, type, first, n);
1355 isl_basic_map_free(bmap);
1359 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1360 enum isl_dim_type type, unsigned first, unsigned n)
1362 return (isl_basic_set *)
1363 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1366 struct isl_map *isl_map_remove(struct isl_map *map,
1367 enum isl_dim_type type, unsigned first, unsigned n)
1374 map = isl_map_cow(map);
1377 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1379 for (i = 0; i < map->n; ++i) {
1380 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1381 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1385 map = isl_map_drop(map, type, first, n);
1392 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1393 enum isl_dim_type type, unsigned first, unsigned n)
1395 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1398 /* Project out n inputs starting at first using Fourier-Motzkin */
1399 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1400 unsigned first, unsigned n)
1402 return isl_map_remove(map, isl_dim_in, first, n);
1405 /* Project out n dimensions starting at first using Fourier-Motzkin */
1406 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1407 unsigned first, unsigned n)
1409 unsigned nparam = isl_basic_set_n_param(bset);
1410 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1411 bset = isl_basic_set_drop_dims(bset, first, n);
1415 static void dump_term(struct isl_basic_map *bmap,
1416 isl_int c, int pos, FILE *out)
1419 unsigned in = isl_basic_map_n_in(bmap);
1420 unsigned dim = in + isl_basic_map_n_out(bmap);
1421 unsigned nparam = isl_basic_map_n_param(bmap);
1423 isl_int_print(out, c, 0);
1425 if (!isl_int_is_one(c))
1426 isl_int_print(out, c, 0);
1427 if (pos < 1 + nparam) {
1428 name = isl_dim_get_name(bmap->dim,
1429 isl_dim_param, pos - 1);
1431 fprintf(out, "%s", name);
1433 fprintf(out, "p%d", pos - 1);
1434 } else if (pos < 1 + nparam + in)
1435 fprintf(out, "i%d", pos - 1 - nparam);
1436 else if (pos < 1 + nparam + dim)
1437 fprintf(out, "o%d", pos - 1 - nparam - in);
1439 fprintf(out, "e%d", pos - 1 - nparam - dim);
1443 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1444 int sign, FILE *out)
1448 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1452 for (i = 0, first = 1; i < len; ++i) {
1453 if (isl_int_sgn(c[i]) * sign <= 0)
1456 fprintf(out, " + ");
1458 isl_int_abs(v, c[i]);
1459 dump_term(bmap, v, i, out);
1466 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1467 const char *op, FILE *out, int indent)
1471 fprintf(out, "%*s", indent, "");
1473 dump_constraint_sign(bmap, c, 1, out);
1474 fprintf(out, " %s ", op);
1475 dump_constraint_sign(bmap, c, -1, out);
1479 for (i = bmap->n_div; i < bmap->extra; ++i) {
1480 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1482 fprintf(out, "%*s", indent, "");
1483 fprintf(out, "ERROR: unused div coefficient not zero\n");
1488 static void dump_constraints(struct isl_basic_map *bmap,
1489 isl_int **c, unsigned n,
1490 const char *op, FILE *out, int indent)
1494 for (i = 0; i < n; ++i)
1495 dump_constraint(bmap, c[i], op, out, indent);
1498 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1502 unsigned total = isl_basic_map_total_dim(bmap);
1504 for (j = 0; j < 1 + total; ++j) {
1505 if (isl_int_is_zero(exp[j]))
1507 if (!first && isl_int_is_pos(exp[j]))
1509 dump_term(bmap, exp[j], j, out);
1514 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1518 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1519 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1521 for (i = 0; i < bmap->n_div; ++i) {
1522 fprintf(out, "%*s", indent, "");
1523 fprintf(out, "e%d = [(", i);
1524 dump_affine(bmap, bmap->div[i]+1, out);
1526 isl_int_print(out, bmap->div[i][0], 0);
1527 fprintf(out, "]\n");
1531 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1534 fprintf(out, "null basic set\n");
1538 fprintf(out, "%*s", indent, "");
1539 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1540 bset->ref, bset->dim->nparam, bset->dim->n_out,
1541 bset->extra, bset->flags);
1542 dump((struct isl_basic_map *)bset, out, indent);
1545 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1548 fprintf(out, "null basic map\n");
1552 fprintf(out, "%*s", indent, "");
1553 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1554 "flags: %x, n_name: %d\n",
1556 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1557 bmap->extra, bmap->flags, bmap->dim->n_name);
1558 dump(bmap, out, indent);
1561 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1566 total = isl_basic_map_total_dim(bmap);
1567 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1568 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1569 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1570 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1574 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1576 struct isl_set *set;
1580 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1581 isl_assert(dim->ctx, n >= 0, return NULL);
1582 set = isl_alloc(dim->ctx, struct isl_set,
1583 sizeof(struct isl_set) +
1584 (n - 1) * sizeof(struct isl_basic_set *));
1588 set->ctx = dim->ctx;
1589 isl_ctx_ref(set->ctx);
1601 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1602 unsigned nparam, unsigned dim, int n, unsigned flags)
1604 struct isl_set *set;
1605 struct isl_dim *dims;
1607 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1611 set = isl_set_alloc_dim(dims, n, flags);
1615 /* Make sure "map" has room for at least "n" more basic maps.
1617 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1620 struct isl_map *grown = NULL;
1624 isl_assert(map->ctx, n >= 0, goto error);
1625 if (map->n + n <= map->size)
1627 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1630 for (i = 0; i < map->n; ++i) {
1631 grown->p[i] = isl_basic_map_copy(map->p[i]);
1639 isl_map_free(grown);
1644 /* Make sure "set" has room for at least "n" more basic sets.
1646 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1648 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1651 struct isl_set *isl_set_dup(struct isl_set *set)
1654 struct isl_set *dup;
1659 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1662 for (i = 0; i < set->n; ++i)
1663 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1667 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1669 struct isl_set *set;
1674 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1676 isl_basic_set_free(bset);
1679 return isl_set_add_basic_set(set, bset);
1682 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1684 struct isl_map *map;
1689 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1691 isl_basic_map_free(bmap);
1694 return isl_map_add_basic_map(map, bmap);
1697 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1698 __isl_take isl_basic_set *bset)
1700 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1701 (struct isl_basic_map *)bset);
1704 void isl_set_free(struct isl_set *set)
1714 isl_ctx_deref(set->ctx);
1715 for (i = 0; i < set->n; ++i)
1716 isl_basic_set_free(set->p[i]);
1717 isl_dim_free(set->dim);
1721 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1726 fprintf(out, "null set\n");
1730 fprintf(out, "%*s", indent, "");
1731 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1732 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1734 for (i = 0; i < set->n; ++i) {
1735 fprintf(out, "%*s", indent, "");
1736 fprintf(out, "basic set %d:\n", i);
1737 isl_basic_set_dump(set->p[i], out, indent+4);
1741 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1746 fprintf(out, "null map\n");
1750 fprintf(out, "%*s", indent, "");
1751 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1752 "flags: %x, n_name: %d\n",
1753 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1754 map->dim->n_out, map->flags, map->dim->n_name);
1755 for (i = 0; i < map->n; ++i) {
1756 fprintf(out, "%*s", indent, "");
1757 fprintf(out, "basic map %d:\n", i);
1758 isl_basic_map_dump(map->p[i], out, indent+4);
1762 struct isl_basic_map *isl_basic_map_intersect_domain(
1763 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1765 struct isl_basic_map *bmap_domain;
1766 struct isl_dim *dim;
1771 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1772 bset->dim, isl_dim_param), goto error);
1774 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1775 isl_assert(bset->ctx,
1776 isl_basic_map_compatible_domain(bmap, bset), goto error);
1778 bmap = isl_basic_map_cow(bmap);
1779 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1780 bset->n_div, bset->n_eq, bset->n_ineq);
1783 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1784 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1785 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1787 bmap = isl_basic_map_simplify(bmap);
1788 return isl_basic_map_finalize(bmap);
1790 isl_basic_map_free(bmap);
1791 isl_basic_set_free(bset);
1795 struct isl_basic_map *isl_basic_map_intersect_range(
1796 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1798 struct isl_basic_map *bmap_range;
1803 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1804 bset->dim, isl_dim_param), goto error);
1806 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1807 isl_assert(bset->ctx,
1808 isl_basic_map_compatible_range(bmap, bset), goto error);
1810 bmap = isl_basic_map_cow(bmap);
1811 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1812 bset->n_div, bset->n_eq, bset->n_ineq);
1815 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1816 bmap = add_constraints(bmap, bmap_range, 0, 0);
1818 bmap = isl_basic_map_simplify(bmap);
1819 return isl_basic_map_finalize(bmap);
1821 isl_basic_map_free(bmap);
1822 isl_basic_set_free(bset);
1826 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1832 total = 1 + isl_basic_map_total_dim(bmap);
1833 if (total != vec->size)
1838 for (i = 0; i < bmap->n_eq; ++i) {
1839 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1840 if (!isl_int_is_zero(s)) {
1846 for (i = 0; i < bmap->n_ineq; ++i) {
1847 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1848 if (isl_int_is_neg(s)) {
1859 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1861 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1864 struct isl_basic_map *isl_basic_map_intersect(
1865 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1867 struct isl_vec *sample = NULL;
1869 if (!bmap1 || !bmap2)
1872 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1873 bmap2->dim, isl_dim_param), goto error);
1874 if (isl_dim_total(bmap1->dim) ==
1875 isl_dim_size(bmap1->dim, isl_dim_param) &&
1876 isl_dim_total(bmap2->dim) !=
1877 isl_dim_size(bmap2->dim, isl_dim_param))
1878 return isl_basic_map_intersect(bmap2, bmap1);
1880 if (isl_dim_total(bmap2->dim) !=
1881 isl_dim_size(bmap2->dim, isl_dim_param))
1882 isl_assert(bmap1->ctx,
1883 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1885 if (bmap1->sample &&
1886 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1887 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1888 sample = isl_vec_copy(bmap1->sample);
1889 else if (bmap2->sample &&
1890 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1891 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1892 sample = isl_vec_copy(bmap2->sample);
1894 bmap1 = isl_basic_map_cow(bmap1);
1895 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1896 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1899 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1902 isl_vec_free(bmap1->sample);
1903 bmap1->sample = sample;
1906 bmap1 = isl_basic_map_simplify(bmap1);
1907 return isl_basic_map_finalize(bmap1);
1910 isl_vec_free(sample);
1911 isl_basic_map_free(bmap1);
1912 isl_basic_map_free(bmap2);
1916 struct isl_basic_set *isl_basic_set_intersect(
1917 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1919 return (struct isl_basic_set *)
1920 isl_basic_map_intersect(
1921 (struct isl_basic_map *)bset1,
1922 (struct isl_basic_map *)bset2);
1925 /* Special case of isl_map_intersect, where both map1 and map2
1926 * are convex, without any divs and such that either map1 or map2
1927 * contains a single constraint. This constraint is then simply
1928 * added to the other map.
1930 static __isl_give isl_map *map_intersect_add_constraint(
1931 __isl_take isl_map *map1, __isl_take isl_map *map2)
1933 struct isl_basic_map *bmap1;
1934 struct isl_basic_map *bmap2;
1936 isl_assert(map1->ctx, map1->n == 1, goto error);
1937 isl_assert(map2->ctx, map1->n == 1, goto error);
1938 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1939 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1941 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1942 return isl_map_intersect(map2, map1);
1944 isl_assert(map2->ctx,
1945 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1947 map1 = isl_map_cow(map1);
1950 if (isl_map_fast_is_empty(map1)) {
1954 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1955 if (map2->p[0]->n_eq == 1)
1956 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1958 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1959 map2->p[0]->ineq[0]);
1961 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1962 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1966 if (isl_basic_map_fast_is_empty(map1->p[0])) {
1967 isl_basic_map_free(map1->p[0]);
1980 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1983 struct isl_map *result;
1989 if (isl_map_fast_is_empty(map1)) {
1993 if (isl_map_fast_is_empty(map2)) {
1998 if (map1->n == 1 && map2->n == 1 &&
1999 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2000 isl_dim_equal(map1->dim, map2->dim) &&
2001 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2002 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2003 return map_intersect_add_constraint(map1, map2);
2004 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2005 map2->dim, isl_dim_param), goto error);
2006 if (isl_dim_total(map1->dim) ==
2007 isl_dim_size(map1->dim, isl_dim_param) &&
2008 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2009 return isl_map_intersect(map2, map1);
2011 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2012 isl_assert(map1->ctx,
2013 isl_dim_equal(map1->dim, map2->dim), goto error);
2015 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2016 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2017 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2019 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2020 map1->n * map2->n, flags);
2023 for (i = 0; i < map1->n; ++i)
2024 for (j = 0; j < map2->n; ++j) {
2025 struct isl_basic_map *part;
2026 part = isl_basic_map_intersect(
2027 isl_basic_map_copy(map1->p[i]),
2028 isl_basic_map_copy(map2->p[j]));
2029 if (isl_basic_map_is_empty(part))
2030 isl_basic_map_free(part);
2032 result = isl_map_add_basic_map(result, part);
2045 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2047 return (struct isl_set *)
2048 isl_map_intersect((struct isl_map *)set1,
2049 (struct isl_map *)set2);
2052 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2054 struct isl_dim *dim;
2055 struct isl_basic_set *bset;
2060 bmap = isl_basic_map_cow(bmap);
2063 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2064 in = isl_basic_map_n_in(bmap);
2065 bset = isl_basic_set_from_basic_map(bmap);
2066 bset = isl_basic_set_swap_vars(bset, in);
2067 return isl_basic_map_from_basic_set(bset, dim);
2070 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2071 enum isl_dim_type type, unsigned pos, unsigned n)
2073 struct isl_dim *res_dim;
2074 struct isl_basic_map *res;
2075 struct isl_dim_map *dim_map;
2076 unsigned total, off;
2077 enum isl_dim_type t;
2085 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2087 total = isl_basic_map_total_dim(bmap) + n;
2088 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2090 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2092 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2094 unsigned size = isl_basic_map_dim(bmap, t);
2095 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2097 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2098 pos, size - pos, off + pos + n);
2100 off += isl_dim_size(res_dim, t);
2102 isl_dim_map_div(dim_map, bmap, off);
2104 res = isl_basic_map_alloc_dim(res_dim,
2105 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2106 res = add_constraints_dim_map(res, bmap, dim_map);
2107 res = isl_basic_map_simplify(res);
2108 return isl_basic_map_finalize(res);
2111 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2112 enum isl_dim_type type, unsigned n)
2116 return isl_basic_map_insert(bmap, type,
2117 isl_basic_map_dim(bmap, type), n);
2120 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2121 enum isl_dim_type type, unsigned n)
2125 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2126 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2128 isl_basic_set_free(bset);
2132 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2133 enum isl_dim_type type, unsigned pos, unsigned n)
2140 map = isl_map_cow(map);
2144 map->dim = isl_dim_insert(map->dim, type, pos, n);
2148 for (i = 0; i < map->n; ++i) {
2149 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2160 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2161 enum isl_dim_type type, unsigned n)
2165 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2168 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2169 enum isl_dim_type type, unsigned n)
2173 isl_assert(set->ctx, type != isl_dim_in, goto error);
2174 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2180 __isl_give isl_basic_map *isl_basic_map_move_dims(
2181 __isl_take isl_basic_map *bmap,
2182 enum isl_dim_type dst_type, unsigned dst_pos,
2183 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2186 struct isl_dim_map *dim_map;
2187 struct isl_basic_map *res;
2188 enum isl_dim_type t;
2189 unsigned total, off;
2196 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2199 if (dst_type == src_type && dst_pos == src_pos)
2202 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2204 if (pos(bmap->dim, dst_type) + dst_pos ==
2205 pos(bmap->dim, src_type) + src_pos +
2206 ((src_type < dst_type) ? n : 0)) {
2207 bmap = isl_basic_map_cow(bmap);
2211 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2212 src_type, src_pos, n);
2216 bmap = isl_basic_map_finalize(bmap);
2221 total = isl_basic_map_total_dim(bmap);
2222 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2225 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2226 unsigned size = isl_dim_size(bmap->dim, t);
2227 if (t == dst_type) {
2228 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2231 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2234 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2235 dst_pos, size - dst_pos, off);
2236 off += size - dst_pos;
2237 } else if (t == src_type) {
2238 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2241 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2242 src_pos + n, size - src_pos - n, off);
2243 off += size - src_pos - n;
2245 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2249 isl_dim_map_div(dim_map, bmap, off + n);
2251 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2252 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2253 bmap = add_constraints_dim_map(res, bmap, dim_map);
2255 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2256 src_type, src_pos, n);
2260 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2261 bmap = isl_basic_map_gauss(bmap, NULL);
2262 bmap = isl_basic_map_finalize(bmap);
2266 isl_basic_map_free(bmap);
2270 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2271 enum isl_dim_type dst_type, unsigned dst_pos,
2272 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2274 return (isl_basic_set *)isl_basic_map_move_dims(
2275 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2278 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2279 enum isl_dim_type dst_type, unsigned dst_pos,
2280 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2284 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2285 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2286 src_type, src_pos, n);
2292 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2293 enum isl_dim_type dst_type, unsigned dst_pos,
2294 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2303 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2306 if (dst_type == src_type && dst_pos == src_pos)
2309 isl_assert(map->ctx, dst_type != src_type, goto error);
2311 map = isl_map_cow(map);
2315 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2319 for (i = 0; i < map->n; ++i) {
2320 map->p[i] = isl_basic_map_move_dims(map->p[i],
2322 src_type, src_pos, n);
2333 /* Move the specified dimensions to the last columns right before
2334 * the divs. Don't change the dimension specification of bmap.
2335 * That's the responsibility of the caller.
2337 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2338 enum isl_dim_type type, unsigned first, unsigned n)
2340 struct isl_dim_map *dim_map;
2341 struct isl_basic_map *res;
2342 enum isl_dim_type t;
2343 unsigned total, off;
2347 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2350 total = isl_basic_map_total_dim(bmap);
2351 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2354 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2355 unsigned size = isl_dim_size(bmap->dim, t);
2357 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2360 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2361 first, n, total - bmap->n_div - n);
2362 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2363 first + n, size - (first + n), off);
2364 off += size - (first + n);
2366 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2370 isl_dim_map_div(dim_map, bmap, off + n);
2372 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2373 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2374 res = add_constraints_dim_map(res, bmap, dim_map);
2378 /* Turn the n dimensions of type type, starting at first
2379 * into existentially quantified variables.
2381 __isl_give isl_basic_map *isl_basic_map_project_out(
2382 __isl_take isl_basic_map *bmap,
2383 enum isl_dim_type type, unsigned first, unsigned n)
2396 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2397 return isl_basic_map_remove(bmap, type, first, n);
2399 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2402 bmap = move_last(bmap, type, first, n);
2403 bmap = isl_basic_map_cow(bmap);
2405 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2406 old = bmap->block2.data;
2407 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2408 (bmap->extra + n) * (1 + row_size));
2409 if (!bmap->block2.data)
2411 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2414 for (i = 0; i < n; ++i) {
2415 new_div[i] = bmap->block2.data +
2416 (bmap->extra + i) * (1 + row_size);
2417 isl_seq_clr(new_div[i], 1 + row_size);
2419 for (i = 0; i < bmap->extra; ++i)
2420 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2422 bmap->div = new_div;
2426 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2429 bmap = isl_basic_map_simplify(bmap);
2430 bmap = isl_basic_map_drop_redundant_divs(bmap);
2431 return isl_basic_map_finalize(bmap);
2433 isl_basic_map_free(bmap);
2437 /* Turn the n dimensions of type type, starting at first
2438 * into existentially quantified variables.
2440 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2441 enum isl_dim_type type, unsigned first, unsigned n)
2443 return (isl_basic_set *)isl_basic_map_project_out(
2444 (isl_basic_map *)bset, type, first, n);
2447 /* Turn the n dimensions of type type, starting at first
2448 * into existentially quantified variables.
2450 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2451 enum isl_dim_type type, unsigned first, unsigned n)
2461 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2463 map = isl_map_cow(map);
2467 map->dim = isl_dim_drop(map->dim, type, first, n);
2471 for (i = 0; i < map->n; ++i) {
2472 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2483 /* Turn the n dimensions of type type, starting at first
2484 * into existentially quantified variables.
2486 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2487 enum isl_dim_type type, unsigned first, unsigned n)
2489 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2492 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2496 for (i = 0; i < n; ++i) {
2497 j = isl_basic_map_alloc_div(bmap);
2500 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2504 isl_basic_map_free(bmap);
2508 struct isl_basic_map *isl_basic_map_apply_range(
2509 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2511 struct isl_dim *dim_result = NULL;
2512 struct isl_basic_map *bmap;
2513 unsigned n_in, n_out, n, nparam, total, pos;
2514 struct isl_dim_map *dim_map1, *dim_map2;
2516 if (!bmap1 || !bmap2)
2519 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2520 isl_dim_copy(bmap2->dim));
2522 n_in = isl_basic_map_n_in(bmap1);
2523 n_out = isl_basic_map_n_out(bmap2);
2524 n = isl_basic_map_n_out(bmap1);
2525 nparam = isl_basic_map_n_param(bmap1);
2527 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2528 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2529 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2530 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2531 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2532 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2533 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2534 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2535 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2536 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2537 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2539 bmap = isl_basic_map_alloc_dim(dim_result,
2540 bmap1->n_div + bmap2->n_div + n,
2541 bmap1->n_eq + bmap2->n_eq,
2542 bmap1->n_ineq + bmap2->n_ineq);
2543 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2544 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2545 bmap = add_divs(bmap, n);
2546 bmap = isl_basic_map_simplify(bmap);
2547 bmap = isl_basic_map_drop_redundant_divs(bmap);
2548 return isl_basic_map_finalize(bmap);
2550 isl_basic_map_free(bmap1);
2551 isl_basic_map_free(bmap2);
2555 struct isl_basic_set *isl_basic_set_apply(
2556 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2561 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2564 return (struct isl_basic_set *)
2565 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2567 isl_basic_set_free(bset);
2568 isl_basic_map_free(bmap);
2572 struct isl_basic_map *isl_basic_map_apply_domain(
2573 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2575 if (!bmap1 || !bmap2)
2578 isl_assert(bmap1->ctx,
2579 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2580 isl_assert(bmap1->ctx,
2581 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2584 bmap1 = isl_basic_map_reverse(bmap1);
2585 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2586 return isl_basic_map_reverse(bmap1);
2588 isl_basic_map_free(bmap1);
2589 isl_basic_map_free(bmap2);
2593 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2594 * A \cap B -> f(A) + f(B)
2596 struct isl_basic_map *isl_basic_map_sum(
2597 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2599 unsigned n_in, n_out, nparam, total, pos;
2600 struct isl_basic_map *bmap = NULL;
2601 struct isl_dim_map *dim_map1, *dim_map2;
2604 if (!bmap1 || !bmap2)
2607 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2610 nparam = isl_basic_map_n_param(bmap1);
2611 n_in = isl_basic_map_n_in(bmap1);
2612 n_out = isl_basic_map_n_out(bmap1);
2614 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2615 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2616 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2617 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2618 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2619 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2620 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2621 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2622 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2623 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2624 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2626 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2627 bmap1->n_div + bmap2->n_div + 2 * n_out,
2628 bmap1->n_eq + bmap2->n_eq + n_out,
2629 bmap1->n_ineq + bmap2->n_ineq);
2630 for (i = 0; i < n_out; ++i) {
2631 int j = isl_basic_map_alloc_equality(bmap);
2634 isl_seq_clr(bmap->eq[j], 1+total);
2635 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2636 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2637 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2639 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2640 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2641 bmap = add_divs(bmap, 2 * n_out);
2643 bmap = isl_basic_map_simplify(bmap);
2644 return isl_basic_map_finalize(bmap);
2646 isl_basic_map_free(bmap);
2647 isl_basic_map_free(bmap1);
2648 isl_basic_map_free(bmap2);
2652 /* Given two maps A -> f(A) and B -> g(B), construct a map
2653 * A \cap B -> f(A) + f(B)
2655 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2657 struct isl_map *result;
2663 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2665 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2666 map1->n * map2->n, 0);
2669 for (i = 0; i < map1->n; ++i)
2670 for (j = 0; j < map2->n; ++j) {
2671 struct isl_basic_map *part;
2672 part = isl_basic_map_sum(
2673 isl_basic_map_copy(map1->p[i]),
2674 isl_basic_map_copy(map2->p[j]));
2675 if (isl_basic_map_is_empty(part))
2676 isl_basic_map_free(part);
2678 result = isl_map_add_basic_map(result, part);
2691 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2692 __isl_take isl_set *set2)
2694 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2697 /* Given a basic map A -> f(A), construct A -> -f(A).
2699 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2704 bmap = isl_basic_map_cow(bmap);
2708 n = isl_basic_map_dim(bmap, isl_dim_out);
2709 off = isl_basic_map_offset(bmap, isl_dim_out);
2710 for (i = 0; i < bmap->n_eq; ++i)
2711 for (j = 0; j < n; ++j)
2712 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2713 for (i = 0; i < bmap->n_ineq; ++i)
2714 for (j = 0; j < n; ++j)
2715 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2716 for (i = 0; i < bmap->n_div; ++i)
2717 for (j = 0; j < n; ++j)
2718 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2719 return isl_basic_map_finalize(bmap);
2722 /* Given a map A -> f(A), construct A -> -f(A).
2724 struct isl_map *isl_map_neg(struct isl_map *map)
2728 map = isl_map_cow(map);
2732 for (i = 0; i < map->n; ++i) {
2733 map->p[i] = isl_basic_map_neg(map->p[i]);
2744 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2746 return (isl_set *)isl_map_neg((isl_map *)set);
2749 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2750 * A -> floor(f(A)/d).
2752 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2755 unsigned n_in, n_out, nparam, total, pos;
2756 struct isl_basic_map *result = NULL;
2757 struct isl_dim_map *dim_map;
2763 nparam = isl_basic_map_n_param(bmap);
2764 n_in = isl_basic_map_n_in(bmap);
2765 n_out = isl_basic_map_n_out(bmap);
2767 total = nparam + n_in + n_out + bmap->n_div + n_out;
2768 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2769 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2770 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2771 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2772 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2774 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2775 bmap->n_div + n_out,
2776 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2777 result = add_constraints_dim_map(result, bmap, dim_map);
2778 result = add_divs(result, n_out);
2779 for (i = 0; i < n_out; ++i) {
2781 j = isl_basic_map_alloc_inequality(result);
2784 isl_seq_clr(result->ineq[j], 1+total);
2785 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2786 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2787 j = isl_basic_map_alloc_inequality(result);
2790 isl_seq_clr(result->ineq[j], 1+total);
2791 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2792 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2793 isl_int_sub_ui(result->ineq[j][0], d, 1);
2796 result = isl_basic_map_simplify(result);
2797 return isl_basic_map_finalize(result);
2799 isl_basic_map_free(result);
2803 /* Given a map A -> f(A) and an integer d, construct a map
2804 * A -> floor(f(A)/d).
2806 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2810 map = isl_map_cow(map);
2814 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2815 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2816 for (i = 0; i < map->n; ++i) {
2817 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2828 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2834 i = isl_basic_map_alloc_equality(bmap);
2837 nparam = isl_basic_map_n_param(bmap);
2838 n_in = isl_basic_map_n_in(bmap);
2839 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2840 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2841 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2842 return isl_basic_map_finalize(bmap);
2844 isl_basic_map_free(bmap);
2848 /* Add a constraints to "bmap" expressing i_pos < o_pos
2850 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2856 i = isl_basic_map_alloc_inequality(bmap);
2859 nparam = isl_basic_map_n_param(bmap);
2860 n_in = isl_basic_map_n_in(bmap);
2861 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2862 isl_int_set_si(bmap->ineq[i][0], -1);
2863 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2864 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2865 return isl_basic_map_finalize(bmap);
2867 isl_basic_map_free(bmap);
2871 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2873 static __isl_give isl_basic_map *var_less_or_equal(
2874 __isl_take isl_basic_map *bmap, unsigned pos)
2880 i = isl_basic_map_alloc_inequality(bmap);
2883 nparam = isl_basic_map_n_param(bmap);
2884 n_in = isl_basic_map_n_in(bmap);
2885 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2886 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2887 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2888 return isl_basic_map_finalize(bmap);
2890 isl_basic_map_free(bmap);
2894 /* Add a constraints to "bmap" expressing i_pos > o_pos
2896 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2902 i = isl_basic_map_alloc_inequality(bmap);
2905 nparam = isl_basic_map_n_param(bmap);
2906 n_in = isl_basic_map_n_in(bmap);
2907 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2908 isl_int_set_si(bmap->ineq[i][0], -1);
2909 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2910 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2911 return isl_basic_map_finalize(bmap);
2913 isl_basic_map_free(bmap);
2917 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2919 static __isl_give isl_basic_map *var_more_or_equal(
2920 __isl_take isl_basic_map *bmap, unsigned pos)
2926 i = isl_basic_map_alloc_inequality(bmap);
2929 nparam = isl_basic_map_n_param(bmap);
2930 n_in = isl_basic_map_n_in(bmap);
2931 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2932 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2933 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2934 return isl_basic_map_finalize(bmap);
2936 isl_basic_map_free(bmap);
2940 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2943 struct isl_basic_map *bmap;
2944 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2947 for (i = 0; i < n_equal && bmap; ++i)
2948 bmap = var_equal(bmap, i);
2949 return isl_basic_map_finalize(bmap);
2952 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2954 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2957 struct isl_basic_map *bmap;
2958 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2961 for (i = 0; i < pos && bmap; ++i)
2962 bmap = var_equal(bmap, i);
2964 bmap = var_less(bmap, pos);
2965 return isl_basic_map_finalize(bmap);
2968 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2970 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
2971 __isl_take isl_dim *dim, unsigned pos)
2974 isl_basic_map *bmap;
2976 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2977 for (i = 0; i < pos; ++i)
2978 bmap = var_equal(bmap, i);
2979 bmap = var_less_or_equal(bmap, pos);
2980 return isl_basic_map_finalize(bmap);
2983 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2985 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2988 struct isl_basic_map *bmap;
2989 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2992 for (i = 0; i < pos && bmap; ++i)
2993 bmap = var_equal(bmap, i);
2995 bmap = var_more(bmap, pos);
2996 return isl_basic_map_finalize(bmap);
2999 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3001 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3002 __isl_take isl_dim *dim, unsigned pos)
3005 isl_basic_map *bmap;
3007 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3008 for (i = 0; i < pos; ++i)
3009 bmap = var_equal(bmap, i);
3010 bmap = var_more_or_equal(bmap, pos);
3011 return isl_basic_map_finalize(bmap);
3014 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3015 unsigned n, int equal)
3017 struct isl_map *map;
3020 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3022 for (i = 0; i + 1 < n; ++i)
3023 map = isl_map_add_basic_map(map,
3024 isl_basic_map_less_at(isl_dim_copy(dims), i));
3027 map = isl_map_add_basic_map(map,
3028 isl_basic_map_less_or_equal_at(dims, n - 1));
3030 map = isl_map_add_basic_map(map,
3031 isl_basic_map_less_at(dims, n - 1));
3038 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3042 return map_lex_lte_first(dims, dims->n_out, equal);
3045 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3047 return map_lex_lte_first(dim, n, 0);
3050 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3052 return map_lex_lte_first(dim, n, 1);
3055 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3057 return map_lex_lte(isl_dim_map(set_dim), 0);
3060 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3062 return map_lex_lte(isl_dim_map(set_dim), 1);
3065 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3066 unsigned n, int equal)
3068 struct isl_map *map;
3071 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3073 for (i = 0; i + 1 < n; ++i)
3074 map = isl_map_add_basic_map(map,
3075 isl_basic_map_more_at(isl_dim_copy(dims), i));
3078 map = isl_map_add_basic_map(map,
3079 isl_basic_map_more_or_equal_at(dims, n - 1));
3081 map = isl_map_add_basic_map(map,
3082 isl_basic_map_more_at(dims, n - 1));
3089 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3093 return map_lex_gte_first(dims, dims->n_out, equal);
3096 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3098 return map_lex_gte_first(dim, n, 0);
3101 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3103 return map_lex_gte_first(dim, n, 1);
3106 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3108 return map_lex_gte(isl_dim_map(set_dim), 0);
3111 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3113 return map_lex_gte(isl_dim_map(set_dim), 1);
3116 struct isl_basic_map *isl_basic_map_from_basic_set(
3117 struct isl_basic_set *bset, struct isl_dim *dim)
3119 struct isl_basic_map *bmap;
3121 bset = isl_basic_set_cow(bset);
3125 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3126 isl_dim_free(bset->dim);
3127 bmap = (struct isl_basic_map *) bset;
3129 return isl_basic_map_finalize(bmap);
3131 isl_basic_set_free(bset);
3136 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3140 if (bmap->dim->n_in == 0)
3141 return (struct isl_basic_set *)bmap;
3142 bmap = isl_basic_map_cow(bmap);
3145 bmap->dim = isl_dim_cow(bmap->dim);
3148 bmap->dim->n_out += bmap->dim->n_in;
3149 bmap->dim->n_in = 0;
3150 bmap = isl_basic_map_finalize(bmap);
3151 return (struct isl_basic_set *)bmap;
3153 isl_basic_map_free(bmap);
3157 /* For a div d = floor(f/m), add the constraints
3160 * -(f-(n-1)) + m d >= 0
3162 * Note that the second constraint is the negation of
3166 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3167 unsigned pos, isl_int *div)
3170 unsigned total = isl_basic_map_total_dim(bmap);
3172 i = isl_basic_map_alloc_inequality(bmap);
3175 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3176 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3178 j = isl_basic_map_alloc_inequality(bmap);
3181 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3182 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3183 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3187 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3188 unsigned pos, isl_int *div)
3190 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3194 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3196 unsigned total = isl_basic_map_total_dim(bmap);
3197 unsigned div_pos = total - bmap->n_div + div;
3199 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3203 struct isl_basic_set *isl_basic_map_underlying_set(
3204 struct isl_basic_map *bmap)
3208 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
3209 return (struct isl_basic_set *)bmap;
3210 bmap = isl_basic_map_cow(bmap);
3213 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3216 bmap->extra -= bmap->n_div;
3218 bmap = isl_basic_map_finalize(bmap);
3219 return (struct isl_basic_set *)bmap;
3224 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3225 __isl_take isl_basic_set *bset)
3227 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3230 struct isl_basic_map *isl_basic_map_overlying_set(
3231 struct isl_basic_set *bset, struct isl_basic_map *like)
3233 struct isl_basic_map *bmap;
3234 struct isl_ctx *ctx;
3241 isl_assert(ctx, bset->n_div == 0, goto error);
3242 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3243 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3245 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3246 isl_basic_map_free(like);
3247 return (struct isl_basic_map *)bset;
3249 bset = isl_basic_set_cow(bset);
3252 total = bset->dim->n_out + bset->extra;
3253 bmap = (struct isl_basic_map *)bset;
3254 isl_dim_free(bmap->dim);
3255 bmap->dim = isl_dim_copy(like->dim);
3258 bmap->n_div = like->n_div;
3259 bmap->extra += like->n_div;
3262 ltotal = total - bmap->extra + like->extra;
3265 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3266 bmap->extra * (1 + 1 + total));
3267 if (isl_blk_is_error(bmap->block2))
3269 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3273 for (i = 0; i < bmap->extra; ++i)
3274 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3275 for (i = 0; i < like->n_div; ++i) {
3276 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3277 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3279 bmap = isl_basic_map_extend_constraints(bmap,
3280 0, 2 * like->n_div);
3281 for (i = 0; i < like->n_div; ++i) {
3282 if (isl_int_is_zero(bmap->div[i][0]))
3284 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3288 isl_basic_map_free(like);
3289 bmap = isl_basic_map_simplify(bmap);
3290 bmap = isl_basic_map_finalize(bmap);
3293 isl_basic_map_free(like);
3294 isl_basic_set_free(bset);
3298 struct isl_basic_set *isl_basic_set_from_underlying_set(
3299 struct isl_basic_set *bset, struct isl_basic_set *like)
3301 return (struct isl_basic_set *)
3302 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3305 struct isl_set *isl_set_from_underlying_set(
3306 struct isl_set *set, struct isl_basic_set *like)
3312 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3314 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3315 isl_basic_set_free(like);
3318 set = isl_set_cow(set);
3321 for (i = 0; i < set->n; ++i) {
3322 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3323 isl_basic_set_copy(like));
3327 isl_dim_free(set->dim);
3328 set->dim = isl_dim_copy(like->dim);
3331 isl_basic_set_free(like);
3334 isl_basic_set_free(like);
3339 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3343 map = isl_map_cow(map);
3346 map->dim = isl_dim_cow(map->dim);
3350 for (i = 1; i < map->n; ++i)
3351 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3353 for (i = 0; i < map->n; ++i) {
3354 map->p[i] = (struct isl_basic_map *)
3355 isl_basic_map_underlying_set(map->p[i]);
3360 map->dim = isl_dim_underlying(map->dim, 0);
3362 isl_dim_free(map->dim);
3363 map->dim = isl_dim_copy(map->p[0]->dim);
3367 return (struct isl_set *)map;
3373 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3375 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3378 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3380 struct isl_basic_set *domain;
3385 n_in = isl_basic_map_n_in(bmap);
3386 n_out = isl_basic_map_n_out(bmap);
3387 domain = isl_basic_set_from_basic_map(bmap);
3388 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3391 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3393 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3396 struct isl_set *isl_map_range(struct isl_map *map)
3399 struct isl_set *set;
3403 if (isl_map_dim(map, isl_dim_in) == 0)
3404 return (isl_set *)map;
3406 map = isl_map_cow(map);
3410 set = (struct isl_set *) map;
3411 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3414 for (i = 0; i < map->n; ++i) {
3415 set->p[i] = isl_basic_map_range(map->p[i]);
3419 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3420 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3427 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3430 struct isl_map *map = NULL;
3432 set = isl_set_cow(set);
3435 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3436 map = (struct isl_map *)set;
3437 for (i = 0; i < set->n; ++i) {
3438 map->p[i] = isl_basic_map_from_basic_set(
3439 set->p[i], isl_dim_copy(dim));
3443 isl_dim_free(map->dim);
3452 struct isl_map *isl_map_from_range(struct isl_set *set)
3454 return (struct isl_map *)set;
3457 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3459 return isl_map_reverse(isl_map_from_range(set));;
3462 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3463 __isl_take isl_set *range)
3465 return isl_map_product(isl_map_from_domain(domain),
3466 isl_map_from_range(range));
3469 struct isl_set *isl_set_from_map(struct isl_map *map)
3472 struct isl_set *set = NULL;
3476 map = isl_map_cow(map);
3479 map->dim = isl_dim_cow(map->dim);
3482 map->dim->n_out += map->dim->n_in;
3484 set = (struct isl_set *)map;
3485 for (i = 0; i < map->n; ++i) {
3486 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3496 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3498 struct isl_map *map;
3502 isl_assert(dim->ctx, n >= 0, return NULL);
3503 map = isl_alloc(dim->ctx, struct isl_map,
3504 sizeof(struct isl_map) +
3505 (n - 1) * sizeof(struct isl_basic_map *));
3509 map->ctx = dim->ctx;
3510 isl_ctx_ref(map->ctx);
3522 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3523 unsigned nparam, unsigned in, unsigned out, int n,
3526 struct isl_map *map;
3527 struct isl_dim *dims;
3529 dims = isl_dim_alloc(ctx, nparam, in, out);
3533 map = isl_map_alloc_dim(dims, n, flags);
3537 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3539 struct isl_basic_map *bmap;
3540 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3541 bmap = isl_basic_map_set_to_empty(bmap);
3545 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3547 struct isl_basic_set *bset;
3548 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3549 bset = isl_basic_set_set_to_empty(bset);
3553 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3555 struct isl_basic_map *bmap;
3558 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3559 bmap = isl_basic_map_set_to_empty(bmap);
3563 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3565 struct isl_basic_map *bmap;
3568 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3569 bmap = isl_basic_map_set_to_empty(bmap);
3573 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3575 struct isl_basic_set *bset;
3578 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3579 bset = isl_basic_set_set_to_empty(bset);
3583 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3585 struct isl_basic_map *bmap;
3586 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3590 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3592 struct isl_basic_set *bset;
3593 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3597 __isl_give isl_basic_map *isl_basic_map_universe_like(
3598 __isl_keep isl_basic_map *model)
3602 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3605 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3609 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3612 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3613 __isl_keep isl_set *model)
3617 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3620 struct isl_map *isl_map_empty(struct isl_dim *dim)
3622 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3625 struct isl_map *isl_map_empty_like(struct isl_map *model)
3629 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3632 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3636 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3639 struct isl_set *isl_set_empty(struct isl_dim *dim)
3641 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3644 struct isl_set *isl_set_empty_like(struct isl_set *model)
3648 return isl_set_empty(isl_dim_copy(model->dim));
3651 struct isl_map *isl_map_universe(struct isl_dim *dim)
3653 struct isl_map *map;
3656 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3657 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3661 struct isl_set *isl_set_universe(struct isl_dim *dim)
3663 struct isl_set *set;
3666 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3667 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3671 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3675 return isl_set_universe(isl_dim_copy(model->dim));
3678 struct isl_map *isl_map_dup(struct isl_map *map)
3681 struct isl_map *dup;
3685 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3686 for (i = 0; i < map->n; ++i)
3687 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3691 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3692 __isl_take isl_basic_map *bmap)
3696 if (isl_basic_map_fast_is_empty(bmap)) {
3697 isl_basic_map_free(bmap);
3700 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3701 isl_assert(map->ctx, map->n < map->size, goto error);
3702 map->p[map->n] = bmap;
3704 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3710 isl_basic_map_free(bmap);
3714 void isl_map_free(struct isl_map *map)
3724 isl_ctx_deref(map->ctx);
3725 for (i = 0; i < map->n; ++i)
3726 isl_basic_map_free(map->p[i]);
3727 isl_dim_free(map->dim);
3731 struct isl_map *isl_map_extend(struct isl_map *base,
3732 unsigned nparam, unsigned n_in, unsigned n_out)
3736 base = isl_map_cow(base);
3740 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3743 for (i = 0; i < base->n; ++i) {
3744 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3745 isl_dim_copy(base->dim), 0, 0, 0);
3755 struct isl_set *isl_set_extend(struct isl_set *base,
3756 unsigned nparam, unsigned dim)
3758 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3762 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3763 struct isl_basic_map *bmap, unsigned pos, int value)
3767 bmap = isl_basic_map_cow(bmap);
3768 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3769 j = isl_basic_map_alloc_equality(bmap);
3772 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3773 isl_int_set_si(bmap->eq[j][pos], -1);
3774 isl_int_set_si(bmap->eq[j][0], value);
3775 bmap = isl_basic_map_simplify(bmap);
3776 return isl_basic_map_finalize(bmap);
3778 isl_basic_map_free(bmap);
3782 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3783 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3787 bmap = isl_basic_map_cow(bmap);
3788 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3789 j = isl_basic_map_alloc_equality(bmap);
3792 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3793 isl_int_set_si(bmap->eq[j][pos], -1);
3794 isl_int_set(bmap->eq[j][0], value);
3795 bmap = isl_basic_map_simplify(bmap);
3796 return isl_basic_map_finalize(bmap);
3798 isl_basic_map_free(bmap);
3802 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3803 enum isl_dim_type type, unsigned pos, int value)
3807 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3808 return isl_basic_map_fix_pos_si(bmap,
3809 isl_basic_map_offset(bmap, type) + pos, value);
3811 isl_basic_map_free(bmap);
3815 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3816 enum isl_dim_type type, unsigned pos, isl_int value)
3820 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3821 return isl_basic_map_fix_pos(bmap,
3822 isl_basic_map_offset(bmap, type) + pos, value);
3824 isl_basic_map_free(bmap);
3828 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3829 enum isl_dim_type type, unsigned pos, int value)
3831 return (struct isl_basic_set *)
3832 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3836 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3837 enum isl_dim_type type, unsigned pos, isl_int value)
3839 return (struct isl_basic_set *)
3840 isl_basic_map_fix((struct isl_basic_map *)bset,
3844 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3845 unsigned input, int value)
3847 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3850 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3851 unsigned dim, int value)
3853 return (struct isl_basic_set *)
3854 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3855 isl_dim_set, dim, value);
3858 struct isl_map *isl_map_fix_si(struct isl_map *map,
3859 enum isl_dim_type type, unsigned pos, int value)
3863 map = isl_map_cow(map);
3867 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3868 for (i = 0; i < map->n; ++i) {
3869 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3873 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3880 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3881 enum isl_dim_type type, unsigned pos, int value)
3883 return (struct isl_set *)
3884 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3887 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3888 enum isl_dim_type type, unsigned pos, isl_int value)
3892 map = isl_map_cow(map);
3896 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3897 for (i = 0; i < map->n; ++i) {
3898 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3902 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3909 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3910 enum isl_dim_type type, unsigned pos, isl_int value)
3912 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3915 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3916 unsigned input, int value)
3918 return isl_map_fix_si(map, isl_dim_in, input, value);
3921 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3923 return (struct isl_set *)
3924 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3927 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3928 __isl_take isl_basic_map *bmap,
3929 enum isl_dim_type type, unsigned pos, int value)
3935 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3936 pos += isl_basic_map_offset(bmap, type);
3937 bmap = isl_basic_map_cow(bmap);
3938 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3939 j = isl_basic_map_alloc_inequality(bmap);
3942 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3943 isl_int_set_si(bmap->ineq[j][pos], 1);
3944 isl_int_set_si(bmap->ineq[j][0], -value);
3945 bmap = isl_basic_map_simplify(bmap);
3946 return isl_basic_map_finalize(bmap);
3948 isl_basic_map_free(bmap);
3952 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3953 unsigned dim, isl_int value)
3957 bset = isl_basic_set_cow(bset);
3958 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3959 j = isl_basic_set_alloc_inequality(bset);
3962 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3963 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3964 isl_int_neg(bset->ineq[j][0], value);
3965 bset = isl_basic_set_simplify(bset);
3966 return isl_basic_set_finalize(bset);
3968 isl_basic_set_free(bset);
3972 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3973 enum isl_dim_type type, unsigned pos, int value)
3977 map = isl_map_cow(map);
3981 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3982 for (i = 0; i < map->n; ++i) {
3983 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3988 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3995 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3996 enum isl_dim_type type, unsigned pos, int value)
3998 return (struct isl_set *)
3999 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4002 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4007 set = isl_set_cow(set);
4011 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4012 for (i = 0; i < set->n; ++i) {
4013 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4023 struct isl_map *isl_map_reverse(struct isl_map *map)
4027 map = isl_map_cow(map);
4031 map->dim = isl_dim_reverse(map->dim);
4034 for (i = 0; i < map->n; ++i) {
4035 map->p[i] = isl_basic_map_reverse(map->p[i]);
4039 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4046 static struct isl_map *isl_basic_map_partial_lexopt(
4047 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4048 struct isl_set **empty, int max)
4052 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4053 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4055 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4057 isl_basic_map_free(bmap);
4058 isl_basic_set_free(dom);
4064 struct isl_map *isl_basic_map_partial_lexmax(
4065 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4066 struct isl_set **empty)
4068 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4071 struct isl_map *isl_basic_map_partial_lexmin(
4072 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4073 struct isl_set **empty)
4075 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4078 struct isl_set *isl_basic_set_partial_lexmin(
4079 struct isl_basic_set *bset, struct isl_basic_set *dom,
4080 struct isl_set **empty)
4082 return (struct isl_set *)
4083 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4087 struct isl_set *isl_basic_set_partial_lexmax(
4088 struct isl_basic_set *bset, struct isl_basic_set *dom,
4089 struct isl_set **empty)
4091 return (struct isl_set *)
4092 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4096 /* Given a basic map "bmap", compute the lexicograhically minimal
4097 * (or maximal) image element for each domain element in dom.
4098 * Set *empty to those elements in dom that do not have an image element.
4100 * We first make sure the basic sets in dom are disjoint and then
4101 * simply collect the results over each of the basic sets separately.
4102 * We could probably improve the efficiency a bit by moving the union
4103 * domain down into the parametric integer programming.
4105 static __isl_give isl_map *basic_map_partial_lexopt(
4106 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4107 __isl_give isl_set **empty, int max)
4110 struct isl_map *res;
4112 dom = isl_set_make_disjoint(dom);
4116 if (isl_set_fast_is_empty(dom)) {
4117 res = isl_map_empty_like_basic_map(bmap);
4118 *empty = isl_set_empty_like(dom);
4120 isl_basic_map_free(bmap);
4124 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4125 isl_basic_set_copy(dom->p[0]), empty, max);
4127 for (i = 1; i < dom->n; ++i) {
4128 struct isl_map *res_i;
4129 struct isl_set *empty_i;
4131 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4132 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4134 res = isl_map_union_disjoint(res, res_i);
4135 *empty = isl_set_union_disjoint(*empty, empty_i);
4139 isl_basic_map_free(bmap);
4144 isl_basic_map_free(bmap);
4148 /* Given a map "map", compute the lexicograhically minimal
4149 * (or maximal) image element for each domain element in dom.
4150 * Set *empty to those elements in dom that do not have an image element.
4152 * We first compute the lexicographically minimal or maximal element
4153 * in the first basic map. This results in a partial solution "res"
4154 * and a subset "todo" of dom that still need to be handled.
4155 * We then consider each of the remaining maps in "map" and successively
4156 * improve both "res" and "todo".
4158 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4159 * Assume we are computing the lexicographical maximum.
4160 * We first intersect basic map i with a relation that maps elements
4161 * to elements that are lexicographically larger than the image elements
4162 * in res^k and the compute the maximum image element of this intersection.
4163 * The result ("better") corresponds to those image elements in basic map i
4164 * that are better than what we had before. The remainder ("keep") are the
4165 * domain elements for which the image element in res_k was better.
4166 * We also compute the lexicographical maximum of basic map i in todo^k.
4167 * res^i is the result of the operation + better + those elements in
4168 * res^k that we should keep
4169 * todo^i is the remainder of the maximum operation on todo^k.
4171 static __isl_give isl_map *isl_map_partial_lexopt(
4172 __isl_take isl_map *map, __isl_take isl_set *dom,
4173 __isl_give isl_set **empty, int max)
4176 struct isl_map *res;
4177 struct isl_set *todo;
4182 if (isl_map_fast_is_empty(map)) {
4190 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4191 isl_set_copy(dom), &todo, max);
4193 for (i = 1; i < map->n; ++i) {
4195 struct isl_map *better;
4196 struct isl_set *keep;
4197 struct isl_map *res_i;
4198 struct isl_set *todo_i;
4199 struct isl_dim *dim = isl_map_get_dim(res);
4201 dim = isl_dim_range(dim);
4203 lt = isl_map_lex_lt(dim);
4205 lt = isl_map_lex_gt(dim);
4206 lt = isl_map_apply_range(isl_map_copy(res), lt);
4207 lt = isl_map_intersect(lt,
4208 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4209 better = isl_map_partial_lexopt(lt,
4210 isl_map_domain(isl_map_copy(res)),
4213 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4214 todo, &todo_i, max);
4216 res = isl_map_intersect_domain(res, keep);
4217 res = isl_map_union_disjoint(res, res_i);
4218 res = isl_map_union_disjoint(res, better);
4239 __isl_give isl_map *isl_map_partial_lexmax(
4240 __isl_take isl_map *map, __isl_take isl_set *dom,
4241 __isl_give isl_set **empty)
4243 return isl_map_partial_lexopt(map, dom, empty, 1);
4246 __isl_give isl_map *isl_map_partial_lexmin(
4247 __isl_take isl_map *map, __isl_take isl_set *dom,
4248 __isl_give isl_set **empty)
4250 return isl_map_partial_lexopt(map, dom, empty, 0);
4253 __isl_give isl_set *isl_set_partial_lexmin(
4254 __isl_take isl_set *set, __isl_take isl_set *dom,
4255 __isl_give isl_set **empty)
4257 return (struct isl_set *)
4258 isl_map_partial_lexmin((struct isl_map *)set,
4262 __isl_give isl_set *isl_set_partial_lexmax(
4263 __isl_take isl_set *set, __isl_take isl_set *dom,
4264 __isl_give isl_set **empty)
4266 return (struct isl_set *)
4267 isl_map_partial_lexmax((struct isl_map *)set,
4271 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4273 struct isl_basic_set *dom = NULL;
4274 struct isl_dim *dom_dim;
4278 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4279 dom = isl_basic_set_universe(dom_dim);
4280 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4282 isl_basic_map_free(bmap);
4286 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4288 return isl_basic_map_lexopt(bmap, 0);
4291 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4293 return isl_basic_map_lexopt(bmap, 1);
4296 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4298 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4301 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4303 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4306 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4308 struct isl_set *dom = NULL;
4309 struct isl_dim *dom_dim;
4313 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4314 dom = isl_set_universe(dom_dim);
4315 return isl_map_partial_lexopt(map, dom, NULL, max);
4321 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4323 return isl_map_lexopt(map, 0);
4326 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4328 return isl_map_lexopt(map, 1);
4331 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4333 return (isl_set *)isl_map_lexmin((isl_map *)set);
4336 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4338 return (isl_set *)isl_map_lexmax((isl_map *)set);
4341 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4342 struct isl_dim *dim)
4349 for (i = 0; i < map->n; ++i) {
4350 isl_dim_free(map->p[i]->dim);
4351 map->p[i]->dim = isl_dim_copy(dim);
4353 isl_dim_free(map->dim);
4363 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4364 struct isl_dim *dim)
4366 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4369 /* Apply a preimage specified by "mat" on the parameters of "bset".
4370 * bset is assumed to have only parameters and divs.
4372 static struct isl_basic_set *basic_set_parameter_preimage(
4373 struct isl_basic_set *bset, struct isl_mat *mat)
4380 bset->dim = isl_dim_cow(bset->dim);
4384 nparam = isl_basic_set_dim(bset, isl_dim_param);
4386 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4388 bset->dim->nparam = 0;
4389 bset->dim->n_out = nparam;
4390 bset = isl_basic_set_preimage(bset, mat);
4392 bset->dim->nparam = bset->dim->n_out;
4393 bset->dim->n_out = 0;
4398 isl_basic_set_free(bset);
4402 /* Apply a preimage specified by "mat" on the parameters of "set".
4403 * set is assumed to have only parameters and divs.
4405 static struct isl_set *set_parameter_preimage(
4406 struct isl_set *set, struct isl_mat *mat)
4408 struct isl_dim *dim = NULL;
4414 dim = isl_dim_copy(set->dim);
4415 dim = isl_dim_cow(dim);
4419 nparam = isl_set_dim(set, isl_dim_param);
4421 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4424 dim->n_out = nparam;
4425 isl_set_reset_dim(set, dim);
4426 set = isl_set_preimage(set, mat);
4429 dim = isl_dim_copy(set->dim);
4430 dim = isl_dim_cow(dim);
4433 dim->nparam = dim->n_out;
4435 isl_set_reset_dim(set, dim);
4445 /* Intersect the basic set "bset" with the affine space specified by the
4446 * equalities in "eq".
4448 static struct isl_basic_set *basic_set_append_equalities(
4449 struct isl_basic_set *bset, struct isl_mat *eq)
4457 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4462 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4463 for (i = 0; i < eq->n_row; ++i) {
4464 k = isl_basic_set_alloc_equality(bset);
4467 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4468 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4472 bset = isl_basic_set_gauss(bset, NULL);
4473 bset = isl_basic_set_finalize(bset);
4478 isl_basic_set_free(bset);
4482 /* Intersect the set "set" with the affine space specified by the
4483 * equalities in "eq".
4485 static struct isl_set *set_append_equalities(struct isl_set *set,
4493 for (i = 0; i < set->n; ++i) {
4494 set->p[i] = basic_set_append_equalities(set->p[i],
4507 /* Project the given basic set onto its parameter domain, possibly introducing
4508 * new, explicit, existential variables in the constraints.
4509 * The input has parameters and (possibly implicit) existential variables.
4510 * The output has the same parameters, but only
4511 * explicit existentially quantified variables.
4513 * The actual projection is performed by pip, but pip doesn't seem
4514 * to like equalities very much, so we first remove the equalities
4515 * among the parameters by performing a variable compression on
4516 * the parameters. Afterward, an inverse transformation is performed
4517 * and the equalities among the parameters are inserted back in.
4519 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4523 struct isl_mat *T, *T2;
4524 struct isl_set *set;
4525 unsigned nparam, n_div;
4527 bset = isl_basic_set_cow(bset);
4531 if (bset->n_eq == 0)
4532 return isl_basic_set_lexmin(bset);
4534 isl_basic_set_gauss(bset, NULL);
4536 nparam = isl_basic_set_dim(bset, isl_dim_param);
4537 n_div = isl_basic_set_dim(bset, isl_dim_div);
4539 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4540 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4543 if (i == bset->n_eq)
4544 return isl_basic_set_lexmin(bset);
4546 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4548 eq = isl_mat_cow(eq);
4549 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4550 if (T && T->n_col == 0) {
4554 bset = isl_basic_set_set_to_empty(bset);
4555 return isl_set_from_basic_set(bset);
4557 bset = basic_set_parameter_preimage(bset, T);
4559 set = isl_basic_set_lexmin(bset);
4560 set = set_parameter_preimage(set, T2);
4561 set = set_append_equalities(set, eq);
4565 /* Compute an explicit representation for all the existentially
4566 * quantified variables.
4567 * The input and output dimensions are first turned into parameters.
4568 * compute_divs then returns a map with the same parameters and
4569 * no input or output dimensions and the dimension specification
4570 * is reset to that of the input.
4572 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4574 struct isl_basic_set *bset;
4575 struct isl_set *set;
4576 struct isl_map *map;
4577 struct isl_dim *dim, *orig_dim = NULL;
4582 bmap = isl_basic_map_cow(bmap);
4586 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4587 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4588 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4589 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4593 orig_dim = bmap->dim;
4595 bset = (struct isl_basic_set *)bmap;
4597 set = parameter_compute_divs(bset);
4598 map = (struct isl_map *)set;
4599 map = isl_map_reset_dim(map, orig_dim);
4603 isl_basic_map_free(bmap);
4607 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4615 off = isl_dim_total(bmap->dim);
4616 for (i = 0; i < bmap->n_div; ++i) {
4617 if (isl_int_is_zero(bmap->div[i][0]))
4619 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4625 static int map_divs_known(__isl_keep isl_map *map)
4632 for (i = 0; i < map->n; ++i) {
4633 int known = basic_map_divs_known(map->p[i]);
4641 /* If bmap contains any unknown divs, then compute explicit
4642 * expressions for them. However, this computation may be
4643 * quite expensive, so first try to remove divs that aren't
4646 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4650 struct isl_map *map;
4652 known = basic_map_divs_known(bmap);
4656 return isl_map_from_basic_map(bmap);
4658 bmap = isl_basic_map_drop_redundant_divs(bmap);
4660 known = basic_map_divs_known(bmap);
4664 return isl_map_from_basic_map(bmap);
4666 map = compute_divs(bmap);
4669 isl_basic_map_free(bmap);
4673 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4677 struct isl_map *res;
4684 known = map_divs_known(map);
4692 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4693 for (i = 1 ; i < map->n; ++i) {
4695 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4696 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4697 res = isl_map_union_disjoint(res, r2);
4699 res = isl_map_union(res, r2);
4706 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4708 return (struct isl_set *)
4709 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4712 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4714 return (struct isl_set *)
4715 isl_map_compute_divs((struct isl_map *)set);
4718 struct isl_set *isl_map_domain(struct isl_map *map)
4721 struct isl_set *set;
4726 map = isl_map_cow(map);
4730 set = (struct isl_set *)map;
4731 set->dim = isl_dim_domain(set->dim);
4734 for (i = 0; i < map->n; ++i) {
4735 set->p[i] = isl_basic_map_domain(map->p[i]);
4739 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4740 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4747 struct isl_map *isl_map_union_disjoint(
4748 struct isl_map *map1, struct isl_map *map2)
4752 struct isl_map *map = NULL;
4766 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4768 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4769 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4770 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4772 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4773 map1->n + map2->n, flags);
4776 for (i = 0; i < map1->n; ++i) {
4777 map = isl_map_add_basic_map(map,
4778 isl_basic_map_copy(map1->p[i]));
4782 for (i = 0; i < map2->n; ++i) {
4783 map = isl_map_add_basic_map(map,
4784 isl_basic_map_copy(map2->p[i]));
4798 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4800 map1 = isl_map_union_disjoint(map1, map2);
4804 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4808 struct isl_set *isl_set_union_disjoint(
4809 struct isl_set *set1, struct isl_set *set2)
4811 return (struct isl_set *)
4812 isl_map_union_disjoint(
4813 (struct isl_map *)set1, (struct isl_map *)set2);
4816 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4818 return (struct isl_set *)
4819 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4822 struct isl_map *isl_map_intersect_range(
4823 struct isl_map *map, struct isl_set *set)
4826 struct isl_map *result;
4832 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4833 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4834 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4836 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4837 map->n * set->n, flags);
4840 for (i = 0; i < map->n; ++i)
4841 for (j = 0; j < set->n; ++j) {
4842 result = isl_map_add_basic_map(result,
4843 isl_basic_map_intersect_range(
4844 isl_basic_map_copy(map->p[i]),
4845 isl_basic_set_copy(set->p[j])));
4858 struct isl_map *isl_map_intersect_domain(
4859 struct isl_map *map, struct isl_set *set)
4861 return isl_map_reverse(
4862 isl_map_intersect_range(isl_map_reverse(map), set));
4865 struct isl_map *isl_map_apply_domain(
4866 struct isl_map *map1, struct isl_map *map2)
4870 map1 = isl_map_reverse(map1);
4871 map1 = isl_map_apply_range(map1, map2);
4872 return isl_map_reverse(map1);
4879 struct isl_map *isl_map_apply_range(
4880 struct isl_map *map1, struct isl_map *map2)
4882 struct isl_dim *dim_result;
4883 struct isl_map *result;
4889 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4890 isl_dim_copy(map2->dim));
4892 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4895 for (i = 0; i < map1->n; ++i)
4896 for (j = 0; j < map2->n; ++j) {
4897 result = isl_map_add_basic_map(result,
4898 isl_basic_map_apply_range(
4899 isl_basic_map_copy(map1->p[i]),
4900 isl_basic_map_copy(map2->p[j])));
4906 if (result && result->n <= 1)
4907 ISL_F_SET(result, ISL_MAP_DISJOINT);
4916 * returns range - domain
4918 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4921 struct isl_basic_set *bset;
4928 dim = isl_basic_map_n_in(bmap);
4929 nparam = isl_basic_map_n_param(bmap);
4930 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4931 bset = isl_basic_set_from_basic_map(bmap);
4932 bset = isl_basic_set_cow(bset);
4933 dims = isl_basic_set_get_dim(bset);
4934 dims = isl_dim_add(dims, isl_dim_set, dim);
4935 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
4936 bset = isl_basic_set_swap_vars(bset, 2*dim);
4937 for (i = 0; i < dim; ++i) {
4938 int j = isl_basic_map_alloc_equality(
4939 (struct isl_basic_map *)bset);
4942 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4943 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4944 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4945 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4947 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4949 isl_basic_map_free(bmap);
4954 * returns range - domain
4956 struct isl_set *isl_map_deltas(struct isl_map *map)
4960 struct isl_set *result;
4965 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4966 dim = isl_map_get_dim(map);
4967 dim = isl_dim_domain(dim);
4968 result = isl_set_alloc_dim(dim, map->n, map->flags);
4971 for (i = 0; i < map->n; ++i)
4972 result = isl_set_add_basic_set(result,
4973 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4981 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4983 struct isl_basic_map *bmap;
4991 nparam = dims->nparam;
4993 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4997 for (i = 0; i < dim; ++i) {
4998 int j = isl_basic_map_alloc_equality(bmap);
5001 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5002 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5003 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5005 return isl_basic_map_finalize(bmap);
5007 isl_basic_map_free(bmap);
5011 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5013 struct isl_dim *dim = isl_dim_map(set_dim);
5016 return basic_map_identity(dim);
5019 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5021 if (!model || !model->dim)
5023 isl_assert(model->ctx,
5024 model->dim->n_in == model->dim->n_out, return NULL);
5025 return basic_map_identity(isl_dim_copy(model->dim));
5028 static struct isl_map *map_identity(struct isl_dim *dim)
5030 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5031 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5034 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5036 struct isl_dim *dim = isl_dim_map(set_dim);
5039 return map_identity(dim);
5042 struct isl_map *isl_map_identity_like(struct isl_map *model)
5044 if (!model || !model->dim)
5046 isl_assert(model->ctx,
5047 model->dim->n_in == model->dim->n_out, return NULL);
5048 return map_identity(isl_dim_copy(model->dim));
5051 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5053 if (!model || !model->dim)
5055 isl_assert(model->ctx,
5056 model->dim->n_in == model->dim->n_out, return NULL);
5057 return map_identity(isl_dim_copy(model->dim));
5060 /* Construct a basic set with all set dimensions having only non-negative
5063 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5068 struct isl_basic_set *bset;
5072 nparam = dims->nparam;
5074 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5077 for (i = 0; i < dim; ++i) {
5078 int k = isl_basic_set_alloc_inequality(bset);
5081 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5082 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5086 isl_basic_set_free(bset);
5090 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5091 enum isl_dim_type type, unsigned first, unsigned n)
5094 isl_basic_set *nonneg = NULL;
5095 isl_basic_set *neg = NULL;
5102 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5104 for (i = 0; i < n; ++i) {
5108 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5109 k = isl_basic_set_alloc_inequality(nonneg);
5112 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5113 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5115 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5116 k = isl_basic_set_alloc_inequality(neg);
5119 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5120 isl_int_set_si(neg->ineq[k][0], -1);
5121 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5123 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5128 isl_basic_set_free(nonneg);
5129 isl_basic_set_free(neg);
5134 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5136 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5139 int isl_basic_map_is_subset(
5140 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5143 struct isl_map *map1;
5144 struct isl_map *map2;
5146 if (!bmap1 || !bmap2)
5149 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5150 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5152 is_subset = isl_map_is_subset(map1, map2);
5160 int isl_basic_map_is_equal(
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);
5174 int isl_basic_set_is_equal(
5175 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5177 return isl_basic_map_is_equal(
5178 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5181 int isl_map_is_empty(struct isl_map *map)
5188 for (i = 0; i < map->n; ++i) {
5189 is_empty = isl_basic_map_is_empty(map->p[i]);
5198 int isl_map_fast_is_empty(struct isl_map *map)
5203 int isl_set_fast_is_empty(struct isl_set *set)
5208 int isl_set_is_empty(struct isl_set *set)
5210 return isl_map_is_empty((struct isl_map *)set);
5213 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5219 is_subset = isl_map_is_subset(map1, map2);
5222 is_subset = isl_map_is_subset(map2, map1);
5226 int isl_basic_map_is_strict_subset(
5227 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5231 if (!bmap1 || !bmap2)
5233 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5236 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5237 if (is_subset == -1)
5242 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5248 is_subset = isl_map_is_subset(map1, map2);
5251 is_subset = isl_map_is_subset(map2, map1);
5252 if (is_subset == -1)
5257 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5259 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5262 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5266 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5269 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5273 return bset->n_eq == 0 && bset->n_ineq == 0;
5276 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5281 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
5284 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5286 return isl_map_fast_is_universe((isl_map *) set);
5289 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5291 struct isl_basic_set *bset = NULL;
5292 struct isl_vec *sample = NULL;
5299 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5302 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5303 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5304 copy = isl_basic_map_convex_hull(copy);
5305 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5306 isl_basic_map_free(copy);
5310 total = 1 + isl_basic_map_total_dim(bmap);
5311 if (bmap->sample && bmap->sample->size == total) {
5312 int contains = isl_basic_map_contains(bmap, bmap->sample);
5318 isl_vec_free(bmap->sample);
5319 bmap->sample = NULL;
5320 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5323 sample = isl_basic_set_sample_vec(bset);
5326 empty = sample->size == 0;
5327 isl_vec_free(bmap->sample);
5328 bmap->sample = sample;
5330 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5335 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5339 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5342 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5346 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5349 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5351 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5354 struct isl_map *isl_basic_map_union(
5355 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5357 struct isl_map *map;
5358 if (!bmap1 || !bmap2)
5361 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5363 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5366 map = isl_map_add_basic_map(map, bmap1);
5367 map = isl_map_add_basic_map(map, bmap2);
5370 isl_basic_map_free(bmap1);
5371 isl_basic_map_free(bmap2);
5375 struct isl_set *isl_basic_set_union(
5376 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5378 return (struct isl_set *)isl_basic_map_union(
5379 (struct isl_basic_map *)bset1,
5380 (struct isl_basic_map *)bset2);
5383 /* Order divs such that any div only depends on previous divs */
5384 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5387 unsigned off = isl_dim_total(bmap->dim);
5389 for (i = 0; i < bmap->n_div; ++i) {
5391 if (isl_int_is_zero(bmap->div[i][0]))
5393 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5397 isl_basic_map_swap_div(bmap, i, i + pos);
5403 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5405 return (struct isl_basic_set *)
5406 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5409 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5416 for (i = 0; i < map->n; ++i) {
5417 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5428 /* Look for a div in dst that corresponds to the div "div" in src.
5429 * The divs before "div" in src and dst are assumed to be the same.
5431 * Returns -1 if no corresponding div was found and the position
5432 * of the corresponding div in dst otherwise.
5434 static int find_div(struct isl_basic_map *dst,
5435 struct isl_basic_map *src, unsigned div)
5439 unsigned total = isl_dim_total(src->dim);
5441 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5442 for (i = div; i < dst->n_div; ++i)
5443 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5444 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5445 dst->n_div - div) == -1)
5450 struct isl_basic_map *isl_basic_map_align_divs(
5451 struct isl_basic_map *dst, struct isl_basic_map *src)
5454 unsigned total = isl_dim_total(src->dim);
5459 if (src->n_div == 0)
5462 for (i = 0; i < src->n_div; ++i)
5463 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5465 src = isl_basic_map_order_divs(src);
5466 dst = isl_basic_map_cow(dst);
5467 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5468 src->n_div, 0, 2 * src->n_div);
5471 for (i = 0; i < src->n_div; ++i) {
5472 int j = find_div(dst, src, i);
5474 j = isl_basic_map_alloc_div(dst);
5477 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5478 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5479 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5483 isl_basic_map_swap_div(dst, i, j);
5487 isl_basic_map_free(dst);
5491 struct isl_basic_set *isl_basic_set_align_divs(
5492 struct isl_basic_set *dst, struct isl_basic_set *src)
5494 return (struct isl_basic_set *)isl_basic_map_align_divs(
5495 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5498 struct isl_map *isl_map_align_divs(struct isl_map *map)
5506 map = isl_map_compute_divs(map);
5507 map = isl_map_cow(map);
5511 for (i = 1; i < map->n; ++i)
5512 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5513 for (i = 1; i < map->n; ++i)
5514 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5516 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5520 struct isl_set *isl_set_align_divs(struct isl_set *set)
5522 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5525 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5529 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5530 map = isl_map_intersect_domain(map, set);
5531 set = isl_map_range(map);
5539 /* There is no need to cow as removing empty parts doesn't change
5540 * the meaning of the set.
5542 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5549 for (i = map->n-1; i >= 0; --i) {
5550 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5552 isl_basic_map_free(map->p[i]);
5553 if (i != map->n-1) {
5554 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5555 map->p[i] = map->p[map->n-1];
5563 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5565 return (struct isl_set *)
5566 isl_map_remove_empty_parts((struct isl_map *)set);
5569 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5571 struct isl_basic_map *bmap;
5572 if (!map || map->n == 0)
5574 bmap = map->p[map->n-1];
5575 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5576 return isl_basic_map_copy(bmap);
5579 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5581 return (struct isl_basic_set *)
5582 isl_map_copy_basic_map((struct isl_map *)set);
5585 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5586 __isl_keep isl_basic_map *bmap)
5592 for (i = map->n-1; i >= 0; --i) {
5593 if (map->p[i] != bmap)
5595 map = isl_map_cow(map);
5598 isl_basic_map_free(map->p[i]);
5599 if (i != map->n-1) {
5600 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5601 map->p[i] = map->p[map->n-1];
5612 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5613 struct isl_basic_set *bset)
5615 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5616 (struct isl_basic_map *)bset);
5619 /* Given two basic sets bset1 and bset2, compute the maximal difference
5620 * between the values of dimension pos in bset1 and those in bset2
5621 * for any common value of the parameters and dimensions preceding pos.
5623 static enum isl_lp_result basic_set_maximal_difference_at(
5624 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5625 int pos, isl_int *opt)
5627 struct isl_dim *dims;
5628 struct isl_basic_map *bmap1 = NULL;
5629 struct isl_basic_map *bmap2 = NULL;
5630 struct isl_ctx *ctx;
5631 struct isl_vec *obj;
5634 unsigned dim1, dim2;
5635 enum isl_lp_result res;
5637 if (!bset1 || !bset2)
5638 return isl_lp_error;
5640 nparam = isl_basic_set_n_param(bset1);
5641 dim1 = isl_basic_set_n_dim(bset1);
5642 dim2 = isl_basic_set_n_dim(bset2);
5643 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5644 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5645 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5646 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5647 if (!bmap1 || !bmap2)
5649 bmap1 = isl_basic_map_cow(bmap1);
5650 bmap1 = isl_basic_map_extend(bmap1, nparam,
5651 pos, (dim1 - pos) + (dim2 - pos),
5652 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5653 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5656 total = isl_basic_map_total_dim(bmap1);
5658 obj = isl_vec_alloc(ctx, 1 + total);
5659 isl_seq_clr(obj->block.data, 1 + total);
5660 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5661 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5664 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5666 isl_basic_map_free(bmap1);
5670 isl_basic_map_free(bmap1);
5671 isl_basic_map_free(bmap2);
5672 return isl_lp_error;
5675 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5676 * for any common value of the parameters and dimensions preceding pos
5677 * in both basic sets, the values of dimension pos in bset1 are
5678 * smaller or larger than those in bset2.
5681 * 1 if bset1 follows bset2
5682 * -1 if bset1 precedes bset2
5683 * 0 if bset1 and bset2 are incomparable
5684 * -2 if some error occurred.
5686 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5687 struct isl_basic_set *bset2, int pos)
5690 enum isl_lp_result res;
5695 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5697 if (res == isl_lp_empty)
5699 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5700 res == isl_lp_unbounded)
5702 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5711 /* Given two basic sets bset1 and bset2, check whether
5712 * for any common value of the parameters and dimensions preceding pos
5713 * there is a value of dimension pos in bset1 that is larger
5714 * than a value of the same dimension in bset2.
5717 * 1 if there exists such a pair
5718 * 0 if there is no such pair, but there is a pair of equal values
5720 * -2 if some error occurred.
5722 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5723 __isl_keep isl_basic_set *bset2, int pos)
5726 enum isl_lp_result res;
5731 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5733 if (res == isl_lp_empty)
5735 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5736 res == isl_lp_unbounded)
5738 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5740 else if (res == isl_lp_ok)
5749 /* Given two sets set1 and set2, check whether
5750 * for any common value of the parameters and dimensions preceding pos
5751 * there is a value of dimension pos in set1 that is larger
5752 * than a value of the same dimension in set2.
5755 * 1 if there exists such a pair
5756 * 0 if there is no such pair, but there is a pair of equal values
5758 * -2 if some error occurred.
5760 int isl_set_follows_at(__isl_keep isl_set *set1,
5761 __isl_keep isl_set *set2, int pos)
5769 for (i = 0; i < set1->n; ++i)
5770 for (j = 0; j < set2->n; ++j) {
5772 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5773 if (f == 1 || f == -2)
5782 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5783 unsigned pos, isl_int *val)
5791 total = isl_basic_map_total_dim(bmap);
5792 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5793 for (; d+1 > pos; --d)
5794 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5798 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5800 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5802 if (!isl_int_is_one(bmap->eq[i][1+d]))
5805 isl_int_neg(*val, bmap->eq[i][0]);
5811 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5812 unsigned pos, isl_int *val)
5824 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5827 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5828 for (i = 1; fixed == 1 && i < map->n; ++i) {
5829 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5830 if (fixed == 1 && isl_int_ne(tmp, v))
5834 isl_int_set(*val, v);
5840 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5841 unsigned pos, isl_int *val)
5843 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5847 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5850 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5853 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5854 enum isl_dim_type type, unsigned pos, isl_int *val)
5856 if (pos >= isl_basic_map_dim(bmap, type))
5858 return isl_basic_map_fast_has_fixed_var(bmap,
5859 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5862 int isl_map_fast_is_fixed(struct isl_map *map,
5863 enum isl_dim_type type, unsigned pos, isl_int *val)
5865 if (pos >= isl_map_dim(map, type))
5867 return isl_map_fast_has_fixed_var(map,
5868 map_offset(map, type) - 1 + pos, val);
5871 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5872 * then return this fixed value in *val.
5874 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5877 return isl_basic_set_fast_has_fixed_var(bset,
5878 isl_basic_set_n_param(bset) + dim, val);
5881 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5882 * then return this fixed value in *val.
5884 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5886 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5889 /* Check if input variable in has fixed value and if so and if val is not NULL,
5890 * then return this fixed value in *val.
5892 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5894 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5897 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5898 * and if val is not NULL, then return this lower bound in *val.
5900 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5901 unsigned dim, isl_int *val)
5903 int i, i_eq = -1, i_ineq = -1;
5910 total = isl_basic_set_total_dim(bset);
5911 nparam = isl_basic_set_n_param(bset);
5912 for (i = 0; i < bset->n_eq; ++i) {
5913 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5919 for (i = 0; i < bset->n_ineq; ++i) {
5920 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5922 if (i_eq != -1 || i_ineq != -1)
5926 if (i_eq == -1 && i_ineq == -1)
5928 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5929 /* The coefficient should always be one due to normalization. */
5930 if (!isl_int_is_one(c[1+nparam+dim]))
5932 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5934 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5935 total - nparam - dim - 1) != -1)
5938 isl_int_neg(*val, c[0]);
5942 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5943 unsigned dim, isl_int *val)
5955 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5959 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5961 for (i = 1; fixed == 1 && i < set->n; ++i) {
5962 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5964 if (fixed == 1 && isl_int_ne(tmp, v))
5968 isl_int_set(*val, v);
5979 static int qsort_constraint_cmp(const void *p1, const void *p2)
5981 const struct constraint *c1 = (const struct constraint *)p1;
5982 const struct constraint *c2 = (const struct constraint *)p2;
5983 unsigned size = isl_min(c1->size, c2->size);
5984 return isl_seq_cmp(c1->c, c2->c, size);
5987 static struct isl_basic_map *isl_basic_map_sort_constraints(
5988 struct isl_basic_map *bmap)
5991 struct constraint *c;
5996 total = isl_basic_map_total_dim(bmap);
5997 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6000 for (i = 0; i < bmap->n_ineq; ++i) {
6002 c[i].c = bmap->ineq[i];
6004 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6005 for (i = 0; i < bmap->n_ineq; ++i)
6006 bmap->ineq[i] = c[i].c;
6010 isl_basic_map_free(bmap);
6014 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6015 __isl_take isl_basic_set *bset)
6017 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6018 (struct isl_basic_map *)bset);
6021 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6025 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6027 bmap = isl_basic_map_convex_hull(bmap);
6028 bmap = isl_basic_map_sort_constraints(bmap);
6029 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6033 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6035 return (struct isl_basic_set *)isl_basic_map_normalize(
6036 (struct isl_basic_map *)bset);
6039 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
6040 const struct isl_basic_map *bmap2)
6047 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6048 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6049 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6050 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6051 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6052 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6053 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6054 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6056 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6058 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6060 if (bmap1->n_eq != bmap2->n_eq)
6061 return bmap1->n_eq - bmap2->n_eq;
6062 if (bmap1->n_ineq != bmap2->n_ineq)
6063 return bmap1->n_ineq - bmap2->n_ineq;
6064 if (bmap1->n_div != bmap2->n_div)
6065 return bmap1->n_div - bmap2->n_div;
6066 total = isl_basic_map_total_dim(bmap1);
6067 for (i = 0; i < bmap1->n_eq; ++i) {
6068 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6072 for (i = 0; i < bmap1->n_ineq; ++i) {
6073 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6077 for (i = 0; i < bmap1->n_div; ++i) {
6078 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6085 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
6086 struct isl_basic_map *bmap2)
6088 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6091 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6092 __isl_keep isl_basic_set *bset2)
6094 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6095 (isl_basic_map *)bset2);
6098 static int qsort_bmap_cmp(const void *p1, const void *p2)
6100 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6101 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6103 return isl_basic_map_fast_cmp(bmap1, bmap2);
6106 /* We normalize in place, but if anything goes wrong we need
6107 * to return NULL, so we need to make sure we don't change the
6108 * meaning of any possible other copies of map.
6110 struct isl_map *isl_map_normalize(struct isl_map *map)
6113 struct isl_basic_map *bmap;
6117 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6119 for (i = 0; i < map->n; ++i) {
6120 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6123 isl_basic_map_free(map->p[i]);
6126 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6127 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6128 map = isl_map_remove_empty_parts(map);
6131 for (i = map->n - 1; i >= 1; --i) {
6132 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6134 isl_basic_map_free(map->p[i-1]);
6135 for (j = i; j < map->n; ++j)
6136 map->p[j-1] = map->p[j];
6146 struct isl_set *isl_set_normalize(struct isl_set *set)
6148 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6151 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6161 if (!isl_dim_equal(map1->dim, map2->dim))
6164 map1 = isl_map_copy(map1);
6165 map2 = isl_map_copy(map2);
6166 map1 = isl_map_normalize(map1);
6167 map2 = isl_map_normalize(map2);
6170 equal = map1->n == map2->n;
6171 for (i = 0; equal && i < map1->n; ++i) {
6172 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6185 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6187 return isl_map_fast_is_equal((struct isl_map *)set1,
6188 (struct isl_map *)set2);
6191 /* Return an interval that ranges from min to max (inclusive)
6193 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6194 isl_int min, isl_int max)
6197 struct isl_basic_set *bset = NULL;
6199 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6203 k = isl_basic_set_alloc_inequality(bset);
6206 isl_int_set_si(bset->ineq[k][1], 1);
6207 isl_int_neg(bset->ineq[k][0], min);
6209 k = isl_basic_set_alloc_inequality(bset);
6212 isl_int_set_si(bset->ineq[k][1], -1);
6213 isl_int_set(bset->ineq[k][0], max);
6217 isl_basic_set_free(bset);
6221 /* Return the Cartesian product of the basic sets in list (in the given order).
6223 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6231 struct isl_basic_set *product = NULL;
6235 isl_assert(list->ctx, list->n > 0, goto error);
6236 isl_assert(list->ctx, list->p[0], goto error);
6237 nparam = isl_basic_set_n_param(list->p[0]);
6238 dim = isl_basic_set_n_dim(list->p[0]);
6239 extra = list->p[0]->n_div;
6240 n_eq = list->p[0]->n_eq;
6241 n_ineq = list->p[0]->n_ineq;
6242 for (i = 1; i < list->n; ++i) {
6243 isl_assert(list->ctx, list->p[i], goto error);
6244 isl_assert(list->ctx,
6245 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6246 dim += isl_basic_set_n_dim(list->p[i]);
6247 extra += list->p[i]->n_div;
6248 n_eq += list->p[i]->n_eq;
6249 n_ineq += list->p[i]->n_ineq;
6251 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6256 for (i = 0; i < list->n; ++i) {
6257 isl_basic_set_add_constraints(product,
6258 isl_basic_set_copy(list->p[i]), dim);
6259 dim += isl_basic_set_n_dim(list->p[i]);
6261 isl_basic_set_list_free(list);
6264 isl_basic_set_free(product);
6265 isl_basic_set_list_free(list);
6269 struct isl_basic_map *isl_basic_map_product(
6270 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6272 struct isl_dim *dim_result = NULL;
6273 struct isl_basic_map *bmap;
6274 unsigned in1, in2, out1, out2, nparam, total, pos;
6275 struct isl_dim_map *dim_map1, *dim_map2;
6277 if (!bmap1 || !bmap2)
6280 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6281 bmap2->dim, isl_dim_param), goto error);
6282 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6283 isl_dim_copy(bmap2->dim));
6285 in1 = isl_basic_map_n_in(bmap1);
6286 in2 = isl_basic_map_n_in(bmap2);
6287 out1 = isl_basic_map_n_out(bmap1);
6288 out2 = isl_basic_map_n_out(bmap2);
6289 nparam = isl_basic_map_n_param(bmap1);
6291 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6292 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6293 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6294 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6295 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6296 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6297 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6298 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6299 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6300 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6301 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6303 bmap = isl_basic_map_alloc_dim(dim_result,
6304 bmap1->n_div + bmap2->n_div,
6305 bmap1->n_eq + bmap2->n_eq,
6306 bmap1->n_ineq + bmap2->n_ineq);
6307 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6308 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6309 bmap = isl_basic_map_simplify(bmap);
6310 return isl_basic_map_finalize(bmap);
6312 isl_basic_map_free(bmap1);
6313 isl_basic_map_free(bmap2);
6317 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6319 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6322 struct isl_map *result;
6328 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6329 map2->dim, isl_dim_param), goto error);
6331 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6332 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6333 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6335 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6336 isl_dim_copy(map2->dim)),
6337 map1->n * map2->n, flags);
6340 for (i = 0; i < map1->n; ++i)
6341 for (j = 0; j < map2->n; ++j) {
6342 struct isl_basic_map *part;
6343 part = isl_basic_map_product(
6344 isl_basic_map_copy(map1->p[i]),
6345 isl_basic_map_copy(map2->p[j]));
6346 if (isl_basic_map_is_empty(part))
6347 isl_basic_map_free(part);
6349 result = isl_map_add_basic_map(result, part);
6362 /* Given two set A and B, construct its Cartesian product A x B.
6364 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6366 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6367 (struct isl_map *)set2);
6370 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6373 uint32_t hash = isl_hash_init();
6378 bset = isl_basic_set_copy(bset);
6379 bset = isl_basic_set_normalize(bset);
6382 total = isl_basic_set_total_dim(bset);
6383 isl_hash_byte(hash, bset->n_eq & 0xFF);
6384 for (i = 0; i < bset->n_eq; ++i) {
6386 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6387 isl_hash_hash(hash, c_hash);
6389 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6390 for (i = 0; i < bset->n_ineq; ++i) {
6392 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6393 isl_hash_hash(hash, c_hash);
6395 isl_hash_byte(hash, bset->n_div & 0xFF);
6396 for (i = 0; i < bset->n_div; ++i) {
6398 if (isl_int_is_zero(bset->div[i][0]))
6400 isl_hash_byte(hash, i & 0xFF);
6401 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6402 isl_hash_hash(hash, c_hash);
6404 isl_basic_set_free(bset);
6408 uint32_t isl_set_get_hash(struct isl_set *set)
6415 set = isl_set_copy(set);
6416 set = isl_set_normalize(set);
6420 hash = isl_hash_init();
6421 for (i = 0; i < set->n; ++i) {
6423 bset_hash = isl_basic_set_get_hash(set->p[i]);
6424 isl_hash_hash(hash, bset_hash);
6432 /* Check if the value for dimension dim is completely determined
6433 * by the values of the other parameters and variables.
6434 * That is, check if dimension dim is involved in an equality.
6436 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6443 nparam = isl_basic_set_n_param(bset);
6444 for (i = 0; i < bset->n_eq; ++i)
6445 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6450 /* Check if the value for dimension dim is completely determined
6451 * by the values of the other parameters and variables.
6452 * That is, check if dimension dim is involved in an equality
6453 * for each of the subsets.
6455 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6461 for (i = 0; i < set->n; ++i) {
6463 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6470 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6471 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6478 for (i = 0; i < map->n; ++i)
6479 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6485 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6486 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6493 for (i = 0; i < set->n; ++i)
6494 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6500 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6502 struct isl_dim *dim;
6507 if (bset->n_div == 0)
6510 bset = isl_basic_set_cow(bset);
6514 dim = isl_basic_set_get_dim(bset);
6515 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6518 isl_dim_free(bset->dim);
6522 bset = isl_basic_set_finalize(bset);
6526 isl_basic_set_free(bset);
6530 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6533 struct isl_dim *dim;
6536 set = isl_set_align_divs(set);
6540 if (set->n == 0 || set->p[0]->n_div == 0)
6543 set = isl_set_cow(set);
6547 n_div = set->p[0]->n_div;
6548 dim = isl_set_get_dim(set);
6549 dim = isl_dim_add(dim, isl_dim_set, n_div);
6552 isl_dim_free(set->dim);
6555 for (i = 0; i < set->n; ++i) {
6556 set->p[i] = isl_basic_set_lift(set->p[i]);
6567 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6569 struct isl_dim *dim;
6570 struct isl_basic_map *bmap;
6577 set = isl_set_align_divs(set);
6582 dim = isl_set_get_dim(set);
6583 if (set->n == 0 || set->p[0]->n_div == 0) {
6585 return isl_map_identity(dim);
6588 n_div = set->p[0]->n_div;
6589 dim = isl_dim_map(dim);
6590 n_param = isl_dim_size(dim, isl_dim_param);
6591 n_set = isl_dim_size(dim, isl_dim_in);
6592 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6593 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6594 for (i = 0; i < n_set; ++i)
6595 bmap = var_equal(bmap, i);
6597 total = n_param + n_set + n_set + n_div;
6598 for (i = 0; i < n_div; ++i) {
6599 k = isl_basic_map_alloc_inequality(bmap);
6602 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6603 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6604 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6605 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6606 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6607 set->p[0]->div[i][0]);
6609 l = isl_basic_map_alloc_inequality(bmap);
6612 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6613 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6614 set->p[0]->div[i][0]);
6615 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6619 return isl_map_from_basic_map(bmap);
6622 isl_basic_map_free(bmap);
6626 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6634 dim = isl_basic_set_total_dim(bset);
6635 size += bset->n_eq * (1 + dim);
6636 size += bset->n_ineq * (1 + dim);
6637 size += bset->n_div * (2 + dim);
6642 int isl_set_size(__isl_keep isl_set *set)
6650 for (i = 0; i < set->n; ++i)
6651 size += isl_basic_set_size(set->p[i]);
6656 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6657 enum isl_dim_type type, unsigned pos)
6665 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6667 pos += isl_basic_map_offset(bmap, type);
6669 for (i = 0; i < bmap->n_eq; ++i)
6670 if (!isl_int_is_zero(bmap->eq[i][pos]))
6674 for (i = 0; i < bmap->n_ineq; ++i) {
6675 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6682 return lower && upper;
6685 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6686 enum isl_dim_type type, unsigned pos)
6693 for (i = 0; i < map->n; ++i) {
6695 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6696 if (bounded < 0 || !bounded)
6703 /* Return 1 if the specified dim is involved in both an upper bound
6704 * and a lower bound.
6706 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6707 enum isl_dim_type type, unsigned pos)
6709 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6712 /* For each of the "n" variables starting at "first", determine
6713 * the sign of the variable and put the results in the first "n"
6714 * elements of the array "signs".
6716 * 1 means that the variable is non-negative
6717 * -1 means that the variable is non-positive
6718 * 0 means the variable attains both positive and negative values.
6720 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6721 unsigned first, unsigned n, int *signs)
6723 isl_vec *bound = NULL;
6724 struct isl_tab *tab = NULL;
6725 struct isl_tab_undo *snap;
6728 if (!bset || !signs)
6731 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6732 tab = isl_tab_from_basic_set(bset);
6736 isl_seq_clr(bound->el, bound->size);
6737 isl_int_set_si(bound->el[0], -1);
6739 snap = isl_tab_snap(tab);
6740 for (i = 0; i < n; ++i) {
6743 isl_int_set_si(bound->el[1 + first + i], -1);
6744 if (isl_tab_add_ineq(tab, bound->el) < 0)
6747 isl_int_set_si(bound->el[1 + first + i], 0);
6748 if (isl_tab_rollback(tab, snap) < 0)
6756 isl_int_set_si(bound->el[1 + first + i], 1);
6757 if (isl_tab_add_ineq(tab, bound->el) < 0)
6760 isl_int_set_si(bound->el[1 + first + i], 0);
6761 if (isl_tab_rollback(tab, snap) < 0)
6764 signs[i] = empty ? -1 : 0;
6768 isl_vec_free(bound);
6772 isl_vec_free(bound);
6776 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
6777 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
6779 if (!bset || !signs)
6781 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
6784 first += pos(bset->dim, type) - 1;
6785 return isl_basic_set_vars_get_sign(bset, first, n, signs);
6788 /* Check if the given map is single-valued.
6793 * and check if the result is a subset of the identity mapping.
6795 int isl_map_is_single_valued(__isl_keep isl_map *map)
6801 test = isl_map_reverse(isl_map_copy(map));
6802 test = isl_map_apply_range(test, isl_map_copy(map));
6804 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
6806 sv = isl_map_is_subset(test, id);
6814 int isl_set_is_singleton(__isl_keep isl_set *set)
6816 return isl_map_is_single_valued((isl_map *)set);
6819 int isl_map_is_translation(__isl_keep isl_map *map)
6824 delta = isl_map_deltas(isl_map_copy(map));
6825 ok = isl_set_is_singleton(delta);
6826 isl_set_free(delta);
6831 static int unique(isl_int *p, unsigned pos, unsigned len)
6833 if (isl_seq_first_non_zero(p, pos) != -1)
6835 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
6840 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
6849 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
6852 nvar = isl_basic_set_dim(bset, isl_dim_set);
6853 ovar = isl_dim_offset(bset->dim, isl_dim_set);
6854 for (j = 0; j < nvar; ++j) {
6855 int lower = 0, upper = 0;
6856 for (i = 0; i < bset->n_eq; ++i) {
6857 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
6859 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
6865 for (i = 0; i < bset->n_ineq; ++i) {
6866 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
6868 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
6870 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
6875 if (!lower || !upper)
6882 int isl_set_is_box(__isl_keep isl_set *set)
6889 return isl_basic_set_is_box(set->p[0]);