2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2010 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
7 * Written by Sven Verdoolaege, K.U.Leuven, Departement
8 * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
9 * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
10 * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
15 #include <isl_ctx_private.h>
16 #include <isl_map_private.h>
18 #include "isl_dim_private.h"
19 #include "isl_equalities.h"
25 #include "isl_map_piplib.h"
26 #include <isl_reordering.h>
27 #include "isl_sample.h"
30 #include <isl_mat_private.h>
31 #include <isl_dim_map.h>
32 #include <isl_local_space_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->dim->n_in;
167 unsigned isl_map_n_out(const struct isl_map *map)
169 return map->dim->n_out;
172 unsigned isl_map_n_param(const struct isl_map *map)
174 return map->dim->nparam;
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 const char *isl_basic_map_get_tuple_name(__isl_keep isl_basic_map *bmap,
353 enum isl_dim_type type)
355 return bmap ? isl_dim_get_tuple_name(bmap->dim, type) : NULL;
358 __isl_give isl_map *isl_map_set_tuple_name(__isl_take isl_map *map,
359 enum isl_dim_type type, const char *s)
363 map = isl_map_cow(map);
367 map->dim = isl_dim_set_tuple_name(map->dim, type, s);
371 for (i = 0; i < map->n; ++i) {
372 map->p[i] = isl_basic_map_set_tuple_name(map->p[i], type, s);
383 const char *isl_map_get_tuple_name(__isl_keep isl_map *map,
384 enum isl_dim_type type)
386 return map ? isl_dim_get_tuple_name(map->dim, type) : NULL;
389 __isl_give isl_set *isl_set_set_tuple_name(__isl_take isl_set *set,
392 return (isl_set *)isl_map_set_tuple_name((isl_map *)set, isl_dim_set, s);
395 const char *isl_basic_set_get_tuple_name(__isl_keep isl_basic_set *bset)
397 return bset ? isl_dim_get_tuple_name(bset->dim, isl_dim_set) : NULL;
400 const char *isl_set_get_tuple_name(__isl_keep isl_set *set)
402 return set ? isl_dim_get_tuple_name(set->dim, isl_dim_set) : NULL;
405 const char *isl_basic_map_get_dim_name(__isl_keep isl_basic_map *bmap,
406 enum isl_dim_type type, unsigned pos)
408 return bmap ? isl_dim_get_name(bmap->dim, type, pos) : NULL;
411 const char *isl_basic_set_get_dim_name(__isl_keep isl_basic_set *bset,
412 enum isl_dim_type type, unsigned pos)
414 return bset ? isl_dim_get_name(bset->dim, type, pos) : NULL;
417 const char *isl_map_get_dim_name(__isl_keep isl_map *map,
418 enum isl_dim_type type, unsigned pos)
420 return map ? isl_dim_get_name(map->dim, type, pos) : NULL;
423 const char *isl_set_get_dim_name(__isl_keep isl_set *set,
424 enum isl_dim_type type, unsigned pos)
426 return set ? isl_dim_get_name(set->dim, type, pos) : NULL;
429 __isl_give isl_basic_map *isl_basic_map_set_dim_name(
430 __isl_take isl_basic_map *bmap,
431 enum isl_dim_type type, unsigned pos, const char *s)
435 bmap->dim = isl_dim_set_name(bmap->dim, type, pos, s);
440 isl_basic_map_free(bmap);
444 __isl_give isl_map *isl_map_set_dim_name(__isl_take isl_map *map,
445 enum isl_dim_type type, unsigned pos, const char *s)
452 map->dim = isl_dim_set_name(map->dim, type, pos, s);
456 for (i = 0; i < map->n; ++i) {
457 map->p[i] = isl_basic_map_set_dim_name(map->p[i], type, pos, s);
468 __isl_give isl_basic_set *isl_basic_set_set_dim_name(
469 __isl_take isl_basic_set *bset,
470 enum isl_dim_type type, unsigned pos, const char *s)
472 return (isl_basic_set *)isl_basic_map_set_dim_name(
473 (isl_basic_map *)bset, type, pos, s);
476 __isl_give isl_set *isl_set_set_dim_name(__isl_take isl_set *set,
477 enum isl_dim_type type, unsigned pos, const char *s)
479 return (isl_set *)isl_map_set_dim_name((isl_map *)set, type, pos, s);
482 int isl_basic_map_is_rational(__isl_keep isl_basic_map *bmap)
486 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
489 int isl_basic_set_is_rational(__isl_keep isl_basic_set *bset)
491 return isl_basic_map_is_rational(bset);
494 static struct isl_basic_map *basic_map_init(struct isl_ctx *ctx,
495 struct isl_basic_map *bmap, unsigned extra,
496 unsigned n_eq, unsigned n_ineq)
499 size_t row_size = 1 + isl_dim_total(bmap->dim) + extra;
504 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
505 if (isl_blk_is_error(bmap->block))
508 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
513 bmap->block2 = isl_blk_empty();
516 bmap->block2 = isl_blk_alloc(ctx, extra * (1 + row_size));
517 if (isl_blk_is_error(bmap->block2))
520 bmap->div = isl_alloc_array(ctx, isl_int *, extra);
525 for (i = 0; i < n_ineq + n_eq; ++i)
526 bmap->ineq[i] = bmap->block.data + i * row_size;
528 for (i = 0; i < extra; ++i)
529 bmap->div[i] = bmap->block2.data + i * (1 + row_size);
533 bmap->c_size = n_eq + n_ineq;
534 bmap->eq = bmap->ineq + n_ineq;
543 isl_basic_map_free(bmap);
547 struct isl_basic_set *isl_basic_set_alloc(struct isl_ctx *ctx,
548 unsigned nparam, unsigned dim, unsigned extra,
549 unsigned n_eq, unsigned n_ineq)
551 struct isl_basic_map *bmap;
552 bmap = isl_basic_map_alloc(ctx, nparam, 0, dim, extra, n_eq, n_ineq);
553 return (struct isl_basic_set *)bmap;
556 struct isl_basic_set *isl_basic_set_alloc_dim(struct isl_dim *dim,
557 unsigned extra, unsigned n_eq, unsigned n_ineq)
559 struct isl_basic_map *bmap;
562 isl_assert(dim->ctx, dim->n_in == 0, goto error);
563 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
564 return (struct isl_basic_set *)bmap;
570 struct isl_basic_map *isl_basic_map_alloc_dim(struct isl_dim *dim,
571 unsigned extra, unsigned n_eq, unsigned n_ineq)
573 struct isl_basic_map *bmap;
577 bmap = isl_calloc_type(dim->ctx, struct isl_basic_map);
582 return basic_map_init(dim->ctx, bmap, extra, n_eq, n_ineq);
588 struct isl_basic_map *isl_basic_map_alloc(struct isl_ctx *ctx,
589 unsigned nparam, unsigned in, unsigned out, unsigned extra,
590 unsigned n_eq, unsigned n_ineq)
592 struct isl_basic_map *bmap;
595 dim = isl_dim_alloc(ctx, nparam, in, out);
599 bmap = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
603 static void dup_constraints(
604 struct isl_basic_map *dst, struct isl_basic_map *src)
607 unsigned total = isl_basic_map_total_dim(src);
609 for (i = 0; i < src->n_eq; ++i) {
610 int j = isl_basic_map_alloc_equality(dst);
611 isl_seq_cpy(dst->eq[j], src->eq[i], 1+total);
614 for (i = 0; i < src->n_ineq; ++i) {
615 int j = isl_basic_map_alloc_inequality(dst);
616 isl_seq_cpy(dst->ineq[j], src->ineq[i], 1+total);
619 for (i = 0; i < src->n_div; ++i) {
620 int j = isl_basic_map_alloc_div(dst);
621 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total);
623 ISL_F_SET(dst, ISL_BASIC_SET_FINAL);
626 struct isl_basic_map *isl_basic_map_dup(struct isl_basic_map *bmap)
628 struct isl_basic_map *dup;
632 dup = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
633 bmap->n_div, bmap->n_eq, bmap->n_ineq);
636 dup_constraints(dup, bmap);
637 dup->flags = bmap->flags;
638 dup->sample = isl_vec_copy(bmap->sample);
642 struct isl_basic_set *isl_basic_set_dup(struct isl_basic_set *bset)
644 struct isl_basic_map *dup;
646 dup = isl_basic_map_dup((struct isl_basic_map *)bset);
647 return (struct isl_basic_set *)dup;
650 struct isl_basic_set *isl_basic_set_copy(struct isl_basic_set *bset)
655 if (ISL_F_ISSET(bset, ISL_BASIC_SET_FINAL)) {
659 return isl_basic_set_dup(bset);
662 struct isl_set *isl_set_copy(struct isl_set *set)
671 struct isl_basic_map *isl_basic_map_copy(struct isl_basic_map *bmap)
676 if (ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL)) {
680 bmap = isl_basic_map_dup(bmap);
682 ISL_F_SET(bmap, ISL_BASIC_SET_FINAL);
686 struct isl_map *isl_map_copy(struct isl_map *map)
695 void isl_basic_map_free(struct isl_basic_map *bmap)
703 isl_ctx_deref(bmap->ctx);
705 isl_blk_free(bmap->ctx, bmap->block2);
707 isl_blk_free(bmap->ctx, bmap->block);
708 isl_vec_free(bmap->sample);
709 isl_dim_free(bmap->dim);
713 void isl_basic_set_free(struct isl_basic_set *bset)
715 isl_basic_map_free((struct isl_basic_map *)bset);
718 static int room_for_con(struct isl_basic_map *bmap, unsigned n)
720 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
723 int isl_basic_map_alloc_equality(struct isl_basic_map *bmap)
729 isl_assert(ctx, room_for_con(bmap, 1), return -1);
730 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
732 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
733 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
734 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
735 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
736 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
737 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
739 int j = isl_basic_map_alloc_inequality(bmap);
743 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
744 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
751 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
752 bmap->extra - bmap->n_div);
756 int isl_basic_set_alloc_equality(struct isl_basic_set *bset)
758 return isl_basic_map_alloc_equality((struct isl_basic_map *)bset);
761 int isl_basic_map_free_equality(struct isl_basic_map *bmap, unsigned n)
765 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
770 int isl_basic_set_free_equality(struct isl_basic_set *bset, unsigned n)
772 return isl_basic_map_free_equality((struct isl_basic_map *)bset, n);
775 int isl_basic_map_drop_equality(struct isl_basic_map *bmap, unsigned pos)
780 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
782 if (pos != bmap->n_eq - 1) {
784 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
785 bmap->eq[bmap->n_eq - 1] = t;
791 int isl_basic_set_drop_equality(struct isl_basic_set *bset, unsigned pos)
793 return isl_basic_map_drop_equality((struct isl_basic_map *)bset, pos);
796 void isl_basic_map_inequality_to_equality(
797 struct isl_basic_map *bmap, unsigned pos)
802 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
803 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
808 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
809 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
810 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
811 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
814 static int room_for_ineq(struct isl_basic_map *bmap, unsigned n)
816 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
819 int isl_basic_map_alloc_inequality(struct isl_basic_map *bmap)
825 isl_assert(ctx, room_for_ineq(bmap, 1), return -1);
826 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_IMPLICIT);
827 ISL_F_CLR(bmap, ISL_BASIC_MAP_NO_REDUNDANT);
828 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
829 ISL_F_CLR(bmap, ISL_BASIC_MAP_ALL_EQUALITIES);
830 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
831 1 + isl_basic_map_total_dim(bmap),
832 bmap->extra - bmap->n_div);
833 return bmap->n_ineq++;
836 int isl_basic_set_alloc_inequality(struct isl_basic_set *bset)
838 return isl_basic_map_alloc_inequality((struct isl_basic_map *)bset);
841 int isl_basic_map_free_inequality(struct isl_basic_map *bmap, unsigned n)
845 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
850 int isl_basic_set_free_inequality(struct isl_basic_set *bset, unsigned n)
852 return isl_basic_map_free_inequality((struct isl_basic_map *)bset, n);
855 int isl_basic_map_drop_inequality(struct isl_basic_map *bmap, unsigned pos)
860 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
862 if (pos != bmap->n_ineq - 1) {
864 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
865 bmap->ineq[bmap->n_ineq - 1] = t;
866 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
872 int isl_basic_set_drop_inequality(struct isl_basic_set *bset, unsigned pos)
874 return isl_basic_map_drop_inequality((struct isl_basic_map *)bset, pos);
877 __isl_give isl_basic_map *isl_basic_map_add_eq(__isl_take isl_basic_map *bmap,
882 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
885 k = isl_basic_map_alloc_equality(bmap);
888 isl_seq_cpy(bmap->eq[k], eq, 1 + isl_basic_map_total_dim(bmap));
891 isl_basic_map_free(bmap);
895 __isl_give isl_basic_set *isl_basic_set_add_eq(__isl_take isl_basic_set *bset,
898 return (isl_basic_set *)
899 isl_basic_map_add_eq((isl_basic_map *)bset, eq);
902 __isl_give isl_basic_map *isl_basic_map_add_ineq(__isl_take isl_basic_map *bmap,
907 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
910 k = isl_basic_map_alloc_inequality(bmap);
913 isl_seq_cpy(bmap->ineq[k], ineq, 1 + isl_basic_map_total_dim(bmap));
916 isl_basic_map_free(bmap);
920 __isl_give isl_basic_set *isl_basic_set_add_ineq(__isl_take isl_basic_set *bset,
923 return (isl_basic_set *)
924 isl_basic_map_add_ineq((isl_basic_map *)bset, ineq);
927 int isl_basic_map_alloc_div(struct isl_basic_map *bmap)
931 isl_assert(bmap->ctx, bmap->n_div < bmap->extra, return -1);
932 isl_seq_clr(bmap->div[bmap->n_div] +
933 1 + 1 + isl_basic_map_total_dim(bmap),
934 bmap->extra - bmap->n_div);
935 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED_DIVS);
936 return bmap->n_div++;
939 int isl_basic_set_alloc_div(struct isl_basic_set *bset)
941 return isl_basic_map_alloc_div((struct isl_basic_map *)bset);
944 int isl_basic_map_free_div(struct isl_basic_map *bmap, unsigned n)
948 isl_assert(bmap->ctx, n <= bmap->n_div, return -1);
953 int isl_basic_set_free_div(struct isl_basic_set *bset, unsigned n)
955 return isl_basic_map_free_div((struct isl_basic_map *)bset, n);
958 /* Copy constraint from src to dst, putting the vars of src at offset
959 * dim_off in dst and the divs of src at offset div_off in dst.
960 * If both sets are actually map, then dim_off applies to the input
963 static void copy_constraint(struct isl_basic_map *dst_map, isl_int *dst,
964 struct isl_basic_map *src_map, isl_int *src,
965 unsigned in_off, unsigned out_off, unsigned div_off)
967 unsigned src_nparam = isl_basic_map_n_param(src_map);
968 unsigned dst_nparam = isl_basic_map_n_param(dst_map);
969 unsigned src_in = isl_basic_map_n_in(src_map);
970 unsigned dst_in = isl_basic_map_n_in(dst_map);
971 unsigned src_out = isl_basic_map_n_out(src_map);
972 unsigned dst_out = isl_basic_map_n_out(dst_map);
973 isl_int_set(dst[0], src[0]);
974 isl_seq_cpy(dst+1, src+1, isl_min(dst_nparam, src_nparam));
975 if (dst_nparam > src_nparam)
976 isl_seq_clr(dst+1+src_nparam,
977 dst_nparam - src_nparam);
978 isl_seq_clr(dst+1+dst_nparam, in_off);
979 isl_seq_cpy(dst+1+dst_nparam+in_off,
981 isl_min(dst_in-in_off, src_in));
982 if (dst_in-in_off > src_in)
983 isl_seq_clr(dst+1+dst_nparam+in_off+src_in,
984 dst_in - in_off - src_in);
985 isl_seq_clr(dst+1+dst_nparam+dst_in, out_off);
986 isl_seq_cpy(dst+1+dst_nparam+dst_in+out_off,
987 src+1+src_nparam+src_in,
988 isl_min(dst_out-out_off, src_out));
989 if (dst_out-out_off > src_out)
990 isl_seq_clr(dst+1+dst_nparam+dst_in+out_off+src_out,
991 dst_out - out_off - src_out);
992 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out, div_off);
993 isl_seq_cpy(dst+1+dst_nparam+dst_in+dst_out+div_off,
994 src+1+src_nparam+src_in+src_out,
995 isl_min(dst_map->extra-div_off, src_map->n_div));
996 if (dst_map->n_div-div_off > src_map->n_div)
997 isl_seq_clr(dst+1+dst_nparam+dst_in+dst_out+
998 div_off+src_map->n_div,
999 dst_map->n_div - div_off - src_map->n_div);
1002 static void copy_div(struct isl_basic_map *dst_map, isl_int *dst,
1003 struct isl_basic_map *src_map, isl_int *src,
1004 unsigned in_off, unsigned out_off, unsigned div_off)
1006 isl_int_set(dst[0], src[0]);
1007 copy_constraint(dst_map, dst+1, src_map, src+1, in_off, out_off, div_off);
1010 static struct isl_basic_map *add_constraints(struct isl_basic_map *bmap1,
1011 struct isl_basic_map *bmap2, unsigned i_pos, unsigned o_pos)
1016 if (!bmap1 || !bmap2)
1019 div_off = bmap1->n_div;
1021 for (i = 0; i < bmap2->n_eq; ++i) {
1022 int i1 = isl_basic_map_alloc_equality(bmap1);
1025 copy_constraint(bmap1, bmap1->eq[i1], bmap2, bmap2->eq[i],
1026 i_pos, o_pos, div_off);
1029 for (i = 0; i < bmap2->n_ineq; ++i) {
1030 int i1 = isl_basic_map_alloc_inequality(bmap1);
1033 copy_constraint(bmap1, bmap1->ineq[i1], bmap2, bmap2->ineq[i],
1034 i_pos, o_pos, div_off);
1037 for (i = 0; i < bmap2->n_div; ++i) {
1038 int i1 = isl_basic_map_alloc_div(bmap1);
1041 copy_div(bmap1, bmap1->div[i1], bmap2, bmap2->div[i],
1042 i_pos, o_pos, div_off);
1045 isl_basic_map_free(bmap2);
1050 isl_basic_map_free(bmap1);
1051 isl_basic_map_free(bmap2);
1055 struct isl_basic_set *isl_basic_set_add_constraints(struct isl_basic_set *bset1,
1056 struct isl_basic_set *bset2, unsigned pos)
1058 return (struct isl_basic_set *)
1059 add_constraints((struct isl_basic_map *)bset1,
1060 (struct isl_basic_map *)bset2, 0, pos);
1063 struct isl_basic_map *isl_basic_map_extend_dim(struct isl_basic_map *base,
1064 struct isl_dim *dim, unsigned extra,
1065 unsigned n_eq, unsigned n_ineq)
1067 struct isl_basic_map *ext;
1077 dims_ok = isl_dim_equal(base->dim, dim) &&
1078 base->extra >= base->n_div + extra;
1080 if (dims_ok && room_for_con(base, n_eq + n_ineq) &&
1081 room_for_ineq(base, n_ineq)) {
1086 isl_assert(base->ctx, base->dim->nparam <= dim->nparam, goto error);
1087 isl_assert(base->ctx, base->dim->n_in <= dim->n_in, goto error);
1088 isl_assert(base->ctx, base->dim->n_out <= dim->n_out, goto error);
1089 extra += base->extra;
1091 n_ineq += base->n_ineq;
1093 ext = isl_basic_map_alloc_dim(dim, extra, n_eq, n_ineq);
1099 ext->sample = isl_vec_copy(base->sample);
1100 flags = base->flags;
1101 ext = add_constraints(ext, base, 0, 0);
1104 ISL_F_CLR(ext, ISL_BASIC_SET_FINAL);
1111 isl_basic_map_free(base);
1115 struct isl_basic_set *isl_basic_set_extend_dim(struct isl_basic_set *base,
1116 struct isl_dim *dim, unsigned extra,
1117 unsigned n_eq, unsigned n_ineq)
1119 return (struct isl_basic_set *)
1120 isl_basic_map_extend_dim((struct isl_basic_map *)base, dim,
1121 extra, n_eq, n_ineq);
1124 struct isl_basic_map *isl_basic_map_extend_constraints(
1125 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq)
1129 return isl_basic_map_extend_dim(base, isl_dim_copy(base->dim),
1133 struct isl_basic_map *isl_basic_map_extend(struct isl_basic_map *base,
1134 unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra,
1135 unsigned n_eq, unsigned n_ineq)
1137 struct isl_basic_map *bmap;
1138 struct isl_dim *dim;
1142 dim = isl_dim_alloc(base->ctx, nparam, n_in, n_out);
1146 bmap = isl_basic_map_extend_dim(base, dim, extra, n_eq, n_ineq);
1149 isl_basic_map_free(base);
1153 struct isl_basic_set *isl_basic_set_extend(struct isl_basic_set *base,
1154 unsigned nparam, unsigned dim, unsigned extra,
1155 unsigned n_eq, unsigned n_ineq)
1157 return (struct isl_basic_set *)
1158 isl_basic_map_extend((struct isl_basic_map *)base,
1159 nparam, 0, dim, extra, n_eq, n_ineq);
1162 struct isl_basic_set *isl_basic_set_extend_constraints(
1163 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq)
1165 return (struct isl_basic_set *)
1166 isl_basic_map_extend_constraints((struct isl_basic_map *)base,
1170 struct isl_basic_set *isl_basic_set_cow(struct isl_basic_set *bset)
1172 return (struct isl_basic_set *)
1173 isl_basic_map_cow((struct isl_basic_map *)bset);
1176 struct isl_basic_map *isl_basic_map_cow(struct isl_basic_map *bmap)
1181 if (bmap->ref > 1) {
1183 bmap = isl_basic_map_dup(bmap);
1186 ISL_F_CLR(bmap, ISL_BASIC_SET_FINAL);
1190 struct isl_set *isl_set_cow(struct isl_set *set)
1198 return isl_set_dup(set);
1201 struct isl_map *isl_map_cow(struct isl_map *map)
1209 return isl_map_dup(map);
1212 static void swap_vars(struct isl_blk blk, isl_int *a,
1213 unsigned a_len, unsigned b_len)
1215 isl_seq_cpy(blk.data, a+a_len, b_len);
1216 isl_seq_cpy(blk.data+b_len, a, a_len);
1217 isl_seq_cpy(a, blk.data, b_len+a_len);
1220 static __isl_give isl_basic_map *isl_basic_map_swap_vars(
1221 __isl_take isl_basic_map *bmap, unsigned pos, unsigned n1, unsigned n2)
1229 isl_assert(bmap->ctx,
1230 pos + n1 + n2 <= 1 + isl_basic_map_total_dim(bmap), goto error);
1232 if (n1 == 0 || n2 == 0)
1235 bmap = isl_basic_map_cow(bmap);
1239 blk = isl_blk_alloc(bmap->ctx, n1 + n2);
1240 if (isl_blk_is_error(blk))
1243 for (i = 0; i < bmap->n_eq; ++i)
1245 bmap->eq[i] + pos, n1, n2);
1247 for (i = 0; i < bmap->n_ineq; ++i)
1249 bmap->ineq[i] + pos, n1, n2);
1251 for (i = 0; i < bmap->n_div; ++i)
1253 bmap->div[i]+1 + pos, n1, n2);
1255 isl_blk_free(bmap->ctx, blk);
1257 ISL_F_CLR(bmap, ISL_BASIC_SET_NORMALIZED);
1258 bmap = isl_basic_map_gauss(bmap, NULL);
1259 return isl_basic_map_finalize(bmap);
1261 isl_basic_map_free(bmap);
1265 static __isl_give isl_basic_set *isl_basic_set_swap_vars(
1266 __isl_take isl_basic_set *bset, unsigned n)
1271 nparam = isl_basic_set_n_param(bset);
1272 dim = isl_basic_set_n_dim(bset);
1273 isl_assert(bset->ctx, n <= dim, goto error);
1275 return isl_basic_map_swap_vars(bset, 1 + nparam, n, dim - n);
1277 isl_basic_set_free(bset);
1281 static __isl_give isl_set *isl_set_swap_vars(__isl_take isl_set *set,
1285 set = isl_set_cow(set);
1289 for (i = 0; i < set->n; ++i) {
1290 set->p[i] = isl_basic_set_swap_vars(set->p[i], n);
1296 ISL_F_CLR(set, ISL_SET_NORMALIZED);
1300 struct isl_basic_map *isl_basic_map_set_to_empty(struct isl_basic_map *bmap)
1306 total = isl_basic_map_total_dim(bmap);
1307 isl_basic_map_free_div(bmap, bmap->n_div);
1308 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
1310 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
1312 i = isl_basic_map_alloc_equality(bmap);
1316 isl_int_set_si(bmap->eq[i][0], 1);
1317 isl_seq_clr(bmap->eq[i]+1, total);
1318 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
1319 isl_vec_free(bmap->sample);
1320 bmap->sample = NULL;
1321 return isl_basic_map_finalize(bmap);
1323 isl_basic_map_free(bmap);
1327 struct isl_basic_set *isl_basic_set_set_to_empty(struct isl_basic_set *bset)
1329 return (struct isl_basic_set *)
1330 isl_basic_map_set_to_empty((struct isl_basic_map *)bset);
1333 void isl_basic_map_swap_div(struct isl_basic_map *bmap, int a, int b)
1336 unsigned off = isl_dim_total(bmap->dim);
1337 isl_int *t = bmap->div[a];
1338 bmap->div[a] = bmap->div[b];
1341 for (i = 0; i < bmap->n_eq; ++i)
1342 isl_int_swap(bmap->eq[i][1+off+a], bmap->eq[i][1+off+b]);
1344 for (i = 0; i < bmap->n_ineq; ++i)
1345 isl_int_swap(bmap->ineq[i][1+off+a], bmap->ineq[i][1+off+b]);
1347 for (i = 0; i < bmap->n_div; ++i)
1348 isl_int_swap(bmap->div[i][1+1+off+a], bmap->div[i][1+1+off+b]);
1349 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1352 /* Eliminate the specified n dimensions starting at first from the
1353 * constraints using Fourier-Motzkin. The dimensions themselves
1356 __isl_give isl_map *isl_map_eliminate(__isl_take isl_map *map,
1357 enum isl_dim_type type, unsigned first, unsigned n)
1366 map = isl_map_cow(map);
1369 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1370 first += pos(map->dim, type) - 1;
1372 for (i = 0; i < map->n; ++i) {
1373 map->p[i] = isl_basic_map_eliminate_vars(map->p[i], first, n);
1383 /* Eliminate the specified n dimensions starting at first from the
1384 * constraints using Fourier-Motzkin. The dimensions themselves
1387 __isl_give isl_set *isl_set_eliminate(__isl_take isl_set *set,
1388 enum isl_dim_type type, unsigned first, unsigned n)
1390 return (isl_set *)isl_map_eliminate((isl_map *)set, type, first, n);
1393 /* Eliminate the specified n dimensions starting at first from the
1394 * constraints using Fourier-Motzkin. The dimensions themselves
1397 __isl_give isl_set *isl_set_eliminate_dims(__isl_take isl_set *set,
1398 unsigned first, unsigned n)
1400 return isl_set_eliminate(set, isl_dim_set, first, n);
1403 __isl_give isl_basic_map *isl_basic_map_remove_divs(
1404 __isl_take isl_basic_map *bmap)
1406 bmap = isl_basic_map_eliminate_vars(bmap, isl_dim_total(bmap->dim),
1411 return isl_basic_map_finalize(bmap);
1414 __isl_give isl_basic_set *isl_basic_set_remove_divs(
1415 __isl_take isl_basic_set *bset)
1417 return (struct isl_basic_set *)isl_basic_map_remove_divs(
1418 (struct isl_basic_map *)bset);
1421 __isl_give isl_map *isl_map_remove_divs(__isl_take isl_map *map)
1430 map = isl_map_cow(map);
1434 for (i = 0; i < map->n; ++i) {
1435 map->p[i] = isl_basic_map_remove_divs(map->p[i]);
1445 __isl_give isl_set *isl_set_remove_divs(__isl_take isl_set *set)
1447 return isl_map_remove_divs(set);
1450 struct isl_basic_map *isl_basic_map_remove_dims(struct isl_basic_map *bmap,
1451 enum isl_dim_type type, unsigned first, unsigned n)
1455 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1459 bmap = isl_basic_map_eliminate_vars(bmap,
1460 isl_basic_map_offset(bmap, type) - 1 + first, n);
1463 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY) && type == isl_dim_div)
1465 bmap = isl_basic_map_drop(bmap, type, first, n);
1468 isl_basic_map_free(bmap);
1472 /* Return true if the definition of the given div (recursively) involves
1473 * any of the given variables.
1475 static int div_involves_vars(__isl_keep isl_basic_map *bmap, int div,
1476 unsigned first, unsigned n)
1479 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1481 if (isl_int_is_zero(bmap->div[div][0]))
1483 if (isl_seq_first_non_zero(bmap->div[div] + 1 + first, n) >= 0)
1486 for (i = bmap->n_div - 1; i >= 0; --i) {
1487 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1489 if (div_involves_vars(bmap, i, first, n))
1496 /* Remove all divs (recursively) involving any of the given dimensions
1497 * in their definitions.
1499 __isl_give isl_basic_map *isl_basic_map_remove_divs_involving_dims(
1500 __isl_take isl_basic_map *bmap,
1501 enum isl_dim_type type, unsigned first, unsigned n)
1507 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
1509 first += isl_basic_map_offset(bmap, type);
1511 for (i = bmap->n_div - 1; i >= 0; --i) {
1512 if (!div_involves_vars(bmap, i, first, n))
1514 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1519 isl_basic_map_free(bmap);
1523 __isl_give isl_map *isl_map_remove_divs_involving_dims(__isl_take isl_map *map,
1524 enum isl_dim_type type, unsigned first, unsigned n)
1533 map = isl_map_cow(map);
1537 for (i = 0; i < map->n; ++i) {
1538 map->p[i] = isl_basic_map_remove_divs_involving_dims(map->p[i],
1549 __isl_give isl_set *isl_set_remove_divs_involving_dims(__isl_take isl_set *set,
1550 enum isl_dim_type type, unsigned first, unsigned n)
1552 return (isl_set *)isl_map_remove_divs_involving_dims((isl_map *)set,
1556 int isl_basic_set_involves_dims(__isl_keep isl_basic_set *bset,
1557 enum isl_dim_type type, unsigned first, unsigned n)
1564 if (first + n > isl_basic_set_dim(bset, type))
1565 isl_die(bset->ctx, isl_error_invalid,
1566 "index out of bounds", return -1);
1568 first += isl_basic_set_offset(bset, type);
1569 for (i = 0; i < bset->n_eq; ++i)
1570 if (isl_seq_first_non_zero(bset->eq[i] + first, n) >= 0)
1572 for (i = 0; i < bset->n_ineq; ++i)
1573 if (isl_seq_first_non_zero(bset->ineq[i] + first, n) >= 0)
1579 int isl_set_involves_dims(__isl_keep isl_set *set,
1580 enum isl_dim_type type, unsigned first, unsigned n)
1587 if (first + n > isl_set_dim(set, type))
1588 isl_die(set->ctx, isl_error_invalid,
1589 "index out of bounds", return -1);
1591 for (i = 0; i < set->n; ++i) {
1592 int involves = isl_basic_set_involves_dims(set->p[i],
1594 if (involves < 0 || !involves)
1601 /* Return true if the definition of the given div is unknown or depends
1604 static int div_is_unknown(__isl_keep isl_basic_map *bmap, int div)
1607 unsigned div_offset = isl_basic_map_offset(bmap, isl_dim_div);
1609 if (isl_int_is_zero(bmap->div[div][0]))
1612 for (i = bmap->n_div - 1; i >= 0; --i) {
1613 if (isl_int_is_zero(bmap->div[div][1 + div_offset + i]))
1615 if (div_is_unknown(bmap, i))
1622 /* Remove all divs that are unknown or defined in terms of unknown divs.
1624 __isl_give isl_basic_map *isl_basic_map_remove_unknown_divs(
1625 __isl_take isl_basic_map *bmap)
1632 for (i = bmap->n_div - 1; i >= 0; --i) {
1633 if (!div_is_unknown(bmap, i))
1635 bmap = isl_basic_map_remove_dims(bmap, isl_dim_div, i, 1);
1641 __isl_give isl_map *isl_map_remove_unknown_divs(__isl_take isl_map *map)
1650 map = isl_map_cow(map);
1654 for (i = 0; i < map->n; ++i) {
1655 map->p[i] = isl_basic_map_remove_unknown_divs(map->p[i]);
1665 __isl_give isl_set *isl_set_remove_unknown_divs(__isl_take isl_set *set)
1667 return (isl_set *)isl_map_remove_unknown_divs((isl_map *)set);
1670 __isl_give isl_basic_set *isl_basic_set_remove_dims(
1671 __isl_take isl_basic_set *bset,
1672 enum isl_dim_type type, unsigned first, unsigned n)
1674 return (isl_basic_set *)
1675 isl_basic_map_remove_dims((isl_basic_map *)bset, type, first, n);
1678 struct isl_map *isl_map_remove_dims(struct isl_map *map,
1679 enum isl_dim_type type, unsigned first, unsigned n)
1686 map = isl_map_cow(map);
1689 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
1691 for (i = 0; i < map->n; ++i) {
1692 map->p[i] = isl_basic_map_eliminate_vars(map->p[i],
1693 isl_basic_map_offset(map->p[i], type) - 1 + first, n);
1697 map = isl_map_drop(map, type, first, n);
1704 __isl_give isl_set *isl_set_remove_dims(__isl_take isl_set *bset,
1705 enum isl_dim_type type, unsigned first, unsigned n)
1707 return (isl_set *)isl_map_remove_dims((isl_map *)bset, type, first, n);
1710 /* Project out n inputs starting at first using Fourier-Motzkin */
1711 struct isl_map *isl_map_remove_inputs(struct isl_map *map,
1712 unsigned first, unsigned n)
1714 return isl_map_remove_dims(map, isl_dim_in, first, n);
1717 static void dump_term(struct isl_basic_map *bmap,
1718 isl_int c, int pos, FILE *out)
1721 unsigned in = isl_basic_map_n_in(bmap);
1722 unsigned dim = in + isl_basic_map_n_out(bmap);
1723 unsigned nparam = isl_basic_map_n_param(bmap);
1725 isl_int_print(out, c, 0);
1727 if (!isl_int_is_one(c))
1728 isl_int_print(out, c, 0);
1729 if (pos < 1 + nparam) {
1730 name = isl_dim_get_name(bmap->dim,
1731 isl_dim_param, pos - 1);
1733 fprintf(out, "%s", name);
1735 fprintf(out, "p%d", pos - 1);
1736 } else if (pos < 1 + nparam + in)
1737 fprintf(out, "i%d", pos - 1 - nparam);
1738 else if (pos < 1 + nparam + dim)
1739 fprintf(out, "o%d", pos - 1 - nparam - in);
1741 fprintf(out, "e%d", pos - 1 - nparam - dim);
1745 static void dump_constraint_sign(struct isl_basic_map *bmap, isl_int *c,
1746 int sign, FILE *out)
1750 unsigned len = 1 + isl_basic_map_total_dim(bmap);
1754 for (i = 0, first = 1; i < len; ++i) {
1755 if (isl_int_sgn(c[i]) * sign <= 0)
1758 fprintf(out, " + ");
1760 isl_int_abs(v, c[i]);
1761 dump_term(bmap, v, i, out);
1768 static void dump_constraint(struct isl_basic_map *bmap, isl_int *c,
1769 const char *op, FILE *out, int indent)
1773 fprintf(out, "%*s", indent, "");
1775 dump_constraint_sign(bmap, c, 1, out);
1776 fprintf(out, " %s ", op);
1777 dump_constraint_sign(bmap, c, -1, out);
1781 for (i = bmap->n_div; i < bmap->extra; ++i) {
1782 if (isl_int_is_zero(c[1+isl_dim_total(bmap->dim)+i]))
1784 fprintf(out, "%*s", indent, "");
1785 fprintf(out, "ERROR: unused div coefficient not zero\n");
1790 static void dump_constraints(struct isl_basic_map *bmap,
1791 isl_int **c, unsigned n,
1792 const char *op, FILE *out, int indent)
1796 for (i = 0; i < n; ++i)
1797 dump_constraint(bmap, c[i], op, out, indent);
1800 static void dump_affine(struct isl_basic_map *bmap, isl_int *exp, FILE *out)
1804 unsigned total = isl_basic_map_total_dim(bmap);
1806 for (j = 0; j < 1 + total; ++j) {
1807 if (isl_int_is_zero(exp[j]))
1809 if (!first && isl_int_is_pos(exp[j]))
1811 dump_term(bmap, exp[j], j, out);
1816 static void dump(struct isl_basic_map *bmap, FILE *out, int indent)
1820 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
1821 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
1823 for (i = 0; i < bmap->n_div; ++i) {
1824 fprintf(out, "%*s", indent, "");
1825 fprintf(out, "e%d = [(", i);
1826 dump_affine(bmap, bmap->div[i]+1, out);
1828 isl_int_print(out, bmap->div[i][0], 0);
1829 fprintf(out, "]\n");
1833 void isl_basic_set_print_internal(struct isl_basic_set *bset,
1834 FILE *out, int indent)
1837 fprintf(out, "null basic set\n");
1841 fprintf(out, "%*s", indent, "");
1842 fprintf(out, "ref: %d, nparam: %d, dim: %d, extra: %d, flags: %x\n",
1843 bset->ref, bset->dim->nparam, bset->dim->n_out,
1844 bset->extra, bset->flags);
1845 dump((struct isl_basic_map *)bset, out, indent);
1848 void isl_basic_map_print_internal(struct isl_basic_map *bmap,
1849 FILE *out, int indent)
1852 fprintf(out, "null basic map\n");
1856 fprintf(out, "%*s", indent, "");
1857 fprintf(out, "ref: %d, nparam: %d, in: %d, out: %d, extra: %d, "
1858 "flags: %x, n_name: %d\n",
1860 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out,
1861 bmap->extra, bmap->flags, bmap->dim->n_name);
1862 dump(bmap, out, indent);
1865 int isl_inequality_negate(struct isl_basic_map *bmap, unsigned pos)
1870 total = isl_basic_map_total_dim(bmap);
1871 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1872 isl_seq_neg(bmap->ineq[pos], bmap->ineq[pos], 1 + total);
1873 isl_int_sub_ui(bmap->ineq[pos][0], bmap->ineq[pos][0], 1);
1874 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
1878 struct isl_set *isl_set_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
1880 struct isl_set *set;
1884 isl_assert(dim->ctx, dim->n_in == 0, goto error);
1885 isl_assert(dim->ctx, n >= 0, goto error);
1886 set = isl_alloc(dim->ctx, struct isl_set,
1887 sizeof(struct isl_set) +
1888 (n - 1) * sizeof(struct isl_basic_set *));
1892 set->ctx = dim->ctx;
1893 isl_ctx_ref(set->ctx);
1905 struct isl_set *isl_set_alloc(struct isl_ctx *ctx,
1906 unsigned nparam, unsigned dim, int n, unsigned flags)
1908 struct isl_set *set;
1909 struct isl_dim *dims;
1911 dims = isl_dim_alloc(ctx, nparam, 0, dim);
1915 set = isl_set_alloc_dim(dims, n, flags);
1919 /* Make sure "map" has room for at least "n" more basic maps.
1921 struct isl_map *isl_map_grow(struct isl_map *map, int n)
1924 struct isl_map *grown = NULL;
1928 isl_assert(map->ctx, n >= 0, goto error);
1929 if (map->n + n <= map->size)
1931 grown = isl_map_alloc_dim(isl_map_get_dim(map), map->n + n, map->flags);
1934 for (i = 0; i < map->n; ++i) {
1935 grown->p[i] = isl_basic_map_copy(map->p[i]);
1943 isl_map_free(grown);
1948 /* Make sure "set" has room for at least "n" more basic sets.
1950 struct isl_set *isl_set_grow(struct isl_set *set, int n)
1952 return (struct isl_set *)isl_map_grow((struct isl_map *)set, n);
1955 struct isl_set *isl_set_dup(struct isl_set *set)
1958 struct isl_set *dup;
1963 dup = isl_set_alloc_dim(isl_dim_copy(set->dim), set->n, set->flags);
1966 for (i = 0; i < set->n; ++i)
1967 dup = isl_set_add_basic_set(dup, isl_basic_set_copy(set->p[i]));
1971 struct isl_set *isl_set_from_basic_set(struct isl_basic_set *bset)
1973 return isl_map_from_basic_map(bset);
1976 struct isl_map *isl_map_from_basic_map(struct isl_basic_map *bmap)
1978 struct isl_map *map;
1983 map = isl_map_alloc_dim(isl_dim_copy(bmap->dim), 1, ISL_MAP_DISJOINT);
1984 return isl_map_add_basic_map(map, bmap);
1987 __isl_give isl_set *isl_set_add_basic_set(__isl_take isl_set *set,
1988 __isl_take isl_basic_set *bset)
1990 return (struct isl_set *)isl_map_add_basic_map((struct isl_map *)set,
1991 (struct isl_basic_map *)bset);
1994 void isl_set_free(struct isl_set *set)
2004 isl_ctx_deref(set->ctx);
2005 for (i = 0; i < set->n; ++i)
2006 isl_basic_set_free(set->p[i]);
2007 isl_dim_free(set->dim);
2011 void isl_set_print_internal(struct isl_set *set, FILE *out, int indent)
2016 fprintf(out, "null set\n");
2020 fprintf(out, "%*s", indent, "");
2021 fprintf(out, "ref: %d, n: %d, nparam: %d, dim: %d, flags: %x\n",
2022 set->ref, set->n, set->dim->nparam, set->dim->n_out,
2024 for (i = 0; i < set->n; ++i) {
2025 fprintf(out, "%*s", indent, "");
2026 fprintf(out, "basic set %d:\n", i);
2027 isl_basic_set_print_internal(set->p[i], out, indent+4);
2031 void isl_map_print_internal(struct isl_map *map, FILE *out, int indent)
2036 fprintf(out, "null map\n");
2040 fprintf(out, "%*s", indent, "");
2041 fprintf(out, "ref: %d, n: %d, nparam: %d, in: %d, out: %d, "
2042 "flags: %x, n_name: %d\n",
2043 map->ref, map->n, map->dim->nparam, map->dim->n_in,
2044 map->dim->n_out, map->flags, map->dim->n_name);
2045 for (i = 0; i < map->n; ++i) {
2046 fprintf(out, "%*s", indent, "");
2047 fprintf(out, "basic map %d:\n", i);
2048 isl_basic_map_print_internal(map->p[i], out, indent+4);
2052 struct isl_basic_map *isl_basic_map_intersect_domain(
2053 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2055 struct isl_basic_map *bmap_domain;
2060 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2061 bset->dim, isl_dim_param), goto error);
2063 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2064 isl_assert(bset->ctx,
2065 isl_basic_map_compatible_domain(bmap, bset), goto error);
2067 bmap = isl_basic_map_cow(bmap);
2070 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2071 bset->n_div, bset->n_eq, bset->n_ineq);
2072 bmap_domain = isl_basic_map_from_domain(bset);
2073 bmap = add_constraints(bmap, bmap_domain, 0, 0);
2075 bmap = isl_basic_map_simplify(bmap);
2076 return isl_basic_map_finalize(bmap);
2078 isl_basic_map_free(bmap);
2079 isl_basic_set_free(bset);
2083 struct isl_basic_map *isl_basic_map_intersect_range(
2084 struct isl_basic_map *bmap, struct isl_basic_set *bset)
2086 struct isl_basic_map *bmap_range;
2091 isl_assert(bset->ctx, isl_dim_match(bmap->dim, isl_dim_param,
2092 bset->dim, isl_dim_param), goto error);
2094 if (isl_dim_size(bset->dim, isl_dim_set) != 0)
2095 isl_assert(bset->ctx,
2096 isl_basic_map_compatible_range(bmap, bset), goto error);
2098 if (isl_basic_set_is_universe(bset)) {
2099 isl_basic_set_free(bset);
2103 bmap = isl_basic_map_cow(bmap);
2106 bmap = isl_basic_map_extend_dim(bmap, isl_dim_copy(bmap->dim),
2107 bset->n_div, bset->n_eq, bset->n_ineq);
2108 bmap_range = isl_basic_map_from_basic_set(bset, isl_dim_copy(bset->dim));
2109 bmap = add_constraints(bmap, bmap_range, 0, 0);
2111 bmap = isl_basic_map_simplify(bmap);
2112 return isl_basic_map_finalize(bmap);
2114 isl_basic_map_free(bmap);
2115 isl_basic_set_free(bset);
2119 int isl_basic_map_contains(struct isl_basic_map *bmap, struct isl_vec *vec)
2125 total = 1 + isl_basic_map_total_dim(bmap);
2126 if (total != vec->size)
2131 for (i = 0; i < bmap->n_eq; ++i) {
2132 isl_seq_inner_product(vec->el, bmap->eq[i], total, &s);
2133 if (!isl_int_is_zero(s)) {
2139 for (i = 0; i < bmap->n_ineq; ++i) {
2140 isl_seq_inner_product(vec->el, bmap->ineq[i], total, &s);
2141 if (isl_int_is_neg(s)) {
2152 int isl_basic_set_contains(struct isl_basic_set *bset, struct isl_vec *vec)
2154 return isl_basic_map_contains((struct isl_basic_map *)bset, vec);
2157 struct isl_basic_map *isl_basic_map_intersect(
2158 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2160 struct isl_vec *sample = NULL;
2162 if (!bmap1 || !bmap2)
2165 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
2166 bmap2->dim, isl_dim_param), goto error);
2167 if (isl_dim_total(bmap1->dim) ==
2168 isl_dim_size(bmap1->dim, isl_dim_param) &&
2169 isl_dim_total(bmap2->dim) !=
2170 isl_dim_size(bmap2->dim, isl_dim_param))
2171 return isl_basic_map_intersect(bmap2, bmap1);
2173 if (isl_dim_total(bmap2->dim) !=
2174 isl_dim_size(bmap2->dim, isl_dim_param))
2175 isl_assert(bmap1->ctx,
2176 isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
2178 if (bmap1->sample &&
2179 isl_basic_map_contains(bmap1, bmap1->sample) > 0 &&
2180 isl_basic_map_contains(bmap2, bmap1->sample) > 0)
2181 sample = isl_vec_copy(bmap1->sample);
2182 else if (bmap2->sample &&
2183 isl_basic_map_contains(bmap1, bmap2->sample) > 0 &&
2184 isl_basic_map_contains(bmap2, bmap2->sample) > 0)
2185 sample = isl_vec_copy(bmap2->sample);
2187 bmap1 = isl_basic_map_cow(bmap1);
2190 bmap1 = isl_basic_map_extend_dim(bmap1, isl_dim_copy(bmap1->dim),
2191 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
2192 bmap1 = add_constraints(bmap1, bmap2, 0, 0);
2195 isl_vec_free(sample);
2197 isl_vec_free(bmap1->sample);
2198 bmap1->sample = sample;
2201 bmap1 = isl_basic_map_simplify(bmap1);
2202 return isl_basic_map_finalize(bmap1);
2205 isl_vec_free(sample);
2206 isl_basic_map_free(bmap1);
2207 isl_basic_map_free(bmap2);
2211 struct isl_basic_set *isl_basic_set_intersect(
2212 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
2214 return (struct isl_basic_set *)
2215 isl_basic_map_intersect(
2216 (struct isl_basic_map *)bset1,
2217 (struct isl_basic_map *)bset2);
2220 /* Special case of isl_map_intersect, where both map1 and map2
2221 * are convex, without any divs and such that either map1 or map2
2222 * contains a single constraint. This constraint is then simply
2223 * added to the other map.
2225 static __isl_give isl_map *map_intersect_add_constraint(
2226 __isl_take isl_map *map1, __isl_take isl_map *map2)
2228 isl_assert(map1->ctx, map1->n == 1, goto error);
2229 isl_assert(map2->ctx, map1->n == 1, goto error);
2230 isl_assert(map1->ctx, map1->p[0]->n_div == 0, goto error);
2231 isl_assert(map2->ctx, map1->p[0]->n_div == 0, goto error);
2233 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
2234 return isl_map_intersect(map2, map1);
2236 isl_assert(map2->ctx,
2237 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1, goto error);
2239 map1 = isl_map_cow(map1);
2242 if (isl_map_plain_is_empty(map1)) {
2246 map1->p[0] = isl_basic_map_cow(map1->p[0]);
2247 if (map2->p[0]->n_eq == 1)
2248 map1->p[0] = isl_basic_map_add_eq(map1->p[0], map2->p[0]->eq[0]);
2250 map1->p[0] = isl_basic_map_add_ineq(map1->p[0],
2251 map2->p[0]->ineq[0]);
2253 map1->p[0] = isl_basic_map_simplify(map1->p[0]);
2254 map1->p[0] = isl_basic_map_finalize(map1->p[0]);
2258 if (isl_basic_map_plain_is_empty(map1->p[0])) {
2259 isl_basic_map_free(map1->p[0]);
2272 struct isl_map *isl_map_intersect(struct isl_map *map1, struct isl_map *map2)
2275 struct isl_map *result;
2281 if (isl_map_plain_is_empty(map1)) {
2285 if (isl_map_plain_is_empty(map2)) {
2290 if (map1->n == 1 && map2->n == 1 &&
2291 map1->p[0]->n_div == 0 && map2->p[0]->n_div == 0 &&
2292 isl_dim_equal(map1->dim, map2->dim) &&
2293 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
2294 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
2295 return map_intersect_add_constraint(map1, map2);
2296 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
2297 map2->dim, isl_dim_param), goto error);
2298 if (isl_dim_total(map1->dim) ==
2299 isl_dim_size(map1->dim, isl_dim_param) &&
2300 isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2301 return isl_map_intersect(map2, map1);
2303 if (isl_dim_total(map2->dim) != isl_dim_size(map2->dim, isl_dim_param))
2304 isl_assert(map1->ctx,
2305 isl_dim_equal(map1->dim, map2->dim), goto error);
2307 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
2308 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
2309 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
2311 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2312 map1->n * map2->n, flags);
2315 for (i = 0; i < map1->n; ++i)
2316 for (j = 0; j < map2->n; ++j) {
2317 struct isl_basic_map *part;
2318 part = isl_basic_map_intersect(
2319 isl_basic_map_copy(map1->p[i]),
2320 isl_basic_map_copy(map2->p[j]));
2321 if (isl_basic_map_is_empty(part))
2322 isl_basic_map_free(part);
2324 result = isl_map_add_basic_map(result, part);
2337 struct isl_set *isl_set_intersect(struct isl_set *set1, struct isl_set *set2)
2339 return (struct isl_set *)
2340 isl_map_intersect((struct isl_map *)set1,
2341 (struct isl_map *)set2);
2344 struct isl_basic_map *isl_basic_map_reverse(struct isl_basic_map *bmap)
2346 struct isl_dim *dim;
2347 struct isl_basic_set *bset;
2352 bmap = isl_basic_map_cow(bmap);
2355 dim = isl_dim_reverse(isl_dim_copy(bmap->dim));
2356 in = isl_basic_map_n_in(bmap);
2357 bset = isl_basic_set_from_basic_map(bmap);
2358 bset = isl_basic_set_swap_vars(bset, in);
2359 return isl_basic_map_from_basic_set(bset, dim);
2362 __isl_give isl_basic_map *isl_basic_map_insert(__isl_take isl_basic_map *bmap,
2363 enum isl_dim_type type, unsigned pos, unsigned n)
2365 struct isl_dim *res_dim;
2366 struct isl_basic_map *res;
2367 struct isl_dim_map *dim_map;
2368 unsigned total, off;
2369 enum isl_dim_type t;
2377 res_dim = isl_dim_insert(isl_basic_map_get_dim(bmap), type, pos, n);
2379 total = isl_basic_map_total_dim(bmap) + n;
2380 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2382 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2384 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2386 unsigned size = isl_basic_map_dim(bmap, t);
2387 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2389 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2390 pos, size - pos, off + pos + n);
2392 off += isl_dim_size(res_dim, t);
2394 isl_dim_map_div(dim_map, bmap, off);
2396 res = isl_basic_map_alloc_dim(res_dim,
2397 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2398 if (isl_basic_map_is_rational(bmap))
2399 res = isl_basic_map_set_rational(res);
2400 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2401 return isl_basic_map_finalize(res);
2404 __isl_give isl_basic_map *isl_basic_map_add(__isl_take isl_basic_map *bmap,
2405 enum isl_dim_type type, unsigned n)
2409 return isl_basic_map_insert(bmap, type,
2410 isl_basic_map_dim(bmap, type), n);
2413 __isl_give isl_basic_set *isl_basic_set_add(__isl_take isl_basic_set *bset,
2414 enum isl_dim_type type, unsigned n)
2418 isl_assert(bset->ctx, type != isl_dim_in, goto error);
2419 return (isl_basic_set *)isl_basic_map_add((isl_basic_map *)bset, type, n);
2421 isl_basic_set_free(bset);
2425 __isl_give isl_map *isl_map_insert(__isl_take isl_map *map,
2426 enum isl_dim_type type, unsigned pos, unsigned n)
2433 map = isl_map_cow(map);
2437 map->dim = isl_dim_insert(map->dim, type, pos, n);
2441 for (i = 0; i < map->n; ++i) {
2442 map->p[i] = isl_basic_map_insert(map->p[i], type, pos, n);
2453 __isl_give isl_set *isl_set_insert(__isl_take isl_set *set,
2454 enum isl_dim_type type, unsigned pos, unsigned n)
2456 return (isl_set *)isl_map_insert((isl_map *)set, type, pos, n);
2459 __isl_give isl_map *isl_map_add_dims(__isl_take isl_map *map,
2460 enum isl_dim_type type, unsigned n)
2464 return isl_map_insert(map, type, isl_map_dim(map, type), n);
2467 __isl_give isl_set *isl_set_add_dims(__isl_take isl_set *set,
2468 enum isl_dim_type type, unsigned n)
2472 isl_assert(set->ctx, type != isl_dim_in, goto error);
2473 return (isl_set *)isl_map_add_dims((isl_map *)set, type, n);
2479 __isl_give isl_basic_map *isl_basic_map_move_dims(
2480 __isl_take isl_basic_map *bmap,
2481 enum isl_dim_type dst_type, unsigned dst_pos,
2482 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2484 struct isl_dim_map *dim_map;
2485 struct isl_basic_map *res;
2486 enum isl_dim_type t;
2487 unsigned total, off;
2494 isl_assert(bmap->ctx, src_pos + n <= isl_basic_map_dim(bmap, src_type),
2497 if (dst_type == src_type && dst_pos == src_pos)
2500 isl_assert(bmap->ctx, dst_type != src_type, goto error);
2502 if (pos(bmap->dim, dst_type) + dst_pos ==
2503 pos(bmap->dim, src_type) + src_pos +
2504 ((src_type < dst_type) ? n : 0)) {
2505 bmap = isl_basic_map_cow(bmap);
2509 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2510 src_type, src_pos, n);
2514 bmap = isl_basic_map_finalize(bmap);
2519 total = isl_basic_map_total_dim(bmap);
2520 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2523 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2524 unsigned size = isl_dim_size(bmap->dim, t);
2525 if (t == dst_type) {
2526 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2529 isl_dim_map_dim_range(dim_map, bmap->dim, src_type,
2532 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2533 dst_pos, size - dst_pos, off);
2534 off += size - dst_pos;
2535 } else if (t == src_type) {
2536 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2539 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2540 src_pos + n, size - src_pos - n, off);
2541 off += size - src_pos - n;
2543 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2547 isl_dim_map_div(dim_map, bmap, off);
2549 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2550 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2551 bmap = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2553 bmap->dim = isl_dim_move(bmap->dim, dst_type, dst_pos,
2554 src_type, src_pos, n);
2558 ISL_F_CLR(bmap, ISL_BASIC_MAP_NORMALIZED);
2559 bmap = isl_basic_map_gauss(bmap, NULL);
2560 bmap = isl_basic_map_finalize(bmap);
2564 isl_basic_map_free(bmap);
2568 __isl_give isl_basic_set *isl_basic_set_move_dims(__isl_take isl_basic_set *bset,
2569 enum isl_dim_type dst_type, unsigned dst_pos,
2570 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2572 return (isl_basic_set *)isl_basic_map_move_dims(
2573 (isl_basic_map *)bset, dst_type, dst_pos, src_type, src_pos, n);
2576 __isl_give isl_set *isl_set_move_dims(__isl_take isl_set *set,
2577 enum isl_dim_type dst_type, unsigned dst_pos,
2578 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2582 isl_assert(set->ctx, dst_type != isl_dim_in, goto error);
2583 return (isl_set *)isl_map_move_dims((isl_map *)set, dst_type, dst_pos,
2584 src_type, src_pos, n);
2590 __isl_give isl_map *isl_map_move_dims(__isl_take isl_map *map,
2591 enum isl_dim_type dst_type, unsigned dst_pos,
2592 enum isl_dim_type src_type, unsigned src_pos, unsigned n)
2601 isl_assert(map->ctx, src_pos + n <= isl_map_dim(map, src_type),
2604 if (dst_type == src_type && dst_pos == src_pos)
2607 isl_assert(map->ctx, dst_type != src_type, goto error);
2609 map = isl_map_cow(map);
2613 map->dim = isl_dim_move(map->dim, dst_type, dst_pos, src_type, src_pos, n);
2617 for (i = 0; i < map->n; ++i) {
2618 map->p[i] = isl_basic_map_move_dims(map->p[i],
2620 src_type, src_pos, n);
2631 /* Move the specified dimensions to the last columns right before
2632 * the divs. Don't change the dimension specification of bmap.
2633 * That's the responsibility of the caller.
2635 static __isl_give isl_basic_map *move_last(__isl_take isl_basic_map *bmap,
2636 enum isl_dim_type type, unsigned first, unsigned n)
2638 struct isl_dim_map *dim_map;
2639 struct isl_basic_map *res;
2640 enum isl_dim_type t;
2641 unsigned total, off;
2645 if (pos(bmap->dim, type) + first + n == 1 + isl_dim_total(bmap->dim))
2648 total = isl_basic_map_total_dim(bmap);
2649 dim_map = isl_dim_map_alloc(bmap->ctx, total);
2652 for (t = isl_dim_param; t <= isl_dim_out; ++t) {
2653 unsigned size = isl_dim_size(bmap->dim, t);
2655 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2658 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2659 first, n, total - bmap->n_div - n);
2660 isl_dim_map_dim_range(dim_map, bmap->dim, t,
2661 first + n, size - (first + n), off);
2662 off += size - (first + n);
2664 isl_dim_map_dim(dim_map, bmap->dim, t, off);
2668 isl_dim_map_div(dim_map, bmap, off + n);
2670 res = isl_basic_map_alloc_dim(isl_basic_map_get_dim(bmap),
2671 bmap->n_div, bmap->n_eq, bmap->n_ineq);
2672 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
2676 /* Turn the n dimensions of type type, starting at first
2677 * into existentially quantified variables.
2679 __isl_give isl_basic_map *isl_basic_map_project_out(
2680 __isl_take isl_basic_map *bmap,
2681 enum isl_dim_type type, unsigned first, unsigned n)
2694 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL))
2695 return isl_basic_map_remove_dims(bmap, type, first, n);
2697 isl_assert(bmap->ctx, first + n <= isl_basic_map_dim(bmap, type),
2700 bmap = move_last(bmap, type, first, n);
2701 bmap = isl_basic_map_cow(bmap);
2705 row_size = 1 + isl_dim_total(bmap->dim) + bmap->extra;
2706 old = bmap->block2.data;
2707 bmap->block2 = isl_blk_extend(bmap->ctx, bmap->block2,
2708 (bmap->extra + n) * (1 + row_size));
2709 if (!bmap->block2.data)
2711 new_div = isl_alloc_array(bmap->ctx, isl_int *, bmap->extra + n);
2714 for (i = 0; i < n; ++i) {
2715 new_div[i] = bmap->block2.data +
2716 (bmap->extra + i) * (1 + row_size);
2717 isl_seq_clr(new_div[i], 1 + row_size);
2719 for (i = 0; i < bmap->extra; ++i)
2720 new_div[n + i] = bmap->block2.data + (bmap->div[i] - old);
2722 bmap->div = new_div;
2726 bmap->dim = isl_dim_drop(bmap->dim, type, first, n);
2729 bmap = isl_basic_map_simplify(bmap);
2730 bmap = isl_basic_map_drop_redundant_divs(bmap);
2731 return isl_basic_map_finalize(bmap);
2733 isl_basic_map_free(bmap);
2737 /* Turn the n dimensions of type type, starting at first
2738 * into existentially quantified variables.
2740 struct isl_basic_set *isl_basic_set_project_out(struct isl_basic_set *bset,
2741 enum isl_dim_type type, unsigned first, unsigned n)
2743 return (isl_basic_set *)isl_basic_map_project_out(
2744 (isl_basic_map *)bset, type, first, n);
2747 /* Turn the n dimensions of type type, starting at first
2748 * into existentially quantified variables.
2750 __isl_give isl_map *isl_map_project_out(__isl_take isl_map *map,
2751 enum isl_dim_type type, unsigned first, unsigned n)
2761 isl_assert(map->ctx, first + n <= isl_map_dim(map, type), goto error);
2763 map = isl_map_cow(map);
2767 map->dim = isl_dim_drop(map->dim, type, first, n);
2771 for (i = 0; i < map->n; ++i) {
2772 map->p[i] = isl_basic_map_project_out(map->p[i], type, first, n);
2783 /* Turn the n dimensions of type type, starting at first
2784 * into existentially quantified variables.
2786 __isl_give isl_set *isl_set_project_out(__isl_take isl_set *set,
2787 enum isl_dim_type type, unsigned first, unsigned n)
2789 return (isl_set *)isl_map_project_out((isl_map *)set, type, first, n);
2792 static struct isl_basic_map *add_divs(struct isl_basic_map *bmap, unsigned n)
2796 for (i = 0; i < n; ++i) {
2797 j = isl_basic_map_alloc_div(bmap);
2800 isl_seq_clr(bmap->div[j], 1+1+isl_basic_map_total_dim(bmap));
2804 isl_basic_map_free(bmap);
2808 struct isl_basic_map *isl_basic_map_apply_range(
2809 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2811 struct isl_dim *dim_result = NULL;
2812 struct isl_basic_map *bmap;
2813 unsigned n_in, n_out, n, nparam, total, pos;
2814 struct isl_dim_map *dim_map1, *dim_map2;
2816 if (!bmap1 || !bmap2)
2819 dim_result = isl_dim_join(isl_dim_copy(bmap1->dim),
2820 isl_dim_copy(bmap2->dim));
2822 n_in = isl_basic_map_n_in(bmap1);
2823 n_out = isl_basic_map_n_out(bmap2);
2824 n = isl_basic_map_n_out(bmap1);
2825 nparam = isl_basic_map_n_param(bmap1);
2827 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + n;
2828 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2829 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
2830 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2831 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
2832 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2833 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_in);
2834 isl_dim_map_div(dim_map1, bmap1, pos += n_out);
2835 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2836 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2837 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2839 bmap = isl_basic_map_alloc_dim(dim_result,
2840 bmap1->n_div + bmap2->n_div + n,
2841 bmap1->n_eq + bmap2->n_eq,
2842 bmap1->n_ineq + bmap2->n_ineq);
2843 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2844 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2845 bmap = add_divs(bmap, n);
2846 bmap = isl_basic_map_simplify(bmap);
2847 bmap = isl_basic_map_drop_redundant_divs(bmap);
2848 return isl_basic_map_finalize(bmap);
2850 isl_basic_map_free(bmap1);
2851 isl_basic_map_free(bmap2);
2855 struct isl_basic_set *isl_basic_set_apply(
2856 struct isl_basic_set *bset, struct isl_basic_map *bmap)
2861 isl_assert(bset->ctx, isl_basic_map_compatible_domain(bmap, bset),
2864 return (struct isl_basic_set *)
2865 isl_basic_map_apply_range((struct isl_basic_map *)bset, bmap);
2867 isl_basic_set_free(bset);
2868 isl_basic_map_free(bmap);
2872 struct isl_basic_map *isl_basic_map_apply_domain(
2873 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2875 if (!bmap1 || !bmap2)
2878 isl_assert(bmap1->ctx,
2879 isl_basic_map_n_in(bmap1) == isl_basic_map_n_in(bmap2), goto error);
2880 isl_assert(bmap1->ctx,
2881 isl_basic_map_n_param(bmap1) == isl_basic_map_n_param(bmap2),
2884 bmap1 = isl_basic_map_reverse(bmap1);
2885 bmap1 = isl_basic_map_apply_range(bmap1, bmap2);
2886 return isl_basic_map_reverse(bmap1);
2888 isl_basic_map_free(bmap1);
2889 isl_basic_map_free(bmap2);
2893 /* Given two basic maps A -> f(A) and B -> g(B), construct a basic map
2894 * A \cap B -> f(A) + f(B)
2896 struct isl_basic_map *isl_basic_map_sum(
2897 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
2899 unsigned n_in, n_out, nparam, total, pos;
2900 struct isl_basic_map *bmap = NULL;
2901 struct isl_dim_map *dim_map1, *dim_map2;
2904 if (!bmap1 || !bmap2)
2907 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim),
2910 nparam = isl_basic_map_n_param(bmap1);
2911 n_in = isl_basic_map_n_in(bmap1);
2912 n_out = isl_basic_map_n_out(bmap1);
2914 total = nparam + n_in + n_out + bmap1->n_div + bmap2->n_div + 2 * n_out;
2915 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
2916 dim_map2 = isl_dim_map_alloc(bmap2->ctx, total);
2917 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
2918 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos);
2919 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
2920 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
2921 isl_dim_map_div(dim_map1, bmap1, pos += n_in + n_out);
2922 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
2923 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += bmap2->n_div);
2924 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += n_out);
2926 bmap = isl_basic_map_alloc_dim(isl_dim_copy(bmap1->dim),
2927 bmap1->n_div + bmap2->n_div + 2 * n_out,
2928 bmap1->n_eq + bmap2->n_eq + n_out,
2929 bmap1->n_ineq + bmap2->n_ineq);
2930 for (i = 0; i < n_out; ++i) {
2931 int j = isl_basic_map_alloc_equality(bmap);
2934 isl_seq_clr(bmap->eq[j], 1+total);
2935 isl_int_set_si(bmap->eq[j][1+nparam+n_in+i], -1);
2936 isl_int_set_si(bmap->eq[j][1+pos+i], 1);
2937 isl_int_set_si(bmap->eq[j][1+pos-n_out+i], 1);
2939 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
2940 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
2941 bmap = add_divs(bmap, 2 * n_out);
2943 bmap = isl_basic_map_simplify(bmap);
2944 return isl_basic_map_finalize(bmap);
2946 isl_basic_map_free(bmap);
2947 isl_basic_map_free(bmap1);
2948 isl_basic_map_free(bmap2);
2952 /* Given two maps A -> f(A) and B -> g(B), construct a map
2953 * A \cap B -> f(A) + f(B)
2955 struct isl_map *isl_map_sum(struct isl_map *map1, struct isl_map *map2)
2957 struct isl_map *result;
2963 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
2965 result = isl_map_alloc_dim(isl_dim_copy(map1->dim),
2966 map1->n * map2->n, 0);
2969 for (i = 0; i < map1->n; ++i)
2970 for (j = 0; j < map2->n; ++j) {
2971 struct isl_basic_map *part;
2972 part = isl_basic_map_sum(
2973 isl_basic_map_copy(map1->p[i]),
2974 isl_basic_map_copy(map2->p[j]));
2975 if (isl_basic_map_is_empty(part))
2976 isl_basic_map_free(part);
2978 result = isl_map_add_basic_map(result, part);
2991 __isl_give isl_set *isl_set_sum(__isl_take isl_set *set1,
2992 __isl_take isl_set *set2)
2994 return (isl_set *)isl_map_sum((isl_map *)set1, (isl_map *)set2);
2997 /* Given a basic map A -> f(A), construct A -> -f(A).
2999 struct isl_basic_map *isl_basic_map_neg(struct isl_basic_map *bmap)
3004 bmap = isl_basic_map_cow(bmap);
3008 n = isl_basic_map_dim(bmap, isl_dim_out);
3009 off = isl_basic_map_offset(bmap, isl_dim_out);
3010 for (i = 0; i < bmap->n_eq; ++i)
3011 for (j = 0; j < n; ++j)
3012 isl_int_neg(bmap->eq[i][off+j], bmap->eq[i][off+j]);
3013 for (i = 0; i < bmap->n_ineq; ++i)
3014 for (j = 0; j < n; ++j)
3015 isl_int_neg(bmap->ineq[i][off+j], bmap->ineq[i][off+j]);
3016 for (i = 0; i < bmap->n_div; ++i)
3017 for (j = 0; j < n; ++j)
3018 isl_int_neg(bmap->div[i][1+off+j], bmap->div[i][1+off+j]);
3019 return isl_basic_map_finalize(bmap);
3022 __isl_give isl_basic_set *isl_basic_set_neg(__isl_take isl_basic_set *bset)
3024 return isl_basic_map_neg(bset);
3027 /* Given a map A -> f(A), construct A -> -f(A).
3029 struct isl_map *isl_map_neg(struct isl_map *map)
3033 map = isl_map_cow(map);
3037 for (i = 0; i < map->n; ++i) {
3038 map->p[i] = isl_basic_map_neg(map->p[i]);
3049 __isl_give isl_set *isl_set_neg(__isl_take isl_set *set)
3051 return (isl_set *)isl_map_neg((isl_map *)set);
3054 /* Given a basic map A -> f(A) and an integer d, construct a basic map
3055 * A -> floor(f(A)/d).
3057 struct isl_basic_map *isl_basic_map_floordiv(struct isl_basic_map *bmap,
3060 unsigned n_in, n_out, nparam, total, pos;
3061 struct isl_basic_map *result = NULL;
3062 struct isl_dim_map *dim_map;
3068 nparam = isl_basic_map_n_param(bmap);
3069 n_in = isl_basic_map_n_in(bmap);
3070 n_out = isl_basic_map_n_out(bmap);
3072 total = nparam + n_in + n_out + bmap->n_div + n_out;
3073 dim_map = isl_dim_map_alloc(bmap->ctx, total);
3074 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_param, pos = 0);
3075 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_in, pos += nparam);
3076 isl_dim_map_div(dim_map, bmap, pos += n_in + n_out);
3077 isl_dim_map_dim(dim_map, bmap->dim, isl_dim_out, pos += bmap->n_div);
3079 result = isl_basic_map_alloc_dim(isl_dim_copy(bmap->dim),
3080 bmap->n_div + n_out,
3081 bmap->n_eq, bmap->n_ineq + 2 * n_out);
3082 result = isl_basic_map_add_constraints_dim_map(result, bmap, dim_map);
3083 result = add_divs(result, n_out);
3084 for (i = 0; i < n_out; ++i) {
3086 j = isl_basic_map_alloc_inequality(result);
3089 isl_seq_clr(result->ineq[j], 1+total);
3090 isl_int_neg(result->ineq[j][1+nparam+n_in+i], d);
3091 isl_int_set_si(result->ineq[j][1+pos+i], 1);
3092 j = isl_basic_map_alloc_inequality(result);
3095 isl_seq_clr(result->ineq[j], 1+total);
3096 isl_int_set(result->ineq[j][1+nparam+n_in+i], d);
3097 isl_int_set_si(result->ineq[j][1+pos+i], -1);
3098 isl_int_sub_ui(result->ineq[j][0], d, 1);
3101 result = isl_basic_map_simplify(result);
3102 return isl_basic_map_finalize(result);
3104 isl_basic_map_free(result);
3108 /* Given a map A -> f(A) and an integer d, construct a map
3109 * A -> floor(f(A)/d).
3111 struct isl_map *isl_map_floordiv(struct isl_map *map, isl_int d)
3115 map = isl_map_cow(map);
3119 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3120 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
3121 for (i = 0; i < map->n; ++i) {
3122 map->p[i] = isl_basic_map_floordiv(map->p[i], d);
3133 static struct isl_basic_map *var_equal(struct isl_basic_map *bmap, unsigned pos)
3139 i = isl_basic_map_alloc_equality(bmap);
3142 nparam = isl_basic_map_n_param(bmap);
3143 n_in = isl_basic_map_n_in(bmap);
3144 isl_seq_clr(bmap->eq[i], 1 + isl_basic_map_total_dim(bmap));
3145 isl_int_set_si(bmap->eq[i][1+nparam+pos], -1);
3146 isl_int_set_si(bmap->eq[i][1+nparam+n_in+pos], 1);
3147 return isl_basic_map_finalize(bmap);
3149 isl_basic_map_free(bmap);
3153 /* Add a constraints to "bmap" expressing i_pos < o_pos
3155 static struct isl_basic_map *var_less(struct isl_basic_map *bmap, unsigned pos)
3161 i = isl_basic_map_alloc_inequality(bmap);
3164 nparam = isl_basic_map_n_param(bmap);
3165 n_in = isl_basic_map_n_in(bmap);
3166 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3167 isl_int_set_si(bmap->ineq[i][0], -1);
3168 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3169 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3170 return isl_basic_map_finalize(bmap);
3172 isl_basic_map_free(bmap);
3176 /* Add a constraint to "bmap" expressing i_pos <= o_pos
3178 static __isl_give isl_basic_map *var_less_or_equal(
3179 __isl_take isl_basic_map *bmap, unsigned pos)
3185 i = isl_basic_map_alloc_inequality(bmap);
3188 nparam = isl_basic_map_n_param(bmap);
3189 n_in = isl_basic_map_n_in(bmap);
3190 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3191 isl_int_set_si(bmap->ineq[i][1+nparam+pos], -1);
3192 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], 1);
3193 return isl_basic_map_finalize(bmap);
3195 isl_basic_map_free(bmap);
3199 /* Add a constraints to "bmap" expressing i_pos > o_pos
3201 static struct isl_basic_map *var_more(struct isl_basic_map *bmap, unsigned pos)
3207 i = isl_basic_map_alloc_inequality(bmap);
3210 nparam = isl_basic_map_n_param(bmap);
3211 n_in = isl_basic_map_n_in(bmap);
3212 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3213 isl_int_set_si(bmap->ineq[i][0], -1);
3214 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3215 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3216 return isl_basic_map_finalize(bmap);
3218 isl_basic_map_free(bmap);
3222 /* Add a constraint to "bmap" expressing i_pos >= o_pos
3224 static __isl_give isl_basic_map *var_more_or_equal(
3225 __isl_take isl_basic_map *bmap, unsigned pos)
3231 i = isl_basic_map_alloc_inequality(bmap);
3234 nparam = isl_basic_map_n_param(bmap);
3235 n_in = isl_basic_map_n_in(bmap);
3236 isl_seq_clr(bmap->ineq[i], 1 + isl_basic_map_total_dim(bmap));
3237 isl_int_set_si(bmap->ineq[i][1+nparam+pos], 1);
3238 isl_int_set_si(bmap->ineq[i][1+nparam+n_in+pos], -1);
3239 return isl_basic_map_finalize(bmap);
3241 isl_basic_map_free(bmap);
3245 struct isl_basic_map *isl_basic_map_equal(struct isl_dim *dim, unsigned n_equal)
3248 struct isl_basic_map *bmap;
3249 bmap = isl_basic_map_alloc_dim(dim, 0, n_equal, 0);
3252 for (i = 0; i < n_equal && bmap; ++i)
3253 bmap = var_equal(bmap, i);
3254 return isl_basic_map_finalize(bmap);
3257 /* Return a relation on of dimension "dim" expressing i_[0..pos] << o_[0..pos]
3259 struct isl_basic_map *isl_basic_map_less_at(struct isl_dim *dim, unsigned pos)
3262 struct isl_basic_map *bmap;
3263 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3266 for (i = 0; i < pos && bmap; ++i)
3267 bmap = var_equal(bmap, i);
3269 bmap = var_less(bmap, pos);
3270 return isl_basic_map_finalize(bmap);
3273 /* Return a relation on of dimension "dim" expressing i_[0..pos] <<= o_[0..pos]
3275 __isl_give isl_basic_map *isl_basic_map_less_or_equal_at(
3276 __isl_take isl_dim *dim, unsigned pos)
3279 isl_basic_map *bmap;
3281 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3282 for (i = 0; i < pos; ++i)
3283 bmap = var_equal(bmap, i);
3284 bmap = var_less_or_equal(bmap, pos);
3285 return isl_basic_map_finalize(bmap);
3288 /* Return a relation on pairs of sets of dimension "dim" expressing i_pos > o_pos
3290 struct isl_basic_map *isl_basic_map_more_at(struct isl_dim *dim, unsigned pos)
3293 struct isl_basic_map *bmap;
3294 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3297 for (i = 0; i < pos && bmap; ++i)
3298 bmap = var_equal(bmap, i);
3300 bmap = var_more(bmap, pos);
3301 return isl_basic_map_finalize(bmap);
3304 /* Return a relation on of dimension "dim" expressing i_[0..pos] >>= o_[0..pos]
3306 __isl_give isl_basic_map *isl_basic_map_more_or_equal_at(
3307 __isl_take isl_dim *dim, unsigned pos)
3310 isl_basic_map *bmap;
3312 bmap = isl_basic_map_alloc_dim(dim, 0, pos, 1);
3313 for (i = 0; i < pos; ++i)
3314 bmap = var_equal(bmap, i);
3315 bmap = var_more_or_equal(bmap, pos);
3316 return isl_basic_map_finalize(bmap);
3319 static __isl_give isl_map *map_lex_lte_first(__isl_take isl_dim *dims,
3320 unsigned n, int equal)
3322 struct isl_map *map;
3325 if (n == 0 && equal)
3326 return isl_map_universe(dims);
3328 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3330 for (i = 0; i + 1 < n; ++i)
3331 map = isl_map_add_basic_map(map,
3332 isl_basic_map_less_at(isl_dim_copy(dims), i));
3335 map = isl_map_add_basic_map(map,
3336 isl_basic_map_less_or_equal_at(dims, n - 1));
3338 map = isl_map_add_basic_map(map,
3339 isl_basic_map_less_at(dims, n - 1));
3346 static __isl_give isl_map *map_lex_lte(__isl_take isl_dim *dims, int equal)
3350 return map_lex_lte_first(dims, dims->n_out, equal);
3353 __isl_give isl_map *isl_map_lex_lt_first(__isl_take isl_dim *dim, unsigned n)
3355 return map_lex_lte_first(dim, n, 0);
3358 __isl_give isl_map *isl_map_lex_le_first(__isl_take isl_dim *dim, unsigned n)
3360 return map_lex_lte_first(dim, n, 1);
3363 __isl_give isl_map *isl_map_lex_lt(__isl_take isl_dim *set_dim)
3365 return map_lex_lte(isl_dim_map_from_set(set_dim), 0);
3368 __isl_give isl_map *isl_map_lex_le(__isl_take isl_dim *set_dim)
3370 return map_lex_lte(isl_dim_map_from_set(set_dim), 1);
3373 static __isl_give isl_map *map_lex_gte_first(__isl_take isl_dim *dims,
3374 unsigned n, int equal)
3376 struct isl_map *map;
3379 if (n == 0 && equal)
3380 return isl_map_universe(dims);
3382 map = isl_map_alloc_dim(isl_dim_copy(dims), n, ISL_MAP_DISJOINT);
3384 for (i = 0; i + 1 < n; ++i)
3385 map = isl_map_add_basic_map(map,
3386 isl_basic_map_more_at(isl_dim_copy(dims), i));
3389 map = isl_map_add_basic_map(map,
3390 isl_basic_map_more_or_equal_at(dims, n - 1));
3392 map = isl_map_add_basic_map(map,
3393 isl_basic_map_more_at(dims, n - 1));
3400 static __isl_give isl_map *map_lex_gte(__isl_take isl_dim *dims, int equal)
3404 return map_lex_gte_first(dims, dims->n_out, equal);
3407 __isl_give isl_map *isl_map_lex_gt_first(__isl_take isl_dim *dim, unsigned n)
3409 return map_lex_gte_first(dim, n, 0);
3412 __isl_give isl_map *isl_map_lex_ge_first(__isl_take isl_dim *dim, unsigned n)
3414 return map_lex_gte_first(dim, n, 1);
3417 __isl_give isl_map *isl_map_lex_gt(__isl_take isl_dim *set_dim)
3419 return map_lex_gte(isl_dim_map_from_set(set_dim), 0);
3422 __isl_give isl_map *isl_map_lex_ge(__isl_take isl_dim *set_dim)
3424 return map_lex_gte(isl_dim_map_from_set(set_dim), 1);
3427 __isl_give isl_map *isl_set_lex_le_set(__isl_take isl_set *set1,
3428 __isl_take isl_set *set2)
3431 map = isl_map_lex_le(isl_set_get_dim(set1));
3432 map = isl_map_intersect_domain(map, set1);
3433 map = isl_map_intersect_range(map, set2);
3437 __isl_give isl_map *isl_set_lex_lt_set(__isl_take isl_set *set1,
3438 __isl_take isl_set *set2)
3441 map = isl_map_lex_lt(isl_set_get_dim(set1));
3442 map = isl_map_intersect_domain(map, set1);
3443 map = isl_map_intersect_range(map, set2);
3447 __isl_give isl_map *isl_set_lex_ge_set(__isl_take isl_set *set1,
3448 __isl_take isl_set *set2)
3451 map = isl_map_lex_ge(isl_set_get_dim(set1));
3452 map = isl_map_intersect_domain(map, set1);
3453 map = isl_map_intersect_range(map, set2);
3457 __isl_give isl_map *isl_set_lex_gt_set(__isl_take isl_set *set1,
3458 __isl_take isl_set *set2)
3461 map = isl_map_lex_gt(isl_set_get_dim(set1));
3462 map = isl_map_intersect_domain(map, set1);
3463 map = isl_map_intersect_range(map, set2);
3467 __isl_give isl_map *isl_map_lex_le_map(__isl_take isl_map *map1,
3468 __isl_take isl_map *map2)
3471 map = isl_map_lex_le(isl_dim_range(isl_map_get_dim(map1)));
3472 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3473 map = isl_map_apply_range(map, isl_map_reverse(map2));
3477 __isl_give isl_map *isl_map_lex_lt_map(__isl_take isl_map *map1,
3478 __isl_take isl_map *map2)
3481 map = isl_map_lex_lt(isl_dim_range(isl_map_get_dim(map1)));
3482 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3483 map = isl_map_apply_range(map, isl_map_reverse(map2));
3487 __isl_give isl_map *isl_map_lex_ge_map(__isl_take isl_map *map1,
3488 __isl_take isl_map *map2)
3491 map = isl_map_lex_ge(isl_dim_range(isl_map_get_dim(map1)));
3492 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3493 map = isl_map_apply_range(map, isl_map_reverse(map2));
3497 __isl_give isl_map *isl_map_lex_gt_map(__isl_take isl_map *map1,
3498 __isl_take isl_map *map2)
3501 map = isl_map_lex_gt(isl_dim_range(isl_map_get_dim(map1)));
3502 map = isl_map_apply_domain(map, isl_map_reverse(map1));
3503 map = isl_map_apply_range(map, isl_map_reverse(map2));
3507 struct isl_basic_map *isl_basic_map_from_basic_set(
3508 struct isl_basic_set *bset, struct isl_dim *dim)
3510 struct isl_basic_map *bmap;
3512 bset = isl_basic_set_cow(bset);
3516 isl_assert(bset->ctx, isl_dim_compatible(bset->dim, dim), goto error);
3517 isl_dim_free(bset->dim);
3518 bmap = (struct isl_basic_map *) bset;
3520 return isl_basic_map_finalize(bmap);
3522 isl_basic_set_free(bset);
3527 struct isl_basic_set *isl_basic_set_from_basic_map(struct isl_basic_map *bmap)
3531 if (bmap->dim->n_in == 0)
3532 return (struct isl_basic_set *)bmap;
3533 bmap = isl_basic_map_cow(bmap);
3536 bmap->dim = isl_dim_as_set_dim(bmap->dim);
3539 bmap = isl_basic_map_finalize(bmap);
3540 return (struct isl_basic_set *)bmap;
3542 isl_basic_map_free(bmap);
3546 /* For a div d = floor(f/m), add the constraints
3549 * -(f-(n-1)) + m d >= 0
3551 * Note that the second constraint is the negation of
3555 int isl_basic_map_add_div_constraints_var(__isl_keep isl_basic_map *bmap,
3556 unsigned pos, isl_int *div)
3559 unsigned total = isl_basic_map_total_dim(bmap);
3561 i = isl_basic_map_alloc_inequality(bmap);
3564 isl_seq_cpy(bmap->ineq[i], div + 1, 1 + total);
3565 isl_int_neg(bmap->ineq[i][1 + pos], div[0]);
3567 j = isl_basic_map_alloc_inequality(bmap);
3570 isl_seq_neg(bmap->ineq[j], bmap->ineq[i], 1 + total);
3571 isl_int_add(bmap->ineq[j][0], bmap->ineq[j][0], bmap->ineq[j][1 + pos]);
3572 isl_int_sub_ui(bmap->ineq[j][0], bmap->ineq[j][0], 1);
3576 int isl_basic_set_add_div_constraints_var(__isl_keep isl_basic_set *bset,
3577 unsigned pos, isl_int *div)
3579 return isl_basic_map_add_div_constraints_var((isl_basic_map *)bset,
3583 int isl_basic_map_add_div_constraints(struct isl_basic_map *bmap, unsigned div)
3585 unsigned total = isl_basic_map_total_dim(bmap);
3586 unsigned div_pos = total - bmap->n_div + div;
3588 return isl_basic_map_add_div_constraints_var(bmap, div_pos,
3592 struct isl_basic_set *isl_basic_map_underlying_set(
3593 struct isl_basic_map *bmap)
3597 if (bmap->dim->nparam == 0 && bmap->dim->n_in == 0 &&
3599 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_in) &&
3600 !isl_dim_is_named_or_nested(bmap->dim, isl_dim_out))
3601 return (struct isl_basic_set *)bmap;
3602 bmap = isl_basic_map_cow(bmap);
3605 bmap->dim = isl_dim_underlying(bmap->dim, bmap->n_div);
3608 bmap->extra -= bmap->n_div;
3610 bmap = isl_basic_map_finalize(bmap);
3611 return (struct isl_basic_set *)bmap;
3616 __isl_give isl_basic_set *isl_basic_set_underlying_set(
3617 __isl_take isl_basic_set *bset)
3619 return isl_basic_map_underlying_set((isl_basic_map *)bset);
3622 struct isl_basic_map *isl_basic_map_overlying_set(
3623 struct isl_basic_set *bset, struct isl_basic_map *like)
3625 struct isl_basic_map *bmap;
3626 struct isl_ctx *ctx;
3633 isl_assert(ctx, bset->n_div == 0, goto error);
3634 isl_assert(ctx, isl_basic_set_n_param(bset) == 0, goto error);
3635 isl_assert(ctx, bset->dim->n_out == isl_basic_map_total_dim(like),
3637 if (isl_dim_equal(bset->dim, like->dim) && like->n_div == 0) {
3638 isl_basic_map_free(like);
3639 return (struct isl_basic_map *)bset;
3641 bset = isl_basic_set_cow(bset);
3644 total = bset->dim->n_out + bset->extra;
3645 bmap = (struct isl_basic_map *)bset;
3646 isl_dim_free(bmap->dim);
3647 bmap->dim = isl_dim_copy(like->dim);
3650 bmap->n_div = like->n_div;
3651 bmap->extra += like->n_div;
3655 ltotal = total - bmap->extra + like->extra;
3658 bmap->block2 = isl_blk_extend(ctx, bmap->block2,
3659 bmap->extra * (1 + 1 + total));
3660 if (isl_blk_is_error(bmap->block2))
3662 div = isl_realloc_array(ctx, bmap->div, isl_int *, bmap->extra);
3666 for (i = 0; i < bmap->extra; ++i)
3667 bmap->div[i] = bmap->block2.data + i * (1 + 1 + total);
3668 for (i = 0; i < like->n_div; ++i) {
3669 isl_seq_cpy(bmap->div[i], like->div[i], 1 + 1 + ltotal);
3670 isl_seq_clr(bmap->div[i]+1+1+ltotal, total - ltotal);
3672 bmap = isl_basic_map_extend_constraints(bmap,
3673 0, 2 * like->n_div);
3674 for (i = 0; i < like->n_div; ++i) {
3675 if (isl_int_is_zero(bmap->div[i][0]))
3677 if (isl_basic_map_add_div_constraints(bmap, i) < 0)
3681 isl_basic_map_free(like);
3682 bmap = isl_basic_map_simplify(bmap);
3683 bmap = isl_basic_map_finalize(bmap);
3686 isl_basic_map_free(like);
3687 isl_basic_set_free(bset);
3691 struct isl_basic_set *isl_basic_set_from_underlying_set(
3692 struct isl_basic_set *bset, struct isl_basic_set *like)
3694 return (struct isl_basic_set *)
3695 isl_basic_map_overlying_set(bset, (struct isl_basic_map *)like);
3698 struct isl_set *isl_set_from_underlying_set(
3699 struct isl_set *set, struct isl_basic_set *like)
3705 isl_assert(set->ctx, set->dim->n_out == isl_basic_set_total_dim(like),
3707 if (isl_dim_equal(set->dim, like->dim) && like->n_div == 0) {
3708 isl_basic_set_free(like);
3711 set = isl_set_cow(set);
3714 for (i = 0; i < set->n; ++i) {
3715 set->p[i] = isl_basic_set_from_underlying_set(set->p[i],
3716 isl_basic_set_copy(like));
3720 isl_dim_free(set->dim);
3721 set->dim = isl_dim_copy(like->dim);
3724 isl_basic_set_free(like);
3727 isl_basic_set_free(like);
3732 struct isl_set *isl_map_underlying_set(struct isl_map *map)
3736 map = isl_map_cow(map);
3739 map->dim = isl_dim_cow(map->dim);
3743 for (i = 1; i < map->n; ++i)
3744 isl_assert(map->ctx, map->p[0]->n_div == map->p[i]->n_div,
3746 for (i = 0; i < map->n; ++i) {
3747 map->p[i] = (struct isl_basic_map *)
3748 isl_basic_map_underlying_set(map->p[i]);
3753 map->dim = isl_dim_underlying(map->dim, 0);
3755 isl_dim_free(map->dim);
3756 map->dim = isl_dim_copy(map->p[0]->dim);
3760 return (struct isl_set *)map;
3766 struct isl_set *isl_set_to_underlying_set(struct isl_set *set)
3768 return (struct isl_set *)isl_map_underlying_set((struct isl_map *)set);
3771 __isl_give isl_basic_map *isl_basic_map_reset_dim(
3772 __isl_take isl_basic_map *bmap, __isl_take isl_dim *dim)
3774 bmap = isl_basic_map_cow(bmap);
3778 isl_dim_free(bmap->dim);
3781 bmap = isl_basic_map_finalize(bmap);
3785 isl_basic_map_free(bmap);
3790 __isl_give isl_basic_set *isl_basic_set_reset_dim(
3791 __isl_take isl_basic_set *bset, __isl_take isl_dim *dim)
3793 return (isl_basic_set *)isl_basic_map_reset_dim((isl_basic_map *)bset,
3797 __isl_give isl_map *isl_map_reset_dim(__isl_take isl_map *map,
3798 __isl_take isl_dim *dim)
3802 map = isl_map_cow(map);
3806 for (i = 0; i < map->n; ++i) {
3807 map->p[i] = isl_basic_map_reset_dim(map->p[i],
3812 isl_dim_free(map->dim);
3822 __isl_give isl_set *isl_set_reset_dim(__isl_take isl_set *set,
3823 __isl_take isl_dim *dim)
3825 return (struct isl_set *) isl_map_reset_dim((struct isl_map *)set, dim);
3828 struct isl_basic_set *isl_basic_map_domain(struct isl_basic_map *bmap)
3831 struct isl_basic_set *domain;
3837 dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
3839 n_in = isl_basic_map_n_in(bmap);
3840 n_out = isl_basic_map_n_out(bmap);
3841 domain = isl_basic_set_from_basic_map(bmap);
3842 domain = isl_basic_set_project_out(domain, isl_dim_set, n_in, n_out);
3844 domain = isl_basic_set_reset_dim(domain, dim);
3849 int isl_basic_map_may_be_set(__isl_keep isl_basic_map *bmap)
3853 return isl_dim_may_be_set(bmap->dim);
3856 struct isl_basic_set *isl_basic_map_range(struct isl_basic_map *bmap)
3860 if (isl_basic_map_may_be_set(bmap))
3862 return isl_basic_map_domain(isl_basic_map_reverse(bmap));
3865 __isl_give isl_basic_map *isl_basic_map_domain_map(
3866 __isl_take isl_basic_map *bmap)
3870 isl_basic_map *domain;
3871 int nparam, n_in, n_out;
3874 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3875 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3876 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3878 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
3879 domain = isl_basic_map_universe(dim);
3881 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3882 bmap = isl_basic_map_apply_range(bmap, domain);
3883 bmap = isl_basic_map_extend_constraints(bmap, n_in, 0);
3885 total = isl_basic_map_total_dim(bmap);
3887 for (i = 0; i < n_in; ++i) {
3888 k = isl_basic_map_alloc_equality(bmap);
3891 isl_seq_clr(bmap->eq[k], 1 + total);
3892 isl_int_set_si(bmap->eq[k][1 + nparam + i], -1);
3893 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3896 bmap = isl_basic_map_gauss(bmap, NULL);
3897 return isl_basic_map_finalize(bmap);
3899 isl_basic_map_free(bmap);
3903 __isl_give isl_basic_map *isl_basic_map_range_map(
3904 __isl_take isl_basic_map *bmap)
3908 isl_basic_map *range;
3909 int nparam, n_in, n_out;
3912 nparam = isl_basic_map_dim(bmap, isl_dim_param);
3913 n_in = isl_basic_map_dim(bmap, isl_dim_in);
3914 n_out = isl_basic_map_dim(bmap, isl_dim_out);
3916 dim = isl_dim_from_range(isl_dim_range(isl_basic_map_get_dim(bmap)));
3917 range = isl_basic_map_universe(dim);
3919 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
3920 bmap = isl_basic_map_apply_range(bmap, range);
3921 bmap = isl_basic_map_extend_constraints(bmap, n_out, 0);
3923 total = isl_basic_map_total_dim(bmap);
3925 for (i = 0; i < n_out; ++i) {
3926 k = isl_basic_map_alloc_equality(bmap);
3929 isl_seq_clr(bmap->eq[k], 1 + total);
3930 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + i], -1);
3931 isl_int_set_si(bmap->eq[k][1 + nparam + n_in + n_out + i], 1);
3934 bmap = isl_basic_map_gauss(bmap, NULL);
3935 return isl_basic_map_finalize(bmap);
3937 isl_basic_map_free(bmap);
3941 int isl_map_may_be_set(__isl_keep isl_map *map)
3945 return isl_dim_may_be_set(map->dim);
3948 struct isl_set *isl_map_range(struct isl_map *map)
3951 struct isl_set *set;
3955 if (isl_map_may_be_set(map))
3956 return (isl_set *)map;
3958 map = isl_map_cow(map);
3962 set = (struct isl_set *) map;
3963 set->dim = isl_dim_drop_inputs(set->dim, 0, set->dim->n_in);
3966 for (i = 0; i < map->n; ++i) {
3967 set->p[i] = isl_basic_map_range(map->p[i]);
3971 ISL_F_CLR(set, ISL_MAP_DISJOINT);
3972 ISL_F_CLR(set, ISL_SET_NORMALIZED);
3979 __isl_give isl_map *isl_map_domain_map(__isl_take isl_map *map)
3982 isl_dim *domain_dim;
3984 map = isl_map_cow(map);
3988 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
3989 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
3990 map->dim = isl_dim_join(map->dim, domain_dim);
3993 for (i = 0; i < map->n; ++i) {
3994 map->p[i] = isl_basic_map_domain_map(map->p[i]);
3998 ISL_F_CLR(map, ISL_MAP_DISJOINT);
3999 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4006 __isl_give isl_map *isl_map_range_map(__isl_take isl_map *map)
4011 map = isl_map_cow(map);
4015 range_dim = isl_dim_range(isl_map_get_dim(map));
4016 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
4017 map->dim = isl_dim_join(map->dim, range_dim);
4020 for (i = 0; i < map->n; ++i) {
4021 map->p[i] = isl_basic_map_range_map(map->p[i]);
4025 ISL_F_CLR(map, ISL_MAP_DISJOINT);
4026 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4033 struct isl_map *isl_map_from_set(struct isl_set *set, struct isl_dim *dim)
4036 struct isl_map *map = NULL;
4038 set = isl_set_cow(set);
4041 isl_assert(set->ctx, isl_dim_compatible(set->dim, dim), goto error);
4042 map = (struct isl_map *)set;
4043 for (i = 0; i < set->n; ++i) {
4044 map->p[i] = isl_basic_map_from_basic_set(
4045 set->p[i], isl_dim_copy(dim));
4049 isl_dim_free(map->dim);
4058 __isl_give isl_basic_map *isl_basic_map_from_domain(
4059 __isl_take isl_basic_set *bset)
4061 return isl_basic_map_reverse(isl_basic_map_from_range(bset));
4064 __isl_give isl_basic_map *isl_basic_map_from_range(
4065 __isl_take isl_basic_set *bset)
4067 return (isl_basic_map *)bset;
4070 struct isl_map *isl_map_from_range(struct isl_set *set)
4072 return (struct isl_map *)set;
4075 __isl_give isl_map *isl_map_from_domain(__isl_take isl_set *set)
4077 return isl_map_reverse(isl_map_from_range(set));
4080 __isl_give isl_basic_map *isl_basic_map_from_domain_and_range(
4081 __isl_take isl_basic_set *domain, __isl_take isl_basic_set *range)
4083 return isl_basic_map_apply_range(isl_basic_map_from_domain(domain),
4084 isl_basic_map_from_range(range));
4087 __isl_give isl_map *isl_map_from_domain_and_range(__isl_take isl_set *domain,
4088 __isl_take isl_set *range)
4090 return isl_map_apply_range(isl_map_from_domain(domain),
4091 isl_map_from_range(range));
4094 struct isl_set *isl_set_from_map(struct isl_map *map)
4097 struct isl_set *set = NULL;
4101 map = isl_map_cow(map);
4104 map->dim = isl_dim_as_set_dim(map->dim);
4107 set = (struct isl_set *)map;
4108 for (i = 0; i < map->n; ++i) {
4109 set->p[i] = isl_basic_set_from_basic_map(map->p[i]);
4119 struct isl_map *isl_map_alloc_dim(struct isl_dim *dim, int n, unsigned flags)
4121 struct isl_map *map;
4125 isl_assert(dim->ctx, n >= 0, return NULL);
4126 map = isl_alloc(dim->ctx, struct isl_map,
4127 sizeof(struct isl_map) +
4128 (n - 1) * sizeof(struct isl_basic_map *));
4132 map->ctx = dim->ctx;
4133 isl_ctx_ref(map->ctx);
4145 struct isl_map *isl_map_alloc(struct isl_ctx *ctx,
4146 unsigned nparam, unsigned in, unsigned out, int n,
4149 struct isl_map *map;
4150 struct isl_dim *dims;
4152 dims = isl_dim_alloc(ctx, nparam, in, out);
4156 map = isl_map_alloc_dim(dims, n, flags);
4160 struct isl_basic_map *isl_basic_map_empty(struct isl_dim *dim)
4162 struct isl_basic_map *bmap;
4163 bmap = isl_basic_map_alloc_dim(dim, 0, 1, 0);
4164 bmap = isl_basic_map_set_to_empty(bmap);
4168 struct isl_basic_set *isl_basic_set_empty(struct isl_dim *dim)
4170 struct isl_basic_set *bset;
4171 bset = isl_basic_set_alloc_dim(dim, 0, 1, 0);
4172 bset = isl_basic_set_set_to_empty(bset);
4176 struct isl_basic_map *isl_basic_map_empty_like(struct isl_basic_map *model)
4178 struct isl_basic_map *bmap;
4181 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4182 bmap = isl_basic_map_set_to_empty(bmap);
4186 struct isl_basic_map *isl_basic_map_empty_like_map(struct isl_map *model)
4188 struct isl_basic_map *bmap;
4191 bmap = isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4192 bmap = isl_basic_map_set_to_empty(bmap);
4196 struct isl_basic_set *isl_basic_set_empty_like(struct isl_basic_set *model)
4198 struct isl_basic_set *bset;
4201 bset = isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 1, 0);
4202 bset = isl_basic_set_set_to_empty(bset);
4206 struct isl_basic_map *isl_basic_map_universe(struct isl_dim *dim)
4208 struct isl_basic_map *bmap;
4209 bmap = isl_basic_map_alloc_dim(dim, 0, 0, 0);
4210 bmap = isl_basic_map_finalize(bmap);
4214 struct isl_basic_set *isl_basic_set_universe(struct isl_dim *dim)
4216 struct isl_basic_set *bset;
4217 bset = isl_basic_set_alloc_dim(dim, 0, 0, 0);
4218 bset = isl_basic_set_finalize(bset);
4222 __isl_give isl_basic_map *isl_basic_map_nat_universe(__isl_take isl_dim *dim)
4225 unsigned total = isl_dim_total(dim);
4226 isl_basic_map *bmap;
4228 bmap= isl_basic_map_alloc_dim(dim, 0, 0, total);
4229 for (i = 0; i < total; ++i) {
4230 int k = isl_basic_map_alloc_inequality(bmap);
4233 isl_seq_clr(bmap->ineq[k], 1 + total);
4234 isl_int_set_si(bmap->ineq[k][1 + i], 1);
4238 isl_basic_map_free(bmap);
4242 __isl_give isl_basic_set *isl_basic_set_nat_universe(__isl_take isl_dim *dim)
4244 return isl_basic_map_nat_universe(dim);
4247 __isl_give isl_map *isl_map_nat_universe(__isl_take isl_dim *dim)
4249 return isl_map_from_basic_map(isl_basic_map_nat_universe(dim));
4252 __isl_give isl_set *isl_set_nat_universe(__isl_take isl_dim *dim)
4254 return isl_map_nat_universe(dim);
4257 __isl_give isl_basic_map *isl_basic_map_universe_like(
4258 __isl_keep isl_basic_map *model)
4262 return isl_basic_map_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4265 struct isl_basic_set *isl_basic_set_universe_like(struct isl_basic_set *model)
4269 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4272 __isl_give isl_basic_set *isl_basic_set_universe_like_set(
4273 __isl_keep isl_set *model)
4277 return isl_basic_set_alloc_dim(isl_dim_copy(model->dim), 0, 0, 0);
4280 struct isl_map *isl_map_empty(struct isl_dim *dim)
4282 return isl_map_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4285 struct isl_map *isl_map_empty_like(struct isl_map *model)
4289 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4292 struct isl_map *isl_map_empty_like_basic_map(struct isl_basic_map *model)
4296 return isl_map_alloc_dim(isl_dim_copy(model->dim), 0, ISL_MAP_DISJOINT);
4299 struct isl_set *isl_set_empty(struct isl_dim *dim)
4301 return isl_set_alloc_dim(dim, 0, ISL_MAP_DISJOINT);
4304 struct isl_set *isl_set_empty_like(struct isl_set *model)
4308 return isl_set_empty(isl_dim_copy(model->dim));
4311 struct isl_map *isl_map_universe(struct isl_dim *dim)
4313 struct isl_map *map;
4316 map = isl_map_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4317 map = isl_map_add_basic_map(map, isl_basic_map_universe(dim));
4321 struct isl_set *isl_set_universe(struct isl_dim *dim)
4323 struct isl_set *set;
4326 set = isl_set_alloc_dim(isl_dim_copy(dim), 1, ISL_MAP_DISJOINT);
4327 set = isl_set_add_basic_set(set, isl_basic_set_universe(dim));
4331 __isl_give isl_set *isl_set_universe_like(__isl_keep isl_set *model)
4335 return isl_set_universe(isl_dim_copy(model->dim));
4338 struct isl_map *isl_map_dup(struct isl_map *map)
4341 struct isl_map *dup;
4345 dup = isl_map_alloc_dim(isl_dim_copy(map->dim), map->n, map->flags);
4346 for (i = 0; i < map->n; ++i)
4347 dup = isl_map_add_basic_map(dup, isl_basic_map_copy(map->p[i]));
4351 __isl_give isl_map *isl_map_add_basic_map(__isl_take isl_map *map,
4352 __isl_take isl_basic_map *bmap)
4356 if (isl_basic_map_plain_is_empty(bmap)) {
4357 isl_basic_map_free(bmap);
4360 isl_assert(map->ctx, isl_dim_equal(map->dim, bmap->dim), goto error);
4361 isl_assert(map->ctx, map->n < map->size, goto error);
4362 map->p[map->n] = bmap;
4364 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4370 isl_basic_map_free(bmap);
4374 void isl_map_free(struct isl_map *map)
4384 isl_ctx_deref(map->ctx);
4385 for (i = 0; i < map->n; ++i)
4386 isl_basic_map_free(map->p[i]);
4387 isl_dim_free(map->dim);
4391 struct isl_map *isl_map_extend(struct isl_map *base,
4392 unsigned nparam, unsigned n_in, unsigned n_out)
4396 base = isl_map_cow(base);
4400 base->dim = isl_dim_extend(base->dim, nparam, n_in, n_out);
4403 for (i = 0; i < base->n; ++i) {
4404 base->p[i] = isl_basic_map_extend_dim(base->p[i],
4405 isl_dim_copy(base->dim), 0, 0, 0);
4415 struct isl_set *isl_set_extend(struct isl_set *base,
4416 unsigned nparam, unsigned dim)
4418 return (struct isl_set *)isl_map_extend((struct isl_map *)base,
4422 static struct isl_basic_map *isl_basic_map_fix_pos_si(
4423 struct isl_basic_map *bmap, unsigned pos, int value)
4427 bmap = isl_basic_map_cow(bmap);
4428 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4429 j = isl_basic_map_alloc_equality(bmap);
4432 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4433 isl_int_set_si(bmap->eq[j][pos], -1);
4434 isl_int_set_si(bmap->eq[j][0], value);
4435 bmap = isl_basic_map_simplify(bmap);
4436 return isl_basic_map_finalize(bmap);
4438 isl_basic_map_free(bmap);
4442 static __isl_give isl_basic_map *isl_basic_map_fix_pos(
4443 __isl_take isl_basic_map *bmap, unsigned pos, isl_int value)
4447 bmap = isl_basic_map_cow(bmap);
4448 bmap = isl_basic_map_extend_constraints(bmap, 1, 0);
4449 j = isl_basic_map_alloc_equality(bmap);
4452 isl_seq_clr(bmap->eq[j] + 1, isl_basic_map_total_dim(bmap));
4453 isl_int_set_si(bmap->eq[j][pos], -1);
4454 isl_int_set(bmap->eq[j][0], value);
4455 bmap = isl_basic_map_simplify(bmap);
4456 return isl_basic_map_finalize(bmap);
4458 isl_basic_map_free(bmap);
4462 struct isl_basic_map *isl_basic_map_fix_si(struct isl_basic_map *bmap,
4463 enum isl_dim_type type, unsigned pos, int value)
4467 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4468 return isl_basic_map_fix_pos_si(bmap,
4469 isl_basic_map_offset(bmap, type) + pos, value);
4471 isl_basic_map_free(bmap);
4475 __isl_give isl_basic_map *isl_basic_map_fix(__isl_take isl_basic_map *bmap,
4476 enum isl_dim_type type, unsigned pos, isl_int value)
4480 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4481 return isl_basic_map_fix_pos(bmap,
4482 isl_basic_map_offset(bmap, type) + pos, value);
4484 isl_basic_map_free(bmap);
4488 struct isl_basic_set *isl_basic_set_fix_si(struct isl_basic_set *bset,
4489 enum isl_dim_type type, unsigned pos, int value)
4491 return (struct isl_basic_set *)
4492 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4496 __isl_give isl_basic_set *isl_basic_set_fix(__isl_take isl_basic_set *bset,
4497 enum isl_dim_type type, unsigned pos, isl_int value)
4499 return (struct isl_basic_set *)
4500 isl_basic_map_fix((struct isl_basic_map *)bset,
4504 struct isl_basic_map *isl_basic_map_fix_input_si(struct isl_basic_map *bmap,
4505 unsigned input, int value)
4507 return isl_basic_map_fix_si(bmap, isl_dim_in, input, value);
4510 struct isl_basic_set *isl_basic_set_fix_dim_si(struct isl_basic_set *bset,
4511 unsigned dim, int value)
4513 return (struct isl_basic_set *)
4514 isl_basic_map_fix_si((struct isl_basic_map *)bset,
4515 isl_dim_set, dim, value);
4518 struct isl_map *isl_map_fix_si(struct isl_map *map,
4519 enum isl_dim_type type, unsigned pos, int value)
4523 map = isl_map_cow(map);
4527 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4528 for (i = 0; i < map->n; ++i) {
4529 map->p[i] = isl_basic_map_fix_si(map->p[i], type, pos, value);
4533 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4540 __isl_give isl_set *isl_set_fix_si(__isl_take isl_set *set,
4541 enum isl_dim_type type, unsigned pos, int value)
4543 return (struct isl_set *)
4544 isl_map_fix_si((struct isl_map *)set, type, pos, value);
4547 __isl_give isl_map *isl_map_fix(__isl_take isl_map *map,
4548 enum isl_dim_type type, unsigned pos, isl_int value)
4552 map = isl_map_cow(map);
4556 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4557 for (i = 0; i < map->n; ++i) {
4558 map->p[i] = isl_basic_map_fix(map->p[i], type, pos, value);
4562 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4569 __isl_give isl_set *isl_set_fix(__isl_take isl_set *set,
4570 enum isl_dim_type type, unsigned pos, isl_int value)
4572 return (struct isl_set *)isl_map_fix((isl_map *)set, type, pos, value);
4575 struct isl_map *isl_map_fix_input_si(struct isl_map *map,
4576 unsigned input, int value)
4578 return isl_map_fix_si(map, isl_dim_in, input, value);
4581 struct isl_set *isl_set_fix_dim_si(struct isl_set *set, unsigned dim, int value)
4583 return (struct isl_set *)
4584 isl_map_fix_si((struct isl_map *)set, isl_dim_set, dim, value);
4587 __isl_give isl_basic_map *isl_basic_map_lower_bound_si(
4588 __isl_take isl_basic_map *bmap,
4589 enum isl_dim_type type, unsigned pos, int value)
4595 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), goto error);
4596 pos += isl_basic_map_offset(bmap, type);
4597 bmap = isl_basic_map_cow(bmap);
4598 bmap = isl_basic_map_extend_constraints(bmap, 0, 1);
4599 j = isl_basic_map_alloc_inequality(bmap);
4602 isl_seq_clr(bmap->ineq[j], 1 + isl_basic_map_total_dim(bmap));
4603 isl_int_set_si(bmap->ineq[j][pos], 1);
4604 isl_int_set_si(bmap->ineq[j][0], -value);
4605 bmap = isl_basic_map_simplify(bmap);
4606 return isl_basic_map_finalize(bmap);
4608 isl_basic_map_free(bmap);
4612 struct isl_basic_set *isl_basic_set_lower_bound_dim(struct isl_basic_set *bset,
4613 unsigned dim, isl_int value)
4617 bset = isl_basic_set_cow(bset);
4618 bset = isl_basic_set_extend_constraints(bset, 0, 1);
4619 j = isl_basic_set_alloc_inequality(bset);
4622 isl_seq_clr(bset->ineq[j], 1 + isl_basic_set_total_dim(bset));
4623 isl_int_set_si(bset->ineq[j][1 + isl_basic_set_n_param(bset) + dim], 1);
4624 isl_int_neg(bset->ineq[j][0], value);
4625 bset = isl_basic_set_simplify(bset);
4626 return isl_basic_set_finalize(bset);
4628 isl_basic_set_free(bset);
4632 __isl_give isl_map *isl_map_lower_bound_si(__isl_take isl_map *map,
4633 enum isl_dim_type type, unsigned pos, int value)
4637 map = isl_map_cow(map);
4641 isl_assert(map->ctx, pos < isl_map_dim(map, type), goto error);
4642 for (i = 0; i < map->n; ++i) {
4643 map->p[i] = isl_basic_map_lower_bound_si(map->p[i],
4648 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4655 __isl_give isl_set *isl_set_lower_bound_si(__isl_take isl_set *set,
4656 enum isl_dim_type type, unsigned pos, int value)
4658 return (struct isl_set *)
4659 isl_map_lower_bound_si((struct isl_map *)set, type, pos, value);
4662 struct isl_set *isl_set_lower_bound_dim(struct isl_set *set, unsigned dim,
4667 set = isl_set_cow(set);
4671 isl_assert(set->ctx, dim < isl_set_n_dim(set), goto error);
4672 for (i = 0; i < set->n; ++i) {
4673 set->p[i] = isl_basic_set_lower_bound_dim(set->p[i], dim, value);
4683 struct isl_map *isl_map_reverse(struct isl_map *map)
4687 map = isl_map_cow(map);
4691 map->dim = isl_dim_reverse(map->dim);
4694 for (i = 0; i < map->n; ++i) {
4695 map->p[i] = isl_basic_map_reverse(map->p[i]);
4699 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
4706 static struct isl_map *isl_basic_map_partial_lexopt(
4707 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4708 struct isl_set **empty, int max)
4712 if (bmap->ctx->opt->pip == ISL_PIP_PIP)
4713 return isl_pip_basic_map_lexopt(bmap, dom, empty, max);
4715 return isl_tab_basic_map_partial_lexopt(bmap, dom, empty, max);
4717 isl_basic_map_free(bmap);
4718 isl_basic_set_free(dom);
4724 struct isl_map *isl_basic_map_partial_lexmax(
4725 struct isl_basic_map *bmap, struct isl_basic_set *dom,
4726 struct isl_set **empty)
4728 return isl_basic_map_partial_lexopt(bmap, dom, empty, 1);
4731 struct isl_map *isl_basic_map_partial_lexmin(
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, 0);
4738 struct isl_set *isl_basic_set_partial_lexmin(
4739 struct isl_basic_set *bset, struct isl_basic_set *dom,
4740 struct isl_set **empty)
4742 return (struct isl_set *)
4743 isl_basic_map_partial_lexmin((struct isl_basic_map *)bset,
4747 struct isl_set *isl_basic_set_partial_lexmax(
4748 struct isl_basic_set *bset, struct isl_basic_set *dom,
4749 struct isl_set **empty)
4751 return (struct isl_set *)
4752 isl_basic_map_partial_lexmax((struct isl_basic_map *)bset,
4756 /* Given a basic map "bmap", compute the lexicographically minimal
4757 * (or maximal) image element for each domain element in dom.
4758 * Set *empty to those elements in dom that do not have an image element.
4760 * We first make sure the basic sets in dom are disjoint and then
4761 * simply collect the results over each of the basic sets separately.
4762 * We could probably improve the efficiency a bit by moving the union
4763 * domain down into the parametric integer programming.
4765 static __isl_give isl_map *basic_map_partial_lexopt(
4766 __isl_take isl_basic_map *bmap, __isl_take isl_set *dom,
4767 __isl_give isl_set **empty, int max)
4770 struct isl_map *res;
4772 dom = isl_set_make_disjoint(dom);
4776 if (isl_set_plain_is_empty(dom)) {
4777 res = isl_map_empty_like_basic_map(bmap);
4778 *empty = isl_set_empty_like(dom);
4780 isl_basic_map_free(bmap);
4784 res = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4785 isl_basic_set_copy(dom->p[0]), empty, max);
4787 for (i = 1; i < dom->n; ++i) {
4788 struct isl_map *res_i;
4789 struct isl_set *empty_i;
4791 res_i = isl_basic_map_partial_lexopt(isl_basic_map_copy(bmap),
4792 isl_basic_set_copy(dom->p[i]), &empty_i, max);
4794 res = isl_map_union_disjoint(res, res_i);
4795 *empty = isl_set_union_disjoint(*empty, empty_i);
4799 isl_basic_map_free(bmap);
4804 isl_basic_map_free(bmap);
4808 /* Given a map "map", compute the lexicographically minimal
4809 * (or maximal) image element for each domain element in dom.
4810 * Set *empty to those elements in dom that do not have an image element.
4812 * We first compute the lexicographically minimal or maximal element
4813 * in the first basic map. This results in a partial solution "res"
4814 * and a subset "todo" of dom that still need to be handled.
4815 * We then consider each of the remaining maps in "map" and successively
4816 * improve both "res" and "todo".
4818 * Let res^k and todo^k be the results after k steps and let i = k + 1.
4819 * Assume we are computing the lexicographical maximum.
4820 * We first compute the lexicographically maximal element in basic map i.
4821 * This results in a partial solution res_i and a subset todo_i.
4822 * Then we combine these results with those obtain for the first k basic maps
4823 * to obtain a result that is valid for the first k+1 basic maps.
4824 * In particular, the set where there is no solution is the set where
4825 * there is no solution for the first k basic maps and also no solution
4826 * for the ith basic map, i.e.,
4828 * todo^i = todo^k * todo_i
4830 * On dom(res^k) * dom(res_i), we need to pick the larger of the two
4831 * solutions, arbitrarily breaking ties in favor of res^k.
4832 * That is, when res^k(a) >= res_i(a), we pick res^k and
4833 * when res^k(a) < res_i(a), we pick res_i. (Here, ">=" and "<" denote
4834 * the lexicographic order.)
4835 * In practice, we compute
4837 * res^k * (res_i . "<=")
4841 * res_i * (res^k . "<")
4843 * Finally, we consider the symmetric difference of dom(res^k) and dom(res_i),
4844 * where only one of res^k and res_i provides a solution and we simply pick
4851 * Note that we only compute these intersections when dom(res^k) intersects
4852 * dom(res_i). Otherwise, the only effect of these intersections is to
4853 * potentially break up res^k and res_i into smaller pieces.
4854 * We want to avoid such splintering as much as possible.
4855 * In fact, an earlier implementation of this function would look for
4856 * better results in the domain of res^k and for extra results in todo^k,
4857 * but this would always result in a splintering according to todo^k,
4858 * even when the domain of basic map i is disjoint from the domains of
4859 * the previous basic maps.
4861 static __isl_give isl_map *isl_map_partial_lexopt(
4862 __isl_take isl_map *map, __isl_take isl_set *dom,
4863 __isl_give isl_set **empty, int max)
4866 struct isl_map *res;
4867 struct isl_set *todo;
4872 if (isl_map_plain_is_empty(map)) {
4880 res = basic_map_partial_lexopt(isl_basic_map_copy(map->p[0]),
4881 isl_set_copy(dom), &todo, max);
4883 for (i = 1; i < map->n; ++i) {
4887 isl_dim *dim = isl_dim_range(isl_map_get_dim(res));
4889 res_i = basic_map_partial_lexopt(isl_basic_map_copy(map->p[i]),
4890 isl_set_copy(dom), &todo_i, max);
4893 lt = isl_map_lex_lt(isl_dim_copy(dim));
4894 le = isl_map_lex_le(dim);
4896 lt = isl_map_lex_gt(isl_dim_copy(dim));
4897 le = isl_map_lex_ge(dim);
4899 lt = isl_map_apply_range(isl_map_copy(res), lt);
4900 lt = isl_map_intersect(lt, isl_map_copy(res_i));
4901 le = isl_map_apply_range(isl_map_copy(res_i), le);
4902 le = isl_map_intersect(le, isl_map_copy(res));
4904 if (!isl_map_is_empty(lt) || !isl_map_is_empty(le)) {
4905 res = isl_map_intersect_domain(res,
4906 isl_set_copy(todo_i));
4907 res_i = isl_map_intersect_domain(res_i,
4908 isl_set_copy(todo));
4911 res = isl_map_union_disjoint(res, res_i);
4912 res = isl_map_union_disjoint(res, lt);
4913 res = isl_map_union_disjoint(res, le);
4915 todo = isl_set_intersect(todo, todo_i);
4935 __isl_give isl_map *isl_map_partial_lexmax(
4936 __isl_take isl_map *map, __isl_take isl_set *dom,
4937 __isl_give isl_set **empty)
4939 return isl_map_partial_lexopt(map, dom, empty, 1);
4942 __isl_give isl_map *isl_map_partial_lexmin(
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, 0);
4949 __isl_give isl_set *isl_set_partial_lexmin(
4950 __isl_take isl_set *set, __isl_take isl_set *dom,
4951 __isl_give isl_set **empty)
4953 return (struct isl_set *)
4954 isl_map_partial_lexmin((struct isl_map *)set,
4958 __isl_give isl_set *isl_set_partial_lexmax(
4959 __isl_take isl_set *set, __isl_take isl_set *dom,
4960 __isl_give isl_set **empty)
4962 return (struct isl_set *)
4963 isl_map_partial_lexmax((struct isl_map *)set,
4967 __isl_give isl_map *isl_basic_map_lexopt(__isl_take isl_basic_map *bmap, int max)
4969 struct isl_basic_set *dom = NULL;
4970 struct isl_dim *dom_dim;
4974 dom_dim = isl_dim_domain(isl_dim_copy(bmap->dim));
4975 dom = isl_basic_set_universe(dom_dim);
4976 return isl_basic_map_partial_lexopt(bmap, dom, NULL, max);
4978 isl_basic_map_free(bmap);
4982 __isl_give isl_map *isl_basic_map_lexmin(__isl_take isl_basic_map *bmap)
4984 return isl_basic_map_lexopt(bmap, 0);
4987 __isl_give isl_map *isl_basic_map_lexmax(__isl_take isl_basic_map *bmap)
4989 return isl_basic_map_lexopt(bmap, 1);
4992 __isl_give isl_set *isl_basic_set_lexmin(__isl_take isl_basic_set *bset)
4994 return (isl_set *)isl_basic_map_lexmin((isl_basic_map *)bset);
4997 __isl_give isl_set *isl_basic_set_lexmax(__isl_take isl_basic_set *bset)
4999 return (isl_set *)isl_basic_map_lexmax((isl_basic_map *)bset);
5002 __isl_give isl_map *isl_map_lexopt(__isl_take isl_map *map, int max)
5004 struct isl_set *dom = NULL;
5005 struct isl_dim *dom_dim;
5009 dom_dim = isl_dim_domain(isl_dim_copy(map->dim));
5010 dom = isl_set_universe(dom_dim);
5011 return isl_map_partial_lexopt(map, dom, NULL, max);
5017 __isl_give isl_map *isl_map_lexmin(__isl_take isl_map *map)
5019 return isl_map_lexopt(map, 0);
5022 __isl_give isl_map *isl_map_lexmax(__isl_take isl_map *map)
5024 return isl_map_lexopt(map, 1);
5027 __isl_give isl_set *isl_set_lexmin(__isl_take isl_set *set)
5029 return (isl_set *)isl_map_lexmin((isl_map *)set);
5032 __isl_give isl_set *isl_set_lexmax(__isl_take isl_set *set)
5034 return (isl_set *)isl_map_lexmax((isl_map *)set);
5037 /* Apply a preimage specified by "mat" on the parameters of "bset".
5038 * bset is assumed to have only parameters and divs.
5040 static struct isl_basic_set *basic_set_parameter_preimage(
5041 struct isl_basic_set *bset, struct isl_mat *mat)
5048 bset->dim = isl_dim_cow(bset->dim);
5052 nparam = isl_basic_set_dim(bset, isl_dim_param);
5054 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
5056 bset->dim->nparam = 0;
5057 bset->dim->n_out = nparam;
5058 bset = isl_basic_set_preimage(bset, mat);
5060 bset->dim->nparam = bset->dim->n_out;
5061 bset->dim->n_out = 0;
5066 isl_basic_set_free(bset);
5070 /* Apply a preimage specified by "mat" on the parameters of "set".
5071 * set is assumed to have only parameters and divs.
5073 static struct isl_set *set_parameter_preimage(
5074 struct isl_set *set, struct isl_mat *mat)
5076 struct isl_dim *dim = NULL;
5082 dim = isl_dim_copy(set->dim);
5083 dim = isl_dim_cow(dim);
5087 nparam = isl_set_dim(set, isl_dim_param);
5089 isl_assert(set->ctx, mat->n_row == 1 + nparam, goto error);
5092 dim->n_out = nparam;
5093 isl_set_reset_dim(set, dim);
5094 set = isl_set_preimage(set, mat);
5097 dim = isl_dim_copy(set->dim);
5098 dim = isl_dim_cow(dim);
5101 dim->nparam = dim->n_out;
5103 isl_set_reset_dim(set, dim);
5113 /* Intersect the basic set "bset" with the affine space specified by the
5114 * equalities in "eq".
5116 static struct isl_basic_set *basic_set_append_equalities(
5117 struct isl_basic_set *bset, struct isl_mat *eq)
5125 bset = isl_basic_set_extend_dim(bset, isl_dim_copy(bset->dim), 0,
5130 len = 1 + isl_dim_total(bset->dim) + bset->extra;
5131 for (i = 0; i < eq->n_row; ++i) {
5132 k = isl_basic_set_alloc_equality(bset);
5135 isl_seq_cpy(bset->eq[k], eq->row[i], eq->n_col);
5136 isl_seq_clr(bset->eq[k] + eq->n_col, len - eq->n_col);
5140 bset = isl_basic_set_gauss(bset, NULL);
5141 bset = isl_basic_set_finalize(bset);
5146 isl_basic_set_free(bset);
5150 /* Intersect the set "set" with the affine space specified by the
5151 * equalities in "eq".
5153 static struct isl_set *set_append_equalities(struct isl_set *set,
5161 for (i = 0; i < set->n; ++i) {
5162 set->p[i] = basic_set_append_equalities(set->p[i],
5175 /* Project the given basic set onto its parameter domain, possibly introducing
5176 * new, explicit, existential variables in the constraints.
5177 * The input has parameters and (possibly implicit) existential variables.
5178 * The output has the same parameters, but only
5179 * explicit existentially quantified variables.
5181 * The actual projection is performed by pip, but pip doesn't seem
5182 * to like equalities very much, so we first remove the equalities
5183 * among the parameters by performing a variable compression on
5184 * the parameters. Afterward, an inverse transformation is performed
5185 * and the equalities among the parameters are inserted back in.
5187 static struct isl_set *parameter_compute_divs(struct isl_basic_set *bset)
5191 struct isl_mat *T, *T2;
5192 struct isl_set *set;
5193 unsigned nparam, n_div;
5195 bset = isl_basic_set_cow(bset);
5199 if (bset->n_eq == 0)
5200 return isl_basic_set_lexmin(bset);
5202 isl_basic_set_gauss(bset, NULL);
5204 nparam = isl_basic_set_dim(bset, isl_dim_param);
5205 n_div = isl_basic_set_dim(bset, isl_dim_div);
5207 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
5208 if (!isl_int_is_zero(bset->eq[i][1 + nparam + j]))
5211 if (i == bset->n_eq)
5212 return isl_basic_set_lexmin(bset);
5214 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
5216 eq = isl_mat_cow(eq);
5217 T = isl_mat_variable_compression(isl_mat_copy(eq), &T2);
5218 if (T && T->n_col == 0) {
5222 bset = isl_basic_set_set_to_empty(bset);
5223 return isl_set_from_basic_set(bset);
5225 bset = basic_set_parameter_preimage(bset, T);
5227 set = isl_basic_set_lexmin(bset);
5228 set = set_parameter_preimage(set, T2);
5229 set = set_append_equalities(set, eq);
5233 /* Compute an explicit representation for all the existentially
5234 * quantified variables.
5235 * The input and output dimensions are first turned into parameters.
5236 * compute_divs then returns a map with the same parameters and
5237 * no input or output dimensions and the dimension specification
5238 * is reset to that of the input.
5240 static struct isl_map *compute_divs(struct isl_basic_map *bmap)
5242 struct isl_basic_set *bset;
5243 struct isl_set *set;
5244 struct isl_map *map;
5245 struct isl_dim *dim, *orig_dim = NULL;
5250 bmap = isl_basic_map_cow(bmap);
5254 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5255 n_in = isl_basic_map_dim(bmap, isl_dim_in);
5256 n_out = isl_basic_map_dim(bmap, isl_dim_out);
5257 dim = isl_dim_set_alloc(bmap->ctx, nparam + n_in + n_out, 0);
5261 orig_dim = bmap->dim;
5263 bset = (struct isl_basic_set *)bmap;
5265 set = parameter_compute_divs(bset);
5266 map = (struct isl_map *)set;
5267 map = isl_map_reset_dim(map, orig_dim);
5271 isl_basic_map_free(bmap);
5275 static int basic_map_divs_known(__isl_keep isl_basic_map *bmap)
5283 off = isl_dim_total(bmap->dim);
5284 for (i = 0; i < bmap->n_div; ++i) {
5285 if (isl_int_is_zero(bmap->div[i][0]))
5287 isl_assert(bmap->ctx, isl_int_is_zero(bmap->div[i][1+1+off+i]),
5293 static int map_divs_known(__isl_keep isl_map *map)
5300 for (i = 0; i < map->n; ++i) {
5301 int known = basic_map_divs_known(map->p[i]);
5309 /* If bmap contains any unknown divs, then compute explicit
5310 * expressions for them. However, this computation may be
5311 * quite expensive, so first try to remove divs that aren't
5314 struct isl_map *isl_basic_map_compute_divs(struct isl_basic_map *bmap)
5317 struct isl_map *map;
5319 known = basic_map_divs_known(bmap);
5323 return isl_map_from_basic_map(bmap);
5325 bmap = isl_basic_map_drop_redundant_divs(bmap);
5327 known = basic_map_divs_known(bmap);
5331 return isl_map_from_basic_map(bmap);
5333 map = compute_divs(bmap);
5336 isl_basic_map_free(bmap);
5340 struct isl_map *isl_map_compute_divs(struct isl_map *map)
5344 struct isl_map *res;
5351 known = map_divs_known(map);
5359 res = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[0]));
5360 for (i = 1 ; i < map->n; ++i) {
5362 r2 = isl_basic_map_compute_divs(isl_basic_map_copy(map->p[i]));
5363 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT))
5364 res = isl_map_union_disjoint(res, r2);
5366 res = isl_map_union(res, r2);
5373 struct isl_set *isl_basic_set_compute_divs(struct isl_basic_set *bset)
5375 return (struct isl_set *)
5376 isl_basic_map_compute_divs((struct isl_basic_map *)bset);
5379 struct isl_set *isl_set_compute_divs(struct isl_set *set)
5381 return (struct isl_set *)
5382 isl_map_compute_divs((struct isl_map *)set);
5385 struct isl_set *isl_map_domain(struct isl_map *map)
5388 struct isl_set *set;
5393 map = isl_map_cow(map);
5397 set = (struct isl_set *)map;
5398 set->dim = isl_dim_domain(set->dim);
5401 for (i = 0; i < map->n; ++i) {
5402 set->p[i] = isl_basic_map_domain(map->p[i]);
5406 ISL_F_CLR(set, ISL_MAP_DISJOINT);
5407 ISL_F_CLR(set, ISL_SET_NORMALIZED);
5414 struct isl_map *isl_map_union_disjoint(
5415 struct isl_map *map1, struct isl_map *map2)
5419 struct isl_map *map = NULL;
5433 isl_assert(map1->ctx, isl_dim_equal(map1->dim, map2->dim), goto error);
5435 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
5436 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
5437 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5439 map = isl_map_alloc_dim(isl_dim_copy(map1->dim),
5440 map1->n + map2->n, flags);
5443 for (i = 0; i < map1->n; ++i) {
5444 map = isl_map_add_basic_map(map,
5445 isl_basic_map_copy(map1->p[i]));
5449 for (i = 0; i < map2->n; ++i) {
5450 map = isl_map_add_basic_map(map,
5451 isl_basic_map_copy(map2->p[i]));
5465 struct isl_map *isl_map_union(struct isl_map *map1, struct isl_map *map2)
5467 map1 = isl_map_union_disjoint(map1, map2);
5471 ISL_F_CLR(map1, ISL_MAP_DISJOINT);
5475 struct isl_set *isl_set_union_disjoint(
5476 struct isl_set *set1, struct isl_set *set2)
5478 return (struct isl_set *)
5479 isl_map_union_disjoint(
5480 (struct isl_map *)set1, (struct isl_map *)set2);
5483 struct isl_set *isl_set_union(struct isl_set *set1, struct isl_set *set2)
5485 return (struct isl_set *)
5486 isl_map_union((struct isl_map *)set1, (struct isl_map *)set2);
5489 struct isl_map *isl_map_intersect_range(
5490 struct isl_map *map, struct isl_set *set)
5493 struct isl_map *result;
5499 if (!isl_dim_match(map->dim, isl_dim_param, set->dim, isl_dim_param))
5500 isl_die(set->ctx, isl_error_invalid,
5501 "parameters don't match", goto error);
5503 if (isl_dim_size(set->dim, isl_dim_set) != 0 &&
5504 !isl_map_compatible_range(map, set))
5505 isl_die(set->ctx, isl_error_invalid,
5506 "incompatible spaces", goto error);
5508 if (isl_set_plain_is_universe(set)) {
5513 if (ISL_F_ISSET(map, ISL_MAP_DISJOINT) &&
5514 ISL_F_ISSET(set, ISL_MAP_DISJOINT))
5515 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
5517 result = isl_map_alloc_dim(isl_dim_copy(map->dim),
5518 map->n * set->n, flags);
5521 for (i = 0; i < map->n; ++i)
5522 for (j = 0; j < set->n; ++j) {
5523 result = isl_map_add_basic_map(result,
5524 isl_basic_map_intersect_range(
5525 isl_basic_map_copy(map->p[i]),
5526 isl_basic_set_copy(set->p[j])));
5539 struct isl_map *isl_map_intersect_domain(
5540 struct isl_map *map, struct isl_set *set)
5542 return isl_map_reverse(
5543 isl_map_intersect_range(isl_map_reverse(map), set));
5546 struct isl_map *isl_map_apply_domain(
5547 struct isl_map *map1, struct isl_map *map2)
5551 map1 = isl_map_reverse(map1);
5552 map1 = isl_map_apply_range(map1, map2);
5553 return isl_map_reverse(map1);
5560 struct isl_map *isl_map_apply_range(
5561 struct isl_map *map1, struct isl_map *map2)
5563 struct isl_dim *dim_result;
5564 struct isl_map *result;
5570 dim_result = isl_dim_join(isl_dim_copy(map1->dim),
5571 isl_dim_copy(map2->dim));
5573 result = isl_map_alloc_dim(dim_result, map1->n * map2->n, 0);
5576 for (i = 0; i < map1->n; ++i)
5577 for (j = 0; j < map2->n; ++j) {
5578 result = isl_map_add_basic_map(result,
5579 isl_basic_map_apply_range(
5580 isl_basic_map_copy(map1->p[i]),
5581 isl_basic_map_copy(map2->p[j])));
5587 if (result && result->n <= 1)
5588 ISL_F_SET(result, ISL_MAP_DISJOINT);
5597 * returns range - domain
5599 struct isl_basic_set *isl_basic_map_deltas(struct isl_basic_map *bmap)
5601 isl_dim *dims, *target_dim;
5602 struct isl_basic_set *bset;
5609 isl_assert(bmap->ctx, isl_dim_tuple_match(bmap->dim, isl_dim_in,
5610 bmap->dim, isl_dim_out),
5612 target_dim = isl_dim_domain(isl_basic_map_get_dim(bmap));
5613 dim = isl_basic_map_n_in(bmap);
5614 nparam = isl_basic_map_n_param(bmap);
5615 bset = isl_basic_set_from_basic_map(bmap);
5616 bset = isl_basic_set_cow(bset);
5617 dims = isl_basic_set_get_dim(bset);
5618 dims = isl_dim_add(dims, isl_dim_set, dim);
5619 bset = isl_basic_set_extend_dim(bset, dims, 0, dim, 0);
5620 bset = isl_basic_set_swap_vars(bset, 2*dim);
5621 for (i = 0; i < dim; ++i) {
5622 int j = isl_basic_map_alloc_equality(
5623 (struct isl_basic_map *)bset);
5626 isl_seq_clr(bset->eq[j], 1 + isl_basic_set_total_dim(bset));
5627 isl_int_set_si(bset->eq[j][1+nparam+i], 1);
5628 isl_int_set_si(bset->eq[j][1+nparam+dim+i], 1);
5629 isl_int_set_si(bset->eq[j][1+nparam+2*dim+i], -1);
5631 bset = isl_basic_set_project_out(bset, isl_dim_set, dim, 2*dim);
5632 bset = isl_basic_set_reset_dim(bset, target_dim);
5635 isl_basic_map_free(bmap);
5640 * returns range - domain
5642 struct isl_set *isl_map_deltas(struct isl_map *map)
5646 struct isl_set *result;
5651 isl_assert(map->ctx, isl_dim_tuple_match(map->dim, isl_dim_in,
5652 map->dim, isl_dim_out),
5654 dim = isl_map_get_dim(map);
5655 dim = isl_dim_domain(dim);
5656 result = isl_set_alloc_dim(dim, map->n, 0);
5659 for (i = 0; i < map->n; ++i)
5660 result = isl_set_add_basic_set(result,
5661 isl_basic_map_deltas(isl_basic_map_copy(map->p[i])));
5670 * returns [domain -> range] -> range - domain
5672 __isl_give isl_basic_map *isl_basic_map_deltas_map(
5673 __isl_take isl_basic_map *bmap)
5677 isl_basic_map *domain;
5681 if (!isl_dim_tuple_match(bmap->dim, isl_dim_in, bmap->dim, isl_dim_out))
5682 isl_die(bmap->ctx, isl_error_invalid,
5683 "domain and range don't match", goto error);
5685 nparam = isl_basic_map_dim(bmap, isl_dim_param);
5686 n = isl_basic_map_dim(bmap, isl_dim_in);
5688 dim = isl_dim_from_range(isl_dim_domain(isl_basic_map_get_dim(bmap)));
5689 domain = isl_basic_map_universe(dim);
5691 bmap = isl_basic_map_from_domain(isl_basic_map_wrap(bmap));
5692 bmap = isl_basic_map_apply_range(bmap, domain);
5693 bmap = isl_basic_map_extend_constraints(bmap, n, 0);
5695 total = isl_basic_map_total_dim(bmap);
5697 for (i = 0; i < n; ++i) {
5698 k = isl_basic_map_alloc_equality(bmap);
5701 isl_seq_clr(bmap->eq[k], 1 + total);
5702 isl_int_set_si(bmap->eq[k][1 + nparam + i], 1);
5703 isl_int_set_si(bmap->eq[k][1 + nparam + n + i], -1);
5704 isl_int_set_si(bmap->eq[k][1 + nparam + n + n + i], 1);
5707 bmap = isl_basic_map_gauss(bmap, NULL);
5708 return isl_basic_map_finalize(bmap);
5710 isl_basic_map_free(bmap);
5715 * returns [domain -> range] -> range - domain
5717 __isl_give isl_map *isl_map_deltas_map(__isl_take isl_map *map)
5720 isl_dim *domain_dim;
5725 if (!isl_dim_tuple_match(map->dim, isl_dim_in, map->dim, isl_dim_out))
5726 isl_die(map->ctx, isl_error_invalid,
5727 "domain and range don't match", goto error);
5729 map = isl_map_cow(map);
5733 domain_dim = isl_dim_from_range(isl_dim_domain(isl_map_get_dim(map)));
5734 map->dim = isl_dim_from_domain(isl_dim_wrap(map->dim));
5735 map->dim = isl_dim_join(map->dim, domain_dim);
5738 for (i = 0; i < map->n; ++i) {
5739 map->p[i] = isl_basic_map_deltas_map(map->p[i]);
5743 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
5750 static struct isl_basic_map *basic_map_identity(struct isl_dim *dims)
5752 struct isl_basic_map *bmap;
5760 nparam = dims->nparam;
5762 bmap = isl_basic_map_alloc_dim(dims, 0, dim, 0);
5766 for (i = 0; i < dim; ++i) {
5767 int j = isl_basic_map_alloc_equality(bmap);
5770 isl_seq_clr(bmap->eq[j], 1 + isl_basic_map_total_dim(bmap));
5771 isl_int_set_si(bmap->eq[j][1+nparam+i], 1);
5772 isl_int_set_si(bmap->eq[j][1+nparam+dim+i], -1);
5774 return isl_basic_map_finalize(bmap);
5776 isl_basic_map_free(bmap);
5780 __isl_give isl_basic_map *isl_basic_map_identity(__isl_take isl_dim *dim)
5784 if (dim->n_in != dim->n_out)
5785 isl_die(dim->ctx, isl_error_invalid,
5786 "number of input and output dimensions needs to be "
5787 "the same", goto error);
5788 return basic_map_identity(dim);
5794 struct isl_basic_map *isl_basic_map_identity_like(struct isl_basic_map *model)
5796 if (!model || !model->dim)
5798 return isl_basic_map_identity(isl_dim_copy(model->dim));
5801 __isl_give isl_map *isl_map_identity(__isl_take isl_dim *dim)
5803 return isl_map_from_basic_map(isl_basic_map_identity(dim));
5806 struct isl_map *isl_map_identity_like(struct isl_map *model)
5808 if (!model || !model->dim)
5810 return isl_map_identity(isl_dim_copy(model->dim));
5813 struct isl_map *isl_map_identity_like_basic_map(struct isl_basic_map *model)
5815 if (!model || !model->dim)
5817 return isl_map_identity(isl_dim_copy(model->dim));
5820 __isl_give isl_map *isl_set_identity(__isl_take isl_set *set)
5822 isl_dim *dim = isl_set_get_dim(set);
5824 id = isl_map_identity(isl_dim_map_from_set(dim));
5825 return isl_map_intersect_range(id, set);
5828 /* Construct a basic set with all set dimensions having only non-negative
5831 struct isl_basic_set *isl_basic_set_positive_orthant(struct isl_dim *dims)
5836 struct isl_basic_set *bset;
5840 nparam = dims->nparam;
5842 bset = isl_basic_set_alloc_dim(dims, 0, 0, dim);
5845 for (i = 0; i < dim; ++i) {
5846 int k = isl_basic_set_alloc_inequality(bset);
5849 isl_seq_clr(bset->ineq[k], 1 + isl_basic_set_total_dim(bset));
5850 isl_int_set_si(bset->ineq[k][1 + nparam + i], 1);
5854 isl_basic_set_free(bset);
5858 /* Construct the half-space x_pos >= 0.
5860 static __isl_give isl_basic_set *nonneg_halfspace(__isl_take isl_dim *dim,
5864 isl_basic_set *nonneg;
5866 nonneg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5867 k = isl_basic_set_alloc_inequality(nonneg);
5870 isl_seq_clr(nonneg->ineq[k], 1 + isl_basic_set_total_dim(nonneg));
5871 isl_int_set_si(nonneg->ineq[k][pos], 1);
5873 return isl_basic_set_finalize(nonneg);
5875 isl_basic_set_free(nonneg);
5879 /* Construct the half-space x_pos <= -1.
5881 static __isl_give isl_basic_set *neg_halfspace(__isl_take isl_dim *dim, int pos)
5886 neg = isl_basic_set_alloc_dim(dim, 0, 0, 1);
5887 k = isl_basic_set_alloc_inequality(neg);
5890 isl_seq_clr(neg->ineq[k], 1 + isl_basic_set_total_dim(neg));
5891 isl_int_set_si(neg->ineq[k][0], -1);
5892 isl_int_set_si(neg->ineq[k][pos], -1);
5894 return isl_basic_set_finalize(neg);
5896 isl_basic_set_free(neg);
5900 __isl_give isl_set *isl_set_split_dims(__isl_take isl_set *set,
5901 enum isl_dim_type type, unsigned first, unsigned n)
5904 isl_basic_set *nonneg;
5912 isl_assert(set->ctx, first + n <= isl_set_dim(set, type), goto error);
5914 for (i = 0; i < n; ++i) {
5915 nonneg = nonneg_halfspace(isl_set_get_dim(set),
5916 pos(set->dim, type) + first + i);
5917 neg = neg_halfspace(isl_set_get_dim(set),
5918 pos(set->dim, type) + first + i);
5920 set = isl_set_intersect(set, isl_basic_set_union(nonneg, neg));
5929 static int foreach_orthant(__isl_take isl_set *set, int *signs, int first,
5930 int len, int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5937 if (isl_set_plain_is_empty(set)) {
5942 return fn(set, signs, user);
5945 half = isl_set_from_basic_set(nonneg_halfspace(isl_set_get_dim(set),
5947 half = isl_set_intersect(half, isl_set_copy(set));
5948 if (foreach_orthant(half, signs, first + 1, len, fn, user) < 0)
5952 half = isl_set_from_basic_set(neg_halfspace(isl_set_get_dim(set),
5954 half = isl_set_intersect(half, set);
5955 return foreach_orthant(half, signs, first + 1, len, fn, user);
5961 /* Call "fn" on the intersections of "set" with each of the orthants
5962 * (except for obviously empty intersections). The orthant is identified
5963 * by the signs array, with each entry having value 1 or -1 according
5964 * to the sign of the corresponding variable.
5966 int isl_set_foreach_orthant(__isl_keep isl_set *set,
5967 int (*fn)(__isl_take isl_set *orthant, int *signs, void *user),
5977 if (isl_set_plain_is_empty(set))
5980 nparam = isl_set_dim(set, isl_dim_param);
5981 nvar = isl_set_dim(set, isl_dim_set);
5983 signs = isl_alloc_array(set->ctx, int, nparam + nvar);
5985 r = foreach_orthant(isl_set_copy(set), signs, 0, nparam + nvar,
5993 int isl_set_is_equal(struct isl_set *set1, struct isl_set *set2)
5995 return isl_map_is_equal((struct isl_map *)set1, (struct isl_map *)set2);
5998 int isl_basic_map_is_subset(
5999 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6002 struct isl_map *map1;
6003 struct isl_map *map2;
6005 if (!bmap1 || !bmap2)
6008 map1 = isl_map_from_basic_map(isl_basic_map_copy(bmap1));
6009 map2 = isl_map_from_basic_map(isl_basic_map_copy(bmap2));
6011 is_subset = isl_map_is_subset(map1, map2);
6019 int isl_basic_map_is_equal(
6020 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6024 if (!bmap1 || !bmap2)
6026 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6029 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6033 int isl_basic_set_is_equal(
6034 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6036 return isl_basic_map_is_equal(
6037 (struct isl_basic_map *)bset1, (struct isl_basic_map *)bset2);
6040 int isl_map_is_empty(struct isl_map *map)
6047 for (i = 0; i < map->n; ++i) {
6048 is_empty = isl_basic_map_is_empty(map->p[i]);
6057 int isl_map_plain_is_empty(__isl_keep isl_map *map)
6059 return map ? map->n == 0 : -1;
6062 int isl_map_fast_is_empty(__isl_keep isl_map *map)
6064 return isl_map_plain_is_empty(map);
6067 int isl_set_plain_is_empty(struct isl_set *set)
6069 return set ? set->n == 0 : -1;
6072 int isl_set_fast_is_empty(__isl_keep isl_set *set)
6074 return isl_set_plain_is_empty(set);
6077 int isl_set_is_empty(struct isl_set *set)
6079 return isl_map_is_empty((struct isl_map *)set);
6082 int isl_map_has_equal_dim(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
6087 return isl_dim_equal(map1->dim, map2->dim);
6090 int isl_set_has_equal_dim(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6095 return isl_dim_equal(set1->dim, set2->dim);
6098 int isl_map_is_equal(struct isl_map *map1, struct isl_map *map2)
6104 is_subset = isl_map_is_subset(map1, map2);
6107 is_subset = isl_map_is_subset(map2, map1);
6111 int isl_basic_map_is_strict_subset(
6112 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6116 if (!bmap1 || !bmap2)
6118 is_subset = isl_basic_map_is_subset(bmap1, bmap2);
6121 is_subset = isl_basic_map_is_subset(bmap2, bmap1);
6122 if (is_subset == -1)
6127 int isl_map_is_strict_subset(struct isl_map *map1, struct isl_map *map2)
6133 is_subset = isl_map_is_subset(map1, map2);
6136 is_subset = isl_map_is_subset(map2, map1);
6137 if (is_subset == -1)
6142 int isl_set_is_strict_subset(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
6144 return isl_map_is_strict_subset((isl_map *)set1, (isl_map *)set2);
6147 int isl_basic_map_is_universe(struct isl_basic_map *bmap)
6151 return bmap->n_eq == 0 && bmap->n_ineq == 0;
6154 int isl_basic_set_is_universe(struct isl_basic_set *bset)
6158 return bset->n_eq == 0 && bset->n_ineq == 0;
6161 int isl_map_plain_is_universe(__isl_keep isl_map *map)
6168 for (i = 0; i < map->n; ++i) {
6169 int r = isl_basic_map_is_universe(map->p[i]);
6177 int isl_set_plain_is_universe(__isl_keep isl_set *set)
6179 return isl_map_plain_is_universe((isl_map *) set);
6182 int isl_set_fast_is_universe(__isl_keep isl_set *set)
6184 return isl_set_plain_is_universe(set);
6187 int isl_basic_map_is_empty(struct isl_basic_map *bmap)
6189 struct isl_basic_set *bset = NULL;
6190 struct isl_vec *sample = NULL;
6197 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY))
6200 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL)) {
6201 struct isl_basic_map *copy = isl_basic_map_copy(bmap);
6202 copy = isl_basic_map_remove_redundancies(copy);
6203 empty = ISL_F_ISSET(copy, ISL_BASIC_MAP_EMPTY);
6204 isl_basic_map_free(copy);
6208 total = 1 + isl_basic_map_total_dim(bmap);
6209 if (bmap->sample && bmap->sample->size == total) {
6210 int contains = isl_basic_map_contains(bmap, bmap->sample);
6216 isl_vec_free(bmap->sample);
6217 bmap->sample = NULL;
6218 bset = isl_basic_map_underlying_set(isl_basic_map_copy(bmap));
6221 sample = isl_basic_set_sample_vec(bset);
6224 empty = sample->size == 0;
6225 isl_vec_free(bmap->sample);
6226 bmap->sample = sample;
6228 ISL_F_SET(bmap, ISL_BASIC_MAP_EMPTY);
6233 int isl_basic_map_plain_is_empty(__isl_keep isl_basic_map *bmap)
6237 return ISL_F_ISSET(bmap, ISL_BASIC_MAP_EMPTY);
6240 int isl_basic_map_fast_is_empty(__isl_keep isl_basic_map *bmap)
6242 return isl_basic_map_plain_is_empty(bmap);
6245 int isl_basic_set_plain_is_empty(__isl_keep isl_basic_set *bset)
6249 return ISL_F_ISSET(bset, ISL_BASIC_SET_EMPTY);
6252 int isl_basic_set_fast_is_empty(__isl_keep isl_basic_set *bset)
6254 return isl_basic_set_plain_is_empty(bset);
6257 int isl_basic_set_is_empty(struct isl_basic_set *bset)
6259 return isl_basic_map_is_empty((struct isl_basic_map *)bset);
6262 struct isl_map *isl_basic_map_union(
6263 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
6265 struct isl_map *map;
6266 if (!bmap1 || !bmap2)
6269 isl_assert(bmap1->ctx, isl_dim_equal(bmap1->dim, bmap2->dim), goto error);
6271 map = isl_map_alloc_dim(isl_dim_copy(bmap1->dim), 2, 0);
6274 map = isl_map_add_basic_map(map, bmap1);
6275 map = isl_map_add_basic_map(map, bmap2);
6278 isl_basic_map_free(bmap1);
6279 isl_basic_map_free(bmap2);
6283 struct isl_set *isl_basic_set_union(
6284 struct isl_basic_set *bset1, struct isl_basic_set *bset2)
6286 return (struct isl_set *)isl_basic_map_union(
6287 (struct isl_basic_map *)bset1,
6288 (struct isl_basic_map *)bset2);
6291 /* Order divs such that any div only depends on previous divs */
6292 struct isl_basic_map *isl_basic_map_order_divs(struct isl_basic_map *bmap)
6300 off = isl_dim_total(bmap->dim);
6302 for (i = 0; i < bmap->n_div; ++i) {
6304 if (isl_int_is_zero(bmap->div[i][0]))
6306 pos = isl_seq_first_non_zero(bmap->div[i]+1+1+off+i,
6310 isl_basic_map_swap_div(bmap, i, i + pos);
6316 struct isl_basic_set *isl_basic_set_order_divs(struct isl_basic_set *bset)
6318 return (struct isl_basic_set *)
6319 isl_basic_map_order_divs((struct isl_basic_map *)bset);
6322 __isl_give isl_map *isl_map_order_divs(__isl_take isl_map *map)
6329 for (i = 0; i < map->n; ++i) {
6330 map->p[i] = isl_basic_map_order_divs(map->p[i]);
6341 /* Apply the expansion computed by isl_merge_divs.
6342 * The expansion itself is given by "exp" while the resulting
6343 * list of divs is given by "div".
6345 __isl_give isl_basic_set *isl_basic_set_expand_divs(
6346 __isl_take isl_basic_set *bset, __isl_take isl_mat *div, int *exp)
6351 bset = isl_basic_set_cow(bset);
6355 if (div->n_row < bset->n_div)
6356 isl_die(isl_mat_get_ctx(div), isl_error_invalid,
6357 "not an expansion", goto error);
6359 bset = isl_basic_map_extend_dim(bset, isl_dim_copy(bset->dim),
6360 div->n_row - bset->n_div, 0,
6361 2 * (div->n_row - bset->n_div));
6363 n_div = bset->n_div;
6364 for (i = n_div; i < div->n_row; ++i)
6365 if (isl_basic_set_alloc_div(bset) < 0)
6369 for (i = div->n_row - 1; i >= 0; --i) {
6370 if (j >= 0 && exp[j] == i) {
6372 isl_basic_map_swap_div(bset, i, j);
6375 isl_seq_cpy(bset->div[i], div->row[i], div->n_col);
6376 if (isl_basic_map_add_div_constraints(bset, i) < 0)
6384 isl_basic_set_free(bset);
6389 /* Look for a div in dst that corresponds to the div "div" in src.
6390 * The divs before "div" in src and dst are assumed to be the same.
6392 * Returns -1 if no corresponding div was found and the position
6393 * of the corresponding div in dst otherwise.
6395 static int find_div(struct isl_basic_map *dst,
6396 struct isl_basic_map *src, unsigned div)
6400 unsigned total = isl_dim_total(src->dim);
6402 isl_assert(dst->ctx, div <= dst->n_div, return -1);
6403 for (i = div; i < dst->n_div; ++i)
6404 if (isl_seq_eq(dst->div[i], src->div[div], 1+1+total+div) &&
6405 isl_seq_first_non_zero(dst->div[i]+1+1+total+div,
6406 dst->n_div - div) == -1)
6411 struct isl_basic_map *isl_basic_map_align_divs(
6412 struct isl_basic_map *dst, struct isl_basic_map *src)
6415 unsigned total = isl_dim_total(src->dim);
6420 if (src->n_div == 0)
6423 for (i = 0; i < src->n_div; ++i)
6424 isl_assert(src->ctx, !isl_int_is_zero(src->div[i][0]), goto error);
6426 src = isl_basic_map_order_divs(src);
6427 dst = isl_basic_map_cow(dst);
6428 dst = isl_basic_map_extend_dim(dst, isl_dim_copy(dst->dim),
6429 src->n_div, 0, 2 * src->n_div);
6432 for (i = 0; i < src->n_div; ++i) {
6433 int j = find_div(dst, src, i);
6435 j = isl_basic_map_alloc_div(dst);
6438 isl_seq_cpy(dst->div[j], src->div[i], 1+1+total+i);
6439 isl_seq_clr(dst->div[j]+1+1+total+i, dst->n_div - i);
6440 if (isl_basic_map_add_div_constraints(dst, j) < 0)
6444 isl_basic_map_swap_div(dst, i, j);
6448 isl_basic_map_free(dst);
6452 struct isl_basic_set *isl_basic_set_align_divs(
6453 struct isl_basic_set *dst, struct isl_basic_set *src)
6455 return (struct isl_basic_set *)isl_basic_map_align_divs(
6456 (struct isl_basic_map *)dst, (struct isl_basic_map *)src);
6459 struct isl_map *isl_map_align_divs(struct isl_map *map)
6467 map = isl_map_compute_divs(map);
6468 map = isl_map_cow(map);
6472 for (i = 1; i < map->n; ++i)
6473 map->p[0] = isl_basic_map_align_divs(map->p[0], map->p[i]);
6474 for (i = 1; i < map->n; ++i)
6475 map->p[i] = isl_basic_map_align_divs(map->p[i], map->p[0]);
6477 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6481 struct isl_set *isl_set_align_divs(struct isl_set *set)
6483 return (struct isl_set *)isl_map_align_divs((struct isl_map *)set);
6486 struct isl_set *isl_set_apply(struct isl_set *set, struct isl_map *map)
6490 isl_assert(set->ctx, isl_map_compatible_domain(map, set), goto error);
6491 map = isl_map_intersect_domain(map, set);
6492 set = isl_map_range(map);
6500 /* There is no need to cow as removing empty parts doesn't change
6501 * the meaning of the set.
6503 struct isl_map *isl_map_remove_empty_parts(struct isl_map *map)
6510 for (i = map->n-1; i >= 0; --i) {
6511 if (!ISL_F_ISSET(map->p[i], ISL_BASIC_MAP_EMPTY))
6513 isl_basic_map_free(map->p[i]);
6514 if (i != map->n-1) {
6515 ISL_F_CLR(map, ISL_MAP_NORMALIZED);
6516 map->p[i] = map->p[map->n-1];
6524 struct isl_set *isl_set_remove_empty_parts(struct isl_set *set)
6526 return (struct isl_set *)
6527 isl_map_remove_empty_parts((struct isl_map *)set);
6530 struct isl_basic_map *isl_map_copy_basic_map(struct isl_map *map)
6532 struct isl_basic_map *bmap;
6533 if (!map || map->n == 0)
6535 bmap = map->p[map->n-1];
6536 isl_assert(map->ctx, ISL_F_ISSET(bmap, ISL_BASIC_SET_FINAL), return NULL);
6537 return isl_basic_map_copy(bmap);
6540 struct isl_basic_set *isl_set_copy_basic_set(struct isl_set *set)
6542 return (struct isl_basic_set *)
6543 isl_map_copy_basic_map((struct isl_map *)set);
6546 __isl_give isl_map *isl_map_drop_basic_map(__isl_take isl_map *map,
6547 __isl_keep isl_basic_map *bmap)
6553 for (i = map->n-1; i >= 0; --i) {
6554 if (map->p[i] != bmap)
6556 map = isl_map_cow(map);
6559 isl_basic_map_free(map->p[i]);
6560 if (i != map->n-1) {
6561 ISL_F_CLR(map, ISL_SET_NORMALIZED);
6562 map->p[i] = map->p[map->n-1];
6573 struct isl_set *isl_set_drop_basic_set(struct isl_set *set,
6574 struct isl_basic_set *bset)
6576 return (struct isl_set *)isl_map_drop_basic_map((struct isl_map *)set,
6577 (struct isl_basic_map *)bset);
6580 /* Given two basic sets bset1 and bset2, compute the maximal difference
6581 * between the values of dimension pos in bset1 and those in bset2
6582 * for any common value of the parameters and dimensions preceding pos.
6584 static enum isl_lp_result basic_set_maximal_difference_at(
6585 __isl_keep isl_basic_set *bset1, __isl_keep isl_basic_set *bset2,
6586 int pos, isl_int *opt)
6588 struct isl_dim *dims;
6589 struct isl_basic_map *bmap1 = NULL;
6590 struct isl_basic_map *bmap2 = NULL;
6591 struct isl_ctx *ctx;
6592 struct isl_vec *obj;
6595 unsigned dim1, dim2;
6596 enum isl_lp_result res;
6598 if (!bset1 || !bset2)
6599 return isl_lp_error;
6601 nparam = isl_basic_set_n_param(bset1);
6602 dim1 = isl_basic_set_n_dim(bset1);
6603 dim2 = isl_basic_set_n_dim(bset2);
6604 dims = isl_dim_alloc(bset1->ctx, nparam, pos, dim1 - pos);
6605 bmap1 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset1), dims);
6606 dims = isl_dim_alloc(bset2->ctx, nparam, pos, dim2 - pos);
6607 bmap2 = isl_basic_map_from_basic_set(isl_basic_set_copy(bset2), dims);
6608 if (!bmap1 || !bmap2)
6610 bmap1 = isl_basic_map_cow(bmap1);
6611 bmap1 = isl_basic_map_extend(bmap1, nparam,
6612 pos, (dim1 - pos) + (dim2 - pos),
6613 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
6614 bmap1 = add_constraints(bmap1, bmap2, 0, dim1 - pos);
6617 total = isl_basic_map_total_dim(bmap1);
6619 obj = isl_vec_alloc(ctx, 1 + total);
6620 isl_seq_clr(obj->block.data, 1 + total);
6621 isl_int_set_si(obj->block.data[1+nparam+pos], 1);
6622 isl_int_set_si(obj->block.data[1+nparam+pos+(dim1-pos)], -1);
6625 res = isl_basic_map_solve_lp(bmap1, 1, obj->block.data, ctx->one,
6627 isl_basic_map_free(bmap1);
6631 isl_basic_map_free(bmap1);
6632 isl_basic_map_free(bmap2);
6633 return isl_lp_error;
6636 /* Given two _disjoint_ basic sets bset1 and bset2, check whether
6637 * for any common value of the parameters and dimensions preceding pos
6638 * in both basic sets, the values of dimension pos in bset1 are
6639 * smaller or larger than those in bset2.
6642 * 1 if bset1 follows bset2
6643 * -1 if bset1 precedes bset2
6644 * 0 if bset1 and bset2 are incomparable
6645 * -2 if some error occurred.
6647 int isl_basic_set_compare_at(struct isl_basic_set *bset1,
6648 struct isl_basic_set *bset2, int pos)
6651 enum isl_lp_result res;
6656 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6658 if (res == isl_lp_empty)
6660 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6661 res == isl_lp_unbounded)
6663 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6672 /* Given two basic sets bset1 and bset2, check whether
6673 * for any common value of the parameters and dimensions preceding pos
6674 * there is a value of dimension pos in bset1 that is larger
6675 * than a value of the same dimension in bset2.
6678 * 1 if there exists such a pair
6679 * 0 if there is no such pair, but there is a pair of equal values
6681 * -2 if some error occurred.
6683 int isl_basic_set_follows_at(__isl_keep isl_basic_set *bset1,
6684 __isl_keep isl_basic_set *bset2, int pos)
6687 enum isl_lp_result res;
6692 res = basic_set_maximal_difference_at(bset1, bset2, pos, &opt);
6694 if (res == isl_lp_empty)
6696 else if ((res == isl_lp_ok && isl_int_is_pos(opt)) ||
6697 res == isl_lp_unbounded)
6699 else if (res == isl_lp_ok && isl_int_is_neg(opt))
6701 else if (res == isl_lp_ok)
6710 /* Given two sets set1 and set2, check whether
6711 * for any common value of the parameters and dimensions preceding pos
6712 * there is a value of dimension pos in set1 that is larger
6713 * than a value of the same dimension in set2.
6716 * 1 if there exists such a pair
6717 * 0 if there is no such pair, but there is a pair of equal values
6719 * -2 if some error occurred.
6721 int isl_set_follows_at(__isl_keep isl_set *set1,
6722 __isl_keep isl_set *set2, int pos)
6730 for (i = 0; i < set1->n; ++i)
6731 for (j = 0; j < set2->n; ++j) {
6733 f = isl_basic_set_follows_at(set1->p[i], set2->p[j], pos);
6734 if (f == 1 || f == -2)
6743 static int isl_basic_map_plain_has_fixed_var(__isl_keep isl_basic_map *bmap,
6744 unsigned pos, isl_int *val)
6752 total = isl_basic_map_total_dim(bmap);
6753 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
6754 for (; d+1 > pos; --d)
6755 if (!isl_int_is_zero(bmap->eq[i][1+d]))
6759 if (isl_seq_first_non_zero(bmap->eq[i]+1, d) != -1)
6761 if (isl_seq_first_non_zero(bmap->eq[i]+1+d+1, total-d-1) != -1)
6763 if (!isl_int_is_one(bmap->eq[i][1+d]))
6766 isl_int_neg(*val, bmap->eq[i][0]);
6772 static int isl_map_plain_has_fixed_var(__isl_keep isl_map *map,
6773 unsigned pos, isl_int *val)
6785 return isl_basic_map_plain_has_fixed_var(map->p[0], pos, val);
6788 fixed = isl_basic_map_plain_has_fixed_var(map->p[0], pos, &v);
6789 for (i = 1; fixed == 1 && i < map->n; ++i) {
6790 fixed = isl_basic_map_plain_has_fixed_var(map->p[i], pos, &tmp);
6791 if (fixed == 1 && isl_int_ne(tmp, v))
6795 isl_int_set(*val, v);
6801 static int isl_basic_set_plain_has_fixed_var(__isl_keep isl_basic_set *bset,
6802 unsigned pos, isl_int *val)
6804 return isl_basic_map_plain_has_fixed_var((struct isl_basic_map *)bset,
6808 static int isl_set_plain_has_fixed_var(__isl_keep isl_set *set, unsigned pos,
6811 return isl_map_plain_has_fixed_var((struct isl_map *)set, pos, val);
6814 int isl_basic_map_plain_is_fixed(__isl_keep isl_basic_map *bmap,
6815 enum isl_dim_type type, unsigned pos, isl_int *val)
6817 if (pos >= isl_basic_map_dim(bmap, type))
6819 return isl_basic_map_plain_has_fixed_var(bmap,
6820 isl_basic_map_offset(bmap, type) - 1 + pos, val);
6823 int isl_map_plain_is_fixed(__isl_keep isl_map *map,
6824 enum isl_dim_type type, unsigned pos, isl_int *val)
6826 if (pos >= isl_map_dim(map, type))
6828 return isl_map_plain_has_fixed_var(map,
6829 map_offset(map, type) - 1 + pos, val);
6832 int isl_map_fast_is_fixed(__isl_keep isl_map *map,
6833 enum isl_dim_type type, unsigned pos, isl_int *val)
6835 return isl_map_plain_is_fixed(map, type, pos, val);
6838 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6839 * then return this fixed value in *val.
6841 int isl_basic_set_plain_dim_is_fixed(__isl_keep isl_basic_set *bset,
6842 unsigned dim, isl_int *val)
6844 return isl_basic_set_plain_has_fixed_var(bset,
6845 isl_basic_set_n_param(bset) + dim, val);
6848 /* Check if dimension dim has fixed value and if so and if val is not NULL,
6849 * then return this fixed value in *val.
6851 int isl_set_plain_dim_is_fixed(__isl_keep isl_set *set,
6852 unsigned dim, isl_int *val)
6854 return isl_set_plain_has_fixed_var(set, isl_set_n_param(set) + dim, val);
6857 int isl_set_fast_dim_is_fixed(__isl_keep isl_set *set,
6858 unsigned dim, isl_int *val)
6860 return isl_set_plain_dim_is_fixed(set, dim, val);
6863 /* Check if input variable in has fixed value and if so and if val is not NULL,
6864 * then return this fixed value in *val.
6866 int isl_map_plain_input_is_fixed(__isl_keep isl_map *map,
6867 unsigned in, isl_int *val)
6869 return isl_map_plain_has_fixed_var(map, isl_map_n_param(map) + in, val);
6872 /* Check if dimension dim has an (obvious) fixed lower bound and if so
6873 * and if val is not NULL, then return this lower bound in *val.
6875 int isl_basic_set_plain_dim_has_fixed_lower_bound(
6876 __isl_keep isl_basic_set *bset, unsigned dim, isl_int *val)
6878 int i, i_eq = -1, i_ineq = -1;
6885 total = isl_basic_set_total_dim(bset);
6886 nparam = isl_basic_set_n_param(bset);
6887 for (i = 0; i < bset->n_eq; ++i) {
6888 if (isl_int_is_zero(bset->eq[i][1+nparam+dim]))
6894 for (i = 0; i < bset->n_ineq; ++i) {
6895 if (!isl_int_is_pos(bset->ineq[i][1+nparam+dim]))
6897 if (i_eq != -1 || i_ineq != -1)
6901 if (i_eq == -1 && i_ineq == -1)
6903 c = i_eq != -1 ? bset->eq[i_eq] : bset->ineq[i_ineq];
6904 /* The coefficient should always be one due to normalization. */
6905 if (!isl_int_is_one(c[1+nparam+dim]))
6907 if (isl_seq_first_non_zero(c+1, nparam+dim) != -1)
6909 if (isl_seq_first_non_zero(c+1+nparam+dim+1,
6910 total - nparam - dim - 1) != -1)
6913 isl_int_neg(*val, c[0]);
6917 int isl_set_plain_dim_has_fixed_lower_bound(__isl_keep isl_set *set,
6918 unsigned dim, isl_int *val)
6930 return isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
6934 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[0],
6936 for (i = 1; fixed == 1 && i < set->n; ++i) {
6937 fixed = isl_basic_set_plain_dim_has_fixed_lower_bound(set->p[i],
6939 if (fixed == 1 && isl_int_ne(tmp, v))
6943 isl_int_set(*val, v);
6954 /* uset_gist depends on constraints without existentially quantified
6955 * variables sorting first.
6957 static int qsort_constraint_cmp(const void *p1, const void *p2)
6959 const struct constraint *c1 = (const struct constraint *)p1;
6960 const struct constraint *c2 = (const struct constraint *)p2;
6962 unsigned size = isl_min(c1->size, c2->size);
6964 l1 = isl_seq_last_non_zero(c1->c, size);
6965 l2 = isl_seq_last_non_zero(c2->c, size);
6970 return isl_seq_cmp(c1->c, c2->c, size);
6973 static struct isl_basic_map *isl_basic_map_sort_constraints(
6974 struct isl_basic_map *bmap)
6977 struct constraint *c;
6982 total = isl_basic_map_total_dim(bmap);
6983 c = isl_alloc_array(bmap->ctx, struct constraint, bmap->n_ineq);
6986 for (i = 0; i < bmap->n_ineq; ++i) {
6988 c[i].c = bmap->ineq[i];
6990 qsort(c, bmap->n_ineq, sizeof(struct constraint), qsort_constraint_cmp);
6991 for (i = 0; i < bmap->n_ineq; ++i)
6992 bmap->ineq[i] = c[i].c;
6996 isl_basic_map_free(bmap);
7000 __isl_give isl_basic_set *isl_basic_set_sort_constraints(
7001 __isl_take isl_basic_set *bset)
7003 return (struct isl_basic_set *)isl_basic_map_sort_constraints(
7004 (struct isl_basic_map *)bset);
7007 struct isl_basic_map *isl_basic_map_normalize(struct isl_basic_map *bmap)
7011 if (ISL_F_ISSET(bmap, ISL_BASIC_MAP_NORMALIZED))
7013 bmap = isl_basic_map_remove_redundancies(bmap);
7014 bmap = isl_basic_map_sort_constraints(bmap);
7015 ISL_F_SET(bmap, ISL_BASIC_MAP_NORMALIZED);
7019 struct isl_basic_set *isl_basic_set_normalize(struct isl_basic_set *bset)
7021 return (struct isl_basic_set *)isl_basic_map_normalize(
7022 (struct isl_basic_map *)bset);
7025 int isl_basic_map_plain_cmp(const __isl_keep isl_basic_map *bmap1,
7026 const __isl_keep isl_basic_map *bmap2)
7033 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) !=
7034 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_RATIONAL))
7035 return ISL_F_ISSET(bmap1, ISL_BASIC_MAP_RATIONAL) ? -1 : 1;
7036 if (isl_basic_map_n_param(bmap1) != isl_basic_map_n_param(bmap2))
7037 return isl_basic_map_n_param(bmap1) - isl_basic_map_n_param(bmap2);
7038 if (isl_basic_map_n_in(bmap1) != isl_basic_map_n_in(bmap2))
7039 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7040 if (isl_basic_map_n_out(bmap1) != isl_basic_map_n_out(bmap2))
7041 return isl_basic_map_n_out(bmap1) - isl_basic_map_n_out(bmap2);
7042 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY) &&
7043 ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7045 if (ISL_F_ISSET(bmap1, ISL_BASIC_MAP_EMPTY))
7047 if (ISL_F_ISSET(bmap2, ISL_BASIC_MAP_EMPTY))
7049 if (bmap1->n_eq != bmap2->n_eq)
7050 return bmap1->n_eq - bmap2->n_eq;
7051 if (bmap1->n_ineq != bmap2->n_ineq)
7052 return bmap1->n_ineq - bmap2->n_ineq;
7053 if (bmap1->n_div != bmap2->n_div)
7054 return bmap1->n_div - bmap2->n_div;
7055 total = isl_basic_map_total_dim(bmap1);
7056 for (i = 0; i < bmap1->n_eq; ++i) {
7057 cmp = isl_seq_cmp(bmap1->eq[i], bmap2->eq[i], 1+total);
7061 for (i = 0; i < bmap1->n_ineq; ++i) {
7062 cmp = isl_seq_cmp(bmap1->ineq[i], bmap2->ineq[i], 1+total);
7066 for (i = 0; i < bmap1->n_div; ++i) {
7067 cmp = isl_seq_cmp(bmap1->div[i], bmap2->div[i], 1+1+total);
7074 int isl_basic_map_plain_is_equal(__isl_keep isl_basic_map *bmap1,
7075 __isl_keep isl_basic_map *bmap2)
7077 return isl_basic_map_plain_cmp(bmap1, bmap2) == 0;
7080 int isl_basic_set_plain_is_equal(__isl_keep isl_basic_set *bset1,
7081 __isl_keep isl_basic_set *bset2)
7083 return isl_basic_map_plain_is_equal((isl_basic_map *)bset1,
7084 (isl_basic_map *)bset2);
7087 static int qsort_bmap_cmp(const void *p1, const void *p2)
7089 const struct isl_basic_map *bmap1 = *(const struct isl_basic_map **)p1;
7090 const struct isl_basic_map *bmap2 = *(const struct isl_basic_map **)p2;
7092 return isl_basic_map_plain_cmp(bmap1, bmap2);
7095 /* We normalize in place, but if anything goes wrong we need
7096 * to return NULL, so we need to make sure we don't change the
7097 * meaning of any possible other copies of map.
7099 struct isl_map *isl_map_normalize(struct isl_map *map)
7102 struct isl_basic_map *bmap;
7106 if (ISL_F_ISSET(map, ISL_MAP_NORMALIZED))
7108 for (i = 0; i < map->n; ++i) {
7109 bmap = isl_basic_map_normalize(isl_basic_map_copy(map->p[i]));
7112 isl_basic_map_free(map->p[i]);
7115 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
7116 ISL_F_SET(map, ISL_MAP_NORMALIZED);
7117 map = isl_map_remove_empty_parts(map);
7120 for (i = map->n - 1; i >= 1; --i) {
7121 if (!isl_basic_map_plain_is_equal(map->p[i-1], map->p[i]))
7123 isl_basic_map_free(map->p[i-1]);
7124 for (j = i; j < map->n; ++j)
7125 map->p[j-1] = map->p[j];
7135 struct isl_set *isl_set_normalize(struct isl_set *set)
7137 return (struct isl_set *)isl_map_normalize((struct isl_map *)set);
7140 int isl_map_plain_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7150 if (!isl_dim_equal(map1->dim, map2->dim))
7153 map1 = isl_map_copy(map1);
7154 map2 = isl_map_copy(map2);
7155 map1 = isl_map_normalize(map1);
7156 map2 = isl_map_normalize(map2);
7159 equal = map1->n == map2->n;
7160 for (i = 0; equal && i < map1->n; ++i) {
7161 equal = isl_basic_map_plain_is_equal(map1->p[i], map2->p[i]);
7174 int isl_map_fast_is_equal(__isl_keep isl_map *map1, __isl_keep isl_map *map2)
7176 return isl_map_plain_is_equal(map1, map2);
7179 int isl_set_plain_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7181 return isl_map_plain_is_equal((struct isl_map *)set1,
7182 (struct isl_map *)set2);
7185 int isl_set_fast_is_equal(__isl_keep isl_set *set1, __isl_keep isl_set *set2)
7187 return isl_set_plain_is_equal(set1, set2);
7190 /* Return an interval that ranges from min to max (inclusive)
7192 struct isl_basic_set *isl_basic_set_interval(struct isl_ctx *ctx,
7193 isl_int min, isl_int max)
7196 struct isl_basic_set *bset = NULL;
7198 bset = isl_basic_set_alloc(ctx, 0, 1, 0, 0, 2);
7202 k = isl_basic_set_alloc_inequality(bset);
7205 isl_int_set_si(bset->ineq[k][1], 1);
7206 isl_int_neg(bset->ineq[k][0], min);
7208 k = isl_basic_set_alloc_inequality(bset);
7211 isl_int_set_si(bset->ineq[k][1], -1);
7212 isl_int_set(bset->ineq[k][0], max);
7216 isl_basic_set_free(bset);
7220 /* Return the Cartesian product of the basic sets in list (in the given order).
7222 __isl_give isl_basic_set *isl_basic_set_list_product(
7223 __isl_take struct isl_basic_set_list *list)
7231 struct isl_basic_set *product = NULL;
7235 isl_assert(list->ctx, list->n > 0, goto error);
7236 isl_assert(list->ctx, list->p[0], goto error);
7237 nparam = isl_basic_set_n_param(list->p[0]);
7238 dim = isl_basic_set_n_dim(list->p[0]);
7239 extra = list->p[0]->n_div;
7240 n_eq = list->p[0]->n_eq;
7241 n_ineq = list->p[0]->n_ineq;
7242 for (i = 1; i < list->n; ++i) {
7243 isl_assert(list->ctx, list->p[i], goto error);
7244 isl_assert(list->ctx,
7245 nparam == isl_basic_set_n_param(list->p[i]), goto error);
7246 dim += isl_basic_set_n_dim(list->p[i]);
7247 extra += list->p[i]->n_div;
7248 n_eq += list->p[i]->n_eq;
7249 n_ineq += list->p[i]->n_ineq;
7251 product = isl_basic_set_alloc(list->ctx, nparam, dim, extra,
7256 for (i = 0; i < list->n; ++i) {
7257 isl_basic_set_add_constraints(product,
7258 isl_basic_set_copy(list->p[i]), dim);
7259 dim += isl_basic_set_n_dim(list->p[i]);
7261 isl_basic_set_list_free(list);
7264 isl_basic_set_free(product);
7265 isl_basic_set_list_free(list);
7269 struct isl_basic_map *isl_basic_map_product(
7270 struct isl_basic_map *bmap1, struct isl_basic_map *bmap2)
7272 struct isl_dim *dim_result = NULL;
7273 struct isl_basic_map *bmap;
7274 unsigned in1, in2, out1, out2, nparam, total, pos;
7275 struct isl_dim_map *dim_map1, *dim_map2;
7277 if (!bmap1 || !bmap2)
7280 isl_assert(bmap1->ctx, isl_dim_match(bmap1->dim, isl_dim_param,
7281 bmap2->dim, isl_dim_param), goto error);
7282 dim_result = isl_dim_product(isl_dim_copy(bmap1->dim),
7283 isl_dim_copy(bmap2->dim));
7285 in1 = isl_basic_map_n_in(bmap1);
7286 in2 = isl_basic_map_n_in(bmap2);
7287 out1 = isl_basic_map_n_out(bmap1);
7288 out2 = isl_basic_map_n_out(bmap2);
7289 nparam = isl_basic_map_n_param(bmap1);
7291 total = nparam + in1 + in2 + out1 + out2 + bmap1->n_div + bmap2->n_div;
7292 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7293 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7294 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7295 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7296 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7297 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos += in1);
7298 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in2);
7299 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7300 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7301 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7303 bmap = isl_basic_map_alloc_dim(dim_result,
7304 bmap1->n_div + bmap2->n_div,
7305 bmap1->n_eq + bmap2->n_eq,
7306 bmap1->n_ineq + bmap2->n_ineq);
7307 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7308 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7309 bmap = isl_basic_map_simplify(bmap);
7310 return isl_basic_map_finalize(bmap);
7312 isl_basic_map_free(bmap1);
7313 isl_basic_map_free(bmap2);
7317 __isl_give isl_basic_map *isl_basic_map_flat_product(
7318 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7320 isl_basic_map *prod;
7322 prod = isl_basic_map_product(bmap1, bmap2);
7323 prod = isl_basic_map_flatten(prod);
7327 __isl_give isl_basic_set *isl_basic_set_flat_product(
7328 __isl_take isl_basic_set *bset1, __isl_take isl_basic_set *bset2)
7330 return isl_basic_map_flat_product(bset1, bset2);
7333 __isl_give isl_basic_map *isl_basic_map_range_product(
7334 __isl_take isl_basic_map *bmap1, __isl_take isl_basic_map *bmap2)
7336 isl_dim *dim_result = NULL;
7337 isl_basic_map *bmap;
7338 unsigned in, out1, out2, nparam, total, pos;
7339 struct isl_dim_map *dim_map1, *dim_map2;
7341 if (!bmap1 || !bmap2)
7344 dim_result = isl_dim_range_product(isl_dim_copy(bmap1->dim),
7345 isl_dim_copy(bmap2->dim));
7347 in = isl_basic_map_dim(bmap1, isl_dim_in);
7348 out1 = isl_basic_map_n_out(bmap1);
7349 out2 = isl_basic_map_n_out(bmap2);
7350 nparam = isl_basic_map_n_param(bmap1);
7352 total = nparam + in + out1 + out2 + bmap1->n_div + bmap2->n_div;
7353 dim_map1 = isl_dim_map_alloc(bmap1->ctx, total);
7354 dim_map2 = isl_dim_map_alloc(bmap1->ctx, total);
7355 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_param, pos = 0);
7356 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_param, pos = 0);
7357 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_in, pos += nparam);
7358 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_in, pos);
7359 isl_dim_map_dim(dim_map1, bmap1->dim, isl_dim_out, pos += in);
7360 isl_dim_map_dim(dim_map2, bmap2->dim, isl_dim_out, pos += out1);
7361 isl_dim_map_div(dim_map1, bmap1, pos += out2);
7362 isl_dim_map_div(dim_map2, bmap2, pos += bmap1->n_div);
7364 bmap = isl_basic_map_alloc_dim(dim_result,
7365 bmap1->n_div + bmap2->n_div,
7366 bmap1->n_eq + bmap2->n_eq,
7367 bmap1->n_ineq + bmap2->n_ineq);
7368 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap1, dim_map1);
7369 bmap = isl_basic_map_add_constraints_dim_map(bmap, bmap2, dim_map2);
7370 bmap = isl_basic_map_simplify(bmap);
7371 return isl_basic_map_finalize(bmap);
7373 isl_basic_map_free(bmap1);
7374 isl_basic_map_free(bmap2);
7378 static __isl_give isl_map *map_product(__isl_take isl_map *map1,
7379 __isl_take isl_map *map2,
7380 __isl_give isl_dim *(*dim_product)(__isl_take isl_dim *left,
7381 __isl_take isl_dim *right),
7382 __isl_give isl_basic_map *(*basic_map_product)(
7383 __isl_take isl_basic_map *left, __isl_take isl_basic_map *right))
7386 struct isl_map *result;
7392 isl_assert(map1->ctx, isl_dim_match(map1->dim, isl_dim_param,
7393 map2->dim, isl_dim_param), goto error);
7395 if (ISL_F_ISSET(map1, ISL_MAP_DISJOINT) &&
7396 ISL_F_ISSET(map2, ISL_MAP_DISJOINT))
7397 ISL_FL_SET(flags, ISL_MAP_DISJOINT);
7399 result = isl_map_alloc_dim(dim_product(isl_dim_copy(map1->dim),
7400 isl_dim_copy(map2->dim)),
7401 map1->n * map2->n, flags);
7404 for (i = 0; i < map1->n; ++i)
7405 for (j = 0; j < map2->n; ++j) {
7406 struct isl_basic_map *part;
7407 part = basic_map_product(isl_basic_map_copy(map1->p[i]),
7408 isl_basic_map_copy(map2->p[j]));
7409 if (isl_basic_map_is_empty(part))
7410 isl_basic_map_free(part);
7412 result = isl_map_add_basic_map(result, part);
7425 /* Given two maps A -> B and C -> D, construct a map [A -> C] -> [B -> D]
7427 struct isl_map *isl_map_product(struct isl_map *map1, struct isl_map *map2)
7429 return map_product(map1, map2, &isl_dim_product, &isl_basic_map_product);
7432 /* Given two maps A -> B and C -> D, construct a map (A, C) -> (B, D)
7434 __isl_give isl_map *isl_map_flat_product(__isl_take isl_map *map1,
7435 __isl_take isl_map *map2)
7439 prod = isl_map_product(map1, map2);
7440 prod = isl_map_flatten(prod);
7444 /* Given two set A and B, construct its Cartesian product A x B.
7446 struct isl_set *isl_set_product(struct isl_set *set1, struct isl_set *set2)
7448 return (struct isl_set *)isl_map_product((struct isl_map *)set1,
7449 (struct isl_map *)set2);
7452 __isl_give isl_set *isl_set_flat_product(__isl_take isl_set *set1,
7453 __isl_take isl_set *set2)
7455 return (isl_set *)isl_map_flat_product((isl_map *)set1, (isl_map *)set2);
7458 /* Given two maps A -> B and C -> D, construct a map (A * C) -> [B -> D]
7460 __isl_give isl_map *isl_map_range_product(__isl_take isl_map *map1,
7461 __isl_take isl_map *map2)
7463 return map_product(map1, map2, &isl_dim_range_product,
7464 &isl_basic_map_range_product);
7467 uint32_t isl_basic_map_get_hash(__isl_keep isl_basic_map *bmap)
7470 uint32_t hash = isl_hash_init();
7475 bmap = isl_basic_map_copy(bmap);
7476 bmap = isl_basic_map_normalize(bmap);
7479 total = isl_basic_map_total_dim(bmap);
7480 isl_hash_byte(hash, bmap->n_eq & 0xFF);
7481 for (i = 0; i < bmap->n_eq; ++i) {
7483 c_hash = isl_seq_get_hash(bmap->eq[i], 1 + total);
7484 isl_hash_hash(hash, c_hash);
7486 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
7487 for (i = 0; i < bmap->n_ineq; ++i) {
7489 c_hash = isl_seq_get_hash(bmap->ineq[i], 1 + total);
7490 isl_hash_hash(hash, c_hash);
7492 isl_hash_byte(hash, bmap->n_div & 0xFF);
7493 for (i = 0; i < bmap->n_div; ++i) {
7495 if (isl_int_is_zero(bmap->div[i][0]))
7497 isl_hash_byte(hash, i & 0xFF);
7498 c_hash = isl_seq_get_hash(bmap->div[i], 1 + 1 + total);
7499 isl_hash_hash(hash, c_hash);
7501 isl_basic_map_free(bmap);
7505 uint32_t isl_basic_set_get_hash(__isl_keep isl_basic_set *bset)
7507 return isl_basic_map_get_hash((isl_basic_map *)bset);
7510 uint32_t isl_map_get_hash(__isl_keep isl_map *map)
7517 map = isl_map_copy(map);
7518 map = isl_map_normalize(map);
7522 hash = isl_hash_init();
7523 for (i = 0; i < map->n; ++i) {
7525 bmap_hash = isl_basic_map_get_hash(map->p[i]);
7526 isl_hash_hash(hash, bmap_hash);
7534 uint32_t isl_set_get_hash(__isl_keep isl_set *set)
7536 return isl_map_get_hash((isl_map *)set);
7539 /* Check if the value for dimension dim is completely determined
7540 * by the values of the other parameters and variables.
7541 * That is, check if dimension dim is involved in an equality.
7543 int isl_basic_set_dim_is_unique(struct isl_basic_set *bset, unsigned dim)
7550 nparam = isl_basic_set_n_param(bset);
7551 for (i = 0; i < bset->n_eq; ++i)
7552 if (!isl_int_is_zero(bset->eq[i][1 + nparam + dim]))
7557 /* Check if the value for dimension dim is completely determined
7558 * by the values of the other parameters and variables.
7559 * That is, check if dimension dim is involved in an equality
7560 * for each of the subsets.
7562 int isl_set_dim_is_unique(struct isl_set *set, unsigned dim)
7568 for (i = 0; i < set->n; ++i) {
7570 unique = isl_basic_set_dim_is_unique(set->p[i], dim);
7577 int isl_set_n_basic_set(__isl_keep isl_set *set)
7579 return set ? set->n : 0;
7582 int isl_map_foreach_basic_map(__isl_keep isl_map *map,
7583 int (*fn)(__isl_take isl_basic_map *bmap, void *user), void *user)
7590 for (i = 0; i < map->n; ++i)
7591 if (fn(isl_basic_map_copy(map->p[i]), user) < 0)
7597 int isl_set_foreach_basic_set(__isl_keep isl_set *set,
7598 int (*fn)(__isl_take isl_basic_set *bset, void *user), void *user)
7605 for (i = 0; i < set->n; ++i)
7606 if (fn(isl_basic_set_copy(set->p[i]), user) < 0)
7612 __isl_give isl_basic_set *isl_basic_set_lift(__isl_take isl_basic_set *bset)
7614 struct isl_dim *dim;
7619 bset = isl_basic_set_cow(bset);
7623 dim = isl_basic_set_get_dim(bset);
7624 dim = isl_dim_lift(dim, bset->n_div);
7627 isl_dim_free(bset->dim);
7629 bset->extra -= bset->n_div;
7632 bset = isl_basic_set_finalize(bset);
7636 isl_basic_set_free(bset);
7640 __isl_give isl_set *isl_set_lift(__isl_take isl_set *set)
7643 struct isl_dim *dim;
7646 set = isl_set_align_divs(set);
7651 set = isl_set_cow(set);
7655 n_div = set->p[0]->n_div;
7656 dim = isl_set_get_dim(set);
7657 dim = isl_dim_lift(dim, n_div);
7660 isl_dim_free(set->dim);
7663 for (i = 0; i < set->n; ++i) {
7664 set->p[i] = isl_basic_set_lift(set->p[i]);
7675 __isl_give isl_map *isl_set_lifting(__isl_take isl_set *set)
7677 struct isl_dim *dim;
7678 struct isl_basic_map *bmap;
7685 set = isl_set_align_divs(set);
7690 dim = isl_set_get_dim(set);
7691 if (set->n == 0 || set->p[0]->n_div == 0) {
7693 return isl_map_identity(isl_dim_map_from_set(dim));
7696 n_div = set->p[0]->n_div;
7697 dim = isl_dim_map_from_set(dim);
7698 n_param = isl_dim_size(dim, isl_dim_param);
7699 n_set = isl_dim_size(dim, isl_dim_in);
7700 dim = isl_dim_extend(dim, n_param, n_set, n_set + n_div);
7701 bmap = isl_basic_map_alloc_dim(dim, 0, n_set, 2 * n_div);
7702 for (i = 0; i < n_set; ++i)
7703 bmap = var_equal(bmap, i);
7705 total = n_param + n_set + n_set + n_div;
7706 for (i = 0; i < n_div; ++i) {
7707 k = isl_basic_map_alloc_inequality(bmap);
7710 isl_seq_cpy(bmap->ineq[k], set->p[0]->div[i]+1, 1+n_param);
7711 isl_seq_clr(bmap->ineq[k]+1+n_param, n_set);
7712 isl_seq_cpy(bmap->ineq[k]+1+n_param+n_set,
7713 set->p[0]->div[i]+1+1+n_param, n_set + n_div);
7714 isl_int_neg(bmap->ineq[k][1+n_param+n_set+n_set+i],
7715 set->p[0]->div[i][0]);
7717 l = isl_basic_map_alloc_inequality(bmap);
7720 isl_seq_neg(bmap->ineq[l], bmap->ineq[k], 1 + total);
7721 isl_int_add(bmap->ineq[l][0], bmap->ineq[l][0],
7722 set->p[0]->div[i][0]);
7723 isl_int_sub_ui(bmap->ineq[l][0], bmap->ineq[l][0], 1);
7727 bmap = isl_basic_map_simplify(bmap);
7728 bmap = isl_basic_map_finalize(bmap);
7729 return isl_map_from_basic_map(bmap);
7732 isl_basic_map_free(bmap);
7736 int isl_basic_set_size(__isl_keep isl_basic_set *bset)
7744 dim = isl_basic_set_total_dim(bset);
7745 size += bset->n_eq * (1 + dim);
7746 size += bset->n_ineq * (1 + dim);
7747 size += bset->n_div * (2 + dim);
7752 int isl_set_size(__isl_keep isl_set *set)
7760 for (i = 0; i < set->n; ++i)
7761 size += isl_basic_set_size(set->p[i]);
7766 int isl_basic_map_dim_is_bounded(__isl_keep isl_basic_map *bmap,
7767 enum isl_dim_type type, unsigned pos)
7775 isl_assert(bmap->ctx, pos < isl_basic_map_dim(bmap, type), return -1);
7777 pos += isl_basic_map_offset(bmap, type);
7779 for (i = 0; i < bmap->n_eq; ++i)
7780 if (!isl_int_is_zero(bmap->eq[i][pos]))
7784 for (i = 0; i < bmap->n_ineq; ++i) {
7785 int sgn = isl_int_sgn(bmap->ineq[i][pos]);
7792 return lower && upper;
7795 int isl_map_dim_is_bounded(__isl_keep isl_map *map,
7796 enum isl_dim_type type, unsigned pos)
7803 for (i = 0; i < map->n; ++i) {
7805 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
7806 if (bounded < 0 || !bounded)
7813 /* Return 1 if the specified dim is involved in both an upper bound
7814 * and a lower bound.
7816 int isl_set_dim_is_bounded(__isl_keep isl_set *set,
7817 enum isl_dim_type type, unsigned pos)
7819 return isl_map_dim_is_bounded((isl_map *)set, type, pos);
7822 /* For each of the "n" variables starting at "first", determine
7823 * the sign of the variable and put the results in the first "n"
7824 * elements of the array "signs".
7826 * 1 means that the variable is non-negative
7827 * -1 means that the variable is non-positive
7828 * 0 means the variable attains both positive and negative values.
7830 int isl_basic_set_vars_get_sign(__isl_keep isl_basic_set *bset,
7831 unsigned first, unsigned n, int *signs)
7833 isl_vec *bound = NULL;
7834 struct isl_tab *tab = NULL;
7835 struct isl_tab_undo *snap;
7838 if (!bset || !signs)
7841 bound = isl_vec_alloc(bset->ctx, 1 + isl_basic_set_total_dim(bset));
7842 tab = isl_tab_from_basic_set(bset);
7846 isl_seq_clr(bound->el, bound->size);
7847 isl_int_set_si(bound->el[0], -1);
7849 snap = isl_tab_snap(tab);
7850 for (i = 0; i < n; ++i) {
7853 isl_int_set_si(bound->el[1 + first + i], -1);
7854 if (isl_tab_add_ineq(tab, bound->el) < 0)
7857 isl_int_set_si(bound->el[1 + first + i], 0);
7858 if (isl_tab_rollback(tab, snap) < 0)
7866 isl_int_set_si(bound->el[1 + first + i], 1);
7867 if (isl_tab_add_ineq(tab, bound->el) < 0)
7870 isl_int_set_si(bound->el[1 + first + i], 0);
7871 if (isl_tab_rollback(tab, snap) < 0)
7874 signs[i] = empty ? -1 : 0;
7878 isl_vec_free(bound);
7882 isl_vec_free(bound);
7886 int isl_basic_set_dims_get_sign(__isl_keep isl_basic_set *bset,
7887 enum isl_dim_type type, unsigned first, unsigned n, int *signs)
7889 if (!bset || !signs)
7891 isl_assert(bset->ctx, first + n <= isl_basic_set_dim(bset, type),
7894 first += pos(bset->dim, type) - 1;
7895 return isl_basic_set_vars_get_sign(bset, first, n, signs);
7898 /* Check if the given basic map is obviously single-valued.
7899 * In particular, for each output dimension, check that there is
7900 * an equality that defines the output dimension in terms of
7901 * earlier dimensions.
7903 int isl_basic_map_plain_is_single_valued(__isl_keep isl_basic_map *bmap)
7913 total = 1 + isl_basic_map_total_dim(bmap);
7914 n_out = isl_basic_map_dim(bmap, isl_dim_out);
7915 o_out = isl_basic_map_offset(bmap, isl_dim_out);
7917 for (i = 0; i < n_out; ++i) {
7918 for (j = 0; j < bmap->n_eq; ++j) {
7919 if (isl_int_is_zero(bmap->eq[j][o_out + i]))
7921 if (isl_seq_first_non_zero(bmap->eq[j] + o_out + i + 1,
7922 total - (o_out + i + 1)) == -1)
7925 if (j >= bmap->n_eq)
7932 /* Check if the given map is obviously single-valued.
7934 int isl_map_plain_is_single_valued(__isl_keep isl_map *map)
7943 return isl_basic_map_plain_is_single_valued(map->p[0]);
7946 /* Check if the given map is single-valued.
7951 * and check if the result is a subset of the identity mapping.
7953 int isl_map_is_single_valued(__isl_keep isl_map *map)
7960 sv = isl_map_plain_is_single_valued(map);
7964 test = isl_map_reverse(isl_map_copy(map));
7965 test = isl_map_apply_range(test, isl_map_copy(map));
7967 dim = isl_dim_map_from_set(isl_dim_range(isl_map_get_dim(map)));
7968 id = isl_map_identity(dim);
7970 sv = isl_map_is_subset(test, id);
7978 int isl_map_is_injective(__isl_keep isl_map *map)
7982 map = isl_map_copy(map);
7983 map = isl_map_reverse(map);
7984 in = isl_map_is_single_valued(map);
7990 /* Check if the given map is obviously injective.
7992 int isl_map_plain_is_injective(__isl_keep isl_map *map)
7996 map = isl_map_copy(map);
7997 map = isl_map_reverse(map);
7998 in = isl_map_plain_is_single_valued(map);
8004 int isl_map_is_bijective(__isl_keep isl_map *map)
8008 sv = isl_map_is_single_valued(map);
8012 return isl_map_is_injective(map);
8015 int isl_set_is_singleton(__isl_keep isl_set *set)
8017 return isl_map_is_single_valued((isl_map *)set);
8020 int isl_map_is_translation(__isl_keep isl_map *map)
8025 delta = isl_map_deltas(isl_map_copy(map));
8026 ok = isl_set_is_singleton(delta);
8027 isl_set_free(delta);
8032 static int unique(isl_int *p, unsigned pos, unsigned len)
8034 if (isl_seq_first_non_zero(p, pos) != -1)
8036 if (isl_seq_first_non_zero(p + pos + 1, len - pos - 1) != -1)
8041 int isl_basic_set_is_box(__isl_keep isl_basic_set *bset)
8050 if (isl_basic_set_dim(bset, isl_dim_div) != 0)
8053 nvar = isl_basic_set_dim(bset, isl_dim_set);
8054 ovar = isl_dim_offset(bset->dim, isl_dim_set);
8055 for (j = 0; j < nvar; ++j) {
8056 int lower = 0, upper = 0;
8057 for (i = 0; i < bset->n_eq; ++i) {
8058 if (isl_int_is_zero(bset->eq[i][1 + ovar + j]))
8060 if (!unique(bset->eq[i] + 1 + ovar, j, nvar))
8066 for (i = 0; i < bset->n_ineq; ++i) {
8067 if (isl_int_is_zero(bset->ineq[i][1 + ovar + j]))
8069 if (!unique(bset->ineq[i] + 1 + ovar, j, nvar))
8071 if (isl_int_is_pos(bset->ineq[i][1 + ovar + j]))
8076 if (!lower || !upper)
8083 int isl_set_is_box(__isl_keep isl_set *set)
8090 return isl_basic_set_is_box(set->p[0]);
8093 int isl_basic_set_is_wrapping(__isl_keep isl_basic_set *bset)
8098 return isl_dim_is_wrapping(bset->dim);
8101 int isl_set_is_wrapping(__isl_keep isl_set *set)
8106 return isl_dim_is_wrapping(set->dim);
8109 __isl_give isl_basic_set *isl_basic_map_wrap(__isl_take isl_basic_map *bmap)
8111 bmap = isl_basic_map_cow(bmap);
8115 bmap->dim = isl_dim_wrap(bmap->dim);
8119 bmap = isl_basic_map_finalize(bmap);
8121 return (isl_basic_set *)bmap;
8123 isl_basic_map_free(bmap);
8127 __isl_give isl_set *isl_map_wrap(__isl_take isl_map *map)
8131 map = isl_map_cow(map);
8135 for (i = 0; i < map->n; ++i) {
8136 map->p[i] = (isl_basic_map *)isl_basic_map_wrap(map->p[i]);
8140 map->dim = isl_dim_wrap(map->dim);
8144 return (isl_set *)map;
8150 __isl_give isl_basic_map *isl_basic_set_unwrap(__isl_take isl_basic_set *bset)
8152 bset = isl_basic_set_cow(bset);
8156 bset->dim = isl_dim_unwrap(bset->dim);
8160 bset = isl_basic_set_finalize(bset);
8162 return (isl_basic_map *)bset;
8164 isl_basic_set_free(bset);
8168 __isl_give isl_map *isl_set_unwrap(__isl_take isl_set *set)
8175 if (!isl_set_is_wrapping(set))
8176 isl_die(set->ctx, isl_error_invalid, "not a wrapping set",
8179 set = isl_set_cow(set);
8183 for (i = 0; i < set->n; ++i) {
8184 set->p[i] = (isl_basic_set *)isl_basic_set_unwrap(set->p[i]);
8189 set->dim = isl_dim_unwrap(set->dim);
8193 return (isl_map *)set;
8199 __isl_give isl_basic_map *isl_basic_map_reset(__isl_take isl_basic_map *bmap,
8200 enum isl_dim_type type)
8205 if (!isl_dim_is_named_or_nested(bmap->dim, type))
8208 bmap = isl_basic_map_cow(bmap);
8212 bmap->dim = isl_dim_reset(bmap->dim, type);
8216 bmap = isl_basic_map_finalize(bmap);
8220 isl_basic_map_free(bmap);
8224 __isl_give isl_map *isl_map_reset(__isl_take isl_map *map,
8225 enum isl_dim_type type)
8232 if (!isl_dim_is_named_or_nested(map->dim, type))
8235 map = isl_map_cow(map);
8239 for (i = 0; i < map->n; ++i) {
8240 map->p[i] = isl_basic_map_reset(map->p[i], type);
8244 map->dim = isl_dim_reset(map->dim, type);
8254 __isl_give isl_basic_map *isl_basic_map_flatten(__isl_take isl_basic_map *bmap)
8259 if (!bmap->dim->nested[0] && !bmap->dim->nested[1])
8262 bmap = isl_basic_map_cow(bmap);
8266 bmap->dim = isl_dim_flatten(bmap->dim);
8270 bmap = isl_basic_map_finalize(bmap);
8274 isl_basic_map_free(bmap);
8278 __isl_give isl_basic_set *isl_basic_set_flatten(__isl_take isl_basic_set *bset)
8280 return (isl_basic_set *)isl_basic_map_flatten((isl_basic_map *)bset);
8283 __isl_give isl_map *isl_map_flatten(__isl_take isl_map *map)
8290 if (!map->dim->nested[0] && !map->dim->nested[1])
8293 map = isl_map_cow(map);
8297 for (i = 0; i < map->n; ++i) {
8298 map->p[i] = isl_basic_map_flatten(map->p[i]);
8302 map->dim = isl_dim_flatten(map->dim);
8312 __isl_give isl_set *isl_set_flatten(__isl_take isl_set *set)
8314 return (isl_set *)isl_map_flatten((isl_map *)set);
8317 __isl_give isl_map *isl_set_flatten_map(__isl_take isl_set *set)
8319 isl_dim *dim, *flat_dim;
8322 dim = isl_set_get_dim(set);
8323 flat_dim = isl_dim_flatten(isl_dim_copy(dim));
8324 map = isl_map_identity(isl_dim_join(isl_dim_reverse(dim), flat_dim));
8325 map = isl_map_intersect_domain(map, set);
8330 /* Reorder the dimensions of "bmap" according to the given dim_map
8331 * and set the dimension specification to "dim".
8333 __isl_give isl_basic_map *isl_basic_map_realign(__isl_take isl_basic_map *bmap,
8334 __isl_take isl_dim *dim, __isl_take struct isl_dim_map *dim_map)
8338 bmap = isl_basic_map_cow(bmap);
8339 if (!bmap || !dim || !dim_map)
8342 res = isl_basic_map_alloc_dim(dim,
8343 bmap->n_div, bmap->n_eq, bmap->n_ineq);
8344 res = isl_basic_map_add_constraints_dim_map(res, bmap, dim_map);
8345 res = isl_basic_map_finalize(res);
8349 isl_basic_map_free(bmap);
8354 /* Reorder the dimensions of "map" according to given reordering.
8356 __isl_give isl_map *isl_map_realign(__isl_take isl_map *map,
8357 __isl_take isl_reordering *r)
8360 struct isl_dim_map *dim_map;
8362 map = isl_map_cow(map);
8363 dim_map = isl_dim_map_from_reordering(r);
8364 if (!map || !r || !dim_map)
8367 for (i = 0; i < map->n; ++i) {
8368 struct isl_dim_map *dim_map_i;
8370 dim_map_i = isl_dim_map_extend(dim_map, map->p[i]);
8372 map->p[i] = isl_basic_map_realign(map->p[i],
8373 isl_dim_copy(r->dim), dim_map_i);
8379 map = isl_map_reset_dim(map, isl_dim_copy(r->dim));
8381 isl_reordering_free(r);
8387 isl_reordering_free(r);
8391 __isl_give isl_set *isl_set_realign(__isl_take isl_set *set,
8392 __isl_take isl_reordering *r)
8394 return (isl_set *)isl_map_realign((isl_map *)set, r);
8397 __isl_give isl_map *isl_map_align_params(__isl_take isl_map *map,
8398 __isl_take isl_dim *model)
8405 ctx = isl_dim_get_ctx(model);
8406 if (!isl_dim_has_named_params(model))
8407 isl_die(ctx, isl_error_invalid,
8408 "model has unnamed parameters", goto error);
8409 if (!isl_dim_has_named_params(map->dim))
8410 isl_die(ctx, isl_error_invalid,
8411 "relation has unnamed parameters", goto error);
8412 if (!isl_dim_match(map->dim, isl_dim_param, model, isl_dim_param)) {
8413 isl_reordering *exp;
8415 model = isl_dim_drop(model, isl_dim_in,
8416 0, isl_dim_size(model, isl_dim_in));
8417 model = isl_dim_drop(model, isl_dim_out,
8418 0, isl_dim_size(model, isl_dim_out));
8419 exp = isl_parameter_alignment_reordering(map->dim, model);
8420 exp = isl_reordering_extend_dim(exp, isl_map_get_dim(map));
8421 map = isl_map_realign(map, exp);
8424 isl_dim_free(model);
8427 isl_dim_free(model);
8432 __isl_give isl_set *isl_set_align_params(__isl_take isl_set *set,
8433 __isl_take isl_dim *model)
8435 return isl_map_align_params(set, model);
8438 __isl_give isl_mat *isl_basic_map_equalities_matrix(
8439 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8440 enum isl_dim_type c2, enum isl_dim_type c3,
8441 enum isl_dim_type c4, enum isl_dim_type c5)
8443 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8444 struct isl_mat *mat;
8450 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
8451 isl_basic_map_total_dim(bmap) + 1);
8454 for (i = 0; i < bmap->n_eq; ++i)
8455 for (j = 0, pos = 0; j < 5; ++j) {
8456 int off = isl_basic_map_offset(bmap, c[j]);
8457 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8458 isl_int_set(mat->row[i][pos],
8459 bmap->eq[i][off + k]);
8467 __isl_give isl_mat *isl_basic_map_inequalities_matrix(
8468 __isl_keep isl_basic_map *bmap, enum isl_dim_type c1,
8469 enum isl_dim_type c2, enum isl_dim_type c3,
8470 enum isl_dim_type c4, enum isl_dim_type c5)
8472 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8473 struct isl_mat *mat;
8479 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
8480 isl_basic_map_total_dim(bmap) + 1);
8483 for (i = 0; i < bmap->n_ineq; ++i)
8484 for (j = 0, pos = 0; j < 5; ++j) {
8485 int off = isl_basic_map_offset(bmap, c[j]);
8486 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8487 isl_int_set(mat->row[i][pos],
8488 bmap->ineq[i][off + k]);
8496 __isl_give isl_basic_map *isl_basic_map_from_constraint_matrices(
8497 __isl_take isl_dim *dim,
8498 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8499 enum isl_dim_type c2, enum isl_dim_type c3,
8500 enum isl_dim_type c4, enum isl_dim_type c5)
8502 enum isl_dim_type c[5] = { c1, c2, c3, c4, c5 };
8503 isl_basic_map *bmap;
8509 if (!dim || !eq || !ineq)
8512 if (eq->n_col != ineq->n_col)
8513 isl_die(dim->ctx, isl_error_invalid,
8514 "equalities and inequalities matrices should have "
8515 "same number of columns", goto error);
8517 total = 1 + isl_dim_total(dim);
8519 if (eq->n_col < total)
8520 isl_die(dim->ctx, isl_error_invalid,
8521 "number of columns too small", goto error);
8523 extra = eq->n_col - total;
8525 bmap = isl_basic_map_alloc_dim(isl_dim_copy(dim), extra,
8526 eq->n_row, ineq->n_row);
8529 for (i = 0; i < extra; ++i) {
8530 k = isl_basic_map_alloc_div(bmap);
8533 isl_int_set_si(bmap->div[k][0], 0);
8535 for (i = 0; i < eq->n_row; ++i) {
8536 l = isl_basic_map_alloc_equality(bmap);
8539 for (j = 0, pos = 0; j < 5; ++j) {
8540 int off = isl_basic_map_offset(bmap, c[j]);
8541 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8542 isl_int_set(bmap->eq[l][off + k],
8548 for (i = 0; i < ineq->n_row; ++i) {
8549 l = isl_basic_map_alloc_inequality(bmap);
8552 for (j = 0, pos = 0; j < 5; ++j) {
8553 int off = isl_basic_map_offset(bmap, c[j]);
8554 for (k = 0; k < isl_basic_map_dim(bmap, c[j]); ++k) {
8555 isl_int_set(bmap->ineq[l][off + k],
8574 __isl_give isl_mat *isl_basic_set_equalities_matrix(
8575 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8576 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8578 return isl_basic_map_equalities_matrix((isl_basic_map *)bset,
8579 c1, c2, c3, c4, isl_dim_in);
8582 __isl_give isl_mat *isl_basic_set_inequalities_matrix(
8583 __isl_keep isl_basic_set *bset, enum isl_dim_type c1,
8584 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8586 return isl_basic_map_inequalities_matrix((isl_basic_map *)bset,
8587 c1, c2, c3, c4, isl_dim_in);
8590 __isl_give isl_basic_set *isl_basic_set_from_constraint_matrices(
8591 __isl_take isl_dim *dim,
8592 __isl_take isl_mat *eq, __isl_take isl_mat *ineq, enum isl_dim_type c1,
8593 enum isl_dim_type c2, enum isl_dim_type c3, enum isl_dim_type c4)
8595 return (isl_basic_set*)
8596 isl_basic_map_from_constraint_matrices(dim, eq, ineq,
8597 c1, c2, c3, c4, isl_dim_in);
8600 int isl_basic_map_can_zip(__isl_keep isl_basic_map *bmap)
8605 return isl_dim_can_zip(bmap->dim);
8608 int isl_map_can_zip(__isl_keep isl_map *map)
8613 return isl_dim_can_zip(map->dim);
8616 /* Given a basic map (A -> B) -> (C -> D), return the corresponding basic map
8617 * (A -> C) -> (B -> D).
8619 __isl_give isl_basic_map *isl_basic_map_zip(__isl_take isl_basic_map *bmap)
8628 if (!isl_basic_map_can_zip(bmap))
8629 isl_die(bmap->ctx, isl_error_invalid,
8630 "basic map cannot be zipped", goto error);
8631 pos = isl_basic_map_offset(bmap, isl_dim_in) +
8632 isl_dim_size(bmap->dim->nested[0], isl_dim_in);
8633 n1 = isl_dim_size(bmap->dim->nested[0], isl_dim_out);
8634 n2 = isl_dim_size(bmap->dim->nested[1], isl_dim_in);
8635 bmap = isl_basic_map_swap_vars(bmap, pos, n1, n2);
8638 bmap->dim = isl_dim_zip(bmap->dim);
8643 isl_basic_map_free(bmap);
8647 /* Given a map (A -> B) -> (C -> D), return the corresponding map
8648 * (A -> C) -> (B -> D).
8650 __isl_give isl_map *isl_map_zip(__isl_take isl_map *map)
8657 if (!isl_map_can_zip(map))
8658 isl_die(map->ctx, isl_error_invalid, "map cannot be zipped",
8661 map = isl_map_cow(map);
8665 for (i = 0; i < map->n; ++i) {
8666 map->p[i] = isl_basic_map_zip(map->p[i]);
8671 map->dim = isl_dim_zip(map->dim);