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)
1393 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1398 return isl_basic_map_finalize(bmap);
1401 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1402 __isl_take isl_basic_set *bset)
1404 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1405 (struct isl_basic_map *)bset);
1408 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1417 map = isl_map_cow(map);
1421 for (i = 0; i < map->n; ++i) {
1422 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1432 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1434 return isl_map_remove_divs(set);
1437 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1438 enum isl_dim_type type, unsigned first, unsigned n)
1442 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1446 bmap = isl_basic_map_eliminate_vars(bmap,
1447 isl_basic_map_offset(bmap, type) - 1 + first, n);
1450 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1452 bmap = isl_basic_map_drop(bmap, type, first, n);
1455 isl_basic_map_free(bmap);
1459 /* Return true if the definition of the given div (recursively) involves
1460 * any of the given variables.
1462 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1463 unsigned first, unsigned n)
1466 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1468 if (isl_int_is_zero(bmap->div[div][0]))
1470 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1473 for (i = bmap->n_div - 1; i >= 0; --i) {
1474 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1476 if (div_involves_vars(bmap, i, first, n))
1483 /* Remove all divs (recursively) involving any of the given dimensions
1484 * in their definitions.
1486 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1487 __isl_take isl_basic_map *bmap,
1488 enum isl_dim_type type, unsigned first, unsigned n)
1494 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1496 first += isl_basic_map_offset(bmap, type);
1498 for (i = bmap->n_div - 1; i >= 0; --i) {
1499 if (!div_involves_vars(bmap, i, first, n))
1501 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1509 isl_basic_map_free(bmap);
1513 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1514 enum isl_dim_type type, unsigned first, unsigned n)
1523 map = isl_map_cow(map);
1527 for (i = 0; i < map->n; ++i) {
1528 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1539 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1540 enum isl_dim_type type, unsigned first, unsigned n)
1542 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1546 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1547 enum isl_dim_type type, unsigned first, unsigned n)
1554 if (first + n > isl_basic_set_dim(bset, type))
1555 isl_die(bset->ctx, isl_error_invalid,
1556 "index out of bounds", return -1);
1558 first += isl_basic_set_offset(bset, type);
1559 for (i = 0; i < bset->n_eq; ++i)
1560 if (isl_seq_first_non_zero(bset->eq[i] + first, n) >= 0)
1562 for (i = 0; i < bset->n_ineq; ++i)
1563 if (isl_seq_first_non_zero(bset->ineq[i] + first, n) >= 0)
1569 int isl_set_involves_dims(__isl_keep isl_set *set,
1570 enum isl_dim_type type, unsigned first, unsigned n)
1577 if (first + n > isl_set_dim(set, type))
1578 isl_die(set->ctx, isl_error_invalid,
1579 "index out of bounds", return -1);
1581 for (i = 0; i < set->n; ++i) {
1582 int involves = isl_basic_set_involves_dims(set->p[i],
1584 if (involves < 0 || !involves)
1591 /* Return true if the definition of the given div is unknown or depends
1594 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1597 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1599 if (isl_int_is_zero(bmap->div[div][0]))
1602 for (i = bmap->n_div - 1; i >= 0; --i) {
1603 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1605 if (div_is_unknown(bmap, i))
1612 /* Remove all divs that are unknown or defined in terms of unknown divs.
1614 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1615 __isl_take isl_basic_map *bmap)
1622 for (i = bmap->n_div - 1; i >= 0; --i) {
1623 if (!div_is_unknown(bmap, i))
1625 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1631 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1640 map = isl_map_cow(map);
1644 for (i = 0; i < map->n; ++i) {
1645 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1655 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1657 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1660 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1661 __isl_take isl_basic_set *bset,
1662 enum isl_dim_type type, unsigned first, unsigned n)
1664 return (isl_basic_set *)
1665 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1668 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1669 enum isl_dim_type type, unsigned first, unsigned n)
1676 map = isl_map_cow(map);
1679 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1681 for (i = 0; i < map->n; ++i) {
1682 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1683 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1687 map = isl_map_drop(map, type, first, n);
1694 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1695 enum isl_dim_type type, unsigned first, unsigned n)
1697 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1700 /* Project out n inputs starting at first using Fourier-Motzkin */
1701 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1702 unsigned first, unsigned n)
1704 return isl_map_remove_dims(map, isl_dim_in, first, n);
1707 static void dump_term(struct isl_basic_map *bmap,
1708 isl_int c, int pos, FILE *out)
1711 unsigned in = isl_basic_map_n_in(bmap);
1712 unsigned dim = in + isl_basic_map_n_out(bmap);
1713 unsigned nparam = isl_basic_map_n_param(bmap);
1715 isl_int_print(out, c, 0);
1717 if (!isl_int_is_one(c))
1718 isl_int_print(out, c, 0);
1719 if (pos < 1 + nparam) {
1720 name = isl_dim_get_name(bmap->dim,
1721 isl_dim_param, pos - 1);
1723 fprintf(out, "%s", name);
1725 fprintf(out, "p%d", pos - 1);
1726 } else if (pos < 1 + nparam + in)
1727 fprintf(out, "i%d", pos - 1 - nparam);
1728 else if (pos < 1 + nparam + dim)
1729 fprintf(out, "o%d", pos - 1 - nparam - in);
1731 fprintf(out, "e%d", pos - 1 - nparam - dim);
1735 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1736 int sign, FILE *out)
1740 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1744 for (i = 0, first = 1; i < len; ++i) {
1745 if (isl_int_sgn(c[i]) * sign <= 0)
1748 fprintf(out, " + ");
1750 isl_int_abs(v, c[i]);
1751 dump_term(bmap, v, i, out);
1758 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1759 const char *op, FILE *out, int indent)
1763 fprintf(out, "%*s", indent, "");
1765 dump_constraint_sign(bmap, c, 1, out);
1766 fprintf(out, " %s ", op);
1767 dump_constraint_sign(bmap, c, -1, out);
1771 for (i = bmap->n_div; i < bmap->extra; ++i) {
1772 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1774 fprintf(out, "%*s", indent, "");
1775 fprintf(out, "ERROR: unused div coefficient not zero\n");
1780 static void dump_constraints(struct isl_basic_map *bmap,
1781 isl_int **c, unsigned n,
1782 const char *op, FILE *out, int indent)
1786 for (i = 0; i < n; ++i)
1787 dump_constraint(bmap, c[i], op, out, indent);
1790 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1794 unsigned total = isl_basic_map_total_dim(bmap);
1796 for (j = 0; j < 1 + total; ++j) {
1797 if (isl_int_is_zero(exp[j]))
1799 if (!first && isl_int_is_pos(exp[j]))
1801 dump_term(bmap, exp[j], j, out);
1806 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1810 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1811 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1813 for (i = 0; i < bmap->n_div; ++i) {
1814 fprintf(out, "%*s", indent, "");
1815 fprintf(out, "e%d = [(", i);
1816 dump_affine(bmap, bmap->div[i]+1, out);
1818 isl_int_print(out, bmap->div[i][0], 0);
1819 fprintf(out, "]\n");
1823 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1824 FILE *out, int indent)
1827 fprintf(out, "null basic set\n");
1831 fprintf(out, "%*s", indent, "");
1832 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1833 bset->ref, bset->dim->nparam, bset->dim->n_out,
1834 bset->extra, bset->flags);
1835 dump((struct isl_basic_map *)bset, out, indent);
1838 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1839 FILE *out, int indent)
1842 fprintf(out, "null basic map\n");
1846 fprintf(out, "%*s", indent, "");
1847 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1848 "flags: %x, n_name: %d\n",
1850 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1851 bmap->extra, bmap->flags, bmap->dim->n_name);
1852 dump(bmap, out, indent);
1855 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1860 total = isl_basic_map_total_dim(bmap);
1861 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1862 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1863 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1864 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1868 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1870 struct isl_set *set;
1874 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1875 isl_assert(dim->ctx, n >= 0, goto error);
1876 set = isl_alloc(dim->ctx, struct isl_set,
1877 sizeof(struct isl_set) +
1878 (n - 1) * sizeof(struct isl_basic_set *));
1882 set->ctx = dim->ctx;
1883 isl_ctx_ref(set->ctx);
1895 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1896 unsigned nparam, unsigned dim, int n, unsigned flags)
1898 struct isl_set *set;
1899 struct isl_dim *dims;
1901 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1905 set = isl_set_alloc_dim(dims, n, flags);
1909 /* Make sure "map" has room for at least "n" more basic maps.
1911 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1914 struct isl_map *grown = NULL;
1918 isl_assert(map->ctx, n >= 0, goto error);
1919 if (map->n + n <= map->size)
1921 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1924 for (i = 0; i < map->n; ++i) {
1925 grown->p[i] = isl_basic_map_copy(map->p[i]);
1933 isl_map_free(grown);
1938 /* Make sure "set" has room for at least "n" more basic sets.
1940 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1942 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1945 struct isl_set *isl_set_dup(struct isl_set *set)
1948 struct isl_set *dup;
1953 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1956 for (i = 0; i < set->n; ++i)
1957 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1961 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1963 return isl_map_from_basic_map(bset);
1966 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1968 struct isl_map *map;
1973 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1974 return isl_map_add_basic_map(map, bmap);
1977 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1978 __isl_take isl_basic_set *bset)
1980 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1981 (struct isl_basic_map *)bset);
1984 void isl_set_free(struct isl_set *set)
1994 isl_ctx_deref(set->ctx);
1995 for (i = 0; i < set->n; ++i)
1996 isl_basic_set_free(set->p[i]);
1997 isl_dim_free(set->dim);
2001 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2006 fprintf(out, "null set\n");
2010 fprintf(out, "%*s", indent, "");
2011 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2012 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2014 for (i = 0; i < set->n; ++i) {
2015 fprintf(out, "%*s", indent, "");
2016 fprintf(out, "basic set %d:\n", i);
2017 isl_basic_set_print_internal(set->p[i], out, indent+4);
2021 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2026 fprintf(out, "null map\n");
2030 fprintf(out, "%*s", indent, "");
2031 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2032 "flags: %x, n_name: %d\n",
2033 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2034 map->dim->n_out, map->flags, map->dim->n_name);
2035 for (i = 0; i < map->n; ++i) {
2036 fprintf(out, "%*s", indent, "");
2037 fprintf(out, "basic map %d:\n", i);
2038 isl_basic_map_print_internal(map->p[i], out, indent+4);
2042 struct isl_basic_map *isl_basic_map_intersect_domain(
2043 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2045 struct isl_basic_map *bmap_domain;
2050 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2051 bset->dim, isl_dim_param), goto error);
2053 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2054 isl_assert(bset->ctx,
2055 isl_basic_map_compatible_domain(bmap, bset), goto error);
2057 bmap = isl_basic_map_cow(bmap);
2060 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2061 bset->n_div, bset->n_eq, bset->n_ineq);
2062 bmap_domain = isl_basic_map_from_domain(bset);
2063 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2065 bmap = isl_basic_map_simplify(bmap);
2066 return isl_basic_map_finalize(bmap);
2068 isl_basic_map_free(bmap);
2069 isl_basic_set_free(bset);
2073 struct isl_basic_map *isl_basic_map_intersect_range(
2074 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2076 struct isl_basic_map *bmap_range;
2081 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2082 bset->dim, isl_dim_param), goto error);
2084 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2085 isl_assert(bset->ctx,
2086 isl_basic_map_compatible_range(bmap, bset), goto error);
2088 if (isl_basic_set_is_universe(bset)) {
2089 isl_basic_set_free(bset);
2093 bmap = isl_basic_map_cow(bmap);
2096 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2097 bset->n_div, bset->n_eq, bset->n_ineq);
2098 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2099 bmap = add_constraints(bmap, bmap_range, 0, 0);
2101 bmap = isl_basic_map_simplify(bmap);
2102 return isl_basic_map_finalize(bmap);
2104 isl_basic_map_free(bmap);
2105 isl_basic_set_free(bset);
2109 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2115 total = 1 + isl_basic_map_total_dim(bmap);
2116 if (total != vec->size)
2121 for (i = 0; i < bmap->n_eq; ++i) {
2122 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2123 if (!isl_int_is_zero(s)) {
2129 for (i = 0; i < bmap->n_ineq; ++i) {
2130 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2131 if (isl_int_is_neg(s)) {
2142 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2144 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2147 struct isl_basic_map *isl_basic_map_intersect(
2148 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2150 struct isl_vec *sample = NULL;
2152 if (!bmap1 || !bmap2)
2155 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2156 bmap2->dim, isl_dim_param), goto error);
2157 if (isl_dim_total(bmap1->dim) ==
2158 isl_dim_size(bmap1->dim, isl_dim_param) &&
2159 isl_dim_total(bmap2->dim) !=
2160 isl_dim_size(bmap2->dim, isl_dim_param))
2161 return isl_basic_map_intersect(bmap2, bmap1);
2163 if (isl_dim_total(bmap2->dim) !=
2164 isl_dim_size(bmap2->dim, isl_dim_param))
2165 isl_assert(bmap1->ctx,
2166 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2168 if (bmap1->sample &&
2169 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2170 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2171 sample = isl_vec_copy(bmap1->sample);
2172 else if (bmap2->sample &&
2173 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2174 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2175 sample = isl_vec_copy(bmap2->sample);
2177 bmap1 = isl_basic_map_cow(bmap1);
2180 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2181 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2182 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2185 isl_vec_free(sample);
2187 isl_vec_free(bmap1->sample);
2188 bmap1->sample = sample;
2191 bmap1 = isl_basic_map_simplify(bmap1);
2192 return isl_basic_map_finalize(bmap1);
2195 isl_vec_free(sample);
2196 isl_basic_map_free(bmap1);
2197 isl_basic_map_free(bmap2);
2201 struct isl_basic_set *isl_basic_set_intersect(
2202 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2204 return (struct isl_basic_set *)
2205 isl_basic_map_intersect(
2206 (struct isl_basic_map *)bset1,
2207 (struct isl_basic_map *)bset2);
2210 /* Special case of isl_map_intersect, where both map1 and map2
2211 * are convex, without any divs and such that either map1 or map2
2212 * contains a single constraint. This constraint is then simply
2213 * added to the other map.
2215 static __isl_give isl_map *map_intersect_add_constraint(
2216 __isl_take isl_map *map1, __isl_take isl_map *map2)
2218 isl_assert(map1->ctx, map1->n == 1, goto error);
2219 isl_assert(map2->ctx, map1->n == 1, goto error);
2220 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2221 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2223 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2224 return isl_map_intersect(map2, map1);
2226 isl_assert(map2->ctx,
2227 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2229 map1 = isl_map_cow(map1);
2232 if (isl_map_plain_is_empty(map1)) {
2236 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2237 if (map2->p[0]->n_eq == 1)
2238 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2240 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2241 map2->p[0]->ineq[0]);
2243 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2244 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2248 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2249 isl_basic_map_free(map1->p[0]);
2262 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2265 struct isl_map *result;
2271 if (isl_map_plain_is_empty(map1) &&
2272 isl_dim_equal(map1->dim, map2->dim)) {
2276 if (isl_map_plain_is_empty(map2) &&
2277 isl_dim_equal(map1->dim, map2->dim)) {
2282 if (map1->n == 1 && map2->n == 1 &&
2283 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2284 isl_dim_equal(map1->dim, map2->dim) &&
2285 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2286 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2287 return map_intersect_add_constraint(map1, map2);
2288 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2289 map2->dim, isl_dim_param), goto error);
2290 if (isl_dim_total(map1->dim) ==
2291 isl_dim_size(map1->dim, isl_dim_param) &&
2292 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2293 return isl_map_intersect(map2, map1);
2295 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2296 isl_assert(map1->ctx,
2297 isl_dim_equal(map1->dim, map2->dim), goto error);
2299 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2300 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2301 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2303 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2304 map1->n * map2->n, flags);
2307 for (i = 0; i < map1->n; ++i)
2308 for (j = 0; j < map2->n; ++j) {
2309 struct isl_basic_map *part;
2310 part = isl_basic_map_intersect(
2311 isl_basic_map_copy(map1->p[i]),
2312 isl_basic_map_copy(map2->p[j]));
2313 if (isl_basic_map_is_empty(part))
2314 isl_basic_map_free(part);
2316 result = isl_map_add_basic_map(result, part);
2329 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2331 return (struct isl_set *)
2332 isl_map_intersect((struct isl_map *)set1,
2333 (struct isl_map *)set2);
2336 /* The current implementation of isl_map_intersect accepts intersections
2337 * with parameter domains, so we can just call that for now.
2339 __isl_give isl_map *isl_map_intersect_params(__isl_take isl_map *map,
2340 __isl_take isl_set *params)
2342 return isl_map_intersect(map, params);
2345 __isl_give isl_set *isl_set_intersect_params(__isl_take isl_set *set,
2346 __isl_take isl_set *params)
2348 return isl_map_intersect_params(set, params);
2351 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2353 struct isl_dim *dim;
2354 struct isl_basic_set *bset;
2359 bmap = isl_basic_map_cow(bmap);
2362 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2363 in = isl_basic_map_n_in(bmap);
2364 bset = isl_basic_set_from_basic_map(bmap);
2365 bset = isl_basic_set_swap_vars(bset, in);
2366 return isl_basic_map_from_basic_set(bset, dim);
2369 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2370 enum isl_dim_type type, unsigned pos, unsigned n)
2372 struct isl_dim *res_dim;
2373 struct isl_basic_map *res;
2374 struct isl_dim_map *dim_map;
2375 unsigned total, off;
2376 enum isl_dim_type t;
2384 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2386 total = isl_basic_map_total_dim(bmap) + n;
2387 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2389 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2391 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2393 unsigned size = isl_basic_map_dim(bmap, t);
2394 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2396 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2397 pos, size - pos, off + pos + n);
2399 off += isl_dim_size(res_dim, t);
2401 isl_dim_map_div(dim_map, bmap, off);
2403 res = isl_basic_map_alloc_dim(res_dim,
2404 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2405 if (isl_basic_map_is_rational(bmap))
2406 res = isl_basic_map_set_rational(res);
2407 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2408 return isl_basic_map_finalize(res);
2411 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2412 enum isl_dim_type type, unsigned n)
2416 return isl_basic_map_insert(bmap, type,
2417 isl_basic_map_dim(bmap, type), n);
2420 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2421 enum isl_dim_type type, unsigned n)
2425 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2426 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2428 isl_basic_set_free(bset);
2432 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2433 enum isl_dim_type type, unsigned pos, unsigned n)
2440 map = isl_map_cow(map);
2444 map->dim = isl_dim_insert(map->dim, type, pos, n);
2448 for (i = 0; i < map->n; ++i) {
2449 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2460 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2461 enum isl_dim_type type, unsigned pos, unsigned n)
2463 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2466 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2467 enum isl_dim_type type, unsigned n)
2471 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2474 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2475 enum isl_dim_type type, unsigned n)
2479 isl_assert(set->ctx, type != isl_dim_in, goto error);
2480 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2486 __isl_give isl_basic_map *isl_basic_map_move_dims(
2487 __isl_take isl_basic_map *bmap,
2488 enum isl_dim_type dst_type, unsigned dst_pos,
2489 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2491 struct isl_dim_map *dim_map;
2492 struct isl_basic_map *res;
2493 enum isl_dim_type t;
2494 unsigned total, off;
2501 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2504 if (dst_type == src_type && dst_pos == src_pos)
2507 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2509 if (pos(bmap->dim, dst_type) + dst_pos ==
2510 pos(bmap->dim, src_type) + src_pos +
2511 ((src_type < dst_type) ? n : 0)) {
2512 bmap = isl_basic_map_cow(bmap);
2516 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2517 src_type, src_pos, n);
2521 bmap = isl_basic_map_finalize(bmap);
2526 total = isl_basic_map_total_dim(bmap);
2527 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2530 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2531 unsigned size = isl_dim_size(bmap->dim, t);
2532 if (t == dst_type) {
2533 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2536 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2539 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2540 dst_pos, size - dst_pos, off);
2541 off += size - dst_pos;
2542 } else if (t == src_type) {
2543 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2546 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2547 src_pos + n, size - src_pos - n, off);
2548 off += size - src_pos - n;
2550 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2554 isl_dim_map_div(dim_map, bmap, off);
2556 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2557 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2558 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2560 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2561 src_type, src_pos, n);
2565 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2566 bmap = isl_basic_map_gauss(bmap, NULL);
2567 bmap = isl_basic_map_finalize(bmap);
2571 isl_basic_map_free(bmap);
2575 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2576 enum isl_dim_type dst_type, unsigned dst_pos,
2577 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2579 return (isl_basic_set *)isl_basic_map_move_dims(
2580 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2583 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2584 enum isl_dim_type dst_type, unsigned dst_pos,
2585 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2589 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2590 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2591 src_type, src_pos, n);
2597 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2598 enum isl_dim_type dst_type, unsigned dst_pos,
2599 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2608 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2611 if (dst_type == src_type && dst_pos == src_pos)
2614 isl_assert(map->ctx, dst_type != src_type, goto error);
2616 map = isl_map_cow(map);
2620 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2624 for (i = 0; i < map->n; ++i) {
2625 map->p[i] = isl_basic_map_move_dims(map->p[i],
2627 src_type, src_pos, n);
2638 /* Move the specified dimensions to the last columns right before
2639 * the divs. Don't change the dimension specification of bmap.
2640 * That's the responsibility of the caller.
2642 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2643 enum isl_dim_type type, unsigned first, unsigned n)
2645 struct isl_dim_map *dim_map;
2646 struct isl_basic_map *res;
2647 enum isl_dim_type t;
2648 unsigned total, off;
2652 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2655 total = isl_basic_map_total_dim(bmap);
2656 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2659 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2660 unsigned size = isl_dim_size(bmap->dim, t);
2662 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2665 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2666 first, n, total - bmap->n_div - n);
2667 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2668 first + n, size - (first + n), off);
2669 off += size - (first + n);
2671 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2675 isl_dim_map_div(dim_map, bmap, off + n);
2677 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2678 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2679 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2683 /* Turn the n dimensions of type type, starting at first
2684 * into existentially quantified variables.
2686 __isl_give isl_basic_map *isl_basic_map_project_out(
2687 __isl_take isl_basic_map *bmap,
2688 enum isl_dim_type type, unsigned first, unsigned n)
2701 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2702 return isl_basic_map_remove_dims(bmap, type, first, n);
2704 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2707 bmap = move_last(bmap, type, first, n);
2708 bmap = isl_basic_map_cow(bmap);
2712 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2713 old = bmap->block2.data;
2714 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2715 (bmap->extra + n) * (1 + row_size));
2716 if (!bmap->block2.data)
2718 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2721 for (i = 0; i < n; ++i) {
2722 new_div[i] = bmap->block2.data +
2723 (bmap->extra + i) * (1 + row_size);
2724 isl_seq_clr(new_div[i], 1 + row_size);
2726 for (i = 0; i < bmap->extra; ++i)
2727 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2729 bmap->div = new_div;
2733 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2736 bmap = isl_basic_map_simplify(bmap);
2737 bmap = isl_basic_map_drop_redundant_divs(bmap);
2738 return isl_basic_map_finalize(bmap);
2740 isl_basic_map_free(bmap);
2744 /* Turn the n dimensions of type type, starting at first
2745 * into existentially quantified variables.
2747 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2748 enum isl_dim_type type, unsigned first, unsigned n)
2750 return (isl_basic_set *)isl_basic_map_project_out(
2751 (isl_basic_map *)bset, type, first, n);
2754 /* Turn the n dimensions of type type, starting at first
2755 * into existentially quantified variables.
2757 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2758 enum isl_dim_type type, unsigned first, unsigned n)
2768 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2770 map = isl_map_cow(map);
2774 map->dim = isl_dim_drop(map->dim, type, first, n);
2778 for (i = 0; i < map->n; ++i) {
2779 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2790 /* Turn the n dimensions of type type, starting at first
2791 * into existentially quantified variables.
2793 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2794 enum isl_dim_type type, unsigned first, unsigned n)
2796 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2799 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2803 for (i = 0; i < n; ++i) {
2804 j = isl_basic_map_alloc_div(bmap);
2807 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2811 isl_basic_map_free(bmap);
2815 struct isl_basic_map *isl_basic_map_apply_range(
2816 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2818 struct isl_dim *dim_result = NULL;
2819 struct isl_basic_map *bmap;
2820 unsigned n_in, n_out, n, nparam, total, pos;
2821 struct isl_dim_map *dim_map1, *dim_map2;
2823 if (!bmap1 || !bmap2)
2826 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2827 isl_dim_copy(bmap2->dim));
2829 n_in = isl_basic_map_n_in(bmap1);
2830 n_out = isl_basic_map_n_out(bmap2);
2831 n = isl_basic_map_n_out(bmap1);
2832 nparam = isl_basic_map_n_param(bmap1);
2834 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2835 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2836 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2837 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2838 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2839 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2840 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2841 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2842 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2843 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2844 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2846 bmap = isl_basic_map_alloc_dim(dim_result,
2847 bmap1->n_div + bmap2->n_div + n,
2848 bmap1->n_eq + bmap2->n_eq,
2849 bmap1->n_ineq + bmap2->n_ineq);
2850 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2851 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2852 bmap = add_divs(bmap, n);
2853 bmap = isl_basic_map_simplify(bmap);
2854 bmap = isl_basic_map_drop_redundant_divs(bmap);
2855 return isl_basic_map_finalize(bmap);
2857 isl_basic_map_free(bmap1);
2858 isl_basic_map_free(bmap2);
2862 struct isl_basic_set *isl_basic_set_apply(
2863 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2868 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2871 return (struct isl_basic_set *)
2872 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2874 isl_basic_set_free(bset);
2875 isl_basic_map_free(bmap);
2879 struct isl_basic_map *isl_basic_map_apply_domain(
2880 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2882 if (!bmap1 || !bmap2)
2885 isl_assert(bmap1->ctx,
2886 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2887 isl_assert(bmap1->ctx,
2888 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2891 bmap1 = isl_basic_map_reverse(bmap1);
2892 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2893 return isl_basic_map_reverse(bmap1);
2895 isl_basic_map_free(bmap1);
2896 isl_basic_map_free(bmap2);
2900 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2901 * A \cap B -> f(A) + f(B)
2903 struct isl_basic_map *isl_basic_map_sum(
2904 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2906 unsigned n_in, n_out, nparam, total, pos;
2907 struct isl_basic_map *bmap = NULL;
2908 struct isl_dim_map *dim_map1, *dim_map2;
2911 if (!bmap1 || !bmap2)
2914 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2917 nparam = isl_basic_map_n_param(bmap1);
2918 n_in = isl_basic_map_n_in(bmap1);
2919 n_out = isl_basic_map_n_out(bmap1);
2921 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2922 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2923 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2924 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2925 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2926 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2927 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2928 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2929 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2930 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2931 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2933 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2934 bmap1->n_div + bmap2->n_div + 2 * n_out,
2935 bmap1->n_eq + bmap2->n_eq + n_out,
2936 bmap1->n_ineq + bmap2->n_ineq);
2937 for (i = 0; i < n_out; ++i) {
2938 int j = isl_basic_map_alloc_equality(bmap);
2941 isl_seq_clr(bmap->eq[j], 1+total);
2942 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2943 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2944 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2946 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2947 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2948 bmap = add_divs(bmap, 2 * n_out);
2950 bmap = isl_basic_map_simplify(bmap);
2951 return isl_basic_map_finalize(bmap);
2953 isl_basic_map_free(bmap);
2954 isl_basic_map_free(bmap1);
2955 isl_basic_map_free(bmap2);
2959 /* Given two maps A -> f(A) and B -> g(B), construct a map
2960 * A \cap B -> f(A) + f(B)
2962 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2964 struct isl_map *result;
2970 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2972 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2973 map1->n * map2->n, 0);
2976 for (i = 0; i < map1->n; ++i)
2977 for (j = 0; j < map2->n; ++j) {
2978 struct isl_basic_map *part;
2979 part = isl_basic_map_sum(
2980 isl_basic_map_copy(map1->p[i]),
2981 isl_basic_map_copy(map2->p[j]));
2982 if (isl_basic_map_is_empty(part))
2983 isl_basic_map_free(part);
2985 result = isl_map_add_basic_map(result, part);
2998 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2999 __isl_take isl_set *set2)
3001 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
3004 /* Given a basic map A -> f(A), construct A -> -f(A).
3006 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3011 bmap = isl_basic_map_cow(bmap);
3015 n = isl_basic_map_dim(bmap, isl_dim_out);
3016 off = isl_basic_map_offset(bmap, isl_dim_out);
3017 for (i = 0; i < bmap->n_eq; ++i)
3018 for (j = 0; j < n; ++j)
3019 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3020 for (i = 0; i < bmap->n_ineq; ++i)
3021 for (j = 0; j < n; ++j)
3022 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3023 for (i = 0; i < bmap->n_div; ++i)
3024 for (j = 0; j < n; ++j)
3025 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3026 return isl_basic_map_finalize(bmap);
3029 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3031 return isl_basic_map_neg(bset);
3034 /* Given a map A -> f(A), construct A -> -f(A).
3036 struct isl_map *isl_map_neg(struct isl_map *map)
3040 map = isl_map_cow(map);
3044 for (i = 0; i < map->n; ++i) {
3045 map->p[i] = isl_basic_map_neg(map->p[i]);
3056 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3058 return (isl_set *)isl_map_neg((isl_map *)set);
3061 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3062 * A -> floor(f(A)/d).
3064 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3067 unsigned n_in, n_out, nparam, total, pos;
3068 struct isl_basic_map *result = NULL;
3069 struct isl_dim_map *dim_map;
3075 nparam = isl_basic_map_n_param(bmap);
3076 n_in = isl_basic_map_n_in(bmap);
3077 n_out = isl_basic_map_n_out(bmap);
3079 total = nparam + n_in + n_out + bmap->n_div + n_out;
3080 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3081 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3082 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3083 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3084 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3086 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3087 bmap->n_div + n_out,
3088 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3089 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3090 result = add_divs(result, n_out);
3091 for (i = 0; i < n_out; ++i) {
3093 j = isl_basic_map_alloc_inequality(result);
3096 isl_seq_clr(result->ineq[j], 1+total);
3097 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3098 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3099 j = isl_basic_map_alloc_inequality(result);
3102 isl_seq_clr(result->ineq[j], 1+total);
3103 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3104 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3105 isl_int_sub_ui(result->ineq[j][0], d, 1);
3108 result = isl_basic_map_simplify(result);
3109 return isl_basic_map_finalize(result);
3111 isl_basic_map_free(result);
3115 /* Given a map A -> f(A) and an integer d, construct a map
3116 * A -> floor(f(A)/d).
3118 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3122 map = isl_map_cow(map);
3126 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3127 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3128 for (i = 0; i < map->n; ++i) {
3129 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3140 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3146 i = isl_basic_map_alloc_equality(bmap);
3149 nparam = isl_basic_map_n_param(bmap);
3150 n_in = isl_basic_map_n_in(bmap);
3151 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3152 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3153 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3154 return isl_basic_map_finalize(bmap);
3156 isl_basic_map_free(bmap);
3160 /* Add a constraints to "bmap" expressing i_pos < o_pos
3162 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3168 i = isl_basic_map_alloc_inequality(bmap);
3171 nparam = isl_basic_map_n_param(bmap);
3172 n_in = isl_basic_map_n_in(bmap);
3173 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3174 isl_int_set_si(bmap->ineq[i][0], -1);
3175 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3176 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3177 return isl_basic_map_finalize(bmap);
3179 isl_basic_map_free(bmap);
3183 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3185 static __isl_give isl_basic_map *var_less_or_equal(
3186 __isl_take isl_basic_map *bmap, unsigned pos)
3192 i = isl_basic_map_alloc_inequality(bmap);
3195 nparam = isl_basic_map_n_param(bmap);
3196 n_in = isl_basic_map_n_in(bmap);
3197 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3198 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3199 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3200 return isl_basic_map_finalize(bmap);
3202 isl_basic_map_free(bmap);
3206 /* Add a constraints to "bmap" expressing i_pos > o_pos
3208 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3214 i = isl_basic_map_alloc_inequality(bmap);
3217 nparam = isl_basic_map_n_param(bmap);
3218 n_in = isl_basic_map_n_in(bmap);
3219 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3220 isl_int_set_si(bmap->ineq[i][0], -1);
3221 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3222 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3223 return isl_basic_map_finalize(bmap);
3225 isl_basic_map_free(bmap);
3229 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3231 static __isl_give isl_basic_map *var_more_or_equal(
3232 __isl_take isl_basic_map *bmap, unsigned pos)
3238 i = isl_basic_map_alloc_inequality(bmap);
3241 nparam = isl_basic_map_n_param(bmap);
3242 n_in = isl_basic_map_n_in(bmap);
3243 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3244 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3245 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3246 return isl_basic_map_finalize(bmap);
3248 isl_basic_map_free(bmap);
3252 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3255 struct isl_basic_map *bmap;
3256 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3259 for (i = 0; i < n_equal && bmap; ++i)
3260 bmap = var_equal(bmap, i);
3261 return isl_basic_map_finalize(bmap);
3264 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3266 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3269 struct isl_basic_map *bmap;
3270 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3273 for (i = 0; i < pos && bmap; ++i)
3274 bmap = var_equal(bmap, i);
3276 bmap = var_less(bmap, pos);
3277 return isl_basic_map_finalize(bmap);
3280 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3282 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3283 __isl_take isl_dim *dim, unsigned pos)
3286 isl_basic_map *bmap;
3288 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3289 for (i = 0; i < pos; ++i)
3290 bmap = var_equal(bmap, i);
3291 bmap = var_less_or_equal(bmap, pos);
3292 return isl_basic_map_finalize(bmap);
3295 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3297 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3300 struct isl_basic_map *bmap;
3301 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3304 for (i = 0; i < pos && bmap; ++i)
3305 bmap = var_equal(bmap, i);
3307 bmap = var_more(bmap, pos);
3308 return isl_basic_map_finalize(bmap);
3311 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3313 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3314 __isl_take isl_dim *dim, unsigned pos)
3317 isl_basic_map *bmap;
3319 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3320 for (i = 0; i < pos; ++i)
3321 bmap = var_equal(bmap, i);
3322 bmap = var_more_or_equal(bmap, pos);
3323 return isl_basic_map_finalize(bmap);
3326 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3327 unsigned n, int equal)
3329 struct isl_map *map;
3332 if (n == 0 && equal)
3333 return isl_map_universe(dims);
3335 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3337 for (i = 0; i + 1 < n; ++i)
3338 map = isl_map_add_basic_map(map,
3339 isl_basic_map_less_at(isl_dim_copy(dims), i));
3342 map = isl_map_add_basic_map(map,
3343 isl_basic_map_less_or_equal_at(dims, n - 1));
3345 map = isl_map_add_basic_map(map,
3346 isl_basic_map_less_at(dims, n - 1));
3353 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3357 return map_lex_lte_first(dims, dims->n_out, equal);
3360 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3362 return map_lex_lte_first(dim, n, 0);
3365 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3367 return map_lex_lte_first(dim, n, 1);
3370 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3372 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3375 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3377 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3380 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3381 unsigned n, int equal)
3383 struct isl_map *map;
3386 if (n == 0 && equal)
3387 return isl_map_universe(dims);
3389 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3391 for (i = 0; i + 1 < n; ++i)
3392 map = isl_map_add_basic_map(map,
3393 isl_basic_map_more_at(isl_dim_copy(dims), i));
3396 map = isl_map_add_basic_map(map,
3397 isl_basic_map_more_or_equal_at(dims, n - 1));
3399 map = isl_map_add_basic_map(map,
3400 isl_basic_map_more_at(dims, n - 1));
3407 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3411 return map_lex_gte_first(dims, dims->n_out, equal);
3414 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3416 return map_lex_gte_first(dim, n, 0);
3419 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3421 return map_lex_gte_first(dim, n, 1);
3424 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3426 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3429 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3431 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3434 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3435 __isl_take isl_set *set2)
3438 map = isl_map_lex_le(isl_set_get_dim(set1));
3439 map = isl_map_intersect_domain(map, set1);
3440 map = isl_map_intersect_range(map, set2);
3444 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3445 __isl_take isl_set *set2)
3448 map = isl_map_lex_lt(isl_set_get_dim(set1));
3449 map = isl_map_intersect_domain(map, set1);
3450 map = isl_map_intersect_range(map, set2);
3454 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3455 __isl_take isl_set *set2)
3458 map = isl_map_lex_ge(isl_set_get_dim(set1));
3459 map = isl_map_intersect_domain(map, set1);
3460 map = isl_map_intersect_range(map, set2);
3464 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3465 __isl_take isl_set *set2)
3468 map = isl_map_lex_gt(isl_set_get_dim(set1));
3469 map = isl_map_intersect_domain(map, set1);
3470 map = isl_map_intersect_range(map, set2);
3474 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3475 __isl_take isl_map *map2)
3478 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3479 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3480 map = isl_map_apply_range(map, isl_map_reverse(map2));
3484 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3485 __isl_take isl_map *map2)
3488 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3489 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3490 map = isl_map_apply_range(map, isl_map_reverse(map2));
3494 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3495 __isl_take isl_map *map2)
3498 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3499 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3500 map = isl_map_apply_range(map, isl_map_reverse(map2));
3504 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3505 __isl_take isl_map *map2)
3508 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3509 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3510 map = isl_map_apply_range(map, isl_map_reverse(map2));
3514 struct isl_basic_map *isl_basic_map_from_basic_set(
3515 struct isl_basic_set *bset, struct isl_dim *dim)
3517 struct isl_basic_map *bmap;
3519 bset = isl_basic_set_cow(bset);
3523 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3524 isl_dim_free(bset->dim);
3525 bmap = (struct isl_basic_map *) bset;
3527 return isl_basic_map_finalize(bmap);
3529 isl_basic_set_free(bset);
3534 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3538 if (bmap->dim->n_in == 0)
3539 return (struct isl_basic_set *)bmap;
3540 bmap = isl_basic_map_cow(bmap);
3543 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3546 bmap = isl_basic_map_finalize(bmap);
3547 return (struct isl_basic_set *)bmap;
3549 isl_basic_map_free(bmap);
3553 /* For a div d = floor(f/m), add the constraints
3556 * -(f-(n-1)) + m d >= 0
3558 * Note that the second constraint is the negation of
3562 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3563 unsigned pos, isl_int *div)
3566 unsigned total = isl_basic_map_total_dim(bmap);
3568 i = isl_basic_map_alloc_inequality(bmap);
3571 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3572 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3574 j = isl_basic_map_alloc_inequality(bmap);
3577 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3578 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3579 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3583 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3584 unsigned pos, isl_int *div)
3586 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3590 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3592 unsigned total = isl_basic_map_total_dim(bmap);
3593 unsigned div_pos = total - bmap->n_div + div;
3595 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3599 struct isl_basic_set *isl_basic_map_underlying_set(
3600 struct isl_basic_map *bmap)
3604 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3606 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3607 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3608 return (struct isl_basic_set *)bmap;
3609 bmap = isl_basic_map_cow(bmap);
3612 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3615 bmap->extra -= bmap->n_div;
3617 bmap = isl_basic_map_finalize(bmap);
3618 return (struct isl_basic_set *)bmap;
3623 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3624 __isl_take isl_basic_set *bset)
3626 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3629 struct isl_basic_map *isl_basic_map_overlying_set(
3630 struct isl_basic_set *bset, struct isl_basic_map *like)
3632 struct isl_basic_map *bmap;
3633 struct isl_ctx *ctx;
3640 isl_assert(ctx, bset->n_div == 0, goto error);
3641 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3642 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3644 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3645 isl_basic_map_free(like);
3646 return (struct isl_basic_map *)bset;
3648 bset = isl_basic_set_cow(bset);
3651 total = bset->dim->n_out + bset->extra;
3652 bmap = (struct isl_basic_map *)bset;
3653 isl_dim_free(bmap->dim);
3654 bmap->dim = isl_dim_copy(like->dim);
3657 bmap->n_div = like->n_div;
3658 bmap->extra += like->n_div;
3662 ltotal = total - bmap->extra + like->extra;
3665 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3666 bmap->extra * (1 + 1 + total));
3667 if (isl_blk_is_error(bmap->block2))
3669 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3673 for (i = 0; i < bmap->extra; ++i)
3674 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3675 for (i = 0; i < like->n_div; ++i) {
3676 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3677 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3679 bmap = isl_basic_map_extend_constraints(bmap,
3680 0, 2 * like->n_div);
3681 for (i = 0; i < like->n_div; ++i) {
3682 if (isl_int_is_zero(bmap->div[i][0]))
3684 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3688 isl_basic_map_free(like);
3689 bmap = isl_basic_map_simplify(bmap);
3690 bmap = isl_basic_map_finalize(bmap);
3693 isl_basic_map_free(like);
3694 isl_basic_set_free(bset);
3698 struct isl_basic_set *isl_basic_set_from_underlying_set(
3699 struct isl_basic_set *bset, struct isl_basic_set *like)
3701 return (struct isl_basic_set *)
3702 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3705 struct isl_set *isl_set_from_underlying_set(
3706 struct isl_set *set, struct isl_basic_set *like)
3712 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3714 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3715 isl_basic_set_free(like);
3718 set = isl_set_cow(set);
3721 for (i = 0; i < set->n; ++i) {
3722 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3723 isl_basic_set_copy(like));
3727 isl_dim_free(set->dim);
3728 set->dim = isl_dim_copy(like->dim);
3731 isl_basic_set_free(like);
3734 isl_basic_set_free(like);
3739 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3743 map = isl_map_cow(map);
3746 map->dim = isl_dim_cow(map->dim);
3750 for (i = 1; i < map->n; ++i)
3751 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3753 for (i = 0; i < map->n; ++i) {
3754 map->p[i] = (struct isl_basic_map *)
3755 isl_basic_map_underlying_set(map->p[i]);
3760 map->dim = isl_dim_underlying(map->dim, 0);
3762 isl_dim_free(map->dim);
3763 map->dim = isl_dim_copy(map->p[0]->dim);
3767 return (struct isl_set *)map;
3773 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3775 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3778 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3779 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3781 bmap = isl_basic_map_cow(bmap);
3785 isl_dim_free(bmap->dim);
3788 bmap = isl_basic_map_finalize(bmap);
3792 isl_basic_map_free(bmap);
3797 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3798 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3800 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3804 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3805 __isl_take isl_dim *dim)
3809 map = isl_map_cow(map);
3813 for (i = 0; i < map->n; ++i) {
3814 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3819 isl_dim_free(map->dim);
3829 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3830 __isl_take isl_dim *dim)
3832 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3835 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3838 struct isl_basic_set *domain;
3844 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3846 n_in = isl_basic_map_n_in(bmap);
3847 n_out = isl_basic_map_n_out(bmap);
3848 domain = isl_basic_set_from_basic_map(bmap);
3849 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3851 domain = isl_basic_set_reset_dim(domain, dim);
3856 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
3860 return isl_dim_may_be_set(bmap->dim);
3863 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3867 if (isl_basic_map_may_be_set(bmap))
3869 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3872 __isl_give isl_basic_map *isl_basic_map_domain_map(
3873 __isl_take isl_basic_map *bmap)
3877 isl_basic_map *domain;
3878 int nparam, n_in, n_out;
3881 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3882 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3883 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3885 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3886 domain = isl_basic_map_universe(dim);
3888 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3889 bmap = isl_basic_map_apply_range(bmap, domain);
3890 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3892 total = isl_basic_map_total_dim(bmap);
3894 for (i = 0; i < n_in; ++i) {
3895 k = isl_basic_map_alloc_equality(bmap);
3898 isl_seq_clr(bmap->eq[k], 1 + total);
3899 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3900 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3903 bmap = isl_basic_map_gauss(bmap, NULL);
3904 return isl_basic_map_finalize(bmap);
3906 isl_basic_map_free(bmap);
3910 __isl_give isl_basic_map *isl_basic_map_range_map(
3911 __isl_take isl_basic_map *bmap)
3915 isl_basic_map *range;
3916 int nparam, n_in, n_out;
3919 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3920 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3921 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3923 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3924 range = isl_basic_map_universe(dim);
3926 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3927 bmap = isl_basic_map_apply_range(bmap, range);
3928 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3930 total = isl_basic_map_total_dim(bmap);
3932 for (i = 0; i < n_out; ++i) {
3933 k = isl_basic_map_alloc_equality(bmap);
3936 isl_seq_clr(bmap->eq[k], 1 + total);
3937 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3938 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3941 bmap = isl_basic_map_gauss(bmap, NULL);
3942 return isl_basic_map_finalize(bmap);
3944 isl_basic_map_free(bmap);
3948 int isl_map_may_be_set(__isl_keep isl_map *map)
3952 return isl_dim_may_be_set(map->dim);
3955 struct isl_set *isl_map_range(struct isl_map *map)
3958 struct isl_set *set;
3962 if (isl_map_may_be_set(map))
3963 return (isl_set *)map;
3965 map = isl_map_cow(map);
3969 set = (struct isl_set *) map;
3970 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3973 for (i = 0; i < map->n; ++i) {
3974 set->p[i] = isl_basic_map_range(map->p[i]);
3978 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3979 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3986 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3989 isl_dim *domain_dim;
3991 map = isl_map_cow(map);
3995 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3996 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3997 map->dim = isl_dim_join(map->dim, domain_dim);
4000 for (i = 0; i < map->n; ++i) {
4001 map->p[i] = isl_basic_map_domain_map(map->p[i]);
4005 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4006 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4013 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4018 map = isl_map_cow(map);
4022 range_dim = isl_dim_range(isl_map_get_dim(map));
4023 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4024 map->dim = isl_dim_join(map->dim, range_dim);
4027 for (i = 0; i < map->n; ++i) {
4028 map->p[i] = isl_basic_map_range_map(map->p[i]);
4032 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4033 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4040 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4043 struct isl_map *map = NULL;
4045 set = isl_set_cow(set);
4048 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4049 map = (struct isl_map *)set;
4050 for (i = 0; i < set->n; ++i) {
4051 map->p[i] = isl_basic_map_from_basic_set(
4052 set->p[i], isl_dim_copy(dim));
4056 isl_dim_free(map->dim);
4065 __isl_give isl_basic_map *isl_basic_map_from_domain(
4066 __isl_take isl_basic_set *bset)
4068 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4071 __isl_give isl_basic_map *isl_basic_map_from_range(
4072 __isl_take isl_basic_set *bset)
4074 return (isl_basic_map *)bset;
4077 struct isl_map *isl_map_from_range(struct isl_set *set)
4079 return (struct isl_map *)set;
4082 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4084 return isl_map_reverse(isl_map_from_range(set));
4087 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4088 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4090 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4091 isl_basic_map_from_range(range));
4094 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4095 __isl_take isl_set *range)
4097 return isl_map_apply_range(isl_map_from_domain(domain),
4098 isl_map_from_range(range));
4101 struct isl_set *isl_set_from_map(struct isl_map *map)
4104 struct isl_set *set = NULL;
4108 map = isl_map_cow(map);
4111 map->dim = isl_dim_as_set_dim(map->dim);
4114 set = (struct isl_set *)map;
4115 for (i = 0; i < map->n; ++i) {
4116 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4126 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4128 struct isl_map *map;
4132 isl_assert(dim->ctx, n >= 0, return NULL);
4133 map = isl_alloc(dim->ctx, struct isl_map,
4134 sizeof(struct isl_map) +
4135 (n - 1) * sizeof(struct isl_basic_map *));
4139 map->ctx = dim->ctx;
4140 isl_ctx_ref(map->ctx);
4152 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4153 unsigned nparam, unsigned in, unsigned out, int n,
4156 struct isl_map *map;
4157 struct isl_dim *dims;
4159 dims = isl_dim_alloc(ctx, nparam, in, out);
4163 map = isl_map_alloc_dim(dims, n, flags);
4167 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4169 struct isl_basic_map *bmap;
4170 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4171 bmap = isl_basic_map_set_to_empty(bmap);
4175 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4177 struct isl_basic_set *bset;
4178 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4179 bset = isl_basic_set_set_to_empty(bset);
4183 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4185 struct isl_basic_map *bmap;
4188 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4189 bmap = isl_basic_map_set_to_empty(bmap);
4193 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4195 struct isl_basic_map *bmap;
4198 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4199 bmap = isl_basic_map_set_to_empty(bmap);
4203 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4205 struct isl_basic_set *bset;
4208 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4209 bset = isl_basic_set_set_to_empty(bset);
4213 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4215 struct isl_basic_map *bmap;
4216 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4217 bmap = isl_basic_map_finalize(bmap);
4221 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4223 struct isl_basic_set *bset;
4224 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4225 bset = isl_basic_set_finalize(bset);
4229 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4232 unsigned total = isl_dim_total(dim);
4233 isl_basic_map *bmap;
4235 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4236 for (i = 0; i < total; ++i) {
4237 int k = isl_basic_map_alloc_inequality(bmap);
4240 isl_seq_clr(bmap->ineq[k], 1 + total);
4241 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4245 isl_basic_map_free(bmap);
4249 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4251 return isl_basic_map_nat_universe(dim);
4254 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4256 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4259 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4261 return isl_map_nat_universe(dim);
4264 __isl_give isl_basic_map *isl_basic_map_universe_like(
4265 __isl_keep isl_basic_map *model)
4269 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4272 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4276 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4279 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4280 __isl_keep isl_set *model)
4284 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4287 struct isl_map *isl_map_empty(struct isl_dim *dim)
4289 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4292 struct isl_map *isl_map_empty_like(struct isl_map *model)
4296 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4299 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4303 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4306 struct isl_set *isl_set_empty(struct isl_dim *dim)
4308 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4311 struct isl_set *isl_set_empty_like(struct isl_set *model)
4315 return isl_set_empty(isl_dim_copy(model->dim));
4318 struct isl_map *isl_map_universe(struct isl_dim *dim)
4320 struct isl_map *map;
4323 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4324 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4328 struct isl_set *isl_set_universe(struct isl_dim *dim)
4330 struct isl_set *set;
4333 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4334 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4338 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4342 return isl_set_universe(isl_dim_copy(model->dim));
4345 struct isl_map *isl_map_dup(struct isl_map *map)
4348 struct isl_map *dup;
4352 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4353 for (i = 0; i < map->n; ++i)
4354 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4358 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4359 __isl_take isl_basic_map *bmap)
4363 if (isl_basic_map_plain_is_empty(bmap)) {
4364 isl_basic_map_free(bmap);
4367 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4368 isl_assert(map->ctx, map->n < map->size, goto error);
4369 map->p[map->n] = bmap;
4371 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4377 isl_basic_map_free(bmap);
4381 void isl_map_free(struct isl_map *map)
4391 isl_ctx_deref(map->ctx);
4392 for (i = 0; i < map->n; ++i)
4393 isl_basic_map_free(map->p[i]);
4394 isl_dim_free(map->dim);
4398 struct isl_map *isl_map_extend(struct isl_map *base,
4399 unsigned nparam, unsigned n_in, unsigned n_out)
4403 base = isl_map_cow(base);
4407 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4410 for (i = 0; i < base->n; ++i) {
4411 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4412 isl_dim_copy(base->dim), 0, 0, 0);
4422 struct isl_set *isl_set_extend(struct isl_set *base,
4423 unsigned nparam, unsigned dim)
4425 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4429 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4430 struct isl_basic_map *bmap, unsigned pos, int value)
4434 bmap = isl_basic_map_cow(bmap);
4435 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4436 j = isl_basic_map_alloc_equality(bmap);
4439 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4440 isl_int_set_si(bmap->eq[j][pos], -1);
4441 isl_int_set_si(bmap->eq[j][0], value);
4442 bmap = isl_basic_map_simplify(bmap);
4443 return isl_basic_map_finalize(bmap);
4445 isl_basic_map_free(bmap);
4449 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4450 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4454 bmap = isl_basic_map_cow(bmap);
4455 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4456 j = isl_basic_map_alloc_equality(bmap);
4459 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4460 isl_int_set_si(bmap->eq[j][pos], -1);
4461 isl_int_set(bmap->eq[j][0], value);
4462 bmap = isl_basic_map_simplify(bmap);
4463 return isl_basic_map_finalize(bmap);
4465 isl_basic_map_free(bmap);
4469 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4470 enum isl_dim_type type, unsigned pos, int value)
4474 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4475 return isl_basic_map_fix_pos_si(bmap,
4476 isl_basic_map_offset(bmap, type) + pos, value);
4478 isl_basic_map_free(bmap);
4482 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4483 enum isl_dim_type type, unsigned pos, isl_int value)
4487 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4488 return isl_basic_map_fix_pos(bmap,
4489 isl_basic_map_offset(bmap, type) + pos, value);
4491 isl_basic_map_free(bmap);
4495 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4496 enum isl_dim_type type, unsigned pos, int value)
4498 return (struct isl_basic_set *)
4499 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4503 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4504 enum isl_dim_type type, unsigned pos, isl_int value)
4506 return (struct isl_basic_set *)
4507 isl_basic_map_fix((struct isl_basic_map *)bset,
4511 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4512 unsigned input, int value)
4514 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4517 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4518 unsigned dim, int value)
4520 return (struct isl_basic_set *)
4521 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4522 isl_dim_set, dim, value);
4525 struct isl_map *isl_map_fix_si(struct isl_map *map,
4526 enum isl_dim_type type, unsigned pos, int value)
4530 map = isl_map_cow(map);
4534 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4535 for (i = 0; i < map->n; ++i) {
4536 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4540 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4547 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4548 enum isl_dim_type type, unsigned pos, int value)
4550 return (struct isl_set *)
4551 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4554 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4555 enum isl_dim_type type, unsigned pos, isl_int value)
4559 map = isl_map_cow(map);
4563 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4564 for (i = 0; i < map->n; ++i) {
4565 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4569 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4576 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4577 enum isl_dim_type type, unsigned pos, isl_int value)
4579 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4582 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4583 unsigned input, int value)
4585 return isl_map_fix_si(map, isl_dim_in, input, value);
4588 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4590 return (struct isl_set *)
4591 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4594 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4595 __isl_take isl_basic_map *bmap,
4596 enum isl_dim_type type, unsigned pos, int value)
4602 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4603 pos += isl_basic_map_offset(bmap, type);
4604 bmap = isl_basic_map_cow(bmap);
4605 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4606 j = isl_basic_map_alloc_inequality(bmap);
4609 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4610 isl_int_set_si(bmap->ineq[j][pos], 1);
4611 isl_int_set_si(bmap->ineq[j][0], -value);
4612 bmap = isl_basic_map_simplify(bmap);
4613 return isl_basic_map_finalize(bmap);
4615 isl_basic_map_free(bmap);
4619 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4620 unsigned dim, isl_int value)
4624 bset = isl_basic_set_cow(bset);
4625 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4626 j = isl_basic_set_alloc_inequality(bset);
4629 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4630 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4631 isl_int_neg(bset->ineq[j][0], value);
4632 bset = isl_basic_set_simplify(bset);
4633 return isl_basic_set_finalize(bset);
4635 isl_basic_set_free(bset);
4639 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4640 enum isl_dim_type type, unsigned pos, int value)
4644 map = isl_map_cow(map);
4648 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4649 for (i = 0; i < map->n; ++i) {
4650 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4655 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4662 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4663 enum isl_dim_type type, unsigned pos, int value)
4665 return (struct isl_set *)
4666 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4669 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4674 set = isl_set_cow(set);
4678 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4679 for (i = 0; i < set->n; ++i) {
4680 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4690 struct isl_map *isl_map_reverse(struct isl_map *map)
4694 map = isl_map_cow(map);
4698 map->dim = isl_dim_reverse(map->dim);
4701 for (i = 0; i < map->n; ++i) {
4702 map->p[i] = isl_basic_map_reverse(map->p[i]);
4706 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4713 static struct isl_map *isl_basic_map_partial_lexopt(
4714 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4715 struct isl_set **empty, int max)
4719 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4720 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4722 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4724 isl_basic_map_free(bmap);
4725 isl_basic_set_free(dom);
4731 struct isl_map *isl_basic_map_partial_lexmax(
4732 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4733 struct isl_set **empty)
4735 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4738 struct isl_map *isl_basic_map_partial_lexmin(
4739 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4740 struct isl_set **empty)
4742 return isl_basic_map_partial_lexopt(bmap, dom, empty, 0);
4745 struct isl_set *isl_basic_set_partial_lexmin(
4746 struct isl_basic_set *bset, struct isl_basic_set *dom,
4747 struct isl_set **empty)
4749 return (struct isl_set *)
4750 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4754 struct isl_set *isl_basic_set_partial_lexmax(
4755 struct isl_basic_set *bset, struct isl_basic_set *dom,
4756 struct isl_set **empty)
4758 return (struct isl_set *)
4759 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4763 /* Given a basic map "bmap", compute the lexicographically minimal
4764 * (or maximal) image element for each domain element in dom.
4765 * Set *empty to those elements in dom that do not have an image element.
4767 * We first make sure the basic sets in dom are disjoint and then
4768 * simply collect the results over each of the basic sets separately.
4769 * We could probably improve the efficiency a bit by moving the union
4770 * domain down into the parametric integer programming.
4772 static __isl_give isl_map *basic_map_partial_lexopt(
4773 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4774 __isl_give isl_set **empty, int max)
4777 struct isl_map *res;
4779 dom = isl_set_make_disjoint(dom);
4783 if (isl_set_plain_is_empty(dom)) {
4784 res = isl_map_empty_like_basic_map(bmap);
4785 *empty = isl_set_empty_like(dom);
4787 isl_basic_map_free(bmap);
4791 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4792 isl_basic_set_copy(dom->p[0]), empty, max);
4794 for (i = 1; i < dom->n; ++i) {
4795 struct isl_map *res_i;
4796 struct isl_set *empty_i;
4798 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4799 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4801 res = isl_map_union_disjoint(res, res_i);
4802 *empty = isl_set_union_disjoint(*empty, empty_i);
4806 isl_basic_map_free(bmap);
4811 isl_basic_map_free(bmap);
4815 /* Given a map "map", compute the lexicographically minimal
4816 * (or maximal) image element for each domain element in dom.
4817 * Set *empty to those elements in dom that do not have an image element.
4819 * We first compute the lexicographically minimal or maximal element
4820 * in the first basic map. This results in a partial solution "res"
4821 * and a subset "todo" of dom that still need to be handled.
4822 * We then consider each of the remaining maps in "map" and successively
4823 * improve both "res" and "todo".
4825 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4826 * Assume we are computing the lexicographical maximum.
4827 * We first compute the lexicographically maximal element in basic map i.
4828 * This results in a partial solution res_i and a subset todo_i.
4829 * Then we combine these results with those obtain for the first k basic maps
4830 * to obtain a result that is valid for the first k+1 basic maps.
4831 * In particular, the set where there is no solution is the set where
4832 * there is no solution for the first k basic maps and also no solution
4833 * for the ith basic map, i.e.,
4835 * todo^i = todo^k * todo_i
4837 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4838 * solutions, arbitrarily breaking ties in favor of res^k.
4839 * That is, when res^k(a) >= res_i(a), we pick res^k and
4840 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4841 * the lexicographic order.)
4842 * In practice, we compute
4844 * res^k * (res_i . "<=")
4848 * res_i * (res^k . "<")
4850 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4851 * where only one of res^k and res_i provides a solution and we simply pick
4858 * Note that we only compute these intersections when dom(res^k) intersects
4859 * dom(res_i). Otherwise, the only effect of these intersections is to
4860 * potentially break up res^k and res_i into smaller pieces.
4861 * We want to avoid such splintering as much as possible.
4862 * In fact, an earlier implementation of this function would look for
4863 * better results in the domain of res^k and for extra results in todo^k,
4864 * but this would always result in a splintering according to todo^k,
4865 * even when the domain of basic map i is disjoint from the domains of
4866 * the previous basic maps.
4868 static __isl_give isl_map *isl_map_partial_lexopt(
4869 __isl_take isl_map *map, __isl_take isl_set *dom,
4870 __isl_give isl_set **empty, int max)
4873 struct isl_map *res;
4874 struct isl_set *todo;
4879 if (isl_map_plain_is_empty(map)) {
4887 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4888 isl_set_copy(dom), &todo, max);
4890 for (i = 1; i < map->n; ++i) {
4894 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4896 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4897 isl_set_copy(dom), &todo_i, max);
4900 lt = isl_map_lex_lt(isl_dim_copy(dim));
4901 le = isl_map_lex_le(dim);
4903 lt = isl_map_lex_gt(isl_dim_copy(dim));
4904 le = isl_map_lex_ge(dim);
4906 lt = isl_map_apply_range(isl_map_copy(res), lt);
4907 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4908 le = isl_map_apply_range(isl_map_copy(res_i), le);
4909 le = isl_map_intersect(le, isl_map_copy(res));
4911 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4912 res = isl_map_intersect_domain(res,
4913 isl_set_copy(todo_i));
4914 res_i = isl_map_intersect_domain(res_i,
4915 isl_set_copy(todo));
4918 res = isl_map_union_disjoint(res, res_i);
4919 res = isl_map_union_disjoint(res, lt);
4920 res = isl_map_union_disjoint(res, le);
4922 todo = isl_set_intersect(todo, todo_i);
4942 __isl_give isl_map *isl_map_partial_lexmax(
4943 __isl_take isl_map *map, __isl_take isl_set *dom,
4944 __isl_give isl_set **empty)
4946 return isl_map_partial_lexopt(map, dom, empty, 1);
4949 __isl_give isl_map *isl_map_partial_lexmin(
4950 __isl_take isl_map *map, __isl_take isl_set *dom,
4951 __isl_give isl_set **empty)
4953 return isl_map_partial_lexopt(map, dom, empty, 0);
4956 __isl_give isl_set *isl_set_partial_lexmin(
4957 __isl_take isl_set *set, __isl_take isl_set *dom,
4958 __isl_give isl_set **empty)
4960 return (struct isl_set *)
4961 isl_map_partial_lexmin((struct isl_map *)set,
4965 __isl_give isl_set *isl_set_partial_lexmax(
4966 __isl_take isl_set *set, __isl_take isl_set *dom,
4967 __isl_give isl_set **empty)
4969 return (struct isl_set *)
4970 isl_map_partial_lexmax((struct isl_map *)set,
4974 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4976 struct isl_basic_set *dom = NULL;
4977 struct isl_dim *dom_dim;
4981 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4982 dom = isl_basic_set_universe(dom_dim);
4983 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4985 isl_basic_map_free(bmap);
4989 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4991 return isl_basic_map_lexopt(bmap, 0);
4994 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4996 return isl_basic_map_lexopt(bmap, 1);
4999 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
5001 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
5004 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
5006 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5009 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5011 struct isl_set *dom = NULL;
5012 struct isl_dim *dom_dim;
5016 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5017 dom = isl_set_universe(dom_dim);
5018 return isl_map_partial_lexopt(map, dom, NULL, max);
5024 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5026 return isl_map_lexopt(map, 0);
5029 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5031 return isl_map_lexopt(map, 1);
5034 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5036 return (isl_set *)isl_map_lexmin((isl_map *)set);
5039 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5041 return (isl_set *)isl_map_lexmax((isl_map *)set);
5044 /* Construct a map that equates the two given dimensions in the given space.
5046 static __isl_give isl_map *equate(__isl_take isl_dim *dim,
5047 enum isl_dim_type src_type, int src_pos,
5048 enum isl_dim_type dst_type, int dst_pos)
5050 isl_basic_map *bmap;
5053 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
5054 k = isl_basic_map_alloc_equality(bmap);
5057 isl_seq_clr(bmap->eq[k], 1 + isl_basic_map_total_dim(bmap));
5058 src_pos += isl_basic_map_offset(bmap, src_type);
5059 dst_pos += isl_basic_map_offset(bmap, dst_type);
5060 isl_int_set_si(bmap->eq[k][src_pos], 1);
5061 isl_int_set_si(bmap->eq[k][dst_pos], -1);
5063 return isl_map_from_basic_map(bmap);
5065 isl_basic_map_free(bmap);
5069 /* Extract the first and only affine expression from list
5070 * and then add it to *pwaff with the given dom.
5071 * This domain is known to be disjoint from other domains
5072 * because of the way isl_basic_set_foreach_lexmax works.
5074 static int update_dim_max(__isl_take isl_basic_set *dom,
5075 __isl_take isl_aff_list *list, void *user)
5077 isl_ctx *ctx = isl_basic_set_get_ctx(dom);
5079 isl_pw_aff **pwaff = user;
5080 isl_pw_aff *pwaff_i;
5082 if (isl_aff_list_n_aff(list) != 1)
5083 isl_die(ctx, isl_error_internal,
5084 "expecting single element list", goto error);
5086 aff = isl_aff_list_get_aff(list, 0);
5087 pwaff_i = isl_pw_aff_alloc(isl_set_from_basic_set(dom), aff);
5089 *pwaff = isl_pw_aff_add_disjoint(*pwaff, pwaff_i);
5091 isl_aff_list_free(list);
5095 isl_basic_set_free(dom);
5096 isl_aff_list_free(list);
5100 /* Given a one-dimensional basic set, compute the maximum of that
5101 * dimension as an isl_pw_aff.
5103 * The isl_pw_aff is constructed by having isl_basic_set_foreach_lexmax
5104 * call update_dim_max on each leaf of the result.
5106 static __isl_give isl_pw_aff *basic_set_dim_max(__isl_keep isl_basic_set *bset)
5108 isl_dim *dim = isl_basic_set_get_dim(bset);
5112 dim = isl_dim_domain(isl_dim_from_range(dim));
5113 pwaff = isl_pw_aff_empty(dim);
5115 r = isl_basic_set_foreach_lexmax(bset, &update_dim_max, &pwaff);
5117 return isl_pw_aff_free(pwaff);
5122 /* Compute the maximum of the given set dimension as a function of the
5123 * parameters, but independently of the other set dimensions.
5125 * We first project the set onto the given dimension and then compute
5126 * the "lexicographic" maximum in each basic set, combining the results
5127 * using isl_pw_aff_max.
5129 __isl_give isl_pw_aff *isl_set_dim_max(__isl_take isl_set *set, int pos)
5135 map = isl_map_from_domain(set);
5136 map = isl_map_add_dims(map, isl_dim_out, 1);
5137 map = isl_map_intersect(map,
5138 equate(isl_map_get_dim(map), isl_dim_in, pos,
5140 set = isl_map_range(map);
5145 isl_dim *dim = isl_set_get_dim(set);
5146 dim = isl_dim_domain(isl_dim_from_range(dim));
5148 return isl_pw_aff_empty(dim);
5151 pwaff = basic_set_dim_max(set->p[0]);
5152 for (i = 1; i < set->n; ++i) {
5153 isl_pw_aff *pwaff_i;
5155 pwaff_i = basic_set_dim_max(set->p[i]);
5156 pwaff = isl_pw_aff_max(pwaff, pwaff_i);
5164 /* Apply a preimage specified by "mat" on the parameters of "bset".
5165 * bset is assumed to have only parameters and divs.
5167 static struct isl_basic_set *basic_set_parameter_preimage(
5168 struct isl_basic_set *bset, struct isl_mat *mat)
5175 bset->dim = isl_dim_cow(bset->dim);
5179 nparam = isl_basic_set_dim(bset, isl_dim_param);
5181 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5183 bset->dim->nparam = 0;
5184 bset->dim->n_out = nparam;
5185 bset = isl_basic_set_preimage(bset, mat);
5187 bset->dim->nparam = bset->dim->n_out;
5188 bset->dim->n_out = 0;
5193 isl_basic_set_free(bset);
5197 /* Apply a preimage specified by "mat" on the parameters of "set".
5198 * set is assumed to have only parameters and divs.
5200 static struct isl_set *set_parameter_preimage(
5201 struct isl_set *set, struct isl_mat *mat)
5203 struct isl_dim *dim = NULL;
5209 dim = isl_dim_copy(set->dim);
5210 dim = isl_dim_cow(dim);
5214 nparam = isl_set_dim(set, isl_dim_param);
5216 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5219 dim->n_out = nparam;
5220 isl_set_reset_dim(set, dim);
5221 set = isl_set_preimage(set, mat);
5224 dim = isl_dim_copy(set->dim);
5225 dim = isl_dim_cow(dim);
5228 dim->nparam = dim->n_out;
5230 isl_set_reset_dim(set, dim);
5240 /* Intersect the basic set "bset" with the affine space specified by the
5241 * equalities in "eq".
5243 static struct isl_basic_set *basic_set_append_equalities(
5244 struct isl_basic_set *bset, struct isl_mat *eq)
5252 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5257 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5258 for (i = 0; i < eq->n_row; ++i) {
5259 k = isl_basic_set_alloc_equality(bset);
5262 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5263 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5267 bset = isl_basic_set_gauss(bset, NULL);
5268 bset = isl_basic_set_finalize(bset);
5273 isl_basic_set_free(bset);
5277 /* Intersect the set "set" with the affine space specified by the
5278 * equalities in "eq".
5280 static struct isl_set *set_append_equalities(struct isl_set *set,
5288 for (i = 0; i < set->n; ++i) {
5289 set->p[i] = basic_set_append_equalities(set->p[i],
5302 /* Project the given basic set onto its parameter domain, possibly introducing
5303 * new, explicit, existential variables in the constraints.
5304 * The input has parameters and (possibly implicit) existential variables.
5305 * The output has the same parameters, but only
5306 * explicit existentially quantified variables.
5308 * The actual projection is performed by pip, but pip doesn't seem
5309 * to like equalities very much, so we first remove the equalities
5310 * among the parameters by performing a variable compression on
5311 * the parameters. Afterward, an inverse transformation is performed
5312 * and the equalities among the parameters are inserted back in.
5314 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5318 struct isl_mat *T, *T2;
5319 struct isl_set *set;
5320 unsigned nparam, n_div;
5322 bset = isl_basic_set_cow(bset);
5326 if (bset->n_eq == 0)
5327 return isl_basic_set_lexmin(bset);
5329 isl_basic_set_gauss(bset, NULL);
5331 nparam = isl_basic_set_dim(bset, isl_dim_param);
5332 n_div = isl_basic_set_dim(bset, isl_dim_div);
5334 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5335 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5338 if (i == bset->n_eq)
5339 return isl_basic_set_lexmin(bset);
5341 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5343 eq = isl_mat_cow(eq);
5344 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5345 if (T && T->n_col == 0) {
5349 bset = isl_basic_set_set_to_empty(bset);
5350 return isl_set_from_basic_set(bset);
5352 bset = basic_set_parameter_preimage(bset, T);
5354 set = isl_basic_set_lexmin(bset);
5355 set = set_parameter_preimage(set, T2);
5356 set = set_append_equalities(set, eq);
5360 /* Compute an explicit representation for all the existentially
5361 * quantified variables.
5362 * The input and output dimensions are first turned into parameters.
5363 * compute_divs then returns a map with the same parameters and
5364 * no input or output dimensions and the dimension specification
5365 * is reset to that of the input.
5367 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5369 struct isl_basic_set *bset;
5370 struct isl_set *set;
5371 struct isl_map *map;
5372 struct isl_dim *dim, *orig_dim = NULL;
5377 bmap = isl_basic_map_cow(bmap);
5381 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5382 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5383 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5384 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5388 orig_dim = bmap->dim;
5390 bset = (struct isl_basic_set *)bmap;
5392 set = parameter_compute_divs(bset);
5393 map = (struct isl_map *)set;
5394 map = isl_map_reset_dim(map, orig_dim);
5398 isl_basic_map_free(bmap);
5402 int isl_basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5410 off = isl_dim_total(bmap->dim);
5411 for (i = 0; i < bmap->n_div; ++i) {
5412 if (isl_int_is_zero(bmap->div[i][0]))
5414 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5420 static int map_divs_known(__isl_keep isl_map *map)
5427 for (i = 0; i < map->n; ++i) {
5428 int known = isl_basic_map_divs_known(map->p[i]);
5436 /* If bmap contains any unknown divs, then compute explicit
5437 * expressions for them. However, this computation may be
5438 * quite expensive, so first try to remove divs that aren't
5441 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5444 struct isl_map *map;
5446 known = isl_basic_map_divs_known(bmap);
5450 return isl_map_from_basic_map(bmap);
5452 bmap = isl_basic_map_drop_redundant_divs(bmap);
5454 known = isl_basic_map_divs_known(bmap);
5458 return isl_map_from_basic_map(bmap);
5460 map = compute_divs(bmap);
5463 isl_basic_map_free(bmap);
5467 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5471 struct isl_map *res;
5478 known = map_divs_known(map);
5486 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5487 for (i = 1 ; i < map->n; ++i) {
5489 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5490 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5491 res = isl_map_union_disjoint(res, r2);
5493 res = isl_map_union(res, r2);
5500 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5502 return (struct isl_set *)
5503 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5506 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5508 return (struct isl_set *)
5509 isl_map_compute_divs((struct isl_map *)set);
5512 struct isl_set *isl_map_domain(struct isl_map *map)
5515 struct isl_set *set;
5520 map = isl_map_cow(map);
5524 set = (struct isl_set *)map;
5525 set->dim = isl_dim_domain(set->dim);
5528 for (i = 0; i < map->n; ++i) {
5529 set->p[i] = isl_basic_map_domain(map->p[i]);
5533 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5534 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5541 struct isl_map *isl_map_union_disjoint(
5542 struct isl_map *map1, struct isl_map *map2)
5546 struct isl_map *map = NULL;
5560 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5562 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5563 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5564 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5566 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5567 map1->n + map2->n, flags);
5570 for (i = 0; i < map1->n; ++i) {
5571 map = isl_map_add_basic_map(map,
5572 isl_basic_map_copy(map1->p[i]));
5576 for (i = 0; i < map2->n; ++i) {
5577 map = isl_map_add_basic_map(map,
5578 isl_basic_map_copy(map2->p[i]));
5592 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5594 map1 = isl_map_union_disjoint(map1, map2);
5598 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5602 struct isl_set *isl_set_union_disjoint(
5603 struct isl_set *set1, struct isl_set *set2)
5605 return (struct isl_set *)
5606 isl_map_union_disjoint(
5607 (struct isl_map *)set1, (struct isl_map *)set2);
5610 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5612 return (struct isl_set *)
5613 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5616 struct isl_map *isl_map_intersect_range(
5617 struct isl_map *map, struct isl_set *set)
5620 struct isl_map *result;
5626 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5627 isl_die(set->ctx, isl_error_invalid,
5628 "parameters don't match", goto error);
5630 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5631 !isl_map_compatible_range(map, set))
5632 isl_die(set->ctx, isl_error_invalid,
5633 "incompatible spaces", goto error);
5635 if (isl_set_plain_is_universe(set)) {
5640 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5641 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5642 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5644 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5645 map->n * set->n, flags);
5648 for (i = 0; i < map->n; ++i)
5649 for (j = 0; j < set->n; ++j) {
5650 result = isl_map_add_basic_map(result,
5651 isl_basic_map_intersect_range(
5652 isl_basic_map_copy(map->p[i]),
5653 isl_basic_set_copy(set->p[j])));
5666 struct isl_map *isl_map_intersect_domain(
5667 struct isl_map *map, struct isl_set *set)
5669 return isl_map_reverse(
5670 isl_map_intersect_range(isl_map_reverse(map), set));
5673 struct isl_map *isl_map_apply_domain(
5674 struct isl_map *map1, struct isl_map *map2)
5678 map1 = isl_map_reverse(map1);
5679 map1 = isl_map_apply_range(map1, map2);
5680 return isl_map_reverse(map1);
5687 struct isl_map *isl_map_apply_range(
5688 struct isl_map *map1, struct isl_map *map2)
5690 struct isl_dim *dim_result;
5691 struct isl_map *result;
5697 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5698 isl_dim_copy(map2->dim));
5700 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5703 for (i = 0; i < map1->n; ++i)
5704 for (j = 0; j < map2->n; ++j) {
5705 result = isl_map_add_basic_map(result,
5706 isl_basic_map_apply_range(
5707 isl_basic_map_copy(map1->p[i]),
5708 isl_basic_map_copy(map2->p[j])));
5714 if (result && result->n <= 1)
5715 ISL_F_SET(result, ISL_MAP_DISJOINT);
5724 * returns range - domain
5726 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5728 isl_dim *dims, *target_dim;
5729 struct isl_basic_set *bset;
5736 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5737 bmap->dim, isl_dim_out),
5739 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5740 dim = isl_basic_map_n_in(bmap);
5741 nparam = isl_basic_map_n_param(bmap);
5742 bset = isl_basic_set_from_basic_map(bmap);
5743 bset = isl_basic_set_cow(bset);
5744 dims = isl_basic_set_get_dim(bset);
5745 dims = isl_dim_add(dims, isl_dim_set, dim);
5746 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5747 bset = isl_basic_set_swap_vars(bset, 2*dim);
5748 for (i = 0; i < dim; ++i) {
5749 int j = isl_basic_map_alloc_equality(
5750 (struct isl_basic_map *)bset);
5753 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5754 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5755 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5756 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5758 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5759 bset = isl_basic_set_reset_dim(bset, target_dim);
5762 isl_basic_map_free(bmap);
5767 * returns range - domain
5769 struct isl_set *isl_map_deltas(struct isl_map *map)
5773 struct isl_set *result;
5778 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5779 map->dim, isl_dim_out),
5781 dim = isl_map_get_dim(map);
5782 dim = isl_dim_domain(dim);
5783 result = isl_set_alloc_dim(dim, map->n, 0);
5786 for (i = 0; i < map->n; ++i)
5787 result = isl_set_add_basic_set(result,
5788 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5797 * returns [domain -> range] -> range - domain
5799 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5800 __isl_take isl_basic_map *bmap)
5804 isl_basic_map *domain;
5808 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5809 isl_die(bmap->ctx, isl_error_invalid,
5810 "domain and range don't match", goto error);
5812 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5813 n = isl_basic_map_dim(bmap, isl_dim_in);
5815 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
5816 domain = isl_basic_map_universe(dim);
5818 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
5819 bmap = isl_basic_map_apply_range(bmap, domain);
5820 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
5822 total = isl_basic_map_total_dim(bmap);
5824 for (i = 0; i < n; ++i) {
5825 k = isl_basic_map_alloc_equality(bmap);
5828 isl_seq_clr(bmap->eq[k], 1 + total);
5829 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
5830 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
5831 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
5834 bmap = isl_basic_map_gauss(bmap, NULL);
5835 return isl_basic_map_finalize(bmap);
5837 isl_basic_map_free(bmap);
5842 * returns [domain -> range] -> range - domain
5844 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
5847 isl_dim *domain_dim;
5852 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
5853 isl_die(map->ctx, isl_error_invalid,
5854 "domain and range don't match", goto error);
5856 map = isl_map_cow(map);
5860 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
5861 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
5862 map->dim = isl_dim_join(map->dim, domain_dim);
5865 for (i = 0; i < map->n; ++i) {
5866 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
5870 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5877 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5879 struct isl_basic_map *bmap;
5887 nparam = dims->nparam;
5889 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5893 for (i = 0; i < dim; ++i) {
5894 int j = isl_basic_map_alloc_equality(bmap);
5897 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5898 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5899 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5901 return isl_basic_map_finalize(bmap);
5903 isl_basic_map_free(bmap);
5907 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
5911 if (dim->n_in != dim->n_out)
5912 isl_die(dim->ctx, isl_error_invalid,
5913 "number of input and output dimensions needs to be "
5914 "the same", goto error);
5915 return basic_map_identity(dim);
5921 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5923 if (!model || !model->dim)
5925 return isl_basic_map_identity(isl_dim_copy(model->dim));
5928 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
5930 return isl_map_from_basic_map(isl_basic_map_identity(dim));
5933 struct isl_map *isl_map_identity_like(struct isl_map *model)
5935 if (!model || !model->dim)
5937 return isl_map_identity(isl_dim_copy(model->dim));
5940 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5942 if (!model || !model->dim)
5944 return isl_map_identity(isl_dim_copy(model->dim));
5947 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5949 isl_dim *dim = isl_set_get_dim(set);
5951 id = isl_map_identity(isl_dim_map_from_set(dim));
5952 return isl_map_intersect_range(id, set);
5955 /* Construct a basic set with all set dimensions having only non-negative
5958 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5963 struct isl_basic_set *bset;
5967 nparam = dims->nparam;
5969 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5972 for (i = 0; i < dim; ++i) {
5973 int k = isl_basic_set_alloc_inequality(bset);
5976 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5977 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5981 isl_basic_set_free(bset);
5985 /* Construct the half-space x_pos >= 0.
5987 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5991 isl_basic_set *nonneg;
5993 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5994 k = isl_basic_set_alloc_inequality(nonneg);
5997 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5998 isl_int_set_si(nonneg->ineq[k][pos], 1);
6000 return isl_basic_set_finalize(nonneg);
6002 isl_basic_set_free(nonneg);
6006 /* Construct the half-space x_pos <= -1.
6008 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
6013 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
6014 k = isl_basic_set_alloc_inequality(neg);
6017 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
6018 isl_int_set_si(neg->ineq[k][0], -1);
6019 isl_int_set_si(neg->ineq[k][pos], -1);
6021 return isl_basic_set_finalize(neg);
6023 isl_basic_set_free(neg);
6027 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
6028 enum isl_dim_type type, unsigned first, unsigned n)
6031 isl_basic_set *nonneg;
6039 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
6041 for (i = 0; i < n; ++i) {
6042 nonneg = nonneg_halfspace(isl_set_get_dim(set),
6043 pos(set->dim, type) + first + i);
6044 neg = neg_halfspace(isl_set_get_dim(set),
6045 pos(set->dim, type) + first + i);
6047 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
6056 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
6057 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6064 if (isl_set_plain_is_empty(set)) {
6069 return fn(set, signs, user);
6072 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
6074 half = isl_set_intersect(half, isl_set_copy(set));
6075 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
6079 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
6081 half = isl_set_intersect(half, set);
6082 return foreach_orthant(half, signs, first + 1, len, fn, user);
6088 /* Call "fn" on the intersections of "set" with each of the orthants
6089 * (except for obviously empty intersections). The orthant is identified
6090 * by the signs array, with each entry having value 1 or -1 according
6091 * to the sign of the corresponding variable.
6093 int isl_set_foreach_orthant(__isl_keep isl_set *set,
6094 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
6104 if (isl_set_plain_is_empty(set))
6107 nparam = isl_set_dim(set, isl_dim_param);
6108 nvar = isl_set_dim(set, isl_dim_set);
6110 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
6112 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
6120 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
6122 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
6125 int isl_basic_map_is_subset(
6126 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6129 struct isl_map *map1;
6130 struct isl_map *map2;
6132 if (!bmap1 || !bmap2)
6135 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6136 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6138 is_subset = isl_map_is_subset(map1, map2);
6146 int isl_basic_map_is_equal(
6147 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6151 if (!bmap1 || !bmap2)
6153 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6156 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6160 int isl_basic_set_is_equal(
6161 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6163 return isl_basic_map_is_equal(
6164 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6167 int isl_map_is_empty(struct isl_map *map)
6174 for (i = 0; i < map->n; ++i) {
6175 is_empty = isl_basic_map_is_empty(map->p[i]);
6184 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6186 return map ? map->n == 0 : -1;
6189 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6191 return isl_map_plain_is_empty(map);
6194 int isl_set_plain_is_empty(struct isl_set *set)
6196 return set ? set->n == 0 : -1;
6199 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6201 return isl_set_plain_is_empty(set);
6204 int isl_set_is_empty(struct isl_set *set)
6206 return isl_map_is_empty((struct isl_map *)set);
6209 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6214 return isl_dim_equal(map1->dim, map2->dim);
6217 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6222 return isl_dim_equal(set1->dim, set2->dim);
6225 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
6231 is_subset = isl_map_is_subset(map1, map2);
6234 is_subset = isl_map_is_subset(map2, map1);
6238 int isl_basic_map_is_strict_subset(
6239 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6243 if (!bmap1 || !bmap2)
6245 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6248 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6249 if (is_subset == -1)
6254 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6260 is_subset = isl_map_is_subset(map1, map2);
6263 is_subset = isl_map_is_subset(map2, map1);
6264 if (is_subset == -1)
6269 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6271 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6274 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6278 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6281 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6285 return bset->n_eq == 0 && bset->n_ineq == 0;
6288 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6295 for (i = 0; i < map->n; ++i) {
6296 int r = isl_basic_map_is_universe(map->p[i]);
6304 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6306 return isl_map_plain_is_universe((isl_map *) set);
6309 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6311 return isl_set_plain_is_universe(set);
6314 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6316 struct isl_basic_set *bset = NULL;
6317 struct isl_vec *sample = NULL;
6324 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6327 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6328 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6329 copy = isl_basic_map_remove_redundancies(copy);
6330 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6331 isl_basic_map_free(copy);
6335 total = 1 + isl_basic_map_total_dim(bmap);
6336 if (bmap->sample && bmap->sample->size == total) {
6337 int contains = isl_basic_map_contains(bmap, bmap->sample);
6343 isl_vec_free(bmap->sample);
6344 bmap->sample = NULL;
6345 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6348 sample = isl_basic_set_sample_vec(bset);
6351 empty = sample->size == 0;
6352 isl_vec_free(bmap->sample);
6353 bmap->sample = sample;
6355 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6360 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6364 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6367 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6369 return isl_basic_map_plain_is_empty(bmap);
6372 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6376 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6379 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6381 return isl_basic_set_plain_is_empty(bset);
6384 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6386 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6389 struct isl_map *isl_basic_map_union(
6390 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6392 struct isl_map *map;
6393 if (!bmap1 || !bmap2)
6396 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6398 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6401 map = isl_map_add_basic_map(map, bmap1);
6402 map = isl_map_add_basic_map(map, bmap2);
6405 isl_basic_map_free(bmap1);
6406 isl_basic_map_free(bmap2);
6410 struct isl_set *isl_basic_set_union(
6411 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6413 return (struct isl_set *)isl_basic_map_union(
6414 (struct isl_basic_map *)bset1,
6415 (struct isl_basic_map *)bset2);
6418 /* Order divs such that any div only depends on previous divs */
6419 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6427 off = isl_dim_total(bmap->dim);
6429 for (i = 0; i < bmap->n_div; ++i) {
6431 if (isl_int_is_zero(bmap->div[i][0]))
6433 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6437 isl_basic_map_swap_div(bmap, i, i + pos);
6443 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6445 return (struct isl_basic_set *)
6446 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6449 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6456 for (i = 0; i < map->n; ++i) {
6457 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6468 /* Apply the expansion computed by isl_merge_divs.
6469 * The expansion itself is given by "exp" while the resulting
6470 * list of divs is given by "div".
6472 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6473 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6478 bset = isl_basic_set_cow(bset);
6482 if (div->n_row < bset->n_div)
6483 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6484 "not an expansion", goto error);
6486 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6487 div->n_row - bset->n_div, 0,
6488 2 * (div->n_row - bset->n_div));
6490 n_div = bset->n_div;
6491 for (i = n_div; i < div->n_row; ++i)
6492 if (isl_basic_set_alloc_div(bset) < 0)
6496 for (i = div->n_row - 1; i >= 0; --i) {
6497 if (j >= 0 && exp[j] == i) {
6499 isl_basic_map_swap_div(bset, i, j);
6502 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6503 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6511 isl_basic_set_free(bset);
6516 /* Look for a div in dst that corresponds to the div "div" in src.
6517 * The divs before "div" in src and dst are assumed to be the same.
6519 * Returns -1 if no corresponding div was found and the position
6520 * of the corresponding div in dst otherwise.
6522 static int find_div(struct isl_basic_map *dst,
6523 struct isl_basic_map *src, unsigned div)
6527 unsigned total = isl_dim_total(src->dim);
6529 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6530 for (i = div; i < dst->n_div; ++i)
6531 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6532 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6533 dst->n_div - div) == -1)
6538 struct isl_basic_map *isl_basic_map_align_divs(
6539 struct isl_basic_map *dst, struct isl_basic_map *src)
6542 unsigned total = isl_dim_total(src->dim);
6547 if (src->n_div == 0)
6550 for (i = 0; i < src->n_div; ++i)
6551 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6553 src = isl_basic_map_order_divs(src);
6554 dst = isl_basic_map_cow(dst);
6555 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6556 src->n_div, 0, 2 * src->n_div);
6559 for (i = 0; i < src->n_div; ++i) {
6560 int j = find_div(dst, src, i);
6562 j = isl_basic_map_alloc_div(dst);
6565 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6566 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6567 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6571 isl_basic_map_swap_div(dst, i, j);
6575 isl_basic_map_free(dst);
6579 struct isl_basic_set *isl_basic_set_align_divs(
6580 struct isl_basic_set *dst, struct isl_basic_set *src)
6582 return (struct isl_basic_set *)isl_basic_map_align_divs(
6583 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6586 struct isl_map *isl_map_align_divs(struct isl_map *map)
6594 map = isl_map_compute_divs(map);
6595 map = isl_map_cow(map);
6599 for (i = 1; i < map->n; ++i)
6600 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6601 for (i = 1; i < map->n; ++i)
6602 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6604 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6608 struct isl_set *isl_set_align_divs(struct isl_set *set)
6610 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6613 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6617 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6618 map = isl_map_intersect_domain(map, set);
6619 set = isl_map_range(map);
6627 /* There is no need to cow as removing empty parts doesn't change
6628 * the meaning of the set.
6630 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6637 for (i = map->n-1; i >= 0; --i) {
6638 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6640 isl_basic_map_free(map->p[i]);
6641 if (i != map->n-1) {
6642 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6643 map->p[i] = map->p[map->n-1];
6651 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6653 return (struct isl_set *)
6654 isl_map_remove_empty_parts((struct isl_map *)set);
6657 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6659 struct isl_basic_map *bmap;
6660 if (!map || map->n == 0)
6662 bmap = map->p[map->n-1];
6663 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6664 return isl_basic_map_copy(bmap);
6667 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6669 return (struct isl_basic_set *)
6670 isl_map_copy_basic_map((struct isl_map *)set);
6673 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6674 __isl_keep isl_basic_map *bmap)
6680 for (i = map->n-1; i >= 0; --i) {
6681 if (map->p[i] != bmap)
6683 map = isl_map_cow(map);
6686 isl_basic_map_free(map->p[i]);
6687 if (i != map->n-1) {
6688 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6689 map->p[i] = map->p[map->n-1];
6700 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6701 struct isl_basic_set *bset)
6703 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6704 (struct isl_basic_map *)bset);
6707 /* Given two basic sets bset1 and bset2, compute the maximal difference
6708 * between the values of dimension pos in bset1 and those in bset2
6709 * for any common value of the parameters and dimensions preceding pos.
6711 static enum isl_lp_result basic_set_maximal_difference_at(
6712 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6713 int pos, isl_int *opt)
6715 struct isl_dim *dims;
6716 struct isl_basic_map *bmap1 = NULL;
6717 struct isl_basic_map *bmap2 = NULL;
6718 struct isl_ctx *ctx;
6719 struct isl_vec *obj;
6722 unsigned dim1, dim2;
6723 enum isl_lp_result res;
6725 if (!bset1 || !bset2)
6726 return isl_lp_error;
6728 nparam = isl_basic_set_n_param(bset1);
6729 dim1 = isl_basic_set_n_dim(bset1);
6730 dim2 = isl_basic_set_n_dim(bset2);
6731 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6732 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6733 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6734 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6735 if (!bmap1 || !bmap2)
6737 bmap1 = isl_basic_map_cow(bmap1);
6738 bmap1 = isl_basic_map_extend(bmap1, nparam,
6739 pos, (dim1 - pos) + (dim2 - pos),
6740 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6741 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6744 total = isl_basic_map_total_dim(bmap1);
6746 obj = isl_vec_alloc(ctx, 1 + total);
6747 isl_seq_clr(obj->block.data, 1 + total);
6748 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6749 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6752 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6754 isl_basic_map_free(bmap1);
6758 isl_basic_map_free(bmap1);
6759 isl_basic_map_free(bmap2);
6760 return isl_lp_error;
6763 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6764 * for any common value of the parameters and dimensions preceding pos
6765 * in both basic sets, the values of dimension pos in bset1 are
6766 * smaller or larger than those in bset2.
6769 * 1 if bset1 follows bset2
6770 * -1 if bset1 precedes bset2
6771 * 0 if bset1 and bset2 are incomparable
6772 * -2 if some error occurred.
6774 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6775 struct isl_basic_set *bset2, int pos)
6778 enum isl_lp_result res;
6783 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6785 if (res == isl_lp_empty)
6787 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6788 res == isl_lp_unbounded)
6790 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6799 /* Given two basic sets bset1 and bset2, check whether
6800 * for any common value of the parameters and dimensions preceding pos
6801 * there is a value of dimension pos in bset1 that is larger
6802 * than a value of the same dimension in bset2.
6805 * 1 if there exists such a pair
6806 * 0 if there is no such pair, but there is a pair of equal values
6808 * -2 if some error occurred.
6810 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6811 __isl_keep isl_basic_set *bset2, int pos)
6814 enum isl_lp_result res;
6819 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6821 if (res == isl_lp_empty)
6823 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6824 res == isl_lp_unbounded)
6826 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6828 else if (res == isl_lp_ok)
6837 /* Given two sets set1 and set2, check whether
6838 * for any common value of the parameters and dimensions preceding pos
6839 * there is a value of dimension pos in set1 that is larger
6840 * than a value of the same dimension in set2.
6843 * 1 if there exists such a pair
6844 * 0 if there is no such pair, but there is a pair of equal values
6846 * -2 if some error occurred.
6848 int isl_set_follows_at(__isl_keep isl_set *set1,
6849 __isl_keep isl_set *set2, int pos)
6857 for (i = 0; i < set1->n; ++i)
6858 for (j = 0; j < set2->n; ++j) {
6860 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6861 if (f == 1 || f == -2)
6870 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
6871 unsigned pos, isl_int *val)
6879 total = isl_basic_map_total_dim(bmap);
6880 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6881 for (; d+1 > pos; --d)
6882 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6886 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6888 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6890 if (!isl_int_is_one(bmap->eq[i][1+d]))
6893 isl_int_neg(*val, bmap->eq[i][0]);
6899 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
6900 unsigned pos, isl_int *val)
6912 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
6915 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
6916 for (i = 1; fixed == 1 && i < map->n; ++i) {
6917 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
6918 if (fixed == 1 && isl_int_ne(tmp, v))
6922 isl_int_set(*val, v);
6928 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
6929 unsigned pos, isl_int *val)
6931 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
6935 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
6938 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
6941 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
6942 enum isl_dim_type type, unsigned pos, isl_int *val)
6944 if (pos >= isl_basic_map_dim(bmap, type))
6946 return isl_basic_map_plain_has_fixed_var(bmap,
6947 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6950 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
6951 enum isl_dim_type type, unsigned pos, isl_int *val)
6953 if (pos >= isl_map_dim(map, type))
6955 return isl_map_plain_has_fixed_var(map,
6956 map_offset(map, type) - 1 + pos, val);
6959 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
6960 enum isl_dim_type type, unsigned pos, isl_int *val)
6962 return isl_map_plain_is_fixed(map, type, pos, val);
6965 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6966 * then return this fixed value in *val.
6968 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
6969 unsigned dim, isl_int *val)
6971 return isl_basic_set_plain_has_fixed_var(bset,
6972 isl_basic_set_n_param(bset) + dim, val);
6975 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6976 * then return this fixed value in *val.
6978 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
6979 unsigned dim, isl_int *val)
6981 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6984 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
6985 unsigned dim, isl_int *val)
6987 return isl_set_plain_dim_is_fixed(set, dim, val);
6990 /* Check if input variable in has fixed value and if so and if val is not NULL,
6991 * then return this fixed value in *val.
6993 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
6994 unsigned in, isl_int *val)
6996 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
6999 /* Check if dimension dim has an (obvious) fixed lower bound and if so
7000 * and if val is not NULL, then return this lower bound in *val.
7002 int isl_basic_set_plain_dim_has_fixed_lower_bound(
7003 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
7005 int i, i_eq = -1, i_ineq = -1;
7012 total = isl_basic_set_total_dim(bset);
7013 nparam = isl_basic_set_n_param(bset);
7014 for (i = 0; i < bset->n_eq; ++i) {
7015 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
7021 for (i = 0; i < bset->n_ineq; ++i) {
7022 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
7024 if (i_eq != -1 || i_ineq != -1)
7028 if (i_eq == -1 && i_ineq == -1)
7030 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
7031 /* The coefficient should always be one due to normalization. */
7032 if (!isl_int_is_one(c[1+nparam+dim]))
7034 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
7036 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
7037 total - nparam - dim - 1) != -1)
7040 isl_int_neg(*val, c[0]);
7044 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
7045 unsigned dim, isl_int *val)
7057 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7061 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
7063 for (i = 1; fixed == 1 && i < set->n; ++i) {
7064 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
7066 if (fixed == 1 && isl_int_ne(tmp, v))
7070 isl_int_set(*val, v);
7081 /* uset_gist depends on constraints without existentially quantified
7082 * variables sorting first.
7084 static int qsort_constraint_cmp(const void *p1, const void *p2)
7086 const struct constraint *c1 = (const struct constraint *)p1;
7087 const struct constraint *c2 = (const struct constraint *)p2;
7089 unsigned size = isl_min(c1->size, c2->size);
7091 l1 = isl_seq_last_non_zero(c1->c, size);
7092 l2 = isl_seq_last_non_zero(c2->c, size);
7097 return isl_seq_cmp(c1->c, c2->c, size);
7100 static struct isl_basic_map *isl_basic_map_sort_constraints(
7101 struct isl_basic_map *bmap)
7104 struct constraint *c;
7109 total = isl_basic_map_total_dim(bmap);
7110 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
7113 for (i = 0; i < bmap->n_ineq; ++i) {
7115 c[i].c = bmap->ineq[i];
7117 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
7118 for (i = 0; i < bmap->n_ineq; ++i)
7119 bmap->ineq[i] = c[i].c;
7123 isl_basic_map_free(bmap);
7127 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7128 __isl_take isl_basic_set *bset)
7130 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7131 (struct isl_basic_map *)bset);
7134 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7138 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7140 bmap = isl_basic_map_remove_redundancies(bmap);
7141 bmap = isl_basic_map_sort_constraints(bmap);
7142 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7146 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7148 return (struct isl_basic_set *)isl_basic_map_normalize(
7149 (struct isl_basic_map *)bset);
7152 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7153 const __isl_keep isl_basic_map *bmap2)
7160 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7161 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7162 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7163 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7164 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7165 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7166 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7167 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7168 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7169 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7170 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7172 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7174 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7176 if (bmap1->n_eq != bmap2->n_eq)
7177 return bmap1->n_eq - bmap2->n_eq;
7178 if (bmap1->n_ineq != bmap2->n_ineq)
7179 return bmap1->n_ineq - bmap2->n_ineq;
7180 if (bmap1->n_div != bmap2->n_div)
7181 return bmap1->n_div - bmap2->n_div;
7182 total = isl_basic_map_total_dim(bmap1);
7183 for (i = 0; i < bmap1->n_eq; ++i) {
7184 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7188 for (i = 0; i < bmap1->n_ineq; ++i) {
7189 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7193 for (i = 0; i < bmap1->n_div; ++i) {
7194 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7201 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7202 __isl_keep isl_basic_map *bmap2)
7204 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7207 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7208 __isl_keep isl_basic_set *bset2)
7210 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7211 (isl_basic_map *)bset2);
7214 static int qsort_bmap_cmp(const void *p1, const void *p2)
7216 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7217 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7219 return isl_basic_map_plain_cmp(bmap1, bmap2);
7222 /* We normalize in place, but if anything goes wrong we need
7223 * to return NULL, so we need to make sure we don't change the
7224 * meaning of any possible other copies of map.
7226 struct isl_map *isl_map_normalize(struct isl_map *map)
7229 struct isl_basic_map *bmap;
7233 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7235 for (i = 0; i < map->n; ++i) {
7236 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7239 isl_basic_map_free(map->p[i]);
7242 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7243 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7244 map = isl_map_remove_empty_parts(map);
7247 for (i = map->n - 1; i >= 1; --i) {
7248 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7250 isl_basic_map_free(map->p[i-1]);
7251 for (j = i; j < map->n; ++j)
7252 map->p[j-1] = map->p[j];
7262 struct isl_set *isl_set_normalize(struct isl_set *set)
7264 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7267 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7277 if (!isl_dim_equal(map1->dim, map2->dim))
7280 map1 = isl_map_copy(map1);
7281 map2 = isl_map_copy(map2);
7282 map1 = isl_map_normalize(map1);
7283 map2 = isl_map_normalize(map2);
7286 equal = map1->n == map2->n;
7287 for (i = 0; equal && i < map1->n; ++i) {
7288 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7301 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7303 return isl_map_plain_is_equal(map1, map2);
7306 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7308 return isl_map_plain_is_equal((struct isl_map *)set1,
7309 (struct isl_map *)set2);
7312 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7314 return isl_set_plain_is_equal(set1, set2);
7317 /* Return an interval that ranges from min to max (inclusive)
7319 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7320 isl_int min, isl_int max)
7323 struct isl_basic_set *bset = NULL;
7325 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7329 k = isl_basic_set_alloc_inequality(bset);
7332 isl_int_set_si(bset->ineq[k][1], 1);
7333 isl_int_neg(bset->ineq[k][0], min);
7335 k = isl_basic_set_alloc_inequality(bset);
7338 isl_int_set_si(bset->ineq[k][1], -1);
7339 isl_int_set(bset->ineq[k][0], max);
7343 isl_basic_set_free(bset);
7347 /* Return the Cartesian product of the basic sets in list (in the given order).
7349 __isl_give isl_basic_set *isl_basic_set_list_product(
7350 __isl_take struct isl_basic_set_list *list)
7358 struct isl_basic_set *product = NULL;
7362 isl_assert(list->ctx, list->n > 0, goto error);
7363 isl_assert(list->ctx, list->p[0], goto error);
7364 nparam = isl_basic_set_n_param(list->p[0]);
7365 dim = isl_basic_set_n_dim(list->p[0]);
7366 extra = list->p[0]->n_div;
7367 n_eq = list->p[0]->n_eq;
7368 n_ineq = list->p[0]->n_ineq;
7369 for (i = 1; i < list->n; ++i) {
7370 isl_assert(list->ctx, list->p[i], goto error);
7371 isl_assert(list->ctx,
7372 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7373 dim += isl_basic_set_n_dim(list->p[i]);
7374 extra += list->p[i]->n_div;
7375 n_eq += list->p[i]->n_eq;
7376 n_ineq += list->p[i]->n_ineq;
7378 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7383 for (i = 0; i < list->n; ++i) {
7384 isl_basic_set_add_constraints(product,
7385 isl_basic_set_copy(list->p[i]), dim);
7386 dim += isl_basic_set_n_dim(list->p[i]);
7388 isl_basic_set_list_free(list);
7391 isl_basic_set_free(product);
7392 isl_basic_set_list_free(list);
7396 struct isl_basic_map *isl_basic_map_product(
7397 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7399 struct isl_dim *dim_result = NULL;
7400 struct isl_basic_map *bmap;
7401 unsigned in1, in2, out1, out2, nparam, total, pos;
7402 struct isl_dim_map *dim_map1, *dim_map2;
7404 if (!bmap1 || !bmap2)
7407 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7408 bmap2->dim, isl_dim_param), goto error);
7409 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7410 isl_dim_copy(bmap2->dim));
7412 in1 = isl_basic_map_n_in(bmap1);
7413 in2 = isl_basic_map_n_in(bmap2);
7414 out1 = isl_basic_map_n_out(bmap1);
7415 out2 = isl_basic_map_n_out(bmap2);
7416 nparam = isl_basic_map_n_param(bmap1);
7418 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7419 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7420 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7421 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7422 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7423 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7424 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7425 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7426 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7427 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7428 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7430 bmap = isl_basic_map_alloc_dim(dim_result,
7431 bmap1->n_div + bmap2->n_div,
7432 bmap1->n_eq + bmap2->n_eq,
7433 bmap1->n_ineq + bmap2->n_ineq);
7434 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7435 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7436 bmap = isl_basic_map_simplify(bmap);
7437 return isl_basic_map_finalize(bmap);
7439 isl_basic_map_free(bmap1);
7440 isl_basic_map_free(bmap2);
7444 __isl_give isl_basic_map *isl_basic_map_flat_product(
7445 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7447 isl_basic_map *prod;
7449 prod = isl_basic_map_product(bmap1, bmap2);
7450 prod = isl_basic_map_flatten(prod);
7454 __isl_give isl_basic_set *isl_basic_set_flat_product(
7455 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7457 return isl_basic_map_flat_product(bset1, bset2);
7460 __isl_give isl_basic_map *isl_basic_map_range_product(
7461 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7463 isl_dim *dim_result = NULL;
7464 isl_basic_map *bmap;
7465 unsigned in, out1, out2, nparam, total, pos;
7466 struct isl_dim_map *dim_map1, *dim_map2;
7468 if (!bmap1 || !bmap2)
7471 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7472 isl_dim_copy(bmap2->dim));
7474 in = isl_basic_map_dim(bmap1, isl_dim_in);
7475 out1 = isl_basic_map_n_out(bmap1);
7476 out2 = isl_basic_map_n_out(bmap2);
7477 nparam = isl_basic_map_n_param(bmap1);
7479 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7480 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7481 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7482 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7483 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7484 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7485 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7486 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7487 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7488 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7489 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7491 bmap = isl_basic_map_alloc_dim(dim_result,
7492 bmap1->n_div + bmap2->n_div,
7493 bmap1->n_eq + bmap2->n_eq,
7494 bmap1->n_ineq + bmap2->n_ineq);
7495 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7496 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7497 bmap = isl_basic_map_simplify(bmap);
7498 return isl_basic_map_finalize(bmap);
7500 isl_basic_map_free(bmap1);
7501 isl_basic_map_free(bmap2);
7505 __isl_give isl_basic_map *isl_basic_map_flat_range_product(
7506 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7508 isl_basic_map *prod;
7510 prod = isl_basic_map_range_product(bmap1, bmap2);
7511 prod = isl_basic_map_flatten_range(prod);
7515 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7516 __isl_take isl_map *map2,
7517 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7518 __isl_take isl_dim *right),
7519 __isl_give isl_basic_map *(*basic_map_product)(
7520 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7523 struct isl_map *result;
7529 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7530 map2->dim, isl_dim_param), goto error);
7532 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7533 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7534 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7536 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7537 isl_dim_copy(map2->dim)),
7538 map1->n * map2->n, flags);
7541 for (i = 0; i < map1->n; ++i)
7542 for (j = 0; j < map2->n; ++j) {
7543 struct isl_basic_map *part;
7544 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7545 isl_basic_map_copy(map2->p[j]));
7546 if (isl_basic_map_is_empty(part))
7547 isl_basic_map_free(part);
7549 result = isl_map_add_basic_map(result, part);
7562 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7564 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7566 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7569 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7571 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7572 __isl_take isl_map *map2)
7576 prod = isl_map_product(map1, map2);
7577 prod = isl_map_flatten(prod);
7581 /* Given two set A and B, construct its Cartesian product A x B.
7583 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7585 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7586 (struct isl_map *)set2);
7589 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7590 __isl_take isl_set *set2)
7592 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7595 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7597 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7598 __isl_take isl_map *map2)
7600 return map_product(map1, map2, &isl_dim_range_product,
7601 &isl_basic_map_range_product);
7604 /* Given two maps A -> B and C -> D, construct a map (A * C) -> (B, D)
7606 __isl_give isl_map *isl_map_flat_range_product(__isl_take isl_map *map1,
7607 __isl_take isl_map *map2)
7611 prod = isl_map_range_product(map1, map2);
7612 prod = isl_map_flatten_range(prod);
7616 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7619 uint32_t hash = isl_hash_init();
7624 bmap = isl_basic_map_copy(bmap);
7625 bmap = isl_basic_map_normalize(bmap);
7628 total = isl_basic_map_total_dim(bmap);
7629 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7630 for (i = 0; i < bmap->n_eq; ++i) {
7632 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7633 isl_hash_hash(hash, c_hash);
7635 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7636 for (i = 0; i < bmap->n_ineq; ++i) {
7638 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7639 isl_hash_hash(hash, c_hash);
7641 isl_hash_byte(hash, bmap->n_div & 0xFF);
7642 for (i = 0; i < bmap->n_div; ++i) {
7644 if (isl_int_is_zero(bmap->div[i][0]))
7646 isl_hash_byte(hash, i & 0xFF);
7647 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7648 isl_hash_hash(hash, c_hash);
7650 isl_basic_map_free(bmap);
7654 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7656 return isl_basic_map_get_hash((isl_basic_map *)bset);
7659 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7666 map = isl_map_copy(map);
7667 map = isl_map_normalize(map);
7671 hash = isl_hash_init();
7672 for (i = 0; i < map->n; ++i) {
7674 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7675 isl_hash_hash(hash, bmap_hash);
7683 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7685 return isl_map_get_hash((isl_map *)set);
7688 /* Check if the value for dimension dim is completely determined
7689 * by the values of the other parameters and variables.
7690 * That is, check if dimension dim is involved in an equality.
7692 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7699 nparam = isl_basic_set_n_param(bset);
7700 for (i = 0; i < bset->n_eq; ++i)
7701 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7706 /* Check if the value for dimension dim is completely determined
7707 * by the values of the other parameters and variables.
7708 * That is, check if dimension dim is involved in an equality
7709 * for each of the subsets.
7711 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7717 for (i = 0; i < set->n; ++i) {
7719 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7726 int isl_set_n_basic_set(__isl_keep isl_set *set)
7728 return set ? set->n : 0;
7731 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7732 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7739 for (i = 0; i < map->n; ++i)
7740 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7746 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7747 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7754 for (i = 0; i < set->n; ++i)
7755 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7761 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7763 struct isl_dim *dim;
7768 bset = isl_basic_set_cow(bset);
7772 dim = isl_basic_set_get_dim(bset);
7773 dim = isl_dim_lift(dim, bset->n_div);
7776 isl_dim_free(bset->dim);
7778 bset->extra -= bset->n_div;
7781 bset = isl_basic_set_finalize(bset);
7785 isl_basic_set_free(bset);
7789 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7792 struct isl_dim *dim;
7795 set = isl_set_align_divs(set);
7800 set = isl_set_cow(set);
7804 n_div = set->p[0]->n_div;
7805 dim = isl_set_get_dim(set);
7806 dim = isl_dim_lift(dim, n_div);
7809 isl_dim_free(set->dim);
7812 for (i = 0; i < set->n; ++i) {
7813 set->p[i] = isl_basic_set_lift(set->p[i]);
7824 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7826 struct isl_dim *dim;
7827 struct isl_basic_map *bmap;
7834 set = isl_set_align_divs(set);
7839 dim = isl_set_get_dim(set);
7840 if (set->n == 0 || set->p[0]->n_div == 0) {
7842 return isl_map_identity(isl_dim_map_from_set(dim));
7845 n_div = set->p[0]->n_div;
7846 dim = isl_dim_map_from_set(dim);
7847 n_param = isl_dim_size(dim, isl_dim_param);
7848 n_set = isl_dim_size(dim, isl_dim_in);
7849 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7850 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7851 for (i = 0; i < n_set; ++i)
7852 bmap = var_equal(bmap, i);
7854 total = n_param + n_set + n_set + n_div;
7855 for (i = 0; i < n_div; ++i) {
7856 k = isl_basic_map_alloc_inequality(bmap);
7859 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7860 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7861 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7862 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7863 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7864 set->p[0]->div[i][0]);
7866 l = isl_basic_map_alloc_inequality(bmap);
7869 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7870 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7871 set->p[0]->div[i][0]);
7872 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7876 bmap = isl_basic_map_simplify(bmap);
7877 bmap = isl_basic_map_finalize(bmap);
7878 return isl_map_from_basic_map(bmap);
7881 isl_basic_map_free(bmap);
7885 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7893 dim = isl_basic_set_total_dim(bset);
7894 size += bset->n_eq * (1 + dim);
7895 size += bset->n_ineq * (1 + dim);
7896 size += bset->n_div * (2 + dim);
7901 int isl_set_size(__isl_keep isl_set *set)
7909 for (i = 0; i < set->n; ++i)
7910 size += isl_basic_set_size(set->p[i]);
7915 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7916 enum isl_dim_type type, unsigned pos)
7924 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7926 pos += isl_basic_map_offset(bmap, type);
7928 for (i = 0; i < bmap->n_eq; ++i)
7929 if (!isl_int_is_zero(bmap->eq[i][pos]))
7933 for (i = 0; i < bmap->n_ineq; ++i) {
7934 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7941 return lower && upper;
7944 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7945 enum isl_dim_type type, unsigned pos)
7952 for (i = 0; i < map->n; ++i) {
7954 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7955 if (bounded < 0 || !bounded)
7962 /* Return 1 if the specified dim is involved in both an upper bound
7963 * and a lower bound.
7965 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7966 enum isl_dim_type type, unsigned pos)
7968 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7971 /* For each of the "n" variables starting at "first", determine
7972 * the sign of the variable and put the results in the first "n"
7973 * elements of the array "signs".
7975 * 1 means that the variable is non-negative
7976 * -1 means that the variable is non-positive
7977 * 0 means the variable attains both positive and negative values.
7979 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7980 unsigned first, unsigned n, int *signs)
7982 isl_vec *bound = NULL;
7983 struct isl_tab *tab = NULL;
7984 struct isl_tab_undo *snap;
7987 if (!bset || !signs)
7990 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7991 tab = isl_tab_from_basic_set(bset);
7995 isl_seq_clr(bound->el, bound->size);
7996 isl_int_set_si(bound->el[0], -1);
7998 snap = isl_tab_snap(tab);
7999 for (i = 0; i < n; ++i) {
8002 isl_int_set_si(bound->el[1 + first + i], -1);
8003 if (isl_tab_add_ineq(tab, bound->el) < 0)
8006 isl_int_set_si(bound->el[1 + first + i], 0);
8007 if (isl_tab_rollback(tab, snap) < 0)
8015 isl_int_set_si(bound->el[1 + first + i], 1);
8016 if (isl_tab_add_ineq(tab, bound->el) < 0)
8019 isl_int_set_si(bound->el[1 + first + i], 0);
8020 if (isl_tab_rollback(tab, snap) < 0)
8023 signs[i] = empty ? -1 : 0;
8027 isl_vec_free(bound);
8031 isl_vec_free(bound);
8035 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
8036 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
8038 if (!bset || !signs)
8040 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
8043 first += pos(bset->dim, type) - 1;
8044 return isl_basic_set_vars_get_sign(bset, first, n, signs);
8047 /* Check if the given basic map is obviously single-valued.
8048 * In particular, for each output dimension, check that there is
8049 * an equality that defines the output dimension in terms of
8050 * earlier dimensions.
8052 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
8062 total = 1 + isl_basic_map_total_dim(bmap);
8063 n_out = isl_basic_map_dim(bmap, isl_dim_out);
8064 o_out = isl_basic_map_offset(bmap, isl_dim_out);
8066 for (i = 0; i < n_out; ++i) {
8067 for (j = 0; j < bmap->n_eq; ++j) {
8068 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
8070 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
8071 total - (o_out + i + 1)) == -1)
8074 if (j >= bmap->n_eq)
8081 /* Check if the given map is obviously single-valued.
8083 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
8092 return isl_basic_map_plain_is_single_valued(map->p[0]);
8095 /* Check if the given map is single-valued.
8100 * and check if the result is a subset of the identity mapping.
8102 int isl_map_is_single_valued(__isl_keep isl_map *map)
8109 sv = isl_map_plain_is_single_valued(map);
8113 test = isl_map_reverse(isl_map_copy(map));
8114 test = isl_map_apply_range(test, isl_map_copy(map));
8116 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
8117 id = isl_map_identity(dim);
8119 sv = isl_map_is_subset(test, id);
8127 int isl_map_is_injective(__isl_keep isl_map *map)
8131 map = isl_map_copy(map);
8132 map = isl_map_reverse(map);
8133 in = isl_map_is_single_valued(map);
8139 /* Check if the given map is obviously injective.
8141 int isl_map_plain_is_injective(__isl_keep isl_map *map)
8145 map = isl_map_copy(map);
8146 map = isl_map_reverse(map);
8147 in = isl_map_plain_is_single_valued(map);
8153 int isl_map_is_bijective(__isl_keep isl_map *map)
8157 sv = isl_map_is_single_valued(map);
8161 return isl_map_is_injective(map);
8164 int isl_set_is_singleton(__isl_keep isl_set *set)
8166 return isl_map_is_single_valued((isl_map *)set);
8169 int isl_map_is_translation(__isl_keep isl_map *map)
8174 delta = isl_map_deltas(isl_map_copy(map));
8175 ok = isl_set_is_singleton(delta);
8176 isl_set_free(delta);
8181 static int unique(isl_int *p, unsigned pos, unsigned len)
8183 if (isl_seq_first_non_zero(p, pos) != -1)
8185 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8190 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8199 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8202 nvar = isl_basic_set_dim(bset, isl_dim_set);
8203 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8204 for (j = 0; j < nvar; ++j) {
8205 int lower = 0, upper = 0;
8206 for (i = 0; i < bset->n_eq; ++i) {
8207 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8209 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8215 for (i = 0; i < bset->n_ineq; ++i) {
8216 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8218 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8220 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8225 if (!lower || !upper)
8232 int isl_set_is_box(__isl_keep isl_set *set)
8239 return isl_basic_set_is_box(set->p[0]);
8242 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8247 return isl_dim_is_wrapping(bset->dim);
8250 int isl_set_is_wrapping(__isl_keep isl_set *set)
8255 return isl_dim_is_wrapping(set->dim);
8258 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8260 bmap = isl_basic_map_cow(bmap);
8264 bmap->dim = isl_dim_wrap(bmap->dim);
8268 bmap = isl_basic_map_finalize(bmap);
8270 return (isl_basic_set *)bmap;
8272 isl_basic_map_free(bmap);
8276 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8280 map = isl_map_cow(map);
8284 for (i = 0; i < map->n; ++i) {
8285 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8289 map->dim = isl_dim_wrap(map->dim);
8293 return (isl_set *)map;
8299 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8301 bset = isl_basic_set_cow(bset);
8305 bset->dim = isl_dim_unwrap(bset->dim);
8309 bset = isl_basic_set_finalize(bset);
8311 return (isl_basic_map *)bset;
8313 isl_basic_set_free(bset);
8317 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8324 if (!isl_set_is_wrapping(set))
8325 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8328 set = isl_set_cow(set);
8332 for (i = 0; i < set->n; ++i) {
8333 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8338 set->dim = isl_dim_unwrap(set->dim);
8342 return (isl_map *)set;
8348 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8349 enum isl_dim_type type)
8354 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8357 bmap = isl_basic_map_cow(bmap);
8361 bmap->dim = isl_dim_reset(bmap->dim, type);
8365 bmap = isl_basic_map_finalize(bmap);
8369 isl_basic_map_free(bmap);
8373 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8374 enum isl_dim_type type)
8381 if (!isl_dim_is_named_or_nested(map->dim, type))
8384 map = isl_map_cow(map);
8388 for (i = 0; i < map->n; ++i) {
8389 map->p[i] = isl_basic_map_reset(map->p[i], type);
8393 map->dim = isl_dim_reset(map->dim, type);
8403 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8408 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8411 bmap = isl_basic_map_cow(bmap);
8415 bmap->dim = isl_dim_flatten(bmap->dim);
8419 bmap = isl_basic_map_finalize(bmap);
8423 isl_basic_map_free(bmap);
8427 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8429 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8432 __isl_give isl_basic_map *isl_basic_map_flatten_range(
8433 __isl_take isl_basic_map *bmap)
8438 if (!bmap->dim->nested[1])
8441 bmap = isl_basic_map_cow(bmap);
8445 bmap->dim = isl_dim_flatten_range(bmap->dim);
8449 bmap = isl_basic_map_finalize(bmap);
8453 isl_basic_map_free(bmap);
8457 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8464 if (!map->dim->nested[0] && !map->dim->nested[1])
8467 map = isl_map_cow(map);
8471 for (i = 0; i < map->n; ++i) {
8472 map->p[i] = isl_basic_map_flatten(map->p[i]);
8476 map->dim = isl_dim_flatten(map->dim);
8486 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8488 return (isl_set *)isl_map_flatten((isl_map *)set);
8491 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8493 isl_dim *dim, *flat_dim;
8496 dim = isl_set_get_dim(set);
8497 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8498 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8499 map = isl_map_intersect_domain(map, set);
8504 __isl_give isl_map *isl_map_flatten_range(__isl_take isl_map *map)
8511 if (!map->dim->nested[1])
8514 map = isl_map_cow(map);
8518 for (i = 0; i < map->n; ++i) {
8519 map->p[i] = isl_basic_map_flatten_range(map->p[i]);
8523 map->dim = isl_dim_flatten_range(map->dim);
8533 /* Reorder the dimensions of "bmap" according to the given dim_map
8534 * and set the dimension specification to "dim".
8536 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8537 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8541 bmap = isl_basic_map_cow(bmap);
8542 if (!bmap || !dim || !dim_map)
8545 res = isl_basic_map_alloc_dim(dim,
8546 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8547 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8548 res = isl_basic_map_finalize(res);
8552 isl_basic_map_free(bmap);
8557 /* Reorder the dimensions of "map" according to given reordering.
8559 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8560 __isl_take isl_reordering *r)
8563 struct isl_dim_map *dim_map;
8565 map = isl_map_cow(map);
8566 dim_map = isl_dim_map_from_reordering(r);
8567 if (!map || !r || !dim_map)
8570 for (i = 0; i < map->n; ++i) {
8571 struct isl_dim_map *dim_map_i;
8573 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8575 map->p[i] = isl_basic_map_realign(map->p[i],
8576 isl_dim_copy(r->dim), dim_map_i);
8582 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8584 isl_reordering_free(r);
8590 isl_reordering_free(r);
8594 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8595 __isl_take isl_reordering *r)
8597 return (isl_set *)isl_map_realign((isl_map *)set, r);
8600 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8601 __isl_take isl_dim *model)
8608 ctx = isl_dim_get_ctx(model);
8609 if (!isl_dim_has_named_params(model))
8610 isl_die(ctx, isl_error_invalid,
8611 "model has unnamed parameters", goto error);
8612 if (!isl_dim_has_named_params(map->dim))
8613 isl_die(ctx, isl_error_invalid,
8614 "relation has unnamed parameters", goto error);
8615 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8616 isl_reordering *exp;
8618 model = isl_dim_drop(model, isl_dim_in,
8619 0, isl_dim_size(model, isl_dim_in));
8620 model = isl_dim_drop(model, isl_dim_out,
8621 0, isl_dim_size(model, isl_dim_out));
8622 exp = isl_parameter_alignment_reordering(map->dim, model);
8623 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8624 map = isl_map_realign(map, exp);
8627 isl_dim_free(model);
8630 isl_dim_free(model);
8635 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8636 __isl_take isl_dim *model)
8638 return isl_map_align_params(set, model);
8641 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8642 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8643 enum isl_dim_type c2, enum isl_dim_type c3,
8644 enum isl_dim_type c4, enum isl_dim_type c5)
8646 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8647 struct isl_mat *mat;
8653 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8654 isl_basic_map_total_dim(bmap) + 1);
8657 for (i = 0; i < bmap->n_eq; ++i)
8658 for (j = 0, pos = 0; j < 5; ++j) {
8659 int off = isl_basic_map_offset(bmap, c[j]);
8660 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8661 isl_int_set(mat->row[i][pos],
8662 bmap->eq[i][off + k]);
8670 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8671 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8672 enum isl_dim_type c2, enum isl_dim_type c3,
8673 enum isl_dim_type c4, enum isl_dim_type c5)
8675 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8676 struct isl_mat *mat;
8682 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8683 isl_basic_map_total_dim(bmap) + 1);
8686 for (i = 0; i < bmap->n_ineq; ++i)
8687 for (j = 0, pos = 0; j < 5; ++j) {
8688 int off = isl_basic_map_offset(bmap, c[j]);
8689 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8690 isl_int_set(mat->row[i][pos],
8691 bmap->ineq[i][off + k]);
8699 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8700 __isl_take isl_dim *dim,
8701 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8702 enum isl_dim_type c2, enum isl_dim_type c3,
8703 enum isl_dim_type c4, enum isl_dim_type c5)
8705 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8706 isl_basic_map *bmap;
8712 if (!dim || !eq || !ineq)
8715 if (eq->n_col != ineq->n_col)
8716 isl_die(dim->ctx, isl_error_invalid,
8717 "equalities and inequalities matrices should have "
8718 "same number of columns", goto error);
8720 total = 1 + isl_dim_total(dim);
8722 if (eq->n_col < total)
8723 isl_die(dim->ctx, isl_error_invalid,
8724 "number of columns too small", goto error);
8726 extra = eq->n_col - total;
8728 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8729 eq->n_row, ineq->n_row);
8732 for (i = 0; i < extra; ++i) {
8733 k = isl_basic_map_alloc_div(bmap);
8736 isl_int_set_si(bmap->div[k][0], 0);
8738 for (i = 0; i < eq->n_row; ++i) {
8739 l = isl_basic_map_alloc_equality(bmap);
8742 for (j = 0, pos = 0; j < 5; ++j) {
8743 int off = isl_basic_map_offset(bmap, c[j]);
8744 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8745 isl_int_set(bmap->eq[l][off + k],
8751 for (i = 0; i < ineq->n_row; ++i) {
8752 l = isl_basic_map_alloc_inequality(bmap);
8755 for (j = 0, pos = 0; j < 5; ++j) {
8756 int off = isl_basic_map_offset(bmap, c[j]);
8757 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8758 isl_int_set(bmap->ineq[l][off + k],
8777 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8778 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8779 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8781 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8782 c1, c2, c3, c4, isl_dim_in);
8785 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8786 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8787 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8789 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8790 c1, c2, c3, c4, isl_dim_in);
8793 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8794 __isl_take isl_dim *dim,
8795 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8796 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8798 return (isl_basic_set*)
8799 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8800 c1, c2, c3, c4, isl_dim_in);
8803 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
8808 return isl_dim_can_zip(bmap->dim);
8811 int isl_map_can_zip(__isl_keep isl_map *map)
8816 return isl_dim_can_zip(map->dim);
8819 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8820 * (A -> C) -> (B -> D).
8822 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
8831 if (!isl_basic_map_can_zip(bmap))
8832 isl_die(bmap->ctx, isl_error_invalid,
8833 "basic map cannot be zipped", goto error);
8834 pos = isl_basic_map_offset(bmap, isl_dim_in) +
8835 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
8836 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
8837 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
8838 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
8841 bmap->dim = isl_dim_zip(bmap->dim);
8846 isl_basic_map_free(bmap);
8850 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8851 * (A -> C) -> (B -> D).
8853 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
8860 if (!isl_map_can_zip(map))
8861 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
8864 map = isl_map_cow(map);
8868 for (i = 0; i < map->n; ++i) {
8869 map->p[i] = isl_basic_map_zip(map->p[i]);
8874 map->dim = isl_dim_zip(map->dim);
8884 /* Construct a basic map mapping the domain of the affine expression
8885 * to a one-dimensional range prescribed by the affine expression.
8887 __isl_give isl_basic_map *isl_basic_map_from_aff(__isl_take isl_aff *aff)
8891 isl_local_space *ls;
8892 isl_basic_map *bmap;
8897 ls = isl_aff_get_local_space(aff);
8898 ls = isl_local_space_from_domain(ls);
8899 ls = isl_local_space_add_dims(ls, isl_dim_out, 1);
8900 bmap = isl_basic_map_from_local_space(ls);
8901 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
8902 k = isl_basic_map_alloc_equality(bmap);
8906 pos = isl_basic_map_offset(bmap, isl_dim_out);
8907 isl_seq_cpy(bmap->eq[k], aff->v->el + 1, pos);
8908 isl_int_neg(bmap->eq[k][pos], aff->v->el[0]);
8909 isl_seq_cpy(bmap->eq[k] + pos + 1, aff->v->el + 1 + pos,
8910 aff->v->size - (pos + 1));
8913 bmap = isl_basic_map_finalize(bmap);
8917 isl_basic_map_free(bmap);
8921 /* Construct a basic map mapping a domain in the given space to
8922 * to an n-dimensional range, with n the number of elements in the list,
8923 * where each coordinate in the range is prescribed by the
8924 * corresponding affine expression.
8925 * The domains of all affine expressions in the list are assumed to match
8928 __isl_give isl_basic_map *isl_basic_map_from_aff_list(
8929 __isl_take isl_dim *domain_dim, __isl_take isl_aff_list *list)
8933 isl_basic_map *bmap;
8938 dim = isl_dim_from_domain(domain_dim);
8939 bmap = isl_basic_map_universe(dim);
8941 for (i = 0; i < list->n; ++i) {
8943 isl_basic_map *bmap_i;
8945 aff = isl_aff_copy(list->p[i]);
8946 bmap_i = isl_basic_map_from_aff(aff);
8948 bmap = isl_basic_map_flat_range_product(bmap, bmap_i);
8951 isl_aff_list_free(list);