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 bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
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);
1781 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1782 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);
1897 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1898 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1899 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1902 isl_vec_free(sample);
1904 isl_vec_free(bmap1->sample);
1905 bmap1->sample = sample;
1908 bmap1 = isl_basic_map_simplify(bmap1);
1909 return isl_basic_map_finalize(bmap1);
1912 isl_vec_free(sample);
1913 isl_basic_map_free(bmap1);
1914 isl_basic_map_free(bmap2);
1918 struct isl_basic_set *isl_basic_set_intersect(
1919 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1921 return (struct isl_basic_set *)
1922 isl_basic_map_intersect(
1923 (struct isl_basic_map *)bset1,
1924 (struct isl_basic_map *)bset2);
1927 /* Special case of isl_map_intersect, where both map1 and map2
1928 * are convex, without any divs and such that either map1 or map2
1929 * contains a single constraint. This constraint is then simply
1930 * added to the other map.
1932 static __isl_give isl_map *map_intersect_add_constraint(
1933 __isl_take isl_map *map1, __isl_take isl_map *map2)
1935 struct isl_basic_map *bmap1;
1936 struct isl_basic_map *bmap2;
1938 isl_assert(map1->ctx, map1->n == 1, goto error);
1939 isl_assert(map2->ctx, map1->n == 1, goto error);
1940 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1941 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1943 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1944 return isl_map_intersect(map2, map1);
1946 isl_assert(map2->ctx,
1947 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
1949 map1 = isl_map_cow(map1);
1952 if (isl_map_fast_is_empty(map1)) {
1956 map1->p[0] = isl_basic_map_cow(map1->p[0]);
1957 if (map2->p[0]->n_eq == 1)
1958 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
1960 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
1961 map2->p[0]->ineq[0]);
1963 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
1964 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
1968 if (isl_basic_map_fast_is_empty(map1->p[0])) {
1969 isl_basic_map_free(map1->p[0]);
1982 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
1985 struct isl_map *result;
1991 if (isl_map_fast_is_empty(map1)) {
1995 if (isl_map_fast_is_empty(map2)) {
2000 if (map1->n == 1 && map2->n == 1 &&
2001 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2002 isl_dim_equal(map1->dim, map2->dim) &&
2003 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2004 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2005 return map_intersect_add_constraint(map1, map2);
2006 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2007 map2->dim, isl_dim_param), goto error);
2008 if (isl_dim_total(map1->dim) ==
2009 isl_dim_size(map1->dim, isl_dim_param) &&
2010 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2011 return isl_map_intersect(map2, map1);
2013 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2014 isl_assert(map1->ctx,
2015 isl_dim_equal(map1->dim, map2->dim), goto error);
2017 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2018 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2019 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2021 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2022 map1->n * map2->n, flags);
2025 for (i = 0; i < map1->n; ++i)
2026 for (j = 0; j < map2->n; ++j) {
2027 struct isl_basic_map *part;
2028 part = isl_basic_map_intersect(
2029 isl_basic_map_copy(map1->p[i]),
2030 isl_basic_map_copy(map2->p[j]));
2031 if (isl_basic_map_is_empty(part))
2032 isl_basic_map_free(part);
2034 result = isl_map_add_basic_map(result, part);
2047 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2049 return (struct isl_set *)
2050 isl_map_intersect((struct isl_map *)set1,
2051 (struct isl_map *)set2);
2054 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2056 struct isl_dim *dim;
2057 struct isl_basic_set *bset;
2062 bmap = isl_basic_map_cow(bmap);
2065 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2066 in = isl_basic_map_n_in(bmap);
2067 bset = isl_basic_set_from_basic_map(bmap);
2068 bset = isl_basic_set_swap_vars(bset, in);
2069 return isl_basic_map_from_basic_set(bset, dim);
2072 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2073 enum isl_dim_type type, unsigned pos, unsigned n)
2075 struct isl_dim *res_dim;
2076 struct isl_basic_map *res;
2077 struct isl_dim_map *dim_map;
2078 unsigned total, off;
2079 enum isl_dim_type t;
2087 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2089 total = isl_basic_map_total_dim(bmap) + n;
2090 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2092 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2094 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2096 unsigned size = isl_basic_map_dim(bmap, t);
2097 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2099 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2100 pos, size - pos, off + pos + n);
2102 off += isl_dim_size(res_dim, t);
2104 isl_dim_map_div(dim_map, bmap, off);
2106 res = isl_basic_map_alloc_dim(res_dim,
2107 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2108 res = add_constraints_dim_map(res, bmap, dim_map);
2109 res = isl_basic_map_simplify(res);
2110 return isl_basic_map_finalize(res);
2113 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2114 enum isl_dim_type type, unsigned n)
2118 return isl_basic_map_insert(bmap, type,
2119 isl_basic_map_dim(bmap, type), n);
2122 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2123 enum isl_dim_type type, unsigned n)
2127 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2128 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2130 isl_basic_set_free(bset);
2134 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2135 enum isl_dim_type type, unsigned pos, unsigned n)
2142 map = isl_map_cow(map);
2146 map->dim = isl_dim_insert(map->dim, type, pos, n);
2150 for (i = 0; i < map->n; ++i) {
2151 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2162 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2163 enum isl_dim_type type, unsigned n)
2167 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2170 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2171 enum isl_dim_type type, unsigned n)
2175 isl_assert(set->ctx, type != isl_dim_in, goto error);
2176 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2182 __isl_give isl_basic_map *isl_basic_map_move_dims(
2183 __isl_take isl_basic_map *bmap,
2184 enum isl_dim_type dst_type, unsigned dst_pos,
2185 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2188 struct isl_dim_map *dim_map;
2189 struct isl_basic_map *res;
2190 enum isl_dim_type t;
2191 unsigned total, off;
2198 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2201 if (dst_type == src_type && dst_pos == src_pos)
2204 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2206 if (pos(bmap->dim, dst_type) + dst_pos ==
2207 pos(bmap->dim, src_type) + src_pos +
2208 ((src_type < dst_type) ? n : 0)) {
2209 bmap = isl_basic_map_cow(bmap);
2213 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2214 src_type, src_pos, n);
2218 bmap = isl_basic_map_finalize(bmap);
2223 total = isl_basic_map_total_dim(bmap);
2224 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2227 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2228 unsigned size = isl_dim_size(bmap->dim, t);
2229 if (t == dst_type) {
2230 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2233 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2236 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2237 dst_pos, size - dst_pos, off);
2238 off += size - dst_pos;
2239 } else if (t == src_type) {
2240 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2243 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2244 src_pos + n, size - src_pos - n, off);
2245 off += size - src_pos - n;
2247 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2251 isl_dim_map_div(dim_map, bmap, off + n);
2253 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2254 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2255 bmap = add_constraints_dim_map(res, bmap, dim_map);
2257 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2258 src_type, src_pos, n);
2262 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2263 bmap = isl_basic_map_gauss(bmap, NULL);
2264 bmap = isl_basic_map_finalize(bmap);
2268 isl_basic_map_free(bmap);
2272 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2273 enum isl_dim_type dst_type, unsigned dst_pos,
2274 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2276 return (isl_basic_set *)isl_basic_map_move_dims(
2277 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2280 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2281 enum isl_dim_type dst_type, unsigned dst_pos,
2282 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2286 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2287 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2288 src_type, src_pos, n);
2294 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2295 enum isl_dim_type dst_type, unsigned dst_pos,
2296 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2305 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2308 if (dst_type == src_type && dst_pos == src_pos)
2311 isl_assert(map->ctx, dst_type != src_type, goto error);
2313 map = isl_map_cow(map);
2317 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2321 for (i = 0; i < map->n; ++i) {
2322 map->p[i] = isl_basic_map_move_dims(map->p[i],
2324 src_type, src_pos, n);
2335 /* Move the specified dimensions to the last columns right before
2336 * the divs. Don't change the dimension specification of bmap.
2337 * That's the responsibility of the caller.
2339 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2340 enum isl_dim_type type, unsigned first, unsigned n)
2342 struct isl_dim_map *dim_map;
2343 struct isl_basic_map *res;
2344 enum isl_dim_type t;
2345 unsigned total, off;
2349 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2352 total = isl_basic_map_total_dim(bmap);
2353 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2356 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2357 unsigned size = isl_dim_size(bmap->dim, t);
2359 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2362 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2363 first, n, total - bmap->n_div - n);
2364 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2365 first + n, size - (first + n), off);
2366 off += size - (first + n);
2368 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2372 isl_dim_map_div(dim_map, bmap, off + n);
2374 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2375 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2376 res = add_constraints_dim_map(res, bmap, dim_map);
2380 /* Turn the n dimensions of type type, starting at first
2381 * into existentially quantified variables.
2383 __isl_give isl_basic_map *isl_basic_map_project_out(
2384 __isl_take isl_basic_map *bmap,
2385 enum isl_dim_type type, unsigned first, unsigned n)
2398 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2399 return isl_basic_map_remove(bmap, type, first, n);
2401 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2404 bmap = move_last(bmap, type, first, n);
2405 bmap = isl_basic_map_cow(bmap);
2407 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2408 old = bmap->block2.data;
2409 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2410 (bmap->extra + n) * (1 + row_size));
2411 if (!bmap->block2.data)
2413 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2416 for (i = 0; i < n; ++i) {
2417 new_div[i] = bmap->block2.data +
2418 (bmap->extra + i) * (1 + row_size);
2419 isl_seq_clr(new_div[i], 1 + row_size);
2421 for (i = 0; i < bmap->extra; ++i)
2422 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2424 bmap->div = new_div;
2428 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2431 bmap = isl_basic_map_simplify(bmap);
2432 bmap = isl_basic_map_drop_redundant_divs(bmap);
2433 return isl_basic_map_finalize(bmap);
2435 isl_basic_map_free(bmap);
2439 /* Turn the n dimensions of type type, starting at first
2440 * into existentially quantified variables.
2442 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2443 enum isl_dim_type type, unsigned first, unsigned n)
2445 return (isl_basic_set *)isl_basic_map_project_out(
2446 (isl_basic_map *)bset, type, first, n);
2449 /* Turn the n dimensions of type type, starting at first
2450 * into existentially quantified variables.
2452 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2453 enum isl_dim_type type, unsigned first, unsigned n)
2463 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2465 map = isl_map_cow(map);
2469 map->dim = isl_dim_drop(map->dim, type, first, n);
2473 for (i = 0; i < map->n; ++i) {
2474 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2485 /* Turn the n dimensions of type type, starting at first
2486 * into existentially quantified variables.
2488 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2489 enum isl_dim_type type, unsigned first, unsigned n)
2491 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2494 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2498 for (i = 0; i < n; ++i) {
2499 j = isl_basic_map_alloc_div(bmap);
2502 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2506 isl_basic_map_free(bmap);
2510 struct isl_basic_map *isl_basic_map_apply_range(
2511 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2513 struct isl_dim *dim_result = NULL;
2514 struct isl_basic_map *bmap;
2515 unsigned n_in, n_out, n, nparam, total, pos;
2516 struct isl_dim_map *dim_map1, *dim_map2;
2518 if (!bmap1 || !bmap2)
2521 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2522 isl_dim_copy(bmap2->dim));
2524 n_in = isl_basic_map_n_in(bmap1);
2525 n_out = isl_basic_map_n_out(bmap2);
2526 n = isl_basic_map_n_out(bmap1);
2527 nparam = isl_basic_map_n_param(bmap1);
2529 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2530 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2531 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2532 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2533 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2534 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2535 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2536 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2537 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2538 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2539 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2541 bmap = isl_basic_map_alloc_dim(dim_result,
2542 bmap1->n_div + bmap2->n_div + n,
2543 bmap1->n_eq + bmap2->n_eq,
2544 bmap1->n_ineq + bmap2->n_ineq);
2545 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2546 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2547 bmap = add_divs(bmap, n);
2548 bmap = isl_basic_map_simplify(bmap);
2549 bmap = isl_basic_map_drop_redundant_divs(bmap);
2550 return isl_basic_map_finalize(bmap);
2552 isl_basic_map_free(bmap1);
2553 isl_basic_map_free(bmap2);
2557 struct isl_basic_set *isl_basic_set_apply(
2558 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2563 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2566 return (struct isl_basic_set *)
2567 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2569 isl_basic_set_free(bset);
2570 isl_basic_map_free(bmap);
2574 struct isl_basic_map *isl_basic_map_apply_domain(
2575 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2577 if (!bmap1 || !bmap2)
2580 isl_assert(bmap1->ctx,
2581 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2582 isl_assert(bmap1->ctx,
2583 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2586 bmap1 = isl_basic_map_reverse(bmap1);
2587 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2588 return isl_basic_map_reverse(bmap1);
2590 isl_basic_map_free(bmap1);
2591 isl_basic_map_free(bmap2);
2595 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2596 * A \cap B -> f(A) + f(B)
2598 struct isl_basic_map *isl_basic_map_sum(
2599 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2601 unsigned n_in, n_out, nparam, total, pos;
2602 struct isl_basic_map *bmap = NULL;
2603 struct isl_dim_map *dim_map1, *dim_map2;
2606 if (!bmap1 || !bmap2)
2609 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2612 nparam = isl_basic_map_n_param(bmap1);
2613 n_in = isl_basic_map_n_in(bmap1);
2614 n_out = isl_basic_map_n_out(bmap1);
2616 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2617 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2618 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2619 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2620 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2621 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2622 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2623 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2624 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2625 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2626 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2628 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2629 bmap1->n_div + bmap2->n_div + 2 * n_out,
2630 bmap1->n_eq + bmap2->n_eq + n_out,
2631 bmap1->n_ineq + bmap2->n_ineq);
2632 for (i = 0; i < n_out; ++i) {
2633 int j = isl_basic_map_alloc_equality(bmap);
2636 isl_seq_clr(bmap->eq[j], 1+total);
2637 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2638 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2639 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2641 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2642 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2643 bmap = add_divs(bmap, 2 * n_out);
2645 bmap = isl_basic_map_simplify(bmap);
2646 return isl_basic_map_finalize(bmap);
2648 isl_basic_map_free(bmap);
2649 isl_basic_map_free(bmap1);
2650 isl_basic_map_free(bmap2);
2654 /* Given two maps A -> f(A) and B -> g(B), construct a map
2655 * A \cap B -> f(A) + f(B)
2657 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2659 struct isl_map *result;
2665 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2667 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2668 map1->n * map2->n, 0);
2671 for (i = 0; i < map1->n; ++i)
2672 for (j = 0; j < map2->n; ++j) {
2673 struct isl_basic_map *part;
2674 part = isl_basic_map_sum(
2675 isl_basic_map_copy(map1->p[i]),
2676 isl_basic_map_copy(map2->p[j]));
2677 if (isl_basic_map_is_empty(part))
2678 isl_basic_map_free(part);
2680 result = isl_map_add_basic_map(result, part);
2693 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2694 __isl_take isl_set *set2)
2696 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2699 /* Given a basic map A -> f(A), construct A -> -f(A).
2701 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2706 bmap = isl_basic_map_cow(bmap);
2710 n = isl_basic_map_dim(bmap, isl_dim_out);
2711 off = isl_basic_map_offset(bmap, isl_dim_out);
2712 for (i = 0; i < bmap->n_eq; ++i)
2713 for (j = 0; j < n; ++j)
2714 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2715 for (i = 0; i < bmap->n_ineq; ++i)
2716 for (j = 0; j < n; ++j)
2717 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2718 for (i = 0; i < bmap->n_div; ++i)
2719 for (j = 0; j < n; ++j)
2720 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2721 return isl_basic_map_finalize(bmap);
2724 /* Given a map A -> f(A), construct A -> -f(A).
2726 struct isl_map *isl_map_neg(struct isl_map *map)
2730 map = isl_map_cow(map);
2734 for (i = 0; i < map->n; ++i) {
2735 map->p[i] = isl_basic_map_neg(map->p[i]);
2746 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2748 return (isl_set *)isl_map_neg((isl_map *)set);
2751 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2752 * A -> floor(f(A)/d).
2754 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2757 unsigned n_in, n_out, nparam, total, pos;
2758 struct isl_basic_map *result = NULL;
2759 struct isl_dim_map *dim_map;
2765 nparam = isl_basic_map_n_param(bmap);
2766 n_in = isl_basic_map_n_in(bmap);
2767 n_out = isl_basic_map_n_out(bmap);
2769 total = nparam + n_in + n_out + bmap->n_div + n_out;
2770 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2771 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2772 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2773 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2774 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2776 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2777 bmap->n_div + n_out,
2778 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2779 result = add_constraints_dim_map(result, bmap, dim_map);
2780 result = add_divs(result, n_out);
2781 for (i = 0; i < n_out; ++i) {
2783 j = isl_basic_map_alloc_inequality(result);
2786 isl_seq_clr(result->ineq[j], 1+total);
2787 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2788 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2789 j = isl_basic_map_alloc_inequality(result);
2792 isl_seq_clr(result->ineq[j], 1+total);
2793 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2794 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2795 isl_int_sub_ui(result->ineq[j][0], d, 1);
2798 result = isl_basic_map_simplify(result);
2799 return isl_basic_map_finalize(result);
2801 isl_basic_map_free(result);
2805 /* Given a map A -> f(A) and an integer d, construct a map
2806 * A -> floor(f(A)/d).
2808 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2812 map = isl_map_cow(map);
2816 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2817 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2818 for (i = 0; i < map->n; ++i) {
2819 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2830 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2836 i = isl_basic_map_alloc_equality(bmap);
2839 nparam = isl_basic_map_n_param(bmap);
2840 n_in = isl_basic_map_n_in(bmap);
2841 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2842 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2843 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2844 return isl_basic_map_finalize(bmap);
2846 isl_basic_map_free(bmap);
2850 /* Add a constraints to "bmap" expressing i_pos < o_pos
2852 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2858 i = isl_basic_map_alloc_inequality(bmap);
2861 nparam = isl_basic_map_n_param(bmap);
2862 n_in = isl_basic_map_n_in(bmap);
2863 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2864 isl_int_set_si(bmap->ineq[i][0], -1);
2865 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2866 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2867 return isl_basic_map_finalize(bmap);
2869 isl_basic_map_free(bmap);
2873 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2875 static __isl_give isl_basic_map *var_less_or_equal(
2876 __isl_take isl_basic_map *bmap, unsigned pos)
2882 i = isl_basic_map_alloc_inequality(bmap);
2885 nparam = isl_basic_map_n_param(bmap);
2886 n_in = isl_basic_map_n_in(bmap);
2887 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2888 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2889 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2890 return isl_basic_map_finalize(bmap);
2892 isl_basic_map_free(bmap);
2896 /* Add a constraints to "bmap" expressing i_pos > o_pos
2898 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2904 i = isl_basic_map_alloc_inequality(bmap);
2907 nparam = isl_basic_map_n_param(bmap);
2908 n_in = isl_basic_map_n_in(bmap);
2909 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2910 isl_int_set_si(bmap->ineq[i][0], -1);
2911 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2912 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2913 return isl_basic_map_finalize(bmap);
2915 isl_basic_map_free(bmap);
2919 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2921 static __isl_give isl_basic_map *var_more_or_equal(
2922 __isl_take isl_basic_map *bmap, unsigned pos)
2928 i = isl_basic_map_alloc_inequality(bmap);
2931 nparam = isl_basic_map_n_param(bmap);
2932 n_in = isl_basic_map_n_in(bmap);
2933 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2934 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2935 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2936 return isl_basic_map_finalize(bmap);
2938 isl_basic_map_free(bmap);
2942 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
2945 struct isl_basic_map *bmap;
2946 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
2949 for (i = 0; i < n_equal && bmap; ++i)
2950 bmap = var_equal(bmap, i);
2951 return isl_basic_map_finalize(bmap);
2954 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
2956 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
2959 struct isl_basic_map *bmap;
2960 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2963 for (i = 0; i < pos && bmap; ++i)
2964 bmap = var_equal(bmap, i);
2966 bmap = var_less(bmap, pos);
2967 return isl_basic_map_finalize(bmap);
2970 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
2972 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
2973 __isl_take isl_dim *dim, unsigned pos)
2976 isl_basic_map *bmap;
2978 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2979 for (i = 0; i < pos; ++i)
2980 bmap = var_equal(bmap, i);
2981 bmap = var_less_or_equal(bmap, pos);
2982 return isl_basic_map_finalize(bmap);
2985 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
2987 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
2990 struct isl_basic_map *bmap;
2991 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
2994 for (i = 0; i < pos && bmap; ++i)
2995 bmap = var_equal(bmap, i);
2997 bmap = var_more(bmap, pos);
2998 return isl_basic_map_finalize(bmap);
3001 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3003 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3004 __isl_take isl_dim *dim, unsigned pos)
3007 isl_basic_map *bmap;
3009 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3010 for (i = 0; i < pos; ++i)
3011 bmap = var_equal(bmap, i);
3012 bmap = var_more_or_equal(bmap, pos);
3013 return isl_basic_map_finalize(bmap);
3016 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3017 unsigned n, int equal)
3019 struct isl_map *map;
3022 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3024 for (i = 0; i + 1 < n; ++i)
3025 map = isl_map_add_basic_map(map,
3026 isl_basic_map_less_at(isl_dim_copy(dims), i));
3029 map = isl_map_add_basic_map(map,
3030 isl_basic_map_less_or_equal_at(dims, n - 1));
3032 map = isl_map_add_basic_map(map,
3033 isl_basic_map_less_at(dims, n - 1));
3040 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3044 return map_lex_lte_first(dims, dims->n_out, equal);
3047 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3049 return map_lex_lte_first(dim, n, 0);
3052 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3054 return map_lex_lte_first(dim, n, 1);
3057 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3059 return map_lex_lte(isl_dim_map(set_dim), 0);
3062 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3064 return map_lex_lte(isl_dim_map(set_dim), 1);
3067 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3068 unsigned n, int equal)
3070 struct isl_map *map;
3073 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3075 for (i = 0; i + 1 < n; ++i)
3076 map = isl_map_add_basic_map(map,
3077 isl_basic_map_more_at(isl_dim_copy(dims), i));
3080 map = isl_map_add_basic_map(map,
3081 isl_basic_map_more_or_equal_at(dims, n - 1));
3083 map = isl_map_add_basic_map(map,
3084 isl_basic_map_more_at(dims, n - 1));
3091 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3095 return map_lex_gte_first(dims, dims->n_out, equal);
3098 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3100 return map_lex_gte_first(dim, n, 0);
3103 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3105 return map_lex_gte_first(dim, n, 1);
3108 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3110 return map_lex_gte(isl_dim_map(set_dim), 0);
3113 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3115 return map_lex_gte(isl_dim_map(set_dim), 1);
3118 struct isl_basic_map *isl_basic_map_from_basic_set(
3119 struct isl_basic_set *bset, struct isl_dim *dim)
3121 struct isl_basic_map *bmap;
3123 bset = isl_basic_set_cow(bset);
3127 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3128 isl_dim_free(bset->dim);
3129 bmap = (struct isl_basic_map *) bset;
3131 return isl_basic_map_finalize(bmap);
3133 isl_basic_set_free(bset);
3138 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3142 if (bmap->dim->n_in == 0)
3143 return (struct isl_basic_set *)bmap;
3144 bmap = isl_basic_map_cow(bmap);
3147 bmap->dim = isl_dim_cow(bmap->dim);
3150 bmap->dim->n_out += bmap->dim->n_in;
3151 bmap->dim->n_in = 0;
3152 bmap = isl_basic_map_finalize(bmap);
3153 return (struct isl_basic_set *)bmap;
3155 isl_basic_map_free(bmap);
3159 /* For a div d = floor(f/m), add the constraints
3162 * -(f-(n-1)) + m d >= 0
3164 * Note that the second constraint is the negation of
3168 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3169 unsigned pos, isl_int *div)
3172 unsigned total = isl_basic_map_total_dim(bmap);
3174 i = isl_basic_map_alloc_inequality(bmap);
3177 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3178 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3180 j = isl_basic_map_alloc_inequality(bmap);
3183 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3184 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3185 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3189 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3190 unsigned pos, isl_int *div)
3192 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3196 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3198 unsigned total = isl_basic_map_total_dim(bmap);
3199 unsigned div_pos = total - bmap->n_div + div;
3201 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3205 struct isl_basic_set *isl_basic_map_underlying_set(
3206 struct isl_basic_map *bmap)
3210 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 && bmap->n_div == 0)
3211 return (struct isl_basic_set *)bmap;
3212 bmap = isl_basic_map_cow(bmap);
3215 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3218 bmap->extra -= bmap->n_div;
3220 bmap = isl_basic_map_finalize(bmap);
3221 return (struct isl_basic_set *)bmap;
3226 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3227 __isl_take isl_basic_set *bset)
3229 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3232 struct isl_basic_map *isl_basic_map_overlying_set(
3233 struct isl_basic_set *bset, struct isl_basic_map *like)
3235 struct isl_basic_map *bmap;
3236 struct isl_ctx *ctx;
3243 isl_assert(ctx, bset->n_div == 0, goto error);
3244 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3245 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3247 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3248 isl_basic_map_free(like);
3249 return (struct isl_basic_map *)bset;
3251 bset = isl_basic_set_cow(bset);
3254 total = bset->dim->n_out + bset->extra;
3255 bmap = (struct isl_basic_map *)bset;
3256 isl_dim_free(bmap->dim);
3257 bmap->dim = isl_dim_copy(like->dim);
3260 bmap->n_div = like->n_div;
3261 bmap->extra += like->n_div;
3264 ltotal = total - bmap->extra + like->extra;
3267 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3268 bmap->extra * (1 + 1 + total));
3269 if (isl_blk_is_error(bmap->block2))
3271 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3275 for (i = 0; i < bmap->extra; ++i)
3276 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3277 for (i = 0; i < like->n_div; ++i) {
3278 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3279 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3281 bmap = isl_basic_map_extend_constraints(bmap,
3282 0, 2 * like->n_div);
3283 for (i = 0; i < like->n_div; ++i) {
3284 if (isl_int_is_zero(bmap->div[i][0]))
3286 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3290 isl_basic_map_free(like);
3291 bmap = isl_basic_map_simplify(bmap);
3292 bmap = isl_basic_map_finalize(bmap);
3295 isl_basic_map_free(like);
3296 isl_basic_set_free(bset);
3300 struct isl_basic_set *isl_basic_set_from_underlying_set(
3301 struct isl_basic_set *bset, struct isl_basic_set *like)
3303 return (struct isl_basic_set *)
3304 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3307 struct isl_set *isl_set_from_underlying_set(
3308 struct isl_set *set, struct isl_basic_set *like)
3314 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3316 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3317 isl_basic_set_free(like);
3320 set = isl_set_cow(set);
3323 for (i = 0; i < set->n; ++i) {
3324 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3325 isl_basic_set_copy(like));
3329 isl_dim_free(set->dim);
3330 set->dim = isl_dim_copy(like->dim);
3333 isl_basic_set_free(like);
3336 isl_basic_set_free(like);
3341 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3345 map = isl_map_cow(map);
3348 map->dim = isl_dim_cow(map->dim);
3352 for (i = 1; i < map->n; ++i)
3353 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3355 for (i = 0; i < map->n; ++i) {
3356 map->p[i] = (struct isl_basic_map *)
3357 isl_basic_map_underlying_set(map->p[i]);
3362 map->dim = isl_dim_underlying(map->dim, 0);
3364 isl_dim_free(map->dim);
3365 map->dim = isl_dim_copy(map->p[0]->dim);
3369 return (struct isl_set *)map;
3375 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3377 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3380 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3382 struct isl_basic_set *domain;
3387 n_in = isl_basic_map_n_in(bmap);
3388 n_out = isl_basic_map_n_out(bmap);
3389 domain = isl_basic_set_from_basic_map(bmap);
3390 return isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3393 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3395 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3398 struct isl_set *isl_map_range(struct isl_map *map)
3401 struct isl_set *set;
3405 if (isl_map_dim(map, isl_dim_in) == 0)
3406 return (isl_set *)map;
3408 map = isl_map_cow(map);
3412 set = (struct isl_set *) map;
3413 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3416 for (i = 0; i < map->n; ++i) {
3417 set->p[i] = isl_basic_map_range(map->p[i]);
3421 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3422 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3429 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3432 struct isl_map *map = NULL;
3434 set = isl_set_cow(set);
3437 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3438 map = (struct isl_map *)set;
3439 for (i = 0; i < set->n; ++i) {
3440 map->p[i] = isl_basic_map_from_basic_set(
3441 set->p[i], isl_dim_copy(dim));
3445 isl_dim_free(map->dim);
3454 struct isl_map *isl_map_from_range(struct isl_set *set)
3456 return (struct isl_map *)set;
3459 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3461 return isl_map_reverse(isl_map_from_range(set));;
3464 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3465 __isl_take isl_set *range)
3467 return isl_map_product(isl_map_from_domain(domain),
3468 isl_map_from_range(range));
3471 struct isl_set *isl_set_from_map(struct isl_map *map)
3474 struct isl_set *set = NULL;
3478 map = isl_map_cow(map);
3481 map->dim = isl_dim_cow(map->dim);
3484 map->dim->n_out += map->dim->n_in;
3486 set = (struct isl_set *)map;
3487 for (i = 0; i < map->n; ++i) {
3488 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3498 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3500 struct isl_map *map;
3504 isl_assert(dim->ctx, n >= 0, return NULL);
3505 map = isl_alloc(dim->ctx, struct isl_map,
3506 sizeof(struct isl_map) +
3507 (n - 1) * sizeof(struct isl_basic_map *));
3511 map->ctx = dim->ctx;
3512 isl_ctx_ref(map->ctx);
3524 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3525 unsigned nparam, unsigned in, unsigned out, int n,
3528 struct isl_map *map;
3529 struct isl_dim *dims;
3531 dims = isl_dim_alloc(ctx, nparam, in, out);
3535 map = isl_map_alloc_dim(dims, n, flags);
3539 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3541 struct isl_basic_map *bmap;
3542 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3543 bmap = isl_basic_map_set_to_empty(bmap);
3547 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3549 struct isl_basic_set *bset;
3550 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3551 bset = isl_basic_set_set_to_empty(bset);
3555 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3557 struct isl_basic_map *bmap;
3560 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3561 bmap = isl_basic_map_set_to_empty(bmap);
3565 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3567 struct isl_basic_map *bmap;
3570 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3571 bmap = isl_basic_map_set_to_empty(bmap);
3575 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3577 struct isl_basic_set *bset;
3580 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3581 bset = isl_basic_set_set_to_empty(bset);
3585 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3587 struct isl_basic_map *bmap;
3588 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3592 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3594 struct isl_basic_set *bset;
3595 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3599 __isl_give isl_basic_map *isl_basic_map_universe_like(
3600 __isl_keep isl_basic_map *model)
3604 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3607 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3611 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3614 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3615 __isl_keep isl_set *model)
3619 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3622 struct isl_map *isl_map_empty(struct isl_dim *dim)
3624 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3627 struct isl_map *isl_map_empty_like(struct isl_map *model)
3631 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3634 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3638 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3641 struct isl_set *isl_set_empty(struct isl_dim *dim)
3643 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3646 struct isl_set *isl_set_empty_like(struct isl_set *model)
3650 return isl_set_empty(isl_dim_copy(model->dim));
3653 struct isl_map *isl_map_universe(struct isl_dim *dim)
3655 struct isl_map *map;
3658 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3659 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3663 struct isl_set *isl_set_universe(struct isl_dim *dim)
3665 struct isl_set *set;
3668 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3669 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3673 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3677 return isl_set_universe(isl_dim_copy(model->dim));
3680 struct isl_map *isl_map_dup(struct isl_map *map)
3683 struct isl_map *dup;
3687 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3688 for (i = 0; i < map->n; ++i)
3689 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3693 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3694 __isl_take isl_basic_map *bmap)
3698 if (isl_basic_map_fast_is_empty(bmap)) {
3699 isl_basic_map_free(bmap);
3702 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3703 isl_assert(map->ctx, map->n < map->size, goto error);
3704 map->p[map->n] = bmap;
3706 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3712 isl_basic_map_free(bmap);
3716 void isl_map_free(struct isl_map *map)
3726 isl_ctx_deref(map->ctx);
3727 for (i = 0; i < map->n; ++i)
3728 isl_basic_map_free(map->p[i]);
3729 isl_dim_free(map->dim);
3733 struct isl_map *isl_map_extend(struct isl_map *base,
3734 unsigned nparam, unsigned n_in, unsigned n_out)
3738 base = isl_map_cow(base);
3742 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3745 for (i = 0; i < base->n; ++i) {
3746 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3747 isl_dim_copy(base->dim), 0, 0, 0);
3757 struct isl_set *isl_set_extend(struct isl_set *base,
3758 unsigned nparam, unsigned dim)
3760 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3764 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3765 struct isl_basic_map *bmap, unsigned pos, int value)
3769 bmap = isl_basic_map_cow(bmap);
3770 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3771 j = isl_basic_map_alloc_equality(bmap);
3774 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3775 isl_int_set_si(bmap->eq[j][pos], -1);
3776 isl_int_set_si(bmap->eq[j][0], value);
3777 bmap = isl_basic_map_simplify(bmap);
3778 return isl_basic_map_finalize(bmap);
3780 isl_basic_map_free(bmap);
3784 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3785 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3789 bmap = isl_basic_map_cow(bmap);
3790 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3791 j = isl_basic_map_alloc_equality(bmap);
3794 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3795 isl_int_set_si(bmap->eq[j][pos], -1);
3796 isl_int_set(bmap->eq[j][0], value);
3797 bmap = isl_basic_map_simplify(bmap);
3798 return isl_basic_map_finalize(bmap);
3800 isl_basic_map_free(bmap);
3804 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3805 enum isl_dim_type type, unsigned pos, int value)
3809 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3810 return isl_basic_map_fix_pos_si(bmap,
3811 isl_basic_map_offset(bmap, type) + pos, value);
3813 isl_basic_map_free(bmap);
3817 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3818 enum isl_dim_type type, unsigned pos, isl_int value)
3822 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3823 return isl_basic_map_fix_pos(bmap,
3824 isl_basic_map_offset(bmap, type) + pos, value);
3826 isl_basic_map_free(bmap);
3830 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3831 enum isl_dim_type type, unsigned pos, int value)
3833 return (struct isl_basic_set *)
3834 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3838 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3839 enum isl_dim_type type, unsigned pos, isl_int value)
3841 return (struct isl_basic_set *)
3842 isl_basic_map_fix((struct isl_basic_map *)bset,
3846 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3847 unsigned input, int value)
3849 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3852 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3853 unsigned dim, int value)
3855 return (struct isl_basic_set *)
3856 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3857 isl_dim_set, dim, value);
3860 struct isl_map *isl_map_fix_si(struct isl_map *map,
3861 enum isl_dim_type type, unsigned pos, int value)
3865 map = isl_map_cow(map);
3869 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3870 for (i = 0; i < map->n; ++i) {
3871 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3875 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3882 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
3883 enum isl_dim_type type, unsigned pos, int value)
3885 return (struct isl_set *)
3886 isl_map_fix_si((struct isl_map *)set, type, pos, value);
3889 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
3890 enum isl_dim_type type, unsigned pos, isl_int value)
3894 map = isl_map_cow(map);
3898 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3899 for (i = 0; i < map->n; ++i) {
3900 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
3904 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3911 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
3912 enum isl_dim_type type, unsigned pos, isl_int value)
3914 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
3917 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
3918 unsigned input, int value)
3920 return isl_map_fix_si(map, isl_dim_in, input, value);
3923 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
3925 return (struct isl_set *)
3926 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
3929 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
3930 __isl_take isl_basic_map *bmap,
3931 enum isl_dim_type type, unsigned pos, int value)
3937 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3938 pos += isl_basic_map_offset(bmap, type);
3939 bmap = isl_basic_map_cow(bmap);
3940 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
3941 j = isl_basic_map_alloc_inequality(bmap);
3944 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
3945 isl_int_set_si(bmap->ineq[j][pos], 1);
3946 isl_int_set_si(bmap->ineq[j][0], -value);
3947 bmap = isl_basic_map_simplify(bmap);
3948 return isl_basic_map_finalize(bmap);
3950 isl_basic_map_free(bmap);
3954 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
3955 unsigned dim, isl_int value)
3959 bset = isl_basic_set_cow(bset);
3960 bset = isl_basic_set_extend_constraints(bset, 0, 1);
3961 j = isl_basic_set_alloc_inequality(bset);
3964 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
3965 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
3966 isl_int_neg(bset->ineq[j][0], value);
3967 bset = isl_basic_set_simplify(bset);
3968 return isl_basic_set_finalize(bset);
3970 isl_basic_set_free(bset);
3974 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
3975 enum isl_dim_type type, unsigned pos, int value)
3979 map = isl_map_cow(map);
3983 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3984 for (i = 0; i < map->n; ++i) {
3985 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
3990 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3997 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
3998 enum isl_dim_type type, unsigned pos, int value)
4000 return (struct isl_set *)
4001 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4004 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4009 set = isl_set_cow(set);
4013 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4014 for (i = 0; i < set->n; ++i) {
4015 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4025 struct isl_map *isl_map_reverse(struct isl_map *map)
4029 map = isl_map_cow(map);
4033 map->dim = isl_dim_reverse(map->dim);
4036 for (i = 0; i < map->n; ++i) {
4037 map->p[i] = isl_basic_map_reverse(map->p[i]);
4041 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4048 static struct isl_map *isl_basic_map_partial_lexopt(
4049 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4050 struct isl_set **empty, int max)
4054 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4055 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4057 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4059 isl_basic_map_free(bmap);
4060 isl_basic_set_free(dom);
4066 struct isl_map *isl_basic_map_partial_lexmax(
4067 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4068 struct isl_set **empty)
4070 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4073 struct isl_map *isl_basic_map_partial_lexmin(
4074 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4075 struct isl_set **empty)
4077 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4080 struct isl_set *isl_basic_set_partial_lexmin(
4081 struct isl_basic_set *bset, struct isl_basic_set *dom,
4082 struct isl_set **empty)
4084 return (struct isl_set *)
4085 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4089 struct isl_set *isl_basic_set_partial_lexmax(
4090 struct isl_basic_set *bset, struct isl_basic_set *dom,
4091 struct isl_set **empty)
4093 return (struct isl_set *)
4094 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4098 /* Given a basic map "bmap", compute the lexicograhically minimal
4099 * (or maximal) image element for each domain element in dom.
4100 * Set *empty to those elements in dom that do not have an image element.
4102 * We first make sure the basic sets in dom are disjoint and then
4103 * simply collect the results over each of the basic sets separately.
4104 * We could probably improve the efficiency a bit by moving the union
4105 * domain down into the parametric integer programming.
4107 static __isl_give isl_map *basic_map_partial_lexopt(
4108 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4109 __isl_give isl_set **empty, int max)
4112 struct isl_map *res;
4114 dom = isl_set_make_disjoint(dom);
4118 if (isl_set_fast_is_empty(dom)) {
4119 res = isl_map_empty_like_basic_map(bmap);
4120 *empty = isl_set_empty_like(dom);
4122 isl_basic_map_free(bmap);
4126 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4127 isl_basic_set_copy(dom->p[0]), empty, max);
4129 for (i = 1; i < dom->n; ++i) {
4130 struct isl_map *res_i;
4131 struct isl_set *empty_i;
4133 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4134 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4136 res = isl_map_union_disjoint(res, res_i);
4137 *empty = isl_set_union_disjoint(*empty, empty_i);
4141 isl_basic_map_free(bmap);
4146 isl_basic_map_free(bmap);
4150 /* Given a map "map", compute the lexicograhically minimal
4151 * (or maximal) image element for each domain element in dom.
4152 * Set *empty to those elements in dom that do not have an image element.
4154 * We first compute the lexicographically minimal or maximal element
4155 * in the first basic map. This results in a partial solution "res"
4156 * and a subset "todo" of dom that still need to be handled.
4157 * We then consider each of the remaining maps in "map" and successively
4158 * improve both "res" and "todo".
4160 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4161 * Assume we are computing the lexicographical maximum.
4162 * We first intersect basic map i with a relation that maps elements
4163 * to elements that are lexicographically larger than the image elements
4164 * in res^k and the compute the maximum image element of this intersection.
4165 * The result ("better") corresponds to those image elements in basic map i
4166 * that are better than what we had before. The remainder ("keep") are the
4167 * domain elements for which the image element in res_k was better.
4168 * We also compute the lexicographical maximum of basic map i in todo^k.
4169 * res^i is the result of the operation + better + those elements in
4170 * res^k that we should keep
4171 * todo^i is the remainder of the maximum operation on todo^k.
4173 static __isl_give isl_map *isl_map_partial_lexopt(
4174 __isl_take isl_map *map, __isl_take isl_set *dom,
4175 __isl_give isl_set **empty, int max)
4178 struct isl_map *res;
4179 struct isl_set *todo;
4184 if (isl_map_fast_is_empty(map)) {
4192 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4193 isl_set_copy(dom), &todo, max);
4195 for (i = 1; i < map->n; ++i) {
4197 struct isl_map *better;
4198 struct isl_set *keep;
4199 struct isl_map *res_i;
4200 struct isl_set *todo_i;
4201 struct isl_dim *dim = isl_map_get_dim(res);
4203 dim = isl_dim_range(dim);
4205 lt = isl_map_lex_lt(dim);
4207 lt = isl_map_lex_gt(dim);
4208 lt = isl_map_apply_range(isl_map_copy(res), lt);
4209 lt = isl_map_intersect(lt,
4210 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4211 better = isl_map_partial_lexopt(lt,
4212 isl_map_domain(isl_map_copy(res)),
4215 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4216 todo, &todo_i, max);
4218 res = isl_map_intersect_domain(res, keep);
4219 res = isl_map_union_disjoint(res, res_i);
4220 res = isl_map_union_disjoint(res, better);
4241 __isl_give isl_map *isl_map_partial_lexmax(
4242 __isl_take isl_map *map, __isl_take isl_set *dom,
4243 __isl_give isl_set **empty)
4245 return isl_map_partial_lexopt(map, dom, empty, 1);
4248 __isl_give isl_map *isl_map_partial_lexmin(
4249 __isl_take isl_map *map, __isl_take isl_set *dom,
4250 __isl_give isl_set **empty)
4252 return isl_map_partial_lexopt(map, dom, empty, 0);
4255 __isl_give isl_set *isl_set_partial_lexmin(
4256 __isl_take isl_set *set, __isl_take isl_set *dom,
4257 __isl_give isl_set **empty)
4259 return (struct isl_set *)
4260 isl_map_partial_lexmin((struct isl_map *)set,
4264 __isl_give isl_set *isl_set_partial_lexmax(
4265 __isl_take isl_set *set, __isl_take isl_set *dom,
4266 __isl_give isl_set **empty)
4268 return (struct isl_set *)
4269 isl_map_partial_lexmax((struct isl_map *)set,
4273 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4275 struct isl_basic_set *dom = NULL;
4276 struct isl_dim *dom_dim;
4280 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4281 dom = isl_basic_set_universe(dom_dim);
4282 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4284 isl_basic_map_free(bmap);
4288 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4290 return isl_basic_map_lexopt(bmap, 0);
4293 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4295 return isl_basic_map_lexopt(bmap, 1);
4298 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4300 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4303 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4305 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4308 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4310 struct isl_set *dom = NULL;
4311 struct isl_dim *dom_dim;
4315 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4316 dom = isl_set_universe(dom_dim);
4317 return isl_map_partial_lexopt(map, dom, NULL, max);
4323 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4325 return isl_map_lexopt(map, 0);
4328 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4330 return isl_map_lexopt(map, 1);
4333 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4335 return (isl_set *)isl_map_lexmin((isl_map *)set);
4338 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4340 return (isl_set *)isl_map_lexmax((isl_map *)set);
4343 static struct isl_map *isl_map_reset_dim(struct isl_map *map,
4344 struct isl_dim *dim)
4351 for (i = 0; i < map->n; ++i) {
4352 isl_dim_free(map->p[i]->dim);
4353 map->p[i]->dim = isl_dim_copy(dim);
4355 isl_dim_free(map->dim);
4365 static struct isl_set *isl_set_reset_dim(struct isl_set *set,
4366 struct isl_dim *dim)
4368 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
4371 /* Apply a preimage specified by "mat" on the parameters of "bset".
4372 * bset is assumed to have only parameters and divs.
4374 static struct isl_basic_set *basic_set_parameter_preimage(
4375 struct isl_basic_set *bset, struct isl_mat *mat)
4382 bset->dim = isl_dim_cow(bset->dim);
4386 nparam = isl_basic_set_dim(bset, isl_dim_param);
4388 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4390 bset->dim->nparam = 0;
4391 bset->dim->n_out = nparam;
4392 bset = isl_basic_set_preimage(bset, mat);
4394 bset->dim->nparam = bset->dim->n_out;
4395 bset->dim->n_out = 0;
4400 isl_basic_set_free(bset);
4404 /* Apply a preimage specified by "mat" on the parameters of "set".
4405 * set is assumed to have only parameters and divs.
4407 static struct isl_set *set_parameter_preimage(
4408 struct isl_set *set, struct isl_mat *mat)
4410 struct isl_dim *dim = NULL;
4416 dim = isl_dim_copy(set->dim);
4417 dim = isl_dim_cow(dim);
4421 nparam = isl_set_dim(set, isl_dim_param);
4423 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4426 dim->n_out = nparam;
4427 isl_set_reset_dim(set, dim);
4428 set = isl_set_preimage(set, mat);
4431 dim = isl_dim_copy(set->dim);
4432 dim = isl_dim_cow(dim);
4435 dim->nparam = dim->n_out;
4437 isl_set_reset_dim(set, dim);
4447 /* Intersect the basic set "bset" with the affine space specified by the
4448 * equalities in "eq".
4450 static struct isl_basic_set *basic_set_append_equalities(
4451 struct isl_basic_set *bset, struct isl_mat *eq)
4459 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4464 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4465 for (i = 0; i < eq->n_row; ++i) {
4466 k = isl_basic_set_alloc_equality(bset);
4469 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4470 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4474 bset = isl_basic_set_gauss(bset, NULL);
4475 bset = isl_basic_set_finalize(bset);
4480 isl_basic_set_free(bset);
4484 /* Intersect the set "set" with the affine space specified by the
4485 * equalities in "eq".
4487 static struct isl_set *set_append_equalities(struct isl_set *set,
4495 for (i = 0; i < set->n; ++i) {
4496 set->p[i] = basic_set_append_equalities(set->p[i],
4509 /* Project the given basic set onto its parameter domain, possibly introducing
4510 * new, explicit, existential variables in the constraints.
4511 * The input has parameters and (possibly implicit) existential variables.
4512 * The output has the same parameters, but only
4513 * explicit existentially quantified variables.
4515 * The actual projection is performed by pip, but pip doesn't seem
4516 * to like equalities very much, so we first remove the equalities
4517 * among the parameters by performing a variable compression on
4518 * the parameters. Afterward, an inverse transformation is performed
4519 * and the equalities among the parameters are inserted back in.
4521 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4525 struct isl_mat *T, *T2;
4526 struct isl_set *set;
4527 unsigned nparam, n_div;
4529 bset = isl_basic_set_cow(bset);
4533 if (bset->n_eq == 0)
4534 return isl_basic_set_lexmin(bset);
4536 isl_basic_set_gauss(bset, NULL);
4538 nparam = isl_basic_set_dim(bset, isl_dim_param);
4539 n_div = isl_basic_set_dim(bset, isl_dim_div);
4541 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4542 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4545 if (i == bset->n_eq)
4546 return isl_basic_set_lexmin(bset);
4548 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4550 eq = isl_mat_cow(eq);
4551 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4552 if (T && T->n_col == 0) {
4556 bset = isl_basic_set_set_to_empty(bset);
4557 return isl_set_from_basic_set(bset);
4559 bset = basic_set_parameter_preimage(bset, T);
4561 set = isl_basic_set_lexmin(bset);
4562 set = set_parameter_preimage(set, T2);
4563 set = set_append_equalities(set, eq);
4567 /* Compute an explicit representation for all the existentially
4568 * quantified variables.
4569 * The input and output dimensions are first turned into parameters.
4570 * compute_divs then returns a map with the same parameters and
4571 * no input or output dimensions and the dimension specification
4572 * is reset to that of the input.
4574 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4576 struct isl_basic_set *bset;
4577 struct isl_set *set;
4578 struct isl_map *map;
4579 struct isl_dim *dim, *orig_dim = NULL;
4584 bmap = isl_basic_map_cow(bmap);
4588 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4589 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4590 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4591 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4595 orig_dim = bmap->dim;
4597 bset = (struct isl_basic_set *)bmap;
4599 set = parameter_compute_divs(bset);
4600 map = (struct isl_map *)set;
4601 map = isl_map_reset_dim(map, orig_dim);
4605 isl_basic_map_free(bmap);
4609 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4617 off = isl_dim_total(bmap->dim);
4618 for (i = 0; i < bmap->n_div; ++i) {
4619 if (isl_int_is_zero(bmap->div[i][0]))
4621 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4627 static int map_divs_known(__isl_keep isl_map *map)
4634 for (i = 0; i < map->n; ++i) {
4635 int known = basic_map_divs_known(map->p[i]);
4643 /* If bmap contains any unknown divs, then compute explicit
4644 * expressions for them. However, this computation may be
4645 * quite expensive, so first try to remove divs that aren't
4648 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4652 struct isl_map *map;
4654 known = basic_map_divs_known(bmap);
4658 return isl_map_from_basic_map(bmap);
4660 bmap = isl_basic_map_drop_redundant_divs(bmap);
4662 known = basic_map_divs_known(bmap);
4666 return isl_map_from_basic_map(bmap);
4668 map = compute_divs(bmap);
4671 isl_basic_map_free(bmap);
4675 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4679 struct isl_map *res;
4686 known = map_divs_known(map);
4694 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4695 for (i = 1 ; i < map->n; ++i) {
4697 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4698 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4699 res = isl_map_union_disjoint(res, r2);
4701 res = isl_map_union(res, r2);
4708 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4710 return (struct isl_set *)
4711 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4714 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4716 return (struct isl_set *)
4717 isl_map_compute_divs((struct isl_map *)set);
4720 struct isl_set *isl_map_domain(struct isl_map *map)
4723 struct isl_set *set;
4728 map = isl_map_cow(map);
4732 set = (struct isl_set *)map;
4733 set->dim = isl_dim_domain(set->dim);
4736 for (i = 0; i < map->n; ++i) {
4737 set->p[i] = isl_basic_map_domain(map->p[i]);
4741 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4742 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4749 struct isl_map *isl_map_union_disjoint(
4750 struct isl_map *map1, struct isl_map *map2)
4754 struct isl_map *map = NULL;
4768 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4770 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4771 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4772 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4774 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4775 map1->n + map2->n, flags);
4778 for (i = 0; i < map1->n; ++i) {
4779 map = isl_map_add_basic_map(map,
4780 isl_basic_map_copy(map1->p[i]));
4784 for (i = 0; i < map2->n; ++i) {
4785 map = isl_map_add_basic_map(map,
4786 isl_basic_map_copy(map2->p[i]));
4800 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4802 map1 = isl_map_union_disjoint(map1, map2);
4806 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4810 struct isl_set *isl_set_union_disjoint(
4811 struct isl_set *set1, struct isl_set *set2)
4813 return (struct isl_set *)
4814 isl_map_union_disjoint(
4815 (struct isl_map *)set1, (struct isl_map *)set2);
4818 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4820 return (struct isl_set *)
4821 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4824 struct isl_map *isl_map_intersect_range(
4825 struct isl_map *map, struct isl_set *set)
4828 struct isl_map *result;
4834 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4835 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4836 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4838 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4839 map->n * set->n, flags);
4842 for (i = 0; i < map->n; ++i)
4843 for (j = 0; j < set->n; ++j) {
4844 result = isl_map_add_basic_map(result,
4845 isl_basic_map_intersect_range(
4846 isl_basic_map_copy(map->p[i]),
4847 isl_basic_set_copy(set->p[j])));
4860 struct isl_map *isl_map_intersect_domain(
4861 struct isl_map *map, struct isl_set *set)
4863 return isl_map_reverse(
4864 isl_map_intersect_range(isl_map_reverse(map), set));
4867 struct isl_map *isl_map_apply_domain(
4868 struct isl_map *map1, struct isl_map *map2)
4872 map1 = isl_map_reverse(map1);
4873 map1 = isl_map_apply_range(map1, map2);
4874 return isl_map_reverse(map1);
4881 struct isl_map *isl_map_apply_range(
4882 struct isl_map *map1, struct isl_map *map2)
4884 struct isl_dim *dim_result;
4885 struct isl_map *result;
4891 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4892 isl_dim_copy(map2->dim));
4894 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4897 for (i = 0; i < map1->n; ++i)
4898 for (j = 0; j < map2->n; ++j) {
4899 result = isl_map_add_basic_map(result,
4900 isl_basic_map_apply_range(
4901 isl_basic_map_copy(map1->p[i]),
4902 isl_basic_map_copy(map2->p[j])));
4908 if (result && result->n <= 1)
4909 ISL_F_SET(result, ISL_MAP_DISJOINT);
4918 * returns range - domain
4920 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
4923 struct isl_basic_set *bset;
4930 dim = isl_basic_map_n_in(bmap);
4931 nparam = isl_basic_map_n_param(bmap);
4932 isl_assert(bmap->ctx, dim == isl_basic_map_n_out(bmap), goto error);
4933 bset = isl_basic_set_from_basic_map(bmap);
4934 bset = isl_basic_set_cow(bset);
4935 dims = isl_basic_set_get_dim(bset);
4936 dims = isl_dim_add(dims, isl_dim_set, dim);
4937 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
4938 bset = isl_basic_set_swap_vars(bset, 2*dim);
4939 for (i = 0; i < dim; ++i) {
4940 int j = isl_basic_map_alloc_equality(
4941 (struct isl_basic_map *)bset);
4944 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
4945 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
4946 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
4947 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
4949 return isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
4951 isl_basic_map_free(bmap);
4956 * returns range - domain
4958 struct isl_set *isl_map_deltas(struct isl_map *map)
4962 struct isl_set *result;
4967 isl_assert(map->ctx, isl_map_n_in(map) == isl_map_n_out(map), goto error);
4968 dim = isl_map_get_dim(map);
4969 dim = isl_dim_domain(dim);
4970 result = isl_set_alloc_dim(dim, map->n, map->flags);
4973 for (i = 0; i < map->n; ++i)
4974 result = isl_set_add_basic_set(result,
4975 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
4983 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
4985 struct isl_basic_map *bmap;
4993 nparam = dims->nparam;
4995 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
4999 for (i = 0; i < dim; ++i) {
5000 int j = isl_basic_map_alloc_equality(bmap);
5003 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5004 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5005 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5007 return isl_basic_map_finalize(bmap);
5009 isl_basic_map_free(bmap);
5013 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5015 struct isl_dim *dim = isl_dim_map(set_dim);
5018 return basic_map_identity(dim);
5021 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5023 if (!model || !model->dim)
5025 isl_assert(model->ctx,
5026 model->dim->n_in == model->dim->n_out, return NULL);
5027 return basic_map_identity(isl_dim_copy(model->dim));
5030 static struct isl_map *map_identity(struct isl_dim *dim)
5032 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5033 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5036 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5038 struct isl_dim *dim = isl_dim_map(set_dim);
5041 return map_identity(dim);
5044 struct isl_map *isl_map_identity_like(struct isl_map *model)
5046 if (!model || !model->dim)
5048 isl_assert(model->ctx,
5049 model->dim->n_in == model->dim->n_out, return NULL);
5050 return map_identity(isl_dim_copy(model->dim));
5053 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5055 if (!model || !model->dim)
5057 isl_assert(model->ctx,
5058 model->dim->n_in == model->dim->n_out, return NULL);
5059 return map_identity(isl_dim_copy(model->dim));
5062 /* Construct a basic set with all set dimensions having only non-negative
5065 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5070 struct isl_basic_set *bset;
5074 nparam = dims->nparam;
5076 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5079 for (i = 0; i < dim; ++i) {
5080 int k = isl_basic_set_alloc_inequality(bset);
5083 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5084 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5088 isl_basic_set_free(bset);
5092 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5093 enum isl_dim_type type, unsigned first, unsigned n)
5096 isl_basic_set *nonneg = NULL;
5097 isl_basic_set *neg = NULL;
5104 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5106 for (i = 0; i < n; ++i) {
5110 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5111 k = isl_basic_set_alloc_inequality(nonneg);
5114 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5115 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5117 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5118 k = isl_basic_set_alloc_inequality(neg);
5121 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5122 isl_int_set_si(neg->ineq[k][0], -1);
5123 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5125 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5130 isl_basic_set_free(nonneg);
5131 isl_basic_set_free(neg);
5136 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5138 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5141 int isl_basic_map_is_subset(
5142 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5145 struct isl_map *map1;
5146 struct isl_map *map2;
5148 if (!bmap1 || !bmap2)
5151 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5152 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5154 is_subset = isl_map_is_subset(map1, map2);
5162 int isl_basic_map_is_equal(
5163 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5167 if (!bmap1 || !bmap2)
5169 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5172 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5176 int isl_basic_set_is_equal(
5177 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5179 return isl_basic_map_is_equal(
5180 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5183 int isl_map_is_empty(struct isl_map *map)
5190 for (i = 0; i < map->n; ++i) {
5191 is_empty = isl_basic_map_is_empty(map->p[i]);
5200 int isl_map_fast_is_empty(struct isl_map *map)
5202 return map ? map->n == 0 : -1;
5205 int isl_set_fast_is_empty(struct isl_set *set)
5207 return set ? set->n == 0 : -1;
5210 int isl_set_is_empty(struct isl_set *set)
5212 return isl_map_is_empty((struct isl_map *)set);
5215 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5221 is_subset = isl_map_is_subset(map1, map2);
5224 is_subset = isl_map_is_subset(map2, map1);
5228 int isl_basic_map_is_strict_subset(
5229 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5233 if (!bmap1 || !bmap2)
5235 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5238 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5239 if (is_subset == -1)
5244 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5250 is_subset = isl_map_is_subset(map1, map2);
5253 is_subset = isl_map_is_subset(map2, map1);
5254 if (is_subset == -1)
5259 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5261 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5264 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5268 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5271 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5275 return bset->n_eq == 0 && bset->n_ineq == 0;
5278 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5283 return map->n == 1 && isl_basic_map_is_universe(map->p[0]);
5286 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5288 return isl_map_fast_is_universe((isl_map *) set);
5291 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5293 struct isl_basic_set *bset = NULL;
5294 struct isl_vec *sample = NULL;
5301 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5304 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5305 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5306 copy = isl_basic_map_convex_hull(copy);
5307 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5308 isl_basic_map_free(copy);
5312 total = 1 + isl_basic_map_total_dim(bmap);
5313 if (bmap->sample && bmap->sample->size == total) {
5314 int contains = isl_basic_map_contains(bmap, bmap->sample);
5320 isl_vec_free(bmap->sample);
5321 bmap->sample = NULL;
5322 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5325 sample = isl_basic_set_sample_vec(bset);
5328 empty = sample->size == 0;
5329 isl_vec_free(bmap->sample);
5330 bmap->sample = sample;
5332 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5337 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5341 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5344 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5348 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5351 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5353 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5356 struct isl_map *isl_basic_map_union(
5357 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5359 struct isl_map *map;
5360 if (!bmap1 || !bmap2)
5363 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5365 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5368 map = isl_map_add_basic_map(map, bmap1);
5369 map = isl_map_add_basic_map(map, bmap2);
5372 isl_basic_map_free(bmap1);
5373 isl_basic_map_free(bmap2);
5377 struct isl_set *isl_basic_set_union(
5378 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5380 return (struct isl_set *)isl_basic_map_union(
5381 (struct isl_basic_map *)bset1,
5382 (struct isl_basic_map *)bset2);
5385 /* Order divs such that any div only depends on previous divs */
5386 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5394 off = isl_dim_total(bmap->dim);
5396 for (i = 0; i < bmap->n_div; ++i) {
5398 if (isl_int_is_zero(bmap->div[i][0]))
5400 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5404 isl_basic_map_swap_div(bmap, i, i + pos);
5410 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5412 return (struct isl_basic_set *)
5413 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5416 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5423 for (i = 0; i < map->n; ++i) {
5424 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5435 /* Look for a div in dst that corresponds to the div "div" in src.
5436 * The divs before "div" in src and dst are assumed to be the same.
5438 * Returns -1 if no corresponding div was found and the position
5439 * of the corresponding div in dst otherwise.
5441 static int find_div(struct isl_basic_map *dst,
5442 struct isl_basic_map *src, unsigned div)
5446 unsigned total = isl_dim_total(src->dim);
5448 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5449 for (i = div; i < dst->n_div; ++i)
5450 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5451 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5452 dst->n_div - div) == -1)
5457 struct isl_basic_map *isl_basic_map_align_divs(
5458 struct isl_basic_map *dst, struct isl_basic_map *src)
5461 unsigned total = isl_dim_total(src->dim);
5466 if (src->n_div == 0)
5469 for (i = 0; i < src->n_div; ++i)
5470 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5472 src = isl_basic_map_order_divs(src);
5473 dst = isl_basic_map_cow(dst);
5474 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5475 src->n_div, 0, 2 * src->n_div);
5478 for (i = 0; i < src->n_div; ++i) {
5479 int j = find_div(dst, src, i);
5481 j = isl_basic_map_alloc_div(dst);
5484 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5485 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5486 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5490 isl_basic_map_swap_div(dst, i, j);
5494 isl_basic_map_free(dst);
5498 struct isl_basic_set *isl_basic_set_align_divs(
5499 struct isl_basic_set *dst, struct isl_basic_set *src)
5501 return (struct isl_basic_set *)isl_basic_map_align_divs(
5502 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5505 struct isl_map *isl_map_align_divs(struct isl_map *map)
5513 map = isl_map_compute_divs(map);
5514 map = isl_map_cow(map);
5518 for (i = 1; i < map->n; ++i)
5519 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5520 for (i = 1; i < map->n; ++i)
5521 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5523 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5527 struct isl_set *isl_set_align_divs(struct isl_set *set)
5529 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5532 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5536 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5537 map = isl_map_intersect_domain(map, set);
5538 set = isl_map_range(map);
5546 /* There is no need to cow as removing empty parts doesn't change
5547 * the meaning of the set.
5549 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5556 for (i = map->n-1; i >= 0; --i) {
5557 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5559 isl_basic_map_free(map->p[i]);
5560 if (i != map->n-1) {
5561 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5562 map->p[i] = map->p[map->n-1];
5570 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5572 return (struct isl_set *)
5573 isl_map_remove_empty_parts((struct isl_map *)set);
5576 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5578 struct isl_basic_map *bmap;
5579 if (!map || map->n == 0)
5581 bmap = map->p[map->n-1];
5582 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5583 return isl_basic_map_copy(bmap);
5586 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5588 return (struct isl_basic_set *)
5589 isl_map_copy_basic_map((struct isl_map *)set);
5592 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5593 __isl_keep isl_basic_map *bmap)
5599 for (i = map->n-1; i >= 0; --i) {
5600 if (map->p[i] != bmap)
5602 map = isl_map_cow(map);
5605 isl_basic_map_free(map->p[i]);
5606 if (i != map->n-1) {
5607 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5608 map->p[i] = map->p[map->n-1];
5619 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5620 struct isl_basic_set *bset)
5622 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5623 (struct isl_basic_map *)bset);
5626 /* Given two basic sets bset1 and bset2, compute the maximal difference
5627 * between the values of dimension pos in bset1 and those in bset2
5628 * for any common value of the parameters and dimensions preceding pos.
5630 static enum isl_lp_result basic_set_maximal_difference_at(
5631 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5632 int pos, isl_int *opt)
5634 struct isl_dim *dims;
5635 struct isl_basic_map *bmap1 = NULL;
5636 struct isl_basic_map *bmap2 = NULL;
5637 struct isl_ctx *ctx;
5638 struct isl_vec *obj;
5641 unsigned dim1, dim2;
5642 enum isl_lp_result res;
5644 if (!bset1 || !bset2)
5645 return isl_lp_error;
5647 nparam = isl_basic_set_n_param(bset1);
5648 dim1 = isl_basic_set_n_dim(bset1);
5649 dim2 = isl_basic_set_n_dim(bset2);
5650 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5651 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5652 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5653 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5654 if (!bmap1 || !bmap2)
5656 bmap1 = isl_basic_map_cow(bmap1);
5657 bmap1 = isl_basic_map_extend(bmap1, nparam,
5658 pos, (dim1 - pos) + (dim2 - pos),
5659 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5660 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5663 total = isl_basic_map_total_dim(bmap1);
5665 obj = isl_vec_alloc(ctx, 1 + total);
5666 isl_seq_clr(obj->block.data, 1 + total);
5667 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5668 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5671 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5673 isl_basic_map_free(bmap1);
5677 isl_basic_map_free(bmap1);
5678 isl_basic_map_free(bmap2);
5679 return isl_lp_error;
5682 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5683 * for any common value of the parameters and dimensions preceding pos
5684 * in both basic sets, the values of dimension pos in bset1 are
5685 * smaller or larger than those in bset2.
5688 * 1 if bset1 follows bset2
5689 * -1 if bset1 precedes bset2
5690 * 0 if bset1 and bset2 are incomparable
5691 * -2 if some error occurred.
5693 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5694 struct isl_basic_set *bset2, int pos)
5697 enum isl_lp_result res;
5702 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5704 if (res == isl_lp_empty)
5706 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5707 res == isl_lp_unbounded)
5709 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5718 /* Given two basic sets bset1 and bset2, check whether
5719 * for any common value of the parameters and dimensions preceding pos
5720 * there is a value of dimension pos in bset1 that is larger
5721 * than a value of the same dimension in bset2.
5724 * 1 if there exists such a pair
5725 * 0 if there is no such pair, but there is a pair of equal values
5727 * -2 if some error occurred.
5729 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5730 __isl_keep isl_basic_set *bset2, int pos)
5733 enum isl_lp_result res;
5738 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5740 if (res == isl_lp_empty)
5742 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5743 res == isl_lp_unbounded)
5745 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5747 else if (res == isl_lp_ok)
5756 /* Given two sets set1 and set2, check whether
5757 * for any common value of the parameters and dimensions preceding pos
5758 * there is a value of dimension pos in set1 that is larger
5759 * than a value of the same dimension in set2.
5762 * 1 if there exists such a pair
5763 * 0 if there is no such pair, but there is a pair of equal values
5765 * -2 if some error occurred.
5767 int isl_set_follows_at(__isl_keep isl_set *set1,
5768 __isl_keep isl_set *set2, int pos)
5776 for (i = 0; i < set1->n; ++i)
5777 for (j = 0; j < set2->n; ++j) {
5779 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5780 if (f == 1 || f == -2)
5789 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5790 unsigned pos, isl_int *val)
5798 total = isl_basic_map_total_dim(bmap);
5799 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5800 for (; d+1 > pos; --d)
5801 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5805 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5807 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5809 if (!isl_int_is_one(bmap->eq[i][1+d]))
5812 isl_int_neg(*val, bmap->eq[i][0]);
5818 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5819 unsigned pos, isl_int *val)
5831 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5834 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5835 for (i = 1; fixed == 1 && i < map->n; ++i) {
5836 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5837 if (fixed == 1 && isl_int_ne(tmp, v))
5841 isl_int_set(*val, v);
5847 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5848 unsigned pos, isl_int *val)
5850 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5854 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5857 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5860 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5861 enum isl_dim_type type, unsigned pos, isl_int *val)
5863 if (pos >= isl_basic_map_dim(bmap, type))
5865 return isl_basic_map_fast_has_fixed_var(bmap,
5866 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5869 int isl_map_fast_is_fixed(struct isl_map *map,
5870 enum isl_dim_type type, unsigned pos, isl_int *val)
5872 if (pos >= isl_map_dim(map, type))
5874 return isl_map_fast_has_fixed_var(map,
5875 map_offset(map, type) - 1 + pos, val);
5878 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5879 * then return this fixed value in *val.
5881 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5884 return isl_basic_set_fast_has_fixed_var(bset,
5885 isl_basic_set_n_param(bset) + dim, val);
5888 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5889 * then return this fixed value in *val.
5891 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
5893 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
5896 /* Check if input variable in has fixed value and if so and if val is not NULL,
5897 * then return this fixed value in *val.
5899 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
5901 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
5904 /* Check if dimension dim has an (obvious) fixed lower bound and if so
5905 * and if val is not NULL, then return this lower bound in *val.
5907 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
5908 unsigned dim, isl_int *val)
5910 int i, i_eq = -1, i_ineq = -1;
5917 total = isl_basic_set_total_dim(bset);
5918 nparam = isl_basic_set_n_param(bset);
5919 for (i = 0; i < bset->n_eq; ++i) {
5920 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
5926 for (i = 0; i < bset->n_ineq; ++i) {
5927 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
5929 if (i_eq != -1 || i_ineq != -1)
5933 if (i_eq == -1 && i_ineq == -1)
5935 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
5936 /* The coefficient should always be one due to normalization. */
5937 if (!isl_int_is_one(c[1+nparam+dim]))
5939 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
5941 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
5942 total - nparam - dim - 1) != -1)
5945 isl_int_neg(*val, c[0]);
5949 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
5950 unsigned dim, isl_int *val)
5962 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5966 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
5968 for (i = 1; fixed == 1 && i < set->n; ++i) {
5969 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
5971 if (fixed == 1 && isl_int_ne(tmp, v))
5975 isl_int_set(*val, v);
5986 static int qsort_constraint_cmp(const void *p1, const void *p2)
5988 const struct constraint *c1 = (const struct constraint *)p1;
5989 const struct constraint *c2 = (const struct constraint *)p2;
5990 unsigned size = isl_min(c1->size, c2->size);
5991 return isl_seq_cmp(c1->c, c2->c, size);
5994 static struct isl_basic_map *isl_basic_map_sort_constraints(
5995 struct isl_basic_map *bmap)
5998 struct constraint *c;
6003 total = isl_basic_map_total_dim(bmap);
6004 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6007 for (i = 0; i < bmap->n_ineq; ++i) {
6009 c[i].c = bmap->ineq[i];
6011 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6012 for (i = 0; i < bmap->n_ineq; ++i)
6013 bmap->ineq[i] = c[i].c;
6017 isl_basic_map_free(bmap);
6021 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6022 __isl_take isl_basic_set *bset)
6024 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6025 (struct isl_basic_map *)bset);
6028 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6032 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6034 bmap = isl_basic_map_convex_hull(bmap);
6035 bmap = isl_basic_map_sort_constraints(bmap);
6036 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6040 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6042 return (struct isl_basic_set *)isl_basic_map_normalize(
6043 (struct isl_basic_map *)bset);
6046 static int isl_basic_map_fast_cmp(const struct isl_basic_map *bmap1,
6047 const struct isl_basic_map *bmap2)
6054 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6055 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6056 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6057 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6058 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6059 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6060 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6061 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6063 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6065 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6067 if (bmap1->n_eq != bmap2->n_eq)
6068 return bmap1->n_eq - bmap2->n_eq;
6069 if (bmap1->n_ineq != bmap2->n_ineq)
6070 return bmap1->n_ineq - bmap2->n_ineq;
6071 if (bmap1->n_div != bmap2->n_div)
6072 return bmap1->n_div - bmap2->n_div;
6073 total = isl_basic_map_total_dim(bmap1);
6074 for (i = 0; i < bmap1->n_eq; ++i) {
6075 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6079 for (i = 0; i < bmap1->n_ineq; ++i) {
6080 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6084 for (i = 0; i < bmap1->n_div; ++i) {
6085 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6092 static int isl_basic_map_fast_is_equal(struct isl_basic_map *bmap1,
6093 struct isl_basic_map *bmap2)
6095 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6098 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6099 __isl_keep isl_basic_set *bset2)
6101 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6102 (isl_basic_map *)bset2);
6105 static int qsort_bmap_cmp(const void *p1, const void *p2)
6107 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6108 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6110 return isl_basic_map_fast_cmp(bmap1, bmap2);
6113 /* We normalize in place, but if anything goes wrong we need
6114 * to return NULL, so we need to make sure we don't change the
6115 * meaning of any possible other copies of map.
6117 struct isl_map *isl_map_normalize(struct isl_map *map)
6120 struct isl_basic_map *bmap;
6124 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6126 for (i = 0; i < map->n; ++i) {
6127 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6130 isl_basic_map_free(map->p[i]);
6133 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6134 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6135 map = isl_map_remove_empty_parts(map);
6138 for (i = map->n - 1; i >= 1; --i) {
6139 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6141 isl_basic_map_free(map->p[i-1]);
6142 for (j = i; j < map->n; ++j)
6143 map->p[j-1] = map->p[j];
6153 struct isl_set *isl_set_normalize(struct isl_set *set)
6155 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6158 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6168 if (!isl_dim_equal(map1->dim, map2->dim))
6171 map1 = isl_map_copy(map1);
6172 map2 = isl_map_copy(map2);
6173 map1 = isl_map_normalize(map1);
6174 map2 = isl_map_normalize(map2);
6177 equal = map1->n == map2->n;
6178 for (i = 0; equal && i < map1->n; ++i) {
6179 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6192 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6194 return isl_map_fast_is_equal((struct isl_map *)set1,
6195 (struct isl_map *)set2);
6198 /* Return an interval that ranges from min to max (inclusive)
6200 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6201 isl_int min, isl_int max)
6204 struct isl_basic_set *bset = NULL;
6206 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6210 k = isl_basic_set_alloc_inequality(bset);
6213 isl_int_set_si(bset->ineq[k][1], 1);
6214 isl_int_neg(bset->ineq[k][0], min);
6216 k = isl_basic_set_alloc_inequality(bset);
6219 isl_int_set_si(bset->ineq[k][1], -1);
6220 isl_int_set(bset->ineq[k][0], max);
6224 isl_basic_set_free(bset);
6228 /* Return the Cartesian product of the basic sets in list (in the given order).
6230 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6238 struct isl_basic_set *product = NULL;
6242 isl_assert(list->ctx, list->n > 0, goto error);
6243 isl_assert(list->ctx, list->p[0], goto error);
6244 nparam = isl_basic_set_n_param(list->p[0]);
6245 dim = isl_basic_set_n_dim(list->p[0]);
6246 extra = list->p[0]->n_div;
6247 n_eq = list->p[0]->n_eq;
6248 n_ineq = list->p[0]->n_ineq;
6249 for (i = 1; i < list->n; ++i) {
6250 isl_assert(list->ctx, list->p[i], goto error);
6251 isl_assert(list->ctx,
6252 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6253 dim += isl_basic_set_n_dim(list->p[i]);
6254 extra += list->p[i]->n_div;
6255 n_eq += list->p[i]->n_eq;
6256 n_ineq += list->p[i]->n_ineq;
6258 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6263 for (i = 0; i < list->n; ++i) {
6264 isl_basic_set_add_constraints(product,
6265 isl_basic_set_copy(list->p[i]), dim);
6266 dim += isl_basic_set_n_dim(list->p[i]);
6268 isl_basic_set_list_free(list);
6271 isl_basic_set_free(product);
6272 isl_basic_set_list_free(list);
6276 struct isl_basic_map *isl_basic_map_product(
6277 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6279 struct isl_dim *dim_result = NULL;
6280 struct isl_basic_map *bmap;
6281 unsigned in1, in2, out1, out2, nparam, total, pos;
6282 struct isl_dim_map *dim_map1, *dim_map2;
6284 if (!bmap1 || !bmap2)
6287 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6288 bmap2->dim, isl_dim_param), goto error);
6289 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6290 isl_dim_copy(bmap2->dim));
6292 in1 = isl_basic_map_n_in(bmap1);
6293 in2 = isl_basic_map_n_in(bmap2);
6294 out1 = isl_basic_map_n_out(bmap1);
6295 out2 = isl_basic_map_n_out(bmap2);
6296 nparam = isl_basic_map_n_param(bmap1);
6298 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6299 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6300 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6301 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6302 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6303 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6304 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6305 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6306 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6307 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6308 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6310 bmap = isl_basic_map_alloc_dim(dim_result,
6311 bmap1->n_div + bmap2->n_div,
6312 bmap1->n_eq + bmap2->n_eq,
6313 bmap1->n_ineq + bmap2->n_ineq);
6314 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6315 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6316 bmap = isl_basic_map_simplify(bmap);
6317 return isl_basic_map_finalize(bmap);
6319 isl_basic_map_free(bmap1);
6320 isl_basic_map_free(bmap2);
6324 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6326 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6329 struct isl_map *result;
6335 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6336 map2->dim, isl_dim_param), goto error);
6338 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6339 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6340 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6342 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6343 isl_dim_copy(map2->dim)),
6344 map1->n * map2->n, flags);
6347 for (i = 0; i < map1->n; ++i)
6348 for (j = 0; j < map2->n; ++j) {
6349 struct isl_basic_map *part;
6350 part = isl_basic_map_product(
6351 isl_basic_map_copy(map1->p[i]),
6352 isl_basic_map_copy(map2->p[j]));
6353 if (isl_basic_map_is_empty(part))
6354 isl_basic_map_free(part);
6356 result = isl_map_add_basic_map(result, part);
6369 /* Given two set A and B, construct its Cartesian product A x B.
6371 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6373 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6374 (struct isl_map *)set2);
6377 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6380 uint32_t hash = isl_hash_init();
6385 bset = isl_basic_set_copy(bset);
6386 bset = isl_basic_set_normalize(bset);
6389 total = isl_basic_set_total_dim(bset);
6390 isl_hash_byte(hash, bset->n_eq & 0xFF);
6391 for (i = 0; i < bset->n_eq; ++i) {
6393 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6394 isl_hash_hash(hash, c_hash);
6396 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6397 for (i = 0; i < bset->n_ineq; ++i) {
6399 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6400 isl_hash_hash(hash, c_hash);
6402 isl_hash_byte(hash, bset->n_div & 0xFF);
6403 for (i = 0; i < bset->n_div; ++i) {
6405 if (isl_int_is_zero(bset->div[i][0]))
6407 isl_hash_byte(hash, i & 0xFF);
6408 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6409 isl_hash_hash(hash, c_hash);
6411 isl_basic_set_free(bset);
6415 uint32_t isl_set_get_hash(struct isl_set *set)
6422 set = isl_set_copy(set);
6423 set = isl_set_normalize(set);
6427 hash = isl_hash_init();
6428 for (i = 0; i < set->n; ++i) {
6430 bset_hash = isl_basic_set_get_hash(set->p[i]);
6431 isl_hash_hash(hash, bset_hash);
6439 /* Check if the value for dimension dim is completely determined
6440 * by the values of the other parameters and variables.
6441 * That is, check if dimension dim is involved in an equality.
6443 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6450 nparam = isl_basic_set_n_param(bset);
6451 for (i = 0; i < bset->n_eq; ++i)
6452 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6457 /* Check if the value for dimension dim is completely determined
6458 * by the values of the other parameters and variables.
6459 * That is, check if dimension dim is involved in an equality
6460 * for each of the subsets.
6462 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6468 for (i = 0; i < set->n; ++i) {
6470 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6477 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6478 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6485 for (i = 0; i < map->n; ++i)
6486 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6492 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6493 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6500 for (i = 0; i < set->n; ++i)
6501 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6507 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6509 struct isl_dim *dim;
6514 if (bset->n_div == 0)
6517 bset = isl_basic_set_cow(bset);
6521 dim = isl_basic_set_get_dim(bset);
6522 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6525 isl_dim_free(bset->dim);
6529 bset = isl_basic_set_finalize(bset);
6533 isl_basic_set_free(bset);
6537 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6540 struct isl_dim *dim;
6543 set = isl_set_align_divs(set);
6547 if (set->n == 0 || set->p[0]->n_div == 0)
6550 set = isl_set_cow(set);
6554 n_div = set->p[0]->n_div;
6555 dim = isl_set_get_dim(set);
6556 dim = isl_dim_add(dim, isl_dim_set, n_div);
6559 isl_dim_free(set->dim);
6562 for (i = 0; i < set->n; ++i) {
6563 set->p[i] = isl_basic_set_lift(set->p[i]);
6574 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6576 struct isl_dim *dim;
6577 struct isl_basic_map *bmap;
6584 set = isl_set_align_divs(set);
6589 dim = isl_set_get_dim(set);
6590 if (set->n == 0 || set->p[0]->n_div == 0) {
6592 return isl_map_identity(dim);
6595 n_div = set->p[0]->n_div;
6596 dim = isl_dim_map(dim);
6597 n_param = isl_dim_size(dim, isl_dim_param);
6598 n_set = isl_dim_size(dim, isl_dim_in);
6599 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6600 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6601 for (i = 0; i < n_set; ++i)
6602 bmap = var_equal(bmap, i);
6604 total = n_param + n_set + n_set + n_div;
6605 for (i = 0; i < n_div; ++i) {
6606 k = isl_basic_map_alloc_inequality(bmap);
6609 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6610 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6611 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6612 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6613 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6614 set->p[0]->div[i][0]);
6616 l = isl_basic_map_alloc_inequality(bmap);
6619 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6620 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6621 set->p[0]->div[i][0]);
6622 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6626 return isl_map_from_basic_map(bmap);
6629 isl_basic_map_free(bmap);
6633 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6641 dim = isl_basic_set_total_dim(bset);
6642 size += bset->n_eq * (1 + dim);
6643 size += bset->n_ineq * (1 + dim);
6644 size += bset->n_div * (2 + dim);
6649 int isl_set_size(__isl_keep isl_set *set)
6657 for (i = 0; i < set->n; ++i)
6658 size += isl_basic_set_size(set->p[i]);
6663 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6664 enum isl_dim_type type, unsigned pos)
6672 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6674 pos += isl_basic_map_offset(bmap, type);
6676 for (i = 0; i < bmap->n_eq; ++i)
6677 if (!isl_int_is_zero(bmap->eq[i][pos]))
6681 for (i = 0; i < bmap->n_ineq; ++i) {
6682 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6689 return lower && upper;
6692 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6693 enum isl_dim_type type, unsigned pos)
6700 for (i = 0; i < map->n; ++i) {
6702 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6703 if (bounded < 0 || !bounded)
6710 /* Return 1 if the specified dim is involved in both an upper bound
6711 * and a lower bound.
6713 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6714 enum isl_dim_type type, unsigned pos)
6716 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6719 /* For each of the "n" variables starting at "first", determine
6720 * the sign of the variable and put the results in the first "n"
6721 * elements of the array "signs".
6723 * 1 means that the variable is non-negative
6724 * -1 means that the variable is non-positive
6725 * 0 means the variable attains both positive and negative values.
6727 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6728 unsigned first, unsigned n, int *signs)
6730 isl_vec *bound = NULL;
6731 struct isl_tab *tab = NULL;
6732 struct isl_tab_undo *snap;
6735 if (!bset || !signs)
6738 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6739 tab = isl_tab_from_basic_set(bset);
6743 isl_seq_clr(bound->el, bound->size);
6744 isl_int_set_si(bound->el[0], -1);
6746 snap = isl_tab_snap(tab);
6747 for (i = 0; i < n; ++i) {
6750 isl_int_set_si(bound->el[1 + first + i], -1);
6751 if (isl_tab_add_ineq(tab, bound->el) < 0)
6754 isl_int_set_si(bound->el[1 + first + i], 0);
6755 if (isl_tab_rollback(tab, snap) < 0)
6763 isl_int_set_si(bound->el[1 + first + i], 1);
6764 if (isl_tab_add_ineq(tab, bound->el) < 0)
6767 isl_int_set_si(bound->el[1 + first + i], 0);
6768 if (isl_tab_rollback(tab, snap) < 0)
6771 signs[i] = empty ? -1 : 0;
6775 isl_vec_free(bound);
6779 isl_vec_free(bound);
6783 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
6784 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
6786 if (!bset || !signs)
6788 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
6791 first += pos(bset->dim, type) - 1;
6792 return isl_basic_set_vars_get_sign(bset, first, n, signs);
6795 /* Check if the given map is single-valued.
6800 * and check if the result is a subset of the identity mapping.
6802 int isl_map_is_single_valued(__isl_keep isl_map *map)
6808 test = isl_map_reverse(isl_map_copy(map));
6809 test = isl_map_apply_range(test, isl_map_copy(map));
6811 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
6813 sv = isl_map_is_subset(test, id);
6821 int isl_set_is_singleton(__isl_keep isl_set *set)
6823 return isl_map_is_single_valued((isl_map *)set);
6826 int isl_map_is_translation(__isl_keep isl_map *map)
6831 delta = isl_map_deltas(isl_map_copy(map));
6832 ok = isl_set_is_singleton(delta);
6833 isl_set_free(delta);
6838 static int unique(isl_int *p, unsigned pos, unsigned len)
6840 if (isl_seq_first_non_zero(p, pos) != -1)
6842 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
6847 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
6856 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
6859 nvar = isl_basic_set_dim(bset, isl_dim_set);
6860 ovar = isl_dim_offset(bset->dim, isl_dim_set);
6861 for (j = 0; j < nvar; ++j) {
6862 int lower = 0, upper = 0;
6863 for (i = 0; i < bset->n_eq; ++i) {
6864 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
6866 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
6872 for (i = 0; i < bset->n_ineq; ++i) {
6873 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
6875 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
6877 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
6882 if (!lower || !upper)
6889 int isl_set_is_box(__isl_keep isl_set *set)
6896 return isl_basic_set_is_box(set->p[0]);