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 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
381 __isl_take isl_basic_map *bmap,
382 enum isl_dim_type type, unsigned pos, const char *s)
386 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
391 isl_basic_map_free(bmap);
395 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
396 enum isl_dim_type type, unsigned pos, const char *s)
403 map->dim = isl_dim_set_name(map->dim, type, pos, s);
407 for (i = 0; i < map->n; ++i) {
408 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
419 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
420 __isl_take isl_basic_set *bset,
421 enum isl_dim_type type, unsigned pos, const char *s)
423 return (isl_basic_set *)isl_basic_map_set_dim_name(
424 (isl_basic_map *)bset, type, pos, s);
427 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
428 enum isl_dim_type type, unsigned pos, const char *s)
430 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
433 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
437 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
440 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
441 struct isl_basic_map *bmap, unsigned extra,
442 unsigned n_eq, unsigned n_ineq)
445 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
450 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
451 if (isl_blk_is_error(bmap->block))
454 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
459 bmap->block2 = isl_blk_empty();
462 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
463 if (isl_blk_is_error(bmap->block2))
466 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
471 for (i = 0; i < n_ineq + n_eq; ++i)
472 bmap->ineq[i] = bmap->block.data + i * row_size;
474 for (i = 0; i < extra; ++i)
475 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
479 bmap->c_size = n_eq + n_ineq;
480 bmap->eq = bmap->ineq + n_ineq;
489 isl_basic_map_free(bmap);
493 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
494 unsigned nparam, unsigned dim, unsigned extra,
495 unsigned n_eq, unsigned n_ineq)
497 struct isl_basic_map *bmap;
498 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
499 return (struct isl_basic_set *)bmap;
502 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
503 unsigned extra, unsigned n_eq, unsigned n_ineq)
505 struct isl_basic_map *bmap;
508 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
509 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
510 return (struct isl_basic_set *)bmap;
513 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
514 unsigned extra, unsigned n_eq, unsigned n_ineq)
516 struct isl_basic_map *bmap;
520 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
525 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
531 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
532 unsigned nparam, unsigned in, unsigned out, unsigned extra,
533 unsigned n_eq, unsigned n_ineq)
535 struct isl_basic_map *bmap;
538 dim = isl_dim_alloc(ctx, nparam, in, out);
542 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
546 static void dup_constraints(
547 struct isl_basic_map *dst, struct isl_basic_map *src)
550 unsigned total = isl_basic_map_total_dim(src);
552 for (i = 0; i < src->n_eq; ++i) {
553 int j = isl_basic_map_alloc_equality(dst);
554 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
557 for (i = 0; i < src->n_ineq; ++i) {
558 int j = isl_basic_map_alloc_inequality(dst);
559 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
562 for (i = 0; i < src->n_div; ++i) {
563 int j = isl_basic_map_alloc_div(dst);
564 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
566 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
569 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
571 struct isl_basic_map *dup;
575 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
576 bmap->n_div, bmap->n_eq, bmap->n_ineq);
579 dup_constraints(dup, bmap);
580 dup->flags = bmap->flags;
581 dup->sample = isl_vec_copy(bmap->sample);
585 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
587 struct isl_basic_map *dup;
589 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
590 return (struct isl_basic_set *)dup;
593 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
598 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
602 return isl_basic_set_dup(bset);
605 struct isl_set *isl_set_copy(struct isl_set *set)
614 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
619 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
623 bmap = isl_basic_map_dup(bmap);
625 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
629 struct isl_map *isl_map_copy(struct isl_map *map)
638 void isl_basic_map_free(struct isl_basic_map *bmap)
646 isl_ctx_deref(bmap->ctx);
648 isl_blk_free(bmap->ctx, bmap->block2);
650 isl_blk_free(bmap->ctx, bmap->block);
651 isl_vec_free(bmap->sample);
652 isl_dim_free(bmap->dim);
656 void isl_basic_set_free(struct isl_basic_set *bset)
658 isl_basic_map_free((struct isl_basic_map *)bset);
661 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
663 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
666 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
672 isl_assert(ctx, room_for_con(bmap, 1), return -1);
673 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
675 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
676 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
677 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
678 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
679 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
680 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
682 int j = isl_basic_map_alloc_inequality(bmap);
686 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
687 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
694 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
695 bmap->extra - bmap->n_div);
699 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
701 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
704 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
708 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
713 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
715 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
718 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
723 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
725 if (pos != bmap->n_eq - 1) {
727 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
728 bmap->eq[bmap->n_eq - 1] = t;
734 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
736 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
739 void isl_basic_map_inequality_to_equality(
740 struct isl_basic_map *bmap, unsigned pos)
745 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
746 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
751 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
752 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
753 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
754 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
757 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
759 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
762 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
768 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
769 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
770 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
771 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
772 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
773 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
774 1 + isl_basic_map_total_dim(bmap),
775 bmap->extra - bmap->n_div);
776 return bmap->n_ineq++;
779 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
781 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
784 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
788 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
793 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
795 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
798 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
803 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
805 if (pos != bmap->n_ineq - 1) {
807 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
808 bmap->ineq[bmap->n_ineq - 1] = t;
809 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
815 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
817 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
820 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
825 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
828 k = isl_basic_map_alloc_equality(bmap);
831 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
834 isl_basic_map_free(bmap);
838 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
841 return (isl_basic_set *)
842 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
845 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
850 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
853 k = isl_basic_map_alloc_inequality(bmap);
856 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
859 isl_basic_map_free(bmap);
863 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
866 return (isl_basic_set *)
867 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
870 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
874 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
875 isl_seq_clr(bmap->div[bmap->n_div] +
876 1 + 1 + isl_basic_map_total_dim(bmap),
877 bmap->extra - bmap->n_div);
878 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
879 return bmap->n_div++;
882 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
884 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
887 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
891 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
896 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
898 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
901 /* Copy constraint from src to dst, putting the vars of src at offset
902 * dim_off in dst and the divs of src at offset div_off in dst.
903 * If both sets are actually map, then dim_off applies to the input
906 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
907 struct isl_basic_map *src_map, isl_int *src,
908 unsigned in_off, unsigned out_off, unsigned div_off)
910 unsigned src_nparam = isl_basic_map_n_param(src_map);
911 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
912 unsigned src_in = isl_basic_map_n_in(src_map);
913 unsigned dst_in = isl_basic_map_n_in(dst_map);
914 unsigned src_out = isl_basic_map_n_out(src_map);
915 unsigned dst_out = isl_basic_map_n_out(dst_map);
916 isl_int_set(dst[0], src[0]);
917 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
918 if (dst_nparam > src_nparam)
919 isl_seq_clr(dst+1+src_nparam,
920 dst_nparam - src_nparam);
921 isl_seq_clr(dst+1+dst_nparam, in_off);
922 isl_seq_cpy(dst+1+dst_nparam+in_off,
924 isl_min(dst_in-in_off, src_in));
925 if (dst_in-in_off > src_in)
926 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
927 dst_in - in_off - src_in);
928 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
929 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
930 src+1+src_nparam+src_in,
931 isl_min(dst_out-out_off, src_out));
932 if (dst_out-out_off > src_out)
933 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
934 dst_out - out_off - src_out);
935 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
936 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
937 src+1+src_nparam+src_in+src_out,
938 isl_min(dst_map->extra-div_off, src_map->n_div));
939 if (dst_map->n_div-div_off > src_map->n_div)
940 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
941 div_off+src_map->n_div,
942 dst_map->n_div - div_off - src_map->n_div);
945 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
946 struct isl_basic_map *src_map, isl_int *src,
947 unsigned in_off, unsigned out_off, unsigned div_off)
949 isl_int_set(dst[0], src[0]);
950 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
953 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
954 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
959 if (!bmap1 || !bmap2)
962 div_off = bmap1->n_div;
964 for (i = 0; i < bmap2->n_eq; ++i) {
965 int i1 = isl_basic_map_alloc_equality(bmap1);
968 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
969 i_pos, o_pos, div_off);
972 for (i = 0; i < bmap2->n_ineq; ++i) {
973 int i1 = isl_basic_map_alloc_inequality(bmap1);
976 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
977 i_pos, o_pos, div_off);
980 for (i = 0; i < bmap2->n_div; ++i) {
981 int i1 = isl_basic_map_alloc_div(bmap1);
984 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
985 i_pos, o_pos, div_off);
988 isl_basic_map_free(bmap2);
993 isl_basic_map_free(bmap1);
994 isl_basic_map_free(bmap2);
998 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
999 struct isl_dim_map *dim_map)
1003 for (i = 0; i < dim_map->len; ++i) {
1004 if (dim_map->pos[i] < 0)
1005 isl_int_set_si(dst[i], 0);
1007 isl_int_set(dst[i], src[dim_map->pos[i]]);
1011 static void copy_div_dim_map(isl_int *dst, isl_int *src,
1012 struct isl_dim_map *dim_map)
1014 isl_int_set(dst[0], src[0]);
1015 copy_constraint_dim_map(dst+1, src+1, dim_map);
1018 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
1019 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1023 if (!src || !dst || !dim_map)
1026 for (i = 0; i < src->n_eq; ++i) {
1027 int i1 = isl_basic_map_alloc_equality(dst);
1030 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1033 for (i = 0; i < src->n_ineq; ++i) {
1034 int i1 = isl_basic_map_alloc_inequality(dst);
1037 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1040 for (i = 0; i < src->n_div; ++i) {
1041 int i1 = isl_basic_map_alloc_div(dst);
1044 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1048 isl_basic_map_free(src);
1053 isl_basic_map_free(src);
1054 isl_basic_map_free(dst);
1058 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1059 struct isl_basic_set *bset2, unsigned pos)
1061 return (struct isl_basic_set *)
1062 add_constraints((struct isl_basic_map *)bset1,
1063 (struct isl_basic_map *)bset2, 0, pos);
1066 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1067 struct isl_dim *dim, unsigned extra,
1068 unsigned n_eq, unsigned n_ineq)
1070 struct isl_basic_map *ext;
1080 dims_ok = isl_dim_equal(base->dim, dim) &&
1081 base->extra >= base->n_div + extra;
1083 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1084 room_for_ineq(base, n_ineq)) {
1089 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1090 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1091 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1092 extra += base->extra;
1094 n_ineq += base->n_ineq;
1096 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1102 ext->sample = isl_vec_copy(base->sample);
1103 flags = base->flags;
1104 ext = add_constraints(ext, base, 0, 0);
1107 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1114 isl_basic_map_free(base);
1118 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1119 struct isl_dim *dim, unsigned extra,
1120 unsigned n_eq, unsigned n_ineq)
1122 return (struct isl_basic_set *)
1123 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1124 extra, n_eq, n_ineq);
1127 struct isl_basic_map *isl_basic_map_extend_constraints(
1128 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1132 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1136 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1137 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1138 unsigned n_eq, unsigned n_ineq)
1140 struct isl_basic_map *bmap;
1141 struct isl_dim *dim;
1145 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1149 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1152 isl_basic_map_free(base);
1156 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1157 unsigned nparam, unsigned dim, unsigned extra,
1158 unsigned n_eq, unsigned n_ineq)
1160 return (struct isl_basic_set *)
1161 isl_basic_map_extend((struct isl_basic_map *)base,
1162 nparam, 0, dim, extra, n_eq, n_ineq);
1165 struct isl_basic_set *isl_basic_set_extend_constraints(
1166 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1168 return (struct isl_basic_set *)
1169 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1173 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1175 return (struct isl_basic_set *)
1176 isl_basic_map_cow((struct isl_basic_map *)bset);
1179 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1184 if (bmap->ref > 1) {
1186 bmap = isl_basic_map_dup(bmap);
1189 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1193 struct isl_set *isl_set_cow(struct isl_set *set)
1201 return isl_set_dup(set);
1204 struct isl_map *isl_map_cow(struct isl_map *map)
1212 return isl_map_dup(map);
1215 static void swap_vars(struct isl_blk blk, isl_int *a,
1216 unsigned a_len, unsigned b_len)
1218 isl_seq_cpy(blk.data, a+a_len, b_len);
1219 isl_seq_cpy(blk.data+b_len, a, a_len);
1220 isl_seq_cpy(a, blk.data, b_len+a_len);
1223 struct isl_basic_set *isl_basic_set_swap_vars(
1224 struct isl_basic_set *bset, unsigned n)
1234 nparam = isl_basic_set_n_param(bset);
1235 dim = isl_basic_set_n_dim(bset);
1236 isl_assert(bset->ctx, n <= dim, goto error);
1241 bset = isl_basic_set_cow(bset);
1245 blk = isl_blk_alloc(bset->ctx, dim);
1246 if (isl_blk_is_error(blk))
1249 for (i = 0; i < bset->n_eq; ++i)
1251 bset->eq[i]+1+nparam, n, dim - n);
1253 for (i = 0; i < bset->n_ineq; ++i)
1255 bset->ineq[i]+1+nparam, n, dim - n);
1257 for (i = 0; i < bset->n_div; ++i)
1259 bset->div[i]+1+1+nparam, n, dim - n);
1261 isl_blk_free(bset->ctx, blk);
1263 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1264 bset = isl_basic_set_gauss(bset, NULL);
1265 return isl_basic_set_finalize(bset);
1267 isl_basic_set_free(bset);
1271 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1274 set = isl_set_cow(set);
1278 for (i = 0; i < set->n; ++i) {
1279 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1285 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1289 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1295 total = isl_basic_map_total_dim(bmap);
1296 isl_basic_map_free_div(bmap, bmap->n_div);
1297 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1299 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1301 i = isl_basic_map_alloc_equality(bmap);
1305 isl_int_set_si(bmap->eq[i][0], 1);
1306 isl_seq_clr(bmap->eq[i]+1, total);
1307 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1308 isl_vec_free(bmap->sample);
1309 bmap->sample = NULL;
1310 return isl_basic_map_finalize(bmap);
1312 isl_basic_map_free(bmap);
1316 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1318 return (struct isl_basic_set *)
1319 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1322 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1325 unsigned off = isl_dim_total(bmap->dim);
1326 isl_int *t = bmap->div[a];
1327 bmap->div[a] = bmap->div[b];
1330 for (i = 0; i < bmap->n_eq; ++i)
1331 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1333 for (i = 0; i < bmap->n_ineq; ++i)
1334 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1336 for (i = 0; i < bmap->n_div; ++i)
1337 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1338 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1341 /* Eliminate the specified n dimensions starting at first from the
1342 * constraints using Fourier-Motzkin. The dimensions themselves
1345 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1346 enum isl_dim_type type, unsigned first, unsigned n)
1355 map = isl_map_cow(map);
1358 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1359 first += pos(map->dim, type) - 1;
1361 for (i = 0; i < map->n; ++i) {
1362 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1372 /* Eliminate the specified n dimensions starting at first from the
1373 * constraints using Fourier-Motzkin. The dimensions themselves
1376 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1377 enum isl_dim_type type, unsigned first, unsigned n)
1379 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1382 /* Eliminate the specified n dimensions starting at first from the
1383 * constraints using Fourier-Motzkin. The dimensions themselves
1386 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1387 unsigned first, unsigned n)
1389 return isl_set_eliminate(set, isl_dim_set, first, n);
1392 /* Project out n dimensions starting at first using Fourier-Motzkin */
1393 struct isl_set *isl_set_remove_dims(struct isl_set *set,
1394 unsigned first, unsigned n)
1396 set = isl_set_eliminate_dims(set, first, n);
1397 set = isl_set_drop_dims(set, first, n);
1401 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1402 __isl_take isl_basic_map *bmap)
1404 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1412 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1413 __isl_take isl_basic_set *bset)
1415 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1416 (struct isl_basic_map *)bset);
1419 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1428 set = isl_set_cow(set);
1432 for (i = 0; i < set->n; ++i) {
1433 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1443 struct isl_basic_map *isl_basic_map_remove(struct isl_basic_map *bmap,
1444 enum isl_dim_type type, unsigned first, unsigned n)
1448 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1452 bmap = isl_basic_map_eliminate_vars(bmap,
1453 isl_basic_map_offset(bmap, type) - 1 + first, n);
1456 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1458 bmap = isl_basic_map_drop(bmap, type, first, n);
1461 isl_basic_map_free(bmap);
1465 __isl_give isl_basic_set *isl_basic_set_remove(__isl_take isl_basic_set *bset,
1466 enum isl_dim_type type, unsigned first, unsigned n)
1468 return (isl_basic_set *)
1469 isl_basic_map_remove((isl_basic_map *)bset, type, first, n);
1472 struct isl_map *isl_map_remove(struct isl_map *map,
1473 enum isl_dim_type type, unsigned first, unsigned n)
1480 map = isl_map_cow(map);
1483 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1485 for (i = 0; i < map->n; ++i) {
1486 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1487 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1491 map = isl_map_drop(map, type, first, n);
1498 __isl_give isl_set *isl_set_remove(__isl_take isl_set *bset,
1499 enum isl_dim_type type, unsigned first, unsigned n)
1501 return (isl_set *)isl_map_remove((isl_map *)bset, type, first, n);
1504 /* Project out n inputs starting at first using Fourier-Motzkin */
1505 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1506 unsigned first, unsigned n)
1508 return isl_map_remove(map, isl_dim_in, first, n);
1511 /* Project out n dimensions starting at first using Fourier-Motzkin */
1512 struct isl_basic_set *isl_basic_set_remove_dims(struct isl_basic_set *bset,
1513 unsigned first, unsigned n)
1515 unsigned nparam = isl_basic_set_n_param(bset);
1516 bset = isl_basic_set_eliminate_vars(bset, nparam + first, n);
1517 bset = isl_basic_set_drop_dims(bset, first, n);
1521 static void dump_term(struct isl_basic_map *bmap,
1522 isl_int c, int pos, FILE *out)
1525 unsigned in = isl_basic_map_n_in(bmap);
1526 unsigned dim = in + isl_basic_map_n_out(bmap);
1527 unsigned nparam = isl_basic_map_n_param(bmap);
1529 isl_int_print(out, c, 0);
1531 if (!isl_int_is_one(c))
1532 isl_int_print(out, c, 0);
1533 if (pos < 1 + nparam) {
1534 name = isl_dim_get_name(bmap->dim,
1535 isl_dim_param, pos - 1);
1537 fprintf(out, "%s", name);
1539 fprintf(out, "p%d", pos - 1);
1540 } else if (pos < 1 + nparam + in)
1541 fprintf(out, "i%d", pos - 1 - nparam);
1542 else if (pos < 1 + nparam + dim)
1543 fprintf(out, "o%d", pos - 1 - nparam - in);
1545 fprintf(out, "e%d", pos - 1 - nparam - dim);
1549 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1550 int sign, FILE *out)
1554 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1558 for (i = 0, first = 1; i < len; ++i) {
1559 if (isl_int_sgn(c[i]) * sign <= 0)
1562 fprintf(out, " + ");
1564 isl_int_abs(v, c[i]);
1565 dump_term(bmap, v, i, out);
1572 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1573 const char *op, FILE *out, int indent)
1577 fprintf(out, "%*s", indent, "");
1579 dump_constraint_sign(bmap, c, 1, out);
1580 fprintf(out, " %s ", op);
1581 dump_constraint_sign(bmap, c, -1, out);
1585 for (i = bmap->n_div; i < bmap->extra; ++i) {
1586 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1588 fprintf(out, "%*s", indent, "");
1589 fprintf(out, "ERROR: unused div coefficient not zero\n");
1594 static void dump_constraints(struct isl_basic_map *bmap,
1595 isl_int **c, unsigned n,
1596 const char *op, FILE *out, int indent)
1600 for (i = 0; i < n; ++i)
1601 dump_constraint(bmap, c[i], op, out, indent);
1604 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1608 unsigned total = isl_basic_map_total_dim(bmap);
1610 for (j = 0; j < 1 + total; ++j) {
1611 if (isl_int_is_zero(exp[j]))
1613 if (!first && isl_int_is_pos(exp[j]))
1615 dump_term(bmap, exp[j], j, out);
1620 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1624 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1625 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1627 for (i = 0; i < bmap->n_div; ++i) {
1628 fprintf(out, "%*s", indent, "");
1629 fprintf(out, "e%d = [(", i);
1630 dump_affine(bmap, bmap->div[i]+1, out);
1632 isl_int_print(out, bmap->div[i][0], 0);
1633 fprintf(out, "]\n");
1637 void isl_basic_set_dump(struct isl_basic_set *bset, FILE *out, int indent)
1640 fprintf(out, "null basic set\n");
1644 fprintf(out, "%*s", indent, "");
1645 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1646 bset->ref, bset->dim->nparam, bset->dim->n_out,
1647 bset->extra, bset->flags);
1648 dump((struct isl_basic_map *)bset, out, indent);
1651 void isl_basic_map_dump(struct isl_basic_map *bmap, FILE *out, int indent)
1654 fprintf(out, "null basic map\n");
1658 fprintf(out, "%*s", indent, "");
1659 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1660 "flags: %x, n_name: %d\n",
1662 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1663 bmap->extra, bmap->flags, bmap->dim->n_name);
1664 dump(bmap, out, indent);
1667 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1672 total = isl_basic_map_total_dim(bmap);
1673 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1674 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1675 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1676 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1680 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1682 struct isl_set *set;
1686 isl_assert(dim->ctx, dim->n_in == 0, return NULL);
1687 isl_assert(dim->ctx, n >= 0, return NULL);
1688 set = isl_alloc(dim->ctx, struct isl_set,
1689 sizeof(struct isl_set) +
1690 (n - 1) * sizeof(struct isl_basic_set *));
1694 set->ctx = dim->ctx;
1695 isl_ctx_ref(set->ctx);
1707 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1708 unsigned nparam, unsigned dim, int n, unsigned flags)
1710 struct isl_set *set;
1711 struct isl_dim *dims;
1713 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1717 set = isl_set_alloc_dim(dims, n, flags);
1721 /* Make sure "map" has room for at least "n" more basic maps.
1723 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1726 struct isl_map *grown = NULL;
1730 isl_assert(map->ctx, n >= 0, goto error);
1731 if (map->n + n <= map->size)
1733 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1736 for (i = 0; i < map->n; ++i) {
1737 grown->p[i] = isl_basic_map_copy(map->p[i]);
1745 isl_map_free(grown);
1750 /* Make sure "set" has room for at least "n" more basic sets.
1752 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1754 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1757 struct isl_set *isl_set_dup(struct isl_set *set)
1760 struct isl_set *dup;
1765 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1768 for (i = 0; i < set->n; ++i)
1769 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1773 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1775 struct isl_set *set;
1780 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1782 isl_basic_set_free(bset);
1785 return isl_set_add_basic_set(set, bset);
1788 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1790 struct isl_map *map;
1795 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1797 isl_basic_map_free(bmap);
1800 return isl_map_add_basic_map(map, bmap);
1803 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1804 __isl_take isl_basic_set *bset)
1806 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1807 (struct isl_basic_map *)bset);
1810 void isl_set_free(struct isl_set *set)
1820 isl_ctx_deref(set->ctx);
1821 for (i = 0; i < set->n; ++i)
1822 isl_basic_set_free(set->p[i]);
1823 isl_dim_free(set->dim);
1827 void isl_set_dump(struct isl_set *set, FILE *out, int indent)
1832 fprintf(out, "null set\n");
1836 fprintf(out, "%*s", indent, "");
1837 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1838 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1840 for (i = 0; i < set->n; ++i) {
1841 fprintf(out, "%*s", indent, "");
1842 fprintf(out, "basic set %d:\n", i);
1843 isl_basic_set_dump(set->p[i], out, indent+4);
1847 void isl_map_dump(struct isl_map *map, FILE *out, int indent)
1852 fprintf(out, "null map\n");
1856 fprintf(out, "%*s", indent, "");
1857 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
1858 "flags: %x, n_name: %d\n",
1859 map->ref, map->n, map->dim->nparam, map->dim->n_in,
1860 map->dim->n_out, map->flags, map->dim->n_name);
1861 for (i = 0; i < map->n; ++i) {
1862 fprintf(out, "%*s", indent, "");
1863 fprintf(out, "basic map %d:\n", i);
1864 isl_basic_map_dump(map->p[i], out, indent+4);
1868 struct isl_basic_map *isl_basic_map_intersect_domain(
1869 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1871 struct isl_basic_map *bmap_domain;
1872 struct isl_dim *dim;
1877 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1878 bset->dim, isl_dim_param), goto error);
1880 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1881 isl_assert(bset->ctx,
1882 isl_basic_map_compatible_domain(bmap, bset), goto error);
1884 bmap = isl_basic_map_cow(bmap);
1887 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1888 bset->n_div, bset->n_eq, bset->n_ineq);
1889 dim = isl_dim_reverse(isl_dim_copy(bset->dim));
1890 bmap_domain = isl_basic_map_from_basic_set(bset, dim);
1891 bmap = add_constraints(bmap, bmap_domain, 0, 0);
1893 bmap = isl_basic_map_simplify(bmap);
1894 return isl_basic_map_finalize(bmap);
1896 isl_basic_map_free(bmap);
1897 isl_basic_set_free(bset);
1901 struct isl_basic_map *isl_basic_map_intersect_range(
1902 struct isl_basic_map *bmap, struct isl_basic_set *bset)
1904 struct isl_basic_map *bmap_range;
1909 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
1910 bset->dim, isl_dim_param), goto error);
1912 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
1913 isl_assert(bset->ctx,
1914 isl_basic_map_compatible_range(bmap, bset), goto error);
1916 bmap = isl_basic_map_cow(bmap);
1919 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
1920 bset->n_div, bset->n_eq, bset->n_ineq);
1921 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
1922 bmap = add_constraints(bmap, bmap_range, 0, 0);
1924 bmap = isl_basic_map_simplify(bmap);
1925 return isl_basic_map_finalize(bmap);
1927 isl_basic_map_free(bmap);
1928 isl_basic_set_free(bset);
1932 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
1938 total = 1 + isl_basic_map_total_dim(bmap);
1939 if (total != vec->size)
1944 for (i = 0; i < bmap->n_eq; ++i) {
1945 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
1946 if (!isl_int_is_zero(s)) {
1952 for (i = 0; i < bmap->n_ineq; ++i) {
1953 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
1954 if (isl_int_is_neg(s)) {
1965 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
1967 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
1970 struct isl_basic_map *isl_basic_map_intersect(
1971 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
1973 struct isl_vec *sample = NULL;
1975 if (!bmap1 || !bmap2)
1978 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
1979 bmap2->dim, isl_dim_param), goto error);
1980 if (isl_dim_total(bmap1->dim) ==
1981 isl_dim_size(bmap1->dim, isl_dim_param) &&
1982 isl_dim_total(bmap2->dim) !=
1983 isl_dim_size(bmap2->dim, isl_dim_param))
1984 return isl_basic_map_intersect(bmap2, bmap1);
1986 if (isl_dim_total(bmap2->dim) !=
1987 isl_dim_size(bmap2->dim, isl_dim_param))
1988 isl_assert(bmap1->ctx,
1989 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
1991 if (bmap1->sample &&
1992 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
1993 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
1994 sample = isl_vec_copy(bmap1->sample);
1995 else if (bmap2->sample &&
1996 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
1997 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
1998 sample = isl_vec_copy(bmap2->sample);
2000 bmap1 = isl_basic_map_cow(bmap1);
2003 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2004 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2005 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2008 isl_vec_free(sample);
2010 isl_vec_free(bmap1->sample);
2011 bmap1->sample = sample;
2014 bmap1 = isl_basic_map_simplify(bmap1);
2015 return isl_basic_map_finalize(bmap1);
2018 isl_vec_free(sample);
2019 isl_basic_map_free(bmap1);
2020 isl_basic_map_free(bmap2);
2024 struct isl_basic_set *isl_basic_set_intersect(
2025 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2027 return (struct isl_basic_set *)
2028 isl_basic_map_intersect(
2029 (struct isl_basic_map *)bset1,
2030 (struct isl_basic_map *)bset2);
2033 /* Special case of isl_map_intersect, where both map1 and map2
2034 * are convex, without any divs and such that either map1 or map2
2035 * contains a single constraint. This constraint is then simply
2036 * added to the other map.
2038 static __isl_give isl_map *map_intersect_add_constraint(
2039 __isl_take isl_map *map1, __isl_take isl_map *map2)
2041 struct isl_basic_map *bmap1;
2042 struct isl_basic_map *bmap2;
2044 isl_assert(map1->ctx, map1->n == 1, goto error);
2045 isl_assert(map2->ctx, map1->n == 1, goto error);
2046 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2047 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2049 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2050 return isl_map_intersect(map2, map1);
2052 isl_assert(map2->ctx,
2053 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2055 map1 = isl_map_cow(map1);
2058 if (isl_map_fast_is_empty(map1)) {
2062 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2063 if (map2->p[0]->n_eq == 1)
2064 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2066 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2067 map2->p[0]->ineq[0]);
2069 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2070 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2074 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2075 isl_basic_map_free(map1->p[0]);
2088 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2091 struct isl_map *result;
2097 if (isl_map_fast_is_empty(map1)) {
2101 if (isl_map_fast_is_empty(map2)) {
2106 if (map1->n == 1 && map2->n == 1 &&
2107 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2108 isl_dim_equal(map1->dim, map2->dim) &&
2109 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2110 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2111 return map_intersect_add_constraint(map1, map2);
2112 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2113 map2->dim, isl_dim_param), goto error);
2114 if (isl_dim_total(map1->dim) ==
2115 isl_dim_size(map1->dim, isl_dim_param) &&
2116 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2117 return isl_map_intersect(map2, map1);
2119 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2120 isl_assert(map1->ctx,
2121 isl_dim_equal(map1->dim, map2->dim), goto error);
2123 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2124 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2125 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2127 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2128 map1->n * map2->n, flags);
2131 for (i = 0; i < map1->n; ++i)
2132 for (j = 0; j < map2->n; ++j) {
2133 struct isl_basic_map *part;
2134 part = isl_basic_map_intersect(
2135 isl_basic_map_copy(map1->p[i]),
2136 isl_basic_map_copy(map2->p[j]));
2137 if (isl_basic_map_is_empty(part))
2138 isl_basic_map_free(part);
2140 result = isl_map_add_basic_map(result, part);
2153 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2155 return (struct isl_set *)
2156 isl_map_intersect((struct isl_map *)set1,
2157 (struct isl_map *)set2);
2160 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2162 struct isl_dim *dim;
2163 struct isl_basic_set *bset;
2168 bmap = isl_basic_map_cow(bmap);
2171 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2172 in = isl_basic_map_n_in(bmap);
2173 bset = isl_basic_set_from_basic_map(bmap);
2174 bset = isl_basic_set_swap_vars(bset, in);
2175 return isl_basic_map_from_basic_set(bset, dim);
2178 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2179 enum isl_dim_type type, unsigned pos, unsigned n)
2181 struct isl_dim *res_dim;
2182 struct isl_basic_map *res;
2183 struct isl_dim_map *dim_map;
2184 unsigned total, off;
2185 enum isl_dim_type t;
2193 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2195 total = isl_basic_map_total_dim(bmap) + n;
2196 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2198 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2200 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2202 unsigned size = isl_basic_map_dim(bmap, t);
2203 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2205 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2206 pos, size - pos, off + pos + n);
2208 off += isl_dim_size(res_dim, t);
2210 isl_dim_map_div(dim_map, bmap, off);
2212 res = isl_basic_map_alloc_dim(res_dim,
2213 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2214 res = add_constraints_dim_map(res, bmap, dim_map);
2215 res = isl_basic_map_simplify(res);
2216 return isl_basic_map_finalize(res);
2219 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2220 enum isl_dim_type type, unsigned n)
2224 return isl_basic_map_insert(bmap, type,
2225 isl_basic_map_dim(bmap, type), n);
2228 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2229 enum isl_dim_type type, unsigned n)
2233 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2234 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2236 isl_basic_set_free(bset);
2240 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2241 enum isl_dim_type type, unsigned pos, unsigned n)
2248 map = isl_map_cow(map);
2252 map->dim = isl_dim_insert(map->dim, type, pos, n);
2256 for (i = 0; i < map->n; ++i) {
2257 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2268 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2269 enum isl_dim_type type, unsigned pos, unsigned n)
2271 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2274 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2275 enum isl_dim_type type, unsigned n)
2279 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2282 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2283 enum isl_dim_type type, unsigned n)
2287 isl_assert(set->ctx, type != isl_dim_in, goto error);
2288 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2294 __isl_give isl_basic_map *isl_basic_map_move_dims(
2295 __isl_take isl_basic_map *bmap,
2296 enum isl_dim_type dst_type, unsigned dst_pos,
2297 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2300 struct isl_dim_map *dim_map;
2301 struct isl_basic_map *res;
2302 enum isl_dim_type t;
2303 unsigned total, off;
2310 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2313 if (dst_type == src_type && dst_pos == src_pos)
2316 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2318 if (pos(bmap->dim, dst_type) + dst_pos ==
2319 pos(bmap->dim, src_type) + src_pos +
2320 ((src_type < dst_type) ? n : 0)) {
2321 bmap = isl_basic_map_cow(bmap);
2325 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2326 src_type, src_pos, n);
2330 bmap = isl_basic_map_finalize(bmap);
2335 total = isl_basic_map_total_dim(bmap);
2336 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2339 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2340 unsigned size = isl_dim_size(bmap->dim, t);
2341 if (t == dst_type) {
2342 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2345 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2348 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2349 dst_pos, size - dst_pos, off);
2350 off += size - dst_pos;
2351 } else if (t == src_type) {
2352 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2355 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2356 src_pos + n, size - src_pos - n, off);
2357 off += size - src_pos - n;
2359 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2363 isl_dim_map_div(dim_map, bmap, off);
2365 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2366 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2367 bmap = add_constraints_dim_map(res, bmap, dim_map);
2369 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2370 src_type, src_pos, n);
2374 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2375 bmap = isl_basic_map_gauss(bmap, NULL);
2376 bmap = isl_basic_map_finalize(bmap);
2380 isl_basic_map_free(bmap);
2384 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2385 enum isl_dim_type dst_type, unsigned dst_pos,
2386 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2388 return (isl_basic_set *)isl_basic_map_move_dims(
2389 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2392 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2393 enum isl_dim_type dst_type, unsigned dst_pos,
2394 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2398 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2399 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2400 src_type, src_pos, n);
2406 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2407 enum isl_dim_type dst_type, unsigned dst_pos,
2408 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2417 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2420 if (dst_type == src_type && dst_pos == src_pos)
2423 isl_assert(map->ctx, dst_type != src_type, goto error);
2425 map = isl_map_cow(map);
2429 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2433 for (i = 0; i < map->n; ++i) {
2434 map->p[i] = isl_basic_map_move_dims(map->p[i],
2436 src_type, src_pos, n);
2447 /* Move the specified dimensions to the last columns right before
2448 * the divs. Don't change the dimension specification of bmap.
2449 * That's the responsibility of the caller.
2451 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2452 enum isl_dim_type type, unsigned first, unsigned n)
2454 struct isl_dim_map *dim_map;
2455 struct isl_basic_map *res;
2456 enum isl_dim_type t;
2457 unsigned total, off;
2461 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2464 total = isl_basic_map_total_dim(bmap);
2465 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2468 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2469 unsigned size = isl_dim_size(bmap->dim, t);
2471 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2474 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2475 first, n, total - bmap->n_div - n);
2476 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2477 first + n, size - (first + n), off);
2478 off += size - (first + n);
2480 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2484 isl_dim_map_div(dim_map, bmap, off + n);
2486 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2487 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2488 res = add_constraints_dim_map(res, bmap, dim_map);
2492 /* Turn the n dimensions of type type, starting at first
2493 * into existentially quantified variables.
2495 __isl_give isl_basic_map *isl_basic_map_project_out(
2496 __isl_take isl_basic_map *bmap,
2497 enum isl_dim_type type, unsigned first, unsigned n)
2510 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2511 return isl_basic_map_remove(bmap, type, first, n);
2513 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2516 bmap = move_last(bmap, type, first, n);
2517 bmap = isl_basic_map_cow(bmap);
2521 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2522 old = bmap->block2.data;
2523 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2524 (bmap->extra + n) * (1 + row_size));
2525 if (!bmap->block2.data)
2527 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2530 for (i = 0; i < n; ++i) {
2531 new_div[i] = bmap->block2.data +
2532 (bmap->extra + i) * (1 + row_size);
2533 isl_seq_clr(new_div[i], 1 + row_size);
2535 for (i = 0; i < bmap->extra; ++i)
2536 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2538 bmap->div = new_div;
2542 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2545 bmap = isl_basic_map_simplify(bmap);
2546 bmap = isl_basic_map_drop_redundant_divs(bmap);
2547 return isl_basic_map_finalize(bmap);
2549 isl_basic_map_free(bmap);
2553 /* Turn the n dimensions of type type, starting at first
2554 * into existentially quantified variables.
2556 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2557 enum isl_dim_type type, unsigned first, unsigned n)
2559 return (isl_basic_set *)isl_basic_map_project_out(
2560 (isl_basic_map *)bset, type, first, n);
2563 /* Turn the n dimensions of type type, starting at first
2564 * into existentially quantified variables.
2566 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2567 enum isl_dim_type type, unsigned first, unsigned n)
2577 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2579 map = isl_map_cow(map);
2583 map->dim = isl_dim_drop(map->dim, type, first, n);
2587 for (i = 0; i < map->n; ++i) {
2588 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2599 /* Turn the n dimensions of type type, starting at first
2600 * into existentially quantified variables.
2602 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2603 enum isl_dim_type type, unsigned first, unsigned n)
2605 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2608 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2612 for (i = 0; i < n; ++i) {
2613 j = isl_basic_map_alloc_div(bmap);
2616 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2620 isl_basic_map_free(bmap);
2624 struct isl_basic_map *isl_basic_map_apply_range(
2625 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2627 struct isl_dim *dim_result = NULL;
2628 struct isl_basic_map *bmap;
2629 unsigned n_in, n_out, n, nparam, total, pos;
2630 struct isl_dim_map *dim_map1, *dim_map2;
2632 if (!bmap1 || !bmap2)
2635 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2636 isl_dim_copy(bmap2->dim));
2638 n_in = isl_basic_map_n_in(bmap1);
2639 n_out = isl_basic_map_n_out(bmap2);
2640 n = isl_basic_map_n_out(bmap1);
2641 nparam = isl_basic_map_n_param(bmap1);
2643 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2644 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2645 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2646 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2647 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2648 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2649 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2650 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2651 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2652 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2653 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2655 bmap = isl_basic_map_alloc_dim(dim_result,
2656 bmap1->n_div + bmap2->n_div + n,
2657 bmap1->n_eq + bmap2->n_eq,
2658 bmap1->n_ineq + bmap2->n_ineq);
2659 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2660 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2661 bmap = add_divs(bmap, n);
2662 bmap = isl_basic_map_simplify(bmap);
2663 bmap = isl_basic_map_drop_redundant_divs(bmap);
2664 return isl_basic_map_finalize(bmap);
2666 isl_basic_map_free(bmap1);
2667 isl_basic_map_free(bmap2);
2671 struct isl_basic_set *isl_basic_set_apply(
2672 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2677 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2680 return (struct isl_basic_set *)
2681 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2683 isl_basic_set_free(bset);
2684 isl_basic_map_free(bmap);
2688 struct isl_basic_map *isl_basic_map_apply_domain(
2689 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2691 if (!bmap1 || !bmap2)
2694 isl_assert(bmap1->ctx,
2695 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2696 isl_assert(bmap1->ctx,
2697 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2700 bmap1 = isl_basic_map_reverse(bmap1);
2701 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2702 return isl_basic_map_reverse(bmap1);
2704 isl_basic_map_free(bmap1);
2705 isl_basic_map_free(bmap2);
2709 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2710 * A \cap B -> f(A) + f(B)
2712 struct isl_basic_map *isl_basic_map_sum(
2713 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2715 unsigned n_in, n_out, nparam, total, pos;
2716 struct isl_basic_map *bmap = NULL;
2717 struct isl_dim_map *dim_map1, *dim_map2;
2720 if (!bmap1 || !bmap2)
2723 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2726 nparam = isl_basic_map_n_param(bmap1);
2727 n_in = isl_basic_map_n_in(bmap1);
2728 n_out = isl_basic_map_n_out(bmap1);
2730 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2731 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2732 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2733 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2734 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2735 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2736 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2737 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2738 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2739 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2740 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2742 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2743 bmap1->n_div + bmap2->n_div + 2 * n_out,
2744 bmap1->n_eq + bmap2->n_eq + n_out,
2745 bmap1->n_ineq + bmap2->n_ineq);
2746 for (i = 0; i < n_out; ++i) {
2747 int j = isl_basic_map_alloc_equality(bmap);
2750 isl_seq_clr(bmap->eq[j], 1+total);
2751 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2752 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2753 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2755 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2756 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2757 bmap = add_divs(bmap, 2 * n_out);
2759 bmap = isl_basic_map_simplify(bmap);
2760 return isl_basic_map_finalize(bmap);
2762 isl_basic_map_free(bmap);
2763 isl_basic_map_free(bmap1);
2764 isl_basic_map_free(bmap2);
2768 /* Given two maps A -> f(A) and B -> g(B), construct a map
2769 * A \cap B -> f(A) + f(B)
2771 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2773 struct isl_map *result;
2779 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2781 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2782 map1->n * map2->n, 0);
2785 for (i = 0; i < map1->n; ++i)
2786 for (j = 0; j < map2->n; ++j) {
2787 struct isl_basic_map *part;
2788 part = isl_basic_map_sum(
2789 isl_basic_map_copy(map1->p[i]),
2790 isl_basic_map_copy(map2->p[j]));
2791 if (isl_basic_map_is_empty(part))
2792 isl_basic_map_free(part);
2794 result = isl_map_add_basic_map(result, part);
2807 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2808 __isl_take isl_set *set2)
2810 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2813 /* Given a basic map A -> f(A), construct A -> -f(A).
2815 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2820 bmap = isl_basic_map_cow(bmap);
2824 n = isl_basic_map_dim(bmap, isl_dim_out);
2825 off = isl_basic_map_offset(bmap, isl_dim_out);
2826 for (i = 0; i < bmap->n_eq; ++i)
2827 for (j = 0; j < n; ++j)
2828 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2829 for (i = 0; i < bmap->n_ineq; ++i)
2830 for (j = 0; j < n; ++j)
2831 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2832 for (i = 0; i < bmap->n_div; ++i)
2833 for (j = 0; j < n; ++j)
2834 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2835 return isl_basic_map_finalize(bmap);
2838 /* Given a map A -> f(A), construct A -> -f(A).
2840 struct isl_map *isl_map_neg(struct isl_map *map)
2844 map = isl_map_cow(map);
2848 for (i = 0; i < map->n; ++i) {
2849 map->p[i] = isl_basic_map_neg(map->p[i]);
2860 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
2862 return (isl_set *)isl_map_neg((isl_map *)set);
2865 /* Given a basic map A -> f(A) and an integer d, construct a basic map
2866 * A -> floor(f(A)/d).
2868 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
2871 unsigned n_in, n_out, nparam, total, pos;
2872 struct isl_basic_map *result = NULL;
2873 struct isl_dim_map *dim_map;
2879 nparam = isl_basic_map_n_param(bmap);
2880 n_in = isl_basic_map_n_in(bmap);
2881 n_out = isl_basic_map_n_out(bmap);
2883 total = nparam + n_in + n_out + bmap->n_div + n_out;
2884 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2885 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
2886 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
2887 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
2888 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
2890 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
2891 bmap->n_div + n_out,
2892 bmap->n_eq, bmap->n_ineq + 2 * n_out);
2893 result = add_constraints_dim_map(result, bmap, dim_map);
2894 result = add_divs(result, n_out);
2895 for (i = 0; i < n_out; ++i) {
2897 j = isl_basic_map_alloc_inequality(result);
2900 isl_seq_clr(result->ineq[j], 1+total);
2901 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
2902 isl_int_set_si(result->ineq[j][1+pos+i], 1);
2903 j = isl_basic_map_alloc_inequality(result);
2906 isl_seq_clr(result->ineq[j], 1+total);
2907 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
2908 isl_int_set_si(result->ineq[j][1+pos+i], -1);
2909 isl_int_sub_ui(result->ineq[j][0], d, 1);
2912 result = isl_basic_map_simplify(result);
2913 return isl_basic_map_finalize(result);
2915 isl_basic_map_free(result);
2919 /* Given a map A -> f(A) and an integer d, construct a map
2920 * A -> floor(f(A)/d).
2922 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
2926 map = isl_map_cow(map);
2930 ISL_F_CLR(map, ISL_MAP_DISJOINT);
2931 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
2932 for (i = 0; i < map->n; ++i) {
2933 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
2944 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
2950 i = isl_basic_map_alloc_equality(bmap);
2953 nparam = isl_basic_map_n_param(bmap);
2954 n_in = isl_basic_map_n_in(bmap);
2955 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
2956 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
2957 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
2958 return isl_basic_map_finalize(bmap);
2960 isl_basic_map_free(bmap);
2964 /* Add a constraints to "bmap" expressing i_pos < o_pos
2966 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
2972 i = isl_basic_map_alloc_inequality(bmap);
2975 nparam = isl_basic_map_n_param(bmap);
2976 n_in = isl_basic_map_n_in(bmap);
2977 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
2978 isl_int_set_si(bmap->ineq[i][0], -1);
2979 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
2980 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
2981 return isl_basic_map_finalize(bmap);
2983 isl_basic_map_free(bmap);
2987 /* Add a constraint to "bmap" expressing i_pos <= o_pos
2989 static __isl_give isl_basic_map *var_less_or_equal(
2990 __isl_take isl_basic_map *bmap, unsigned pos)
2996 i = isl_basic_map_alloc_inequality(bmap);
2999 nparam = isl_basic_map_n_param(bmap);
3000 n_in = isl_basic_map_n_in(bmap);
3001 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3002 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3003 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3004 return isl_basic_map_finalize(bmap);
3006 isl_basic_map_free(bmap);
3010 /* Add a constraints to "bmap" expressing i_pos > o_pos
3012 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3018 i = isl_basic_map_alloc_inequality(bmap);
3021 nparam = isl_basic_map_n_param(bmap);
3022 n_in = isl_basic_map_n_in(bmap);
3023 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3024 isl_int_set_si(bmap->ineq[i][0], -1);
3025 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3026 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3027 return isl_basic_map_finalize(bmap);
3029 isl_basic_map_free(bmap);
3033 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3035 static __isl_give isl_basic_map *var_more_or_equal(
3036 __isl_take isl_basic_map *bmap, unsigned pos)
3042 i = isl_basic_map_alloc_inequality(bmap);
3045 nparam = isl_basic_map_n_param(bmap);
3046 n_in = isl_basic_map_n_in(bmap);
3047 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3048 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3049 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3050 return isl_basic_map_finalize(bmap);
3052 isl_basic_map_free(bmap);
3056 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3059 struct isl_basic_map *bmap;
3060 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3063 for (i = 0; i < n_equal && bmap; ++i)
3064 bmap = var_equal(bmap, i);
3065 return isl_basic_map_finalize(bmap);
3068 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3070 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3073 struct isl_basic_map *bmap;
3074 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3077 for (i = 0; i < pos && bmap; ++i)
3078 bmap = var_equal(bmap, i);
3080 bmap = var_less(bmap, pos);
3081 return isl_basic_map_finalize(bmap);
3084 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3086 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3087 __isl_take isl_dim *dim, unsigned pos)
3090 isl_basic_map *bmap;
3092 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3093 for (i = 0; i < pos; ++i)
3094 bmap = var_equal(bmap, i);
3095 bmap = var_less_or_equal(bmap, pos);
3096 return isl_basic_map_finalize(bmap);
3099 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3101 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3104 struct isl_basic_map *bmap;
3105 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3108 for (i = 0; i < pos && bmap; ++i)
3109 bmap = var_equal(bmap, i);
3111 bmap = var_more(bmap, pos);
3112 return isl_basic_map_finalize(bmap);
3115 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3117 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3118 __isl_take isl_dim *dim, unsigned pos)
3121 isl_basic_map *bmap;
3123 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3124 for (i = 0; i < pos; ++i)
3125 bmap = var_equal(bmap, i);
3126 bmap = var_more_or_equal(bmap, pos);
3127 return isl_basic_map_finalize(bmap);
3130 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3131 unsigned n, int equal)
3133 struct isl_map *map;
3136 if (n == 0 && equal)
3137 return isl_map_universe(dims);
3139 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3141 for (i = 0; i + 1 < n; ++i)
3142 map = isl_map_add_basic_map(map,
3143 isl_basic_map_less_at(isl_dim_copy(dims), i));
3146 map = isl_map_add_basic_map(map,
3147 isl_basic_map_less_or_equal_at(dims, n - 1));
3149 map = isl_map_add_basic_map(map,
3150 isl_basic_map_less_at(dims, n - 1));
3157 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3161 return map_lex_lte_first(dims, dims->n_out, equal);
3164 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3166 return map_lex_lte_first(dim, n, 0);
3169 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3171 return map_lex_lte_first(dim, n, 1);
3174 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3176 return map_lex_lte(isl_dim_map(set_dim), 0);
3179 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3181 return map_lex_lte(isl_dim_map(set_dim), 1);
3184 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3185 unsigned n, int equal)
3187 struct isl_map *map;
3190 if (n == 0 && equal)
3191 return isl_map_universe(dims);
3193 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3195 for (i = 0; i + 1 < n; ++i)
3196 map = isl_map_add_basic_map(map,
3197 isl_basic_map_more_at(isl_dim_copy(dims), i));
3200 map = isl_map_add_basic_map(map,
3201 isl_basic_map_more_or_equal_at(dims, n - 1));
3203 map = isl_map_add_basic_map(map,
3204 isl_basic_map_more_at(dims, n - 1));
3211 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3215 return map_lex_gte_first(dims, dims->n_out, equal);
3218 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3220 return map_lex_gte_first(dim, n, 0);
3223 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3225 return map_lex_gte_first(dim, n, 1);
3228 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3230 return map_lex_gte(isl_dim_map(set_dim), 0);
3233 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3235 return map_lex_gte(isl_dim_map(set_dim), 1);
3238 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3239 __isl_take isl_set *set2)
3242 map = isl_map_lex_le(isl_set_get_dim(set1));
3243 map = isl_map_intersect_domain(map, set1);
3244 map = isl_map_intersect_range(map, set2);
3248 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3249 __isl_take isl_set *set2)
3252 map = isl_map_lex_lt(isl_set_get_dim(set1));
3253 map = isl_map_intersect_domain(map, set1);
3254 map = isl_map_intersect_range(map, set2);
3258 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3259 __isl_take isl_set *set2)
3262 map = isl_map_lex_ge(isl_set_get_dim(set1));
3263 map = isl_map_intersect_domain(map, set1);
3264 map = isl_map_intersect_range(map, set2);
3268 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3269 __isl_take isl_set *set2)
3272 map = isl_map_lex_gt(isl_set_get_dim(set1));
3273 map = isl_map_intersect_domain(map, set1);
3274 map = isl_map_intersect_range(map, set2);
3278 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3279 __isl_take isl_map *map2)
3282 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3283 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3284 map = isl_map_apply_range(map, isl_map_reverse(map2));
3288 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3289 __isl_take isl_map *map2)
3292 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3293 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3294 map = isl_map_apply_range(map, isl_map_reverse(map2));
3298 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3299 __isl_take isl_map *map2)
3302 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3303 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3304 map = isl_map_apply_range(map, isl_map_reverse(map2));
3308 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3309 __isl_take isl_map *map2)
3312 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3313 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3314 map = isl_map_apply_range(map, isl_map_reverse(map2));
3318 struct isl_basic_map *isl_basic_map_from_basic_set(
3319 struct isl_basic_set *bset, struct isl_dim *dim)
3321 struct isl_basic_map *bmap;
3323 bset = isl_basic_set_cow(bset);
3327 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3328 isl_dim_free(bset->dim);
3329 bmap = (struct isl_basic_map *) bset;
3331 return isl_basic_map_finalize(bmap);
3333 isl_basic_set_free(bset);
3338 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3342 if (bmap->dim->n_in == 0)
3343 return (struct isl_basic_set *)bmap;
3344 bmap = isl_basic_map_cow(bmap);
3347 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3350 bmap = isl_basic_map_finalize(bmap);
3351 return (struct isl_basic_set *)bmap;
3353 isl_basic_map_free(bmap);
3357 /* For a div d = floor(f/m), add the constraints
3360 * -(f-(n-1)) + m d >= 0
3362 * Note that the second constraint is the negation of
3366 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3367 unsigned pos, isl_int *div)
3370 unsigned total = isl_basic_map_total_dim(bmap);
3372 i = isl_basic_map_alloc_inequality(bmap);
3375 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3376 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3378 j = isl_basic_map_alloc_inequality(bmap);
3381 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3382 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3383 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3387 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3388 unsigned pos, isl_int *div)
3390 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3394 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3396 unsigned total = isl_basic_map_total_dim(bmap);
3397 unsigned div_pos = total - bmap->n_div + div;
3399 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3403 struct isl_basic_set *isl_basic_map_underlying_set(
3404 struct isl_basic_map *bmap)
3408 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3409 bmap->n_div == 0 && !isl_dim_get_tuple_name(bmap->dim, isl_dim_out))
3410 return (struct isl_basic_set *)bmap;
3411 bmap = isl_basic_map_cow(bmap);
3414 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3417 bmap->extra -= bmap->n_div;
3419 bmap = isl_basic_map_finalize(bmap);
3420 return (struct isl_basic_set *)bmap;
3425 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3426 __isl_take isl_basic_set *bset)
3428 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3431 struct isl_basic_map *isl_basic_map_overlying_set(
3432 struct isl_basic_set *bset, struct isl_basic_map *like)
3434 struct isl_basic_map *bmap;
3435 struct isl_ctx *ctx;
3442 isl_assert(ctx, bset->n_div == 0, goto error);
3443 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3444 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3446 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3447 isl_basic_map_free(like);
3448 return (struct isl_basic_map *)bset;
3450 bset = isl_basic_set_cow(bset);
3453 total = bset->dim->n_out + bset->extra;
3454 bmap = (struct isl_basic_map *)bset;
3455 isl_dim_free(bmap->dim);
3456 bmap->dim = isl_dim_copy(like->dim);
3459 bmap->n_div = like->n_div;
3460 bmap->extra += like->n_div;
3463 ltotal = total - bmap->extra + like->extra;
3466 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3467 bmap->extra * (1 + 1 + total));
3468 if (isl_blk_is_error(bmap->block2))
3470 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3474 for (i = 0; i < bmap->extra; ++i)
3475 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3476 for (i = 0; i < like->n_div; ++i) {
3477 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3478 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3480 bmap = isl_basic_map_extend_constraints(bmap,
3481 0, 2 * like->n_div);
3482 for (i = 0; i < like->n_div; ++i) {
3483 if (isl_int_is_zero(bmap->div[i][0]))
3485 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3489 isl_basic_map_free(like);
3490 bmap = isl_basic_map_simplify(bmap);
3491 bmap = isl_basic_map_finalize(bmap);
3494 isl_basic_map_free(like);
3495 isl_basic_set_free(bset);
3499 struct isl_basic_set *isl_basic_set_from_underlying_set(
3500 struct isl_basic_set *bset, struct isl_basic_set *like)
3502 return (struct isl_basic_set *)
3503 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3506 struct isl_set *isl_set_from_underlying_set(
3507 struct isl_set *set, struct isl_basic_set *like)
3513 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3515 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3516 isl_basic_set_free(like);
3519 set = isl_set_cow(set);
3522 for (i = 0; i < set->n; ++i) {
3523 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3524 isl_basic_set_copy(like));
3528 isl_dim_free(set->dim);
3529 set->dim = isl_dim_copy(like->dim);
3532 isl_basic_set_free(like);
3535 isl_basic_set_free(like);
3540 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3544 map = isl_map_cow(map);
3547 map->dim = isl_dim_cow(map->dim);
3551 for (i = 1; i < map->n; ++i)
3552 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3554 for (i = 0; i < map->n; ++i) {
3555 map->p[i] = (struct isl_basic_map *)
3556 isl_basic_map_underlying_set(map->p[i]);
3561 map->dim = isl_dim_underlying(map->dim, 0);
3563 isl_dim_free(map->dim);
3564 map->dim = isl_dim_copy(map->p[0]->dim);
3568 return (struct isl_set *)map;
3574 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3576 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3579 static __isl_give isl_basic_map *isl_basic_map_reset_dim(
3580 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3582 bmap = isl_basic_map_cow(bmap);
3586 isl_dim_free(bmap->dim);
3589 bmap = isl_basic_map_finalize(bmap);
3593 isl_basic_map_free(bmap);
3598 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3599 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3601 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3605 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3606 __isl_take isl_dim *dim)
3610 map = isl_map_cow(map);
3614 for (i = 0; i < map->n; ++i) {
3615 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3620 isl_dim_free(map->dim);
3630 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3631 __isl_take isl_dim *dim)
3633 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3636 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3639 struct isl_basic_set *domain;
3645 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3647 n_in = isl_basic_map_n_in(bmap);
3648 n_out = isl_basic_map_n_out(bmap);
3649 domain = isl_basic_set_from_basic_map(bmap);
3650 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3652 domain = isl_basic_set_reset_dim(domain, dim);
3657 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3659 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3662 __isl_give isl_basic_map *isl_basic_map_domain_map(
3663 __isl_take isl_basic_map *bmap)
3667 isl_basic_map *domain;
3668 isl_basic_set *bset;
3669 int nparam, n_in, n_out;
3672 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3673 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3674 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3676 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3677 domain = isl_basic_map_universe(dim);
3679 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3680 bmap = isl_basic_map_apply_range(bmap, domain);
3681 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3683 total = isl_basic_map_total_dim(bmap);
3685 for (i = 0; i < n_in; ++i) {
3686 k = isl_basic_map_alloc_equality(bmap);
3689 isl_seq_clr(bmap->eq[k], 1 + total);
3690 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3691 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3694 bmap = isl_basic_map_gauss(bmap, NULL);
3695 return isl_basic_map_finalize(bmap);
3697 isl_basic_map_free(bmap);
3701 __isl_give isl_basic_map *isl_basic_map_range_map(
3702 __isl_take isl_basic_map *bmap)
3706 isl_basic_map *range;
3707 isl_basic_set *bset;
3708 int nparam, n_in, n_out;
3711 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3712 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3713 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3715 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3716 range = isl_basic_map_universe(dim);
3718 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3719 bmap = isl_basic_map_apply_range(bmap, range);
3720 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3722 total = isl_basic_map_total_dim(bmap);
3724 for (i = 0; i < n_out; ++i) {
3725 k = isl_basic_map_alloc_equality(bmap);
3728 isl_seq_clr(bmap->eq[k], 1 + total);
3729 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3730 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3733 bmap = isl_basic_map_gauss(bmap, NULL);
3734 return isl_basic_map_finalize(bmap);
3736 isl_basic_map_free(bmap);
3740 struct isl_set *isl_map_range(struct isl_map *map)
3743 struct isl_set *set;
3747 if (isl_map_dim(map, isl_dim_in) == 0)
3748 return (isl_set *)map;
3750 map = isl_map_cow(map);
3754 set = (struct isl_set *) map;
3755 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3758 for (i = 0; i < map->n; ++i) {
3759 set->p[i] = isl_basic_map_range(map->p[i]);
3763 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3764 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3771 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3774 isl_dim *domain_dim;
3776 map = isl_map_cow(map);
3780 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3781 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3782 map->dim = isl_dim_join(map->dim, domain_dim);
3785 for (i = 0; i < map->n; ++i) {
3786 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3790 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3791 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3798 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3803 map = isl_map_cow(map);
3807 range_dim = isl_dim_range(isl_map_get_dim(map));
3808 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3809 map->dim = isl_dim_join(map->dim, range_dim);
3812 for (i = 0; i < map->n; ++i) {
3813 map->p[i] = isl_basic_map_range_map(map->p[i]);
3817 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3818 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3825 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3828 struct isl_map *map = NULL;
3830 set = isl_set_cow(set);
3833 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3834 map = (struct isl_map *)set;
3835 for (i = 0; i < set->n; ++i) {
3836 map->p[i] = isl_basic_map_from_basic_set(
3837 set->p[i], isl_dim_copy(dim));
3841 isl_dim_free(map->dim);
3850 __isl_give isl_basic_map *isl_basic_map_from_domain(
3851 __isl_take isl_basic_set *bset)
3853 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
3856 __isl_give isl_basic_map *isl_basic_map_from_range(
3857 __isl_take isl_basic_set *bset)
3859 return (isl_basic_map *)bset;
3862 struct isl_map *isl_map_from_range(struct isl_set *set)
3864 return (struct isl_map *)set;
3867 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
3869 return isl_map_reverse(isl_map_from_range(set));
3872 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
3873 __isl_take isl_set *range)
3875 return isl_map_apply_range(isl_map_from_domain(domain),
3876 isl_map_from_range(range));
3879 struct isl_set *isl_set_from_map(struct isl_map *map)
3882 struct isl_set *set = NULL;
3886 map = isl_map_cow(map);
3889 map->dim = isl_dim_as_set_dim(map->dim);
3892 set = (struct isl_set *)map;
3893 for (i = 0; i < map->n; ++i) {
3894 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
3904 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
3906 struct isl_map *map;
3910 isl_assert(dim->ctx, n >= 0, return NULL);
3911 map = isl_alloc(dim->ctx, struct isl_map,
3912 sizeof(struct isl_map) +
3913 (n - 1) * sizeof(struct isl_basic_map *));
3917 map->ctx = dim->ctx;
3918 isl_ctx_ref(map->ctx);
3930 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
3931 unsigned nparam, unsigned in, unsigned out, int n,
3934 struct isl_map *map;
3935 struct isl_dim *dims;
3937 dims = isl_dim_alloc(ctx, nparam, in, out);
3941 map = isl_map_alloc_dim(dims, n, flags);
3945 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
3947 struct isl_basic_map *bmap;
3948 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
3949 bmap = isl_basic_map_set_to_empty(bmap);
3953 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
3955 struct isl_basic_set *bset;
3956 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
3957 bset = isl_basic_set_set_to_empty(bset);
3961 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
3963 struct isl_basic_map *bmap;
3966 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3967 bmap = isl_basic_map_set_to_empty(bmap);
3971 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
3973 struct isl_basic_map *bmap;
3976 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3977 bmap = isl_basic_map_set_to_empty(bmap);
3981 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
3983 struct isl_basic_set *bset;
3986 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
3987 bset = isl_basic_set_set_to_empty(bset);
3991 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
3993 struct isl_basic_map *bmap;
3994 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
3998 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4000 struct isl_basic_set *bset;
4001 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4005 __isl_give isl_basic_map *isl_basic_map_universe_like(
4006 __isl_keep isl_basic_map *model)
4010 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4013 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4017 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4020 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4021 __isl_keep isl_set *model)
4025 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4028 struct isl_map *isl_map_empty(struct isl_dim *dim)
4030 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4033 struct isl_map *isl_map_empty_like(struct isl_map *model)
4037 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4040 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4044 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4047 struct isl_set *isl_set_empty(struct isl_dim *dim)
4049 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4052 struct isl_set *isl_set_empty_like(struct isl_set *model)
4056 return isl_set_empty(isl_dim_copy(model->dim));
4059 struct isl_map *isl_map_universe(struct isl_dim *dim)
4061 struct isl_map *map;
4064 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4065 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4069 struct isl_set *isl_set_universe(struct isl_dim *dim)
4071 struct isl_set *set;
4074 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4075 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4079 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4083 return isl_set_universe(isl_dim_copy(model->dim));
4086 struct isl_map *isl_map_dup(struct isl_map *map)
4089 struct isl_map *dup;
4093 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4094 for (i = 0; i < map->n; ++i)
4095 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4099 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4100 __isl_take isl_basic_map *bmap)
4104 if (isl_basic_map_fast_is_empty(bmap)) {
4105 isl_basic_map_free(bmap);
4108 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4109 isl_assert(map->ctx, map->n < map->size, goto error);
4110 map->p[map->n] = bmap;
4112 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4118 isl_basic_map_free(bmap);
4122 void isl_map_free(struct isl_map *map)
4132 isl_ctx_deref(map->ctx);
4133 for (i = 0; i < map->n; ++i)
4134 isl_basic_map_free(map->p[i]);
4135 isl_dim_free(map->dim);
4139 struct isl_map *isl_map_extend(struct isl_map *base,
4140 unsigned nparam, unsigned n_in, unsigned n_out)
4144 base = isl_map_cow(base);
4148 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4151 for (i = 0; i < base->n; ++i) {
4152 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4153 isl_dim_copy(base->dim), 0, 0, 0);
4163 struct isl_set *isl_set_extend(struct isl_set *base,
4164 unsigned nparam, unsigned dim)
4166 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4170 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4171 struct isl_basic_map *bmap, unsigned pos, int value)
4175 bmap = isl_basic_map_cow(bmap);
4176 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4177 j = isl_basic_map_alloc_equality(bmap);
4180 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4181 isl_int_set_si(bmap->eq[j][pos], -1);
4182 isl_int_set_si(bmap->eq[j][0], value);
4183 bmap = isl_basic_map_simplify(bmap);
4184 return isl_basic_map_finalize(bmap);
4186 isl_basic_map_free(bmap);
4190 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4191 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4195 bmap = isl_basic_map_cow(bmap);
4196 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4197 j = isl_basic_map_alloc_equality(bmap);
4200 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4201 isl_int_set_si(bmap->eq[j][pos], -1);
4202 isl_int_set(bmap->eq[j][0], value);
4203 bmap = isl_basic_map_simplify(bmap);
4204 return isl_basic_map_finalize(bmap);
4206 isl_basic_map_free(bmap);
4210 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4211 enum isl_dim_type type, unsigned pos, int value)
4215 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4216 return isl_basic_map_fix_pos_si(bmap,
4217 isl_basic_map_offset(bmap, type) + pos, value);
4219 isl_basic_map_free(bmap);
4223 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4224 enum isl_dim_type type, unsigned pos, isl_int value)
4228 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4229 return isl_basic_map_fix_pos(bmap,
4230 isl_basic_map_offset(bmap, type) + pos, value);
4232 isl_basic_map_free(bmap);
4236 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4237 enum isl_dim_type type, unsigned pos, int value)
4239 return (struct isl_basic_set *)
4240 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4244 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4245 enum isl_dim_type type, unsigned pos, isl_int value)
4247 return (struct isl_basic_set *)
4248 isl_basic_map_fix((struct isl_basic_map *)bset,
4252 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4253 unsigned input, int value)
4255 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4258 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4259 unsigned dim, int value)
4261 return (struct isl_basic_set *)
4262 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4263 isl_dim_set, dim, value);
4266 struct isl_map *isl_map_fix_si(struct isl_map *map,
4267 enum isl_dim_type type, unsigned pos, int value)
4271 map = isl_map_cow(map);
4275 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4276 for (i = 0; i < map->n; ++i) {
4277 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4281 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4288 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4289 enum isl_dim_type type, unsigned pos, int value)
4291 return (struct isl_set *)
4292 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4295 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4296 enum isl_dim_type type, unsigned pos, isl_int value)
4300 map = isl_map_cow(map);
4304 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4305 for (i = 0; i < map->n; ++i) {
4306 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4310 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4317 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4318 enum isl_dim_type type, unsigned pos, isl_int value)
4320 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4323 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4324 unsigned input, int value)
4326 return isl_map_fix_si(map, isl_dim_in, input, value);
4329 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4331 return (struct isl_set *)
4332 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4335 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4336 __isl_take isl_basic_map *bmap,
4337 enum isl_dim_type type, unsigned pos, int value)
4343 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4344 pos += isl_basic_map_offset(bmap, type);
4345 bmap = isl_basic_map_cow(bmap);
4346 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4347 j = isl_basic_map_alloc_inequality(bmap);
4350 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4351 isl_int_set_si(bmap->ineq[j][pos], 1);
4352 isl_int_set_si(bmap->ineq[j][0], -value);
4353 bmap = isl_basic_map_simplify(bmap);
4354 return isl_basic_map_finalize(bmap);
4356 isl_basic_map_free(bmap);
4360 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4361 unsigned dim, isl_int value)
4365 bset = isl_basic_set_cow(bset);
4366 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4367 j = isl_basic_set_alloc_inequality(bset);
4370 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4371 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4372 isl_int_neg(bset->ineq[j][0], value);
4373 bset = isl_basic_set_simplify(bset);
4374 return isl_basic_set_finalize(bset);
4376 isl_basic_set_free(bset);
4380 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4381 enum isl_dim_type type, unsigned pos, int value)
4385 map = isl_map_cow(map);
4389 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4390 for (i = 0; i < map->n; ++i) {
4391 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4396 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4403 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4404 enum isl_dim_type type, unsigned pos, int value)
4406 return (struct isl_set *)
4407 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4410 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4415 set = isl_set_cow(set);
4419 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4420 for (i = 0; i < set->n; ++i) {
4421 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4431 struct isl_map *isl_map_reverse(struct isl_map *map)
4435 map = isl_map_cow(map);
4439 map->dim = isl_dim_reverse(map->dim);
4442 for (i = 0; i < map->n; ++i) {
4443 map->p[i] = isl_basic_map_reverse(map->p[i]);
4447 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4454 static struct isl_map *isl_basic_map_partial_lexopt(
4455 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4456 struct isl_set **empty, int max)
4460 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4461 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4463 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4465 isl_basic_map_free(bmap);
4466 isl_basic_set_free(dom);
4472 struct isl_map *isl_basic_map_partial_lexmax(
4473 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4474 struct isl_set **empty)
4476 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4479 struct isl_map *isl_basic_map_partial_lexmin(
4480 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4481 struct isl_set **empty)
4483 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4486 struct isl_set *isl_basic_set_partial_lexmin(
4487 struct isl_basic_set *bset, struct isl_basic_set *dom,
4488 struct isl_set **empty)
4490 return (struct isl_set *)
4491 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4495 struct isl_set *isl_basic_set_partial_lexmax(
4496 struct isl_basic_set *bset, struct isl_basic_set *dom,
4497 struct isl_set **empty)
4499 return (struct isl_set *)
4500 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4504 /* Given a basic map "bmap", compute the lexicograhically minimal
4505 * (or maximal) image element for each domain element in dom.
4506 * Set *empty to those elements in dom that do not have an image element.
4508 * We first make sure the basic sets in dom are disjoint and then
4509 * simply collect the results over each of the basic sets separately.
4510 * We could probably improve the efficiency a bit by moving the union
4511 * domain down into the parametric integer programming.
4513 static __isl_give isl_map *basic_map_partial_lexopt(
4514 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4515 __isl_give isl_set **empty, int max)
4518 struct isl_map *res;
4520 dom = isl_set_make_disjoint(dom);
4524 if (isl_set_fast_is_empty(dom)) {
4525 res = isl_map_empty_like_basic_map(bmap);
4526 *empty = isl_set_empty_like(dom);
4528 isl_basic_map_free(bmap);
4532 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4533 isl_basic_set_copy(dom->p[0]), empty, max);
4535 for (i = 1; i < dom->n; ++i) {
4536 struct isl_map *res_i;
4537 struct isl_set *empty_i;
4539 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4540 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4542 res = isl_map_union_disjoint(res, res_i);
4543 *empty = isl_set_union_disjoint(*empty, empty_i);
4547 isl_basic_map_free(bmap);
4552 isl_basic_map_free(bmap);
4556 /* Given a map "map", compute the lexicograhically minimal
4557 * (or maximal) image element for each domain element in dom.
4558 * Set *empty to those elements in dom that do not have an image element.
4560 * We first compute the lexicographically minimal or maximal element
4561 * in the first basic map. This results in a partial solution "res"
4562 * and a subset "todo" of dom that still need to be handled.
4563 * We then consider each of the remaining maps in "map" and successively
4564 * improve both "res" and "todo".
4566 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4567 * Assume we are computing the lexicographical maximum.
4568 * We first intersect basic map i with a relation that maps elements
4569 * to elements that are lexicographically larger than the image elements
4570 * in res^k and the compute the maximum image element of this intersection.
4571 * The result ("better") corresponds to those image elements in basic map i
4572 * that are better than what we had before. The remainder ("keep") are the
4573 * domain elements for which the image element in res_k was better.
4574 * We also compute the lexicographical maximum of basic map i in todo^k.
4575 * res^i is the result of the operation + better + those elements in
4576 * res^k that we should keep
4577 * todo^i is the remainder of the maximum operation on todo^k.
4579 static __isl_give isl_map *isl_map_partial_lexopt(
4580 __isl_take isl_map *map, __isl_take isl_set *dom,
4581 __isl_give isl_set **empty, int max)
4584 struct isl_map *res;
4585 struct isl_set *todo;
4590 if (isl_map_fast_is_empty(map)) {
4598 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4599 isl_set_copy(dom), &todo, max);
4601 for (i = 1; i < map->n; ++i) {
4603 struct isl_map *better;
4604 struct isl_set *keep;
4605 struct isl_map *res_i;
4606 struct isl_set *todo_i;
4607 struct isl_dim *dim = isl_map_get_dim(res);
4609 dim = isl_dim_range(dim);
4611 lt = isl_map_lex_lt(dim);
4613 lt = isl_map_lex_gt(dim);
4614 lt = isl_map_apply_range(isl_map_copy(res), lt);
4615 lt = isl_map_intersect(lt,
4616 isl_map_from_basic_map(isl_basic_map_copy(map->p[i])));
4617 better = isl_map_partial_lexopt(lt,
4618 isl_map_domain(isl_map_copy(res)),
4621 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4622 todo, &todo_i, max);
4624 res = isl_map_intersect_domain(res, keep);
4625 res = isl_map_union_disjoint(res, res_i);
4626 res = isl_map_union_disjoint(res, better);
4647 __isl_give isl_map *isl_map_partial_lexmax(
4648 __isl_take isl_map *map, __isl_take isl_set *dom,
4649 __isl_give isl_set **empty)
4651 return isl_map_partial_lexopt(map, dom, empty, 1);
4654 __isl_give isl_map *isl_map_partial_lexmin(
4655 __isl_take isl_map *map, __isl_take isl_set *dom,
4656 __isl_give isl_set **empty)
4658 return isl_map_partial_lexopt(map, dom, empty, 0);
4661 __isl_give isl_set *isl_set_partial_lexmin(
4662 __isl_take isl_set *set, __isl_take isl_set *dom,
4663 __isl_give isl_set **empty)
4665 return (struct isl_set *)
4666 isl_map_partial_lexmin((struct isl_map *)set,
4670 __isl_give isl_set *isl_set_partial_lexmax(
4671 __isl_take isl_set *set, __isl_take isl_set *dom,
4672 __isl_give isl_set **empty)
4674 return (struct isl_set *)
4675 isl_map_partial_lexmax((struct isl_map *)set,
4679 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4681 struct isl_basic_set *dom = NULL;
4682 struct isl_dim *dom_dim;
4686 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4687 dom = isl_basic_set_universe(dom_dim);
4688 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4690 isl_basic_map_free(bmap);
4694 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4696 return isl_basic_map_lexopt(bmap, 0);
4699 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4701 return isl_basic_map_lexopt(bmap, 1);
4704 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4706 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4709 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4711 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4714 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4716 struct isl_set *dom = NULL;
4717 struct isl_dim *dom_dim;
4721 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4722 dom = isl_set_universe(dom_dim);
4723 return isl_map_partial_lexopt(map, dom, NULL, max);
4729 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4731 return isl_map_lexopt(map, 0);
4734 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4736 return isl_map_lexopt(map, 1);
4739 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4741 return (isl_set *)isl_map_lexmin((isl_map *)set);
4744 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4746 return (isl_set *)isl_map_lexmax((isl_map *)set);
4749 /* Apply a preimage specified by "mat" on the parameters of "bset".
4750 * bset is assumed to have only parameters and divs.
4752 static struct isl_basic_set *basic_set_parameter_preimage(
4753 struct isl_basic_set *bset, struct isl_mat *mat)
4760 bset->dim = isl_dim_cow(bset->dim);
4764 nparam = isl_basic_set_dim(bset, isl_dim_param);
4766 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4768 bset->dim->nparam = 0;
4769 bset->dim->n_out = nparam;
4770 bset = isl_basic_set_preimage(bset, mat);
4772 bset->dim->nparam = bset->dim->n_out;
4773 bset->dim->n_out = 0;
4778 isl_basic_set_free(bset);
4782 /* Apply a preimage specified by "mat" on the parameters of "set".
4783 * set is assumed to have only parameters and divs.
4785 static struct isl_set *set_parameter_preimage(
4786 struct isl_set *set, struct isl_mat *mat)
4788 struct isl_dim *dim = NULL;
4794 dim = isl_dim_copy(set->dim);
4795 dim = isl_dim_cow(dim);
4799 nparam = isl_set_dim(set, isl_dim_param);
4801 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
4804 dim->n_out = nparam;
4805 isl_set_reset_dim(set, dim);
4806 set = isl_set_preimage(set, mat);
4809 dim = isl_dim_copy(set->dim);
4810 dim = isl_dim_cow(dim);
4813 dim->nparam = dim->n_out;
4815 isl_set_reset_dim(set, dim);
4825 /* Intersect the basic set "bset" with the affine space specified by the
4826 * equalities in "eq".
4828 static struct isl_basic_set *basic_set_append_equalities(
4829 struct isl_basic_set *bset, struct isl_mat *eq)
4837 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
4842 len = 1 + isl_dim_total(bset->dim) + bset->extra;
4843 for (i = 0; i < eq->n_row; ++i) {
4844 k = isl_basic_set_alloc_equality(bset);
4847 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
4848 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
4852 bset = isl_basic_set_gauss(bset, NULL);
4853 bset = isl_basic_set_finalize(bset);
4858 isl_basic_set_free(bset);
4862 /* Intersect the set "set" with the affine space specified by the
4863 * equalities in "eq".
4865 static struct isl_set *set_append_equalities(struct isl_set *set,
4873 for (i = 0; i < set->n; ++i) {
4874 set->p[i] = basic_set_append_equalities(set->p[i],
4887 /* Project the given basic set onto its parameter domain, possibly introducing
4888 * new, explicit, existential variables in the constraints.
4889 * The input has parameters and (possibly implicit) existential variables.
4890 * The output has the same parameters, but only
4891 * explicit existentially quantified variables.
4893 * The actual projection is performed by pip, but pip doesn't seem
4894 * to like equalities very much, so we first remove the equalities
4895 * among the parameters by performing a variable compression on
4896 * the parameters. Afterward, an inverse transformation is performed
4897 * and the equalities among the parameters are inserted back in.
4899 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
4903 struct isl_mat *T, *T2;
4904 struct isl_set *set;
4905 unsigned nparam, n_div;
4907 bset = isl_basic_set_cow(bset);
4911 if (bset->n_eq == 0)
4912 return isl_basic_set_lexmin(bset);
4914 isl_basic_set_gauss(bset, NULL);
4916 nparam = isl_basic_set_dim(bset, isl_dim_param);
4917 n_div = isl_basic_set_dim(bset, isl_dim_div);
4919 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
4920 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
4923 if (i == bset->n_eq)
4924 return isl_basic_set_lexmin(bset);
4926 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
4928 eq = isl_mat_cow(eq);
4929 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
4930 if (T && T->n_col == 0) {
4934 bset = isl_basic_set_set_to_empty(bset);
4935 return isl_set_from_basic_set(bset);
4937 bset = basic_set_parameter_preimage(bset, T);
4939 set = isl_basic_set_lexmin(bset);
4940 set = set_parameter_preimage(set, T2);
4941 set = set_append_equalities(set, eq);
4945 /* Compute an explicit representation for all the existentially
4946 * quantified variables.
4947 * The input and output dimensions are first turned into parameters.
4948 * compute_divs then returns a map with the same parameters and
4949 * no input or output dimensions and the dimension specification
4950 * is reset to that of the input.
4952 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
4954 struct isl_basic_set *bset;
4955 struct isl_set *set;
4956 struct isl_map *map;
4957 struct isl_dim *dim, *orig_dim = NULL;
4962 bmap = isl_basic_map_cow(bmap);
4966 nparam = isl_basic_map_dim(bmap, isl_dim_param);
4967 n_in = isl_basic_map_dim(bmap, isl_dim_in);
4968 n_out = isl_basic_map_dim(bmap, isl_dim_out);
4969 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
4973 orig_dim = bmap->dim;
4975 bset = (struct isl_basic_set *)bmap;
4977 set = parameter_compute_divs(bset);
4978 map = (struct isl_map *)set;
4979 map = isl_map_reset_dim(map, orig_dim);
4983 isl_basic_map_free(bmap);
4987 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
4995 off = isl_dim_total(bmap->dim);
4996 for (i = 0; i < bmap->n_div; ++i) {
4997 if (isl_int_is_zero(bmap->div[i][0]))
4999 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5005 static int map_divs_known(__isl_keep isl_map *map)
5012 for (i = 0; i < map->n; ++i) {
5013 int known = basic_map_divs_known(map->p[i]);
5021 /* If bmap contains any unknown divs, then compute explicit
5022 * expressions for them. However, this computation may be
5023 * quite expensive, so first try to remove divs that aren't
5026 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5030 struct isl_map *map;
5032 known = basic_map_divs_known(bmap);
5036 return isl_map_from_basic_map(bmap);
5038 bmap = isl_basic_map_drop_redundant_divs(bmap);
5040 known = basic_map_divs_known(bmap);
5044 return isl_map_from_basic_map(bmap);
5046 map = compute_divs(bmap);
5049 isl_basic_map_free(bmap);
5053 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5057 struct isl_map *res;
5064 known = map_divs_known(map);
5072 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5073 for (i = 1 ; i < map->n; ++i) {
5075 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5076 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5077 res = isl_map_union_disjoint(res, r2);
5079 res = isl_map_union(res, r2);
5086 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5088 return (struct isl_set *)
5089 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5092 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5094 return (struct isl_set *)
5095 isl_map_compute_divs((struct isl_map *)set);
5098 struct isl_set *isl_map_domain(struct isl_map *map)
5101 struct isl_set *set;
5106 map = isl_map_cow(map);
5110 set = (struct isl_set *)map;
5111 set->dim = isl_dim_domain(set->dim);
5114 for (i = 0; i < map->n; ++i) {
5115 set->p[i] = isl_basic_map_domain(map->p[i]);
5119 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5120 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5127 struct isl_map *isl_map_union_disjoint(
5128 struct isl_map *map1, struct isl_map *map2)
5132 struct isl_map *map = NULL;
5146 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5148 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5149 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5150 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5152 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5153 map1->n + map2->n, flags);
5156 for (i = 0; i < map1->n; ++i) {
5157 map = isl_map_add_basic_map(map,
5158 isl_basic_map_copy(map1->p[i]));
5162 for (i = 0; i < map2->n; ++i) {
5163 map = isl_map_add_basic_map(map,
5164 isl_basic_map_copy(map2->p[i]));
5178 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5180 map1 = isl_map_union_disjoint(map1, map2);
5184 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5188 struct isl_set *isl_set_union_disjoint(
5189 struct isl_set *set1, struct isl_set *set2)
5191 return (struct isl_set *)
5192 isl_map_union_disjoint(
5193 (struct isl_map *)set1, (struct isl_map *)set2);
5196 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5198 return (struct isl_set *)
5199 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5202 struct isl_map *isl_map_intersect_range(
5203 struct isl_map *map, struct isl_set *set)
5206 struct isl_map *result;
5212 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5213 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5214 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5216 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5217 map->n * set->n, flags);
5220 for (i = 0; i < map->n; ++i)
5221 for (j = 0; j < set->n; ++j) {
5222 result = isl_map_add_basic_map(result,
5223 isl_basic_map_intersect_range(
5224 isl_basic_map_copy(map->p[i]),
5225 isl_basic_set_copy(set->p[j])));
5238 struct isl_map *isl_map_intersect_domain(
5239 struct isl_map *map, struct isl_set *set)
5241 return isl_map_reverse(
5242 isl_map_intersect_range(isl_map_reverse(map), set));
5245 struct isl_map *isl_map_apply_domain(
5246 struct isl_map *map1, struct isl_map *map2)
5250 map1 = isl_map_reverse(map1);
5251 map1 = isl_map_apply_range(map1, map2);
5252 return isl_map_reverse(map1);
5259 struct isl_map *isl_map_apply_range(
5260 struct isl_map *map1, struct isl_map *map2)
5262 struct isl_dim *dim_result;
5263 struct isl_map *result;
5269 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5270 isl_dim_copy(map2->dim));
5272 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5275 for (i = 0; i < map1->n; ++i)
5276 for (j = 0; j < map2->n; ++j) {
5277 result = isl_map_add_basic_map(result,
5278 isl_basic_map_apply_range(
5279 isl_basic_map_copy(map1->p[i]),
5280 isl_basic_map_copy(map2->p[j])));
5286 if (result && result->n <= 1)
5287 ISL_F_SET(result, ISL_MAP_DISJOINT);
5296 * returns range - domain
5298 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5300 isl_dim *dims, *target_dim;
5301 struct isl_basic_set *bset;
5308 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5309 bmap->dim, isl_dim_out),
5311 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5312 dim = isl_basic_map_n_in(bmap);
5313 nparam = isl_basic_map_n_param(bmap);
5314 bset = isl_basic_set_from_basic_map(bmap);
5315 bset = isl_basic_set_cow(bset);
5316 dims = isl_basic_set_get_dim(bset);
5317 dims = isl_dim_add(dims, isl_dim_set, dim);
5318 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5319 bset = isl_basic_set_swap_vars(bset, 2*dim);
5320 for (i = 0; i < dim; ++i) {
5321 int j = isl_basic_map_alloc_equality(
5322 (struct isl_basic_map *)bset);
5325 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5326 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5327 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5328 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5330 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5331 bset = isl_basic_set_reset_dim(bset, target_dim);
5334 isl_basic_map_free(bmap);
5339 * returns range - domain
5341 struct isl_set *isl_map_deltas(struct isl_map *map)
5345 struct isl_set *result;
5350 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5351 map->dim, isl_dim_out),
5353 dim = isl_map_get_dim(map);
5354 dim = isl_dim_domain(dim);
5355 result = isl_set_alloc_dim(dim, map->n, map->flags);
5358 for (i = 0; i < map->n; ++i)
5359 result = isl_set_add_basic_set(result,
5360 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5368 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5370 struct isl_basic_map *bmap;
5378 nparam = dims->nparam;
5380 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5384 for (i = 0; i < dim; ++i) {
5385 int j = isl_basic_map_alloc_equality(bmap);
5388 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5389 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5390 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5392 return isl_basic_map_finalize(bmap);
5394 isl_basic_map_free(bmap);
5398 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5400 struct isl_dim *dim = isl_dim_map(set_dim);
5403 return basic_map_identity(dim);
5406 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5408 if (!model || !model->dim)
5410 isl_assert(model->ctx,
5411 model->dim->n_in == model->dim->n_out, return NULL);
5412 return basic_map_identity(isl_dim_copy(model->dim));
5415 static struct isl_map *map_identity(struct isl_dim *dim)
5417 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5418 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5421 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5423 struct isl_dim *dim = isl_dim_map(set_dim);
5426 return map_identity(dim);
5429 struct isl_map *isl_map_identity_like(struct isl_map *model)
5431 if (!model || !model->dim)
5433 isl_assert(model->ctx,
5434 model->dim->n_in == model->dim->n_out, return NULL);
5435 return map_identity(isl_dim_copy(model->dim));
5438 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5440 if (!model || !model->dim)
5442 isl_assert(model->ctx,
5443 model->dim->n_in == model->dim->n_out, return NULL);
5444 return map_identity(isl_dim_copy(model->dim));
5447 /* Construct a basic set with all set dimensions having only non-negative
5450 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5455 struct isl_basic_set *bset;
5459 nparam = dims->nparam;
5461 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5464 for (i = 0; i < dim; ++i) {
5465 int k = isl_basic_set_alloc_inequality(bset);
5468 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5469 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5473 isl_basic_set_free(bset);
5477 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5478 enum isl_dim_type type, unsigned first, unsigned n)
5481 isl_basic_set *nonneg = NULL;
5482 isl_basic_set *neg = NULL;
5489 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5491 for (i = 0; i < n; ++i) {
5495 nonneg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5496 k = isl_basic_set_alloc_inequality(nonneg);
5499 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5500 isl_int_set_si(nonneg->ineq[k][pos(set->dim, type) + first + i], 1);
5502 neg = isl_basic_set_alloc_dim(isl_set_get_dim(set), 0, 0, 1);
5503 k = isl_basic_set_alloc_inequality(neg);
5506 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5507 isl_int_set_si(neg->ineq[k][0], -1);
5508 isl_int_set_si(neg->ineq[k][pos(set->dim, type) + first + i], -1);
5510 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5515 isl_basic_set_free(nonneg);
5516 isl_basic_set_free(neg);
5521 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5523 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5526 int isl_basic_map_is_subset(
5527 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5530 struct isl_map *map1;
5531 struct isl_map *map2;
5533 if (!bmap1 || !bmap2)
5536 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5537 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5539 is_subset = isl_map_is_subset(map1, map2);
5547 int isl_basic_map_is_equal(
5548 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5552 if (!bmap1 || !bmap2)
5554 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5557 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5561 int isl_basic_set_is_equal(
5562 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5564 return isl_basic_map_is_equal(
5565 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5568 int isl_map_is_empty(struct isl_map *map)
5575 for (i = 0; i < map->n; ++i) {
5576 is_empty = isl_basic_map_is_empty(map->p[i]);
5585 int isl_map_fast_is_empty(struct isl_map *map)
5587 return map ? map->n == 0 : -1;
5590 int isl_set_fast_is_empty(struct isl_set *set)
5592 return set ? set->n == 0 : -1;
5595 int isl_set_is_empty(struct isl_set *set)
5597 return isl_map_is_empty((struct isl_map *)set);
5600 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5605 return isl_dim_equal(map1->dim, map2->dim);
5608 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5613 return isl_dim_equal(set1->dim, set2->dim);
5616 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5622 is_subset = isl_map_is_subset(map1, map2);
5625 is_subset = isl_map_is_subset(map2, map1);
5629 int isl_basic_map_is_strict_subset(
5630 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5634 if (!bmap1 || !bmap2)
5636 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5639 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5640 if (is_subset == -1)
5645 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5651 is_subset = isl_map_is_subset(map1, map2);
5654 is_subset = isl_map_is_subset(map2, map1);
5655 if (is_subset == -1)
5660 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5662 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5665 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5669 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5672 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5676 return bset->n_eq == 0 && bset->n_ineq == 0;
5679 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5686 for (i = 0; i < map->n; ++i) {
5687 int r = isl_basic_map_is_universe(map->p[i]);
5695 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5697 return isl_map_fast_is_universe((isl_map *) set);
5700 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
5702 struct isl_basic_set *bset = NULL;
5703 struct isl_vec *sample = NULL;
5710 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
5713 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
5714 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
5715 copy = isl_basic_map_remove_redundancies(copy);
5716 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
5717 isl_basic_map_free(copy);
5721 total = 1 + isl_basic_map_total_dim(bmap);
5722 if (bmap->sample && bmap->sample->size == total) {
5723 int contains = isl_basic_map_contains(bmap, bmap->sample);
5729 isl_vec_free(bmap->sample);
5730 bmap->sample = NULL;
5731 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
5734 sample = isl_basic_set_sample_vec(bset);
5737 empty = sample->size == 0;
5738 isl_vec_free(bmap->sample);
5739 bmap->sample = sample;
5741 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
5746 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
5750 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
5753 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
5757 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
5760 int isl_basic_set_is_empty(struct isl_basic_set *bset)
5762 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
5765 struct isl_map *isl_basic_map_union(
5766 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5768 struct isl_map *map;
5769 if (!bmap1 || !bmap2)
5772 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
5774 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
5777 map = isl_map_add_basic_map(map, bmap1);
5778 map = isl_map_add_basic_map(map, bmap2);
5781 isl_basic_map_free(bmap1);
5782 isl_basic_map_free(bmap2);
5786 struct isl_set *isl_basic_set_union(
5787 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5789 return (struct isl_set *)isl_basic_map_union(
5790 (struct isl_basic_map *)bset1,
5791 (struct isl_basic_map *)bset2);
5794 /* Order divs such that any div only depends on previous divs */
5795 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
5803 off = isl_dim_total(bmap->dim);
5805 for (i = 0; i < bmap->n_div; ++i) {
5807 if (isl_int_is_zero(bmap->div[i][0]))
5809 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
5813 isl_basic_map_swap_div(bmap, i, i + pos);
5819 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
5821 return (struct isl_basic_set *)
5822 isl_basic_map_order_divs((struct isl_basic_map *)bset);
5825 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
5832 for (i = 0; i < map->n; ++i) {
5833 map->p[i] = isl_basic_map_order_divs(map->p[i]);
5844 /* Look for a div in dst that corresponds to the div "div" in src.
5845 * The divs before "div" in src and dst are assumed to be the same.
5847 * Returns -1 if no corresponding div was found and the position
5848 * of the corresponding div in dst otherwise.
5850 static int find_div(struct isl_basic_map *dst,
5851 struct isl_basic_map *src, unsigned div)
5855 unsigned total = isl_dim_total(src->dim);
5857 isl_assert(dst->ctx, div <= dst->n_div, return -1);
5858 for (i = div; i < dst->n_div; ++i)
5859 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
5860 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
5861 dst->n_div - div) == -1)
5866 struct isl_basic_map *isl_basic_map_align_divs(
5867 struct isl_basic_map *dst, struct isl_basic_map *src)
5870 unsigned total = isl_dim_total(src->dim);
5875 if (src->n_div == 0)
5878 for (i = 0; i < src->n_div; ++i)
5879 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
5881 src = isl_basic_map_order_divs(src);
5882 dst = isl_basic_map_cow(dst);
5883 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
5884 src->n_div, 0, 2 * src->n_div);
5887 for (i = 0; i < src->n_div; ++i) {
5888 int j = find_div(dst, src, i);
5890 j = isl_basic_map_alloc_div(dst);
5893 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
5894 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
5895 if (isl_basic_map_add_div_constraints(dst, j) < 0)
5899 isl_basic_map_swap_div(dst, i, j);
5903 isl_basic_map_free(dst);
5907 struct isl_basic_set *isl_basic_set_align_divs(
5908 struct isl_basic_set *dst, struct isl_basic_set *src)
5910 return (struct isl_basic_set *)isl_basic_map_align_divs(
5911 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
5914 struct isl_map *isl_map_align_divs(struct isl_map *map)
5922 map = isl_map_compute_divs(map);
5923 map = isl_map_cow(map);
5927 for (i = 1; i < map->n; ++i)
5928 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
5929 for (i = 1; i < map->n; ++i)
5930 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
5932 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5936 struct isl_set *isl_set_align_divs(struct isl_set *set)
5938 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
5941 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
5945 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
5946 map = isl_map_intersect_domain(map, set);
5947 set = isl_map_range(map);
5955 /* There is no need to cow as removing empty parts doesn't change
5956 * the meaning of the set.
5958 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
5965 for (i = map->n-1; i >= 0; --i) {
5966 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
5968 isl_basic_map_free(map->p[i]);
5969 if (i != map->n-1) {
5970 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5971 map->p[i] = map->p[map->n-1];
5979 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
5981 return (struct isl_set *)
5982 isl_map_remove_empty_parts((struct isl_map *)set);
5985 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
5987 struct isl_basic_map *bmap;
5988 if (!map || map->n == 0)
5990 bmap = map->p[map->n-1];
5991 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
5992 return isl_basic_map_copy(bmap);
5995 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
5997 return (struct isl_basic_set *)
5998 isl_map_copy_basic_map((struct isl_map *)set);
6001 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6002 __isl_keep isl_basic_map *bmap)
6008 for (i = map->n-1; i >= 0; --i) {
6009 if (map->p[i] != bmap)
6011 map = isl_map_cow(map);
6014 isl_basic_map_free(map->p[i]);
6015 if (i != map->n-1) {
6016 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6017 map->p[i] = map->p[map->n-1];
6028 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6029 struct isl_basic_set *bset)
6031 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6032 (struct isl_basic_map *)bset);
6035 /* Given two basic sets bset1 and bset2, compute the maximal difference
6036 * between the values of dimension pos in bset1 and those in bset2
6037 * for any common value of the parameters and dimensions preceding pos.
6039 static enum isl_lp_result basic_set_maximal_difference_at(
6040 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6041 int pos, isl_int *opt)
6043 struct isl_dim *dims;
6044 struct isl_basic_map *bmap1 = NULL;
6045 struct isl_basic_map *bmap2 = NULL;
6046 struct isl_ctx *ctx;
6047 struct isl_vec *obj;
6050 unsigned dim1, dim2;
6051 enum isl_lp_result res;
6053 if (!bset1 || !bset2)
6054 return isl_lp_error;
6056 nparam = isl_basic_set_n_param(bset1);
6057 dim1 = isl_basic_set_n_dim(bset1);
6058 dim2 = isl_basic_set_n_dim(bset2);
6059 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6060 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6061 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6062 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6063 if (!bmap1 || !bmap2)
6065 bmap1 = isl_basic_map_cow(bmap1);
6066 bmap1 = isl_basic_map_extend(bmap1, nparam,
6067 pos, (dim1 - pos) + (dim2 - pos),
6068 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6069 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6072 total = isl_basic_map_total_dim(bmap1);
6074 obj = isl_vec_alloc(ctx, 1 + total);
6075 isl_seq_clr(obj->block.data, 1 + total);
6076 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6077 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6080 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6082 isl_basic_map_free(bmap1);
6086 isl_basic_map_free(bmap1);
6087 isl_basic_map_free(bmap2);
6088 return isl_lp_error;
6091 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6092 * for any common value of the parameters and dimensions preceding pos
6093 * in both basic sets, the values of dimension pos in bset1 are
6094 * smaller or larger than those in bset2.
6097 * 1 if bset1 follows bset2
6098 * -1 if bset1 precedes bset2
6099 * 0 if bset1 and bset2 are incomparable
6100 * -2 if some error occurred.
6102 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6103 struct isl_basic_set *bset2, int pos)
6106 enum isl_lp_result res;
6111 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6113 if (res == isl_lp_empty)
6115 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6116 res == isl_lp_unbounded)
6118 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6127 /* Given two basic sets bset1 and bset2, check whether
6128 * for any common value of the parameters and dimensions preceding pos
6129 * there is a value of dimension pos in bset1 that is larger
6130 * than a value of the same dimension in bset2.
6133 * 1 if there exists such a pair
6134 * 0 if there is no such pair, but there is a pair of equal values
6136 * -2 if some error occurred.
6138 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6139 __isl_keep isl_basic_set *bset2, int pos)
6142 enum isl_lp_result res;
6147 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6149 if (res == isl_lp_empty)
6151 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6152 res == isl_lp_unbounded)
6154 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6156 else if (res == isl_lp_ok)
6165 /* Given two sets set1 and set2, check whether
6166 * for any common value of the parameters and dimensions preceding pos
6167 * there is a value of dimension pos in set1 that is larger
6168 * than a value of the same dimension in set2.
6171 * 1 if there exists such a pair
6172 * 0 if there is no such pair, but there is a pair of equal values
6174 * -2 if some error occurred.
6176 int isl_set_follows_at(__isl_keep isl_set *set1,
6177 __isl_keep isl_set *set2, int pos)
6185 for (i = 0; i < set1->n; ++i)
6186 for (j = 0; j < set2->n; ++j) {
6188 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6189 if (f == 1 || f == -2)
6198 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6199 unsigned pos, isl_int *val)
6207 total = isl_basic_map_total_dim(bmap);
6208 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6209 for (; d+1 > pos; --d)
6210 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6214 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6216 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6218 if (!isl_int_is_one(bmap->eq[i][1+d]))
6221 isl_int_neg(*val, bmap->eq[i][0]);
6227 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6228 unsigned pos, isl_int *val)
6240 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6243 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6244 for (i = 1; fixed == 1 && i < map->n; ++i) {
6245 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6246 if (fixed == 1 && isl_int_ne(tmp, v))
6250 isl_int_set(*val, v);
6256 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6257 unsigned pos, isl_int *val)
6259 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6263 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6266 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6269 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6270 enum isl_dim_type type, unsigned pos, isl_int *val)
6272 if (pos >= isl_basic_map_dim(bmap, type))
6274 return isl_basic_map_fast_has_fixed_var(bmap,
6275 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6278 int isl_map_fast_is_fixed(struct isl_map *map,
6279 enum isl_dim_type type, unsigned pos, isl_int *val)
6281 if (pos >= isl_map_dim(map, type))
6283 return isl_map_fast_has_fixed_var(map,
6284 map_offset(map, type) - 1 + pos, val);
6287 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6288 * then return this fixed value in *val.
6290 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6293 return isl_basic_set_fast_has_fixed_var(bset,
6294 isl_basic_set_n_param(bset) + dim, val);
6297 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6298 * then return this fixed value in *val.
6300 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6302 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6305 /* Check if input variable in has fixed value and if so and if val is not NULL,
6306 * then return this fixed value in *val.
6308 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6310 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6313 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6314 * and if val is not NULL, then return this lower bound in *val.
6316 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6317 unsigned dim, isl_int *val)
6319 int i, i_eq = -1, i_ineq = -1;
6326 total = isl_basic_set_total_dim(bset);
6327 nparam = isl_basic_set_n_param(bset);
6328 for (i = 0; i < bset->n_eq; ++i) {
6329 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6335 for (i = 0; i < bset->n_ineq; ++i) {
6336 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6338 if (i_eq != -1 || i_ineq != -1)
6342 if (i_eq == -1 && i_ineq == -1)
6344 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6345 /* The coefficient should always be one due to normalization. */
6346 if (!isl_int_is_one(c[1+nparam+dim]))
6348 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6350 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6351 total - nparam - dim - 1) != -1)
6354 isl_int_neg(*val, c[0]);
6358 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6359 unsigned dim, isl_int *val)
6371 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6375 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6377 for (i = 1; fixed == 1 && i < set->n; ++i) {
6378 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6380 if (fixed == 1 && isl_int_ne(tmp, v))
6384 isl_int_set(*val, v);
6395 static int qsort_constraint_cmp(const void *p1, const void *p2)
6397 const struct constraint *c1 = (const struct constraint *)p1;
6398 const struct constraint *c2 = (const struct constraint *)p2;
6399 unsigned size = isl_min(c1->size, c2->size);
6400 return isl_seq_cmp(c1->c, c2->c, size);
6403 static struct isl_basic_map *isl_basic_map_sort_constraints(
6404 struct isl_basic_map *bmap)
6407 struct constraint *c;
6412 total = isl_basic_map_total_dim(bmap);
6413 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6416 for (i = 0; i < bmap->n_ineq; ++i) {
6418 c[i].c = bmap->ineq[i];
6420 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6421 for (i = 0; i < bmap->n_ineq; ++i)
6422 bmap->ineq[i] = c[i].c;
6426 isl_basic_map_free(bmap);
6430 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6431 __isl_take isl_basic_set *bset)
6433 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6434 (struct isl_basic_map *)bset);
6437 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6441 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6443 bmap = isl_basic_map_remove_redundancies(bmap);
6444 bmap = isl_basic_map_sort_constraints(bmap);
6445 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6449 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6451 return (struct isl_basic_set *)isl_basic_map_normalize(
6452 (struct isl_basic_map *)bset);
6455 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6456 const __isl_keep isl_basic_map *bmap2)
6463 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6464 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6465 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6466 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6467 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6468 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6469 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6470 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6472 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6474 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6476 if (bmap1->n_eq != bmap2->n_eq)
6477 return bmap1->n_eq - bmap2->n_eq;
6478 if (bmap1->n_ineq != bmap2->n_ineq)
6479 return bmap1->n_ineq - bmap2->n_ineq;
6480 if (bmap1->n_div != bmap2->n_div)
6481 return bmap1->n_div - bmap2->n_div;
6482 total = isl_basic_map_total_dim(bmap1);
6483 for (i = 0; i < bmap1->n_eq; ++i) {
6484 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6488 for (i = 0; i < bmap1->n_ineq; ++i) {
6489 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6493 for (i = 0; i < bmap1->n_div; ++i) {
6494 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6501 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6502 __isl_keep isl_basic_map *bmap2)
6504 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6507 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6508 __isl_keep isl_basic_set *bset2)
6510 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6511 (isl_basic_map *)bset2);
6514 static int qsort_bmap_cmp(const void *p1, const void *p2)
6516 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6517 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6519 return isl_basic_map_fast_cmp(bmap1, bmap2);
6522 /* We normalize in place, but if anything goes wrong we need
6523 * to return NULL, so we need to make sure we don't change the
6524 * meaning of any possible other copies of map.
6526 struct isl_map *isl_map_normalize(struct isl_map *map)
6529 struct isl_basic_map *bmap;
6533 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6535 for (i = 0; i < map->n; ++i) {
6536 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6539 isl_basic_map_free(map->p[i]);
6542 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6543 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6544 map = isl_map_remove_empty_parts(map);
6547 for (i = map->n - 1; i >= 1; --i) {
6548 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6550 isl_basic_map_free(map->p[i-1]);
6551 for (j = i; j < map->n; ++j)
6552 map->p[j-1] = map->p[j];
6562 struct isl_set *isl_set_normalize(struct isl_set *set)
6564 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6567 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6577 if (!isl_dim_equal(map1->dim, map2->dim))
6580 map1 = isl_map_copy(map1);
6581 map2 = isl_map_copy(map2);
6582 map1 = isl_map_normalize(map1);
6583 map2 = isl_map_normalize(map2);
6586 equal = map1->n == map2->n;
6587 for (i = 0; equal && i < map1->n; ++i) {
6588 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6601 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6603 return isl_map_fast_is_equal((struct isl_map *)set1,
6604 (struct isl_map *)set2);
6607 /* Return an interval that ranges from min to max (inclusive)
6609 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6610 isl_int min, isl_int max)
6613 struct isl_basic_set *bset = NULL;
6615 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6619 k = isl_basic_set_alloc_inequality(bset);
6622 isl_int_set_si(bset->ineq[k][1], 1);
6623 isl_int_neg(bset->ineq[k][0], min);
6625 k = isl_basic_set_alloc_inequality(bset);
6628 isl_int_set_si(bset->ineq[k][1], -1);
6629 isl_int_set(bset->ineq[k][0], max);
6633 isl_basic_set_free(bset);
6637 /* Return the Cartesian product of the basic sets in list (in the given order).
6639 struct isl_basic_set *isl_basic_set_product(struct isl_basic_set_list *list)
6647 struct isl_basic_set *product = NULL;
6651 isl_assert(list->ctx, list->n > 0, goto error);
6652 isl_assert(list->ctx, list->p[0], goto error);
6653 nparam = isl_basic_set_n_param(list->p[0]);
6654 dim = isl_basic_set_n_dim(list->p[0]);
6655 extra = list->p[0]->n_div;
6656 n_eq = list->p[0]->n_eq;
6657 n_ineq = list->p[0]->n_ineq;
6658 for (i = 1; i < list->n; ++i) {
6659 isl_assert(list->ctx, list->p[i], goto error);
6660 isl_assert(list->ctx,
6661 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6662 dim += isl_basic_set_n_dim(list->p[i]);
6663 extra += list->p[i]->n_div;
6664 n_eq += list->p[i]->n_eq;
6665 n_ineq += list->p[i]->n_ineq;
6667 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6672 for (i = 0; i < list->n; ++i) {
6673 isl_basic_set_add_constraints(product,
6674 isl_basic_set_copy(list->p[i]), dim);
6675 dim += isl_basic_set_n_dim(list->p[i]);
6677 isl_basic_set_list_free(list);
6680 isl_basic_set_free(product);
6681 isl_basic_set_list_free(list);
6685 struct isl_basic_map *isl_basic_map_product(
6686 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6688 struct isl_dim *dim_result = NULL;
6689 struct isl_basic_map *bmap;
6690 unsigned in1, in2, out1, out2, nparam, total, pos;
6691 struct isl_dim_map *dim_map1, *dim_map2;
6693 if (!bmap1 || !bmap2)
6696 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6697 bmap2->dim, isl_dim_param), goto error);
6698 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6699 isl_dim_copy(bmap2->dim));
6701 in1 = isl_basic_map_n_in(bmap1);
6702 in2 = isl_basic_map_n_in(bmap2);
6703 out1 = isl_basic_map_n_out(bmap1);
6704 out2 = isl_basic_map_n_out(bmap2);
6705 nparam = isl_basic_map_n_param(bmap1);
6707 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
6708 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
6709 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
6710 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
6711 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
6712 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
6713 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
6714 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
6715 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
6716 isl_dim_map_div(dim_map1, bmap1, pos += out2);
6717 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
6719 bmap = isl_basic_map_alloc_dim(dim_result,
6720 bmap1->n_div + bmap2->n_div,
6721 bmap1->n_eq + bmap2->n_eq,
6722 bmap1->n_ineq + bmap2->n_ineq);
6723 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
6724 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
6725 bmap = isl_basic_map_simplify(bmap);
6726 return isl_basic_map_finalize(bmap);
6728 isl_basic_map_free(bmap1);
6729 isl_basic_map_free(bmap2);
6733 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
6735 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
6738 struct isl_map *result;
6744 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
6745 map2->dim, isl_dim_param), goto error);
6747 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
6748 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
6749 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
6751 result = isl_map_alloc_dim(isl_dim_product(isl_dim_copy(map1->dim),
6752 isl_dim_copy(map2->dim)),
6753 map1->n * map2->n, flags);
6756 for (i = 0; i < map1->n; ++i)
6757 for (j = 0; j < map2->n; ++j) {
6758 struct isl_basic_map *part;
6759 part = isl_basic_map_product(
6760 isl_basic_map_copy(map1->p[i]),
6761 isl_basic_map_copy(map2->p[j]));
6762 if (isl_basic_map_is_empty(part))
6763 isl_basic_map_free(part);
6765 result = isl_map_add_basic_map(result, part);
6778 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
6780 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
6781 __isl_take isl_map *map2)
6785 prod = isl_map_product(map1, map2);
6786 prod = isl_map_flatten(prod);
6790 /* Given two set A and B, construct its Cartesian product A x B.
6792 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
6794 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
6795 (struct isl_map *)set2);
6798 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
6799 __isl_take isl_set *set2)
6801 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
6804 uint32_t isl_basic_set_get_hash(struct isl_basic_set *bset)
6807 uint32_t hash = isl_hash_init();
6812 bset = isl_basic_set_copy(bset);
6813 bset = isl_basic_set_normalize(bset);
6816 total = isl_basic_set_total_dim(bset);
6817 isl_hash_byte(hash, bset->n_eq & 0xFF);
6818 for (i = 0; i < bset->n_eq; ++i) {
6820 c_hash = isl_seq_get_hash(bset->eq[i], 1 + total);
6821 isl_hash_hash(hash, c_hash);
6823 isl_hash_byte(hash, bset->n_ineq & 0xFF);
6824 for (i = 0; i < bset->n_ineq; ++i) {
6826 c_hash = isl_seq_get_hash(bset->ineq[i], 1 + total);
6827 isl_hash_hash(hash, c_hash);
6829 isl_hash_byte(hash, bset->n_div & 0xFF);
6830 for (i = 0; i < bset->n_div; ++i) {
6832 if (isl_int_is_zero(bset->div[i][0]))
6834 isl_hash_byte(hash, i & 0xFF);
6835 c_hash = isl_seq_get_hash(bset->div[i], 1 + 1 + total);
6836 isl_hash_hash(hash, c_hash);
6838 isl_basic_set_free(bset);
6842 uint32_t isl_set_get_hash(struct isl_set *set)
6849 set = isl_set_copy(set);
6850 set = isl_set_normalize(set);
6854 hash = isl_hash_init();
6855 for (i = 0; i < set->n; ++i) {
6857 bset_hash = isl_basic_set_get_hash(set->p[i]);
6858 isl_hash_hash(hash, bset_hash);
6866 /* Check if the value for dimension dim is completely determined
6867 * by the values of the other parameters and variables.
6868 * That is, check if dimension dim is involved in an equality.
6870 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
6877 nparam = isl_basic_set_n_param(bset);
6878 for (i = 0; i < bset->n_eq; ++i)
6879 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
6884 /* Check if the value for dimension dim is completely determined
6885 * by the values of the other parameters and variables.
6886 * That is, check if dimension dim is involved in an equality
6887 * for each of the subsets.
6889 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
6895 for (i = 0; i < set->n; ++i) {
6897 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
6904 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
6905 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
6912 for (i = 0; i < map->n; ++i)
6913 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
6919 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
6920 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
6927 for (i = 0; i < set->n; ++i)
6928 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
6934 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
6936 struct isl_dim *dim;
6941 if (bset->n_div == 0)
6944 bset = isl_basic_set_cow(bset);
6948 dim = isl_basic_set_get_dim(bset);
6949 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
6952 isl_dim_free(bset->dim);
6956 bset = isl_basic_set_finalize(bset);
6960 isl_basic_set_free(bset);
6964 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
6967 struct isl_dim *dim;
6970 set = isl_set_align_divs(set);
6974 if (set->n == 0 || set->p[0]->n_div == 0)
6977 set = isl_set_cow(set);
6981 n_div = set->p[0]->n_div;
6982 dim = isl_set_get_dim(set);
6983 dim = isl_dim_add(dim, isl_dim_set, n_div);
6986 isl_dim_free(set->dim);
6989 for (i = 0; i < set->n; ++i) {
6990 set->p[i] = isl_basic_set_lift(set->p[i]);
7001 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7003 struct isl_dim *dim;
7004 struct isl_basic_map *bmap;
7011 set = isl_set_align_divs(set);
7016 dim = isl_set_get_dim(set);
7017 if (set->n == 0 || set->p[0]->n_div == 0) {
7019 return isl_map_identity(dim);
7022 n_div = set->p[0]->n_div;
7023 dim = isl_dim_map(dim);
7024 n_param = isl_dim_size(dim, isl_dim_param);
7025 n_set = isl_dim_size(dim, isl_dim_in);
7026 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7027 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7028 for (i = 0; i < n_set; ++i)
7029 bmap = var_equal(bmap, i);
7031 total = n_param + n_set + n_set + n_div;
7032 for (i = 0; i < n_div; ++i) {
7033 k = isl_basic_map_alloc_inequality(bmap);
7036 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7037 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7038 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7039 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7040 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7041 set->p[0]->div[i][0]);
7043 l = isl_basic_map_alloc_inequality(bmap);
7046 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7047 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7048 set->p[0]->div[i][0]);
7049 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7053 return isl_map_from_basic_map(bmap);
7056 isl_basic_map_free(bmap);
7060 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7068 dim = isl_basic_set_total_dim(bset);
7069 size += bset->n_eq * (1 + dim);
7070 size += bset->n_ineq * (1 + dim);
7071 size += bset->n_div * (2 + dim);
7076 int isl_set_size(__isl_keep isl_set *set)
7084 for (i = 0; i < set->n; ++i)
7085 size += isl_basic_set_size(set->p[i]);
7090 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7091 enum isl_dim_type type, unsigned pos)
7099 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7101 pos += isl_basic_map_offset(bmap, type);
7103 for (i = 0; i < bmap->n_eq; ++i)
7104 if (!isl_int_is_zero(bmap->eq[i][pos]))
7108 for (i = 0; i < bmap->n_ineq; ++i) {
7109 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7116 return lower && upper;
7119 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7120 enum isl_dim_type type, unsigned pos)
7127 for (i = 0; i < map->n; ++i) {
7129 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7130 if (bounded < 0 || !bounded)
7137 /* Return 1 if the specified dim is involved in both an upper bound
7138 * and a lower bound.
7140 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7141 enum isl_dim_type type, unsigned pos)
7143 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7146 /* For each of the "n" variables starting at "first", determine
7147 * the sign of the variable and put the results in the first "n"
7148 * elements of the array "signs".
7150 * 1 means that the variable is non-negative
7151 * -1 means that the variable is non-positive
7152 * 0 means the variable attains both positive and negative values.
7154 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7155 unsigned first, unsigned n, int *signs)
7157 isl_vec *bound = NULL;
7158 struct isl_tab *tab = NULL;
7159 struct isl_tab_undo *snap;
7162 if (!bset || !signs)
7165 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7166 tab = isl_tab_from_basic_set(bset);
7170 isl_seq_clr(bound->el, bound->size);
7171 isl_int_set_si(bound->el[0], -1);
7173 snap = isl_tab_snap(tab);
7174 for (i = 0; i < n; ++i) {
7177 isl_int_set_si(bound->el[1 + first + i], -1);
7178 if (isl_tab_add_ineq(tab, bound->el) < 0)
7181 isl_int_set_si(bound->el[1 + first + i], 0);
7182 if (isl_tab_rollback(tab, snap) < 0)
7190 isl_int_set_si(bound->el[1 + first + i], 1);
7191 if (isl_tab_add_ineq(tab, bound->el) < 0)
7194 isl_int_set_si(bound->el[1 + first + i], 0);
7195 if (isl_tab_rollback(tab, snap) < 0)
7198 signs[i] = empty ? -1 : 0;
7202 isl_vec_free(bound);
7206 isl_vec_free(bound);
7210 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7211 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7213 if (!bset || !signs)
7215 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7218 first += pos(bset->dim, type) - 1;
7219 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7222 /* Check if the given map is single-valued.
7227 * and check if the result is a subset of the identity mapping.
7229 int isl_map_is_single_valued(__isl_keep isl_map *map)
7235 test = isl_map_reverse(isl_map_copy(map));
7236 test = isl_map_apply_range(test, isl_map_copy(map));
7238 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7240 sv = isl_map_is_subset(test, id);
7248 int isl_map_is_bijective(__isl_keep isl_map *map)
7252 sv = isl_map_is_single_valued(map);
7256 map = isl_map_copy(map);
7257 map = isl_map_reverse(map);
7258 sv = isl_map_is_single_valued(map);
7264 int isl_set_is_singleton(__isl_keep isl_set *set)
7266 return isl_map_is_single_valued((isl_map *)set);
7269 int isl_map_is_translation(__isl_keep isl_map *map)
7274 delta = isl_map_deltas(isl_map_copy(map));
7275 ok = isl_set_is_singleton(delta);
7276 isl_set_free(delta);
7281 static int unique(isl_int *p, unsigned pos, unsigned len)
7283 if (isl_seq_first_non_zero(p, pos) != -1)
7285 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7290 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7299 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7302 nvar = isl_basic_set_dim(bset, isl_dim_set);
7303 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7304 for (j = 0; j < nvar; ++j) {
7305 int lower = 0, upper = 0;
7306 for (i = 0; i < bset->n_eq; ++i) {
7307 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7309 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7315 for (i = 0; i < bset->n_ineq; ++i) {
7316 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7318 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7320 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7325 if (!lower || !upper)
7332 int isl_set_is_box(__isl_keep isl_set *set)
7339 return isl_basic_set_is_box(set->p[0]);
7342 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7347 return isl_dim_is_wrapping(bset->dim);
7350 int isl_set_is_wrapping(__isl_keep isl_set *set)
7355 return isl_dim_is_wrapping(set->dim);
7358 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7360 bmap = isl_basic_map_cow(bmap);
7364 bmap->dim = isl_dim_wrap(bmap->dim);
7368 bmap = isl_basic_map_finalize(bmap);
7370 return (isl_basic_set *)bmap;
7372 isl_basic_map_free(bmap);
7376 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7380 map = isl_map_cow(map);
7384 for (i = 0; i < map->n; ++i) {
7385 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7389 map->dim = isl_dim_wrap(map->dim);
7393 return (isl_set *)map;
7399 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7401 bset = isl_basic_set_cow(bset);
7405 bset->dim = isl_dim_unwrap(bset->dim);
7409 bset = isl_basic_set_finalize(bset);
7411 return (isl_basic_map *)bset;
7413 isl_basic_set_free(bset);
7417 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7424 if (!isl_set_is_wrapping(set))
7425 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7428 set = isl_set_cow(set);
7432 for (i = 0; i < set->n; ++i) {
7433 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7438 set->dim = isl_dim_unwrap(set->dim);
7442 return (isl_map *)set;
7448 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7449 enum isl_dim_type type)
7454 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7457 bmap = isl_basic_map_cow(bmap);
7461 bmap->dim = isl_dim_reset(bmap->dim, type);
7465 bmap = isl_basic_map_finalize(bmap);
7469 isl_basic_map_free(bmap);
7473 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7474 enum isl_dim_type type)
7481 if (!isl_dim_is_named_or_nested(map->dim, type))
7484 map = isl_map_cow(map);
7488 for (i = 0; i < map->n; ++i) {
7489 map->p[i] = isl_basic_map_reset(map->p[i], type);
7493 map->dim = isl_dim_reset(map->dim, type);
7503 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7508 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7511 bmap = isl_basic_map_cow(bmap);
7515 bmap->dim = isl_dim_flatten(bmap->dim);
7519 bmap = isl_basic_map_finalize(bmap);
7523 isl_basic_map_free(bmap);
7527 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7534 if (!map->dim->nested[0] && !map->dim->nested[1])
7537 map = isl_map_cow(map);
7541 for (i = 0; i < map->n; ++i) {
7542 map->p[i] = isl_basic_map_flatten(map->p[i]);
7546 map->dim = isl_dim_flatten(map->dim);
7556 /* Extend the given dim_map with mappings for the divs in bmap.
7558 static __isl_give struct isl_dim_map *extend_dim_map(
7559 __isl_keep struct isl_dim_map *dim_map,
7560 __isl_keep isl_basic_map *bmap)
7563 struct isl_dim_map *res;
7566 offset = isl_basic_map_offset(bmap, isl_dim_div);
7568 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
7572 for (i = 0; i < dim_map->len; ++i)
7573 res->pos[i] = dim_map->pos[i];
7574 for (i = 0; i < bmap->n_div; ++i)
7575 res->pos[dim_map->len + i] = offset + i;
7580 /* Extract a dim_map from a reordering.
7581 * We essentially need to reverse the mapping, and add an offset
7582 * of 1 for the constant term.
7584 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
7585 __isl_keep isl_reordering *exp)
7588 struct isl_dim_map *dim_map;
7593 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
7597 for (i = 0; i < exp->len; ++i)
7598 dim_map->pos[1 + exp->pos[i]] = 1 + i;
7603 /* Reorder the dimensions of "bmap" according to the given dim_map
7604 * and set the dimension specification to "dim".
7606 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
7607 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
7611 bmap = isl_basic_map_cow(bmap);
7612 if (!bmap || !dim || !dim_map)
7615 res = isl_basic_map_alloc_dim(dim,
7616 bmap->n_div, bmap->n_eq, bmap->n_ineq);
7617 res = add_constraints_dim_map(res, bmap, dim_map);
7618 res = isl_basic_map_finalize(res);
7622 isl_basic_map_free(bmap);
7627 /* Reorder the dimensions of "map" according to given reordering.
7629 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
7630 __isl_take isl_reordering *r)
7633 struct isl_dim_map *dim_map;
7635 map = isl_map_cow(map);
7636 dim_map = isl_dim_map_from_reordering(r);
7637 if (!map || !r || !dim_map)
7640 for (i = 0; i < map->n; ++i) {
7641 struct isl_dim_map *dim_map_i;
7643 dim_map_i = extend_dim_map(dim_map, map->p[i]);
7645 map->p[i] = isl_basic_map_realign(map->p[i],
7646 isl_dim_copy(r->dim), dim_map_i);
7652 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
7654 isl_reordering_free(r);
7660 isl_reordering_free(r);
7664 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
7665 __isl_take isl_reordering *r)
7667 return (isl_set *)isl_map_realign((isl_map *)set, r);
7670 __isl_give isl_mat *isl_basic_map_equalities_matrix(
7671 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7672 enum isl_dim_type c2, enum isl_dim_type c3,
7673 enum isl_dim_type c4, enum isl_dim_type c5)
7675 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7676 struct isl_mat *mat;
7682 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
7683 isl_basic_map_total_dim(bmap) + 1);
7686 for (i = 0; i < bmap->n_eq; ++i)
7687 for (j = 0, pos = 0; j < 5; ++j) {
7688 int off = isl_basic_map_offset(bmap, c[j]);
7689 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7690 isl_int_set(mat->row[i][pos],
7691 bmap->eq[i][off + k]);
7699 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
7700 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
7701 enum isl_dim_type c2, enum isl_dim_type c3,
7702 enum isl_dim_type c4, enum isl_dim_type c5)
7704 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7705 struct isl_mat *mat;
7711 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
7712 isl_basic_map_total_dim(bmap) + 1);
7715 for (i = 0; i < bmap->n_ineq; ++i)
7716 for (j = 0, pos = 0; j < 5; ++j) {
7717 int off = isl_basic_map_offset(bmap, c[j]);
7718 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7719 isl_int_set(mat->row[i][pos],
7720 bmap->ineq[i][off + k]);
7728 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
7729 __isl_take isl_dim *dim,
7730 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7731 enum isl_dim_type c2, enum isl_dim_type c3,
7732 enum isl_dim_type c4, enum isl_dim_type c5)
7734 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
7735 isl_basic_map *bmap;
7741 if (!dim || !eq || !ineq)
7744 if (eq->n_col != ineq->n_col)
7745 isl_die(dim->ctx, isl_error_invalid,
7746 "equalities and inequalities matrices should have "
7747 "same number of columns", goto error);
7749 total = 1 + isl_dim_total(dim);
7751 if (eq->n_col < total)
7752 isl_die(dim->ctx, isl_error_invalid,
7753 "number of columns too small", goto error);
7755 extra = eq->n_col - total;
7757 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
7758 eq->n_row, ineq->n_row);
7761 for (i = 0; i < extra; ++i)
7762 if (isl_basic_map_alloc_div(bmap) < 0)
7764 for (i = 0; i < eq->n_row; ++i) {
7765 l = isl_basic_map_alloc_equality(bmap);
7768 for (j = 0, pos = 0; j < 5; ++j) {
7769 int off = isl_basic_map_offset(bmap, c[j]);
7770 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7771 isl_int_set(bmap->eq[l][off + k],
7777 for (i = 0; i < ineq->n_row; ++i) {
7778 l = isl_basic_map_alloc_inequality(bmap);
7781 for (j = 0, pos = 0; j < 5; ++j) {
7782 int off = isl_basic_map_offset(bmap, c[j]);
7783 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
7784 isl_int_set(bmap->ineq[l][off + k],
7803 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
7804 __isl_take isl_dim *dim,
7805 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
7806 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
7808 return (isl_basic_set*)
7809 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
7810 c1, c2, c3, c4, isl_dim_in);