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)
124 case isl_dim_out: return isl_dim_size(bmap->dim, type);
125 case isl_dim_div: return bmap->n_div;
126 case isl_dim_all: return isl_basic_map_total_dim(bmap);
131 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
133 return map ? n(map->dim, type) : 0;
136 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
138 return set ? n(set->dim, type) : 0;
141 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
142 enum isl_dim_type type)
144 struct isl_dim *dim = bmap->dim;
146 case isl_dim_param: return 1;
147 case isl_dim_in: return 1 + dim->nparam;
148 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
149 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
154 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
156 return pos(map->dim, type);
159 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
160 enum isl_dim_type type)
162 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
165 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
167 return isl_basic_set_dim(bset, isl_dim_set);
170 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
172 return isl_basic_set_dim(bset, isl_dim_param);
175 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
177 return isl_dim_total(bset->dim) + bset->n_div;
180 unsigned isl_set_n_dim(const struct isl_set *set)
182 return isl_set_dim(set, isl_dim_set);
185 unsigned isl_set_n_param(const struct isl_set *set)
187 return isl_set_dim(set, isl_dim_param);
190 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
192 return bmap ? bmap->dim->n_in : 0;
195 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
197 return bmap ? bmap->dim->n_out : 0;
200 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
202 return bmap ? bmap->dim->nparam : 0;
205 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
207 return bmap ? bmap->n_div : 0;
210 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
212 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
215 unsigned isl_map_n_in(const struct isl_map *map)
217 return map->dim->n_in;
220 unsigned isl_map_n_out(const struct isl_map *map)
222 return map->dim->n_out;
225 unsigned isl_map_n_param(const struct isl_map *map)
227 return map->dim->nparam;
230 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
235 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
238 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
241 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
242 struct isl_basic_set *bset)
247 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
250 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
253 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
254 struct isl_basic_set *bset)
259 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
262 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
265 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
267 return bmap ? bmap->ctx : NULL;
270 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
272 return bset ? bset->ctx : NULL;
275 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
277 return map ? map->ctx : NULL;
280 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
282 return set ? set->ctx : NULL;
285 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
289 return isl_dim_copy(bmap->dim);
292 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
296 return isl_dim_copy(bset->dim);
299 struct isl_dim *isl_map_get_dim(struct isl_map *map)
303 return isl_dim_copy(map->dim);
306 struct isl_dim *isl_set_get_dim(struct isl_set *set)
310 return isl_dim_copy(set->dim);
313 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
314 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
316 bmap = isl_basic_map_cow(bmap);
319 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
324 isl_basic_map_free(bmap);
328 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
329 enum isl_dim_type type, const char *s)
333 map = isl_map_cow(map);
337 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
341 for (i = 0; i < map->n; ++i) {
342 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
353 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
354 __isl_take isl_basic_map *bmap,
355 enum isl_dim_type type, unsigned pos, const char *s)
359 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
364 isl_basic_map_free(bmap);
368 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
369 enum isl_dim_type type, unsigned pos, const char *s)
376 map->dim = isl_dim_set_name(map->dim, type, pos, s);
380 for (i = 0; i < map->n; ++i) {
381 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
392 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
393 __isl_take isl_basic_set *bset,
394 enum isl_dim_type type, unsigned pos, const char *s)
396 return (isl_basic_set *)isl_basic_map_set_dim_name(
397 (isl_basic_map *)bset, type, pos, s);
400 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
401 enum isl_dim_type type, unsigned pos, const char *s)
403 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
406 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
410 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
413 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
414 struct isl_basic_map *bmap, unsigned extra,
415 unsigned n_eq, unsigned n_ineq)
418 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
423 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
424 if (isl_blk_is_error(bmap->block))
427 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
432 bmap->block2 = isl_blk_empty();
435 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
436 if (isl_blk_is_error(bmap->block2))
439 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
444 for (i = 0; i < n_ineq + n_eq; ++i)
445 bmap->ineq[i] = bmap->block.data + i * row_size;
447 for (i = 0; i < extra; ++i)
448 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
452 bmap->c_size = n_eq + n_ineq;
453 bmap->eq = bmap->ineq + n_ineq;
462 isl_basic_map_free(bmap);
466 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
467 unsigned nparam, unsigned dim, unsigned extra,
468 unsigned n_eq, unsigned n_ineq)
470 struct isl_basic_map *bmap;
471 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
472 return (struct isl_basic_set *)bmap;
475 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
476 unsigned extra, unsigned n_eq, unsigned n_ineq)
478 struct isl_basic_map *bmap;
481 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
482 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
483 return (struct isl_basic_set *)bmap;
486 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
487 unsigned extra, unsigned n_eq, unsigned n_ineq)
489 struct isl_basic_map *bmap;
493 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
498 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
504 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
505 unsigned nparam, unsigned in, unsigned out, unsigned extra,
506 unsigned n_eq, unsigned n_ineq)
508 struct isl_basic_map *bmap;
511 dim = isl_dim_alloc(ctx, nparam, in, out);
515 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
519 static void dup_constraints(
520 struct isl_basic_map *dst, struct isl_basic_map *src)
523 unsigned total = isl_basic_map_total_dim(src);
525 for (i = 0; i < src->n_eq; ++i) {
526 int j = isl_basic_map_alloc_equality(dst);
527 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
530 for (i = 0; i < src->n_ineq; ++i) {
531 int j = isl_basic_map_alloc_inequality(dst);
532 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
535 for (i = 0; i < src->n_div; ++i) {
536 int j = isl_basic_map_alloc_div(dst);
537 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
539 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
542 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
544 struct isl_basic_map *dup;
548 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
549 bmap->n_div, bmap->n_eq, bmap->n_ineq);
552 dup_constraints(dup, bmap);
553 dup->flags = bmap->flags;
554 dup->sample = isl_vec_copy(bmap->sample);
558 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
560 struct isl_basic_map *dup;
562 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
563 return (struct isl_basic_set *)dup;
566 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
571 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
575 return isl_basic_set_dup(bset);
578 struct isl_set *isl_set_copy(struct isl_set *set)
587 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
592 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
596 bmap = isl_basic_map_dup(bmap);
598 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
602 struct isl_map *isl_map_copy(struct isl_map *map)
611 void isl_basic_map_free(struct isl_basic_map *bmap)
619 isl_ctx_deref(bmap->ctx);
621 isl_blk_free(bmap->ctx, bmap->block2);
623 isl_blk_free(bmap->ctx, bmap->block);
624 isl_vec_free(bmap->sample);
625 isl_dim_free(bmap->dim);
629 void isl_basic_set_free(struct isl_basic_set *bset)
631 isl_basic_map_free((struct isl_basic_map *)bset);
634 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
636 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
639 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
645 isl_assert(ctx, room_for_con(bmap, 1), return -1);
646 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
648 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
649 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
650 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
651 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
652 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
653 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
655 int j = isl_basic_map_alloc_inequality(bmap);
659 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
660 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
667 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
668 bmap->extra - bmap->n_div);
672 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
674 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
677 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
681 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
686 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
688 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
691 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
696 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
698 if (pos != bmap->n_eq - 1) {
700 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
701 bmap->eq[bmap->n_eq - 1] = t;
707 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
709 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
712 void isl_basic_map_inequality_to_equality(
713 struct isl_basic_map *bmap, unsigned pos)
718 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
719 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
724 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
725 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
726 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
727 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
730 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
732 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
735 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
741 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
742 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
743 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
744 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
745 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
746 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
747 1 + isl_basic_map_total_dim(bmap),
748 bmap->extra - bmap->n_div);
749 return bmap->n_ineq++;
752 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
754 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
757 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
761 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
766 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
768 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
771 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
776 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
778 if (pos != bmap->n_ineq - 1) {
780 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
781 bmap->ineq[bmap->n_ineq - 1] = t;
782 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
788 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
790 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
793 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
798 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
801 k = isl_basic_map_alloc_equality(bmap);
804 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
807 isl_basic_map_free(bmap);
811 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
814 return (isl_basic_set *)
815 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
818 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
823 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
826 k = isl_basic_map_alloc_inequality(bmap);
829 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
832 isl_basic_map_free(bmap);
836 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
839 return (isl_basic_set *)
840 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
843 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
847 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
848 isl_seq_clr(bmap->div[bmap->n_div] +
849 1 + 1 + isl_basic_map_total_dim(bmap),
850 bmap->extra - bmap->n_div);
851 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
852 return bmap->n_div++;
855 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
857 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
860 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
864 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
869 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
871 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
874 /* Copy constraint from src to dst, putting the vars of src at offset
875 * dim_off in dst and the divs of src at offset div_off in dst.
876 * If both sets are actually map, then dim_off applies to the input
879 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
880 struct isl_basic_map *src_map, isl_int *src,
881 unsigned in_off, unsigned out_off, unsigned div_off)
883 unsigned src_nparam = isl_basic_map_n_param(src_map);
884 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
885 unsigned src_in = isl_basic_map_n_in(src_map);
886 unsigned dst_in = isl_basic_map_n_in(dst_map);
887 unsigned src_out = isl_basic_map_n_out(src_map);
888 unsigned dst_out = isl_basic_map_n_out(dst_map);
889 isl_int_set(dst[0], src[0]);
890 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
891 if (dst_nparam > src_nparam)
892 isl_seq_clr(dst+1+src_nparam,
893 dst_nparam - src_nparam);
894 isl_seq_clr(dst+1+dst_nparam, in_off);
895 isl_seq_cpy(dst+1+dst_nparam+in_off,
897 isl_min(dst_in-in_off, src_in));
898 if (dst_in-in_off > src_in)
899 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
900 dst_in - in_off - src_in);
901 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
902 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
903 src+1+src_nparam+src_in,
904 isl_min(dst_out-out_off, src_out));
905 if (dst_out-out_off > src_out)
906 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
907 dst_out - out_off - src_out);
908 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
909 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
910 src+1+src_nparam+src_in+src_out,
911 isl_min(dst_map->extra-div_off, src_map->n_div));
912 if (dst_map->n_div-div_off > src_map->n_div)
913 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
914 div_off+src_map->n_div,
915 dst_map->n_div - div_off - src_map->n_div);
918 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
919 struct isl_basic_map *src_map, isl_int *src,
920 unsigned in_off, unsigned out_off, unsigned div_off)
922 isl_int_set(dst[0], src[0]);
923 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
926 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
927 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
932 if (!bmap1 || !bmap2)
935 div_off = bmap1->n_div;
937 for (i = 0; i < bmap2->n_eq; ++i) {
938 int i1 = isl_basic_map_alloc_equality(bmap1);
941 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
942 i_pos, o_pos, div_off);
945 for (i = 0; i < bmap2->n_ineq; ++i) {
946 int i1 = isl_basic_map_alloc_inequality(bmap1);
949 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
950 i_pos, o_pos, div_off);
953 for (i = 0; i < bmap2->n_div; ++i) {
954 int i1 = isl_basic_map_alloc_div(bmap1);
957 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
958 i_pos, o_pos, div_off);
961 isl_basic_map_free(bmap2);
966 isl_basic_map_free(bmap1);
967 isl_basic_map_free(bmap2);
971 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
972 struct isl_dim_map *dim_map)
976 for (i = 0; i < dim_map->len; ++i) {
977 if (dim_map->pos[i] < 0)
978 isl_int_set_si(dst[i], 0);
980 isl_int_set(dst[i], src[dim_map->pos[i]]);
984 static void copy_div_dim_map(isl_int *dst, isl_int *src,
985 struct isl_dim_map *dim_map)
987 isl_int_set(dst[0], src[0]);
988 copy_constraint_dim_map(dst+1, src+1, dim_map);
991 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
992 struct isl_basic_map *src, struct isl_dim_map *dim_map)
996 if (!src || !dst || !dim_map)
999 for (i = 0; i < src->n_eq; ++i) {
1000 int i1 = isl_basic_map_alloc_equality(dst);
1003 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1006 for (i = 0; i < src->n_ineq; ++i) {
1007 int i1 = isl_basic_map_alloc_inequality(dst);
1010 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1013 for (i = 0; i < src->n_div; ++i) {
1014 int i1 = isl_basic_map_alloc_div(dst);
1017 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1021 isl_basic_map_free(src);
1026 isl_basic_map_free(src);
1027 isl_basic_map_free(dst);
1031 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1032 struct isl_basic_set *bset2, unsigned pos)
1034 return (struct isl_basic_set *)
1035 add_constraints((struct isl_basic_map *)bset1,
1036 (struct isl_basic_map *)bset2, 0, pos);
1039 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1040 struct isl_dim *dim, unsigned extra,
1041 unsigned n_eq, unsigned n_ineq)
1043 struct isl_basic_map *ext;
1053 dims_ok = isl_dim_equal(base->dim, dim) &&
1054 base->extra >= base->n_div + extra;
1056 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1057 room_for_ineq(base, n_ineq)) {
1062 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1063 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1064 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1065 extra += base->extra;
1067 n_ineq += base->n_ineq;
1069 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1075 ext->sample = isl_vec_copy(base->sample);
1076 flags = base->flags;
1077 ext = add_constraints(ext, base, 0, 0);
1080 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1087 isl_basic_map_free(base);
1091 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1092 struct isl_dim *dim, unsigned extra,
1093 unsigned n_eq, unsigned n_ineq)
1095 return (struct isl_basic_set *)
1096 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1097 extra, n_eq, n_ineq);
1100 struct isl_basic_map *isl_basic_map_extend_constraints(
1101 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1105 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1109 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1110 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1111 unsigned n_eq, unsigned n_ineq)
1113 struct isl_basic_map *bmap;
1114 struct isl_dim *dim;
1118 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1122 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1125 isl_basic_map_free(base);
1129 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1130 unsigned nparam, unsigned dim, unsigned extra,
1131 unsigned n_eq, unsigned n_ineq)
1133 return (struct isl_basic_set *)
1134 isl_basic_map_extend((struct isl_basic_map *)base,
1135 nparam, 0, dim, extra, n_eq, n_ineq);
1138 struct isl_basic_set *isl_basic_set_extend_constraints(
1139 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1141 return (struct isl_basic_set *)
1142 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1146 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1148 return (struct isl_basic_set *)
1149 isl_basic_map_cow((struct isl_basic_map *)bset);
1152 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1157 if (bmap->ref > 1) {
1159 bmap = isl_basic_map_dup(bmap);
1162 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1166 struct isl_set *isl_set_cow(struct isl_set *set)
1174 return isl_set_dup(set);
1177 struct isl_map *isl_map_cow(struct isl_map *map)
1185 return isl_map_dup(map);
1188 static void swap_vars(struct isl_blk blk, isl_int *a,
1189 unsigned a_len, unsigned b_len)
1191 isl_seq_cpy(blk.data, a+a_len, b_len);
1192 isl_seq_cpy(blk.data+b_len, a, a_len);
1193 isl_seq_cpy(a, blk.data, b_len+a_len);
1196 struct isl_basic_set *isl_basic_set_swap_vars(
1197 struct isl_basic_set *bset, unsigned n)
1207 nparam = isl_basic_set_n_param(bset);
1208 dim = isl_basic_set_n_dim(bset);
1209 isl_assert(bset->ctx, n <= dim, goto error);
1214 bset = isl_basic_set_cow(bset);
1218 blk = isl_blk_alloc(bset->ctx, dim);
1219 if (isl_blk_is_error(blk))
1222 for (i = 0; i < bset->n_eq; ++i)
1224 bset->eq[i]+1+nparam, n, dim - n);
1226 for (i = 0; i < bset->n_ineq; ++i)
1228 bset->ineq[i]+1+nparam, n, dim - n);
1230 for (i = 0; i < bset->n_div; ++i)
1232 bset->div[i]+1+1+nparam, n, dim - n);
1234 isl_blk_free(bset->ctx, blk);
1236 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1237 return isl_basic_set_gauss(bset, NULL);
1239 isl_basic_set_free(bset);
1243 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1246 set = isl_set_cow(set);
1250 for (i = 0; i < set->n; ++i) {
1251 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1257 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1261 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1267 total = isl_basic_map_total_dim(bmap);
1268 isl_basic_map_free_div(bmap, bmap->n_div);
1269 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1271 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1273 i = isl_basic_map_alloc_equality(bmap);
1277 isl_int_set_si(bmap->eq[i][0], 1);
1278 isl_seq_clr(bmap->eq[i]+1, total);
1279 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1280 isl_vec_free(bmap->sample);
1281 bmap->sample = NULL;
1282 return isl_basic_map_finalize(bmap);
1284 isl_basic_map_free(bmap);
1288 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1290 return (struct isl_basic_set *)
1291 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1294 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1297 unsigned off = isl_dim_total(bmap->dim);
1298 isl_int *t = bmap->div[a];
1299 bmap->div[a] = bmap->div[b];
1302 for (i = 0; i < bmap->n_eq; ++i)
1303 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1305 for (i = 0; i < bmap->n_ineq; ++i)
1306 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1308 for (i = 0; i < bmap->n_div; ++i)
1309 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1310 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1313 /* Eliminate the specified n dimensions starting at first from the
1314 * constraints using Fourier-Motzkin. The dimensions themselves
1317 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1318 enum isl_dim_type type, unsigned first, unsigned n)
1327 map = isl_map_cow(map);
1330 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1331 first += pos(map->dim, type) - 1;
1333 for (i = 0; i < map->n; ++i) {
1334 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1344 /* Eliminate the specified n dimensions starting at first from the
1345 * constraints using Fourier-Motzkin. The dimensions themselves
1348 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1349 enum isl_dim_type type, unsigned first, unsigned n)
1351 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1354 /* Eliminate the specified n dimensions starting at first from the
1355 * constraints using Fourier-Motzkin. The dimensions themselves
1358 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1359 unsigned first, unsigned n)
1361 return isl_set_eliminate(set, isl_dim_set, first, n);
1364 /* Project out n dimensions starting at first using Fourier-Motzkin */
1365 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1366 unsigned first, unsigned n)
1368 set = isl_set_eliminate_dims(set, first, n);
1369 set = isl_set_drop_dims(set, first, n);
1373 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1375 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1383 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1392 set = isl_set_cow(set);
1396 for (i = 0; i < set->n; ++i) {
1397 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1407 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1408 enum isl_dim_type type, unsigned first, unsigned n)
1412 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1416 bmap = isl_basic_map_eliminate_vars(bmap,
1417 isl_basic_map_offset(bmap, type) - 1 + first, n);
1420 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1422 bmap = isl_basic_map_drop(bmap, type, first, n);
1425 isl_basic_map_free(bmap);
1429 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1430 enum isl_dim_type type, unsigned first, unsigned n)
1432 return (isl_basic_set *)
1433 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1436 struct isl_map *isl_map_remove(struct isl_map *map,
1437 enum isl_dim_type type, unsigned first, unsigned n)
1444 map = isl_map_cow(map);
1447 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1449 for (i = 0; i < map->n; ++i) {
1450 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1451 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1455 map = isl_map_drop(map, type, first, n);
1462 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1463 enum isl_dim_type type, unsigned first, unsigned n)
1465 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1468 /* Project out n inputs starting at first using Fourier-Motzkin */
1469 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1470 unsigned first, unsigned n)
1472 return isl_map_remove(map, isl_dim_in, first, n);
1475 /* Project out n dimensions starting at first using Fourier-Motzkin */
1476 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1477 unsigned first, unsigned n)
1479 unsigned nparam = isl_basic_set_n_param(bset);
1480 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1481 bset = isl_basic_set_drop_dims(bset, first, n);
1485 static void dump_term(struct isl_basic_map *bmap,
1486 isl_int c, int pos, FILE *out)
1489 unsigned in = isl_basic_map_n_in(bmap);
1490 unsigned dim = in + isl_basic_map_n_out(bmap);
1491 unsigned nparam = isl_basic_map_n_param(bmap);
1493 isl_int_print(out, c, 0);
1495 if (!isl_int_is_one(c))
1496 isl_int_print(out, c, 0);
1497 if (pos < 1 + nparam) {
1498 name = isl_dim_get_name(bmap->dim,
1499 isl_dim_param, pos - 1);
1501 fprintf(out, "%s", name);
1503 fprintf(out, "p%d", pos - 1);
1504 } else if (pos < 1 + nparam + in)
1505 fprintf(out, "i%d", pos - 1 - nparam);
1506 else if (pos < 1 + nparam + dim)
1507 fprintf(out, "o%d", pos - 1 - nparam - in);
1509 fprintf(out, "e%d", pos - 1 - nparam - dim);
1513 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1514 int sign, FILE *out)
1518 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1522 for (i = 0, first = 1; i < len; ++i) {
1523 if (isl_int_sgn(c[i]) * sign <= 0)
1526 fprintf(out, " + ");
1528 isl_int_abs(v, c[i]);
1529 dump_term(bmap, v, i, out);
1536 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1537 const char *op, FILE *out, int indent)
1541 fprintf(out, "%*s", indent, "");
1543 dump_constraint_sign(bmap, c, 1, out);
1544 fprintf(out, " %s ", op);
1545 dump_constraint_sign(bmap, c, -1, out);
1549 for (i = bmap->n_div; i < bmap->extra; ++i) {
1550 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1552 fprintf(out, "%*s", indent, "");
1553 fprintf(out, "ERROR: unused div coefficient not zero\n");
1558 static void dump_constraints(struct isl_basic_map *bmap,
1559 isl_int **c, unsigned n,
1560 const char *op, FILE *out, int indent)
1564 for (i = 0; i < n; ++i)
1565 dump_constraint(bmap, c[i], op, out, indent);
1568 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1572 unsigned total = isl_basic_map_total_dim(bmap);
1574 for (j = 0; j < 1 + total; ++j) {
1575 if (isl_int_is_zero(exp[j]))
1577 if (!first && isl_int_is_pos(exp[j]))
1579 dump_term(bmap, exp[j], j, out);
1584 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1588 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1589 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1591 for (i = 0; i < bmap->n_div; ++i) {
1592 fprintf(out, "%*s", indent, "");
1593 fprintf(out, "e%d = [(", i);
1594 dump_affine(bmap, bmap->div[i]+1, out);
1596 isl_int_print(out, bmap->div[i][0], 0);
1597 fprintf(out, "]\n");
1601 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1604 fprintf(out, "null basic set\n");
1608 fprintf(out, "%*s", indent, "");
1609 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1610 bset->ref, bset->dim->nparam, bset->dim->n_out,
1611 bset->extra, bset->flags);
1612 dump((struct isl_basic_map *)bset, out, indent);
1615 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1618 fprintf(out, "null basic map\n");
1622 fprintf(out, "%*s", indent, "");
1623 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1624 "flags: %x, n_name: %d\n",
1626 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1627 bmap->extra, bmap->flags, bmap->dim->n_name);
1628 dump(bmap, out, indent);
1631 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1636 total = isl_basic_map_total_dim(bmap);
1637 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1638 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1639 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1640 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1644 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1646 struct isl_set *set;
1650 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1651 isl_assert(dim->ctx, n >= 0, return NULL);
1652 set = isl_alloc(dim->ctx, struct isl_set,
1653 sizeof(struct isl_set) +
1654 (n - 1) * sizeof(struct isl_basic_set *));
1658 set->ctx = dim->ctx;
1659 isl_ctx_ref(set->ctx);
1671 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1672 unsigned nparam, unsigned dim, int n, unsigned flags)
1674 struct isl_set *set;
1675 struct isl_dim *dims;
1677 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1681 set = isl_set_alloc_dim(dims, n, flags);
1685 /* Make sure "map" has room for at least "n" more basic maps.
1687 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1690 struct isl_map *grown = NULL;
1694 isl_assert(map->ctx, n >= 0, goto error);
1695 if (map->n + n <= map->size)
1697 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1700 for (i = 0; i < map->n; ++i) {
1701 grown->p[i] = isl_basic_map_copy(map->p[i]);
1709 isl_map_free(grown);
1714 /* Make sure "set" has room for at least "n" more basic sets.
1716 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1718 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1721 struct isl_set *isl_set_dup(struct isl_set *set)
1724 struct isl_set *dup;
1729 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1732 for (i = 0; i < set->n; ++i)
1733 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1737 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1739 struct isl_set *set;
1744 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1746 isl_basic_set_free(bset);
1749 return isl_set_add_basic_set(set, bset);
1752 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1754 struct isl_map *map;
1759 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1761 isl_basic_map_free(bmap);
1764 return isl_map_add_basic_map(map, bmap);
1767 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1768 __isl_take isl_basic_set *bset)
1770 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1771 (struct isl_basic_map *)bset);
1774 void isl_set_free(struct isl_set *set)
1784 isl_ctx_deref(set->ctx);
1785 for (i = 0; i < set->n; ++i)
1786 isl_basic_set_free(set->p[i]);
1787 isl_dim_free(set->dim);
1791 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1796 fprintf(out, "null set\n");
1800 fprintf(out, "%*s", indent, "");
1801 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1802 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1804 for (i = 0; i < set->n; ++i) {
1805 fprintf(out, "%*s", indent, "");
1806 fprintf(out, "basic set %d:\n", i);
1807 isl_basic_set_dump(set->p[i], out, indent+4);
1811 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1816 fprintf(out, "null map\n");
1820 fprintf(out, "%*s", indent, "");
1821 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1822 "flags: %x, n_name: %d\n",
1823 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1824 map->dim->n_out, map->flags, map->dim->n_name);
1825 for (i = 0; i < map->n; ++i) {
1826 fprintf(out, "%*s", indent, "");
1827 fprintf(out, "basic map %d:\n", i);
1828 isl_basic_map_dump(map->p[i], out, indent+4);
1832 struct isl_basic_map *isl_basic_map_intersect_domain(
1833 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1835 struct isl_basic_map *bmap_domain;
1836 struct isl_dim *dim;
1841 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1842 bset->dim, isl_dim_param), goto error);
1844 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1845 isl_assert(bset->ctx,
1846 isl_basic_map_compatible_domain(bmap, bset), goto error);
1848 bmap = isl_basic_map_cow(bmap);
1851 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1852 bset->n_div, bset->n_eq, bset->n_ineq);
1853 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1854 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1855 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1857 bmap = isl_basic_map_simplify(bmap);
1858 return isl_basic_map_finalize(bmap);
1860 isl_basic_map_free(bmap);
1861 isl_basic_set_free(bset);
1865 struct isl_basic_map *isl_basic_map_intersect_range(
1866 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1868 struct isl_basic_map *bmap_range;
1873 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1874 bset->dim, isl_dim_param), goto error);
1876 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1877 isl_assert(bset->ctx,
1878 isl_basic_map_compatible_range(bmap, bset), goto error);
1880 bmap = isl_basic_map_cow(bmap);
1883 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1884 bset->n_div, bset->n_eq, bset->n_ineq);
1885 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1886 bmap = add_constraints(bmap, bmap_range, 0, 0);
1888 bmap = isl_basic_map_simplify(bmap);
1889 return isl_basic_map_finalize(bmap);
1891 isl_basic_map_free(bmap);
1892 isl_basic_set_free(bset);
1896 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1902 total = 1 + isl_basic_map_total_dim(bmap);
1903 if (total != vec->size)
1908 for (i = 0; i < bmap->n_eq; ++i) {
1909 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1910 if (!isl_int_is_zero(s)) {
1916 for (i = 0; i < bmap->n_ineq; ++i) {
1917 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1918 if (isl_int_is_neg(s)) {
1929 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1931 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1934 struct isl_basic_map *isl_basic_map_intersect(
1935 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1937 struct isl_vec *sample = NULL;
1939 if (!bmap1 || !bmap2)
1942 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1943 bmap2->dim, isl_dim_param), goto error);
1944 if (isl_dim_total(bmap1->dim) ==
1945 isl_dim_size(bmap1->dim, isl_dim_param) &&
1946 isl_dim_total(bmap2->dim) !=
1947 isl_dim_size(bmap2->dim, isl_dim_param))
1948 return isl_basic_map_intersect(bmap2, bmap1);
1950 if (isl_dim_total(bmap2->dim) !=
1951 isl_dim_size(bmap2->dim, isl_dim_param))
1952 isl_assert(bmap1->ctx,
1953 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1955 if (bmap1->sample &&
1956 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1957 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1958 sample = isl_vec_copy(bmap1->sample);
1959 else if (bmap2->sample &&
1960 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1961 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1962 sample = isl_vec_copy(bmap2->sample);
1964 bmap1 = isl_basic_map_cow(bmap1);
1967 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1968 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1969 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1972 isl_vec_free(sample);
1974 isl_vec_free(bmap1->sample);
1975 bmap1->sample = sample;
1978 bmap1 = isl_basic_map_simplify(bmap1);
1979 return isl_basic_map_finalize(bmap1);
1982 isl_vec_free(sample);
1983 isl_basic_map_free(bmap1);
1984 isl_basic_map_free(bmap2);
1988 struct isl_basic_set *isl_basic_set_intersect(
1989 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1991 return (struct isl_basic_set *)
1992 isl_basic_map_intersect(
1993 (struct isl_basic_map *)bset1,
1994 (struct isl_basic_map *)bset2);
1997 /* Special case of isl_map_intersect, where both map1 and map2
1998 * are convex, without any divs and such that either map1 or map2
1999 * contains a single constraint. This constraint is then simply
2000 * added to the other map.
2002 static __isl_give isl_map *map_intersect_add_constraint(
2003 __isl_take isl_map *map1, __isl_take isl_map *map2)
2005 struct isl_basic_map *bmap1;
2006 struct isl_basic_map *bmap2;
2008 isl_assert(map1->ctx, map1->n == 1, goto error);
2009 isl_assert(map2->ctx, map1->n == 1, goto error);
2010 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2011 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2013 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2014 return isl_map_intersect(map2, map1);
2016 isl_assert(map2->ctx,
2017 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2019 map1 = isl_map_cow(map1);
2022 if (isl_map_fast_is_empty(map1)) {
2026 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2027 if (map2->p[0]->n_eq == 1)
2028 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2030 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2031 map2->p[0]->ineq[0]);
2033 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2034 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2038 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2039 isl_basic_map_free(map1->p[0]);
2052 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2055 struct isl_map *result;
2061 if (isl_map_fast_is_empty(map1)) {
2065 if (isl_map_fast_is_empty(map2)) {
2070 if (map1->n == 1 && map2->n == 1 &&
2071 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2072 isl_dim_equal(map1->dim, map2->dim) &&
2073 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2074 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2075 return map_intersect_add_constraint(map1, map2);
2076 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2077 map2->dim, isl_dim_param), goto error);
2078 if (isl_dim_total(map1->dim) ==
2079 isl_dim_size(map1->dim, isl_dim_param) &&
2080 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2081 return isl_map_intersect(map2, map1);
2083 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2084 isl_assert(map1->ctx,
2085 isl_dim_equal(map1->dim, map2->dim), goto error);
2087 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2088 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2089 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2091 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2092 map1->n * map2->n, flags);
2095 for (i = 0; i < map1->n; ++i)
2096 for (j = 0; j < map2->n; ++j) {
2097 struct isl_basic_map *part;
2098 part = isl_basic_map_intersect(
2099 isl_basic_map_copy(map1->p[i]),
2100 isl_basic_map_copy(map2->p[j]));
2101 if (isl_basic_map_is_empty(part))
2102 isl_basic_map_free(part);
2104 result = isl_map_add_basic_map(result, part);
2117 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2119 return (struct isl_set *)
2120 isl_map_intersect((struct isl_map *)set1,
2121 (struct isl_map *)set2);
2124 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2126 struct isl_dim *dim;
2127 struct isl_basic_set *bset;
2132 bmap = isl_basic_map_cow(bmap);
2135 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2136 in = isl_basic_map_n_in(bmap);
2137 bset = isl_basic_set_from_basic_map(bmap);
2138 bset = isl_basic_set_swap_vars(bset, in);
2139 return isl_basic_map_from_basic_set(bset, dim);
2142 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2143 enum isl_dim_type type, unsigned pos, unsigned n)
2145 struct isl_dim *res_dim;
2146 struct isl_basic_map *res;
2147 struct isl_dim_map *dim_map;
2148 unsigned total, off;
2149 enum isl_dim_type t;
2157 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2159 total = isl_basic_map_total_dim(bmap) + n;
2160 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2162 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2164 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2166 unsigned size = isl_basic_map_dim(bmap, t);
2167 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2169 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2170 pos, size - pos, off + pos + n);
2172 off += isl_dim_size(res_dim, t);
2174 isl_dim_map_div(dim_map, bmap, off);
2176 res = isl_basic_map_alloc_dim(res_dim,
2177 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2178 res = add_constraints_dim_map(res, bmap, dim_map);
2179 res = isl_basic_map_simplify(res);
2180 return isl_basic_map_finalize(res);
2183 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2184 enum isl_dim_type type, unsigned n)
2188 return isl_basic_map_insert(bmap, type,
2189 isl_basic_map_dim(bmap, type), n);
2192 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2193 enum isl_dim_type type, unsigned n)
2197 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2198 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2200 isl_basic_set_free(bset);
2204 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2205 enum isl_dim_type type, unsigned pos, unsigned n)
2212 map = isl_map_cow(map);
2216 map->dim = isl_dim_insert(map->dim, type, pos, n);
2220 for (i = 0; i < map->n; ++i) {
2221 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2232 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2233 enum isl_dim_type type, unsigned pos, unsigned n)
2235 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2238 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2239 enum isl_dim_type type, unsigned n)
2243 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2246 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2247 enum isl_dim_type type, unsigned n)
2251 isl_assert(set->ctx, type != isl_dim_in, goto error);
2252 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2258 __isl_give isl_basic_map *isl_basic_map_move_dims(
2259 __isl_take isl_basic_map *bmap,
2260 enum isl_dim_type dst_type, unsigned dst_pos,
2261 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2264 struct isl_dim_map *dim_map;
2265 struct isl_basic_map *res;
2266 enum isl_dim_type t;
2267 unsigned total, off;
2274 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2277 if (dst_type == src_type && dst_pos == src_pos)
2280 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2282 if (pos(bmap->dim, dst_type) + dst_pos ==
2283 pos(bmap->dim, src_type) + src_pos +
2284 ((src_type < dst_type) ? n : 0)) {
2285 bmap = isl_basic_map_cow(bmap);
2289 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2290 src_type, src_pos, n);
2294 bmap = isl_basic_map_finalize(bmap);
2299 total = isl_basic_map_total_dim(bmap);
2300 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2303 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2304 unsigned size = isl_dim_size(bmap->dim, t);
2305 if (t == dst_type) {
2306 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2309 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2312 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2313 dst_pos, size - dst_pos, off);
2314 off += size - dst_pos;
2315 } else if (t == src_type) {
2316 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2319 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2320 src_pos + n, size - src_pos - n, off);
2321 off += size - src_pos - n;
2323 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2327 isl_dim_map_div(dim_map, bmap, off);
2329 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2330 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2331 bmap = add_constraints_dim_map(res, bmap, dim_map);
2333 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2334 src_type, src_pos, n);
2338 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2339 bmap = isl_basic_map_gauss(bmap, NULL);
2340 bmap = isl_basic_map_finalize(bmap);
2344 isl_basic_map_free(bmap);
2348 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2349 enum isl_dim_type dst_type, unsigned dst_pos,
2350 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2352 return (isl_basic_set *)isl_basic_map_move_dims(
2353 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2356 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2357 enum isl_dim_type dst_type, unsigned dst_pos,
2358 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2362 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2363 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2364 src_type, src_pos, n);
2370 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2371 enum isl_dim_type dst_type, unsigned dst_pos,
2372 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2381 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2384 if (dst_type == src_type && dst_pos == src_pos)
2387 isl_assert(map->ctx, dst_type != src_type, goto error);
2389 map = isl_map_cow(map);
2393 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2397 for (i = 0; i < map->n; ++i) {
2398 map->p[i] = isl_basic_map_move_dims(map->p[i],
2400 src_type, src_pos, n);
2411 /* Move the specified dimensions to the last columns right before
2412 * the divs. Don't change the dimension specification of bmap.
2413 * That's the responsibility of the caller.
2415 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2416 enum isl_dim_type type, unsigned first, unsigned n)
2418 struct isl_dim_map *dim_map;
2419 struct isl_basic_map *res;
2420 enum isl_dim_type t;
2421 unsigned total, off;
2425 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2428 total = isl_basic_map_total_dim(bmap);
2429 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2432 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2433 unsigned size = isl_dim_size(bmap->dim, t);
2435 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2438 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2439 first, n, total - bmap->n_div - n);
2440 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2441 first + n, size - (first + n), off);
2442 off += size - (first + n);
2444 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2448 isl_dim_map_div(dim_map, bmap, off + n);
2450 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2451 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2452 res = add_constraints_dim_map(res, bmap, dim_map);
2456 /* Turn the n dimensions of type type, starting at first
2457 * into existentially quantified variables.
2459 __isl_give isl_basic_map *isl_basic_map_project_out(
2460 __isl_take isl_basic_map *bmap,
2461 enum isl_dim_type type, unsigned first, unsigned n)
2474 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2475 return isl_basic_map_remove(bmap, type, first, n);
2477 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2480 bmap = move_last(bmap, type, first, n);
2481 bmap = isl_basic_map_cow(bmap);
2485 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2486 old = bmap->block2.data;
2487 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2488 (bmap->extra + n) * (1 + row_size));
2489 if (!bmap->block2.data)
2491 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2494 for (i = 0; i < n; ++i) {
2495 new_div[i] = bmap->block2.data +
2496 (bmap->extra + i) * (1 + row_size);
2497 isl_seq_clr(new_div[i], 1 + row_size);
2499 for (i = 0; i < bmap->extra; ++i)
2500 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2502 bmap->div = new_div;
2506 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2509 bmap = isl_basic_map_simplify(bmap);
2510 bmap = isl_basic_map_drop_redundant_divs(bmap);
2511 return isl_basic_map_finalize(bmap);
2513 isl_basic_map_free(bmap);
2517 /* Turn the n dimensions of type type, starting at first
2518 * into existentially quantified variables.
2520 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2521 enum isl_dim_type type, unsigned first, unsigned n)
2523 return (isl_basic_set *)isl_basic_map_project_out(
2524 (isl_basic_map *)bset, type, first, n);
2527 /* Turn the n dimensions of type type, starting at first
2528 * into existentially quantified variables.
2530 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2531 enum isl_dim_type type, unsigned first, unsigned n)
2541 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2543 map = isl_map_cow(map);
2547 map->dim = isl_dim_drop(map->dim, type, first, n);
2551 for (i = 0; i < map->n; ++i) {
2552 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2563 /* Turn the n dimensions of type type, starting at first
2564 * into existentially quantified variables.
2566 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2567 enum isl_dim_type type, unsigned first, unsigned n)
2569 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2572 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2576 for (i = 0; i < n; ++i) {
2577 j = isl_basic_map_alloc_div(bmap);
2580 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2584 isl_basic_map_free(bmap);
2588 struct isl_basic_map *isl_basic_map_apply_range(
2589 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2591 struct isl_dim *dim_result = NULL;
2592 struct isl_basic_map *bmap;
2593 unsigned n_in, n_out, n, nparam, total, pos;
2594 struct isl_dim_map *dim_map1, *dim_map2;
2596 if (!bmap1 || !bmap2)
2599 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2600 isl_dim_copy(bmap2->dim));
2602 n_in = isl_basic_map_n_in(bmap1);
2603 n_out = isl_basic_map_n_out(bmap2);
2604 n = isl_basic_map_n_out(bmap1);
2605 nparam = isl_basic_map_n_param(bmap1);
2607 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2608 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2609 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2610 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2611 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2612 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2613 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2614 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2615 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2616 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2617 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2619 bmap = isl_basic_map_alloc_dim(dim_result,
2620 bmap1->n_div + bmap2->n_div + n,
2621 bmap1->n_eq + bmap2->n_eq,
2622 bmap1->n_ineq + bmap2->n_ineq);
2623 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2624 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2625 bmap = add_divs(bmap, n);
2626 bmap = isl_basic_map_simplify(bmap);
2627 bmap = isl_basic_map_drop_redundant_divs(bmap);
2628 return isl_basic_map_finalize(bmap);
2630 isl_basic_map_free(bmap1);
2631 isl_basic_map_free(bmap2);
2635 struct isl_basic_set *isl_basic_set_apply(
2636 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2641 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2644 return (struct isl_basic_set *)
2645 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2647 isl_basic_set_free(bset);
2648 isl_basic_map_free(bmap);
2652 struct isl_basic_map *isl_basic_map_apply_domain(
2653 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2655 if (!bmap1 || !bmap2)
2658 isl_assert(bmap1->ctx,
2659 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2660 isl_assert(bmap1->ctx,
2661 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2664 bmap1 = isl_basic_map_reverse(bmap1);
2665 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2666 return isl_basic_map_reverse(bmap1);
2668 isl_basic_map_free(bmap1);
2669 isl_basic_map_free(bmap2);
2673 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2674 * A \cap B -> f(A) + f(B)
2676 struct isl_basic_map *isl_basic_map_sum(
2677 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2679 unsigned n_in, n_out, nparam, total, pos;
2680 struct isl_basic_map *bmap = NULL;
2681 struct isl_dim_map *dim_map1, *dim_map2;
2684 if (!bmap1 || !bmap2)
2687 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2690 nparam = isl_basic_map_n_param(bmap1);
2691 n_in = isl_basic_map_n_in(bmap1);
2692 n_out = isl_basic_map_n_out(bmap1);
2694 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2695 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2696 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2697 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2698 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2699 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2700 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2701 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2702 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2703 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2704 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2706 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2707 bmap1->n_div + bmap2->n_div + 2 * n_out,
2708 bmap1->n_eq + bmap2->n_eq + n_out,
2709 bmap1->n_ineq + bmap2->n_ineq);
2710 for (i = 0; i < n_out; ++i) {
2711 int j = isl_basic_map_alloc_equality(bmap);
2714 isl_seq_clr(bmap->eq[j], 1+total);
2715 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2716 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2717 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2719 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2720 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2721 bmap = add_divs(bmap, 2 * n_out);
2723 bmap = isl_basic_map_simplify(bmap);
2724 return isl_basic_map_finalize(bmap);
2726 isl_basic_map_free(bmap);
2727 isl_basic_map_free(bmap1);
2728 isl_basic_map_free(bmap2);
2732 /* Given two maps A -> f(A) and B -> g(B), construct a map
2733 * A \cap B -> f(A) + f(B)
2735 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2737 struct isl_map *result;
2743 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2745 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2746 map1->n * map2->n, 0);
2749 for (i = 0; i < map1->n; ++i)
2750 for (j = 0; j < map2->n; ++j) {
2751 struct isl_basic_map *part;
2752 part = isl_basic_map_sum(
2753 isl_basic_map_copy(map1->p[i]),
2754 isl_basic_map_copy(map2->p[j]));
2755 if (isl_basic_map_is_empty(part))
2756 isl_basic_map_free(part);
2758 result = isl_map_add_basic_map(result, part);
2771 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2772 __isl_take isl_set *set2)
2774 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2777 /* Given a basic map A -> f(A), construct A -> -f(A).
2779 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2784 bmap = isl_basic_map_cow(bmap);
2788 n = isl_basic_map_dim(bmap, isl_dim_out);
2789 off = isl_basic_map_offset(bmap, isl_dim_out);
2790 for (i = 0; i < bmap->n_eq; ++i)
2791 for (j = 0; j < n; ++j)
2792 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2793 for (i = 0; i < bmap->n_ineq; ++i)
2794 for (j = 0; j < n; ++j)
2795 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2796 for (i = 0; i < bmap->n_div; ++i)
2797 for (j = 0; j < n; ++j)
2798 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2799 return isl_basic_map_finalize(bmap);
2802 /* Given a map A -> f(A), construct A -> -f(A).
2804 struct isl_map *isl_map_neg(struct isl_map *map)
2808 map = isl_map_cow(map);
2812 for (i = 0; i < map->n; ++i) {
2813 map->p[i] = isl_basic_map_neg(map->p[i]);
2824 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2826 return (isl_set *)isl_map_neg((isl_map *)set);
2829 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2830 * A -> floor(f(A)/d).
2832 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2835 unsigned n_in, n_out, nparam, total, pos;
2836 struct isl_basic_map *result = NULL;
2837 struct isl_dim_map *dim_map;
2843 nparam = isl_basic_map_n_param(bmap);
2844 n_in = isl_basic_map_n_in(bmap);
2845 n_out = isl_basic_map_n_out(bmap);
2847 total = nparam + n_in + n_out + bmap->n_div + n_out;
2848 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2849 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2850 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2851 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2852 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2854 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2855 bmap->n_div + n_out,
2856 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2857 result = add_constraints_dim_map(result, bmap, dim_map);
2858 result = add_divs(result, n_out);
2859 for (i = 0; i < n_out; ++i) {
2861 j = isl_basic_map_alloc_inequality(result);
2864 isl_seq_clr(result->ineq[j], 1+total);
2865 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2866 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2867 j = isl_basic_map_alloc_inequality(result);
2870 isl_seq_clr(result->ineq[j], 1+total);
2871 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2872 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2873 isl_int_sub_ui(result->ineq[j][0], d, 1);
2876 result = isl_basic_map_simplify(result);
2877 return isl_basic_map_finalize(result);
2879 isl_basic_map_free(result);
2883 /* Given a map A -> f(A) and an integer d, construct a map
2884 * A -> floor(f(A)/d).
2886 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2890 map = isl_map_cow(map);
2894 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2895 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2896 for (i = 0; i < map->n; ++i) {
2897 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2908 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2914 i = isl_basic_map_alloc_equality(bmap);
2917 nparam = isl_basic_map_n_param(bmap);
2918 n_in = isl_basic_map_n_in(bmap);
2919 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2920 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2921 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2922 return isl_basic_map_finalize(bmap);
2924 isl_basic_map_free(bmap);
2928 /* Add a constraints to "bmap" expressing i_pos < o_pos
2930 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2936 i = isl_basic_map_alloc_inequality(bmap);
2939 nparam = isl_basic_map_n_param(bmap);
2940 n_in = isl_basic_map_n_in(bmap);
2941 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2942 isl_int_set_si(bmap->ineq[i][0], -1);
2943 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2944 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2945 return isl_basic_map_finalize(bmap);
2947 isl_basic_map_free(bmap);
2951 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2953 static __isl_give isl_basic_map *var_less_or_equal(
2954 __isl_take isl_basic_map *bmap, unsigned pos)
2960 i = isl_basic_map_alloc_inequality(bmap);
2963 nparam = isl_basic_map_n_param(bmap);
2964 n_in = isl_basic_map_n_in(bmap);
2965 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2966 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2967 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2968 return isl_basic_map_finalize(bmap);
2970 isl_basic_map_free(bmap);
2974 /* Add a constraints to "bmap" expressing i_pos > o_pos
2976 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2982 i = isl_basic_map_alloc_inequality(bmap);
2985 nparam = isl_basic_map_n_param(bmap);
2986 n_in = isl_basic_map_n_in(bmap);
2987 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2988 isl_int_set_si(bmap->ineq[i][0], -1);
2989 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2990 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2991 return isl_basic_map_finalize(bmap);
2993 isl_basic_map_free(bmap);
2997 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2999 static __isl_give isl_basic_map *var_more_or_equal(
3000 __isl_take isl_basic_map *bmap, unsigned pos)
3006 i = isl_basic_map_alloc_inequality(bmap);
3009 nparam = isl_basic_map_n_param(bmap);
3010 n_in = isl_basic_map_n_in(bmap);
3011 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3012 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3013 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3014 return isl_basic_map_finalize(bmap);
3016 isl_basic_map_free(bmap);
3020 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3023 struct isl_basic_map *bmap;
3024 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3027 for (i = 0; i < n_equal && bmap; ++i)
3028 bmap = var_equal(bmap, i);
3029 return isl_basic_map_finalize(bmap);
3032 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3034 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3037 struct isl_basic_map *bmap;
3038 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3041 for (i = 0; i < pos && bmap; ++i)
3042 bmap = var_equal(bmap, i);
3044 bmap = var_less(bmap, pos);
3045 return isl_basic_map_finalize(bmap);
3048 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3050 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3051 __isl_take isl_dim *dim, unsigned pos)
3054 isl_basic_map *bmap;
3056 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3057 for (i = 0; i < pos; ++i)
3058 bmap = var_equal(bmap, i);
3059 bmap = var_less_or_equal(bmap, pos);
3060 return isl_basic_map_finalize(bmap);
3063 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3065 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3068 struct isl_basic_map *bmap;
3069 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3072 for (i = 0; i < pos && bmap; ++i)
3073 bmap = var_equal(bmap, i);
3075 bmap = var_more(bmap, pos);
3076 return isl_basic_map_finalize(bmap);
3079 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3081 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3082 __isl_take isl_dim *dim, unsigned pos)
3085 isl_basic_map *bmap;
3087 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3088 for (i = 0; i < pos; ++i)
3089 bmap = var_equal(bmap, i);
3090 bmap = var_more_or_equal(bmap, pos);
3091 return isl_basic_map_finalize(bmap);
3094 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3095 unsigned n, int equal)
3097 struct isl_map *map;
3100 if (n == 0 && equal)
3101 return isl_map_universe(dims);
3103 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3105 for (i = 0; i + 1 < n; ++i)
3106 map = isl_map_add_basic_map(map,
3107 isl_basic_map_less_at(isl_dim_copy(dims), i));
3110 map = isl_map_add_basic_map(map,
3111 isl_basic_map_less_or_equal_at(dims, n - 1));
3113 map = isl_map_add_basic_map(map,
3114 isl_basic_map_less_at(dims, n - 1));
3121 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3125 return map_lex_lte_first(dims, dims->n_out, equal);
3128 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3130 return map_lex_lte_first(dim, n, 0);
3133 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3135 return map_lex_lte_first(dim, n, 1);
3138 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3140 return map_lex_lte(isl_dim_map(set_dim), 0);
3143 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3145 return map_lex_lte(isl_dim_map(set_dim), 1);
3148 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3149 unsigned n, int equal)
3151 struct isl_map *map;
3154 if (n == 0 && equal)
3155 return isl_map_universe(dims);
3157 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3159 for (i = 0; i + 1 < n; ++i)
3160 map = isl_map_add_basic_map(map,
3161 isl_basic_map_more_at(isl_dim_copy(dims), i));
3164 map = isl_map_add_basic_map(map,
3165 isl_basic_map_more_or_equal_at(dims, n - 1));
3167 map = isl_map_add_basic_map(map,
3168 isl_basic_map_more_at(dims, n - 1));
3175 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3179 return map_lex_gte_first(dims, dims->n_out, equal);
3182 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3184 return map_lex_gte_first(dim, n, 0);
3187 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3189 return map_lex_gte_first(dim, n, 1);
3192 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3194 return map_lex_gte(isl_dim_map(set_dim), 0);
3197 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3199 return map_lex_gte(isl_dim_map(set_dim), 1);
3202 struct isl_basic_map *isl_basic_map_from_basic_set(
3203 struct isl_basic_set *bset, struct isl_dim *dim)
3205 struct isl_basic_map *bmap;
3207 bset = isl_basic_set_cow(bset);
3211 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3212 isl_dim_free(bset->dim);
3213 bmap = (struct isl_basic_map *) bset;
3215 return isl_basic_map_finalize(bmap);
3217 isl_basic_set_free(bset);
3222 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3226 if (bmap->dim->n_in == 0)
3227 return (struct isl_basic_set *)bmap;
3228 bmap = isl_basic_map_cow(bmap);
3231 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3234 bmap = isl_basic_map_finalize(bmap);
3235 return (struct isl_basic_set *)bmap;
3237 isl_basic_map_free(bmap);
3241 /* For a div d = floor(f/m), add the constraints
3244 * -(f-(n-1)) + m d >= 0
3246 * Note that the second constraint is the negation of
3250 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3251 unsigned pos, isl_int *div)
3254 unsigned total = isl_basic_map_total_dim(bmap);
3256 i = isl_basic_map_alloc_inequality(bmap);
3259 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3260 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3262 j = isl_basic_map_alloc_inequality(bmap);
3265 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3266 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3267 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3271 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3272 unsigned pos, isl_int *div)
3274 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3278 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3280 unsigned total = isl_basic_map_total_dim(bmap);
3281 unsigned div_pos = total - bmap->n_div + div;
3283 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3287 struct isl_basic_set *isl_basic_map_underlying_set(
3288 struct isl_basic_map *bmap)
3292 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3293 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3294 return (struct isl_basic_set *)bmap;
3295 bmap = isl_basic_map_cow(bmap);
3298 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3301 bmap->extra -= bmap->n_div;
3303 bmap = isl_basic_map_finalize(bmap);
3304 return (struct isl_basic_set *)bmap;
3309 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3310 __isl_take isl_basic_set *bset)
3312 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3315 struct isl_basic_map *isl_basic_map_overlying_set(
3316 struct isl_basic_set *bset, struct isl_basic_map *like)
3318 struct isl_basic_map *bmap;
3319 struct isl_ctx *ctx;
3326 isl_assert(ctx, bset->n_div == 0, goto error);
3327 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3328 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3330 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3331 isl_basic_map_free(like);
3332 return (struct isl_basic_map *)bset;
3334 bset = isl_basic_set_cow(bset);
3337 total = bset->dim->n_out + bset->extra;
3338 bmap = (struct isl_basic_map *)bset;
3339 isl_dim_free(bmap->dim);
3340 bmap->dim = isl_dim_copy(like->dim);
3343 bmap->n_div = like->n_div;
3344 bmap->extra += like->n_div;
3347 ltotal = total - bmap->extra + like->extra;
3350 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3351 bmap->extra * (1 + 1 + total));
3352 if (isl_blk_is_error(bmap->block2))
3354 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3358 for (i = 0; i < bmap->extra; ++i)
3359 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3360 for (i = 0; i < like->n_div; ++i) {
3361 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3362 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3364 bmap = isl_basic_map_extend_constraints(bmap,
3365 0, 2 * like->n_div);
3366 for (i = 0; i < like->n_div; ++i) {
3367 if (isl_int_is_zero(bmap->div[i][0]))
3369 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3373 isl_basic_map_free(like);
3374 bmap = isl_basic_map_simplify(bmap);
3375 bmap = isl_basic_map_finalize(bmap);
3378 isl_basic_map_free(like);
3379 isl_basic_set_free(bset);
3383 struct isl_basic_set *isl_basic_set_from_underlying_set(
3384 struct isl_basic_set *bset, struct isl_basic_set *like)
3386 return (struct isl_basic_set *)
3387 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3390 struct isl_set *isl_set_from_underlying_set(
3391 struct isl_set *set, struct isl_basic_set *like)
3397 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3399 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3400 isl_basic_set_free(like);
3403 set = isl_set_cow(set);
3406 for (i = 0; i < set->n; ++i) {
3407 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3408 isl_basic_set_copy(like));
3412 isl_dim_free(set->dim);
3413 set->dim = isl_dim_copy(like->dim);
3416 isl_basic_set_free(like);
3419 isl_basic_set_free(like);
3424 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3428 map = isl_map_cow(map);
3431 map->dim = isl_dim_cow(map->dim);
3435 for (i = 1; i < map->n; ++i)
3436 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3438 for (i = 0; i < map->n; ++i) {
3439 map->p[i] = (struct isl_basic_map *)
3440 isl_basic_map_underlying_set(map->p[i]);
3445 map->dim = isl_dim_underlying(map->dim, 0);
3447 isl_dim_free(map->dim);
3448 map->dim = isl_dim_copy(map->p[0]->dim);
3452 return (struct isl_set *)map;
3458 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3460 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3463 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3464 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3466 bmap = isl_basic_map_cow(bmap);
3470 isl_dim_free(bmap->dim);
3473 bmap = isl_basic_map_finalize(bmap);
3477 isl_basic_map_free(bmap);
3482 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3483 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3485 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3489 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3490 __isl_take isl_dim *dim)
3494 map = isl_map_cow(map);
3498 for (i = 0; i < map->n; ++i) {
3499 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3504 isl_dim_free(map->dim);
3514 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3515 __isl_take isl_dim *dim)
3517 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3520 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3523 struct isl_basic_set *domain;
3529 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3531 n_in = isl_basic_map_n_in(bmap);
3532 n_out = isl_basic_map_n_out(bmap);
3533 domain = isl_basic_set_from_basic_map(bmap);
3534 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3536 domain = isl_basic_set_reset_dim(domain, dim);
3541 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3543 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3546 struct isl_set *isl_map_range(struct isl_map *map)
3549 struct isl_set *set;
3553 if (isl_map_dim(map, isl_dim_in) == 0)
3554 return (isl_set *)map;
3556 map = isl_map_cow(map);
3560 set = (struct isl_set *) map;
3561 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3564 for (i = 0; i < map->n; ++i) {
3565 set->p[i] = isl_basic_map_range(map->p[i]);
3569 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3570 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3577 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3580 struct isl_map *map = NULL;
3582 set = isl_set_cow(set);
3585 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3586 map = (struct isl_map *)set;
3587 for (i = 0; i < set->n; ++i) {
3588 map->p[i] = isl_basic_map_from_basic_set(
3589 set->p[i], isl_dim_copy(dim));
3593 isl_dim_free(map->dim);
3602 struct isl_map *isl_map_from_range(struct isl_set *set)
3604 return (struct isl_map *)set;
3607 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3609 return isl_map_reverse(isl_map_from_range(set));
3612 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3613 __isl_take isl_set *range)
3615 return isl_map_apply_range(isl_map_from_domain(domain),
3616 isl_map_from_range(range));
3619 struct isl_set *isl_set_from_map(struct isl_map *map)
3622 struct isl_set *set = NULL;
3626 map = isl_map_cow(map);
3629 map->dim = isl_dim_as_set_dim(map->dim);
3632 set = (struct isl_set *)map;
3633 for (i = 0; i < map->n; ++i) {
3634 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3644 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3646 struct isl_map *map;
3650 isl_assert(dim->ctx, n >= 0, return NULL);
3651 map = isl_alloc(dim->ctx, struct isl_map,
3652 sizeof(struct isl_map) +
3653 (n - 1) * sizeof(struct isl_basic_map *));
3657 map->ctx = dim->ctx;
3658 isl_ctx_ref(map->ctx);
3670 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3671 unsigned nparam, unsigned in, unsigned out, int n,
3674 struct isl_map *map;
3675 struct isl_dim *dims;
3677 dims = isl_dim_alloc(ctx, nparam, in, out);
3681 map = isl_map_alloc_dim(dims, n, flags);
3685 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3687 struct isl_basic_map *bmap;
3688 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3689 bmap = isl_basic_map_set_to_empty(bmap);
3693 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3695 struct isl_basic_set *bset;
3696 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3697 bset = isl_basic_set_set_to_empty(bset);
3701 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3703 struct isl_basic_map *bmap;
3706 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3707 bmap = isl_basic_map_set_to_empty(bmap);
3711 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3713 struct isl_basic_map *bmap;
3716 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3717 bmap = isl_basic_map_set_to_empty(bmap);
3721 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3723 struct isl_basic_set *bset;
3726 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3727 bset = isl_basic_set_set_to_empty(bset);
3731 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3733 struct isl_basic_map *bmap;
3734 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3738 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3740 struct isl_basic_set *bset;
3741 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3745 __isl_give isl_basic_map *isl_basic_map_universe_like(
3746 __isl_keep isl_basic_map *model)
3750 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3753 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3757 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3760 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3761 __isl_keep isl_set *model)
3765 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3768 struct isl_map *isl_map_empty(struct isl_dim *dim)
3770 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3773 struct isl_map *isl_map_empty_like(struct isl_map *model)
3777 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3780 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3784 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3787 struct isl_set *isl_set_empty(struct isl_dim *dim)
3789 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3792 struct isl_set *isl_set_empty_like(struct isl_set *model)
3796 return isl_set_empty(isl_dim_copy(model->dim));
3799 struct isl_map *isl_map_universe(struct isl_dim *dim)
3801 struct isl_map *map;
3804 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3805 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3809 struct isl_set *isl_set_universe(struct isl_dim *dim)
3811 struct isl_set *set;
3814 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3815 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3819 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3823 return isl_set_universe(isl_dim_copy(model->dim));
3826 struct isl_map *isl_map_dup(struct isl_map *map)
3829 struct isl_map *dup;
3833 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3834 for (i = 0; i < map->n; ++i)
3835 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3839 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3840 __isl_take isl_basic_map *bmap)
3844 if (isl_basic_map_fast_is_empty(bmap)) {
3845 isl_basic_map_free(bmap);
3848 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3849 isl_assert(map->ctx, map->n < map->size, goto error);
3850 map->p[map->n] = bmap;
3852 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3858 isl_basic_map_free(bmap);
3862 void isl_map_free(struct isl_map *map)
3872 isl_ctx_deref(map->ctx);
3873 for (i = 0; i < map->n; ++i)
3874 isl_basic_map_free(map->p[i]);
3875 isl_dim_free(map->dim);
3879 struct isl_map *isl_map_extend(struct isl_map *base,
3880 unsigned nparam, unsigned n_in, unsigned n_out)
3884 base = isl_map_cow(base);
3888 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3891 for (i = 0; i < base->n; ++i) {
3892 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3893 isl_dim_copy(base->dim), 0, 0, 0);
3903 struct isl_set *isl_set_extend(struct isl_set *base,
3904 unsigned nparam, unsigned dim)
3906 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3910 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3911 struct isl_basic_map *bmap, unsigned pos, int value)
3915 bmap = isl_basic_map_cow(bmap);
3916 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3917 j = isl_basic_map_alloc_equality(bmap);
3920 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3921 isl_int_set_si(bmap->eq[j][pos], -1);
3922 isl_int_set_si(bmap->eq[j][0], value);
3923 bmap = isl_basic_map_simplify(bmap);
3924 return isl_basic_map_finalize(bmap);
3926 isl_basic_map_free(bmap);
3930 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3931 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3935 bmap = isl_basic_map_cow(bmap);
3936 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3937 j = isl_basic_map_alloc_equality(bmap);
3940 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3941 isl_int_set_si(bmap->eq[j][pos], -1);
3942 isl_int_set(bmap->eq[j][0], value);
3943 bmap = isl_basic_map_simplify(bmap);
3944 return isl_basic_map_finalize(bmap);
3946 isl_basic_map_free(bmap);
3950 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3951 enum isl_dim_type type, unsigned pos, int value)
3955 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3956 return isl_basic_map_fix_pos_si(bmap,
3957 isl_basic_map_offset(bmap, type) + pos, value);
3959 isl_basic_map_free(bmap);
3963 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3964 enum isl_dim_type type, unsigned pos, isl_int value)
3968 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3969 return isl_basic_map_fix_pos(bmap,
3970 isl_basic_map_offset(bmap, type) + pos, value);
3972 isl_basic_map_free(bmap);
3976 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3977 enum isl_dim_type type, unsigned pos, int value)
3979 return (struct isl_basic_set *)
3980 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3984 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3985 enum isl_dim_type type, unsigned pos, isl_int value)
3987 return (struct isl_basic_set *)
3988 isl_basic_map_fix((struct isl_basic_map *)bset,
3992 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3993 unsigned input, int value)
3995 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3998 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3999 unsigned dim, int value)
4001 return (struct isl_basic_set *)
4002 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4003 isl_dim_set, dim, value);
4006 struct isl_map *isl_map_fix_si(struct isl_map *map,
4007 enum isl_dim_type type, unsigned pos, int value)
4011 map = isl_map_cow(map);
4015 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4016 for (i = 0; i < map->n; ++i) {
4017 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4021 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4028 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4029 enum isl_dim_type type, unsigned pos, int value)
4031 return (struct isl_set *)
4032 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4035 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4036 enum isl_dim_type type, unsigned pos, isl_int value)
4040 map = isl_map_cow(map);
4044 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4045 for (i = 0; i < map->n; ++i) {
4046 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4050 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4057 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4058 enum isl_dim_type type, unsigned pos, isl_int value)
4060 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4063 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4064 unsigned input, int value)
4066 return isl_map_fix_si(map, isl_dim_in, input, value);
4069 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4071 return (struct isl_set *)
4072 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4075 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4076 __isl_take isl_basic_map *bmap,
4077 enum isl_dim_type type, unsigned pos, int value)
4083 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4084 pos += isl_basic_map_offset(bmap, type);
4085 bmap = isl_basic_map_cow(bmap);
4086 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4087 j = isl_basic_map_alloc_inequality(bmap);
4090 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4091 isl_int_set_si(bmap->ineq[j][pos], 1);
4092 isl_int_set_si(bmap->ineq[j][0], -value);
4093 bmap = isl_basic_map_simplify(bmap);
4094 return isl_basic_map_finalize(bmap);
4096 isl_basic_map_free(bmap);
4100 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4101 unsigned dim, isl_int value)
4105 bset = isl_basic_set_cow(bset);
4106 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4107 j = isl_basic_set_alloc_inequality(bset);
4110 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4111 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4112 isl_int_neg(bset->ineq[j][0], value);
4113 bset = isl_basic_set_simplify(bset);
4114 return isl_basic_set_finalize(bset);
4116 isl_basic_set_free(bset);
4120 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4121 enum isl_dim_type type, unsigned pos, int value)
4125 map = isl_map_cow(map);
4129 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4130 for (i = 0; i < map->n; ++i) {
4131 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4136 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4143 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4144 enum isl_dim_type type, unsigned pos, int value)
4146 return (struct isl_set *)
4147 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4150 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4155 set = isl_set_cow(set);
4159 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4160 for (i = 0; i < set->n; ++i) {
4161 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4171 struct isl_map *isl_map_reverse(struct isl_map *map)
4175 map = isl_map_cow(map);
4179 map->dim = isl_dim_reverse(map->dim);
4182 for (i = 0; i < map->n; ++i) {
4183 map->p[i] = isl_basic_map_reverse(map->p[i]);
4187 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4194 static struct isl_map *isl_basic_map_partial_lexopt(
4195 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4196 struct isl_set **empty, int max)
4200 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4201 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4203 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4205 isl_basic_map_free(bmap);
4206 isl_basic_set_free(dom);
4212 struct isl_map *isl_basic_map_partial_lexmax(
4213 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4214 struct isl_set **empty)
4216 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4219 struct isl_map *isl_basic_map_partial_lexmin(
4220 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4221 struct isl_set **empty)
4223 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4226 struct isl_set *isl_basic_set_partial_lexmin(
4227 struct isl_basic_set *bset, struct isl_basic_set *dom,
4228 struct isl_set **empty)
4230 return (struct isl_set *)
4231 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4235 struct isl_set *isl_basic_set_partial_lexmax(
4236 struct isl_basic_set *bset, struct isl_basic_set *dom,
4237 struct isl_set **empty)
4239 return (struct isl_set *)
4240 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4244 /* Given a basic map "bmap", compute the lexicograhically minimal
4245 * (or maximal) image element for each domain element in dom.
4246 * Set *empty to those elements in dom that do not have an image element.
4248 * We first make sure the basic sets in dom are disjoint and then
4249 * simply collect the results over each of the basic sets separately.
4250 * We could probably improve the efficiency a bit by moving the union
4251 * domain down into the parametric integer programming.
4253 static __isl_give isl_map *basic_map_partial_lexopt(
4254 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4255 __isl_give isl_set **empty, int max)
4258 struct isl_map *res;
4260 dom = isl_set_make_disjoint(dom);
4264 if (isl_set_fast_is_empty(dom)) {
4265 res = isl_map_empty_like_basic_map(bmap);
4266 *empty = isl_set_empty_like(dom);
4268 isl_basic_map_free(bmap);
4272 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4273 isl_basic_set_copy(dom->p[0]), empty, max);
4275 for (i = 1; i < dom->n; ++i) {
4276 struct isl_map *res_i;
4277 struct isl_set *empty_i;
4279 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4280 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4282 res = isl_map_union_disjoint(res, res_i);
4283 *empty = isl_set_union_disjoint(*empty, empty_i);
4287 isl_basic_map_free(bmap);
4292 isl_basic_map_free(bmap);
4296 /* Given a map "map", compute the lexicograhically minimal
4297 * (or maximal) image element for each domain element in dom.
4298 * Set *empty to those elements in dom that do not have an image element.
4300 * We first compute the lexicographically minimal or maximal element
4301 * in the first basic map. This results in a partial solution "res"
4302 * and a subset "todo" of dom that still need to be handled.
4303 * We then consider each of the remaining maps in "map" and successively
4304 * improve both "res" and "todo".
4306 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4307 * Assume we are computing the lexicographical maximum.
4308 * We first intersect basic map i with a relation that maps elements
4309 * to elements that are lexicographically larger than the image elements
4310 * in res^k and the compute the maximum image element of this intersection.
4311 * The result ("better") corresponds to those image elements in basic map i
4312 * that are better than what we had before. The remainder ("keep") are the
4313 * domain elements for which the image element in res_k was better.
4314 * We also compute the lexicographical maximum of basic map i in todo^k.
4315 * res^i is the result of the operation + better + those elements in
4316 * res^k that we should keep
4317 * todo^i is the remainder of the maximum operation on todo^k.
4319 static __isl_give isl_map *isl_map_partial_lexopt(
4320 __isl_take isl_map *map, __isl_take isl_set *dom,
4321 __isl_give isl_set **empty, int max)
4324 struct isl_map *res;
4325 struct isl_set *todo;
4330 if (isl_map_fast_is_empty(map)) {
4338 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4339 isl_set_copy(dom), &todo, max);
4341 for (i = 1; i < map->n; ++i) {
4343 struct isl_map *better;
4344 struct isl_set *keep;
4345 struct isl_map *res_i;
4346 struct isl_set *todo_i;
4347 struct isl_dim *dim = isl_map_get_dim(res);
4349 dim = isl_dim_range(dim);
4351 lt = isl_map_lex_lt(dim);
4353 lt = isl_map_lex_gt(dim);
4354 lt = isl_map_apply_range(isl_map_copy(res), lt);
4355 lt = isl_map_intersect(lt,
4356 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4357 better = isl_map_partial_lexopt(lt,
4358 isl_map_domain(isl_map_copy(res)),
4361 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4362 todo, &todo_i, max);
4364 res = isl_map_intersect_domain(res, keep);
4365 res = isl_map_union_disjoint(res, res_i);
4366 res = isl_map_union_disjoint(res, better);
4387 __isl_give isl_map *isl_map_partial_lexmax(
4388 __isl_take isl_map *map, __isl_take isl_set *dom,
4389 __isl_give isl_set **empty)
4391 return isl_map_partial_lexopt(map, dom, empty, 1);
4394 __isl_give isl_map *isl_map_partial_lexmin(
4395 __isl_take isl_map *map, __isl_take isl_set *dom,
4396 __isl_give isl_set **empty)
4398 return isl_map_partial_lexopt(map, dom, empty, 0);
4401 __isl_give isl_set *isl_set_partial_lexmin(
4402 __isl_take isl_set *set, __isl_take isl_set *dom,
4403 __isl_give isl_set **empty)
4405 return (struct isl_set *)
4406 isl_map_partial_lexmin((struct isl_map *)set,
4410 __isl_give isl_set *isl_set_partial_lexmax(
4411 __isl_take isl_set *set, __isl_take isl_set *dom,
4412 __isl_give isl_set **empty)
4414 return (struct isl_set *)
4415 isl_map_partial_lexmax((struct isl_map *)set,
4419 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4421 struct isl_basic_set *dom = NULL;
4422 struct isl_dim *dom_dim;
4426 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4427 dom = isl_basic_set_universe(dom_dim);
4428 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4430 isl_basic_map_free(bmap);
4434 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4436 return isl_basic_map_lexopt(bmap, 0);
4439 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4441 return isl_basic_map_lexopt(bmap, 1);
4444 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4446 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4449 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4451 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4454 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4456 struct isl_set *dom = NULL;
4457 struct isl_dim *dom_dim;
4461 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4462 dom = isl_set_universe(dom_dim);
4463 return isl_map_partial_lexopt(map, dom, NULL, max);
4469 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4471 return isl_map_lexopt(map, 0);
4474 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4476 return isl_map_lexopt(map, 1);
4479 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4481 return (isl_set *)isl_map_lexmin((isl_map *)set);
4484 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4486 return (isl_set *)isl_map_lexmax((isl_map *)set);
4489 /* Apply a preimage specified by "mat" on the parameters of "bset".
4490 * bset is assumed to have only parameters and divs.
4492 static struct isl_basic_set *basic_set_parameter_preimage(
4493 struct isl_basic_set *bset, struct isl_mat *mat)
4500 bset->dim = isl_dim_cow(bset->dim);
4504 nparam = isl_basic_set_dim(bset, isl_dim_param);
4506 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4508 bset->dim->nparam = 0;
4509 bset->dim->n_out = nparam;
4510 bset = isl_basic_set_preimage(bset, mat);
4512 bset->dim->nparam = bset->dim->n_out;
4513 bset->dim->n_out = 0;
4518 isl_basic_set_free(bset);
4522 /* Apply a preimage specified by "mat" on the parameters of "set".
4523 * set is assumed to have only parameters and divs.
4525 static struct isl_set *set_parameter_preimage(
4526 struct isl_set *set, struct isl_mat *mat)
4528 struct isl_dim *dim = NULL;
4534 dim = isl_dim_copy(set->dim);
4535 dim = isl_dim_cow(dim);
4539 nparam = isl_set_dim(set, isl_dim_param);
4541 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4544 dim->n_out = nparam;
4545 isl_set_reset_dim(set, dim);
4546 set = isl_set_preimage(set, mat);
4549 dim = isl_dim_copy(set->dim);
4550 dim = isl_dim_cow(dim);
4553 dim->nparam = dim->n_out;
4555 isl_set_reset_dim(set, dim);
4565 /* Intersect the basic set "bset" with the affine space specified by the
4566 * equalities in "eq".
4568 static struct isl_basic_set *basic_set_append_equalities(
4569 struct isl_basic_set *bset, struct isl_mat *eq)
4577 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4582 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4583 for (i = 0; i < eq->n_row; ++i) {
4584 k = isl_basic_set_alloc_equality(bset);
4587 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4588 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4592 bset = isl_basic_set_gauss(bset, NULL);
4593 bset = isl_basic_set_finalize(bset);
4598 isl_basic_set_free(bset);
4602 /* Intersect the set "set" with the affine space specified by the
4603 * equalities in "eq".
4605 static struct isl_set *set_append_equalities(struct isl_set *set,
4613 for (i = 0; i < set->n; ++i) {
4614 set->p[i] = basic_set_append_equalities(set->p[i],
4627 /* Project the given basic set onto its parameter domain, possibly introducing
4628 * new, explicit, existential variables in the constraints.
4629 * The input has parameters and (possibly implicit) existential variables.
4630 * The output has the same parameters, but only
4631 * explicit existentially quantified variables.
4633 * The actual projection is performed by pip, but pip doesn't seem
4634 * to like equalities very much, so we first remove the equalities
4635 * among the parameters by performing a variable compression on
4636 * the parameters. Afterward, an inverse transformation is performed
4637 * and the equalities among the parameters are inserted back in.
4639 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4643 struct isl_mat *T, *T2;
4644 struct isl_set *set;
4645 unsigned nparam, n_div;
4647 bset = isl_basic_set_cow(bset);
4651 if (bset->n_eq == 0)
4652 return isl_basic_set_lexmin(bset);
4654 isl_basic_set_gauss(bset, NULL);
4656 nparam = isl_basic_set_dim(bset, isl_dim_param);
4657 n_div = isl_basic_set_dim(bset, isl_dim_div);
4659 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4660 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4663 if (i == bset->n_eq)
4664 return isl_basic_set_lexmin(bset);
4666 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4668 eq = isl_mat_cow(eq);
4669 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4670 if (T && T->n_col == 0) {
4674 bset = isl_basic_set_set_to_empty(bset);
4675 return isl_set_from_basic_set(bset);
4677 bset = basic_set_parameter_preimage(bset, T);
4679 set = isl_basic_set_lexmin(bset);
4680 set = set_parameter_preimage(set, T2);
4681 set = set_append_equalities(set, eq);
4685 /* Compute an explicit representation for all the existentially
4686 * quantified variables.
4687 * The input and output dimensions are first turned into parameters.
4688 * compute_divs then returns a map with the same parameters and
4689 * no input or output dimensions and the dimension specification
4690 * is reset to that of the input.
4692 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4694 struct isl_basic_set *bset;
4695 struct isl_set *set;
4696 struct isl_map *map;
4697 struct isl_dim *dim, *orig_dim = NULL;
4702 bmap = isl_basic_map_cow(bmap);
4706 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4707 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4708 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4709 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4713 orig_dim = bmap->dim;
4715 bset = (struct isl_basic_set *)bmap;
4717 set = parameter_compute_divs(bset);
4718 map = (struct isl_map *)set;
4719 map = isl_map_reset_dim(map, orig_dim);
4723 isl_basic_map_free(bmap);
4727 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4735 off = isl_dim_total(bmap->dim);
4736 for (i = 0; i < bmap->n_div; ++i) {
4737 if (isl_int_is_zero(bmap->div[i][0]))
4739 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4745 static int map_divs_known(__isl_keep isl_map *map)
4752 for (i = 0; i < map->n; ++i) {
4753 int known = basic_map_divs_known(map->p[i]);
4761 /* If bmap contains any unknown divs, then compute explicit
4762 * expressions for them. However, this computation may be
4763 * quite expensive, so first try to remove divs that aren't
4766 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4770 struct isl_map *map;
4772 known = basic_map_divs_known(bmap);
4776 return isl_map_from_basic_map(bmap);
4778 bmap = isl_basic_map_drop_redundant_divs(bmap);
4780 known = basic_map_divs_known(bmap);
4784 return isl_map_from_basic_map(bmap);
4786 map = compute_divs(bmap);
4789 isl_basic_map_free(bmap);
4793 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4797 struct isl_map *res;
4804 known = map_divs_known(map);
4812 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4813 for (i = 1 ; i < map->n; ++i) {
4815 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4816 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4817 res = isl_map_union_disjoint(res, r2);
4819 res = isl_map_union(res, r2);
4826 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4828 return (struct isl_set *)
4829 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4832 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4834 return (struct isl_set *)
4835 isl_map_compute_divs((struct isl_map *)set);
4838 struct isl_set *isl_map_domain(struct isl_map *map)
4841 struct isl_set *set;
4846 map = isl_map_cow(map);
4850 set = (struct isl_set *)map;
4851 set->dim = isl_dim_domain(set->dim);
4854 for (i = 0; i < map->n; ++i) {
4855 set->p[i] = isl_basic_map_domain(map->p[i]);
4859 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4860 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4867 struct isl_map *isl_map_union_disjoint(
4868 struct isl_map *map1, struct isl_map *map2)
4872 struct isl_map *map = NULL;
4886 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4888 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4889 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4890 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4892 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4893 map1->n + map2->n, flags);
4896 for (i = 0; i < map1->n; ++i) {
4897 map = isl_map_add_basic_map(map,
4898 isl_basic_map_copy(map1->p[i]));
4902 for (i = 0; i < map2->n; ++i) {
4903 map = isl_map_add_basic_map(map,
4904 isl_basic_map_copy(map2->p[i]));
4918 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4920 map1 = isl_map_union_disjoint(map1, map2);
4924 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4928 struct isl_set *isl_set_union_disjoint(
4929 struct isl_set *set1, struct isl_set *set2)
4931 return (struct isl_set *)
4932 isl_map_union_disjoint(
4933 (struct isl_map *)set1, (struct isl_map *)set2);
4936 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4938 return (struct isl_set *)
4939 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4942 struct isl_map *isl_map_intersect_range(
4943 struct isl_map *map, struct isl_set *set)
4946 struct isl_map *result;
4952 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4953 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4954 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4956 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4957 map->n * set->n, flags);
4960 for (i = 0; i < map->n; ++i)
4961 for (j = 0; j < set->n; ++j) {
4962 result = isl_map_add_basic_map(result,
4963 isl_basic_map_intersect_range(
4964 isl_basic_map_copy(map->p[i]),
4965 isl_basic_set_copy(set->p[j])));
4978 struct isl_map *isl_map_intersect_domain(
4979 struct isl_map *map, struct isl_set *set)
4981 return isl_map_reverse(
4982 isl_map_intersect_range(isl_map_reverse(map), set));
4985 struct isl_map *isl_map_apply_domain(
4986 struct isl_map *map1, struct isl_map *map2)
4990 map1 = isl_map_reverse(map1);
4991 map1 = isl_map_apply_range(map1, map2);
4992 return isl_map_reverse(map1);
4999 struct isl_map *isl_map_apply_range(
5000 struct isl_map *map1, struct isl_map *map2)
5002 struct isl_dim *dim_result;
5003 struct isl_map *result;
5009 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5010 isl_dim_copy(map2->dim));
5012 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5015 for (i = 0; i < map1->n; ++i)
5016 for (j = 0; j < map2->n; ++j) {
5017 result = isl_map_add_basic_map(result,
5018 isl_basic_map_apply_range(
5019 isl_basic_map_copy(map1->p[i]),
5020 isl_basic_map_copy(map2->p[j])));
5026 if (result && result->n <= 1)
5027 ISL_F_SET(result, ISL_MAP_DISJOINT);
5036 * returns range - domain
5038 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5040 isl_dim *dims, *target_dim;
5041 struct isl_basic_set *bset;
5048 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5049 bmap->dim, isl_dim_out),
5051 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5052 dim = isl_basic_map_n_in(bmap);
5053 nparam = isl_basic_map_n_param(bmap);
5054 bset = isl_basic_set_from_basic_map(bmap);
5055 bset = isl_basic_set_cow(bset);
5056 dims = isl_basic_set_get_dim(bset);
5057 dims = isl_dim_add(dims, isl_dim_set, dim);
5058 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5059 bset = isl_basic_set_swap_vars(bset, 2*dim);
5060 for (i = 0; i < dim; ++i) {
5061 int j = isl_basic_map_alloc_equality(
5062 (struct isl_basic_map *)bset);
5065 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5066 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5067 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5068 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5070 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5071 bset = isl_basic_set_reset_dim(bset, target_dim);
5074 isl_basic_map_free(bmap);
5079 * returns range - domain
5081 struct isl_set *isl_map_deltas(struct isl_map *map)
5085 struct isl_set *result;
5090 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5091 map->dim, isl_dim_out),
5093 dim = isl_map_get_dim(map);
5094 dim = isl_dim_domain(dim);
5095 result = isl_set_alloc_dim(dim, map->n, map->flags);
5098 for (i = 0; i < map->n; ++i)
5099 result = isl_set_add_basic_set(result,
5100 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5108 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5110 struct isl_basic_map *bmap;
5118 nparam = dims->nparam;
5120 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5124 for (i = 0; i < dim; ++i) {
5125 int j = isl_basic_map_alloc_equality(bmap);
5128 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5129 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5130 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5132 return isl_basic_map_finalize(bmap);
5134 isl_basic_map_free(bmap);
5138 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5140 struct isl_dim *dim = isl_dim_map(set_dim);
5143 return basic_map_identity(dim);
5146 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5148 if (!model || !model->dim)
5150 isl_assert(model->ctx,
5151 model->dim->n_in == model->dim->n_out, return NULL);
5152 return basic_map_identity(isl_dim_copy(model->dim));
5155 static struct isl_map *map_identity(struct isl_dim *dim)
5157 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5158 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5161 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5163 struct isl_dim *dim = isl_dim_map(set_dim);
5166 return map_identity(dim);
5169 struct isl_map *isl_map_identity_like(struct isl_map *model)
5171 if (!model || !model->dim)
5173 isl_assert(model->ctx,
5174 model->dim->n_in == model->dim->n_out, return NULL);
5175 return map_identity(isl_dim_copy(model->dim));
5178 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5180 if (!model || !model->dim)
5182 isl_assert(model->ctx,
5183 model->dim->n_in == model->dim->n_out, return NULL);
5184 return map_identity(isl_dim_copy(model->dim));
5187 /* Construct a basic set with all set dimensions having only non-negative
5190 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5195 struct isl_basic_set *bset;
5199 nparam = dims->nparam;
5201 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5204 for (i = 0; i < dim; ++i) {
5205 int k = isl_basic_set_alloc_inequality(bset);
5208 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5209 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5213 isl_basic_set_free(bset);
5217 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5218 enum isl_dim_type type, unsigned first, unsigned n)
5221 isl_basic_set *nonneg = NULL;
5222 isl_basic_set *neg = NULL;
5229 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5231 for (i = 0; i < n; ++i) {
5235 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5236 k = isl_basic_set_alloc_inequality(nonneg);
5239 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5240 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5242 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5243 k = isl_basic_set_alloc_inequality(neg);
5246 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5247 isl_int_set_si(neg->ineq[k][0], -1);
5248 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5250 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5255 isl_basic_set_free(nonneg);
5256 isl_basic_set_free(neg);
5261 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5263 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5266 int isl_basic_map_is_subset(
5267 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5270 struct isl_map *map1;
5271 struct isl_map *map2;
5273 if (!bmap1 || !bmap2)
5276 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5277 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5279 is_subset = isl_map_is_subset(map1, map2);
5287 int isl_basic_map_is_equal(
5288 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5292 if (!bmap1 || !bmap2)
5294 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5297 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5301 int isl_basic_set_is_equal(
5302 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5304 return isl_basic_map_is_equal(
5305 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5308 int isl_map_is_empty(struct isl_map *map)
5315 for (i = 0; i < map->n; ++i) {
5316 is_empty = isl_basic_map_is_empty(map->p[i]);
5325 int isl_map_fast_is_empty(struct isl_map *map)
5327 return map ? map->n == 0 : -1;
5330 int isl_set_fast_is_empty(struct isl_set *set)
5332 return set ? set->n == 0 : -1;
5335 int isl_set_is_empty(struct isl_set *set)
5337 return isl_map_is_empty((struct isl_map *)set);
5340 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5345 return isl_dim_equal(map1->dim, map2->dim);
5348 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5353 return isl_dim_equal(set1->dim, set2->dim);
5356 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5362 is_subset = isl_map_is_subset(map1, map2);
5365 is_subset = isl_map_is_subset(map2, map1);
5369 int isl_basic_map_is_strict_subset(
5370 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5374 if (!bmap1 || !bmap2)
5376 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5379 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5380 if (is_subset == -1)
5385 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5391 is_subset = isl_map_is_subset(map1, map2);
5394 is_subset = isl_map_is_subset(map2, map1);
5395 if (is_subset == -1)
5400 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5402 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5405 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5409 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5412 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5416 return bset->n_eq == 0 && bset->n_ineq == 0;
5419 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5426 for (i = 0; i < map->n; ++i) {
5427 int r = isl_basic_map_is_universe(map->p[i]);
5435 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5437 return isl_map_fast_is_universe((isl_map *) set);
5440 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5442 struct isl_basic_set *bset = NULL;
5443 struct isl_vec *sample = NULL;
5450 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5453 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5454 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5455 copy = isl_basic_map_remove_redundancies(copy);
5456 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5457 isl_basic_map_free(copy);
5461 total = 1 + isl_basic_map_total_dim(bmap);
5462 if (bmap->sample && bmap->sample->size == total) {
5463 int contains = isl_basic_map_contains(bmap, bmap->sample);
5469 isl_vec_free(bmap->sample);
5470 bmap->sample = NULL;
5471 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5474 sample = isl_basic_set_sample_vec(bset);
5477 empty = sample->size == 0;
5478 isl_vec_free(bmap->sample);
5479 bmap->sample = sample;
5481 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5486 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5490 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5493 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5497 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5500 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5502 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5505 struct isl_map *isl_basic_map_union(
5506 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5508 struct isl_map *map;
5509 if (!bmap1 || !bmap2)
5512 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5514 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5517 map = isl_map_add_basic_map(map, bmap1);
5518 map = isl_map_add_basic_map(map, bmap2);
5521 isl_basic_map_free(bmap1);
5522 isl_basic_map_free(bmap2);
5526 struct isl_set *isl_basic_set_union(
5527 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5529 return (struct isl_set *)isl_basic_map_union(
5530 (struct isl_basic_map *)bset1,
5531 (struct isl_basic_map *)bset2);
5534 /* Order divs such that any div only depends on previous divs */
5535 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5543 off = isl_dim_total(bmap->dim);
5545 for (i = 0; i < bmap->n_div; ++i) {
5547 if (isl_int_is_zero(bmap->div[i][0]))
5549 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5553 isl_basic_map_swap_div(bmap, i, i + pos);
5559 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5561 return (struct isl_basic_set *)
5562 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5565 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5572 for (i = 0; i < map->n; ++i) {
5573 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5584 /* Look for a div in dst that corresponds to the div "div" in src.
5585 * The divs before "div" in src and dst are assumed to be the same.
5587 * Returns -1 if no corresponding div was found and the position
5588 * of the corresponding div in dst otherwise.
5590 static int find_div(struct isl_basic_map *dst,
5591 struct isl_basic_map *src, unsigned div)
5595 unsigned total = isl_dim_total(src->dim);
5597 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5598 for (i = div; i < dst->n_div; ++i)
5599 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5600 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5601 dst->n_div - div) == -1)
5606 struct isl_basic_map *isl_basic_map_align_divs(
5607 struct isl_basic_map *dst, struct isl_basic_map *src)
5610 unsigned total = isl_dim_total(src->dim);
5615 if (src->n_div == 0)
5618 for (i = 0; i < src->n_div; ++i)
5619 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5621 src = isl_basic_map_order_divs(src);
5622 dst = isl_basic_map_cow(dst);
5623 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5624 src->n_div, 0, 2 * src->n_div);
5627 for (i = 0; i < src->n_div; ++i) {
5628 int j = find_div(dst, src, i);
5630 j = isl_basic_map_alloc_div(dst);
5633 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5634 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5635 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5639 isl_basic_map_swap_div(dst, i, j);
5643 isl_basic_map_free(dst);
5647 struct isl_basic_set *isl_basic_set_align_divs(
5648 struct isl_basic_set *dst, struct isl_basic_set *src)
5650 return (struct isl_basic_set *)isl_basic_map_align_divs(
5651 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5654 struct isl_map *isl_map_align_divs(struct isl_map *map)
5662 map = isl_map_compute_divs(map);
5663 map = isl_map_cow(map);
5667 for (i = 1; i < map->n; ++i)
5668 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5669 for (i = 1; i < map->n; ++i)
5670 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5672 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5676 struct isl_set *isl_set_align_divs(struct isl_set *set)
5678 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5681 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5685 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5686 map = isl_map_intersect_domain(map, set);
5687 set = isl_map_range(map);
5695 /* There is no need to cow as removing empty parts doesn't change
5696 * the meaning of the set.
5698 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5705 for (i = map->n-1; i >= 0; --i) {
5706 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5708 isl_basic_map_free(map->p[i]);
5709 if (i != map->n-1) {
5710 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5711 map->p[i] = map->p[map->n-1];
5719 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5721 return (struct isl_set *)
5722 isl_map_remove_empty_parts((struct isl_map *)set);
5725 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5727 struct isl_basic_map *bmap;
5728 if (!map || map->n == 0)
5730 bmap = map->p[map->n-1];
5731 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5732 return isl_basic_map_copy(bmap);
5735 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5737 return (struct isl_basic_set *)
5738 isl_map_copy_basic_map((struct isl_map *)set);
5741 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5742 __isl_keep isl_basic_map *bmap)
5748 for (i = map->n-1; i >= 0; --i) {
5749 if (map->p[i] != bmap)
5751 map = isl_map_cow(map);
5754 isl_basic_map_free(map->p[i]);
5755 if (i != map->n-1) {
5756 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5757 map->p[i] = map->p[map->n-1];
5768 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5769 struct isl_basic_set *bset)
5771 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5772 (struct isl_basic_map *)bset);
5775 /* Given two basic sets bset1 and bset2, compute the maximal difference
5776 * between the values of dimension pos in bset1 and those in bset2
5777 * for any common value of the parameters and dimensions preceding pos.
5779 static enum isl_lp_result basic_set_maximal_difference_at(
5780 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5781 int pos, isl_int *opt)
5783 struct isl_dim *dims;
5784 struct isl_basic_map *bmap1 = NULL;
5785 struct isl_basic_map *bmap2 = NULL;
5786 struct isl_ctx *ctx;
5787 struct isl_vec *obj;
5790 unsigned dim1, dim2;
5791 enum isl_lp_result res;
5793 if (!bset1 || !bset2)
5794 return isl_lp_error;
5796 nparam = isl_basic_set_n_param(bset1);
5797 dim1 = isl_basic_set_n_dim(bset1);
5798 dim2 = isl_basic_set_n_dim(bset2);
5799 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5800 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5801 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5802 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5803 if (!bmap1 || !bmap2)
5805 bmap1 = isl_basic_map_cow(bmap1);
5806 bmap1 = isl_basic_map_extend(bmap1, nparam,
5807 pos, (dim1 - pos) + (dim2 - pos),
5808 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5809 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5812 total = isl_basic_map_total_dim(bmap1);
5814 obj = isl_vec_alloc(ctx, 1 + total);
5815 isl_seq_clr(obj->block.data, 1 + total);
5816 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5817 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5820 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5822 isl_basic_map_free(bmap1);
5826 isl_basic_map_free(bmap1);
5827 isl_basic_map_free(bmap2);
5828 return isl_lp_error;
5831 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5832 * for any common value of the parameters and dimensions preceding pos
5833 * in both basic sets, the values of dimension pos in bset1 are
5834 * smaller or larger than those in bset2.
5837 * 1 if bset1 follows bset2
5838 * -1 if bset1 precedes bset2
5839 * 0 if bset1 and bset2 are incomparable
5840 * -2 if some error occurred.
5842 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5843 struct isl_basic_set *bset2, int pos)
5846 enum isl_lp_result res;
5851 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5853 if (res == isl_lp_empty)
5855 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5856 res == isl_lp_unbounded)
5858 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5867 /* Given two basic sets bset1 and bset2, check whether
5868 * for any common value of the parameters and dimensions preceding pos
5869 * there is a value of dimension pos in bset1 that is larger
5870 * than a value of the same dimension in bset2.
5873 * 1 if there exists such a pair
5874 * 0 if there is no such pair, but there is a pair of equal values
5876 * -2 if some error occurred.
5878 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5879 __isl_keep isl_basic_set *bset2, int pos)
5882 enum isl_lp_result res;
5887 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5889 if (res == isl_lp_empty)
5891 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5892 res == isl_lp_unbounded)
5894 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5896 else if (res == isl_lp_ok)
5905 /* Given two sets set1 and set2, check whether
5906 * for any common value of the parameters and dimensions preceding pos
5907 * there is a value of dimension pos in set1 that is larger
5908 * than a value of the same dimension in set2.
5911 * 1 if there exists such a pair
5912 * 0 if there is no such pair, but there is a pair of equal values
5914 * -2 if some error occurred.
5916 int isl_set_follows_at(__isl_keep isl_set *set1,
5917 __isl_keep isl_set *set2, int pos)
5925 for (i = 0; i < set1->n; ++i)
5926 for (j = 0; j < set2->n; ++j) {
5928 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5929 if (f == 1 || f == -2)
5938 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5939 unsigned pos, isl_int *val)
5947 total = isl_basic_map_total_dim(bmap);
5948 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5949 for (; d+1 > pos; --d)
5950 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5954 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5956 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5958 if (!isl_int_is_one(bmap->eq[i][1+d]))
5961 isl_int_neg(*val, bmap->eq[i][0]);
5967 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5968 unsigned pos, isl_int *val)
5980 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5983 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5984 for (i = 1; fixed == 1 && i < map->n; ++i) {
5985 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5986 if (fixed == 1 && isl_int_ne(tmp, v))
5990 isl_int_set(*val, v);
5996 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5997 unsigned pos, isl_int *val)
5999 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6003 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6006 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6009 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6010 enum isl_dim_type type, unsigned pos, isl_int *val)
6012 if (pos >= isl_basic_map_dim(bmap, type))
6014 return isl_basic_map_fast_has_fixed_var(bmap,
6015 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6018 int isl_map_fast_is_fixed(struct isl_map *map,
6019 enum isl_dim_type type, unsigned pos, isl_int *val)
6021 if (pos >= isl_map_dim(map, type))
6023 return isl_map_fast_has_fixed_var(map,
6024 map_offset(map, type) - 1 + pos, val);
6027 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6028 * then return this fixed value in *val.
6030 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6033 return isl_basic_set_fast_has_fixed_var(bset,
6034 isl_basic_set_n_param(bset) + dim, val);
6037 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6038 * then return this fixed value in *val.
6040 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6042 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6045 /* Check if input variable in has fixed value and if so and if val is not NULL,
6046 * then return this fixed value in *val.
6048 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6050 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6053 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6054 * and if val is not NULL, then return this lower bound in *val.
6056 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6057 unsigned dim, isl_int *val)
6059 int i, i_eq = -1, i_ineq = -1;
6066 total = isl_basic_set_total_dim(bset);
6067 nparam = isl_basic_set_n_param(bset);
6068 for (i = 0; i < bset->n_eq; ++i) {
6069 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6075 for (i = 0; i < bset->n_ineq; ++i) {
6076 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6078 if (i_eq != -1 || i_ineq != -1)
6082 if (i_eq == -1 && i_ineq == -1)
6084 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6085 /* The coefficient should always be one due to normalization. */
6086 if (!isl_int_is_one(c[1+nparam+dim]))
6088 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6090 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6091 total - nparam - dim - 1) != -1)
6094 isl_int_neg(*val, c[0]);
6098 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6099 unsigned dim, isl_int *val)
6111 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6115 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6117 for (i = 1; fixed == 1 && i < set->n; ++i) {
6118 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6120 if (fixed == 1 && isl_int_ne(tmp, v))
6124 isl_int_set(*val, v);
6135 static int qsort_constraint_cmp(const void *p1, const void *p2)
6137 const struct constraint *c1 = (const struct constraint *)p1;
6138 const struct constraint *c2 = (const struct constraint *)p2;
6139 unsigned size = isl_min(c1->size, c2->size);
6140 return isl_seq_cmp(c1->c, c2->c, size);
6143 static struct isl_basic_map *isl_basic_map_sort_constraints(
6144 struct isl_basic_map *bmap)
6147 struct constraint *c;
6152 total = isl_basic_map_total_dim(bmap);
6153 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6156 for (i = 0; i < bmap->n_ineq; ++i) {
6158 c[i].c = bmap->ineq[i];
6160 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6161 for (i = 0; i < bmap->n_ineq; ++i)
6162 bmap->ineq[i] = c[i].c;
6166 isl_basic_map_free(bmap);
6170 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6171 __isl_take isl_basic_set *bset)
6173 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6174 (struct isl_basic_map *)bset);
6177 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6181 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6183 bmap = isl_basic_map_remove_redundancies(bmap);
6184 bmap = isl_basic_map_sort_constraints(bmap);
6185 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6189 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6191 return (struct isl_basic_set *)isl_basic_map_normalize(
6192 (struct isl_basic_map *)bset);
6195 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6196 const __isl_keep isl_basic_map *bmap2)
6203 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6204 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6205 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6206 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6207 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6208 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6209 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6210 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6212 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6214 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6216 if (bmap1->n_eq != bmap2->n_eq)
6217 return bmap1->n_eq - bmap2->n_eq;
6218 if (bmap1->n_ineq != bmap2->n_ineq)
6219 return bmap1->n_ineq - bmap2->n_ineq;
6220 if (bmap1->n_div != bmap2->n_div)
6221 return bmap1->n_div - bmap2->n_div;
6222 total = isl_basic_map_total_dim(bmap1);
6223 for (i = 0; i < bmap1->n_eq; ++i) {
6224 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6228 for (i = 0; i < bmap1->n_ineq; ++i) {
6229 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6233 for (i = 0; i < bmap1->n_div; ++i) {
6234 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6241 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6242 __isl_keep isl_basic_map *bmap2)
6244 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6247 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6248 __isl_keep isl_basic_set *bset2)
6250 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6251 (isl_basic_map *)bset2);
6254 static int qsort_bmap_cmp(const void *p1, const void *p2)
6256 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6257 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6259 return isl_basic_map_fast_cmp(bmap1, bmap2);
6262 /* We normalize in place, but if anything goes wrong we need
6263 * to return NULL, so we need to make sure we don't change the
6264 * meaning of any possible other copies of map.
6266 struct isl_map *isl_map_normalize(struct isl_map *map)
6269 struct isl_basic_map *bmap;
6273 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6275 for (i = 0; i < map->n; ++i) {
6276 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6279 isl_basic_map_free(map->p[i]);
6282 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6283 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6284 map = isl_map_remove_empty_parts(map);
6287 for (i = map->n - 1; i >= 1; --i) {
6288 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6290 isl_basic_map_free(map->p[i-1]);
6291 for (j = i; j < map->n; ++j)
6292 map->p[j-1] = map->p[j];
6302 struct isl_set *isl_set_normalize(struct isl_set *set)
6304 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6307 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6317 if (!isl_dim_equal(map1->dim, map2->dim))
6320 map1 = isl_map_copy(map1);
6321 map2 = isl_map_copy(map2);
6322 map1 = isl_map_normalize(map1);
6323 map2 = isl_map_normalize(map2);
6326 equal = map1->n == map2->n;
6327 for (i = 0; equal && i < map1->n; ++i) {
6328 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6341 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6343 return isl_map_fast_is_equal((struct isl_map *)set1,
6344 (struct isl_map *)set2);
6347 /* Return an interval that ranges from min to max (inclusive)
6349 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6350 isl_int min, isl_int max)
6353 struct isl_basic_set *bset = NULL;
6355 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6359 k = isl_basic_set_alloc_inequality(bset);
6362 isl_int_set_si(bset->ineq[k][1], 1);
6363 isl_int_neg(bset->ineq[k][0], min);
6365 k = isl_basic_set_alloc_inequality(bset);
6368 isl_int_set_si(bset->ineq[k][1], -1);
6369 isl_int_set(bset->ineq[k][0], max);
6373 isl_basic_set_free(bset);
6377 /* Return the Cartesian product of the basic sets in list (in the given order).
6379 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6387 struct isl_basic_set *product = NULL;
6391 isl_assert(list->ctx, list->n > 0, goto error);
6392 isl_assert(list->ctx, list->p[0], goto error);
6393 nparam = isl_basic_set_n_param(list->p[0]);
6394 dim = isl_basic_set_n_dim(list->p[0]);
6395 extra = list->p[0]->n_div;
6396 n_eq = list->p[0]->n_eq;
6397 n_ineq = list->p[0]->n_ineq;
6398 for (i = 1; i < list->n; ++i) {
6399 isl_assert(list->ctx, list->p[i], goto error);
6400 isl_assert(list->ctx,
6401 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6402 dim += isl_basic_set_n_dim(list->p[i]);
6403 extra += list->p[i]->n_div;
6404 n_eq += list->p[i]->n_eq;
6405 n_ineq += list->p[i]->n_ineq;
6407 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6412 for (i = 0; i < list->n; ++i) {
6413 isl_basic_set_add_constraints(product,
6414 isl_basic_set_copy(list->p[i]), dim);
6415 dim += isl_basic_set_n_dim(list->p[i]);
6417 isl_basic_set_list_free(list);
6420 isl_basic_set_free(product);
6421 isl_basic_set_list_free(list);
6425 struct isl_basic_map *isl_basic_map_product(
6426 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6428 struct isl_dim *dim_result = NULL;
6429 struct isl_basic_map *bmap;
6430 unsigned in1, in2, out1, out2, nparam, total, pos;
6431 struct isl_dim_map *dim_map1, *dim_map2;
6433 if (!bmap1 || !bmap2)
6436 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6437 bmap2->dim, isl_dim_param), goto error);
6438 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6439 isl_dim_copy(bmap2->dim));
6441 in1 = isl_basic_map_n_in(bmap1);
6442 in2 = isl_basic_map_n_in(bmap2);
6443 out1 = isl_basic_map_n_out(bmap1);
6444 out2 = isl_basic_map_n_out(bmap2);
6445 nparam = isl_basic_map_n_param(bmap1);
6447 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6448 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6449 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6450 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6451 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6452 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6453 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6454 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6455 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6456 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6457 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6459 bmap = isl_basic_map_alloc_dim(dim_result,
6460 bmap1->n_div + bmap2->n_div,
6461 bmap1->n_eq + bmap2->n_eq,
6462 bmap1->n_ineq + bmap2->n_ineq);
6463 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6464 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6465 bmap = isl_basic_map_simplify(bmap);
6466 return isl_basic_map_finalize(bmap);
6468 isl_basic_map_free(bmap1);
6469 isl_basic_map_free(bmap2);
6473 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6475 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6478 struct isl_map *result;
6484 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6485 map2->dim, isl_dim_param), goto error);
6487 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6488 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6489 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6491 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6492 isl_dim_copy(map2->dim)),
6493 map1->n * map2->n, flags);
6496 for (i = 0; i < map1->n; ++i)
6497 for (j = 0; j < map2->n; ++j) {
6498 struct isl_basic_map *part;
6499 part = isl_basic_map_product(
6500 isl_basic_map_copy(map1->p[i]),
6501 isl_basic_map_copy(map2->p[j]));
6502 if (isl_basic_map_is_empty(part))
6503 isl_basic_map_free(part);
6505 result = isl_map_add_basic_map(result, part);
6518 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6520 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
6521 __isl_take isl_map *map2)
6525 prod = isl_map_product(map1, map2);
6526 prod = isl_map_flatten(prod);
6530 /* Given two set A and B, construct its Cartesian product A x B.
6532 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6534 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6535 (struct isl_map *)set2);
6538 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
6539 __isl_take isl_set *set2)
6541 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
6544 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6547 uint32_t hash = isl_hash_init();
6552 bset = isl_basic_set_copy(bset);
6553 bset = isl_basic_set_normalize(bset);
6556 total = isl_basic_set_total_dim(bset);
6557 isl_hash_byte(hash, bset->n_eq & 0xFF);
6558 for (i = 0; i < bset->n_eq; ++i) {
6560 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6561 isl_hash_hash(hash, c_hash);
6563 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6564 for (i = 0; i < bset->n_ineq; ++i) {
6566 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6567 isl_hash_hash(hash, c_hash);
6569 isl_hash_byte(hash, bset->n_div & 0xFF);
6570 for (i = 0; i < bset->n_div; ++i) {
6572 if (isl_int_is_zero(bset->div[i][0]))
6574 isl_hash_byte(hash, i & 0xFF);
6575 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6576 isl_hash_hash(hash, c_hash);
6578 isl_basic_set_free(bset);
6582 uint32_t isl_set_get_hash(struct isl_set *set)
6589 set = isl_set_copy(set);
6590 set = isl_set_normalize(set);
6594 hash = isl_hash_init();
6595 for (i = 0; i < set->n; ++i) {
6597 bset_hash = isl_basic_set_get_hash(set->p[i]);
6598 isl_hash_hash(hash, bset_hash);
6606 /* Check if the value for dimension dim is completely determined
6607 * by the values of the other parameters and variables.
6608 * That is, check if dimension dim is involved in an equality.
6610 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6617 nparam = isl_basic_set_n_param(bset);
6618 for (i = 0; i < bset->n_eq; ++i)
6619 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6624 /* Check if the value for dimension dim is completely determined
6625 * by the values of the other parameters and variables.
6626 * That is, check if dimension dim is involved in an equality
6627 * for each of the subsets.
6629 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6635 for (i = 0; i < set->n; ++i) {
6637 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6644 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6645 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6652 for (i = 0; i < map->n; ++i)
6653 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6659 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6660 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6667 for (i = 0; i < set->n; ++i)
6668 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6674 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6676 struct isl_dim *dim;
6681 if (bset->n_div == 0)
6684 bset = isl_basic_set_cow(bset);
6688 dim = isl_basic_set_get_dim(bset);
6689 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6692 isl_dim_free(bset->dim);
6696 bset = isl_basic_set_finalize(bset);
6700 isl_basic_set_free(bset);
6704 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6707 struct isl_dim *dim;
6710 set = isl_set_align_divs(set);
6714 if (set->n == 0 || set->p[0]->n_div == 0)
6717 set = isl_set_cow(set);
6721 n_div = set->p[0]->n_div;
6722 dim = isl_set_get_dim(set);
6723 dim = isl_dim_add(dim, isl_dim_set, n_div);
6726 isl_dim_free(set->dim);
6729 for (i = 0; i < set->n; ++i) {
6730 set->p[i] = isl_basic_set_lift(set->p[i]);
6741 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6743 struct isl_dim *dim;
6744 struct isl_basic_map *bmap;
6751 set = isl_set_align_divs(set);
6756 dim = isl_set_get_dim(set);
6757 if (set->n == 0 || set->p[0]->n_div == 0) {
6759 return isl_map_identity(dim);
6762 n_div = set->p[0]->n_div;
6763 dim = isl_dim_map(dim);
6764 n_param = isl_dim_size(dim, isl_dim_param);
6765 n_set = isl_dim_size(dim, isl_dim_in);
6766 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6767 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6768 for (i = 0; i < n_set; ++i)
6769 bmap = var_equal(bmap, i);
6771 total = n_param + n_set + n_set + n_div;
6772 for (i = 0; i < n_div; ++i) {
6773 k = isl_basic_map_alloc_inequality(bmap);
6776 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6777 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6778 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6779 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6780 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6781 set->p[0]->div[i][0]);
6783 l = isl_basic_map_alloc_inequality(bmap);
6786 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6787 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6788 set->p[0]->div[i][0]);
6789 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6793 return isl_map_from_basic_map(bmap);
6796 isl_basic_map_free(bmap);
6800 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6808 dim = isl_basic_set_total_dim(bset);
6809 size += bset->n_eq * (1 + dim);
6810 size += bset->n_ineq * (1 + dim);
6811 size += bset->n_div * (2 + dim);
6816 int isl_set_size(__isl_keep isl_set *set)
6824 for (i = 0; i < set->n; ++i)
6825 size += isl_basic_set_size(set->p[i]);
6830 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6831 enum isl_dim_type type, unsigned pos)
6839 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6841 pos += isl_basic_map_offset(bmap, type);
6843 for (i = 0; i < bmap->n_eq; ++i)
6844 if (!isl_int_is_zero(bmap->eq[i][pos]))
6848 for (i = 0; i < bmap->n_ineq; ++i) {
6849 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6856 return lower && upper;
6859 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6860 enum isl_dim_type type, unsigned pos)
6867 for (i = 0; i < map->n; ++i) {
6869 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6870 if (bounded < 0 || !bounded)
6877 /* Return 1 if the specified dim is involved in both an upper bound
6878 * and a lower bound.
6880 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6881 enum isl_dim_type type, unsigned pos)
6883 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6886 /* For each of the "n" variables starting at "first", determine
6887 * the sign of the variable and put the results in the first "n"
6888 * elements of the array "signs".
6890 * 1 means that the variable is non-negative
6891 * -1 means that the variable is non-positive
6892 * 0 means the variable attains both positive and negative values.
6894 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6895 unsigned first, unsigned n, int *signs)
6897 isl_vec *bound = NULL;
6898 struct isl_tab *tab = NULL;
6899 struct isl_tab_undo *snap;
6902 if (!bset || !signs)
6905 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6906 tab = isl_tab_from_basic_set(bset);
6910 isl_seq_clr(bound->el, bound->size);
6911 isl_int_set_si(bound->el[0], -1);
6913 snap = isl_tab_snap(tab);
6914 for (i = 0; i < n; ++i) {
6917 isl_int_set_si(bound->el[1 + first + i], -1);
6918 if (isl_tab_add_ineq(tab, bound->el) < 0)
6921 isl_int_set_si(bound->el[1 + first + i], 0);
6922 if (isl_tab_rollback(tab, snap) < 0)
6930 isl_int_set_si(bound->el[1 + first + i], 1);
6931 if (isl_tab_add_ineq(tab, bound->el) < 0)
6934 isl_int_set_si(bound->el[1 + first + i], 0);
6935 if (isl_tab_rollback(tab, snap) < 0)
6938 signs[i] = empty ? -1 : 0;
6942 isl_vec_free(bound);
6946 isl_vec_free(bound);
6950 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
6951 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
6953 if (!bset || !signs)
6955 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
6958 first += pos(bset->dim, type) - 1;
6959 return isl_basic_set_vars_get_sign(bset, first, n, signs);
6962 /* Check if the given map is single-valued.
6967 * and check if the result is a subset of the identity mapping.
6969 int isl_map_is_single_valued(__isl_keep isl_map *map)
6975 test = isl_map_reverse(isl_map_copy(map));
6976 test = isl_map_apply_range(test, isl_map_copy(map));
6978 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
6980 sv = isl_map_is_subset(test, id);
6988 int isl_map_is_bijective(__isl_keep isl_map *map)
6992 sv = isl_map_is_single_valued(map);
6996 map = isl_map_copy(map);
6997 map = isl_map_reverse(map);
6998 sv = isl_map_is_single_valued(map);
7004 int isl_set_is_singleton(__isl_keep isl_set *set)
7006 return isl_map_is_single_valued((isl_map *)set);
7009 int isl_map_is_translation(__isl_keep isl_map *map)
7014 delta = isl_map_deltas(isl_map_copy(map));
7015 ok = isl_set_is_singleton(delta);
7016 isl_set_free(delta);
7021 static int unique(isl_int *p, unsigned pos, unsigned len)
7023 if (isl_seq_first_non_zero(p, pos) != -1)
7025 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7030 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7039 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7042 nvar = isl_basic_set_dim(bset, isl_dim_set);
7043 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7044 for (j = 0; j < nvar; ++j) {
7045 int lower = 0, upper = 0;
7046 for (i = 0; i < bset->n_eq; ++i) {
7047 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7049 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7055 for (i = 0; i < bset->n_ineq; ++i) {
7056 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7058 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7060 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7065 if (!lower || !upper)
7072 int isl_set_is_box(__isl_keep isl_set *set)
7079 return isl_basic_set_is_box(set->p[0]);
7082 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7087 return isl_dim_is_wrapping(bset->dim);
7090 int isl_set_is_wrapping(__isl_keep isl_set *set)
7095 return isl_dim_is_wrapping(set->dim);
7098 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7100 bmap = isl_basic_map_cow(bmap);
7104 bmap->dim = isl_dim_wrap(bmap->dim);
7108 bmap = isl_basic_map_finalize(bmap);
7110 return (isl_basic_set *)bmap;
7112 isl_basic_map_free(bmap);
7116 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7120 map = isl_map_cow(map);
7124 for (i = 0; i < map->n; ++i) {
7125 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7129 map->dim = isl_dim_wrap(map->dim);
7133 return (isl_set *)map;
7139 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7141 bset = isl_basic_set_cow(bset);
7145 bset->dim = isl_dim_unwrap(bset->dim);
7149 bset = isl_basic_set_finalize(bset);
7151 return (isl_basic_map *)bset;
7153 isl_basic_set_free(bset);
7157 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7164 if (!isl_set_is_wrapping(set))
7165 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7168 set = isl_set_cow(set);
7172 for (i = 0; i < set->n; ++i) {
7173 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7178 set->dim = isl_dim_unwrap(set->dim);
7182 return (isl_map *)set;
7188 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7189 enum isl_dim_type type)
7194 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7197 bmap = isl_basic_map_cow(bmap);
7201 bmap->dim = isl_dim_reset(bmap->dim, type);
7205 bmap = isl_basic_map_finalize(bmap);
7209 isl_basic_map_free(bmap);
7213 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7214 enum isl_dim_type type)
7221 if (!isl_dim_is_named_or_nested(map->dim, type))
7224 map = isl_map_cow(map);
7228 for (i = 0; i < map->n; ++i) {
7229 map->p[i] = isl_basic_map_reset(map->p[i], type);
7233 map->dim = isl_dim_reset(map->dim, type);
7243 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7248 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7251 bmap = isl_basic_map_cow(bmap);
7255 bmap->dim = isl_dim_flatten(bmap->dim);
7259 bmap = isl_basic_map_finalize(bmap);
7263 isl_basic_map_free(bmap);
7267 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7274 if (!map->dim->nested[0] && !map->dim->nested[1])
7277 map = isl_map_cow(map);
7281 for (i = 0; i < map->n; ++i) {
7282 map->p[i] = isl_basic_map_flatten(map->p[i]);
7286 map->dim = isl_dim_flatten(map->dim);