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->dim->n_in;
195 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
197 return bmap->dim->n_out;
200 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
202 return bmap->dim->nparam;
205 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
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_map_get_ctx(__isl_keep isl_map *map)
267 return map ? map->ctx : NULL;
270 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
274 return isl_dim_copy(bmap->dim);
277 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
281 return isl_dim_copy(bset->dim);
284 struct isl_dim *isl_map_get_dim(struct isl_map *map)
288 return isl_dim_copy(map->dim);
291 struct isl_dim *isl_set_get_dim(struct isl_set *set)
295 return isl_dim_copy(set->dim);
298 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
299 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
301 bmap = isl_basic_map_cow(bmap);
304 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
309 isl_basic_map_free(bmap);
313 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
314 enum isl_dim_type type, const char *s)
318 map = isl_map_cow(map);
322 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
326 for (i = 0; i < map->n; ++i) {
327 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
338 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
339 __isl_take isl_basic_map *bmap,
340 enum isl_dim_type type, unsigned pos, const char *s)
344 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
349 isl_basic_map_free(bmap);
353 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
354 enum isl_dim_type type, unsigned pos, const char *s)
361 map->dim = isl_dim_set_name(map->dim, type, pos, s);
365 for (i = 0; i < map->n; ++i) {
366 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
377 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
378 __isl_take isl_basic_set *bset,
379 enum isl_dim_type type, unsigned pos, const char *s)
381 return (isl_basic_set *)isl_basic_map_set_dim_name(
382 (isl_basic_map *)bset, type, pos, s);
385 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
386 enum isl_dim_type type, unsigned pos, const char *s)
388 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
391 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
395 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
398 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
399 struct isl_basic_map *bmap, unsigned extra,
400 unsigned n_eq, unsigned n_ineq)
403 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
408 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
409 if (isl_blk_is_error(bmap->block))
412 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
417 bmap->block2 = isl_blk_empty();
420 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
421 if (isl_blk_is_error(bmap->block2))
424 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
429 for (i = 0; i < n_ineq + n_eq; ++i)
430 bmap->ineq[i] = bmap->block.data + i * row_size;
432 for (i = 0; i < extra; ++i)
433 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
437 bmap->c_size = n_eq + n_ineq;
438 bmap->eq = bmap->ineq + n_ineq;
447 isl_basic_map_free(bmap);
451 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
452 unsigned nparam, unsigned dim, unsigned extra,
453 unsigned n_eq, unsigned n_ineq)
455 struct isl_basic_map *bmap;
456 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
457 return (struct isl_basic_set *)bmap;
460 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
461 unsigned extra, unsigned n_eq, unsigned n_ineq)
463 struct isl_basic_map *bmap;
466 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
467 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
468 return (struct isl_basic_set *)bmap;
471 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
472 unsigned extra, unsigned n_eq, unsigned n_ineq)
474 struct isl_basic_map *bmap;
478 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
483 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
489 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
490 unsigned nparam, unsigned in, unsigned out, unsigned extra,
491 unsigned n_eq, unsigned n_ineq)
493 struct isl_basic_map *bmap;
496 dim = isl_dim_alloc(ctx, nparam, in, out);
500 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
504 static void dup_constraints(
505 struct isl_basic_map *dst, struct isl_basic_map *src)
508 unsigned total = isl_basic_map_total_dim(src);
510 for (i = 0; i < src->n_eq; ++i) {
511 int j = isl_basic_map_alloc_equality(dst);
512 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
515 for (i = 0; i < src->n_ineq; ++i) {
516 int j = isl_basic_map_alloc_inequality(dst);
517 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
520 for (i = 0; i < src->n_div; ++i) {
521 int j = isl_basic_map_alloc_div(dst);
522 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
524 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
527 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
529 struct isl_basic_map *dup;
533 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
534 bmap->n_div, bmap->n_eq, bmap->n_ineq);
537 dup_constraints(dup, bmap);
538 dup->flags = bmap->flags;
539 dup->sample = isl_vec_copy(bmap->sample);
543 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
545 struct isl_basic_map *dup;
547 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
548 return (struct isl_basic_set *)dup;
551 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
556 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
560 return isl_basic_set_dup(bset);
563 struct isl_set *isl_set_copy(struct isl_set *set)
572 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
577 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
581 bmap = isl_basic_map_dup(bmap);
583 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
587 struct isl_map *isl_map_copy(struct isl_map *map)
596 void isl_basic_map_free(struct isl_basic_map *bmap)
604 isl_ctx_deref(bmap->ctx);
606 isl_blk_free(bmap->ctx, bmap->block2);
608 isl_blk_free(bmap->ctx, bmap->block);
609 isl_vec_free(bmap->sample);
610 isl_dim_free(bmap->dim);
614 void isl_basic_set_free(struct isl_basic_set *bset)
616 isl_basic_map_free((struct isl_basic_map *)bset);
619 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
621 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
624 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
630 isl_assert(ctx, room_for_con(bmap, 1), return -1);
631 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
633 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
634 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
635 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
636 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
637 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
638 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
640 int j = isl_basic_map_alloc_inequality(bmap);
644 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
645 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
652 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
653 bmap->extra - bmap->n_div);
657 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
659 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
662 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
666 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
671 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
673 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
676 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
681 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
683 if (pos != bmap->n_eq - 1) {
685 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
686 bmap->eq[bmap->n_eq - 1] = t;
692 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
694 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
697 void isl_basic_map_inequality_to_equality(
698 struct isl_basic_map *bmap, unsigned pos)
703 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
704 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
709 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
710 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
711 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
712 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
715 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
717 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
720 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
726 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
727 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
728 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
729 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
730 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
731 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
732 1 + isl_basic_map_total_dim(bmap),
733 bmap->extra - bmap->n_div);
734 return bmap->n_ineq++;
737 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
739 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
742 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
746 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
751 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
753 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
756 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
761 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
763 if (pos != bmap->n_ineq - 1) {
765 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
766 bmap->ineq[bmap->n_ineq - 1] = t;
767 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
773 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
775 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
778 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
783 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
786 k = isl_basic_map_alloc_equality(bmap);
789 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
792 isl_basic_map_free(bmap);
796 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
799 return (isl_basic_set *)
800 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
803 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
808 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
811 k = isl_basic_map_alloc_inequality(bmap);
814 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
817 isl_basic_map_free(bmap);
821 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
824 return (isl_basic_set *)
825 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
828 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
832 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
833 isl_seq_clr(bmap->div[bmap->n_div] +
834 1 + 1 + isl_basic_map_total_dim(bmap),
835 bmap->extra - bmap->n_div);
836 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
837 return bmap->n_div++;
840 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
842 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
845 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
849 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
854 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
856 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
859 /* Copy constraint from src to dst, putting the vars of src at offset
860 * dim_off in dst and the divs of src at offset div_off in dst.
861 * If both sets are actually map, then dim_off applies to the input
864 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
865 struct isl_basic_map *src_map, isl_int *src,
866 unsigned in_off, unsigned out_off, unsigned div_off)
868 unsigned src_nparam = isl_basic_map_n_param(src_map);
869 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
870 unsigned src_in = isl_basic_map_n_in(src_map);
871 unsigned dst_in = isl_basic_map_n_in(dst_map);
872 unsigned src_out = isl_basic_map_n_out(src_map);
873 unsigned dst_out = isl_basic_map_n_out(dst_map);
874 isl_int_set(dst[0], src[0]);
875 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
876 if (dst_nparam > src_nparam)
877 isl_seq_clr(dst+1+src_nparam,
878 dst_nparam - src_nparam);
879 isl_seq_clr(dst+1+dst_nparam, in_off);
880 isl_seq_cpy(dst+1+dst_nparam+in_off,
882 isl_min(dst_in-in_off, src_in));
883 if (dst_in-in_off > src_in)
884 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
885 dst_in - in_off - src_in);
886 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
887 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
888 src+1+src_nparam+src_in,
889 isl_min(dst_out-out_off, src_out));
890 if (dst_out-out_off > src_out)
891 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
892 dst_out - out_off - src_out);
893 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
894 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
895 src+1+src_nparam+src_in+src_out,
896 isl_min(dst_map->extra-div_off, src_map->n_div));
897 if (dst_map->n_div-div_off > src_map->n_div)
898 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
899 div_off+src_map->n_div,
900 dst_map->n_div - div_off - src_map->n_div);
903 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
904 struct isl_basic_map *src_map, isl_int *src,
905 unsigned in_off, unsigned out_off, unsigned div_off)
907 isl_int_set(dst[0], src[0]);
908 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
911 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
912 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
917 if (!bmap1 || !bmap2)
920 div_off = bmap1->n_div;
922 for (i = 0; i < bmap2->n_eq; ++i) {
923 int i1 = isl_basic_map_alloc_equality(bmap1);
926 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
927 i_pos, o_pos, div_off);
930 for (i = 0; i < bmap2->n_ineq; ++i) {
931 int i1 = isl_basic_map_alloc_inequality(bmap1);
934 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
935 i_pos, o_pos, div_off);
938 for (i = 0; i < bmap2->n_div; ++i) {
939 int i1 = isl_basic_map_alloc_div(bmap1);
942 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
943 i_pos, o_pos, div_off);
946 isl_basic_map_free(bmap2);
951 isl_basic_map_free(bmap1);
952 isl_basic_map_free(bmap2);
956 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
957 struct isl_dim_map *dim_map)
961 for (i = 0; i < dim_map->len; ++i) {
962 if (dim_map->pos[i] < 0)
963 isl_int_set_si(dst[i], 0);
965 isl_int_set(dst[i], src[dim_map->pos[i]]);
969 static void copy_div_dim_map(isl_int *dst, isl_int *src,
970 struct isl_dim_map *dim_map)
972 isl_int_set(dst[0], src[0]);
973 copy_constraint_dim_map(dst+1, src+1, dim_map);
976 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
977 struct isl_basic_map *src, struct isl_dim_map *dim_map)
981 if (!src || !dst || !dim_map)
984 for (i = 0; i < src->n_eq; ++i) {
985 int i1 = isl_basic_map_alloc_equality(dst);
988 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
991 for (i = 0; i < src->n_ineq; ++i) {
992 int i1 = isl_basic_map_alloc_inequality(dst);
995 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
998 for (i = 0; i < src->n_div; ++i) {
999 int i1 = isl_basic_map_alloc_div(dst);
1002 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1006 isl_basic_map_free(src);
1011 isl_basic_map_free(src);
1012 isl_basic_map_free(dst);
1016 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1017 struct isl_basic_set *bset2, unsigned pos)
1019 return (struct isl_basic_set *)
1020 add_constraints((struct isl_basic_map *)bset1,
1021 (struct isl_basic_map *)bset2, 0, pos);
1024 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1025 struct isl_dim *dim, unsigned extra,
1026 unsigned n_eq, unsigned n_ineq)
1028 struct isl_basic_map *ext;
1038 dims_ok = isl_dim_equal(base->dim, dim) &&
1039 base->extra >= base->n_div + extra;
1041 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1042 room_for_ineq(base, n_ineq)) {
1047 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1048 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1049 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1050 extra += base->extra;
1052 n_ineq += base->n_ineq;
1054 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1060 ext->sample = isl_vec_copy(base->sample);
1061 flags = base->flags;
1062 ext = add_constraints(ext, base, 0, 0);
1065 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1072 isl_basic_map_free(base);
1076 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1077 struct isl_dim *dim, unsigned extra,
1078 unsigned n_eq, unsigned n_ineq)
1080 return (struct isl_basic_set *)
1081 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1082 extra, n_eq, n_ineq);
1085 struct isl_basic_map *isl_basic_map_extend_constraints(
1086 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1090 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1094 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1095 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1096 unsigned n_eq, unsigned n_ineq)
1098 struct isl_basic_map *bmap;
1099 struct isl_dim *dim;
1103 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1107 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1110 isl_basic_map_free(base);
1114 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1115 unsigned nparam, unsigned dim, unsigned extra,
1116 unsigned n_eq, unsigned n_ineq)
1118 return (struct isl_basic_set *)
1119 isl_basic_map_extend((struct isl_basic_map *)base,
1120 nparam, 0, dim, extra, n_eq, n_ineq);
1123 struct isl_basic_set *isl_basic_set_extend_constraints(
1124 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1126 return (struct isl_basic_set *)
1127 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1131 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1133 return (struct isl_basic_set *)
1134 isl_basic_map_cow((struct isl_basic_map *)bset);
1137 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1142 if (bmap->ref > 1) {
1144 bmap = isl_basic_map_dup(bmap);
1147 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1151 struct isl_set *isl_set_cow(struct isl_set *set)
1159 return isl_set_dup(set);
1162 struct isl_map *isl_map_cow(struct isl_map *map)
1170 return isl_map_dup(map);
1173 static void swap_vars(struct isl_blk blk, isl_int *a,
1174 unsigned a_len, unsigned b_len)
1176 isl_seq_cpy(blk.data, a+a_len, b_len);
1177 isl_seq_cpy(blk.data+b_len, a, a_len);
1178 isl_seq_cpy(a, blk.data, b_len+a_len);
1181 struct isl_basic_set *isl_basic_set_swap_vars(
1182 struct isl_basic_set *bset, unsigned n)
1192 nparam = isl_basic_set_n_param(bset);
1193 dim = isl_basic_set_n_dim(bset);
1194 isl_assert(bset->ctx, n <= dim, goto error);
1199 bset = isl_basic_set_cow(bset);
1203 blk = isl_blk_alloc(bset->ctx, dim);
1204 if (isl_blk_is_error(blk))
1207 for (i = 0; i < bset->n_eq; ++i)
1209 bset->eq[i]+1+nparam, n, dim - n);
1211 for (i = 0; i < bset->n_ineq; ++i)
1213 bset->ineq[i]+1+nparam, n, dim - n);
1215 for (i = 0; i < bset->n_div; ++i)
1217 bset->div[i]+1+1+nparam, n, dim - n);
1219 isl_blk_free(bset->ctx, blk);
1221 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1222 return isl_basic_set_gauss(bset, NULL);
1224 isl_basic_set_free(bset);
1228 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1231 set = isl_set_cow(set);
1235 for (i = 0; i < set->n; ++i) {
1236 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1242 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1246 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1252 total = isl_basic_map_total_dim(bmap);
1253 isl_basic_map_free_div(bmap, bmap->n_div);
1254 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1256 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1258 i = isl_basic_map_alloc_equality(bmap);
1262 isl_int_set_si(bmap->eq[i][0], 1);
1263 isl_seq_clr(bmap->eq[i]+1, total);
1264 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1265 isl_vec_free(bmap->sample);
1266 bmap->sample = NULL;
1267 return isl_basic_map_finalize(bmap);
1269 isl_basic_map_free(bmap);
1273 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1275 return (struct isl_basic_set *)
1276 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1279 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1282 unsigned off = isl_dim_total(bmap->dim);
1283 isl_int *t = bmap->div[a];
1284 bmap->div[a] = bmap->div[b];
1287 for (i = 0; i < bmap->n_eq; ++i)
1288 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1290 for (i = 0; i < bmap->n_ineq; ++i)
1291 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1293 for (i = 0; i < bmap->n_div; ++i)
1294 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1295 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1298 /* Eliminate the specified n dimensions starting at first from the
1299 * constraints using Fourier-Motzkin. The dimensions themselves
1302 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1303 enum isl_dim_type type, unsigned first, unsigned n)
1312 map = isl_map_cow(map);
1315 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1316 first += pos(map->dim, type) - 1;
1318 for (i = 0; i < map->n; ++i) {
1319 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1329 /* Eliminate the specified n dimensions starting at first from the
1330 * constraints using Fourier-Motzkin. The dimensions themselves
1333 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1334 enum isl_dim_type type, unsigned first, unsigned n)
1336 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1339 /* Eliminate the specified n dimensions starting at first from the
1340 * constraints using Fourier-Motzkin. The dimensions themselves
1343 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1344 unsigned first, unsigned n)
1346 return isl_set_eliminate(set, isl_dim_set, first, n);
1349 /* Project out n dimensions starting at first using Fourier-Motzkin */
1350 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1351 unsigned first, unsigned n)
1353 set = isl_set_eliminate_dims(set, first, n);
1354 set = isl_set_drop_dims(set, first, n);
1358 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1360 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1368 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1377 set = isl_set_cow(set);
1381 for (i = 0; i < set->n; ++i) {
1382 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1392 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1393 enum isl_dim_type type, unsigned first, unsigned n)
1397 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1401 bmap = isl_basic_map_eliminate_vars(bmap,
1402 isl_basic_map_offset(bmap, type) - 1 + first, n);
1405 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1407 bmap = isl_basic_map_drop(bmap, type, first, n);
1410 isl_basic_map_free(bmap);
1414 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1415 enum isl_dim_type type, unsigned first, unsigned n)
1417 return (isl_basic_set *)
1418 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1421 struct isl_map *isl_map_remove(struct isl_map *map,
1422 enum isl_dim_type type, unsigned first, unsigned n)
1429 map = isl_map_cow(map);
1432 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1434 for (i = 0; i < map->n; ++i) {
1435 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1436 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1440 map = isl_map_drop(map, type, first, n);
1447 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1448 enum isl_dim_type type, unsigned first, unsigned n)
1450 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1453 /* Project out n inputs starting at first using Fourier-Motzkin */
1454 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1455 unsigned first, unsigned n)
1457 return isl_map_remove(map, isl_dim_in, first, n);
1460 /* Project out n dimensions starting at first using Fourier-Motzkin */
1461 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1462 unsigned first, unsigned n)
1464 unsigned nparam = isl_basic_set_n_param(bset);
1465 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1466 bset = isl_basic_set_drop_dims(bset, first, n);
1470 static void dump_term(struct isl_basic_map *bmap,
1471 isl_int c, int pos, FILE *out)
1474 unsigned in = isl_basic_map_n_in(bmap);
1475 unsigned dim = in + isl_basic_map_n_out(bmap);
1476 unsigned nparam = isl_basic_map_n_param(bmap);
1478 isl_int_print(out, c, 0);
1480 if (!isl_int_is_one(c))
1481 isl_int_print(out, c, 0);
1482 if (pos < 1 + nparam) {
1483 name = isl_dim_get_name(bmap->dim,
1484 isl_dim_param, pos - 1);
1486 fprintf(out, "%s", name);
1488 fprintf(out, "p%d", pos - 1);
1489 } else if (pos < 1 + nparam + in)
1490 fprintf(out, "i%d", pos - 1 - nparam);
1491 else if (pos < 1 + nparam + dim)
1492 fprintf(out, "o%d", pos - 1 - nparam - in);
1494 fprintf(out, "e%d", pos - 1 - nparam - dim);
1498 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1499 int sign, FILE *out)
1503 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1507 for (i = 0, first = 1; i < len; ++i) {
1508 if (isl_int_sgn(c[i]) * sign <= 0)
1511 fprintf(out, " + ");
1513 isl_int_abs(v, c[i]);
1514 dump_term(bmap, v, i, out);
1521 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1522 const char *op, FILE *out, int indent)
1526 fprintf(out, "%*s", indent, "");
1528 dump_constraint_sign(bmap, c, 1, out);
1529 fprintf(out, " %s ", op);
1530 dump_constraint_sign(bmap, c, -1, out);
1534 for (i = bmap->n_div; i < bmap->extra; ++i) {
1535 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1537 fprintf(out, "%*s", indent, "");
1538 fprintf(out, "ERROR: unused div coefficient not zero\n");
1543 static void dump_constraints(struct isl_basic_map *bmap,
1544 isl_int **c, unsigned n,
1545 const char *op, FILE *out, int indent)
1549 for (i = 0; i < n; ++i)
1550 dump_constraint(bmap, c[i], op, out, indent);
1553 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1557 unsigned total = isl_basic_map_total_dim(bmap);
1559 for (j = 0; j < 1 + total; ++j) {
1560 if (isl_int_is_zero(exp[j]))
1562 if (!first && isl_int_is_pos(exp[j]))
1564 dump_term(bmap, exp[j], j, out);
1569 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1573 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1574 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1576 for (i = 0; i < bmap->n_div; ++i) {
1577 fprintf(out, "%*s", indent, "");
1578 fprintf(out, "e%d = [(", i);
1579 dump_affine(bmap, bmap->div[i]+1, out);
1581 isl_int_print(out, bmap->div[i][0], 0);
1582 fprintf(out, "]\n");
1586 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1589 fprintf(out, "null basic set\n");
1593 fprintf(out, "%*s", indent, "");
1594 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1595 bset->ref, bset->dim->nparam, bset->dim->n_out,
1596 bset->extra, bset->flags);
1597 dump((struct isl_basic_map *)bset, out, indent);
1600 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1603 fprintf(out, "null basic map\n");
1607 fprintf(out, "%*s", indent, "");
1608 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1609 "flags: %x, n_name: %d\n",
1611 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1612 bmap->extra, bmap->flags, bmap->dim->n_name);
1613 dump(bmap, out, indent);
1616 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1621 total = isl_basic_map_total_dim(bmap);
1622 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1623 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1624 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1625 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1629 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1631 struct isl_set *set;
1635 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1636 isl_assert(dim->ctx, n >= 0, return NULL);
1637 set = isl_alloc(dim->ctx, struct isl_set,
1638 sizeof(struct isl_set) +
1639 (n - 1) * sizeof(struct isl_basic_set *));
1643 set->ctx = dim->ctx;
1644 isl_ctx_ref(set->ctx);
1656 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1657 unsigned nparam, unsigned dim, int n, unsigned flags)
1659 struct isl_set *set;
1660 struct isl_dim *dims;
1662 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1666 set = isl_set_alloc_dim(dims, n, flags);
1670 /* Make sure "map" has room for at least "n" more basic maps.
1672 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1675 struct isl_map *grown = NULL;
1679 isl_assert(map->ctx, n >= 0, goto error);
1680 if (map->n + n <= map->size)
1682 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1685 for (i = 0; i < map->n; ++i) {
1686 grown->p[i] = isl_basic_map_copy(map->p[i]);
1694 isl_map_free(grown);
1699 /* Make sure "set" has room for at least "n" more basic sets.
1701 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1703 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1706 struct isl_set *isl_set_dup(struct isl_set *set)
1709 struct isl_set *dup;
1714 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1717 for (i = 0; i < set->n; ++i)
1718 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1722 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1724 struct isl_set *set;
1729 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1731 isl_basic_set_free(bset);
1734 return isl_set_add_basic_set(set, bset);
1737 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1739 struct isl_map *map;
1744 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1746 isl_basic_map_free(bmap);
1749 return isl_map_add_basic_map(map, bmap);
1752 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1753 __isl_take isl_basic_set *bset)
1755 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1756 (struct isl_basic_map *)bset);
1759 void isl_set_free(struct isl_set *set)
1769 isl_ctx_deref(set->ctx);
1770 for (i = 0; i < set->n; ++i)
1771 isl_basic_set_free(set->p[i]);
1772 isl_dim_free(set->dim);
1776 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1781 fprintf(out, "null set\n");
1785 fprintf(out, "%*s", indent, "");
1786 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1787 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1789 for (i = 0; i < set->n; ++i) {
1790 fprintf(out, "%*s", indent, "");
1791 fprintf(out, "basic set %d:\n", i);
1792 isl_basic_set_dump(set->p[i], out, indent+4);
1796 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1801 fprintf(out, "null map\n");
1805 fprintf(out, "%*s", indent, "");
1806 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1807 "flags: %x, n_name: %d\n",
1808 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1809 map->dim->n_out, map->flags, map->dim->n_name);
1810 for (i = 0; i < map->n; ++i) {
1811 fprintf(out, "%*s", indent, "");
1812 fprintf(out, "basic map %d:\n", i);
1813 isl_basic_map_dump(map->p[i], out, indent+4);
1817 struct isl_basic_map *isl_basic_map_intersect_domain(
1818 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1820 struct isl_basic_map *bmap_domain;
1821 struct isl_dim *dim;
1826 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1827 bset->dim, isl_dim_param), goto error);
1829 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1830 isl_assert(bset->ctx,
1831 isl_basic_map_compatible_domain(bmap, bset), goto error);
1833 bmap = isl_basic_map_cow(bmap);
1836 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1837 bset->n_div, bset->n_eq, bset->n_ineq);
1838 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1839 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1840 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1842 bmap = isl_basic_map_simplify(bmap);
1843 return isl_basic_map_finalize(bmap);
1845 isl_basic_map_free(bmap);
1846 isl_basic_set_free(bset);
1850 struct isl_basic_map *isl_basic_map_intersect_range(
1851 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1853 struct isl_basic_map *bmap_range;
1858 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1859 bset->dim, isl_dim_param), goto error);
1861 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1862 isl_assert(bset->ctx,
1863 isl_basic_map_compatible_range(bmap, bset), goto error);
1865 bmap = isl_basic_map_cow(bmap);
1868 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1869 bset->n_div, bset->n_eq, bset->n_ineq);
1870 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1871 bmap = add_constraints(bmap, bmap_range, 0, 0);
1873 bmap = isl_basic_map_simplify(bmap);
1874 return isl_basic_map_finalize(bmap);
1876 isl_basic_map_free(bmap);
1877 isl_basic_set_free(bset);
1881 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1887 total = 1 + isl_basic_map_total_dim(bmap);
1888 if (total != vec->size)
1893 for (i = 0; i < bmap->n_eq; ++i) {
1894 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1895 if (!isl_int_is_zero(s)) {
1901 for (i = 0; i < bmap->n_ineq; ++i) {
1902 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1903 if (isl_int_is_neg(s)) {
1914 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1916 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1919 struct isl_basic_map *isl_basic_map_intersect(
1920 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1922 struct isl_vec *sample = NULL;
1924 if (!bmap1 || !bmap2)
1927 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1928 bmap2->dim, isl_dim_param), goto error);
1929 if (isl_dim_total(bmap1->dim) ==
1930 isl_dim_size(bmap1->dim, isl_dim_param) &&
1931 isl_dim_total(bmap2->dim) !=
1932 isl_dim_size(bmap2->dim, isl_dim_param))
1933 return isl_basic_map_intersect(bmap2, bmap1);
1935 if (isl_dim_total(bmap2->dim) !=
1936 isl_dim_size(bmap2->dim, isl_dim_param))
1937 isl_assert(bmap1->ctx,
1938 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1940 if (bmap1->sample &&
1941 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1942 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1943 sample = isl_vec_copy(bmap1->sample);
1944 else if (bmap2->sample &&
1945 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1946 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1947 sample = isl_vec_copy(bmap2->sample);
1949 bmap1 = isl_basic_map_cow(bmap1);
1952 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1953 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1954 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1957 isl_vec_free(sample);
1959 isl_vec_free(bmap1->sample);
1960 bmap1->sample = sample;
1963 bmap1 = isl_basic_map_simplify(bmap1);
1964 return isl_basic_map_finalize(bmap1);
1967 isl_vec_free(sample);
1968 isl_basic_map_free(bmap1);
1969 isl_basic_map_free(bmap2);
1973 struct isl_basic_set *isl_basic_set_intersect(
1974 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1976 return (struct isl_basic_set *)
1977 isl_basic_map_intersect(
1978 (struct isl_basic_map *)bset1,
1979 (struct isl_basic_map *)bset2);
1982 /* Special case of isl_map_intersect, where both map1 and map2
1983 * are convex, without any divs and such that either map1 or map2
1984 * contains a single constraint. This constraint is then simply
1985 * added to the other map.
1987 static __isl_give isl_map *map_intersect_add_constraint(
1988 __isl_take isl_map *map1, __isl_take isl_map *map2)
1990 struct isl_basic_map *bmap1;
1991 struct isl_basic_map *bmap2;
1993 isl_assert(map1->ctx, map1->n == 1, goto error);
1994 isl_assert(map2->ctx, map1->n == 1, goto error);
1995 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
1996 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
1998 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
1999 return isl_map_intersect(map2, map1);
2001 isl_assert(map2->ctx,
2002 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2004 map1 = isl_map_cow(map1);
2007 if (isl_map_fast_is_empty(map1)) {
2011 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2012 if (map2->p[0]->n_eq == 1)
2013 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2015 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2016 map2->p[0]->ineq[0]);
2018 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2019 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2023 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2024 isl_basic_map_free(map1->p[0]);
2037 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2040 struct isl_map *result;
2046 if (isl_map_fast_is_empty(map1)) {
2050 if (isl_map_fast_is_empty(map2)) {
2055 if (map1->n == 1 && map2->n == 1 &&
2056 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2057 isl_dim_equal(map1->dim, map2->dim) &&
2058 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2059 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2060 return map_intersect_add_constraint(map1, map2);
2061 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2062 map2->dim, isl_dim_param), goto error);
2063 if (isl_dim_total(map1->dim) ==
2064 isl_dim_size(map1->dim, isl_dim_param) &&
2065 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2066 return isl_map_intersect(map2, map1);
2068 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2069 isl_assert(map1->ctx,
2070 isl_dim_equal(map1->dim, map2->dim), goto error);
2072 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2073 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2074 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2076 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2077 map1->n * map2->n, flags);
2080 for (i = 0; i < map1->n; ++i)
2081 for (j = 0; j < map2->n; ++j) {
2082 struct isl_basic_map *part;
2083 part = isl_basic_map_intersect(
2084 isl_basic_map_copy(map1->p[i]),
2085 isl_basic_map_copy(map2->p[j]));
2086 if (isl_basic_map_is_empty(part))
2087 isl_basic_map_free(part);
2089 result = isl_map_add_basic_map(result, part);
2102 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2104 return (struct isl_set *)
2105 isl_map_intersect((struct isl_map *)set1,
2106 (struct isl_map *)set2);
2109 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2111 struct isl_dim *dim;
2112 struct isl_basic_set *bset;
2117 bmap = isl_basic_map_cow(bmap);
2120 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2121 in = isl_basic_map_n_in(bmap);
2122 bset = isl_basic_set_from_basic_map(bmap);
2123 bset = isl_basic_set_swap_vars(bset, in);
2124 return isl_basic_map_from_basic_set(bset, dim);
2127 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2128 enum isl_dim_type type, unsigned pos, unsigned n)
2130 struct isl_dim *res_dim;
2131 struct isl_basic_map *res;
2132 struct isl_dim_map *dim_map;
2133 unsigned total, off;
2134 enum isl_dim_type t;
2142 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2144 total = isl_basic_map_total_dim(bmap) + n;
2145 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2147 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2149 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2151 unsigned size = isl_basic_map_dim(bmap, t);
2152 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2154 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2155 pos, size - pos, off + pos + n);
2157 off += isl_dim_size(res_dim, t);
2159 isl_dim_map_div(dim_map, bmap, off);
2161 res = isl_basic_map_alloc_dim(res_dim,
2162 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2163 res = add_constraints_dim_map(res, bmap, dim_map);
2164 res = isl_basic_map_simplify(res);
2165 return isl_basic_map_finalize(res);
2168 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2169 enum isl_dim_type type, unsigned n)
2173 return isl_basic_map_insert(bmap, type,
2174 isl_basic_map_dim(bmap, type), n);
2177 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2178 enum isl_dim_type type, unsigned n)
2182 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2183 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2185 isl_basic_set_free(bset);
2189 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2190 enum isl_dim_type type, unsigned pos, unsigned n)
2197 map = isl_map_cow(map);
2201 map->dim = isl_dim_insert(map->dim, type, pos, n);
2205 for (i = 0; i < map->n; ++i) {
2206 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2217 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2218 enum isl_dim_type type, unsigned n)
2222 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2225 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2226 enum isl_dim_type type, unsigned n)
2230 isl_assert(set->ctx, type != isl_dim_in, goto error);
2231 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2237 __isl_give isl_basic_map *isl_basic_map_move_dims(
2238 __isl_take isl_basic_map *bmap,
2239 enum isl_dim_type dst_type, unsigned dst_pos,
2240 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2243 struct isl_dim_map *dim_map;
2244 struct isl_basic_map *res;
2245 enum isl_dim_type t;
2246 unsigned total, off;
2253 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2256 if (dst_type == src_type && dst_pos == src_pos)
2259 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2261 if (pos(bmap->dim, dst_type) + dst_pos ==
2262 pos(bmap->dim, src_type) + src_pos +
2263 ((src_type < dst_type) ? n : 0)) {
2264 bmap = isl_basic_map_cow(bmap);
2268 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2269 src_type, src_pos, n);
2273 bmap = isl_basic_map_finalize(bmap);
2278 total = isl_basic_map_total_dim(bmap);
2279 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2282 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2283 unsigned size = isl_dim_size(bmap->dim, t);
2284 if (t == dst_type) {
2285 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2288 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2291 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2292 dst_pos, size - dst_pos, off);
2293 off += size - dst_pos;
2294 } else if (t == src_type) {
2295 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2298 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2299 src_pos + n, size - src_pos - n, off);
2300 off += size - src_pos - n;
2302 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2306 isl_dim_map_div(dim_map, bmap, off);
2308 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2309 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2310 bmap = add_constraints_dim_map(res, bmap, dim_map);
2312 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2313 src_type, src_pos, n);
2317 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2318 bmap = isl_basic_map_gauss(bmap, NULL);
2319 bmap = isl_basic_map_finalize(bmap);
2323 isl_basic_map_free(bmap);
2327 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2328 enum isl_dim_type dst_type, unsigned dst_pos,
2329 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2331 return (isl_basic_set *)isl_basic_map_move_dims(
2332 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2335 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2336 enum isl_dim_type dst_type, unsigned dst_pos,
2337 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2341 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2342 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2343 src_type, src_pos, n);
2349 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2350 enum isl_dim_type dst_type, unsigned dst_pos,
2351 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2360 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2363 if (dst_type == src_type && dst_pos == src_pos)
2366 isl_assert(map->ctx, dst_type != src_type, goto error);
2368 map = isl_map_cow(map);
2372 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2376 for (i = 0; i < map->n; ++i) {
2377 map->p[i] = isl_basic_map_move_dims(map->p[i],
2379 src_type, src_pos, n);
2390 /* Move the specified dimensions to the last columns right before
2391 * the divs. Don't change the dimension specification of bmap.
2392 * That's the responsibility of the caller.
2394 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2395 enum isl_dim_type type, unsigned first, unsigned n)
2397 struct isl_dim_map *dim_map;
2398 struct isl_basic_map *res;
2399 enum isl_dim_type t;
2400 unsigned total, off;
2404 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2407 total = isl_basic_map_total_dim(bmap);
2408 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2411 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2412 unsigned size = isl_dim_size(bmap->dim, t);
2414 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2417 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2418 first, n, total - bmap->n_div - n);
2419 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2420 first + n, size - (first + n), off);
2421 off += size - (first + n);
2423 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2427 isl_dim_map_div(dim_map, bmap, off + n);
2429 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2430 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2431 res = add_constraints_dim_map(res, bmap, dim_map);
2435 /* Turn the n dimensions of type type, starting at first
2436 * into existentially quantified variables.
2438 __isl_give isl_basic_map *isl_basic_map_project_out(
2439 __isl_take isl_basic_map *bmap,
2440 enum isl_dim_type type, unsigned first, unsigned n)
2453 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2454 return isl_basic_map_remove(bmap, type, first, n);
2456 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2459 bmap = move_last(bmap, type, first, n);
2460 bmap = isl_basic_map_cow(bmap);
2464 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2465 old = bmap->block2.data;
2466 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2467 (bmap->extra + n) * (1 + row_size));
2468 if (!bmap->block2.data)
2470 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2473 for (i = 0; i < n; ++i) {
2474 new_div[i] = bmap->block2.data +
2475 (bmap->extra + i) * (1 + row_size);
2476 isl_seq_clr(new_div[i], 1 + row_size);
2478 for (i = 0; i < bmap->extra; ++i)
2479 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2481 bmap->div = new_div;
2485 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2488 bmap = isl_basic_map_simplify(bmap);
2489 bmap = isl_basic_map_drop_redundant_divs(bmap);
2490 return isl_basic_map_finalize(bmap);
2492 isl_basic_map_free(bmap);
2496 /* Turn the n dimensions of type type, starting at first
2497 * into existentially quantified variables.
2499 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2500 enum isl_dim_type type, unsigned first, unsigned n)
2502 return (isl_basic_set *)isl_basic_map_project_out(
2503 (isl_basic_map *)bset, type, first, n);
2506 /* Turn the n dimensions of type type, starting at first
2507 * into existentially quantified variables.
2509 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2510 enum isl_dim_type type, unsigned first, unsigned n)
2520 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2522 map = isl_map_cow(map);
2526 map->dim = isl_dim_drop(map->dim, type, first, n);
2530 for (i = 0; i < map->n; ++i) {
2531 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2542 /* Turn the n dimensions of type type, starting at first
2543 * into existentially quantified variables.
2545 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2546 enum isl_dim_type type, unsigned first, unsigned n)
2548 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2551 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2555 for (i = 0; i < n; ++i) {
2556 j = isl_basic_map_alloc_div(bmap);
2559 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2563 isl_basic_map_free(bmap);
2567 struct isl_basic_map *isl_basic_map_apply_range(
2568 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2570 struct isl_dim *dim_result = NULL;
2571 struct isl_basic_map *bmap;
2572 unsigned n_in, n_out, n, nparam, total, pos;
2573 struct isl_dim_map *dim_map1, *dim_map2;
2575 if (!bmap1 || !bmap2)
2578 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2579 isl_dim_copy(bmap2->dim));
2581 n_in = isl_basic_map_n_in(bmap1);
2582 n_out = isl_basic_map_n_out(bmap2);
2583 n = isl_basic_map_n_out(bmap1);
2584 nparam = isl_basic_map_n_param(bmap1);
2586 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2587 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2588 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2589 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2590 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2591 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2592 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2593 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2594 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2595 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2596 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2598 bmap = isl_basic_map_alloc_dim(dim_result,
2599 bmap1->n_div + bmap2->n_div + n,
2600 bmap1->n_eq + bmap2->n_eq,
2601 bmap1->n_ineq + bmap2->n_ineq);
2602 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2603 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2604 bmap = add_divs(bmap, n);
2605 bmap = isl_basic_map_simplify(bmap);
2606 bmap = isl_basic_map_drop_redundant_divs(bmap);
2607 return isl_basic_map_finalize(bmap);
2609 isl_basic_map_free(bmap1);
2610 isl_basic_map_free(bmap2);
2614 struct isl_basic_set *isl_basic_set_apply(
2615 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2620 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2623 return (struct isl_basic_set *)
2624 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2626 isl_basic_set_free(bset);
2627 isl_basic_map_free(bmap);
2631 struct isl_basic_map *isl_basic_map_apply_domain(
2632 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2634 if (!bmap1 || !bmap2)
2637 isl_assert(bmap1->ctx,
2638 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2639 isl_assert(bmap1->ctx,
2640 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2643 bmap1 = isl_basic_map_reverse(bmap1);
2644 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2645 return isl_basic_map_reverse(bmap1);
2647 isl_basic_map_free(bmap1);
2648 isl_basic_map_free(bmap2);
2652 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2653 * A \cap B -> f(A) + f(B)
2655 struct isl_basic_map *isl_basic_map_sum(
2656 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2658 unsigned n_in, n_out, nparam, total, pos;
2659 struct isl_basic_map *bmap = NULL;
2660 struct isl_dim_map *dim_map1, *dim_map2;
2663 if (!bmap1 || !bmap2)
2666 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2669 nparam = isl_basic_map_n_param(bmap1);
2670 n_in = isl_basic_map_n_in(bmap1);
2671 n_out = isl_basic_map_n_out(bmap1);
2673 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2674 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2675 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2676 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2677 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2678 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2679 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2680 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2681 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2682 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2683 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2685 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2686 bmap1->n_div + bmap2->n_div + 2 * n_out,
2687 bmap1->n_eq + bmap2->n_eq + n_out,
2688 bmap1->n_ineq + bmap2->n_ineq);
2689 for (i = 0; i < n_out; ++i) {
2690 int j = isl_basic_map_alloc_equality(bmap);
2693 isl_seq_clr(bmap->eq[j], 1+total);
2694 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2695 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2696 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2698 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2699 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2700 bmap = add_divs(bmap, 2 * n_out);
2702 bmap = isl_basic_map_simplify(bmap);
2703 return isl_basic_map_finalize(bmap);
2705 isl_basic_map_free(bmap);
2706 isl_basic_map_free(bmap1);
2707 isl_basic_map_free(bmap2);
2711 /* Given two maps A -> f(A) and B -> g(B), construct a map
2712 * A \cap B -> f(A) + f(B)
2714 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2716 struct isl_map *result;
2722 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2724 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2725 map1->n * map2->n, 0);
2728 for (i = 0; i < map1->n; ++i)
2729 for (j = 0; j < map2->n; ++j) {
2730 struct isl_basic_map *part;
2731 part = isl_basic_map_sum(
2732 isl_basic_map_copy(map1->p[i]),
2733 isl_basic_map_copy(map2->p[j]));
2734 if (isl_basic_map_is_empty(part))
2735 isl_basic_map_free(part);
2737 result = isl_map_add_basic_map(result, part);
2750 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2751 __isl_take isl_set *set2)
2753 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2756 /* Given a basic map A -> f(A), construct A -> -f(A).
2758 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2763 bmap = isl_basic_map_cow(bmap);
2767 n = isl_basic_map_dim(bmap, isl_dim_out);
2768 off = isl_basic_map_offset(bmap, isl_dim_out);
2769 for (i = 0; i < bmap->n_eq; ++i)
2770 for (j = 0; j < n; ++j)
2771 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2772 for (i = 0; i < bmap->n_ineq; ++i)
2773 for (j = 0; j < n; ++j)
2774 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2775 for (i = 0; i < bmap->n_div; ++i)
2776 for (j = 0; j < n; ++j)
2777 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2778 return isl_basic_map_finalize(bmap);
2781 /* Given a map A -> f(A), construct A -> -f(A).
2783 struct isl_map *isl_map_neg(struct isl_map *map)
2787 map = isl_map_cow(map);
2791 for (i = 0; i < map->n; ++i) {
2792 map->p[i] = isl_basic_map_neg(map->p[i]);
2803 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2805 return (isl_set *)isl_map_neg((isl_map *)set);
2808 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2809 * A -> floor(f(A)/d).
2811 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2814 unsigned n_in, n_out, nparam, total, pos;
2815 struct isl_basic_map *result = NULL;
2816 struct isl_dim_map *dim_map;
2822 nparam = isl_basic_map_n_param(bmap);
2823 n_in = isl_basic_map_n_in(bmap);
2824 n_out = isl_basic_map_n_out(bmap);
2826 total = nparam + n_in + n_out + bmap->n_div + n_out;
2827 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2828 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2829 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2830 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2831 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2833 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2834 bmap->n_div + n_out,
2835 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2836 result = add_constraints_dim_map(result, bmap, dim_map);
2837 result = add_divs(result, n_out);
2838 for (i = 0; i < n_out; ++i) {
2840 j = isl_basic_map_alloc_inequality(result);
2843 isl_seq_clr(result->ineq[j], 1+total);
2844 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2845 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2846 j = isl_basic_map_alloc_inequality(result);
2849 isl_seq_clr(result->ineq[j], 1+total);
2850 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2851 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2852 isl_int_sub_ui(result->ineq[j][0], d, 1);
2855 result = isl_basic_map_simplify(result);
2856 return isl_basic_map_finalize(result);
2858 isl_basic_map_free(result);
2862 /* Given a map A -> f(A) and an integer d, construct a map
2863 * A -> floor(f(A)/d).
2865 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2869 map = isl_map_cow(map);
2873 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2874 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2875 for (i = 0; i < map->n; ++i) {
2876 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2887 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2893 i = isl_basic_map_alloc_equality(bmap);
2896 nparam = isl_basic_map_n_param(bmap);
2897 n_in = isl_basic_map_n_in(bmap);
2898 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2899 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2900 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2901 return isl_basic_map_finalize(bmap);
2903 isl_basic_map_free(bmap);
2907 /* Add a constraints to "bmap" expressing i_pos < o_pos
2909 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2915 i = isl_basic_map_alloc_inequality(bmap);
2918 nparam = isl_basic_map_n_param(bmap);
2919 n_in = isl_basic_map_n_in(bmap);
2920 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2921 isl_int_set_si(bmap->ineq[i][0], -1);
2922 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2923 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2924 return isl_basic_map_finalize(bmap);
2926 isl_basic_map_free(bmap);
2930 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2932 static __isl_give isl_basic_map *var_less_or_equal(
2933 __isl_take isl_basic_map *bmap, unsigned pos)
2939 i = isl_basic_map_alloc_inequality(bmap);
2942 nparam = isl_basic_map_n_param(bmap);
2943 n_in = isl_basic_map_n_in(bmap);
2944 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2945 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2946 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2947 return isl_basic_map_finalize(bmap);
2949 isl_basic_map_free(bmap);
2953 /* Add a constraints to "bmap" expressing i_pos > o_pos
2955 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2961 i = isl_basic_map_alloc_inequality(bmap);
2964 nparam = isl_basic_map_n_param(bmap);
2965 n_in = isl_basic_map_n_in(bmap);
2966 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2967 isl_int_set_si(bmap->ineq[i][0], -1);
2968 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2969 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2970 return isl_basic_map_finalize(bmap);
2972 isl_basic_map_free(bmap);
2976 /* Add a constraint to "bmap" expressing i_pos >= o_pos
2978 static __isl_give isl_basic_map *var_more_or_equal(
2979 __isl_take isl_basic_map *bmap, unsigned pos)
2985 i = isl_basic_map_alloc_inequality(bmap);
2988 nparam = isl_basic_map_n_param(bmap);
2989 n_in = isl_basic_map_n_in(bmap);
2990 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2991 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
2992 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
2993 return isl_basic_map_finalize(bmap);
2995 isl_basic_map_free(bmap);
2999 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3002 struct isl_basic_map *bmap;
3003 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3006 for (i = 0; i < n_equal && bmap; ++i)
3007 bmap = var_equal(bmap, i);
3008 return isl_basic_map_finalize(bmap);
3011 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3013 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3016 struct isl_basic_map *bmap;
3017 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3020 for (i = 0; i < pos && bmap; ++i)
3021 bmap = var_equal(bmap, i);
3023 bmap = var_less(bmap, pos);
3024 return isl_basic_map_finalize(bmap);
3027 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3029 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3030 __isl_take isl_dim *dim, unsigned pos)
3033 isl_basic_map *bmap;
3035 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3036 for (i = 0; i < pos; ++i)
3037 bmap = var_equal(bmap, i);
3038 bmap = var_less_or_equal(bmap, pos);
3039 return isl_basic_map_finalize(bmap);
3042 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3044 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3047 struct isl_basic_map *bmap;
3048 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3051 for (i = 0; i < pos && bmap; ++i)
3052 bmap = var_equal(bmap, i);
3054 bmap = var_more(bmap, pos);
3055 return isl_basic_map_finalize(bmap);
3058 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3060 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3061 __isl_take isl_dim *dim, unsigned pos)
3064 isl_basic_map *bmap;
3066 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3067 for (i = 0; i < pos; ++i)
3068 bmap = var_equal(bmap, i);
3069 bmap = var_more_or_equal(bmap, pos);
3070 return isl_basic_map_finalize(bmap);
3073 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3074 unsigned n, int equal)
3076 struct isl_map *map;
3079 if (n == 0 && equal)
3080 return isl_map_universe(dims);
3082 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3084 for (i = 0; i + 1 < n; ++i)
3085 map = isl_map_add_basic_map(map,
3086 isl_basic_map_less_at(isl_dim_copy(dims), i));
3089 map = isl_map_add_basic_map(map,
3090 isl_basic_map_less_or_equal_at(dims, n - 1));
3092 map = isl_map_add_basic_map(map,
3093 isl_basic_map_less_at(dims, n - 1));
3100 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3104 return map_lex_lte_first(dims, dims->n_out, equal);
3107 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3109 return map_lex_lte_first(dim, n, 0);
3112 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3114 return map_lex_lte_first(dim, n, 1);
3117 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3119 return map_lex_lte(isl_dim_map(set_dim), 0);
3122 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3124 return map_lex_lte(isl_dim_map(set_dim), 1);
3127 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3128 unsigned n, int equal)
3130 struct isl_map *map;
3133 if (n == 0 && equal)
3134 return isl_map_universe(dims);
3136 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3138 for (i = 0; i + 1 < n; ++i)
3139 map = isl_map_add_basic_map(map,
3140 isl_basic_map_more_at(isl_dim_copy(dims), i));
3143 map = isl_map_add_basic_map(map,
3144 isl_basic_map_more_or_equal_at(dims, n - 1));
3146 map = isl_map_add_basic_map(map,
3147 isl_basic_map_more_at(dims, n - 1));
3154 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3158 return map_lex_gte_first(dims, dims->n_out, equal);
3161 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3163 return map_lex_gte_first(dim, n, 0);
3166 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3168 return map_lex_gte_first(dim, n, 1);
3171 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3173 return map_lex_gte(isl_dim_map(set_dim), 0);
3176 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3178 return map_lex_gte(isl_dim_map(set_dim), 1);
3181 struct isl_basic_map *isl_basic_map_from_basic_set(
3182 struct isl_basic_set *bset, struct isl_dim *dim)
3184 struct isl_basic_map *bmap;
3186 bset = isl_basic_set_cow(bset);
3190 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3191 isl_dim_free(bset->dim);
3192 bmap = (struct isl_basic_map *) bset;
3194 return isl_basic_map_finalize(bmap);
3196 isl_basic_set_free(bset);
3201 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3205 if (bmap->dim->n_in == 0)
3206 return (struct isl_basic_set *)bmap;
3207 bmap = isl_basic_map_cow(bmap);
3210 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3213 bmap = isl_basic_map_finalize(bmap);
3214 return (struct isl_basic_set *)bmap;
3216 isl_basic_map_free(bmap);
3220 /* For a div d = floor(f/m), add the constraints
3223 * -(f-(n-1)) + m d >= 0
3225 * Note that the second constraint is the negation of
3229 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3230 unsigned pos, isl_int *div)
3233 unsigned total = isl_basic_map_total_dim(bmap);
3235 i = isl_basic_map_alloc_inequality(bmap);
3238 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3239 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3241 j = isl_basic_map_alloc_inequality(bmap);
3244 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3245 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3246 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3250 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3251 unsigned pos, isl_int *div)
3253 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3257 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3259 unsigned total = isl_basic_map_total_dim(bmap);
3260 unsigned div_pos = total - bmap->n_div + div;
3262 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3266 struct isl_basic_set *isl_basic_map_underlying_set(
3267 struct isl_basic_map *bmap)
3271 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3272 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3273 return (struct isl_basic_set *)bmap;
3274 bmap = isl_basic_map_cow(bmap);
3277 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3280 bmap->extra -= bmap->n_div;
3282 bmap = isl_basic_map_finalize(bmap);
3283 return (struct isl_basic_set *)bmap;
3288 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3289 __isl_take isl_basic_set *bset)
3291 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3294 struct isl_basic_map *isl_basic_map_overlying_set(
3295 struct isl_basic_set *bset, struct isl_basic_map *like)
3297 struct isl_basic_map *bmap;
3298 struct isl_ctx *ctx;
3305 isl_assert(ctx, bset->n_div == 0, goto error);
3306 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3307 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3309 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3310 isl_basic_map_free(like);
3311 return (struct isl_basic_map *)bset;
3313 bset = isl_basic_set_cow(bset);
3316 total = bset->dim->n_out + bset->extra;
3317 bmap = (struct isl_basic_map *)bset;
3318 isl_dim_free(bmap->dim);
3319 bmap->dim = isl_dim_copy(like->dim);
3322 bmap->n_div = like->n_div;
3323 bmap->extra += like->n_div;
3326 ltotal = total - bmap->extra + like->extra;
3329 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3330 bmap->extra * (1 + 1 + total));
3331 if (isl_blk_is_error(bmap->block2))
3333 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3337 for (i = 0; i < bmap->extra; ++i)
3338 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3339 for (i = 0; i < like->n_div; ++i) {
3340 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3341 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3343 bmap = isl_basic_map_extend_constraints(bmap,
3344 0, 2 * like->n_div);
3345 for (i = 0; i < like->n_div; ++i) {
3346 if (isl_int_is_zero(bmap->div[i][0]))
3348 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3352 isl_basic_map_free(like);
3353 bmap = isl_basic_map_simplify(bmap);
3354 bmap = isl_basic_map_finalize(bmap);
3357 isl_basic_map_free(like);
3358 isl_basic_set_free(bset);
3362 struct isl_basic_set *isl_basic_set_from_underlying_set(
3363 struct isl_basic_set *bset, struct isl_basic_set *like)
3365 return (struct isl_basic_set *)
3366 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3369 struct isl_set *isl_set_from_underlying_set(
3370 struct isl_set *set, struct isl_basic_set *like)
3376 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3378 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3379 isl_basic_set_free(like);
3382 set = isl_set_cow(set);
3385 for (i = 0; i < set->n; ++i) {
3386 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3387 isl_basic_set_copy(like));
3391 isl_dim_free(set->dim);
3392 set->dim = isl_dim_copy(like->dim);
3395 isl_basic_set_free(like);
3398 isl_basic_set_free(like);
3403 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3407 map = isl_map_cow(map);
3410 map->dim = isl_dim_cow(map->dim);
3414 for (i = 1; i < map->n; ++i)
3415 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3417 for (i = 0; i < map->n; ++i) {
3418 map->p[i] = (struct isl_basic_map *)
3419 isl_basic_map_underlying_set(map->p[i]);
3424 map->dim = isl_dim_underlying(map->dim, 0);
3426 isl_dim_free(map->dim);
3427 map->dim = isl_dim_copy(map->p[0]->dim);
3431 return (struct isl_set *)map;
3437 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3439 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3442 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3443 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3445 bmap = isl_basic_map_cow(bmap);
3449 isl_dim_free(bmap->dim);
3454 isl_basic_map_free(bmap);
3459 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3460 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3462 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3466 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3467 __isl_take isl_dim *dim)
3471 map = isl_map_cow(map);
3475 for (i = 0; i < map->n; ++i) {
3476 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3481 isl_dim_free(map->dim);
3491 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3492 __isl_take isl_dim *dim)
3494 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3497 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3500 struct isl_basic_set *domain;
3506 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3508 n_in = isl_basic_map_n_in(bmap);
3509 n_out = isl_basic_map_n_out(bmap);
3510 domain = isl_basic_set_from_basic_map(bmap);
3511 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3513 domain = isl_basic_set_reset_dim(domain, dim);
3518 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3520 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3523 struct isl_set *isl_map_range(struct isl_map *map)
3526 struct isl_set *set;
3530 if (isl_map_dim(map, isl_dim_in) == 0)
3531 return (isl_set *)map;
3533 map = isl_map_cow(map);
3537 set = (struct isl_set *) map;
3538 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3541 for (i = 0; i < map->n; ++i) {
3542 set->p[i] = isl_basic_map_range(map->p[i]);
3546 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3547 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3554 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3557 struct isl_map *map = NULL;
3559 set = isl_set_cow(set);
3562 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3563 map = (struct isl_map *)set;
3564 for (i = 0; i < set->n; ++i) {
3565 map->p[i] = isl_basic_map_from_basic_set(
3566 set->p[i], isl_dim_copy(dim));
3570 isl_dim_free(map->dim);
3579 struct isl_map *isl_map_from_range(struct isl_set *set)
3581 return (struct isl_map *)set;
3584 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3586 return isl_map_reverse(isl_map_from_range(set));
3589 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3590 __isl_take isl_set *range)
3592 return isl_map_apply_range(isl_map_from_domain(domain),
3593 isl_map_from_range(range));
3596 struct isl_set *isl_set_from_map(struct isl_map *map)
3599 struct isl_set *set = NULL;
3603 map = isl_map_cow(map);
3606 map->dim = isl_dim_as_set_dim(map->dim);
3609 set = (struct isl_set *)map;
3610 for (i = 0; i < map->n; ++i) {
3611 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3621 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3623 struct isl_map *map;
3627 isl_assert(dim->ctx, n >= 0, return NULL);
3628 map = isl_alloc(dim->ctx, struct isl_map,
3629 sizeof(struct isl_map) +
3630 (n - 1) * sizeof(struct isl_basic_map *));
3634 map->ctx = dim->ctx;
3635 isl_ctx_ref(map->ctx);
3647 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3648 unsigned nparam, unsigned in, unsigned out, int n,
3651 struct isl_map *map;
3652 struct isl_dim *dims;
3654 dims = isl_dim_alloc(ctx, nparam, in, out);
3658 map = isl_map_alloc_dim(dims, n, flags);
3662 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3664 struct isl_basic_map *bmap;
3665 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3666 bmap = isl_basic_map_set_to_empty(bmap);
3670 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3672 struct isl_basic_set *bset;
3673 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3674 bset = isl_basic_set_set_to_empty(bset);
3678 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3680 struct isl_basic_map *bmap;
3683 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3684 bmap = isl_basic_map_set_to_empty(bmap);
3688 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3690 struct isl_basic_map *bmap;
3693 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3694 bmap = isl_basic_map_set_to_empty(bmap);
3698 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3700 struct isl_basic_set *bset;
3703 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3704 bset = isl_basic_set_set_to_empty(bset);
3708 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3710 struct isl_basic_map *bmap;
3711 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3715 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3717 struct isl_basic_set *bset;
3718 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3722 __isl_give isl_basic_map *isl_basic_map_universe_like(
3723 __isl_keep isl_basic_map *model)
3727 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3730 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3734 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3737 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3738 __isl_keep isl_set *model)
3742 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3745 struct isl_map *isl_map_empty(struct isl_dim *dim)
3747 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3750 struct isl_map *isl_map_empty_like(struct isl_map *model)
3754 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3757 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3761 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3764 struct isl_set *isl_set_empty(struct isl_dim *dim)
3766 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3769 struct isl_set *isl_set_empty_like(struct isl_set *model)
3773 return isl_set_empty(isl_dim_copy(model->dim));
3776 struct isl_map *isl_map_universe(struct isl_dim *dim)
3778 struct isl_map *map;
3781 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3782 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3786 struct isl_set *isl_set_universe(struct isl_dim *dim)
3788 struct isl_set *set;
3791 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3792 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3796 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3800 return isl_set_universe(isl_dim_copy(model->dim));
3803 struct isl_map *isl_map_dup(struct isl_map *map)
3806 struct isl_map *dup;
3810 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3811 for (i = 0; i < map->n; ++i)
3812 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3816 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3817 __isl_take isl_basic_map *bmap)
3821 if (isl_basic_map_fast_is_empty(bmap)) {
3822 isl_basic_map_free(bmap);
3825 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3826 isl_assert(map->ctx, map->n < map->size, goto error);
3827 map->p[map->n] = bmap;
3829 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3835 isl_basic_map_free(bmap);
3839 void isl_map_free(struct isl_map *map)
3849 isl_ctx_deref(map->ctx);
3850 for (i = 0; i < map->n; ++i)
3851 isl_basic_map_free(map->p[i]);
3852 isl_dim_free(map->dim);
3856 struct isl_map *isl_map_extend(struct isl_map *base,
3857 unsigned nparam, unsigned n_in, unsigned n_out)
3861 base = isl_map_cow(base);
3865 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3868 for (i = 0; i < base->n; ++i) {
3869 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3870 isl_dim_copy(base->dim), 0, 0, 0);
3880 struct isl_set *isl_set_extend(struct isl_set *base,
3881 unsigned nparam, unsigned dim)
3883 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3887 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3888 struct isl_basic_map *bmap, unsigned pos, int value)
3892 bmap = isl_basic_map_cow(bmap);
3893 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3894 j = isl_basic_map_alloc_equality(bmap);
3897 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3898 isl_int_set_si(bmap->eq[j][pos], -1);
3899 isl_int_set_si(bmap->eq[j][0], value);
3900 bmap = isl_basic_map_simplify(bmap);
3901 return isl_basic_map_finalize(bmap);
3903 isl_basic_map_free(bmap);
3907 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
3908 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
3912 bmap = isl_basic_map_cow(bmap);
3913 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3914 j = isl_basic_map_alloc_equality(bmap);
3917 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
3918 isl_int_set_si(bmap->eq[j][pos], -1);
3919 isl_int_set(bmap->eq[j][0], value);
3920 bmap = isl_basic_map_simplify(bmap);
3921 return isl_basic_map_finalize(bmap);
3923 isl_basic_map_free(bmap);
3927 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
3928 enum isl_dim_type type, unsigned pos, int value)
3932 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3933 return isl_basic_map_fix_pos_si(bmap,
3934 isl_basic_map_offset(bmap, type) + pos, value);
3936 isl_basic_map_free(bmap);
3940 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
3941 enum isl_dim_type type, unsigned pos, isl_int value)
3945 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
3946 return isl_basic_map_fix_pos(bmap,
3947 isl_basic_map_offset(bmap, type) + pos, value);
3949 isl_basic_map_free(bmap);
3953 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
3954 enum isl_dim_type type, unsigned pos, int value)
3956 return (struct isl_basic_set *)
3957 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3961 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
3962 enum isl_dim_type type, unsigned pos, isl_int value)
3964 return (struct isl_basic_set *)
3965 isl_basic_map_fix((struct isl_basic_map *)bset,
3969 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
3970 unsigned input, int value)
3972 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
3975 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
3976 unsigned dim, int value)
3978 return (struct isl_basic_set *)
3979 isl_basic_map_fix_si((struct isl_basic_map *)bset,
3980 isl_dim_set, dim, value);
3983 struct isl_map *isl_map_fix_si(struct isl_map *map,
3984 enum isl_dim_type type, unsigned pos, int value)
3988 map = isl_map_cow(map);
3992 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
3993 for (i = 0; i < map->n; ++i) {
3994 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
3998 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4005 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4006 enum isl_dim_type type, unsigned pos, int value)
4008 return (struct isl_set *)
4009 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4012 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4013 enum isl_dim_type type, unsigned pos, isl_int value)
4017 map = isl_map_cow(map);
4021 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4022 for (i = 0; i < map->n; ++i) {
4023 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4027 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4034 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4035 enum isl_dim_type type, unsigned pos, isl_int value)
4037 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4040 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4041 unsigned input, int value)
4043 return isl_map_fix_si(map, isl_dim_in, input, value);
4046 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4048 return (struct isl_set *)
4049 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4052 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4053 __isl_take isl_basic_map *bmap,
4054 enum isl_dim_type type, unsigned pos, int value)
4060 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4061 pos += isl_basic_map_offset(bmap, type);
4062 bmap = isl_basic_map_cow(bmap);
4063 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4064 j = isl_basic_map_alloc_inequality(bmap);
4067 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4068 isl_int_set_si(bmap->ineq[j][pos], 1);
4069 isl_int_set_si(bmap->ineq[j][0], -value);
4070 bmap = isl_basic_map_simplify(bmap);
4071 return isl_basic_map_finalize(bmap);
4073 isl_basic_map_free(bmap);
4077 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4078 unsigned dim, isl_int value)
4082 bset = isl_basic_set_cow(bset);
4083 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4084 j = isl_basic_set_alloc_inequality(bset);
4087 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4088 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4089 isl_int_neg(bset->ineq[j][0], value);
4090 bset = isl_basic_set_simplify(bset);
4091 return isl_basic_set_finalize(bset);
4093 isl_basic_set_free(bset);
4097 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4098 enum isl_dim_type type, unsigned pos, int value)
4102 map = isl_map_cow(map);
4106 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4107 for (i = 0; i < map->n; ++i) {
4108 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4113 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4120 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4121 enum isl_dim_type type, unsigned pos, int value)
4123 return (struct isl_set *)
4124 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4127 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4132 set = isl_set_cow(set);
4136 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4137 for (i = 0; i < set->n; ++i) {
4138 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4148 struct isl_map *isl_map_reverse(struct isl_map *map)
4152 map = isl_map_cow(map);
4156 map->dim = isl_dim_reverse(map->dim);
4159 for (i = 0; i < map->n; ++i) {
4160 map->p[i] = isl_basic_map_reverse(map->p[i]);
4164 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4171 static struct isl_map *isl_basic_map_partial_lexopt(
4172 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4173 struct isl_set **empty, int max)
4177 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4178 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4180 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4182 isl_basic_map_free(bmap);
4183 isl_basic_set_free(dom);
4189 struct isl_map *isl_basic_map_partial_lexmax(
4190 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4191 struct isl_set **empty)
4193 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4196 struct isl_map *isl_basic_map_partial_lexmin(
4197 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4198 struct isl_set **empty)
4200 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4203 struct isl_set *isl_basic_set_partial_lexmin(
4204 struct isl_basic_set *bset, struct isl_basic_set *dom,
4205 struct isl_set **empty)
4207 return (struct isl_set *)
4208 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4212 struct isl_set *isl_basic_set_partial_lexmax(
4213 struct isl_basic_set *bset, struct isl_basic_set *dom,
4214 struct isl_set **empty)
4216 return (struct isl_set *)
4217 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4221 /* Given a basic map "bmap", compute the lexicograhically minimal
4222 * (or maximal) image element for each domain element in dom.
4223 * Set *empty to those elements in dom that do not have an image element.
4225 * We first make sure the basic sets in dom are disjoint and then
4226 * simply collect the results over each of the basic sets separately.
4227 * We could probably improve the efficiency a bit by moving the union
4228 * domain down into the parametric integer programming.
4230 static __isl_give isl_map *basic_map_partial_lexopt(
4231 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4232 __isl_give isl_set **empty, int max)
4235 struct isl_map *res;
4237 dom = isl_set_make_disjoint(dom);
4241 if (isl_set_fast_is_empty(dom)) {
4242 res = isl_map_empty_like_basic_map(bmap);
4243 *empty = isl_set_empty_like(dom);
4245 isl_basic_map_free(bmap);
4249 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4250 isl_basic_set_copy(dom->p[0]), empty, max);
4252 for (i = 1; i < dom->n; ++i) {
4253 struct isl_map *res_i;
4254 struct isl_set *empty_i;
4256 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4257 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4259 res = isl_map_union_disjoint(res, res_i);
4260 *empty = isl_set_union_disjoint(*empty, empty_i);
4264 isl_basic_map_free(bmap);
4269 isl_basic_map_free(bmap);
4273 /* Given a map "map", compute the lexicograhically minimal
4274 * (or maximal) image element for each domain element in dom.
4275 * Set *empty to those elements in dom that do not have an image element.
4277 * We first compute the lexicographically minimal or maximal element
4278 * in the first basic map. This results in a partial solution "res"
4279 * and a subset "todo" of dom that still need to be handled.
4280 * We then consider each of the remaining maps in "map" and successively
4281 * improve both "res" and "todo".
4283 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4284 * Assume we are computing the lexicographical maximum.
4285 * We first intersect basic map i with a relation that maps elements
4286 * to elements that are lexicographically larger than the image elements
4287 * in res^k and the compute the maximum image element of this intersection.
4288 * The result ("better") corresponds to those image elements in basic map i
4289 * that are better than what we had before. The remainder ("keep") are the
4290 * domain elements for which the image element in res_k was better.
4291 * We also compute the lexicographical maximum of basic map i in todo^k.
4292 * res^i is the result of the operation + better + those elements in
4293 * res^k that we should keep
4294 * todo^i is the remainder of the maximum operation on todo^k.
4296 static __isl_give isl_map *isl_map_partial_lexopt(
4297 __isl_take isl_map *map, __isl_take isl_set *dom,
4298 __isl_give isl_set **empty, int max)
4301 struct isl_map *res;
4302 struct isl_set *todo;
4307 if (isl_map_fast_is_empty(map)) {
4315 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4316 isl_set_copy(dom), &todo, max);
4318 for (i = 1; i < map->n; ++i) {
4320 struct isl_map *better;
4321 struct isl_set *keep;
4322 struct isl_map *res_i;
4323 struct isl_set *todo_i;
4324 struct isl_dim *dim = isl_map_get_dim(res);
4326 dim = isl_dim_range(dim);
4328 lt = isl_map_lex_lt(dim);
4330 lt = isl_map_lex_gt(dim);
4331 lt = isl_map_apply_range(isl_map_copy(res), lt);
4332 lt = isl_map_intersect(lt,
4333 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4334 better = isl_map_partial_lexopt(lt,
4335 isl_map_domain(isl_map_copy(res)),
4338 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4339 todo, &todo_i, max);
4341 res = isl_map_intersect_domain(res, keep);
4342 res = isl_map_union_disjoint(res, res_i);
4343 res = isl_map_union_disjoint(res, better);
4364 __isl_give isl_map *isl_map_partial_lexmax(
4365 __isl_take isl_map *map, __isl_take isl_set *dom,
4366 __isl_give isl_set **empty)
4368 return isl_map_partial_lexopt(map, dom, empty, 1);
4371 __isl_give isl_map *isl_map_partial_lexmin(
4372 __isl_take isl_map *map, __isl_take isl_set *dom,
4373 __isl_give isl_set **empty)
4375 return isl_map_partial_lexopt(map, dom, empty, 0);
4378 __isl_give isl_set *isl_set_partial_lexmin(
4379 __isl_take isl_set *set, __isl_take isl_set *dom,
4380 __isl_give isl_set **empty)
4382 return (struct isl_set *)
4383 isl_map_partial_lexmin((struct isl_map *)set,
4387 __isl_give isl_set *isl_set_partial_lexmax(
4388 __isl_take isl_set *set, __isl_take isl_set *dom,
4389 __isl_give isl_set **empty)
4391 return (struct isl_set *)
4392 isl_map_partial_lexmax((struct isl_map *)set,
4396 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4398 struct isl_basic_set *dom = NULL;
4399 struct isl_dim *dom_dim;
4403 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4404 dom = isl_basic_set_universe(dom_dim);
4405 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4407 isl_basic_map_free(bmap);
4411 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4413 return isl_basic_map_lexopt(bmap, 0);
4416 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4418 return isl_basic_map_lexopt(bmap, 1);
4421 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4423 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4426 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4428 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4431 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4433 struct isl_set *dom = NULL;
4434 struct isl_dim *dom_dim;
4438 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4439 dom = isl_set_universe(dom_dim);
4440 return isl_map_partial_lexopt(map, dom, NULL, max);
4446 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4448 return isl_map_lexopt(map, 0);
4451 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4453 return isl_map_lexopt(map, 1);
4456 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4458 return (isl_set *)isl_map_lexmin((isl_map *)set);
4461 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4463 return (isl_set *)isl_map_lexmax((isl_map *)set);
4466 /* Apply a preimage specified by "mat" on the parameters of "bset".
4467 * bset is assumed to have only parameters and divs.
4469 static struct isl_basic_set *basic_set_parameter_preimage(
4470 struct isl_basic_set *bset, struct isl_mat *mat)
4477 bset->dim = isl_dim_cow(bset->dim);
4481 nparam = isl_basic_set_dim(bset, isl_dim_param);
4483 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4485 bset->dim->nparam = 0;
4486 bset->dim->n_out = nparam;
4487 bset = isl_basic_set_preimage(bset, mat);
4489 bset->dim->nparam = bset->dim->n_out;
4490 bset->dim->n_out = 0;
4495 isl_basic_set_free(bset);
4499 /* Apply a preimage specified by "mat" on the parameters of "set".
4500 * set is assumed to have only parameters and divs.
4502 static struct isl_set *set_parameter_preimage(
4503 struct isl_set *set, struct isl_mat *mat)
4505 struct isl_dim *dim = NULL;
4511 dim = isl_dim_copy(set->dim);
4512 dim = isl_dim_cow(dim);
4516 nparam = isl_set_dim(set, isl_dim_param);
4518 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4521 dim->n_out = nparam;
4522 isl_set_reset_dim(set, dim);
4523 set = isl_set_preimage(set, mat);
4526 dim = isl_dim_copy(set->dim);
4527 dim = isl_dim_cow(dim);
4530 dim->nparam = dim->n_out;
4532 isl_set_reset_dim(set, dim);
4542 /* Intersect the basic set "bset" with the affine space specified by the
4543 * equalities in "eq".
4545 static struct isl_basic_set *basic_set_append_equalities(
4546 struct isl_basic_set *bset, struct isl_mat *eq)
4554 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4559 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4560 for (i = 0; i < eq->n_row; ++i) {
4561 k = isl_basic_set_alloc_equality(bset);
4564 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4565 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4569 bset = isl_basic_set_gauss(bset, NULL);
4570 bset = isl_basic_set_finalize(bset);
4575 isl_basic_set_free(bset);
4579 /* Intersect the set "set" with the affine space specified by the
4580 * equalities in "eq".
4582 static struct isl_set *set_append_equalities(struct isl_set *set,
4590 for (i = 0; i < set->n; ++i) {
4591 set->p[i] = basic_set_append_equalities(set->p[i],
4604 /* Project the given basic set onto its parameter domain, possibly introducing
4605 * new, explicit, existential variables in the constraints.
4606 * The input has parameters and (possibly implicit) existential variables.
4607 * The output has the same parameters, but only
4608 * explicit existentially quantified variables.
4610 * The actual projection is performed by pip, but pip doesn't seem
4611 * to like equalities very much, so we first remove the equalities
4612 * among the parameters by performing a variable compression on
4613 * the parameters. Afterward, an inverse transformation is performed
4614 * and the equalities among the parameters are inserted back in.
4616 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4620 struct isl_mat *T, *T2;
4621 struct isl_set *set;
4622 unsigned nparam, n_div;
4624 bset = isl_basic_set_cow(bset);
4628 if (bset->n_eq == 0)
4629 return isl_basic_set_lexmin(bset);
4631 isl_basic_set_gauss(bset, NULL);
4633 nparam = isl_basic_set_dim(bset, isl_dim_param);
4634 n_div = isl_basic_set_dim(bset, isl_dim_div);
4636 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4637 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4640 if (i == bset->n_eq)
4641 return isl_basic_set_lexmin(bset);
4643 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4645 eq = isl_mat_cow(eq);
4646 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4647 if (T && T->n_col == 0) {
4651 bset = isl_basic_set_set_to_empty(bset);
4652 return isl_set_from_basic_set(bset);
4654 bset = basic_set_parameter_preimage(bset, T);
4656 set = isl_basic_set_lexmin(bset);
4657 set = set_parameter_preimage(set, T2);
4658 set = set_append_equalities(set, eq);
4662 /* Compute an explicit representation for all the existentially
4663 * quantified variables.
4664 * The input and output dimensions are first turned into parameters.
4665 * compute_divs then returns a map with the same parameters and
4666 * no input or output dimensions and the dimension specification
4667 * is reset to that of the input.
4669 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4671 struct isl_basic_set *bset;
4672 struct isl_set *set;
4673 struct isl_map *map;
4674 struct isl_dim *dim, *orig_dim = NULL;
4679 bmap = isl_basic_map_cow(bmap);
4683 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4684 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4685 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4686 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4690 orig_dim = bmap->dim;
4692 bset = (struct isl_basic_set *)bmap;
4694 set = parameter_compute_divs(bset);
4695 map = (struct isl_map *)set;
4696 map = isl_map_reset_dim(map, orig_dim);
4700 isl_basic_map_free(bmap);
4704 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4712 off = isl_dim_total(bmap->dim);
4713 for (i = 0; i < bmap->n_div; ++i) {
4714 if (isl_int_is_zero(bmap->div[i][0]))
4716 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4722 static int map_divs_known(__isl_keep isl_map *map)
4729 for (i = 0; i < map->n; ++i) {
4730 int known = basic_map_divs_known(map->p[i]);
4738 /* If bmap contains any unknown divs, then compute explicit
4739 * expressions for them. However, this computation may be
4740 * quite expensive, so first try to remove divs that aren't
4743 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4747 struct isl_map *map;
4749 known = basic_map_divs_known(bmap);
4753 return isl_map_from_basic_map(bmap);
4755 bmap = isl_basic_map_drop_redundant_divs(bmap);
4757 known = basic_map_divs_known(bmap);
4761 return isl_map_from_basic_map(bmap);
4763 map = compute_divs(bmap);
4766 isl_basic_map_free(bmap);
4770 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4774 struct isl_map *res;
4781 known = map_divs_known(map);
4789 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4790 for (i = 1 ; i < map->n; ++i) {
4792 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4793 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4794 res = isl_map_union_disjoint(res, r2);
4796 res = isl_map_union(res, r2);
4803 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4805 return (struct isl_set *)
4806 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4809 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4811 return (struct isl_set *)
4812 isl_map_compute_divs((struct isl_map *)set);
4815 struct isl_set *isl_map_domain(struct isl_map *map)
4818 struct isl_set *set;
4823 map = isl_map_cow(map);
4827 set = (struct isl_set *)map;
4828 set->dim = isl_dim_domain(set->dim);
4831 for (i = 0; i < map->n; ++i) {
4832 set->p[i] = isl_basic_map_domain(map->p[i]);
4836 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4837 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4844 struct isl_map *isl_map_union_disjoint(
4845 struct isl_map *map1, struct isl_map *map2)
4849 struct isl_map *map = NULL;
4863 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4865 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4866 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4867 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4869 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4870 map1->n + map2->n, flags);
4873 for (i = 0; i < map1->n; ++i) {
4874 map = isl_map_add_basic_map(map,
4875 isl_basic_map_copy(map1->p[i]));
4879 for (i = 0; i < map2->n; ++i) {
4880 map = isl_map_add_basic_map(map,
4881 isl_basic_map_copy(map2->p[i]));
4895 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
4897 map1 = isl_map_union_disjoint(map1, map2);
4901 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
4905 struct isl_set *isl_set_union_disjoint(
4906 struct isl_set *set1, struct isl_set *set2)
4908 return (struct isl_set *)
4909 isl_map_union_disjoint(
4910 (struct isl_map *)set1, (struct isl_map *)set2);
4913 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
4915 return (struct isl_set *)
4916 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
4919 struct isl_map *isl_map_intersect_range(
4920 struct isl_map *map, struct isl_set *set)
4923 struct isl_map *result;
4929 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
4930 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
4931 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4933 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
4934 map->n * set->n, flags);
4937 for (i = 0; i < map->n; ++i)
4938 for (j = 0; j < set->n; ++j) {
4939 result = isl_map_add_basic_map(result,
4940 isl_basic_map_intersect_range(
4941 isl_basic_map_copy(map->p[i]),
4942 isl_basic_set_copy(set->p[j])));
4955 struct isl_map *isl_map_intersect_domain(
4956 struct isl_map *map, struct isl_set *set)
4958 return isl_map_reverse(
4959 isl_map_intersect_range(isl_map_reverse(map), set));
4962 struct isl_map *isl_map_apply_domain(
4963 struct isl_map *map1, struct isl_map *map2)
4967 map1 = isl_map_reverse(map1);
4968 map1 = isl_map_apply_range(map1, map2);
4969 return isl_map_reverse(map1);
4976 struct isl_map *isl_map_apply_range(
4977 struct isl_map *map1, struct isl_map *map2)
4979 struct isl_dim *dim_result;
4980 struct isl_map *result;
4986 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
4987 isl_dim_copy(map2->dim));
4989 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
4992 for (i = 0; i < map1->n; ++i)
4993 for (j = 0; j < map2->n; ++j) {
4994 result = isl_map_add_basic_map(result,
4995 isl_basic_map_apply_range(
4996 isl_basic_map_copy(map1->p[i]),
4997 isl_basic_map_copy(map2->p[j])));
5003 if (result && result->n <= 1)
5004 ISL_F_SET(result, ISL_MAP_DISJOINT);
5013 * returns range - domain
5015 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5017 isl_dim *dims, *target_dim;
5018 struct isl_basic_set *bset;
5025 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5026 bmap->dim, isl_dim_out),
5028 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5029 dim = isl_basic_map_n_in(bmap);
5030 nparam = isl_basic_map_n_param(bmap);
5031 bset = isl_basic_set_from_basic_map(bmap);
5032 bset = isl_basic_set_cow(bset);
5033 dims = isl_basic_set_get_dim(bset);
5034 dims = isl_dim_add(dims, isl_dim_set, dim);
5035 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5036 bset = isl_basic_set_swap_vars(bset, 2*dim);
5037 for (i = 0; i < dim; ++i) {
5038 int j = isl_basic_map_alloc_equality(
5039 (struct isl_basic_map *)bset);
5042 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5043 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5044 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5045 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5047 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5048 bset = isl_basic_set_reset_dim(bset, target_dim);
5051 isl_basic_map_free(bmap);
5056 * returns range - domain
5058 struct isl_set *isl_map_deltas(struct isl_map *map)
5062 struct isl_set *result;
5067 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5068 map->dim, isl_dim_out),
5070 dim = isl_map_get_dim(map);
5071 dim = isl_dim_domain(dim);
5072 result = isl_set_alloc_dim(dim, map->n, map->flags);
5075 for (i = 0; i < map->n; ++i)
5076 result = isl_set_add_basic_set(result,
5077 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5085 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5087 struct isl_basic_map *bmap;
5095 nparam = dims->nparam;
5097 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5101 for (i = 0; i < dim; ++i) {
5102 int j = isl_basic_map_alloc_equality(bmap);
5105 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5106 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5107 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5109 return isl_basic_map_finalize(bmap);
5111 isl_basic_map_free(bmap);
5115 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5117 struct isl_dim *dim = isl_dim_map(set_dim);
5120 return basic_map_identity(dim);
5123 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5125 if (!model || !model->dim)
5127 isl_assert(model->ctx,
5128 model->dim->n_in == model->dim->n_out, return NULL);
5129 return basic_map_identity(isl_dim_copy(model->dim));
5132 static struct isl_map *map_identity(struct isl_dim *dim)
5134 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5135 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5138 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5140 struct isl_dim *dim = isl_dim_map(set_dim);
5143 return map_identity(dim);
5146 struct isl_map *isl_map_identity_like(struct isl_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 map_identity(isl_dim_copy(model->dim));
5155 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5157 if (!model || !model->dim)
5159 isl_assert(model->ctx,
5160 model->dim->n_in == model->dim->n_out, return NULL);
5161 return map_identity(isl_dim_copy(model->dim));
5164 /* Construct a basic set with all set dimensions having only non-negative
5167 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5172 struct isl_basic_set *bset;
5176 nparam = dims->nparam;
5178 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5181 for (i = 0; i < dim; ++i) {
5182 int k = isl_basic_set_alloc_inequality(bset);
5185 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5186 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5190 isl_basic_set_free(bset);
5194 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5195 enum isl_dim_type type, unsigned first, unsigned n)
5198 isl_basic_set *nonneg = NULL;
5199 isl_basic_set *neg = NULL;
5206 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5208 for (i = 0; i < n; ++i) {
5212 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5213 k = isl_basic_set_alloc_inequality(nonneg);
5216 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5217 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5219 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5220 k = isl_basic_set_alloc_inequality(neg);
5223 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5224 isl_int_set_si(neg->ineq[k][0], -1);
5225 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5227 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5232 isl_basic_set_free(nonneg);
5233 isl_basic_set_free(neg);
5238 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5240 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5243 int isl_basic_map_is_subset(
5244 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5247 struct isl_map *map1;
5248 struct isl_map *map2;
5250 if (!bmap1 || !bmap2)
5253 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5254 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5256 is_subset = isl_map_is_subset(map1, map2);
5264 int isl_basic_map_is_equal(
5265 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5269 if (!bmap1 || !bmap2)
5271 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5274 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5278 int isl_basic_set_is_equal(
5279 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5281 return isl_basic_map_is_equal(
5282 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5285 int isl_map_is_empty(struct isl_map *map)
5292 for (i = 0; i < map->n; ++i) {
5293 is_empty = isl_basic_map_is_empty(map->p[i]);
5302 int isl_map_fast_is_empty(struct isl_map *map)
5304 return map ? map->n == 0 : -1;
5307 int isl_set_fast_is_empty(struct isl_set *set)
5309 return set ? set->n == 0 : -1;
5312 int isl_set_is_empty(struct isl_set *set)
5314 return isl_map_is_empty((struct isl_map *)set);
5317 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5323 is_subset = isl_map_is_subset(map1, map2);
5326 is_subset = isl_map_is_subset(map2, map1);
5330 int isl_basic_map_is_strict_subset(
5331 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5335 if (!bmap1 || !bmap2)
5337 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5340 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5341 if (is_subset == -1)
5346 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5352 is_subset = isl_map_is_subset(map1, map2);
5355 is_subset = isl_map_is_subset(map2, map1);
5356 if (is_subset == -1)
5361 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5363 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5366 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5370 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5373 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5377 return bset->n_eq == 0 && bset->n_ineq == 0;
5380 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5387 for (i = 0; i < map->n; ++i) {
5388 int r = isl_basic_map_is_universe(map->p[i]);
5396 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5398 return isl_map_fast_is_universe((isl_map *) set);
5401 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5403 struct isl_basic_set *bset = NULL;
5404 struct isl_vec *sample = NULL;
5411 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5414 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5415 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5416 copy = isl_basic_map_remove_redundancies(copy);
5417 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5418 isl_basic_map_free(copy);
5422 total = 1 + isl_basic_map_total_dim(bmap);
5423 if (bmap->sample && bmap->sample->size == total) {
5424 int contains = isl_basic_map_contains(bmap, bmap->sample);
5430 isl_vec_free(bmap->sample);
5431 bmap->sample = NULL;
5432 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5435 sample = isl_basic_set_sample_vec(bset);
5438 empty = sample->size == 0;
5439 isl_vec_free(bmap->sample);
5440 bmap->sample = sample;
5442 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5447 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5451 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5454 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5458 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5461 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5463 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5466 struct isl_map *isl_basic_map_union(
5467 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5469 struct isl_map *map;
5470 if (!bmap1 || !bmap2)
5473 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5475 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5478 map = isl_map_add_basic_map(map, bmap1);
5479 map = isl_map_add_basic_map(map, bmap2);
5482 isl_basic_map_free(bmap1);
5483 isl_basic_map_free(bmap2);
5487 struct isl_set *isl_basic_set_union(
5488 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5490 return (struct isl_set *)isl_basic_map_union(
5491 (struct isl_basic_map *)bset1,
5492 (struct isl_basic_map *)bset2);
5495 /* Order divs such that any div only depends on previous divs */
5496 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5504 off = isl_dim_total(bmap->dim);
5506 for (i = 0; i < bmap->n_div; ++i) {
5508 if (isl_int_is_zero(bmap->div[i][0]))
5510 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5514 isl_basic_map_swap_div(bmap, i, i + pos);
5520 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5522 return (struct isl_basic_set *)
5523 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5526 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5533 for (i = 0; i < map->n; ++i) {
5534 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5545 /* Look for a div in dst that corresponds to the div "div" in src.
5546 * The divs before "div" in src and dst are assumed to be the same.
5548 * Returns -1 if no corresponding div was found and the position
5549 * of the corresponding div in dst otherwise.
5551 static int find_div(struct isl_basic_map *dst,
5552 struct isl_basic_map *src, unsigned div)
5556 unsigned total = isl_dim_total(src->dim);
5558 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5559 for (i = div; i < dst->n_div; ++i)
5560 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5561 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5562 dst->n_div - div) == -1)
5567 struct isl_basic_map *isl_basic_map_align_divs(
5568 struct isl_basic_map *dst, struct isl_basic_map *src)
5571 unsigned total = isl_dim_total(src->dim);
5576 if (src->n_div == 0)
5579 for (i = 0; i < src->n_div; ++i)
5580 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5582 src = isl_basic_map_order_divs(src);
5583 dst = isl_basic_map_cow(dst);
5584 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5585 src->n_div, 0, 2 * src->n_div);
5588 for (i = 0; i < src->n_div; ++i) {
5589 int j = find_div(dst, src, i);
5591 j = isl_basic_map_alloc_div(dst);
5594 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5595 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5596 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5600 isl_basic_map_swap_div(dst, i, j);
5604 isl_basic_map_free(dst);
5608 struct isl_basic_set *isl_basic_set_align_divs(
5609 struct isl_basic_set *dst, struct isl_basic_set *src)
5611 return (struct isl_basic_set *)isl_basic_map_align_divs(
5612 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5615 struct isl_map *isl_map_align_divs(struct isl_map *map)
5623 map = isl_map_compute_divs(map);
5624 map = isl_map_cow(map);
5628 for (i = 1; i < map->n; ++i)
5629 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5630 for (i = 1; i < map->n; ++i)
5631 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5633 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5637 struct isl_set *isl_set_align_divs(struct isl_set *set)
5639 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5642 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5646 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5647 map = isl_map_intersect_domain(map, set);
5648 set = isl_map_range(map);
5656 /* There is no need to cow as removing empty parts doesn't change
5657 * the meaning of the set.
5659 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5666 for (i = map->n-1; i >= 0; --i) {
5667 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5669 isl_basic_map_free(map->p[i]);
5670 if (i != map->n-1) {
5671 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5672 map->p[i] = map->p[map->n-1];
5680 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5682 return (struct isl_set *)
5683 isl_map_remove_empty_parts((struct isl_map *)set);
5686 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5688 struct isl_basic_map *bmap;
5689 if (!map || map->n == 0)
5691 bmap = map->p[map->n-1];
5692 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5693 return isl_basic_map_copy(bmap);
5696 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5698 return (struct isl_basic_set *)
5699 isl_map_copy_basic_map((struct isl_map *)set);
5702 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5703 __isl_keep isl_basic_map *bmap)
5709 for (i = map->n-1; i >= 0; --i) {
5710 if (map->p[i] != bmap)
5712 map = isl_map_cow(map);
5715 isl_basic_map_free(map->p[i]);
5716 if (i != map->n-1) {
5717 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5718 map->p[i] = map->p[map->n-1];
5729 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5730 struct isl_basic_set *bset)
5732 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5733 (struct isl_basic_map *)bset);
5736 /* Given two basic sets bset1 and bset2, compute the maximal difference
5737 * between the values of dimension pos in bset1 and those in bset2
5738 * for any common value of the parameters and dimensions preceding pos.
5740 static enum isl_lp_result basic_set_maximal_difference_at(
5741 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5742 int pos, isl_int *opt)
5744 struct isl_dim *dims;
5745 struct isl_basic_map *bmap1 = NULL;
5746 struct isl_basic_map *bmap2 = NULL;
5747 struct isl_ctx *ctx;
5748 struct isl_vec *obj;
5751 unsigned dim1, dim2;
5752 enum isl_lp_result res;
5754 if (!bset1 || !bset2)
5755 return isl_lp_error;
5757 nparam = isl_basic_set_n_param(bset1);
5758 dim1 = isl_basic_set_n_dim(bset1);
5759 dim2 = isl_basic_set_n_dim(bset2);
5760 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5761 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5762 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5763 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5764 if (!bmap1 || !bmap2)
5766 bmap1 = isl_basic_map_cow(bmap1);
5767 bmap1 = isl_basic_map_extend(bmap1, nparam,
5768 pos, (dim1 - pos) + (dim2 - pos),
5769 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5770 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5773 total = isl_basic_map_total_dim(bmap1);
5775 obj = isl_vec_alloc(ctx, 1 + total);
5776 isl_seq_clr(obj->block.data, 1 + total);
5777 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5778 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5781 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5783 isl_basic_map_free(bmap1);
5787 isl_basic_map_free(bmap1);
5788 isl_basic_map_free(bmap2);
5789 return isl_lp_error;
5792 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5793 * for any common value of the parameters and dimensions preceding pos
5794 * in both basic sets, the values of dimension pos in bset1 are
5795 * smaller or larger than those in bset2.
5798 * 1 if bset1 follows bset2
5799 * -1 if bset1 precedes bset2
5800 * 0 if bset1 and bset2 are incomparable
5801 * -2 if some error occurred.
5803 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5804 struct isl_basic_set *bset2, int pos)
5807 enum isl_lp_result res;
5812 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5814 if (res == isl_lp_empty)
5816 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5817 res == isl_lp_unbounded)
5819 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5828 /* Given two basic sets bset1 and bset2, check whether
5829 * for any common value of the parameters and dimensions preceding pos
5830 * there is a value of dimension pos in bset1 that is larger
5831 * than a value of the same dimension in bset2.
5834 * 1 if there exists such a pair
5835 * 0 if there is no such pair, but there is a pair of equal values
5837 * -2 if some error occurred.
5839 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5840 __isl_keep isl_basic_set *bset2, int pos)
5843 enum isl_lp_result res;
5848 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5850 if (res == isl_lp_empty)
5852 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5853 res == isl_lp_unbounded)
5855 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5857 else if (res == isl_lp_ok)
5866 /* Given two sets set1 and set2, check whether
5867 * for any common value of the parameters and dimensions preceding pos
5868 * there is a value of dimension pos in set1 that is larger
5869 * than a value of the same dimension in set2.
5872 * 1 if there exists such a pair
5873 * 0 if there is no such pair, but there is a pair of equal values
5875 * -2 if some error occurred.
5877 int isl_set_follows_at(__isl_keep isl_set *set1,
5878 __isl_keep isl_set *set2, int pos)
5886 for (i = 0; i < set1->n; ++i)
5887 for (j = 0; j < set2->n; ++j) {
5889 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
5890 if (f == 1 || f == -2)
5899 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
5900 unsigned pos, isl_int *val)
5908 total = isl_basic_map_total_dim(bmap);
5909 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
5910 for (; d+1 > pos; --d)
5911 if (!isl_int_is_zero(bmap->eq[i][1+d]))
5915 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
5917 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
5919 if (!isl_int_is_one(bmap->eq[i][1+d]))
5922 isl_int_neg(*val, bmap->eq[i][0]);
5928 static int isl_map_fast_has_fixed_var(struct isl_map *map,
5929 unsigned pos, isl_int *val)
5941 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
5944 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
5945 for (i = 1; fixed == 1 && i < map->n; ++i) {
5946 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
5947 if (fixed == 1 && isl_int_ne(tmp, v))
5951 isl_int_set(*val, v);
5957 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
5958 unsigned pos, isl_int *val)
5960 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
5964 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
5967 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
5970 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
5971 enum isl_dim_type type, unsigned pos, isl_int *val)
5973 if (pos >= isl_basic_map_dim(bmap, type))
5975 return isl_basic_map_fast_has_fixed_var(bmap,
5976 isl_basic_map_offset(bmap, type) - 1 + pos, val);
5979 int isl_map_fast_is_fixed(struct isl_map *map,
5980 enum isl_dim_type type, unsigned pos, isl_int *val)
5982 if (pos >= isl_map_dim(map, type))
5984 return isl_map_fast_has_fixed_var(map,
5985 map_offset(map, type) - 1 + pos, val);
5988 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5989 * then return this fixed value in *val.
5991 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
5994 return isl_basic_set_fast_has_fixed_var(bset,
5995 isl_basic_set_n_param(bset) + dim, val);
5998 /* Check if dimension dim has fixed value and if so and if val is not NULL,
5999 * then return this fixed value in *val.
6001 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6003 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6006 /* Check if input variable in has fixed value and if so and if val is not NULL,
6007 * then return this fixed value in *val.
6009 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6011 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6014 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6015 * and if val is not NULL, then return this lower bound in *val.
6017 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6018 unsigned dim, isl_int *val)
6020 int i, i_eq = -1, i_ineq = -1;
6027 total = isl_basic_set_total_dim(bset);
6028 nparam = isl_basic_set_n_param(bset);
6029 for (i = 0; i < bset->n_eq; ++i) {
6030 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6036 for (i = 0; i < bset->n_ineq; ++i) {
6037 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6039 if (i_eq != -1 || i_ineq != -1)
6043 if (i_eq == -1 && i_ineq == -1)
6045 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6046 /* The coefficient should always be one due to normalization. */
6047 if (!isl_int_is_one(c[1+nparam+dim]))
6049 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6051 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6052 total - nparam - dim - 1) != -1)
6055 isl_int_neg(*val, c[0]);
6059 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6060 unsigned dim, isl_int *val)
6072 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6076 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6078 for (i = 1; fixed == 1 && i < set->n; ++i) {
6079 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6081 if (fixed == 1 && isl_int_ne(tmp, v))
6085 isl_int_set(*val, v);
6096 static int qsort_constraint_cmp(const void *p1, const void *p2)
6098 const struct constraint *c1 = (const struct constraint *)p1;
6099 const struct constraint *c2 = (const struct constraint *)p2;
6100 unsigned size = isl_min(c1->size, c2->size);
6101 return isl_seq_cmp(c1->c, c2->c, size);
6104 static struct isl_basic_map *isl_basic_map_sort_constraints(
6105 struct isl_basic_map *bmap)
6108 struct constraint *c;
6113 total = isl_basic_map_total_dim(bmap);
6114 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6117 for (i = 0; i < bmap->n_ineq; ++i) {
6119 c[i].c = bmap->ineq[i];
6121 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6122 for (i = 0; i < bmap->n_ineq; ++i)
6123 bmap->ineq[i] = c[i].c;
6127 isl_basic_map_free(bmap);
6131 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6132 __isl_take isl_basic_set *bset)
6134 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6135 (struct isl_basic_map *)bset);
6138 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6142 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6144 bmap = isl_basic_map_remove_redundancies(bmap);
6145 bmap = isl_basic_map_sort_constraints(bmap);
6146 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6150 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6152 return (struct isl_basic_set *)isl_basic_map_normalize(
6153 (struct isl_basic_map *)bset);
6156 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6157 const __isl_keep isl_basic_map *bmap2)
6164 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6165 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6166 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6167 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6168 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6169 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6170 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6171 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6173 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6175 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6177 if (bmap1->n_eq != bmap2->n_eq)
6178 return bmap1->n_eq - bmap2->n_eq;
6179 if (bmap1->n_ineq != bmap2->n_ineq)
6180 return bmap1->n_ineq - bmap2->n_ineq;
6181 if (bmap1->n_div != bmap2->n_div)
6182 return bmap1->n_div - bmap2->n_div;
6183 total = isl_basic_map_total_dim(bmap1);
6184 for (i = 0; i < bmap1->n_eq; ++i) {
6185 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6189 for (i = 0; i < bmap1->n_ineq; ++i) {
6190 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6194 for (i = 0; i < bmap1->n_div; ++i) {
6195 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6202 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6203 __isl_keep isl_basic_map *bmap2)
6205 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6208 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6209 __isl_keep isl_basic_set *bset2)
6211 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6212 (isl_basic_map *)bset2);
6215 static int qsort_bmap_cmp(const void *p1, const void *p2)
6217 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6218 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6220 return isl_basic_map_fast_cmp(bmap1, bmap2);
6223 /* We normalize in place, but if anything goes wrong we need
6224 * to return NULL, so we need to make sure we don't change the
6225 * meaning of any possible other copies of map.
6227 struct isl_map *isl_map_normalize(struct isl_map *map)
6230 struct isl_basic_map *bmap;
6234 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6236 for (i = 0; i < map->n; ++i) {
6237 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6240 isl_basic_map_free(map->p[i]);
6243 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6244 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6245 map = isl_map_remove_empty_parts(map);
6248 for (i = map->n - 1; i >= 1; --i) {
6249 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6251 isl_basic_map_free(map->p[i-1]);
6252 for (j = i; j < map->n; ++j)
6253 map->p[j-1] = map->p[j];
6263 struct isl_set *isl_set_normalize(struct isl_set *set)
6265 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6268 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6278 if (!isl_dim_equal(map1->dim, map2->dim))
6281 map1 = isl_map_copy(map1);
6282 map2 = isl_map_copy(map2);
6283 map1 = isl_map_normalize(map1);
6284 map2 = isl_map_normalize(map2);
6287 equal = map1->n == map2->n;
6288 for (i = 0; equal && i < map1->n; ++i) {
6289 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6302 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6304 return isl_map_fast_is_equal((struct isl_map *)set1,
6305 (struct isl_map *)set2);
6308 /* Return an interval that ranges from min to max (inclusive)
6310 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6311 isl_int min, isl_int max)
6314 struct isl_basic_set *bset = NULL;
6316 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6320 k = isl_basic_set_alloc_inequality(bset);
6323 isl_int_set_si(bset->ineq[k][1], 1);
6324 isl_int_neg(bset->ineq[k][0], min);
6326 k = isl_basic_set_alloc_inequality(bset);
6329 isl_int_set_si(bset->ineq[k][1], -1);
6330 isl_int_set(bset->ineq[k][0], max);
6334 isl_basic_set_free(bset);
6338 /* Return the Cartesian product of the basic sets in list (in the given order).
6340 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6348 struct isl_basic_set *product = NULL;
6352 isl_assert(list->ctx, list->n > 0, goto error);
6353 isl_assert(list->ctx, list->p[0], goto error);
6354 nparam = isl_basic_set_n_param(list->p[0]);
6355 dim = isl_basic_set_n_dim(list->p[0]);
6356 extra = list->p[0]->n_div;
6357 n_eq = list->p[0]->n_eq;
6358 n_ineq = list->p[0]->n_ineq;
6359 for (i = 1; i < list->n; ++i) {
6360 isl_assert(list->ctx, list->p[i], goto error);
6361 isl_assert(list->ctx,
6362 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6363 dim += isl_basic_set_n_dim(list->p[i]);
6364 extra += list->p[i]->n_div;
6365 n_eq += list->p[i]->n_eq;
6366 n_ineq += list->p[i]->n_ineq;
6368 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6373 for (i = 0; i < list->n; ++i) {
6374 isl_basic_set_add_constraints(product,
6375 isl_basic_set_copy(list->p[i]), dim);
6376 dim += isl_basic_set_n_dim(list->p[i]);
6378 isl_basic_set_list_free(list);
6381 isl_basic_set_free(product);
6382 isl_basic_set_list_free(list);
6386 struct isl_basic_map *isl_basic_map_product(
6387 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6389 struct isl_dim *dim_result = NULL;
6390 struct isl_basic_map *bmap;
6391 unsigned in1, in2, out1, out2, nparam, total, pos;
6392 struct isl_dim_map *dim_map1, *dim_map2;
6394 if (!bmap1 || !bmap2)
6397 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6398 bmap2->dim, isl_dim_param), goto error);
6399 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6400 isl_dim_copy(bmap2->dim));
6402 in1 = isl_basic_map_n_in(bmap1);
6403 in2 = isl_basic_map_n_in(bmap2);
6404 out1 = isl_basic_map_n_out(bmap1);
6405 out2 = isl_basic_map_n_out(bmap2);
6406 nparam = isl_basic_map_n_param(bmap1);
6408 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6409 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6410 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6411 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6412 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6413 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6414 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6415 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6416 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6417 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6418 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6420 bmap = isl_basic_map_alloc_dim(dim_result,
6421 bmap1->n_div + bmap2->n_div,
6422 bmap1->n_eq + bmap2->n_eq,
6423 bmap1->n_ineq + bmap2->n_ineq);
6424 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6425 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6426 bmap = isl_basic_map_simplify(bmap);
6427 return isl_basic_map_finalize(bmap);
6429 isl_basic_map_free(bmap1);
6430 isl_basic_map_free(bmap2);
6434 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6436 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6439 struct isl_map *result;
6445 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6446 map2->dim, isl_dim_param), goto error);
6448 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6449 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6450 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6452 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6453 isl_dim_copy(map2->dim)),
6454 map1->n * map2->n, flags);
6457 for (i = 0; i < map1->n; ++i)
6458 for (j = 0; j < map2->n; ++j) {
6459 struct isl_basic_map *part;
6460 part = isl_basic_map_product(
6461 isl_basic_map_copy(map1->p[i]),
6462 isl_basic_map_copy(map2->p[j]));
6463 if (isl_basic_map_is_empty(part))
6464 isl_basic_map_free(part);
6466 result = isl_map_add_basic_map(result, part);
6479 /* Given two set A and B, construct its Cartesian product A x B.
6481 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6483 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6484 (struct isl_map *)set2);
6487 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6490 uint32_t hash = isl_hash_init();
6495 bset = isl_basic_set_copy(bset);
6496 bset = isl_basic_set_normalize(bset);
6499 total = isl_basic_set_total_dim(bset);
6500 isl_hash_byte(hash, bset->n_eq & 0xFF);
6501 for (i = 0; i < bset->n_eq; ++i) {
6503 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6504 isl_hash_hash(hash, c_hash);
6506 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6507 for (i = 0; i < bset->n_ineq; ++i) {
6509 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6510 isl_hash_hash(hash, c_hash);
6512 isl_hash_byte(hash, bset->n_div & 0xFF);
6513 for (i = 0; i < bset->n_div; ++i) {
6515 if (isl_int_is_zero(bset->div[i][0]))
6517 isl_hash_byte(hash, i & 0xFF);
6518 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6519 isl_hash_hash(hash, c_hash);
6521 isl_basic_set_free(bset);
6525 uint32_t isl_set_get_hash(struct isl_set *set)
6532 set = isl_set_copy(set);
6533 set = isl_set_normalize(set);
6537 hash = isl_hash_init();
6538 for (i = 0; i < set->n; ++i) {
6540 bset_hash = isl_basic_set_get_hash(set->p[i]);
6541 isl_hash_hash(hash, bset_hash);
6549 /* Check if the value for dimension dim is completely determined
6550 * by the values of the other parameters and variables.
6551 * That is, check if dimension dim is involved in an equality.
6553 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6560 nparam = isl_basic_set_n_param(bset);
6561 for (i = 0; i < bset->n_eq; ++i)
6562 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6567 /* Check if the value for dimension dim is completely determined
6568 * by the values of the other parameters and variables.
6569 * That is, check if dimension dim is involved in an equality
6570 * for each of the subsets.
6572 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6578 for (i = 0; i < set->n; ++i) {
6580 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6587 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6588 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6595 for (i = 0; i < map->n; ++i)
6596 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6602 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6603 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6610 for (i = 0; i < set->n; ++i)
6611 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6617 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6619 struct isl_dim *dim;
6624 if (bset->n_div == 0)
6627 bset = isl_basic_set_cow(bset);
6631 dim = isl_basic_set_get_dim(bset);
6632 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6635 isl_dim_free(bset->dim);
6639 bset = isl_basic_set_finalize(bset);
6643 isl_basic_set_free(bset);
6647 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6650 struct isl_dim *dim;
6653 set = isl_set_align_divs(set);
6657 if (set->n == 0 || set->p[0]->n_div == 0)
6660 set = isl_set_cow(set);
6664 n_div = set->p[0]->n_div;
6665 dim = isl_set_get_dim(set);
6666 dim = isl_dim_add(dim, isl_dim_set, n_div);
6669 isl_dim_free(set->dim);
6672 for (i = 0; i < set->n; ++i) {
6673 set->p[i] = isl_basic_set_lift(set->p[i]);
6684 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6686 struct isl_dim *dim;
6687 struct isl_basic_map *bmap;
6694 set = isl_set_align_divs(set);
6699 dim = isl_set_get_dim(set);
6700 if (set->n == 0 || set->p[0]->n_div == 0) {
6702 return isl_map_identity(dim);
6705 n_div = set->p[0]->n_div;
6706 dim = isl_dim_map(dim);
6707 n_param = isl_dim_size(dim, isl_dim_param);
6708 n_set = isl_dim_size(dim, isl_dim_in);
6709 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6710 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6711 for (i = 0; i < n_set; ++i)
6712 bmap = var_equal(bmap, i);
6714 total = n_param + n_set + n_set + n_div;
6715 for (i = 0; i < n_div; ++i) {
6716 k = isl_basic_map_alloc_inequality(bmap);
6719 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6720 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6721 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6722 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6723 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6724 set->p[0]->div[i][0]);
6726 l = isl_basic_map_alloc_inequality(bmap);
6729 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6730 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6731 set->p[0]->div[i][0]);
6732 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6736 return isl_map_from_basic_map(bmap);
6739 isl_basic_map_free(bmap);
6743 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6751 dim = isl_basic_set_total_dim(bset);
6752 size += bset->n_eq * (1 + dim);
6753 size += bset->n_ineq * (1 + dim);
6754 size += bset->n_div * (2 + dim);
6759 int isl_set_size(__isl_keep isl_set *set)
6767 for (i = 0; i < set->n; ++i)
6768 size += isl_basic_set_size(set->p[i]);
6773 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6774 enum isl_dim_type type, unsigned pos)
6782 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6784 pos += isl_basic_map_offset(bmap, type);
6786 for (i = 0; i < bmap->n_eq; ++i)
6787 if (!isl_int_is_zero(bmap->eq[i][pos]))
6791 for (i = 0; i < bmap->n_ineq; ++i) {
6792 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6799 return lower && upper;
6802 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6803 enum isl_dim_type type, unsigned pos)
6810 for (i = 0; i < map->n; ++i) {
6812 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6813 if (bounded < 0 || !bounded)
6820 /* Return 1 if the specified dim is involved in both an upper bound
6821 * and a lower bound.
6823 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6824 enum isl_dim_type type, unsigned pos)
6826 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6829 /* For each of the "n" variables starting at "first", determine
6830 * the sign of the variable and put the results in the first "n"
6831 * elements of the array "signs".
6833 * 1 means that the variable is non-negative
6834 * -1 means that the variable is non-positive
6835 * 0 means the variable attains both positive and negative values.
6837 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6838 unsigned first, unsigned n, int *signs)
6840 isl_vec *bound = NULL;
6841 struct isl_tab *tab = NULL;
6842 struct isl_tab_undo *snap;
6845 if (!bset || !signs)
6848 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6849 tab = isl_tab_from_basic_set(bset);
6853 isl_seq_clr(bound->el, bound->size);
6854 isl_int_set_si(bound->el[0], -1);
6856 snap = isl_tab_snap(tab);
6857 for (i = 0; i < n; ++i) {
6860 isl_int_set_si(bound->el[1 + first + i], -1);
6861 if (isl_tab_add_ineq(tab, bound->el) < 0)
6864 isl_int_set_si(bound->el[1 + first + i], 0);
6865 if (isl_tab_rollback(tab, snap) < 0)
6873 isl_int_set_si(bound->el[1 + first + i], 1);
6874 if (isl_tab_add_ineq(tab, bound->el) < 0)
6877 isl_int_set_si(bound->el[1 + first + i], 0);
6878 if (isl_tab_rollback(tab, snap) < 0)
6881 signs[i] = empty ? -1 : 0;
6885 isl_vec_free(bound);
6889 isl_vec_free(bound);
6893 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
6894 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
6896 if (!bset || !signs)
6898 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
6901 first += pos(bset->dim, type) - 1;
6902 return isl_basic_set_vars_get_sign(bset, first, n, signs);
6905 /* Check if the given map is single-valued.
6910 * and check if the result is a subset of the identity mapping.
6912 int isl_map_is_single_valued(__isl_keep isl_map *map)
6918 test = isl_map_reverse(isl_map_copy(map));
6919 test = isl_map_apply_range(test, isl_map_copy(map));
6921 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
6923 sv = isl_map_is_subset(test, id);
6931 int isl_map_is_bijective(__isl_keep isl_map *map)
6935 sv = isl_map_is_single_valued(map);
6939 map = isl_map_copy(map);
6940 map = isl_map_reverse(map);
6941 sv = isl_map_is_single_valued(map);
6947 int isl_set_is_singleton(__isl_keep isl_set *set)
6949 return isl_map_is_single_valued((isl_map *)set);
6952 int isl_map_is_translation(__isl_keep isl_map *map)
6957 delta = isl_map_deltas(isl_map_copy(map));
6958 ok = isl_set_is_singleton(delta);
6959 isl_set_free(delta);
6964 static int unique(isl_int *p, unsigned pos, unsigned len)
6966 if (isl_seq_first_non_zero(p, pos) != -1)
6968 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
6973 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
6982 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
6985 nvar = isl_basic_set_dim(bset, isl_dim_set);
6986 ovar = isl_dim_offset(bset->dim, isl_dim_set);
6987 for (j = 0; j < nvar; ++j) {
6988 int lower = 0, upper = 0;
6989 for (i = 0; i < bset->n_eq; ++i) {
6990 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
6992 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
6998 for (i = 0; i < bset->n_ineq; ++i) {
6999 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7001 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7003 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7008 if (!lower || !upper)
7015 int isl_set_is_box(__isl_keep isl_set *set)
7022 return isl_basic_set_is_box(set->p[0]);