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
15 #include <isl_map_private.h>
18 #include "isl_dim_private.h"
19 #include "isl_equalities.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_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
378 return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
381 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
383 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
386 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
387 enum isl_dim_type type, unsigned pos)
389 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
392 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
393 enum isl_dim_type type, unsigned pos)
395 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
398 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
399 enum isl_dim_type type, unsigned pos)
401 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
404 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
405 __isl_take isl_basic_map *bmap,
406 enum isl_dim_type type, unsigned pos, const char *s)
410 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
415 isl_basic_map_free(bmap);
419 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
420 enum isl_dim_type type, unsigned pos, const char *s)
427 map->dim = isl_dim_set_name(map->dim, type, pos, s);
431 for (i = 0; i < map->n; ++i) {
432 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
443 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
444 __isl_take isl_basic_set *bset,
445 enum isl_dim_type type, unsigned pos, const char *s)
447 return (isl_basic_set *)isl_basic_map_set_dim_name(
448 (isl_basic_map *)bset, type, pos, s);
451 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
452 enum isl_dim_type type, unsigned pos, const char *s)
454 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
457 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
461 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
464 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
465 struct isl_basic_map *bmap, unsigned extra,
466 unsigned n_eq, unsigned n_ineq)
469 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
474 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
475 if (isl_blk_is_error(bmap->block))
478 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
483 bmap->block2 = isl_blk_empty();
486 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
487 if (isl_blk_is_error(bmap->block2))
490 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
495 for (i = 0; i < n_ineq + n_eq; ++i)
496 bmap->ineq[i] = bmap->block.data + i * row_size;
498 for (i = 0; i < extra; ++i)
499 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
503 bmap->c_size = n_eq + n_ineq;
504 bmap->eq = bmap->ineq + n_ineq;
513 isl_basic_map_free(bmap);
517 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
518 unsigned nparam, unsigned dim, unsigned extra,
519 unsigned n_eq, unsigned n_ineq)
521 struct isl_basic_map *bmap;
522 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
523 return (struct isl_basic_set *)bmap;
526 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
527 unsigned extra, unsigned n_eq, unsigned n_ineq)
529 struct isl_basic_map *bmap;
532 isl_assert(dim->ctx, dim->n_in == 0, goto error);
533 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
534 return (struct isl_basic_set *)bmap;
540 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
541 unsigned extra, unsigned n_eq, unsigned n_ineq)
543 struct isl_basic_map *bmap;
547 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
552 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
558 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
559 unsigned nparam, unsigned in, unsigned out, unsigned extra,
560 unsigned n_eq, unsigned n_ineq)
562 struct isl_basic_map *bmap;
565 dim = isl_dim_alloc(ctx, nparam, in, out);
569 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
573 static void dup_constraints(
574 struct isl_basic_map *dst, struct isl_basic_map *src)
577 unsigned total = isl_basic_map_total_dim(src);
579 for (i = 0; i < src->n_eq; ++i) {
580 int j = isl_basic_map_alloc_equality(dst);
581 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
584 for (i = 0; i < src->n_ineq; ++i) {
585 int j = isl_basic_map_alloc_inequality(dst);
586 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
589 for (i = 0; i < src->n_div; ++i) {
590 int j = isl_basic_map_alloc_div(dst);
591 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
593 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
596 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
598 struct isl_basic_map *dup;
602 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
603 bmap->n_div, bmap->n_eq, bmap->n_ineq);
606 dup_constraints(dup, bmap);
607 dup->flags = bmap->flags;
608 dup->sample = isl_vec_copy(bmap->sample);
612 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
614 struct isl_basic_map *dup;
616 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
617 return (struct isl_basic_set *)dup;
620 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
625 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
629 return isl_basic_set_dup(bset);
632 struct isl_set *isl_set_copy(struct isl_set *set)
641 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
646 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
650 bmap = isl_basic_map_dup(bmap);
652 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
656 struct isl_map *isl_map_copy(struct isl_map *map)
665 void isl_basic_map_free(struct isl_basic_map *bmap)
673 isl_ctx_deref(bmap->ctx);
675 isl_blk_free(bmap->ctx, bmap->block2);
677 isl_blk_free(bmap->ctx, bmap->block);
678 isl_vec_free(bmap->sample);
679 isl_dim_free(bmap->dim);
683 void isl_basic_set_free(struct isl_basic_set *bset)
685 isl_basic_map_free((struct isl_basic_map *)bset);
688 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
690 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
693 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
699 isl_assert(ctx, room_for_con(bmap, 1), return -1);
700 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
702 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
703 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
704 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
705 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
706 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
707 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
709 int j = isl_basic_map_alloc_inequality(bmap);
713 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
714 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
721 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
722 bmap->extra - bmap->n_div);
726 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
728 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
731 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
735 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
740 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
742 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
745 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
750 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
752 if (pos != bmap->n_eq - 1) {
754 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
755 bmap->eq[bmap->n_eq - 1] = t;
761 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
763 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
766 void isl_basic_map_inequality_to_equality(
767 struct isl_basic_map *bmap, unsigned pos)
772 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
773 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
778 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
779 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
780 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
781 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
784 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
786 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
789 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
795 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
796 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
797 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
798 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
799 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
800 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
801 1 + isl_basic_map_total_dim(bmap),
802 bmap->extra - bmap->n_div);
803 return bmap->n_ineq++;
806 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
808 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
811 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
815 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
820 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
822 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
825 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
830 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
832 if (pos != bmap->n_ineq - 1) {
834 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
835 bmap->ineq[bmap->n_ineq - 1] = t;
836 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
842 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
844 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
847 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
852 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
855 k = isl_basic_map_alloc_equality(bmap);
858 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
861 isl_basic_map_free(bmap);
865 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
868 return (isl_basic_set *)
869 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
872 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
877 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
880 k = isl_basic_map_alloc_inequality(bmap);
883 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
886 isl_basic_map_free(bmap);
890 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
893 return (isl_basic_set *)
894 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
897 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
901 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
902 isl_seq_clr(bmap->div[bmap->n_div] +
903 1 + 1 + isl_basic_map_total_dim(bmap),
904 bmap->extra - bmap->n_div);
905 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
906 return bmap->n_div++;
909 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
911 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
914 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
918 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
923 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
925 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
928 /* Copy constraint from src to dst, putting the vars of src at offset
929 * dim_off in dst and the divs of src at offset div_off in dst.
930 * If both sets are actually map, then dim_off applies to the input
933 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
934 struct isl_basic_map *src_map, isl_int *src,
935 unsigned in_off, unsigned out_off, unsigned div_off)
937 unsigned src_nparam = isl_basic_map_n_param(src_map);
938 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
939 unsigned src_in = isl_basic_map_n_in(src_map);
940 unsigned dst_in = isl_basic_map_n_in(dst_map);
941 unsigned src_out = isl_basic_map_n_out(src_map);
942 unsigned dst_out = isl_basic_map_n_out(dst_map);
943 isl_int_set(dst[0], src[0]);
944 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
945 if (dst_nparam > src_nparam)
946 isl_seq_clr(dst+1+src_nparam,
947 dst_nparam - src_nparam);
948 isl_seq_clr(dst+1+dst_nparam, in_off);
949 isl_seq_cpy(dst+1+dst_nparam+in_off,
951 isl_min(dst_in-in_off, src_in));
952 if (dst_in-in_off > src_in)
953 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
954 dst_in - in_off - src_in);
955 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
956 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
957 src+1+src_nparam+src_in,
958 isl_min(dst_out-out_off, src_out));
959 if (dst_out-out_off > src_out)
960 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
961 dst_out - out_off - src_out);
962 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
963 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
964 src+1+src_nparam+src_in+src_out,
965 isl_min(dst_map->extra-div_off, src_map->n_div));
966 if (dst_map->n_div-div_off > src_map->n_div)
967 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
968 div_off+src_map->n_div,
969 dst_map->n_div - div_off - src_map->n_div);
972 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
973 struct isl_basic_map *src_map, isl_int *src,
974 unsigned in_off, unsigned out_off, unsigned div_off)
976 isl_int_set(dst[0], src[0]);
977 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
980 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
981 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
986 if (!bmap1 || !bmap2)
989 div_off = bmap1->n_div;
991 for (i = 0; i < bmap2->n_eq; ++i) {
992 int i1 = isl_basic_map_alloc_equality(bmap1);
995 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
996 i_pos, o_pos, div_off);
999 for (i = 0; i < bmap2->n_ineq; ++i) {
1000 int i1 = isl_basic_map_alloc_inequality(bmap1);
1003 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1004 i_pos, o_pos, div_off);
1007 for (i = 0; i < bmap2->n_div; ++i) {
1008 int i1 = isl_basic_map_alloc_div(bmap1);
1011 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1012 i_pos, o_pos, div_off);
1015 isl_basic_map_free(bmap2);
1020 isl_basic_map_free(bmap1);
1021 isl_basic_map_free(bmap2);
1025 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
1026 struct isl_dim_map *dim_map)
1030 for (i = 0; i < dim_map->len; ++i) {
1031 if (dim_map->pos[i] < 0)
1032 isl_int_set_si(dst[i], 0);
1034 isl_int_set(dst[i], src[dim_map->pos[i]]);
1038 static void copy_div_dim_map(isl_int *dst, isl_int *src,
1039 struct isl_dim_map *dim_map)
1041 isl_int_set(dst[0], src[0]);
1042 copy_constraint_dim_map(dst+1, src+1, dim_map);
1045 static struct isl_basic_map *add_constraints_dim_map(struct isl_basic_map *dst,
1046 struct isl_basic_map *src, struct isl_dim_map *dim_map)
1050 if (!src || !dst || !dim_map)
1053 for (i = 0; i < src->n_eq; ++i) {
1054 int i1 = isl_basic_map_alloc_equality(dst);
1057 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
1060 for (i = 0; i < src->n_ineq; ++i) {
1061 int i1 = isl_basic_map_alloc_inequality(dst);
1064 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
1067 for (i = 0; i < src->n_div; ++i) {
1068 int i1 = isl_basic_map_alloc_div(dst);
1071 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
1075 isl_basic_map_free(src);
1080 isl_basic_map_free(src);
1081 isl_basic_map_free(dst);
1085 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1086 struct isl_basic_set *bset2, unsigned pos)
1088 return (struct isl_basic_set *)
1089 add_constraints((struct isl_basic_map *)bset1,
1090 (struct isl_basic_map *)bset2, 0, pos);
1093 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1094 struct isl_dim *dim, unsigned extra,
1095 unsigned n_eq, unsigned n_ineq)
1097 struct isl_basic_map *ext;
1107 dims_ok = isl_dim_equal(base->dim, dim) &&
1108 base->extra >= base->n_div + extra;
1110 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1111 room_for_ineq(base, n_ineq)) {
1116 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1117 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1118 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1119 extra += base->extra;
1121 n_ineq += base->n_ineq;
1123 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1129 ext->sample = isl_vec_copy(base->sample);
1130 flags = base->flags;
1131 ext = add_constraints(ext, base, 0, 0);
1134 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1141 isl_basic_map_free(base);
1145 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1146 struct isl_dim *dim, unsigned extra,
1147 unsigned n_eq, unsigned n_ineq)
1149 return (struct isl_basic_set *)
1150 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1151 extra, n_eq, n_ineq);
1154 struct isl_basic_map *isl_basic_map_extend_constraints(
1155 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1159 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1163 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1164 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1165 unsigned n_eq, unsigned n_ineq)
1167 struct isl_basic_map *bmap;
1168 struct isl_dim *dim;
1172 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1176 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1179 isl_basic_map_free(base);
1183 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1184 unsigned nparam, unsigned dim, unsigned extra,
1185 unsigned n_eq, unsigned n_ineq)
1187 return (struct isl_basic_set *)
1188 isl_basic_map_extend((struct isl_basic_map *)base,
1189 nparam, 0, dim, extra, n_eq, n_ineq);
1192 struct isl_basic_set *isl_basic_set_extend_constraints(
1193 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1195 return (struct isl_basic_set *)
1196 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1200 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1202 return (struct isl_basic_set *)
1203 isl_basic_map_cow((struct isl_basic_map *)bset);
1206 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1211 if (bmap->ref > 1) {
1213 bmap = isl_basic_map_dup(bmap);
1216 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1220 struct isl_set *isl_set_cow(struct isl_set *set)
1228 return isl_set_dup(set);
1231 struct isl_map *isl_map_cow(struct isl_map *map)
1239 return isl_map_dup(map);
1242 static void swap_vars(struct isl_blk blk, isl_int *a,
1243 unsigned a_len, unsigned b_len)
1245 isl_seq_cpy(blk.data, a+a_len, b_len);
1246 isl_seq_cpy(blk.data+b_len, a, a_len);
1247 isl_seq_cpy(a, blk.data, b_len+a_len);
1250 struct isl_basic_set *isl_basic_set_swap_vars(
1251 struct isl_basic_set *bset, unsigned n)
1261 nparam = isl_basic_set_n_param(bset);
1262 dim = isl_basic_set_n_dim(bset);
1263 isl_assert(bset->ctx, n <= dim, goto error);
1268 bset = isl_basic_set_cow(bset);
1272 blk = isl_blk_alloc(bset->ctx, dim);
1273 if (isl_blk_is_error(blk))
1276 for (i = 0; i < bset->n_eq; ++i)
1278 bset->eq[i]+1+nparam, n, dim - n);
1280 for (i = 0; i < bset->n_ineq; ++i)
1282 bset->ineq[i]+1+nparam, n, dim - n);
1284 for (i = 0; i < bset->n_div; ++i)
1286 bset->div[i]+1+1+nparam, n, dim - n);
1288 isl_blk_free(bset->ctx, blk);
1290 ISL_F_CLR(bset, ISL_BASIC_SET_NORMALIZED);
1291 bset = isl_basic_set_gauss(bset, NULL);
1292 return isl_basic_set_finalize(bset);
1294 isl_basic_set_free(bset);
1298 struct isl_set *isl_set_swap_vars(struct isl_set *set, unsigned n)
1301 set = isl_set_cow(set);
1305 for (i = 0; i < set->n; ++i) {
1306 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1312 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1316 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1322 total = isl_basic_map_total_dim(bmap);
1323 isl_basic_map_free_div(bmap, bmap->n_div);
1324 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1326 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1328 i = isl_basic_map_alloc_equality(bmap);
1332 isl_int_set_si(bmap->eq[i][0], 1);
1333 isl_seq_clr(bmap->eq[i]+1, total);
1334 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1335 isl_vec_free(bmap->sample);
1336 bmap->sample = NULL;
1337 return isl_basic_map_finalize(bmap);
1339 isl_basic_map_free(bmap);
1343 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1345 return (struct isl_basic_set *)
1346 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1349 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1352 unsigned off = isl_dim_total(bmap->dim);
1353 isl_int *t = bmap->div[a];
1354 bmap->div[a] = bmap->div[b];
1357 for (i = 0; i < bmap->n_eq; ++i)
1358 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1360 for (i = 0; i < bmap->n_ineq; ++i)
1361 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1363 for (i = 0; i < bmap->n_div; ++i)
1364 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1365 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1368 /* Eliminate the specified n dimensions starting at first from the
1369 * constraints using Fourier-Motzkin. The dimensions themselves
1372 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1373 enum isl_dim_type type, unsigned first, unsigned n)
1382 map = isl_map_cow(map);
1385 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1386 first += pos(map->dim, type) - 1;
1388 for (i = 0; i < map->n; ++i) {
1389 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1399 /* Eliminate the specified n dimensions starting at first from the
1400 * constraints using Fourier-Motzkin. The dimensions themselves
1403 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1404 enum isl_dim_type type, unsigned first, unsigned n)
1406 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1409 /* Eliminate the specified n dimensions starting at first from the
1410 * constraints using Fourier-Motzkin. The dimensions themselves
1413 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1414 unsigned first, unsigned n)
1416 return isl_set_eliminate(set, isl_dim_set, first, n);
1419 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1420 __isl_take isl_basic_map *bmap)
1422 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1427 return isl_basic_map_finalize(bmap);
1430 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1431 __isl_take isl_basic_set *bset)
1433 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1434 (struct isl_basic_map *)bset);
1437 struct isl_set *isl_set_remove_divs(struct isl_set *set)
1446 set = isl_set_cow(set);
1450 for (i = 0; i < set->n; ++i) {
1451 set->p[i] = isl_basic_set_remove_divs(set->p[i]);
1461 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1462 enum isl_dim_type type, unsigned first, unsigned n)
1466 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1470 bmap = isl_basic_map_eliminate_vars(bmap,
1471 isl_basic_map_offset(bmap, type) - 1 + first, n);
1474 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1476 bmap = isl_basic_map_drop(bmap, type, first, n);
1479 isl_basic_map_free(bmap);
1483 /* Return true if the definition of the given div (recursively) involves
1484 * any of the given variables.
1486 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1487 unsigned first, unsigned n)
1490 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1492 if (isl_int_is_zero(bmap->div[div][0]))
1494 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1497 for (i = bmap->n_div - 1; i >= 0; --i) {
1498 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1500 if (div_involves_vars(bmap, i, first, n))
1507 /* Remove all divs (recursively) involving any of the given dimensions
1508 * in their definitions.
1510 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1511 __isl_take isl_basic_map *bmap,
1512 enum isl_dim_type type, unsigned first, unsigned n)
1518 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1520 first += isl_basic_map_offset(bmap, type);
1522 for (i = bmap->n_div - 1; i >= 0; --i) {
1523 if (!div_involves_vars(bmap, i, first, n))
1525 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1530 isl_basic_map_free(bmap);
1534 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1535 enum isl_dim_type type, unsigned first, unsigned n)
1544 map = isl_map_cow(map);
1548 for (i = 0; i < map->n; ++i) {
1549 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1560 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1561 enum isl_dim_type type, unsigned first, unsigned n)
1563 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1567 /* Return true if the definition of the given div is unknown or depends
1570 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1573 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1575 if (isl_int_is_zero(bmap->div[div][0]))
1578 for (i = bmap->n_div - 1; i >= 0; --i) {
1579 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1581 if (div_is_unknown(bmap, i))
1588 /* Remove all divs that are unknown or defined in terms of unknown divs.
1590 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1591 __isl_take isl_basic_map *bmap)
1598 for (i = bmap->n_div - 1; i >= 0; --i) {
1599 if (!div_is_unknown(bmap, i))
1601 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1606 isl_basic_map_free(bmap);
1610 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1619 map = isl_map_cow(map);
1623 for (i = 0; i < map->n; ++i) {
1624 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1634 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1636 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1639 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1640 __isl_take isl_basic_set *bset,
1641 enum isl_dim_type type, unsigned first, unsigned n)
1643 return (isl_basic_set *)
1644 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1647 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1648 enum isl_dim_type type, unsigned first, unsigned n)
1655 map = isl_map_cow(map);
1658 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1660 for (i = 0; i < map->n; ++i) {
1661 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1662 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1666 map = isl_map_drop(map, type, first, n);
1673 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1674 enum isl_dim_type type, unsigned first, unsigned n)
1676 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1679 /* Project out n inputs starting at first using Fourier-Motzkin */
1680 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1681 unsigned first, unsigned n)
1683 return isl_map_remove_dims(map, isl_dim_in, first, n);
1686 static void dump_term(struct isl_basic_map *bmap,
1687 isl_int c, int pos, FILE *out)
1690 unsigned in = isl_basic_map_n_in(bmap);
1691 unsigned dim = in + isl_basic_map_n_out(bmap);
1692 unsigned nparam = isl_basic_map_n_param(bmap);
1694 isl_int_print(out, c, 0);
1696 if (!isl_int_is_one(c))
1697 isl_int_print(out, c, 0);
1698 if (pos < 1 + nparam) {
1699 name = isl_dim_get_name(bmap->dim,
1700 isl_dim_param, pos - 1);
1702 fprintf(out, "%s", name);
1704 fprintf(out, "p%d", pos - 1);
1705 } else if (pos < 1 + nparam + in)
1706 fprintf(out, "i%d", pos - 1 - nparam);
1707 else if (pos < 1 + nparam + dim)
1708 fprintf(out, "o%d", pos - 1 - nparam - in);
1710 fprintf(out, "e%d", pos - 1 - nparam - dim);
1714 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1715 int sign, FILE *out)
1719 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1723 for (i = 0, first = 1; i < len; ++i) {
1724 if (isl_int_sgn(c[i]) * sign <= 0)
1727 fprintf(out, " + ");
1729 isl_int_abs(v, c[i]);
1730 dump_term(bmap, v, i, out);
1737 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1738 const char *op, FILE *out, int indent)
1742 fprintf(out, "%*s", indent, "");
1744 dump_constraint_sign(bmap, c, 1, out);
1745 fprintf(out, " %s ", op);
1746 dump_constraint_sign(bmap, c, -1, out);
1750 for (i = bmap->n_div; i < bmap->extra; ++i) {
1751 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1753 fprintf(out, "%*s", indent, "");
1754 fprintf(out, "ERROR: unused div coefficient not zero\n");
1759 static void dump_constraints(struct isl_basic_map *bmap,
1760 isl_int **c, unsigned n,
1761 const char *op, FILE *out, int indent)
1765 for (i = 0; i < n; ++i)
1766 dump_constraint(bmap, c[i], op, out, indent);
1769 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1773 unsigned total = isl_basic_map_total_dim(bmap);
1775 for (j = 0; j < 1 + total; ++j) {
1776 if (isl_int_is_zero(exp[j]))
1778 if (!first && isl_int_is_pos(exp[j]))
1780 dump_term(bmap, exp[j], j, out);
1785 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1789 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1790 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1792 for (i = 0; i < bmap->n_div; ++i) {
1793 fprintf(out, "%*s", indent, "");
1794 fprintf(out, "e%d = [(", i);
1795 dump_affine(bmap, bmap->div[i]+1, out);
1797 isl_int_print(out, bmap->div[i][0], 0);
1798 fprintf(out, "]\n");
1802 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1803 FILE *out, int indent)
1806 fprintf(out, "null basic set\n");
1810 fprintf(out, "%*s", indent, "");
1811 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1812 bset->ref, bset->dim->nparam, bset->dim->n_out,
1813 bset->extra, bset->flags);
1814 dump((struct isl_basic_map *)bset, out, indent);
1817 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1818 FILE *out, int indent)
1821 fprintf(out, "null basic map\n");
1825 fprintf(out, "%*s", indent, "");
1826 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1827 "flags: %x, n_name: %d\n",
1829 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1830 bmap->extra, bmap->flags, bmap->dim->n_name);
1831 dump(bmap, out, indent);
1834 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1839 total = isl_basic_map_total_dim(bmap);
1840 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1841 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1842 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1843 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1847 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1849 struct isl_set *set;
1853 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1854 isl_assert(dim->ctx, n >= 0, goto error);
1855 set = isl_alloc(dim->ctx, struct isl_set,
1856 sizeof(struct isl_set) +
1857 (n - 1) * sizeof(struct isl_basic_set *));
1861 set->ctx = dim->ctx;
1862 isl_ctx_ref(set->ctx);
1874 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1875 unsigned nparam, unsigned dim, int n, unsigned flags)
1877 struct isl_set *set;
1878 struct isl_dim *dims;
1880 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1884 set = isl_set_alloc_dim(dims, n, flags);
1888 /* Make sure "map" has room for at least "n" more basic maps.
1890 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1893 struct isl_map *grown = NULL;
1897 isl_assert(map->ctx, n >= 0, goto error);
1898 if (map->n + n <= map->size)
1900 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1903 for (i = 0; i < map->n; ++i) {
1904 grown->p[i] = isl_basic_map_copy(map->p[i]);
1912 isl_map_free(grown);
1917 /* Make sure "set" has room for at least "n" more basic sets.
1919 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1921 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1924 struct isl_set *isl_set_dup(struct isl_set *set)
1927 struct isl_set *dup;
1932 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1935 for (i = 0; i < set->n; ++i)
1936 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1940 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1942 return isl_map_from_basic_map(bset);
1945 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1947 struct isl_map *map;
1952 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1953 return isl_map_add_basic_map(map, bmap);
1956 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1957 __isl_take isl_basic_set *bset)
1959 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1960 (struct isl_basic_map *)bset);
1963 void isl_set_free(struct isl_set *set)
1973 isl_ctx_deref(set->ctx);
1974 for (i = 0; i < set->n; ++i)
1975 isl_basic_set_free(set->p[i]);
1976 isl_dim_free(set->dim);
1980 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
1985 fprintf(out, "null set\n");
1989 fprintf(out, "%*s", indent, "");
1990 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
1991 set->ref, set->n, set->dim->nparam, set->dim->n_out,
1993 for (i = 0; i < set->n; ++i) {
1994 fprintf(out, "%*s", indent, "");
1995 fprintf(out, "basic set %d:\n", i);
1996 isl_basic_set_print_internal(set->p[i], out, indent+4);
2000 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2005 fprintf(out, "null map\n");
2009 fprintf(out, "%*s", indent, "");
2010 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2011 "flags: %x, n_name: %d\n",
2012 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2013 map->dim->n_out, map->flags, map->dim->n_name);
2014 for (i = 0; i < map->n; ++i) {
2015 fprintf(out, "%*s", indent, "");
2016 fprintf(out, "basic map %d:\n", i);
2017 isl_basic_map_print_internal(map->p[i], out, indent+4);
2021 struct isl_basic_map *isl_basic_map_intersect_domain(
2022 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2024 struct isl_basic_map *bmap_domain;
2029 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2030 bset->dim, isl_dim_param), goto error);
2032 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2033 isl_assert(bset->ctx,
2034 isl_basic_map_compatible_domain(bmap, bset), goto error);
2036 bmap = isl_basic_map_cow(bmap);
2039 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2040 bset->n_div, bset->n_eq, bset->n_ineq);
2041 bmap_domain = isl_basic_map_from_domain(bset);
2042 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2044 bmap = isl_basic_map_simplify(bmap);
2045 return isl_basic_map_finalize(bmap);
2047 isl_basic_map_free(bmap);
2048 isl_basic_set_free(bset);
2052 struct isl_basic_map *isl_basic_map_intersect_range(
2053 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2055 struct isl_basic_map *bmap_range;
2060 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2061 bset->dim, isl_dim_param), goto error);
2063 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2064 isl_assert(bset->ctx,
2065 isl_basic_map_compatible_range(bmap, bset), goto error);
2067 bmap = isl_basic_map_cow(bmap);
2070 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2071 bset->n_div, bset->n_eq, bset->n_ineq);
2072 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2073 bmap = add_constraints(bmap, bmap_range, 0, 0);
2075 bmap = isl_basic_map_simplify(bmap);
2076 return isl_basic_map_finalize(bmap);
2078 isl_basic_map_free(bmap);
2079 isl_basic_set_free(bset);
2083 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2089 total = 1 + isl_basic_map_total_dim(bmap);
2090 if (total != vec->size)
2095 for (i = 0; i < bmap->n_eq; ++i) {
2096 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2097 if (!isl_int_is_zero(s)) {
2103 for (i = 0; i < bmap->n_ineq; ++i) {
2104 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2105 if (isl_int_is_neg(s)) {
2116 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2118 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2121 struct isl_basic_map *isl_basic_map_intersect(
2122 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2124 struct isl_vec *sample = NULL;
2126 if (!bmap1 || !bmap2)
2129 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2130 bmap2->dim, isl_dim_param), goto error);
2131 if (isl_dim_total(bmap1->dim) ==
2132 isl_dim_size(bmap1->dim, isl_dim_param) &&
2133 isl_dim_total(bmap2->dim) !=
2134 isl_dim_size(bmap2->dim, isl_dim_param))
2135 return isl_basic_map_intersect(bmap2, bmap1);
2137 if (isl_dim_total(bmap2->dim) !=
2138 isl_dim_size(bmap2->dim, isl_dim_param))
2139 isl_assert(bmap1->ctx,
2140 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2142 if (bmap1->sample &&
2143 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2144 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2145 sample = isl_vec_copy(bmap1->sample);
2146 else if (bmap2->sample &&
2147 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2148 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2149 sample = isl_vec_copy(bmap2->sample);
2151 bmap1 = isl_basic_map_cow(bmap1);
2154 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2155 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2156 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2159 isl_vec_free(sample);
2161 isl_vec_free(bmap1->sample);
2162 bmap1->sample = sample;
2165 bmap1 = isl_basic_map_simplify(bmap1);
2166 return isl_basic_map_finalize(bmap1);
2169 isl_vec_free(sample);
2170 isl_basic_map_free(bmap1);
2171 isl_basic_map_free(bmap2);
2175 struct isl_basic_set *isl_basic_set_intersect(
2176 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2178 return (struct isl_basic_set *)
2179 isl_basic_map_intersect(
2180 (struct isl_basic_map *)bset1,
2181 (struct isl_basic_map *)bset2);
2184 /* Special case of isl_map_intersect, where both map1 and map2
2185 * are convex, without any divs and such that either map1 or map2
2186 * contains a single constraint. This constraint is then simply
2187 * added to the other map.
2189 static __isl_give isl_map *map_intersect_add_constraint(
2190 __isl_take isl_map *map1, __isl_take isl_map *map2)
2192 struct isl_basic_map *bmap1;
2193 struct isl_basic_map *bmap2;
2195 isl_assert(map1->ctx, map1->n == 1, goto error);
2196 isl_assert(map2->ctx, map1->n == 1, goto error);
2197 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2198 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2200 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2201 return isl_map_intersect(map2, map1);
2203 isl_assert(map2->ctx,
2204 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2206 map1 = isl_map_cow(map1);
2209 if (isl_map_fast_is_empty(map1)) {
2213 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2214 if (map2->p[0]->n_eq == 1)
2215 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2217 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2218 map2->p[0]->ineq[0]);
2220 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2221 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2225 if (isl_basic_map_fast_is_empty(map1->p[0])) {
2226 isl_basic_map_free(map1->p[0]);
2239 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2242 struct isl_map *result;
2248 if (isl_map_fast_is_empty(map1)) {
2252 if (isl_map_fast_is_empty(map2)) {
2257 if (map1->n == 1 && map2->n == 1 &&
2258 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2259 isl_dim_equal(map1->dim, map2->dim) &&
2260 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2261 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2262 return map_intersect_add_constraint(map1, map2);
2263 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2264 map2->dim, isl_dim_param), goto error);
2265 if (isl_dim_total(map1->dim) ==
2266 isl_dim_size(map1->dim, isl_dim_param) &&
2267 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2268 return isl_map_intersect(map2, map1);
2270 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2271 isl_assert(map1->ctx,
2272 isl_dim_equal(map1->dim, map2->dim), goto error);
2274 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2275 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2276 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2278 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2279 map1->n * map2->n, flags);
2282 for (i = 0; i < map1->n; ++i)
2283 for (j = 0; j < map2->n; ++j) {
2284 struct isl_basic_map *part;
2285 part = isl_basic_map_intersect(
2286 isl_basic_map_copy(map1->p[i]),
2287 isl_basic_map_copy(map2->p[j]));
2288 if (isl_basic_map_is_empty(part))
2289 isl_basic_map_free(part);
2291 result = isl_map_add_basic_map(result, part);
2304 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2306 return (struct isl_set *)
2307 isl_map_intersect((struct isl_map *)set1,
2308 (struct isl_map *)set2);
2311 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2313 struct isl_dim *dim;
2314 struct isl_basic_set *bset;
2319 bmap = isl_basic_map_cow(bmap);
2322 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2323 in = isl_basic_map_n_in(bmap);
2324 bset = isl_basic_set_from_basic_map(bmap);
2325 bset = isl_basic_set_swap_vars(bset, in);
2326 return isl_basic_map_from_basic_set(bset, dim);
2329 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2330 enum isl_dim_type type, unsigned pos, unsigned n)
2332 struct isl_dim *res_dim;
2333 struct isl_basic_map *res;
2334 struct isl_dim_map *dim_map;
2335 unsigned total, off;
2336 enum isl_dim_type t;
2344 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2346 total = isl_basic_map_total_dim(bmap) + n;
2347 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2349 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2351 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2353 unsigned size = isl_basic_map_dim(bmap, t);
2354 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2356 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2357 pos, size - pos, off + pos + n);
2359 off += isl_dim_size(res_dim, t);
2361 isl_dim_map_div(dim_map, bmap, off);
2363 res = isl_basic_map_alloc_dim(res_dim,
2364 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2365 if (isl_basic_map_is_rational(bmap))
2366 res = isl_basic_map_set_rational(res);
2367 res = add_constraints_dim_map(res, bmap, dim_map);
2368 return isl_basic_map_finalize(res);
2371 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2372 enum isl_dim_type type, unsigned n)
2376 return isl_basic_map_insert(bmap, type,
2377 isl_basic_map_dim(bmap, type), n);
2380 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2381 enum isl_dim_type type, unsigned n)
2385 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2386 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2388 isl_basic_set_free(bset);
2392 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2393 enum isl_dim_type type, unsigned pos, unsigned n)
2400 map = isl_map_cow(map);
2404 map->dim = isl_dim_insert(map->dim, type, pos, n);
2408 for (i = 0; i < map->n; ++i) {
2409 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2420 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2421 enum isl_dim_type type, unsigned pos, unsigned n)
2423 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2426 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2427 enum isl_dim_type type, unsigned n)
2431 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2434 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2435 enum isl_dim_type type, unsigned n)
2439 isl_assert(set->ctx, type != isl_dim_in, goto error);
2440 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2446 __isl_give isl_basic_map *isl_basic_map_move_dims(
2447 __isl_take isl_basic_map *bmap,
2448 enum isl_dim_type dst_type, unsigned dst_pos,
2449 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2452 struct isl_dim_map *dim_map;
2453 struct isl_basic_map *res;
2454 enum isl_dim_type t;
2455 unsigned total, off;
2462 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2465 if (dst_type == src_type && dst_pos == src_pos)
2468 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2470 if (pos(bmap->dim, dst_type) + dst_pos ==
2471 pos(bmap->dim, src_type) + src_pos +
2472 ((src_type < dst_type) ? n : 0)) {
2473 bmap = isl_basic_map_cow(bmap);
2477 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2478 src_type, src_pos, n);
2482 bmap = isl_basic_map_finalize(bmap);
2487 total = isl_basic_map_total_dim(bmap);
2488 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2491 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2492 unsigned size = isl_dim_size(bmap->dim, t);
2493 if (t == dst_type) {
2494 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2497 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2500 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2501 dst_pos, size - dst_pos, off);
2502 off += size - dst_pos;
2503 } else if (t == src_type) {
2504 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2507 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2508 src_pos + n, size - src_pos - n, off);
2509 off += size - src_pos - n;
2511 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2515 isl_dim_map_div(dim_map, bmap, off);
2517 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2518 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2519 bmap = add_constraints_dim_map(res, bmap, dim_map);
2521 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2522 src_type, src_pos, n);
2526 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2527 bmap = isl_basic_map_gauss(bmap, NULL);
2528 bmap = isl_basic_map_finalize(bmap);
2532 isl_basic_map_free(bmap);
2536 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2537 enum isl_dim_type dst_type, unsigned dst_pos,
2538 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2540 return (isl_basic_set *)isl_basic_map_move_dims(
2541 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2544 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2545 enum isl_dim_type dst_type, unsigned dst_pos,
2546 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2550 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2551 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2552 src_type, src_pos, n);
2558 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2559 enum isl_dim_type dst_type, unsigned dst_pos,
2560 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2569 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2572 if (dst_type == src_type && dst_pos == src_pos)
2575 isl_assert(map->ctx, dst_type != src_type, goto error);
2577 map = isl_map_cow(map);
2581 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2585 for (i = 0; i < map->n; ++i) {
2586 map->p[i] = isl_basic_map_move_dims(map->p[i],
2588 src_type, src_pos, n);
2599 /* Move the specified dimensions to the last columns right before
2600 * the divs. Don't change the dimension specification of bmap.
2601 * That's the responsibility of the caller.
2603 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2604 enum isl_dim_type type, unsigned first, unsigned n)
2606 struct isl_dim_map *dim_map;
2607 struct isl_basic_map *res;
2608 enum isl_dim_type t;
2609 unsigned total, off;
2613 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2616 total = isl_basic_map_total_dim(bmap);
2617 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2620 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2621 unsigned size = isl_dim_size(bmap->dim, t);
2623 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2626 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2627 first, n, total - bmap->n_div - n);
2628 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2629 first + n, size - (first + n), off);
2630 off += size - (first + n);
2632 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2636 isl_dim_map_div(dim_map, bmap, off + n);
2638 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2639 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2640 res = add_constraints_dim_map(res, bmap, dim_map);
2644 /* Turn the n dimensions of type type, starting at first
2645 * into existentially quantified variables.
2647 __isl_give isl_basic_map *isl_basic_map_project_out(
2648 __isl_take isl_basic_map *bmap,
2649 enum isl_dim_type type, unsigned first, unsigned n)
2662 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2663 return isl_basic_map_remove_dims(bmap, type, first, n);
2665 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2668 bmap = move_last(bmap, type, first, n);
2669 bmap = isl_basic_map_cow(bmap);
2673 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2674 old = bmap->block2.data;
2675 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2676 (bmap->extra + n) * (1 + row_size));
2677 if (!bmap->block2.data)
2679 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2682 for (i = 0; i < n; ++i) {
2683 new_div[i] = bmap->block2.data +
2684 (bmap->extra + i) * (1 + row_size);
2685 isl_seq_clr(new_div[i], 1 + row_size);
2687 for (i = 0; i < bmap->extra; ++i)
2688 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2690 bmap->div = new_div;
2694 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2697 bmap = isl_basic_map_simplify(bmap);
2698 bmap = isl_basic_map_drop_redundant_divs(bmap);
2699 return isl_basic_map_finalize(bmap);
2701 isl_basic_map_free(bmap);
2705 /* Turn the n dimensions of type type, starting at first
2706 * into existentially quantified variables.
2708 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2709 enum isl_dim_type type, unsigned first, unsigned n)
2711 return (isl_basic_set *)isl_basic_map_project_out(
2712 (isl_basic_map *)bset, type, first, n);
2715 /* Turn the n dimensions of type type, starting at first
2716 * into existentially quantified variables.
2718 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2719 enum isl_dim_type type, unsigned first, unsigned n)
2729 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2731 map = isl_map_cow(map);
2735 map->dim = isl_dim_drop(map->dim, type, first, n);
2739 for (i = 0; i < map->n; ++i) {
2740 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2751 /* Turn the n dimensions of type type, starting at first
2752 * into existentially quantified variables.
2754 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2755 enum isl_dim_type type, unsigned first, unsigned n)
2757 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2760 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2764 for (i = 0; i < n; ++i) {
2765 j = isl_basic_map_alloc_div(bmap);
2768 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2772 isl_basic_map_free(bmap);
2776 struct isl_basic_map *isl_basic_map_apply_range(
2777 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2779 struct isl_dim *dim_result = NULL;
2780 struct isl_basic_map *bmap;
2781 unsigned n_in, n_out, n, nparam, total, pos;
2782 struct isl_dim_map *dim_map1, *dim_map2;
2784 if (!bmap1 || !bmap2)
2787 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2788 isl_dim_copy(bmap2->dim));
2790 n_in = isl_basic_map_n_in(bmap1);
2791 n_out = isl_basic_map_n_out(bmap2);
2792 n = isl_basic_map_n_out(bmap1);
2793 nparam = isl_basic_map_n_param(bmap1);
2795 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2796 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2797 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2798 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2799 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2800 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2801 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2802 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2803 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2804 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2805 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2807 bmap = isl_basic_map_alloc_dim(dim_result,
2808 bmap1->n_div + bmap2->n_div + n,
2809 bmap1->n_eq + bmap2->n_eq,
2810 bmap1->n_ineq + bmap2->n_ineq);
2811 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2812 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2813 bmap = add_divs(bmap, n);
2814 bmap = isl_basic_map_simplify(bmap);
2815 bmap = isl_basic_map_drop_redundant_divs(bmap);
2816 return isl_basic_map_finalize(bmap);
2818 isl_basic_map_free(bmap1);
2819 isl_basic_map_free(bmap2);
2823 struct isl_basic_set *isl_basic_set_apply(
2824 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2829 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2832 return (struct isl_basic_set *)
2833 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2835 isl_basic_set_free(bset);
2836 isl_basic_map_free(bmap);
2840 struct isl_basic_map *isl_basic_map_apply_domain(
2841 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2843 if (!bmap1 || !bmap2)
2846 isl_assert(bmap1->ctx,
2847 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2848 isl_assert(bmap1->ctx,
2849 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2852 bmap1 = isl_basic_map_reverse(bmap1);
2853 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2854 return isl_basic_map_reverse(bmap1);
2856 isl_basic_map_free(bmap1);
2857 isl_basic_map_free(bmap2);
2861 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2862 * A \cap B -> f(A) + f(B)
2864 struct isl_basic_map *isl_basic_map_sum(
2865 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2867 unsigned n_in, n_out, nparam, total, pos;
2868 struct isl_basic_map *bmap = NULL;
2869 struct isl_dim_map *dim_map1, *dim_map2;
2872 if (!bmap1 || !bmap2)
2875 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2878 nparam = isl_basic_map_n_param(bmap1);
2879 n_in = isl_basic_map_n_in(bmap1);
2880 n_out = isl_basic_map_n_out(bmap1);
2882 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2883 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2884 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2885 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2886 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2887 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2888 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2889 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2890 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2891 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2892 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2894 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2895 bmap1->n_div + bmap2->n_div + 2 * n_out,
2896 bmap1->n_eq + bmap2->n_eq + n_out,
2897 bmap1->n_ineq + bmap2->n_ineq);
2898 for (i = 0; i < n_out; ++i) {
2899 int j = isl_basic_map_alloc_equality(bmap);
2902 isl_seq_clr(bmap->eq[j], 1+total);
2903 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2904 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2905 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2907 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
2908 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
2909 bmap = add_divs(bmap, 2 * n_out);
2911 bmap = isl_basic_map_simplify(bmap);
2912 return isl_basic_map_finalize(bmap);
2914 isl_basic_map_free(bmap);
2915 isl_basic_map_free(bmap1);
2916 isl_basic_map_free(bmap2);
2920 /* Given two maps A -> f(A) and B -> g(B), construct a map
2921 * A \cap B -> f(A) + f(B)
2923 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2925 struct isl_map *result;
2931 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2933 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2934 map1->n * map2->n, 0);
2937 for (i = 0; i < map1->n; ++i)
2938 for (j = 0; j < map2->n; ++j) {
2939 struct isl_basic_map *part;
2940 part = isl_basic_map_sum(
2941 isl_basic_map_copy(map1->p[i]),
2942 isl_basic_map_copy(map2->p[j]));
2943 if (isl_basic_map_is_empty(part))
2944 isl_basic_map_free(part);
2946 result = isl_map_add_basic_map(result, part);
2959 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2960 __isl_take isl_set *set2)
2962 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2965 /* Given a basic map A -> f(A), construct A -> -f(A).
2967 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
2972 bmap = isl_basic_map_cow(bmap);
2976 n = isl_basic_map_dim(bmap, isl_dim_out);
2977 off = isl_basic_map_offset(bmap, isl_dim_out);
2978 for (i = 0; i < bmap->n_eq; ++i)
2979 for (j = 0; j < n; ++j)
2980 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
2981 for (i = 0; i < bmap->n_ineq; ++i)
2982 for (j = 0; j < n; ++j)
2983 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
2984 for (i = 0; i < bmap->n_div; ++i)
2985 for (j = 0; j < n; ++j)
2986 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
2987 return isl_basic_map_finalize(bmap);
2990 /* Given a map A -> f(A), construct A -> -f(A).
2992 struct isl_map *isl_map_neg(struct isl_map *map)
2996 map = isl_map_cow(map);
3000 for (i = 0; i < map->n; ++i) {
3001 map->p[i] = isl_basic_map_neg(map->p[i]);
3012 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3014 return (isl_set *)isl_map_neg((isl_map *)set);
3017 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3018 * A -> floor(f(A)/d).
3020 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3023 unsigned n_in, n_out, nparam, total, pos;
3024 struct isl_basic_map *result = NULL;
3025 struct isl_dim_map *dim_map;
3031 nparam = isl_basic_map_n_param(bmap);
3032 n_in = isl_basic_map_n_in(bmap);
3033 n_out = isl_basic_map_n_out(bmap);
3035 total = nparam + n_in + n_out + bmap->n_div + n_out;
3036 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3037 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3038 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3039 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3040 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3042 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3043 bmap->n_div + n_out,
3044 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3045 result = add_constraints_dim_map(result, bmap, dim_map);
3046 result = add_divs(result, n_out);
3047 for (i = 0; i < n_out; ++i) {
3049 j = isl_basic_map_alloc_inequality(result);
3052 isl_seq_clr(result->ineq[j], 1+total);
3053 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3054 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3055 j = isl_basic_map_alloc_inequality(result);
3058 isl_seq_clr(result->ineq[j], 1+total);
3059 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3060 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3061 isl_int_sub_ui(result->ineq[j][0], d, 1);
3064 result = isl_basic_map_simplify(result);
3065 return isl_basic_map_finalize(result);
3067 isl_basic_map_free(result);
3071 /* Given a map A -> f(A) and an integer d, construct a map
3072 * A -> floor(f(A)/d).
3074 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3078 map = isl_map_cow(map);
3082 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3083 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3084 for (i = 0; i < map->n; ++i) {
3085 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3096 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3102 i = isl_basic_map_alloc_equality(bmap);
3105 nparam = isl_basic_map_n_param(bmap);
3106 n_in = isl_basic_map_n_in(bmap);
3107 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3108 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3109 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3110 return isl_basic_map_finalize(bmap);
3112 isl_basic_map_free(bmap);
3116 /* Add a constraints to "bmap" expressing i_pos < o_pos
3118 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3124 i = isl_basic_map_alloc_inequality(bmap);
3127 nparam = isl_basic_map_n_param(bmap);
3128 n_in = isl_basic_map_n_in(bmap);
3129 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3130 isl_int_set_si(bmap->ineq[i][0], -1);
3131 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3132 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3133 return isl_basic_map_finalize(bmap);
3135 isl_basic_map_free(bmap);
3139 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3141 static __isl_give isl_basic_map *var_less_or_equal(
3142 __isl_take isl_basic_map *bmap, unsigned pos)
3148 i = isl_basic_map_alloc_inequality(bmap);
3151 nparam = isl_basic_map_n_param(bmap);
3152 n_in = isl_basic_map_n_in(bmap);
3153 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3154 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3155 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3156 return isl_basic_map_finalize(bmap);
3158 isl_basic_map_free(bmap);
3162 /* Add a constraints to "bmap" expressing i_pos > o_pos
3164 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3170 i = isl_basic_map_alloc_inequality(bmap);
3173 nparam = isl_basic_map_n_param(bmap);
3174 n_in = isl_basic_map_n_in(bmap);
3175 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3176 isl_int_set_si(bmap->ineq[i][0], -1);
3177 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3178 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3179 return isl_basic_map_finalize(bmap);
3181 isl_basic_map_free(bmap);
3185 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3187 static __isl_give isl_basic_map *var_more_or_equal(
3188 __isl_take isl_basic_map *bmap, unsigned pos)
3194 i = isl_basic_map_alloc_inequality(bmap);
3197 nparam = isl_basic_map_n_param(bmap);
3198 n_in = isl_basic_map_n_in(bmap);
3199 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3200 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3201 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3202 return isl_basic_map_finalize(bmap);
3204 isl_basic_map_free(bmap);
3208 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3211 struct isl_basic_map *bmap;
3212 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3215 for (i = 0; i < n_equal && bmap; ++i)
3216 bmap = var_equal(bmap, i);
3217 return isl_basic_map_finalize(bmap);
3220 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3222 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3225 struct isl_basic_map *bmap;
3226 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3229 for (i = 0; i < pos && bmap; ++i)
3230 bmap = var_equal(bmap, i);
3232 bmap = var_less(bmap, pos);
3233 return isl_basic_map_finalize(bmap);
3236 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3238 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3239 __isl_take isl_dim *dim, unsigned pos)
3242 isl_basic_map *bmap;
3244 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3245 for (i = 0; i < pos; ++i)
3246 bmap = var_equal(bmap, i);
3247 bmap = var_less_or_equal(bmap, pos);
3248 return isl_basic_map_finalize(bmap);
3251 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3253 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3256 struct isl_basic_map *bmap;
3257 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3260 for (i = 0; i < pos && bmap; ++i)
3261 bmap = var_equal(bmap, i);
3263 bmap = var_more(bmap, pos);
3264 return isl_basic_map_finalize(bmap);
3267 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3269 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3270 __isl_take isl_dim *dim, unsigned pos)
3273 isl_basic_map *bmap;
3275 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3276 for (i = 0; i < pos; ++i)
3277 bmap = var_equal(bmap, i);
3278 bmap = var_more_or_equal(bmap, pos);
3279 return isl_basic_map_finalize(bmap);
3282 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3283 unsigned n, int equal)
3285 struct isl_map *map;
3288 if (n == 0 && equal)
3289 return isl_map_universe(dims);
3291 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3293 for (i = 0; i + 1 < n; ++i)
3294 map = isl_map_add_basic_map(map,
3295 isl_basic_map_less_at(isl_dim_copy(dims), i));
3298 map = isl_map_add_basic_map(map,
3299 isl_basic_map_less_or_equal_at(dims, n - 1));
3301 map = isl_map_add_basic_map(map,
3302 isl_basic_map_less_at(dims, n - 1));
3309 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3313 return map_lex_lte_first(dims, dims->n_out, equal);
3316 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3318 return map_lex_lte_first(dim, n, 0);
3321 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3323 return map_lex_lte_first(dim, n, 1);
3326 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3328 return map_lex_lte(isl_dim_map(set_dim), 0);
3331 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3333 return map_lex_lte(isl_dim_map(set_dim), 1);
3336 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3337 unsigned n, int equal)
3339 struct isl_map *map;
3342 if (n == 0 && equal)
3343 return isl_map_universe(dims);
3345 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3347 for (i = 0; i + 1 < n; ++i)
3348 map = isl_map_add_basic_map(map,
3349 isl_basic_map_more_at(isl_dim_copy(dims), i));
3352 map = isl_map_add_basic_map(map,
3353 isl_basic_map_more_or_equal_at(dims, n - 1));
3355 map = isl_map_add_basic_map(map,
3356 isl_basic_map_more_at(dims, n - 1));
3363 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3367 return map_lex_gte_first(dims, dims->n_out, equal);
3370 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3372 return map_lex_gte_first(dim, n, 0);
3375 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3377 return map_lex_gte_first(dim, n, 1);
3380 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3382 return map_lex_gte(isl_dim_map(set_dim), 0);
3385 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3387 return map_lex_gte(isl_dim_map(set_dim), 1);
3390 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3391 __isl_take isl_set *set2)
3394 map = isl_map_lex_le(isl_set_get_dim(set1));
3395 map = isl_map_intersect_domain(map, set1);
3396 map = isl_map_intersect_range(map, set2);
3400 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3401 __isl_take isl_set *set2)
3404 map = isl_map_lex_lt(isl_set_get_dim(set1));
3405 map = isl_map_intersect_domain(map, set1);
3406 map = isl_map_intersect_range(map, set2);
3410 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3411 __isl_take isl_set *set2)
3414 map = isl_map_lex_ge(isl_set_get_dim(set1));
3415 map = isl_map_intersect_domain(map, set1);
3416 map = isl_map_intersect_range(map, set2);
3420 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3421 __isl_take isl_set *set2)
3424 map = isl_map_lex_gt(isl_set_get_dim(set1));
3425 map = isl_map_intersect_domain(map, set1);
3426 map = isl_map_intersect_range(map, set2);
3430 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3431 __isl_take isl_map *map2)
3434 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3435 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3436 map = isl_map_apply_range(map, isl_map_reverse(map2));
3440 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3441 __isl_take isl_map *map2)
3444 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3445 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3446 map = isl_map_apply_range(map, isl_map_reverse(map2));
3450 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3451 __isl_take isl_map *map2)
3454 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3455 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3456 map = isl_map_apply_range(map, isl_map_reverse(map2));
3460 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3461 __isl_take isl_map *map2)
3464 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3465 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3466 map = isl_map_apply_range(map, isl_map_reverse(map2));
3470 struct isl_basic_map *isl_basic_map_from_basic_set(
3471 struct isl_basic_set *bset, struct isl_dim *dim)
3473 struct isl_basic_map *bmap;
3475 bset = isl_basic_set_cow(bset);
3479 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3480 isl_dim_free(bset->dim);
3481 bmap = (struct isl_basic_map *) bset;
3483 return isl_basic_map_finalize(bmap);
3485 isl_basic_set_free(bset);
3490 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3494 if (bmap->dim->n_in == 0)
3495 return (struct isl_basic_set *)bmap;
3496 bmap = isl_basic_map_cow(bmap);
3499 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3502 bmap = isl_basic_map_finalize(bmap);
3503 return (struct isl_basic_set *)bmap;
3505 isl_basic_map_free(bmap);
3509 /* For a div d = floor(f/m), add the constraints
3512 * -(f-(n-1)) + m d >= 0
3514 * Note that the second constraint is the negation of
3518 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3519 unsigned pos, isl_int *div)
3522 unsigned total = isl_basic_map_total_dim(bmap);
3524 i = isl_basic_map_alloc_inequality(bmap);
3527 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3528 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3530 j = isl_basic_map_alloc_inequality(bmap);
3533 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3534 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3535 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3539 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3540 unsigned pos, isl_int *div)
3542 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3546 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3548 unsigned total = isl_basic_map_total_dim(bmap);
3549 unsigned div_pos = total - bmap->n_div + div;
3551 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3555 struct isl_basic_set *isl_basic_map_underlying_set(
3556 struct isl_basic_map *bmap)
3560 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3562 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3563 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3564 return (struct isl_basic_set *)bmap;
3565 bmap = isl_basic_map_cow(bmap);
3568 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3571 bmap->extra -= bmap->n_div;
3573 bmap = isl_basic_map_finalize(bmap);
3574 return (struct isl_basic_set *)bmap;
3579 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3580 __isl_take isl_basic_set *bset)
3582 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3585 struct isl_basic_map *isl_basic_map_overlying_set(
3586 struct isl_basic_set *bset, struct isl_basic_map *like)
3588 struct isl_basic_map *bmap;
3589 struct isl_ctx *ctx;
3596 isl_assert(ctx, bset->n_div == 0, goto error);
3597 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3598 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3600 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3601 isl_basic_map_free(like);
3602 return (struct isl_basic_map *)bset;
3604 bset = isl_basic_set_cow(bset);
3607 total = bset->dim->n_out + bset->extra;
3608 bmap = (struct isl_basic_map *)bset;
3609 isl_dim_free(bmap->dim);
3610 bmap->dim = isl_dim_copy(like->dim);
3613 bmap->n_div = like->n_div;
3614 bmap->extra += like->n_div;
3617 ltotal = total - bmap->extra + like->extra;
3620 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3621 bmap->extra * (1 + 1 + total));
3622 if (isl_blk_is_error(bmap->block2))
3624 bmap->div = isl_realloc_array(ctx, bmap->div, isl_int *,
3628 for (i = 0; i < bmap->extra; ++i)
3629 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3630 for (i = 0; i < like->n_div; ++i) {
3631 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3632 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3634 bmap = isl_basic_map_extend_constraints(bmap,
3635 0, 2 * like->n_div);
3636 for (i = 0; i < like->n_div; ++i) {
3637 if (isl_int_is_zero(bmap->div[i][0]))
3639 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3643 isl_basic_map_free(like);
3644 bmap = isl_basic_map_simplify(bmap);
3645 bmap = isl_basic_map_finalize(bmap);
3648 isl_basic_map_free(like);
3649 isl_basic_set_free(bset);
3653 struct isl_basic_set *isl_basic_set_from_underlying_set(
3654 struct isl_basic_set *bset, struct isl_basic_set *like)
3656 return (struct isl_basic_set *)
3657 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3660 struct isl_set *isl_set_from_underlying_set(
3661 struct isl_set *set, struct isl_basic_set *like)
3667 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3669 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3670 isl_basic_set_free(like);
3673 set = isl_set_cow(set);
3676 for (i = 0; i < set->n; ++i) {
3677 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3678 isl_basic_set_copy(like));
3682 isl_dim_free(set->dim);
3683 set->dim = isl_dim_copy(like->dim);
3686 isl_basic_set_free(like);
3689 isl_basic_set_free(like);
3694 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3698 map = isl_map_cow(map);
3701 map->dim = isl_dim_cow(map->dim);
3705 for (i = 1; i < map->n; ++i)
3706 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3708 for (i = 0; i < map->n; ++i) {
3709 map->p[i] = (struct isl_basic_map *)
3710 isl_basic_map_underlying_set(map->p[i]);
3715 map->dim = isl_dim_underlying(map->dim, 0);
3717 isl_dim_free(map->dim);
3718 map->dim = isl_dim_copy(map->p[0]->dim);
3722 return (struct isl_set *)map;
3728 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3730 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3733 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3734 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3736 bmap = isl_basic_map_cow(bmap);
3740 isl_dim_free(bmap->dim);
3743 bmap = isl_basic_map_finalize(bmap);
3747 isl_basic_map_free(bmap);
3752 static __isl_give isl_basic_set *isl_basic_set_reset_dim(
3753 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3755 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3759 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3760 __isl_take isl_dim *dim)
3764 map = isl_map_cow(map);
3768 for (i = 0; i < map->n; ++i) {
3769 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3774 isl_dim_free(map->dim);
3784 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3785 __isl_take isl_dim *dim)
3787 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3790 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3793 struct isl_basic_set *domain;
3799 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3801 n_in = isl_basic_map_n_in(bmap);
3802 n_out = isl_basic_map_n_out(bmap);
3803 domain = isl_basic_set_from_basic_map(bmap);
3804 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3806 domain = isl_basic_set_reset_dim(domain, dim);
3811 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3813 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3816 __isl_give isl_basic_map *isl_basic_map_domain_map(
3817 __isl_take isl_basic_map *bmap)
3821 isl_basic_map *domain;
3822 isl_basic_set *bset;
3823 int nparam, n_in, n_out;
3826 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3827 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3828 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3830 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3831 domain = isl_basic_map_universe(dim);
3833 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3834 bmap = isl_basic_map_apply_range(bmap, domain);
3835 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3837 total = isl_basic_map_total_dim(bmap);
3839 for (i = 0; i < n_in; ++i) {
3840 k = isl_basic_map_alloc_equality(bmap);
3843 isl_seq_clr(bmap->eq[k], 1 + total);
3844 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3845 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3848 bmap = isl_basic_map_gauss(bmap, NULL);
3849 return isl_basic_map_finalize(bmap);
3851 isl_basic_map_free(bmap);
3855 __isl_give isl_basic_map *isl_basic_map_range_map(
3856 __isl_take isl_basic_map *bmap)
3860 isl_basic_map *range;
3861 isl_basic_set *bset;
3862 int nparam, n_in, n_out;
3865 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3866 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3867 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3869 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3870 range = isl_basic_map_universe(dim);
3872 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3873 bmap = isl_basic_map_apply_range(bmap, range);
3874 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3876 total = isl_basic_map_total_dim(bmap);
3878 for (i = 0; i < n_out; ++i) {
3879 k = isl_basic_map_alloc_equality(bmap);
3882 isl_seq_clr(bmap->eq[k], 1 + total);
3883 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3884 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3887 bmap = isl_basic_map_gauss(bmap, NULL);
3888 return isl_basic_map_finalize(bmap);
3890 isl_basic_map_free(bmap);
3894 struct isl_set *isl_map_range(struct isl_map *map)
3897 struct isl_set *set;
3901 if (isl_map_dim(map, isl_dim_in) == 0)
3902 return (isl_set *)map;
3904 map = isl_map_cow(map);
3908 set = (struct isl_set *) map;
3909 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3912 for (i = 0; i < map->n; ++i) {
3913 set->p[i] = isl_basic_map_range(map->p[i]);
3917 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3918 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3925 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3928 isl_dim *domain_dim;
3930 map = isl_map_cow(map);
3934 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3935 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3936 map->dim = isl_dim_join(map->dim, domain_dim);
3939 for (i = 0; i < map->n; ++i) {
3940 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3944 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3945 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3952 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
3957 map = isl_map_cow(map);
3961 range_dim = isl_dim_range(isl_map_get_dim(map));
3962 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3963 map->dim = isl_dim_join(map->dim, range_dim);
3966 for (i = 0; i < map->n; ++i) {
3967 map->p[i] = isl_basic_map_range_map(map->p[i]);
3971 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3972 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3979 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
3982 struct isl_map *map = NULL;
3984 set = isl_set_cow(set);
3987 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
3988 map = (struct isl_map *)set;
3989 for (i = 0; i < set->n; ++i) {
3990 map->p[i] = isl_basic_map_from_basic_set(
3991 set->p[i], isl_dim_copy(dim));
3995 isl_dim_free(map->dim);
4004 __isl_give isl_basic_map *isl_basic_map_from_domain(
4005 __isl_take isl_basic_set *bset)
4007 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4010 __isl_give isl_basic_map *isl_basic_map_from_range(
4011 __isl_take isl_basic_set *bset)
4013 return (isl_basic_map *)bset;
4016 struct isl_map *isl_map_from_range(struct isl_set *set)
4018 return (struct isl_map *)set;
4021 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4023 return isl_map_reverse(isl_map_from_range(set));
4026 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4027 __isl_take isl_set *range)
4029 return isl_map_apply_range(isl_map_from_domain(domain),
4030 isl_map_from_range(range));
4033 struct isl_set *isl_set_from_map(struct isl_map *map)
4036 struct isl_set *set = NULL;
4040 map = isl_map_cow(map);
4043 map->dim = isl_dim_as_set_dim(map->dim);
4046 set = (struct isl_set *)map;
4047 for (i = 0; i < map->n; ++i) {
4048 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4058 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4060 struct isl_map *map;
4064 isl_assert(dim->ctx, n >= 0, return NULL);
4065 map = isl_alloc(dim->ctx, struct isl_map,
4066 sizeof(struct isl_map) +
4067 (n - 1) * sizeof(struct isl_basic_map *));
4071 map->ctx = dim->ctx;
4072 isl_ctx_ref(map->ctx);
4084 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4085 unsigned nparam, unsigned in, unsigned out, int n,
4088 struct isl_map *map;
4089 struct isl_dim *dims;
4091 dims = isl_dim_alloc(ctx, nparam, in, out);
4095 map = isl_map_alloc_dim(dims, n, flags);
4099 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4101 struct isl_basic_map *bmap;
4102 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4103 bmap = isl_basic_map_set_to_empty(bmap);
4107 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4109 struct isl_basic_set *bset;
4110 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4111 bset = isl_basic_set_set_to_empty(bset);
4115 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4117 struct isl_basic_map *bmap;
4120 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4121 bmap = isl_basic_map_set_to_empty(bmap);
4125 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4127 struct isl_basic_map *bmap;
4130 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4131 bmap = isl_basic_map_set_to_empty(bmap);
4135 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4137 struct isl_basic_set *bset;
4140 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4141 bset = isl_basic_set_set_to_empty(bset);
4145 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4147 struct isl_basic_map *bmap;
4148 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4149 bmap = isl_basic_map_finalize(bmap);
4153 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4155 struct isl_basic_set *bset;
4156 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4157 bset = isl_basic_set_finalize(bset);
4161 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4164 unsigned total = isl_dim_total(dim);
4165 isl_basic_map *bmap;
4167 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4168 for (i = 0; i < total; ++i) {
4169 int k = isl_basic_map_alloc_inequality(bmap);
4172 isl_seq_clr(bmap->ineq[k], 1 + total);
4173 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4177 isl_basic_map_free(bmap);
4181 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4183 return isl_basic_map_nat_universe(dim);
4186 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4188 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4191 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4193 return isl_map_nat_universe(dim);
4196 __isl_give isl_basic_map *isl_basic_map_universe_like(
4197 __isl_keep isl_basic_map *model)
4201 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4204 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4208 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4211 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4212 __isl_keep isl_set *model)
4216 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4219 struct isl_map *isl_map_empty(struct isl_dim *dim)
4221 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4224 struct isl_map *isl_map_empty_like(struct isl_map *model)
4228 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4231 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4235 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4238 struct isl_set *isl_set_empty(struct isl_dim *dim)
4240 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4243 struct isl_set *isl_set_empty_like(struct isl_set *model)
4247 return isl_set_empty(isl_dim_copy(model->dim));
4250 struct isl_map *isl_map_universe(struct isl_dim *dim)
4252 struct isl_map *map;
4255 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4256 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4260 struct isl_set *isl_set_universe(struct isl_dim *dim)
4262 struct isl_set *set;
4265 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4266 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4270 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4274 return isl_set_universe(isl_dim_copy(model->dim));
4277 struct isl_map *isl_map_dup(struct isl_map *map)
4280 struct isl_map *dup;
4284 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4285 for (i = 0; i < map->n; ++i)
4286 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4290 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4291 __isl_take isl_basic_map *bmap)
4295 if (isl_basic_map_fast_is_empty(bmap)) {
4296 isl_basic_map_free(bmap);
4299 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4300 isl_assert(map->ctx, map->n < map->size, goto error);
4301 map->p[map->n] = bmap;
4303 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4309 isl_basic_map_free(bmap);
4313 void isl_map_free(struct isl_map *map)
4323 isl_ctx_deref(map->ctx);
4324 for (i = 0; i < map->n; ++i)
4325 isl_basic_map_free(map->p[i]);
4326 isl_dim_free(map->dim);
4330 struct isl_map *isl_map_extend(struct isl_map *base,
4331 unsigned nparam, unsigned n_in, unsigned n_out)
4335 base = isl_map_cow(base);
4339 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4342 for (i = 0; i < base->n; ++i) {
4343 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4344 isl_dim_copy(base->dim), 0, 0, 0);
4354 struct isl_set *isl_set_extend(struct isl_set *base,
4355 unsigned nparam, unsigned dim)
4357 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4361 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4362 struct isl_basic_map *bmap, unsigned pos, int value)
4366 bmap = isl_basic_map_cow(bmap);
4367 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4368 j = isl_basic_map_alloc_equality(bmap);
4371 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4372 isl_int_set_si(bmap->eq[j][pos], -1);
4373 isl_int_set_si(bmap->eq[j][0], value);
4374 bmap = isl_basic_map_simplify(bmap);
4375 return isl_basic_map_finalize(bmap);
4377 isl_basic_map_free(bmap);
4381 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4382 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4386 bmap = isl_basic_map_cow(bmap);
4387 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4388 j = isl_basic_map_alloc_equality(bmap);
4391 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4392 isl_int_set_si(bmap->eq[j][pos], -1);
4393 isl_int_set(bmap->eq[j][0], value);
4394 bmap = isl_basic_map_simplify(bmap);
4395 return isl_basic_map_finalize(bmap);
4397 isl_basic_map_free(bmap);
4401 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4402 enum isl_dim_type type, unsigned pos, int value)
4406 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4407 return isl_basic_map_fix_pos_si(bmap,
4408 isl_basic_map_offset(bmap, type) + pos, value);
4410 isl_basic_map_free(bmap);
4414 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4415 enum isl_dim_type type, unsigned pos, isl_int value)
4419 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4420 return isl_basic_map_fix_pos(bmap,
4421 isl_basic_map_offset(bmap, type) + pos, value);
4423 isl_basic_map_free(bmap);
4427 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4428 enum isl_dim_type type, unsigned pos, int value)
4430 return (struct isl_basic_set *)
4431 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4435 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4436 enum isl_dim_type type, unsigned pos, isl_int value)
4438 return (struct isl_basic_set *)
4439 isl_basic_map_fix((struct isl_basic_map *)bset,
4443 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4444 unsigned input, int value)
4446 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4449 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4450 unsigned dim, int value)
4452 return (struct isl_basic_set *)
4453 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4454 isl_dim_set, dim, value);
4457 struct isl_map *isl_map_fix_si(struct isl_map *map,
4458 enum isl_dim_type type, unsigned pos, int value)
4462 map = isl_map_cow(map);
4466 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4467 for (i = 0; i < map->n; ++i) {
4468 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4472 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4479 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4480 enum isl_dim_type type, unsigned pos, int value)
4482 return (struct isl_set *)
4483 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4486 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4487 enum isl_dim_type type, unsigned pos, isl_int value)
4491 map = isl_map_cow(map);
4495 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4496 for (i = 0; i < map->n; ++i) {
4497 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4501 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4508 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4509 enum isl_dim_type type, unsigned pos, isl_int value)
4511 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4514 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4515 unsigned input, int value)
4517 return isl_map_fix_si(map, isl_dim_in, input, value);
4520 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4522 return (struct isl_set *)
4523 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4526 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4527 __isl_take isl_basic_map *bmap,
4528 enum isl_dim_type type, unsigned pos, int value)
4534 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4535 pos += isl_basic_map_offset(bmap, type);
4536 bmap = isl_basic_map_cow(bmap);
4537 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4538 j = isl_basic_map_alloc_inequality(bmap);
4541 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4542 isl_int_set_si(bmap->ineq[j][pos], 1);
4543 isl_int_set_si(bmap->ineq[j][0], -value);
4544 bmap = isl_basic_map_simplify(bmap);
4545 return isl_basic_map_finalize(bmap);
4547 isl_basic_map_free(bmap);
4551 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4552 unsigned dim, isl_int value)
4556 bset = isl_basic_set_cow(bset);
4557 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4558 j = isl_basic_set_alloc_inequality(bset);
4561 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4562 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4563 isl_int_neg(bset->ineq[j][0], value);
4564 bset = isl_basic_set_simplify(bset);
4565 return isl_basic_set_finalize(bset);
4567 isl_basic_set_free(bset);
4571 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4572 enum isl_dim_type type, unsigned pos, int value)
4576 map = isl_map_cow(map);
4580 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4581 for (i = 0; i < map->n; ++i) {
4582 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4587 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4594 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4595 enum isl_dim_type type, unsigned pos, int value)
4597 return (struct isl_set *)
4598 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4601 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4606 set = isl_set_cow(set);
4610 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4611 for (i = 0; i < set->n; ++i) {
4612 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4622 struct isl_map *isl_map_reverse(struct isl_map *map)
4626 map = isl_map_cow(map);
4630 map->dim = isl_dim_reverse(map->dim);
4633 for (i = 0; i < map->n; ++i) {
4634 map->p[i] = isl_basic_map_reverse(map->p[i]);
4638 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4645 static struct isl_map *isl_basic_map_partial_lexopt(
4646 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4647 struct isl_set **empty, int max)
4651 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4652 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4654 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4656 isl_basic_map_free(bmap);
4657 isl_basic_set_free(dom);
4663 struct isl_map *isl_basic_map_partial_lexmax(
4664 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4665 struct isl_set **empty)
4667 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4670 struct isl_map *isl_basic_map_partial_lexmin(
4671 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4672 struct isl_set **empty)
4674 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4677 struct isl_set *isl_basic_set_partial_lexmin(
4678 struct isl_basic_set *bset, struct isl_basic_set *dom,
4679 struct isl_set **empty)
4681 return (struct isl_set *)
4682 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4686 struct isl_set *isl_basic_set_partial_lexmax(
4687 struct isl_basic_set *bset, struct isl_basic_set *dom,
4688 struct isl_set **empty)
4690 return (struct isl_set *)
4691 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4695 /* Given a basic map "bmap", compute the lexicographically minimal
4696 * (or maximal) image element for each domain element in dom.
4697 * Set *empty to those elements in dom that do not have an image element.
4699 * We first make sure the basic sets in dom are disjoint and then
4700 * simply collect the results over each of the basic sets separately.
4701 * We could probably improve the efficiency a bit by moving the union
4702 * domain down into the parametric integer programming.
4704 static __isl_give isl_map *basic_map_partial_lexopt(
4705 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4706 __isl_give isl_set **empty, int max)
4709 struct isl_map *res;
4711 dom = isl_set_make_disjoint(dom);
4715 if (isl_set_fast_is_empty(dom)) {
4716 res = isl_map_empty_like_basic_map(bmap);
4717 *empty = isl_set_empty_like(dom);
4719 isl_basic_map_free(bmap);
4723 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4724 isl_basic_set_copy(dom->p[0]), empty, max);
4726 for (i = 1; i < dom->n; ++i) {
4727 struct isl_map *res_i;
4728 struct isl_set *empty_i;
4730 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4731 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4733 res = isl_map_union_disjoint(res, res_i);
4734 *empty = isl_set_union_disjoint(*empty, empty_i);
4738 isl_basic_map_free(bmap);
4743 isl_basic_map_free(bmap);
4747 /* Given a map "map", compute the lexicographically minimal
4748 * (or maximal) image element for each domain element in dom.
4749 * Set *empty to those elements in dom that do not have an image element.
4751 * We first compute the lexicographically minimal or maximal element
4752 * in the first basic map. This results in a partial solution "res"
4753 * and a subset "todo" of dom that still need to be handled.
4754 * We then consider each of the remaining maps in "map" and successively
4755 * improve both "res" and "todo".
4757 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4758 * Assume we are computing the lexicographical maximum.
4759 * We first compute the lexicographically maximal element in basic map i.
4760 * This results in a partial solution res_i and a subset todo_i.
4761 * Then we combine these results with those obtain for the first k basic maps
4762 * to obtain a result that is valid for the first k+1 basic maps.
4763 * In particular, the set where there is no solution is the set where
4764 * there is no solution for the first k basic maps and also no solution
4765 * for the ith basic map, i.e.,
4767 * todo^i = todo^k * todo_i
4769 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4770 * solutions, arbitrarily breaking ties in favor of res^k.
4771 * That is, when res^k(a) >= res_i(a), we pick res^k and
4772 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4773 * the lexicographic order.)
4774 * In practice, we compute
4776 * res^k * (res_i . "<=")
4780 * res_i * (res^k . "<")
4782 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4783 * where only one of res^k and res_i provides a solution and we simply pick
4790 * Note that we only compute these intersections when dom(res^k) intersects
4791 * dom(res_i). Otherwise, the only effect of these intersections is to
4792 * potentially break up res^k and res_i into smaller pieces.
4793 * We want to avoid such splintering as much as possible.
4794 * In fact, an earlier implementation of this function would look for
4795 * better results in the domain of res^k and for extra results in todo^k,
4796 * but this would always result in a splintering according to todo^k,
4797 * even when the domain of basic map i is disjoint from the domains of
4798 * the previous basic maps.
4800 static __isl_give isl_map *isl_map_partial_lexopt(
4801 __isl_take isl_map *map, __isl_take isl_set *dom,
4802 __isl_give isl_set **empty, int max)
4805 struct isl_map *res;
4806 struct isl_set *todo;
4811 if (isl_map_fast_is_empty(map)) {
4819 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4820 isl_set_copy(dom), &todo, max);
4822 for (i = 1; i < map->n; ++i) {
4826 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4828 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4829 isl_set_copy(dom), &todo_i, max);
4832 lt = isl_map_lex_lt(isl_dim_copy(dim));
4833 le = isl_map_lex_le(dim);
4835 lt = isl_map_lex_gt(isl_dim_copy(dim));
4836 le = isl_map_lex_ge(dim);
4838 lt = isl_map_apply_range(isl_map_copy(res), lt);
4839 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4840 le = isl_map_apply_range(isl_map_copy(res_i), le);
4841 le = isl_map_intersect(le, isl_map_copy(res));
4843 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4844 res = isl_map_intersect_domain(res,
4845 isl_set_copy(todo_i));
4846 res_i = isl_map_intersect_domain(res_i,
4847 isl_set_copy(todo));
4850 res = isl_map_union_disjoint(res, res_i);
4851 res = isl_map_union_disjoint(res, lt);
4852 res = isl_map_union_disjoint(res, le);
4854 todo = isl_set_intersect(todo, todo_i);
4874 __isl_give isl_map *isl_map_partial_lexmax(
4875 __isl_take isl_map *map, __isl_take isl_set *dom,
4876 __isl_give isl_set **empty)
4878 return isl_map_partial_lexopt(map, dom, empty, 1);
4881 __isl_give isl_map *isl_map_partial_lexmin(
4882 __isl_take isl_map *map, __isl_take isl_set *dom,
4883 __isl_give isl_set **empty)
4885 return isl_map_partial_lexopt(map, dom, empty, 0);
4888 __isl_give isl_set *isl_set_partial_lexmin(
4889 __isl_take isl_set *set, __isl_take isl_set *dom,
4890 __isl_give isl_set **empty)
4892 return (struct isl_set *)
4893 isl_map_partial_lexmin((struct isl_map *)set,
4897 __isl_give isl_set *isl_set_partial_lexmax(
4898 __isl_take isl_set *set, __isl_take isl_set *dom,
4899 __isl_give isl_set **empty)
4901 return (struct isl_set *)
4902 isl_map_partial_lexmax((struct isl_map *)set,
4906 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4908 struct isl_basic_set *dom = NULL;
4909 struct isl_dim *dom_dim;
4913 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4914 dom = isl_basic_set_universe(dom_dim);
4915 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4917 isl_basic_map_free(bmap);
4921 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4923 return isl_basic_map_lexopt(bmap, 0);
4926 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4928 return isl_basic_map_lexopt(bmap, 1);
4931 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4933 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4936 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4938 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
4941 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
4943 struct isl_set *dom = NULL;
4944 struct isl_dim *dom_dim;
4948 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
4949 dom = isl_set_universe(dom_dim);
4950 return isl_map_partial_lexopt(map, dom, NULL, max);
4956 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
4958 return isl_map_lexopt(map, 0);
4961 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
4963 return isl_map_lexopt(map, 1);
4966 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
4968 return (isl_set *)isl_map_lexmin((isl_map *)set);
4971 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
4973 return (isl_set *)isl_map_lexmax((isl_map *)set);
4976 /* Apply a preimage specified by "mat" on the parameters of "bset".
4977 * bset is assumed to have only parameters and divs.
4979 static struct isl_basic_set *basic_set_parameter_preimage(
4980 struct isl_basic_set *bset, struct isl_mat *mat)
4987 bset->dim = isl_dim_cow(bset->dim);
4991 nparam = isl_basic_set_dim(bset, isl_dim_param);
4993 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
4995 bset->dim->nparam = 0;
4996 bset->dim->n_out = nparam;
4997 bset = isl_basic_set_preimage(bset, mat);
4999 bset->dim->nparam = bset->dim->n_out;
5000 bset->dim->n_out = 0;
5005 isl_basic_set_free(bset);
5009 /* Apply a preimage specified by "mat" on the parameters of "set".
5010 * set is assumed to have only parameters and divs.
5012 static struct isl_set *set_parameter_preimage(
5013 struct isl_set *set, struct isl_mat *mat)
5015 struct isl_dim *dim = NULL;
5021 dim = isl_dim_copy(set->dim);
5022 dim = isl_dim_cow(dim);
5026 nparam = isl_set_dim(set, isl_dim_param);
5028 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5031 dim->n_out = nparam;
5032 isl_set_reset_dim(set, dim);
5033 set = isl_set_preimage(set, mat);
5036 dim = isl_dim_copy(set->dim);
5037 dim = isl_dim_cow(dim);
5040 dim->nparam = dim->n_out;
5042 isl_set_reset_dim(set, dim);
5052 /* Intersect the basic set "bset" with the affine space specified by the
5053 * equalities in "eq".
5055 static struct isl_basic_set *basic_set_append_equalities(
5056 struct isl_basic_set *bset, struct isl_mat *eq)
5064 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5069 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5070 for (i = 0; i < eq->n_row; ++i) {
5071 k = isl_basic_set_alloc_equality(bset);
5074 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5075 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5079 bset = isl_basic_set_gauss(bset, NULL);
5080 bset = isl_basic_set_finalize(bset);
5085 isl_basic_set_free(bset);
5089 /* Intersect the set "set" with the affine space specified by the
5090 * equalities in "eq".
5092 static struct isl_set *set_append_equalities(struct isl_set *set,
5100 for (i = 0; i < set->n; ++i) {
5101 set->p[i] = basic_set_append_equalities(set->p[i],
5114 /* Project the given basic set onto its parameter domain, possibly introducing
5115 * new, explicit, existential variables in the constraints.
5116 * The input has parameters and (possibly implicit) existential variables.
5117 * The output has the same parameters, but only
5118 * explicit existentially quantified variables.
5120 * The actual projection is performed by pip, but pip doesn't seem
5121 * to like equalities very much, so we first remove the equalities
5122 * among the parameters by performing a variable compression on
5123 * the parameters. Afterward, an inverse transformation is performed
5124 * and the equalities among the parameters are inserted back in.
5126 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5130 struct isl_mat *T, *T2;
5131 struct isl_set *set;
5132 unsigned nparam, n_div;
5134 bset = isl_basic_set_cow(bset);
5138 if (bset->n_eq == 0)
5139 return isl_basic_set_lexmin(bset);
5141 isl_basic_set_gauss(bset, NULL);
5143 nparam = isl_basic_set_dim(bset, isl_dim_param);
5144 n_div = isl_basic_set_dim(bset, isl_dim_div);
5146 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5147 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5150 if (i == bset->n_eq)
5151 return isl_basic_set_lexmin(bset);
5153 eq = isl_mat_sub_alloc(bset->ctx, bset->eq, i, bset->n_eq - i,
5155 eq = isl_mat_cow(eq);
5156 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5157 if (T && T->n_col == 0) {
5161 bset = isl_basic_set_set_to_empty(bset);
5162 return isl_set_from_basic_set(bset);
5164 bset = basic_set_parameter_preimage(bset, T);
5166 set = isl_basic_set_lexmin(bset);
5167 set = set_parameter_preimage(set, T2);
5168 set = set_append_equalities(set, eq);
5172 /* Compute an explicit representation for all the existentially
5173 * quantified variables.
5174 * The input and output dimensions are first turned into parameters.
5175 * compute_divs then returns a map with the same parameters and
5176 * no input or output dimensions and the dimension specification
5177 * is reset to that of the input.
5179 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5181 struct isl_basic_set *bset;
5182 struct isl_set *set;
5183 struct isl_map *map;
5184 struct isl_dim *dim, *orig_dim = NULL;
5189 bmap = isl_basic_map_cow(bmap);
5193 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5194 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5195 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5196 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5200 orig_dim = bmap->dim;
5202 bset = (struct isl_basic_set *)bmap;
5204 set = parameter_compute_divs(bset);
5205 map = (struct isl_map *)set;
5206 map = isl_map_reset_dim(map, orig_dim);
5210 isl_basic_map_free(bmap);
5214 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5222 off = isl_dim_total(bmap->dim);
5223 for (i = 0; i < bmap->n_div; ++i) {
5224 if (isl_int_is_zero(bmap->div[i][0]))
5226 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5232 static int map_divs_known(__isl_keep isl_map *map)
5239 for (i = 0; i < map->n; ++i) {
5240 int known = basic_map_divs_known(map->p[i]);
5248 /* If bmap contains any unknown divs, then compute explicit
5249 * expressions for them. However, this computation may be
5250 * quite expensive, so first try to remove divs that aren't
5253 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5257 struct isl_map *map;
5259 known = basic_map_divs_known(bmap);
5263 return isl_map_from_basic_map(bmap);
5265 bmap = isl_basic_map_drop_redundant_divs(bmap);
5267 known = basic_map_divs_known(bmap);
5271 return isl_map_from_basic_map(bmap);
5273 map = compute_divs(bmap);
5276 isl_basic_map_free(bmap);
5280 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5284 struct isl_map *res;
5291 known = map_divs_known(map);
5299 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5300 for (i = 1 ; i < map->n; ++i) {
5302 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5303 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5304 res = isl_map_union_disjoint(res, r2);
5306 res = isl_map_union(res, r2);
5313 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5315 return (struct isl_set *)
5316 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5319 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5321 return (struct isl_set *)
5322 isl_map_compute_divs((struct isl_map *)set);
5325 struct isl_set *isl_map_domain(struct isl_map *map)
5328 struct isl_set *set;
5333 map = isl_map_cow(map);
5337 set = (struct isl_set *)map;
5338 set->dim = isl_dim_domain(set->dim);
5341 for (i = 0; i < map->n; ++i) {
5342 set->p[i] = isl_basic_map_domain(map->p[i]);
5346 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5347 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5354 struct isl_map *isl_map_union_disjoint(
5355 struct isl_map *map1, struct isl_map *map2)
5359 struct isl_map *map = NULL;
5373 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5375 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5376 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5377 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5379 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5380 map1->n + map2->n, flags);
5383 for (i = 0; i < map1->n; ++i) {
5384 map = isl_map_add_basic_map(map,
5385 isl_basic_map_copy(map1->p[i]));
5389 for (i = 0; i < map2->n; ++i) {
5390 map = isl_map_add_basic_map(map,
5391 isl_basic_map_copy(map2->p[i]));
5405 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5407 map1 = isl_map_union_disjoint(map1, map2);
5411 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5415 struct isl_set *isl_set_union_disjoint(
5416 struct isl_set *set1, struct isl_set *set2)
5418 return (struct isl_set *)
5419 isl_map_union_disjoint(
5420 (struct isl_map *)set1, (struct isl_map *)set2);
5423 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5425 return (struct isl_set *)
5426 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5429 struct isl_map *isl_map_intersect_range(
5430 struct isl_map *map, struct isl_set *set)
5433 struct isl_map *result;
5439 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5440 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5441 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5443 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5444 map->n * set->n, flags);
5447 for (i = 0; i < map->n; ++i)
5448 for (j = 0; j < set->n; ++j) {
5449 result = isl_map_add_basic_map(result,
5450 isl_basic_map_intersect_range(
5451 isl_basic_map_copy(map->p[i]),
5452 isl_basic_set_copy(set->p[j])));
5465 struct isl_map *isl_map_intersect_domain(
5466 struct isl_map *map, struct isl_set *set)
5468 return isl_map_reverse(
5469 isl_map_intersect_range(isl_map_reverse(map), set));
5472 struct isl_map *isl_map_apply_domain(
5473 struct isl_map *map1, struct isl_map *map2)
5477 map1 = isl_map_reverse(map1);
5478 map1 = isl_map_apply_range(map1, map2);
5479 return isl_map_reverse(map1);
5486 struct isl_map *isl_map_apply_range(
5487 struct isl_map *map1, struct isl_map *map2)
5489 struct isl_dim *dim_result;
5490 struct isl_map *result;
5496 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5497 isl_dim_copy(map2->dim));
5499 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5502 for (i = 0; i < map1->n; ++i)
5503 for (j = 0; j < map2->n; ++j) {
5504 result = isl_map_add_basic_map(result,
5505 isl_basic_map_apply_range(
5506 isl_basic_map_copy(map1->p[i]),
5507 isl_basic_map_copy(map2->p[j])));
5513 if (result && result->n <= 1)
5514 ISL_F_SET(result, ISL_MAP_DISJOINT);
5523 * returns range - domain
5525 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5527 isl_dim *dims, *target_dim;
5528 struct isl_basic_set *bset;
5535 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5536 bmap->dim, isl_dim_out),
5538 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5539 dim = isl_basic_map_n_in(bmap);
5540 nparam = isl_basic_map_n_param(bmap);
5541 bset = isl_basic_set_from_basic_map(bmap);
5542 bset = isl_basic_set_cow(bset);
5543 dims = isl_basic_set_get_dim(bset);
5544 dims = isl_dim_add(dims, isl_dim_set, dim);
5545 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5546 bset = isl_basic_set_swap_vars(bset, 2*dim);
5547 for (i = 0; i < dim; ++i) {
5548 int j = isl_basic_map_alloc_equality(
5549 (struct isl_basic_map *)bset);
5552 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5553 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5554 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5555 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5557 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5558 bset = isl_basic_set_reset_dim(bset, target_dim);
5561 isl_basic_map_free(bmap);
5566 * returns range - domain
5568 struct isl_set *isl_map_deltas(struct isl_map *map)
5572 struct isl_set *result;
5577 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5578 map->dim, isl_dim_out),
5580 dim = isl_map_get_dim(map);
5581 dim = isl_dim_domain(dim);
5582 result = isl_set_alloc_dim(dim, map->n, map->flags);
5585 for (i = 0; i < map->n; ++i)
5586 result = isl_set_add_basic_set(result,
5587 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5595 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5597 struct isl_basic_map *bmap;
5605 nparam = dims->nparam;
5607 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5611 for (i = 0; i < dim; ++i) {
5612 int j = isl_basic_map_alloc_equality(bmap);
5615 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5616 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5617 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5619 return isl_basic_map_finalize(bmap);
5621 isl_basic_map_free(bmap);
5625 struct isl_basic_map *isl_basic_map_identity(struct isl_dim *set_dim)
5627 struct isl_dim *dim = isl_dim_map(set_dim);
5630 return basic_map_identity(dim);
5633 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5635 if (!model || !model->dim)
5637 isl_assert(model->ctx,
5638 model->dim->n_in == model->dim->n_out, return NULL);
5639 return basic_map_identity(isl_dim_copy(model->dim));
5642 static struct isl_map *map_identity(struct isl_dim *dim)
5644 struct isl_map *map = isl_map_alloc_dim(dim, 1, ISL_MAP_DISJOINT);
5645 return isl_map_add_basic_map(map, basic_map_identity(isl_dim_copy(dim)));
5648 struct isl_map *isl_map_identity(struct isl_dim *set_dim)
5650 struct isl_dim *dim = isl_dim_map(set_dim);
5653 return map_identity(dim);
5656 struct isl_map *isl_map_identity_like(struct isl_map *model)
5658 if (!model || !model->dim)
5660 isl_assert(model->ctx,
5661 model->dim->n_in == model->dim->n_out, return NULL);
5662 return map_identity(isl_dim_copy(model->dim));
5665 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5667 if (!model || !model->dim)
5669 isl_assert(model->ctx,
5670 model->dim->n_in == model->dim->n_out, return NULL);
5671 return map_identity(isl_dim_copy(model->dim));
5674 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5676 isl_dim *dim = isl_set_get_dim(set);
5678 id = isl_map_identity(dim);
5679 return isl_map_intersect_range(id, set);
5682 /* Construct a basic set with all set dimensions having only non-negative
5685 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5690 struct isl_basic_set *bset;
5694 nparam = dims->nparam;
5696 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5699 for (i = 0; i < dim; ++i) {
5700 int k = isl_basic_set_alloc_inequality(bset);
5703 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5704 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5708 isl_basic_set_free(bset);
5712 /* Construct the half-space x_pos >= 0.
5714 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5718 isl_basic_set *nonneg;
5720 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5721 k = isl_basic_set_alloc_inequality(nonneg);
5724 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5725 isl_int_set_si(nonneg->ineq[k][pos], 1);
5727 return isl_basic_set_finalize(nonneg);
5729 isl_basic_set_free(nonneg);
5733 /* Construct the half-space x_pos <= -1.
5735 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
5740 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5741 k = isl_basic_set_alloc_inequality(neg);
5744 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5745 isl_int_set_si(neg->ineq[k][0], -1);
5746 isl_int_set_si(neg->ineq[k][pos], -1);
5748 return isl_basic_set_finalize(neg);
5750 isl_basic_set_free(neg);
5754 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5755 enum isl_dim_type type, unsigned first, unsigned n)
5758 isl_basic_set *nonneg;
5766 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5768 for (i = 0; i < n; ++i) {
5769 nonneg = nonneg_halfspace(isl_set_get_dim(set),
5770 pos(set->dim, type) + first + i);
5771 neg = neg_halfspace(isl_set_get_dim(set),
5772 pos(set->dim, type) + first + i);
5774 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5783 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
5784 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5791 if (isl_set_fast_is_empty(set)) {
5796 return fn(set, signs, user);
5799 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
5801 half = isl_set_intersect(half, isl_set_copy(set));
5802 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
5806 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
5808 half = isl_set_intersect(half, set);
5809 return foreach_orthant(half, signs, first + 1, len, fn, user);
5815 /* Call "fn" on the intersections of "set" with each of the orthants
5816 * (except for obviously empty intersections). The orthant is identified
5817 * by the signs array, with each entry having value 1 or -1 according
5818 * to the sign of the corresponding variable.
5820 int isl_set_foreach_orthant(__isl_keep isl_set *set,
5821 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5831 if (isl_set_fast_is_empty(set))
5834 nparam = isl_set_dim(set, isl_dim_param);
5835 nvar = isl_set_dim(set, isl_dim_set);
5837 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
5839 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
5847 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5849 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5852 int isl_basic_map_is_subset(
5853 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5856 struct isl_map *map1;
5857 struct isl_map *map2;
5859 if (!bmap1 || !bmap2)
5862 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
5863 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
5865 is_subset = isl_map_is_subset(map1, map2);
5873 int isl_basic_map_is_equal(
5874 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5878 if (!bmap1 || !bmap2)
5880 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5883 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5887 int isl_basic_set_is_equal(
5888 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
5890 return isl_basic_map_is_equal(
5891 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
5894 int isl_map_is_empty(struct isl_map *map)
5901 for (i = 0; i < map->n; ++i) {
5902 is_empty = isl_basic_map_is_empty(map->p[i]);
5911 int isl_map_fast_is_empty(struct isl_map *map)
5913 return map ? map->n == 0 : -1;
5916 int isl_set_fast_is_empty(struct isl_set *set)
5918 return set ? set->n == 0 : -1;
5921 int isl_set_is_empty(struct isl_set *set)
5923 return isl_map_is_empty((struct isl_map *)set);
5926 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
5931 return isl_dim_equal(map1->dim, map2->dim);
5934 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5939 return isl_dim_equal(set1->dim, set2->dim);
5942 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
5948 is_subset = isl_map_is_subset(map1, map2);
5951 is_subset = isl_map_is_subset(map2, map1);
5955 int isl_basic_map_is_strict_subset(
5956 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
5960 if (!bmap1 || !bmap2)
5962 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
5965 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
5966 if (is_subset == -1)
5971 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
5977 is_subset = isl_map_is_subset(map1, map2);
5980 is_subset = isl_map_is_subset(map2, map1);
5981 if (is_subset == -1)
5986 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
5988 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
5991 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
5995 return bmap->n_eq == 0 && bmap->n_ineq == 0;
5998 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6002 return bset->n_eq == 0 && bset->n_ineq == 0;
6005 int isl_map_fast_is_universe(__isl_keep isl_map *map)
6012 for (i = 0; i < map->n; ++i) {
6013 int r = isl_basic_map_is_universe(map->p[i]);
6021 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6023 return isl_map_fast_is_universe((isl_map *) set);
6026 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6028 struct isl_basic_set *bset = NULL;
6029 struct isl_vec *sample = NULL;
6036 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6039 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6040 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6041 copy = isl_basic_map_remove_redundancies(copy);
6042 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6043 isl_basic_map_free(copy);
6047 total = 1 + isl_basic_map_total_dim(bmap);
6048 if (bmap->sample && bmap->sample->size == total) {
6049 int contains = isl_basic_map_contains(bmap, bmap->sample);
6055 isl_vec_free(bmap->sample);
6056 bmap->sample = NULL;
6057 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6060 sample = isl_basic_set_sample_vec(bset);
6063 empty = sample->size == 0;
6064 isl_vec_free(bmap->sample);
6065 bmap->sample = sample;
6067 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6072 int isl_basic_map_fast_is_empty(struct isl_basic_map *bmap)
6076 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6079 int isl_basic_set_fast_is_empty(struct isl_basic_set *bset)
6083 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6086 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6088 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6091 struct isl_map *isl_basic_map_union(
6092 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6094 struct isl_map *map;
6095 if (!bmap1 || !bmap2)
6098 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6100 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6103 map = isl_map_add_basic_map(map, bmap1);
6104 map = isl_map_add_basic_map(map, bmap2);
6107 isl_basic_map_free(bmap1);
6108 isl_basic_map_free(bmap2);
6112 struct isl_set *isl_basic_set_union(
6113 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6115 return (struct isl_set *)isl_basic_map_union(
6116 (struct isl_basic_map *)bset1,
6117 (struct isl_basic_map *)bset2);
6120 /* Order divs such that any div only depends on previous divs */
6121 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6129 off = isl_dim_total(bmap->dim);
6131 for (i = 0; i < bmap->n_div; ++i) {
6133 if (isl_int_is_zero(bmap->div[i][0]))
6135 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6139 isl_basic_map_swap_div(bmap, i, i + pos);
6145 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6147 return (struct isl_basic_set *)
6148 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6151 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6158 for (i = 0; i < map->n; ++i) {
6159 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6170 /* Look for a div in dst that corresponds to the div "div" in src.
6171 * The divs before "div" in src and dst are assumed to be the same.
6173 * Returns -1 if no corresponding div was found and the position
6174 * of the corresponding div in dst otherwise.
6176 static int find_div(struct isl_basic_map *dst,
6177 struct isl_basic_map *src, unsigned div)
6181 unsigned total = isl_dim_total(src->dim);
6183 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6184 for (i = div; i < dst->n_div; ++i)
6185 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6186 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6187 dst->n_div - div) == -1)
6192 struct isl_basic_map *isl_basic_map_align_divs(
6193 struct isl_basic_map *dst, struct isl_basic_map *src)
6196 unsigned total = isl_dim_total(src->dim);
6201 if (src->n_div == 0)
6204 for (i = 0; i < src->n_div; ++i)
6205 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6207 src = isl_basic_map_order_divs(src);
6208 dst = isl_basic_map_cow(dst);
6209 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6210 src->n_div, 0, 2 * src->n_div);
6213 for (i = 0; i < src->n_div; ++i) {
6214 int j = find_div(dst, src, i);
6216 j = isl_basic_map_alloc_div(dst);
6219 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6220 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6221 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6225 isl_basic_map_swap_div(dst, i, j);
6229 isl_basic_map_free(dst);
6233 struct isl_basic_set *isl_basic_set_align_divs(
6234 struct isl_basic_set *dst, struct isl_basic_set *src)
6236 return (struct isl_basic_set *)isl_basic_map_align_divs(
6237 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6240 struct isl_map *isl_map_align_divs(struct isl_map *map)
6248 map = isl_map_compute_divs(map);
6249 map = isl_map_cow(map);
6253 for (i = 1; i < map->n; ++i)
6254 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6255 for (i = 1; i < map->n; ++i)
6256 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6258 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6262 struct isl_set *isl_set_align_divs(struct isl_set *set)
6264 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6267 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6271 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6272 map = isl_map_intersect_domain(map, set);
6273 set = isl_map_range(map);
6281 /* There is no need to cow as removing empty parts doesn't change
6282 * the meaning of the set.
6284 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6291 for (i = map->n-1; i >= 0; --i) {
6292 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6294 isl_basic_map_free(map->p[i]);
6295 if (i != map->n-1) {
6296 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6297 map->p[i] = map->p[map->n-1];
6305 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6307 return (struct isl_set *)
6308 isl_map_remove_empty_parts((struct isl_map *)set);
6311 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6313 struct isl_basic_map *bmap;
6314 if (!map || map->n == 0)
6316 bmap = map->p[map->n-1];
6317 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6318 return isl_basic_map_copy(bmap);
6321 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6323 return (struct isl_basic_set *)
6324 isl_map_copy_basic_map((struct isl_map *)set);
6327 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6328 __isl_keep isl_basic_map *bmap)
6334 for (i = map->n-1; i >= 0; --i) {
6335 if (map->p[i] != bmap)
6337 map = isl_map_cow(map);
6340 isl_basic_map_free(map->p[i]);
6341 if (i != map->n-1) {
6342 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6343 map->p[i] = map->p[map->n-1];
6354 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6355 struct isl_basic_set *bset)
6357 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6358 (struct isl_basic_map *)bset);
6361 /* Given two basic sets bset1 and bset2, compute the maximal difference
6362 * between the values of dimension pos in bset1 and those in bset2
6363 * for any common value of the parameters and dimensions preceding pos.
6365 static enum isl_lp_result basic_set_maximal_difference_at(
6366 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6367 int pos, isl_int *opt)
6369 struct isl_dim *dims;
6370 struct isl_basic_map *bmap1 = NULL;
6371 struct isl_basic_map *bmap2 = NULL;
6372 struct isl_ctx *ctx;
6373 struct isl_vec *obj;
6376 unsigned dim1, dim2;
6377 enum isl_lp_result res;
6379 if (!bset1 || !bset2)
6380 return isl_lp_error;
6382 nparam = isl_basic_set_n_param(bset1);
6383 dim1 = isl_basic_set_n_dim(bset1);
6384 dim2 = isl_basic_set_n_dim(bset2);
6385 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6386 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6387 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6388 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6389 if (!bmap1 || !bmap2)
6391 bmap1 = isl_basic_map_cow(bmap1);
6392 bmap1 = isl_basic_map_extend(bmap1, nparam,
6393 pos, (dim1 - pos) + (dim2 - pos),
6394 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6395 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6398 total = isl_basic_map_total_dim(bmap1);
6400 obj = isl_vec_alloc(ctx, 1 + total);
6401 isl_seq_clr(obj->block.data, 1 + total);
6402 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6403 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6406 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6408 isl_basic_map_free(bmap1);
6412 isl_basic_map_free(bmap1);
6413 isl_basic_map_free(bmap2);
6414 return isl_lp_error;
6417 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6418 * for any common value of the parameters and dimensions preceding pos
6419 * in both basic sets, the values of dimension pos in bset1 are
6420 * smaller or larger than those in bset2.
6423 * 1 if bset1 follows bset2
6424 * -1 if bset1 precedes bset2
6425 * 0 if bset1 and bset2 are incomparable
6426 * -2 if some error occurred.
6428 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6429 struct isl_basic_set *bset2, int pos)
6432 enum isl_lp_result res;
6437 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6439 if (res == isl_lp_empty)
6441 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6442 res == isl_lp_unbounded)
6444 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6453 /* Given two basic sets bset1 and bset2, check whether
6454 * for any common value of the parameters and dimensions preceding pos
6455 * there is a value of dimension pos in bset1 that is larger
6456 * than a value of the same dimension in bset2.
6459 * 1 if there exists such a pair
6460 * 0 if there is no such pair, but there is a pair of equal values
6462 * -2 if some error occurred.
6464 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6465 __isl_keep isl_basic_set *bset2, int pos)
6468 enum isl_lp_result res;
6473 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6475 if (res == isl_lp_empty)
6477 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6478 res == isl_lp_unbounded)
6480 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6482 else if (res == isl_lp_ok)
6491 /* Given two sets set1 and set2, check whether
6492 * for any common value of the parameters and dimensions preceding pos
6493 * there is a value of dimension pos in set1 that is larger
6494 * than a value of the same dimension in set2.
6497 * 1 if there exists such a pair
6498 * 0 if there is no such pair, but there is a pair of equal values
6500 * -2 if some error occurred.
6502 int isl_set_follows_at(__isl_keep isl_set *set1,
6503 __isl_keep isl_set *set2, int pos)
6511 for (i = 0; i < set1->n; ++i)
6512 for (j = 0; j < set2->n; ++j) {
6514 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6515 if (f == 1 || f == -2)
6524 static int isl_basic_map_fast_has_fixed_var(struct isl_basic_map *bmap,
6525 unsigned pos, isl_int *val)
6533 total = isl_basic_map_total_dim(bmap);
6534 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6535 for (; d+1 > pos; --d)
6536 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6540 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6542 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6544 if (!isl_int_is_one(bmap->eq[i][1+d]))
6547 isl_int_neg(*val, bmap->eq[i][0]);
6553 static int isl_map_fast_has_fixed_var(struct isl_map *map,
6554 unsigned pos, isl_int *val)
6566 return isl_basic_map_fast_has_fixed_var(map->p[0], pos, val);
6569 fixed = isl_basic_map_fast_has_fixed_var(map->p[0], pos, &v);
6570 for (i = 1; fixed == 1 && i < map->n; ++i) {
6571 fixed = isl_basic_map_fast_has_fixed_var(map->p[i], pos, &tmp);
6572 if (fixed == 1 && isl_int_ne(tmp, v))
6576 isl_int_set(*val, v);
6582 static int isl_basic_set_fast_has_fixed_var(struct isl_basic_set *bset,
6583 unsigned pos, isl_int *val)
6585 return isl_basic_map_fast_has_fixed_var((struct isl_basic_map *)bset,
6589 static int isl_set_fast_has_fixed_var(struct isl_set *set, unsigned pos,
6592 return isl_map_fast_has_fixed_var((struct isl_map *)set, pos, val);
6595 int isl_basic_map_fast_is_fixed(struct isl_basic_map *bmap,
6596 enum isl_dim_type type, unsigned pos, isl_int *val)
6598 if (pos >= isl_basic_map_dim(bmap, type))
6600 return isl_basic_map_fast_has_fixed_var(bmap,
6601 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6604 int isl_map_fast_is_fixed(struct isl_map *map,
6605 enum isl_dim_type type, unsigned pos, isl_int *val)
6607 if (pos >= isl_map_dim(map, type))
6609 return isl_map_fast_has_fixed_var(map,
6610 map_offset(map, type) - 1 + pos, val);
6613 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6614 * then return this fixed value in *val.
6616 int isl_basic_set_fast_dim_is_fixed(struct isl_basic_set *bset, unsigned dim,
6619 return isl_basic_set_fast_has_fixed_var(bset,
6620 isl_basic_set_n_param(bset) + dim, val);
6623 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6624 * then return this fixed value in *val.
6626 int isl_set_fast_dim_is_fixed(struct isl_set *set, unsigned dim, isl_int *val)
6628 return isl_set_fast_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6631 /* Check if input variable in has fixed value and if so and if val is not NULL,
6632 * then return this fixed value in *val.
6634 int isl_map_fast_input_is_fixed(struct isl_map *map, unsigned in, isl_int *val)
6636 return isl_map_fast_has_fixed_var(map, isl_map_n_param(map) + in, val);
6639 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6640 * and if val is not NULL, then return this lower bound in *val.
6642 int isl_basic_set_fast_dim_has_fixed_lower_bound(struct isl_basic_set *bset,
6643 unsigned dim, isl_int *val)
6645 int i, i_eq = -1, i_ineq = -1;
6652 total = isl_basic_set_total_dim(bset);
6653 nparam = isl_basic_set_n_param(bset);
6654 for (i = 0; i < bset->n_eq; ++i) {
6655 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6661 for (i = 0; i < bset->n_ineq; ++i) {
6662 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6664 if (i_eq != -1 || i_ineq != -1)
6668 if (i_eq == -1 && i_ineq == -1)
6670 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6671 /* The coefficient should always be one due to normalization. */
6672 if (!isl_int_is_one(c[1+nparam+dim]))
6674 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6676 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6677 total - nparam - dim - 1) != -1)
6680 isl_int_neg(*val, c[0]);
6684 int isl_set_fast_dim_has_fixed_lower_bound(struct isl_set *set,
6685 unsigned dim, isl_int *val)
6697 return isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6701 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[0],
6703 for (i = 1; fixed == 1 && i < set->n; ++i) {
6704 fixed = isl_basic_set_fast_dim_has_fixed_lower_bound(set->p[i],
6706 if (fixed == 1 && isl_int_ne(tmp, v))
6710 isl_int_set(*val, v);
6721 static int qsort_constraint_cmp(const void *p1, const void *p2)
6723 const struct constraint *c1 = (const struct constraint *)p1;
6724 const struct constraint *c2 = (const struct constraint *)p2;
6725 unsigned size = isl_min(c1->size, c2->size);
6726 return isl_seq_cmp(c1->c, c2->c, size);
6729 static struct isl_basic_map *isl_basic_map_sort_constraints(
6730 struct isl_basic_map *bmap)
6733 struct constraint *c;
6738 total = isl_basic_map_total_dim(bmap);
6739 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6742 for (i = 0; i < bmap->n_ineq; ++i) {
6744 c[i].c = bmap->ineq[i];
6746 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6747 for (i = 0; i < bmap->n_ineq; ++i)
6748 bmap->ineq[i] = c[i].c;
6752 isl_basic_map_free(bmap);
6756 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
6757 __isl_take isl_basic_set *bset)
6759 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
6760 (struct isl_basic_map *)bset);
6763 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
6767 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
6769 bmap = isl_basic_map_remove_redundancies(bmap);
6770 bmap = isl_basic_map_sort_constraints(bmap);
6771 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
6775 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
6777 return (struct isl_basic_set *)isl_basic_map_normalize(
6778 (struct isl_basic_map *)bset);
6781 int isl_basic_map_fast_cmp(const __isl_keep isl_basic_map *bmap1,
6782 const __isl_keep isl_basic_map *bmap2)
6789 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
6790 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
6791 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
6792 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
6793 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
6794 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
6795 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6796 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
6797 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
6798 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
6799 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6801 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
6803 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
6805 if (bmap1->n_eq != bmap2->n_eq)
6806 return bmap1->n_eq - bmap2->n_eq;
6807 if (bmap1->n_ineq != bmap2->n_ineq)
6808 return bmap1->n_ineq - bmap2->n_ineq;
6809 if (bmap1->n_div != bmap2->n_div)
6810 return bmap1->n_div - bmap2->n_div;
6811 total = isl_basic_map_total_dim(bmap1);
6812 for (i = 0; i < bmap1->n_eq; ++i) {
6813 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
6817 for (i = 0; i < bmap1->n_ineq; ++i) {
6818 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
6822 for (i = 0; i < bmap1->n_div; ++i) {
6823 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
6830 int isl_basic_map_fast_is_equal(__isl_keep isl_basic_map *bmap1,
6831 __isl_keep isl_basic_map *bmap2)
6833 return isl_basic_map_fast_cmp(bmap1, bmap2) == 0;
6836 int isl_basic_set_fast_is_equal(__isl_keep isl_basic_set *bset1,
6837 __isl_keep isl_basic_set *bset2)
6839 return isl_basic_map_fast_is_equal((isl_basic_map *)bset1,
6840 (isl_basic_map *)bset2);
6843 static int qsort_bmap_cmp(const void *p1, const void *p2)
6845 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
6846 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
6848 return isl_basic_map_fast_cmp(bmap1, bmap2);
6851 /* We normalize in place, but if anything goes wrong we need
6852 * to return NULL, so we need to make sure we don't change the
6853 * meaning of any possible other copies of map.
6855 struct isl_map *isl_map_normalize(struct isl_map *map)
6858 struct isl_basic_map *bmap;
6862 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
6864 for (i = 0; i < map->n; ++i) {
6865 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
6868 isl_basic_map_free(map->p[i]);
6871 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
6872 ISL_F_SET(map, ISL_MAP_NORMALIZED);
6873 map = isl_map_remove_empty_parts(map);
6876 for (i = map->n - 1; i >= 1; --i) {
6877 if (!isl_basic_map_fast_is_equal(map->p[i-1], map->p[i]))
6879 isl_basic_map_free(map->p[i-1]);
6880 for (j = i; j < map->n; ++j)
6881 map->p[j-1] = map->p[j];
6891 struct isl_set *isl_set_normalize(struct isl_set *set)
6893 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
6896 int isl_map_fast_is_equal(struct isl_map *map1, struct isl_map *map2)
6906 if (!isl_dim_equal(map1->dim, map2->dim))
6909 map1 = isl_map_copy(map1);
6910 map2 = isl_map_copy(map2);
6911 map1 = isl_map_normalize(map1);
6912 map2 = isl_map_normalize(map2);
6915 equal = map1->n == map2->n;
6916 for (i = 0; equal && i < map1->n; ++i) {
6917 equal = isl_basic_map_fast_is_equal(map1->p[i], map2->p[i]);
6930 int isl_set_fast_is_equal(struct isl_set *set1, struct isl_set *set2)
6932 return isl_map_fast_is_equal((struct isl_map *)set1,
6933 (struct isl_map *)set2);
6936 /* Return an interval that ranges from min to max (inclusive)
6938 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
6939 isl_int min, isl_int max)
6942 struct isl_basic_set *bset = NULL;
6944 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
6948 k = isl_basic_set_alloc_inequality(bset);
6951 isl_int_set_si(bset->ineq[k][1], 1);
6952 isl_int_neg(bset->ineq[k][0], min);
6954 k = isl_basic_set_alloc_inequality(bset);
6957 isl_int_set_si(bset->ineq[k][1], -1);
6958 isl_int_set(bset->ineq[k][0], max);
6962 isl_basic_set_free(bset);
6966 /* Return the Cartesian product of the basic sets in list (in the given order).
6968 __isl_give isl_basic_set *isl_basic_set_list_product(
6969 __isl_take struct isl_basic_set_list *list)
6977 struct isl_basic_set *product = NULL;
6981 isl_assert(list->ctx, list->n > 0, goto error);
6982 isl_assert(list->ctx, list->p[0], goto error);
6983 nparam = isl_basic_set_n_param(list->p[0]);
6984 dim = isl_basic_set_n_dim(list->p[0]);
6985 extra = list->p[0]->n_div;
6986 n_eq = list->p[0]->n_eq;
6987 n_ineq = list->p[0]->n_ineq;
6988 for (i = 1; i < list->n; ++i) {
6989 isl_assert(list->ctx, list->p[i], goto error);
6990 isl_assert(list->ctx,
6991 nparam == isl_basic_set_n_param(list->p[i]), goto error);
6992 dim += isl_basic_set_n_dim(list->p[i]);
6993 extra += list->p[i]->n_div;
6994 n_eq += list->p[i]->n_eq;
6995 n_ineq += list->p[i]->n_ineq;
6997 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7002 for (i = 0; i < list->n; ++i) {
7003 isl_basic_set_add_constraints(product,
7004 isl_basic_set_copy(list->p[i]), dim);
7005 dim += isl_basic_set_n_dim(list->p[i]);
7007 isl_basic_set_list_free(list);
7010 isl_basic_set_free(product);
7011 isl_basic_set_list_free(list);
7015 struct isl_basic_map *isl_basic_map_product(
7016 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7018 struct isl_dim *dim_result = NULL;
7019 struct isl_basic_map *bmap;
7020 unsigned in1, in2, out1, out2, nparam, total, pos;
7021 struct isl_dim_map *dim_map1, *dim_map2;
7023 if (!bmap1 || !bmap2)
7026 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7027 bmap2->dim, isl_dim_param), goto error);
7028 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7029 isl_dim_copy(bmap2->dim));
7031 in1 = isl_basic_map_n_in(bmap1);
7032 in2 = isl_basic_map_n_in(bmap2);
7033 out1 = isl_basic_map_n_out(bmap1);
7034 out2 = isl_basic_map_n_out(bmap2);
7035 nparam = isl_basic_map_n_param(bmap1);
7037 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7038 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7039 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7040 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7041 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7042 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7043 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7044 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7045 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7046 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7047 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7049 bmap = isl_basic_map_alloc_dim(dim_result,
7050 bmap1->n_div + bmap2->n_div,
7051 bmap1->n_eq + bmap2->n_eq,
7052 bmap1->n_ineq + bmap2->n_ineq);
7053 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
7054 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
7055 bmap = isl_basic_map_simplify(bmap);
7056 return isl_basic_map_finalize(bmap);
7058 isl_basic_map_free(bmap1);
7059 isl_basic_map_free(bmap2);
7063 __isl_give isl_basic_map *isl_basic_map_range_product(
7064 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7066 isl_dim *dim_result = NULL;
7067 isl_basic_map *bmap;
7068 unsigned in, out1, out2, nparam, total, pos;
7069 struct isl_dim_map *dim_map1, *dim_map2;
7071 if (!bmap1 || !bmap2)
7074 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7075 isl_dim_copy(bmap2->dim));
7077 in = isl_basic_map_dim(bmap1, isl_dim_in);
7078 out1 = isl_basic_map_n_out(bmap1);
7079 out2 = isl_basic_map_n_out(bmap2);
7080 nparam = isl_basic_map_n_param(bmap1);
7082 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7083 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7084 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7085 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7086 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7087 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7088 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7089 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7090 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7091 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7092 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7094 bmap = isl_basic_map_alloc_dim(dim_result,
7095 bmap1->n_div + bmap2->n_div,
7096 bmap1->n_eq + bmap2->n_eq,
7097 bmap1->n_ineq + bmap2->n_ineq);
7098 bmap = add_constraints_dim_map(bmap, bmap1, dim_map1);
7099 bmap = add_constraints_dim_map(bmap, bmap2, dim_map2);
7100 bmap = isl_basic_map_simplify(bmap);
7101 return isl_basic_map_finalize(bmap);
7103 isl_basic_map_free(bmap1);
7104 isl_basic_map_free(bmap2);
7108 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7109 __isl_take isl_map *map2,
7110 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7111 __isl_take isl_dim *right),
7112 __isl_give isl_basic_map *(*basic_map_product)(
7113 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7116 struct isl_map *result;
7122 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7123 map2->dim, isl_dim_param), goto error);
7125 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7126 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7127 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7129 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7130 isl_dim_copy(map2->dim)),
7131 map1->n * map2->n, flags);
7134 for (i = 0; i < map1->n; ++i)
7135 for (j = 0; j < map2->n; ++j) {
7136 struct isl_basic_map *part;
7137 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7138 isl_basic_map_copy(map2->p[j]));
7139 if (isl_basic_map_is_empty(part))
7140 isl_basic_map_free(part);
7142 result = isl_map_add_basic_map(result, part);
7155 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7157 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7159 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7162 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7164 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7165 __isl_take isl_map *map2)
7169 prod = isl_map_product(map1, map2);
7170 prod = isl_map_flatten(prod);
7174 /* Given two set A and B, construct its Cartesian product A x B.
7176 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7178 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7179 (struct isl_map *)set2);
7182 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7183 __isl_take isl_set *set2)
7185 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7188 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7190 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7191 __isl_take isl_map *map2)
7193 return map_product(map1, map2, &isl_dim_range_product,
7194 &isl_basic_map_range_product);
7197 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7200 uint32_t hash = isl_hash_init();
7205 bmap = isl_basic_map_copy(bmap);
7206 bmap = isl_basic_map_normalize(bmap);
7209 total = isl_basic_map_total_dim(bmap);
7210 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7211 for (i = 0; i < bmap->n_eq; ++i) {
7213 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7214 isl_hash_hash(hash, c_hash);
7216 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7217 for (i = 0; i < bmap->n_ineq; ++i) {
7219 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7220 isl_hash_hash(hash, c_hash);
7222 isl_hash_byte(hash, bmap->n_div & 0xFF);
7223 for (i = 0; i < bmap->n_div; ++i) {
7225 if (isl_int_is_zero(bmap->div[i][0]))
7227 isl_hash_byte(hash, i & 0xFF);
7228 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7229 isl_hash_hash(hash, c_hash);
7231 isl_basic_map_free(bmap);
7235 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7237 return isl_basic_map_get_hash((isl_basic_map *)bset);
7240 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7247 map = isl_map_copy(map);
7248 map = isl_map_normalize(map);
7252 hash = isl_hash_init();
7253 for (i = 0; i < map->n; ++i) {
7255 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7256 isl_hash_hash(hash, bmap_hash);
7264 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7266 return isl_map_get_hash((isl_map *)set);
7269 /* Check if the value for dimension dim is completely determined
7270 * by the values of the other parameters and variables.
7271 * That is, check if dimension dim is involved in an equality.
7273 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7280 nparam = isl_basic_set_n_param(bset);
7281 for (i = 0; i < bset->n_eq; ++i)
7282 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7287 /* Check if the value for dimension dim is completely determined
7288 * by the values of the other parameters and variables.
7289 * That is, check if dimension dim is involved in an equality
7290 * for each of the subsets.
7292 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7298 for (i = 0; i < set->n; ++i) {
7300 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7307 int isl_set_n_basic_set(__isl_keep isl_set *set)
7309 return set ? set->n : 0;
7312 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7313 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7320 for (i = 0; i < map->n; ++i)
7321 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7327 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7328 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7335 for (i = 0; i < set->n; ++i)
7336 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7342 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7344 struct isl_dim *dim;
7349 if (bset->n_div == 0)
7352 bset = isl_basic_set_cow(bset);
7356 dim = isl_basic_set_get_dim(bset);
7357 dim = isl_dim_add(dim, isl_dim_set, bset->n_div);
7360 isl_dim_free(bset->dim);
7362 bset->extra -= bset->n_div;
7365 bset = isl_basic_set_finalize(bset);
7369 isl_basic_set_free(bset);
7373 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7376 struct isl_dim *dim;
7379 set = isl_set_align_divs(set);
7383 if (set->n == 0 || set->p[0]->n_div == 0)
7386 set = isl_set_cow(set);
7390 n_div = set->p[0]->n_div;
7391 dim = isl_set_get_dim(set);
7392 dim = isl_dim_add(dim, isl_dim_set, n_div);
7395 isl_dim_free(set->dim);
7398 for (i = 0; i < set->n; ++i) {
7399 set->p[i] = isl_basic_set_lift(set->p[i]);
7410 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7412 struct isl_dim *dim;
7413 struct isl_basic_map *bmap;
7420 set = isl_set_align_divs(set);
7425 dim = isl_set_get_dim(set);
7426 if (set->n == 0 || set->p[0]->n_div == 0) {
7428 return isl_map_identity(dim);
7431 n_div = set->p[0]->n_div;
7432 dim = isl_dim_map(dim);
7433 n_param = isl_dim_size(dim, isl_dim_param);
7434 n_set = isl_dim_size(dim, isl_dim_in);
7435 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7436 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7437 for (i = 0; i < n_set; ++i)
7438 bmap = var_equal(bmap, i);
7440 total = n_param + n_set + n_set + n_div;
7441 for (i = 0; i < n_div; ++i) {
7442 k = isl_basic_map_alloc_inequality(bmap);
7445 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7446 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7447 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7448 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7449 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7450 set->p[0]->div[i][0]);
7452 l = isl_basic_map_alloc_inequality(bmap);
7455 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7456 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7457 set->p[0]->div[i][0]);
7458 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7462 return isl_map_from_basic_map(bmap);
7465 isl_basic_map_free(bmap);
7469 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7477 dim = isl_basic_set_total_dim(bset);
7478 size += bset->n_eq * (1 + dim);
7479 size += bset->n_ineq * (1 + dim);
7480 size += bset->n_div * (2 + dim);
7485 int isl_set_size(__isl_keep isl_set *set)
7493 for (i = 0; i < set->n; ++i)
7494 size += isl_basic_set_size(set->p[i]);
7499 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7500 enum isl_dim_type type, unsigned pos)
7508 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7510 pos += isl_basic_map_offset(bmap, type);
7512 for (i = 0; i < bmap->n_eq; ++i)
7513 if (!isl_int_is_zero(bmap->eq[i][pos]))
7517 for (i = 0; i < bmap->n_ineq; ++i) {
7518 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7525 return lower && upper;
7528 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7529 enum isl_dim_type type, unsigned pos)
7536 for (i = 0; i < map->n; ++i) {
7538 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7539 if (bounded < 0 || !bounded)
7546 /* Return 1 if the specified dim is involved in both an upper bound
7547 * and a lower bound.
7549 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7550 enum isl_dim_type type, unsigned pos)
7552 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7555 /* For each of the "n" variables starting at "first", determine
7556 * the sign of the variable and put the results in the first "n"
7557 * elements of the array "signs".
7559 * 1 means that the variable is non-negative
7560 * -1 means that the variable is non-positive
7561 * 0 means the variable attains both positive and negative values.
7563 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7564 unsigned first, unsigned n, int *signs)
7566 isl_vec *bound = NULL;
7567 struct isl_tab *tab = NULL;
7568 struct isl_tab_undo *snap;
7571 if (!bset || !signs)
7574 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7575 tab = isl_tab_from_basic_set(bset);
7579 isl_seq_clr(bound->el, bound->size);
7580 isl_int_set_si(bound->el[0], -1);
7582 snap = isl_tab_snap(tab);
7583 for (i = 0; i < n; ++i) {
7586 isl_int_set_si(bound->el[1 + first + i], -1);
7587 if (isl_tab_add_ineq(tab, bound->el) < 0)
7590 isl_int_set_si(bound->el[1 + first + i], 0);
7591 if (isl_tab_rollback(tab, snap) < 0)
7599 isl_int_set_si(bound->el[1 + first + i], 1);
7600 if (isl_tab_add_ineq(tab, bound->el) < 0)
7603 isl_int_set_si(bound->el[1 + first + i], 0);
7604 if (isl_tab_rollback(tab, snap) < 0)
7607 signs[i] = empty ? -1 : 0;
7611 isl_vec_free(bound);
7615 isl_vec_free(bound);
7619 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7620 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7622 if (!bset || !signs)
7624 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7627 first += pos(bset->dim, type) - 1;
7628 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7631 /* Check if the given basic map is obviously single-valued.
7632 * In particular, for each output dimension, check that there is
7633 * an equality that defines the output dimension in terms of
7634 * earlier dimensions.
7636 int isl_basic_map_fast_is_single_valued(__isl_keep isl_basic_map *bmap)
7646 total = 1 + isl_basic_map_total_dim(bmap);
7647 n_out = isl_basic_map_dim(bmap, isl_dim_out);
7648 o_out = isl_basic_map_offset(bmap, isl_dim_out);
7650 for (i = 0; i < n_out; ++i) {
7651 for (j = 0; j < bmap->n_eq; ++j) {
7652 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
7654 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
7655 total - (o_out + i + 1)) == -1)
7658 if (j >= bmap->n_eq)
7665 /* Check if the given map is obviously single-valued.
7667 int isl_map_fast_is_single_valued(__isl_keep isl_map *map)
7678 return isl_basic_map_fast_is_single_valued(map->p[0]);
7681 /* Check if the given map is single-valued.
7686 * and check if the result is a subset of the identity mapping.
7688 int isl_map_is_single_valued(__isl_keep isl_map *map)
7694 sv = isl_map_fast_is_single_valued(map);
7698 test = isl_map_reverse(isl_map_copy(map));
7699 test = isl_map_apply_range(test, isl_map_copy(map));
7701 id = isl_map_identity(isl_dim_range(isl_map_get_dim(map)));
7703 sv = isl_map_is_subset(test, id);
7711 int isl_map_is_bijective(__isl_keep isl_map *map)
7715 sv = isl_map_is_single_valued(map);
7719 map = isl_map_copy(map);
7720 map = isl_map_reverse(map);
7721 sv = isl_map_is_single_valued(map);
7727 int isl_set_is_singleton(__isl_keep isl_set *set)
7729 return isl_map_is_single_valued((isl_map *)set);
7732 int isl_map_is_translation(__isl_keep isl_map *map)
7737 delta = isl_map_deltas(isl_map_copy(map));
7738 ok = isl_set_is_singleton(delta);
7739 isl_set_free(delta);
7744 static int unique(isl_int *p, unsigned pos, unsigned len)
7746 if (isl_seq_first_non_zero(p, pos) != -1)
7748 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
7753 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
7762 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
7765 nvar = isl_basic_set_dim(bset, isl_dim_set);
7766 ovar = isl_dim_offset(bset->dim, isl_dim_set);
7767 for (j = 0; j < nvar; ++j) {
7768 int lower = 0, upper = 0;
7769 for (i = 0; i < bset->n_eq; ++i) {
7770 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
7772 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
7778 for (i = 0; i < bset->n_ineq; ++i) {
7779 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
7781 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
7783 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
7788 if (!lower || !upper)
7795 int isl_set_is_box(__isl_keep isl_set *set)
7802 return isl_basic_set_is_box(set->p[0]);
7805 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
7810 return isl_dim_is_wrapping(bset->dim);
7813 int isl_set_is_wrapping(__isl_keep isl_set *set)
7818 return isl_dim_is_wrapping(set->dim);
7821 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
7823 bmap = isl_basic_map_cow(bmap);
7827 bmap->dim = isl_dim_wrap(bmap->dim);
7831 bmap = isl_basic_map_finalize(bmap);
7833 return (isl_basic_set *)bmap;
7835 isl_basic_map_free(bmap);
7839 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
7843 map = isl_map_cow(map);
7847 for (i = 0; i < map->n; ++i) {
7848 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
7852 map->dim = isl_dim_wrap(map->dim);
7856 return (isl_set *)map;
7862 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
7864 bset = isl_basic_set_cow(bset);
7868 bset->dim = isl_dim_unwrap(bset->dim);
7872 bset = isl_basic_set_finalize(bset);
7874 return (isl_basic_map *)bset;
7876 isl_basic_set_free(bset);
7880 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
7887 if (!isl_set_is_wrapping(set))
7888 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
7891 set = isl_set_cow(set);
7895 for (i = 0; i < set->n; ++i) {
7896 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
7901 set->dim = isl_dim_unwrap(set->dim);
7905 return (isl_map *)set;
7911 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
7912 enum isl_dim_type type)
7917 if (!isl_dim_is_named_or_nested(bmap->dim, type))
7920 bmap = isl_basic_map_cow(bmap);
7924 bmap->dim = isl_dim_reset(bmap->dim, type);
7928 bmap = isl_basic_map_finalize(bmap);
7932 isl_basic_map_free(bmap);
7936 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
7937 enum isl_dim_type type)
7944 if (!isl_dim_is_named_or_nested(map->dim, type))
7947 map = isl_map_cow(map);
7951 for (i = 0; i < map->n; ++i) {
7952 map->p[i] = isl_basic_map_reset(map->p[i], type);
7956 map->dim = isl_dim_reset(map->dim, type);
7966 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
7971 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
7974 bmap = isl_basic_map_cow(bmap);
7978 bmap->dim = isl_dim_flatten(bmap->dim);
7982 bmap = isl_basic_map_finalize(bmap);
7986 isl_basic_map_free(bmap);
7990 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
7992 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
7995 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8002 if (!map->dim->nested[0] && !map->dim->nested[1])
8005 map = isl_map_cow(map);
8009 for (i = 0; i < map->n; ++i) {
8010 map->p[i] = isl_basic_map_flatten(map->p[i]);
8014 map->dim = isl_dim_flatten(map->dim);
8024 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8026 return (isl_set *)isl_map_flatten((isl_map *)set);
8029 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8031 isl_dim *dim, *flat_dim;
8034 dim = isl_set_get_dim(set);
8035 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8036 map = map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8037 map = isl_map_intersect_domain(map, set);
8042 /* Extend the given dim_map with mappings for the divs in bmap.
8044 static __isl_give struct isl_dim_map *extend_dim_map(
8045 __isl_keep struct isl_dim_map *dim_map,
8046 __isl_keep isl_basic_map *bmap)
8049 struct isl_dim_map *res;
8052 offset = isl_basic_map_offset(bmap, isl_dim_div);
8054 res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
8058 for (i = 0; i < dim_map->len; ++i)
8059 res->pos[i] = dim_map->pos[i];
8060 for (i = 0; i < bmap->n_div; ++i)
8061 res->pos[dim_map->len + i] = offset + i;
8066 /* Extract a dim_map from a reordering.
8067 * We essentially need to reverse the mapping, and add an offset
8068 * of 1 for the constant term.
8070 __isl_give struct isl_dim_map *isl_dim_map_from_reordering(
8071 __isl_keep isl_reordering *exp)
8074 struct isl_dim_map *dim_map;
8079 dim_map = isl_dim_map_alloc(exp->dim->ctx, isl_dim_total(exp->dim));
8083 for (i = 0; i < exp->len; ++i)
8084 dim_map->pos[1 + exp->pos[i]] = 1 + i;
8089 /* Reorder the dimensions of "bmap" according to the given dim_map
8090 * and set the dimension specification to "dim".
8092 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8093 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8097 bmap = isl_basic_map_cow(bmap);
8098 if (!bmap || !dim || !dim_map)
8101 res = isl_basic_map_alloc_dim(dim,
8102 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8103 res = add_constraints_dim_map(res, bmap, dim_map);
8104 res = isl_basic_map_finalize(res);
8108 isl_basic_map_free(bmap);
8113 /* Reorder the dimensions of "map" according to given reordering.
8115 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8116 __isl_take isl_reordering *r)
8119 struct isl_dim_map *dim_map;
8121 map = isl_map_cow(map);
8122 dim_map = isl_dim_map_from_reordering(r);
8123 if (!map || !r || !dim_map)
8126 for (i = 0; i < map->n; ++i) {
8127 struct isl_dim_map *dim_map_i;
8129 dim_map_i = extend_dim_map(dim_map, map->p[i]);
8131 map->p[i] = isl_basic_map_realign(map->p[i],
8132 isl_dim_copy(r->dim), dim_map_i);
8138 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8140 isl_reordering_free(r);
8146 isl_reordering_free(r);
8150 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8151 __isl_take isl_reordering *r)
8153 return (isl_set *)isl_map_realign((isl_map *)set, r);
8156 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8157 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8158 enum isl_dim_type c2, enum isl_dim_type c3,
8159 enum isl_dim_type c4, enum isl_dim_type c5)
8161 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8162 struct isl_mat *mat;
8168 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8169 isl_basic_map_total_dim(bmap) + 1);
8172 for (i = 0; i < bmap->n_eq; ++i)
8173 for (j = 0, pos = 0; j < 5; ++j) {
8174 int off = isl_basic_map_offset(bmap, c[j]);
8175 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8176 isl_int_set(mat->row[i][pos],
8177 bmap->eq[i][off + k]);
8185 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8186 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8187 enum isl_dim_type c2, enum isl_dim_type c3,
8188 enum isl_dim_type c4, enum isl_dim_type c5)
8190 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8191 struct isl_mat *mat;
8197 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8198 isl_basic_map_total_dim(bmap) + 1);
8201 for (i = 0; i < bmap->n_ineq; ++i)
8202 for (j = 0, pos = 0; j < 5; ++j) {
8203 int off = isl_basic_map_offset(bmap, c[j]);
8204 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8205 isl_int_set(mat->row[i][pos],
8206 bmap->ineq[i][off + k]);
8214 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8215 __isl_take isl_dim *dim,
8216 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8217 enum isl_dim_type c2, enum isl_dim_type c3,
8218 enum isl_dim_type c4, enum isl_dim_type c5)
8220 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8221 isl_basic_map *bmap;
8227 if (!dim || !eq || !ineq)
8230 if (eq->n_col != ineq->n_col)
8231 isl_die(dim->ctx, isl_error_invalid,
8232 "equalities and inequalities matrices should have "
8233 "same number of columns", goto error);
8235 total = 1 + isl_dim_total(dim);
8237 if (eq->n_col < total)
8238 isl_die(dim->ctx, isl_error_invalid,
8239 "number of columns too small", goto error);
8241 extra = eq->n_col - total;
8243 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8244 eq->n_row, ineq->n_row);
8247 for (i = 0; i < extra; ++i) {
8248 k = isl_basic_map_alloc_div(bmap);
8251 isl_int_set_si(bmap->div[k][0], 0);
8253 for (i = 0; i < eq->n_row; ++i) {
8254 l = isl_basic_map_alloc_equality(bmap);
8257 for (j = 0, pos = 0; j < 5; ++j) {
8258 int off = isl_basic_map_offset(bmap, c[j]);
8259 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8260 isl_int_set(bmap->eq[l][off + k],
8266 for (i = 0; i < ineq->n_row; ++i) {
8267 l = isl_basic_map_alloc_inequality(bmap);
8270 for (j = 0, pos = 0; j < 5; ++j) {
8271 int off = isl_basic_map_offset(bmap, c[j]);
8272 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8273 isl_int_set(bmap->ineq[l][off + k],
8292 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8293 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8294 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8296 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8297 c1, c2, c3, c4, isl_dim_in);
8300 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8301 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8302 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8304 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8305 c1, c2, c3, c4, isl_dim_in);
8308 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8309 __isl_take isl_dim *dim,
8310 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8311 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8313 return (isl_basic_set*)
8314 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8315 c1, c2, c3, c4, isl_dim_in);