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_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
32 /* Maps dst positions to src positions */
38 static struct isl_dim_map *isl_dim_map_alloc(struct isl_ctx *ctx, unsigned len)
41 struct isl_dim_map *dim_map;
42 dim_map = isl_alloc(ctx, struct isl_dim_map,
43 sizeof(struct isl_dim_map) + len * sizeof(int));
46 dim_map->len = 1 + len;
48 for (i = 0; i < len; ++i)
49 dim_map->pos[1 + i] = -1;
53 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
56 case isl_dim_param: return dim->nparam;
57 case isl_dim_in: return dim->n_in;
58 case isl_dim_out: return dim->n_out;
59 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
64 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
67 case isl_dim_param: return 1;
68 case isl_dim_in: return 1 + dim->nparam;
69 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
74 static void isl_dim_map_dim_range(struct isl_dim_map *dim_map,
75 struct isl_dim *dim, enum isl_dim_type type,
76 unsigned first, unsigned n, unsigned dst_pos)
84 src_pos = pos(dim, type);
85 for (i = 0; i < n; ++i)
86 dim_map->pos[1 + dst_pos + i] = src_pos + first + i;
89 static void isl_dim_map_dim(struct isl_dim_map *dim_map, struct isl_dim *dim,
90 enum isl_dim_type type, unsigned dst_pos)
92 isl_dim_map_dim_range(dim_map, dim, type, 0, n(dim, type), dst_pos);
95 static void isl_dim_map_div(struct isl_dim_map *dim_map,
96 struct isl_basic_map *bmap, unsigned dst_pos)
101 if (!dim_map || !bmap)
104 src_pos = 1 + isl_dim_total(bmap->dim);
105 for (i = 0; i < bmap->n_div; ++i)
106 dim_map->pos[1 + dst_pos + i] = src_pos + i;
109 static void isl_dim_map_dump(struct isl_dim_map *dim_map)
113 for (i = 0; i < dim_map->len; ++i)
114 fprintf(stderr, "%d -> %d; ", i, dim_map->pos[i]);
115 fprintf(stderr, "\n");
118 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
119 enum isl_dim_type type)
126 case isl_dim_out: return isl_dim_size(bmap->dim, type);
127 case isl_dim_div: return bmap->n_div;
128 case isl_dim_all: return isl_basic_map_total_dim(bmap);
133 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
135 return map ? n(map->dim, type) : 0;
138 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
140 return set ? n(set->dim, type) : 0;
143 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
144 enum isl_dim_type type)
146 struct isl_dim *dim = bmap->dim;
148 case isl_dim_param: return 1;
149 case isl_dim_in: return 1 + dim->nparam;
150 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
151 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
156 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
158 return pos(map->dim, type);
161 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
162 enum isl_dim_type type)
164 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
167 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
169 return isl_basic_set_dim(bset, isl_dim_set);
172 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
174 return isl_basic_set_dim(bset, isl_dim_param);
177 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
179 return isl_dim_total(bset->dim) + bset->n_div;
182 unsigned isl_set_n_dim(const struct isl_set *set)
184 return isl_set_dim(set, isl_dim_set);
187 unsigned isl_set_n_param(const struct isl_set *set)
189 return isl_set_dim(set, isl_dim_param);
192 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
194 return bmap ? bmap->dim->n_in : 0;
197 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
199 return bmap ? bmap->dim->n_out : 0;
202 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
204 return bmap ? bmap->dim->nparam : 0;
207 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
209 return bmap ? bmap->n_div : 0;
212 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
214 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
217 unsigned isl_map_n_in(const struct isl_map *map)
219 return map->dim->n_in;
222 unsigned isl_map_n_out(const struct isl_map *map)
224 return map->dim->n_out;
227 unsigned isl_map_n_param(const struct isl_map *map)
229 return map->dim->nparam;
232 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
237 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
240 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
243 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
244 struct isl_basic_set *bset)
249 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
252 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
255 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
256 struct isl_basic_set *bset)
261 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
264 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
267 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
269 return bmap ? bmap->ctx : NULL;
272 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
274 return bset ? bset->ctx : NULL;
277 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
279 return map ? map->ctx : NULL;
282 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
284 return set ? set->ctx : NULL;
287 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
291 return isl_dim_copy(bmap->dim);
294 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
298 return isl_dim_copy(bset->dim);
301 struct isl_dim *isl_map_get_dim(struct isl_map *map)
305 return isl_dim_copy(map->dim);
308 struct isl_dim *isl_set_get_dim(struct isl_set *set)
312 return isl_dim_copy(set->dim);
315 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
316 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
318 bmap = isl_basic_map_cow(bmap);
321 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
326 isl_basic_map_free(bmap);
330 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
331 enum isl_dim_type type, const char *s)
335 map = isl_map_cow(map);
339 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
343 for (i = 0; i < map->n; ++i) {
344 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
355 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
356 __isl_take isl_basic_map *bmap,
357 enum isl_dim_type type, unsigned pos, const char *s)
361 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
366 isl_basic_map_free(bmap);
370 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
371 enum isl_dim_type type, unsigned pos, const char *s)
378 map->dim = isl_dim_set_name(map->dim, type, pos, s);
382 for (i = 0; i < map->n; ++i) {
383 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
394 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
395 __isl_take isl_basic_set *bset,
396 enum isl_dim_type type, unsigned pos, const char *s)
398 return (isl_basic_set *)isl_basic_map_set_dim_name(
399 (isl_basic_map *)bset, type, pos, s);
402 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
403 enum isl_dim_type type, unsigned pos, const char *s)
405 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
408 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
412 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
415 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
416 struct isl_basic_map *bmap, unsigned extra,
417 unsigned n_eq, unsigned n_ineq)
420 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
425 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
426 if (isl_blk_is_error(bmap->block))
429 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
434 bmap->block2 = isl_blk_empty();
437 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
438 if (isl_blk_is_error(bmap->block2))
441 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
446 for (i = 0; i < n_ineq + n_eq; ++i)
447 bmap->ineq[i] = bmap->block.data + i * row_size;
449 for (i = 0; i < extra; ++i)
450 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
454 bmap->c_size = n_eq + n_ineq;
455 bmap->eq = bmap->ineq + n_ineq;
464 isl_basic_map_free(bmap);
468 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
469 unsigned nparam, unsigned dim, unsigned extra,
470 unsigned n_eq, unsigned n_ineq)
472 struct isl_basic_map *bmap;
473 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
474 return (struct isl_basic_set *)bmap;
477 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
478 unsigned extra, unsigned n_eq, unsigned n_ineq)
480 struct isl_basic_map *bmap;
483 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
484 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
485 return (struct isl_basic_set *)bmap;
488 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
489 unsigned extra, unsigned n_eq, unsigned n_ineq)
491 struct isl_basic_map *bmap;
495 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
500 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
506 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
507 unsigned nparam, unsigned in, unsigned out, unsigned extra,
508 unsigned n_eq, unsigned n_ineq)
510 struct isl_basic_map *bmap;
513 dim = isl_dim_alloc(ctx, nparam, in, out);
517 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
521 static void dup_constraints(
522 struct isl_basic_map *dst, struct isl_basic_map *src)
525 unsigned total = isl_basic_map_total_dim(src);
527 for (i = 0; i < src->n_eq; ++i) {
528 int j = isl_basic_map_alloc_equality(dst);
529 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
532 for (i = 0; i < src->n_ineq; ++i) {
533 int j = isl_basic_map_alloc_inequality(dst);
534 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
537 for (i = 0; i < src->n_div; ++i) {
538 int j = isl_basic_map_alloc_div(dst);
539 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
541 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
544 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
546 struct isl_basic_map *dup;
550 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
551 bmap->n_div, bmap->n_eq, bmap->n_ineq);
554 dup_constraints(dup, bmap);
555 dup->flags = bmap->flags;
556 dup->sample = isl_vec_copy(bmap->sample);
560 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
562 struct isl_basic_map *dup;
564 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
565 return (struct isl_basic_set *)dup;
568 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
573 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
577 return isl_basic_set_dup(bset);
580 struct isl_set *isl_set_copy(struct isl_set *set)
589 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
594 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
598 bmap = isl_basic_map_dup(bmap);
600 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
604 struct isl_map *isl_map_copy(struct isl_map *map)
613 void isl_basic_map_free(struct isl_basic_map *bmap)
621 isl_ctx_deref(bmap->ctx);
623 isl_blk_free(bmap->ctx, bmap->block2);
625 isl_blk_free(bmap->ctx, bmap->block);
626 isl_vec_free(bmap->sample);
627 isl_dim_free(bmap->dim);
631 void isl_basic_set_free(struct isl_basic_set *bset)
633 isl_basic_map_free((struct isl_basic_map *)bset);
636 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
638 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
641 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
647 isl_assert(ctx, room_for_con(bmap, 1), return -1);
648 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
650 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
651 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
652 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
653 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
654 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
655 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
657 int j = isl_basic_map_alloc_inequality(bmap);
661 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
662 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
669 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
670 bmap->extra - bmap->n_div);
674 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
676 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
679 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
683 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
688 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
690 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
693 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
698 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
700 if (pos != bmap->n_eq - 1) {
702 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
703 bmap->eq[bmap->n_eq - 1] = t;
709 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
711 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
714 void isl_basic_map_inequality_to_equality(
715 struct isl_basic_map *bmap, unsigned pos)
720 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
721 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
726 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
727 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
728 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
729 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
732 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
734 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
737 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
743 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
744 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
745 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
746 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
747 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
748 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
749 1 + isl_basic_map_total_dim(bmap),
750 bmap->extra - bmap->n_div);
751 return bmap->n_ineq++;
754 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
756 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
759 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
763 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
768 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
770 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
773 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
778 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
780 if (pos != bmap->n_ineq - 1) {
782 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
783 bmap->ineq[bmap->n_ineq - 1] = t;
784 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
790 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
792 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
795 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
800 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
803 k = isl_basic_map_alloc_equality(bmap);
806 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
809 isl_basic_map_free(bmap);
813 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
816 return (isl_basic_set *)
817 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
820 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
825 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
828 k = isl_basic_map_alloc_inequality(bmap);
831 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
834 isl_basic_map_free(bmap);
838 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
841 return (isl_basic_set *)
842 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
845 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
849 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
850 isl_seq_clr(bmap->div[bmap->n_div] +
851 1 + 1 + isl_basic_map_total_dim(bmap),
852 bmap->extra - bmap->n_div);
853 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
854 return bmap->n_div++;
857 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
859 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
862 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
866 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
871 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
873 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
876 /* Copy constraint from src to dst, putting the vars of src at offset
877 * dim_off in dst and the divs of src at offset div_off in dst.
878 * If both sets are actually map, then dim_off applies to the input
881 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
882 struct isl_basic_map *src_map, isl_int *src,
883 unsigned in_off, unsigned out_off, unsigned div_off)
885 unsigned src_nparam = isl_basic_map_n_param(src_map);
886 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
887 unsigned src_in = isl_basic_map_n_in(src_map);
888 unsigned dst_in = isl_basic_map_n_in(dst_map);
889 unsigned src_out = isl_basic_map_n_out(src_map);
890 unsigned dst_out = isl_basic_map_n_out(dst_map);
891 isl_int_set(dst[0], src[0]);
892 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
893 if (dst_nparam > src_nparam)
894 isl_seq_clr(dst+1+src_nparam,
895 dst_nparam - src_nparam);
896 isl_seq_clr(dst+1+dst_nparam, in_off);
897 isl_seq_cpy(dst+1+dst_nparam+in_off,
899 isl_min(dst_in-in_off, src_in));
900 if (dst_in-in_off > src_in)
901 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
902 dst_in - in_off - src_in);
903 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
904 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
905 src+1+src_nparam+src_in,
906 isl_min(dst_out-out_off, src_out));
907 if (dst_out-out_off > src_out)
908 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
909 dst_out - out_off - src_out);
910 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
911 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
912 src+1+src_nparam+src_in+src_out,
913 isl_min(dst_map->extra-div_off, src_map->n_div));
914 if (dst_map->n_div-div_off > src_map->n_div)
915 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
916 div_off+src_map->n_div,
917 dst_map->n_div - div_off - src_map->n_div);
920 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
921 struct isl_basic_map *src_map, isl_int *src,
922 unsigned in_off, unsigned out_off, unsigned div_off)
924 isl_int_set(dst[0], src[0]);
925 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
928 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
929 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
934 if (!bmap1 || !bmap2)
937 div_off = bmap1->n_div;
939 for (i = 0; i < bmap2->n_eq; ++i) {
940 int i1 = isl_basic_map_alloc_equality(bmap1);
943 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
944 i_pos, o_pos, div_off);
947 for (i = 0; i < bmap2->n_ineq; ++i) {
948 int i1 = isl_basic_map_alloc_inequality(bmap1);
951 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
952 i_pos, o_pos, div_off);
955 for (i = 0; i < bmap2->n_div; ++i) {
956 int i1 = isl_basic_map_alloc_div(bmap1);
959 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
960 i_pos, o_pos, div_off);
963 isl_basic_map_free(bmap2);
968 isl_basic_map_free(bmap1);
969 isl_basic_map_free(bmap2);
973 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
974 struct isl_dim_map *dim_map)
978 for (i = 0; i < dim_map->len; ++i) {
979 if (dim_map->pos[i] < 0)
980 isl_int_set_si(dst[i], 0);
982 isl_int_set(dst[i], src[dim_map->pos[i]]);
986 static void copy_div_dim_map(isl_int *dst, isl_int *src,
987 struct isl_dim_map *dim_map)
989 isl_int_set(dst[0], src[0]);
990 copy_constraint_dim_map(dst+1, src+1, dim_map);
993 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
994 struct isl_basic_map *src, struct isl_dim_map *dim_map)
998 if (!src || !dst || !dim_map)
1001 for (i = 0; i < src->n_eq; ++i) {
1002 int i1 = isl_basic_map_alloc_equality(dst);
1005 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1008 for (i = 0; i < src->n_ineq; ++i) {
1009 int i1 = isl_basic_map_alloc_inequality(dst);
1012 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1015 for (i = 0; i < src->n_div; ++i) {
1016 int i1 = isl_basic_map_alloc_div(dst);
1019 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1023 isl_basic_map_free(src);
1028 isl_basic_map_free(src);
1029 isl_basic_map_free(dst);
1033 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1034 struct isl_basic_set *bset2, unsigned pos)
1036 return (struct isl_basic_set *)
1037 add_constraints((struct isl_basic_map *)bset1,
1038 (struct isl_basic_map *)bset2, 0, pos);
1041 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1042 struct isl_dim *dim, unsigned extra,
1043 unsigned n_eq, unsigned n_ineq)
1045 struct isl_basic_map *ext;
1055 dims_ok = isl_dim_equal(base->dim, dim) &&
1056 base->extra >= base->n_div + extra;
1058 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1059 room_for_ineq(base, n_ineq)) {
1064 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1065 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1066 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1067 extra += base->extra;
1069 n_ineq += base->n_ineq;
1071 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1077 ext->sample = isl_vec_copy(base->sample);
1078 flags = base->flags;
1079 ext = add_constraints(ext, base, 0, 0);
1082 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1089 isl_basic_map_free(base);
1093 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1094 struct isl_dim *dim, unsigned extra,
1095 unsigned n_eq, unsigned n_ineq)
1097 return (struct isl_basic_set *)
1098 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1099 extra, n_eq, n_ineq);
1102 struct isl_basic_map *isl_basic_map_extend_constraints(
1103 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1107 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1111 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1112 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1113 unsigned n_eq, unsigned n_ineq)
1115 struct isl_basic_map *bmap;
1116 struct isl_dim *dim;
1120 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1124 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1127 isl_basic_map_free(base);
1131 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1132 unsigned nparam, unsigned dim, unsigned extra,
1133 unsigned n_eq, unsigned n_ineq)
1135 return (struct isl_basic_set *)
1136 isl_basic_map_extend((struct isl_basic_map *)base,
1137 nparam, 0, dim, extra, n_eq, n_ineq);
1140 struct isl_basic_set *isl_basic_set_extend_constraints(
1141 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1143 return (struct isl_basic_set *)
1144 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1148 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1150 return (struct isl_basic_set *)
1151 isl_basic_map_cow((struct isl_basic_map *)bset);
1154 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1159 if (bmap->ref > 1) {
1161 bmap = isl_basic_map_dup(bmap);
1164 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1168 struct isl_set *isl_set_cow(struct isl_set *set)
1176 return isl_set_dup(set);
1179 struct isl_map *isl_map_cow(struct isl_map *map)
1187 return isl_map_dup(map);
1190 static void swap_vars(struct isl_blk blk, isl_int *a,
1191 unsigned a_len, unsigned b_len)
1193 isl_seq_cpy(blk.data, a+a_len, b_len);
1194 isl_seq_cpy(blk.data+b_len, a, a_len);
1195 isl_seq_cpy(a, blk.data, b_len+a_len);
1198 struct isl_basic_set *isl_basic_set_swap_vars(
1199 struct isl_basic_set *bset, unsigned n)
1209 nparam = isl_basic_set_n_param(bset);
1210 dim = isl_basic_set_n_dim(bset);
1211 isl_assert(bset->ctx, n <= dim, goto error);
1216 bset = isl_basic_set_cow(bset);
1220 blk = isl_blk_alloc(bset->ctx, dim);
1221 if (isl_blk_is_error(blk))
1224 for (i = 0; i < bset->n_eq; ++i)
1226 bset->eq[i]+1+nparam, n, dim - n);
1228 for (i = 0; i < bset->n_ineq; ++i)
1230 bset->ineq[i]+1+nparam, n, dim - n);
1232 for (i = 0; i < bset->n_div; ++i)
1234 bset->div[i]+1+1+nparam, n, dim - n);
1236 isl_blk_free(bset->ctx, blk);
1238 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1239 return isl_basic_set_gauss(bset, NULL);
1241 isl_basic_set_free(bset);
1245 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1248 set = isl_set_cow(set);
1252 for (i = 0; i < set->n; ++i) {
1253 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1259 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1263 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1269 total = isl_basic_map_total_dim(bmap);
1270 isl_basic_map_free_div(bmap, bmap->n_div);
1271 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1273 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1275 i = isl_basic_map_alloc_equality(bmap);
1279 isl_int_set_si(bmap->eq[i][0], 1);
1280 isl_seq_clr(bmap->eq[i]+1, total);
1281 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1282 isl_vec_free(bmap->sample);
1283 bmap->sample = NULL;
1284 return isl_basic_map_finalize(bmap);
1286 isl_basic_map_free(bmap);
1290 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1292 return (struct isl_basic_set *)
1293 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1296 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1299 unsigned off = isl_dim_total(bmap->dim);
1300 isl_int *t = bmap->div[a];
1301 bmap->div[a] = bmap->div[b];
1304 for (i = 0; i < bmap->n_eq; ++i)
1305 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1307 for (i = 0; i < bmap->n_ineq; ++i)
1308 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1310 for (i = 0; i < bmap->n_div; ++i)
1311 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1312 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1315 /* Eliminate the specified n dimensions starting at first from the
1316 * constraints using Fourier-Motzkin. The dimensions themselves
1319 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1320 enum isl_dim_type type, unsigned first, unsigned n)
1329 map = isl_map_cow(map);
1332 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1333 first += pos(map->dim, type) - 1;
1335 for (i = 0; i < map->n; ++i) {
1336 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1346 /* Eliminate the specified n dimensions starting at first from the
1347 * constraints using Fourier-Motzkin. The dimensions themselves
1350 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1351 enum isl_dim_type type, unsigned first, unsigned n)
1353 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1356 /* Eliminate the specified n dimensions starting at first from the
1357 * constraints using Fourier-Motzkin. The dimensions themselves
1360 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1361 unsigned first, unsigned n)
1363 return isl_set_eliminate(set, isl_dim_set, first, n);
1366 /* Project out n dimensions starting at first using Fourier-Motzkin */
1367 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1368 unsigned first, unsigned n)
1370 set = isl_set_eliminate_dims(set, first, n);
1371 set = isl_set_drop_dims(set, first, n);
1375 struct isl_basic_set *isl_basic_set_remove_divs(struct isl_basic_set *bset)
1377 bset = isl_basic_set_eliminate_vars(bset, isl_dim_total(bset->dim),
1385 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1394 set = isl_set_cow(set);
1398 for (i = 0; i < set->n; ++i) {
1399 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1409 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1410 enum isl_dim_type type, unsigned first, unsigned n)
1414 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1418 bmap = isl_basic_map_eliminate_vars(bmap,
1419 isl_basic_map_offset(bmap, type) - 1 + first, n);
1422 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1424 bmap = isl_basic_map_drop(bmap, type, first, n);
1427 isl_basic_map_free(bmap);
1431 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1432 enum isl_dim_type type, unsigned first, unsigned n)
1434 return (isl_basic_set *)
1435 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1438 struct isl_map *isl_map_remove(struct isl_map *map,
1439 enum isl_dim_type type, unsigned first, unsigned n)
1446 map = isl_map_cow(map);
1449 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1451 for (i = 0; i < map->n; ++i) {
1452 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1453 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1457 map = isl_map_drop(map, type, first, n);
1464 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1465 enum isl_dim_type type, unsigned first, unsigned n)
1467 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1470 /* Project out n inputs starting at first using Fourier-Motzkin */
1471 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1472 unsigned first, unsigned n)
1474 return isl_map_remove(map, isl_dim_in, first, n);
1477 /* Project out n dimensions starting at first using Fourier-Motzkin */
1478 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1479 unsigned first, unsigned n)
1481 unsigned nparam = isl_basic_set_n_param(bset);
1482 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1483 bset = isl_basic_set_drop_dims(bset, first, n);
1487 static void dump_term(struct isl_basic_map *bmap,
1488 isl_int c, int pos, FILE *out)
1491 unsigned in = isl_basic_map_n_in(bmap);
1492 unsigned dim = in + isl_basic_map_n_out(bmap);
1493 unsigned nparam = isl_basic_map_n_param(bmap);
1495 isl_int_print(out, c, 0);
1497 if (!isl_int_is_one(c))
1498 isl_int_print(out, c, 0);
1499 if (pos < 1 + nparam) {
1500 name = isl_dim_get_name(bmap->dim,
1501 isl_dim_param, pos - 1);
1503 fprintf(out, "%s", name);
1505 fprintf(out, "p%d", pos - 1);
1506 } else if (pos < 1 + nparam + in)
1507 fprintf(out, "i%d", pos - 1 - nparam);
1508 else if (pos < 1 + nparam + dim)
1509 fprintf(out, "o%d", pos - 1 - nparam - in);
1511 fprintf(out, "e%d", pos - 1 - nparam - dim);
1515 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1516 int sign, FILE *out)
1520 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1524 for (i = 0, first = 1; i < len; ++i) {
1525 if (isl_int_sgn(c[i]) * sign <= 0)
1528 fprintf(out, " + ");
1530 isl_int_abs(v, c[i]);
1531 dump_term(bmap, v, i, out);
1538 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1539 const char *op, FILE *out, int indent)
1543 fprintf(out, "%*s", indent, "");
1545 dump_constraint_sign(bmap, c, 1, out);
1546 fprintf(out, " %s ", op);
1547 dump_constraint_sign(bmap, c, -1, out);
1551 for (i = bmap->n_div; i < bmap->extra; ++i) {
1552 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1554 fprintf(out, "%*s", indent, "");
1555 fprintf(out, "ERROR: unused div coefficient not zero\n");
1560 static void dump_constraints(struct isl_basic_map *bmap,
1561 isl_int **c, unsigned n,
1562 const char *op, FILE *out, int indent)
1566 for (i = 0; i < n; ++i)
1567 dump_constraint(bmap, c[i], op, out, indent);
1570 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1574 unsigned total = isl_basic_map_total_dim(bmap);
1576 for (j = 0; j < 1 + total; ++j) {
1577 if (isl_int_is_zero(exp[j]))
1579 if (!first && isl_int_is_pos(exp[j]))
1581 dump_term(bmap, exp[j], j, out);
1586 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1590 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1591 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1593 for (i = 0; i < bmap->n_div; ++i) {
1594 fprintf(out, "%*s", indent, "");
1595 fprintf(out, "e%d = [(", i);
1596 dump_affine(bmap, bmap->div[i]+1, out);
1598 isl_int_print(out, bmap->div[i][0], 0);
1599 fprintf(out, "]\n");
1603 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1606 fprintf(out, "null basic set\n");
1610 fprintf(out, "%*s", indent, "");
1611 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1612 bset->ref, bset->dim->nparam, bset->dim->n_out,
1613 bset->extra, bset->flags);
1614 dump((struct isl_basic_map *)bset, out, indent);
1617 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1620 fprintf(out, "null basic map\n");
1624 fprintf(out, "%*s", indent, "");
1625 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1626 "flags: %x, n_name: %d\n",
1628 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1629 bmap->extra, bmap->flags, bmap->dim->n_name);
1630 dump(bmap, out, indent);
1633 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1638 total = isl_basic_map_total_dim(bmap);
1639 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1640 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1641 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1642 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1646 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1648 struct isl_set *set;
1652 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1653 isl_assert(dim->ctx, n >= 0, return NULL);
1654 set = isl_alloc(dim->ctx, struct isl_set,
1655 sizeof(struct isl_set) +
1656 (n - 1) * sizeof(struct isl_basic_set *));
1660 set->ctx = dim->ctx;
1661 isl_ctx_ref(set->ctx);
1673 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1674 unsigned nparam, unsigned dim, int n, unsigned flags)
1676 struct isl_set *set;
1677 struct isl_dim *dims;
1679 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1683 set = isl_set_alloc_dim(dims, n, flags);
1687 /* Make sure "map" has room for at least "n" more basic maps.
1689 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1692 struct isl_map *grown = NULL;
1696 isl_assert(map->ctx, n >= 0, goto error);
1697 if (map->n + n <= map->size)
1699 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1702 for (i = 0; i < map->n; ++i) {
1703 grown->p[i] = isl_basic_map_copy(map->p[i]);
1711 isl_map_free(grown);
1716 /* Make sure "set" has room for at least "n" more basic sets.
1718 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1720 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1723 struct isl_set *isl_set_dup(struct isl_set *set)
1726 struct isl_set *dup;
1731 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1734 for (i = 0; i < set->n; ++i)
1735 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1739 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1741 struct isl_set *set;
1746 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1748 isl_basic_set_free(bset);
1751 return isl_set_add_basic_set(set, bset);
1754 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1756 struct isl_map *map;
1761 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1763 isl_basic_map_free(bmap);
1766 return isl_map_add_basic_map(map, bmap);
1769 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1770 __isl_take isl_basic_set *bset)
1772 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1773 (struct isl_basic_map *)bset);
1776 void isl_set_free(struct isl_set *set)
1786 isl_ctx_deref(set->ctx);
1787 for (i = 0; i < set->n; ++i)
1788 isl_basic_set_free(set->p[i]);
1789 isl_dim_free(set->dim);
1793 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1798 fprintf(out, "null set\n");
1802 fprintf(out, "%*s", indent, "");
1803 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1804 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1806 for (i = 0; i < set->n; ++i) {
1807 fprintf(out, "%*s", indent, "");
1808 fprintf(out, "basic set %d:\n", i);
1809 isl_basic_set_dump(set->p[i], out, indent+4);
1813 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1818 fprintf(out, "null map\n");
1822 fprintf(out, "%*s", indent, "");
1823 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1824 "flags: %x, n_name: %d\n",
1825 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1826 map->dim->n_out, map->flags, map->dim->n_name);
1827 for (i = 0; i < map->n; ++i) {
1828 fprintf(out, "%*s", indent, "");
1829 fprintf(out, "basic map %d:\n", i);
1830 isl_basic_map_dump(map->p[i], out, indent+4);
1834 struct isl_basic_map *isl_basic_map_intersect_domain(
1835 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1837 struct isl_basic_map *bmap_domain;
1838 struct isl_dim *dim;
1843 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1844 bset->dim, isl_dim_param), goto error);
1846 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1847 isl_assert(bset->ctx,
1848 isl_basic_map_compatible_domain(bmap, bset), goto error);
1850 bmap = isl_basic_map_cow(bmap);
1853 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1854 bset->n_div, bset->n_eq, bset->n_ineq);
1855 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1856 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1857 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1859 bmap = isl_basic_map_simplify(bmap);
1860 return isl_basic_map_finalize(bmap);
1862 isl_basic_map_free(bmap);
1863 isl_basic_set_free(bset);
1867 struct isl_basic_map *isl_basic_map_intersect_range(
1868 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1870 struct isl_basic_map *bmap_range;
1875 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1876 bset->dim, isl_dim_param), goto error);
1878 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1879 isl_assert(bset->ctx,
1880 isl_basic_map_compatible_range(bmap, bset), goto error);
1882 bmap = isl_basic_map_cow(bmap);
1885 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1886 bset->n_div, bset->n_eq, bset->n_ineq);
1887 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1888 bmap = add_constraints(bmap, bmap_range, 0, 0);
1890 bmap = isl_basic_map_simplify(bmap);
1891 return isl_basic_map_finalize(bmap);
1893 isl_basic_map_free(bmap);
1894 isl_basic_set_free(bset);
1898 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1904 total = 1 + isl_basic_map_total_dim(bmap);
1905 if (total != vec->size)
1910 for (i = 0; i < bmap->n_eq; ++i) {
1911 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1912 if (!isl_int_is_zero(s)) {
1918 for (i = 0; i < bmap->n_ineq; ++i) {
1919 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1920 if (isl_int_is_neg(s)) {
1931 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1933 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1936 struct isl_basic_map *isl_basic_map_intersect(
1937 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1939 struct isl_vec *sample = NULL;
1941 if (!bmap1 || !bmap2)
1944 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1945 bmap2->dim, isl_dim_param), goto error);
1946 if (isl_dim_total(bmap1->dim) ==
1947 isl_dim_size(bmap1->dim, isl_dim_param) &&
1948 isl_dim_total(bmap2->dim) !=
1949 isl_dim_size(bmap2->dim, isl_dim_param))
1950 return isl_basic_map_intersect(bmap2, bmap1);
1952 if (isl_dim_total(bmap2->dim) !=
1953 isl_dim_size(bmap2->dim, isl_dim_param))
1954 isl_assert(bmap1->ctx,
1955 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1957 if (bmap1->sample &&
1958 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1959 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1960 sample = isl_vec_copy(bmap1->sample);
1961 else if (bmap2->sample &&
1962 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1963 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1964 sample = isl_vec_copy(bmap2->sample);
1966 bmap1 = isl_basic_map_cow(bmap1);
1969 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
1970 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
1971 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
1974 isl_vec_free(sample);
1976 isl_vec_free(bmap1->sample);
1977 bmap1->sample = sample;
1980 bmap1 = isl_basic_map_simplify(bmap1);
1981 return isl_basic_map_finalize(bmap1);
1984 isl_vec_free(sample);
1985 isl_basic_map_free(bmap1);
1986 isl_basic_map_free(bmap2);
1990 struct isl_basic_set *isl_basic_set_intersect(
1991 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
1993 return (struct isl_basic_set *)
1994 isl_basic_map_intersect(
1995 (struct isl_basic_map *)bset1,
1996 (struct isl_basic_map *)bset2);
1999 /* Special case of isl_map_intersect, where both map1 and map2
2000 * are convex, without any divs and such that either map1 or map2
2001 * contains a single constraint. This constraint is then simply
2002 * added to the other map.
2004 static __isl_give isl_map *map_intersect_add_constraint(
2005 __isl_take isl_map *map1, __isl_take isl_map *map2)
2007 struct isl_basic_map *bmap1;
2008 struct isl_basic_map *bmap2;
2010 isl_assert(map1->ctx, map1->n == 1, goto error);
2011 isl_assert(map2->ctx, map1->n == 1, goto error);
2012 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2013 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2015 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2016 return isl_map_intersect(map2, map1);
2018 isl_assert(map2->ctx,
2019 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2021 map1 = isl_map_cow(map1);
2024 if (isl_map_fast_is_empty(map1)) {
2028 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2029 if (map2->p[0]->n_eq == 1)
2030 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2032 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2033 map2->p[0]->ineq[0]);
2035 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2036 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2040 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2041 isl_basic_map_free(map1->p[0]);
2054 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2057 struct isl_map *result;
2063 if (isl_map_fast_is_empty(map1)) {
2067 if (isl_map_fast_is_empty(map2)) {
2072 if (map1->n == 1 && map2->n == 1 &&
2073 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2074 isl_dim_equal(map1->dim, map2->dim) &&
2075 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2076 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2077 return map_intersect_add_constraint(map1, map2);
2078 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2079 map2->dim, isl_dim_param), goto error);
2080 if (isl_dim_total(map1->dim) ==
2081 isl_dim_size(map1->dim, isl_dim_param) &&
2082 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2083 return isl_map_intersect(map2, map1);
2085 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2086 isl_assert(map1->ctx,
2087 isl_dim_equal(map1->dim, map2->dim), goto error);
2089 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2090 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2091 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2093 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2094 map1->n * map2->n, flags);
2097 for (i = 0; i < map1->n; ++i)
2098 for (j = 0; j < map2->n; ++j) {
2099 struct isl_basic_map *part;
2100 part = isl_basic_map_intersect(
2101 isl_basic_map_copy(map1->p[i]),
2102 isl_basic_map_copy(map2->p[j]));
2103 if (isl_basic_map_is_empty(part))
2104 isl_basic_map_free(part);
2106 result = isl_map_add_basic_map(result, part);
2119 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2121 return (struct isl_set *)
2122 isl_map_intersect((struct isl_map *)set1,
2123 (struct isl_map *)set2);
2126 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2128 struct isl_dim *dim;
2129 struct isl_basic_set *bset;
2134 bmap = isl_basic_map_cow(bmap);
2137 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2138 in = isl_basic_map_n_in(bmap);
2139 bset = isl_basic_set_from_basic_map(bmap);
2140 bset = isl_basic_set_swap_vars(bset, in);
2141 return isl_basic_map_from_basic_set(bset, dim);
2144 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2145 enum isl_dim_type type, unsigned pos, unsigned n)
2147 struct isl_dim *res_dim;
2148 struct isl_basic_map *res;
2149 struct isl_dim_map *dim_map;
2150 unsigned total, off;
2151 enum isl_dim_type t;
2159 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2161 total = isl_basic_map_total_dim(bmap) + n;
2162 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2164 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2166 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2168 unsigned size = isl_basic_map_dim(bmap, t);
2169 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2171 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2172 pos, size - pos, off + pos + n);
2174 off += isl_dim_size(res_dim, t);
2176 isl_dim_map_div(dim_map, bmap, off);
2178 res = isl_basic_map_alloc_dim(res_dim,
2179 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2180 res = add_constraints_dim_map(res, bmap, dim_map);
2181 res = isl_basic_map_simplify(res);
2182 return isl_basic_map_finalize(res);
2185 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2186 enum isl_dim_type type, unsigned n)
2190 return isl_basic_map_insert(bmap, type,
2191 isl_basic_map_dim(bmap, type), n);
2194 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2195 enum isl_dim_type type, unsigned n)
2199 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2200 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2202 isl_basic_set_free(bset);
2206 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2207 enum isl_dim_type type, unsigned pos, unsigned n)
2214 map = isl_map_cow(map);
2218 map->dim = isl_dim_insert(map->dim, type, pos, n);
2222 for (i = 0; i < map->n; ++i) {
2223 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2234 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2235 enum isl_dim_type type, unsigned pos, unsigned n)
2237 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2240 __isl_give isl_map *isl_map_add(__isl_take isl_map *map,
2241 enum isl_dim_type type, unsigned n)
2245 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2248 __isl_give isl_set *isl_set_add(__isl_take isl_set *set,
2249 enum isl_dim_type type, unsigned n)
2253 isl_assert(set->ctx, type != isl_dim_in, goto error);
2254 return (isl_set *)isl_map_add((isl_map *)set, type, n);
2260 __isl_give isl_basic_map *isl_basic_map_move_dims(
2261 __isl_take isl_basic_map *bmap,
2262 enum isl_dim_type dst_type, unsigned dst_pos,
2263 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2266 struct isl_dim_map *dim_map;
2267 struct isl_basic_map *res;
2268 enum isl_dim_type t;
2269 unsigned total, off;
2276 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2279 if (dst_type == src_type && dst_pos == src_pos)
2282 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2284 if (pos(bmap->dim, dst_type) + dst_pos ==
2285 pos(bmap->dim, src_type) + src_pos +
2286 ((src_type < dst_type) ? n : 0)) {
2287 bmap = isl_basic_map_cow(bmap);
2291 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2292 src_type, src_pos, n);
2296 bmap = isl_basic_map_finalize(bmap);
2301 total = isl_basic_map_total_dim(bmap);
2302 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2305 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2306 unsigned size = isl_dim_size(bmap->dim, t);
2307 if (t == dst_type) {
2308 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2311 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2314 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2315 dst_pos, size - dst_pos, off);
2316 off += size - dst_pos;
2317 } else if (t == src_type) {
2318 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2321 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2322 src_pos + n, size - src_pos - n, off);
2323 off += size - src_pos - n;
2325 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2329 isl_dim_map_div(dim_map, bmap, off);
2331 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2332 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2333 bmap = add_constraints_dim_map(res, bmap, dim_map);
2335 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2336 src_type, src_pos, n);
2340 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2341 bmap = isl_basic_map_gauss(bmap, NULL);
2342 bmap = isl_basic_map_finalize(bmap);
2346 isl_basic_map_free(bmap);
2350 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2351 enum isl_dim_type dst_type, unsigned dst_pos,
2352 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2354 return (isl_basic_set *)isl_basic_map_move_dims(
2355 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2358 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2359 enum isl_dim_type dst_type, unsigned dst_pos,
2360 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2364 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2365 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2366 src_type, src_pos, n);
2372 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2373 enum isl_dim_type dst_type, unsigned dst_pos,
2374 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2383 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2386 if (dst_type == src_type && dst_pos == src_pos)
2389 isl_assert(map->ctx, dst_type != src_type, goto error);
2391 map = isl_map_cow(map);
2395 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2399 for (i = 0; i < map->n; ++i) {
2400 map->p[i] = isl_basic_map_move_dims(map->p[i],
2402 src_type, src_pos, n);
2413 /* Move the specified dimensions to the last columns right before
2414 * the divs. Don't change the dimension specification of bmap.
2415 * That's the responsibility of the caller.
2417 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2418 enum isl_dim_type type, unsigned first, unsigned n)
2420 struct isl_dim_map *dim_map;
2421 struct isl_basic_map *res;
2422 enum isl_dim_type t;
2423 unsigned total, off;
2427 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2430 total = isl_basic_map_total_dim(bmap);
2431 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2434 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2435 unsigned size = isl_dim_size(bmap->dim, t);
2437 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2440 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2441 first, n, total - bmap->n_div - n);
2442 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2443 first + n, size - (first + n), off);
2444 off += size - (first + n);
2446 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2450 isl_dim_map_div(dim_map, bmap, off + n);
2452 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2453 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2454 res = add_constraints_dim_map(res, bmap, dim_map);
2458 /* Turn the n dimensions of type type, starting at first
2459 * into existentially quantified variables.
2461 __isl_give isl_basic_map *isl_basic_map_project_out(
2462 __isl_take isl_basic_map *bmap,
2463 enum isl_dim_type type, unsigned first, unsigned n)
2476 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2477 return isl_basic_map_remove(bmap, type, first, n);
2479 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2482 bmap = move_last(bmap, type, first, n);
2483 bmap = isl_basic_map_cow(bmap);
2487 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2488 old = bmap->block2.data;
2489 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2490 (bmap->extra + n) * (1 + row_size));
2491 if (!bmap->block2.data)
2493 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2496 for (i = 0; i < n; ++i) {
2497 new_div[i] = bmap->block2.data +
2498 (bmap->extra + i) * (1 + row_size);
2499 isl_seq_clr(new_div[i], 1 + row_size);
2501 for (i = 0; i < bmap->extra; ++i)
2502 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2504 bmap->div = new_div;
2508 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2511 bmap = isl_basic_map_simplify(bmap);
2512 bmap = isl_basic_map_drop_redundant_divs(bmap);
2513 return isl_basic_map_finalize(bmap);
2515 isl_basic_map_free(bmap);
2519 /* Turn the n dimensions of type type, starting at first
2520 * into existentially quantified variables.
2522 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2523 enum isl_dim_type type, unsigned first, unsigned n)
2525 return (isl_basic_set *)isl_basic_map_project_out(
2526 (isl_basic_map *)bset, type, first, n);
2529 /* Turn the n dimensions of type type, starting at first
2530 * into existentially quantified variables.
2532 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2533 enum isl_dim_type type, unsigned first, unsigned n)
2543 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2545 map = isl_map_cow(map);
2549 map->dim = isl_dim_drop(map->dim, type, first, n);
2553 for (i = 0; i < map->n; ++i) {
2554 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2565 /* Turn the n dimensions of type type, starting at first
2566 * into existentially quantified variables.
2568 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2569 enum isl_dim_type type, unsigned first, unsigned n)
2571 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2574 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2578 for (i = 0; i < n; ++i) {
2579 j = isl_basic_map_alloc_div(bmap);
2582 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2586 isl_basic_map_free(bmap);
2590 struct isl_basic_map *isl_basic_map_apply_range(
2591 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2593 struct isl_dim *dim_result = NULL;
2594 struct isl_basic_map *bmap;
2595 unsigned n_in, n_out, n, nparam, total, pos;
2596 struct isl_dim_map *dim_map1, *dim_map2;
2598 if (!bmap1 || !bmap2)
2601 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2602 isl_dim_copy(bmap2->dim));
2604 n_in = isl_basic_map_n_in(bmap1);
2605 n_out = isl_basic_map_n_out(bmap2);
2606 n = isl_basic_map_n_out(bmap1);
2607 nparam = isl_basic_map_n_param(bmap1);
2609 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2610 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2611 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2612 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2613 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2614 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2615 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2616 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2617 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2618 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2619 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2621 bmap = isl_basic_map_alloc_dim(dim_result,
2622 bmap1->n_div + bmap2->n_div + n,
2623 bmap1->n_eq + bmap2->n_eq,
2624 bmap1->n_ineq + bmap2->n_ineq);
2625 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2626 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2627 bmap = add_divs(bmap, n);
2628 bmap = isl_basic_map_simplify(bmap);
2629 bmap = isl_basic_map_drop_redundant_divs(bmap);
2630 return isl_basic_map_finalize(bmap);
2632 isl_basic_map_free(bmap1);
2633 isl_basic_map_free(bmap2);
2637 struct isl_basic_set *isl_basic_set_apply(
2638 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2643 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2646 return (struct isl_basic_set *)
2647 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2649 isl_basic_set_free(bset);
2650 isl_basic_map_free(bmap);
2654 struct isl_basic_map *isl_basic_map_apply_domain(
2655 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2657 if (!bmap1 || !bmap2)
2660 isl_assert(bmap1->ctx,
2661 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2662 isl_assert(bmap1->ctx,
2663 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2666 bmap1 = isl_basic_map_reverse(bmap1);
2667 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2668 return isl_basic_map_reverse(bmap1);
2670 isl_basic_map_free(bmap1);
2671 isl_basic_map_free(bmap2);
2675 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2676 * A \cap B -> f(A) + f(B)
2678 struct isl_basic_map *isl_basic_map_sum(
2679 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2681 unsigned n_in, n_out, nparam, total, pos;
2682 struct isl_basic_map *bmap = NULL;
2683 struct isl_dim_map *dim_map1, *dim_map2;
2686 if (!bmap1 || !bmap2)
2689 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2692 nparam = isl_basic_map_n_param(bmap1);
2693 n_in = isl_basic_map_n_in(bmap1);
2694 n_out = isl_basic_map_n_out(bmap1);
2696 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2697 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2698 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2699 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2700 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2701 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2702 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2703 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2704 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2705 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2706 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2708 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2709 bmap1->n_div + bmap2->n_div + 2 * n_out,
2710 bmap1->n_eq + bmap2->n_eq + n_out,
2711 bmap1->n_ineq + bmap2->n_ineq);
2712 for (i = 0; i < n_out; ++i) {
2713 int j = isl_basic_map_alloc_equality(bmap);
2716 isl_seq_clr(bmap->eq[j], 1+total);
2717 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2718 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2719 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2721 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2722 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2723 bmap = add_divs(bmap, 2 * n_out);
2725 bmap = isl_basic_map_simplify(bmap);
2726 return isl_basic_map_finalize(bmap);
2728 isl_basic_map_free(bmap);
2729 isl_basic_map_free(bmap1);
2730 isl_basic_map_free(bmap2);
2734 /* Given two maps A -> f(A) and B -> g(B), construct a map
2735 * A \cap B -> f(A) + f(B)
2737 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2739 struct isl_map *result;
2745 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2747 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2748 map1->n * map2->n, 0);
2751 for (i = 0; i < map1->n; ++i)
2752 for (j = 0; j < map2->n; ++j) {
2753 struct isl_basic_map *part;
2754 part = isl_basic_map_sum(
2755 isl_basic_map_copy(map1->p[i]),
2756 isl_basic_map_copy(map2->p[j]));
2757 if (isl_basic_map_is_empty(part))
2758 isl_basic_map_free(part);
2760 result = isl_map_add_basic_map(result, part);
2773 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2774 __isl_take isl_set *set2)
2776 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2779 /* Given a basic map A -> f(A), construct A -> -f(A).
2781 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2786 bmap = isl_basic_map_cow(bmap);
2790 n = isl_basic_map_dim(bmap, isl_dim_out);
2791 off = isl_basic_map_offset(bmap, isl_dim_out);
2792 for (i = 0; i < bmap->n_eq; ++i)
2793 for (j = 0; j < n; ++j)
2794 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2795 for (i = 0; i < bmap->n_ineq; ++i)
2796 for (j = 0; j < n; ++j)
2797 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2798 for (i = 0; i < bmap->n_div; ++i)
2799 for (j = 0; j < n; ++j)
2800 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2801 return isl_basic_map_finalize(bmap);
2804 /* Given a map A -> f(A), construct A -> -f(A).
2806 struct isl_map *isl_map_neg(struct isl_map *map)
2810 map = isl_map_cow(map);
2814 for (i = 0; i < map->n; ++i) {
2815 map->p[i] = isl_basic_map_neg(map->p[i]);
2826 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2828 return (isl_set *)isl_map_neg((isl_map *)set);
2831 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2832 * A -> floor(f(A)/d).
2834 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2837 unsigned n_in, n_out, nparam, total, pos;
2838 struct isl_basic_map *result = NULL;
2839 struct isl_dim_map *dim_map;
2845 nparam = isl_basic_map_n_param(bmap);
2846 n_in = isl_basic_map_n_in(bmap);
2847 n_out = isl_basic_map_n_out(bmap);
2849 total = nparam + n_in + n_out + bmap->n_div + n_out;
2850 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2851 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2852 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2853 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2854 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2856 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2857 bmap->n_div + n_out,
2858 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2859 result = add_constraints_dim_map(result, bmap, dim_map);
2860 result = add_divs(result, n_out);
2861 for (i = 0; i < n_out; ++i) {
2863 j = isl_basic_map_alloc_inequality(result);
2866 isl_seq_clr(result->ineq[j], 1+total);
2867 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2868 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2869 j = isl_basic_map_alloc_inequality(result);
2872 isl_seq_clr(result->ineq[j], 1+total);
2873 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2874 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2875 isl_int_sub_ui(result->ineq[j][0], d, 1);
2878 result = isl_basic_map_simplify(result);
2879 return isl_basic_map_finalize(result);
2881 isl_basic_map_free(result);
2885 /* Given a map A -> f(A) and an integer d, construct a map
2886 * A -> floor(f(A)/d).
2888 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2892 map = isl_map_cow(map);
2896 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2897 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2898 for (i = 0; i < map->n; ++i) {
2899 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2910 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2916 i = isl_basic_map_alloc_equality(bmap);
2919 nparam = isl_basic_map_n_param(bmap);
2920 n_in = isl_basic_map_n_in(bmap);
2921 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2922 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2923 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2924 return isl_basic_map_finalize(bmap);
2926 isl_basic_map_free(bmap);
2930 /* Add a constraints to "bmap" expressing i_pos < o_pos
2932 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2938 i = isl_basic_map_alloc_inequality(bmap);
2941 nparam = isl_basic_map_n_param(bmap);
2942 n_in = isl_basic_map_n_in(bmap);
2943 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2944 isl_int_set_si(bmap->ineq[i][0], -1);
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 constraint to "bmap" expressing i_pos <= o_pos
2955 static __isl_give isl_basic_map *var_less_or_equal(
2956 __isl_take isl_basic_map *bmap, unsigned pos)
2962 i = isl_basic_map_alloc_inequality(bmap);
2965 nparam = isl_basic_map_n_param(bmap);
2966 n_in = isl_basic_map_n_in(bmap);
2967 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
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 constraints to "bmap" expressing i_pos > o_pos
2978 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
2984 i = isl_basic_map_alloc_inequality(bmap);
2987 nparam = isl_basic_map_n_param(bmap);
2988 n_in = isl_basic_map_n_in(bmap);
2989 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2990 isl_int_set_si(bmap->ineq[i][0], -1);
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 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3001 static __isl_give isl_basic_map *var_more_or_equal(
3002 __isl_take isl_basic_map *bmap, unsigned pos)
3008 i = isl_basic_map_alloc_inequality(bmap);
3011 nparam = isl_basic_map_n_param(bmap);
3012 n_in = isl_basic_map_n_in(bmap);
3013 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3014 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3015 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3016 return isl_basic_map_finalize(bmap);
3018 isl_basic_map_free(bmap);
3022 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3025 struct isl_basic_map *bmap;
3026 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3029 for (i = 0; i < n_equal && bmap; ++i)
3030 bmap = var_equal(bmap, i);
3031 return isl_basic_map_finalize(bmap);
3034 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3036 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3039 struct isl_basic_map *bmap;
3040 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3043 for (i = 0; i < pos && bmap; ++i)
3044 bmap = var_equal(bmap, i);
3046 bmap = var_less(bmap, pos);
3047 return isl_basic_map_finalize(bmap);
3050 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3052 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3053 __isl_take isl_dim *dim, unsigned pos)
3056 isl_basic_map *bmap;
3058 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3059 for (i = 0; i < pos; ++i)
3060 bmap = var_equal(bmap, i);
3061 bmap = var_less_or_equal(bmap, pos);
3062 return isl_basic_map_finalize(bmap);
3065 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3067 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3070 struct isl_basic_map *bmap;
3071 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3074 for (i = 0; i < pos && bmap; ++i)
3075 bmap = var_equal(bmap, i);
3077 bmap = var_more(bmap, pos);
3078 return isl_basic_map_finalize(bmap);
3081 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3083 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3084 __isl_take isl_dim *dim, unsigned pos)
3087 isl_basic_map *bmap;
3089 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3090 for (i = 0; i < pos; ++i)
3091 bmap = var_equal(bmap, i);
3092 bmap = var_more_or_equal(bmap, pos);
3093 return isl_basic_map_finalize(bmap);
3096 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3097 unsigned n, int equal)
3099 struct isl_map *map;
3102 if (n == 0 && equal)
3103 return isl_map_universe(dims);
3105 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3107 for (i = 0; i + 1 < n; ++i)
3108 map = isl_map_add_basic_map(map,
3109 isl_basic_map_less_at(isl_dim_copy(dims), i));
3112 map = isl_map_add_basic_map(map,
3113 isl_basic_map_less_or_equal_at(dims, n - 1));
3115 map = isl_map_add_basic_map(map,
3116 isl_basic_map_less_at(dims, n - 1));
3123 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3127 return map_lex_lte_first(dims, dims->n_out, equal);
3130 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3132 return map_lex_lte_first(dim, n, 0);
3135 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3137 return map_lex_lte_first(dim, n, 1);
3140 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3142 return map_lex_lte(isl_dim_map(set_dim), 0);
3145 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3147 return map_lex_lte(isl_dim_map(set_dim), 1);
3150 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3151 unsigned n, int equal)
3153 struct isl_map *map;
3156 if (n == 0 && equal)
3157 return isl_map_universe(dims);
3159 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3161 for (i = 0; i + 1 < n; ++i)
3162 map = isl_map_add_basic_map(map,
3163 isl_basic_map_more_at(isl_dim_copy(dims), i));
3166 map = isl_map_add_basic_map(map,
3167 isl_basic_map_more_or_equal_at(dims, n - 1));
3169 map = isl_map_add_basic_map(map,
3170 isl_basic_map_more_at(dims, n - 1));
3177 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3181 return map_lex_gte_first(dims, dims->n_out, equal);
3184 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3186 return map_lex_gte_first(dim, n, 0);
3189 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3191 return map_lex_gte_first(dim, n, 1);
3194 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3196 return map_lex_gte(isl_dim_map(set_dim), 0);
3199 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3201 return map_lex_gte(isl_dim_map(set_dim), 1);
3204 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3205 __isl_take isl_set *set2)
3208 map = isl_map_lex_le(isl_set_get_dim(set1));
3209 map = isl_map_intersect_domain(map, set1);
3210 map = isl_map_intersect_range(map, set2);
3214 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3215 __isl_take isl_set *set2)
3218 map = isl_map_lex_lt(isl_set_get_dim(set1));
3219 map = isl_map_intersect_domain(map, set1);
3220 map = isl_map_intersect_range(map, set2);
3224 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3225 __isl_take isl_set *set2)
3228 map = isl_map_lex_ge(isl_set_get_dim(set1));
3229 map = isl_map_intersect_domain(map, set1);
3230 map = isl_map_intersect_range(map, set2);
3234 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3235 __isl_take isl_set *set2)
3238 map = isl_map_lex_gt(isl_set_get_dim(set1));
3239 map = isl_map_intersect_domain(map, set1);
3240 map = isl_map_intersect_range(map, set2);
3244 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3245 __isl_take isl_map *map2)
3248 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3249 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3250 map = isl_map_apply_range(map, isl_map_reverse(map2));
3254 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3255 __isl_take isl_map *map2)
3258 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3259 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3260 map = isl_map_apply_range(map, isl_map_reverse(map2));
3264 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3265 __isl_take isl_map *map2)
3268 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3269 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3270 map = isl_map_apply_range(map, isl_map_reverse(map2));
3274 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3275 __isl_take isl_map *map2)
3278 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3279 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3280 map = isl_map_apply_range(map, isl_map_reverse(map2));
3284 struct isl_basic_map *isl_basic_map_from_basic_set(
3285 struct isl_basic_set *bset, struct isl_dim *dim)
3287 struct isl_basic_map *bmap;
3289 bset = isl_basic_set_cow(bset);
3293 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3294 isl_dim_free(bset->dim);
3295 bmap = (struct isl_basic_map *) bset;
3297 return isl_basic_map_finalize(bmap);
3299 isl_basic_set_free(bset);
3304 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3308 if (bmap->dim->n_in == 0)
3309 return (struct isl_basic_set *)bmap;
3310 bmap = isl_basic_map_cow(bmap);
3313 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3316 bmap = isl_basic_map_finalize(bmap);
3317 return (struct isl_basic_set *)bmap;
3319 isl_basic_map_free(bmap);
3323 /* For a div d = floor(f/m), add the constraints
3326 * -(f-(n-1)) + m d >= 0
3328 * Note that the second constraint is the negation of
3332 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3333 unsigned pos, isl_int *div)
3336 unsigned total = isl_basic_map_total_dim(bmap);
3338 i = isl_basic_map_alloc_inequality(bmap);
3341 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3342 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3344 j = isl_basic_map_alloc_inequality(bmap);
3347 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3348 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3349 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3353 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3354 unsigned pos, isl_int *div)
3356 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3360 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3362 unsigned total = isl_basic_map_total_dim(bmap);
3363 unsigned div_pos = total - bmap->n_div + div;
3365 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3369 struct isl_basic_set *isl_basic_map_underlying_set(
3370 struct isl_basic_map *bmap)
3374 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3375 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3376 return (struct isl_basic_set *)bmap;
3377 bmap = isl_basic_map_cow(bmap);
3380 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3383 bmap->extra -= bmap->n_div;
3385 bmap = isl_basic_map_finalize(bmap);
3386 return (struct isl_basic_set *)bmap;
3391 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3392 __isl_take isl_basic_set *bset)
3394 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3397 struct isl_basic_map *isl_basic_map_overlying_set(
3398 struct isl_basic_set *bset, struct isl_basic_map *like)
3400 struct isl_basic_map *bmap;
3401 struct isl_ctx *ctx;
3408 isl_assert(ctx, bset->n_div == 0, goto error);
3409 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3410 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3412 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3413 isl_basic_map_free(like);
3414 return (struct isl_basic_map *)bset;
3416 bset = isl_basic_set_cow(bset);
3419 total = bset->dim->n_out + bset->extra;
3420 bmap = (struct isl_basic_map *)bset;
3421 isl_dim_free(bmap->dim);
3422 bmap->dim = isl_dim_copy(like->dim);
3425 bmap->n_div = like->n_div;
3426 bmap->extra += like->n_div;
3429 ltotal = total - bmap->extra + like->extra;
3432 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3433 bmap->extra * (1 + 1 + total));
3434 if (isl_blk_is_error(bmap->block2))
3436 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3440 for (i = 0; i < bmap->extra; ++i)
3441 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3442 for (i = 0; i < like->n_div; ++i) {
3443 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3444 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3446 bmap = isl_basic_map_extend_constraints(bmap,
3447 0, 2 * like->n_div);
3448 for (i = 0; i < like->n_div; ++i) {
3449 if (isl_int_is_zero(bmap->div[i][0]))
3451 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3455 isl_basic_map_free(like);
3456 bmap = isl_basic_map_simplify(bmap);
3457 bmap = isl_basic_map_finalize(bmap);
3460 isl_basic_map_free(like);
3461 isl_basic_set_free(bset);
3465 struct isl_basic_set *isl_basic_set_from_underlying_set(
3466 struct isl_basic_set *bset, struct isl_basic_set *like)
3468 return (struct isl_basic_set *)
3469 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3472 struct isl_set *isl_set_from_underlying_set(
3473 struct isl_set *set, struct isl_basic_set *like)
3479 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3481 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3482 isl_basic_set_free(like);
3485 set = isl_set_cow(set);
3488 for (i = 0; i < set->n; ++i) {
3489 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3490 isl_basic_set_copy(like));
3494 isl_dim_free(set->dim);
3495 set->dim = isl_dim_copy(like->dim);
3498 isl_basic_set_free(like);
3501 isl_basic_set_free(like);
3506 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3510 map = isl_map_cow(map);
3513 map->dim = isl_dim_cow(map->dim);
3517 for (i = 1; i < map->n; ++i)
3518 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3520 for (i = 0; i < map->n; ++i) {
3521 map->p[i] = (struct isl_basic_map *)
3522 isl_basic_map_underlying_set(map->p[i]);
3527 map->dim = isl_dim_underlying(map->dim, 0);
3529 isl_dim_free(map->dim);
3530 map->dim = isl_dim_copy(map->p[0]->dim);
3534 return (struct isl_set *)map;
3540 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3542 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3545 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3546 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3548 bmap = isl_basic_map_cow(bmap);
3552 isl_dim_free(bmap->dim);
3555 bmap = isl_basic_map_finalize(bmap);
3559 isl_basic_map_free(bmap);
3564 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3565 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3567 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3571 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3572 __isl_take isl_dim *dim)
3576 map = isl_map_cow(map);
3580 for (i = 0; i < map->n; ++i) {
3581 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3586 isl_dim_free(map->dim);
3596 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3597 __isl_take isl_dim *dim)
3599 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3602 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3605 struct isl_basic_set *domain;
3611 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3613 n_in = isl_basic_map_n_in(bmap);
3614 n_out = isl_basic_map_n_out(bmap);
3615 domain = isl_basic_set_from_basic_map(bmap);
3616 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3618 domain = isl_basic_set_reset_dim(domain, dim);
3623 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3625 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3628 struct isl_set *isl_map_range(struct isl_map *map)
3631 struct isl_set *set;
3635 if (isl_map_dim(map, isl_dim_in) == 0)
3636 return (isl_set *)map;
3638 map = isl_map_cow(map);
3642 set = (struct isl_set *) map;
3643 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3646 for (i = 0; i < map->n; ++i) {
3647 set->p[i] = isl_basic_map_range(map->p[i]);
3651 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3652 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3659 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3662 struct isl_map *map = NULL;
3664 set = isl_set_cow(set);
3667 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3668 map = (struct isl_map *)set;
3669 for (i = 0; i < set->n; ++i) {
3670 map->p[i] = isl_basic_map_from_basic_set(
3671 set->p[i], isl_dim_copy(dim));
3675 isl_dim_free(map->dim);
3684 struct isl_map *isl_map_from_range(struct isl_set *set)
3686 return (struct isl_map *)set;
3689 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3691 return isl_map_reverse(isl_map_from_range(set));
3694 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3695 __isl_take isl_set *range)
3697 return isl_map_apply_range(isl_map_from_domain(domain),
3698 isl_map_from_range(range));
3701 struct isl_set *isl_set_from_map(struct isl_map *map)
3704 struct isl_set *set = NULL;
3708 map = isl_map_cow(map);
3711 map->dim = isl_dim_as_set_dim(map->dim);
3714 set = (struct isl_set *)map;
3715 for (i = 0; i < map->n; ++i) {
3716 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3726 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3728 struct isl_map *map;
3732 isl_assert(dim->ctx, n >= 0, return NULL);
3733 map = isl_alloc(dim->ctx, struct isl_map,
3734 sizeof(struct isl_map) +
3735 (n - 1) * sizeof(struct isl_basic_map *));
3739 map->ctx = dim->ctx;
3740 isl_ctx_ref(map->ctx);
3752 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3753 unsigned nparam, unsigned in, unsigned out, int n,
3756 struct isl_map *map;
3757 struct isl_dim *dims;
3759 dims = isl_dim_alloc(ctx, nparam, in, out);
3763 map = isl_map_alloc_dim(dims, n, flags);
3767 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3769 struct isl_basic_map *bmap;
3770 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3771 bmap = isl_basic_map_set_to_empty(bmap);
3775 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3777 struct isl_basic_set *bset;
3778 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3779 bset = isl_basic_set_set_to_empty(bset);
3783 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3785 struct isl_basic_map *bmap;
3788 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3789 bmap = isl_basic_map_set_to_empty(bmap);
3793 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3795 struct isl_basic_map *bmap;
3798 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3799 bmap = isl_basic_map_set_to_empty(bmap);
3803 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3805 struct isl_basic_set *bset;
3808 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3809 bset = isl_basic_set_set_to_empty(bset);
3813 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3815 struct isl_basic_map *bmap;
3816 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3820 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
3822 struct isl_basic_set *bset;
3823 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
3827 __isl_give isl_basic_map *isl_basic_map_universe_like(
3828 __isl_keep isl_basic_map *model)
3832 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3835 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
3839 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3842 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
3843 __isl_keep isl_set *model)
3847 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
3850 struct isl_map *isl_map_empty(struct isl_dim *dim)
3852 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3855 struct isl_map *isl_map_empty_like(struct isl_map *model)
3859 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3862 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
3866 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
3869 struct isl_set *isl_set_empty(struct isl_dim *dim)
3871 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
3874 struct isl_set *isl_set_empty_like(struct isl_set *model)
3878 return isl_set_empty(isl_dim_copy(model->dim));
3881 struct isl_map *isl_map_universe(struct isl_dim *dim)
3883 struct isl_map *map;
3886 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3887 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
3891 struct isl_set *isl_set_universe(struct isl_dim *dim)
3893 struct isl_set *set;
3896 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
3897 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
3901 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
3905 return isl_set_universe(isl_dim_copy(model->dim));
3908 struct isl_map *isl_map_dup(struct isl_map *map)
3911 struct isl_map *dup;
3915 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
3916 for (i = 0; i < map->n; ++i)
3917 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
3921 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
3922 __isl_take isl_basic_map *bmap)
3926 if (isl_basic_map_fast_is_empty(bmap)) {
3927 isl_basic_map_free(bmap);
3930 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
3931 isl_assert(map->ctx, map->n < map->size, goto error);
3932 map->p[map->n] = bmap;
3934 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3940 isl_basic_map_free(bmap);
3944 void isl_map_free(struct isl_map *map)
3954 isl_ctx_deref(map->ctx);
3955 for (i = 0; i < map->n; ++i)
3956 isl_basic_map_free(map->p[i]);
3957 isl_dim_free(map->dim);
3961 struct isl_map *isl_map_extend(struct isl_map *base,
3962 unsigned nparam, unsigned n_in, unsigned n_out)
3966 base = isl_map_cow(base);
3970 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
3973 for (i = 0; i < base->n; ++i) {
3974 base->p[i] = isl_basic_map_extend_dim(base->p[i],
3975 isl_dim_copy(base->dim), 0, 0, 0);
3985 struct isl_set *isl_set_extend(struct isl_set *base,
3986 unsigned nparam, unsigned dim)
3988 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
3992 static struct isl_basic_map *isl_basic_map_fix_pos_si(
3993 struct isl_basic_map *bmap, unsigned pos, int value)
3997 bmap = isl_basic_map_cow(bmap);
3998 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
3999 j = isl_basic_map_alloc_equality(bmap);
4002 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4003 isl_int_set_si(bmap->eq[j][pos], -1);
4004 isl_int_set_si(bmap->eq[j][0], value);
4005 bmap = isl_basic_map_simplify(bmap);
4006 return isl_basic_map_finalize(bmap);
4008 isl_basic_map_free(bmap);
4012 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4013 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4017 bmap = isl_basic_map_cow(bmap);
4018 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4019 j = isl_basic_map_alloc_equality(bmap);
4022 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4023 isl_int_set_si(bmap->eq[j][pos], -1);
4024 isl_int_set(bmap->eq[j][0], value);
4025 bmap = isl_basic_map_simplify(bmap);
4026 return isl_basic_map_finalize(bmap);
4028 isl_basic_map_free(bmap);
4032 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4033 enum isl_dim_type type, unsigned pos, int value)
4037 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4038 return isl_basic_map_fix_pos_si(bmap,
4039 isl_basic_map_offset(bmap, type) + pos, value);
4041 isl_basic_map_free(bmap);
4045 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4046 enum isl_dim_type type, unsigned pos, isl_int value)
4050 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4051 return isl_basic_map_fix_pos(bmap,
4052 isl_basic_map_offset(bmap, type) + pos, value);
4054 isl_basic_map_free(bmap);
4058 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4059 enum isl_dim_type type, unsigned pos, int value)
4061 return (struct isl_basic_set *)
4062 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4066 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4067 enum isl_dim_type type, unsigned pos, isl_int value)
4069 return (struct isl_basic_set *)
4070 isl_basic_map_fix((struct isl_basic_map *)bset,
4074 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4075 unsigned input, int value)
4077 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4080 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4081 unsigned dim, int value)
4083 return (struct isl_basic_set *)
4084 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4085 isl_dim_set, dim, value);
4088 struct isl_map *isl_map_fix_si(struct isl_map *map,
4089 enum isl_dim_type type, unsigned pos, int value)
4093 map = isl_map_cow(map);
4097 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4098 for (i = 0; i < map->n; ++i) {
4099 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4103 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4110 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4111 enum isl_dim_type type, unsigned pos, int value)
4113 return (struct isl_set *)
4114 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4117 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4118 enum isl_dim_type type, unsigned pos, isl_int value)
4122 map = isl_map_cow(map);
4126 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4127 for (i = 0; i < map->n; ++i) {
4128 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4132 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4139 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4140 enum isl_dim_type type, unsigned pos, isl_int value)
4142 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4145 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4146 unsigned input, int value)
4148 return isl_map_fix_si(map, isl_dim_in, input, value);
4151 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4153 return (struct isl_set *)
4154 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4157 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4158 __isl_take isl_basic_map *bmap,
4159 enum isl_dim_type type, unsigned pos, int value)
4165 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4166 pos += isl_basic_map_offset(bmap, type);
4167 bmap = isl_basic_map_cow(bmap);
4168 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4169 j = isl_basic_map_alloc_inequality(bmap);
4172 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4173 isl_int_set_si(bmap->ineq[j][pos], 1);
4174 isl_int_set_si(bmap->ineq[j][0], -value);
4175 bmap = isl_basic_map_simplify(bmap);
4176 return isl_basic_map_finalize(bmap);
4178 isl_basic_map_free(bmap);
4182 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4183 unsigned dim, isl_int value)
4187 bset = isl_basic_set_cow(bset);
4188 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4189 j = isl_basic_set_alloc_inequality(bset);
4192 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4193 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4194 isl_int_neg(bset->ineq[j][0], value);
4195 bset = isl_basic_set_simplify(bset);
4196 return isl_basic_set_finalize(bset);
4198 isl_basic_set_free(bset);
4202 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4203 enum isl_dim_type type, unsigned pos, int value)
4207 map = isl_map_cow(map);
4211 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4212 for (i = 0; i < map->n; ++i) {
4213 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4218 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4225 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4226 enum isl_dim_type type, unsigned pos, int value)
4228 return (struct isl_set *)
4229 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4232 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4237 set = isl_set_cow(set);
4241 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4242 for (i = 0; i < set->n; ++i) {
4243 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4253 struct isl_map *isl_map_reverse(struct isl_map *map)
4257 map = isl_map_cow(map);
4261 map->dim = isl_dim_reverse(map->dim);
4264 for (i = 0; i < map->n; ++i) {
4265 map->p[i] = isl_basic_map_reverse(map->p[i]);
4269 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4276 static struct isl_map *isl_basic_map_partial_lexopt(
4277 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4278 struct isl_set **empty, int max)
4282 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4283 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4285 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4287 isl_basic_map_free(bmap);
4288 isl_basic_set_free(dom);
4294 struct isl_map *isl_basic_map_partial_lexmax(
4295 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4296 struct isl_set **empty)
4298 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4301 struct isl_map *isl_basic_map_partial_lexmin(
4302 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4303 struct isl_set **empty)
4305 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4308 struct isl_set *isl_basic_set_partial_lexmin(
4309 struct isl_basic_set *bset, struct isl_basic_set *dom,
4310 struct isl_set **empty)
4312 return (struct isl_set *)
4313 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4317 struct isl_set *isl_basic_set_partial_lexmax(
4318 struct isl_basic_set *bset, struct isl_basic_set *dom,
4319 struct isl_set **empty)
4321 return (struct isl_set *)
4322 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4326 /* Given a basic map "bmap", compute the lexicograhically minimal
4327 * (or maximal) image element for each domain element in dom.
4328 * Set *empty to those elements in dom that do not have an image element.
4330 * We first make sure the basic sets in dom are disjoint and then
4331 * simply collect the results over each of the basic sets separately.
4332 * We could probably improve the efficiency a bit by moving the union
4333 * domain down into the parametric integer programming.
4335 static __isl_give isl_map *basic_map_partial_lexopt(
4336 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4337 __isl_give isl_set **empty, int max)
4340 struct isl_map *res;
4342 dom = isl_set_make_disjoint(dom);
4346 if (isl_set_fast_is_empty(dom)) {
4347 res = isl_map_empty_like_basic_map(bmap);
4348 *empty = isl_set_empty_like(dom);
4350 isl_basic_map_free(bmap);
4354 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4355 isl_basic_set_copy(dom->p[0]), empty, max);
4357 for (i = 1; i < dom->n; ++i) {
4358 struct isl_map *res_i;
4359 struct isl_set *empty_i;
4361 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4362 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4364 res = isl_map_union_disjoint(res, res_i);
4365 *empty = isl_set_union_disjoint(*empty, empty_i);
4369 isl_basic_map_free(bmap);
4374 isl_basic_map_free(bmap);
4378 /* Given a map "map", compute the lexicograhically minimal
4379 * (or maximal) image element for each domain element in dom.
4380 * Set *empty to those elements in dom that do not have an image element.
4382 * We first compute the lexicographically minimal or maximal element
4383 * in the first basic map. This results in a partial solution "res"
4384 * and a subset "todo" of dom that still need to be handled.
4385 * We then consider each of the remaining maps in "map" and successively
4386 * improve both "res" and "todo".
4388 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4389 * Assume we are computing the lexicographical maximum.
4390 * We first intersect basic map i with a relation that maps elements
4391 * to elements that are lexicographically larger than the image elements
4392 * in res^k and the compute the maximum image element of this intersection.
4393 * The result ("better") corresponds to those image elements in basic map i
4394 * that are better than what we had before. The remainder ("keep") are the
4395 * domain elements for which the image element in res_k was better.
4396 * We also compute the lexicographical maximum of basic map i in todo^k.
4397 * res^i is the result of the operation + better + those elements in
4398 * res^k that we should keep
4399 * todo^i is the remainder of the maximum operation on todo^k.
4401 static __isl_give isl_map *isl_map_partial_lexopt(
4402 __isl_take isl_map *map, __isl_take isl_set *dom,
4403 __isl_give isl_set **empty, int max)
4406 struct isl_map *res;
4407 struct isl_set *todo;
4412 if (isl_map_fast_is_empty(map)) {
4420 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4421 isl_set_copy(dom), &todo, max);
4423 for (i = 1; i < map->n; ++i) {
4425 struct isl_map *better;
4426 struct isl_set *keep;
4427 struct isl_map *res_i;
4428 struct isl_set *todo_i;
4429 struct isl_dim *dim = isl_map_get_dim(res);
4431 dim = isl_dim_range(dim);
4433 lt = isl_map_lex_lt(dim);
4435 lt = isl_map_lex_gt(dim);
4436 lt = isl_map_apply_range(isl_map_copy(res), lt);
4437 lt = isl_map_intersect(lt,
4438 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4439 better = isl_map_partial_lexopt(lt,
4440 isl_map_domain(isl_map_copy(res)),
4443 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4444 todo, &todo_i, max);
4446 res = isl_map_intersect_domain(res, keep);
4447 res = isl_map_union_disjoint(res, res_i);
4448 res = isl_map_union_disjoint(res, better);
4469 __isl_give isl_map *isl_map_partial_lexmax(
4470 __isl_take isl_map *map, __isl_take isl_set *dom,
4471 __isl_give isl_set **empty)
4473 return isl_map_partial_lexopt(map, dom, empty, 1);
4476 __isl_give isl_map *isl_map_partial_lexmin(
4477 __isl_take isl_map *map, __isl_take isl_set *dom,
4478 __isl_give isl_set **empty)
4480 return isl_map_partial_lexopt(map, dom, empty, 0);
4483 __isl_give isl_set *isl_set_partial_lexmin(
4484 __isl_take isl_set *set, __isl_take isl_set *dom,
4485 __isl_give isl_set **empty)
4487 return (struct isl_set *)
4488 isl_map_partial_lexmin((struct isl_map *)set,
4492 __isl_give isl_set *isl_set_partial_lexmax(
4493 __isl_take isl_set *set, __isl_take isl_set *dom,
4494 __isl_give isl_set **empty)
4496 return (struct isl_set *)
4497 isl_map_partial_lexmax((struct isl_map *)set,
4501 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4503 struct isl_basic_set *dom = NULL;
4504 struct isl_dim *dom_dim;
4508 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4509 dom = isl_basic_set_universe(dom_dim);
4510 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4512 isl_basic_map_free(bmap);
4516 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4518 return isl_basic_map_lexopt(bmap, 0);
4521 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4523 return isl_basic_map_lexopt(bmap, 1);
4526 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4528 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4531 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4533 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4536 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4538 struct isl_set *dom = NULL;
4539 struct isl_dim *dom_dim;
4543 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4544 dom = isl_set_universe(dom_dim);
4545 return isl_map_partial_lexopt(map, dom, NULL, max);
4551 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4553 return isl_map_lexopt(map, 0);
4556 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4558 return isl_map_lexopt(map, 1);
4561 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4563 return (isl_set *)isl_map_lexmin((isl_map *)set);
4566 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4568 return (isl_set *)isl_map_lexmax((isl_map *)set);
4571 /* Apply a preimage specified by "mat" on the parameters of "bset".
4572 * bset is assumed to have only parameters and divs.
4574 static struct isl_basic_set *basic_set_parameter_preimage(
4575 struct isl_basic_set *bset, struct isl_mat *mat)
4582 bset->dim = isl_dim_cow(bset->dim);
4586 nparam = isl_basic_set_dim(bset, isl_dim_param);
4588 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4590 bset->dim->nparam = 0;
4591 bset->dim->n_out = nparam;
4592 bset = isl_basic_set_preimage(bset, mat);
4594 bset->dim->nparam = bset->dim->n_out;
4595 bset->dim->n_out = 0;
4600 isl_basic_set_free(bset);
4604 /* Apply a preimage specified by "mat" on the parameters of "set".
4605 * set is assumed to have only parameters and divs.
4607 static struct isl_set *set_parameter_preimage(
4608 struct isl_set *set, struct isl_mat *mat)
4610 struct isl_dim *dim = NULL;
4616 dim = isl_dim_copy(set->dim);
4617 dim = isl_dim_cow(dim);
4621 nparam = isl_set_dim(set, isl_dim_param);
4623 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4626 dim->n_out = nparam;
4627 isl_set_reset_dim(set, dim);
4628 set = isl_set_preimage(set, mat);
4631 dim = isl_dim_copy(set->dim);
4632 dim = isl_dim_cow(dim);
4635 dim->nparam = dim->n_out;
4637 isl_set_reset_dim(set, dim);
4647 /* Intersect the basic set "bset" with the affine space specified by the
4648 * equalities in "eq".
4650 static struct isl_basic_set *basic_set_append_equalities(
4651 struct isl_basic_set *bset, struct isl_mat *eq)
4659 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4664 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4665 for (i = 0; i < eq->n_row; ++i) {
4666 k = isl_basic_set_alloc_equality(bset);
4669 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4670 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4674 bset = isl_basic_set_gauss(bset, NULL);
4675 bset = isl_basic_set_finalize(bset);
4680 isl_basic_set_free(bset);
4684 /* Intersect the set "set" with the affine space specified by the
4685 * equalities in "eq".
4687 static struct isl_set *set_append_equalities(struct isl_set *set,
4695 for (i = 0; i < set->n; ++i) {
4696 set->p[i] = basic_set_append_equalities(set->p[i],
4709 /* Project the given basic set onto its parameter domain, possibly introducing
4710 * new, explicit, existential variables in the constraints.
4711 * The input has parameters and (possibly implicit) existential variables.
4712 * The output has the same parameters, but only
4713 * explicit existentially quantified variables.
4715 * The actual projection is performed by pip, but pip doesn't seem
4716 * to like equalities very much, so we first remove the equalities
4717 * among the parameters by performing a variable compression on
4718 * the parameters. Afterward, an inverse transformation is performed
4719 * and the equalities among the parameters are inserted back in.
4721 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4725 struct isl_mat *T, *T2;
4726 struct isl_set *set;
4727 unsigned nparam, n_div;
4729 bset = isl_basic_set_cow(bset);
4733 if (bset->n_eq == 0)
4734 return isl_basic_set_lexmin(bset);
4736 isl_basic_set_gauss(bset, NULL);
4738 nparam = isl_basic_set_dim(bset, isl_dim_param);
4739 n_div = isl_basic_set_dim(bset, isl_dim_div);
4741 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4742 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4745 if (i == bset->n_eq)
4746 return isl_basic_set_lexmin(bset);
4748 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4750 eq = isl_mat_cow(eq);
4751 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4752 if (T && T->n_col == 0) {
4756 bset = isl_basic_set_set_to_empty(bset);
4757 return isl_set_from_basic_set(bset);
4759 bset = basic_set_parameter_preimage(bset, T);
4761 set = isl_basic_set_lexmin(bset);
4762 set = set_parameter_preimage(set, T2);
4763 set = set_append_equalities(set, eq);
4767 /* Compute an explicit representation for all the existentially
4768 * quantified variables.
4769 * The input and output dimensions are first turned into parameters.
4770 * compute_divs then returns a map with the same parameters and
4771 * no input or output dimensions and the dimension specification
4772 * is reset to that of the input.
4774 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4776 struct isl_basic_set *bset;
4777 struct isl_set *set;
4778 struct isl_map *map;
4779 struct isl_dim *dim, *orig_dim = NULL;
4784 bmap = isl_basic_map_cow(bmap);
4788 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4789 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4790 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4791 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4795 orig_dim = bmap->dim;
4797 bset = (struct isl_basic_set *)bmap;
4799 set = parameter_compute_divs(bset);
4800 map = (struct isl_map *)set;
4801 map = isl_map_reset_dim(map, orig_dim);
4805 isl_basic_map_free(bmap);
4809 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4817 off = isl_dim_total(bmap->dim);
4818 for (i = 0; i < bmap->n_div; ++i) {
4819 if (isl_int_is_zero(bmap->div[i][0]))
4821 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
4827 static int map_divs_known(__isl_keep isl_map *map)
4834 for (i = 0; i < map->n; ++i) {
4835 int known = basic_map_divs_known(map->p[i]);
4843 /* If bmap contains any unknown divs, then compute explicit
4844 * expressions for them. However, this computation may be
4845 * quite expensive, so first try to remove divs that aren't
4848 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
4852 struct isl_map *map;
4854 known = basic_map_divs_known(bmap);
4858 return isl_map_from_basic_map(bmap);
4860 bmap = isl_basic_map_drop_redundant_divs(bmap);
4862 known = basic_map_divs_known(bmap);
4866 return isl_map_from_basic_map(bmap);
4868 map = compute_divs(bmap);
4871 isl_basic_map_free(bmap);
4875 struct isl_map *isl_map_compute_divs(struct isl_map *map)
4879 struct isl_map *res;
4886 known = map_divs_known(map);
4894 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
4895 for (i = 1 ; i < map->n; ++i) {
4897 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
4898 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
4899 res = isl_map_union_disjoint(res, r2);
4901 res = isl_map_union(res, r2);
4908 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
4910 return (struct isl_set *)
4911 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
4914 struct isl_set *isl_set_compute_divs(struct isl_set *set)
4916 return (struct isl_set *)
4917 isl_map_compute_divs((struct isl_map *)set);
4920 struct isl_set *isl_map_domain(struct isl_map *map)
4923 struct isl_set *set;
4928 map = isl_map_cow(map);
4932 set = (struct isl_set *)map;
4933 set->dim = isl_dim_domain(set->dim);
4936 for (i = 0; i < map->n; ++i) {
4937 set->p[i] = isl_basic_map_domain(map->p[i]);
4941 ISL_F_CLR(set, ISL_MAP_DISJOINT);
4942 ISL_F_CLR(set, ISL_SET_NORMALIZED);
4949 struct isl_map *isl_map_union_disjoint(
4950 struct isl_map *map1, struct isl_map *map2)
4954 struct isl_map *map = NULL;
4968 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
4970 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
4971 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
4972 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
4974 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
4975 map1->n + map2->n, flags);
4978 for (i = 0; i < map1->n; ++i) {
4979 map = isl_map_add_basic_map(map,
4980 isl_basic_map_copy(map1->p[i]));
4984 for (i = 0; i < map2->n; ++i) {
4985 map = isl_map_add_basic_map(map,
4986 isl_basic_map_copy(map2->p[i]));
5000 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5002 map1 = isl_map_union_disjoint(map1, map2);
5006 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5010 struct isl_set *isl_set_union_disjoint(
5011 struct isl_set *set1, struct isl_set *set2)
5013 return (struct isl_set *)
5014 isl_map_union_disjoint(
5015 (struct isl_map *)set1, (struct isl_map *)set2);
5018 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5020 return (struct isl_set *)
5021 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5024 struct isl_map *isl_map_intersect_range(
5025 struct isl_map *map, struct isl_set *set)
5028 struct isl_map *result;
5034 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5035 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5036 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5038 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5039 map->n * set->n, flags);
5042 for (i = 0; i < map->n; ++i)
5043 for (j = 0; j < set->n; ++j) {
5044 result = isl_map_add_basic_map(result,
5045 isl_basic_map_intersect_range(
5046 isl_basic_map_copy(map->p[i]),
5047 isl_basic_set_copy(set->p[j])));
5060 struct isl_map *isl_map_intersect_domain(
5061 struct isl_map *map, struct isl_set *set)
5063 return isl_map_reverse(
5064 isl_map_intersect_range(isl_map_reverse(map), set));
5067 struct isl_map *isl_map_apply_domain(
5068 struct isl_map *map1, struct isl_map *map2)
5072 map1 = isl_map_reverse(map1);
5073 map1 = isl_map_apply_range(map1, map2);
5074 return isl_map_reverse(map1);
5081 struct isl_map *isl_map_apply_range(
5082 struct isl_map *map1, struct isl_map *map2)
5084 struct isl_dim *dim_result;
5085 struct isl_map *result;
5091 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5092 isl_dim_copy(map2->dim));
5094 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5097 for (i = 0; i < map1->n; ++i)
5098 for (j = 0; j < map2->n; ++j) {
5099 result = isl_map_add_basic_map(result,
5100 isl_basic_map_apply_range(
5101 isl_basic_map_copy(map1->p[i]),
5102 isl_basic_map_copy(map2->p[j])));
5108 if (result && result->n <= 1)
5109 ISL_F_SET(result, ISL_MAP_DISJOINT);
5118 * returns range - domain
5120 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5122 isl_dim *dims, *target_dim;
5123 struct isl_basic_set *bset;
5130 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5131 bmap->dim, isl_dim_out),
5133 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5134 dim = isl_basic_map_n_in(bmap);
5135 nparam = isl_basic_map_n_param(bmap);
5136 bset = isl_basic_set_from_basic_map(bmap);
5137 bset = isl_basic_set_cow(bset);
5138 dims = isl_basic_set_get_dim(bset);
5139 dims = isl_dim_add(dims, isl_dim_set, dim);
5140 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5141 bset = isl_basic_set_swap_vars(bset, 2*dim);
5142 for (i = 0; i < dim; ++i) {
5143 int j = isl_basic_map_alloc_equality(
5144 (struct isl_basic_map *)bset);
5147 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5148 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5149 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5150 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5152 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5153 bset = isl_basic_set_reset_dim(bset, target_dim);
5156 isl_basic_map_free(bmap);
5161 * returns range - domain
5163 struct isl_set *isl_map_deltas(struct isl_map *map)
5167 struct isl_set *result;
5172 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5173 map->dim, isl_dim_out),
5175 dim = isl_map_get_dim(map);
5176 dim = isl_dim_domain(dim);
5177 result = isl_set_alloc_dim(dim, map->n, map->flags);
5180 for (i = 0; i < map->n; ++i)
5181 result = isl_set_add_basic_set(result,
5182 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5190 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5192 struct isl_basic_map *bmap;
5200 nparam = dims->nparam;
5202 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5206 for (i = 0; i < dim; ++i) {
5207 int j = isl_basic_map_alloc_equality(bmap);
5210 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5211 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5212 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5214 return isl_basic_map_finalize(bmap);
5216 isl_basic_map_free(bmap);
5220 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5222 struct isl_dim *dim = isl_dim_map(set_dim);
5225 return basic_map_identity(dim);
5228 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5230 if (!model || !model->dim)
5232 isl_assert(model->ctx,
5233 model->dim->n_in == model->dim->n_out, return NULL);
5234 return basic_map_identity(isl_dim_copy(model->dim));
5237 static struct isl_map *map_identity(struct isl_dim *dim)
5239 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5240 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5243 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5245 struct isl_dim *dim = isl_dim_map(set_dim);
5248 return map_identity(dim);
5251 struct isl_map *isl_map_identity_like(struct isl_map *model)
5253 if (!model || !model->dim)
5255 isl_assert(model->ctx,
5256 model->dim->n_in == model->dim->n_out, return NULL);
5257 return map_identity(isl_dim_copy(model->dim));
5260 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5262 if (!model || !model->dim)
5264 isl_assert(model->ctx,
5265 model->dim->n_in == model->dim->n_out, return NULL);
5266 return map_identity(isl_dim_copy(model->dim));
5269 /* Construct a basic set with all set dimensions having only non-negative
5272 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5277 struct isl_basic_set *bset;
5281 nparam = dims->nparam;
5283 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5286 for (i = 0; i < dim; ++i) {
5287 int k = isl_basic_set_alloc_inequality(bset);
5290 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5291 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5295 isl_basic_set_free(bset);
5299 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5300 enum isl_dim_type type, unsigned first, unsigned n)
5303 isl_basic_set *nonneg = NULL;
5304 isl_basic_set *neg = NULL;
5311 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5313 for (i = 0; i < n; ++i) {
5317 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5318 k = isl_basic_set_alloc_inequality(nonneg);
5321 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5322 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5324 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5325 k = isl_basic_set_alloc_inequality(neg);
5328 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5329 isl_int_set_si(neg->ineq[k][0], -1);
5330 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5332 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5337 isl_basic_set_free(nonneg);
5338 isl_basic_set_free(neg);
5343 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5345 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5348 int isl_basic_map_is_subset(
5349 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5352 struct isl_map *map1;
5353 struct isl_map *map2;
5355 if (!bmap1 || !bmap2)
5358 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5359 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5361 is_subset = isl_map_is_subset(map1, map2);
5369 int isl_basic_map_is_equal(
5370 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5374 if (!bmap1 || !bmap2)
5376 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5379 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5383 int isl_basic_set_is_equal(
5384 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5386 return isl_basic_map_is_equal(
5387 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5390 int isl_map_is_empty(struct isl_map *map)
5397 for (i = 0; i < map->n; ++i) {
5398 is_empty = isl_basic_map_is_empty(map->p[i]);
5407 int isl_map_fast_is_empty(struct isl_map *map)
5409 return map ? map->n == 0 : -1;
5412 int isl_set_fast_is_empty(struct isl_set *set)
5414 return set ? set->n == 0 : -1;
5417 int isl_set_is_empty(struct isl_set *set)
5419 return isl_map_is_empty((struct isl_map *)set);
5422 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5427 return isl_dim_equal(map1->dim, map2->dim);
5430 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5435 return isl_dim_equal(set1->dim, set2->dim);
5438 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5444 is_subset = isl_map_is_subset(map1, map2);
5447 is_subset = isl_map_is_subset(map2, map1);
5451 int isl_basic_map_is_strict_subset(
5452 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5456 if (!bmap1 || !bmap2)
5458 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5461 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5462 if (is_subset == -1)
5467 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5473 is_subset = isl_map_is_subset(map1, map2);
5476 is_subset = isl_map_is_subset(map2, map1);
5477 if (is_subset == -1)
5482 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5484 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5487 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5491 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5494 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5498 return bset->n_eq == 0 && bset->n_ineq == 0;
5501 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5508 for (i = 0; i < map->n; ++i) {
5509 int r = isl_basic_map_is_universe(map->p[i]);
5517 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5519 return isl_map_fast_is_universe((isl_map *) set);
5522 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5524 struct isl_basic_set *bset = NULL;
5525 struct isl_vec *sample = NULL;
5532 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5535 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5536 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5537 copy = isl_basic_map_remove_redundancies(copy);
5538 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5539 isl_basic_map_free(copy);
5543 total = 1 + isl_basic_map_total_dim(bmap);
5544 if (bmap->sample && bmap->sample->size == total) {
5545 int contains = isl_basic_map_contains(bmap, bmap->sample);
5551 isl_vec_free(bmap->sample);
5552 bmap->sample = NULL;
5553 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5556 sample = isl_basic_set_sample_vec(bset);
5559 empty = sample->size == 0;
5560 isl_vec_free(bmap->sample);
5561 bmap->sample = sample;
5563 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5568 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5572 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5575 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5579 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5582 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5584 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5587 struct isl_map *isl_basic_map_union(
5588 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5590 struct isl_map *map;
5591 if (!bmap1 || !bmap2)
5594 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5596 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5599 map = isl_map_add_basic_map(map, bmap1);
5600 map = isl_map_add_basic_map(map, bmap2);
5603 isl_basic_map_free(bmap1);
5604 isl_basic_map_free(bmap2);
5608 struct isl_set *isl_basic_set_union(
5609 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5611 return (struct isl_set *)isl_basic_map_union(
5612 (struct isl_basic_map *)bset1,
5613 (struct isl_basic_map *)bset2);
5616 /* Order divs such that any div only depends on previous divs */
5617 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5625 off = isl_dim_total(bmap->dim);
5627 for (i = 0; i < bmap->n_div; ++i) {
5629 if (isl_int_is_zero(bmap->div[i][0]))
5631 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5635 isl_basic_map_swap_div(bmap, i, i + pos);
5641 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5643 return (struct isl_basic_set *)
5644 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5647 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5654 for (i = 0; i < map->n; ++i) {
5655 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5666 /* Look for a div in dst that corresponds to the div "div" in src.
5667 * The divs before "div" in src and dst are assumed to be the same.
5669 * Returns -1 if no corresponding div was found and the position
5670 * of the corresponding div in dst otherwise.
5672 static int find_div(struct isl_basic_map *dst,
5673 struct isl_basic_map *src, unsigned div)
5677 unsigned total = isl_dim_total(src->dim);
5679 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5680 for (i = div; i < dst->n_div; ++i)
5681 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5682 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5683 dst->n_div - div) == -1)
5688 struct isl_basic_map *isl_basic_map_align_divs(
5689 struct isl_basic_map *dst, struct isl_basic_map *src)
5692 unsigned total = isl_dim_total(src->dim);
5697 if (src->n_div == 0)
5700 for (i = 0; i < src->n_div; ++i)
5701 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5703 src = isl_basic_map_order_divs(src);
5704 dst = isl_basic_map_cow(dst);
5705 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5706 src->n_div, 0, 2 * src->n_div);
5709 for (i = 0; i < src->n_div; ++i) {
5710 int j = find_div(dst, src, i);
5712 j = isl_basic_map_alloc_div(dst);
5715 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5716 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5717 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5721 isl_basic_map_swap_div(dst, i, j);
5725 isl_basic_map_free(dst);
5729 struct isl_basic_set *isl_basic_set_align_divs(
5730 struct isl_basic_set *dst, struct isl_basic_set *src)
5732 return (struct isl_basic_set *)isl_basic_map_align_divs(
5733 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5736 struct isl_map *isl_map_align_divs(struct isl_map *map)
5744 map = isl_map_compute_divs(map);
5745 map = isl_map_cow(map);
5749 for (i = 1; i < map->n; ++i)
5750 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5751 for (i = 1; i < map->n; ++i)
5752 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5754 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5758 struct isl_set *isl_set_align_divs(struct isl_set *set)
5760 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5763 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5767 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5768 map = isl_map_intersect_domain(map, set);
5769 set = isl_map_range(map);
5777 /* There is no need to cow as removing empty parts doesn't change
5778 * the meaning of the set.
5780 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5787 for (i = map->n-1; i >= 0; --i) {
5788 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5790 isl_basic_map_free(map->p[i]);
5791 if (i != map->n-1) {
5792 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5793 map->p[i] = map->p[map->n-1];
5801 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5803 return (struct isl_set *)
5804 isl_map_remove_empty_parts((struct isl_map *)set);
5807 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5809 struct isl_basic_map *bmap;
5810 if (!map || map->n == 0)
5812 bmap = map->p[map->n-1];
5813 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5814 return isl_basic_map_copy(bmap);
5817 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5819 return (struct isl_basic_set *)
5820 isl_map_copy_basic_map((struct isl_map *)set);
5823 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
5824 __isl_keep isl_basic_map *bmap)
5830 for (i = map->n-1; i >= 0; --i) {
5831 if (map->p[i] != bmap)
5833 map = isl_map_cow(map);
5836 isl_basic_map_free(map->p[i]);
5837 if (i != map->n-1) {
5838 ISL_F_CLR(map, ISL_SET_NORMALIZED);
5839 map->p[i] = map->p[map->n-1];
5850 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
5851 struct isl_basic_set *bset)
5853 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
5854 (struct isl_basic_map *)bset);
5857 /* Given two basic sets bset1 and bset2, compute the maximal difference
5858 * between the values of dimension pos in bset1 and those in bset2
5859 * for any common value of the parameters and dimensions preceding pos.
5861 static enum isl_lp_result basic_set_maximal_difference_at(
5862 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
5863 int pos, isl_int *opt)
5865 struct isl_dim *dims;
5866 struct isl_basic_map *bmap1 = NULL;
5867 struct isl_basic_map *bmap2 = NULL;
5868 struct isl_ctx *ctx;
5869 struct isl_vec *obj;
5872 unsigned dim1, dim2;
5873 enum isl_lp_result res;
5875 if (!bset1 || !bset2)
5876 return isl_lp_error;
5878 nparam = isl_basic_set_n_param(bset1);
5879 dim1 = isl_basic_set_n_dim(bset1);
5880 dim2 = isl_basic_set_n_dim(bset2);
5881 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
5882 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
5883 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
5884 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
5885 if (!bmap1 || !bmap2)
5887 bmap1 = isl_basic_map_cow(bmap1);
5888 bmap1 = isl_basic_map_extend(bmap1, nparam,
5889 pos, (dim1 - pos) + (dim2 - pos),
5890 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
5891 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
5894 total = isl_basic_map_total_dim(bmap1);
5896 obj = isl_vec_alloc(ctx, 1 + total);
5897 isl_seq_clr(obj->block.data, 1 + total);
5898 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
5899 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
5902 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
5904 isl_basic_map_free(bmap1);
5908 isl_basic_map_free(bmap1);
5909 isl_basic_map_free(bmap2);
5910 return isl_lp_error;
5913 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
5914 * for any common value of the parameters and dimensions preceding pos
5915 * in both basic sets, the values of dimension pos in bset1 are
5916 * smaller or larger than those in bset2.
5919 * 1 if bset1 follows bset2
5920 * -1 if bset1 precedes bset2
5921 * 0 if bset1 and bset2 are incomparable
5922 * -2 if some error occurred.
5924 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
5925 struct isl_basic_set *bset2, int pos)
5928 enum isl_lp_result res;
5933 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5935 if (res == isl_lp_empty)
5937 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5938 res == isl_lp_unbounded)
5940 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5949 /* Given two basic sets bset1 and bset2, check whether
5950 * for any common value of the parameters and dimensions preceding pos
5951 * there is a value of dimension pos in bset1 that is larger
5952 * than a value of the same dimension in bset2.
5955 * 1 if there exists such a pair
5956 * 0 if there is no such pair, but there is a pair of equal values
5958 * -2 if some error occurred.
5960 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
5961 __isl_keep isl_basic_set *bset2, int pos)
5964 enum isl_lp_result res;
5969 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
5971 if (res == isl_lp_empty)
5973 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
5974 res == isl_lp_unbounded)
5976 else if (res == isl_lp_ok && isl_int_is_neg(opt))
5978 else if (res == isl_lp_ok)
5987 /* Given two sets set1 and set2, check whether
5988 * for any common value of the parameters and dimensions preceding pos
5989 * there is a value of dimension pos in set1 that is larger
5990 * than a value of the same dimension in set2.
5993 * 1 if there exists such a pair
5994 * 0 if there is no such pair, but there is a pair of equal values
5996 * -2 if some error occurred.
5998 int isl_set_follows_at(__isl_keep isl_set *set1,
5999 __isl_keep isl_set *set2, int pos)
6007 for (i = 0; i < set1->n; ++i)
6008 for (j = 0; j < set2->n; ++j) {
6010 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6011 if (f == 1 || f == -2)
6020 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6021 unsigned pos, isl_int *val)
6029 total = isl_basic_map_total_dim(bmap);
6030 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6031 for (; d+1 > pos; --d)
6032 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6036 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6038 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6040 if (!isl_int_is_one(bmap->eq[i][1+d]))
6043 isl_int_neg(*val, bmap->eq[i][0]);
6049 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6050 unsigned pos, isl_int *val)
6062 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6065 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6066 for (i = 1; fixed == 1 && i < map->n; ++i) {
6067 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6068 if (fixed == 1 && isl_int_ne(tmp, v))
6072 isl_int_set(*val, v);
6078 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6079 unsigned pos, isl_int *val)
6081 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6085 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6088 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6091 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6092 enum isl_dim_type type, unsigned pos, isl_int *val)
6094 if (pos >= isl_basic_map_dim(bmap, type))
6096 return isl_basic_map_fast_has_fixed_var(bmap,
6097 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6100 int isl_map_fast_is_fixed(struct isl_map *map,
6101 enum isl_dim_type type, unsigned pos, isl_int *val)
6103 if (pos >= isl_map_dim(map, type))
6105 return isl_map_fast_has_fixed_var(map,
6106 map_offset(map, type) - 1 + pos, val);
6109 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6110 * then return this fixed value in *val.
6112 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6115 return isl_basic_set_fast_has_fixed_var(bset,
6116 isl_basic_set_n_param(bset) + dim, val);
6119 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6120 * then return this fixed value in *val.
6122 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6124 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6127 /* Check if input variable in has fixed value and if so and if val is not NULL,
6128 * then return this fixed value in *val.
6130 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6132 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6135 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6136 * and if val is not NULL, then return this lower bound in *val.
6138 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6139 unsigned dim, isl_int *val)
6141 int i, i_eq = -1, i_ineq = -1;
6148 total = isl_basic_set_total_dim(bset);
6149 nparam = isl_basic_set_n_param(bset);
6150 for (i = 0; i < bset->n_eq; ++i) {
6151 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6157 for (i = 0; i < bset->n_ineq; ++i) {
6158 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6160 if (i_eq != -1 || i_ineq != -1)
6164 if (i_eq == -1 && i_ineq == -1)
6166 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6167 /* The coefficient should always be one due to normalization. */
6168 if (!isl_int_is_one(c[1+nparam+dim]))
6170 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6172 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6173 total - nparam - dim - 1) != -1)
6176 isl_int_neg(*val, c[0]);
6180 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6181 unsigned dim, isl_int *val)
6193 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6197 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6199 for (i = 1; fixed == 1 && i < set->n; ++i) {
6200 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6202 if (fixed == 1 && isl_int_ne(tmp, v))
6206 isl_int_set(*val, v);
6217 static int qsort_constraint_cmp(const void *p1, const void *p2)
6219 const struct constraint *c1 = (const struct constraint *)p1;
6220 const struct constraint *c2 = (const struct constraint *)p2;
6221 unsigned size = isl_min(c1->size, c2->size);
6222 return isl_seq_cmp(c1->c, c2->c, size);
6225 static struct isl_basic_map *isl_basic_map_sort_constraints(
6226 struct isl_basic_map *bmap)
6229 struct constraint *c;
6234 total = isl_basic_map_total_dim(bmap);
6235 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6238 for (i = 0; i < bmap->n_ineq; ++i) {
6240 c[i].c = bmap->ineq[i];
6242 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6243 for (i = 0; i < bmap->n_ineq; ++i)
6244 bmap->ineq[i] = c[i].c;
6248 isl_basic_map_free(bmap);
6252 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6253 __isl_take isl_basic_set *bset)
6255 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6256 (struct isl_basic_map *)bset);
6259 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6263 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6265 bmap = isl_basic_map_remove_redundancies(bmap);
6266 bmap = isl_basic_map_sort_constraints(bmap);
6267 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6271 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6273 return (struct isl_basic_set *)isl_basic_map_normalize(
6274 (struct isl_basic_map *)bset);
6277 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6278 const __isl_keep isl_basic_map *bmap2)
6285 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6286 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6287 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6288 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6289 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6290 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6291 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6292 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6294 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6296 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6298 if (bmap1->n_eq != bmap2->n_eq)
6299 return bmap1->n_eq - bmap2->n_eq;
6300 if (bmap1->n_ineq != bmap2->n_ineq)
6301 return bmap1->n_ineq - bmap2->n_ineq;
6302 if (bmap1->n_div != bmap2->n_div)
6303 return bmap1->n_div - bmap2->n_div;
6304 total = isl_basic_map_total_dim(bmap1);
6305 for (i = 0; i < bmap1->n_eq; ++i) {
6306 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6310 for (i = 0; i < bmap1->n_ineq; ++i) {
6311 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6315 for (i = 0; i < bmap1->n_div; ++i) {
6316 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6323 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6324 __isl_keep isl_basic_map *bmap2)
6326 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6329 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6330 __isl_keep isl_basic_set *bset2)
6332 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6333 (isl_basic_map *)bset2);
6336 static int qsort_bmap_cmp(const void *p1, const void *p2)
6338 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6339 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6341 return isl_basic_map_fast_cmp(bmap1, bmap2);
6344 /* We normalize in place, but if anything goes wrong we need
6345 * to return NULL, so we need to make sure we don't change the
6346 * meaning of any possible other copies of map.
6348 struct isl_map *isl_map_normalize(struct isl_map *map)
6351 struct isl_basic_map *bmap;
6355 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6357 for (i = 0; i < map->n; ++i) {
6358 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6361 isl_basic_map_free(map->p[i]);
6364 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6365 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6366 map = isl_map_remove_empty_parts(map);
6369 for (i = map->n - 1; i >= 1; --i) {
6370 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6372 isl_basic_map_free(map->p[i-1]);
6373 for (j = i; j < map->n; ++j)
6374 map->p[j-1] = map->p[j];
6384 struct isl_set *isl_set_normalize(struct isl_set *set)
6386 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6389 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6399 if (!isl_dim_equal(map1->dim, map2->dim))
6402 map1 = isl_map_copy(map1);
6403 map2 = isl_map_copy(map2);
6404 map1 = isl_map_normalize(map1);
6405 map2 = isl_map_normalize(map2);
6408 equal = map1->n == map2->n;
6409 for (i = 0; equal && i < map1->n; ++i) {
6410 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6423 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6425 return isl_map_fast_is_equal((struct isl_map *)set1,
6426 (struct isl_map *)set2);
6429 /* Return an interval that ranges from min to max (inclusive)
6431 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6432 isl_int min, isl_int max)
6435 struct isl_basic_set *bset = NULL;
6437 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6441 k = isl_basic_set_alloc_inequality(bset);
6444 isl_int_set_si(bset->ineq[k][1], 1);
6445 isl_int_neg(bset->ineq[k][0], min);
6447 k = isl_basic_set_alloc_inequality(bset);
6450 isl_int_set_si(bset->ineq[k][1], -1);
6451 isl_int_set(bset->ineq[k][0], max);
6455 isl_basic_set_free(bset);
6459 /* Return the Cartesian product of the basic sets in list (in the given order).
6461 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6469 struct isl_basic_set *product = NULL;
6473 isl_assert(list->ctx, list->n > 0, goto error);
6474 isl_assert(list->ctx, list->p[0], goto error);
6475 nparam = isl_basic_set_n_param(list->p[0]);
6476 dim = isl_basic_set_n_dim(list->p[0]);
6477 extra = list->p[0]->n_div;
6478 n_eq = list->p[0]->n_eq;
6479 n_ineq = list->p[0]->n_ineq;
6480 for (i = 1; i < list->n; ++i) {
6481 isl_assert(list->ctx, list->p[i], goto error);
6482 isl_assert(list->ctx,
6483 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6484 dim += isl_basic_set_n_dim(list->p[i]);
6485 extra += list->p[i]->n_div;
6486 n_eq += list->p[i]->n_eq;
6487 n_ineq += list->p[i]->n_ineq;
6489 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6494 for (i = 0; i < list->n; ++i) {
6495 isl_basic_set_add_constraints(product,
6496 isl_basic_set_copy(list->p[i]), dim);
6497 dim += isl_basic_set_n_dim(list->p[i]);
6499 isl_basic_set_list_free(list);
6502 isl_basic_set_free(product);
6503 isl_basic_set_list_free(list);
6507 struct isl_basic_map *isl_basic_map_product(
6508 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6510 struct isl_dim *dim_result = NULL;
6511 struct isl_basic_map *bmap;
6512 unsigned in1, in2, out1, out2, nparam, total, pos;
6513 struct isl_dim_map *dim_map1, *dim_map2;
6515 if (!bmap1 || !bmap2)
6518 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6519 bmap2->dim, isl_dim_param), goto error);
6520 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6521 isl_dim_copy(bmap2->dim));
6523 in1 = isl_basic_map_n_in(bmap1);
6524 in2 = isl_basic_map_n_in(bmap2);
6525 out1 = isl_basic_map_n_out(bmap1);
6526 out2 = isl_basic_map_n_out(bmap2);
6527 nparam = isl_basic_map_n_param(bmap1);
6529 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6530 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6531 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6532 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6533 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6534 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6535 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6536 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6537 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6538 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6539 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6541 bmap = isl_basic_map_alloc_dim(dim_result,
6542 bmap1->n_div + bmap2->n_div,
6543 bmap1->n_eq + bmap2->n_eq,
6544 bmap1->n_ineq + bmap2->n_ineq);
6545 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6546 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6547 bmap = isl_basic_map_simplify(bmap);
6548 return isl_basic_map_finalize(bmap);
6550 isl_basic_map_free(bmap1);
6551 isl_basic_map_free(bmap2);
6555 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6557 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6560 struct isl_map *result;
6566 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6567 map2->dim, isl_dim_param), goto error);
6569 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6570 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6571 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6573 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6574 isl_dim_copy(map2->dim)),
6575 map1->n * map2->n, flags);
6578 for (i = 0; i < map1->n; ++i)
6579 for (j = 0; j < map2->n; ++j) {
6580 struct isl_basic_map *part;
6581 part = isl_basic_map_product(
6582 isl_basic_map_copy(map1->p[i]),
6583 isl_basic_map_copy(map2->p[j]));
6584 if (isl_basic_map_is_empty(part))
6585 isl_basic_map_free(part);
6587 result = isl_map_add_basic_map(result, part);
6600 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6602 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
6603 __isl_take isl_map *map2)
6607 prod = isl_map_product(map1, map2);
6608 prod = isl_map_flatten(prod);
6612 /* Given two set A and B, construct its Cartesian product A x B.
6614 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6616 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6617 (struct isl_map *)set2);
6620 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
6621 __isl_take isl_set *set2)
6623 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
6626 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6629 uint32_t hash = isl_hash_init();
6634 bset = isl_basic_set_copy(bset);
6635 bset = isl_basic_set_normalize(bset);
6638 total = isl_basic_set_total_dim(bset);
6639 isl_hash_byte(hash, bset->n_eq & 0xFF);
6640 for (i = 0; i < bset->n_eq; ++i) {
6642 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6643 isl_hash_hash(hash, c_hash);
6645 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6646 for (i = 0; i < bset->n_ineq; ++i) {
6648 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6649 isl_hash_hash(hash, c_hash);
6651 isl_hash_byte(hash, bset->n_div & 0xFF);
6652 for (i = 0; i < bset->n_div; ++i) {
6654 if (isl_int_is_zero(bset->div[i][0]))
6656 isl_hash_byte(hash, i & 0xFF);
6657 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6658 isl_hash_hash(hash, c_hash);
6660 isl_basic_set_free(bset);
6664 uint32_t isl_set_get_hash(struct isl_set *set)
6671 set = isl_set_copy(set);
6672 set = isl_set_normalize(set);
6676 hash = isl_hash_init();
6677 for (i = 0; i < set->n; ++i) {
6679 bset_hash = isl_basic_set_get_hash(set->p[i]);
6680 isl_hash_hash(hash, bset_hash);
6688 /* Check if the value for dimension dim is completely determined
6689 * by the values of the other parameters and variables.
6690 * That is, check if dimension dim is involved in an equality.
6692 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6699 nparam = isl_basic_set_n_param(bset);
6700 for (i = 0; i < bset->n_eq; ++i)
6701 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6706 /* Check if the value for dimension dim is completely determined
6707 * by the values of the other parameters and variables.
6708 * That is, check if dimension dim is involved in an equality
6709 * for each of the subsets.
6711 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6717 for (i = 0; i < set->n; ++i) {
6719 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6726 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6727 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6734 for (i = 0; i < map->n; ++i)
6735 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6741 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6742 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6749 for (i = 0; i < set->n; ++i)
6750 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6756 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6758 struct isl_dim *dim;
6763 if (bset->n_div == 0)
6766 bset = isl_basic_set_cow(bset);
6770 dim = isl_basic_set_get_dim(bset);
6771 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6774 isl_dim_free(bset->dim);
6778 bset = isl_basic_set_finalize(bset);
6782 isl_basic_set_free(bset);
6786 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6789 struct isl_dim *dim;
6792 set = isl_set_align_divs(set);
6796 if (set->n == 0 || set->p[0]->n_div == 0)
6799 set = isl_set_cow(set);
6803 n_div = set->p[0]->n_div;
6804 dim = isl_set_get_dim(set);
6805 dim = isl_dim_add(dim, isl_dim_set, n_div);
6808 isl_dim_free(set->dim);
6811 for (i = 0; i < set->n; ++i) {
6812 set->p[i] = isl_basic_set_lift(set->p[i]);
6823 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
6825 struct isl_dim *dim;
6826 struct isl_basic_map *bmap;
6833 set = isl_set_align_divs(set);
6838 dim = isl_set_get_dim(set);
6839 if (set->n == 0 || set->p[0]->n_div == 0) {
6841 return isl_map_identity(dim);
6844 n_div = set->p[0]->n_div;
6845 dim = isl_dim_map(dim);
6846 n_param = isl_dim_size(dim, isl_dim_param);
6847 n_set = isl_dim_size(dim, isl_dim_in);
6848 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
6849 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
6850 for (i = 0; i < n_set; ++i)
6851 bmap = var_equal(bmap, i);
6853 total = n_param + n_set + n_set + n_div;
6854 for (i = 0; i < n_div; ++i) {
6855 k = isl_basic_map_alloc_inequality(bmap);
6858 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
6859 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
6860 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
6861 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
6862 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
6863 set->p[0]->div[i][0]);
6865 l = isl_basic_map_alloc_inequality(bmap);
6868 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
6869 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
6870 set->p[0]->div[i][0]);
6871 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
6875 return isl_map_from_basic_map(bmap);
6878 isl_basic_map_free(bmap);
6882 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
6890 dim = isl_basic_set_total_dim(bset);
6891 size += bset->n_eq * (1 + dim);
6892 size += bset->n_ineq * (1 + dim);
6893 size += bset->n_div * (2 + dim);
6898 int isl_set_size(__isl_keep isl_set *set)
6906 for (i = 0; i < set->n; ++i)
6907 size += isl_basic_set_size(set->p[i]);
6912 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
6913 enum isl_dim_type type, unsigned pos)
6921 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
6923 pos += isl_basic_map_offset(bmap, type);
6925 for (i = 0; i < bmap->n_eq; ++i)
6926 if (!isl_int_is_zero(bmap->eq[i][pos]))
6930 for (i = 0; i < bmap->n_ineq; ++i) {
6931 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
6938 return lower && upper;
6941 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
6942 enum isl_dim_type type, unsigned pos)
6949 for (i = 0; i < map->n; ++i) {
6951 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
6952 if (bounded < 0 || !bounded)
6959 /* Return 1 if the specified dim is involved in both an upper bound
6960 * and a lower bound.
6962 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
6963 enum isl_dim_type type, unsigned pos)
6965 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
6968 /* For each of the "n" variables starting at "first", determine
6969 * the sign of the variable and put the results in the first "n"
6970 * elements of the array "signs".
6972 * 1 means that the variable is non-negative
6973 * -1 means that the variable is non-positive
6974 * 0 means the variable attains both positive and negative values.
6976 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
6977 unsigned first, unsigned n, int *signs)
6979 isl_vec *bound = NULL;
6980 struct isl_tab *tab = NULL;
6981 struct isl_tab_undo *snap;
6984 if (!bset || !signs)
6987 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
6988 tab = isl_tab_from_basic_set(bset);
6992 isl_seq_clr(bound->el, bound->size);
6993 isl_int_set_si(bound->el[0], -1);
6995 snap = isl_tab_snap(tab);
6996 for (i = 0; i < n; ++i) {
6999 isl_int_set_si(bound->el[1 + first + i], -1);
7000 if (isl_tab_add_ineq(tab, bound->el) < 0)
7003 isl_int_set_si(bound->el[1 + first + i], 0);
7004 if (isl_tab_rollback(tab, snap) < 0)
7012 isl_int_set_si(bound->el[1 + first + i], 1);
7013 if (isl_tab_add_ineq(tab, bound->el) < 0)
7016 isl_int_set_si(bound->el[1 + first + i], 0);
7017 if (isl_tab_rollback(tab, snap) < 0)
7020 signs[i] = empty ? -1 : 0;
7024 isl_vec_free(bound);
7028 isl_vec_free(bound);
7032 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7033 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7035 if (!bset || !signs)
7037 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7040 first += pos(bset->dim, type) - 1;
7041 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7044 /* Check if the given map is single-valued.
7049 * and check if the result is a subset of the identity mapping.
7051 int isl_map_is_single_valued(__isl_keep isl_map *map)
7057 test = isl_map_reverse(isl_map_copy(map));
7058 test = isl_map_apply_range(test, isl_map_copy(map));
7060 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7062 sv = isl_map_is_subset(test, id);
7070 int isl_map_is_bijective(__isl_keep isl_map *map)
7074 sv = isl_map_is_single_valued(map);
7078 map = isl_map_copy(map);
7079 map = isl_map_reverse(map);
7080 sv = isl_map_is_single_valued(map);
7086 int isl_set_is_singleton(__isl_keep isl_set *set)
7088 return isl_map_is_single_valued((isl_map *)set);
7091 int isl_map_is_translation(__isl_keep isl_map *map)
7096 delta = isl_map_deltas(isl_map_copy(map));
7097 ok = isl_set_is_singleton(delta);
7098 isl_set_free(delta);
7103 static int unique(isl_int *p, unsigned pos, unsigned len)
7105 if (isl_seq_first_non_zero(p, pos) != -1)
7107 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7112 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7121 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7124 nvar = isl_basic_set_dim(bset, isl_dim_set);
7125 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7126 for (j = 0; j < nvar; ++j) {
7127 int lower = 0, upper = 0;
7128 for (i = 0; i < bset->n_eq; ++i) {
7129 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7131 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7137 for (i = 0; i < bset->n_ineq; ++i) {
7138 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7140 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7142 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7147 if (!lower || !upper)
7154 int isl_set_is_box(__isl_keep isl_set *set)
7161 return isl_basic_set_is_box(set->p[0]);
7164 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7169 return isl_dim_is_wrapping(bset->dim);
7172 int isl_set_is_wrapping(__isl_keep isl_set *set)
7177 return isl_dim_is_wrapping(set->dim);
7180 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7182 bmap = isl_basic_map_cow(bmap);
7186 bmap->dim = isl_dim_wrap(bmap->dim);
7190 bmap = isl_basic_map_finalize(bmap);
7192 return (isl_basic_set *)bmap;
7194 isl_basic_map_free(bmap);
7198 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7202 map = isl_map_cow(map);
7206 for (i = 0; i < map->n; ++i) {
7207 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7211 map->dim = isl_dim_wrap(map->dim);
7215 return (isl_set *)map;
7221 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7223 bset = isl_basic_set_cow(bset);
7227 bset->dim = isl_dim_unwrap(bset->dim);
7231 bset = isl_basic_set_finalize(bset);
7233 return (isl_basic_map *)bset;
7235 isl_basic_set_free(bset);
7239 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7246 if (!isl_set_is_wrapping(set))
7247 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7250 set = isl_set_cow(set);
7254 for (i = 0; i < set->n; ++i) {
7255 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7260 set->dim = isl_dim_unwrap(set->dim);
7264 return (isl_map *)set;
7270 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7271 enum isl_dim_type type)
7276 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7279 bmap = isl_basic_map_cow(bmap);
7283 bmap->dim = isl_dim_reset(bmap->dim, type);
7287 bmap = isl_basic_map_finalize(bmap);
7291 isl_basic_map_free(bmap);
7295 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7296 enum isl_dim_type type)
7303 if (!isl_dim_is_named_or_nested(map->dim, type))
7306 map = isl_map_cow(map);
7310 for (i = 0; i < map->n; ++i) {
7311 map->p[i] = isl_basic_map_reset(map->p[i], type);
7315 map->dim = isl_dim_reset(map->dim, type);
7325 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7330 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7333 bmap = isl_basic_map_cow(bmap);
7337 bmap->dim = isl_dim_flatten(bmap->dim);
7341 bmap = isl_basic_map_finalize(bmap);
7345 isl_basic_map_free(bmap);
7349 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7356 if (!map->dim->nested[0] && !map->dim->nested[1])
7359 map = isl_map_cow(map);
7363 for (i = 0; i < map->n; ++i) {
7364 map->p[i] = isl_basic_map_flatten(map->p[i]);
7368 map->dim = isl_dim_flatten(map->dim);
7378 /* Extend the given dim_map with mappings for the divs in bmap.
7380 static __isl_give struct isl_dim_map *extend_dim_map(
7381 __isl_keep struct isl_dim_map *dim_map,
7382 __isl_keep isl_basic_map *bmap)
7385 struct isl_dim_map *res;
7388 offset = isl_basic_map_offset(bmap, isl_dim_div);
7390 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
7394 for (i = 0; i < dim_map->len; ++i)
7395 res->pos[i] = dim_map->pos[i];
7396 for (i = 0; i < bmap->n_div; ++i)
7397 res->pos[dim_map->len + i] = offset + i;
7402 /* Extract a dim_map from a reordering.
7403 * We essentially need to reverse the mapping, and add an offset
7404 * of 1 for the constant term.
7406 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
7407 __isl_keep isl_reordering *exp)
7410 struct isl_dim_map *dim_map;
7415 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
7419 for (i = 0; i < exp->len; ++i)
7420 dim_map->pos[1 + exp->pos[i]] = 1 + i;
7425 /* Reorder the dimensions of "bmap" according to the given dim_map
7426 * and set the dimension specification to "dim".
7428 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
7429 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
7433 bmap = isl_basic_map_cow(bmap);
7434 if (!bmap || !dim || !dim_map)
7437 res = isl_basic_map_alloc_dim(dim,
7438 bmap->n_div, bmap->n_eq, bmap->n_ineq);
7439 res = add_constraints_dim_map(res, bmap, dim_map);
7440 res = isl_basic_map_finalize(res);
7444 isl_basic_map_free(bmap);
7449 /* Reorder the dimensions of "map" according to given reordering.
7451 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
7452 __isl_take isl_reordering *r)
7455 struct isl_dim_map *dim_map;
7457 map = isl_map_cow(map);
7458 dim_map = isl_dim_map_from_reordering(r);
7459 if (!map || !r || !dim_map)
7462 for (i = 0; i < map->n; ++i) {
7463 struct isl_dim_map *dim_map_i;
7465 dim_map_i = extend_dim_map(dim_map, map->p[i]);
7467 map->p[i] = isl_basic_map_realign(map->p[i],
7468 isl_dim_copy(r->dim), dim_map_i);
7474 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
7476 isl_reordering_free(r);
7482 isl_reordering_free(r);
7486 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
7487 __isl_take isl_reordering *r)
7489 return (isl_set *)isl_map_realign((isl_map *)set, r);