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
14 #include <isl_ctx_private.h>
15 #include <isl_map_private.h>
17 #include "isl_dim_private.h"
18 #include "isl_equalities.h"
19 #include <isl_list_private.h>
24 #include "isl_map_piplib.h"
25 #include <isl_reordering.h>
26 #include "isl_sample.h"
29 #include <isl_mat_private.h>
30 #include <isl_dim_map.h>
31 #include <isl_local_space_private.h>
32 #include <isl_aff_private.h>
34 static unsigned n(struct isl_dim *dim, enum isl_dim_type type)
37 case isl_dim_param: return dim->nparam;
38 case isl_dim_in: return dim->n_in;
39 case isl_dim_out: return dim->n_out;
40 case isl_dim_all: return dim->nparam + dim->n_in + dim->n_out;
45 static unsigned pos(struct isl_dim *dim, enum isl_dim_type type)
48 case isl_dim_param: return 1;
49 case isl_dim_in: return 1 + dim->nparam;
50 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
55 unsigned isl_basic_map_dim(const struct isl_basic_map *bmap,
56 enum isl_dim_type type)
61 case isl_dim_cst: return 1;
64 case isl_dim_out: return isl_dim_size(bmap->dim, type);
65 case isl_dim_div: return bmap->n_div;
66 case isl_dim_all: return isl_basic_map_total_dim(bmap);
71 unsigned isl_map_dim(const struct isl_map *map, enum isl_dim_type type)
73 return map ? n(map->dim, type) : 0;
76 unsigned isl_set_dim(const struct isl_set *set, enum isl_dim_type type)
78 return set ? n(set->dim, type) : 0;
81 unsigned isl_basic_map_offset(struct isl_basic_map *bmap,
82 enum isl_dim_type type)
84 struct isl_dim *dim = bmap->dim;
86 case isl_dim_cst: return 0;
87 case isl_dim_param: return 1;
88 case isl_dim_in: return 1 + dim->nparam;
89 case isl_dim_out: return 1 + dim->nparam + dim->n_in;
90 case isl_dim_div: return 1 + dim->nparam + dim->n_in + dim->n_out;
95 unsigned isl_basic_set_offset(struct isl_basic_set *bset,
96 enum isl_dim_type type)
98 return isl_basic_map_offset(bset, type);
101 static unsigned map_offset(struct isl_map *map, enum isl_dim_type type)
103 return pos(map->dim, type);
106 unsigned isl_basic_set_dim(const struct isl_basic_set *bset,
107 enum isl_dim_type type)
109 return isl_basic_map_dim((const struct isl_basic_map*)bset, type);
112 unsigned isl_basic_set_n_dim(const struct isl_basic_set *bset)
114 return isl_basic_set_dim(bset, isl_dim_set);
117 unsigned isl_basic_set_n_param(const struct isl_basic_set *bset)
119 return isl_basic_set_dim(bset, isl_dim_param);
122 unsigned isl_basic_set_total_dim(const struct isl_basic_set *bset)
124 return isl_dim_total(bset->dim) + bset->n_div;
127 unsigned isl_set_n_dim(const struct isl_set *set)
129 return isl_set_dim(set, isl_dim_set);
132 unsigned isl_set_n_param(const struct isl_set *set)
134 return isl_set_dim(set, isl_dim_param);
137 unsigned isl_basic_map_n_in(const struct isl_basic_map *bmap)
139 return bmap ? bmap->dim->n_in : 0;
142 unsigned isl_basic_map_n_out(const struct isl_basic_map *bmap)
144 return bmap ? bmap->dim->n_out : 0;
147 unsigned isl_basic_map_n_param(const struct isl_basic_map *bmap)
149 return bmap ? bmap->dim->nparam : 0;
152 unsigned isl_basic_map_n_div(const struct isl_basic_map *bmap)
154 return bmap ? bmap->n_div : 0;
157 unsigned isl_basic_map_total_dim(const struct isl_basic_map *bmap)
159 return bmap ? isl_dim_total(bmap->dim) + bmap->n_div : 0;
162 unsigned isl_map_n_in(const struct isl_map *map)
164 return map ? map->dim->n_in : 0;
167 unsigned isl_map_n_out(const struct isl_map *map)
169 return map ? map->dim->n_out : 0;
172 unsigned isl_map_n_param(const struct isl_map *map)
174 return map ? map->dim->nparam : 0;
177 int isl_map_compatible_domain(struct isl_map *map, struct isl_set *set)
182 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
185 return isl_dim_tuple_match(map->dim, isl_dim_in, set->dim, isl_dim_set);
188 int isl_basic_map_compatible_domain(struct isl_basic_map *bmap,
189 struct isl_basic_set *bset)
194 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
197 return isl_dim_tuple_match(bmap->dim, isl_dim_in, bset->dim, isl_dim_set);
200 int isl_map_compatible_range(__isl_keep isl_map *map, __isl_keep isl_set *set)
205 m = isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param);
208 return isl_dim_tuple_match(map->dim, isl_dim_out, set->dim, isl_dim_set);
211 int isl_basic_map_compatible_range(struct isl_basic_map *bmap,
212 struct isl_basic_set *bset)
217 m = isl_dim_match(bmap->dim, isl_dim_param, bset->dim, isl_dim_param);
220 return isl_dim_tuple_match(bmap->dim, isl_dim_out, bset->dim, isl_dim_set);
223 isl_ctx *isl_basic_map_get_ctx(__isl_keep isl_basic_map *bmap)
225 return bmap ? bmap->ctx : NULL;
228 isl_ctx *isl_basic_set_get_ctx(__isl_keep isl_basic_set *bset)
230 return bset ? bset->ctx : NULL;
233 isl_ctx *isl_map_get_ctx(__isl_keep isl_map *map)
235 return map ? map->ctx : NULL;
238 isl_ctx *isl_set_get_ctx(__isl_keep isl_set *set)
240 return set ? set->ctx : NULL;
243 struct isl_dim *isl_basic_map_get_dim(struct isl_basic_map *bmap)
247 return isl_dim_copy(bmap->dim);
250 struct isl_dim *isl_basic_set_get_dim(struct isl_basic_set *bset)
254 return isl_dim_copy(bset->dim);
257 __isl_give isl_local_space *isl_basic_map_get_local_space(
258 __isl_keep isl_basic_map *bmap)
267 total = isl_basic_map_total_dim(bmap);
268 ls = isl_local_space_alloc(isl_dim_copy(bmap->dim), bmap->n_div);
272 for (i = 0; i < bmap->n_div; ++i)
273 isl_seq_cpy(ls->div->row[i], bmap->div[i], 2 + total);
278 __isl_give isl_local_space *isl_basic_set_get_local_space(
279 __isl_keep isl_basic_set *bset)
281 return isl_basic_map_get_local_space(bset);
284 __isl_give isl_basic_map *isl_basic_map_from_local_space(
285 __isl_take isl_local_space *ls)
294 n_div = isl_local_space_dim(ls, isl_dim_div);
295 bmap = isl_basic_map_alloc_dim(isl_local_space_get_dim(ls),
296 n_div, 0, 2 * n_div);
298 for (i = 0; i < n_div; ++i)
299 if (isl_basic_map_alloc_div(bmap) < 0)
302 for (i = 0; i < n_div; ++i) {
303 isl_seq_cpy(bmap->div[i], ls->div->row[i], ls->div->n_col);
304 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
308 isl_local_space_free(ls);
311 isl_local_space_free(ls);
312 isl_basic_map_free(bmap);
316 __isl_give isl_basic_set *isl_basic_set_from_local_space(
317 __isl_take isl_local_space *ls)
319 return isl_basic_map_from_local_space(ls);
322 struct isl_dim *isl_map_get_dim(struct isl_map *map)
326 return isl_dim_copy(map->dim);
329 struct isl_dim *isl_set_get_dim(struct isl_set *set)
333 return isl_dim_copy(set->dim);
336 __isl_give isl_basic_map *isl_basic_map_set_tuple_name(
337 __isl_take isl_basic_map *bmap, enum isl_dim_type type, const char *s)
339 bmap = isl_basic_map_cow(bmap);
342 bmap->dim = isl_dim_set_tuple_name(bmap->dim, type, s);
345 bmap = isl_basic_map_finalize(bmap);
348 isl_basic_map_free(bmap);
352 __isl_give isl_basic_set *isl_basic_set_set_tuple_name(
353 __isl_take isl_basic_set *bset, const char *s)
355 return isl_basic_map_set_tuple_name(bset, isl_dim_set, s);
358 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
359 enum isl_dim_type type)
361 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
364 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
365 enum isl_dim_type type, const char *s)
369 map = isl_map_cow(map);
373 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
377 for (i = 0; i < map->n; ++i) {
378 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
389 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
390 enum isl_dim_type type)
392 return map ? isl_dim_get_tuple_name(map->dim, type) : NULL;
395 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
398 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
401 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
403 return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
406 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
408 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
411 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
412 enum isl_dim_type type, unsigned pos)
414 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
417 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
418 enum isl_dim_type type, unsigned pos)
420 return bset ? isl_dim_get_name(bset->dim, type, pos) : NULL;
423 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
424 enum isl_dim_type type, unsigned pos)
426 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
429 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
430 enum isl_dim_type type, unsigned pos)
432 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
435 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
436 __isl_take isl_basic_map *bmap,
437 enum isl_dim_type type, unsigned pos, const char *s)
441 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
446 isl_basic_map_free(bmap);
450 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
451 enum isl_dim_type type, unsigned pos, const char *s)
458 map->dim = isl_dim_set_name(map->dim, type, pos, s);
462 for (i = 0; i < map->n; ++i) {
463 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
474 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
475 __isl_take isl_basic_set *bset,
476 enum isl_dim_type type, unsigned pos, const char *s)
478 return (isl_basic_set *)isl_basic_map_set_dim_name(
479 (isl_basic_map *)bset, type, pos, s);
482 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
483 enum isl_dim_type type, unsigned pos, const char *s)
485 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
488 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
492 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
495 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
497 return isl_basic_map_is_rational(bset);
500 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
501 struct isl_basic_map *bmap, unsigned extra,
502 unsigned n_eq, unsigned n_ineq)
505 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
510 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
511 if (isl_blk_is_error(bmap->block))
514 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
519 bmap->block2 = isl_blk_empty();
522 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
523 if (isl_blk_is_error(bmap->block2))
526 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
531 for (i = 0; i < n_ineq + n_eq; ++i)
532 bmap->ineq[i] = bmap->block.data + i * row_size;
534 for (i = 0; i < extra; ++i)
535 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
539 bmap->c_size = n_eq + n_ineq;
540 bmap->eq = bmap->ineq + n_ineq;
549 isl_basic_map_free(bmap);
553 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
554 unsigned nparam, unsigned dim, unsigned extra,
555 unsigned n_eq, unsigned n_ineq)
557 struct isl_basic_map *bmap;
558 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
559 return (struct isl_basic_set *)bmap;
562 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
563 unsigned extra, unsigned n_eq, unsigned n_ineq)
565 struct isl_basic_map *bmap;
568 isl_assert(dim->ctx, dim->n_in == 0, goto error);
569 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
570 return (struct isl_basic_set *)bmap;
576 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
577 unsigned extra, unsigned n_eq, unsigned n_ineq)
579 struct isl_basic_map *bmap;
583 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
588 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
594 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
595 unsigned nparam, unsigned in, unsigned out, unsigned extra,
596 unsigned n_eq, unsigned n_ineq)
598 struct isl_basic_map *bmap;
601 dim = isl_dim_alloc(ctx, nparam, in, out);
605 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
609 static void dup_constraints(
610 struct isl_basic_map *dst, struct isl_basic_map *src)
613 unsigned total = isl_basic_map_total_dim(src);
615 for (i = 0; i < src->n_eq; ++i) {
616 int j = isl_basic_map_alloc_equality(dst);
617 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
620 for (i = 0; i < src->n_ineq; ++i) {
621 int j = isl_basic_map_alloc_inequality(dst);
622 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
625 for (i = 0; i < src->n_div; ++i) {
626 int j = isl_basic_map_alloc_div(dst);
627 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
629 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
632 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
634 struct isl_basic_map *dup;
638 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
639 bmap->n_div, bmap->n_eq, bmap->n_ineq);
642 dup_constraints(dup, bmap);
643 dup->flags = bmap->flags;
644 dup->sample = isl_vec_copy(bmap->sample);
648 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
650 struct isl_basic_map *dup;
652 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
653 return (struct isl_basic_set *)dup;
656 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
661 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
665 return isl_basic_set_dup(bset);
668 struct isl_set *isl_set_copy(struct isl_set *set)
677 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
682 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
686 bmap = isl_basic_map_dup(bmap);
688 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
692 struct isl_map *isl_map_copy(struct isl_map *map)
701 void isl_basic_map_free(struct isl_basic_map *bmap)
709 isl_ctx_deref(bmap->ctx);
711 isl_blk_free(bmap->ctx, bmap->block2);
713 isl_blk_free(bmap->ctx, bmap->block);
714 isl_vec_free(bmap->sample);
715 isl_dim_free(bmap->dim);
719 void isl_basic_set_free(struct isl_basic_set *bset)
721 isl_basic_map_free((struct isl_basic_map *)bset);
724 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
726 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
729 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
735 isl_assert(ctx, room_for_con(bmap, 1), return -1);
736 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
738 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
739 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
740 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
741 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
742 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
743 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
745 int j = isl_basic_map_alloc_inequality(bmap);
749 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
750 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
757 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
758 bmap->extra - bmap->n_div);
762 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
764 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
767 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
771 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
776 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
778 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
781 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
786 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
788 if (pos != bmap->n_eq - 1) {
790 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
791 bmap->eq[bmap->n_eq - 1] = t;
797 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
799 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
802 void isl_basic_map_inequality_to_equality(
803 struct isl_basic_map *bmap, unsigned pos)
808 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
809 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
814 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
815 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
816 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
817 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
820 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
822 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
825 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
831 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
832 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
833 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
834 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
835 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
836 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
837 1 + isl_basic_map_total_dim(bmap),
838 bmap->extra - bmap->n_div);
839 return bmap->n_ineq++;
842 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
844 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
847 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
851 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
856 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
858 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
861 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
866 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
868 if (pos != bmap->n_ineq - 1) {
870 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
871 bmap->ineq[bmap->n_ineq - 1] = t;
872 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
878 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
880 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
883 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
888 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
891 k = isl_basic_map_alloc_equality(bmap);
894 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
897 isl_basic_map_free(bmap);
901 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
904 return (isl_basic_set *)
905 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
908 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
913 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
916 k = isl_basic_map_alloc_inequality(bmap);
919 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
922 isl_basic_map_free(bmap);
926 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
929 return (isl_basic_set *)
930 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
933 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
937 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
938 isl_seq_clr(bmap->div[bmap->n_div] +
939 1 + 1 + isl_basic_map_total_dim(bmap),
940 bmap->extra - bmap->n_div);
941 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
942 return bmap->n_div++;
945 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
947 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
950 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
954 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
959 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
961 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
964 /* Copy constraint from src to dst, putting the vars of src at offset
965 * dim_off in dst and the divs of src at offset div_off in dst.
966 * If both sets are actually map, then dim_off applies to the input
969 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
970 struct isl_basic_map *src_map, isl_int *src,
971 unsigned in_off, unsigned out_off, unsigned div_off)
973 unsigned src_nparam = isl_basic_map_n_param(src_map);
974 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
975 unsigned src_in = isl_basic_map_n_in(src_map);
976 unsigned dst_in = isl_basic_map_n_in(dst_map);
977 unsigned src_out = isl_basic_map_n_out(src_map);
978 unsigned dst_out = isl_basic_map_n_out(dst_map);
979 isl_int_set(dst[0], src[0]);
980 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
981 if (dst_nparam > src_nparam)
982 isl_seq_clr(dst+1+src_nparam,
983 dst_nparam - src_nparam);
984 isl_seq_clr(dst+1+dst_nparam, in_off);
985 isl_seq_cpy(dst+1+dst_nparam+in_off,
987 isl_min(dst_in-in_off, src_in));
988 if (dst_in-in_off > src_in)
989 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
990 dst_in - in_off - src_in);
991 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
992 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
993 src+1+src_nparam+src_in,
994 isl_min(dst_out-out_off, src_out));
995 if (dst_out-out_off > src_out)
996 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
997 dst_out - out_off - src_out);
998 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
999 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
1000 src+1+src_nparam+src_in+src_out,
1001 isl_min(dst_map->extra-div_off, src_map->n_div));
1002 if (dst_map->n_div-div_off > src_map->n_div)
1003 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
1004 div_off+src_map->n_div,
1005 dst_map->n_div - div_off - src_map->n_div);
1008 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1009 struct isl_basic_map *src_map, isl_int *src,
1010 unsigned in_off, unsigned out_off, unsigned div_off)
1012 isl_int_set(dst[0], src[0]);
1013 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1016 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1017 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1022 if (!bmap1 || !bmap2)
1025 div_off = bmap1->n_div;
1027 for (i = 0; i < bmap2->n_eq; ++i) {
1028 int i1 = isl_basic_map_alloc_equality(bmap1);
1031 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1032 i_pos, o_pos, div_off);
1035 for (i = 0; i < bmap2->n_ineq; ++i) {
1036 int i1 = isl_basic_map_alloc_inequality(bmap1);
1039 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1040 i_pos, o_pos, div_off);
1043 for (i = 0; i < bmap2->n_div; ++i) {
1044 int i1 = isl_basic_map_alloc_div(bmap1);
1047 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1048 i_pos, o_pos, div_off);
1051 isl_basic_map_free(bmap2);
1056 isl_basic_map_free(bmap1);
1057 isl_basic_map_free(bmap2);
1061 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1062 struct isl_basic_set *bset2, unsigned pos)
1064 return (struct isl_basic_set *)
1065 add_constraints((struct isl_basic_map *)bset1,
1066 (struct isl_basic_map *)bset2, 0, pos);
1069 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1070 struct isl_dim *dim, unsigned extra,
1071 unsigned n_eq, unsigned n_ineq)
1073 struct isl_basic_map *ext;
1083 dims_ok = isl_dim_equal(base->dim, dim) &&
1084 base->extra >= base->n_div + extra;
1086 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1087 room_for_ineq(base, n_ineq)) {
1092 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1093 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1094 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1095 extra += base->extra;
1097 n_ineq += base->n_ineq;
1099 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1105 ext->sample = isl_vec_copy(base->sample);
1106 flags = base->flags;
1107 ext = add_constraints(ext, base, 0, 0);
1110 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1117 isl_basic_map_free(base);
1121 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1122 struct isl_dim *dim, unsigned extra,
1123 unsigned n_eq, unsigned n_ineq)
1125 return (struct isl_basic_set *)
1126 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1127 extra, n_eq, n_ineq);
1130 struct isl_basic_map *isl_basic_map_extend_constraints(
1131 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1135 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1139 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1140 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1141 unsigned n_eq, unsigned n_ineq)
1143 struct isl_basic_map *bmap;
1144 struct isl_dim *dim;
1148 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1152 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1155 isl_basic_map_free(base);
1159 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1160 unsigned nparam, unsigned dim, unsigned extra,
1161 unsigned n_eq, unsigned n_ineq)
1163 return (struct isl_basic_set *)
1164 isl_basic_map_extend((struct isl_basic_map *)base,
1165 nparam, 0, dim, extra, n_eq, n_ineq);
1168 struct isl_basic_set *isl_basic_set_extend_constraints(
1169 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1171 return (struct isl_basic_set *)
1172 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1176 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1178 return (struct isl_basic_set *)
1179 isl_basic_map_cow((struct isl_basic_map *)bset);
1182 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1187 if (bmap->ref > 1) {
1189 bmap = isl_basic_map_dup(bmap);
1192 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1196 struct isl_set *isl_set_cow(struct isl_set *set)
1204 return isl_set_dup(set);
1207 struct isl_map *isl_map_cow(struct isl_map *map)
1215 return isl_map_dup(map);
1218 static void swap_vars(struct isl_blk blk, isl_int *a,
1219 unsigned a_len, unsigned b_len)
1221 isl_seq_cpy(blk.data, a+a_len, b_len);
1222 isl_seq_cpy(blk.data+b_len, a, a_len);
1223 isl_seq_cpy(a, blk.data, b_len+a_len);
1226 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1227 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1235 isl_assert(bmap->ctx,
1236 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1238 if (n1 == 0 || n2 == 0)
1241 bmap = isl_basic_map_cow(bmap);
1245 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1246 if (isl_blk_is_error(blk))
1249 for (i = 0; i < bmap->n_eq; ++i)
1251 bmap->eq[i] + pos, n1, n2);
1253 for (i = 0; i < bmap->n_ineq; ++i)
1255 bmap->ineq[i] + pos, n1, n2);
1257 for (i = 0; i < bmap->n_div; ++i)
1259 bmap->div[i]+1 + pos, n1, n2);
1261 isl_blk_free(bmap->ctx, blk);
1263 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1264 bmap = isl_basic_map_gauss(bmap, NULL);
1265 return isl_basic_map_finalize(bmap);
1267 isl_basic_map_free(bmap);
1271 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1272 __isl_take isl_basic_set *bset, unsigned n)
1277 nparam = isl_basic_set_n_param(bset);
1278 dim = isl_basic_set_n_dim(bset);
1279 isl_assert(bset->ctx, n <= dim, goto error);
1281 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1283 isl_basic_set_free(bset);
1287 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1293 total = isl_basic_map_total_dim(bmap);
1294 isl_basic_map_free_div(bmap, bmap->n_div);
1295 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1297 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1299 i = isl_basic_map_alloc_equality(bmap);
1303 isl_int_set_si(bmap->eq[i][0], 1);
1304 isl_seq_clr(bmap->eq[i]+1, total);
1305 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1306 isl_vec_free(bmap->sample);
1307 bmap->sample = NULL;
1308 return isl_basic_map_finalize(bmap);
1310 isl_basic_map_free(bmap);
1314 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1316 return (struct isl_basic_set *)
1317 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1320 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1323 unsigned off = isl_dim_total(bmap->dim);
1324 isl_int *t = bmap->div[a];
1325 bmap->div[a] = bmap->div[b];
1328 for (i = 0; i < bmap->n_eq; ++i)
1329 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1331 for (i = 0; i < bmap->n_ineq; ++i)
1332 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1334 for (i = 0; i < bmap->n_div; ++i)
1335 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1336 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1339 /* Eliminate the specified n dimensions starting at first from the
1340 * constraints using Fourier-Motzkin. The dimensions themselves
1343 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1344 enum isl_dim_type type, unsigned first, unsigned n)
1353 map = isl_map_cow(map);
1356 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1357 first += pos(map->dim, type) - 1;
1359 for (i = 0; i < map->n; ++i) {
1360 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1370 /* Eliminate the specified n dimensions starting at first from the
1371 * constraints using Fourier-Motzkin. The dimensions themselves
1374 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1375 enum isl_dim_type type, unsigned first, unsigned n)
1377 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1380 /* Eliminate the specified n dimensions starting at first from the
1381 * constraints using Fourier-Motzkin. The dimensions themselves
1384 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1385 unsigned first, unsigned n)
1387 return isl_set_eliminate(set, isl_dim_set, first, n);
1390 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1391 __isl_take isl_basic_map *bmap)
1395 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1400 return isl_basic_map_finalize(bmap);
1403 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1404 __isl_take isl_basic_set *bset)
1406 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1407 (struct isl_basic_map *)bset);
1410 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1419 map = isl_map_cow(map);
1423 for (i = 0; i < map->n; ++i) {
1424 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1434 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1436 return isl_map_remove_divs(set);
1439 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1440 enum isl_dim_type type, unsigned first, unsigned n)
1444 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1446 if (n == 0 && !isl_dim_is_named_or_nested(bmap->dim, type))
1448 bmap = isl_basic_map_eliminate_vars(bmap,
1449 isl_basic_map_offset(bmap, type) - 1 + first, n);
1452 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1454 bmap = isl_basic_map_drop(bmap, type, first, n);
1457 isl_basic_map_free(bmap);
1461 /* Return true if the definition of the given div (recursively) involves
1462 * any of the given variables.
1464 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1465 unsigned first, unsigned n)
1468 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1470 if (isl_int_is_zero(bmap->div[div][0]))
1472 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1475 for (i = bmap->n_div - 1; i >= 0; --i) {
1476 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1478 if (div_involves_vars(bmap, i, first, n))
1485 /* Remove all divs (recursively) involving any of the given dimensions
1486 * in their definitions.
1488 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1489 __isl_take isl_basic_map *bmap,
1490 enum isl_dim_type type, unsigned first, unsigned n)
1496 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1498 first += isl_basic_map_offset(bmap, type);
1500 for (i = bmap->n_div - 1; i >= 0; --i) {
1501 if (!div_involves_vars(bmap, i, first, n))
1503 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1511 isl_basic_map_free(bmap);
1515 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1516 enum isl_dim_type type, unsigned first, unsigned n)
1525 map = isl_map_cow(map);
1529 for (i = 0; i < map->n; ++i) {
1530 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1541 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1542 enum isl_dim_type type, unsigned first, unsigned n)
1544 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1548 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1549 enum isl_dim_type type, unsigned first, unsigned n)
1556 if (first + n > isl_basic_set_dim(bset, type))
1557 isl_die(bset->ctx, isl_error_invalid,
1558 "index out of bounds", return -1);
1560 first += isl_basic_set_offset(bset, type);
1561 for (i = 0; i < bset->n_eq; ++i)
1562 if (isl_seq_first_non_zero(bset->eq[i] + first, n) >= 0)
1564 for (i = 0; i < bset->n_ineq; ++i)
1565 if (isl_seq_first_non_zero(bset->ineq[i] + first, n) >= 0)
1571 int isl_set_involves_dims(__isl_keep isl_set *set,
1572 enum isl_dim_type type, unsigned first, unsigned n)
1579 if (first + n > isl_set_dim(set, type))
1580 isl_die(set->ctx, isl_error_invalid,
1581 "index out of bounds", return -1);
1583 for (i = 0; i < set->n; ++i) {
1584 int involves = isl_basic_set_involves_dims(set->p[i],
1586 if (involves < 0 || !involves)
1593 /* Return true if the definition of the given div is unknown or depends
1596 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1599 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1601 if (isl_int_is_zero(bmap->div[div][0]))
1604 for (i = bmap->n_div - 1; i >= 0; --i) {
1605 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1607 if (div_is_unknown(bmap, i))
1614 /* Remove all divs that are unknown or defined in terms of unknown divs.
1616 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1617 __isl_take isl_basic_map *bmap)
1624 for (i = bmap->n_div - 1; i >= 0; --i) {
1625 if (!div_is_unknown(bmap, i))
1627 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1633 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1642 map = isl_map_cow(map);
1646 for (i = 0; i < map->n; ++i) {
1647 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1657 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1659 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1662 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1663 __isl_take isl_basic_set *bset,
1664 enum isl_dim_type type, unsigned first, unsigned n)
1666 return (isl_basic_set *)
1667 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1670 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1671 enum isl_dim_type type, unsigned first, unsigned n)
1678 map = isl_map_cow(map);
1681 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1683 for (i = 0; i < map->n; ++i) {
1684 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1685 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1689 map = isl_map_drop(map, type, first, n);
1696 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1697 enum isl_dim_type type, unsigned first, unsigned n)
1699 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1702 /* Project out n inputs starting at first using Fourier-Motzkin */
1703 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1704 unsigned first, unsigned n)
1706 return isl_map_remove_dims(map, isl_dim_in, first, n);
1709 static void dump_term(struct isl_basic_map *bmap,
1710 isl_int c, int pos, FILE *out)
1713 unsigned in = isl_basic_map_n_in(bmap);
1714 unsigned dim = in + isl_basic_map_n_out(bmap);
1715 unsigned nparam = isl_basic_map_n_param(bmap);
1717 isl_int_print(out, c, 0);
1719 if (!isl_int_is_one(c))
1720 isl_int_print(out, c, 0);
1721 if (pos < 1 + nparam) {
1722 name = isl_dim_get_name(bmap->dim,
1723 isl_dim_param, pos - 1);
1725 fprintf(out, "%s", name);
1727 fprintf(out, "p%d", pos - 1);
1728 } else if (pos < 1 + nparam + in)
1729 fprintf(out, "i%d", pos - 1 - nparam);
1730 else if (pos < 1 + nparam + dim)
1731 fprintf(out, "o%d", pos - 1 - nparam - in);
1733 fprintf(out, "e%d", pos - 1 - nparam - dim);
1737 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1738 int sign, FILE *out)
1742 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1746 for (i = 0, first = 1; i < len; ++i) {
1747 if (isl_int_sgn(c[i]) * sign <= 0)
1750 fprintf(out, " + ");
1752 isl_int_abs(v, c[i]);
1753 dump_term(bmap, v, i, out);
1760 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1761 const char *op, FILE *out, int indent)
1765 fprintf(out, "%*s", indent, "");
1767 dump_constraint_sign(bmap, c, 1, out);
1768 fprintf(out, " %s ", op);
1769 dump_constraint_sign(bmap, c, -1, out);
1773 for (i = bmap->n_div; i < bmap->extra; ++i) {
1774 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1776 fprintf(out, "%*s", indent, "");
1777 fprintf(out, "ERROR: unused div coefficient not zero\n");
1782 static void dump_constraints(struct isl_basic_map *bmap,
1783 isl_int **c, unsigned n,
1784 const char *op, FILE *out, int indent)
1788 for (i = 0; i < n; ++i)
1789 dump_constraint(bmap, c[i], op, out, indent);
1792 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1796 unsigned total = isl_basic_map_total_dim(bmap);
1798 for (j = 0; j < 1 + total; ++j) {
1799 if (isl_int_is_zero(exp[j]))
1801 if (!first && isl_int_is_pos(exp[j]))
1803 dump_term(bmap, exp[j], j, out);
1808 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1812 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1813 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1815 for (i = 0; i < bmap->n_div; ++i) {
1816 fprintf(out, "%*s", indent, "");
1817 fprintf(out, "e%d = [(", i);
1818 dump_affine(bmap, bmap->div[i]+1, out);
1820 isl_int_print(out, bmap->div[i][0], 0);
1821 fprintf(out, "]\n");
1825 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1826 FILE *out, int indent)
1829 fprintf(out, "null basic set\n");
1833 fprintf(out, "%*s", indent, "");
1834 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1835 bset->ref, bset->dim->nparam, bset->dim->n_out,
1836 bset->extra, bset->flags);
1837 dump((struct isl_basic_map *)bset, out, indent);
1840 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1841 FILE *out, int indent)
1844 fprintf(out, "null basic map\n");
1848 fprintf(out, "%*s", indent, "");
1849 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1850 "flags: %x, n_name: %d\n",
1852 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1853 bmap->extra, bmap->flags, bmap->dim->n_name);
1854 dump(bmap, out, indent);
1857 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1862 total = isl_basic_map_total_dim(bmap);
1863 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1864 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1865 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1866 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1870 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1872 struct isl_set *set;
1876 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1877 isl_assert(dim->ctx, n >= 0, goto error);
1878 set = isl_alloc(dim->ctx, struct isl_set,
1879 sizeof(struct isl_set) +
1880 (n - 1) * sizeof(struct isl_basic_set *));
1884 set->ctx = dim->ctx;
1885 isl_ctx_ref(set->ctx);
1897 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1898 unsigned nparam, unsigned dim, int n, unsigned flags)
1900 struct isl_set *set;
1901 struct isl_dim *dims;
1903 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1907 set = isl_set_alloc_dim(dims, n, flags);
1911 /* Make sure "map" has room for at least "n" more basic maps.
1913 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1916 struct isl_map *grown = NULL;
1920 isl_assert(map->ctx, n >= 0, goto error);
1921 if (map->n + n <= map->size)
1923 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1926 for (i = 0; i < map->n; ++i) {
1927 grown->p[i] = isl_basic_map_copy(map->p[i]);
1935 isl_map_free(grown);
1940 /* Make sure "set" has room for at least "n" more basic sets.
1942 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1944 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1947 struct isl_set *isl_set_dup(struct isl_set *set)
1950 struct isl_set *dup;
1955 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1958 for (i = 0; i < set->n; ++i)
1959 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1963 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1965 return isl_map_from_basic_map(bset);
1968 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1970 struct isl_map *map;
1975 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1976 return isl_map_add_basic_map(map, bmap);
1979 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1980 __isl_take isl_basic_set *bset)
1982 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1983 (struct isl_basic_map *)bset);
1986 void isl_set_free(struct isl_set *set)
1996 isl_ctx_deref(set->ctx);
1997 for (i = 0; i < set->n; ++i)
1998 isl_basic_set_free(set->p[i]);
1999 isl_dim_free(set->dim);
2003 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2008 fprintf(out, "null set\n");
2012 fprintf(out, "%*s", indent, "");
2013 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2014 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2016 for (i = 0; i < set->n; ++i) {
2017 fprintf(out, "%*s", indent, "");
2018 fprintf(out, "basic set %d:\n", i);
2019 isl_basic_set_print_internal(set->p[i], out, indent+4);
2023 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2028 fprintf(out, "null map\n");
2032 fprintf(out, "%*s", indent, "");
2033 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2034 "flags: %x, n_name: %d\n",
2035 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2036 map->dim->n_out, map->flags, map->dim->n_name);
2037 for (i = 0; i < map->n; ++i) {
2038 fprintf(out, "%*s", indent, "");
2039 fprintf(out, "basic map %d:\n", i);
2040 isl_basic_map_print_internal(map->p[i], out, indent+4);
2044 struct isl_basic_map *isl_basic_map_intersect_domain(
2045 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2047 struct isl_basic_map *bmap_domain;
2052 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2053 bset->dim, isl_dim_param), goto error);
2055 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2056 isl_assert(bset->ctx,
2057 isl_basic_map_compatible_domain(bmap, bset), goto error);
2059 bmap = isl_basic_map_cow(bmap);
2062 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2063 bset->n_div, bset->n_eq, bset->n_ineq);
2064 bmap_domain = isl_basic_map_from_domain(bset);
2065 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2067 bmap = isl_basic_map_simplify(bmap);
2068 return isl_basic_map_finalize(bmap);
2070 isl_basic_map_free(bmap);
2071 isl_basic_set_free(bset);
2075 struct isl_basic_map *isl_basic_map_intersect_range(
2076 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2078 struct isl_basic_map *bmap_range;
2083 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2084 bset->dim, isl_dim_param), goto error);
2086 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2087 isl_assert(bset->ctx,
2088 isl_basic_map_compatible_range(bmap, bset), goto error);
2090 if (isl_basic_set_is_universe(bset)) {
2091 isl_basic_set_free(bset);
2095 bmap = isl_basic_map_cow(bmap);
2098 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2099 bset->n_div, bset->n_eq, bset->n_ineq);
2100 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2101 bmap = add_constraints(bmap, bmap_range, 0, 0);
2103 bmap = isl_basic_map_simplify(bmap);
2104 return isl_basic_map_finalize(bmap);
2106 isl_basic_map_free(bmap);
2107 isl_basic_set_free(bset);
2111 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2117 total = 1 + isl_basic_map_total_dim(bmap);
2118 if (total != vec->size)
2123 for (i = 0; i < bmap->n_eq; ++i) {
2124 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2125 if (!isl_int_is_zero(s)) {
2131 for (i = 0; i < bmap->n_ineq; ++i) {
2132 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2133 if (isl_int_is_neg(s)) {
2144 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2146 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2149 struct isl_basic_map *isl_basic_map_intersect(
2150 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2152 struct isl_vec *sample = NULL;
2154 if (!bmap1 || !bmap2)
2157 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2158 bmap2->dim, isl_dim_param), goto error);
2159 if (isl_dim_total(bmap1->dim) ==
2160 isl_dim_size(bmap1->dim, isl_dim_param) &&
2161 isl_dim_total(bmap2->dim) !=
2162 isl_dim_size(bmap2->dim, isl_dim_param))
2163 return isl_basic_map_intersect(bmap2, bmap1);
2165 if (isl_dim_total(bmap2->dim) !=
2166 isl_dim_size(bmap2->dim, isl_dim_param))
2167 isl_assert(bmap1->ctx,
2168 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2170 if (bmap1->sample &&
2171 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2172 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2173 sample = isl_vec_copy(bmap1->sample);
2174 else if (bmap2->sample &&
2175 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2176 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2177 sample = isl_vec_copy(bmap2->sample);
2179 bmap1 = isl_basic_map_cow(bmap1);
2182 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2183 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2184 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2187 isl_vec_free(sample);
2189 isl_vec_free(bmap1->sample);
2190 bmap1->sample = sample;
2193 bmap1 = isl_basic_map_simplify(bmap1);
2194 return isl_basic_map_finalize(bmap1);
2197 isl_vec_free(sample);
2198 isl_basic_map_free(bmap1);
2199 isl_basic_map_free(bmap2);
2203 struct isl_basic_set *isl_basic_set_intersect(
2204 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2206 return (struct isl_basic_set *)
2207 isl_basic_map_intersect(
2208 (struct isl_basic_map *)bset1,
2209 (struct isl_basic_map *)bset2);
2212 /* Special case of isl_map_intersect, where both map1 and map2
2213 * are convex, without any divs and such that either map1 or map2
2214 * contains a single constraint. This constraint is then simply
2215 * added to the other map.
2217 static __isl_give isl_map *map_intersect_add_constraint(
2218 __isl_take isl_map *map1, __isl_take isl_map *map2)
2220 isl_assert(map1->ctx, map1->n == 1, goto error);
2221 isl_assert(map2->ctx, map1->n == 1, goto error);
2222 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2223 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2225 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2226 return isl_map_intersect(map2, map1);
2228 isl_assert(map2->ctx,
2229 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2231 map1 = isl_map_cow(map1);
2234 if (isl_map_plain_is_empty(map1)) {
2238 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2239 if (map2->p[0]->n_eq == 1)
2240 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2242 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2243 map2->p[0]->ineq[0]);
2245 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2246 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2250 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2251 isl_basic_map_free(map1->p[0]);
2264 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2267 struct isl_map *result;
2273 if (isl_map_plain_is_empty(map1) &&
2274 isl_dim_equal(map1->dim, map2->dim)) {
2278 if (isl_map_plain_is_empty(map2) &&
2279 isl_dim_equal(map1->dim, map2->dim)) {
2284 if (map1->n == 1 && map2->n == 1 &&
2285 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2286 isl_dim_equal(map1->dim, map2->dim) &&
2287 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2288 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2289 return map_intersect_add_constraint(map1, map2);
2290 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2291 map2->dim, isl_dim_param), goto error);
2292 if (isl_dim_total(map1->dim) ==
2293 isl_dim_size(map1->dim, isl_dim_param) &&
2294 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2295 return isl_map_intersect(map2, map1);
2297 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2298 isl_assert(map1->ctx,
2299 isl_dim_equal(map1->dim, map2->dim), goto error);
2301 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2302 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2303 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2305 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2306 map1->n * map2->n, flags);
2309 for (i = 0; i < map1->n; ++i)
2310 for (j = 0; j < map2->n; ++j) {
2311 struct isl_basic_map *part;
2312 part = isl_basic_map_intersect(
2313 isl_basic_map_copy(map1->p[i]),
2314 isl_basic_map_copy(map2->p[j]));
2315 if (isl_basic_map_is_empty(part))
2316 isl_basic_map_free(part);
2318 result = isl_map_add_basic_map(result, part);
2331 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2333 return (struct isl_set *)
2334 isl_map_intersect((struct isl_map *)set1,
2335 (struct isl_map *)set2);
2338 /* The current implementation of isl_map_intersect accepts intersections
2339 * with parameter domains, so we can just call that for now.
2341 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map,
2342 __isl_take isl_set *params)
2344 return isl_map_intersect(map, params);
2347 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2348 __isl_take isl_set *params)
2350 return isl_map_intersect_params(set, params);
2353 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2355 struct isl_dim *dim;
2356 struct isl_basic_set *bset;
2361 bmap = isl_basic_map_cow(bmap);
2364 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2365 in = isl_basic_map_n_in(bmap);
2366 bset = isl_basic_set_from_basic_map(bmap);
2367 bset = isl_basic_set_swap_vars(bset, in);
2368 return isl_basic_map_from_basic_set(bset, dim);
2371 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2372 enum isl_dim_type type, unsigned pos, unsigned n)
2374 struct isl_dim *res_dim;
2375 struct isl_basic_map *res;
2376 struct isl_dim_map *dim_map;
2377 unsigned total, off;
2378 enum isl_dim_type t;
2386 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2388 total = isl_basic_map_total_dim(bmap) + n;
2389 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2391 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2393 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2395 unsigned size = isl_basic_map_dim(bmap, t);
2396 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2398 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2399 pos, size - pos, off + pos + n);
2401 off += isl_dim_size(res_dim, t);
2403 isl_dim_map_div(dim_map, bmap, off);
2405 res = isl_basic_map_alloc_dim(res_dim,
2406 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2407 if (isl_basic_map_is_rational(bmap))
2408 res = isl_basic_map_set_rational(res);
2409 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2410 return isl_basic_map_finalize(res);
2413 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2414 enum isl_dim_type type, unsigned n)
2418 return isl_basic_map_insert(bmap, type,
2419 isl_basic_map_dim(bmap, type), n);
2422 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2423 enum isl_dim_type type, unsigned n)
2427 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2428 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2430 isl_basic_set_free(bset);
2434 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2435 enum isl_dim_type type, unsigned pos, unsigned n)
2442 map = isl_map_cow(map);
2446 map->dim = isl_dim_insert(map->dim, type, pos, n);
2450 for (i = 0; i < map->n; ++i) {
2451 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2462 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2463 enum isl_dim_type type, unsigned pos, unsigned n)
2465 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2468 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2469 enum isl_dim_type type, unsigned n)
2473 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2476 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2477 enum isl_dim_type type, unsigned n)
2481 isl_assert(set->ctx, type != isl_dim_in, goto error);
2482 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2488 __isl_give isl_basic_map *isl_basic_map_move_dims(
2489 __isl_take isl_basic_map *bmap,
2490 enum isl_dim_type dst_type, unsigned dst_pos,
2491 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2493 struct isl_dim_map *dim_map;
2494 struct isl_basic_map *res;
2495 enum isl_dim_type t;
2496 unsigned total, off;
2503 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2506 if (dst_type == src_type && dst_pos == src_pos)
2509 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2511 if (pos(bmap->dim, dst_type) + dst_pos ==
2512 pos(bmap->dim, src_type) + src_pos +
2513 ((src_type < dst_type) ? n : 0)) {
2514 bmap = isl_basic_map_cow(bmap);
2518 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2519 src_type, src_pos, n);
2523 bmap = isl_basic_map_finalize(bmap);
2528 total = isl_basic_map_total_dim(bmap);
2529 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2532 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2533 unsigned size = isl_dim_size(bmap->dim, t);
2534 if (t == dst_type) {
2535 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2538 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2541 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2542 dst_pos, size - dst_pos, off);
2543 off += size - dst_pos;
2544 } else if (t == src_type) {
2545 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2548 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2549 src_pos + n, size - src_pos - n, off);
2550 off += size - src_pos - n;
2552 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2556 isl_dim_map_div(dim_map, bmap, off);
2558 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2559 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2560 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2562 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2563 src_type, src_pos, n);
2567 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2568 bmap = isl_basic_map_gauss(bmap, NULL);
2569 bmap = isl_basic_map_finalize(bmap);
2573 isl_basic_map_free(bmap);
2577 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2578 enum isl_dim_type dst_type, unsigned dst_pos,
2579 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2581 return (isl_basic_set *)isl_basic_map_move_dims(
2582 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2585 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2586 enum isl_dim_type dst_type, unsigned dst_pos,
2587 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2591 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2592 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2593 src_type, src_pos, n);
2599 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2600 enum isl_dim_type dst_type, unsigned dst_pos,
2601 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2610 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2613 if (dst_type == src_type && dst_pos == src_pos)
2616 isl_assert(map->ctx, dst_type != src_type, goto error);
2618 map = isl_map_cow(map);
2622 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2626 for (i = 0; i < map->n; ++i) {
2627 map->p[i] = isl_basic_map_move_dims(map->p[i],
2629 src_type, src_pos, n);
2640 /* Move the specified dimensions to the last columns right before
2641 * the divs. Don't change the dimension specification of bmap.
2642 * That's the responsibility of the caller.
2644 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2645 enum isl_dim_type type, unsigned first, unsigned n)
2647 struct isl_dim_map *dim_map;
2648 struct isl_basic_map *res;
2649 enum isl_dim_type t;
2650 unsigned total, off;
2654 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2657 total = isl_basic_map_total_dim(bmap);
2658 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2661 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2662 unsigned size = isl_dim_size(bmap->dim, t);
2664 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2667 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2668 first, n, total - bmap->n_div - n);
2669 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2670 first + n, size - (first + n), off);
2671 off += size - (first + n);
2673 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2677 isl_dim_map_div(dim_map, bmap, off + n);
2679 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2680 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2681 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2685 /* Turn the n dimensions of type type, starting at first
2686 * into existentially quantified variables.
2688 __isl_give isl_basic_map *isl_basic_map_project_out(
2689 __isl_take isl_basic_map *bmap,
2690 enum isl_dim_type type, unsigned first, unsigned n)
2703 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2704 return isl_basic_map_remove_dims(bmap, type, first, n);
2706 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2709 bmap = move_last(bmap, type, first, n);
2710 bmap = isl_basic_map_cow(bmap);
2714 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2715 old = bmap->block2.data;
2716 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2717 (bmap->extra + n) * (1 + row_size));
2718 if (!bmap->block2.data)
2720 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2723 for (i = 0; i < n; ++i) {
2724 new_div[i] = bmap->block2.data +
2725 (bmap->extra + i) * (1 + row_size);
2726 isl_seq_clr(new_div[i], 1 + row_size);
2728 for (i = 0; i < bmap->extra; ++i)
2729 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2731 bmap->div = new_div;
2735 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2738 bmap = isl_basic_map_simplify(bmap);
2739 bmap = isl_basic_map_drop_redundant_divs(bmap);
2740 return isl_basic_map_finalize(bmap);
2742 isl_basic_map_free(bmap);
2746 /* Turn the n dimensions of type type, starting at first
2747 * into existentially quantified variables.
2749 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2750 enum isl_dim_type type, unsigned first, unsigned n)
2752 return (isl_basic_set *)isl_basic_map_project_out(
2753 (isl_basic_map *)bset, type, first, n);
2756 /* Turn the n dimensions of type type, starting at first
2757 * into existentially quantified variables.
2759 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2760 enum isl_dim_type type, unsigned first, unsigned n)
2770 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2772 map = isl_map_cow(map);
2776 map->dim = isl_dim_drop(map->dim, type, first, n);
2780 for (i = 0; i < map->n; ++i) {
2781 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2792 /* Turn the n dimensions of type type, starting at first
2793 * into existentially quantified variables.
2795 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2796 enum isl_dim_type type, unsigned first, unsigned n)
2798 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2801 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2805 for (i = 0; i < n; ++i) {
2806 j = isl_basic_map_alloc_div(bmap);
2809 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2813 isl_basic_map_free(bmap);
2817 struct isl_basic_map *isl_basic_map_apply_range(
2818 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2820 struct isl_dim *dim_result = NULL;
2821 struct isl_basic_map *bmap;
2822 unsigned n_in, n_out, n, nparam, total, pos;
2823 struct isl_dim_map *dim_map1, *dim_map2;
2825 if (!bmap1 || !bmap2)
2828 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2829 isl_dim_copy(bmap2->dim));
2831 n_in = isl_basic_map_n_in(bmap1);
2832 n_out = isl_basic_map_n_out(bmap2);
2833 n = isl_basic_map_n_out(bmap1);
2834 nparam = isl_basic_map_n_param(bmap1);
2836 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2837 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2838 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2839 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2840 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2841 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2842 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2843 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2844 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2845 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2846 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2848 bmap = isl_basic_map_alloc_dim(dim_result,
2849 bmap1->n_div + bmap2->n_div + n,
2850 bmap1->n_eq + bmap2->n_eq,
2851 bmap1->n_ineq + bmap2->n_ineq);
2852 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2853 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2854 bmap = add_divs(bmap, n);
2855 bmap = isl_basic_map_simplify(bmap);
2856 bmap = isl_basic_map_drop_redundant_divs(bmap);
2857 return isl_basic_map_finalize(bmap);
2859 isl_basic_map_free(bmap1);
2860 isl_basic_map_free(bmap2);
2864 struct isl_basic_set *isl_basic_set_apply(
2865 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2870 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2873 return (struct isl_basic_set *)
2874 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2876 isl_basic_set_free(bset);
2877 isl_basic_map_free(bmap);
2881 struct isl_basic_map *isl_basic_map_apply_domain(
2882 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2884 if (!bmap1 || !bmap2)
2887 isl_assert(bmap1->ctx,
2888 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2889 isl_assert(bmap1->ctx,
2890 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2893 bmap1 = isl_basic_map_reverse(bmap1);
2894 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2895 return isl_basic_map_reverse(bmap1);
2897 isl_basic_map_free(bmap1);
2898 isl_basic_map_free(bmap2);
2902 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2903 * A \cap B -> f(A) + f(B)
2905 struct isl_basic_map *isl_basic_map_sum(
2906 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2908 unsigned n_in, n_out, nparam, total, pos;
2909 struct isl_basic_map *bmap = NULL;
2910 struct isl_dim_map *dim_map1, *dim_map2;
2913 if (!bmap1 || !bmap2)
2916 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2919 nparam = isl_basic_map_n_param(bmap1);
2920 n_in = isl_basic_map_n_in(bmap1);
2921 n_out = isl_basic_map_n_out(bmap1);
2923 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2924 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2925 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2926 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2927 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2928 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2929 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2930 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2931 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2932 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2933 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2935 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2936 bmap1->n_div + bmap2->n_div + 2 * n_out,
2937 bmap1->n_eq + bmap2->n_eq + n_out,
2938 bmap1->n_ineq + bmap2->n_ineq);
2939 for (i = 0; i < n_out; ++i) {
2940 int j = isl_basic_map_alloc_equality(bmap);
2943 isl_seq_clr(bmap->eq[j], 1+total);
2944 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2945 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2946 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2948 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2949 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2950 bmap = add_divs(bmap, 2 * n_out);
2952 bmap = isl_basic_map_simplify(bmap);
2953 return isl_basic_map_finalize(bmap);
2955 isl_basic_map_free(bmap);
2956 isl_basic_map_free(bmap1);
2957 isl_basic_map_free(bmap2);
2961 /* Given two maps A -> f(A) and B -> g(B), construct a map
2962 * A \cap B -> f(A) + f(B)
2964 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2966 struct isl_map *result;
2972 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2974 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2975 map1->n * map2->n, 0);
2978 for (i = 0; i < map1->n; ++i)
2979 for (j = 0; j < map2->n; ++j) {
2980 struct isl_basic_map *part;
2981 part = isl_basic_map_sum(
2982 isl_basic_map_copy(map1->p[i]),
2983 isl_basic_map_copy(map2->p[j]));
2984 if (isl_basic_map_is_empty(part))
2985 isl_basic_map_free(part);
2987 result = isl_map_add_basic_map(result, part);
3000 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
3001 __isl_take isl_set *set2)
3003 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3006 /* Given a basic map A -> f(A), construct A -> -f(A).
3008 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3013 bmap = isl_basic_map_cow(bmap);
3017 n = isl_basic_map_dim(bmap, isl_dim_out);
3018 off = isl_basic_map_offset(bmap, isl_dim_out);
3019 for (i = 0; i < bmap->n_eq; ++i)
3020 for (j = 0; j < n; ++j)
3021 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3022 for (i = 0; i < bmap->n_ineq; ++i)
3023 for (j = 0; j < n; ++j)
3024 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3025 for (i = 0; i < bmap->n_div; ++i)
3026 for (j = 0; j < n; ++j)
3027 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3028 bmap = isl_basic_map_gauss(bmap, NULL);
3029 return isl_basic_map_finalize(bmap);
3032 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3034 return isl_basic_map_neg(bset);
3037 /* Given a map A -> f(A), construct A -> -f(A).
3039 struct isl_map *isl_map_neg(struct isl_map *map)
3043 map = isl_map_cow(map);
3047 for (i = 0; i < map->n; ++i) {
3048 map->p[i] = isl_basic_map_neg(map->p[i]);
3059 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3061 return (isl_set *)isl_map_neg((isl_map *)set);
3064 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3065 * A -> floor(f(A)/d).
3067 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3070 unsigned n_in, n_out, nparam, total, pos;
3071 struct isl_basic_map *result = NULL;
3072 struct isl_dim_map *dim_map;
3078 nparam = isl_basic_map_n_param(bmap);
3079 n_in = isl_basic_map_n_in(bmap);
3080 n_out = isl_basic_map_n_out(bmap);
3082 total = nparam + n_in + n_out + bmap->n_div + n_out;
3083 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3084 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3085 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3086 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3087 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3089 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3090 bmap->n_div + n_out,
3091 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3092 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3093 result = add_divs(result, n_out);
3094 for (i = 0; i < n_out; ++i) {
3096 j = isl_basic_map_alloc_inequality(result);
3099 isl_seq_clr(result->ineq[j], 1+total);
3100 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3101 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3102 j = isl_basic_map_alloc_inequality(result);
3105 isl_seq_clr(result->ineq[j], 1+total);
3106 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3107 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3108 isl_int_sub_ui(result->ineq[j][0], d, 1);
3111 result = isl_basic_map_simplify(result);
3112 return isl_basic_map_finalize(result);
3114 isl_basic_map_free(result);
3118 /* Given a map A -> f(A) and an integer d, construct a map
3119 * A -> floor(f(A)/d).
3121 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3125 map = isl_map_cow(map);
3129 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3130 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3131 for (i = 0; i < map->n; ++i) {
3132 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3143 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3149 i = isl_basic_map_alloc_equality(bmap);
3152 nparam = isl_basic_map_n_param(bmap);
3153 n_in = isl_basic_map_n_in(bmap);
3154 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3155 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3156 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3157 return isl_basic_map_finalize(bmap);
3159 isl_basic_map_free(bmap);
3163 /* Add a constraints to "bmap" expressing i_pos < o_pos
3165 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3171 i = isl_basic_map_alloc_inequality(bmap);
3174 nparam = isl_basic_map_n_param(bmap);
3175 n_in = isl_basic_map_n_in(bmap);
3176 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3177 isl_int_set_si(bmap->ineq[i][0], -1);
3178 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3179 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3180 return isl_basic_map_finalize(bmap);
3182 isl_basic_map_free(bmap);
3186 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3188 static __isl_give isl_basic_map *var_less_or_equal(
3189 __isl_take isl_basic_map *bmap, unsigned pos)
3195 i = isl_basic_map_alloc_inequality(bmap);
3198 nparam = isl_basic_map_n_param(bmap);
3199 n_in = isl_basic_map_n_in(bmap);
3200 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3201 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3202 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3203 return isl_basic_map_finalize(bmap);
3205 isl_basic_map_free(bmap);
3209 /* Add a constraints to "bmap" expressing i_pos > o_pos
3211 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3217 i = isl_basic_map_alloc_inequality(bmap);
3220 nparam = isl_basic_map_n_param(bmap);
3221 n_in = isl_basic_map_n_in(bmap);
3222 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3223 isl_int_set_si(bmap->ineq[i][0], -1);
3224 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3225 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3226 return isl_basic_map_finalize(bmap);
3228 isl_basic_map_free(bmap);
3232 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3234 static __isl_give isl_basic_map *var_more_or_equal(
3235 __isl_take isl_basic_map *bmap, unsigned pos)
3241 i = isl_basic_map_alloc_inequality(bmap);
3244 nparam = isl_basic_map_n_param(bmap);
3245 n_in = isl_basic_map_n_in(bmap);
3246 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3247 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3248 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3249 return isl_basic_map_finalize(bmap);
3251 isl_basic_map_free(bmap);
3255 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3258 struct isl_basic_map *bmap;
3259 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3262 for (i = 0; i < n_equal && bmap; ++i)
3263 bmap = var_equal(bmap, i);
3264 return isl_basic_map_finalize(bmap);
3267 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3269 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3272 struct isl_basic_map *bmap;
3273 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3276 for (i = 0; i < pos && bmap; ++i)
3277 bmap = var_equal(bmap, i);
3279 bmap = var_less(bmap, pos);
3280 return isl_basic_map_finalize(bmap);
3283 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3285 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3286 __isl_take isl_dim *dim, unsigned pos)
3289 isl_basic_map *bmap;
3291 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3292 for (i = 0; i < pos; ++i)
3293 bmap = var_equal(bmap, i);
3294 bmap = var_less_or_equal(bmap, pos);
3295 return isl_basic_map_finalize(bmap);
3298 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3300 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3303 struct isl_basic_map *bmap;
3304 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3307 for (i = 0; i < pos && bmap; ++i)
3308 bmap = var_equal(bmap, i);
3310 bmap = var_more(bmap, pos);
3311 return isl_basic_map_finalize(bmap);
3314 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3316 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3317 __isl_take isl_dim *dim, unsigned pos)
3320 isl_basic_map *bmap;
3322 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3323 for (i = 0; i < pos; ++i)
3324 bmap = var_equal(bmap, i);
3325 bmap = var_more_or_equal(bmap, pos);
3326 return isl_basic_map_finalize(bmap);
3329 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3330 unsigned n, int equal)
3332 struct isl_map *map;
3335 if (n == 0 && equal)
3336 return isl_map_universe(dims);
3338 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3340 for (i = 0; i + 1 < n; ++i)
3341 map = isl_map_add_basic_map(map,
3342 isl_basic_map_less_at(isl_dim_copy(dims), i));
3345 map = isl_map_add_basic_map(map,
3346 isl_basic_map_less_or_equal_at(dims, n - 1));
3348 map = isl_map_add_basic_map(map,
3349 isl_basic_map_less_at(dims, n - 1));
3356 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3360 return map_lex_lte_first(dims, dims->n_out, equal);
3363 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3365 return map_lex_lte_first(dim, n, 0);
3368 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3370 return map_lex_lte_first(dim, n, 1);
3373 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3375 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3378 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3380 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3383 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3384 unsigned n, int equal)
3386 struct isl_map *map;
3389 if (n == 0 && equal)
3390 return isl_map_universe(dims);
3392 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3394 for (i = 0; i + 1 < n; ++i)
3395 map = isl_map_add_basic_map(map,
3396 isl_basic_map_more_at(isl_dim_copy(dims), i));
3399 map = isl_map_add_basic_map(map,
3400 isl_basic_map_more_or_equal_at(dims, n - 1));
3402 map = isl_map_add_basic_map(map,
3403 isl_basic_map_more_at(dims, n - 1));
3410 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3414 return map_lex_gte_first(dims, dims->n_out, equal);
3417 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3419 return map_lex_gte_first(dim, n, 0);
3422 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3424 return map_lex_gte_first(dim, n, 1);
3427 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3429 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3432 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3434 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3437 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3438 __isl_take isl_set *set2)
3441 map = isl_map_lex_le(isl_set_get_dim(set1));
3442 map = isl_map_intersect_domain(map, set1);
3443 map = isl_map_intersect_range(map, set2);
3447 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3448 __isl_take isl_set *set2)
3451 map = isl_map_lex_lt(isl_set_get_dim(set1));
3452 map = isl_map_intersect_domain(map, set1);
3453 map = isl_map_intersect_range(map, set2);
3457 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3458 __isl_take isl_set *set2)
3461 map = isl_map_lex_ge(isl_set_get_dim(set1));
3462 map = isl_map_intersect_domain(map, set1);
3463 map = isl_map_intersect_range(map, set2);
3467 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3468 __isl_take isl_set *set2)
3471 map = isl_map_lex_gt(isl_set_get_dim(set1));
3472 map = isl_map_intersect_domain(map, set1);
3473 map = isl_map_intersect_range(map, set2);
3477 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3478 __isl_take isl_map *map2)
3481 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3482 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3483 map = isl_map_apply_range(map, isl_map_reverse(map2));
3487 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3488 __isl_take isl_map *map2)
3491 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3492 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3493 map = isl_map_apply_range(map, isl_map_reverse(map2));
3497 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3498 __isl_take isl_map *map2)
3501 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3502 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3503 map = isl_map_apply_range(map, isl_map_reverse(map2));
3507 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3508 __isl_take isl_map *map2)
3511 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3512 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3513 map = isl_map_apply_range(map, isl_map_reverse(map2));
3517 struct isl_basic_map *isl_basic_map_from_basic_set(
3518 struct isl_basic_set *bset, struct isl_dim *dim)
3520 struct isl_basic_map *bmap;
3522 bset = isl_basic_set_cow(bset);
3526 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3527 isl_dim_free(bset->dim);
3528 bmap = (struct isl_basic_map *) bset;
3530 return isl_basic_map_finalize(bmap);
3532 isl_basic_set_free(bset);
3537 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3541 if (bmap->dim->n_in == 0)
3542 return (struct isl_basic_set *)bmap;
3543 bmap = isl_basic_map_cow(bmap);
3546 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3549 bmap = isl_basic_map_finalize(bmap);
3550 return (struct isl_basic_set *)bmap;
3552 isl_basic_map_free(bmap);
3556 /* For a div d = floor(f/m), add the constraints
3559 * -(f-(n-1)) + m d >= 0
3561 * Note that the second constraint is the negation of
3565 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3566 unsigned pos, isl_int *div)
3569 unsigned total = isl_basic_map_total_dim(bmap);
3571 i = isl_basic_map_alloc_inequality(bmap);
3574 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3575 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3577 j = isl_basic_map_alloc_inequality(bmap);
3580 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3581 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3582 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3586 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3587 unsigned pos, isl_int *div)
3589 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3593 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3595 unsigned total = isl_basic_map_total_dim(bmap);
3596 unsigned div_pos = total - bmap->n_div + div;
3598 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3602 struct isl_basic_set *isl_basic_map_underlying_set(
3603 struct isl_basic_map *bmap)
3607 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3609 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3610 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3611 return (struct isl_basic_set *)bmap;
3612 bmap = isl_basic_map_cow(bmap);
3615 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3618 bmap->extra -= bmap->n_div;
3620 bmap = isl_basic_map_finalize(bmap);
3621 return (struct isl_basic_set *)bmap;
3626 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3627 __isl_take isl_basic_set *bset)
3629 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3632 struct isl_basic_map *isl_basic_map_overlying_set(
3633 struct isl_basic_set *bset, struct isl_basic_map *like)
3635 struct isl_basic_map *bmap;
3636 struct isl_ctx *ctx;
3643 isl_assert(ctx, bset->n_div == 0, goto error);
3644 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3645 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3647 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3648 isl_basic_map_free(like);
3649 return (struct isl_basic_map *)bset;
3651 bset = isl_basic_set_cow(bset);
3654 total = bset->dim->n_out + bset->extra;
3655 bmap = (struct isl_basic_map *)bset;
3656 isl_dim_free(bmap->dim);
3657 bmap->dim = isl_dim_copy(like->dim);
3660 bmap->n_div = like->n_div;
3661 bmap->extra += like->n_div;
3665 ltotal = total - bmap->extra + like->extra;
3668 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3669 bmap->extra * (1 + 1 + total));
3670 if (isl_blk_is_error(bmap->block2))
3672 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3676 for (i = 0; i < bmap->extra; ++i)
3677 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3678 for (i = 0; i < like->n_div; ++i) {
3679 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3680 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3682 bmap = isl_basic_map_extend_constraints(bmap,
3683 0, 2 * like->n_div);
3684 for (i = 0; i < like->n_div; ++i) {
3685 if (isl_int_is_zero(bmap->div[i][0]))
3687 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3691 isl_basic_map_free(like);
3692 bmap = isl_basic_map_simplify(bmap);
3693 bmap = isl_basic_map_finalize(bmap);
3696 isl_basic_map_free(like);
3697 isl_basic_set_free(bset);
3701 struct isl_basic_set *isl_basic_set_from_underlying_set(
3702 struct isl_basic_set *bset, struct isl_basic_set *like)
3704 return (struct isl_basic_set *)
3705 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3708 struct isl_set *isl_set_from_underlying_set(
3709 struct isl_set *set, struct isl_basic_set *like)
3715 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3717 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3718 isl_basic_set_free(like);
3721 set = isl_set_cow(set);
3724 for (i = 0; i < set->n; ++i) {
3725 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3726 isl_basic_set_copy(like));
3730 isl_dim_free(set->dim);
3731 set->dim = isl_dim_copy(like->dim);
3734 isl_basic_set_free(like);
3737 isl_basic_set_free(like);
3742 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3746 map = isl_map_cow(map);
3749 map->dim = isl_dim_cow(map->dim);
3753 for (i = 1; i < map->n; ++i)
3754 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3756 for (i = 0; i < map->n; ++i) {
3757 map->p[i] = (struct isl_basic_map *)
3758 isl_basic_map_underlying_set(map->p[i]);
3763 map->dim = isl_dim_underlying(map->dim, 0);
3765 isl_dim_free(map->dim);
3766 map->dim = isl_dim_copy(map->p[0]->dim);
3770 return (struct isl_set *)map;
3776 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3778 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3781 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3782 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3784 bmap = isl_basic_map_cow(bmap);
3788 isl_dim_free(bmap->dim);
3791 bmap = isl_basic_map_finalize(bmap);
3795 isl_basic_map_free(bmap);
3800 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3801 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3803 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3807 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3808 __isl_take isl_dim *dim)
3812 map = isl_map_cow(map);
3816 for (i = 0; i < map->n; ++i) {
3817 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3822 isl_dim_free(map->dim);
3832 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3833 __isl_take isl_dim *dim)
3835 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3838 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3841 struct isl_basic_set *domain;
3847 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3849 n_in = isl_basic_map_n_in(bmap);
3850 n_out = isl_basic_map_n_out(bmap);
3851 domain = isl_basic_set_from_basic_map(bmap);
3852 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3854 domain = isl_basic_set_reset_dim(domain, dim);
3859 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
3863 return isl_dim_may_be_set(bmap->dim);
3866 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3870 if (isl_basic_map_may_be_set(bmap))
3872 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3875 __isl_give isl_basic_map *isl_basic_map_domain_map(
3876 __isl_take isl_basic_map *bmap)
3880 isl_basic_map *domain;
3881 int nparam, n_in, n_out;
3884 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3885 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3886 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3888 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3889 domain = isl_basic_map_universe(dim);
3891 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3892 bmap = isl_basic_map_apply_range(bmap, domain);
3893 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3895 total = isl_basic_map_total_dim(bmap);
3897 for (i = 0; i < n_in; ++i) {
3898 k = isl_basic_map_alloc_equality(bmap);
3901 isl_seq_clr(bmap->eq[k], 1 + total);
3902 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3903 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3906 bmap = isl_basic_map_gauss(bmap, NULL);
3907 return isl_basic_map_finalize(bmap);
3909 isl_basic_map_free(bmap);
3913 __isl_give isl_basic_map *isl_basic_map_range_map(
3914 __isl_take isl_basic_map *bmap)
3918 isl_basic_map *range;
3919 int nparam, n_in, n_out;
3922 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3923 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3924 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3926 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3927 range = isl_basic_map_universe(dim);
3929 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3930 bmap = isl_basic_map_apply_range(bmap, range);
3931 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3933 total = isl_basic_map_total_dim(bmap);
3935 for (i = 0; i < n_out; ++i) {
3936 k = isl_basic_map_alloc_equality(bmap);
3939 isl_seq_clr(bmap->eq[k], 1 + total);
3940 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3941 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3944 bmap = isl_basic_map_gauss(bmap, NULL);
3945 return isl_basic_map_finalize(bmap);
3947 isl_basic_map_free(bmap);
3951 int isl_map_may_be_set(__isl_keep isl_map *map)
3955 return isl_dim_may_be_set(map->dim);
3958 struct isl_set *isl_map_range(struct isl_map *map)
3961 struct isl_set *set;
3965 if (isl_map_may_be_set(map))
3966 return (isl_set *)map;
3968 map = isl_map_cow(map);
3972 set = (struct isl_set *) map;
3973 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3976 for (i = 0; i < map->n; ++i) {
3977 set->p[i] = isl_basic_map_range(map->p[i]);
3981 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3982 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3989 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3992 isl_dim *domain_dim;
3994 map = isl_map_cow(map);
3998 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3999 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4000 map->dim = isl_dim_join(map->dim, domain_dim);
4003 for (i = 0; i < map->n; ++i) {
4004 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4008 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4009 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4016 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4021 map = isl_map_cow(map);
4025 range_dim = isl_dim_range(isl_map_get_dim(map));
4026 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4027 map->dim = isl_dim_join(map->dim, range_dim);
4030 for (i = 0; i < map->n; ++i) {
4031 map->p[i] = isl_basic_map_range_map(map->p[i]);
4035 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4036 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4043 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4046 struct isl_map *map = NULL;
4048 set = isl_set_cow(set);
4051 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4052 map = (struct isl_map *)set;
4053 for (i = 0; i < set->n; ++i) {
4054 map->p[i] = isl_basic_map_from_basic_set(
4055 set->p[i], isl_dim_copy(dim));
4059 isl_dim_free(map->dim);
4068 __isl_give isl_basic_map *isl_basic_map_from_domain(
4069 __isl_take isl_basic_set *bset)
4071 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4074 __isl_give isl_basic_map *isl_basic_map_from_range(
4075 __isl_take isl_basic_set *bset)
4077 return (isl_basic_map *)bset;
4080 struct isl_map *isl_map_from_range(struct isl_set *set)
4082 return (struct isl_map *)set;
4085 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4087 return isl_map_reverse(isl_map_from_range(set));
4090 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4091 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4093 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4094 isl_basic_map_from_range(range));
4097 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4098 __isl_take isl_set *range)
4100 return isl_map_apply_range(isl_map_from_domain(domain),
4101 isl_map_from_range(range));
4104 struct isl_set *isl_set_from_map(struct isl_map *map)
4107 struct isl_set *set = NULL;
4111 map = isl_map_cow(map);
4114 map->dim = isl_dim_as_set_dim(map->dim);
4117 set = (struct isl_set *)map;
4118 for (i = 0; i < map->n; ++i) {
4119 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4129 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4131 struct isl_map *map;
4135 isl_assert(dim->ctx, n >= 0, return NULL);
4136 map = isl_alloc(dim->ctx, struct isl_map,
4137 sizeof(struct isl_map) +
4138 (n - 1) * sizeof(struct isl_basic_map *));
4142 map->ctx = dim->ctx;
4143 isl_ctx_ref(map->ctx);
4155 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4156 unsigned nparam, unsigned in, unsigned out, int n,
4159 struct isl_map *map;
4160 struct isl_dim *dims;
4162 dims = isl_dim_alloc(ctx, nparam, in, out);
4166 map = isl_map_alloc_dim(dims, n, flags);
4170 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4172 struct isl_basic_map *bmap;
4173 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4174 bmap = isl_basic_map_set_to_empty(bmap);
4178 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4180 struct isl_basic_set *bset;
4181 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4182 bset = isl_basic_set_set_to_empty(bset);
4186 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4188 struct isl_basic_map *bmap;
4191 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4192 bmap = isl_basic_map_set_to_empty(bmap);
4196 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4198 struct isl_basic_map *bmap;
4201 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4202 bmap = isl_basic_map_set_to_empty(bmap);
4206 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4208 struct isl_basic_set *bset;
4211 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4212 bset = isl_basic_set_set_to_empty(bset);
4216 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4218 struct isl_basic_map *bmap;
4219 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4220 bmap = isl_basic_map_finalize(bmap);
4224 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4226 struct isl_basic_set *bset;
4227 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4228 bset = isl_basic_set_finalize(bset);
4232 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4235 unsigned total = isl_dim_total(dim);
4236 isl_basic_map *bmap;
4238 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4239 for (i = 0; i < total; ++i) {
4240 int k = isl_basic_map_alloc_inequality(bmap);
4243 isl_seq_clr(bmap->ineq[k], 1 + total);
4244 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4248 isl_basic_map_free(bmap);
4252 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4254 return isl_basic_map_nat_universe(dim);
4257 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4259 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4262 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4264 return isl_map_nat_universe(dim);
4267 __isl_give isl_basic_map *isl_basic_map_universe_like(
4268 __isl_keep isl_basic_map *model)
4272 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4275 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4279 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4282 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4283 __isl_keep isl_set *model)
4287 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4290 struct isl_map *isl_map_empty(struct isl_dim *dim)
4292 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4295 struct isl_map *isl_map_empty_like(struct isl_map *model)
4299 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4302 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4306 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4309 struct isl_set *isl_set_empty(struct isl_dim *dim)
4311 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4314 struct isl_set *isl_set_empty_like(struct isl_set *model)
4318 return isl_set_empty(isl_dim_copy(model->dim));
4321 struct isl_map *isl_map_universe(struct isl_dim *dim)
4323 struct isl_map *map;
4326 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4327 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4331 struct isl_set *isl_set_universe(struct isl_dim *dim)
4333 struct isl_set *set;
4336 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4337 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4341 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4345 return isl_set_universe(isl_dim_copy(model->dim));
4348 struct isl_map *isl_map_dup(struct isl_map *map)
4351 struct isl_map *dup;
4355 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4356 for (i = 0; i < map->n; ++i)
4357 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4361 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4362 __isl_take isl_basic_map *bmap)
4366 if (isl_basic_map_plain_is_empty(bmap)) {
4367 isl_basic_map_free(bmap);
4370 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4371 isl_assert(map->ctx, map->n < map->size, goto error);
4372 map->p[map->n] = bmap;
4374 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4380 isl_basic_map_free(bmap);
4384 void isl_map_free(struct isl_map *map)
4394 isl_ctx_deref(map->ctx);
4395 for (i = 0; i < map->n; ++i)
4396 isl_basic_map_free(map->p[i]);
4397 isl_dim_free(map->dim);
4401 struct isl_map *isl_map_extend(struct isl_map *base,
4402 unsigned nparam, unsigned n_in, unsigned n_out)
4406 base = isl_map_cow(base);
4410 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4413 for (i = 0; i < base->n; ++i) {
4414 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4415 isl_dim_copy(base->dim), 0, 0, 0);
4425 struct isl_set *isl_set_extend(struct isl_set *base,
4426 unsigned nparam, unsigned dim)
4428 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4432 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4433 struct isl_basic_map *bmap, unsigned pos, int value)
4437 bmap = isl_basic_map_cow(bmap);
4438 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4439 j = isl_basic_map_alloc_equality(bmap);
4442 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4443 isl_int_set_si(bmap->eq[j][pos], -1);
4444 isl_int_set_si(bmap->eq[j][0], value);
4445 bmap = isl_basic_map_simplify(bmap);
4446 return isl_basic_map_finalize(bmap);
4448 isl_basic_map_free(bmap);
4452 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4453 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4457 bmap = isl_basic_map_cow(bmap);
4458 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4459 j = isl_basic_map_alloc_equality(bmap);
4462 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4463 isl_int_set_si(bmap->eq[j][pos], -1);
4464 isl_int_set(bmap->eq[j][0], value);
4465 bmap = isl_basic_map_simplify(bmap);
4466 return isl_basic_map_finalize(bmap);
4468 isl_basic_map_free(bmap);
4472 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4473 enum isl_dim_type type, unsigned pos, int value)
4477 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4478 return isl_basic_map_fix_pos_si(bmap,
4479 isl_basic_map_offset(bmap, type) + pos, value);
4481 isl_basic_map_free(bmap);
4485 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4486 enum isl_dim_type type, unsigned pos, isl_int value)
4490 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4491 return isl_basic_map_fix_pos(bmap,
4492 isl_basic_map_offset(bmap, type) + pos, value);
4494 isl_basic_map_free(bmap);
4498 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4499 enum isl_dim_type type, unsigned pos, int value)
4501 return (struct isl_basic_set *)
4502 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4506 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4507 enum isl_dim_type type, unsigned pos, isl_int value)
4509 return (struct isl_basic_set *)
4510 isl_basic_map_fix((struct isl_basic_map *)bset,
4514 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4515 unsigned input, int value)
4517 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4520 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4521 unsigned dim, int value)
4523 return (struct isl_basic_set *)
4524 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4525 isl_dim_set, dim, value);
4528 struct isl_map *isl_map_fix_si(struct isl_map *map,
4529 enum isl_dim_type type, unsigned pos, int value)
4533 map = isl_map_cow(map);
4537 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4538 for (i = 0; i < map->n; ++i) {
4539 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4543 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4550 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4551 enum isl_dim_type type, unsigned pos, int value)
4553 return (struct isl_set *)
4554 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4557 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4558 enum isl_dim_type type, unsigned pos, isl_int value)
4562 map = isl_map_cow(map);
4566 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4567 for (i = 0; i < map->n; ++i) {
4568 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4572 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4579 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4580 enum isl_dim_type type, unsigned pos, isl_int value)
4582 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4585 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4586 unsigned input, int value)
4588 return isl_map_fix_si(map, isl_dim_in, input, value);
4591 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4593 return (struct isl_set *)
4594 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4597 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4598 __isl_take isl_basic_map *bmap,
4599 enum isl_dim_type type, unsigned pos, int value)
4605 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4606 pos += isl_basic_map_offset(bmap, type);
4607 bmap = isl_basic_map_cow(bmap);
4608 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4609 j = isl_basic_map_alloc_inequality(bmap);
4612 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4613 isl_int_set_si(bmap->ineq[j][pos], 1);
4614 isl_int_set_si(bmap->ineq[j][0], -value);
4615 bmap = isl_basic_map_simplify(bmap);
4616 return isl_basic_map_finalize(bmap);
4618 isl_basic_map_free(bmap);
4622 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4623 unsigned dim, isl_int value)
4627 bset = isl_basic_set_cow(bset);
4628 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4629 j = isl_basic_set_alloc_inequality(bset);
4632 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4633 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4634 isl_int_neg(bset->ineq[j][0], value);
4635 bset = isl_basic_set_simplify(bset);
4636 return isl_basic_set_finalize(bset);
4638 isl_basic_set_free(bset);
4642 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4643 enum isl_dim_type type, unsigned pos, int value)
4647 map = isl_map_cow(map);
4651 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4652 for (i = 0; i < map->n; ++i) {
4653 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4658 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4665 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4666 enum isl_dim_type type, unsigned pos, int value)
4668 return (struct isl_set *)
4669 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4672 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4677 set = isl_set_cow(set);
4681 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4682 for (i = 0; i < set->n; ++i) {
4683 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4693 struct isl_map *isl_map_reverse(struct isl_map *map)
4697 map = isl_map_cow(map);
4701 map->dim = isl_dim_reverse(map->dim);
4704 for (i = 0; i < map->n; ++i) {
4705 map->p[i] = isl_basic_map_reverse(map->p[i]);
4709 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4716 static struct isl_map *isl_basic_map_partial_lexopt(
4717 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4718 struct isl_set **empty, int max)
4722 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4723 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4725 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4727 isl_basic_map_free(bmap);
4728 isl_basic_set_free(dom);
4734 struct isl_map *isl_basic_map_partial_lexmax(
4735 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4736 struct isl_set **empty)
4738 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4741 struct isl_map *isl_basic_map_partial_lexmin(
4742 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4743 struct isl_set **empty)
4745 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4748 struct isl_set *isl_basic_set_partial_lexmin(
4749 struct isl_basic_set *bset, struct isl_basic_set *dom,
4750 struct isl_set **empty)
4752 return (struct isl_set *)
4753 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4757 struct isl_set *isl_basic_set_partial_lexmax(
4758 struct isl_basic_set *bset, struct isl_basic_set *dom,
4759 struct isl_set **empty)
4761 return (struct isl_set *)
4762 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4766 /* Given a basic map "bmap", compute the lexicographically minimal
4767 * (or maximal) image element for each domain element in dom.
4768 * Set *empty to those elements in dom that do not have an image element.
4770 * We first make sure the basic sets in dom are disjoint and then
4771 * simply collect the results over each of the basic sets separately.
4772 * We could probably improve the efficiency a bit by moving the union
4773 * domain down into the parametric integer programming.
4775 static __isl_give isl_map *basic_map_partial_lexopt(
4776 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4777 __isl_give isl_set **empty, int max)
4780 struct isl_map *res;
4782 dom = isl_set_make_disjoint(dom);
4786 if (isl_set_plain_is_empty(dom)) {
4787 res = isl_map_empty_like_basic_map(bmap);
4788 *empty = isl_set_empty_like(dom);
4790 isl_basic_map_free(bmap);
4794 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4795 isl_basic_set_copy(dom->p[0]), empty, max);
4797 for (i = 1; i < dom->n; ++i) {
4798 struct isl_map *res_i;
4799 struct isl_set *empty_i;
4801 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4802 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4804 res = isl_map_union_disjoint(res, res_i);
4805 *empty = isl_set_union_disjoint(*empty, empty_i);
4809 isl_basic_map_free(bmap);
4814 isl_basic_map_free(bmap);
4818 /* Given a map "map", compute the lexicographically minimal
4819 * (or maximal) image element for each domain element in dom.
4820 * Set *empty to those elements in dom that do not have an image element.
4822 * We first compute the lexicographically minimal or maximal element
4823 * in the first basic map. This results in a partial solution "res"
4824 * and a subset "todo" of dom that still need to be handled.
4825 * We then consider each of the remaining maps in "map" and successively
4826 * improve both "res" and "todo".
4828 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4829 * Assume we are computing the lexicographical maximum.
4830 * We first compute the lexicographically maximal element in basic map i.
4831 * This results in a partial solution res_i and a subset todo_i.
4832 * Then we combine these results with those obtain for the first k basic maps
4833 * to obtain a result that is valid for the first k+1 basic maps.
4834 * In particular, the set where there is no solution is the set where
4835 * there is no solution for the first k basic maps and also no solution
4836 * for the ith basic map, i.e.,
4838 * todo^i = todo^k * todo_i
4840 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4841 * solutions, arbitrarily breaking ties in favor of res^k.
4842 * That is, when res^k(a) >= res_i(a), we pick res^k and
4843 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4844 * the lexicographic order.)
4845 * In practice, we compute
4847 * res^k * (res_i . "<=")
4851 * res_i * (res^k . "<")
4853 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4854 * where only one of res^k and res_i provides a solution and we simply pick
4861 * Note that we only compute these intersections when dom(res^k) intersects
4862 * dom(res_i). Otherwise, the only effect of these intersections is to
4863 * potentially break up res^k and res_i into smaller pieces.
4864 * We want to avoid such splintering as much as possible.
4865 * In fact, an earlier implementation of this function would look for
4866 * better results in the domain of res^k and for extra results in todo^k,
4867 * but this would always result in a splintering according to todo^k,
4868 * even when the domain of basic map i is disjoint from the domains of
4869 * the previous basic maps.
4871 static __isl_give isl_map *isl_map_partial_lexopt(
4872 __isl_take isl_map *map, __isl_take isl_set *dom,
4873 __isl_give isl_set **empty, int max)
4876 struct isl_map *res;
4877 struct isl_set *todo;
4882 if (isl_map_plain_is_empty(map)) {
4890 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4891 isl_set_copy(dom), &todo, max);
4893 for (i = 1; i < map->n; ++i) {
4897 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4899 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4900 isl_set_copy(dom), &todo_i, max);
4903 lt = isl_map_lex_lt(isl_dim_copy(dim));
4904 le = isl_map_lex_le(dim);
4906 lt = isl_map_lex_gt(isl_dim_copy(dim));
4907 le = isl_map_lex_ge(dim);
4909 lt = isl_map_apply_range(isl_map_copy(res), lt);
4910 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4911 le = isl_map_apply_range(isl_map_copy(res_i), le);
4912 le = isl_map_intersect(le, isl_map_copy(res));
4914 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4915 res = isl_map_intersect_domain(res,
4916 isl_set_copy(todo_i));
4917 res_i = isl_map_intersect_domain(res_i,
4918 isl_set_copy(todo));
4921 res = isl_map_union_disjoint(res, res_i);
4922 res = isl_map_union_disjoint(res, lt);
4923 res = isl_map_union_disjoint(res, le);
4925 todo = isl_set_intersect(todo, todo_i);
4945 __isl_give isl_map *isl_map_partial_lexmax(
4946 __isl_take isl_map *map, __isl_take isl_set *dom,
4947 __isl_give isl_set **empty)
4949 return isl_map_partial_lexopt(map, dom, empty, 1);
4952 __isl_give isl_map *isl_map_partial_lexmin(
4953 __isl_take isl_map *map, __isl_take isl_set *dom,
4954 __isl_give isl_set **empty)
4956 return isl_map_partial_lexopt(map, dom, empty, 0);
4959 __isl_give isl_set *isl_set_partial_lexmin(
4960 __isl_take isl_set *set, __isl_take isl_set *dom,
4961 __isl_give isl_set **empty)
4963 return (struct isl_set *)
4964 isl_map_partial_lexmin((struct isl_map *)set,
4968 __isl_give isl_set *isl_set_partial_lexmax(
4969 __isl_take isl_set *set, __isl_take isl_set *dom,
4970 __isl_give isl_set **empty)
4972 return (struct isl_set *)
4973 isl_map_partial_lexmax((struct isl_map *)set,
4977 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4979 struct isl_basic_set *dom = NULL;
4980 struct isl_dim *dom_dim;
4984 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4985 dom = isl_basic_set_universe(dom_dim);
4986 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4988 isl_basic_map_free(bmap);
4992 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4994 return isl_basic_map_lexopt(bmap, 0);
4997 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4999 return isl_basic_map_lexopt(bmap, 1);
5002 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5004 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5007 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5009 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5012 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5014 struct isl_set *dom = NULL;
5015 struct isl_dim *dom_dim;
5019 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5020 dom = isl_set_universe(dom_dim);
5021 return isl_map_partial_lexopt(map, dom, NULL, max);
5027 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5029 return isl_map_lexopt(map, 0);
5032 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5034 return isl_map_lexopt(map, 1);
5037 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5039 return (isl_set *)isl_map_lexmin((isl_map *)set);
5042 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5044 return (isl_set *)isl_map_lexmax((isl_map *)set);
5047 /* Construct a map that equates the two given dimensions in the given space.
5049 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5050 enum isl_dim_type src_type, int src_pos,
5051 enum isl_dim_type dst_type, int dst_pos)
5053 isl_basic_map *bmap;
5056 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5057 k = isl_basic_map_alloc_equality(bmap);
5060 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5061 src_pos += isl_basic_map_offset(bmap, src_type);
5062 dst_pos += isl_basic_map_offset(bmap, dst_type);
5063 isl_int_set_si(bmap->eq[k][src_pos], 1);
5064 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5066 return isl_map_from_basic_map(bmap);
5068 isl_basic_map_free(bmap);
5072 /* Extract the first and only affine expression from list
5073 * and then add it to *pwaff with the given dom.
5074 * This domain is known to be disjoint from other domains
5075 * because of the way isl_basic_set_foreach_lexmax works.
5077 static int update_dim_max(__isl_take isl_basic_set *dom,
5078 __isl_take isl_aff_list *list, void *user)
5080 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5082 isl_pw_aff **pwaff = user;
5083 isl_pw_aff *pwaff_i;
5085 if (isl_aff_list_n_aff(list) != 1)
5086 isl_die(ctx, isl_error_internal,
5087 "expecting single element list", goto error);
5089 aff = isl_aff_list_get_aff(list, 0);
5090 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5092 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5094 isl_aff_list_free(list);
5098 isl_basic_set_free(dom);
5099 isl_aff_list_free(list);
5103 /* Given a one-dimensional basic set, compute the maximum of that
5104 * dimension as an isl_pw_aff.
5106 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5107 * call update_dim_max on each leaf of the result.
5109 static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
5111 isl_dim *dim = isl_basic_set_get_dim(bset);
5115 dim = isl_dim_domain(isl_dim_from_range(dim));
5116 pwaff = isl_pw_aff_empty(dim);
5118 r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
5120 return isl_pw_aff_free(pwaff);
5125 /* Compute the maximum of the given set dimension as a function of the
5126 * parameters, but independently of the other set dimensions.
5128 * We first project the set onto the given dimension and then compute
5129 * the "lexicographic" maximum in each basic set, combining the results
5130 * using isl_pw_aff_max.
5132 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5138 map = isl_map_from_domain(set);
5139 map = isl_map_add_dims(map, isl_dim_out, 1);
5140 map = isl_map_intersect(map,
5141 equate(isl_map_get_dim(map), isl_dim_in, pos,
5143 set = isl_map_range(map);
5148 isl_dim *dim = isl_set_get_dim(set);
5149 dim = isl_dim_domain(isl_dim_from_range(dim));
5151 return isl_pw_aff_empty(dim);
5154 pwaff = basic_set_dim_max(set->p[0]);
5155 for (i = 1; i < set->n; ++i) {
5156 isl_pw_aff *pwaff_i;
5158 pwaff_i = basic_set_dim_max(set->p[i]);
5159 pwaff = isl_pw_aff_max(pwaff, pwaff_i);
5167 /* Apply a preimage specified by "mat" on the parameters of "bset".
5168 * bset is assumed to have only parameters and divs.
5170 static struct isl_basic_set *basic_set_parameter_preimage(
5171 struct isl_basic_set *bset, struct isl_mat *mat)
5178 bset->dim = isl_dim_cow(bset->dim);
5182 nparam = isl_basic_set_dim(bset, isl_dim_param);
5184 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5186 bset->dim->nparam = 0;
5187 bset->dim->n_out = nparam;
5188 bset = isl_basic_set_preimage(bset, mat);
5190 bset->dim->nparam = bset->dim->n_out;
5191 bset->dim->n_out = 0;
5196 isl_basic_set_free(bset);
5200 /* Apply a preimage specified by "mat" on the parameters of "set".
5201 * set is assumed to have only parameters and divs.
5203 static struct isl_set *set_parameter_preimage(
5204 struct isl_set *set, struct isl_mat *mat)
5206 struct isl_dim *dim = NULL;
5212 dim = isl_dim_copy(set->dim);
5213 dim = isl_dim_cow(dim);
5217 nparam = isl_set_dim(set, isl_dim_param);
5219 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5222 dim->n_out = nparam;
5223 isl_set_reset_dim(set, dim);
5224 set = isl_set_preimage(set, mat);
5227 dim = isl_dim_copy(set->dim);
5228 dim = isl_dim_cow(dim);
5231 dim->nparam = dim->n_out;
5233 isl_set_reset_dim(set, dim);
5243 /* Intersect the basic set "bset" with the affine space specified by the
5244 * equalities in "eq".
5246 static struct isl_basic_set *basic_set_append_equalities(
5247 struct isl_basic_set *bset, struct isl_mat *eq)
5255 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5260 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5261 for (i = 0; i < eq->n_row; ++i) {
5262 k = isl_basic_set_alloc_equality(bset);
5265 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5266 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5270 bset = isl_basic_set_gauss(bset, NULL);
5271 bset = isl_basic_set_finalize(bset);
5276 isl_basic_set_free(bset);
5280 /* Intersect the set "set" with the affine space specified by the
5281 * equalities in "eq".
5283 static struct isl_set *set_append_equalities(struct isl_set *set,
5291 for (i = 0; i < set->n; ++i) {
5292 set->p[i] = basic_set_append_equalities(set->p[i],
5305 /* Project the given basic set onto its parameter domain, possibly introducing
5306 * new, explicit, existential variables in the constraints.
5307 * The input has parameters and (possibly implicit) existential variables.
5308 * The output has the same parameters, but only
5309 * explicit existentially quantified variables.
5311 * The actual projection is performed by pip, but pip doesn't seem
5312 * to like equalities very much, so we first remove the equalities
5313 * among the parameters by performing a variable compression on
5314 * the parameters. Afterward, an inverse transformation is performed
5315 * and the equalities among the parameters are inserted back in.
5317 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5321 struct isl_mat *T, *T2;
5322 struct isl_set *set;
5323 unsigned nparam, n_div;
5325 bset = isl_basic_set_cow(bset);
5329 if (bset->n_eq == 0)
5330 return isl_basic_set_lexmin(bset);
5332 isl_basic_set_gauss(bset, NULL);
5334 nparam = isl_basic_set_dim(bset, isl_dim_param);
5335 n_div = isl_basic_set_dim(bset, isl_dim_div);
5337 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5338 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5341 if (i == bset->n_eq)
5342 return isl_basic_set_lexmin(bset);
5344 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5346 eq = isl_mat_cow(eq);
5347 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5348 if (T && T->n_col == 0) {
5352 bset = isl_basic_set_set_to_empty(bset);
5353 return isl_set_from_basic_set(bset);
5355 bset = basic_set_parameter_preimage(bset, T);
5357 set = isl_basic_set_lexmin(bset);
5358 set = set_parameter_preimage(set, T2);
5359 set = set_append_equalities(set, eq);
5363 /* Compute an explicit representation for all the existentially
5364 * quantified variables.
5365 * The input and output dimensions are first turned into parameters.
5366 * compute_divs then returns a map with the same parameters and
5367 * no input or output dimensions and the dimension specification
5368 * is reset to that of the input.
5370 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5372 struct isl_basic_set *bset;
5373 struct isl_set *set;
5374 struct isl_map *map;
5375 struct isl_dim *dim, *orig_dim = NULL;
5380 bmap = isl_basic_map_cow(bmap);
5384 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5385 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5386 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5387 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5391 orig_dim = bmap->dim;
5393 bset = (struct isl_basic_set *)bmap;
5395 set = parameter_compute_divs(bset);
5396 map = (struct isl_map *)set;
5397 map = isl_map_reset_dim(map, orig_dim);
5401 isl_basic_map_free(bmap);
5405 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5413 off = isl_dim_total(bmap->dim);
5414 for (i = 0; i < bmap->n_div; ++i) {
5415 if (isl_int_is_zero(bmap->div[i][0]))
5417 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5423 static int map_divs_known(__isl_keep isl_map *map)
5430 for (i = 0; i < map->n; ++i) {
5431 int known = isl_basic_map_divs_known(map->p[i]);
5439 /* If bmap contains any unknown divs, then compute explicit
5440 * expressions for them. However, this computation may be
5441 * quite expensive, so first try to remove divs that aren't
5444 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5447 struct isl_map *map;
5449 known = isl_basic_map_divs_known(bmap);
5453 return isl_map_from_basic_map(bmap);
5455 bmap = isl_basic_map_drop_redundant_divs(bmap);
5457 known = isl_basic_map_divs_known(bmap);
5461 return isl_map_from_basic_map(bmap);
5463 map = compute_divs(bmap);
5466 isl_basic_map_free(bmap);
5470 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5474 struct isl_map *res;
5481 known = map_divs_known(map);
5489 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5490 for (i = 1 ; i < map->n; ++i) {
5492 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5493 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5494 res = isl_map_union_disjoint(res, r2);
5496 res = isl_map_union(res, r2);
5503 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5505 return (struct isl_set *)
5506 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5509 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5511 return (struct isl_set *)
5512 isl_map_compute_divs((struct isl_map *)set);
5515 struct isl_set *isl_map_domain(struct isl_map *map)
5518 struct isl_set *set;
5523 map = isl_map_cow(map);
5527 set = (struct isl_set *)map;
5528 set->dim = isl_dim_domain(set->dim);
5531 for (i = 0; i < map->n; ++i) {
5532 set->p[i] = isl_basic_map_domain(map->p[i]);
5536 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5537 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5544 struct isl_map *isl_map_union_disjoint(
5545 struct isl_map *map1, struct isl_map *map2)
5549 struct isl_map *map = NULL;
5563 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5565 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5566 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5567 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5569 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5570 map1->n + map2->n, flags);
5573 for (i = 0; i < map1->n; ++i) {
5574 map = isl_map_add_basic_map(map,
5575 isl_basic_map_copy(map1->p[i]));
5579 for (i = 0; i < map2->n; ++i) {
5580 map = isl_map_add_basic_map(map,
5581 isl_basic_map_copy(map2->p[i]));
5595 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5597 map1 = isl_map_union_disjoint(map1, map2);
5601 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5605 struct isl_set *isl_set_union_disjoint(
5606 struct isl_set *set1, struct isl_set *set2)
5608 return (struct isl_set *)
5609 isl_map_union_disjoint(
5610 (struct isl_map *)set1, (struct isl_map *)set2);
5613 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5615 return (struct isl_set *)
5616 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5619 struct isl_map *isl_map_intersect_range(
5620 struct isl_map *map, struct isl_set *set)
5623 struct isl_map *result;
5629 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5630 isl_die(set->ctx, isl_error_invalid,
5631 "parameters don't match", goto error);
5633 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5634 !isl_map_compatible_range(map, set))
5635 isl_die(set->ctx, isl_error_invalid,
5636 "incompatible spaces", goto error);
5638 if (isl_set_plain_is_universe(set)) {
5643 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5644 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5645 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5647 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5648 map->n * set->n, flags);
5651 for (i = 0; i < map->n; ++i)
5652 for (j = 0; j < set->n; ++j) {
5653 result = isl_map_add_basic_map(result,
5654 isl_basic_map_intersect_range(
5655 isl_basic_map_copy(map->p[i]),
5656 isl_basic_set_copy(set->p[j])));
5669 struct isl_map *isl_map_intersect_domain(
5670 struct isl_map *map, struct isl_set *set)
5672 return isl_map_reverse(
5673 isl_map_intersect_range(isl_map_reverse(map), set));
5676 struct isl_map *isl_map_apply_domain(
5677 struct isl_map *map1, struct isl_map *map2)
5681 map1 = isl_map_reverse(map1);
5682 map1 = isl_map_apply_range(map1, map2);
5683 return isl_map_reverse(map1);
5690 struct isl_map *isl_map_apply_range(
5691 struct isl_map *map1, struct isl_map *map2)
5693 struct isl_dim *dim_result;
5694 struct isl_map *result;
5700 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5701 isl_dim_copy(map2->dim));
5703 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5706 for (i = 0; i < map1->n; ++i)
5707 for (j = 0; j < map2->n; ++j) {
5708 result = isl_map_add_basic_map(result,
5709 isl_basic_map_apply_range(
5710 isl_basic_map_copy(map1->p[i]),
5711 isl_basic_map_copy(map2->p[j])));
5717 if (result && result->n <= 1)
5718 ISL_F_SET(result, ISL_MAP_DISJOINT);
5727 * returns range - domain
5729 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5731 isl_dim *dims, *target_dim;
5732 struct isl_basic_set *bset;
5739 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5740 bmap->dim, isl_dim_out),
5742 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5743 dim = isl_basic_map_n_in(bmap);
5744 nparam = isl_basic_map_n_param(bmap);
5745 bset = isl_basic_set_from_basic_map(bmap);
5746 bset = isl_basic_set_cow(bset);
5747 dims = isl_basic_set_get_dim(bset);
5748 dims = isl_dim_add(dims, isl_dim_set, dim);
5749 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5750 bset = isl_basic_set_swap_vars(bset, 2*dim);
5751 for (i = 0; i < dim; ++i) {
5752 int j = isl_basic_map_alloc_equality(
5753 (struct isl_basic_map *)bset);
5756 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5757 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5758 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5759 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5761 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5762 bset = isl_basic_set_reset_dim(bset, target_dim);
5765 isl_basic_map_free(bmap);
5770 * returns range - domain
5772 struct isl_set *isl_map_deltas(struct isl_map *map)
5776 struct isl_set *result;
5781 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5782 map->dim, isl_dim_out),
5784 dim = isl_map_get_dim(map);
5785 dim = isl_dim_domain(dim);
5786 result = isl_set_alloc_dim(dim, map->n, 0);
5789 for (i = 0; i < map->n; ++i)
5790 result = isl_set_add_basic_set(result,
5791 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5800 * returns [domain -> range] -> range - domain
5802 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5803 __isl_take isl_basic_map *bmap)
5807 isl_basic_map *domain;
5811 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5812 isl_die(bmap->ctx, isl_error_invalid,
5813 "domain and range don't match", goto error);
5815 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5816 n = isl_basic_map_dim(bmap, isl_dim_in);
5818 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
5819 domain = isl_basic_map_universe(dim);
5821 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
5822 bmap = isl_basic_map_apply_range(bmap, domain);
5823 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
5825 total = isl_basic_map_total_dim(bmap);
5827 for (i = 0; i < n; ++i) {
5828 k = isl_basic_map_alloc_equality(bmap);
5831 isl_seq_clr(bmap->eq[k], 1 + total);
5832 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
5833 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
5834 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
5837 bmap = isl_basic_map_gauss(bmap, NULL);
5838 return isl_basic_map_finalize(bmap);
5840 isl_basic_map_free(bmap);
5845 * returns [domain -> range] -> range - domain
5847 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
5850 isl_dim *domain_dim;
5855 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
5856 isl_die(map->ctx, isl_error_invalid,
5857 "domain and range don't match", goto error);
5859 map = isl_map_cow(map);
5863 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
5864 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
5865 map->dim = isl_dim_join(map->dim, domain_dim);
5868 for (i = 0; i < map->n; ++i) {
5869 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
5873 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5880 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5882 struct isl_basic_map *bmap;
5890 nparam = dims->nparam;
5892 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5896 for (i = 0; i < dim; ++i) {
5897 int j = isl_basic_map_alloc_equality(bmap);
5900 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5901 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5902 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5904 return isl_basic_map_finalize(bmap);
5906 isl_basic_map_free(bmap);
5910 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
5914 if (dim->n_in != dim->n_out)
5915 isl_die(dim->ctx, isl_error_invalid,
5916 "number of input and output dimensions needs to be "
5917 "the same", goto error);
5918 return basic_map_identity(dim);
5924 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5926 if (!model || !model->dim)
5928 return isl_basic_map_identity(isl_dim_copy(model->dim));
5931 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
5933 return isl_map_from_basic_map(isl_basic_map_identity(dim));
5936 struct isl_map *isl_map_identity_like(struct isl_map *model)
5938 if (!model || !model->dim)
5940 return isl_map_identity(isl_dim_copy(model->dim));
5943 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5945 if (!model || !model->dim)
5947 return isl_map_identity(isl_dim_copy(model->dim));
5950 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5952 isl_dim *dim = isl_set_get_dim(set);
5954 id = isl_map_identity(isl_dim_map_from_set(dim));
5955 return isl_map_intersect_range(id, set);
5958 /* Construct a basic set with all set dimensions having only non-negative
5961 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5966 struct isl_basic_set *bset;
5970 nparam = dims->nparam;
5972 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5975 for (i = 0; i < dim; ++i) {
5976 int k = isl_basic_set_alloc_inequality(bset);
5979 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5980 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5984 isl_basic_set_free(bset);
5988 /* Construct the half-space x_pos >= 0.
5990 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5994 isl_basic_set *nonneg;
5996 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5997 k = isl_basic_set_alloc_inequality(nonneg);
6000 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
6001 isl_int_set_si(nonneg->ineq[k][pos], 1);
6003 return isl_basic_set_finalize(nonneg);
6005 isl_basic_set_free(nonneg);
6009 /* Construct the half-space x_pos <= -1.
6011 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6016 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6017 k = isl_basic_set_alloc_inequality(neg);
6020 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6021 isl_int_set_si(neg->ineq[k][0], -1);
6022 isl_int_set_si(neg->ineq[k][pos], -1);
6024 return isl_basic_set_finalize(neg);
6026 isl_basic_set_free(neg);
6030 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6031 enum isl_dim_type type, unsigned first, unsigned n)
6034 isl_basic_set *nonneg;
6042 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6044 for (i = 0; i < n; ++i) {
6045 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6046 pos(set->dim, type) + first + i);
6047 neg = neg_halfspace(isl_set_get_dim(set),
6048 pos(set->dim, type) + first + i);
6050 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6059 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6060 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6067 if (isl_set_plain_is_empty(set)) {
6072 return fn(set, signs, user);
6075 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6077 half = isl_set_intersect(half, isl_set_copy(set));
6078 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6082 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6084 half = isl_set_intersect(half, set);
6085 return foreach_orthant(half, signs, first + 1, len, fn, user);
6091 /* Call "fn" on the intersections of "set" with each of the orthants
6092 * (except for obviously empty intersections). The orthant is identified
6093 * by the signs array, with each entry having value 1 or -1 according
6094 * to the sign of the corresponding variable.
6096 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6097 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6107 if (isl_set_plain_is_empty(set))
6110 nparam = isl_set_dim(set, isl_dim_param);
6111 nvar = isl_set_dim(set, isl_dim_set);
6113 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6115 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6123 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6125 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6128 int isl_basic_map_is_subset(
6129 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6132 struct isl_map *map1;
6133 struct isl_map *map2;
6135 if (!bmap1 || !bmap2)
6138 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6139 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6141 is_subset = isl_map_is_subset(map1, map2);
6149 int isl_basic_map_is_equal(
6150 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6154 if (!bmap1 || !bmap2)
6156 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6159 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6163 int isl_basic_set_is_equal(
6164 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6166 return isl_basic_map_is_equal(
6167 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6170 int isl_map_is_empty(struct isl_map *map)
6177 for (i = 0; i < map->n; ++i) {
6178 is_empty = isl_basic_map_is_empty(map->p[i]);
6187 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6189 return map ? map->n == 0 : -1;
6192 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6194 return isl_map_plain_is_empty(map);
6197 int isl_set_plain_is_empty(struct isl_set *set)
6199 return set ? set->n == 0 : -1;
6202 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6204 return isl_set_plain_is_empty(set);
6207 int isl_set_is_empty(struct isl_set *set)
6209 return isl_map_is_empty((struct isl_map *)set);
6212 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6217 return isl_dim_equal(map1->dim, map2->dim);
6220 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6225 return isl_dim_equal(set1->dim, set2->dim);
6228 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
6234 is_subset = isl_map_is_subset(map1, map2);
6237 is_subset = isl_map_is_subset(map2, map1);
6241 int isl_basic_map_is_strict_subset(
6242 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6246 if (!bmap1 || !bmap2)
6248 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6251 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6252 if (is_subset == -1)
6257 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6263 is_subset = isl_map_is_subset(map1, map2);
6266 is_subset = isl_map_is_subset(map2, map1);
6267 if (is_subset == -1)
6272 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6274 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6277 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6281 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6284 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6288 return bset->n_eq == 0 && bset->n_ineq == 0;
6291 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6298 for (i = 0; i < map->n; ++i) {
6299 int r = isl_basic_map_is_universe(map->p[i]);
6307 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6309 return isl_map_plain_is_universe((isl_map *) set);
6312 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6314 return isl_set_plain_is_universe(set);
6317 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6319 struct isl_basic_set *bset = NULL;
6320 struct isl_vec *sample = NULL;
6327 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6330 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6331 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6332 copy = isl_basic_map_remove_redundancies(copy);
6333 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6334 isl_basic_map_free(copy);
6338 total = 1 + isl_basic_map_total_dim(bmap);
6339 if (bmap->sample && bmap->sample->size == total) {
6340 int contains = isl_basic_map_contains(bmap, bmap->sample);
6346 isl_vec_free(bmap->sample);
6347 bmap->sample = NULL;
6348 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6351 sample = isl_basic_set_sample_vec(bset);
6354 empty = sample->size == 0;
6355 isl_vec_free(bmap->sample);
6356 bmap->sample = sample;
6358 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6363 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6367 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6370 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6372 return isl_basic_map_plain_is_empty(bmap);
6375 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6379 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6382 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6384 return isl_basic_set_plain_is_empty(bset);
6387 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6389 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6392 struct isl_map *isl_basic_map_union(
6393 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6395 struct isl_map *map;
6396 if (!bmap1 || !bmap2)
6399 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6401 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6404 map = isl_map_add_basic_map(map, bmap1);
6405 map = isl_map_add_basic_map(map, bmap2);
6408 isl_basic_map_free(bmap1);
6409 isl_basic_map_free(bmap2);
6413 struct isl_set *isl_basic_set_union(
6414 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6416 return (struct isl_set *)isl_basic_map_union(
6417 (struct isl_basic_map *)bset1,
6418 (struct isl_basic_map *)bset2);
6421 /* Order divs such that any div only depends on previous divs */
6422 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6430 off = isl_dim_total(bmap->dim);
6432 for (i = 0; i < bmap->n_div; ++i) {
6434 if (isl_int_is_zero(bmap->div[i][0]))
6436 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6440 isl_basic_map_swap_div(bmap, i, i + pos);
6446 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6448 return (struct isl_basic_set *)
6449 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6452 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6459 for (i = 0; i < map->n; ++i) {
6460 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6471 /* Apply the expansion computed by isl_merge_divs.
6472 * The expansion itself is given by "exp" while the resulting
6473 * list of divs is given by "div".
6475 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6476 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6481 bset = isl_basic_set_cow(bset);
6485 if (div->n_row < bset->n_div)
6486 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6487 "not an expansion", goto error);
6489 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6490 div->n_row - bset->n_div, 0,
6491 2 * (div->n_row - bset->n_div));
6493 n_div = bset->n_div;
6494 for (i = n_div; i < div->n_row; ++i)
6495 if (isl_basic_set_alloc_div(bset) < 0)
6499 for (i = div->n_row - 1; i >= 0; --i) {
6500 if (j >= 0 && exp[j] == i) {
6502 isl_basic_map_swap_div(bset, i, j);
6505 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6506 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6514 isl_basic_set_free(bset);
6519 /* Look for a div in dst that corresponds to the div "div" in src.
6520 * The divs before "div" in src and dst are assumed to be the same.
6522 * Returns -1 if no corresponding div was found and the position
6523 * of the corresponding div in dst otherwise.
6525 static int find_div(struct isl_basic_map *dst,
6526 struct isl_basic_map *src, unsigned div)
6530 unsigned total = isl_dim_total(src->dim);
6532 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6533 for (i = div; i < dst->n_div; ++i)
6534 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6535 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6536 dst->n_div - div) == -1)
6541 struct isl_basic_map *isl_basic_map_align_divs(
6542 struct isl_basic_map *dst, struct isl_basic_map *src)
6545 unsigned total = isl_dim_total(src->dim);
6550 if (src->n_div == 0)
6553 for (i = 0; i < src->n_div; ++i)
6554 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6556 src = isl_basic_map_order_divs(src);
6557 dst = isl_basic_map_cow(dst);
6558 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6559 src->n_div, 0, 2 * src->n_div);
6562 for (i = 0; i < src->n_div; ++i) {
6563 int j = find_div(dst, src, i);
6565 j = isl_basic_map_alloc_div(dst);
6568 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6569 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6570 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6574 isl_basic_map_swap_div(dst, i, j);
6578 isl_basic_map_free(dst);
6582 struct isl_basic_set *isl_basic_set_align_divs(
6583 struct isl_basic_set *dst, struct isl_basic_set *src)
6585 return (struct isl_basic_set *)isl_basic_map_align_divs(
6586 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6589 struct isl_map *isl_map_align_divs(struct isl_map *map)
6597 map = isl_map_compute_divs(map);
6598 map = isl_map_cow(map);
6602 for (i = 1; i < map->n; ++i)
6603 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6604 for (i = 1; i < map->n; ++i)
6605 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6607 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6611 struct isl_set *isl_set_align_divs(struct isl_set *set)
6613 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6616 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6620 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6621 map = isl_map_intersect_domain(map, set);
6622 set = isl_map_range(map);
6630 /* There is no need to cow as removing empty parts doesn't change
6631 * the meaning of the set.
6633 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6640 for (i = map->n-1; i >= 0; --i) {
6641 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6643 isl_basic_map_free(map->p[i]);
6644 if (i != map->n-1) {
6645 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6646 map->p[i] = map->p[map->n-1];
6654 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6656 return (struct isl_set *)
6657 isl_map_remove_empty_parts((struct isl_map *)set);
6660 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6662 struct isl_basic_map *bmap;
6663 if (!map || map->n == 0)
6665 bmap = map->p[map->n-1];
6666 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6667 return isl_basic_map_copy(bmap);
6670 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6672 return (struct isl_basic_set *)
6673 isl_map_copy_basic_map((struct isl_map *)set);
6676 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6677 __isl_keep isl_basic_map *bmap)
6683 for (i = map->n-1; i >= 0; --i) {
6684 if (map->p[i] != bmap)
6686 map = isl_map_cow(map);
6689 isl_basic_map_free(map->p[i]);
6690 if (i != map->n-1) {
6691 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6692 map->p[i] = map->p[map->n-1];
6703 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6704 struct isl_basic_set *bset)
6706 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6707 (struct isl_basic_map *)bset);
6710 /* Given two basic sets bset1 and bset2, compute the maximal difference
6711 * between the values of dimension pos in bset1 and those in bset2
6712 * for any common value of the parameters and dimensions preceding pos.
6714 static enum isl_lp_result basic_set_maximal_difference_at(
6715 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6716 int pos, isl_int *opt)
6718 struct isl_dim *dims;
6719 struct isl_basic_map *bmap1 = NULL;
6720 struct isl_basic_map *bmap2 = NULL;
6721 struct isl_ctx *ctx;
6722 struct isl_vec *obj;
6725 unsigned dim1, dim2;
6726 enum isl_lp_result res;
6728 if (!bset1 || !bset2)
6729 return isl_lp_error;
6731 nparam = isl_basic_set_n_param(bset1);
6732 dim1 = isl_basic_set_n_dim(bset1);
6733 dim2 = isl_basic_set_n_dim(bset2);
6734 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6735 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6736 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6737 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6738 if (!bmap1 || !bmap2)
6740 bmap1 = isl_basic_map_cow(bmap1);
6741 bmap1 = isl_basic_map_extend(bmap1, nparam,
6742 pos, (dim1 - pos) + (dim2 - pos),
6743 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6744 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6747 total = isl_basic_map_total_dim(bmap1);
6749 obj = isl_vec_alloc(ctx, 1 + total);
6750 isl_seq_clr(obj->block.data, 1 + total);
6751 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6752 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6755 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6757 isl_basic_map_free(bmap1);
6761 isl_basic_map_free(bmap1);
6762 isl_basic_map_free(bmap2);
6763 return isl_lp_error;
6766 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6767 * for any common value of the parameters and dimensions preceding pos
6768 * in both basic sets, the values of dimension pos in bset1 are
6769 * smaller or larger than those in bset2.
6772 * 1 if bset1 follows bset2
6773 * -1 if bset1 precedes bset2
6774 * 0 if bset1 and bset2 are incomparable
6775 * -2 if some error occurred.
6777 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6778 struct isl_basic_set *bset2, int pos)
6781 enum isl_lp_result res;
6786 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6788 if (res == isl_lp_empty)
6790 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6791 res == isl_lp_unbounded)
6793 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6802 /* Given two basic sets bset1 and bset2, check whether
6803 * for any common value of the parameters and dimensions preceding pos
6804 * there is a value of dimension pos in bset1 that is larger
6805 * than a value of the same dimension in bset2.
6808 * 1 if there exists such a pair
6809 * 0 if there is no such pair, but there is a pair of equal values
6811 * -2 if some error occurred.
6813 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6814 __isl_keep isl_basic_set *bset2, int pos)
6817 enum isl_lp_result res;
6822 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6824 if (res == isl_lp_empty)
6826 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6827 res == isl_lp_unbounded)
6829 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6831 else if (res == isl_lp_ok)
6840 /* Given two sets set1 and set2, check whether
6841 * for any common value of the parameters and dimensions preceding pos
6842 * there is a value of dimension pos in set1 that is larger
6843 * than a value of the same dimension in set2.
6846 * 1 if there exists such a pair
6847 * 0 if there is no such pair, but there is a pair of equal values
6849 * -2 if some error occurred.
6851 int isl_set_follows_at(__isl_keep isl_set *set1,
6852 __isl_keep isl_set *set2, int pos)
6860 for (i = 0; i < set1->n; ++i)
6861 for (j = 0; j < set2->n; ++j) {
6863 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6864 if (f == 1 || f == -2)
6873 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
6874 unsigned pos, isl_int *val)
6882 total = isl_basic_map_total_dim(bmap);
6883 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6884 for (; d+1 > pos; --d)
6885 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6889 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6891 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6893 if (!isl_int_is_one(bmap->eq[i][1+d]))
6896 isl_int_neg(*val, bmap->eq[i][0]);
6902 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
6903 unsigned pos, isl_int *val)
6915 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
6918 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
6919 for (i = 1; fixed == 1 && i < map->n; ++i) {
6920 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
6921 if (fixed == 1 && isl_int_ne(tmp, v))
6925 isl_int_set(*val, v);
6931 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
6932 unsigned pos, isl_int *val)
6934 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
6938 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
6941 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
6944 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
6945 enum isl_dim_type type, unsigned pos, isl_int *val)
6947 if (pos >= isl_basic_map_dim(bmap, type))
6949 return isl_basic_map_plain_has_fixed_var(bmap,
6950 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6953 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
6954 enum isl_dim_type type, unsigned pos, isl_int *val)
6956 if (pos >= isl_map_dim(map, type))
6958 return isl_map_plain_has_fixed_var(map,
6959 map_offset(map, type) - 1 + pos, val);
6962 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
6963 enum isl_dim_type type, unsigned pos, isl_int *val)
6965 return isl_map_plain_is_fixed(map, type, pos, val);
6968 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6969 * then return this fixed value in *val.
6971 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
6972 unsigned dim, isl_int *val)
6974 return isl_basic_set_plain_has_fixed_var(bset,
6975 isl_basic_set_n_param(bset) + dim, val);
6978 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6979 * then return this fixed value in *val.
6981 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
6982 unsigned dim, isl_int *val)
6984 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6987 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
6988 unsigned dim, isl_int *val)
6990 return isl_set_plain_dim_is_fixed(set, dim, val);
6993 /* Check if input variable in has fixed value and if so and if val is not NULL,
6994 * then return this fixed value in *val.
6996 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
6997 unsigned in, isl_int *val)
6999 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
7002 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7003 * and if val is not NULL, then return this lower bound in *val.
7005 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7006 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7008 int i, i_eq = -1, i_ineq = -1;
7015 total = isl_basic_set_total_dim(bset);
7016 nparam = isl_basic_set_n_param(bset);
7017 for (i = 0; i < bset->n_eq; ++i) {
7018 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7024 for (i = 0; i < bset->n_ineq; ++i) {
7025 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7027 if (i_eq != -1 || i_ineq != -1)
7031 if (i_eq == -1 && i_ineq == -1)
7033 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7034 /* The coefficient should always be one due to normalization. */
7035 if (!isl_int_is_one(c[1+nparam+dim]))
7037 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7039 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7040 total - nparam - dim - 1) != -1)
7043 isl_int_neg(*val, c[0]);
7047 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7048 unsigned dim, isl_int *val)
7060 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7064 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7066 for (i = 1; fixed == 1 && i < set->n; ++i) {
7067 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7069 if (fixed == 1 && isl_int_ne(tmp, v))
7073 isl_int_set(*val, v);
7084 /* uset_gist depends on constraints without existentially quantified
7085 * variables sorting first.
7087 static int qsort_constraint_cmp(const void *p1, const void *p2)
7089 const struct constraint *c1 = (const struct constraint *)p1;
7090 const struct constraint *c2 = (const struct constraint *)p2;
7092 unsigned size = isl_min(c1->size, c2->size);
7094 l1 = isl_seq_last_non_zero(c1->c, size);
7095 l2 = isl_seq_last_non_zero(c2->c, size);
7100 return isl_seq_cmp(c1->c, c2->c, size);
7103 static struct isl_basic_map *isl_basic_map_sort_constraints(
7104 struct isl_basic_map *bmap)
7107 struct constraint *c;
7112 total = isl_basic_map_total_dim(bmap);
7113 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7116 for (i = 0; i < bmap->n_ineq; ++i) {
7118 c[i].c = bmap->ineq[i];
7120 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7121 for (i = 0; i < bmap->n_ineq; ++i)
7122 bmap->ineq[i] = c[i].c;
7126 isl_basic_map_free(bmap);
7130 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7131 __isl_take isl_basic_set *bset)
7133 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7134 (struct isl_basic_map *)bset);
7137 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7141 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7143 bmap = isl_basic_map_remove_redundancies(bmap);
7144 bmap = isl_basic_map_sort_constraints(bmap);
7145 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7149 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7151 return (struct isl_basic_set *)isl_basic_map_normalize(
7152 (struct isl_basic_map *)bset);
7155 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7156 const __isl_keep isl_basic_map *bmap2)
7163 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7164 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7165 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7166 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7167 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7168 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7169 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7170 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7171 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7172 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7173 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7175 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7177 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7179 if (bmap1->n_eq != bmap2->n_eq)
7180 return bmap1->n_eq - bmap2->n_eq;
7181 if (bmap1->n_ineq != bmap2->n_ineq)
7182 return bmap1->n_ineq - bmap2->n_ineq;
7183 if (bmap1->n_div != bmap2->n_div)
7184 return bmap1->n_div - bmap2->n_div;
7185 total = isl_basic_map_total_dim(bmap1);
7186 for (i = 0; i < bmap1->n_eq; ++i) {
7187 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7191 for (i = 0; i < bmap1->n_ineq; ++i) {
7192 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7196 for (i = 0; i < bmap1->n_div; ++i) {
7197 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7204 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7205 __isl_keep isl_basic_map *bmap2)
7207 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7210 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7211 __isl_keep isl_basic_set *bset2)
7213 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7214 (isl_basic_map *)bset2);
7217 static int qsort_bmap_cmp(const void *p1, const void *p2)
7219 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7220 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7222 return isl_basic_map_plain_cmp(bmap1, bmap2);
7225 /* We normalize in place, but if anything goes wrong we need
7226 * to return NULL, so we need to make sure we don't change the
7227 * meaning of any possible other copies of map.
7229 struct isl_map *isl_map_normalize(struct isl_map *map)
7232 struct isl_basic_map *bmap;
7236 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7238 for (i = 0; i < map->n; ++i) {
7239 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7242 isl_basic_map_free(map->p[i]);
7245 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7246 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7247 map = isl_map_remove_empty_parts(map);
7250 for (i = map->n - 1; i >= 1; --i) {
7251 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7253 isl_basic_map_free(map->p[i-1]);
7254 for (j = i; j < map->n; ++j)
7255 map->p[j-1] = map->p[j];
7265 struct isl_set *isl_set_normalize(struct isl_set *set)
7267 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7270 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7280 if (!isl_dim_equal(map1->dim, map2->dim))
7283 map1 = isl_map_copy(map1);
7284 map2 = isl_map_copy(map2);
7285 map1 = isl_map_normalize(map1);
7286 map2 = isl_map_normalize(map2);
7289 equal = map1->n == map2->n;
7290 for (i = 0; equal && i < map1->n; ++i) {
7291 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7304 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7306 return isl_map_plain_is_equal(map1, map2);
7309 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7311 return isl_map_plain_is_equal((struct isl_map *)set1,
7312 (struct isl_map *)set2);
7315 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7317 return isl_set_plain_is_equal(set1, set2);
7320 /* Return an interval that ranges from min to max (inclusive)
7322 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7323 isl_int min, isl_int max)
7326 struct isl_basic_set *bset = NULL;
7328 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7332 k = isl_basic_set_alloc_inequality(bset);
7335 isl_int_set_si(bset->ineq[k][1], 1);
7336 isl_int_neg(bset->ineq[k][0], min);
7338 k = isl_basic_set_alloc_inequality(bset);
7341 isl_int_set_si(bset->ineq[k][1], -1);
7342 isl_int_set(bset->ineq[k][0], max);
7346 isl_basic_set_free(bset);
7350 /* Return the Cartesian product of the basic sets in list (in the given order).
7352 __isl_give isl_basic_set *isl_basic_set_list_product(
7353 __isl_take struct isl_basic_set_list *list)
7361 struct isl_basic_set *product = NULL;
7365 isl_assert(list->ctx, list->n > 0, goto error);
7366 isl_assert(list->ctx, list->p[0], goto error);
7367 nparam = isl_basic_set_n_param(list->p[0]);
7368 dim = isl_basic_set_n_dim(list->p[0]);
7369 extra = list->p[0]->n_div;
7370 n_eq = list->p[0]->n_eq;
7371 n_ineq = list->p[0]->n_ineq;
7372 for (i = 1; i < list->n; ++i) {
7373 isl_assert(list->ctx, list->p[i], goto error);
7374 isl_assert(list->ctx,
7375 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7376 dim += isl_basic_set_n_dim(list->p[i]);
7377 extra += list->p[i]->n_div;
7378 n_eq += list->p[i]->n_eq;
7379 n_ineq += list->p[i]->n_ineq;
7381 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7386 for (i = 0; i < list->n; ++i) {
7387 isl_basic_set_add_constraints(product,
7388 isl_basic_set_copy(list->p[i]), dim);
7389 dim += isl_basic_set_n_dim(list->p[i]);
7391 isl_basic_set_list_free(list);
7394 isl_basic_set_free(product);
7395 isl_basic_set_list_free(list);
7399 struct isl_basic_map *isl_basic_map_product(
7400 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7402 struct isl_dim *dim_result = NULL;
7403 struct isl_basic_map *bmap;
7404 unsigned in1, in2, out1, out2, nparam, total, pos;
7405 struct isl_dim_map *dim_map1, *dim_map2;
7407 if (!bmap1 || !bmap2)
7410 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7411 bmap2->dim, isl_dim_param), goto error);
7412 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7413 isl_dim_copy(bmap2->dim));
7415 in1 = isl_basic_map_n_in(bmap1);
7416 in2 = isl_basic_map_n_in(bmap2);
7417 out1 = isl_basic_map_n_out(bmap1);
7418 out2 = isl_basic_map_n_out(bmap2);
7419 nparam = isl_basic_map_n_param(bmap1);
7421 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7422 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7423 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7424 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7425 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7426 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7427 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7428 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7429 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7430 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7431 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7433 bmap = isl_basic_map_alloc_dim(dim_result,
7434 bmap1->n_div + bmap2->n_div,
7435 bmap1->n_eq + bmap2->n_eq,
7436 bmap1->n_ineq + bmap2->n_ineq);
7437 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7438 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7439 bmap = isl_basic_map_simplify(bmap);
7440 return isl_basic_map_finalize(bmap);
7442 isl_basic_map_free(bmap1);
7443 isl_basic_map_free(bmap2);
7447 __isl_give isl_basic_map *isl_basic_map_flat_product(
7448 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7450 isl_basic_map *prod;
7452 prod = isl_basic_map_product(bmap1, bmap2);
7453 prod = isl_basic_map_flatten(prod);
7457 __isl_give isl_basic_set *isl_basic_set_flat_product(
7458 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7460 return isl_basic_map_flat_product(bset1, bset2);
7463 __isl_give isl_basic_map *isl_basic_map_range_product(
7464 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7466 isl_dim *dim_result = NULL;
7467 isl_basic_map *bmap;
7468 unsigned in, out1, out2, nparam, total, pos;
7469 struct isl_dim_map *dim_map1, *dim_map2;
7471 if (!bmap1 || !bmap2)
7474 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7475 isl_dim_copy(bmap2->dim));
7477 in = isl_basic_map_dim(bmap1, isl_dim_in);
7478 out1 = isl_basic_map_n_out(bmap1);
7479 out2 = isl_basic_map_n_out(bmap2);
7480 nparam = isl_basic_map_n_param(bmap1);
7482 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7483 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7484 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7485 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7486 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7487 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7488 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7489 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7490 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7491 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7492 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7494 bmap = isl_basic_map_alloc_dim(dim_result,
7495 bmap1->n_div + bmap2->n_div,
7496 bmap1->n_eq + bmap2->n_eq,
7497 bmap1->n_ineq + bmap2->n_ineq);
7498 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7499 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7500 bmap = isl_basic_map_simplify(bmap);
7501 return isl_basic_map_finalize(bmap);
7503 isl_basic_map_free(bmap1);
7504 isl_basic_map_free(bmap2);
7508 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7509 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7511 isl_basic_map *prod;
7513 prod = isl_basic_map_range_product(bmap1, bmap2);
7514 prod = isl_basic_map_flatten_range(prod);
7518 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7519 __isl_take isl_map *map2,
7520 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7521 __isl_take isl_dim *right),
7522 __isl_give isl_basic_map *(*basic_map_product)(
7523 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7526 struct isl_map *result;
7532 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7533 map2->dim, isl_dim_param), goto error);
7535 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7536 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7537 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7539 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7540 isl_dim_copy(map2->dim)),
7541 map1->n * map2->n, flags);
7544 for (i = 0; i < map1->n; ++i)
7545 for (j = 0; j < map2->n; ++j) {
7546 struct isl_basic_map *part;
7547 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7548 isl_basic_map_copy(map2->p[j]));
7549 if (isl_basic_map_is_empty(part))
7550 isl_basic_map_free(part);
7552 result = isl_map_add_basic_map(result, part);
7565 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7567 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7569 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7572 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7574 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7575 __isl_take isl_map *map2)
7579 prod = isl_map_product(map1, map2);
7580 prod = isl_map_flatten(prod);
7584 /* Given two set A and B, construct its Cartesian product A x B.
7586 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7588 return isl_map_range_product(set1, set2);
7591 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7592 __isl_take isl_set *set2)
7594 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7597 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7599 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7600 __isl_take isl_map *map2)
7602 return map_product(map1, map2, &isl_dim_range_product,
7603 &isl_basic_map_range_product);
7606 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7608 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7609 __isl_take isl_map *map2)
7613 prod = isl_map_range_product(map1, map2);
7614 prod = isl_map_flatten_range(prod);
7618 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7621 uint32_t hash = isl_hash_init();
7626 bmap = isl_basic_map_copy(bmap);
7627 bmap = isl_basic_map_normalize(bmap);
7630 total = isl_basic_map_total_dim(bmap);
7631 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7632 for (i = 0; i < bmap->n_eq; ++i) {
7634 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7635 isl_hash_hash(hash, c_hash);
7637 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7638 for (i = 0; i < bmap->n_ineq; ++i) {
7640 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7641 isl_hash_hash(hash, c_hash);
7643 isl_hash_byte(hash, bmap->n_div & 0xFF);
7644 for (i = 0; i < bmap->n_div; ++i) {
7646 if (isl_int_is_zero(bmap->div[i][0]))
7648 isl_hash_byte(hash, i & 0xFF);
7649 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7650 isl_hash_hash(hash, c_hash);
7652 isl_basic_map_free(bmap);
7656 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7658 return isl_basic_map_get_hash((isl_basic_map *)bset);
7661 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7668 map = isl_map_copy(map);
7669 map = isl_map_normalize(map);
7673 hash = isl_hash_init();
7674 for (i = 0; i < map->n; ++i) {
7676 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7677 isl_hash_hash(hash, bmap_hash);
7685 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7687 return isl_map_get_hash((isl_map *)set);
7690 /* Check if the value for dimension dim is completely determined
7691 * by the values of the other parameters and variables.
7692 * That is, check if dimension dim is involved in an equality.
7694 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7701 nparam = isl_basic_set_n_param(bset);
7702 for (i = 0; i < bset->n_eq; ++i)
7703 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7708 /* Check if the value for dimension dim is completely determined
7709 * by the values of the other parameters and variables.
7710 * That is, check if dimension dim is involved in an equality
7711 * for each of the subsets.
7713 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7719 for (i = 0; i < set->n; ++i) {
7721 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7728 int isl_set_n_basic_set(__isl_keep isl_set *set)
7730 return set ? set->n : 0;
7733 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7734 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7741 for (i = 0; i < map->n; ++i)
7742 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7748 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7749 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7756 for (i = 0; i < set->n; ++i)
7757 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7763 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7765 struct isl_dim *dim;
7770 bset = isl_basic_set_cow(bset);
7774 dim = isl_basic_set_get_dim(bset);
7775 dim = isl_dim_lift(dim, bset->n_div);
7778 isl_dim_free(bset->dim);
7780 bset->extra -= bset->n_div;
7783 bset = isl_basic_set_finalize(bset);
7787 isl_basic_set_free(bset);
7791 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7794 struct isl_dim *dim;
7797 set = isl_set_align_divs(set);
7802 set = isl_set_cow(set);
7806 n_div = set->p[0]->n_div;
7807 dim = isl_set_get_dim(set);
7808 dim = isl_dim_lift(dim, n_div);
7811 isl_dim_free(set->dim);
7814 for (i = 0; i < set->n; ++i) {
7815 set->p[i] = isl_basic_set_lift(set->p[i]);
7826 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7828 struct isl_dim *dim;
7829 struct isl_basic_map *bmap;
7836 set = isl_set_align_divs(set);
7841 dim = isl_set_get_dim(set);
7842 if (set->n == 0 || set->p[0]->n_div == 0) {
7844 return isl_map_identity(isl_dim_map_from_set(dim));
7847 n_div = set->p[0]->n_div;
7848 dim = isl_dim_map_from_set(dim);
7849 n_param = isl_dim_size(dim, isl_dim_param);
7850 n_set = isl_dim_size(dim, isl_dim_in);
7851 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7852 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7853 for (i = 0; i < n_set; ++i)
7854 bmap = var_equal(bmap, i);
7856 total = n_param + n_set + n_set + n_div;
7857 for (i = 0; i < n_div; ++i) {
7858 k = isl_basic_map_alloc_inequality(bmap);
7861 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7862 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7863 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7864 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7865 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7866 set->p[0]->div[i][0]);
7868 l = isl_basic_map_alloc_inequality(bmap);
7871 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7872 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7873 set->p[0]->div[i][0]);
7874 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7878 bmap = isl_basic_map_simplify(bmap);
7879 bmap = isl_basic_map_finalize(bmap);
7880 return isl_map_from_basic_map(bmap);
7883 isl_basic_map_free(bmap);
7887 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7895 dim = isl_basic_set_total_dim(bset);
7896 size += bset->n_eq * (1 + dim);
7897 size += bset->n_ineq * (1 + dim);
7898 size += bset->n_div * (2 + dim);
7903 int isl_set_size(__isl_keep isl_set *set)
7911 for (i = 0; i < set->n; ++i)
7912 size += isl_basic_set_size(set->p[i]);
7917 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7918 enum isl_dim_type type, unsigned pos)
7926 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7928 pos += isl_basic_map_offset(bmap, type);
7930 for (i = 0; i < bmap->n_eq; ++i)
7931 if (!isl_int_is_zero(bmap->eq[i][pos]))
7935 for (i = 0; i < bmap->n_ineq; ++i) {
7936 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7943 return lower && upper;
7946 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7947 enum isl_dim_type type, unsigned pos)
7954 for (i = 0; i < map->n; ++i) {
7956 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7957 if (bounded < 0 || !bounded)
7964 /* Return 1 if the specified dim is involved in both an upper bound
7965 * and a lower bound.
7967 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7968 enum isl_dim_type type, unsigned pos)
7970 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7973 /* For each of the "n" variables starting at "first", determine
7974 * the sign of the variable and put the results in the first "n"
7975 * elements of the array "signs".
7977 * 1 means that the variable is non-negative
7978 * -1 means that the variable is non-positive
7979 * 0 means the variable attains both positive and negative values.
7981 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7982 unsigned first, unsigned n, int *signs)
7984 isl_vec *bound = NULL;
7985 struct isl_tab *tab = NULL;
7986 struct isl_tab_undo *snap;
7989 if (!bset || !signs)
7992 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7993 tab = isl_tab_from_basic_set(bset);
7997 isl_seq_clr(bound->el, bound->size);
7998 isl_int_set_si(bound->el[0], -1);
8000 snap = isl_tab_snap(tab);
8001 for (i = 0; i < n; ++i) {
8004 isl_int_set_si(bound->el[1 + first + i], -1);
8005 if (isl_tab_add_ineq(tab, bound->el) < 0)
8008 isl_int_set_si(bound->el[1 + first + i], 0);
8009 if (isl_tab_rollback(tab, snap) < 0)
8017 isl_int_set_si(bound->el[1 + first + i], 1);
8018 if (isl_tab_add_ineq(tab, bound->el) < 0)
8021 isl_int_set_si(bound->el[1 + first + i], 0);
8022 if (isl_tab_rollback(tab, snap) < 0)
8025 signs[i] = empty ? -1 : 0;
8029 isl_vec_free(bound);
8033 isl_vec_free(bound);
8037 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8038 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8040 if (!bset || !signs)
8042 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8045 first += pos(bset->dim, type) - 1;
8046 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8049 /* Check if the given basic map is obviously single-valued.
8050 * In particular, for each output dimension, check that there is
8051 * an equality that defines the output dimension in terms of
8052 * earlier dimensions.
8054 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8064 total = 1 + isl_basic_map_total_dim(bmap);
8065 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8066 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8068 for (i = 0; i < n_out; ++i) {
8069 for (j = 0; j < bmap->n_eq; ++j) {
8070 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8072 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8073 total - (o_out + i + 1)) == -1)
8076 if (j >= bmap->n_eq)
8083 /* Check if the given map is obviously single-valued.
8085 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8094 return isl_basic_map_plain_is_single_valued(map->p[0]);
8097 /* Check if the given map is single-valued.
8102 * and check if the result is a subset of the identity mapping.
8104 int isl_map_is_single_valued(__isl_keep isl_map *map)
8111 sv = isl_map_plain_is_single_valued(map);
8115 test = isl_map_reverse(isl_map_copy(map));
8116 test = isl_map_apply_range(test, isl_map_copy(map));
8118 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8119 id = isl_map_identity(dim);
8121 sv = isl_map_is_subset(test, id);
8129 int isl_map_is_injective(__isl_keep isl_map *map)
8133 map = isl_map_copy(map);
8134 map = isl_map_reverse(map);
8135 in = isl_map_is_single_valued(map);
8141 /* Check if the given map is obviously injective.
8143 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8147 map = isl_map_copy(map);
8148 map = isl_map_reverse(map);
8149 in = isl_map_plain_is_single_valued(map);
8155 int isl_map_is_bijective(__isl_keep isl_map *map)
8159 sv = isl_map_is_single_valued(map);
8163 return isl_map_is_injective(map);
8166 int isl_set_is_singleton(__isl_keep isl_set *set)
8168 return isl_map_is_single_valued((isl_map *)set);
8171 int isl_map_is_translation(__isl_keep isl_map *map)
8176 delta = isl_map_deltas(isl_map_copy(map));
8177 ok = isl_set_is_singleton(delta);
8178 isl_set_free(delta);
8183 static int unique(isl_int *p, unsigned pos, unsigned len)
8185 if (isl_seq_first_non_zero(p, pos) != -1)
8187 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8192 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8201 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8204 nvar = isl_basic_set_dim(bset, isl_dim_set);
8205 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8206 for (j = 0; j < nvar; ++j) {
8207 int lower = 0, upper = 0;
8208 for (i = 0; i < bset->n_eq; ++i) {
8209 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8211 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8217 for (i = 0; i < bset->n_ineq; ++i) {
8218 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8220 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8222 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8227 if (!lower || !upper)
8234 int isl_set_is_box(__isl_keep isl_set *set)
8241 return isl_basic_set_is_box(set->p[0]);
8244 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8249 return isl_dim_is_wrapping(bset->dim);
8252 int isl_set_is_wrapping(__isl_keep isl_set *set)
8257 return isl_dim_is_wrapping(set->dim);
8260 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8262 bmap = isl_basic_map_cow(bmap);
8266 bmap->dim = isl_dim_wrap(bmap->dim);
8270 bmap = isl_basic_map_finalize(bmap);
8272 return (isl_basic_set *)bmap;
8274 isl_basic_map_free(bmap);
8278 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8282 map = isl_map_cow(map);
8286 for (i = 0; i < map->n; ++i) {
8287 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8291 map->dim = isl_dim_wrap(map->dim);
8295 return (isl_set *)map;
8301 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8303 bset = isl_basic_set_cow(bset);
8307 bset->dim = isl_dim_unwrap(bset->dim);
8311 bset = isl_basic_set_finalize(bset);
8313 return (isl_basic_map *)bset;
8315 isl_basic_set_free(bset);
8319 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8326 if (!isl_set_is_wrapping(set))
8327 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8330 set = isl_set_cow(set);
8334 for (i = 0; i < set->n; ++i) {
8335 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8340 set->dim = isl_dim_unwrap(set->dim);
8344 return (isl_map *)set;
8350 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8351 enum isl_dim_type type)
8356 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8359 bmap = isl_basic_map_cow(bmap);
8363 bmap->dim = isl_dim_reset(bmap->dim, type);
8367 bmap = isl_basic_map_finalize(bmap);
8371 isl_basic_map_free(bmap);
8375 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8376 enum isl_dim_type type)
8383 if (!isl_dim_is_named_or_nested(map->dim, type))
8386 map = isl_map_cow(map);
8390 for (i = 0; i < map->n; ++i) {
8391 map->p[i] = isl_basic_map_reset(map->p[i], type);
8395 map->dim = isl_dim_reset(map->dim, type);
8405 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8410 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8413 bmap = isl_basic_map_cow(bmap);
8417 bmap->dim = isl_dim_flatten(bmap->dim);
8421 bmap = isl_basic_map_finalize(bmap);
8425 isl_basic_map_free(bmap);
8429 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8431 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8434 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8435 __isl_take isl_basic_map *bmap)
8440 if (!bmap->dim->nested[1])
8443 bmap = isl_basic_map_cow(bmap);
8447 bmap->dim = isl_dim_flatten_range(bmap->dim);
8451 bmap = isl_basic_map_finalize(bmap);
8455 isl_basic_map_free(bmap);
8459 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8466 if (!map->dim->nested[0] && !map->dim->nested[1])
8469 map = isl_map_cow(map);
8473 for (i = 0; i < map->n; ++i) {
8474 map->p[i] = isl_basic_map_flatten(map->p[i]);
8478 map->dim = isl_dim_flatten(map->dim);
8488 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8490 return (isl_set *)isl_map_flatten((isl_map *)set);
8493 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8495 isl_dim *dim, *flat_dim;
8498 dim = isl_set_get_dim(set);
8499 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8500 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8501 map = isl_map_intersect_domain(map, set);
8506 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8513 if (!map->dim->nested[1])
8516 map = isl_map_cow(map);
8520 for (i = 0; i < map->n; ++i) {
8521 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8525 map->dim = isl_dim_flatten_range(map->dim);
8535 /* Reorder the dimensions of "bmap" according to the given dim_map
8536 * and set the dimension specification to "dim".
8538 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8539 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8543 bmap = isl_basic_map_cow(bmap);
8544 if (!bmap || !dim || !dim_map)
8547 res = isl_basic_map_alloc_dim(dim,
8548 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8549 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8550 res = isl_basic_map_finalize(res);
8554 isl_basic_map_free(bmap);
8559 /* Reorder the dimensions of "map" according to given reordering.
8561 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8562 __isl_take isl_reordering *r)
8565 struct isl_dim_map *dim_map;
8567 map = isl_map_cow(map);
8568 dim_map = isl_dim_map_from_reordering(r);
8569 if (!map || !r || !dim_map)
8572 for (i = 0; i < map->n; ++i) {
8573 struct isl_dim_map *dim_map_i;
8575 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8577 map->p[i] = isl_basic_map_realign(map->p[i],
8578 isl_dim_copy(r->dim), dim_map_i);
8584 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8586 isl_reordering_free(r);
8592 isl_reordering_free(r);
8596 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8597 __isl_take isl_reordering *r)
8599 return (isl_set *)isl_map_realign((isl_map *)set, r);
8602 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8603 __isl_take isl_dim *model)
8610 ctx = isl_dim_get_ctx(model);
8611 if (!isl_dim_has_named_params(model))
8612 isl_die(ctx, isl_error_invalid,
8613 "model has unnamed parameters", goto error);
8614 if (!isl_dim_has_named_params(map->dim))
8615 isl_die(ctx, isl_error_invalid,
8616 "relation has unnamed parameters", goto error);
8617 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8618 isl_reordering *exp;
8620 model = isl_dim_drop(model, isl_dim_in,
8621 0, isl_dim_size(model, isl_dim_in));
8622 model = isl_dim_drop(model, isl_dim_out,
8623 0, isl_dim_size(model, isl_dim_out));
8624 exp = isl_parameter_alignment_reordering(map->dim, model);
8625 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8626 map = isl_map_realign(map, exp);
8629 isl_dim_free(model);
8632 isl_dim_free(model);
8637 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8638 __isl_take isl_dim *model)
8640 return isl_map_align_params(set, model);
8643 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8644 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8645 enum isl_dim_type c2, enum isl_dim_type c3,
8646 enum isl_dim_type c4, enum isl_dim_type c5)
8648 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8649 struct isl_mat *mat;
8655 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8656 isl_basic_map_total_dim(bmap) + 1);
8659 for (i = 0; i < bmap->n_eq; ++i)
8660 for (j = 0, pos = 0; j < 5; ++j) {
8661 int off = isl_basic_map_offset(bmap, c[j]);
8662 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8663 isl_int_set(mat->row[i][pos],
8664 bmap->eq[i][off + k]);
8672 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8673 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8674 enum isl_dim_type c2, enum isl_dim_type c3,
8675 enum isl_dim_type c4, enum isl_dim_type c5)
8677 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8678 struct isl_mat *mat;
8684 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8685 isl_basic_map_total_dim(bmap) + 1);
8688 for (i = 0; i < bmap->n_ineq; ++i)
8689 for (j = 0, pos = 0; j < 5; ++j) {
8690 int off = isl_basic_map_offset(bmap, c[j]);
8691 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8692 isl_int_set(mat->row[i][pos],
8693 bmap->ineq[i][off + k]);
8701 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8702 __isl_take isl_dim *dim,
8703 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8704 enum isl_dim_type c2, enum isl_dim_type c3,
8705 enum isl_dim_type c4, enum isl_dim_type c5)
8707 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8708 isl_basic_map *bmap;
8714 if (!dim || !eq || !ineq)
8717 if (eq->n_col != ineq->n_col)
8718 isl_die(dim->ctx, isl_error_invalid,
8719 "equalities and inequalities matrices should have "
8720 "same number of columns", goto error);
8722 total = 1 + isl_dim_total(dim);
8724 if (eq->n_col < total)
8725 isl_die(dim->ctx, isl_error_invalid,
8726 "number of columns too small", goto error);
8728 extra = eq->n_col - total;
8730 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8731 eq->n_row, ineq->n_row);
8734 for (i = 0; i < extra; ++i) {
8735 k = isl_basic_map_alloc_div(bmap);
8738 isl_int_set_si(bmap->div[k][0], 0);
8740 for (i = 0; i < eq->n_row; ++i) {
8741 l = isl_basic_map_alloc_equality(bmap);
8744 for (j = 0, pos = 0; j < 5; ++j) {
8745 int off = isl_basic_map_offset(bmap, c[j]);
8746 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8747 isl_int_set(bmap->eq[l][off + k],
8753 for (i = 0; i < ineq->n_row; ++i) {
8754 l = isl_basic_map_alloc_inequality(bmap);
8757 for (j = 0, pos = 0; j < 5; ++j) {
8758 int off = isl_basic_map_offset(bmap, c[j]);
8759 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8760 isl_int_set(bmap->ineq[l][off + k],
8779 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8780 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8781 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8783 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8784 c1, c2, c3, c4, isl_dim_in);
8787 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8788 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8789 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8791 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8792 c1, c2, c3, c4, isl_dim_in);
8795 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8796 __isl_take isl_dim *dim,
8797 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8798 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8800 return (isl_basic_set*)
8801 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8802 c1, c2, c3, c4, isl_dim_in);
8805 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
8810 return isl_dim_can_zip(bmap->dim);
8813 int isl_map_can_zip(__isl_keep isl_map *map)
8818 return isl_dim_can_zip(map->dim);
8821 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8822 * (A -> C) -> (B -> D).
8824 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
8833 if (!isl_basic_map_can_zip(bmap))
8834 isl_die(bmap->ctx, isl_error_invalid,
8835 "basic map cannot be zipped", goto error);
8836 pos = isl_basic_map_offset(bmap, isl_dim_in) +
8837 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
8838 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
8839 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
8840 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
8843 bmap->dim = isl_dim_zip(bmap->dim);
8848 isl_basic_map_free(bmap);
8852 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8853 * (A -> C) -> (B -> D).
8855 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
8862 if (!isl_map_can_zip(map))
8863 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
8866 map = isl_map_cow(map);
8870 for (i = 0; i < map->n; ++i) {
8871 map->p[i] = isl_basic_map_zip(map->p[i]);
8876 map->dim = isl_dim_zip(map->dim);
8886 /* Construct a basic map mapping the domain of the affine expression
8887 * to a one-dimensional range prescribed by the affine expression.
8889 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
8893 isl_local_space *ls;
8894 isl_basic_map *bmap;
8899 ls = isl_aff_get_local_space(aff);
8900 ls = isl_local_space_from_domain(ls);
8901 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
8902 bmap = isl_basic_map_from_local_space(ls);
8903 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
8904 k = isl_basic_map_alloc_equality(bmap);
8908 pos = isl_basic_map_offset(bmap, isl_dim_out);
8909 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
8910 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
8911 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
8912 aff->v->size - (pos + 1));
8915 bmap = isl_basic_map_finalize(bmap);
8919 isl_basic_map_free(bmap);
8923 /* Construct a basic map mapping a domain in the given space to
8924 * to an n-dimensional range, with n the number of elements in the list,
8925 * where each coordinate in the range is prescribed by the
8926 * corresponding affine expression.
8927 * The domains of all affine expressions in the list are assumed to match
8930 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
8931 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
8935 isl_basic_map *bmap;
8940 dim = isl_dim_from_domain(domain_dim);
8941 bmap = isl_basic_map_universe(dim);
8943 for (i = 0; i < list->n; ++i) {
8945 isl_basic_map *bmap_i;
8947 aff = isl_aff_copy(list->p[i]);
8948 bmap_i = isl_basic_map_from_aff(aff);
8950 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
8953 isl_aff_list_free(list);