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)
124 case isl_dim_cst: return 1;
127 case isl_dim_out: return isl_dim_size(bmap->dim, type);
128 case isl_dim_div: return bmap->n_div;
129 case isl_dim_all: return isl_basic_map_total_dim(bmap);
134 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
136 return map ? n(map->dim, type) : 0;
139 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
141 return set ? n(set->dim, type) : 0;
144 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
145 enum isl_dim_type type)
147 struct isl_dim *dim = bmap->dim;
149 case isl_dim_cst: return 0;
150 case isl_dim_param: return 1;
151 case isl_dim_in: return 1 + dim->nparam;
152 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
153 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
158 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
160 return pos(map->dim, type);
163 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
164 enum isl_dim_type type)
166 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
169 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
171 return isl_basic_set_dim(bset, isl_dim_set);
174 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
176 return isl_basic_set_dim(bset, isl_dim_param);
179 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
181 return isl_dim_total(bset->dim) + bset->n_div;
184 unsigned isl_set_n_dim(const struct isl_set *set)
186 return isl_set_dim(set, isl_dim_set);
189 unsigned isl_set_n_param(const struct isl_set *set)
191 return isl_set_dim(set, isl_dim_param);
194 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
196 return bmap ? bmap->dim->n_in : 0;
199 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
201 return bmap ? bmap->dim->n_out : 0;
204 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
206 return bmap ? bmap->dim->nparam : 0;
209 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
211 return bmap ? bmap->n_div : 0;
214 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
216 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
219 unsigned isl_map_n_in(const struct isl_map *map)
221 return map->dim->n_in;
224 unsigned isl_map_n_out(const struct isl_map *map)
226 return map->dim->n_out;
229 unsigned isl_map_n_param(const struct isl_map *map)
231 return map->dim->nparam;
234 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
239 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
242 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
245 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
246 struct isl_basic_set *bset)
251 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
254 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
257 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
258 struct isl_basic_set *bset)
263 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
266 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
269 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
271 return bmap ? bmap->ctx : NULL;
274 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
276 return bset ? bset->ctx : NULL;
279 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
281 return map ? map->ctx : NULL;
284 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
286 return set ? set->ctx : NULL;
289 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
293 return isl_dim_copy(bmap->dim);
296 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
300 return isl_dim_copy(bset->dim);
303 struct isl_dim *isl_map_get_dim(struct isl_map *map)
307 return isl_dim_copy(map->dim);
310 struct isl_dim *isl_set_get_dim(struct isl_set *set)
314 return isl_dim_copy(set->dim);
317 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
318 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
320 bmap = isl_basic_map_cow(bmap);
323 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
328 isl_basic_map_free(bmap);
332 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
333 enum isl_dim_type type)
335 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
338 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
339 enum isl_dim_type type, const char *s)
343 map = isl_map_cow(map);
347 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
351 for (i = 0; i < map->n; ++i) {
352 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
363 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
364 enum isl_dim_type type)
366 return map ? isl_dim_get_tuple_name(map->dim, type) : NULL;
369 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
372 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
375 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
377 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
380 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
381 enum isl_dim_type type, unsigned pos)
383 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
386 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
387 enum isl_dim_type type, unsigned pos)
389 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
392 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
393 __isl_take isl_basic_map *bmap,
394 enum isl_dim_type type, unsigned pos, const char *s)
398 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
403 isl_basic_map_free(bmap);
407 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
408 enum isl_dim_type type, unsigned pos, const char *s)
415 map->dim = isl_dim_set_name(map->dim, type, pos, s);
419 for (i = 0; i < map->n; ++i) {
420 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
431 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
432 __isl_take isl_basic_set *bset,
433 enum isl_dim_type type, unsigned pos, const char *s)
435 return (isl_basic_set *)isl_basic_map_set_dim_name(
436 (isl_basic_map *)bset, type, pos, s);
439 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
440 enum isl_dim_type type, unsigned pos, const char *s)
442 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
445 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
449 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
452 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
453 struct isl_basic_map *bmap, unsigned extra,
454 unsigned n_eq, unsigned n_ineq)
457 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
462 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
463 if (isl_blk_is_error(bmap->block))
466 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
471 bmap->block2 = isl_blk_empty();
474 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
475 if (isl_blk_is_error(bmap->block2))
478 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
483 for (i = 0; i < n_ineq + n_eq; ++i)
484 bmap->ineq[i] = bmap->block.data + i * row_size;
486 for (i = 0; i < extra; ++i)
487 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
491 bmap->c_size = n_eq + n_ineq;
492 bmap->eq = bmap->ineq + n_ineq;
501 isl_basic_map_free(bmap);
505 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
506 unsigned nparam, unsigned dim, unsigned extra,
507 unsigned n_eq, unsigned n_ineq)
509 struct isl_basic_map *bmap;
510 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
511 return (struct isl_basic_set *)bmap;
514 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
515 unsigned extra, unsigned n_eq, unsigned n_ineq)
517 struct isl_basic_map *bmap;
520 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
521 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
522 return (struct isl_basic_set *)bmap;
525 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
526 unsigned extra, unsigned n_eq, unsigned n_ineq)
528 struct isl_basic_map *bmap;
532 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
537 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
543 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
544 unsigned nparam, unsigned in, unsigned out, unsigned extra,
545 unsigned n_eq, unsigned n_ineq)
547 struct isl_basic_map *bmap;
550 dim = isl_dim_alloc(ctx, nparam, in, out);
554 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
558 static void dup_constraints(
559 struct isl_basic_map *dst, struct isl_basic_map *src)
562 unsigned total = isl_basic_map_total_dim(src);
564 for (i = 0; i < src->n_eq; ++i) {
565 int j = isl_basic_map_alloc_equality(dst);
566 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
569 for (i = 0; i < src->n_ineq; ++i) {
570 int j = isl_basic_map_alloc_inequality(dst);
571 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
574 for (i = 0; i < src->n_div; ++i) {
575 int j = isl_basic_map_alloc_div(dst);
576 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
578 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
581 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
583 struct isl_basic_map *dup;
587 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
588 bmap->n_div, bmap->n_eq, bmap->n_ineq);
591 dup_constraints(dup, bmap);
592 dup->flags = bmap->flags;
593 dup->sample = isl_vec_copy(bmap->sample);
597 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
599 struct isl_basic_map *dup;
601 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
602 return (struct isl_basic_set *)dup;
605 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
610 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
614 return isl_basic_set_dup(bset);
617 struct isl_set *isl_set_copy(struct isl_set *set)
626 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
631 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
635 bmap = isl_basic_map_dup(bmap);
637 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
641 struct isl_map *isl_map_copy(struct isl_map *map)
650 void isl_basic_map_free(struct isl_basic_map *bmap)
658 isl_ctx_deref(bmap->ctx);
660 isl_blk_free(bmap->ctx, bmap->block2);
662 isl_blk_free(bmap->ctx, bmap->block);
663 isl_vec_free(bmap->sample);
664 isl_dim_free(bmap->dim);
668 void isl_basic_set_free(struct isl_basic_set *bset)
670 isl_basic_map_free((struct isl_basic_map *)bset);
673 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
675 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
678 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
684 isl_assert(ctx, room_for_con(bmap, 1), return -1);
685 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
687 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
688 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
689 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
690 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
691 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
692 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
694 int j = isl_basic_map_alloc_inequality(bmap);
698 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
699 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
706 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
707 bmap->extra - bmap->n_div);
711 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
713 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
716 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
720 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
725 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
727 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
730 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
735 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
737 if (pos != bmap->n_eq - 1) {
739 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
740 bmap->eq[bmap->n_eq - 1] = t;
746 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
748 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
751 void isl_basic_map_inequality_to_equality(
752 struct isl_basic_map *bmap, unsigned pos)
757 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
758 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
763 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
764 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
765 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
766 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
769 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
771 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
774 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
780 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
781 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
782 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
783 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
784 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
785 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
786 1 + isl_basic_map_total_dim(bmap),
787 bmap->extra - bmap->n_div);
788 return bmap->n_ineq++;
791 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
793 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
796 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
800 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
805 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
807 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
810 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
815 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
817 if (pos != bmap->n_ineq - 1) {
819 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
820 bmap->ineq[bmap->n_ineq - 1] = t;
821 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
827 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
829 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
832 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
837 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
840 k = isl_basic_map_alloc_equality(bmap);
843 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
846 isl_basic_map_free(bmap);
850 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
853 return (isl_basic_set *)
854 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
857 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
862 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
865 k = isl_basic_map_alloc_inequality(bmap);
868 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
871 isl_basic_map_free(bmap);
875 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
878 return (isl_basic_set *)
879 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
882 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
886 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
887 isl_seq_clr(bmap->div[bmap->n_div] +
888 1 + 1 + isl_basic_map_total_dim(bmap),
889 bmap->extra - bmap->n_div);
890 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
891 return bmap->n_div++;
894 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
896 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
899 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
903 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
908 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
910 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
913 /* Copy constraint from src to dst, putting the vars of src at offset
914 * dim_off in dst and the divs of src at offset div_off in dst.
915 * If both sets are actually map, then dim_off applies to the input
918 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
919 struct isl_basic_map *src_map, isl_int *src,
920 unsigned in_off, unsigned out_off, unsigned div_off)
922 unsigned src_nparam = isl_basic_map_n_param(src_map);
923 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
924 unsigned src_in = isl_basic_map_n_in(src_map);
925 unsigned dst_in = isl_basic_map_n_in(dst_map);
926 unsigned src_out = isl_basic_map_n_out(src_map);
927 unsigned dst_out = isl_basic_map_n_out(dst_map);
928 isl_int_set(dst[0], src[0]);
929 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
930 if (dst_nparam > src_nparam)
931 isl_seq_clr(dst+1+src_nparam,
932 dst_nparam - src_nparam);
933 isl_seq_clr(dst+1+dst_nparam, in_off);
934 isl_seq_cpy(dst+1+dst_nparam+in_off,
936 isl_min(dst_in-in_off, src_in));
937 if (dst_in-in_off > src_in)
938 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
939 dst_in - in_off - src_in);
940 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
941 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
942 src+1+src_nparam+src_in,
943 isl_min(dst_out-out_off, src_out));
944 if (dst_out-out_off > src_out)
945 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
946 dst_out - out_off - src_out);
947 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
948 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
949 src+1+src_nparam+src_in+src_out,
950 isl_min(dst_map->extra-div_off, src_map->n_div));
951 if (dst_map->n_div-div_off > src_map->n_div)
952 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
953 div_off+src_map->n_div,
954 dst_map->n_div - div_off - src_map->n_div);
957 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
958 struct isl_basic_map *src_map, isl_int *src,
959 unsigned in_off, unsigned out_off, unsigned div_off)
961 isl_int_set(dst[0], src[0]);
962 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
965 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
966 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
971 if (!bmap1 || !bmap2)
974 div_off = bmap1->n_div;
976 for (i = 0; i < bmap2->n_eq; ++i) {
977 int i1 = isl_basic_map_alloc_equality(bmap1);
980 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
981 i_pos, o_pos, div_off);
984 for (i = 0; i < bmap2->n_ineq; ++i) {
985 int i1 = isl_basic_map_alloc_inequality(bmap1);
988 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
989 i_pos, o_pos, div_off);
992 for (i = 0; i < bmap2->n_div; ++i) {
993 int i1 = isl_basic_map_alloc_div(bmap1);
996 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
997 i_pos, o_pos, div_off);
1000 isl_basic_map_free(bmap2);
1005 isl_basic_map_free(bmap1);
1006 isl_basic_map_free(bmap2);
1010 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
1011 struct isl_dim_map *dim_map)
1015 for (i = 0; i < dim_map->len; ++i) {
1016 if (dim_map->pos[i] < 0)
1017 isl_int_set_si(dst[i], 0);
1019 isl_int_set(dst[i], src[dim_map->pos[i]]);
1023 static void copy_div_dim_map(isl_int *dst, isl_int *src,
1024 struct isl_dim_map *dim_map)
1026 isl_int_set(dst[0], src[0]);
1027 copy_constraint_dim_map(dst+1, src+1, dim_map);
1030 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
1031 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1035 if (!src || !dst || !dim_map)
1038 for (i = 0; i < src->n_eq; ++i) {
1039 int i1 = isl_basic_map_alloc_equality(dst);
1042 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1045 for (i = 0; i < src->n_ineq; ++i) {
1046 int i1 = isl_basic_map_alloc_inequality(dst);
1049 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1052 for (i = 0; i < src->n_div; ++i) {
1053 int i1 = isl_basic_map_alloc_div(dst);
1056 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1060 isl_basic_map_free(src);
1065 isl_basic_map_free(src);
1066 isl_basic_map_free(dst);
1070 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1071 struct isl_basic_set *bset2, unsigned pos)
1073 return (struct isl_basic_set *)
1074 add_constraints((struct isl_basic_map *)bset1,
1075 (struct isl_basic_map *)bset2, 0, pos);
1078 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1079 struct isl_dim *dim, unsigned extra,
1080 unsigned n_eq, unsigned n_ineq)
1082 struct isl_basic_map *ext;
1092 dims_ok = isl_dim_equal(base->dim, dim) &&
1093 base->extra >= base->n_div + extra;
1095 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1096 room_for_ineq(base, n_ineq)) {
1101 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1102 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1103 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1104 extra += base->extra;
1106 n_ineq += base->n_ineq;
1108 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1114 ext->sample = isl_vec_copy(base->sample);
1115 flags = base->flags;
1116 ext = add_constraints(ext, base, 0, 0);
1119 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1126 isl_basic_map_free(base);
1130 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1131 struct isl_dim *dim, unsigned extra,
1132 unsigned n_eq, unsigned n_ineq)
1134 return (struct isl_basic_set *)
1135 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1136 extra, n_eq, n_ineq);
1139 struct isl_basic_map *isl_basic_map_extend_constraints(
1140 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1144 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1148 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1149 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1150 unsigned n_eq, unsigned n_ineq)
1152 struct isl_basic_map *bmap;
1153 struct isl_dim *dim;
1157 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1161 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1164 isl_basic_map_free(base);
1168 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1169 unsigned nparam, unsigned dim, unsigned extra,
1170 unsigned n_eq, unsigned n_ineq)
1172 return (struct isl_basic_set *)
1173 isl_basic_map_extend((struct isl_basic_map *)base,
1174 nparam, 0, dim, extra, n_eq, n_ineq);
1177 struct isl_basic_set *isl_basic_set_extend_constraints(
1178 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1180 return (struct isl_basic_set *)
1181 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1185 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1187 return (struct isl_basic_set *)
1188 isl_basic_map_cow((struct isl_basic_map *)bset);
1191 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1196 if (bmap->ref > 1) {
1198 bmap = isl_basic_map_dup(bmap);
1201 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1205 struct isl_set *isl_set_cow(struct isl_set *set)
1213 return isl_set_dup(set);
1216 struct isl_map *isl_map_cow(struct isl_map *map)
1224 return isl_map_dup(map);
1227 static void swap_vars(struct isl_blk blk, isl_int *a,
1228 unsigned a_len, unsigned b_len)
1230 isl_seq_cpy(blk.data, a+a_len, b_len);
1231 isl_seq_cpy(blk.data+b_len, a, a_len);
1232 isl_seq_cpy(a, blk.data, b_len+a_len);
1235 struct isl_basic_set *isl_basic_set_swap_vars(
1236 struct isl_basic_set *bset, unsigned n)
1246 nparam = isl_basic_set_n_param(bset);
1247 dim = isl_basic_set_n_dim(bset);
1248 isl_assert(bset->ctx, n <= dim, goto error);
1253 bset = isl_basic_set_cow(bset);
1257 blk = isl_blk_alloc(bset->ctx, dim);
1258 if (isl_blk_is_error(blk))
1261 for (i = 0; i < bset->n_eq; ++i)
1263 bset->eq[i]+1+nparam, n, dim - n);
1265 for (i = 0; i < bset->n_ineq; ++i)
1267 bset->ineq[i]+1+nparam, n, dim - n);
1269 for (i = 0; i < bset->n_div; ++i)
1271 bset->div[i]+1+1+nparam, n, dim - n);
1273 isl_blk_free(bset->ctx, blk);
1275 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1276 bset = isl_basic_set_gauss(bset, NULL);
1277 return isl_basic_set_finalize(bset);
1279 isl_basic_set_free(bset);
1283 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1286 set = isl_set_cow(set);
1290 for (i = 0; i < set->n; ++i) {
1291 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1297 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1301 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1307 total = isl_basic_map_total_dim(bmap);
1308 isl_basic_map_free_div(bmap, bmap->n_div);
1309 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1311 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1313 i = isl_basic_map_alloc_equality(bmap);
1317 isl_int_set_si(bmap->eq[i][0], 1);
1318 isl_seq_clr(bmap->eq[i]+1, total);
1319 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1320 isl_vec_free(bmap->sample);
1321 bmap->sample = NULL;
1322 return isl_basic_map_finalize(bmap);
1324 isl_basic_map_free(bmap);
1328 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1330 return (struct isl_basic_set *)
1331 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1334 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1337 unsigned off = isl_dim_total(bmap->dim);
1338 isl_int *t = bmap->div[a];
1339 bmap->div[a] = bmap->div[b];
1342 for (i = 0; i < bmap->n_eq; ++i)
1343 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1345 for (i = 0; i < bmap->n_ineq; ++i)
1346 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1348 for (i = 0; i < bmap->n_div; ++i)
1349 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1350 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1353 /* Eliminate the specified n dimensions starting at first from the
1354 * constraints using Fourier-Motzkin. The dimensions themselves
1357 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1358 enum isl_dim_type type, unsigned first, unsigned n)
1367 map = isl_map_cow(map);
1370 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1371 first += pos(map->dim, type) - 1;
1373 for (i = 0; i < map->n; ++i) {
1374 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1384 /* Eliminate the specified n dimensions starting at first from the
1385 * constraints using Fourier-Motzkin. The dimensions themselves
1388 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1389 enum isl_dim_type type, unsigned first, unsigned n)
1391 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1394 /* Eliminate the specified n dimensions starting at first from the
1395 * constraints using Fourier-Motzkin. The dimensions themselves
1398 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1399 unsigned first, unsigned n)
1401 return isl_set_eliminate(set, isl_dim_set, first, n);
1404 /* Project out n dimensions starting at first using Fourier-Motzkin */
1405 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1406 unsigned first, unsigned n)
1408 set = isl_set_eliminate_dims(set, first, n);
1409 set = isl_set_drop_dims(set, first, n);
1413 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1414 __isl_take isl_basic_map *bmap)
1416 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1424 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1425 __isl_take isl_basic_set *bset)
1427 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1428 (struct isl_basic_map *)bset);
1431 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1440 set = isl_set_cow(set);
1444 for (i = 0; i < set->n; ++i) {
1445 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1455 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1456 enum isl_dim_type type, unsigned first, unsigned n)
1460 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1464 bmap = isl_basic_map_eliminate_vars(bmap,
1465 isl_basic_map_offset(bmap, type) - 1 + first, n);
1468 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1470 bmap = isl_basic_map_drop(bmap, type, first, n);
1473 isl_basic_map_free(bmap);
1477 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1478 enum isl_dim_type type, unsigned first, unsigned n)
1480 return (isl_basic_set *)
1481 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1484 struct isl_map *isl_map_remove(struct isl_map *map,
1485 enum isl_dim_type type, unsigned first, unsigned n)
1492 map = isl_map_cow(map);
1495 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1497 for (i = 0; i < map->n; ++i) {
1498 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1499 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1503 map = isl_map_drop(map, type, first, n);
1510 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1511 enum isl_dim_type type, unsigned first, unsigned n)
1513 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1516 /* Project out n inputs starting at first using Fourier-Motzkin */
1517 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1518 unsigned first, unsigned n)
1520 return isl_map_remove(map, isl_dim_in, first, n);
1523 /* Project out n dimensions starting at first using Fourier-Motzkin */
1524 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1525 unsigned first, unsigned n)
1527 unsigned nparam = isl_basic_set_n_param(bset);
1528 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1529 bset = isl_basic_set_drop_dims(bset, first, n);
1533 static void dump_term(struct isl_basic_map *bmap,
1534 isl_int c, int pos, FILE *out)
1537 unsigned in = isl_basic_map_n_in(bmap);
1538 unsigned dim = in + isl_basic_map_n_out(bmap);
1539 unsigned nparam = isl_basic_map_n_param(bmap);
1541 isl_int_print(out, c, 0);
1543 if (!isl_int_is_one(c))
1544 isl_int_print(out, c, 0);
1545 if (pos < 1 + nparam) {
1546 name = isl_dim_get_name(bmap->dim,
1547 isl_dim_param, pos - 1);
1549 fprintf(out, "%s", name);
1551 fprintf(out, "p%d", pos - 1);
1552 } else if (pos < 1 + nparam + in)
1553 fprintf(out, "i%d", pos - 1 - nparam);
1554 else if (pos < 1 + nparam + dim)
1555 fprintf(out, "o%d", pos - 1 - nparam - in);
1557 fprintf(out, "e%d", pos - 1 - nparam - dim);
1561 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1562 int sign, FILE *out)
1566 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1570 for (i = 0, first = 1; i < len; ++i) {
1571 if (isl_int_sgn(c[i]) * sign <= 0)
1574 fprintf(out, " + ");
1576 isl_int_abs(v, c[i]);
1577 dump_term(bmap, v, i, out);
1584 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1585 const char *op, FILE *out, int indent)
1589 fprintf(out, "%*s", indent, "");
1591 dump_constraint_sign(bmap, c, 1, out);
1592 fprintf(out, " %s ", op);
1593 dump_constraint_sign(bmap, c, -1, out);
1597 for (i = bmap->n_div; i < bmap->extra; ++i) {
1598 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1600 fprintf(out, "%*s", indent, "");
1601 fprintf(out, "ERROR: unused div coefficient not zero\n");
1606 static void dump_constraints(struct isl_basic_map *bmap,
1607 isl_int **c, unsigned n,
1608 const char *op, FILE *out, int indent)
1612 for (i = 0; i < n; ++i)
1613 dump_constraint(bmap, c[i], op, out, indent);
1616 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1620 unsigned total = isl_basic_map_total_dim(bmap);
1622 for (j = 0; j < 1 + total; ++j) {
1623 if (isl_int_is_zero(exp[j]))
1625 if (!first && isl_int_is_pos(exp[j]))
1627 dump_term(bmap, exp[j], j, out);
1632 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1636 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1637 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1639 for (i = 0; i < bmap->n_div; ++i) {
1640 fprintf(out, "%*s", indent, "");
1641 fprintf(out, "e%d = [(", i);
1642 dump_affine(bmap, bmap->div[i]+1, out);
1644 isl_int_print(out, bmap->div[i][0], 0);
1645 fprintf(out, "]\n");
1649 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1652 fprintf(out, "null basic set\n");
1656 fprintf(out, "%*s", indent, "");
1657 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1658 bset->ref, bset->dim->nparam, bset->dim->n_out,
1659 bset->extra, bset->flags);
1660 dump((struct isl_basic_map *)bset, out, indent);
1663 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1666 fprintf(out, "null basic map\n");
1670 fprintf(out, "%*s", indent, "");
1671 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1672 "flags: %x, n_name: %d\n",
1674 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1675 bmap->extra, bmap->flags, bmap->dim->n_name);
1676 dump(bmap, out, indent);
1679 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1684 total = isl_basic_map_total_dim(bmap);
1685 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1686 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1687 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1688 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1692 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1694 struct isl_set *set;
1698 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1699 isl_assert(dim->ctx, n >= 0, return NULL);
1700 set = isl_alloc(dim->ctx, struct isl_set,
1701 sizeof(struct isl_set) +
1702 (n - 1) * sizeof(struct isl_basic_set *));
1706 set->ctx = dim->ctx;
1707 isl_ctx_ref(set->ctx);
1719 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1720 unsigned nparam, unsigned dim, int n, unsigned flags)
1722 struct isl_set *set;
1723 struct isl_dim *dims;
1725 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1729 set = isl_set_alloc_dim(dims, n, flags);
1733 /* Make sure "map" has room for at least "n" more basic maps.
1735 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1738 struct isl_map *grown = NULL;
1742 isl_assert(map->ctx, n >= 0, goto error);
1743 if (map->n + n <= map->size)
1745 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1748 for (i = 0; i < map->n; ++i) {
1749 grown->p[i] = isl_basic_map_copy(map->p[i]);
1757 isl_map_free(grown);
1762 /* Make sure "set" has room for at least "n" more basic sets.
1764 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1766 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1769 struct isl_set *isl_set_dup(struct isl_set *set)
1772 struct isl_set *dup;
1777 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1780 for (i = 0; i < set->n; ++i)
1781 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1785 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1787 struct isl_set *set;
1792 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1794 isl_basic_set_free(bset);
1797 return isl_set_add_basic_set(set, bset);
1800 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1802 struct isl_map *map;
1807 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1809 isl_basic_map_free(bmap);
1812 return isl_map_add_basic_map(map, bmap);
1815 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1816 __isl_take isl_basic_set *bset)
1818 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1819 (struct isl_basic_map *)bset);
1822 void isl_set_free(struct isl_set *set)
1832 isl_ctx_deref(set->ctx);
1833 for (i = 0; i < set->n; ++i)
1834 isl_basic_set_free(set->p[i]);
1835 isl_dim_free(set->dim);
1839 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1844 fprintf(out, "null set\n");
1848 fprintf(out, "%*s", indent, "");
1849 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1850 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1852 for (i = 0; i < set->n; ++i) {
1853 fprintf(out, "%*s", indent, "");
1854 fprintf(out, "basic set %d:\n", i);
1855 isl_basic_set_dump(set->p[i], out, indent+4);
1859 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1864 fprintf(out, "null map\n");
1868 fprintf(out, "%*s", indent, "");
1869 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1870 "flags: %x, n_name: %d\n",
1871 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1872 map->dim->n_out, map->flags, map->dim->n_name);
1873 for (i = 0; i < map->n; ++i) {
1874 fprintf(out, "%*s", indent, "");
1875 fprintf(out, "basic map %d:\n", i);
1876 isl_basic_map_dump(map->p[i], out, indent+4);
1880 struct isl_basic_map *isl_basic_map_intersect_domain(
1881 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1883 struct isl_basic_map *bmap_domain;
1884 struct isl_dim *dim;
1889 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1890 bset->dim, isl_dim_param), goto error);
1892 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1893 isl_assert(bset->ctx,
1894 isl_basic_map_compatible_domain(bmap, bset), goto error);
1896 bmap = isl_basic_map_cow(bmap);
1899 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1900 bset->n_div, bset->n_eq, bset->n_ineq);
1901 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1902 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1903 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1905 bmap = isl_basic_map_simplify(bmap);
1906 return isl_basic_map_finalize(bmap);
1908 isl_basic_map_free(bmap);
1909 isl_basic_set_free(bset);
1913 struct isl_basic_map *isl_basic_map_intersect_range(
1914 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1916 struct isl_basic_map *bmap_range;
1921 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1922 bset->dim, isl_dim_param), goto error);
1924 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1925 isl_assert(bset->ctx,
1926 isl_basic_map_compatible_range(bmap, bset), goto error);
1928 bmap = isl_basic_map_cow(bmap);
1931 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1932 bset->n_div, bset->n_eq, bset->n_ineq);
1933 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1934 bmap = add_constraints(bmap, bmap_range, 0, 0);
1936 bmap = isl_basic_map_simplify(bmap);
1937 return isl_basic_map_finalize(bmap);
1939 isl_basic_map_free(bmap);
1940 isl_basic_set_free(bset);
1944 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1950 total = 1 + isl_basic_map_total_dim(bmap);
1951 if (total != vec->size)
1956 for (i = 0; i < bmap->n_eq; ++i) {
1957 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1958 if (!isl_int_is_zero(s)) {
1964 for (i = 0; i < bmap->n_ineq; ++i) {
1965 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1966 if (isl_int_is_neg(s)) {
1977 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1979 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1982 struct isl_basic_map *isl_basic_map_intersect(
1983 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1985 struct isl_vec *sample = NULL;
1987 if (!bmap1 || !bmap2)
1990 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1991 bmap2->dim, isl_dim_param), goto error);
1992 if (isl_dim_total(bmap1->dim) ==
1993 isl_dim_size(bmap1->dim, isl_dim_param) &&
1994 isl_dim_total(bmap2->dim) !=
1995 isl_dim_size(bmap2->dim, isl_dim_param))
1996 return isl_basic_map_intersect(bmap2, bmap1);
1998 if (isl_dim_total(bmap2->dim) !=
1999 isl_dim_size(bmap2->dim, isl_dim_param))
2000 isl_assert(bmap1->ctx,
2001 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2003 if (bmap1->sample &&
2004 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2005 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2006 sample = isl_vec_copy(bmap1->sample);
2007 else if (bmap2->sample &&
2008 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2009 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2010 sample = isl_vec_copy(bmap2->sample);
2012 bmap1 = isl_basic_map_cow(bmap1);
2015 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2016 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2017 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2020 isl_vec_free(sample);
2022 isl_vec_free(bmap1->sample);
2023 bmap1->sample = sample;
2026 bmap1 = isl_basic_map_simplify(bmap1);
2027 return isl_basic_map_finalize(bmap1);
2030 isl_vec_free(sample);
2031 isl_basic_map_free(bmap1);
2032 isl_basic_map_free(bmap2);
2036 struct isl_basic_set *isl_basic_set_intersect(
2037 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2039 return (struct isl_basic_set *)
2040 isl_basic_map_intersect(
2041 (struct isl_basic_map *)bset1,
2042 (struct isl_basic_map *)bset2);
2045 /* Special case of isl_map_intersect, where both map1 and map2
2046 * are convex, without any divs and such that either map1 or map2
2047 * contains a single constraint. This constraint is then simply
2048 * added to the other map.
2050 static __isl_give isl_map *map_intersect_add_constraint(
2051 __isl_take isl_map *map1, __isl_take isl_map *map2)
2053 struct isl_basic_map *bmap1;
2054 struct isl_basic_map *bmap2;
2056 isl_assert(map1->ctx, map1->n == 1, goto error);
2057 isl_assert(map2->ctx, map1->n == 1, goto error);
2058 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2059 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2061 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2062 return isl_map_intersect(map2, map1);
2064 isl_assert(map2->ctx,
2065 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2067 map1 = isl_map_cow(map1);
2070 if (isl_map_fast_is_empty(map1)) {
2074 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2075 if (map2->p[0]->n_eq == 1)
2076 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2078 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2079 map2->p[0]->ineq[0]);
2081 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2082 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2086 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2087 isl_basic_map_free(map1->p[0]);
2100 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2103 struct isl_map *result;
2109 if (isl_map_fast_is_empty(map1)) {
2113 if (isl_map_fast_is_empty(map2)) {
2118 if (map1->n == 1 && map2->n == 1 &&
2119 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2120 isl_dim_equal(map1->dim, map2->dim) &&
2121 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2122 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2123 return map_intersect_add_constraint(map1, map2);
2124 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2125 map2->dim, isl_dim_param), goto error);
2126 if (isl_dim_total(map1->dim) ==
2127 isl_dim_size(map1->dim, isl_dim_param) &&
2128 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2129 return isl_map_intersect(map2, map1);
2131 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2132 isl_assert(map1->ctx,
2133 isl_dim_equal(map1->dim, map2->dim), goto error);
2135 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2136 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2137 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2139 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2140 map1->n * map2->n, flags);
2143 for (i = 0; i < map1->n; ++i)
2144 for (j = 0; j < map2->n; ++j) {
2145 struct isl_basic_map *part;
2146 part = isl_basic_map_intersect(
2147 isl_basic_map_copy(map1->p[i]),
2148 isl_basic_map_copy(map2->p[j]));
2149 if (isl_basic_map_is_empty(part))
2150 isl_basic_map_free(part);
2152 result = isl_map_add_basic_map(result, part);
2165 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2167 return (struct isl_set *)
2168 isl_map_intersect((struct isl_map *)set1,
2169 (struct isl_map *)set2);
2172 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2174 struct isl_dim *dim;
2175 struct isl_basic_set *bset;
2180 bmap = isl_basic_map_cow(bmap);
2183 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2184 in = isl_basic_map_n_in(bmap);
2185 bset = isl_basic_set_from_basic_map(bmap);
2186 bset = isl_basic_set_swap_vars(bset, in);
2187 return isl_basic_map_from_basic_set(bset, dim);
2190 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2191 enum isl_dim_type type, unsigned pos, unsigned n)
2193 struct isl_dim *res_dim;
2194 struct isl_basic_map *res;
2195 struct isl_dim_map *dim_map;
2196 unsigned total, off;
2197 enum isl_dim_type t;
2205 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2207 total = isl_basic_map_total_dim(bmap) + n;
2208 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2210 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2212 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2214 unsigned size = isl_basic_map_dim(bmap, t);
2215 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2217 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2218 pos, size - pos, off + pos + n);
2220 off += isl_dim_size(res_dim, t);
2222 isl_dim_map_div(dim_map, bmap, off);
2224 res = isl_basic_map_alloc_dim(res_dim,
2225 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2226 res = add_constraints_dim_map(res, bmap, dim_map);
2227 res = isl_basic_map_simplify(res);
2228 return isl_basic_map_finalize(res);
2231 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2232 enum isl_dim_type type, unsigned n)
2236 return isl_basic_map_insert(bmap, type,
2237 isl_basic_map_dim(bmap, type), n);
2240 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2241 enum isl_dim_type type, unsigned n)
2245 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2246 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2248 isl_basic_set_free(bset);
2252 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2253 enum isl_dim_type type, unsigned pos, unsigned n)
2260 map = isl_map_cow(map);
2264 map->dim = isl_dim_insert(map->dim, type, pos, n);
2268 for (i = 0; i < map->n; ++i) {
2269 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2280 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2281 enum isl_dim_type type, unsigned pos, unsigned n)
2283 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2286 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2287 enum isl_dim_type type, unsigned n)
2291 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2294 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2295 enum isl_dim_type type, unsigned n)
2299 isl_assert(set->ctx, type != isl_dim_in, goto error);
2300 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2306 __isl_give isl_basic_map *isl_basic_map_move_dims(
2307 __isl_take isl_basic_map *bmap,
2308 enum isl_dim_type dst_type, unsigned dst_pos,
2309 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2312 struct isl_dim_map *dim_map;
2313 struct isl_basic_map *res;
2314 enum isl_dim_type t;
2315 unsigned total, off;
2322 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2325 if (dst_type == src_type && dst_pos == src_pos)
2328 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2330 if (pos(bmap->dim, dst_type) + dst_pos ==
2331 pos(bmap->dim, src_type) + src_pos +
2332 ((src_type < dst_type) ? n : 0)) {
2333 bmap = isl_basic_map_cow(bmap);
2337 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2338 src_type, src_pos, n);
2342 bmap = isl_basic_map_finalize(bmap);
2347 total = isl_basic_map_total_dim(bmap);
2348 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2351 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2352 unsigned size = isl_dim_size(bmap->dim, t);
2353 if (t == dst_type) {
2354 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2357 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2360 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2361 dst_pos, size - dst_pos, off);
2362 off += size - dst_pos;
2363 } else if (t == src_type) {
2364 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2367 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2368 src_pos + n, size - src_pos - n, off);
2369 off += size - src_pos - n;
2371 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2375 isl_dim_map_div(dim_map, bmap, off);
2377 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2378 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2379 bmap = add_constraints_dim_map(res, bmap, dim_map);
2381 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2382 src_type, src_pos, n);
2386 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2387 bmap = isl_basic_map_gauss(bmap, NULL);
2388 bmap = isl_basic_map_finalize(bmap);
2392 isl_basic_map_free(bmap);
2396 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2397 enum isl_dim_type dst_type, unsigned dst_pos,
2398 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2400 return (isl_basic_set *)isl_basic_map_move_dims(
2401 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2404 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2405 enum isl_dim_type dst_type, unsigned dst_pos,
2406 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2410 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2411 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2412 src_type, src_pos, n);
2418 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2419 enum isl_dim_type dst_type, unsigned dst_pos,
2420 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2429 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2432 if (dst_type == src_type && dst_pos == src_pos)
2435 isl_assert(map->ctx, dst_type != src_type, goto error);
2437 map = isl_map_cow(map);
2441 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2445 for (i = 0; i < map->n; ++i) {
2446 map->p[i] = isl_basic_map_move_dims(map->p[i],
2448 src_type, src_pos, n);
2459 /* Move the specified dimensions to the last columns right before
2460 * the divs. Don't change the dimension specification of bmap.
2461 * That's the responsibility of the caller.
2463 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2464 enum isl_dim_type type, unsigned first, unsigned n)
2466 struct isl_dim_map *dim_map;
2467 struct isl_basic_map *res;
2468 enum isl_dim_type t;
2469 unsigned total, off;
2473 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2476 total = isl_basic_map_total_dim(bmap);
2477 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2480 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2481 unsigned size = isl_dim_size(bmap->dim, t);
2483 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2486 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2487 first, n, total - bmap->n_div - n);
2488 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2489 first + n, size - (first + n), off);
2490 off += size - (first + n);
2492 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2496 isl_dim_map_div(dim_map, bmap, off + n);
2498 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2499 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2500 res = add_constraints_dim_map(res, bmap, dim_map);
2504 /* Turn the n dimensions of type type, starting at first
2505 * into existentially quantified variables.
2507 __isl_give isl_basic_map *isl_basic_map_project_out(
2508 __isl_take isl_basic_map *bmap,
2509 enum isl_dim_type type, unsigned first, unsigned n)
2522 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2523 return isl_basic_map_remove(bmap, type, first, n);
2525 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2528 bmap = move_last(bmap, type, first, n);
2529 bmap = isl_basic_map_cow(bmap);
2533 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2534 old = bmap->block2.data;
2535 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2536 (bmap->extra + n) * (1 + row_size));
2537 if (!bmap->block2.data)
2539 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2542 for (i = 0; i < n; ++i) {
2543 new_div[i] = bmap->block2.data +
2544 (bmap->extra + i) * (1 + row_size);
2545 isl_seq_clr(new_div[i], 1 + row_size);
2547 for (i = 0; i < bmap->extra; ++i)
2548 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2550 bmap->div = new_div;
2554 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2557 bmap = isl_basic_map_simplify(bmap);
2558 bmap = isl_basic_map_drop_redundant_divs(bmap);
2559 return isl_basic_map_finalize(bmap);
2561 isl_basic_map_free(bmap);
2565 /* Turn the n dimensions of type type, starting at first
2566 * into existentially quantified variables.
2568 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2569 enum isl_dim_type type, unsigned first, unsigned n)
2571 return (isl_basic_set *)isl_basic_map_project_out(
2572 (isl_basic_map *)bset, type, first, n);
2575 /* Turn the n dimensions of type type, starting at first
2576 * into existentially quantified variables.
2578 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2579 enum isl_dim_type type, unsigned first, unsigned n)
2589 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2591 map = isl_map_cow(map);
2595 map->dim = isl_dim_drop(map->dim, type, first, n);
2599 for (i = 0; i < map->n; ++i) {
2600 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2611 /* Turn the n dimensions of type type, starting at first
2612 * into existentially quantified variables.
2614 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2615 enum isl_dim_type type, unsigned first, unsigned n)
2617 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2620 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2624 for (i = 0; i < n; ++i) {
2625 j = isl_basic_map_alloc_div(bmap);
2628 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2632 isl_basic_map_free(bmap);
2636 struct isl_basic_map *isl_basic_map_apply_range(
2637 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2639 struct isl_dim *dim_result = NULL;
2640 struct isl_basic_map *bmap;
2641 unsigned n_in, n_out, n, nparam, total, pos;
2642 struct isl_dim_map *dim_map1, *dim_map2;
2644 if (!bmap1 || !bmap2)
2647 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2648 isl_dim_copy(bmap2->dim));
2650 n_in = isl_basic_map_n_in(bmap1);
2651 n_out = isl_basic_map_n_out(bmap2);
2652 n = isl_basic_map_n_out(bmap1);
2653 nparam = isl_basic_map_n_param(bmap1);
2655 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2656 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2657 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2658 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2659 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2660 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2661 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2662 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2663 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2664 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2665 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2667 bmap = isl_basic_map_alloc_dim(dim_result,
2668 bmap1->n_div + bmap2->n_div + n,
2669 bmap1->n_eq + bmap2->n_eq,
2670 bmap1->n_ineq + bmap2->n_ineq);
2671 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2672 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2673 bmap = add_divs(bmap, n);
2674 bmap = isl_basic_map_simplify(bmap);
2675 bmap = isl_basic_map_drop_redundant_divs(bmap);
2676 return isl_basic_map_finalize(bmap);
2678 isl_basic_map_free(bmap1);
2679 isl_basic_map_free(bmap2);
2683 struct isl_basic_set *isl_basic_set_apply(
2684 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2689 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2692 return (struct isl_basic_set *)
2693 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2695 isl_basic_set_free(bset);
2696 isl_basic_map_free(bmap);
2700 struct isl_basic_map *isl_basic_map_apply_domain(
2701 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2703 if (!bmap1 || !bmap2)
2706 isl_assert(bmap1->ctx,
2707 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2708 isl_assert(bmap1->ctx,
2709 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2712 bmap1 = isl_basic_map_reverse(bmap1);
2713 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2714 return isl_basic_map_reverse(bmap1);
2716 isl_basic_map_free(bmap1);
2717 isl_basic_map_free(bmap2);
2721 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2722 * A \cap B -> f(A) + f(B)
2724 struct isl_basic_map *isl_basic_map_sum(
2725 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2727 unsigned n_in, n_out, nparam, total, pos;
2728 struct isl_basic_map *bmap = NULL;
2729 struct isl_dim_map *dim_map1, *dim_map2;
2732 if (!bmap1 || !bmap2)
2735 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2738 nparam = isl_basic_map_n_param(bmap1);
2739 n_in = isl_basic_map_n_in(bmap1);
2740 n_out = isl_basic_map_n_out(bmap1);
2742 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2743 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2744 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2745 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2746 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2747 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2748 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2749 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2750 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2751 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2752 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2754 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2755 bmap1->n_div + bmap2->n_div + 2 * n_out,
2756 bmap1->n_eq + bmap2->n_eq + n_out,
2757 bmap1->n_ineq + bmap2->n_ineq);
2758 for (i = 0; i < n_out; ++i) {
2759 int j = isl_basic_map_alloc_equality(bmap);
2762 isl_seq_clr(bmap->eq[j], 1+total);
2763 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2764 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2765 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2767 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2768 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2769 bmap = add_divs(bmap, 2 * n_out);
2771 bmap = isl_basic_map_simplify(bmap);
2772 return isl_basic_map_finalize(bmap);
2774 isl_basic_map_free(bmap);
2775 isl_basic_map_free(bmap1);
2776 isl_basic_map_free(bmap2);
2780 /* Given two maps A -> f(A) and B -> g(B), construct a map
2781 * A \cap B -> f(A) + f(B)
2783 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2785 struct isl_map *result;
2791 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2793 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2794 map1->n * map2->n, 0);
2797 for (i = 0; i < map1->n; ++i)
2798 for (j = 0; j < map2->n; ++j) {
2799 struct isl_basic_map *part;
2800 part = isl_basic_map_sum(
2801 isl_basic_map_copy(map1->p[i]),
2802 isl_basic_map_copy(map2->p[j]));
2803 if (isl_basic_map_is_empty(part))
2804 isl_basic_map_free(part);
2806 result = isl_map_add_basic_map(result, part);
2819 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2820 __isl_take isl_set *set2)
2822 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2825 /* Given a basic map A -> f(A), construct A -> -f(A).
2827 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2832 bmap = isl_basic_map_cow(bmap);
2836 n = isl_basic_map_dim(bmap, isl_dim_out);
2837 off = isl_basic_map_offset(bmap, isl_dim_out);
2838 for (i = 0; i < bmap->n_eq; ++i)
2839 for (j = 0; j < n; ++j)
2840 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2841 for (i = 0; i < bmap->n_ineq; ++i)
2842 for (j = 0; j < n; ++j)
2843 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2844 for (i = 0; i < bmap->n_div; ++i)
2845 for (j = 0; j < n; ++j)
2846 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2847 return isl_basic_map_finalize(bmap);
2850 /* Given a map A -> f(A), construct A -> -f(A).
2852 struct isl_map *isl_map_neg(struct isl_map *map)
2856 map = isl_map_cow(map);
2860 for (i = 0; i < map->n; ++i) {
2861 map->p[i] = isl_basic_map_neg(map->p[i]);
2872 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2874 return (isl_set *)isl_map_neg((isl_map *)set);
2877 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2878 * A -> floor(f(A)/d).
2880 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2883 unsigned n_in, n_out, nparam, total, pos;
2884 struct isl_basic_map *result = NULL;
2885 struct isl_dim_map *dim_map;
2891 nparam = isl_basic_map_n_param(bmap);
2892 n_in = isl_basic_map_n_in(bmap);
2893 n_out = isl_basic_map_n_out(bmap);
2895 total = nparam + n_in + n_out + bmap->n_div + n_out;
2896 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2897 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2898 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2899 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2900 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2902 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2903 bmap->n_div + n_out,
2904 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2905 result = add_constraints_dim_map(result, bmap, dim_map);
2906 result = add_divs(result, n_out);
2907 for (i = 0; i < n_out; ++i) {
2909 j = isl_basic_map_alloc_inequality(result);
2912 isl_seq_clr(result->ineq[j], 1+total);
2913 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2914 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2915 j = isl_basic_map_alloc_inequality(result);
2918 isl_seq_clr(result->ineq[j], 1+total);
2919 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2920 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2921 isl_int_sub_ui(result->ineq[j][0], d, 1);
2924 result = isl_basic_map_simplify(result);
2925 return isl_basic_map_finalize(result);
2927 isl_basic_map_free(result);
2931 /* Given a map A -> f(A) and an integer d, construct a map
2932 * A -> floor(f(A)/d).
2934 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2938 map = isl_map_cow(map);
2942 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2943 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2944 for (i = 0; i < map->n; ++i) {
2945 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2956 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2962 i = isl_basic_map_alloc_equality(bmap);
2965 nparam = isl_basic_map_n_param(bmap);
2966 n_in = isl_basic_map_n_in(bmap);
2967 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2968 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2969 isl_int_set_si(bmap->eq[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_less(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_less_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 /* Add a constraints to "bmap" expressing i_pos > o_pos
3024 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3030 i = isl_basic_map_alloc_inequality(bmap);
3033 nparam = isl_basic_map_n_param(bmap);
3034 n_in = isl_basic_map_n_in(bmap);
3035 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3036 isl_int_set_si(bmap->ineq[i][0], -1);
3037 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3038 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3039 return isl_basic_map_finalize(bmap);
3041 isl_basic_map_free(bmap);
3045 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3047 static __isl_give isl_basic_map *var_more_or_equal(
3048 __isl_take isl_basic_map *bmap, unsigned pos)
3054 i = isl_basic_map_alloc_inequality(bmap);
3057 nparam = isl_basic_map_n_param(bmap);
3058 n_in = isl_basic_map_n_in(bmap);
3059 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3060 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3061 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3062 return isl_basic_map_finalize(bmap);
3064 isl_basic_map_free(bmap);
3068 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3071 struct isl_basic_map *bmap;
3072 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3075 for (i = 0; i < n_equal && bmap; ++i)
3076 bmap = var_equal(bmap, i);
3077 return isl_basic_map_finalize(bmap);
3080 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3082 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3085 struct isl_basic_map *bmap;
3086 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3089 for (i = 0; i < pos && bmap; ++i)
3090 bmap = var_equal(bmap, i);
3092 bmap = var_less(bmap, pos);
3093 return isl_basic_map_finalize(bmap);
3096 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3098 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3099 __isl_take isl_dim *dim, unsigned pos)
3102 isl_basic_map *bmap;
3104 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3105 for (i = 0; i < pos; ++i)
3106 bmap = var_equal(bmap, i);
3107 bmap = var_less_or_equal(bmap, pos);
3108 return isl_basic_map_finalize(bmap);
3111 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3113 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3116 struct isl_basic_map *bmap;
3117 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3120 for (i = 0; i < pos && bmap; ++i)
3121 bmap = var_equal(bmap, i);
3123 bmap = var_more(bmap, pos);
3124 return isl_basic_map_finalize(bmap);
3127 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3129 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3130 __isl_take isl_dim *dim, unsigned pos)
3133 isl_basic_map *bmap;
3135 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3136 for (i = 0; i < pos; ++i)
3137 bmap = var_equal(bmap, i);
3138 bmap = var_more_or_equal(bmap, pos);
3139 return isl_basic_map_finalize(bmap);
3142 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3143 unsigned n, int equal)
3145 struct isl_map *map;
3148 if (n == 0 && equal)
3149 return isl_map_universe(dims);
3151 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3153 for (i = 0; i + 1 < n; ++i)
3154 map = isl_map_add_basic_map(map,
3155 isl_basic_map_less_at(isl_dim_copy(dims), i));
3158 map = isl_map_add_basic_map(map,
3159 isl_basic_map_less_or_equal_at(dims, n - 1));
3161 map = isl_map_add_basic_map(map,
3162 isl_basic_map_less_at(dims, n - 1));
3169 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3173 return map_lex_lte_first(dims, dims->n_out, equal);
3176 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3178 return map_lex_lte_first(dim, n, 0);
3181 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3183 return map_lex_lte_first(dim, n, 1);
3186 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3188 return map_lex_lte(isl_dim_map(set_dim), 0);
3191 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3193 return map_lex_lte(isl_dim_map(set_dim), 1);
3196 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3197 unsigned n, int equal)
3199 struct isl_map *map;
3202 if (n == 0 && equal)
3203 return isl_map_universe(dims);
3205 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3207 for (i = 0; i + 1 < n; ++i)
3208 map = isl_map_add_basic_map(map,
3209 isl_basic_map_more_at(isl_dim_copy(dims), i));
3212 map = isl_map_add_basic_map(map,
3213 isl_basic_map_more_or_equal_at(dims, n - 1));
3215 map = isl_map_add_basic_map(map,
3216 isl_basic_map_more_at(dims, n - 1));
3223 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3227 return map_lex_gte_first(dims, dims->n_out, equal);
3230 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3232 return map_lex_gte_first(dim, n, 0);
3235 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3237 return map_lex_gte_first(dim, n, 1);
3240 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3242 return map_lex_gte(isl_dim_map(set_dim), 0);
3245 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3247 return map_lex_gte(isl_dim_map(set_dim), 1);
3250 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3251 __isl_take isl_set *set2)
3254 map = isl_map_lex_le(isl_set_get_dim(set1));
3255 map = isl_map_intersect_domain(map, set1);
3256 map = isl_map_intersect_range(map, set2);
3260 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3261 __isl_take isl_set *set2)
3264 map = isl_map_lex_lt(isl_set_get_dim(set1));
3265 map = isl_map_intersect_domain(map, set1);
3266 map = isl_map_intersect_range(map, set2);
3270 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3271 __isl_take isl_set *set2)
3274 map = isl_map_lex_ge(isl_set_get_dim(set1));
3275 map = isl_map_intersect_domain(map, set1);
3276 map = isl_map_intersect_range(map, set2);
3280 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3281 __isl_take isl_set *set2)
3284 map = isl_map_lex_gt(isl_set_get_dim(set1));
3285 map = isl_map_intersect_domain(map, set1);
3286 map = isl_map_intersect_range(map, set2);
3290 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3291 __isl_take isl_map *map2)
3294 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3295 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3296 map = isl_map_apply_range(map, isl_map_reverse(map2));
3300 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3301 __isl_take isl_map *map2)
3304 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3305 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3306 map = isl_map_apply_range(map, isl_map_reverse(map2));
3310 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3311 __isl_take isl_map *map2)
3314 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3315 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3316 map = isl_map_apply_range(map, isl_map_reverse(map2));
3320 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3321 __isl_take isl_map *map2)
3324 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3325 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3326 map = isl_map_apply_range(map, isl_map_reverse(map2));
3330 struct isl_basic_map *isl_basic_map_from_basic_set(
3331 struct isl_basic_set *bset, struct isl_dim *dim)
3333 struct isl_basic_map *bmap;
3335 bset = isl_basic_set_cow(bset);
3339 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3340 isl_dim_free(bset->dim);
3341 bmap = (struct isl_basic_map *) bset;
3343 return isl_basic_map_finalize(bmap);
3345 isl_basic_set_free(bset);
3350 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3354 if (bmap->dim->n_in == 0)
3355 return (struct isl_basic_set *)bmap;
3356 bmap = isl_basic_map_cow(bmap);
3359 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3362 bmap = isl_basic_map_finalize(bmap);
3363 return (struct isl_basic_set *)bmap;
3365 isl_basic_map_free(bmap);
3369 /* For a div d = floor(f/m), add the constraints
3372 * -(f-(n-1)) + m d >= 0
3374 * Note that the second constraint is the negation of
3378 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3379 unsigned pos, isl_int *div)
3382 unsigned total = isl_basic_map_total_dim(bmap);
3384 i = isl_basic_map_alloc_inequality(bmap);
3387 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3388 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3390 j = isl_basic_map_alloc_inequality(bmap);
3393 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3394 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3395 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3399 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3400 unsigned pos, isl_int *div)
3402 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3406 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3408 unsigned total = isl_basic_map_total_dim(bmap);
3409 unsigned div_pos = total - bmap->n_div + div;
3411 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3415 struct isl_basic_set *isl_basic_map_underlying_set(
3416 struct isl_basic_map *bmap)
3420 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3421 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3422 return (struct isl_basic_set *)bmap;
3423 bmap = isl_basic_map_cow(bmap);
3426 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3429 bmap->extra -= bmap->n_div;
3431 bmap = isl_basic_map_finalize(bmap);
3432 return (struct isl_basic_set *)bmap;
3437 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3438 __isl_take isl_basic_set *bset)
3440 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3443 struct isl_basic_map *isl_basic_map_overlying_set(
3444 struct isl_basic_set *bset, struct isl_basic_map *like)
3446 struct isl_basic_map *bmap;
3447 struct isl_ctx *ctx;
3454 isl_assert(ctx, bset->n_div == 0, goto error);
3455 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3456 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3458 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3459 isl_basic_map_free(like);
3460 return (struct isl_basic_map *)bset;
3462 bset = isl_basic_set_cow(bset);
3465 total = bset->dim->n_out + bset->extra;
3466 bmap = (struct isl_basic_map *)bset;
3467 isl_dim_free(bmap->dim);
3468 bmap->dim = isl_dim_copy(like->dim);
3471 bmap->n_div = like->n_div;
3472 bmap->extra += like->n_div;
3475 ltotal = total - bmap->extra + like->extra;
3478 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3479 bmap->extra * (1 + 1 + total));
3480 if (isl_blk_is_error(bmap->block2))
3482 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3486 for (i = 0; i < bmap->extra; ++i)
3487 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3488 for (i = 0; i < like->n_div; ++i) {
3489 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3490 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3492 bmap = isl_basic_map_extend_constraints(bmap,
3493 0, 2 * like->n_div);
3494 for (i = 0; i < like->n_div; ++i) {
3495 if (isl_int_is_zero(bmap->div[i][0]))
3497 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3501 isl_basic_map_free(like);
3502 bmap = isl_basic_map_simplify(bmap);
3503 bmap = isl_basic_map_finalize(bmap);
3506 isl_basic_map_free(like);
3507 isl_basic_set_free(bset);
3511 struct isl_basic_set *isl_basic_set_from_underlying_set(
3512 struct isl_basic_set *bset, struct isl_basic_set *like)
3514 return (struct isl_basic_set *)
3515 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3518 struct isl_set *isl_set_from_underlying_set(
3519 struct isl_set *set, struct isl_basic_set *like)
3525 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3527 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3528 isl_basic_set_free(like);
3531 set = isl_set_cow(set);
3534 for (i = 0; i < set->n; ++i) {
3535 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3536 isl_basic_set_copy(like));
3540 isl_dim_free(set->dim);
3541 set->dim = isl_dim_copy(like->dim);
3544 isl_basic_set_free(like);
3547 isl_basic_set_free(like);
3552 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3556 map = isl_map_cow(map);
3559 map->dim = isl_dim_cow(map->dim);
3563 for (i = 1; i < map->n; ++i)
3564 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3566 for (i = 0; i < map->n; ++i) {
3567 map->p[i] = (struct isl_basic_map *)
3568 isl_basic_map_underlying_set(map->p[i]);
3573 map->dim = isl_dim_underlying(map->dim, 0);
3575 isl_dim_free(map->dim);
3576 map->dim = isl_dim_copy(map->p[0]->dim);
3580 return (struct isl_set *)map;
3586 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3588 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3591 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3592 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3594 bmap = isl_basic_map_cow(bmap);
3598 isl_dim_free(bmap->dim);
3601 bmap = isl_basic_map_finalize(bmap);
3605 isl_basic_map_free(bmap);
3610 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3611 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3613 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3617 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3618 __isl_take isl_dim *dim)
3622 map = isl_map_cow(map);
3626 for (i = 0; i < map->n; ++i) {
3627 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3632 isl_dim_free(map->dim);
3642 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3643 __isl_take isl_dim *dim)
3645 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3648 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3651 struct isl_basic_set *domain;
3657 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3659 n_in = isl_basic_map_n_in(bmap);
3660 n_out = isl_basic_map_n_out(bmap);
3661 domain = isl_basic_set_from_basic_map(bmap);
3662 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3664 domain = isl_basic_set_reset_dim(domain, dim);
3669 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3671 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3674 __isl_give isl_basic_map *isl_basic_map_domain_map(
3675 __isl_take isl_basic_map *bmap)
3679 isl_basic_map *domain;
3680 isl_basic_set *bset;
3681 int nparam, n_in, n_out;
3684 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3685 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3686 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3688 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3689 domain = isl_basic_map_universe(dim);
3691 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3692 bmap = isl_basic_map_apply_range(bmap, domain);
3693 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3695 total = isl_basic_map_total_dim(bmap);
3697 for (i = 0; i < n_in; ++i) {
3698 k = isl_basic_map_alloc_equality(bmap);
3701 isl_seq_clr(bmap->eq[k], 1 + total);
3702 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3703 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3706 bmap = isl_basic_map_gauss(bmap, NULL);
3707 return isl_basic_map_finalize(bmap);
3709 isl_basic_map_free(bmap);
3713 __isl_give isl_basic_map *isl_basic_map_range_map(
3714 __isl_take isl_basic_map *bmap)
3718 isl_basic_map *range;
3719 isl_basic_set *bset;
3720 int nparam, n_in, n_out;
3723 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3724 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3725 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3727 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3728 range = isl_basic_map_universe(dim);
3730 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3731 bmap = isl_basic_map_apply_range(bmap, range);
3732 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3734 total = isl_basic_map_total_dim(bmap);
3736 for (i = 0; i < n_out; ++i) {
3737 k = isl_basic_map_alloc_equality(bmap);
3740 isl_seq_clr(bmap->eq[k], 1 + total);
3741 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3742 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3745 bmap = isl_basic_map_gauss(bmap, NULL);
3746 return isl_basic_map_finalize(bmap);
3748 isl_basic_map_free(bmap);
3752 struct isl_set *isl_map_range(struct isl_map *map)
3755 struct isl_set *set;
3759 if (isl_map_dim(map, isl_dim_in) == 0)
3760 return (isl_set *)map;
3762 map = isl_map_cow(map);
3766 set = (struct isl_set *) map;
3767 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3770 for (i = 0; i < map->n; ++i) {
3771 set->p[i] = isl_basic_map_range(map->p[i]);
3775 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3776 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3783 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3786 isl_dim *domain_dim;
3788 map = isl_map_cow(map);
3792 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3793 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3794 map->dim = isl_dim_join(map->dim, domain_dim);
3797 for (i = 0; i < map->n; ++i) {
3798 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3802 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3803 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3810 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3815 map = isl_map_cow(map);
3819 range_dim = isl_dim_range(isl_map_get_dim(map));
3820 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3821 map->dim = isl_dim_join(map->dim, range_dim);
3824 for (i = 0; i < map->n; ++i) {
3825 map->p[i] = isl_basic_map_range_map(map->p[i]);
3829 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3830 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3837 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3840 struct isl_map *map = NULL;
3842 set = isl_set_cow(set);
3845 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3846 map = (struct isl_map *)set;
3847 for (i = 0; i < set->n; ++i) {
3848 map->p[i] = isl_basic_map_from_basic_set(
3849 set->p[i], isl_dim_copy(dim));
3853 isl_dim_free(map->dim);
3862 __isl_give isl_basic_map *isl_basic_map_from_domain(
3863 __isl_take isl_basic_set *bset)
3865 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
3868 __isl_give isl_basic_map *isl_basic_map_from_range(
3869 __isl_take isl_basic_set *bset)
3871 return (isl_basic_map *)bset;
3874 struct isl_map *isl_map_from_range(struct isl_set *set)
3876 return (struct isl_map *)set;
3879 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3881 return isl_map_reverse(isl_map_from_range(set));
3884 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3885 __isl_take isl_set *range)
3887 return isl_map_apply_range(isl_map_from_domain(domain),
3888 isl_map_from_range(range));
3891 struct isl_set *isl_set_from_map(struct isl_map *map)
3894 struct isl_set *set = NULL;
3898 map = isl_map_cow(map);
3901 map->dim = isl_dim_as_set_dim(map->dim);
3904 set = (struct isl_set *)map;
3905 for (i = 0; i < map->n; ++i) {
3906 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3916 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3918 struct isl_map *map;
3922 isl_assert(dim->ctx, n >= 0, return NULL);
3923 map = isl_alloc(dim->ctx, struct isl_map,
3924 sizeof(struct isl_map) +
3925 (n - 1) * sizeof(struct isl_basic_map *));
3929 map->ctx = dim->ctx;
3930 isl_ctx_ref(map->ctx);
3942 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3943 unsigned nparam, unsigned in, unsigned out, int n,
3946 struct isl_map *map;
3947 struct isl_dim *dims;
3949 dims = isl_dim_alloc(ctx, nparam, in, out);
3953 map = isl_map_alloc_dim(dims, n, flags);
3957 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3959 struct isl_basic_map *bmap;
3960 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3961 bmap = isl_basic_map_set_to_empty(bmap);
3965 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3967 struct isl_basic_set *bset;
3968 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3969 bset = isl_basic_set_set_to_empty(bset);
3973 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3975 struct isl_basic_map *bmap;
3978 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3979 bmap = isl_basic_map_set_to_empty(bmap);
3983 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3985 struct isl_basic_map *bmap;
3988 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3989 bmap = isl_basic_map_set_to_empty(bmap);
3993 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3995 struct isl_basic_set *bset;
3998 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3999 bset = isl_basic_set_set_to_empty(bset);
4003 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4005 struct isl_basic_map *bmap;
4006 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4010 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4012 struct isl_basic_set *bset;
4013 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4017 __isl_give isl_basic_map *isl_basic_map_universe_like(
4018 __isl_keep isl_basic_map *model)
4022 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4025 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4029 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4032 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4033 __isl_keep isl_set *model)
4037 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4040 struct isl_map *isl_map_empty(struct isl_dim *dim)
4042 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4045 struct isl_map *isl_map_empty_like(struct isl_map *model)
4049 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4052 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4056 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4059 struct isl_set *isl_set_empty(struct isl_dim *dim)
4061 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4064 struct isl_set *isl_set_empty_like(struct isl_set *model)
4068 return isl_set_empty(isl_dim_copy(model->dim));
4071 struct isl_map *isl_map_universe(struct isl_dim *dim)
4073 struct isl_map *map;
4076 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4077 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4081 struct isl_set *isl_set_universe(struct isl_dim *dim)
4083 struct isl_set *set;
4086 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4087 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4091 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4095 return isl_set_universe(isl_dim_copy(model->dim));
4098 struct isl_map *isl_map_dup(struct isl_map *map)
4101 struct isl_map *dup;
4105 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4106 for (i = 0; i < map->n; ++i)
4107 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4111 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4112 __isl_take isl_basic_map *bmap)
4116 if (isl_basic_map_fast_is_empty(bmap)) {
4117 isl_basic_map_free(bmap);
4120 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4121 isl_assert(map->ctx, map->n < map->size, goto error);
4122 map->p[map->n] = bmap;
4124 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4130 isl_basic_map_free(bmap);
4134 void isl_map_free(struct isl_map *map)
4144 isl_ctx_deref(map->ctx);
4145 for (i = 0; i < map->n; ++i)
4146 isl_basic_map_free(map->p[i]);
4147 isl_dim_free(map->dim);
4151 struct isl_map *isl_map_extend(struct isl_map *base,
4152 unsigned nparam, unsigned n_in, unsigned n_out)
4156 base = isl_map_cow(base);
4160 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4163 for (i = 0; i < base->n; ++i) {
4164 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4165 isl_dim_copy(base->dim), 0, 0, 0);
4175 struct isl_set *isl_set_extend(struct isl_set *base,
4176 unsigned nparam, unsigned dim)
4178 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4182 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4183 struct isl_basic_map *bmap, unsigned pos, int value)
4187 bmap = isl_basic_map_cow(bmap);
4188 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4189 j = isl_basic_map_alloc_equality(bmap);
4192 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4193 isl_int_set_si(bmap->eq[j][pos], -1);
4194 isl_int_set_si(bmap->eq[j][0], value);
4195 bmap = isl_basic_map_simplify(bmap);
4196 return isl_basic_map_finalize(bmap);
4198 isl_basic_map_free(bmap);
4202 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4203 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4207 bmap = isl_basic_map_cow(bmap);
4208 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4209 j = isl_basic_map_alloc_equality(bmap);
4212 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4213 isl_int_set_si(bmap->eq[j][pos], -1);
4214 isl_int_set(bmap->eq[j][0], value);
4215 bmap = isl_basic_map_simplify(bmap);
4216 return isl_basic_map_finalize(bmap);
4218 isl_basic_map_free(bmap);
4222 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4223 enum isl_dim_type type, unsigned pos, int value)
4227 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4228 return isl_basic_map_fix_pos_si(bmap,
4229 isl_basic_map_offset(bmap, type) + pos, value);
4231 isl_basic_map_free(bmap);
4235 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4236 enum isl_dim_type type, unsigned pos, isl_int value)
4240 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4241 return isl_basic_map_fix_pos(bmap,
4242 isl_basic_map_offset(bmap, type) + pos, value);
4244 isl_basic_map_free(bmap);
4248 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4249 enum isl_dim_type type, unsigned pos, int value)
4251 return (struct isl_basic_set *)
4252 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4256 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4257 enum isl_dim_type type, unsigned pos, isl_int value)
4259 return (struct isl_basic_set *)
4260 isl_basic_map_fix((struct isl_basic_map *)bset,
4264 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4265 unsigned input, int value)
4267 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4270 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4271 unsigned dim, int value)
4273 return (struct isl_basic_set *)
4274 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4275 isl_dim_set, dim, value);
4278 struct isl_map *isl_map_fix_si(struct isl_map *map,
4279 enum isl_dim_type type, unsigned pos, int value)
4283 map = isl_map_cow(map);
4287 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4288 for (i = 0; i < map->n; ++i) {
4289 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4293 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4300 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4301 enum isl_dim_type type, unsigned pos, int value)
4303 return (struct isl_set *)
4304 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4307 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4308 enum isl_dim_type type, unsigned pos, isl_int value)
4312 map = isl_map_cow(map);
4316 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4317 for (i = 0; i < map->n; ++i) {
4318 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4322 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4329 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4330 enum isl_dim_type type, unsigned pos, isl_int value)
4332 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4335 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4336 unsigned input, int value)
4338 return isl_map_fix_si(map, isl_dim_in, input, value);
4341 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4343 return (struct isl_set *)
4344 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4347 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4348 __isl_take isl_basic_map *bmap,
4349 enum isl_dim_type type, unsigned pos, int value)
4355 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4356 pos += isl_basic_map_offset(bmap, type);
4357 bmap = isl_basic_map_cow(bmap);
4358 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4359 j = isl_basic_map_alloc_inequality(bmap);
4362 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4363 isl_int_set_si(bmap->ineq[j][pos], 1);
4364 isl_int_set_si(bmap->ineq[j][0], -value);
4365 bmap = isl_basic_map_simplify(bmap);
4366 return isl_basic_map_finalize(bmap);
4368 isl_basic_map_free(bmap);
4372 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4373 unsigned dim, isl_int value)
4377 bset = isl_basic_set_cow(bset);
4378 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4379 j = isl_basic_set_alloc_inequality(bset);
4382 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4383 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4384 isl_int_neg(bset->ineq[j][0], value);
4385 bset = isl_basic_set_simplify(bset);
4386 return isl_basic_set_finalize(bset);
4388 isl_basic_set_free(bset);
4392 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4393 enum isl_dim_type type, unsigned pos, int value)
4397 map = isl_map_cow(map);
4401 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4402 for (i = 0; i < map->n; ++i) {
4403 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4408 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4415 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4416 enum isl_dim_type type, unsigned pos, int value)
4418 return (struct isl_set *)
4419 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4422 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4427 set = isl_set_cow(set);
4431 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4432 for (i = 0; i < set->n; ++i) {
4433 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4443 struct isl_map *isl_map_reverse(struct isl_map *map)
4447 map = isl_map_cow(map);
4451 map->dim = isl_dim_reverse(map->dim);
4454 for (i = 0; i < map->n; ++i) {
4455 map->p[i] = isl_basic_map_reverse(map->p[i]);
4459 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4466 static struct isl_map *isl_basic_map_partial_lexopt(
4467 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4468 struct isl_set **empty, int max)
4472 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4473 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4475 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4477 isl_basic_map_free(bmap);
4478 isl_basic_set_free(dom);
4484 struct isl_map *isl_basic_map_partial_lexmax(
4485 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4486 struct isl_set **empty)
4488 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4491 struct isl_map *isl_basic_map_partial_lexmin(
4492 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4493 struct isl_set **empty)
4495 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4498 struct isl_set *isl_basic_set_partial_lexmin(
4499 struct isl_basic_set *bset, struct isl_basic_set *dom,
4500 struct isl_set **empty)
4502 return (struct isl_set *)
4503 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4507 struct isl_set *isl_basic_set_partial_lexmax(
4508 struct isl_basic_set *bset, struct isl_basic_set *dom,
4509 struct isl_set **empty)
4511 return (struct isl_set *)
4512 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4516 /* Given a basic map "bmap", compute the lexicograhically minimal
4517 * (or maximal) image element for each domain element in dom.
4518 * Set *empty to those elements in dom that do not have an image element.
4520 * We first make sure the basic sets in dom are disjoint and then
4521 * simply collect the results over each of the basic sets separately.
4522 * We could probably improve the efficiency a bit by moving the union
4523 * domain down into the parametric integer programming.
4525 static __isl_give isl_map *basic_map_partial_lexopt(
4526 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4527 __isl_give isl_set **empty, int max)
4530 struct isl_map *res;
4532 dom = isl_set_make_disjoint(dom);
4536 if (isl_set_fast_is_empty(dom)) {
4537 res = isl_map_empty_like_basic_map(bmap);
4538 *empty = isl_set_empty_like(dom);
4540 isl_basic_map_free(bmap);
4544 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4545 isl_basic_set_copy(dom->p[0]), empty, max);
4547 for (i = 1; i < dom->n; ++i) {
4548 struct isl_map *res_i;
4549 struct isl_set *empty_i;
4551 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4552 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4554 res = isl_map_union_disjoint(res, res_i);
4555 *empty = isl_set_union_disjoint(*empty, empty_i);
4559 isl_basic_map_free(bmap);
4564 isl_basic_map_free(bmap);
4568 /* Given a map "map", compute the lexicograhically minimal
4569 * (or maximal) image element for each domain element in dom.
4570 * Set *empty to those elements in dom that do not have an image element.
4572 * We first compute the lexicographically minimal or maximal element
4573 * in the first basic map. This results in a partial solution "res"
4574 * and a subset "todo" of dom that still need to be handled.
4575 * We then consider each of the remaining maps in "map" and successively
4576 * improve both "res" and "todo".
4578 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4579 * Assume we are computing the lexicographical maximum.
4580 * We first intersect basic map i with a relation that maps elements
4581 * to elements that are lexicographically larger than the image elements
4582 * in res^k and the compute the maximum image element of this intersection.
4583 * The result ("better") corresponds to those image elements in basic map i
4584 * that are better than what we had before. The remainder ("keep") are the
4585 * domain elements for which the image element in res_k was better.
4586 * We also compute the lexicographical maximum of basic map i in todo^k.
4587 * res^i is the result of the operation + better + those elements in
4588 * res^k that we should keep
4589 * todo^i is the remainder of the maximum operation on todo^k.
4591 static __isl_give isl_map *isl_map_partial_lexopt(
4592 __isl_take isl_map *map, __isl_take isl_set *dom,
4593 __isl_give isl_set **empty, int max)
4596 struct isl_map *res;
4597 struct isl_set *todo;
4602 if (isl_map_fast_is_empty(map)) {
4610 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4611 isl_set_copy(dom), &todo, max);
4613 for (i = 1; i < map->n; ++i) {
4615 struct isl_map *better;
4616 struct isl_set *keep;
4617 struct isl_map *res_i;
4618 struct isl_set *todo_i;
4619 struct isl_dim *dim = isl_map_get_dim(res);
4621 dim = isl_dim_range(dim);
4623 lt = isl_map_lex_lt(dim);
4625 lt = isl_map_lex_gt(dim);
4626 lt = isl_map_apply_range(isl_map_copy(res), lt);
4627 lt = isl_map_intersect(lt,
4628 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4629 better = isl_map_partial_lexopt(lt,
4630 isl_map_domain(isl_map_copy(res)),
4633 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4634 todo, &todo_i, max);
4636 res = isl_map_intersect_domain(res, keep);
4637 res = isl_map_union_disjoint(res, res_i);
4638 res = isl_map_union_disjoint(res, better);
4659 __isl_give isl_map *isl_map_partial_lexmax(
4660 __isl_take isl_map *map, __isl_take isl_set *dom,
4661 __isl_give isl_set **empty)
4663 return isl_map_partial_lexopt(map, dom, empty, 1);
4666 __isl_give isl_map *isl_map_partial_lexmin(
4667 __isl_take isl_map *map, __isl_take isl_set *dom,
4668 __isl_give isl_set **empty)
4670 return isl_map_partial_lexopt(map, dom, empty, 0);
4673 __isl_give isl_set *isl_set_partial_lexmin(
4674 __isl_take isl_set *set, __isl_take isl_set *dom,
4675 __isl_give isl_set **empty)
4677 return (struct isl_set *)
4678 isl_map_partial_lexmin((struct isl_map *)set,
4682 __isl_give isl_set *isl_set_partial_lexmax(
4683 __isl_take isl_set *set, __isl_take isl_set *dom,
4684 __isl_give isl_set **empty)
4686 return (struct isl_set *)
4687 isl_map_partial_lexmax((struct isl_map *)set,
4691 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4693 struct isl_basic_set *dom = NULL;
4694 struct isl_dim *dom_dim;
4698 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4699 dom = isl_basic_set_universe(dom_dim);
4700 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4702 isl_basic_map_free(bmap);
4706 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4708 return isl_basic_map_lexopt(bmap, 0);
4711 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4713 return isl_basic_map_lexopt(bmap, 1);
4716 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4718 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4721 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4723 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4726 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4728 struct isl_set *dom = NULL;
4729 struct isl_dim *dom_dim;
4733 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4734 dom = isl_set_universe(dom_dim);
4735 return isl_map_partial_lexopt(map, dom, NULL, max);
4741 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4743 return isl_map_lexopt(map, 0);
4746 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4748 return isl_map_lexopt(map, 1);
4751 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4753 return (isl_set *)isl_map_lexmin((isl_map *)set);
4756 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4758 return (isl_set *)isl_map_lexmax((isl_map *)set);
4761 /* Apply a preimage specified by "mat" on the parameters of "bset".
4762 * bset is assumed to have only parameters and divs.
4764 static struct isl_basic_set *basic_set_parameter_preimage(
4765 struct isl_basic_set *bset, struct isl_mat *mat)
4772 bset->dim = isl_dim_cow(bset->dim);
4776 nparam = isl_basic_set_dim(bset, isl_dim_param);
4778 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4780 bset->dim->nparam = 0;
4781 bset->dim->n_out = nparam;
4782 bset = isl_basic_set_preimage(bset, mat);
4784 bset->dim->nparam = bset->dim->n_out;
4785 bset->dim->n_out = 0;
4790 isl_basic_set_free(bset);
4794 /* Apply a preimage specified by "mat" on the parameters of "set".
4795 * set is assumed to have only parameters and divs.
4797 static struct isl_set *set_parameter_preimage(
4798 struct isl_set *set, struct isl_mat *mat)
4800 struct isl_dim *dim = NULL;
4806 dim = isl_dim_copy(set->dim);
4807 dim = isl_dim_cow(dim);
4811 nparam = isl_set_dim(set, isl_dim_param);
4813 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4816 dim->n_out = nparam;
4817 isl_set_reset_dim(set, dim);
4818 set = isl_set_preimage(set, mat);
4821 dim = isl_dim_copy(set->dim);
4822 dim = isl_dim_cow(dim);
4825 dim->nparam = dim->n_out;
4827 isl_set_reset_dim(set, dim);
4837 /* Intersect the basic set "bset" with the affine space specified by the
4838 * equalities in "eq".
4840 static struct isl_basic_set *basic_set_append_equalities(
4841 struct isl_basic_set *bset, struct isl_mat *eq)
4849 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4854 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4855 for (i = 0; i < eq->n_row; ++i) {
4856 k = isl_basic_set_alloc_equality(bset);
4859 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4860 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4864 bset = isl_basic_set_gauss(bset, NULL);
4865 bset = isl_basic_set_finalize(bset);
4870 isl_basic_set_free(bset);
4874 /* Intersect the set "set" with the affine space specified by the
4875 * equalities in "eq".
4877 static struct isl_set *set_append_equalities(struct isl_set *set,
4885 for (i = 0; i < set->n; ++i) {
4886 set->p[i] = basic_set_append_equalities(set->p[i],
4899 /* Project the given basic set onto its parameter domain, possibly introducing
4900 * new, explicit, existential variables in the constraints.
4901 * The input has parameters and (possibly implicit) existential variables.
4902 * The output has the same parameters, but only
4903 * explicit existentially quantified variables.
4905 * The actual projection is performed by pip, but pip doesn't seem
4906 * to like equalities very much, so we first remove the equalities
4907 * among the parameters by performing a variable compression on
4908 * the parameters. Afterward, an inverse transformation is performed
4909 * and the equalities among the parameters are inserted back in.
4911 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4915 struct isl_mat *T, *T2;
4916 struct isl_set *set;
4917 unsigned nparam, n_div;
4919 bset = isl_basic_set_cow(bset);
4923 if (bset->n_eq == 0)
4924 return isl_basic_set_lexmin(bset);
4926 isl_basic_set_gauss(bset, NULL);
4928 nparam = isl_basic_set_dim(bset, isl_dim_param);
4929 n_div = isl_basic_set_dim(bset, isl_dim_div);
4931 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4932 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4935 if (i == bset->n_eq)
4936 return isl_basic_set_lexmin(bset);
4938 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4940 eq = isl_mat_cow(eq);
4941 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4942 if (T && T->n_col == 0) {
4946 bset = isl_basic_set_set_to_empty(bset);
4947 return isl_set_from_basic_set(bset);
4949 bset = basic_set_parameter_preimage(bset, T);
4951 set = isl_basic_set_lexmin(bset);
4952 set = set_parameter_preimage(set, T2);
4953 set = set_append_equalities(set, eq);
4957 /* Compute an explicit representation for all the existentially
4958 * quantified variables.
4959 * The input and output dimensions are first turned into parameters.
4960 * compute_divs then returns a map with the same parameters and
4961 * no input or output dimensions and the dimension specification
4962 * is reset to that of the input.
4964 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4966 struct isl_basic_set *bset;
4967 struct isl_set *set;
4968 struct isl_map *map;
4969 struct isl_dim *dim, *orig_dim = NULL;
4974 bmap = isl_basic_map_cow(bmap);
4978 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4979 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4980 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4981 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4985 orig_dim = bmap->dim;
4987 bset = (struct isl_basic_set *)bmap;
4989 set = parameter_compute_divs(bset);
4990 map = (struct isl_map *)set;
4991 map = isl_map_reset_dim(map, orig_dim);
4995 isl_basic_map_free(bmap);
4999 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5007 off = isl_dim_total(bmap->dim);
5008 for (i = 0; i < bmap->n_div; ++i) {
5009 if (isl_int_is_zero(bmap->div[i][0]))
5011 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5017 static int map_divs_known(__isl_keep isl_map *map)
5024 for (i = 0; i < map->n; ++i) {
5025 int known = basic_map_divs_known(map->p[i]);
5033 /* If bmap contains any unknown divs, then compute explicit
5034 * expressions for them. However, this computation may be
5035 * quite expensive, so first try to remove divs that aren't
5038 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5042 struct isl_map *map;
5044 known = basic_map_divs_known(bmap);
5048 return isl_map_from_basic_map(bmap);
5050 bmap = isl_basic_map_drop_redundant_divs(bmap);
5052 known = basic_map_divs_known(bmap);
5056 return isl_map_from_basic_map(bmap);
5058 map = compute_divs(bmap);
5061 isl_basic_map_free(bmap);
5065 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5069 struct isl_map *res;
5076 known = map_divs_known(map);
5084 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5085 for (i = 1 ; i < map->n; ++i) {
5087 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5088 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5089 res = isl_map_union_disjoint(res, r2);
5091 res = isl_map_union(res, r2);
5098 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5100 return (struct isl_set *)
5101 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5104 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5106 return (struct isl_set *)
5107 isl_map_compute_divs((struct isl_map *)set);
5110 struct isl_set *isl_map_domain(struct isl_map *map)
5113 struct isl_set *set;
5118 map = isl_map_cow(map);
5122 set = (struct isl_set *)map;
5123 set->dim = isl_dim_domain(set->dim);
5126 for (i = 0; i < map->n; ++i) {
5127 set->p[i] = isl_basic_map_domain(map->p[i]);
5131 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5132 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5139 struct isl_map *isl_map_union_disjoint(
5140 struct isl_map *map1, struct isl_map *map2)
5144 struct isl_map *map = NULL;
5158 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5160 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5161 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5162 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5164 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5165 map1->n + map2->n, flags);
5168 for (i = 0; i < map1->n; ++i) {
5169 map = isl_map_add_basic_map(map,
5170 isl_basic_map_copy(map1->p[i]));
5174 for (i = 0; i < map2->n; ++i) {
5175 map = isl_map_add_basic_map(map,
5176 isl_basic_map_copy(map2->p[i]));
5190 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5192 map1 = isl_map_union_disjoint(map1, map2);
5196 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5200 struct isl_set *isl_set_union_disjoint(
5201 struct isl_set *set1, struct isl_set *set2)
5203 return (struct isl_set *)
5204 isl_map_union_disjoint(
5205 (struct isl_map *)set1, (struct isl_map *)set2);
5208 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5210 return (struct isl_set *)
5211 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5214 struct isl_map *isl_map_intersect_range(
5215 struct isl_map *map, struct isl_set *set)
5218 struct isl_map *result;
5224 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5225 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5226 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5228 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5229 map->n * set->n, flags);
5232 for (i = 0; i < map->n; ++i)
5233 for (j = 0; j < set->n; ++j) {
5234 result = isl_map_add_basic_map(result,
5235 isl_basic_map_intersect_range(
5236 isl_basic_map_copy(map->p[i]),
5237 isl_basic_set_copy(set->p[j])));
5250 struct isl_map *isl_map_intersect_domain(
5251 struct isl_map *map, struct isl_set *set)
5253 return isl_map_reverse(
5254 isl_map_intersect_range(isl_map_reverse(map), set));
5257 struct isl_map *isl_map_apply_domain(
5258 struct isl_map *map1, struct isl_map *map2)
5262 map1 = isl_map_reverse(map1);
5263 map1 = isl_map_apply_range(map1, map2);
5264 return isl_map_reverse(map1);
5271 struct isl_map *isl_map_apply_range(
5272 struct isl_map *map1, struct isl_map *map2)
5274 struct isl_dim *dim_result;
5275 struct isl_map *result;
5281 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5282 isl_dim_copy(map2->dim));
5284 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5287 for (i = 0; i < map1->n; ++i)
5288 for (j = 0; j < map2->n; ++j) {
5289 result = isl_map_add_basic_map(result,
5290 isl_basic_map_apply_range(
5291 isl_basic_map_copy(map1->p[i]),
5292 isl_basic_map_copy(map2->p[j])));
5298 if (result && result->n <= 1)
5299 ISL_F_SET(result, ISL_MAP_DISJOINT);
5308 * returns range - domain
5310 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5312 isl_dim *dims, *target_dim;
5313 struct isl_basic_set *bset;
5320 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5321 bmap->dim, isl_dim_out),
5323 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5324 dim = isl_basic_map_n_in(bmap);
5325 nparam = isl_basic_map_n_param(bmap);
5326 bset = isl_basic_set_from_basic_map(bmap);
5327 bset = isl_basic_set_cow(bset);
5328 dims = isl_basic_set_get_dim(bset);
5329 dims = isl_dim_add(dims, isl_dim_set, dim);
5330 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5331 bset = isl_basic_set_swap_vars(bset, 2*dim);
5332 for (i = 0; i < dim; ++i) {
5333 int j = isl_basic_map_alloc_equality(
5334 (struct isl_basic_map *)bset);
5337 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5338 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5339 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5340 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5342 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5343 bset = isl_basic_set_reset_dim(bset, target_dim);
5346 isl_basic_map_free(bmap);
5351 * returns range - domain
5353 struct isl_set *isl_map_deltas(struct isl_map *map)
5357 struct isl_set *result;
5362 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5363 map->dim, isl_dim_out),
5365 dim = isl_map_get_dim(map);
5366 dim = isl_dim_domain(dim);
5367 result = isl_set_alloc_dim(dim, map->n, map->flags);
5370 for (i = 0; i < map->n; ++i)
5371 result = isl_set_add_basic_set(result,
5372 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5380 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5382 struct isl_basic_map *bmap;
5390 nparam = dims->nparam;
5392 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5396 for (i = 0; i < dim; ++i) {
5397 int j = isl_basic_map_alloc_equality(bmap);
5400 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5401 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5402 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5404 return isl_basic_map_finalize(bmap);
5406 isl_basic_map_free(bmap);
5410 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5412 struct isl_dim *dim = isl_dim_map(set_dim);
5415 return basic_map_identity(dim);
5418 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5420 if (!model || !model->dim)
5422 isl_assert(model->ctx,
5423 model->dim->n_in == model->dim->n_out, return NULL);
5424 return basic_map_identity(isl_dim_copy(model->dim));
5427 static struct isl_map *map_identity(struct isl_dim *dim)
5429 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5430 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5433 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5435 struct isl_dim *dim = isl_dim_map(set_dim);
5438 return map_identity(dim);
5441 struct isl_map *isl_map_identity_like(struct isl_map *model)
5443 if (!model || !model->dim)
5445 isl_assert(model->ctx,
5446 model->dim->n_in == model->dim->n_out, return NULL);
5447 return map_identity(isl_dim_copy(model->dim));
5450 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5452 if (!model || !model->dim)
5454 isl_assert(model->ctx,
5455 model->dim->n_in == model->dim->n_out, return NULL);
5456 return map_identity(isl_dim_copy(model->dim));
5459 /* Construct a basic set with all set dimensions having only non-negative
5462 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5467 struct isl_basic_set *bset;
5471 nparam = dims->nparam;
5473 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5476 for (i = 0; i < dim; ++i) {
5477 int k = isl_basic_set_alloc_inequality(bset);
5480 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5481 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5485 isl_basic_set_free(bset);
5489 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5490 enum isl_dim_type type, unsigned first, unsigned n)
5493 isl_basic_set *nonneg = NULL;
5494 isl_basic_set *neg = NULL;
5501 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5503 for (i = 0; i < n; ++i) {
5507 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5508 k = isl_basic_set_alloc_inequality(nonneg);
5511 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5512 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5514 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5515 k = isl_basic_set_alloc_inequality(neg);
5518 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5519 isl_int_set_si(neg->ineq[k][0], -1);
5520 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5522 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5527 isl_basic_set_free(nonneg);
5528 isl_basic_set_free(neg);
5533 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5535 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5538 int isl_basic_map_is_subset(
5539 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5542 struct isl_map *map1;
5543 struct isl_map *map2;
5545 if (!bmap1 || !bmap2)
5548 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5549 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5551 is_subset = isl_map_is_subset(map1, map2);
5559 int isl_basic_map_is_equal(
5560 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5564 if (!bmap1 || !bmap2)
5566 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5569 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5573 int isl_basic_set_is_equal(
5574 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5576 return isl_basic_map_is_equal(
5577 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5580 int isl_map_is_empty(struct isl_map *map)
5587 for (i = 0; i < map->n; ++i) {
5588 is_empty = isl_basic_map_is_empty(map->p[i]);
5597 int isl_map_fast_is_empty(struct isl_map *map)
5599 return map ? map->n == 0 : -1;
5602 int isl_set_fast_is_empty(struct isl_set *set)
5604 return set ? set->n == 0 : -1;
5607 int isl_set_is_empty(struct isl_set *set)
5609 return isl_map_is_empty((struct isl_map *)set);
5612 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5617 return isl_dim_equal(map1->dim, map2->dim);
5620 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5625 return isl_dim_equal(set1->dim, set2->dim);
5628 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5634 is_subset = isl_map_is_subset(map1, map2);
5637 is_subset = isl_map_is_subset(map2, map1);
5641 int isl_basic_map_is_strict_subset(
5642 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5646 if (!bmap1 || !bmap2)
5648 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5651 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5652 if (is_subset == -1)
5657 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5663 is_subset = isl_map_is_subset(map1, map2);
5666 is_subset = isl_map_is_subset(map2, map1);
5667 if (is_subset == -1)
5672 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5674 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5677 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5681 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5684 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5688 return bset->n_eq == 0 && bset->n_ineq == 0;
5691 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5698 for (i = 0; i < map->n; ++i) {
5699 int r = isl_basic_map_is_universe(map->p[i]);
5707 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5709 return isl_map_fast_is_universe((isl_map *) set);
5712 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5714 struct isl_basic_set *bset = NULL;
5715 struct isl_vec *sample = NULL;
5722 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5725 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5726 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5727 copy = isl_basic_map_remove_redundancies(copy);
5728 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5729 isl_basic_map_free(copy);
5733 total = 1 + isl_basic_map_total_dim(bmap);
5734 if (bmap->sample && bmap->sample->size == total) {
5735 int contains = isl_basic_map_contains(bmap, bmap->sample);
5741 isl_vec_free(bmap->sample);
5742 bmap->sample = NULL;
5743 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5746 sample = isl_basic_set_sample_vec(bset);
5749 empty = sample->size == 0;
5750 isl_vec_free(bmap->sample);
5751 bmap->sample = sample;
5753 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5758 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5762 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5765 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5769 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5772 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5774 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5777 struct isl_map *isl_basic_map_union(
5778 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5780 struct isl_map *map;
5781 if (!bmap1 || !bmap2)
5784 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5786 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5789 map = isl_map_add_basic_map(map, bmap1);
5790 map = isl_map_add_basic_map(map, bmap2);
5793 isl_basic_map_free(bmap1);
5794 isl_basic_map_free(bmap2);
5798 struct isl_set *isl_basic_set_union(
5799 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5801 return (struct isl_set *)isl_basic_map_union(
5802 (struct isl_basic_map *)bset1,
5803 (struct isl_basic_map *)bset2);
5806 /* Order divs such that any div only depends on previous divs */
5807 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5815 off = isl_dim_total(bmap->dim);
5817 for (i = 0; i < bmap->n_div; ++i) {
5819 if (isl_int_is_zero(bmap->div[i][0]))
5821 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5825 isl_basic_map_swap_div(bmap, i, i + pos);
5831 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5833 return (struct isl_basic_set *)
5834 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5837 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5844 for (i = 0; i < map->n; ++i) {
5845 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5856 /* Look for a div in dst that corresponds to the div "div" in src.
5857 * The divs before "div" in src and dst are assumed to be the same.
5859 * Returns -1 if no corresponding div was found and the position
5860 * of the corresponding div in dst otherwise.
5862 static int find_div(struct isl_basic_map *dst,
5863 struct isl_basic_map *src, unsigned div)
5867 unsigned total = isl_dim_total(src->dim);
5869 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5870 for (i = div; i < dst->n_div; ++i)
5871 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5872 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5873 dst->n_div - div) == -1)
5878 struct isl_basic_map *isl_basic_map_align_divs(
5879 struct isl_basic_map *dst, struct isl_basic_map *src)
5882 unsigned total = isl_dim_total(src->dim);
5887 if (src->n_div == 0)
5890 for (i = 0; i < src->n_div; ++i)
5891 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5893 src = isl_basic_map_order_divs(src);
5894 dst = isl_basic_map_cow(dst);
5895 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5896 src->n_div, 0, 2 * src->n_div);
5899 for (i = 0; i < src->n_div; ++i) {
5900 int j = find_div(dst, src, i);
5902 j = isl_basic_map_alloc_div(dst);
5905 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5906 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5907 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5911 isl_basic_map_swap_div(dst, i, j);
5915 isl_basic_map_free(dst);
5919 struct isl_basic_set *isl_basic_set_align_divs(
5920 struct isl_basic_set *dst, struct isl_basic_set *src)
5922 return (struct isl_basic_set *)isl_basic_map_align_divs(
5923 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5926 struct isl_map *isl_map_align_divs(struct isl_map *map)
5934 map = isl_map_compute_divs(map);
5935 map = isl_map_cow(map);
5939 for (i = 1; i < map->n; ++i)
5940 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5941 for (i = 1; i < map->n; ++i)
5942 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5944 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5948 struct isl_set *isl_set_align_divs(struct isl_set *set)
5950 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5953 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5957 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5958 map = isl_map_intersect_domain(map, set);
5959 set = isl_map_range(map);
5967 /* There is no need to cow as removing empty parts doesn't change
5968 * the meaning of the set.
5970 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5977 for (i = map->n-1; i >= 0; --i) {
5978 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5980 isl_basic_map_free(map->p[i]);
5981 if (i != map->n-1) {
5982 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5983 map->p[i] = map->p[map->n-1];
5991 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5993 return (struct isl_set *)
5994 isl_map_remove_empty_parts((struct isl_map *)set);
5997 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5999 struct isl_basic_map *bmap;
6000 if (!map || map->n == 0)
6002 bmap = map->p[map->n-1];
6003 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6004 return isl_basic_map_copy(bmap);
6007 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6009 return (struct isl_basic_set *)
6010 isl_map_copy_basic_map((struct isl_map *)set);
6013 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6014 __isl_keep isl_basic_map *bmap)
6020 for (i = map->n-1; i >= 0; --i) {
6021 if (map->p[i] != bmap)
6023 map = isl_map_cow(map);
6026 isl_basic_map_free(map->p[i]);
6027 if (i != map->n-1) {
6028 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6029 map->p[i] = map->p[map->n-1];
6040 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6041 struct isl_basic_set *bset)
6043 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6044 (struct isl_basic_map *)bset);
6047 /* Given two basic sets bset1 and bset2, compute the maximal difference
6048 * between the values of dimension pos in bset1 and those in bset2
6049 * for any common value of the parameters and dimensions preceding pos.
6051 static enum isl_lp_result basic_set_maximal_difference_at(
6052 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6053 int pos, isl_int *opt)
6055 struct isl_dim *dims;
6056 struct isl_basic_map *bmap1 = NULL;
6057 struct isl_basic_map *bmap2 = NULL;
6058 struct isl_ctx *ctx;
6059 struct isl_vec *obj;
6062 unsigned dim1, dim2;
6063 enum isl_lp_result res;
6065 if (!bset1 || !bset2)
6066 return isl_lp_error;
6068 nparam = isl_basic_set_n_param(bset1);
6069 dim1 = isl_basic_set_n_dim(bset1);
6070 dim2 = isl_basic_set_n_dim(bset2);
6071 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6072 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6073 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6074 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6075 if (!bmap1 || !bmap2)
6077 bmap1 = isl_basic_map_cow(bmap1);
6078 bmap1 = isl_basic_map_extend(bmap1, nparam,
6079 pos, (dim1 - pos) + (dim2 - pos),
6080 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6081 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6084 total = isl_basic_map_total_dim(bmap1);
6086 obj = isl_vec_alloc(ctx, 1 + total);
6087 isl_seq_clr(obj->block.data, 1 + total);
6088 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6089 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6092 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6094 isl_basic_map_free(bmap1);
6098 isl_basic_map_free(bmap1);
6099 isl_basic_map_free(bmap2);
6100 return isl_lp_error;
6103 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6104 * for any common value of the parameters and dimensions preceding pos
6105 * in both basic sets, the values of dimension pos in bset1 are
6106 * smaller or larger than those in bset2.
6109 * 1 if bset1 follows bset2
6110 * -1 if bset1 precedes bset2
6111 * 0 if bset1 and bset2 are incomparable
6112 * -2 if some error occurred.
6114 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6115 struct isl_basic_set *bset2, int pos)
6118 enum isl_lp_result res;
6123 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6125 if (res == isl_lp_empty)
6127 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6128 res == isl_lp_unbounded)
6130 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6139 /* Given two basic sets bset1 and bset2, check whether
6140 * for any common value of the parameters and dimensions preceding pos
6141 * there is a value of dimension pos in bset1 that is larger
6142 * than a value of the same dimension in bset2.
6145 * 1 if there exists such a pair
6146 * 0 if there is no such pair, but there is a pair of equal values
6148 * -2 if some error occurred.
6150 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6151 __isl_keep isl_basic_set *bset2, int pos)
6154 enum isl_lp_result res;
6159 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6161 if (res == isl_lp_empty)
6163 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6164 res == isl_lp_unbounded)
6166 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6168 else if (res == isl_lp_ok)
6177 /* Given two sets set1 and set2, check whether
6178 * for any common value of the parameters and dimensions preceding pos
6179 * there is a value of dimension pos in set1 that is larger
6180 * than a value of the same dimension in set2.
6183 * 1 if there exists such a pair
6184 * 0 if there is no such pair, but there is a pair of equal values
6186 * -2 if some error occurred.
6188 int isl_set_follows_at(__isl_keep isl_set *set1,
6189 __isl_keep isl_set *set2, int pos)
6197 for (i = 0; i < set1->n; ++i)
6198 for (j = 0; j < set2->n; ++j) {
6200 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6201 if (f == 1 || f == -2)
6210 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6211 unsigned pos, isl_int *val)
6219 total = isl_basic_map_total_dim(bmap);
6220 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6221 for (; d+1 > pos; --d)
6222 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6226 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6228 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6230 if (!isl_int_is_one(bmap->eq[i][1+d]))
6233 isl_int_neg(*val, bmap->eq[i][0]);
6239 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6240 unsigned pos, isl_int *val)
6252 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6255 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6256 for (i = 1; fixed == 1 && i < map->n; ++i) {
6257 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6258 if (fixed == 1 && isl_int_ne(tmp, v))
6262 isl_int_set(*val, v);
6268 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6269 unsigned pos, isl_int *val)
6271 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6275 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6278 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6281 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6282 enum isl_dim_type type, unsigned pos, isl_int *val)
6284 if (pos >= isl_basic_map_dim(bmap, type))
6286 return isl_basic_map_fast_has_fixed_var(bmap,
6287 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6290 int isl_map_fast_is_fixed(struct isl_map *map,
6291 enum isl_dim_type type, unsigned pos, isl_int *val)
6293 if (pos >= isl_map_dim(map, type))
6295 return isl_map_fast_has_fixed_var(map,
6296 map_offset(map, type) - 1 + pos, val);
6299 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6300 * then return this fixed value in *val.
6302 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6305 return isl_basic_set_fast_has_fixed_var(bset,
6306 isl_basic_set_n_param(bset) + dim, val);
6309 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6310 * then return this fixed value in *val.
6312 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6314 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6317 /* Check if input variable in has fixed value and if so and if val is not NULL,
6318 * then return this fixed value in *val.
6320 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6322 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6325 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6326 * and if val is not NULL, then return this lower bound in *val.
6328 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6329 unsigned dim, isl_int *val)
6331 int i, i_eq = -1, i_ineq = -1;
6338 total = isl_basic_set_total_dim(bset);
6339 nparam = isl_basic_set_n_param(bset);
6340 for (i = 0; i < bset->n_eq; ++i) {
6341 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6347 for (i = 0; i < bset->n_ineq; ++i) {
6348 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6350 if (i_eq != -1 || i_ineq != -1)
6354 if (i_eq == -1 && i_ineq == -1)
6356 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6357 /* The coefficient should always be one due to normalization. */
6358 if (!isl_int_is_one(c[1+nparam+dim]))
6360 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6362 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6363 total - nparam - dim - 1) != -1)
6366 isl_int_neg(*val, c[0]);
6370 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6371 unsigned dim, isl_int *val)
6383 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6387 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6389 for (i = 1; fixed == 1 && i < set->n; ++i) {
6390 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6392 if (fixed == 1 && isl_int_ne(tmp, v))
6396 isl_int_set(*val, v);
6407 static int qsort_constraint_cmp(const void *p1, const void *p2)
6409 const struct constraint *c1 = (const struct constraint *)p1;
6410 const struct constraint *c2 = (const struct constraint *)p2;
6411 unsigned size = isl_min(c1->size, c2->size);
6412 return isl_seq_cmp(c1->c, c2->c, size);
6415 static struct isl_basic_map *isl_basic_map_sort_constraints(
6416 struct isl_basic_map *bmap)
6419 struct constraint *c;
6424 total = isl_basic_map_total_dim(bmap);
6425 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6428 for (i = 0; i < bmap->n_ineq; ++i) {
6430 c[i].c = bmap->ineq[i];
6432 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6433 for (i = 0; i < bmap->n_ineq; ++i)
6434 bmap->ineq[i] = c[i].c;
6438 isl_basic_map_free(bmap);
6442 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6443 __isl_take isl_basic_set *bset)
6445 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6446 (struct isl_basic_map *)bset);
6449 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6453 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6455 bmap = isl_basic_map_remove_redundancies(bmap);
6456 bmap = isl_basic_map_sort_constraints(bmap);
6457 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6461 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6463 return (struct isl_basic_set *)isl_basic_map_normalize(
6464 (struct isl_basic_map *)bset);
6467 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6468 const __isl_keep isl_basic_map *bmap2)
6475 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6476 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6477 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6478 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6479 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6480 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6481 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6482 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6484 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6486 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6488 if (bmap1->n_eq != bmap2->n_eq)
6489 return bmap1->n_eq - bmap2->n_eq;
6490 if (bmap1->n_ineq != bmap2->n_ineq)
6491 return bmap1->n_ineq - bmap2->n_ineq;
6492 if (bmap1->n_div != bmap2->n_div)
6493 return bmap1->n_div - bmap2->n_div;
6494 total = isl_basic_map_total_dim(bmap1);
6495 for (i = 0; i < bmap1->n_eq; ++i) {
6496 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6500 for (i = 0; i < bmap1->n_ineq; ++i) {
6501 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6505 for (i = 0; i < bmap1->n_div; ++i) {
6506 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6513 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6514 __isl_keep isl_basic_map *bmap2)
6516 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6519 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6520 __isl_keep isl_basic_set *bset2)
6522 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6523 (isl_basic_map *)bset2);
6526 static int qsort_bmap_cmp(const void *p1, const void *p2)
6528 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6529 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6531 return isl_basic_map_fast_cmp(bmap1, bmap2);
6534 /* We normalize in place, but if anything goes wrong we need
6535 * to return NULL, so we need to make sure we don't change the
6536 * meaning of any possible other copies of map.
6538 struct isl_map *isl_map_normalize(struct isl_map *map)
6541 struct isl_basic_map *bmap;
6545 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6547 for (i = 0; i < map->n; ++i) {
6548 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6551 isl_basic_map_free(map->p[i]);
6554 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6555 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6556 map = isl_map_remove_empty_parts(map);
6559 for (i = map->n - 1; i >= 1; --i) {
6560 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6562 isl_basic_map_free(map->p[i-1]);
6563 for (j = i; j < map->n; ++j)
6564 map->p[j-1] = map->p[j];
6574 struct isl_set *isl_set_normalize(struct isl_set *set)
6576 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6579 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6589 if (!isl_dim_equal(map1->dim, map2->dim))
6592 map1 = isl_map_copy(map1);
6593 map2 = isl_map_copy(map2);
6594 map1 = isl_map_normalize(map1);
6595 map2 = isl_map_normalize(map2);
6598 equal = map1->n == map2->n;
6599 for (i = 0; equal && i < map1->n; ++i) {
6600 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6613 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6615 return isl_map_fast_is_equal((struct isl_map *)set1,
6616 (struct isl_map *)set2);
6619 /* Return an interval that ranges from min to max (inclusive)
6621 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6622 isl_int min, isl_int max)
6625 struct isl_basic_set *bset = NULL;
6627 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6631 k = isl_basic_set_alloc_inequality(bset);
6634 isl_int_set_si(bset->ineq[k][1], 1);
6635 isl_int_neg(bset->ineq[k][0], min);
6637 k = isl_basic_set_alloc_inequality(bset);
6640 isl_int_set_si(bset->ineq[k][1], -1);
6641 isl_int_set(bset->ineq[k][0], max);
6645 isl_basic_set_free(bset);
6649 /* Return the Cartesian product of the basic sets in list (in the given order).
6651 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6659 struct isl_basic_set *product = NULL;
6663 isl_assert(list->ctx, list->n > 0, goto error);
6664 isl_assert(list->ctx, list->p[0], goto error);
6665 nparam = isl_basic_set_n_param(list->p[0]);
6666 dim = isl_basic_set_n_dim(list->p[0]);
6667 extra = list->p[0]->n_div;
6668 n_eq = list->p[0]->n_eq;
6669 n_ineq = list->p[0]->n_ineq;
6670 for (i = 1; i < list->n; ++i) {
6671 isl_assert(list->ctx, list->p[i], goto error);
6672 isl_assert(list->ctx,
6673 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6674 dim += isl_basic_set_n_dim(list->p[i]);
6675 extra += list->p[i]->n_div;
6676 n_eq += list->p[i]->n_eq;
6677 n_ineq += list->p[i]->n_ineq;
6679 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6684 for (i = 0; i < list->n; ++i) {
6685 isl_basic_set_add_constraints(product,
6686 isl_basic_set_copy(list->p[i]), dim);
6687 dim += isl_basic_set_n_dim(list->p[i]);
6689 isl_basic_set_list_free(list);
6692 isl_basic_set_free(product);
6693 isl_basic_set_list_free(list);
6697 struct isl_basic_map *isl_basic_map_product(
6698 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6700 struct isl_dim *dim_result = NULL;
6701 struct isl_basic_map *bmap;
6702 unsigned in1, in2, out1, out2, nparam, total, pos;
6703 struct isl_dim_map *dim_map1, *dim_map2;
6705 if (!bmap1 || !bmap2)
6708 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6709 bmap2->dim, isl_dim_param), goto error);
6710 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6711 isl_dim_copy(bmap2->dim));
6713 in1 = isl_basic_map_n_in(bmap1);
6714 in2 = isl_basic_map_n_in(bmap2);
6715 out1 = isl_basic_map_n_out(bmap1);
6716 out2 = isl_basic_map_n_out(bmap2);
6717 nparam = isl_basic_map_n_param(bmap1);
6719 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6720 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6721 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6722 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6723 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6724 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6725 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6726 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6727 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6728 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6729 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6731 bmap = isl_basic_map_alloc_dim(dim_result,
6732 bmap1->n_div + bmap2->n_div,
6733 bmap1->n_eq + bmap2->n_eq,
6734 bmap1->n_ineq + bmap2->n_ineq);
6735 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6736 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6737 bmap = isl_basic_map_simplify(bmap);
6738 return isl_basic_map_finalize(bmap);
6740 isl_basic_map_free(bmap1);
6741 isl_basic_map_free(bmap2);
6745 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6747 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6750 struct isl_map *result;
6756 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6757 map2->dim, isl_dim_param), goto error);
6759 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6760 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6761 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6763 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6764 isl_dim_copy(map2->dim)),
6765 map1->n * map2->n, flags);
6768 for (i = 0; i < map1->n; ++i)
6769 for (j = 0; j < map2->n; ++j) {
6770 struct isl_basic_map *part;
6771 part = isl_basic_map_product(
6772 isl_basic_map_copy(map1->p[i]),
6773 isl_basic_map_copy(map2->p[j]));
6774 if (isl_basic_map_is_empty(part))
6775 isl_basic_map_free(part);
6777 result = isl_map_add_basic_map(result, part);
6790 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6792 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
6793 __isl_take isl_map *map2)
6797 prod = isl_map_product(map1, map2);
6798 prod = isl_map_flatten(prod);
6802 /* Given two set A and B, construct its Cartesian product A x B.
6804 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6806 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6807 (struct isl_map *)set2);
6810 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
6811 __isl_take isl_set *set2)
6813 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
6816 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6819 uint32_t hash = isl_hash_init();
6824 bset = isl_basic_set_copy(bset);
6825 bset = isl_basic_set_normalize(bset);
6828 total = isl_basic_set_total_dim(bset);
6829 isl_hash_byte(hash, bset->n_eq & 0xFF);
6830 for (i = 0; i < bset->n_eq; ++i) {
6832 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6833 isl_hash_hash(hash, c_hash);
6835 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6836 for (i = 0; i < bset->n_ineq; ++i) {
6838 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6839 isl_hash_hash(hash, c_hash);
6841 isl_hash_byte(hash, bset->n_div & 0xFF);
6842 for (i = 0; i < bset->n_div; ++i) {
6844 if (isl_int_is_zero(bset->div[i][0]))
6846 isl_hash_byte(hash, i & 0xFF);
6847 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6848 isl_hash_hash(hash, c_hash);
6850 isl_basic_set_free(bset);
6854 uint32_t isl_set_get_hash(struct isl_set *set)
6861 set = isl_set_copy(set);
6862 set = isl_set_normalize(set);
6866 hash = isl_hash_init();
6867 for (i = 0; i < set->n; ++i) {
6869 bset_hash = isl_basic_set_get_hash(set->p[i]);
6870 isl_hash_hash(hash, bset_hash);
6878 /* Check if the value for dimension dim is completely determined
6879 * by the values of the other parameters and variables.
6880 * That is, check if dimension dim is involved in an equality.
6882 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6889 nparam = isl_basic_set_n_param(bset);
6890 for (i = 0; i < bset->n_eq; ++i)
6891 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6896 /* Check if the value for dimension dim is completely determined
6897 * by the values of the other parameters and variables.
6898 * That is, check if dimension dim is involved in an equality
6899 * for each of the subsets.
6901 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6907 for (i = 0; i < set->n; ++i) {
6909 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6916 int isl_set_n_basic_set(__isl_keep isl_set *set)
6918 return set ? set->n : 0;
6921 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6922 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6929 for (i = 0; i < map->n; ++i)
6930 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6936 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6937 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6944 for (i = 0; i < set->n; ++i)
6945 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6951 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6953 struct isl_dim *dim;
6958 if (bset->n_div == 0)
6961 bset = isl_basic_set_cow(bset);
6965 dim = isl_basic_set_get_dim(bset);
6966 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6969 isl_dim_free(bset->dim);
6973 bset = isl_basic_set_finalize(bset);
6977 isl_basic_set_free(bset);
6981 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6984 struct isl_dim *dim;
6987 set = isl_set_align_divs(set);
6991 if (set->n == 0 || set->p[0]->n_div == 0)
6994 set = isl_set_cow(set);
6998 n_div = set->p[0]->n_div;
6999 dim = isl_set_get_dim(set);
7000 dim = isl_dim_add(dim, isl_dim_set, n_div);
7003 isl_dim_free(set->dim);
7006 for (i = 0; i < set->n; ++i) {
7007 set->p[i] = isl_basic_set_lift(set->p[i]);
7018 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7020 struct isl_dim *dim;
7021 struct isl_basic_map *bmap;
7028 set = isl_set_align_divs(set);
7033 dim = isl_set_get_dim(set);
7034 if (set->n == 0 || set->p[0]->n_div == 0) {
7036 return isl_map_identity(dim);
7039 n_div = set->p[0]->n_div;
7040 dim = isl_dim_map(dim);
7041 n_param = isl_dim_size(dim, isl_dim_param);
7042 n_set = isl_dim_size(dim, isl_dim_in);
7043 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7044 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7045 for (i = 0; i < n_set; ++i)
7046 bmap = var_equal(bmap, i);
7048 total = n_param + n_set + n_set + n_div;
7049 for (i = 0; i < n_div; ++i) {
7050 k = isl_basic_map_alloc_inequality(bmap);
7053 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7054 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7055 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7056 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7057 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7058 set->p[0]->div[i][0]);
7060 l = isl_basic_map_alloc_inequality(bmap);
7063 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7064 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7065 set->p[0]->div[i][0]);
7066 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7070 return isl_map_from_basic_map(bmap);
7073 isl_basic_map_free(bmap);
7077 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7085 dim = isl_basic_set_total_dim(bset);
7086 size += bset->n_eq * (1 + dim);
7087 size += bset->n_ineq * (1 + dim);
7088 size += bset->n_div * (2 + dim);
7093 int isl_set_size(__isl_keep isl_set *set)
7101 for (i = 0; i < set->n; ++i)
7102 size += isl_basic_set_size(set->p[i]);
7107 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7108 enum isl_dim_type type, unsigned pos)
7116 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7118 pos += isl_basic_map_offset(bmap, type);
7120 for (i = 0; i < bmap->n_eq; ++i)
7121 if (!isl_int_is_zero(bmap->eq[i][pos]))
7125 for (i = 0; i < bmap->n_ineq; ++i) {
7126 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7133 return lower && upper;
7136 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7137 enum isl_dim_type type, unsigned pos)
7144 for (i = 0; i < map->n; ++i) {
7146 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7147 if (bounded < 0 || !bounded)
7154 /* Return 1 if the specified dim is involved in both an upper bound
7155 * and a lower bound.
7157 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7158 enum isl_dim_type type, unsigned pos)
7160 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7163 /* For each of the "n" variables starting at "first", determine
7164 * the sign of the variable and put the results in the first "n"
7165 * elements of the array "signs".
7167 * 1 means that the variable is non-negative
7168 * -1 means that the variable is non-positive
7169 * 0 means the variable attains both positive and negative values.
7171 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7172 unsigned first, unsigned n, int *signs)
7174 isl_vec *bound = NULL;
7175 struct isl_tab *tab = NULL;
7176 struct isl_tab_undo *snap;
7179 if (!bset || !signs)
7182 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7183 tab = isl_tab_from_basic_set(bset);
7187 isl_seq_clr(bound->el, bound->size);
7188 isl_int_set_si(bound->el[0], -1);
7190 snap = isl_tab_snap(tab);
7191 for (i = 0; i < n; ++i) {
7194 isl_int_set_si(bound->el[1 + first + i], -1);
7195 if (isl_tab_add_ineq(tab, bound->el) < 0)
7198 isl_int_set_si(bound->el[1 + first + i], 0);
7199 if (isl_tab_rollback(tab, snap) < 0)
7207 isl_int_set_si(bound->el[1 + first + i], 1);
7208 if (isl_tab_add_ineq(tab, bound->el) < 0)
7211 isl_int_set_si(bound->el[1 + first + i], 0);
7212 if (isl_tab_rollback(tab, snap) < 0)
7215 signs[i] = empty ? -1 : 0;
7219 isl_vec_free(bound);
7223 isl_vec_free(bound);
7227 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7228 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7230 if (!bset || !signs)
7232 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7235 first += pos(bset->dim, type) - 1;
7236 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7239 /* Check if the given map is single-valued.
7244 * and check if the result is a subset of the identity mapping.
7246 int isl_map_is_single_valued(__isl_keep isl_map *map)
7252 test = isl_map_reverse(isl_map_copy(map));
7253 test = isl_map_apply_range(test, isl_map_copy(map));
7255 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7257 sv = isl_map_is_subset(test, id);
7265 int isl_map_is_bijective(__isl_keep isl_map *map)
7269 sv = isl_map_is_single_valued(map);
7273 map = isl_map_copy(map);
7274 map = isl_map_reverse(map);
7275 sv = isl_map_is_single_valued(map);
7281 int isl_set_is_singleton(__isl_keep isl_set *set)
7283 return isl_map_is_single_valued((isl_map *)set);
7286 int isl_map_is_translation(__isl_keep isl_map *map)
7291 delta = isl_map_deltas(isl_map_copy(map));
7292 ok = isl_set_is_singleton(delta);
7293 isl_set_free(delta);
7298 static int unique(isl_int *p, unsigned pos, unsigned len)
7300 if (isl_seq_first_non_zero(p, pos) != -1)
7302 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7307 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7316 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7319 nvar = isl_basic_set_dim(bset, isl_dim_set);
7320 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7321 for (j = 0; j < nvar; ++j) {
7322 int lower = 0, upper = 0;
7323 for (i = 0; i < bset->n_eq; ++i) {
7324 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7326 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7332 for (i = 0; i < bset->n_ineq; ++i) {
7333 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7335 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7337 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7342 if (!lower || !upper)
7349 int isl_set_is_box(__isl_keep isl_set *set)
7356 return isl_basic_set_is_box(set->p[0]);
7359 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7364 return isl_dim_is_wrapping(bset->dim);
7367 int isl_set_is_wrapping(__isl_keep isl_set *set)
7372 return isl_dim_is_wrapping(set->dim);
7375 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7377 bmap = isl_basic_map_cow(bmap);
7381 bmap->dim = isl_dim_wrap(bmap->dim);
7385 bmap = isl_basic_map_finalize(bmap);
7387 return (isl_basic_set *)bmap;
7389 isl_basic_map_free(bmap);
7393 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7397 map = isl_map_cow(map);
7401 for (i = 0; i < map->n; ++i) {
7402 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7406 map->dim = isl_dim_wrap(map->dim);
7410 return (isl_set *)map;
7416 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7418 bset = isl_basic_set_cow(bset);
7422 bset->dim = isl_dim_unwrap(bset->dim);
7426 bset = isl_basic_set_finalize(bset);
7428 return (isl_basic_map *)bset;
7430 isl_basic_set_free(bset);
7434 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7441 if (!isl_set_is_wrapping(set))
7442 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7445 set = isl_set_cow(set);
7449 for (i = 0; i < set->n; ++i) {
7450 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7455 set->dim = isl_dim_unwrap(set->dim);
7459 return (isl_map *)set;
7465 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7466 enum isl_dim_type type)
7471 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7474 bmap = isl_basic_map_cow(bmap);
7478 bmap->dim = isl_dim_reset(bmap->dim, type);
7482 bmap = isl_basic_map_finalize(bmap);
7486 isl_basic_map_free(bmap);
7490 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7491 enum isl_dim_type type)
7498 if (!isl_dim_is_named_or_nested(map->dim, type))
7501 map = isl_map_cow(map);
7505 for (i = 0; i < map->n; ++i) {
7506 map->p[i] = isl_basic_map_reset(map->p[i], type);
7510 map->dim = isl_dim_reset(map->dim, type);
7520 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7525 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7528 bmap = isl_basic_map_cow(bmap);
7532 bmap->dim = isl_dim_flatten(bmap->dim);
7536 bmap = isl_basic_map_finalize(bmap);
7540 isl_basic_map_free(bmap);
7544 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7551 if (!map->dim->nested[0] && !map->dim->nested[1])
7554 map = isl_map_cow(map);
7558 for (i = 0; i < map->n; ++i) {
7559 map->p[i] = isl_basic_map_flatten(map->p[i]);
7563 map->dim = isl_dim_flatten(map->dim);
7573 /* Extend the given dim_map with mappings for the divs in bmap.
7575 static __isl_give struct isl_dim_map *extend_dim_map(
7576 __isl_keep struct isl_dim_map *dim_map,
7577 __isl_keep isl_basic_map *bmap)
7580 struct isl_dim_map *res;
7583 offset = isl_basic_map_offset(bmap, isl_dim_div);
7585 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
7589 for (i = 0; i < dim_map->len; ++i)
7590 res->pos[i] = dim_map->pos[i];
7591 for (i = 0; i < bmap->n_div; ++i)
7592 res->pos[dim_map->len + i] = offset + i;
7597 /* Extract a dim_map from a reordering.
7598 * We essentially need to reverse the mapping, and add an offset
7599 * of 1 for the constant term.
7601 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
7602 __isl_keep isl_reordering *exp)
7605 struct isl_dim_map *dim_map;
7610 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
7614 for (i = 0; i < exp->len; ++i)
7615 dim_map->pos[1 + exp->pos[i]] = 1 + i;
7620 /* Reorder the dimensions of "bmap" according to the given dim_map
7621 * and set the dimension specification to "dim".
7623 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
7624 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
7628 bmap = isl_basic_map_cow(bmap);
7629 if (!bmap || !dim || !dim_map)
7632 res = isl_basic_map_alloc_dim(dim,
7633 bmap->n_div, bmap->n_eq, bmap->n_ineq);
7634 res = add_constraints_dim_map(res, bmap, dim_map);
7635 res = isl_basic_map_finalize(res);
7639 isl_basic_map_free(bmap);
7644 /* Reorder the dimensions of "map" according to given reordering.
7646 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
7647 __isl_take isl_reordering *r)
7650 struct isl_dim_map *dim_map;
7652 map = isl_map_cow(map);
7653 dim_map = isl_dim_map_from_reordering(r);
7654 if (!map || !r || !dim_map)
7657 for (i = 0; i < map->n; ++i) {
7658 struct isl_dim_map *dim_map_i;
7660 dim_map_i = extend_dim_map(dim_map, map->p[i]);
7662 map->p[i] = isl_basic_map_realign(map->p[i],
7663 isl_dim_copy(r->dim), dim_map_i);
7669 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
7671 isl_reordering_free(r);
7677 isl_reordering_free(r);
7681 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
7682 __isl_take isl_reordering *r)
7684 return (isl_set *)isl_map_realign((isl_map *)set, r);
7687 __isl_give isl_mat *isl_basic_map_equalities_matrix(
7688 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7689 enum isl_dim_type c2, enum isl_dim_type c3,
7690 enum isl_dim_type c4, enum isl_dim_type c5)
7692 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7693 struct isl_mat *mat;
7699 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
7700 isl_basic_map_total_dim(bmap) + 1);
7703 for (i = 0; i < bmap->n_eq; ++i)
7704 for (j = 0, pos = 0; j < 5; ++j) {
7705 int off = isl_basic_map_offset(bmap, c[j]);
7706 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7707 isl_int_set(mat->row[i][pos],
7708 bmap->eq[i][off + k]);
7716 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
7717 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7718 enum isl_dim_type c2, enum isl_dim_type c3,
7719 enum isl_dim_type c4, enum isl_dim_type c5)
7721 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7722 struct isl_mat *mat;
7728 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
7729 isl_basic_map_total_dim(bmap) + 1);
7732 for (i = 0; i < bmap->n_ineq; ++i)
7733 for (j = 0, pos = 0; j < 5; ++j) {
7734 int off = isl_basic_map_offset(bmap, c[j]);
7735 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7736 isl_int_set(mat->row[i][pos],
7737 bmap->ineq[i][off + k]);
7745 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
7746 __isl_take isl_dim *dim,
7747 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7748 enum isl_dim_type c2, enum isl_dim_type c3,
7749 enum isl_dim_type c4, enum isl_dim_type c5)
7751 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7752 isl_basic_map *bmap;
7758 if (!dim || !eq || !ineq)
7761 if (eq->n_col != ineq->n_col)
7762 isl_die(dim->ctx, isl_error_invalid,
7763 "equalities and inequalities matrices should have "
7764 "same number of columns", goto error);
7766 total = 1 + isl_dim_total(dim);
7768 if (eq->n_col < total)
7769 isl_die(dim->ctx, isl_error_invalid,
7770 "number of columns too small", goto error);
7772 extra = eq->n_col - total;
7774 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
7775 eq->n_row, ineq->n_row);
7778 for (i = 0; i < extra; ++i)
7779 if (isl_basic_map_alloc_div(bmap) < 0)
7781 for (i = 0; i < eq->n_row; ++i) {
7782 l = isl_basic_map_alloc_equality(bmap);
7785 for (j = 0, pos = 0; j < 5; ++j) {
7786 int off = isl_basic_map_offset(bmap, c[j]);
7787 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7788 isl_int_set(bmap->eq[l][off + k],
7794 for (i = 0; i < ineq->n_row; ++i) {
7795 l = isl_basic_map_alloc_inequality(bmap);
7798 for (j = 0, pos = 0; j < 5; ++j) {
7799 int off = isl_basic_map_offset(bmap, c[j]);
7800 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7801 isl_int_set(bmap->ineq[l][off + k],
7820 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
7821 __isl_take isl_dim *dim,
7822 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7823 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
7825 return (isl_basic_set*)
7826 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
7827 c1, c2, c3, c4, isl_dim_in);