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);
326 bmap = isl_basic_map_finalize(bmap);
329 isl_basic_map_free(bmap);
333 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
334 enum isl_dim_type type)
336 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
339 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
340 enum isl_dim_type type, const char *s)
344 map = isl_map_cow(map);
348 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
352 for (i = 0; i < map->n; ++i) {
353 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
364 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
365 enum isl_dim_type type)
367 return map ? isl_dim_get_tuple_name(map->dim, type) : NULL;
370 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
373 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
376 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
378 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
381 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
382 enum isl_dim_type type, unsigned pos)
384 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
387 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
388 enum isl_dim_type type, unsigned pos)
390 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
393 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
394 enum isl_dim_type type, unsigned pos)
396 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
399 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
400 __isl_take isl_basic_map *bmap,
401 enum isl_dim_type type, unsigned pos, const char *s)
405 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
410 isl_basic_map_free(bmap);
414 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
415 enum isl_dim_type type, unsigned pos, const char *s)
422 map->dim = isl_dim_set_name(map->dim, type, pos, s);
426 for (i = 0; i < map->n; ++i) {
427 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
438 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
439 __isl_take isl_basic_set *bset,
440 enum isl_dim_type type, unsigned pos, const char *s)
442 return (isl_basic_set *)isl_basic_map_set_dim_name(
443 (isl_basic_map *)bset, type, pos, s);
446 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
447 enum isl_dim_type type, unsigned pos, const char *s)
449 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
452 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
456 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
459 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
460 struct isl_basic_map *bmap, unsigned extra,
461 unsigned n_eq, unsigned n_ineq)
464 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
469 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
470 if (isl_blk_is_error(bmap->block))
473 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
478 bmap->block2 = isl_blk_empty();
481 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
482 if (isl_blk_is_error(bmap->block2))
485 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
490 for (i = 0; i < n_ineq + n_eq; ++i)
491 bmap->ineq[i] = bmap->block.data + i * row_size;
493 for (i = 0; i < extra; ++i)
494 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
498 bmap->c_size = n_eq + n_ineq;
499 bmap->eq = bmap->ineq + n_ineq;
508 isl_basic_map_free(bmap);
512 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
513 unsigned nparam, unsigned dim, unsigned extra,
514 unsigned n_eq, unsigned n_ineq)
516 struct isl_basic_map *bmap;
517 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
518 return (struct isl_basic_set *)bmap;
521 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
522 unsigned extra, unsigned n_eq, unsigned n_ineq)
524 struct isl_basic_map *bmap;
527 isl_assert(dim->ctx, dim->n_in == 0, goto error);
528 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
529 return (struct isl_basic_set *)bmap;
535 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
536 unsigned extra, unsigned n_eq, unsigned n_ineq)
538 struct isl_basic_map *bmap;
542 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
547 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
553 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
554 unsigned nparam, unsigned in, unsigned out, unsigned extra,
555 unsigned n_eq, unsigned n_ineq)
557 struct isl_basic_map *bmap;
560 dim = isl_dim_alloc(ctx, nparam, in, out);
564 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
568 static void dup_constraints(
569 struct isl_basic_map *dst, struct isl_basic_map *src)
572 unsigned total = isl_basic_map_total_dim(src);
574 for (i = 0; i < src->n_eq; ++i) {
575 int j = isl_basic_map_alloc_equality(dst);
576 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
579 for (i = 0; i < src->n_ineq; ++i) {
580 int j = isl_basic_map_alloc_inequality(dst);
581 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
584 for (i = 0; i < src->n_div; ++i) {
585 int j = isl_basic_map_alloc_div(dst);
586 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
588 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
591 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
593 struct isl_basic_map *dup;
597 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
598 bmap->n_div, bmap->n_eq, bmap->n_ineq);
601 dup_constraints(dup, bmap);
602 dup->flags = bmap->flags;
603 dup->sample = isl_vec_copy(bmap->sample);
607 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
609 struct isl_basic_map *dup;
611 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
612 return (struct isl_basic_set *)dup;
615 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
620 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
624 return isl_basic_set_dup(bset);
627 struct isl_set *isl_set_copy(struct isl_set *set)
636 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
641 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
645 bmap = isl_basic_map_dup(bmap);
647 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
651 struct isl_map *isl_map_copy(struct isl_map *map)
660 void isl_basic_map_free(struct isl_basic_map *bmap)
668 isl_ctx_deref(bmap->ctx);
670 isl_blk_free(bmap->ctx, bmap->block2);
672 isl_blk_free(bmap->ctx, bmap->block);
673 isl_vec_free(bmap->sample);
674 isl_dim_free(bmap->dim);
678 void isl_basic_set_free(struct isl_basic_set *bset)
680 isl_basic_map_free((struct isl_basic_map *)bset);
683 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
685 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
688 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
694 isl_assert(ctx, room_for_con(bmap, 1), return -1);
695 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
697 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
698 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
699 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
700 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
701 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
702 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
704 int j = isl_basic_map_alloc_inequality(bmap);
708 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
709 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
716 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
717 bmap->extra - bmap->n_div);
721 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
723 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
726 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
730 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
735 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
737 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
740 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
745 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
747 if (pos != bmap->n_eq - 1) {
749 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
750 bmap->eq[bmap->n_eq - 1] = t;
756 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
758 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
761 void isl_basic_map_inequality_to_equality(
762 struct isl_basic_map *bmap, unsigned pos)
767 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
768 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
773 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
774 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
775 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
776 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
779 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
781 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
784 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
790 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
791 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
792 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
793 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
794 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
795 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
796 1 + isl_basic_map_total_dim(bmap),
797 bmap->extra - bmap->n_div);
798 return bmap->n_ineq++;
801 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
803 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
806 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
810 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
815 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
817 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
820 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
825 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
827 if (pos != bmap->n_ineq - 1) {
829 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
830 bmap->ineq[bmap->n_ineq - 1] = t;
831 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
837 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
839 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
842 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
847 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
850 k = isl_basic_map_alloc_equality(bmap);
853 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
856 isl_basic_map_free(bmap);
860 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
863 return (isl_basic_set *)
864 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
867 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
872 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
875 k = isl_basic_map_alloc_inequality(bmap);
878 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
881 isl_basic_map_free(bmap);
885 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
888 return (isl_basic_set *)
889 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
892 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
896 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
897 isl_seq_clr(bmap->div[bmap->n_div] +
898 1 + 1 + isl_basic_map_total_dim(bmap),
899 bmap->extra - bmap->n_div);
900 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
901 return bmap->n_div++;
904 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
906 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
909 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
913 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
918 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
920 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
923 /* Copy constraint from src to dst, putting the vars of src at offset
924 * dim_off in dst and the divs of src at offset div_off in dst.
925 * If both sets are actually map, then dim_off applies to the input
928 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
929 struct isl_basic_map *src_map, isl_int *src,
930 unsigned in_off, unsigned out_off, unsigned div_off)
932 unsigned src_nparam = isl_basic_map_n_param(src_map);
933 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
934 unsigned src_in = isl_basic_map_n_in(src_map);
935 unsigned dst_in = isl_basic_map_n_in(dst_map);
936 unsigned src_out = isl_basic_map_n_out(src_map);
937 unsigned dst_out = isl_basic_map_n_out(dst_map);
938 isl_int_set(dst[0], src[0]);
939 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
940 if (dst_nparam > src_nparam)
941 isl_seq_clr(dst+1+src_nparam,
942 dst_nparam - src_nparam);
943 isl_seq_clr(dst+1+dst_nparam, in_off);
944 isl_seq_cpy(dst+1+dst_nparam+in_off,
946 isl_min(dst_in-in_off, src_in));
947 if (dst_in-in_off > src_in)
948 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
949 dst_in - in_off - src_in);
950 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
951 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
952 src+1+src_nparam+src_in,
953 isl_min(dst_out-out_off, src_out));
954 if (dst_out-out_off > src_out)
955 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
956 dst_out - out_off - src_out);
957 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
958 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
959 src+1+src_nparam+src_in+src_out,
960 isl_min(dst_map->extra-div_off, src_map->n_div));
961 if (dst_map->n_div-div_off > src_map->n_div)
962 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
963 div_off+src_map->n_div,
964 dst_map->n_div - div_off - src_map->n_div);
967 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
968 struct isl_basic_map *src_map, isl_int *src,
969 unsigned in_off, unsigned out_off, unsigned div_off)
971 isl_int_set(dst[0], src[0]);
972 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
975 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
976 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
981 if (!bmap1 || !bmap2)
984 div_off = bmap1->n_div;
986 for (i = 0; i < bmap2->n_eq; ++i) {
987 int i1 = isl_basic_map_alloc_equality(bmap1);
990 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
991 i_pos, o_pos, div_off);
994 for (i = 0; i < bmap2->n_ineq; ++i) {
995 int i1 = isl_basic_map_alloc_inequality(bmap1);
998 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
999 i_pos, o_pos, div_off);
1002 for (i = 0; i < bmap2->n_div; ++i) {
1003 int i1 = isl_basic_map_alloc_div(bmap1);
1006 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1007 i_pos, o_pos, div_off);
1010 isl_basic_map_free(bmap2);
1015 isl_basic_map_free(bmap1);
1016 isl_basic_map_free(bmap2);
1020 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
1021 struct isl_dim_map *dim_map)
1025 for (i = 0; i < dim_map->len; ++i) {
1026 if (dim_map->pos[i] < 0)
1027 isl_int_set_si(dst[i], 0);
1029 isl_int_set(dst[i], src[dim_map->pos[i]]);
1033 static void copy_div_dim_map(isl_int *dst, isl_int *src,
1034 struct isl_dim_map *dim_map)
1036 isl_int_set(dst[0], src[0]);
1037 copy_constraint_dim_map(dst+1, src+1, dim_map);
1040 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
1041 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1045 if (!src || !dst || !dim_map)
1048 for (i = 0; i < src->n_eq; ++i) {
1049 int i1 = isl_basic_map_alloc_equality(dst);
1052 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1055 for (i = 0; i < src->n_ineq; ++i) {
1056 int i1 = isl_basic_map_alloc_inequality(dst);
1059 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1062 for (i = 0; i < src->n_div; ++i) {
1063 int i1 = isl_basic_map_alloc_div(dst);
1066 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1070 isl_basic_map_free(src);
1075 isl_basic_map_free(src);
1076 isl_basic_map_free(dst);
1080 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1081 struct isl_basic_set *bset2, unsigned pos)
1083 return (struct isl_basic_set *)
1084 add_constraints((struct isl_basic_map *)bset1,
1085 (struct isl_basic_map *)bset2, 0, pos);
1088 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1089 struct isl_dim *dim, unsigned extra,
1090 unsigned n_eq, unsigned n_ineq)
1092 struct isl_basic_map *ext;
1102 dims_ok = isl_dim_equal(base->dim, dim) &&
1103 base->extra >= base->n_div + extra;
1105 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1106 room_for_ineq(base, n_ineq)) {
1111 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1112 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1113 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1114 extra += base->extra;
1116 n_ineq += base->n_ineq;
1118 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1124 ext->sample = isl_vec_copy(base->sample);
1125 flags = base->flags;
1126 ext = add_constraints(ext, base, 0, 0);
1129 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1136 isl_basic_map_free(base);
1140 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1141 struct isl_dim *dim, unsigned extra,
1142 unsigned n_eq, unsigned n_ineq)
1144 return (struct isl_basic_set *)
1145 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1146 extra, n_eq, n_ineq);
1149 struct isl_basic_map *isl_basic_map_extend_constraints(
1150 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1154 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1158 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1159 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1160 unsigned n_eq, unsigned n_ineq)
1162 struct isl_basic_map *bmap;
1163 struct isl_dim *dim;
1167 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1171 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1174 isl_basic_map_free(base);
1178 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1179 unsigned nparam, unsigned dim, unsigned extra,
1180 unsigned n_eq, unsigned n_ineq)
1182 return (struct isl_basic_set *)
1183 isl_basic_map_extend((struct isl_basic_map *)base,
1184 nparam, 0, dim, extra, n_eq, n_ineq);
1187 struct isl_basic_set *isl_basic_set_extend_constraints(
1188 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1190 return (struct isl_basic_set *)
1191 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1195 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1197 return (struct isl_basic_set *)
1198 isl_basic_map_cow((struct isl_basic_map *)bset);
1201 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1206 if (bmap->ref > 1) {
1208 bmap = isl_basic_map_dup(bmap);
1211 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1215 struct isl_set *isl_set_cow(struct isl_set *set)
1223 return isl_set_dup(set);
1226 struct isl_map *isl_map_cow(struct isl_map *map)
1234 return isl_map_dup(map);
1237 static void swap_vars(struct isl_blk blk, isl_int *a,
1238 unsigned a_len, unsigned b_len)
1240 isl_seq_cpy(blk.data, a+a_len, b_len);
1241 isl_seq_cpy(blk.data+b_len, a, a_len);
1242 isl_seq_cpy(a, blk.data, b_len+a_len);
1245 struct isl_basic_set *isl_basic_set_swap_vars(
1246 struct isl_basic_set *bset, unsigned n)
1256 nparam = isl_basic_set_n_param(bset);
1257 dim = isl_basic_set_n_dim(bset);
1258 isl_assert(bset->ctx, n <= dim, goto error);
1263 bset = isl_basic_set_cow(bset);
1267 blk = isl_blk_alloc(bset->ctx, dim);
1268 if (isl_blk_is_error(blk))
1271 for (i = 0; i < bset->n_eq; ++i)
1273 bset->eq[i]+1+nparam, n, dim - n);
1275 for (i = 0; i < bset->n_ineq; ++i)
1277 bset->ineq[i]+1+nparam, n, dim - n);
1279 for (i = 0; i < bset->n_div; ++i)
1281 bset->div[i]+1+1+nparam, n, dim - n);
1283 isl_blk_free(bset->ctx, blk);
1285 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1286 bset = isl_basic_set_gauss(bset, NULL);
1287 return isl_basic_set_finalize(bset);
1289 isl_basic_set_free(bset);
1293 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1296 set = isl_set_cow(set);
1300 for (i = 0; i < set->n; ++i) {
1301 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1307 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1311 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1317 total = isl_basic_map_total_dim(bmap);
1318 isl_basic_map_free_div(bmap, bmap->n_div);
1319 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1321 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1323 i = isl_basic_map_alloc_equality(bmap);
1327 isl_int_set_si(bmap->eq[i][0], 1);
1328 isl_seq_clr(bmap->eq[i]+1, total);
1329 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1330 isl_vec_free(bmap->sample);
1331 bmap->sample = NULL;
1332 return isl_basic_map_finalize(bmap);
1334 isl_basic_map_free(bmap);
1338 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1340 return (struct isl_basic_set *)
1341 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1344 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1347 unsigned off = isl_dim_total(bmap->dim);
1348 isl_int *t = bmap->div[a];
1349 bmap->div[a] = bmap->div[b];
1352 for (i = 0; i < bmap->n_eq; ++i)
1353 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1355 for (i = 0; i < bmap->n_ineq; ++i)
1356 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1358 for (i = 0; i < bmap->n_div; ++i)
1359 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1360 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1363 /* Eliminate the specified n dimensions starting at first from the
1364 * constraints using Fourier-Motzkin. The dimensions themselves
1367 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1368 enum isl_dim_type type, unsigned first, unsigned n)
1377 map = isl_map_cow(map);
1380 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1381 first += pos(map->dim, type) - 1;
1383 for (i = 0; i < map->n; ++i) {
1384 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1394 /* Eliminate the specified n dimensions starting at first from the
1395 * constraints using Fourier-Motzkin. The dimensions themselves
1398 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1399 enum isl_dim_type type, unsigned first, unsigned n)
1401 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1404 /* Eliminate the specified n dimensions starting at first from the
1405 * constraints using Fourier-Motzkin. The dimensions themselves
1408 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1409 unsigned first, unsigned n)
1411 return isl_set_eliminate(set, isl_dim_set, first, n);
1414 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1415 __isl_take isl_basic_map *bmap)
1417 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1425 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1426 __isl_take isl_basic_set *bset)
1428 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1429 (struct isl_basic_map *)bset);
1432 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1441 set = isl_set_cow(set);
1445 for (i = 0; i < set->n; ++i) {
1446 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1456 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1457 enum isl_dim_type type, unsigned first, unsigned n)
1461 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1465 bmap = isl_basic_map_eliminate_vars(bmap,
1466 isl_basic_map_offset(bmap, type) - 1 + first, n);
1469 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1471 bmap = isl_basic_map_drop(bmap, type, first, n);
1474 isl_basic_map_free(bmap);
1478 /* Return true if the definition of the given div (recursively) involves
1479 * any of the given variables.
1481 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1482 unsigned first, unsigned n)
1485 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1487 if (isl_int_is_zero(bmap->div[div][0]))
1489 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1492 for (i = bmap->n_div - 1; i >= 0; --i) {
1493 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1495 if (div_involves_vars(bmap, i, first, n))
1502 /* Remove all divs (recursively) involving any of the given dimensions
1503 * in their definitions.
1505 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1506 __isl_take isl_basic_map *bmap,
1507 enum isl_dim_type type, unsigned first, unsigned n)
1513 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1515 first += isl_basic_map_offset(bmap, type);
1517 for (i = bmap->n_div - 1; i >= 0; --i) {
1518 if (!div_involves_vars(bmap, i, first, n))
1520 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1525 isl_basic_map_free(bmap);
1529 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1530 enum isl_dim_type type, unsigned first, unsigned n)
1539 map = isl_map_cow(map);
1543 for (i = 0; i < map->n; ++i) {
1544 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1555 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1556 enum isl_dim_type type, unsigned first, unsigned n)
1558 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1562 /* Return true if the definition of the given div is unknown or depends
1565 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1568 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1570 if (isl_int_is_zero(bmap->div[div][0]))
1573 for (i = bmap->n_div - 1; i >= 0; --i) {
1574 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1576 if (div_is_unknown(bmap, i))
1583 /* Remove all divs that are unknown or defined in terms of unknown divs.
1585 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1586 __isl_take isl_basic_map *bmap)
1593 for (i = bmap->n_div - 1; i >= 0; --i) {
1594 if (!div_is_unknown(bmap, i))
1596 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1601 isl_basic_map_free(bmap);
1605 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1614 map = isl_map_cow(map);
1618 for (i = 0; i < map->n; ++i) {
1619 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1629 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1631 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1634 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1635 __isl_take isl_basic_set *bset,
1636 enum isl_dim_type type, unsigned first, unsigned n)
1638 return (isl_basic_set *)
1639 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1642 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1643 enum isl_dim_type type, unsigned first, unsigned n)
1650 map = isl_map_cow(map);
1653 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1655 for (i = 0; i < map->n; ++i) {
1656 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1657 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1661 map = isl_map_drop(map, type, first, n);
1668 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1669 enum isl_dim_type type, unsigned first, unsigned n)
1671 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1674 /* Project out n inputs starting at first using Fourier-Motzkin */
1675 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1676 unsigned first, unsigned n)
1678 return isl_map_remove_dims(map, isl_dim_in, first, n);
1681 static void dump_term(struct isl_basic_map *bmap,
1682 isl_int c, int pos, FILE *out)
1685 unsigned in = isl_basic_map_n_in(bmap);
1686 unsigned dim = in + isl_basic_map_n_out(bmap);
1687 unsigned nparam = isl_basic_map_n_param(bmap);
1689 isl_int_print(out, c, 0);
1691 if (!isl_int_is_one(c))
1692 isl_int_print(out, c, 0);
1693 if (pos < 1 + nparam) {
1694 name = isl_dim_get_name(bmap->dim,
1695 isl_dim_param, pos - 1);
1697 fprintf(out, "%s", name);
1699 fprintf(out, "p%d", pos - 1);
1700 } else if (pos < 1 + nparam + in)
1701 fprintf(out, "i%d", pos - 1 - nparam);
1702 else if (pos < 1 + nparam + dim)
1703 fprintf(out, "o%d", pos - 1 - nparam - in);
1705 fprintf(out, "e%d", pos - 1 - nparam - dim);
1709 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1710 int sign, FILE *out)
1714 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1718 for (i = 0, first = 1; i < len; ++i) {
1719 if (isl_int_sgn(c[i]) * sign <= 0)
1722 fprintf(out, " + ");
1724 isl_int_abs(v, c[i]);
1725 dump_term(bmap, v, i, out);
1732 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1733 const char *op, FILE *out, int indent)
1737 fprintf(out, "%*s", indent, "");
1739 dump_constraint_sign(bmap, c, 1, out);
1740 fprintf(out, " %s ", op);
1741 dump_constraint_sign(bmap, c, -1, out);
1745 for (i = bmap->n_div; i < bmap->extra; ++i) {
1746 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1748 fprintf(out, "%*s", indent, "");
1749 fprintf(out, "ERROR: unused div coefficient not zero\n");
1754 static void dump_constraints(struct isl_basic_map *bmap,
1755 isl_int **c, unsigned n,
1756 const char *op, FILE *out, int indent)
1760 for (i = 0; i < n; ++i)
1761 dump_constraint(bmap, c[i], op, out, indent);
1764 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1768 unsigned total = isl_basic_map_total_dim(bmap);
1770 for (j = 0; j < 1 + total; ++j) {
1771 if (isl_int_is_zero(exp[j]))
1773 if (!first && isl_int_is_pos(exp[j]))
1775 dump_term(bmap, exp[j], j, out);
1780 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1784 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1785 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1787 for (i = 0; i < bmap->n_div; ++i) {
1788 fprintf(out, "%*s", indent, "");
1789 fprintf(out, "e%d = [(", i);
1790 dump_affine(bmap, bmap->div[i]+1, out);
1792 isl_int_print(out, bmap->div[i][0], 0);
1793 fprintf(out, "]\n");
1797 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1798 FILE *out, int indent)
1801 fprintf(out, "null basic set\n");
1805 fprintf(out, "%*s", indent, "");
1806 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1807 bset->ref, bset->dim->nparam, bset->dim->n_out,
1808 bset->extra, bset->flags);
1809 dump((struct isl_basic_map *)bset, out, indent);
1812 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1813 FILE *out, int indent)
1816 fprintf(out, "null basic map\n");
1820 fprintf(out, "%*s", indent, "");
1821 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1822 "flags: %x, n_name: %d\n",
1824 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1825 bmap->extra, bmap->flags, bmap->dim->n_name);
1826 dump(bmap, out, indent);
1829 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1834 total = isl_basic_map_total_dim(bmap);
1835 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1836 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1837 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1838 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1842 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1844 struct isl_set *set;
1848 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1849 isl_assert(dim->ctx, n >= 0, goto error);
1850 set = isl_alloc(dim->ctx, struct isl_set,
1851 sizeof(struct isl_set) +
1852 (n - 1) * sizeof(struct isl_basic_set *));
1856 set->ctx = dim->ctx;
1857 isl_ctx_ref(set->ctx);
1869 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1870 unsigned nparam, unsigned dim, int n, unsigned flags)
1872 struct isl_set *set;
1873 struct isl_dim *dims;
1875 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1879 set = isl_set_alloc_dim(dims, n, flags);
1883 /* Make sure "map" has room for at least "n" more basic maps.
1885 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1888 struct isl_map *grown = NULL;
1892 isl_assert(map->ctx, n >= 0, goto error);
1893 if (map->n + n <= map->size)
1895 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1898 for (i = 0; i < map->n; ++i) {
1899 grown->p[i] = isl_basic_map_copy(map->p[i]);
1907 isl_map_free(grown);
1912 /* Make sure "set" has room for at least "n" more basic sets.
1914 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1916 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1919 struct isl_set *isl_set_dup(struct isl_set *set)
1922 struct isl_set *dup;
1927 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1930 for (i = 0; i < set->n; ++i)
1931 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1935 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1937 struct isl_set *set;
1942 set = isl_set_alloc_dim(isl_dim_copy(bset->dim), 1, ISL_MAP_DISJOINT);
1944 isl_basic_set_free(bset);
1947 return isl_set_add_basic_set(set, bset);
1950 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1952 struct isl_map *map;
1957 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1959 isl_basic_map_free(bmap);
1962 return isl_map_add_basic_map(map, bmap);
1965 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1966 __isl_take isl_basic_set *bset)
1968 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1969 (struct isl_basic_map *)bset);
1972 void isl_set_free(struct isl_set *set)
1982 isl_ctx_deref(set->ctx);
1983 for (i = 0; i < set->n; ++i)
1984 isl_basic_set_free(set->p[i]);
1985 isl_dim_free(set->dim);
1989 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
1994 fprintf(out, "null set\n");
1998 fprintf(out, "%*s", indent, "");
1999 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2000 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2002 for (i = 0; i < set->n; ++i) {
2003 fprintf(out, "%*s", indent, "");
2004 fprintf(out, "basic set %d:\n", i);
2005 isl_basic_set_print_internal(set->p[i], out, indent+4);
2009 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2014 fprintf(out, "null map\n");
2018 fprintf(out, "%*s", indent, "");
2019 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2020 "flags: %x, n_name: %d\n",
2021 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2022 map->dim->n_out, map->flags, map->dim->n_name);
2023 for (i = 0; i < map->n; ++i) {
2024 fprintf(out, "%*s", indent, "");
2025 fprintf(out, "basic map %d:\n", i);
2026 isl_basic_map_print_internal(map->p[i], out, indent+4);
2030 struct isl_basic_map *isl_basic_map_intersect_domain(
2031 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2033 struct isl_basic_map *bmap_domain;
2038 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2039 bset->dim, isl_dim_param), goto error);
2041 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2042 isl_assert(bset->ctx,
2043 isl_basic_map_compatible_domain(bmap, bset), goto error);
2045 bmap = isl_basic_map_cow(bmap);
2048 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2049 bset->n_div, bset->n_eq, bset->n_ineq);
2050 bmap_domain = isl_basic_map_from_domain(bset);
2051 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2053 bmap = isl_basic_map_simplify(bmap);
2054 return isl_basic_map_finalize(bmap);
2056 isl_basic_map_free(bmap);
2057 isl_basic_set_free(bset);
2061 struct isl_basic_map *isl_basic_map_intersect_range(
2062 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2064 struct isl_basic_map *bmap_range;
2069 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2070 bset->dim, isl_dim_param), goto error);
2072 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2073 isl_assert(bset->ctx,
2074 isl_basic_map_compatible_range(bmap, bset), goto error);
2076 bmap = isl_basic_map_cow(bmap);
2079 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2080 bset->n_div, bset->n_eq, bset->n_ineq);
2081 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2082 bmap = add_constraints(bmap, bmap_range, 0, 0);
2084 bmap = isl_basic_map_simplify(bmap);
2085 return isl_basic_map_finalize(bmap);
2087 isl_basic_map_free(bmap);
2088 isl_basic_set_free(bset);
2092 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2098 total = 1 + isl_basic_map_total_dim(bmap);
2099 if (total != vec->size)
2104 for (i = 0; i < bmap->n_eq; ++i) {
2105 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2106 if (!isl_int_is_zero(s)) {
2112 for (i = 0; i < bmap->n_ineq; ++i) {
2113 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2114 if (isl_int_is_neg(s)) {
2125 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2127 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2130 struct isl_basic_map *isl_basic_map_intersect(
2131 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2133 struct isl_vec *sample = NULL;
2135 if (!bmap1 || !bmap2)
2138 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2139 bmap2->dim, isl_dim_param), goto error);
2140 if (isl_dim_total(bmap1->dim) ==
2141 isl_dim_size(bmap1->dim, isl_dim_param) &&
2142 isl_dim_total(bmap2->dim) !=
2143 isl_dim_size(bmap2->dim, isl_dim_param))
2144 return isl_basic_map_intersect(bmap2, bmap1);
2146 if (isl_dim_total(bmap2->dim) !=
2147 isl_dim_size(bmap2->dim, isl_dim_param))
2148 isl_assert(bmap1->ctx,
2149 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2151 if (bmap1->sample &&
2152 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2153 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2154 sample = isl_vec_copy(bmap1->sample);
2155 else if (bmap2->sample &&
2156 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2157 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2158 sample = isl_vec_copy(bmap2->sample);
2160 bmap1 = isl_basic_map_cow(bmap1);
2163 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2164 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2165 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2168 isl_vec_free(sample);
2170 isl_vec_free(bmap1->sample);
2171 bmap1->sample = sample;
2174 bmap1 = isl_basic_map_simplify(bmap1);
2175 return isl_basic_map_finalize(bmap1);
2178 isl_vec_free(sample);
2179 isl_basic_map_free(bmap1);
2180 isl_basic_map_free(bmap2);
2184 struct isl_basic_set *isl_basic_set_intersect(
2185 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2187 return (struct isl_basic_set *)
2188 isl_basic_map_intersect(
2189 (struct isl_basic_map *)bset1,
2190 (struct isl_basic_map *)bset2);
2193 /* Special case of isl_map_intersect, where both map1 and map2
2194 * are convex, without any divs and such that either map1 or map2
2195 * contains a single constraint. This constraint is then simply
2196 * added to the other map.
2198 static __isl_give isl_map *map_intersect_add_constraint(
2199 __isl_take isl_map *map1, __isl_take isl_map *map2)
2201 struct isl_basic_map *bmap1;
2202 struct isl_basic_map *bmap2;
2204 isl_assert(map1->ctx, map1->n == 1, goto error);
2205 isl_assert(map2->ctx, map1->n == 1, goto error);
2206 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2207 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2209 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2210 return isl_map_intersect(map2, map1);
2212 isl_assert(map2->ctx,
2213 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2215 map1 = isl_map_cow(map1);
2218 if (isl_map_fast_is_empty(map1)) {
2222 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2223 if (map2->p[0]->n_eq == 1)
2224 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2226 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2227 map2->p[0]->ineq[0]);
2229 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2230 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2234 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2235 isl_basic_map_free(map1->p[0]);
2248 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2251 struct isl_map *result;
2257 if (isl_map_fast_is_empty(map1)) {
2261 if (isl_map_fast_is_empty(map2)) {
2266 if (map1->n == 1 && map2->n == 1 &&
2267 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2268 isl_dim_equal(map1->dim, map2->dim) &&
2269 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2270 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2271 return map_intersect_add_constraint(map1, map2);
2272 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2273 map2->dim, isl_dim_param), goto error);
2274 if (isl_dim_total(map1->dim) ==
2275 isl_dim_size(map1->dim, isl_dim_param) &&
2276 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2277 return isl_map_intersect(map2, map1);
2279 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2280 isl_assert(map1->ctx,
2281 isl_dim_equal(map1->dim, map2->dim), goto error);
2283 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2284 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2285 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2287 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2288 map1->n * map2->n, flags);
2291 for (i = 0; i < map1->n; ++i)
2292 for (j = 0; j < map2->n; ++j) {
2293 struct isl_basic_map *part;
2294 part = isl_basic_map_intersect(
2295 isl_basic_map_copy(map1->p[i]),
2296 isl_basic_map_copy(map2->p[j]));
2297 if (isl_basic_map_is_empty(part))
2298 isl_basic_map_free(part);
2300 result = isl_map_add_basic_map(result, part);
2313 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2315 return (struct isl_set *)
2316 isl_map_intersect((struct isl_map *)set1,
2317 (struct isl_map *)set2);
2320 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2322 struct isl_dim *dim;
2323 struct isl_basic_set *bset;
2328 bmap = isl_basic_map_cow(bmap);
2331 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2332 in = isl_basic_map_n_in(bmap);
2333 bset = isl_basic_set_from_basic_map(bmap);
2334 bset = isl_basic_set_swap_vars(bset, in);
2335 return isl_basic_map_from_basic_set(bset, dim);
2338 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2339 enum isl_dim_type type, unsigned pos, unsigned n)
2341 struct isl_dim *res_dim;
2342 struct isl_basic_map *res;
2343 struct isl_dim_map *dim_map;
2344 unsigned total, off;
2345 enum isl_dim_type t;
2353 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2355 total = isl_basic_map_total_dim(bmap) + n;
2356 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2358 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2360 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2362 unsigned size = isl_basic_map_dim(bmap, t);
2363 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2365 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2366 pos, size - pos, off + pos + n);
2368 off += isl_dim_size(res_dim, t);
2370 isl_dim_map_div(dim_map, bmap, off);
2372 res = isl_basic_map_alloc_dim(res_dim,
2373 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2374 res = add_constraints_dim_map(res, bmap, dim_map);
2375 return isl_basic_map_finalize(res);
2378 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2379 enum isl_dim_type type, unsigned n)
2383 return isl_basic_map_insert(bmap, type,
2384 isl_basic_map_dim(bmap, type), n);
2387 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2388 enum isl_dim_type type, unsigned n)
2392 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2393 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2395 isl_basic_set_free(bset);
2399 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2400 enum isl_dim_type type, unsigned pos, unsigned n)
2407 map = isl_map_cow(map);
2411 map->dim = isl_dim_insert(map->dim, type, pos, n);
2415 for (i = 0; i < map->n; ++i) {
2416 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2427 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2428 enum isl_dim_type type, unsigned pos, unsigned n)
2430 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2433 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2434 enum isl_dim_type type, unsigned n)
2438 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2441 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2442 enum isl_dim_type type, unsigned n)
2446 isl_assert(set->ctx, type != isl_dim_in, goto error);
2447 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2453 __isl_give isl_basic_map *isl_basic_map_move_dims(
2454 __isl_take isl_basic_map *bmap,
2455 enum isl_dim_type dst_type, unsigned dst_pos,
2456 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2459 struct isl_dim_map *dim_map;
2460 struct isl_basic_map *res;
2461 enum isl_dim_type t;
2462 unsigned total, off;
2469 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2472 if (dst_type == src_type && dst_pos == src_pos)
2475 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2477 if (pos(bmap->dim, dst_type) + dst_pos ==
2478 pos(bmap->dim, src_type) + src_pos +
2479 ((src_type < dst_type) ? n : 0)) {
2480 bmap = isl_basic_map_cow(bmap);
2484 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2485 src_type, src_pos, n);
2489 bmap = isl_basic_map_finalize(bmap);
2494 total = isl_basic_map_total_dim(bmap);
2495 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2498 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2499 unsigned size = isl_dim_size(bmap->dim, t);
2500 if (t == dst_type) {
2501 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2504 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2507 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2508 dst_pos, size - dst_pos, off);
2509 off += size - dst_pos;
2510 } else if (t == src_type) {
2511 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2514 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2515 src_pos + n, size - src_pos - n, off);
2516 off += size - src_pos - n;
2518 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2522 isl_dim_map_div(dim_map, bmap, off);
2524 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2525 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2526 bmap = add_constraints_dim_map(res, bmap, dim_map);
2528 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2529 src_type, src_pos, n);
2533 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2534 bmap = isl_basic_map_gauss(bmap, NULL);
2535 bmap = isl_basic_map_finalize(bmap);
2539 isl_basic_map_free(bmap);
2543 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2544 enum isl_dim_type dst_type, unsigned dst_pos,
2545 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2547 return (isl_basic_set *)isl_basic_map_move_dims(
2548 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2551 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2552 enum isl_dim_type dst_type, unsigned dst_pos,
2553 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2557 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2558 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2559 src_type, src_pos, n);
2565 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2566 enum isl_dim_type dst_type, unsigned dst_pos,
2567 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2576 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2579 if (dst_type == src_type && dst_pos == src_pos)
2582 isl_assert(map->ctx, dst_type != src_type, goto error);
2584 map = isl_map_cow(map);
2588 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2592 for (i = 0; i < map->n; ++i) {
2593 map->p[i] = isl_basic_map_move_dims(map->p[i],
2595 src_type, src_pos, n);
2606 /* Move the specified dimensions to the last columns right before
2607 * the divs. Don't change the dimension specification of bmap.
2608 * That's the responsibility of the caller.
2610 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2611 enum isl_dim_type type, unsigned first, unsigned n)
2613 struct isl_dim_map *dim_map;
2614 struct isl_basic_map *res;
2615 enum isl_dim_type t;
2616 unsigned total, off;
2620 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2623 total = isl_basic_map_total_dim(bmap);
2624 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2627 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2628 unsigned size = isl_dim_size(bmap->dim, t);
2630 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2633 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2634 first, n, total - bmap->n_div - n);
2635 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2636 first + n, size - (first + n), off);
2637 off += size - (first + n);
2639 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2643 isl_dim_map_div(dim_map, bmap, off + n);
2645 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2646 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2647 res = add_constraints_dim_map(res, bmap, dim_map);
2651 /* Turn the n dimensions of type type, starting at first
2652 * into existentially quantified variables.
2654 __isl_give isl_basic_map *isl_basic_map_project_out(
2655 __isl_take isl_basic_map *bmap,
2656 enum isl_dim_type type, unsigned first, unsigned n)
2669 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2670 return isl_basic_map_remove_dims(bmap, type, first, n);
2672 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2675 bmap = move_last(bmap, type, first, n);
2676 bmap = isl_basic_map_cow(bmap);
2680 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2681 old = bmap->block2.data;
2682 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2683 (bmap->extra + n) * (1 + row_size));
2684 if (!bmap->block2.data)
2686 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2689 for (i = 0; i < n; ++i) {
2690 new_div[i] = bmap->block2.data +
2691 (bmap->extra + i) * (1 + row_size);
2692 isl_seq_clr(new_div[i], 1 + row_size);
2694 for (i = 0; i < bmap->extra; ++i)
2695 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2697 bmap->div = new_div;
2701 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2704 bmap = isl_basic_map_simplify(bmap);
2705 bmap = isl_basic_map_drop_redundant_divs(bmap);
2706 return isl_basic_map_finalize(bmap);
2708 isl_basic_map_free(bmap);
2712 /* Turn the n dimensions of type type, starting at first
2713 * into existentially quantified variables.
2715 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2716 enum isl_dim_type type, unsigned first, unsigned n)
2718 return (isl_basic_set *)isl_basic_map_project_out(
2719 (isl_basic_map *)bset, type, first, n);
2722 /* Turn the n dimensions of type type, starting at first
2723 * into existentially quantified variables.
2725 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2726 enum isl_dim_type type, unsigned first, unsigned n)
2736 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2738 map = isl_map_cow(map);
2742 map->dim = isl_dim_drop(map->dim, type, first, n);
2746 for (i = 0; i < map->n; ++i) {
2747 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2758 /* Turn the n dimensions of type type, starting at first
2759 * into existentially quantified variables.
2761 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2762 enum isl_dim_type type, unsigned first, unsigned n)
2764 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2767 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2771 for (i = 0; i < n; ++i) {
2772 j = isl_basic_map_alloc_div(bmap);
2775 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2779 isl_basic_map_free(bmap);
2783 struct isl_basic_map *isl_basic_map_apply_range(
2784 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2786 struct isl_dim *dim_result = NULL;
2787 struct isl_basic_map *bmap;
2788 unsigned n_in, n_out, n, nparam, total, pos;
2789 struct isl_dim_map *dim_map1, *dim_map2;
2791 if (!bmap1 || !bmap2)
2794 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2795 isl_dim_copy(bmap2->dim));
2797 n_in = isl_basic_map_n_in(bmap1);
2798 n_out = isl_basic_map_n_out(bmap2);
2799 n = isl_basic_map_n_out(bmap1);
2800 nparam = isl_basic_map_n_param(bmap1);
2802 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2803 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2804 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2805 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2806 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2807 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2808 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2809 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2810 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2811 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2812 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2814 bmap = isl_basic_map_alloc_dim(dim_result,
2815 bmap1->n_div + bmap2->n_div + n,
2816 bmap1->n_eq + bmap2->n_eq,
2817 bmap1->n_ineq + bmap2->n_ineq);
2818 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2819 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2820 bmap = add_divs(bmap, n);
2821 bmap = isl_basic_map_simplify(bmap);
2822 bmap = isl_basic_map_drop_redundant_divs(bmap);
2823 return isl_basic_map_finalize(bmap);
2825 isl_basic_map_free(bmap1);
2826 isl_basic_map_free(bmap2);
2830 struct isl_basic_set *isl_basic_set_apply(
2831 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2836 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2839 return (struct isl_basic_set *)
2840 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2842 isl_basic_set_free(bset);
2843 isl_basic_map_free(bmap);
2847 struct isl_basic_map *isl_basic_map_apply_domain(
2848 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2850 if (!bmap1 || !bmap2)
2853 isl_assert(bmap1->ctx,
2854 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2855 isl_assert(bmap1->ctx,
2856 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2859 bmap1 = isl_basic_map_reverse(bmap1);
2860 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2861 return isl_basic_map_reverse(bmap1);
2863 isl_basic_map_free(bmap1);
2864 isl_basic_map_free(bmap2);
2868 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2869 * A \cap B -> f(A) + f(B)
2871 struct isl_basic_map *isl_basic_map_sum(
2872 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2874 unsigned n_in, n_out, nparam, total, pos;
2875 struct isl_basic_map *bmap = NULL;
2876 struct isl_dim_map *dim_map1, *dim_map2;
2879 if (!bmap1 || !bmap2)
2882 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2885 nparam = isl_basic_map_n_param(bmap1);
2886 n_in = isl_basic_map_n_in(bmap1);
2887 n_out = isl_basic_map_n_out(bmap1);
2889 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2890 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2891 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2892 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2893 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2894 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2895 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2896 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2897 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2898 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2899 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2901 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2902 bmap1->n_div + bmap2->n_div + 2 * n_out,
2903 bmap1->n_eq + bmap2->n_eq + n_out,
2904 bmap1->n_ineq + bmap2->n_ineq);
2905 for (i = 0; i < n_out; ++i) {
2906 int j = isl_basic_map_alloc_equality(bmap);
2909 isl_seq_clr(bmap->eq[j], 1+total);
2910 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2911 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2912 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2914 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2915 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2916 bmap = add_divs(bmap, 2 * n_out);
2918 bmap = isl_basic_map_simplify(bmap);
2919 return isl_basic_map_finalize(bmap);
2921 isl_basic_map_free(bmap);
2922 isl_basic_map_free(bmap1);
2923 isl_basic_map_free(bmap2);
2927 /* Given two maps A -> f(A) and B -> g(B), construct a map
2928 * A \cap B -> f(A) + f(B)
2930 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2932 struct isl_map *result;
2938 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2940 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2941 map1->n * map2->n, 0);
2944 for (i = 0; i < map1->n; ++i)
2945 for (j = 0; j < map2->n; ++j) {
2946 struct isl_basic_map *part;
2947 part = isl_basic_map_sum(
2948 isl_basic_map_copy(map1->p[i]),
2949 isl_basic_map_copy(map2->p[j]));
2950 if (isl_basic_map_is_empty(part))
2951 isl_basic_map_free(part);
2953 result = isl_map_add_basic_map(result, part);
2966 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2967 __isl_take isl_set *set2)
2969 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2972 /* Given a basic map A -> f(A), construct A -> -f(A).
2974 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2979 bmap = isl_basic_map_cow(bmap);
2983 n = isl_basic_map_dim(bmap, isl_dim_out);
2984 off = isl_basic_map_offset(bmap, isl_dim_out);
2985 for (i = 0; i < bmap->n_eq; ++i)
2986 for (j = 0; j < n; ++j)
2987 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2988 for (i = 0; i < bmap->n_ineq; ++i)
2989 for (j = 0; j < n; ++j)
2990 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2991 for (i = 0; i < bmap->n_div; ++i)
2992 for (j = 0; j < n; ++j)
2993 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2994 return isl_basic_map_finalize(bmap);
2997 /* Given a map A -> f(A), construct A -> -f(A).
2999 struct isl_map *isl_map_neg(struct isl_map *map)
3003 map = isl_map_cow(map);
3007 for (i = 0; i < map->n; ++i) {
3008 map->p[i] = isl_basic_map_neg(map->p[i]);
3019 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3021 return (isl_set *)isl_map_neg((isl_map *)set);
3024 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3025 * A -> floor(f(A)/d).
3027 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3030 unsigned n_in, n_out, nparam, total, pos;
3031 struct isl_basic_map *result = NULL;
3032 struct isl_dim_map *dim_map;
3038 nparam = isl_basic_map_n_param(bmap);
3039 n_in = isl_basic_map_n_in(bmap);
3040 n_out = isl_basic_map_n_out(bmap);
3042 total = nparam + n_in + n_out + bmap->n_div + n_out;
3043 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3044 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3045 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3046 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3047 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3049 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3050 bmap->n_div + n_out,
3051 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3052 result = add_constraints_dim_map(result, bmap, dim_map);
3053 result = add_divs(result, n_out);
3054 for (i = 0; i < n_out; ++i) {
3056 j = isl_basic_map_alloc_inequality(result);
3059 isl_seq_clr(result->ineq[j], 1+total);
3060 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3061 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3062 j = isl_basic_map_alloc_inequality(result);
3065 isl_seq_clr(result->ineq[j], 1+total);
3066 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3067 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3068 isl_int_sub_ui(result->ineq[j][0], d, 1);
3071 result = isl_basic_map_simplify(result);
3072 return isl_basic_map_finalize(result);
3074 isl_basic_map_free(result);
3078 /* Given a map A -> f(A) and an integer d, construct a map
3079 * A -> floor(f(A)/d).
3081 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3085 map = isl_map_cow(map);
3089 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3090 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3091 for (i = 0; i < map->n; ++i) {
3092 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3103 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3109 i = isl_basic_map_alloc_equality(bmap);
3112 nparam = isl_basic_map_n_param(bmap);
3113 n_in = isl_basic_map_n_in(bmap);
3114 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3115 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3116 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3117 return isl_basic_map_finalize(bmap);
3119 isl_basic_map_free(bmap);
3123 /* Add a constraints to "bmap" expressing i_pos < o_pos
3125 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3131 i = isl_basic_map_alloc_inequality(bmap);
3134 nparam = isl_basic_map_n_param(bmap);
3135 n_in = isl_basic_map_n_in(bmap);
3136 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3137 isl_int_set_si(bmap->ineq[i][0], -1);
3138 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3139 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3140 return isl_basic_map_finalize(bmap);
3142 isl_basic_map_free(bmap);
3146 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3148 static __isl_give isl_basic_map *var_less_or_equal(
3149 __isl_take isl_basic_map *bmap, unsigned pos)
3155 i = isl_basic_map_alloc_inequality(bmap);
3158 nparam = isl_basic_map_n_param(bmap);
3159 n_in = isl_basic_map_n_in(bmap);
3160 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3161 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3162 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3163 return isl_basic_map_finalize(bmap);
3165 isl_basic_map_free(bmap);
3169 /* Add a constraints to "bmap" expressing i_pos > o_pos
3171 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3177 i = isl_basic_map_alloc_inequality(bmap);
3180 nparam = isl_basic_map_n_param(bmap);
3181 n_in = isl_basic_map_n_in(bmap);
3182 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3183 isl_int_set_si(bmap->ineq[i][0], -1);
3184 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3185 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3186 return isl_basic_map_finalize(bmap);
3188 isl_basic_map_free(bmap);
3192 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3194 static __isl_give isl_basic_map *var_more_or_equal(
3195 __isl_take isl_basic_map *bmap, unsigned pos)
3201 i = isl_basic_map_alloc_inequality(bmap);
3204 nparam = isl_basic_map_n_param(bmap);
3205 n_in = isl_basic_map_n_in(bmap);
3206 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3207 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3208 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3209 return isl_basic_map_finalize(bmap);
3211 isl_basic_map_free(bmap);
3215 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3218 struct isl_basic_map *bmap;
3219 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3222 for (i = 0; i < n_equal && bmap; ++i)
3223 bmap = var_equal(bmap, i);
3224 return isl_basic_map_finalize(bmap);
3227 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3229 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3232 struct isl_basic_map *bmap;
3233 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3236 for (i = 0; i < pos && bmap; ++i)
3237 bmap = var_equal(bmap, i);
3239 bmap = var_less(bmap, pos);
3240 return isl_basic_map_finalize(bmap);
3243 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3245 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3246 __isl_take isl_dim *dim, unsigned pos)
3249 isl_basic_map *bmap;
3251 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3252 for (i = 0; i < pos; ++i)
3253 bmap = var_equal(bmap, i);
3254 bmap = var_less_or_equal(bmap, pos);
3255 return isl_basic_map_finalize(bmap);
3258 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3260 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3263 struct isl_basic_map *bmap;
3264 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3267 for (i = 0; i < pos && bmap; ++i)
3268 bmap = var_equal(bmap, i);
3270 bmap = var_more(bmap, pos);
3271 return isl_basic_map_finalize(bmap);
3274 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3276 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3277 __isl_take isl_dim *dim, unsigned pos)
3280 isl_basic_map *bmap;
3282 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3283 for (i = 0; i < pos; ++i)
3284 bmap = var_equal(bmap, i);
3285 bmap = var_more_or_equal(bmap, pos);
3286 return isl_basic_map_finalize(bmap);
3289 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3290 unsigned n, int equal)
3292 struct isl_map *map;
3295 if (n == 0 && equal)
3296 return isl_map_universe(dims);
3298 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3300 for (i = 0; i + 1 < n; ++i)
3301 map = isl_map_add_basic_map(map,
3302 isl_basic_map_less_at(isl_dim_copy(dims), i));
3305 map = isl_map_add_basic_map(map,
3306 isl_basic_map_less_or_equal_at(dims, n - 1));
3308 map = isl_map_add_basic_map(map,
3309 isl_basic_map_less_at(dims, n - 1));
3316 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3320 return map_lex_lte_first(dims, dims->n_out, equal);
3323 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3325 return map_lex_lte_first(dim, n, 0);
3328 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3330 return map_lex_lte_first(dim, n, 1);
3333 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3335 return map_lex_lte(isl_dim_map(set_dim), 0);
3338 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3340 return map_lex_lte(isl_dim_map(set_dim), 1);
3343 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3344 unsigned n, int equal)
3346 struct isl_map *map;
3349 if (n == 0 && equal)
3350 return isl_map_universe(dims);
3352 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3354 for (i = 0; i + 1 < n; ++i)
3355 map = isl_map_add_basic_map(map,
3356 isl_basic_map_more_at(isl_dim_copy(dims), i));
3359 map = isl_map_add_basic_map(map,
3360 isl_basic_map_more_or_equal_at(dims, n - 1));
3362 map = isl_map_add_basic_map(map,
3363 isl_basic_map_more_at(dims, n - 1));
3370 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3374 return map_lex_gte_first(dims, dims->n_out, equal);
3377 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3379 return map_lex_gte_first(dim, n, 0);
3382 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3384 return map_lex_gte_first(dim, n, 1);
3387 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3389 return map_lex_gte(isl_dim_map(set_dim), 0);
3392 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3394 return map_lex_gte(isl_dim_map(set_dim), 1);
3397 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3398 __isl_take isl_set *set2)
3401 map = isl_map_lex_le(isl_set_get_dim(set1));
3402 map = isl_map_intersect_domain(map, set1);
3403 map = isl_map_intersect_range(map, set2);
3407 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3408 __isl_take isl_set *set2)
3411 map = isl_map_lex_lt(isl_set_get_dim(set1));
3412 map = isl_map_intersect_domain(map, set1);
3413 map = isl_map_intersect_range(map, set2);
3417 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3418 __isl_take isl_set *set2)
3421 map = isl_map_lex_ge(isl_set_get_dim(set1));
3422 map = isl_map_intersect_domain(map, set1);
3423 map = isl_map_intersect_range(map, set2);
3427 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3428 __isl_take isl_set *set2)
3431 map = isl_map_lex_gt(isl_set_get_dim(set1));
3432 map = isl_map_intersect_domain(map, set1);
3433 map = isl_map_intersect_range(map, set2);
3437 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3438 __isl_take isl_map *map2)
3441 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3442 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3443 map = isl_map_apply_range(map, isl_map_reverse(map2));
3447 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3448 __isl_take isl_map *map2)
3451 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3452 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3453 map = isl_map_apply_range(map, isl_map_reverse(map2));
3457 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3458 __isl_take isl_map *map2)
3461 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3462 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3463 map = isl_map_apply_range(map, isl_map_reverse(map2));
3467 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3468 __isl_take isl_map *map2)
3471 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3472 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3473 map = isl_map_apply_range(map, isl_map_reverse(map2));
3477 struct isl_basic_map *isl_basic_map_from_basic_set(
3478 struct isl_basic_set *bset, struct isl_dim *dim)
3480 struct isl_basic_map *bmap;
3482 bset = isl_basic_set_cow(bset);
3486 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3487 isl_dim_free(bset->dim);
3488 bmap = (struct isl_basic_map *) bset;
3490 return isl_basic_map_finalize(bmap);
3492 isl_basic_set_free(bset);
3497 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3501 if (bmap->dim->n_in == 0)
3502 return (struct isl_basic_set *)bmap;
3503 bmap = isl_basic_map_cow(bmap);
3506 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3509 bmap = isl_basic_map_finalize(bmap);
3510 return (struct isl_basic_set *)bmap;
3512 isl_basic_map_free(bmap);
3516 /* For a div d = floor(f/m), add the constraints
3519 * -(f-(n-1)) + m d >= 0
3521 * Note that the second constraint is the negation of
3525 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3526 unsigned pos, isl_int *div)
3529 unsigned total = isl_basic_map_total_dim(bmap);
3531 i = isl_basic_map_alloc_inequality(bmap);
3534 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3535 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3537 j = isl_basic_map_alloc_inequality(bmap);
3540 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3541 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3542 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3546 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3547 unsigned pos, isl_int *div)
3549 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3553 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3555 unsigned total = isl_basic_map_total_dim(bmap);
3556 unsigned div_pos = total - bmap->n_div + div;
3558 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3562 struct isl_basic_set *isl_basic_map_underlying_set(
3563 struct isl_basic_map *bmap)
3567 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3569 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3570 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3571 return (struct isl_basic_set *)bmap;
3572 bmap = isl_basic_map_cow(bmap);
3575 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3578 bmap->extra -= bmap->n_div;
3580 bmap = isl_basic_map_finalize(bmap);
3581 return (struct isl_basic_set *)bmap;
3586 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3587 __isl_take isl_basic_set *bset)
3589 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3592 struct isl_basic_map *isl_basic_map_overlying_set(
3593 struct isl_basic_set *bset, struct isl_basic_map *like)
3595 struct isl_basic_map *bmap;
3596 struct isl_ctx *ctx;
3603 isl_assert(ctx, bset->n_div == 0, goto error);
3604 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3605 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3607 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3608 isl_basic_map_free(like);
3609 return (struct isl_basic_map *)bset;
3611 bset = isl_basic_set_cow(bset);
3614 total = bset->dim->n_out + bset->extra;
3615 bmap = (struct isl_basic_map *)bset;
3616 isl_dim_free(bmap->dim);
3617 bmap->dim = isl_dim_copy(like->dim);
3620 bmap->n_div = like->n_div;
3621 bmap->extra += like->n_div;
3624 ltotal = total - bmap->extra + like->extra;
3627 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3628 bmap->extra * (1 + 1 + total));
3629 if (isl_blk_is_error(bmap->block2))
3631 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3635 for (i = 0; i < bmap->extra; ++i)
3636 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3637 for (i = 0; i < like->n_div; ++i) {
3638 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3639 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3641 bmap = isl_basic_map_extend_constraints(bmap,
3642 0, 2 * like->n_div);
3643 for (i = 0; i < like->n_div; ++i) {
3644 if (isl_int_is_zero(bmap->div[i][0]))
3646 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3650 isl_basic_map_free(like);
3651 bmap = isl_basic_map_simplify(bmap);
3652 bmap = isl_basic_map_finalize(bmap);
3655 isl_basic_map_free(like);
3656 isl_basic_set_free(bset);
3660 struct isl_basic_set *isl_basic_set_from_underlying_set(
3661 struct isl_basic_set *bset, struct isl_basic_set *like)
3663 return (struct isl_basic_set *)
3664 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3667 struct isl_set *isl_set_from_underlying_set(
3668 struct isl_set *set, struct isl_basic_set *like)
3674 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3676 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3677 isl_basic_set_free(like);
3680 set = isl_set_cow(set);
3683 for (i = 0; i < set->n; ++i) {
3684 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3685 isl_basic_set_copy(like));
3689 isl_dim_free(set->dim);
3690 set->dim = isl_dim_copy(like->dim);
3693 isl_basic_set_free(like);
3696 isl_basic_set_free(like);
3701 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3705 map = isl_map_cow(map);
3708 map->dim = isl_dim_cow(map->dim);
3712 for (i = 1; i < map->n; ++i)
3713 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3715 for (i = 0; i < map->n; ++i) {
3716 map->p[i] = (struct isl_basic_map *)
3717 isl_basic_map_underlying_set(map->p[i]);
3722 map->dim = isl_dim_underlying(map->dim, 0);
3724 isl_dim_free(map->dim);
3725 map->dim = isl_dim_copy(map->p[0]->dim);
3729 return (struct isl_set *)map;
3735 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3737 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3740 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3741 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3743 bmap = isl_basic_map_cow(bmap);
3747 isl_dim_free(bmap->dim);
3750 bmap = isl_basic_map_finalize(bmap);
3754 isl_basic_map_free(bmap);
3759 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3760 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3762 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3766 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3767 __isl_take isl_dim *dim)
3771 map = isl_map_cow(map);
3775 for (i = 0; i < map->n; ++i) {
3776 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3781 isl_dim_free(map->dim);
3791 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3792 __isl_take isl_dim *dim)
3794 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3797 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3800 struct isl_basic_set *domain;
3806 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3808 n_in = isl_basic_map_n_in(bmap);
3809 n_out = isl_basic_map_n_out(bmap);
3810 domain = isl_basic_set_from_basic_map(bmap);
3811 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3813 domain = isl_basic_set_reset_dim(domain, dim);
3818 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3820 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3823 __isl_give isl_basic_map *isl_basic_map_domain_map(
3824 __isl_take isl_basic_map *bmap)
3828 isl_basic_map *domain;
3829 isl_basic_set *bset;
3830 int nparam, n_in, n_out;
3833 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3834 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3835 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3837 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3838 domain = isl_basic_map_universe(dim);
3840 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3841 bmap = isl_basic_map_apply_range(bmap, domain);
3842 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3844 total = isl_basic_map_total_dim(bmap);
3846 for (i = 0; i < n_in; ++i) {
3847 k = isl_basic_map_alloc_equality(bmap);
3850 isl_seq_clr(bmap->eq[k], 1 + total);
3851 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3852 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3855 bmap = isl_basic_map_gauss(bmap, NULL);
3856 return isl_basic_map_finalize(bmap);
3858 isl_basic_map_free(bmap);
3862 __isl_give isl_basic_map *isl_basic_map_range_map(
3863 __isl_take isl_basic_map *bmap)
3867 isl_basic_map *range;
3868 isl_basic_set *bset;
3869 int nparam, n_in, n_out;
3872 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3873 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3874 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3876 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3877 range = isl_basic_map_universe(dim);
3879 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3880 bmap = isl_basic_map_apply_range(bmap, range);
3881 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3883 total = isl_basic_map_total_dim(bmap);
3885 for (i = 0; i < n_out; ++i) {
3886 k = isl_basic_map_alloc_equality(bmap);
3889 isl_seq_clr(bmap->eq[k], 1 + total);
3890 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3891 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3894 bmap = isl_basic_map_gauss(bmap, NULL);
3895 return isl_basic_map_finalize(bmap);
3897 isl_basic_map_free(bmap);
3901 struct isl_set *isl_map_range(struct isl_map *map)
3904 struct isl_set *set;
3908 if (isl_map_dim(map, isl_dim_in) == 0)
3909 return (isl_set *)map;
3911 map = isl_map_cow(map);
3915 set = (struct isl_set *) map;
3916 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3919 for (i = 0; i < map->n; ++i) {
3920 set->p[i] = isl_basic_map_range(map->p[i]);
3924 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3925 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3932 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3935 isl_dim *domain_dim;
3937 map = isl_map_cow(map);
3941 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3942 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3943 map->dim = isl_dim_join(map->dim, domain_dim);
3946 for (i = 0; i < map->n; ++i) {
3947 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3951 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3952 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3959 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3964 map = isl_map_cow(map);
3968 range_dim = isl_dim_range(isl_map_get_dim(map));
3969 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3970 map->dim = isl_dim_join(map->dim, range_dim);
3973 for (i = 0; i < map->n; ++i) {
3974 map->p[i] = isl_basic_map_range_map(map->p[i]);
3978 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3979 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3986 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3989 struct isl_map *map = NULL;
3991 set = isl_set_cow(set);
3994 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3995 map = (struct isl_map *)set;
3996 for (i = 0; i < set->n; ++i) {
3997 map->p[i] = isl_basic_map_from_basic_set(
3998 set->p[i], isl_dim_copy(dim));
4002 isl_dim_free(map->dim);
4011 __isl_give isl_basic_map *isl_basic_map_from_domain(
4012 __isl_take isl_basic_set *bset)
4014 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4017 __isl_give isl_basic_map *isl_basic_map_from_range(
4018 __isl_take isl_basic_set *bset)
4020 return (isl_basic_map *)bset;
4023 struct isl_map *isl_map_from_range(struct isl_set *set)
4025 return (struct isl_map *)set;
4028 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4030 return isl_map_reverse(isl_map_from_range(set));
4033 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4034 __isl_take isl_set *range)
4036 return isl_map_apply_range(isl_map_from_domain(domain),
4037 isl_map_from_range(range));
4040 struct isl_set *isl_set_from_map(struct isl_map *map)
4043 struct isl_set *set = NULL;
4047 map = isl_map_cow(map);
4050 map->dim = isl_dim_as_set_dim(map->dim);
4053 set = (struct isl_set *)map;
4054 for (i = 0; i < map->n; ++i) {
4055 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4065 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4067 struct isl_map *map;
4071 isl_assert(dim->ctx, n >= 0, return NULL);
4072 map = isl_alloc(dim->ctx, struct isl_map,
4073 sizeof(struct isl_map) +
4074 (n - 1) * sizeof(struct isl_basic_map *));
4078 map->ctx = dim->ctx;
4079 isl_ctx_ref(map->ctx);
4091 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4092 unsigned nparam, unsigned in, unsigned out, int n,
4095 struct isl_map *map;
4096 struct isl_dim *dims;
4098 dims = isl_dim_alloc(ctx, nparam, in, out);
4102 map = isl_map_alloc_dim(dims, n, flags);
4106 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4108 struct isl_basic_map *bmap;
4109 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4110 bmap = isl_basic_map_set_to_empty(bmap);
4114 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4116 struct isl_basic_set *bset;
4117 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4118 bset = isl_basic_set_set_to_empty(bset);
4122 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4124 struct isl_basic_map *bmap;
4127 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4128 bmap = isl_basic_map_set_to_empty(bmap);
4132 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4134 struct isl_basic_map *bmap;
4137 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4138 bmap = isl_basic_map_set_to_empty(bmap);
4142 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4144 struct isl_basic_set *bset;
4147 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4148 bset = isl_basic_set_set_to_empty(bset);
4152 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4154 struct isl_basic_map *bmap;
4155 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4156 bmap = isl_basic_map_finalize(bmap);
4160 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4162 struct isl_basic_set *bset;
4163 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4164 bset = isl_basic_set_finalize(bset);
4168 __isl_give isl_basic_map *isl_basic_map_universe_like(
4169 __isl_keep isl_basic_map *model)
4173 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4176 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4180 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4183 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4184 __isl_keep isl_set *model)
4188 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4191 struct isl_map *isl_map_empty(struct isl_dim *dim)
4193 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4196 struct isl_map *isl_map_empty_like(struct isl_map *model)
4200 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4203 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4207 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4210 struct isl_set *isl_set_empty(struct isl_dim *dim)
4212 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4215 struct isl_set *isl_set_empty_like(struct isl_set *model)
4219 return isl_set_empty(isl_dim_copy(model->dim));
4222 struct isl_map *isl_map_universe(struct isl_dim *dim)
4224 struct isl_map *map;
4227 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4228 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4232 struct isl_set *isl_set_universe(struct isl_dim *dim)
4234 struct isl_set *set;
4237 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4238 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4242 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4246 return isl_set_universe(isl_dim_copy(model->dim));
4249 struct isl_map *isl_map_dup(struct isl_map *map)
4252 struct isl_map *dup;
4256 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4257 for (i = 0; i < map->n; ++i)
4258 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4262 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4263 __isl_take isl_basic_map *bmap)
4267 if (isl_basic_map_fast_is_empty(bmap)) {
4268 isl_basic_map_free(bmap);
4271 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4272 isl_assert(map->ctx, map->n < map->size, goto error);
4273 map->p[map->n] = bmap;
4275 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4281 isl_basic_map_free(bmap);
4285 void isl_map_free(struct isl_map *map)
4295 isl_ctx_deref(map->ctx);
4296 for (i = 0; i < map->n; ++i)
4297 isl_basic_map_free(map->p[i]);
4298 isl_dim_free(map->dim);
4302 struct isl_map *isl_map_extend(struct isl_map *base,
4303 unsigned nparam, unsigned n_in, unsigned n_out)
4307 base = isl_map_cow(base);
4311 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4314 for (i = 0; i < base->n; ++i) {
4315 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4316 isl_dim_copy(base->dim), 0, 0, 0);
4326 struct isl_set *isl_set_extend(struct isl_set *base,
4327 unsigned nparam, unsigned dim)
4329 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4333 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4334 struct isl_basic_map *bmap, unsigned pos, int value)
4338 bmap = isl_basic_map_cow(bmap);
4339 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4340 j = isl_basic_map_alloc_equality(bmap);
4343 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4344 isl_int_set_si(bmap->eq[j][pos], -1);
4345 isl_int_set_si(bmap->eq[j][0], value);
4346 bmap = isl_basic_map_simplify(bmap);
4347 return isl_basic_map_finalize(bmap);
4349 isl_basic_map_free(bmap);
4353 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4354 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4358 bmap = isl_basic_map_cow(bmap);
4359 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4360 j = isl_basic_map_alloc_equality(bmap);
4363 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4364 isl_int_set_si(bmap->eq[j][pos], -1);
4365 isl_int_set(bmap->eq[j][0], value);
4366 bmap = isl_basic_map_simplify(bmap);
4367 return isl_basic_map_finalize(bmap);
4369 isl_basic_map_free(bmap);
4373 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4374 enum isl_dim_type type, unsigned pos, int value)
4378 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4379 return isl_basic_map_fix_pos_si(bmap,
4380 isl_basic_map_offset(bmap, type) + pos, value);
4382 isl_basic_map_free(bmap);
4386 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4387 enum isl_dim_type type, unsigned pos, isl_int value)
4391 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4392 return isl_basic_map_fix_pos(bmap,
4393 isl_basic_map_offset(bmap, type) + pos, value);
4395 isl_basic_map_free(bmap);
4399 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4400 enum isl_dim_type type, unsigned pos, int value)
4402 return (struct isl_basic_set *)
4403 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4407 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4408 enum isl_dim_type type, unsigned pos, isl_int value)
4410 return (struct isl_basic_set *)
4411 isl_basic_map_fix((struct isl_basic_map *)bset,
4415 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4416 unsigned input, int value)
4418 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4421 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4422 unsigned dim, int value)
4424 return (struct isl_basic_set *)
4425 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4426 isl_dim_set, dim, value);
4429 struct isl_map *isl_map_fix_si(struct isl_map *map,
4430 enum isl_dim_type type, unsigned pos, int value)
4434 map = isl_map_cow(map);
4438 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4439 for (i = 0; i < map->n; ++i) {
4440 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4444 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4451 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4452 enum isl_dim_type type, unsigned pos, int value)
4454 return (struct isl_set *)
4455 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4458 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4459 enum isl_dim_type type, unsigned pos, isl_int value)
4463 map = isl_map_cow(map);
4467 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4468 for (i = 0; i < map->n; ++i) {
4469 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4473 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4480 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4481 enum isl_dim_type type, unsigned pos, isl_int value)
4483 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4486 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4487 unsigned input, int value)
4489 return isl_map_fix_si(map, isl_dim_in, input, value);
4492 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4494 return (struct isl_set *)
4495 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4498 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4499 __isl_take isl_basic_map *bmap,
4500 enum isl_dim_type type, unsigned pos, int value)
4506 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4507 pos += isl_basic_map_offset(bmap, type);
4508 bmap = isl_basic_map_cow(bmap);
4509 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4510 j = isl_basic_map_alloc_inequality(bmap);
4513 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4514 isl_int_set_si(bmap->ineq[j][pos], 1);
4515 isl_int_set_si(bmap->ineq[j][0], -value);
4516 bmap = isl_basic_map_simplify(bmap);
4517 return isl_basic_map_finalize(bmap);
4519 isl_basic_map_free(bmap);
4523 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4524 unsigned dim, isl_int value)
4528 bset = isl_basic_set_cow(bset);
4529 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4530 j = isl_basic_set_alloc_inequality(bset);
4533 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4534 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4535 isl_int_neg(bset->ineq[j][0], value);
4536 bset = isl_basic_set_simplify(bset);
4537 return isl_basic_set_finalize(bset);
4539 isl_basic_set_free(bset);
4543 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4544 enum isl_dim_type type, unsigned pos, int value)
4548 map = isl_map_cow(map);
4552 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4553 for (i = 0; i < map->n; ++i) {
4554 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4559 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4566 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4567 enum isl_dim_type type, unsigned pos, int value)
4569 return (struct isl_set *)
4570 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4573 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4578 set = isl_set_cow(set);
4582 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4583 for (i = 0; i < set->n; ++i) {
4584 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4594 struct isl_map *isl_map_reverse(struct isl_map *map)
4598 map = isl_map_cow(map);
4602 map->dim = isl_dim_reverse(map->dim);
4605 for (i = 0; i < map->n; ++i) {
4606 map->p[i] = isl_basic_map_reverse(map->p[i]);
4610 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4617 static struct isl_map *isl_basic_map_partial_lexopt(
4618 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4619 struct isl_set **empty, int max)
4623 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4624 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4626 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4628 isl_basic_map_free(bmap);
4629 isl_basic_set_free(dom);
4635 struct isl_map *isl_basic_map_partial_lexmax(
4636 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4637 struct isl_set **empty)
4639 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4642 struct isl_map *isl_basic_map_partial_lexmin(
4643 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4644 struct isl_set **empty)
4646 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4649 struct isl_set *isl_basic_set_partial_lexmin(
4650 struct isl_basic_set *bset, struct isl_basic_set *dom,
4651 struct isl_set **empty)
4653 return (struct isl_set *)
4654 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4658 struct isl_set *isl_basic_set_partial_lexmax(
4659 struct isl_basic_set *bset, struct isl_basic_set *dom,
4660 struct isl_set **empty)
4662 return (struct isl_set *)
4663 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4667 /* Given a basic map "bmap", compute the lexicographically minimal
4668 * (or maximal) image element for each domain element in dom.
4669 * Set *empty to those elements in dom that do not have an image element.
4671 * We first make sure the basic sets in dom are disjoint and then
4672 * simply collect the results over each of the basic sets separately.
4673 * We could probably improve the efficiency a bit by moving the union
4674 * domain down into the parametric integer programming.
4676 static __isl_give isl_map *basic_map_partial_lexopt(
4677 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4678 __isl_give isl_set **empty, int max)
4681 struct isl_map *res;
4683 dom = isl_set_make_disjoint(dom);
4687 if (isl_set_fast_is_empty(dom)) {
4688 res = isl_map_empty_like_basic_map(bmap);
4689 *empty = isl_set_empty_like(dom);
4691 isl_basic_map_free(bmap);
4695 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4696 isl_basic_set_copy(dom->p[0]), empty, max);
4698 for (i = 1; i < dom->n; ++i) {
4699 struct isl_map *res_i;
4700 struct isl_set *empty_i;
4702 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4703 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4705 res = isl_map_union_disjoint(res, res_i);
4706 *empty = isl_set_union_disjoint(*empty, empty_i);
4710 isl_basic_map_free(bmap);
4715 isl_basic_map_free(bmap);
4719 /* Given a map "map", compute the lexicographically minimal
4720 * (or maximal) image element for each domain element in dom.
4721 * Set *empty to those elements in dom that do not have an image element.
4723 * We first compute the lexicographically minimal or maximal element
4724 * in the first basic map. This results in a partial solution "res"
4725 * and a subset "todo" of dom that still need to be handled.
4726 * We then consider each of the remaining maps in "map" and successively
4727 * improve both "res" and "todo".
4729 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4730 * Assume we are computing the lexicographical maximum.
4731 * We first compute the lexicographically maximal element in basic map i.
4732 * This results in a partial solution res_i and a subset todo_i.
4733 * Then we combine these results with those obtain for the first k basic maps
4734 * to obtain a result that is valid for the first k+1 basic maps.
4735 * In particular, the set where there is no solution is the set where
4736 * there is no solution for the first k basic maps and also no solution
4737 * for the ith basic map, i.e.,
4739 * todo^i = todo^k * todo_i
4741 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4742 * solutions, arbitrarily breaking ties in favor of res^k.
4743 * That is, when res^k(a) >= res_i(a), we pick res^k and
4744 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4745 * the lexicographic order.)
4746 * In practice, we compute
4748 * res^k * (res_i . "<=")
4752 * res_i * (res^k . "<")
4754 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4755 * where only one of res^k and res_i provides a solution and we simply pick
4762 * Note that we only compute these intersections when dom(res^k) intersects
4763 * dom(res_i). Otherwise, the only effect of these intersections is to
4764 * potentially break up res^k and res_i into smaller pieces.
4765 * We want to avoid such splintering as much as possible.
4766 * In fact, an earlier implementation of this function would look for
4767 * better results in the domain of res^k and for extra results in todo^k,
4768 * but this would always result in a splintering according to todo^k,
4769 * even when the domain of basic map i is disjoint from the domains of
4770 * the previous basic maps.
4772 static __isl_give isl_map *isl_map_partial_lexopt(
4773 __isl_take isl_map *map, __isl_take isl_set *dom,
4774 __isl_give isl_set **empty, int max)
4777 struct isl_map *res;
4778 struct isl_set *todo;
4783 if (isl_map_fast_is_empty(map)) {
4791 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4792 isl_set_copy(dom), &todo, max);
4794 for (i = 1; i < map->n; ++i) {
4798 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4800 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4801 isl_set_copy(dom), &todo_i, max);
4804 lt = isl_map_lex_lt(isl_dim_copy(dim));
4805 le = isl_map_lex_le(dim);
4807 lt = isl_map_lex_gt(isl_dim_copy(dim));
4808 le = isl_map_lex_ge(dim);
4810 lt = isl_map_apply_range(isl_map_copy(res), lt);
4811 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4812 le = isl_map_apply_range(isl_map_copy(res_i), le);
4813 le = isl_map_intersect(le, isl_map_copy(res));
4815 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4816 res = isl_map_intersect_domain(res,
4817 isl_set_copy(todo_i));
4818 res_i = isl_map_intersect_domain(res_i,
4819 isl_set_copy(todo));
4822 res = isl_map_union_disjoint(res, res_i);
4823 res = isl_map_union_disjoint(res, lt);
4824 res = isl_map_union_disjoint(res, le);
4826 todo = isl_set_intersect(todo, todo_i);
4846 __isl_give isl_map *isl_map_partial_lexmax(
4847 __isl_take isl_map *map, __isl_take isl_set *dom,
4848 __isl_give isl_set **empty)
4850 return isl_map_partial_lexopt(map, dom, empty, 1);
4853 __isl_give isl_map *isl_map_partial_lexmin(
4854 __isl_take isl_map *map, __isl_take isl_set *dom,
4855 __isl_give isl_set **empty)
4857 return isl_map_partial_lexopt(map, dom, empty, 0);
4860 __isl_give isl_set *isl_set_partial_lexmin(
4861 __isl_take isl_set *set, __isl_take isl_set *dom,
4862 __isl_give isl_set **empty)
4864 return (struct isl_set *)
4865 isl_map_partial_lexmin((struct isl_map *)set,
4869 __isl_give isl_set *isl_set_partial_lexmax(
4870 __isl_take isl_set *set, __isl_take isl_set *dom,
4871 __isl_give isl_set **empty)
4873 return (struct isl_set *)
4874 isl_map_partial_lexmax((struct isl_map *)set,
4878 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4880 struct isl_basic_set *dom = NULL;
4881 struct isl_dim *dom_dim;
4885 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4886 dom = isl_basic_set_universe(dom_dim);
4887 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4889 isl_basic_map_free(bmap);
4893 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4895 return isl_basic_map_lexopt(bmap, 0);
4898 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4900 return isl_basic_map_lexopt(bmap, 1);
4903 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4905 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4908 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4910 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4913 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4915 struct isl_set *dom = NULL;
4916 struct isl_dim *dom_dim;
4920 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4921 dom = isl_set_universe(dom_dim);
4922 return isl_map_partial_lexopt(map, dom, NULL, max);
4928 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4930 return isl_map_lexopt(map, 0);
4933 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4935 return isl_map_lexopt(map, 1);
4938 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4940 return (isl_set *)isl_map_lexmin((isl_map *)set);
4943 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4945 return (isl_set *)isl_map_lexmax((isl_map *)set);
4948 /* Apply a preimage specified by "mat" on the parameters of "bset".
4949 * bset is assumed to have only parameters and divs.
4951 static struct isl_basic_set *basic_set_parameter_preimage(
4952 struct isl_basic_set *bset, struct isl_mat *mat)
4959 bset->dim = isl_dim_cow(bset->dim);
4963 nparam = isl_basic_set_dim(bset, isl_dim_param);
4965 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4967 bset->dim->nparam = 0;
4968 bset->dim->n_out = nparam;
4969 bset = isl_basic_set_preimage(bset, mat);
4971 bset->dim->nparam = bset->dim->n_out;
4972 bset->dim->n_out = 0;
4977 isl_basic_set_free(bset);
4981 /* Apply a preimage specified by "mat" on the parameters of "set".
4982 * set is assumed to have only parameters and divs.
4984 static struct isl_set *set_parameter_preimage(
4985 struct isl_set *set, struct isl_mat *mat)
4987 struct isl_dim *dim = NULL;
4993 dim = isl_dim_copy(set->dim);
4994 dim = isl_dim_cow(dim);
4998 nparam = isl_set_dim(set, isl_dim_param);
5000 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5003 dim->n_out = nparam;
5004 isl_set_reset_dim(set, dim);
5005 set = isl_set_preimage(set, mat);
5008 dim = isl_dim_copy(set->dim);
5009 dim = isl_dim_cow(dim);
5012 dim->nparam = dim->n_out;
5014 isl_set_reset_dim(set, dim);
5024 /* Intersect the basic set "bset" with the affine space specified by the
5025 * equalities in "eq".
5027 static struct isl_basic_set *basic_set_append_equalities(
5028 struct isl_basic_set *bset, struct isl_mat *eq)
5036 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5041 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5042 for (i = 0; i < eq->n_row; ++i) {
5043 k = isl_basic_set_alloc_equality(bset);
5046 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5047 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5051 bset = isl_basic_set_gauss(bset, NULL);
5052 bset = isl_basic_set_finalize(bset);
5057 isl_basic_set_free(bset);
5061 /* Intersect the set "set" with the affine space specified by the
5062 * equalities in "eq".
5064 static struct isl_set *set_append_equalities(struct isl_set *set,
5072 for (i = 0; i < set->n; ++i) {
5073 set->p[i] = basic_set_append_equalities(set->p[i],
5086 /* Project the given basic set onto its parameter domain, possibly introducing
5087 * new, explicit, existential variables in the constraints.
5088 * The input has parameters and (possibly implicit) existential variables.
5089 * The output has the same parameters, but only
5090 * explicit existentially quantified variables.
5092 * The actual projection is performed by pip, but pip doesn't seem
5093 * to like equalities very much, so we first remove the equalities
5094 * among the parameters by performing a variable compression on
5095 * the parameters. Afterward, an inverse transformation is performed
5096 * and the equalities among the parameters are inserted back in.
5098 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5102 struct isl_mat *T, *T2;
5103 struct isl_set *set;
5104 unsigned nparam, n_div;
5106 bset = isl_basic_set_cow(bset);
5110 if (bset->n_eq == 0)
5111 return isl_basic_set_lexmin(bset);
5113 isl_basic_set_gauss(bset, NULL);
5115 nparam = isl_basic_set_dim(bset, isl_dim_param);
5116 n_div = isl_basic_set_dim(bset, isl_dim_div);
5118 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5119 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5122 if (i == bset->n_eq)
5123 return isl_basic_set_lexmin(bset);
5125 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
5127 eq = isl_mat_cow(eq);
5128 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5129 if (T && T->n_col == 0) {
5133 bset = isl_basic_set_set_to_empty(bset);
5134 return isl_set_from_basic_set(bset);
5136 bset = basic_set_parameter_preimage(bset, T);
5138 set = isl_basic_set_lexmin(bset);
5139 set = set_parameter_preimage(set, T2);
5140 set = set_append_equalities(set, eq);
5144 /* Compute an explicit representation for all the existentially
5145 * quantified variables.
5146 * The input and output dimensions are first turned into parameters.
5147 * compute_divs then returns a map with the same parameters and
5148 * no input or output dimensions and the dimension specification
5149 * is reset to that of the input.
5151 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5153 struct isl_basic_set *bset;
5154 struct isl_set *set;
5155 struct isl_map *map;
5156 struct isl_dim *dim, *orig_dim = NULL;
5161 bmap = isl_basic_map_cow(bmap);
5165 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5166 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5167 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5168 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5172 orig_dim = bmap->dim;
5174 bset = (struct isl_basic_set *)bmap;
5176 set = parameter_compute_divs(bset);
5177 map = (struct isl_map *)set;
5178 map = isl_map_reset_dim(map, orig_dim);
5182 isl_basic_map_free(bmap);
5186 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5194 off = isl_dim_total(bmap->dim);
5195 for (i = 0; i < bmap->n_div; ++i) {
5196 if (isl_int_is_zero(bmap->div[i][0]))
5198 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5204 static int map_divs_known(__isl_keep isl_map *map)
5211 for (i = 0; i < map->n; ++i) {
5212 int known = basic_map_divs_known(map->p[i]);
5220 /* If bmap contains any unknown divs, then compute explicit
5221 * expressions for them. However, this computation may be
5222 * quite expensive, so first try to remove divs that aren't
5225 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5229 struct isl_map *map;
5231 known = basic_map_divs_known(bmap);
5235 return isl_map_from_basic_map(bmap);
5237 bmap = isl_basic_map_drop_redundant_divs(bmap);
5239 known = basic_map_divs_known(bmap);
5243 return isl_map_from_basic_map(bmap);
5245 map = compute_divs(bmap);
5248 isl_basic_map_free(bmap);
5252 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5256 struct isl_map *res;
5263 known = map_divs_known(map);
5271 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5272 for (i = 1 ; i < map->n; ++i) {
5274 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5275 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5276 res = isl_map_union_disjoint(res, r2);
5278 res = isl_map_union(res, r2);
5285 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5287 return (struct isl_set *)
5288 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5291 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5293 return (struct isl_set *)
5294 isl_map_compute_divs((struct isl_map *)set);
5297 struct isl_set *isl_map_domain(struct isl_map *map)
5300 struct isl_set *set;
5305 map = isl_map_cow(map);
5309 set = (struct isl_set *)map;
5310 set->dim = isl_dim_domain(set->dim);
5313 for (i = 0; i < map->n; ++i) {
5314 set->p[i] = isl_basic_map_domain(map->p[i]);
5318 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5319 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5326 struct isl_map *isl_map_union_disjoint(
5327 struct isl_map *map1, struct isl_map *map2)
5331 struct isl_map *map = NULL;
5345 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5347 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5348 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5349 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5351 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5352 map1->n + map2->n, flags);
5355 for (i = 0; i < map1->n; ++i) {
5356 map = isl_map_add_basic_map(map,
5357 isl_basic_map_copy(map1->p[i]));
5361 for (i = 0; i < map2->n; ++i) {
5362 map = isl_map_add_basic_map(map,
5363 isl_basic_map_copy(map2->p[i]));
5377 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5379 map1 = isl_map_union_disjoint(map1, map2);
5383 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5387 struct isl_set *isl_set_union_disjoint(
5388 struct isl_set *set1, struct isl_set *set2)
5390 return (struct isl_set *)
5391 isl_map_union_disjoint(
5392 (struct isl_map *)set1, (struct isl_map *)set2);
5395 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5397 return (struct isl_set *)
5398 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5401 struct isl_map *isl_map_intersect_range(
5402 struct isl_map *map, struct isl_set *set)
5405 struct isl_map *result;
5411 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5412 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5413 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5415 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5416 map->n * set->n, flags);
5419 for (i = 0; i < map->n; ++i)
5420 for (j = 0; j < set->n; ++j) {
5421 result = isl_map_add_basic_map(result,
5422 isl_basic_map_intersect_range(
5423 isl_basic_map_copy(map->p[i]),
5424 isl_basic_set_copy(set->p[j])));
5437 struct isl_map *isl_map_intersect_domain(
5438 struct isl_map *map, struct isl_set *set)
5440 return isl_map_reverse(
5441 isl_map_intersect_range(isl_map_reverse(map), set));
5444 struct isl_map *isl_map_apply_domain(
5445 struct isl_map *map1, struct isl_map *map2)
5449 map1 = isl_map_reverse(map1);
5450 map1 = isl_map_apply_range(map1, map2);
5451 return isl_map_reverse(map1);
5458 struct isl_map *isl_map_apply_range(
5459 struct isl_map *map1, struct isl_map *map2)
5461 struct isl_dim *dim_result;
5462 struct isl_map *result;
5468 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5469 isl_dim_copy(map2->dim));
5471 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5474 for (i = 0; i < map1->n; ++i)
5475 for (j = 0; j < map2->n; ++j) {
5476 result = isl_map_add_basic_map(result,
5477 isl_basic_map_apply_range(
5478 isl_basic_map_copy(map1->p[i]),
5479 isl_basic_map_copy(map2->p[j])));
5485 if (result && result->n <= 1)
5486 ISL_F_SET(result, ISL_MAP_DISJOINT);
5495 * returns range - domain
5497 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5499 isl_dim *dims, *target_dim;
5500 struct isl_basic_set *bset;
5507 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5508 bmap->dim, isl_dim_out),
5510 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5511 dim = isl_basic_map_n_in(bmap);
5512 nparam = isl_basic_map_n_param(bmap);
5513 bset = isl_basic_set_from_basic_map(bmap);
5514 bset = isl_basic_set_cow(bset);
5515 dims = isl_basic_set_get_dim(bset);
5516 dims = isl_dim_add(dims, isl_dim_set, dim);
5517 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5518 bset = isl_basic_set_swap_vars(bset, 2*dim);
5519 for (i = 0; i < dim; ++i) {
5520 int j = isl_basic_map_alloc_equality(
5521 (struct isl_basic_map *)bset);
5524 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5525 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5526 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5527 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5529 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5530 bset = isl_basic_set_reset_dim(bset, target_dim);
5533 isl_basic_map_free(bmap);
5538 * returns range - domain
5540 struct isl_set *isl_map_deltas(struct isl_map *map)
5544 struct isl_set *result;
5549 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5550 map->dim, isl_dim_out),
5552 dim = isl_map_get_dim(map);
5553 dim = isl_dim_domain(dim);
5554 result = isl_set_alloc_dim(dim, map->n, map->flags);
5557 for (i = 0; i < map->n; ++i)
5558 result = isl_set_add_basic_set(result,
5559 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5567 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5569 struct isl_basic_map *bmap;
5577 nparam = dims->nparam;
5579 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5583 for (i = 0; i < dim; ++i) {
5584 int j = isl_basic_map_alloc_equality(bmap);
5587 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5588 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5589 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5591 return isl_basic_map_finalize(bmap);
5593 isl_basic_map_free(bmap);
5597 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5599 struct isl_dim *dim = isl_dim_map(set_dim);
5602 return basic_map_identity(dim);
5605 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5607 if (!model || !model->dim)
5609 isl_assert(model->ctx,
5610 model->dim->n_in == model->dim->n_out, return NULL);
5611 return basic_map_identity(isl_dim_copy(model->dim));
5614 static struct isl_map *map_identity(struct isl_dim *dim)
5616 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5617 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5620 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5622 struct isl_dim *dim = isl_dim_map(set_dim);
5625 return map_identity(dim);
5628 struct isl_map *isl_map_identity_like(struct isl_map *model)
5630 if (!model || !model->dim)
5632 isl_assert(model->ctx,
5633 model->dim->n_in == model->dim->n_out, return NULL);
5634 return map_identity(isl_dim_copy(model->dim));
5637 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5639 if (!model || !model->dim)
5641 isl_assert(model->ctx,
5642 model->dim->n_in == model->dim->n_out, return NULL);
5643 return map_identity(isl_dim_copy(model->dim));
5646 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5648 isl_dim *dim = isl_set_get_dim(set);
5650 id = isl_map_identity(dim);
5651 return isl_map_intersect_range(id, set);
5654 /* Construct a basic set with all set dimensions having only non-negative
5657 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5662 struct isl_basic_set *bset;
5666 nparam = dims->nparam;
5668 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5671 for (i = 0; i < dim; ++i) {
5672 int k = isl_basic_set_alloc_inequality(bset);
5675 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5676 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5680 isl_basic_set_free(bset);
5684 /* Construct the half-space x_pos >= 0.
5686 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5690 isl_basic_set *nonneg;
5692 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5693 k = isl_basic_set_alloc_inequality(nonneg);
5696 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5697 isl_int_set_si(nonneg->ineq[k][pos], 1);
5699 return isl_basic_set_finalize(nonneg);
5701 isl_basic_set_free(nonneg);
5705 /* Construct the half-space x_pos <= -1.
5707 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
5712 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5713 k = isl_basic_set_alloc_inequality(neg);
5716 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5717 isl_int_set_si(neg->ineq[k][0], -1);
5718 isl_int_set_si(neg->ineq[k][pos], -1);
5720 return isl_basic_set_finalize(neg);
5722 isl_basic_set_free(neg);
5726 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5727 enum isl_dim_type type, unsigned first, unsigned n)
5730 isl_basic_set *nonneg;
5738 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5740 for (i = 0; i < n; ++i) {
5741 nonneg = nonneg_halfspace(isl_set_get_dim(set),
5742 pos(set->dim, type) + first + i);
5743 neg = neg_halfspace(isl_set_get_dim(set),
5744 pos(set->dim, type) + first + i);
5746 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5755 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
5756 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5763 if (isl_set_fast_is_empty(set)) {
5768 return fn(set, signs, user);
5771 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
5773 half = isl_set_intersect(half, isl_set_copy(set));
5774 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
5778 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
5780 half = isl_set_intersect(half, set);
5781 return foreach_orthant(half, signs, first + 1, len, fn, user);
5787 /* Call "fn" on the intersections of "set" with each of the orthants
5788 * (except for obviously empty intersections). The orthant is identified
5789 * by the signs array, with each entry having value 1 or -1 according
5790 * to the sign of the corresponding variable.
5792 int isl_set_foreach_orthant(__isl_keep isl_set *set,
5793 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5803 if (isl_set_fast_is_empty(set))
5806 nparam = isl_set_dim(set, isl_dim_param);
5807 nvar = isl_set_dim(set, isl_dim_set);
5809 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
5811 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
5819 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5821 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5824 int isl_basic_map_is_subset(
5825 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5828 struct isl_map *map1;
5829 struct isl_map *map2;
5831 if (!bmap1 || !bmap2)
5834 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5835 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5837 is_subset = isl_map_is_subset(map1, map2);
5845 int isl_basic_map_is_equal(
5846 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5850 if (!bmap1 || !bmap2)
5852 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5855 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5859 int isl_basic_set_is_equal(
5860 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5862 return isl_basic_map_is_equal(
5863 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5866 int isl_map_is_empty(struct isl_map *map)
5873 for (i = 0; i < map->n; ++i) {
5874 is_empty = isl_basic_map_is_empty(map->p[i]);
5883 int isl_map_fast_is_empty(struct isl_map *map)
5885 return map ? map->n == 0 : -1;
5888 int isl_set_fast_is_empty(struct isl_set *set)
5890 return set ? set->n == 0 : -1;
5893 int isl_set_is_empty(struct isl_set *set)
5895 return isl_map_is_empty((struct isl_map *)set);
5898 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5903 return isl_dim_equal(map1->dim, map2->dim);
5906 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5911 return isl_dim_equal(set1->dim, set2->dim);
5914 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5920 is_subset = isl_map_is_subset(map1, map2);
5923 is_subset = isl_map_is_subset(map2, map1);
5927 int isl_basic_map_is_strict_subset(
5928 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5932 if (!bmap1 || !bmap2)
5934 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5937 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5938 if (is_subset == -1)
5943 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5949 is_subset = isl_map_is_subset(map1, map2);
5952 is_subset = isl_map_is_subset(map2, map1);
5953 if (is_subset == -1)
5958 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5960 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5963 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5967 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5970 int isl_basic_set_is_universe(struct isl_basic_set *bset)
5974 return bset->n_eq == 0 && bset->n_ineq == 0;
5977 int isl_map_fast_is_universe(__isl_keep isl_map *map)
5984 for (i = 0; i < map->n; ++i) {
5985 int r = isl_basic_map_is_universe(map->p[i]);
5993 int isl_set_fast_is_universe(__isl_keep isl_set *set)
5995 return isl_map_fast_is_universe((isl_map *) set);
5998 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6000 struct isl_basic_set *bset = NULL;
6001 struct isl_vec *sample = NULL;
6008 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6011 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6012 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6013 copy = isl_basic_map_remove_redundancies(copy);
6014 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6015 isl_basic_map_free(copy);
6019 total = 1 + isl_basic_map_total_dim(bmap);
6020 if (bmap->sample && bmap->sample->size == total) {
6021 int contains = isl_basic_map_contains(bmap, bmap->sample);
6027 isl_vec_free(bmap->sample);
6028 bmap->sample = NULL;
6029 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6032 sample = isl_basic_set_sample_vec(bset);
6035 empty = sample->size == 0;
6036 isl_vec_free(bmap->sample);
6037 bmap->sample = sample;
6039 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6044 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
6048 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6051 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
6055 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6058 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6060 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6063 struct isl_map *isl_basic_map_union(
6064 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6066 struct isl_map *map;
6067 if (!bmap1 || !bmap2)
6070 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6072 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6075 map = isl_map_add_basic_map(map, bmap1);
6076 map = isl_map_add_basic_map(map, bmap2);
6079 isl_basic_map_free(bmap1);
6080 isl_basic_map_free(bmap2);
6084 struct isl_set *isl_basic_set_union(
6085 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6087 return (struct isl_set *)isl_basic_map_union(
6088 (struct isl_basic_map *)bset1,
6089 (struct isl_basic_map *)bset2);
6092 /* Order divs such that any div only depends on previous divs */
6093 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6101 off = isl_dim_total(bmap->dim);
6103 for (i = 0; i < bmap->n_div; ++i) {
6105 if (isl_int_is_zero(bmap->div[i][0]))
6107 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6111 isl_basic_map_swap_div(bmap, i, i + pos);
6117 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6119 return (struct isl_basic_set *)
6120 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6123 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6130 for (i = 0; i < map->n; ++i) {
6131 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6142 /* Look for a div in dst that corresponds to the div "div" in src.
6143 * The divs before "div" in src and dst are assumed to be the same.
6145 * Returns -1 if no corresponding div was found and the position
6146 * of the corresponding div in dst otherwise.
6148 static int find_div(struct isl_basic_map *dst,
6149 struct isl_basic_map *src, unsigned div)
6153 unsigned total = isl_dim_total(src->dim);
6155 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6156 for (i = div; i < dst->n_div; ++i)
6157 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6158 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6159 dst->n_div - div) == -1)
6164 struct isl_basic_map *isl_basic_map_align_divs(
6165 struct isl_basic_map *dst, struct isl_basic_map *src)
6168 unsigned total = isl_dim_total(src->dim);
6173 if (src->n_div == 0)
6176 for (i = 0; i < src->n_div; ++i)
6177 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6179 src = isl_basic_map_order_divs(src);
6180 dst = isl_basic_map_cow(dst);
6181 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6182 src->n_div, 0, 2 * src->n_div);
6185 for (i = 0; i < src->n_div; ++i) {
6186 int j = find_div(dst, src, i);
6188 j = isl_basic_map_alloc_div(dst);
6191 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6192 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6193 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6197 isl_basic_map_swap_div(dst, i, j);
6201 isl_basic_map_free(dst);
6205 struct isl_basic_set *isl_basic_set_align_divs(
6206 struct isl_basic_set *dst, struct isl_basic_set *src)
6208 return (struct isl_basic_set *)isl_basic_map_align_divs(
6209 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6212 struct isl_map *isl_map_align_divs(struct isl_map *map)
6220 map = isl_map_compute_divs(map);
6221 map = isl_map_cow(map);
6225 for (i = 1; i < map->n; ++i)
6226 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6227 for (i = 1; i < map->n; ++i)
6228 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6230 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6234 struct isl_set *isl_set_align_divs(struct isl_set *set)
6236 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6239 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6243 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6244 map = isl_map_intersect_domain(map, set);
6245 set = isl_map_range(map);
6253 /* There is no need to cow as removing empty parts doesn't change
6254 * the meaning of the set.
6256 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6263 for (i = map->n-1; i >= 0; --i) {
6264 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6266 isl_basic_map_free(map->p[i]);
6267 if (i != map->n-1) {
6268 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6269 map->p[i] = map->p[map->n-1];
6277 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6279 return (struct isl_set *)
6280 isl_map_remove_empty_parts((struct isl_map *)set);
6283 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6285 struct isl_basic_map *bmap;
6286 if (!map || map->n == 0)
6288 bmap = map->p[map->n-1];
6289 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6290 return isl_basic_map_copy(bmap);
6293 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6295 return (struct isl_basic_set *)
6296 isl_map_copy_basic_map((struct isl_map *)set);
6299 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6300 __isl_keep isl_basic_map *bmap)
6306 for (i = map->n-1; i >= 0; --i) {
6307 if (map->p[i] != bmap)
6309 map = isl_map_cow(map);
6312 isl_basic_map_free(map->p[i]);
6313 if (i != map->n-1) {
6314 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6315 map->p[i] = map->p[map->n-1];
6326 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6327 struct isl_basic_set *bset)
6329 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6330 (struct isl_basic_map *)bset);
6333 /* Given two basic sets bset1 and bset2, compute the maximal difference
6334 * between the values of dimension pos in bset1 and those in bset2
6335 * for any common value of the parameters and dimensions preceding pos.
6337 static enum isl_lp_result basic_set_maximal_difference_at(
6338 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6339 int pos, isl_int *opt)
6341 struct isl_dim *dims;
6342 struct isl_basic_map *bmap1 = NULL;
6343 struct isl_basic_map *bmap2 = NULL;
6344 struct isl_ctx *ctx;
6345 struct isl_vec *obj;
6348 unsigned dim1, dim2;
6349 enum isl_lp_result res;
6351 if (!bset1 || !bset2)
6352 return isl_lp_error;
6354 nparam = isl_basic_set_n_param(bset1);
6355 dim1 = isl_basic_set_n_dim(bset1);
6356 dim2 = isl_basic_set_n_dim(bset2);
6357 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6358 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6359 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6360 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6361 if (!bmap1 || !bmap2)
6363 bmap1 = isl_basic_map_cow(bmap1);
6364 bmap1 = isl_basic_map_extend(bmap1, nparam,
6365 pos, (dim1 - pos) + (dim2 - pos),
6366 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6367 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6370 total = isl_basic_map_total_dim(bmap1);
6372 obj = isl_vec_alloc(ctx, 1 + total);
6373 isl_seq_clr(obj->block.data, 1 + total);
6374 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6375 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6378 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6380 isl_basic_map_free(bmap1);
6384 isl_basic_map_free(bmap1);
6385 isl_basic_map_free(bmap2);
6386 return isl_lp_error;
6389 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6390 * for any common value of the parameters and dimensions preceding pos
6391 * in both basic sets, the values of dimension pos in bset1 are
6392 * smaller or larger than those in bset2.
6395 * 1 if bset1 follows bset2
6396 * -1 if bset1 precedes bset2
6397 * 0 if bset1 and bset2 are incomparable
6398 * -2 if some error occurred.
6400 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6401 struct isl_basic_set *bset2, int pos)
6404 enum isl_lp_result res;
6409 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6411 if (res == isl_lp_empty)
6413 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6414 res == isl_lp_unbounded)
6416 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6425 /* Given two basic sets bset1 and bset2, check whether
6426 * for any common value of the parameters and dimensions preceding pos
6427 * there is a value of dimension pos in bset1 that is larger
6428 * than a value of the same dimension in bset2.
6431 * 1 if there exists such a pair
6432 * 0 if there is no such pair, but there is a pair of equal values
6434 * -2 if some error occurred.
6436 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6437 __isl_keep isl_basic_set *bset2, int pos)
6440 enum isl_lp_result res;
6445 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6447 if (res == isl_lp_empty)
6449 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6450 res == isl_lp_unbounded)
6452 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6454 else if (res == isl_lp_ok)
6463 /* Given two sets set1 and set2, check whether
6464 * for any common value of the parameters and dimensions preceding pos
6465 * there is a value of dimension pos in set1 that is larger
6466 * than a value of the same dimension in set2.
6469 * 1 if there exists such a pair
6470 * 0 if there is no such pair, but there is a pair of equal values
6472 * -2 if some error occurred.
6474 int isl_set_follows_at(__isl_keep isl_set *set1,
6475 __isl_keep isl_set *set2, int pos)
6483 for (i = 0; i < set1->n; ++i)
6484 for (j = 0; j < set2->n; ++j) {
6486 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6487 if (f == 1 || f == -2)
6496 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6497 unsigned pos, isl_int *val)
6505 total = isl_basic_map_total_dim(bmap);
6506 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6507 for (; d+1 > pos; --d)
6508 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6512 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6514 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6516 if (!isl_int_is_one(bmap->eq[i][1+d]))
6519 isl_int_neg(*val, bmap->eq[i][0]);
6525 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6526 unsigned pos, isl_int *val)
6538 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6541 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6542 for (i = 1; fixed == 1 && i < map->n; ++i) {
6543 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6544 if (fixed == 1 && isl_int_ne(tmp, v))
6548 isl_int_set(*val, v);
6554 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6555 unsigned pos, isl_int *val)
6557 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6561 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6564 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6567 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6568 enum isl_dim_type type, unsigned pos, isl_int *val)
6570 if (pos >= isl_basic_map_dim(bmap, type))
6572 return isl_basic_map_fast_has_fixed_var(bmap,
6573 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6576 int isl_map_fast_is_fixed(struct isl_map *map,
6577 enum isl_dim_type type, unsigned pos, isl_int *val)
6579 if (pos >= isl_map_dim(map, type))
6581 return isl_map_fast_has_fixed_var(map,
6582 map_offset(map, type) - 1 + pos, val);
6585 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6586 * then return this fixed value in *val.
6588 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6591 return isl_basic_set_fast_has_fixed_var(bset,
6592 isl_basic_set_n_param(bset) + dim, val);
6595 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6596 * then return this fixed value in *val.
6598 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6600 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6603 /* Check if input variable in has fixed value and if so and if val is not NULL,
6604 * then return this fixed value in *val.
6606 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6608 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6611 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6612 * and if val is not NULL, then return this lower bound in *val.
6614 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6615 unsigned dim, isl_int *val)
6617 int i, i_eq = -1, i_ineq = -1;
6624 total = isl_basic_set_total_dim(bset);
6625 nparam = isl_basic_set_n_param(bset);
6626 for (i = 0; i < bset->n_eq; ++i) {
6627 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6633 for (i = 0; i < bset->n_ineq; ++i) {
6634 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6636 if (i_eq != -1 || i_ineq != -1)
6640 if (i_eq == -1 && i_ineq == -1)
6642 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6643 /* The coefficient should always be one due to normalization. */
6644 if (!isl_int_is_one(c[1+nparam+dim]))
6646 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6648 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6649 total - nparam - dim - 1) != -1)
6652 isl_int_neg(*val, c[0]);
6656 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6657 unsigned dim, isl_int *val)
6669 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6673 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6675 for (i = 1; fixed == 1 && i < set->n; ++i) {
6676 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6678 if (fixed == 1 && isl_int_ne(tmp, v))
6682 isl_int_set(*val, v);
6693 static int qsort_constraint_cmp(const void *p1, const void *p2)
6695 const struct constraint *c1 = (const struct constraint *)p1;
6696 const struct constraint *c2 = (const struct constraint *)p2;
6697 unsigned size = isl_min(c1->size, c2->size);
6698 return isl_seq_cmp(c1->c, c2->c, size);
6701 static struct isl_basic_map *isl_basic_map_sort_constraints(
6702 struct isl_basic_map *bmap)
6705 struct constraint *c;
6710 total = isl_basic_map_total_dim(bmap);
6711 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6714 for (i = 0; i < bmap->n_ineq; ++i) {
6716 c[i].c = bmap->ineq[i];
6718 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6719 for (i = 0; i < bmap->n_ineq; ++i)
6720 bmap->ineq[i] = c[i].c;
6724 isl_basic_map_free(bmap);
6728 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6729 __isl_take isl_basic_set *bset)
6731 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6732 (struct isl_basic_map *)bset);
6735 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6739 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6741 bmap = isl_basic_map_remove_redundancies(bmap);
6742 bmap = isl_basic_map_sort_constraints(bmap);
6743 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6747 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6749 return (struct isl_basic_set *)isl_basic_map_normalize(
6750 (struct isl_basic_map *)bset);
6753 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6754 const __isl_keep isl_basic_map *bmap2)
6761 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6762 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6763 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6764 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6765 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6766 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6767 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6768 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6770 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6772 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6774 if (bmap1->n_eq != bmap2->n_eq)
6775 return bmap1->n_eq - bmap2->n_eq;
6776 if (bmap1->n_ineq != bmap2->n_ineq)
6777 return bmap1->n_ineq - bmap2->n_ineq;
6778 if (bmap1->n_div != bmap2->n_div)
6779 return bmap1->n_div - bmap2->n_div;
6780 total = isl_basic_map_total_dim(bmap1);
6781 for (i = 0; i < bmap1->n_eq; ++i) {
6782 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6786 for (i = 0; i < bmap1->n_ineq; ++i) {
6787 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6791 for (i = 0; i < bmap1->n_div; ++i) {
6792 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6799 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6800 __isl_keep isl_basic_map *bmap2)
6802 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6805 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6806 __isl_keep isl_basic_set *bset2)
6808 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6809 (isl_basic_map *)bset2);
6812 static int qsort_bmap_cmp(const void *p1, const void *p2)
6814 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6815 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6817 return isl_basic_map_fast_cmp(bmap1, bmap2);
6820 /* We normalize in place, but if anything goes wrong we need
6821 * to return NULL, so we need to make sure we don't change the
6822 * meaning of any possible other copies of map.
6824 struct isl_map *isl_map_normalize(struct isl_map *map)
6827 struct isl_basic_map *bmap;
6831 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6833 for (i = 0; i < map->n; ++i) {
6834 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6837 isl_basic_map_free(map->p[i]);
6840 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6841 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6842 map = isl_map_remove_empty_parts(map);
6845 for (i = map->n - 1; i >= 1; --i) {
6846 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6848 isl_basic_map_free(map->p[i-1]);
6849 for (j = i; j < map->n; ++j)
6850 map->p[j-1] = map->p[j];
6860 struct isl_set *isl_set_normalize(struct isl_set *set)
6862 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6865 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6875 if (!isl_dim_equal(map1->dim, map2->dim))
6878 map1 = isl_map_copy(map1);
6879 map2 = isl_map_copy(map2);
6880 map1 = isl_map_normalize(map1);
6881 map2 = isl_map_normalize(map2);
6884 equal = map1->n == map2->n;
6885 for (i = 0; equal && i < map1->n; ++i) {
6886 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6899 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6901 return isl_map_fast_is_equal((struct isl_map *)set1,
6902 (struct isl_map *)set2);
6905 /* Return an interval that ranges from min to max (inclusive)
6907 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6908 isl_int min, isl_int max)
6911 struct isl_basic_set *bset = NULL;
6913 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6917 k = isl_basic_set_alloc_inequality(bset);
6920 isl_int_set_si(bset->ineq[k][1], 1);
6921 isl_int_neg(bset->ineq[k][0], min);
6923 k = isl_basic_set_alloc_inequality(bset);
6926 isl_int_set_si(bset->ineq[k][1], -1);
6927 isl_int_set(bset->ineq[k][0], max);
6931 isl_basic_set_free(bset);
6935 /* Return the Cartesian product of the basic sets in list (in the given order).
6937 __isl_give isl_basic_set *isl_basic_set_list_product(
6938 __isl_take struct isl_basic_set_list *list)
6946 struct isl_basic_set *product = NULL;
6950 isl_assert(list->ctx, list->n > 0, goto error);
6951 isl_assert(list->ctx, list->p[0], goto error);
6952 nparam = isl_basic_set_n_param(list->p[0]);
6953 dim = isl_basic_set_n_dim(list->p[0]);
6954 extra = list->p[0]->n_div;
6955 n_eq = list->p[0]->n_eq;
6956 n_ineq = list->p[0]->n_ineq;
6957 for (i = 1; i < list->n; ++i) {
6958 isl_assert(list->ctx, list->p[i], goto error);
6959 isl_assert(list->ctx,
6960 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6961 dim += isl_basic_set_n_dim(list->p[i]);
6962 extra += list->p[i]->n_div;
6963 n_eq += list->p[i]->n_eq;
6964 n_ineq += list->p[i]->n_ineq;
6966 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
6971 for (i = 0; i < list->n; ++i) {
6972 isl_basic_set_add_constraints(product,
6973 isl_basic_set_copy(list->p[i]), dim);
6974 dim += isl_basic_set_n_dim(list->p[i]);
6976 isl_basic_set_list_free(list);
6979 isl_basic_set_free(product);
6980 isl_basic_set_list_free(list);
6984 struct isl_basic_map *isl_basic_map_product(
6985 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6987 struct isl_dim *dim_result = NULL;
6988 struct isl_basic_map *bmap;
6989 unsigned in1, in2, out1, out2, nparam, total, pos;
6990 struct isl_dim_map *dim_map1, *dim_map2;
6992 if (!bmap1 || !bmap2)
6995 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
6996 bmap2->dim, isl_dim_param), goto error);
6997 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
6998 isl_dim_copy(bmap2->dim));
7000 in1 = isl_basic_map_n_in(bmap1);
7001 in2 = isl_basic_map_n_in(bmap2);
7002 out1 = isl_basic_map_n_out(bmap1);
7003 out2 = isl_basic_map_n_out(bmap2);
7004 nparam = isl_basic_map_n_param(bmap1);
7006 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7007 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7008 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7009 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7010 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7011 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7012 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7013 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7014 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7015 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7016 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7018 bmap = isl_basic_map_alloc_dim(dim_result,
7019 bmap1->n_div + bmap2->n_div,
7020 bmap1->n_eq + bmap2->n_eq,
7021 bmap1->n_ineq + bmap2->n_ineq);
7022 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
7023 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
7024 bmap = isl_basic_map_simplify(bmap);
7025 return isl_basic_map_finalize(bmap);
7027 isl_basic_map_free(bmap1);
7028 isl_basic_map_free(bmap2);
7032 __isl_give isl_basic_map *isl_basic_map_range_product(
7033 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7035 isl_dim *dim_result = NULL;
7036 isl_basic_map *bmap;
7037 unsigned in, out1, out2, nparam, total, pos;
7038 struct isl_dim_map *dim_map1, *dim_map2;
7040 if (!bmap1 || !bmap2)
7043 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7044 isl_dim_copy(bmap2->dim));
7046 in = isl_basic_map_dim(bmap1, isl_dim_in);
7047 out1 = isl_basic_map_n_out(bmap1);
7048 out2 = isl_basic_map_n_out(bmap2);
7049 nparam = isl_basic_map_n_param(bmap1);
7051 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7052 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7053 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7054 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7055 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7056 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7057 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7058 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7059 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7060 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7061 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7063 bmap = isl_basic_map_alloc_dim(dim_result,
7064 bmap1->n_div + bmap2->n_div,
7065 bmap1->n_eq + bmap2->n_eq,
7066 bmap1->n_ineq + bmap2->n_ineq);
7067 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
7068 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
7069 bmap = isl_basic_map_simplify(bmap);
7070 return isl_basic_map_finalize(bmap);
7072 isl_basic_map_free(bmap1);
7073 isl_basic_map_free(bmap2);
7077 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7078 __isl_take isl_map *map2,
7079 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7080 __isl_take isl_dim *right),
7081 __isl_give isl_basic_map *(*basic_map_product)(
7082 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7085 struct isl_map *result;
7091 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7092 map2->dim, isl_dim_param), goto error);
7094 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7095 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7096 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7098 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7099 isl_dim_copy(map2->dim)),
7100 map1->n * map2->n, flags);
7103 for (i = 0; i < map1->n; ++i)
7104 for (j = 0; j < map2->n; ++j) {
7105 struct isl_basic_map *part;
7106 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7107 isl_basic_map_copy(map2->p[j]));
7108 if (isl_basic_map_is_empty(part))
7109 isl_basic_map_free(part);
7111 result = isl_map_add_basic_map(result, part);
7124 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7126 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7128 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7131 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7133 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7134 __isl_take isl_map *map2)
7138 prod = isl_map_product(map1, map2);
7139 prod = isl_map_flatten(prod);
7143 /* Given two set A and B, construct its Cartesian product A x B.
7145 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7147 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7148 (struct isl_map *)set2);
7151 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7152 __isl_take isl_set *set2)
7154 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7157 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7159 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7160 __isl_take isl_map *map2)
7162 return map_product(map1, map2, &isl_dim_range_product,
7163 &isl_basic_map_range_product);
7166 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7169 uint32_t hash = isl_hash_init();
7174 bmap = isl_basic_map_copy(bmap);
7175 bmap = isl_basic_map_normalize(bmap);
7178 total = isl_basic_map_total_dim(bmap);
7179 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7180 for (i = 0; i < bmap->n_eq; ++i) {
7182 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7183 isl_hash_hash(hash, c_hash);
7185 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7186 for (i = 0; i < bmap->n_ineq; ++i) {
7188 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7189 isl_hash_hash(hash, c_hash);
7191 isl_hash_byte(hash, bmap->n_div & 0xFF);
7192 for (i = 0; i < bmap->n_div; ++i) {
7194 if (isl_int_is_zero(bmap->div[i][0]))
7196 isl_hash_byte(hash, i & 0xFF);
7197 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7198 isl_hash_hash(hash, c_hash);
7200 isl_basic_map_free(bmap);
7204 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7206 return isl_basic_map_get_hash((isl_basic_map *)bset);
7209 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7216 map = isl_map_copy(map);
7217 map = isl_map_normalize(map);
7221 hash = isl_hash_init();
7222 for (i = 0; i < map->n; ++i) {
7224 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7225 isl_hash_hash(hash, bmap_hash);
7233 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7235 return isl_map_get_hash((isl_map *)set);
7238 /* Check if the value for dimension dim is completely determined
7239 * by the values of the other parameters and variables.
7240 * That is, check if dimension dim is involved in an equality.
7242 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7249 nparam = isl_basic_set_n_param(bset);
7250 for (i = 0; i < bset->n_eq; ++i)
7251 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7256 /* Check if the value for dimension dim is completely determined
7257 * by the values of the other parameters and variables.
7258 * That is, check if dimension dim is involved in an equality
7259 * for each of the subsets.
7261 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7267 for (i = 0; i < set->n; ++i) {
7269 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7276 int isl_set_n_basic_set(__isl_keep isl_set *set)
7278 return set ? set->n : 0;
7281 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7282 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7289 for (i = 0; i < map->n; ++i)
7290 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7296 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7297 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7304 for (i = 0; i < set->n; ++i)
7305 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7311 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7313 struct isl_dim *dim;
7318 if (bset->n_div == 0)
7321 bset = isl_basic_set_cow(bset);
7325 dim = isl_basic_set_get_dim(bset);
7326 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
7329 isl_dim_free(bset->dim);
7331 bset->extra -= bset->n_div;
7334 bset = isl_basic_set_finalize(bset);
7338 isl_basic_set_free(bset);
7342 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7345 struct isl_dim *dim;
7348 set = isl_set_align_divs(set);
7352 if (set->n == 0 || set->p[0]->n_div == 0)
7355 set = isl_set_cow(set);
7359 n_div = set->p[0]->n_div;
7360 dim = isl_set_get_dim(set);
7361 dim = isl_dim_add(dim, isl_dim_set, n_div);
7364 isl_dim_free(set->dim);
7367 for (i = 0; i < set->n; ++i) {
7368 set->p[i] = isl_basic_set_lift(set->p[i]);
7379 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7381 struct isl_dim *dim;
7382 struct isl_basic_map *bmap;
7389 set = isl_set_align_divs(set);
7394 dim = isl_set_get_dim(set);
7395 if (set->n == 0 || set->p[0]->n_div == 0) {
7397 return isl_map_identity(dim);
7400 n_div = set->p[0]->n_div;
7401 dim = isl_dim_map(dim);
7402 n_param = isl_dim_size(dim, isl_dim_param);
7403 n_set = isl_dim_size(dim, isl_dim_in);
7404 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7405 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7406 for (i = 0; i < n_set; ++i)
7407 bmap = var_equal(bmap, i);
7409 total = n_param + n_set + n_set + n_div;
7410 for (i = 0; i < n_div; ++i) {
7411 k = isl_basic_map_alloc_inequality(bmap);
7414 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7415 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7416 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7417 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7418 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7419 set->p[0]->div[i][0]);
7421 l = isl_basic_map_alloc_inequality(bmap);
7424 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7425 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7426 set->p[0]->div[i][0]);
7427 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7431 return isl_map_from_basic_map(bmap);
7434 isl_basic_map_free(bmap);
7438 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7446 dim = isl_basic_set_total_dim(bset);
7447 size += bset->n_eq * (1 + dim);
7448 size += bset->n_ineq * (1 + dim);
7449 size += bset->n_div * (2 + dim);
7454 int isl_set_size(__isl_keep isl_set *set)
7462 for (i = 0; i < set->n; ++i)
7463 size += isl_basic_set_size(set->p[i]);
7468 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7469 enum isl_dim_type type, unsigned pos)
7477 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7479 pos += isl_basic_map_offset(bmap, type);
7481 for (i = 0; i < bmap->n_eq; ++i)
7482 if (!isl_int_is_zero(bmap->eq[i][pos]))
7486 for (i = 0; i < bmap->n_ineq; ++i) {
7487 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7494 return lower && upper;
7497 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7498 enum isl_dim_type type, unsigned pos)
7505 for (i = 0; i < map->n; ++i) {
7507 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7508 if (bounded < 0 || !bounded)
7515 /* Return 1 if the specified dim is involved in both an upper bound
7516 * and a lower bound.
7518 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7519 enum isl_dim_type type, unsigned pos)
7521 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7524 /* For each of the "n" variables starting at "first", determine
7525 * the sign of the variable and put the results in the first "n"
7526 * elements of the array "signs".
7528 * 1 means that the variable is non-negative
7529 * -1 means that the variable is non-positive
7530 * 0 means the variable attains both positive and negative values.
7532 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7533 unsigned first, unsigned n, int *signs)
7535 isl_vec *bound = NULL;
7536 struct isl_tab *tab = NULL;
7537 struct isl_tab_undo *snap;
7540 if (!bset || !signs)
7543 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7544 tab = isl_tab_from_basic_set(bset);
7548 isl_seq_clr(bound->el, bound->size);
7549 isl_int_set_si(bound->el[0], -1);
7551 snap = isl_tab_snap(tab);
7552 for (i = 0; i < n; ++i) {
7555 isl_int_set_si(bound->el[1 + first + i], -1);
7556 if (isl_tab_add_ineq(tab, bound->el) < 0)
7559 isl_int_set_si(bound->el[1 + first + i], 0);
7560 if (isl_tab_rollback(tab, snap) < 0)
7568 isl_int_set_si(bound->el[1 + first + i], 1);
7569 if (isl_tab_add_ineq(tab, bound->el) < 0)
7572 isl_int_set_si(bound->el[1 + first + i], 0);
7573 if (isl_tab_rollback(tab, snap) < 0)
7576 signs[i] = empty ? -1 : 0;
7580 isl_vec_free(bound);
7584 isl_vec_free(bound);
7588 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7589 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7591 if (!bset || !signs)
7593 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7596 first += pos(bset->dim, type) - 1;
7597 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7600 /* Check if the given basic map is obviously single-valued.
7601 * In particular, for each output dimension, check that there is
7602 * an equality that defines the output dimension in terms of
7603 * earlier dimensions.
7605 int isl_basic_map_fast_is_single_valued(__isl_keep isl_basic_map *bmap)
7615 total = 1 + isl_basic_map_total_dim(bmap);
7616 n_out = isl_basic_map_dim(bmap, isl_dim_out);
7617 o_out = isl_basic_map_offset(bmap, isl_dim_out);
7619 for (i = 0; i < n_out; ++i) {
7620 for (j = 0; j < bmap->n_eq; ++j) {
7621 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
7623 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
7624 total - (o_out + i + 1)) == -1)
7627 if (j >= bmap->n_eq)
7634 /* Check if the given map is obviously single-valued.
7636 int isl_map_fast_is_single_valued(__isl_keep isl_map *map)
7647 return isl_basic_map_fast_is_single_valued(map->p[0]);
7650 /* Check if the given map is single-valued.
7655 * and check if the result is a subset of the identity mapping.
7657 int isl_map_is_single_valued(__isl_keep isl_map *map)
7663 sv = isl_map_fast_is_single_valued(map);
7667 test = isl_map_reverse(isl_map_copy(map));
7668 test = isl_map_apply_range(test, isl_map_copy(map));
7670 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7672 sv = isl_map_is_subset(test, id);
7680 int isl_map_is_bijective(__isl_keep isl_map *map)
7684 sv = isl_map_is_single_valued(map);
7688 map = isl_map_copy(map);
7689 map = isl_map_reverse(map);
7690 sv = isl_map_is_single_valued(map);
7696 int isl_set_is_singleton(__isl_keep isl_set *set)
7698 return isl_map_is_single_valued((isl_map *)set);
7701 int isl_map_is_translation(__isl_keep isl_map *map)
7706 delta = isl_map_deltas(isl_map_copy(map));
7707 ok = isl_set_is_singleton(delta);
7708 isl_set_free(delta);
7713 static int unique(isl_int *p, unsigned pos, unsigned len)
7715 if (isl_seq_first_non_zero(p, pos) != -1)
7717 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7722 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7731 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7734 nvar = isl_basic_set_dim(bset, isl_dim_set);
7735 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7736 for (j = 0; j < nvar; ++j) {
7737 int lower = 0, upper = 0;
7738 for (i = 0; i < bset->n_eq; ++i) {
7739 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7741 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7747 for (i = 0; i < bset->n_ineq; ++i) {
7748 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7750 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7752 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7757 if (!lower || !upper)
7764 int isl_set_is_box(__isl_keep isl_set *set)
7771 return isl_basic_set_is_box(set->p[0]);
7774 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7779 return isl_dim_is_wrapping(bset->dim);
7782 int isl_set_is_wrapping(__isl_keep isl_set *set)
7787 return isl_dim_is_wrapping(set->dim);
7790 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7792 bmap = isl_basic_map_cow(bmap);
7796 bmap->dim = isl_dim_wrap(bmap->dim);
7800 bmap = isl_basic_map_finalize(bmap);
7802 return (isl_basic_set *)bmap;
7804 isl_basic_map_free(bmap);
7808 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7812 map = isl_map_cow(map);
7816 for (i = 0; i < map->n; ++i) {
7817 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7821 map->dim = isl_dim_wrap(map->dim);
7825 return (isl_set *)map;
7831 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7833 bset = isl_basic_set_cow(bset);
7837 bset->dim = isl_dim_unwrap(bset->dim);
7841 bset = isl_basic_set_finalize(bset);
7843 return (isl_basic_map *)bset;
7845 isl_basic_set_free(bset);
7849 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7856 if (!isl_set_is_wrapping(set))
7857 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7860 set = isl_set_cow(set);
7864 for (i = 0; i < set->n; ++i) {
7865 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7870 set->dim = isl_dim_unwrap(set->dim);
7874 return (isl_map *)set;
7880 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7881 enum isl_dim_type type)
7886 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7889 bmap = isl_basic_map_cow(bmap);
7893 bmap->dim = isl_dim_reset(bmap->dim, type);
7897 bmap = isl_basic_map_finalize(bmap);
7901 isl_basic_map_free(bmap);
7905 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7906 enum isl_dim_type type)
7913 if (!isl_dim_is_named_or_nested(map->dim, type))
7916 map = isl_map_cow(map);
7920 for (i = 0; i < map->n; ++i) {
7921 map->p[i] = isl_basic_map_reset(map->p[i], type);
7925 map->dim = isl_dim_reset(map->dim, type);
7935 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7940 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7943 bmap = isl_basic_map_cow(bmap);
7947 bmap->dim = isl_dim_flatten(bmap->dim);
7951 bmap = isl_basic_map_finalize(bmap);
7955 isl_basic_map_free(bmap);
7959 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
7961 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
7964 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
7971 if (!map->dim->nested[0] && !map->dim->nested[1])
7974 map = isl_map_cow(map);
7978 for (i = 0; i < map->n; ++i) {
7979 map->p[i] = isl_basic_map_flatten(map->p[i]);
7983 map->dim = isl_dim_flatten(map->dim);
7993 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
7995 return (isl_set *)isl_map_flatten((isl_map *)set);
7998 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8000 isl_dim *dim, *flat_dim;
8003 dim = isl_set_get_dim(set);
8004 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8005 map = map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8006 map = isl_map_intersect_domain(map, set);
8011 /* Extend the given dim_map with mappings for the divs in bmap.
8013 static __isl_give struct isl_dim_map *extend_dim_map(
8014 __isl_keep struct isl_dim_map *dim_map,
8015 __isl_keep isl_basic_map *bmap)
8018 struct isl_dim_map *res;
8021 offset = isl_basic_map_offset(bmap, isl_dim_div);
8023 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
8027 for (i = 0; i < dim_map->len; ++i)
8028 res->pos[i] = dim_map->pos[i];
8029 for (i = 0; i < bmap->n_div; ++i)
8030 res->pos[dim_map->len + i] = offset + i;
8035 /* Extract a dim_map from a reordering.
8036 * We essentially need to reverse the mapping, and add an offset
8037 * of 1 for the constant term.
8039 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
8040 __isl_keep isl_reordering *exp)
8043 struct isl_dim_map *dim_map;
8048 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
8052 for (i = 0; i < exp->len; ++i)
8053 dim_map->pos[1 + exp->pos[i]] = 1 + i;
8058 /* Reorder the dimensions of "bmap" according to the given dim_map
8059 * and set the dimension specification to "dim".
8061 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8062 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8066 bmap = isl_basic_map_cow(bmap);
8067 if (!bmap || !dim || !dim_map)
8070 res = isl_basic_map_alloc_dim(dim,
8071 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8072 res = add_constraints_dim_map(res, bmap, dim_map);
8073 res = isl_basic_map_finalize(res);
8077 isl_basic_map_free(bmap);
8082 /* Reorder the dimensions of "map" according to given reordering.
8084 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8085 __isl_take isl_reordering *r)
8088 struct isl_dim_map *dim_map;
8090 map = isl_map_cow(map);
8091 dim_map = isl_dim_map_from_reordering(r);
8092 if (!map || !r || !dim_map)
8095 for (i = 0; i < map->n; ++i) {
8096 struct isl_dim_map *dim_map_i;
8098 dim_map_i = extend_dim_map(dim_map, map->p[i]);
8100 map->p[i] = isl_basic_map_realign(map->p[i],
8101 isl_dim_copy(r->dim), dim_map_i);
8107 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8109 isl_reordering_free(r);
8115 isl_reordering_free(r);
8119 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8120 __isl_take isl_reordering *r)
8122 return (isl_set *)isl_map_realign((isl_map *)set, r);
8125 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8126 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8127 enum isl_dim_type c2, enum isl_dim_type c3,
8128 enum isl_dim_type c4, enum isl_dim_type c5)
8130 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8131 struct isl_mat *mat;
8137 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8138 isl_basic_map_total_dim(bmap) + 1);
8141 for (i = 0; i < bmap->n_eq; ++i)
8142 for (j = 0, pos = 0; j < 5; ++j) {
8143 int off = isl_basic_map_offset(bmap, c[j]);
8144 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8145 isl_int_set(mat->row[i][pos],
8146 bmap->eq[i][off + k]);
8154 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8155 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8156 enum isl_dim_type c2, enum isl_dim_type c3,
8157 enum isl_dim_type c4, enum isl_dim_type c5)
8159 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8160 struct isl_mat *mat;
8166 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8167 isl_basic_map_total_dim(bmap) + 1);
8170 for (i = 0; i < bmap->n_ineq; ++i)
8171 for (j = 0, pos = 0; j < 5; ++j) {
8172 int off = isl_basic_map_offset(bmap, c[j]);
8173 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8174 isl_int_set(mat->row[i][pos],
8175 bmap->ineq[i][off + k]);
8183 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8184 __isl_take isl_dim *dim,
8185 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8186 enum isl_dim_type c2, enum isl_dim_type c3,
8187 enum isl_dim_type c4, enum isl_dim_type c5)
8189 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8190 isl_basic_map *bmap;
8196 if (!dim || !eq || !ineq)
8199 if (eq->n_col != ineq->n_col)
8200 isl_die(dim->ctx, isl_error_invalid,
8201 "equalities and inequalities matrices should have "
8202 "same number of columns", goto error);
8204 total = 1 + isl_dim_total(dim);
8206 if (eq->n_col < total)
8207 isl_die(dim->ctx, isl_error_invalid,
8208 "number of columns too small", goto error);
8210 extra = eq->n_col - total;
8212 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8213 eq->n_row, ineq->n_row);
8216 for (i = 0; i < extra; ++i) {
8217 k = isl_basic_map_alloc_div(bmap);
8220 isl_int_set_si(bmap->div[k][0], 0);
8222 for (i = 0; i < eq->n_row; ++i) {
8223 l = isl_basic_map_alloc_equality(bmap);
8226 for (j = 0, pos = 0; j < 5; ++j) {
8227 int off = isl_basic_map_offset(bmap, c[j]);
8228 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8229 isl_int_set(bmap->eq[l][off + k],
8235 for (i = 0; i < ineq->n_row; ++i) {
8236 l = isl_basic_map_alloc_inequality(bmap);
8239 for (j = 0, pos = 0; j < 5; ++j) {
8240 int off = isl_basic_map_offset(bmap, c[j]);
8241 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8242 isl_int_set(bmap->ineq[l][off + k],
8261 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8262 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8263 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8265 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8266 c1, c2, c3, c4, isl_dim_in);
8269 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8270 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8271 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8273 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8274 c1, c2, c3, c4, isl_dim_in);
8277 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8278 __isl_take isl_dim *dim,
8279 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8280 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8282 return (isl_basic_set*)
8283 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8284 c1, c2, c3, c4, isl_dim_in);